| /external/webkit/Source/ThirdParty/ANGLE/src/compiler/ |
| 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);
|
| 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...] |
| SearchSymbol.cpp | 21 void SearchSymbol::traverse(TIntermNode *node) function in class:sh::SearchSymbol
23 node->traverse(this);
|
| SearchSymbol.h | 22 void traverse(TIntermNode *node);
|
| TranslatorGLSL.cpp | 15 root->traverse(&versionGLSL);
36 root->traverse(&outputGLSL);
|
| UnfoldSelect.h | 24 void traverse(TIntermNode *node);
|
| QualifierAlive.cpp | 38 node->traverse(&it);
|
| 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...] |
| RemoveTree.cpp | 75 root->traverse(&it);
|
| 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);
|
| 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...] |
| OutputGLSL.cpp | 401 node->getCondition()->traverse(this);
403 node->getTrueBlock()->traverse(this);
405 node->getFalseBlock()->traverse(this);
411 node->getCondition()->traverse(this);
444 node->traverse(this);
484 // Traverse function parameters.
488 params->traverse(this);
490 // Traverse function body.
620 node->getInit()->traverse(this);
624 node->getCondition()->traverse(this)
[all...] |
| Compiler.cpp | 181 root->traverse(&validate);
188 root->traverse(&collect);
|
| parseConst.cpp | 132 (*p)->traverse(this);
233 root->traverse(&it);
|
| /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);
|
| /external/webkit/Source/WebKit/qt/docs/webkitsnippets/webelement/ |
| main.cpp | 28 static void traverse() function
119 traverse();
|
| /external/bison/src/ |
| relation.c | 48 | digraph & traverse. |
62 traverse (relation_node i) function
74 traverse (R[i][j]);
111 traverse (i);
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| TreeWalker2Result.java | 69 public void traverse(int pos) throws org.xml.sax.SAXException method in class:TreeWalker2Result
74 super.traverse(pos);
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/ |
| DOM3SerializerImpl.java | 111 walker.traverse(node);
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| ElemCopyOf.java | 170 tw.traverse(child);
179 tw.traverse(pos);
|
| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 63 bool TraverseNode(T *Node, bool (VisitorBase::*traverse)(T*)) {
69 bool Result = (this->*traverse)(Node);
116 // to traverse: use 1 for matching the children and INT_MAX for
138 // - Traverse(node) calls BaseTraverse(node) when it needs
140 // - BaseTraverse(node) then calls (via VisitorBase::Traverse*(node))
141 // Traverse*(c) for each child c of 'node'.
142 // - Traverse*(c) in turn calls Traverse(c), completing the
147 traverse(*D);
149 traverse(*S)
210 bool traverse(const T &Node) { function in class:clang::ast_matchers::internal::__anon5090::MatchChildASTVisitor
[all...] |
| /development/tools/idegen/src/ |
| Configuration.java | 72 traverse(new File("."), sourceRoots, jarFiles, excludedDirs, excludes); method
95 // TODO: Traverse all vendor-specific directories.
114 private static void traverse(File directory, Set<File> sourceRoots, method in class:Configuration
160 // Traverse nested directories.
167 traverse(file, sourceRoots, jarFiles, excludedDirs, method
|
| /external/v8/test/mjsunit/tools/ |
| profile_view.js | 73 view.traverse(fillFlatTree);
90 view.traverse(fillFlatTree);
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
| Token.js | 14 /** imaginary tree navigation type; traverse "get child" link */
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| 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
|
