| /external/webkit/Source/JavaScriptCore/profiler/ |
| Profile.cpp | 54 ProfileNode* currentNode = m_head->firstChild();
55 for (ProfileNode* nextNode = currentNode; nextNode; nextNode = nextNode->firstChild())
56 currentNode = nextNode;
58 if (!currentNode)
59 currentNode = m_head.get();
62 while (currentNode && currentNode != endNode) {
63 (currentNode->*function)();
64 currentNode = currentNode->traverseNextNodePostOrder()
[all...] |
| ProfileGenerator.cpp | 152 ProfileNode* currentNode = 0;
154 currentNode = next;
156 if (currentNode->callIdentifier().m_name != "profile")
160 currentNode->parent()->setSelfTime(currentNode->parent()->selfTime() + currentNode->totalTime());
161 currentNode->parent()->removeChild(currentNode);
167 ProfileNode* currentNode = 0;
169 currentNode = next
[all...] |
| /external/webkit/LayoutTests/fast/dom/TreeWalker/resources/ |
| TreeWalker-currentNode.js | 10 debug("Test that TreeWalker.parent() doesn't set the currentNode to a node not under the root.");
13 shouldBe("w.currentNode", "subTree");
15 shouldBe("w.currentNode", "subTree");
18 debug("Test that we handle setting the currentNode to arbitrary nodes not under the root element.");
21 w.currentNode = document.documentElement;
23 shouldBe("w.currentNode", "document.documentElement");
24 w.currentNode = document.documentElement;
26 shouldBe("w.currentNode", "document.documentElement.firstChild");
27 w.currentNode = document.documentElement;
29 shouldBe("w.currentNode", "document.documentElement")
[all...] |
| /external/webkit/LayoutTests/fast/dom/TreeWalker/script-tests/ |
| traversal-skip.js | 27 shouldBe("walker.nextNode(); walker.currentNode.id", "'A1'");
28 shouldBe("walker.nextNode(); walker.currentNode.id", "'C1'");
29 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
30 shouldBe("walker.nextNode(); walker.currentNode.id", "'B3'");
34 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
35 shouldBe("walker.firstChild(); walker.currentNode.id", "'C1'");
39 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
40 shouldBe("walker.firstChild(); walker.currentNode.id", "'B1'");
41 shouldBe("walker.nextSibling(); walker.currentNode.id", "'B3'");
45 walker.currentNode = testElement.querySelectorAll('#C1')[0]
[all...] |
| traversal-reject.js | 27 shouldBe("walker.nextNode(); walker.currentNode.id", "'A1'");
28 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
29 shouldBe("walker.nextNode(); walker.currentNode.id", "'B3'");
33 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
34 shouldBe("walker.firstChild(); walker.currentNode.id", "'B2'");
38 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
39 shouldBe("walker.firstChild(); walker.currentNode.id", "'B1'");
40 shouldBe("walker.nextSibling(); walker.currentNode.id", "'B3'");
44 walker.currentNode = testElement.querySelectorAll('#C1')[0];
45 shouldBe("walker.parentNode(); walker.currentNode.id", "'A1'")
[all...] |
| acceptNode-filter.js | 18 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
19 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
31 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
32 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
37 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
38 shouldBe("walker.nextNode(); walker.currentNode.id", "'B1'");
43 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
44 shouldBe("walker.nextNode(); walker.currentNode.id", "'B1'");
50 shouldBe("walker.currentNode.id;", "'root'");
52 shouldBe("walker.currentNode.id;", "'root'")
[all...] |
| previousSiblingLastChildSkip.js | 15 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
16 shouldBe("walker.nextNode(); walker.currentNode.id", "'C1'");
17 shouldBe("walker.nextNode(); walker.currentNode.id", "'C2'");
18 shouldBe("walker.nextNode(); walker.currentNode.id", "'D1'");
19 shouldBe("walker.nextNode(); walker.currentNode.id", "'D2'");
20 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
21 shouldBe("walker.previousSibling(); walker.currentNode.id", "'C2'");
|
| filter-throw.js | 15 shouldBe("walker.currentNode.id", "'root'")
16 shouldThrow("walker.nextNode();walker.currentNode.id");
17 shouldBe("walker.currentNode.id", "'root'")
28 shouldBe("walker.currentNode.id", "'root'")
29 shouldThrow("walker.nextNode();walker.currentNode.id");
30 shouldBe("walker.currentNode.id", "'root'")
|
| traversal-skip-most.js | 18 shouldBe("walker.firstChild(); walker.currentNode.id", "'B1'");
19 shouldBe("walker.nextSibling(); walker.currentNode.id", "'B3'");
23 walker.currentNode = testElement.querySelectorAll('#B3')[0];
24 shouldBe("walker.previousSibling(); walker.currentNode.id", "'B1'");
|
| previousNodeLastChildReject.js | 15 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
16 shouldBe("walker.nextNode(); walker.currentNode.id", "'B1'");
17 shouldBe("walker.nextNode(); walker.currentNode.id", "'C1'");
18 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
19 shouldBe("walker.previousNode(); walker.currentNode.id", "'C1'");
|
| /external/apache-xml/src/main/java/org/apache/xpath/functions/ |
| FunctionDef1Arg.java | 86 int currentNode = xctxt.getCurrentNode();
87 if(DTM.NULL == currentNode)
91 DTM dtm = xctxt.getDTM(currentNode);
92 return dtm.getStringValue(currentNode);
119 int currentNode = xctxt.getCurrentNode();
120 if(DTM.NULL == currentNode)
124 DTM dtm = xctxt.getDTM(currentNode);
125 XMLString str = dtm.getStringValue(currentNode);
|
| FuncCurrent.java | 56 int currentNode = DTM.NULL;
62 currentNode = iter.getCurrentContextNode();
68 // not predicate => ContextNode == CurrentNode
69 currentNode = xctxt.getContextNode();
71 return new XNodeSet(currentNode, xctxt.getDTMManager());
|
| FuncPosition.java | 95 int currentNode = xctxt.getContextNode();
96 // System.out.println("currentNode: "+currentNode);
99 if(n == currentNode)
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/ |
| LayoutContentAssist.java | 40 protected Object[] getChoicesForElement(String parent, Node currentNode) {
41 Object[] choices = super.getChoicesForElement(parent, currentNode);
43 if (currentNode.getParentNode().getNodeType() == Node.ELEMENT_NODE) {
44 String parentName = currentNode.getParentNode().getNodeName();
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRUnbufferedCommonTreeNodeStreamState.h | 31 ANTLRCommonTree *currentNode;
42 - (ANTLRCommonTree *) currentNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRUnbufferedCommonTreeNodeStreamState.h | 31 ANTLRCommonTree *currentNode;
42 - (ANTLRCommonTree *) currentNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRUnbufferedCommonTreeNodeStreamState.h | 31 ANTLRCommonTree *currentNode;
42 - (ANTLRCommonTree *) currentNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRUnbufferedCommonTreeNodeStreamState.h | 31 ANTLRCommonTree *currentNode;
42 - (ANTLRCommonTree *) currentNode;
|
| /external/webkit/Source/WebKit/mac/WebView/ |
| WebTextIterator.h | 90 @method currentNode
94 - (DOMNode *)currentNode;
|
| /external/llvm/lib/Analysis/ |
| DominanceFrontier.cpp | 56 const DomTreeNode *currentNode = currentW->Node;
59 assert (currentNode && "Invalid work object. Missing current Node");
66 // Loop over CFG successors to calculate DFlocal[currentNode]
70 if (DT[*SI]->getIDom() != currentNode)
79 for (DomTreeNode::const_iterator NI = currentNode->begin(),
80 NE = currentNode->end(); NI != NE; ++NI) {
85 IDominee, currentNode));
|
| PathNumbering.cpp | 366 BallLarusNode* currentNode = dfsStack.top();
367 BasicBlock* currentBlock = currentNode->getBlock();
369 if(currentNode->getColor() != BallLarusNode::WHITE) {
372 currentNode->setColor(BallLarusNode::BLACK);
376 for( BasicBlock::iterator bbCurrent = currentNode->getBlock()->begin(),
377 bbEnd = currentNode->getBlock()->end(); bbCurrent != bbEnd;
381 BallLarusEdge* callEdge = addEdge(currentNode, getExit(), 0);
388 TerminatorInst* terminator = currentNode->getBlock()->getTerminator();
391 addEdge(currentNode, getExit(),0);
393 currentNode->setColor(BallLarusNode::GRAY)
[all...] |
| PathProfileInfo.cpp | 139 BallLarusNode* currentNode = _ppi->_currentDag->getRoot ();
143 while (currentNode != _ppi->_currentDag->getExit()) {
144 BallLarusEdge* next = getNextEdge(currentNode, increment);
171 currentNode = next->getTarget();
178 BallLarusNode* currentNode = _ppi->_currentDag->getRoot ();
182 while (currentNode != _ppi->_currentDag->getExit()) {
183 BallLarusEdge* next = getNextEdge(currentNode, increment);
188 pbv->push_back (currentNode->getBlock());
191 pbv->push_back (currentNode->getBlock());
196 currentNode = next->getTarget()
[all...] |
| /external/webkit/Source/WebCore/inspector/front-end/ |
| BottomUpProfileDataGridTree.js | 218 var currentNode = profileDataGridNode;
221 while (currentNode.parent && (currentNode instanceof WebInspector.ProfileDataGridNode)) {
222 currentNode._takePropertiesFromProfileDataGridNode(profileDataGridNode);
224 focusNode = currentNode;
225 currentNode = currentNode.parent;
227 if (currentNode instanceof WebInspector.ProfileDataGridNode)
228 currentNode._keepOnlyChild(focusNode);
|
| /external/webkit/Source/WebCore/dom/ |
| TreeWalker.idl | 31 attribute Node currentNode
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| KeyTable.java | 195 int currentNode;
197 while (DTM.NULL != (currentNode = m_keyNodes.nextNode()))
206 currentNode,
211 addValueInRefsTable(xctxt, exprResult, currentNode);
220 addValueInRefsTable(xctxt, exprResult, currentNode);
|
