/third_party/glslang/glslang/MachineIndependent/ |
H A D | IntermTraverse.cpp | 59 void TIntermMethod::traverse(TIntermTraverser*) in traverse() function in glslang::TIntermMethod 64 void TIntermSymbol::traverse(TIntermTraverser *it) in traverse() function in glslang::TIntermSymbol 69 void TIntermConstantUnion::traverse(TIntermTraverser *it) in traverse() function in glslang::TIntermConstantUnion 84 void TIntermBinary::traverse(TIntermTraverser *it) in traverse() function in glslang::TIntermBinary 102 right->traverse(it); in traverse() 108 left->traverse(it); in traverse() 111 left->traverse(it); in traverse() 117 right->traverse(it); in traverse() 134 void TIntermUnary::traverse(TIntermTraverser *it) in traverse() function in glslang::TIntermUnary 143 operand->traverse(i in traverse() 154 void TIntermAggregate::traverse(TIntermTraverser *it) traverse() function in glslang::TIntermAggregate 194 void TIntermSelection::traverse(TIntermTraverser *it) traverse() function in glslang::TIntermSelection 226 void TIntermLoop::traverse(TIntermTraverser *it) traverse() function in glslang::TIntermLoop 266 void TIntermBranch::traverse(TIntermTraverser *it) traverse() function in glslang::TIntermBranch 286 void TIntermSwitch::traverse(TIntermTraverser* it) traverse() function in glslang::TIntermSwitch [all...] |
H A D | propagateNoContraction.cpp | 266 // preciseness of the return expression from it when we traverse the 308 seq[i]->traverse(this); in visitAggregate() 323 node->getExpression()->traverse(this); in visitBranch() 333 node->getOperand()->traverse(this); in visitUnary() 364 node->getLeft()->traverse(this); in visitBinary() 388 node->getRight()->traverse(this); in visitBinary() 401 // For a dereference node, there is no need to traverse the right child in visitBinary() 405 // For other binary nodes, still traverse the right node. in visitBinary() 407 node->getRight()->traverse(this); in visitBinary() 435 root->traverse( in getSymbolToDefinitionMappingAndPreciseSymbolIDs() [all...] |
/third_party/skia/third_party/externals/swiftshader/src/OpenGL/compiler/ |
H A D | IntermTraverse.cpp | 34 void TIntermSymbol::traverse(TIntermTraverser* it) in traverse() function in TIntermSymbol 39 void TIntermConstantUnion::traverse(TIntermTraverser* it) in traverse() function in TIntermConstantUnion 47 void TIntermBinary::traverse(TIntermTraverser* it) in traverse() function in TIntermBinary 70 right->traverse(it); in traverse() 80 left->traverse(it); in traverse() 87 left->traverse(it); in traverse() 97 right->traverse(it); in traverse() 117 void TIntermUnary::traverse(TIntermTraverser* it) in traverse() function in TIntermUnary 126 operand->traverse(it); in traverse() 137 void TIntermAggregate::traverse(TIntermTraverse function in TIntermAggregate 193 void TIntermSelection::traverse(TIntermTraverser* it) traverse() function in TIntermSelection 225 void TIntermSwitch::traverse(TIntermTraverser *it) traverse() function in TIntermSwitch 247 void TIntermCase::traverse(TIntermTraverser *it) traverse() function in TIntermCase 264 void TIntermLoop::traverse(TIntermTraverser* it) traverse() function in TIntermLoop 324 void TIntermBranch::traverse(TIntermTraverser* it) traverse() function in TIntermBranch [all...] |
H A D | intermediate.h | 276 virtual void traverse(TIntermTraverser*) = 0; 365 virtual void traverse(TIntermTraverser*); 396 virtual void traverse(TIntermTraverser*); 422 virtual void traverse(TIntermTraverser*); 448 virtual void traverse(TIntermTraverser*); 481 void traverse(TIntermTraverser*) override; 522 void traverse(TIntermTraverser*) override; 546 void traverse(TIntermTraverser*) override; 620 virtual void traverse(TIntermTraverser*); 644 void traverse(TIntermTraverse [all...] |
H A D | intermOut.cpp | 350 node->getCondition()->traverse(this); in visitSelection() 355 node->getTrueBlock()->traverse(this); in visitSelection() 362 node->getFalseBlock()->traverse(this); in visitSelection() 423 node->getCondition()->traverse(this); in visitLoop() 430 node->getBody()->traverse(this); in visitLoop() 437 node->getExpression()->traverse(this); in visitLoop() 462 node->getExpression()->traverse(this); in visitBranch() 482 root->traverse(&it); in outputTree()
|
H A D | AnalyzeCallDepth.cpp | 24 (*current)->traverse(analysis); in traverseCaseBody() 110 root->traverse(this); in AnalyzeCallDepth() 147 condition->traverse(this); in visitSwitch() 157 // If there's a default case, traverse it here in visitSwitch()
|
/third_party/python/Lib/ |
H A D | ast.py | 684 """Methods in this class recursively traverse an AST and 804 def traverse(self, node): member in _Unparser 807 self.traverse(item) 818 self.traverse(node) 824 self.traverse(node.body[1:]) 826 self.traverse(node.body) 839 lambda: self.write(", "), self.traverse, node.argtypes 843 self.traverse(node.returns) 848 self.traverse(node.value) 853 self.traverse(nod [all...] |
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/ |
H A D | IntermTraverse.cpp | 19 // each node. Traversal is done recursively through the node member function traverse(). Nodes with 23 void TIntermTraverser::traverse(T *node) in traverse() function in sh::TIntermTraverser 43 node->getChildNode(childIndex)->traverse(this); in traverse() 60 template void TIntermTraverser::traverse(TIntermNode *); 62 void TIntermNode::traverse(TIntermTraverser *it) in traverse() function in sh::TIntermNode 64 it->traverse(this); in traverse() 67 void TIntermSymbol::traverse(TIntermTraverser *it) in traverse() function in sh::TIntermSymbol 73 void TIntermConstantUnion::traverse(TIntermTraverser *it) in traverse() function in sh::TIntermConstantUnion 79 void TIntermFunctionPrototype::traverse(TIntermTraverser *it) in traverse() function in sh::TIntermFunctionPrototype 85 void TIntermBinary::traverse(TIntermTraverse function in sh::TIntermBinary 90 void TIntermUnary::traverse(TIntermTraverser *it) traverse() function in sh::TIntermUnary 95 void TIntermFunctionDefinition::traverse(TIntermTraverser *it) traverse() function in sh::TIntermFunctionDefinition 100 void TIntermBlock::traverse(TIntermTraverser *it) traverse() function in sh::TIntermBlock 105 void TIntermAggregate::traverse(TIntermTraverser *it) traverse() function in sh::TIntermAggregate 110 void TIntermLoop::traverse(TIntermTraverser *it) traverse() function in sh::TIntermLoop 115 void TIntermPreprocessorDirective::traverse(TIntermTraverser *it) traverse() function in sh::TIntermPreprocessorDirective [all...] |
H A D | ReplaceVariable.cpp | 113 root->traverse(&traverser); in ReplaceVariable() 122 root->traverse(&traverser); in ReplaceVariables() 131 root->traverse(&traverser); in GetDeclaratorReplacements() 141 root->traverse(&traverser); in ReplaceVariableWithTyped()
|
H A D | FindPreciseNodes.cpp | 168 binary->getRight()->traverse(traverser); in TraverseIndexNodesOnly() 390 node->getRight()->traverse(this); 422 initExpression->traverse(this); 500 expression->traverse(this); in propagatePrecise() 543 node->getRight()->traverse(this); 557 node->getRight()->traverse(this); 596 node->getChildNode(selectedFieldIndex)->traverse(this); 619 node->getChildNode(paramIndex)->traverse(this); 643 root->traverse(&infoGather); in FindPreciseNodes()
|
/third_party/skia/third_party/externals/angle2/src/compiler/translator/ |
H A D | ASTMetadataHLSL.cpp | 21 // Class used to traverse the AST of a function definition, checking if the 54 void traverse(TIntermFunctionDefinition *node) in traverse() function in sh::__anon19734::PullGradient 56 node->traverse(this); in traverse() 159 void traverse(TIntermFunctionDefinition *node) in traverse() function in sh::__anon19734::PullComputeDiscontinuousAndGradientLoops 161 node->traverse(this); in traverse() 324 void traverse(TIntermFunctionDefinition *node) in traverse() function in sh::__anon19734::PushDiscontinuousLoops 326 node->traverse(this); in traverse() 409 pull.traverse(callDag.getRecordFromIndex(i).node); in CreateASTMetadataHLSL() 423 pull.traverse(callDag.getRecordFromIndex(i).node); in CreateASTMetadataHLSL() 431 push.traverse(callDa in CreateASTMetadataHLSL() [all...] |
H A D | OutputTree.cpp | 25 // 1. Show an example of how to iterate tree. Functions can also directly call traverse() on 274 node->getLeft()->traverse(this); in visitBinary() 506 node->getCondition()->traverse(this); in visitTernary() 512 node->getTrueExpression()->traverse(this); in visitTernary() 518 node->getFalseExpression()->traverse(this); in visitTernary() 536 node->getCondition()->traverse(this); in visitIfElse() 542 node->getTrueBlock()->traverse(this); in visitIfElse() 553 node->getFalseBlock()->traverse(this); in visitIfElse() 646 node->getCondition()->traverse(this); in visitLoop() 657 node->getBody()->traverse(thi in visitLoop() [all...] |
H A D | OutputHLSL.cpp | 435 treeRoot->traverse(this); in output() 1455 node->getLeft()->traverse(this); in visitBinary() 1460 arrayElement->traverse(this); in visitBinary() 1482 argument->traverse(this); in visitBinary() 1485 node->getLeft()->traverse(this); in visitBinary() 1499 node->getRight()->traverse(this); in visitBinary() 1507 node->getLeft()->traverse(this); in visitBinary() 1573 node->getLeft()->traverse(this); in visitBinary() 1589 node->getLeft()->traverse(this); in visitBinary() 2126 statement->traverse(thi in visitBlock() [all...] |
H A D | OutputGLSLBase.cpp | 790 node->getCondition()->traverse(this); in visitTernary() 792 node->getTrueExpression()->traverse(this); in visitTernary() 794 node->getFalseExpression()->traverse(this); in visitTernary() 804 node->getCondition()->traverse(this); in visitIfElse() 857 curNode->traverse(this); in visitBlock() 874 prototype->traverse(this); in visitFunctionDefinition() 990 node->getInit()->traverse(this); in visitLoop() 994 node->getCondition()->traverse(this); in visitLoop() 998 node->getExpression()->traverse(this); in visitLoop() 1007 node->getCondition()->traverse(thi in visitLoop() [all...] |
/third_party/jsframework/runtime/main/reactivity/ |
H A D | watcher.js | 68 traverse(value); 183 * <p>Recursively traverse an object to evoke all converted<br> 191 function traverse (val, seen) { 210 while (i--) traverse(val[i], seen); 214 while (i--) traverse(val[keys[i]], seen);
|
/third_party/node/deps/v8/tools/ |
H A D | profile_view.js | 52 callTree.traverse(function(node, viewParent) { 125 this.traverse(function (node) { 136 ProfileView.prototype.traverse = function(f) {
|
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/ |
H A D | SimplifyLoopConditions.cpp | 71 // If we're not inside loop initialization, condition, or expression, we only need to traverse nodes 176 node->getInit()->traverse(this); in traverseLoop() 181 node->getCondition()->traverse(this); in traverseLoop() 186 node->getExpression()->traverse(this); in traverseLoop() 464 // We traverse the body of the loop even if the loop is transformed. in traverseLoop() 466 node->getBody()->traverse(this); in traverseLoop() 476 root->traverse(&traverser); in SimplifyLoopConditions() 487 root->traverse(&traverser); in SimplifyLoopConditions()
|
H A D | EmulateMultiDrawShaderBuiltins.cpp | 127 root->traverse(&traverser); in EmulateGLDrawID() 179 root->traverse(&traverserVertexID); in EmulateGLBaseVertexBaseInstance() 187 root->traverse(&traverserBaseVertex); in EmulateGLBaseVertexBaseInstance() 222 root->traverse(&traverserInstance); in EmulateGLBaseVertexBaseInstance() 258 // Make sure the order in uniforms is the same as the traverse order in EmulateGLBaseVertexBaseInstance()
|
H A D | RemoveUnreferencedVariables.cpp | 296 // We traverse blocks in reverse order. This way reference counts can be decremented when in traverseBlock() 313 (*iter)->traverse(this); in traverseBlock() 328 // We traverse loops in reverse order as well. The loop body gets traversed before the init in traverseLoop() 340 // We don't need to traverse loop expressions or conditions since they can't be declarations in traverseLoop() 349 node->getBody()->traverse(this); in traverseLoop() 352 node->getInit()->traverse(this); in traverseLoop() 364 root->traverse(&collector); in RemoveUnreferencedVariables() 367 root->traverse(&traverser); in RemoveUnreferencedVariables()
|
H A D | SeparateDeclarations.cpp | 53 root->traverse(&separateDecl); in apply() 109 declarator->traverse(this); in separateDeclarator() 166 initializer->traverse(this); in separateDeclarator()
|
/third_party/skia/third_party/externals/angle2/src/tests/compiler_tests/ |
H A D | OVR_multiview2_test.cpp | 182 root->traverse(&viewIDByNameAndQualifier); in VariableOccursNTimes() 189 root->traverse(&viewIDByName); in VariableOccursNTimes() 476 mASTRoot->traverse(&glInstanceIDByName); in TEST_F() 480 mASTRoot->traverse(&glInstanceIDByQualifier); in TEST_F() 484 mASTRoot->traverse(&instanceIDByName); in TEST_F() 508 mASTRoot->traverse(&glViewIDOVRByName); in TEST_F() 512 mASTRoot->traverse(&glViewIDOVRByQualifier); in TEST_F() 517 mASTRoot->traverse(&viewIDByNameAndQualifier); in TEST_F()
|
H A D | OVR_multiview_test.cpp | 179 root->traverse(&viewIDByNameAndQualifier); in VariableOccursNTimes() 186 root->traverse(&viewIDByName); in VariableOccursNTimes() 492 mASTRoot->traverse(&glInstanceIDByName); in TEST_F() 496 mASTRoot->traverse(&glInstanceIDByQualifier); in TEST_F() 500 mASTRoot->traverse(&instanceIDByName); in TEST_F() 524 mASTRoot->traverse(&glViewIDOVRByName); in TEST_F() 528 mASTRoot->traverse(&glViewIDOVRByQualifier); in TEST_F() 533 mASTRoot->traverse(&viewIDByNameAndQualifier); in TEST_F()
|
/third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/ |
H A D | EmitMetal.cpp | 765 node.traverse(this); in groupedTraverse() 1575 leftNode.traverse(this); 1577 rightNode.traverse(this); 1625 arg.traverse(this); 1651 condNode.traverse(this); 1657 thenNode->traverse(this); 1669 elseNode->traverse(this); 1684 switchNode->getInit()->traverse(this); 1689 switchNode->getStatementList()->traverse(this); 1703 condExpr->traverse(thi [all...] |
/third_party/libabigail/include/ |
H A D | abg-ir.h | 27 #include "abg-traverse.h" 449 traverse(ir_node_visitor& v); 777 traverse(ir_node_visitor& v); 1435 traverse(ir_node_visitor&); 1591 traverse(ir_node_visitor& v); 1873 traverse(ir_node_visitor&); 1995 traverse(ir_node_visitor&); 2110 traverse(ir_node_visitor&); 2145 traverse(ir_node_visitor&); 2166 traverse(ir_node_visito [all...] |
/third_party/python/Doc/tools/extensions/ |
H A D | glossary_search.py | 28 for node in doctree.traverse(glossary): 29 for glossary_item in node.traverse(definition_list_item):
|