Home
last modified time | relevance | path

Searched refs:nextNode (Results 1 - 25 of 40) sorted by relevance

12

/third_party/icu/icu4c/source/tools/ctestfw/
H A Dctest.c227 TestNode *nextNode, *curNode; in addTestNode() local
239 nextNode = curNode->child; in addTestNode()
245 /* if nextNode is already null, then curNode has no children in addTestNode()
247 if( nextNode == NULL ) in addTestNode()
267 while (strncmp_nullcheck ( name, nextNode->name, nameLen) != 0 ) in addTestNode()
269 curNode = nextNode; in addTestNode()
270 nextNode = nextNode -> sibling; in addTestNode()
272 if ( nextNode == NULL ) in addTestNode()
275 nextNode in addTestNode()
581 TestNode *nextNode; getTest() local
[all...]
/third_party/skia/third_party/externals/icu/source/tools/ctestfw/
H A Dctest.c225 TestNode *nextNode, *curNode; in addTestNode() local
237 nextNode = curNode->child; in addTestNode()
243 /* if nextNode is already null, then curNode has no children in addTestNode()
245 if( nextNode == NULL ) in addTestNode()
265 while (strncmp_nullcheck ( name, nextNode->name, nameLen) != 0 ) in addTestNode()
267 curNode = nextNode; in addTestNode()
268 nextNode = nextNode -> sibling; in addTestNode()
270 if ( nextNode == NULL ) in addTestNode()
273 nextNode in addTestNode()
579 TestNode *nextNode; getTest() local
[all...]
/third_party/icu/icu4c/source/common/unicode/
H A Dstringtriebuilder.h300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode() argument
301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode() argument
318 : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)), in LinearMatchNode()
319 length(len), next(nextNode) {} in LinearMatchNode()
408 Node *nextNode) const = 0;
H A Dbytestriebuilder.h158 BTLinearMatchNode(const char *units, int32_t len, Node *nextNode);
166 Node *nextNode) const override;
H A Ducharstriebuilder.h159 UCTLinearMatchNode(const char16_t *units, int32_t len, Node *nextNode);
167 Node *nextNode) const override;
/third_party/node/deps/icu-small/source/common/unicode/
H A Dstringtriebuilder.h300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode() argument
301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode() argument
318 : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)), in LinearMatchNode()
319 length(len), next(nextNode) {} in LinearMatchNode()
408 Node *nextNode) const = 0;
H A Dbytestriebuilder.h158 BTLinearMatchNode(const char *units, int32_t len, Node *nextNode);
166 Node *nextNode) const override;
H A Ducharstriebuilder.h159 UCTLinearMatchNode(const char16_t *units, int32_t len, Node *nextNode);
167 Node *nextNode) const override;
/third_party/skia/third_party/externals/icu/source/common/unicode/
H A Dstringtriebuilder.h300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode() argument
301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode() argument
318 : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)), in LinearMatchNode()
319 length(len), next(nextNode) {} in LinearMatchNode()
408 Node *nextNode) const = 0;
H A Dbytestriebuilder.h158 BTLinearMatchNode(const char *units, int32_t len, Node *nextNode);
166 Node *nextNode) const;
H A Ducharstriebuilder.h159 UCTLinearMatchNode(const char16_t *units, int32_t len, Node *nextNode);
167 Node *nextNode) const;
/third_party/lzma/CPP/7zip/UI/Common/
H A DEnumDirItems.cpp695 const NWildcard::CCensorNode *nextNode = NULL; in EnumerateForItem() local
702 nextNode = &curNode.SubNodes[(unsigned)index]; in EnumerateForItem()
707 if (!nextNode) in EnumerateForItem()
731 nextNode = &curNode; in EnumerateForItem()
735 *nextNode, phyParent, logParent, fi.Name, in EnumerateForItem()
737 newParts, // relative to (*nextNode). (*nextNode + newParts) includes (fi.Name) in EnumerateForItem()
957 const NWildcard::CCensorNode *nextNode = NULL; in EnumerateDirItems() local
964 nextNode = &curNode.SubNodes[(unsigned)index]; in EnumerateDirItems()
986 nextNode in EnumerateDirItems()
999 const NWildcard::CCensorNode &nextNode = curNode.SubNodes[i]; EnumerateDirItems() local
1621 NWildcard::CCensorNode &nextNode = node.SubNodes[i]; ConvertToLongNames() local
[all...]
/third_party/mesa3d/src/gallium/auxiliary/cso_cache/
H A Dcso_hash.h162 struct cso_node **nextNode = cso_hash_find_node(hash, key); in cso_hash_find() local
163 struct cso_hash_iter iter = {hash, *nextNode}; in cso_hash_find()
/third_party/icu/icu4c/source/common/
H A Dbytestriebuilder.cpp340 BytesTrieBuilder::BTLinearMatchNode::BTLinearMatchNode(const char *bytes, int32_t len, Node *nextNode) in BTLinearMatchNode() argument
341 : LinearMatchNode(len, nextNode), s(bytes) { in BTLinearMatchNode()
368 Node *nextNode) const { in createLinearMatchNode()
372 nextNode); in createLinearMatchNode()
H A Ducharstriebuilder.cpp288 UCharsTrieBuilder::UCTLinearMatchNode::UCTLinearMatchNode(const UChar *units, int32_t len, Node *nextNode) in UCTLinearMatchNode() argument
289 : LinearMatchNode(len, nextNode), s(units) { in UCTLinearMatchNode()
315 Node *nextNode) const { in createLinearMatchNode()
319 nextNode); in createLinearMatchNode()
H A Dstringtriebuilder.cpp229 Node *nextNode=makeNode(start, limit, lastUnitIndex, errorCode); in makeNode() local
236 node=createLinearMatchNode(start, lastUnitIndex, maxLinearMatchLength, nextNode); in makeNode()
237 nextNode=registerNode(node, errorCode); in makeNode()
239 node=createLinearMatchNode(start, unitIndex, length, nextNode); in makeNode()
/third_party/node/deps/icu-small/source/common/
H A Dbytestriebuilder.cpp340 BytesTrieBuilder::BTLinearMatchNode::BTLinearMatchNode(const char *bytes, int32_t len, Node *nextNode) in BTLinearMatchNode() argument
341 : LinearMatchNode(len, nextNode), s(bytes) { in BTLinearMatchNode()
368 Node *nextNode) const { in createLinearMatchNode()
372 nextNode); in createLinearMatchNode()
H A Ducharstriebuilder.cpp288 UCharsTrieBuilder::UCTLinearMatchNode::UCTLinearMatchNode(const char16_t *units, int32_t len, Node *nextNode) in UCTLinearMatchNode() argument
289 : LinearMatchNode(len, nextNode), s(units) { in UCTLinearMatchNode()
315 Node *nextNode) const { in createLinearMatchNode()
319 nextNode); in createLinearMatchNode()
H A Dstringtriebuilder.cpp229 Node *nextNode=makeNode(start, limit, lastUnitIndex, errorCode); in makeNode() local
236 node=createLinearMatchNode(start, lastUnitIndex, maxLinearMatchLength, nextNode); in makeNode()
237 nextNode=registerNode(node, errorCode); in makeNode()
239 node=createLinearMatchNode(start, unitIndex, length, nextNode); in makeNode()
/third_party/skia/third_party/externals/icu/source/common/
H A Dbytestriebuilder.cpp340 BytesTrieBuilder::BTLinearMatchNode::BTLinearMatchNode(const char *bytes, int32_t len, Node *nextNode) in BTLinearMatchNode() argument
341 : LinearMatchNode(len, nextNode), s(bytes) { in BTLinearMatchNode()
368 Node *nextNode) const { in createLinearMatchNode()
372 nextNode); in createLinearMatchNode()
H A Ducharstriebuilder.cpp288 UCharsTrieBuilder::UCTLinearMatchNode::UCTLinearMatchNode(const UChar *units, int32_t len, Node *nextNode) in UCTLinearMatchNode() argument
289 : LinearMatchNode(len, nextNode), s(units) { in UCTLinearMatchNode()
315 Node *nextNode) const { in createLinearMatchNode()
319 nextNode); in createLinearMatchNode()
H A Dstringtriebuilder.cpp229 Node *nextNode=makeNode(start, limit, lastUnitIndex, errorCode); in makeNode() local
236 node=createLinearMatchNode(start, lastUnitIndex, maxLinearMatchLength, nextNode); in makeNode()
237 nextNode=registerNode(node, errorCode); in makeNode()
239 node=createLinearMatchNode(start, unitIndex, length, nextNode); in makeNode()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DStringTrieBuilder.java318 public IntermediateValueNode(int v, Node nextNode) { in IntermediateValueNode() argument
319 next=nextNode; in IntermediateValueNode()
354 public LinearMatchNode(CharSequence builderStrings, int sOffset, int len, Node nextNode) { in LinearMatchNode() argument
358 next=nextNode; in LinearMatchNode()
/third_party/FreeBSD/sys/compat/linuxkpi/common/src/
H A Dlinux_workqueue.c66 #define LIST_FOR_WORK_DEL(pos, nextNode, listObject, type, field) \
68 (nextNode) = LOS_DL_LIST_ENTRY((pos)->field.next, type, field); \
70 (pos) = (nextNode), (nextNode) = LOS_DL_LIST_ENTRY((pos)->field.next, type, field))
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/util/
H A DStringTrieBuilder.java317 public IntermediateValueNode(int v, Node nextNode) { in IntermediateValueNode() argument
318 next=nextNode; in IntermediateValueNode()
353 public LinearMatchNode(CharSequence builderStrings, int sOffset, int len, Node nextNode) { in LinearMatchNode() argument
357 next=nextNode; in LinearMatchNode()

Completed in 21 milliseconds

12