Searched refs:Traversal (Results 1 – 11 of 11) sorted by relevance
87 TraversalKind Traversal = TraversalKind::TK_AsIs; variable98 void SetTraversalKind(TraversalKind TK) { Traversal = TK; } in SetTraversalKind()99 TraversalKind GetTraversalKind() const { return Traversal; } in GetTraversalKind()102 if (Traversal == TK_IgnoreUnlessSpelledInSource && D->isImplicit())124 if (Traversal != TK_AsIs) {143 switch (Traversal) {165 if (Traversal == TK_IgnoreUnlessSpelledInSource &&219 if (Traversal == TK_IgnoreUnlessSpelledInSource && !Init->isWritten()) in Visit()532 if (Traversal == TK_IgnoreUnlessSpelledInSource && D->isDefaulted()) in VisitFunctionDecl()551 if (Traversal == TK_IgnoreUnlessSpelledInSource && D->isCXXForRangeDecl()) in VisitVarDecl()[all …]
60 TraversalKind getTraversalKind() const { return Traversal; } in getTraversalKind()61 void setTraversalKind(TraversalKind TK) { Traversal = TK; } in setTraversalKind()71 TraversalKind Traversal = TK_AsIs; variable
729 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents() local730 for (BasicBlock *POI : Traversal) { in updateBlockParents()1255 LoopBlocksTraversal Traversal(*this, LI); in perform() local1256 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(), in perform()1257 POE = Traversal.end(); in perform()
455 LoopTraversal Traversal; in runOnMachineFunction() local456 LoopTraversal::TraversalOrder TraversedMBBOrder = Traversal.traverse(mf); in runOnMachineFunction()
240 LoopTraversal Traversal; in init() local241 TraversedMBBOrder = Traversal.traverse(*MF); in init()
58 class Traversal {185 class VisitReducer : public Traversal<Self, VisitReducerBase>,
36 switch (Traversal) { in traverseIgnored()
1501 clang::TraversalKind Traversal;1506 : InnerMatcher(InnerMatcher), Traversal(TK) {}1517 return Traversal;
1854 ipsec-nat-t 4500/tcp #IPsec NAT-Traversal1855 ipsec-nat-t 4500/udp #IPsec NAT-Traversal
3037 Y. Edmund Lien A Selective Traversal Algorithm for
23156 title = "A Selective Traversal Algorithm for Binary Search Trees",