/external/chromium_org/third_party/angle/src/compiler/translator/ |
D | IntermTraverse.cpp | 26 void TIntermSymbol::traverse(TIntermTraverser *it) in traverse() function in TIntermSymbol 31 void TIntermConstantUnion::traverse(TIntermTraverser *it) in traverse() function in TIntermConstantUnion 39 void TIntermBinary::traverse(TIntermTraverser *it) in traverse() function in TIntermBinary 59 right->traverse(it); in traverse() 65 left->traverse(it); in traverse() 70 left->traverse(it); in traverse() 76 right->traverse(it); in traverse() 93 void TIntermUnary::traverse(TIntermTraverser *it) in traverse() function in TIntermUnary 102 operand->traverse(it); in traverse() 113 void TIntermAggregate::traverse(TIntermTraverser *it) in traverse() function in TIntermAggregate [all …]
|
D | UnfoldShortCircuit.cpp | 23 void UnfoldShortCircuit::traverse(TIntermNode *node) in traverse() function in sh::UnfoldShortCircuit 26 node->traverse(this); in traverse() 55 node->getLeft()->traverse(this); in visitBinary() 58 node->getLeft()->traverse(mOutputHLSL); in visitBinary() 63 node->getRight()->traverse(this); in visitBinary() 66 node->getRight()->traverse(mOutputHLSL); in visitBinary() 86 node->getLeft()->traverse(this); in visitBinary() 89 node->getLeft()->traverse(mOutputHLSL); in visitBinary() 94 node->getRight()->traverse(this); in visitBinary() 97 node->getRight()->traverse(mOutputHLSL); in visitBinary() [all …]
|
D | DetectDiscontinuity.cpp | 17 bool DetectLoopDiscontinuity::traverse(TIntermNode *node) in traverse() function in sh::DetectLoopDiscontinuity 21 node->traverse(this); in traverse() 74 return detectLoopDiscontinuity.traverse(node); in containsLoopDiscontinuity() 77 bool DetectGradientOperation::traverse(TIntermNode *node) in traverse() function in sh::DetectGradientOperation 80 node->traverse(this); in traverse() 137 return detectGradientOperation.traverse(node); in containsGradientOperation()
|
D | Compiler.cpp | 206 root->traverse(&marker); in compile() 211 root->traverse(&marker); in compile() 234 root->traverse(&unfoldShortCircuit); in compile() 370 root->traverse(&detect); in detectCallDepth() 396 root->traverse(&validateOutputs); in validateOutputs() 403 root->traverse(&renamer); in rewriteCSSShader() 409 root->traverse(&validate); in validateLimitations() 446 root->traverse(&traverser); in limitExpressionComplexity() 462 samplerSymbol->traverse(&graphTraverser); in limitExpressionComplexity() 485 root->traverse(&collect); in collectVariables() [all …]
|
D | intermOut.cpp | 306 node->getCondition()->traverse(this); in visitSelection() 311 node->getTrueBlock()->traverse(this); in visitSelection() 318 node->getFalseBlock()->traverse(this); in visitSelection() 379 node->getCondition()->traverse(this); in visitLoop() 386 node->getBody()->traverse(this); in visitLoop() 393 node->getExpression()->traverse(this); in visitLoop() 418 node->getExpression()->traverse(this); in visitBranch() 438 root->traverse(&it); in outputTree()
|
D | SearchSymbol.cpp | 21 void SearchSymbol::traverse(TIntermNode *node) in traverse() function in sh::SearchSymbol 23 node->traverse(this); in traverse()
|
D | intermediate.h | 233 virtual void traverse(TIntermTraverser*) = 0; 325 virtual void traverse(TIntermTraverser*); 359 virtual void traverse(TIntermTraverser*); 391 virtual void traverse(TIntermTraverser*); 415 virtual void traverse(TIntermTraverser*); 439 virtual void traverse(TIntermTraverser*); 477 virtual void traverse(TIntermTraverser*); 510 virtual void traverse(TIntermTraverser*); 547 virtual void traverse(TIntermTraverser*); 597 virtual void traverse(TIntermTraverser*);
|
D | OutputGLSLBase.cpp | 568 node->getCondition()->traverse(this); in visitSelection() 570 node->getTrueBlock()->traverse(this); in visitSelection() 572 node->getFalseBlock()->traverse(this); in visitSelection() 578 node->getCondition()->traverse(this); in visitSelection() 616 node->traverse(this); in visitAggregate() 661 params->traverse(this); in visitAggregate() 862 node->getInit()->traverse(this); in visitLoop() 866 node->getCondition()->traverse(this); in visitLoop() 870 node->getExpression()->traverse(this); in visitLoop() 890 node->getCondition()->traverse(this); in visitLoop() [all …]
|
D | DetectDiscontinuity.h | 22 bool traverse(TIntermNode *node); 39 bool traverse(TIntermNode *node);
|
D | TranslatorGLSL.cpp | 15 root->traverse(&versionGLSL); in writeVersion() 46 root->traverse(&outputGLSL); in translate()
|
D | ForLoopUnroll.cpp | 26 node->getRight()->traverse(this); in visitBinary() 56 body->traverse(this); in visitLoop()
|
D | OutputHLSL.cpp | 187 …mContext.treeRoot->traverse(this); // Output the body first to determine what has to go in the h… in output() 201 flaggedNode->traverse(this); in makeFlaggedStructMaps() 1888 expression->traverse(&searchSymbol); in visitBinary() 1895 expression->traverse(this); in visitBinary() 1897 symbolNode->traverse(this); in visitBinary() 1922 node->getLeft()->traverse(this); in visitBinary() 1938 node->getLeft()->traverse(this); in visitBinary() 2067 node->getLeft()->traverse(this); in visitBinary() 2069 node->getRight()->traverse(this); in visitBinary() 2314 symbol->traverse(this); in visitAggregate() [all …]
|
/external/chromium_org/third_party/angle/src/compiler/translator/depgraph/ |
D | DependencyGraphTraverse.cpp | 11 void TGraphNode::traverse(TDependencyGraphTraverser* graphTraverser) in traverse() function in TGraphNode 16 void TGraphParentNode::traverse(TDependencyGraphTraverser* graphTraverser) in traverse() function in TGraphParentNode 18 TGraphNode::traverse(graphTraverser); in traverse() 29 node->traverse(graphTraverser); in traverse() 35 void TGraphArgument::traverse(TDependencyGraphTraverser* graphTraverser) in traverse() function in TGraphArgument 38 TGraphParentNode::traverse(graphTraverser); in traverse() 41 void TGraphFunctionCall::traverse(TDependencyGraphTraverser* graphTraverser) in traverse() function in TGraphFunctionCall 44 TGraphParentNode::traverse(graphTraverser); in traverse() 47 void TGraphSymbol::traverse(TDependencyGraphTraverser* graphTraverser) in traverse() function in TGraphSymbol 50 TGraphParentNode::traverse(graphTraverser); in traverse() [all …]
|
D | DependencyGraphBuilder.cpp | 51 intermArgument->traverse(this); in visitFunctionCall() 75 intermChild->traverse(this); in visitAggregateChildren() 120 intermLeft->traverse(this); in visitAssignment() 131 intermRight->traverse(this); in visitAssignment() 152 intermLeft->traverse(this); in visitLogicalOp() 161 intermRight->traverse(this); in visitLogicalOp() 168 intermLeft->traverse(this); in visitBinaryChildren() 172 intermRight->traverse(this); in visitBinaryChildren() 181 intermCondition->traverse(this); in visitSelection() 189 intermTrueBlock->traverse(this); in visitSelection() [all …]
|
D | 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);
|
/external/clang/include/clang/Analysis/Analyses/ |
D | ThreadSafetyTIL.h | 403 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function 476 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function 478 return Vs.traverse(Result, Ctx); in traverse() 571 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function 592 template <class V> typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function 627 template <class V> typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx); 657 typename V::R_SExpr Literal::traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function 726 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function 762 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function 764 auto E0 = Vs.traverse(VarDecl->Definition, Vs.typeCtx(Ctx)); in traverse() [all …]
|
D | ThreadSafetyTraverse.h | 59 typename R::R_SExpr traverse(SExprRef &E, typename R::R_Ctx Ctx) { in traverse() function 60 return traverse(E.get(), Ctx); in traverse() 63 typename R::R_SExpr traverse(SExpr *E, typename R::R_Ctx Ctx) { in traverse() function 72 return self()->traverse##X(cast<X>(E), Ctx); in traverseByCase() 81 typename R::R_SExpr traverse##X(X *e, typename R::R_Ctx Ctx) { \ 82 return e->traverse(*self(), Ctx); \ 289 return Copier.traverse(E, TRV_Normal); in copy() 404 bool traverse(SExpr *E, TraversalKind K = TRV_Normal) { 411 return Visitor.traverse(E, TRV_Normal); in visit()
|
/external/clang/lib/ASTMatchers/ |
D | ASTMatchFinder.cpp | 112 traverse(*D); in findMatch() 114 traverse(*S); in findMatch() 117 traverse(*NNS); in findMatch() 120 traverse(*NNSLoc); in findMatch() 122 traverse(*Q); in findMatch() 124 traverse(*T); in findMatch() 140 return (DeclNode == nullptr) || traverse(*DeclNode); in TraverseDecl() 152 return (StmtToTraverse == nullptr) || traverse(*StmtToTraverse); in TraverseStmt() 164 return traverse(TypeNode); in TraverseType() 179 return traverse(TypeLocNode); in TraverseTypeLoc() [all …]
|
/external/chromium_org/v8/tools/ |
D | profile_view.js | 52 callTree.traverse(function(node, viewParent) { 125 this.traverse(function (node) { 136 ProfileView.prototype.traverse = function(f) { method in ProfileView
|
D | profile.js | 275 this.topDownTree_.traverse(f); 285 this.bottomUpTree_.traverse(f); 600 this.traverse(function(node, parent) { 639 CallTree.prototype.traverse = function(f) { method in CallTree 663 function traverse(node) { function 665 node.forEachChild(traverse); 668 traverse(this.root_);
|
/external/chromium_org/v8/test/mjsunit/tools/ |
D | profile_view.js | 73 view.traverse(fillFlatTree); 90 view.traverse(fillFlatTree);
|
/external/bison/src/ |
D | relation.c | 62 traverse (relation_node i) in traverse() function 74 traverse (R[i][j]); in traverse() 111 traverse (i); in relation_digraph()
|
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/jsdoc-validator/ |
D | build_jsdoc_validator_jar.py | 40 def traverse(hasher, path): function 47 traverse(hasher, os.path.join(path, entry)) 58 traverse(sha, dir)
|
/external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
D | TreeWalker2Result.java | 69 public void traverse(int pos) throws org.xml.sax.SAXException in traverse() method in TreeWalker2Result 74 super.traverse(pos); in traverse()
|
/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
D | ElemCopyOf.java | 170 tw.traverse(child); in execute() 179 tw.traverse(pos); in execute()
|