| /third_party/skia/third_party/externals/icu/source/tools/ctestfw/ |
| D | ctest.c | 225 TestNode *nextNode, *curNode; in addTestNode() local
237 nextNode = curNode->child; 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 = createTestNode(name, nameLen); in addTestNode()
274 curNode->sibling = nextNode; in addTestNode()
283 return nextNode; in addTestNode()
[all …]
|
| /third_party/icu/icu4c/source/tools/ctestfw/ |
| D | ctest.c | 227 TestNode *nextNode, *curNode; in addTestNode() local
239 nextNode = curNode->child; 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 = createTestNode(name, nameLen); in addTestNode()
276 curNode->sibling = nextNode; in addTestNode()
285 return nextNode; in addTestNode()
[all …]
|
| /third_party/lzma/CPP/7zip/UI/Common/ |
| D | EnumDirItems.cpp | 682 const NWildcard::CCensorNode *nextNode = NULL; in EnumerateForItem() local
689 nextNode = &curNode.SubNodes[(unsigned)index]; in EnumerateForItem()
694 if (!nextNode) in EnumerateForItem()
718 nextNode = &curNode; in EnumerateForItem()
722 *nextNode, phyParent, logParent, fi.Name, in EnumerateForItem()
944 const NWildcard::CCensorNode *nextNode = NULL; in EnumerateDirItems() local
951 nextNode = &curNode.SubNodes[(unsigned)index]; in EnumerateDirItems()
973 nextNode = &curNode; in EnumerateDirItems()
977 RINOK(EnumerateDirItems_Spec(*nextNode, phyParent, logParent, fi.Name, phyPrefix, in EnumerateDirItems()
986 const NWildcard::CCensorNode &nextNode = curNode.SubNodes[i]; in EnumerateDirItems() local
[all …]
|
| /third_party/node/deps/icu-small/source/common/unicode/ |
| D | stringtriebuilder.h | 300 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;
|
| D | bytestriebuilder.h | 158 BTLinearMatchNode(const char *units, int32_t len, Node *nextNode);
166 Node *nextNode) const override;
|
| D | ucharstriebuilder.h | 159 UCTLinearMatchNode(const char16_t *units, int32_t len, Node *nextNode);
167 Node *nextNode) const override;
|
| /third_party/icu/icu4c/source/common/unicode/ |
| D | stringtriebuilder.h | 300 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;
|
| D | ucharstriebuilder.h | 159 UCTLinearMatchNode(const char16_t *units, int32_t len, Node *nextNode);
167 Node *nextNode) const override;
|
| D | bytestriebuilder.h | 158 BTLinearMatchNode(const char *units, int32_t len, Node *nextNode);
166 Node *nextNode) const override;
|
| /third_party/skia/third_party/externals/icu/source/common/unicode/ |
| D | stringtriebuilder.h | 300 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;
|
| D | ucharstriebuilder.h | 159 UCTLinearMatchNode(const char16_t *units, int32_t len, Node *nextNode);
167 Node *nextNode) const;
|
| D | bytestriebuilder.h | 158 BTLinearMatchNode(const char *units, int32_t len, Node *nextNode);
166 Node *nextNode) const;
|
| /third_party/typescript/src/services/ |
| D | smartSelection.ts | 15 const nextNode: Node | undefined = children[i + 1]; constant
50 … if (isTemplateSpan(parentNode) && nextNode && isTemplateMiddleOrTemplateTail(nextNode)) {
52 const end = nextNode.getStart() + "}".length;
58 …isBetweenMultiLineBookends = isSyntaxList(node) && isListOpener(prevNode) && isListCloser(nextNode)
59 … && !positionsAreOnSameLine(prevNode.getStart(), nextNode.getStart(), sourceFile);
61 … const end = isBetweenMultiLineBookends ? nextNode.getStart() : getEndPos(sourceFile, node); constant
|
| /third_party/mesa3d/src/gallium/auxiliary/cso_cache/ |
| D | cso_hash.h | 162 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/node/deps/icu-small/source/common/ |
| D | ucharstriebuilder.cpp | 288 …Builder::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()
|
| D | bytestriebuilder.cpp | 340 …esTrieBuilder::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()
|
| D | stringtriebuilder.cpp | 229 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/icu4c/source/common/ |
| D | ucharstriebuilder.cpp | 288 …rieBuilder::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()
|
| D | bytestriebuilder.cpp | 340 …esTrieBuilder::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()
|
| D | stringtriebuilder.cpp | 229 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/vk-gl-cts/scripts/ |
| D | mustpass.py | 270 nextNode = findChild(curNode, component)
271 if not nextNode:
272 nextNode = TestGroup(component)
273 curNode.children.append(nextNode)
274 curNode = nextNode
|
| /third_party/skia/third_party/externals/icu/source/common/ |
| D | ucharstriebuilder.cpp | 288 …rieBuilder::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()
|
| D | bytestriebuilder.cpp | 340 …esTrieBuilder::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()
|
| D | stringtriebuilder.cpp | 229 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/FreeBSD/sys/compat/linuxkpi/common/src/ |
| D | linux_workqueue.c | 66 #define LIST_FOR_WORK_DEL(pos, nextNode, listObject, type, field) \ argument
68 (nextNode) = LOS_DL_LIST_ENTRY((pos)->field.next, type, field); \
70 (pos) = (nextNode), (nextNode) = LOS_DL_LIST_ENTRY((pos)->field.next, type, field))
|