HomeSort by relevance Sort by last modified time
    Searched refs:traverse (Results 1 - 25 of 94) sorted by null

1 2 3 4

  /external/chromium_org/third_party/angle_dx11/src/compiler/depgraph/
DependencyGraphTraverse.cpp 11 void TGraphNode::traverse(TDependencyGraphTraverser* graphTraverser) function in class:TGraphNode
16 void TGraphParentNode::traverse(TDependencyGraphTraverser* graphTraverser) function in class:TGraphParentNode
18 TGraphNode::traverse(graphTraverser);
29 node->traverse(graphTraverser);
35 void TGraphArgument::traverse(TDependencyGraphTraverser* graphTraverser) function in class:TGraphArgument
38 TGraphParentNode::traverse(graphTraverser);
41 void TGraphFunctionCall::traverse(TDependencyGraphTraverser* graphTraverser) function in class:TGraphFunctionCall
44 TGraphParentNode::traverse(graphTraverser);
47 void TGraphSymbol::traverse(TDependencyGraphTraverser* graphTraverser) function in class:TGraphSymbol
50 TGraphParentNode::traverse(graphTraverser)
53 void TGraphSelection::traverse(TDependencyGraphTraverser* graphTraverser) function in class:TGraphSelection
59 void TGraphLoop::traverse(TDependencyGraphTraverser* graphTraverser) function in class:TGraphLoop
65 void TGraphLogicalOp::traverse(TDependencyGraphTraverser* graphTraverser) function in class:TGraphLogicalOp
    [all...]
DependencyGraphBuilder.cpp 51 intermArgument->traverse(this);
75 intermChild->traverse(this);
120 intermLeft->traverse(this);
131 intermRight->traverse(this);
152 intermLeft->traverse(this);
161 intermRight->traverse(this);
168 intermLeft->traverse(this);
172 intermRight->traverse(this);
181 intermCondition->traverse(this);
189 intermTrueBlock->traverse(this)
    [all...]
DependencyGraph.h 38 virtual void traverse(TDependencyGraphTraverser* graphTraverser);
51 virtual void traverse(TDependencyGraphTraverser* graphTraverser);
67 virtual void traverse(TDependencyGraphTraverser* graphTraverser);
81 virtual void traverse(TDependencyGraphTraverser* graphTraverser);
92 virtual void traverse(TDependencyGraphTraverser* graphTraverser);
103 virtual void traverse(TDependencyGraphTraverser* graphTraverser);
114 virtual void traverse(TDependencyGraphTraverser* graphTraverser);
126 virtual void traverse(TDependencyGraphTraverser* graphTraverser);
185 // traverse method.
DependencyGraphOutput.cpp 62 symbol->traverse(this);
  /external/chromium_org/third_party/angle_dx11/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...]
UnfoldShortCircuit.cpp 23 void UnfoldShortCircuit::traverse(TIntermNode *node) function in class:sh::UnfoldShortCircuit
26 node->traverse(this);
47 node->getLeft()->traverse(this);
50 node->getLeft()->traverse(mOutputHLSL);
55 node->getRight()->traverse(this);
58 node->getRight()->traverse(mOutputHLSL);
78 node->getLeft()->traverse(this);
81 node->getLeft()->traverse(mOutputHLSL);
86 node->getRight()->traverse(this);
89 node->getRight()->traverse(mOutputHLSL)
    [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);
DetectDiscontinuity.cpp 17 bool DetectLoopDiscontinuity::traverse(TIntermNode *node) function in class:sh::DetectLoopDiscontinuity
21 node->traverse(this);
74 return detectLoopDiscontinuity.traverse(node);
77 bool DetectGradientOperation::traverse(TIntermNode *node) function in class:sh::DetectGradientOperation
80 node->traverse(this);
137 return detectGradientOperation.traverse(node);
DetectDiscontinuity.h 22 bool traverse(TIntermNode *node);
39 bool traverse(TIntermNode *node);
TranslatorGLSL.cpp 15 root->traverse(&versionGLSL);
43 root->traverse(&outputGLSL);
UnfoldShortCircuit.h 24 void traverse(TIntermNode *node);
QualifierAlive.cpp 38 node->traverse(&it);
RemoveTree.cpp 75 root->traverse(&it);
TranslatorESSL.cpp 30 root->traverse(&outputESSL);
intermOut.cpp 12 // also directly call Traverse() on children themselves to
295 node->getCondition()->traverse(this);
300 node->getTrueBlock()->traverse(this);
307 node->getFalseBlock()->traverse(this);
364 node->getCondition()->traverse(this);
371 node->getBody()->traverse(this);
378 node->getExpression()->traverse(this);
403 node->getExpression()->traverse(this);
423 root->traverse(&it);
Compiler.cpp 265 root->traverse(&detect);
290 root->traverse(&renamer);
295 root->traverse(&validate);
328 root->traverse(&traverser);
337 samplerSymbol->traverse(&graphTraverser);
364 root->traverse(&collect);
377 root->traverse(&map);
intermediate.h 220 virtual void traverse(TIntermTraverser*) = 0;
297 virtual void traverse(TIntermTraverser*);
327 virtual void traverse(TIntermTraverser*);
356 virtual void traverse(TIntermTraverser*);
376 virtual void traverse(TIntermTraverser*);
409 virtual void traverse(TIntermTraverser*);
436 virtual void traverse(TIntermTraverser*);
467 virtual void traverse(TIntermTraverser*);
510 virtual void traverse(TIntermTraverser*);
534 // it to a Traverse method
    [all...]
OutputGLSLBase.cpp 425 node->getCondition()->traverse(this);
427 node->getTrueBlock()->traverse(this);
429 node->getFalseBlock()->traverse(this);
435 node->getCondition()->traverse(this);
470 node->traverse(this);
509 // Traverse function parameters.
513 params->traverse(this);
515 // Traverse function body.
649 node->getInit()->traverse(this);
653 node->getCondition()->traverse(this)
    [all...]
  /external/chromium_org/third_party/angle_dx11/src/compiler/timing/
RestrictVertexShaderTiming.h 24 void enforceRestrictions(TIntermNode* root) { root->traverse(this); }
  /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/chromium_org/third_party/angle_dx11/src/third_party/compiler/
ArrayBoundsClamper.cpp 88 root->traverse(&clamper);
  /external/clang/lib/ASTMatchers/
ASTMatchFinder.cpp 84 // to traverse: use 1 for matching the children and INT_MAX for
106 // - Traverse(node) calls BaseTraverse(node) when it needs
108 // - BaseTraverse(node) then calls (via VisitorBase::Traverse*(node))
109 // Traverse*(c) for each child c of 'node'.
110 // - Traverse*(c) in turn calls Traverse(c), completing the
115 traverse(*D);
117 traverse(*S);
120 traverse(*NNS);
123 traverse(*NNSLoc)
274 bool traverse(const T &Node) { function in class:clang::ast_matchers::internal::__anon17547::MatchChildASTVisitor
    [all...]
  /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);

Completed in 319 milliseconds

1 2 3 4