Lines Matching refs:node
74 int32_t node;
75 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
76 valueResult(node) : USTRINGTRIE_NO_VALUE;
104 int32_t node=*pos;
105 U_ASSERT(node>=kMinValueLead);
106 if(node&kValueIsFinal) {
112 // int32_t delta=readValue(pos, node>>1);
113 node>>=1;
115 if(node<kMinTwoByteValueLead) {
116 delta=node-kMinOneByteValueLead;
117 } else if(node<kMinThreeByteValueLead) {
118 delta=((node-kMinTwoByteValueLead)<<8)|*pos++;
119 } else if(node<kFourByteValueLead) {
120 delta=((node-kMinThreeByteValueLead)<<16)|(pos[0]<<8)|pos[1];
122 } else if(node==kFourByteValueLead) {
131 node=*pos;
132 result= node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE;
142 int32_t node=*pos;
143 return node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE;
153 int32_t node=*pos++;
154 if(node<kMinLinearMatch) {
155 return branchNext(pos, node, inByte);
156 } else if(node<kMinValueLead) {
158 int32_t length=node-kMinLinearMatch; // Actual match length minus 1.
162 return (length<0 && (node=*pos)>=kMinValueLead) ?
163 valueResult(node) : USTRINGTRIE_NO_VALUE;
168 } else if(node&kValueIsFinal) {
173 pos=skipValue(pos, node);
174 // The next node must not also be a value node.
193 // Remaining part of a linear-match node.
197 int32_t node;
198 return (length<0 && (node=*pos)>=kMinValueLead) ?
199 valueResult(node) : USTRINGTRIE_NO_VALUE;
221 // Continue a linear-match node without rechecking sLength<0.
228 int32_t node;
229 return (length<0 && (node=*pos)>=kMinValueLead) ?
230 valueResult(node) : USTRINGTRIE_NO_VALUE;
248 int32_t node;
249 return (length<0 && (node=*pos)>=kMinValueLead) ?
250 valueResult(node) : USTRINGTRIE_NO_VALUE;
267 int32_t node=*pos++;
268 if(node<kMinLinearMatch) {
269 UStringTrieResult result=branchNext(pos, node, inByte);
291 } else if(node<kMinValueLead) {
293 length=node-kMinLinearMatch; // Actual match length minus 1.
301 } else if(node&kValueIsFinal) {
307 pos=skipValue(pos, node);
308 // The next node must not also be a value node.
329 int32_t node=*pos++;
330 UBool isFinal=(UBool)(node&kValueIsFinal);
331 int32_t value=readValue(pos, node>>1);
332 pos=skipValue(pos, node);
355 int32_t node=*pos++;
356 if(node<kMinLinearMatch) {
357 if(node==0) {
358 node=*pos++;
360 pos=findUniqueValueFromBranch(pos, node+1, haveUniqueValue, uniqueValue);
365 } else if(node<kMinValueLead) {
366 // linear-match node
367 pos+=node-kMinLinearMatch+1; // Ignore the match bytes.
369 UBool isFinal=(UBool)(node&kValueIsFinal);
370 int32_t value=readValue(pos, node>>1);
382 pos=skipValue(pos, node);
394 append(out, *pos); // Next byte of a pending linear-match node.
397 int32_t node=*pos++;
398 if(node>=kMinValueLead) {
399 if(node&kValueIsFinal) {
402 pos=skipValue(pos, node);
403 node=*pos++;
404 U_ASSERT(node<kMinValueLead);
407 if(node<kMinLinearMatch) {
408 if(node==0) {
409 node=*pos++;
411 getNextBranchBytes(pos, ++node, out);
412 return node;
414 // First byte of the linear-match node.
