Lines Matching refs:node
72 int32_t node;
73 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
74 valueResult(node) : USTRINGTRIE_NO_VALUE;
102 int32_t node=*pos;
103 U_ASSERT(node>=kMinValueLead);
104 if(node&kValueIsFinal) {
110 // int32_t delta=readValue(pos, node>>1);
111 node>>=1;
113 if(node<kMinTwoByteValueLead) {
114 delta=node-kMinOneByteValueLead;
115 } else if(node<kMinThreeByteValueLead) {
116 delta=((node-kMinTwoByteValueLead)<<8)|*pos++;
117 } else if(node<kFourByteValueLead) {
118 delta=((node-kMinThreeByteValueLead)<<16)|(pos[0]<<8)|pos[1];
120 } else if(node==kFourByteValueLead) {
129 node=*pos;
130 result= node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE;
140 int32_t node=*pos;
141 return node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE;
151 int32_t node=*pos++;
152 if(node<kMinLinearMatch) {
153 return branchNext(pos, node, inByte);
154 } else if(node<kMinValueLead) {
156 int32_t length=node-kMinLinearMatch; // Actual match length minus 1.
160 return (length<0 && (node=*pos)>=kMinValueLead) ?
161 valueResult(node) : USTRINGTRIE_NO_VALUE;
166 } else if(node&kValueIsFinal) {
171 pos=skipValue(pos, node);
172 // The next node must not also be a value node.
191 // Remaining part of a linear-match node.
195 int32_t node;
196 return (length<0 && (node=*pos)>=kMinValueLead) ?
197 valueResult(node) : USTRINGTRIE_NO_VALUE;
219 // Continue a linear-match node without rechecking sLength<0.
226 int32_t node;
227 return (length<0 && (node=*pos)>=kMinValueLead) ?
228 valueResult(node) : USTRINGTRIE_NO_VALUE;
246 int32_t node;
247 return (length<0 && (node=*pos)>=kMinValueLead) ?
248 valueResult(node) : USTRINGTRIE_NO_VALUE;
265 int32_t node=*pos++;
266 if(node<kMinLinearMatch) {
267 UStringTrieResult result=branchNext(pos, node, inByte);
289 } else if(node<kMinValueLead) {
291 length=node-kMinLinearMatch; // Actual match length minus 1.
299 } else if(node&kValueIsFinal) {
305 pos=skipValue(pos, node);
306 // The next node must not also be a value node.
327 int32_t node=*pos++;
328 UBool isFinal=(UBool)(node&kValueIsFinal);
329 int32_t value=readValue(pos, node>>1);
330 pos=skipValue(pos, node);
353 int32_t node=*pos++;
354 if(node<kMinLinearMatch) {
355 if(node==0) {
356 node=*pos++;
358 pos=findUniqueValueFromBranch(pos, node+1, haveUniqueValue, uniqueValue);
363 } else if(node<kMinValueLead) {
364 // linear-match node
365 pos+=node-kMinLinearMatch+1; // Ignore the match bytes.
367 UBool isFinal=(UBool)(node&kValueIsFinal);
368 int32_t value=readValue(pos, node>>1);
380 pos=skipValue(pos, node);
392 append(out, *pos); // Next byte of a pending linear-match node.
395 int32_t node=*pos++;
396 if(node>=kMinValueLead) {
397 if(node&kValueIsFinal) {
400 pos=skipValue(pos, node);
401 node=*pos++;
402 U_ASSERT(node<kMinValueLead);
405 if(node<kMinLinearMatch) {
406 if(node==0) {
407 node=*pos++;
409 getNextBranchBytes(pos, ++node, out);
410 return node;
412 // First byte of the linear-match node.
