1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.tomcat.util.buf;
import java.io.Serial;
import java.io.Serializable;
import org.apache.tomcat.util.res.StringManager;
/**
* Base class for the *Chunk implementation to reduce duplication.
*/
public abstract class AbstractChunk implements Cloneable, Serializable {
@Serial
private static final long serialVersionUID = 1L;
protected static final StringManager sm = StringManager.getManager(AbstractChunk.class);
/*
* JVMs may limit the maximum array size to slightly less than Integer.MAX_VALUE. On markt's desktop the limit is
* MAX_VALUE - 2. Comments in the JRE source code for ArrayList and other classes indicate that it may be as low as
* MAX_VALUE - 8 on some systems.
*/
public static final int ARRAY_MAX_SIZE = Integer.MAX_VALUE - 8;
private int hashCode = 0;
protected boolean hasHashCode = false;
protected boolean isSet;
private int limit = -1;
protected int start;
protected int end;
/**
* Maximum amount of data in this buffer. If -1 or not set, the buffer will grow to {{@link #ARRAY_MAX_SIZE}. Can be
* smaller than the current buffer size ( which will not shrink ). When the limit is reached, the buffer will be
* flushed (if out is set) or throw exception.
*
* @param limit The new limit
*/
public void setLimit(int limit) {
this.limit = limit;
}
/**
* @return the maximum amount of data in the buffer, and -1 if it has not been set
*/
public int getLimit() {
return limit;
}
protected int getLimitInternal() {
if (limit > 0) {
return limit;
} else {
return ARRAY_MAX_SIZE;
}
}
/**
* @return the start position of the data in the buffer
*/
public int getStart() {
return start;
}
/**
* Set the start position of the data in the buffer.
*
* @param start the new start position
*/
public void setStart(int start) {
if (end < start) {
end = start;
}
this.start = start;
}
/**
* @return the end position of the data in the buffer
*/
public int getEnd() {
return end;
}
/**
* Set the end position of the data in the buffer.
*
* @param end the new end position
*/
public void setEnd(int end) {
this.end = end;
}
/**
* @return start
*
* @deprecated Unused. This method will be removed in Tomcat 12.
*/
@Deprecated
public int getOffset() {
return start;
}
/**
* Set start.
*
* @param off the new start
*
* @deprecated Unused. This method will be removed in Tomcat 12.
*/
@Deprecated
public void setOffset(int off) {
if (end < off) {
end = off;
}
start = off;
}
/**
* @return the length of the data in the buffer
*/
public int getLength() {
return end - start;
}
/**
* @return {@code true} if the buffer contains no data
*/
public boolean isNull() {
if (end > 0) {
return false;
}
return !isSet;
}
/**
* Return the index of the first occurrence of the subsequence of the given String, or -1 if it is not found.
*
* @param src the String to look for
* @param srcStart the subsequence start in the String
* @param srcLen the subsequence length in the String
* @param myOffset the index on which to start the search in the buffer
*
* @return the position of the first character of the first occurrence of the subsequence in the buffer, or -1 if
* not found
*/
public int indexOf(String src, int srcStart, int srcLen, int myOffset) {
char first = src.charAt(srcStart);
// Look for first char
int srcEnd = srcStart + srcLen;
mainLoop:
for (int i = myOffset + start; i <= (end - srcLen); i++) {
if (getBufferElement(i) != first) {
continue;
}
// found first char, now look for a match
int myPos = i + 1;
for (int srcPos = srcStart + 1; srcPos < srcEnd;) {
if (getBufferElement(myPos++) != src.charAt(srcPos++)) {
continue mainLoop;
}
}
return i - start; // found it
}
return -1;
}
/**
* Resets the chunk to an uninitialized state.
*/
public void recycle() {
hasHashCode = false;
isSet = false;
start = 0;
end = 0;
}
@Override
public int hashCode() {
if (hasHashCode) {
return hashCode;
}
int code = hash();
hashCode = code;
hasHashCode = true;
return code;
}
/**
* @return the hash code for this buffer
*/
public int hash() {
int code = 0;
for (int i = start; i < end; i++) {
code = code * 37 + getBufferElement(i);
}
return code;
}
/**
* @param index the element location in the buffer
*
* @return the element
*/
protected abstract int getBufferElement(int index);
}
|