| /external/clang/include/clang/Analysis/Analyses/ |
| D | ThreadSafetyTIL.h | 390 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
451 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
453 return Vs.traverse(Result, Ctx); in traverse()
480 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
502 template <class V> typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
538 template <class V> typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx);
569 typename V::R_SExpr Literal::traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
638 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
675 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
677 auto E0 = Vs.traverse(VarDecl->Definition, Vs.typeCtx(Ctx)); in traverse()
[all …]
|
| D | ThreadSafetyTraverse.h | 63 typename R::R_SExpr traverse(T* &E, typename R::R_Ctx Ctx) { in traverse() function
78 return self()->traverse##X(cast<X>(E), Ctx); in traverseByCase()
88 typename R::R_SExpr traverse##X(X *e, typename R::R_Ctx Ctx) { \
89 return e->traverse(*self(), Ctx); \
267 bool traverse(SExpr *E, TraversalKind K = TRV_Normal) {
274 return Visitor.traverse(E, TRV_Normal); in visit()
|
| /external/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/clang/lib/ASTMatchers/ |
| D | ASTMatchFinder.cpp | 116 traverse(*D); in findMatch()
118 traverse(*S); in findMatch()
121 traverse(*NNS); in findMatch()
124 traverse(*NNSLoc); in findMatch()
126 traverse(*Q); in findMatch()
128 traverse(*T); in findMatch()
144 return (DeclNode == nullptr) || traverse(*DeclNode); in TraverseDecl()
156 return (StmtToTraverse == nullptr) || traverse(*StmtToTraverse); in TraverseStmt()
168 return traverse(TypeNode); in TraverseType()
183 return traverse(TypeLocNode); in TraverseTypeLoc()
[all …]
|
| /external/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/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()
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| D | DTMTreeWalker.java | 106 public void traverse(int pos) throws org.xml.sax.SAXException in traverse() method in DTMTreeWalker
158 public void traverse(int pos, int top) throws org.xml.sax.SAXException in traverse() method in DTMTreeWalker
|
| /external/iptables/extensions/ |
| D | libxt_TRACE.man | 2 the packets as those traverse the tables, chains, rules.
|
| D | libipt_TTL.man | 2 how many hops (routers) a packet can traverse until it's time to live is
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/ |
| D | DOM3SerializerImpl.java | 111 walker.traverse(node); in serializeDOM3()
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| D | TreeWalker.java | 152 public void traverse(Node pos) throws org.xml.sax.SAXException in traverse() method in TreeWalker
223 public void traverse(Node pos, Node top) throws org.xml.sax.SAXException in traverse() method in TreeWalker
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| D | TreeWalker.java | 136 public void traverse(Node pos) throws org.xml.sax.SAXException in traverse() method in TreeWalker
192 public void traverse(Node pos, Node top) throws org.xml.sax.SAXException in traverse() method in TreeWalker
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| D | org.apache.jasper_5.5.17.v201004212143.jar | META-INF/MANIFEST.MF
META-INF/ECLIPSEF.SF
META-INF/ECLIPSEF ... |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| D | TokenConstants.as | 5 /** imaginary tree navigation type; traverse "get child" link */
|
| /external/llvm/include/llvm/Analysis/ |
| D | LoopInfoImpl.h | 416 void traverse(BlockT *EntryBlock);
424 void PopulateLoopsDFS<BlockT, LoopT>::traverse(BlockT *EntryBlock) { in traverse() function
503 DFS.traverse(DomRoot->getBlock()); in Analyze()
|
| /external/llvm/test/CodeGen/ARM/ |
| D | 2011-04-27-IfCvtBug.ll | 4 ; successors) and use inverse depth first search to traverse the BBs. However
|
| /external/clang/lib/ARCMigrate/ |
| D | Transforms.h | 123 void traverse(TranslationUnitDecl *TU);
|
| D | Transforms.cpp | 518 void MigrationContext::traverse(TranslationUnitDecl *TU) { in traverse() function in MigrationContext
577 MigrateCtx.traverse(pass.Ctx.getTranslationUnitDecl()); in traverseAST()
|
| /external/apache-xml/src/main/java/org/apache/xalan/processor/ |
| D | TransformerFactoryImpl.java | 119 walker.traverse(node); in processFromNode()
296 walker.traverse(node); in getAssociatedStylesheet()
|
| D | ProcessorInclude.java | 235 walker.traverse(node); in parse()
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2002-05-12-InstListChange.txt | 21 they have to traverse basic blocks to remove constant propogated
|
| /external/eigen/doc/ |
| D | StorageOrders.dox | 77 …- Algorithms that traverse a matrix row by row will go faster when the matrix is stored in row-maj…
|