| /external/deqp/framework/common/ |
| D | tcuCommandLine.cpp | 345 vector<CaseTreeNode*> nodeStack; in parseCaseTrie() local
352 nodeStack.push_back(root); in parseCaseTrie()
354 while (!nodeStack.empty()) in parseCaseTrie()
369 nodeStack.back()->addChild(newChild); in parseCaseTrie()
378 nodeStack.push_back(newChild); in parseCaseTrie()
388 nodeStack.pop_back(); in parseCaseTrie()
391 if (nodeStack.empty()) in parseCaseTrie()
413 vector<CaseTreeNode*> nodeStack; in parseCaseList() local
417 nodeStack.resize(8, DE_NULL); in parseCaseList()
419 nodeStack[0] = root; in parseCaseList()
[all …]
|
| D | tcuTestHierarchyIterator.cpp | 147 std::string TestHierarchyIterator::buildNodePath (const vector<NodeIter>& nodeStack) in buildNodePath() argument
150 for (size_t ndx = 1; ndx < nodeStack.size(); ndx++) in buildNodePath()
152 const NodeIter& iter = nodeStack[ndx]; in buildNodePath()
|
| D | tcuTestHierarchyIterator.hpp | 190 static std::string buildNodePath (const std::vector<NodeIter>& nodeStack);
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/broadphase/ |
| D | DynamicTree.java | 56 private DynamicTreeNode[] nodeStack = new DynamicTreeNode[20]; field in DynamicTree
165 nodeStack[nodeStackIndex++] = m_root; in query()
168 DynamicTreeNode node = nodeStack[--nodeStackIndex]; in query()
180 if (nodeStack.length - nodeStackIndex - 2 <= 0) { in query()
181 DynamicTreeNode[] newBuffer = new DynamicTreeNode[nodeStack.length * 2]; in query()
182 System.arraycopy(nodeStack, 0, newBuffer, 0, nodeStack.length); in query()
183 nodeStack = newBuffer; in query()
185 nodeStack[nodeStackIndex++] = node.child1; in query()
186 nodeStack[nodeStackIndex++] = node.child2; in query()
241 nodeStack[nodeStackIndex++] = m_root; in raycast()
[all …]
|
| D | DynamicTreeFlatNodes.java | 166 private int[] nodeStack = new int[20]; field in DynamicTreeFlatNodes
172 nodeStack[nodeStackIndex++] = m_root; in query()
175 int node = nodeStack[--nodeStackIndex]; in query()
188 if (nodeStack.length - nodeStackIndex - 2 <= 0) { in query()
189 nodeStack = in query()
190 BufferUtils.reallocateBuffer(nodeStack, nodeStack.length, nodeStack.length * 2); in query()
192 nodeStack[nodeStackIndex++] = child1; in query()
193 nodeStack[nodeStackIndex++] = m_child2[node]; in query()
248 nodeStack[nodeStackIndex++] = m_root; in raycast()
250 int node = nodeStack[--nodeStackIndex] = m_root; in raycast()
[all …]
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| D | antlr3commontreenodestream.c | 230 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/antlr-3.4/runtime/ObjC/Framework/ |
| D | ANTLRUnbufferedCommonTreeNodeStream.m | 41 @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 = (ANTLRCommonTree *)[nodeStack lastObject];
379 [nodeStack removeLastObject];
|
| D | ANTLRUnbufferedCommonTreeNodeStream.h | 46 NSMutableArray *nodeStack; variable
64 @property (retain, getter=getNodeStack, setter=setNodeStack:) NSMutableArray *nodeStack;
|
| /external/valgrind/coregrind/ |
| D | m_wordfm.c | 88 AvlNode* nodeStack[WFM_STKMAX]; // Iterator node stack member
467 fm->nodeStack[i] = NULL; in stackClear()
478 fm->nodeStack[fm->stackTop] = n; in stackPush()
490 *n = fm->nodeStack[fm->stackTop]; in stackPop()
493 fm->nodeStack[fm->stackTop] = NULL; in stackPop()
809 VG_(memset)(fm->nodeStack, 0, sizeof(fm->nodeStack)); in VG_()
|
| D | m_oset.c | 123 AvlNode* nodeStack[STACK_MAX]; // Iterator node stack member
249 t->nodeStack[i] = NULL; in stackClear()
260 t->nodeStack[t->stackTop] = n; in stackPush()
272 *n = t->nodeStack[t->stackTop]; in stackPop()
275 t->nodeStack[t->stackTop] = NULL; in stackPop()
|
| /external/valgrind/cachegrind/ |
| D | cg_merge.c | 1001 AvlNode* nodeStack[WFM_STKMAX]; // Iterator node stack member
1309 fm->nodeStack[i] = NULL; in stackClear()
1320 fm->nodeStack[fm->stackTop] = n; in stackPush()
1332 *n = fm->nodeStack[fm->stackTop]; in stackPop()
1335 fm->nodeStack[fm->stackTop] = NULL; in stackPop()
1563 memset(fm->nodeStack, 0, sizeof(fm->nodeStack)); in dopyFM()
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| D | antlr3commontreenodestream.h | 215 pANTLR3_STACK nodeStack; member
|