Lines Matching refs:length
79 BytesTrie::branchNext(const uint8_t *pos, int32_t length, int32_t inByte) {
81 if(length==0) {
82 length=*pos++;
84 ++length;
85 // The length of the branch is the number of bytes to select from.
87 while(length>kMaxBranchLinearSubNodeLength) {
89 length>>=1;
92 length=length-(length>>1);
97 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
98 // and divides length by 2.
135 --length;
137 } while(length>1);
155 // Match the first of length+1 bytes.
156 int32_t length=node-kMinLinearMatch; // Actual match length minus 1.
158 remainingMatchLength_=--length;
160 return (length<0 && (node=*pos)>=kMinValueLead) ?
189 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
190 if(length>=0) {
193 remainingMatchLength_=--length;
196 return (length<0 && (node=*pos)>=kMinValueLead) ?
216 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
224 remainingMatchLength_=length;
227 return (length<0 && (node=*pos)>=kMinValueLead) ?
230 if(length<0) {
231 remainingMatchLength_=length;
239 --length;
244 remainingMatchLength_=length;
247 return (length<0 && (node=*pos)>=kMinValueLead) ?
252 if(length<0) {
253 remainingMatchLength_=length;
261 --length;
290 // Match length+1 bytes.
291 length=node-kMinLinearMatch; // Actual match length minus 1.
297 --length;
314 BytesTrie::findUniqueValueFromBranch(const uint8_t *pos, int32_t length,
316 while(length>kMaxBranchLinearSubNodeLength) {
318 if(NULL==findUniqueValueFromBranch(jumpByDelta(pos), length>>1, haveUniqueValue, uniqueValue)) {
321 length=length-(length>>1);
346 } while(--length>1);
419 BytesTrie::getNextBranchBytes(const uint8_t *pos, int32_t length, ByteSink &out) {
420 while(length>kMaxBranchLinearSubNodeLength) {
422 getNextBranchBytes(jumpByDelta(pos), length>>1, out);
423 length=length-(length>>1);
429 } while(--length>1);