Home
last modified time | relevance | path

Searched refs:nodeStack (Results 1 – 13 of 13) sorted by relevance

/external/armnn/src/armnnUtils/
DGraphTopologicalSort.hpp58 std::stack<TNodeId> nodeStack; in TopologicallySort() local
63 nodeStack.push(initialNode); in TopologicallySort()
66 while (!nodeStack.empty()) in TopologicallySort()
68 TNodeId current = nodeStack.top(); in TopologicallySort()
81 nodeStack.push(nextChild); in TopologicallySort()
92 nodeStack.pop(); in TopologicallySort()
/external/dokka/core/src/main/kotlin/Kotlin/
DContentBuilder.kt26 val nodeStack = ArrayDeque<ContentBlock>() in buildContentTo() constant
27 nodeStack.push(target) in buildContentTo()
30 val parent = nodeStack.peek() in buildContentTo()
33 nodeStack.push(content) in buildContentTo()
35 parent.append(nodeStack.pop()) in buildContentTo()
100 if (nodeStack.peek() !is ContentHeading || node.parent?.children?.first() != node) { in buildContentTo()
105 if ((keepEol(nodeStack.peek()) && node.parent?.children?.last() != node) || in buildContentTo()
107 … (processingList(nodeStack.peek()) && node.previous?.type == MarkdownTokenTypes.EOL)) { in buildContentTo()
/external/deqp/framework/common/
DtcuCommandLine.cpp606 vector<CaseTreeNode *> nodeStack; in parseCaseTrie() local
613 nodeStack.push_back(root); in parseCaseTrie()
615 while (!nodeStack.empty()) in parseCaseTrie()
631 nodeStack.back()->addChild(newChild); in parseCaseTrie()
640 nodeStack.push_back(newChild); in parseCaseTrie()
650 nodeStack.pop_back(); in parseCaseTrie()
653 if (nodeStack.empty()) in parseCaseTrie()
671 static void parseSimpleCaseList(vector<CaseTreeNode *> &nodeStack, std::istream &in, bool reportDup… in parseSimpleCaseList() argument
689 if (!nodeStack[stackPos]->hasChild(hash)) in parseSimpleCaseList()
695 nodeStack[stackPos]->addChild(newChild); in parseSimpleCaseList()
[all …]
DtcuTestHierarchyIterator.cpp153 std::string TestHierarchyIterator::buildNodePath(const vector<NodeIter> &nodeStack) in buildNodePath() argument
156 for (size_t ndx = 1; ndx < nodeStack.size(); ndx++) in buildNodePath()
158 const NodeIter &iter = nodeStack[ndx]; in buildNodePath()
DtcuTestHierarchyIterator.hpp185 static std::string buildNodePath(const std::vector<NodeIter> &nodeStack);
/external/antlr/runtime/C/src/
Dantlr3commontreenodestream.c230 stream->nodeStack = inStream->nodeStack; in antlr3CommonTreeNodeStreamNewStream()
372 stream->nodeStack = antlr3StackNew(INITIAL_CALL_STACK_SIZE); in antlr3CommonTreeNodeStreamNew()
431 if (ctns->nodeStack != NULL) in antlr3CommonTreeNodeStreamFree()
433 ctns->nodeStack->free(ctns->nodeStack); in antlr3CommonTreeNodeStreamFree()
541 if (ctns->nodeStack != NULL) in reset()
543 ctns->nodeStack->free(ctns->nodeStack); in reset()
544 ctns->nodeStack = antlr3StackNew(INITIAL_CALL_STACK_SIZE); in reset()
956 ctns->nodeStack->push(ctns->nodeStack, ANTLR3_FUNC_PTR(ctns->p), NULL); // Save current index in push()
965 retVal = ANTLR3_UINT32_CAST(ctns->nodeStack->pop(ctns->nodeStack)); in pop()
/external/antlr/runtime/ObjC/Framework/
DUnbufferedCommonTreeNodeStream.m41 @synthesize nodeStack;
64 nodeStack = [[NSMutableArray arrayWithCapacity:5] retain];
80 [nodeStack release]; nodeStack = nil;
95 [nodeStack removeAllObjects];
204 [state setNodeStackSize:[nodeStack count]];
235 …[nodeStack removeObjectsInRange:NSMakeRange([state nodeStackSize], [nodeStack count]-[state nodeSt…
361 [nodeStack addObject:currentNode];
378 currentNode = (CommonTree *)[nodeStack lastObject];
379 [nodeStack removeLastObject];
DUnbufferedCommonTreeNodeStream.h46 NSMutableArray *nodeStack; variable
64 @property (retain, getter=getNodeStack, setter=setNodeStack:) NSMutableArray *nodeStack;
/external/angle/src/compiler/translator/
DIntermRebuild.cpp306 ConsList<TIntermNode *> &nodeStack; member
307 NodeStackGuard(ConsList<TIntermNode *> &nodeStack, TIntermNode *node) in NodeStackGuard()
308 : oldNodeStack(nodeStack), nodeStack(nodeStack) in NodeStackGuard()
310 nodeStack = {node, &oldNodeStack}; in NodeStackGuard()
312 ~NodeStackGuard() { nodeStack = oldNodeStack; } in ~NodeStackGuard()
/external/angle/src/libANGLE/renderer/vulkan/
DCommandGraph.cpp1018 std::vector<CommandGraphNode *> nodeStack; in submitCommands() local
1037 nodeStack.push_back(topLevelNode); in submitCommands()
1039 while (!nodeStack.empty()) in submitCommands()
1041 CommandGraphNode *node = nodeStack.back(); in submitCommands()
1046 node->visitParents(&nodeStack); in submitCommands()
1051 nodeStack.pop_back(); in submitCommands()
1054 nodeStack.pop_back(); in submitCommands()
/external/exoplayer/tree_15dc86382f17a24a3e881e52e31a810c1ea44b49/library/extractor/src/main/java/com/google/android/exoplayer2/text/ttml/
DTtmlDecoder.java127 ArrayDeque<TtmlNode> nodeStack = new ArrayDeque<>(); in decode() local
134 @Nullable TtmlNode parent = nodeStack.peek(); in decode()
151 nodeStack.push(node); in decode()
167 Assertions.checkNotNull(nodeStack.peek()), globalStyles, regionMap, imageMap); in decode()
169 nodeStack.pop(); in decode()
/external/exoplayer/tree_8e57d3715f9092d5ec54ebe2e538f34bfcc34479/library/extractor/src/main/java/com/google/android/exoplayer2/text/ttml/
DTtmlDecoder.java127 ArrayDeque<TtmlNode> nodeStack = new ArrayDeque<>(); in decode() local
134 @Nullable TtmlNode parent = nodeStack.peek(); in decode()
151 nodeStack.push(node); in decode()
167 Assertions.checkNotNull(nodeStack.peek()), globalStyles, regionMap, imageMap); in decode()
169 nodeStack.pop(); in decode()
/external/antlr/runtime/C/include/
Dantlr3commontreenodestream.h215 pANTLR3_STACK nodeStack; member