Lines Matching defs:length
81 BytesTrie::branchNext(const uint8_t *pos, int32_t length, int32_t inByte) {
83 if(length==0) {
84 length=*pos++;
86 ++length;
87 // The length of the branch is the number of bytes to select from.
89 while(length>kMaxBranchLinearSubNodeLength) {
91 length>>=1;
94 length=length-(length>>1);
99 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
100 // and divides length by 2.
137 --length;
139 } while(length>1);
157 // Match the first of length+1 bytes.
158 int32_t length=node-kMinLinearMatch; // Actual match length minus 1.
160 remainingMatchLength_=--length;
162 return (length<0 && (node=*pos)>=kMinValueLead) ?
191 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
192 if(length>=0) {
195 remainingMatchLength_=--length;
198 return (length<0 && (node=*pos)>=kMinValueLead) ?
218 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
226 remainingMatchLength_=length;
229 return (length<0 && (node=*pos)>=kMinValueLead) ?
232 if(length<0) {
233 remainingMatchLength_=length;
241 --length;
246 remainingMatchLength_=length;
249 return (length<0 && (node=*pos)>=kMinValueLead) ?
254 if(length<0) {
255 remainingMatchLength_=length;
263 --length;
292 // Match length+1 bytes.
293 length=node-kMinLinearMatch; // Actual match length minus 1.
299 --length;
316 BytesTrie::findUniqueValueFromBranch(const uint8_t *pos, int32_t length,
318 while(length>kMaxBranchLinearSubNodeLength) {
320 if(nullptr==findUniqueValueFromBranch(jumpByDelta(pos), length>>1, haveUniqueValue, uniqueValue)) {
323 length=length-(length>>1);
348 } while(--length>1);
421 BytesTrie::getNextBranchBytes(const uint8_t *pos, int32_t length, ByteSink &out) {
422 while(length>kMaxBranchLinearSubNodeLength) {
424 getNextBranchBytes(jumpByDelta(pos), length>>1, out);
425 length=length-(length>>1);
431 } while(--length>1);