| /external/webkit/Source/ThirdParty/ANGLE/src/compiler/ |
| IntermTraverse.cpp | 10 // Traverse the intermediate representation tree, and
12 // Done recursively through the member function Traverse().
26 void TIntermSymbol::traverse(TIntermTraverser* it) function in class:TIntermSymbol
31 void TIntermConstantUnion::traverse(TIntermTraverser* it) function in class:TIntermConstantUnion
37 // Traverse a binary node.
39 void TIntermBinary::traverse(TIntermTraverser* it) function in class:TIntermBinary
62 right->traverse(it);
72 left->traverse(it);
79 left->traverse(it);
89 right->traverse(it)
109 void TIntermUnary::traverse(TIntermTraverser* it) function in class:TIntermUnary
129 void TIntermAggregate::traverse(TIntermTraverser* it) function in class:TIntermAggregate
185 void TIntermSelection::traverse(TIntermTraverser* it) function in class:TIntermSelection
217 void TIntermLoop::traverse(TIntermTraverser* it) function in class:TIntermLoop
277 void TIntermBranch::traverse(TIntermTraverser* it) function in class:TIntermBranch
[all...] |
| UnfoldSelect.cpp | 21 void UnfoldSelect::traverse(TIntermNode *node) function in class:sh::UnfoldSelect
24 node->traverse(this);
37 node->getCondition()->traverse(this);
39 node->getCondition()->traverse(mOutputHLSL);
42 node->getTrueBlock()->traverse(this);
44 node->getTrueBlock()->traverse(mOutputHLSL);
49 node->getFalseBlock()->traverse(this);
51 node->getFalseBlock()->traverse(mOutputHLSL);
|
| SearchSymbol.cpp | 21 void SearchSymbol::traverse(TIntermNode *node) function in class:sh::SearchSymbol
23 node->traverse(this);
|
| TranslatorGLSL.cpp | 15 root->traverse(&versionGLSL);
36 root->traverse(&outputGLSL);
|
| SearchSymbol.h | 22 void traverse(TIntermNode *node);
|
| UnfoldSelect.h | 24 void traverse(TIntermNode *node);
|
| intermediate.h | 212 virtual void traverse(TIntermTraverser*) = 0;
285 virtual void traverse(TIntermTraverser*);
310 virtual void traverse(TIntermTraverser*);
334 virtual void traverse(TIntermTraverser*);
350 virtual void traverse(TIntermTraverser*);
383 virtual void traverse(TIntermTraverser*);
404 virtual void traverse(TIntermTraverser*);
428 virtual void traverse(TIntermTraverser*);
467 virtual void traverse(TIntermTraverser*);
491 // it to a Traverse method
[all...] |
| intermOut.cpp | 12 // also directly call Traverse() on children themselves to
288 node->getCondition()->traverse(this);
293 node->getTrueBlock()->traverse(this);
300 node->getFalseBlock()->traverse(this);
357 node->getCondition()->traverse(this);
364 node->getBody()->traverse(this);
371 node->getExpression()->traverse(this);
396 node->getExpression()->traverse(this);
416 root->traverse(&it);
|
| QualifierAlive.cpp | 38 node->traverse(&it);
|
| RemoveTree.cpp | 75 root->traverse(&it);
|
| OutputHLSL.cpp | 78 mContext.treeRoot->traverse(this); // Output the body first to determine what has to go in the header
670 expression->traverse(&searchSymbol);
677 expression->traverse(this);
679 symbolNode->traverse(this);
704 node->getLeft()->traverse(this);
720 node->getLeft()->traverse(this);
809 node->getLeft()->traverse(this);
811 node->getRight()->traverse(this);
[all...] |
| /external/iptables/extensions/ |
| libxt_TRACE.man | 2 the packets as those traverse the tables, chains, rules.
|
| libipt_TTL.man | 2 how many hops (routers) a packet can traverse until it's time to live is
|
| /libcore/luni/src/test/java/libcore/xml/ |
| NodeTest.java | 77 traverse(subtree, result); method
81 private void traverse(Node node, List<Node> sink) { method in class:NodeTest
86 traverse(children.item(i), sink);
|
| /development/samples/ApiDemos/src/com/example/android/apis/accessibility/ |
| _index.html | 18 including the ability for an AccessibilityService to traverse the view
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMAxisTraverser.java | 24 * A class that implements traverses DTMAxisTraverser interface can traverse
31 * <p>A DTMAxisTraverser can probably not traverse a reverse axis in
49 * returned or the iteration will go into an infinate loop. So to traverse
66 * returned or the iteration will go into an infinate loop. So to traverse
84 * Traverse to the next node after the current node.
100 * Traverse to the next node after the current node that is matched
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseTraversers.java | 204 * Traverse to the next node after the current node.
217 * Traverse to the next node after the current node that is matched
287 * Traverse to the next node after the current node.
301 * Traverse to the next node after the current node that is matched
398 * returned or the iteration will go into an infinate loop. So to traverse
415 * returned or the iteration will go into an infinate loop. So to traverse
453 * Traverse to the next node after the current node.
466 * Traverse to the next node after the current node that is matched
667 * returned or the iteration will go into an infinate loop. So to traverse
694 * Traverse to the next node after the current node
[all...] |
| DTMTreeWalker.java | 99 * (postorder) are invoked for each node as we traverse over them,
103 * in other words, the root of the subtree to traverse over.
106 public void traverse(int pos) throws org.xml.sax.SAXException method in class:DTMTreeWalker
108 // %REVIEW% Why isn't this just traverse(pos,pos)?
131 // %REVIEW% This condition isn't tested in traverse(pos,top)
149 * (postorder) are invoked for each node as we traverse over them,
158 public void traverse(int pos, int top) throws org.xml.sax.SAXException method in class:DTMTreeWalker
|
| /libcore/luni/src/main/java/java/lang/ref/ |
| package.html | 34 that does not traverse any instance of a {@link java.lang.ref.Reference}
52 that does traverse a {@link java.lang.ref.SoftReference} instance, but no
70 that does traverse a {@link java.lang.ref.WeakReference} instance, but no
|
| /external/webkit/Source/WebKit/qt/docs/webkitsnippets/webelement/ |
| main.cpp | 28 static void traverse() function
119 traverse();
|
| /external/clang/include/clang/AST/ |
| RecursiveASTVisitor.h | 80 /// 1. traverse the AST (i.e. go to each node);
102 /// These three method groups are tiered (Traverse* > WalkUpFrom* >
103 /// Visit*). A method (e.g. Traverse*) may call methods from the same
104 /// tier (e.g. other Traverse*) or one tier lower (e.g. WalkUpFrom*).
119 /// template pattern) and override any of the Traverse*, WalkUpFrom*,
123 /// users may override Traverse* and WalkUpFrom* to implement custom
152 /// dispatching to Traverse*() based on the argument's dynamic type.
159 /// Traverse*Type() based on the argument's getTypeClass() property.
166 /// Traverse*TypeLoc() based on the argument type's getTypeClass() property.
173 /// Traverse*Decl() based on the argument's dynamic type
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| XSLTVisitable.java | 32 * This will traverse the heararchy, calling the visitor for
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| XPathVisitable.java | 32 * This will traverse the heararchy, calling the visitor for
|
| /external/bison/src/ |
| relation.c | 48 | digraph & traverse. |
62 traverse (relation_node i) function
74 traverse (R[i][j]);
111 traverse (i);
|
| /external/e2fsprogs/lib/ext2fs/tdb/ |
| build-tdb | 12 freelistcheck.c traverse.c dump.c tdb.c open.c"
|
