/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | LoopTraversal.h | 106 TraversalOrder traverse(MachineFunction &MF);
|
H A D | RDFLiveness.h | 137 void traverse(MachineBasicBlock *B, RefMap &LiveIn);
|
/freebsd-12-stable/sbin/dump/ |
H A D | Makefile | 10 # traverse.c traverses the file system 24 SRCS= itime.c main.c optr.c dumprmt.c tape.c traverse.c unctime.c cache.c
|
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyTIL.h | 290 // typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { 291 // traverse all subexpressions, following the traversal/rewriter interface. 407 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Variable 467 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Future 468 assert(Result && "Cannot traverse Future that has not been forced."); 469 return Vs.traverse(Result, Ctx); 495 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Undefined 516 template <class V> typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Wildcard 550 template <class V> typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx); 578 typename V::R_SExpr Literal::traverse( function in class:clang::threadSafety::Literal 646 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::LiteralPtr 683 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Function 738 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::SFunction 778 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Code 813 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Field 852 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Apply 889 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::SApply 943 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Project 977 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Call 1011 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Alloc 1040 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Load 1070 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Store 1106 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::ArrayIndex 1143 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::ArrayAdd 1182 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::UnaryOp 1227 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::BinaryOp 1268 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Cast 1323 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Phi 1386 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Goto 1436 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Branch 1470 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Return 1612 typename V::R_BasicBlock traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::BasicBlock 1754 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::SCFG 1795 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Identifier 1829 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::IfThenElse 1874 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Let [all...] |
H A D | ThreadSafetyTraverse.h | 32 // Defines an interface used to traverse SExprs. Traversals have been made as 38 // Each SExpr class provides a traverse method, which does the following: 39 // * e->traverse(v): 41 // for (i = 1..n) r_i = v.traverse(e_i); 46 // * v.traverse(e): 49 // return e->traverse(v). 68 typename R::R_SExpr traverse(T* &E, typename R::R_Ctx Ctx) { function in class:clang::threadSafety::til::Traversal 83 return self()->traverse##X(cast<X>(E), Ctx); 93 typename R::R_SExpr traverse##X(X *e, typename R::R_Ctx Ctx) { \ 94 return e->traverse(*sel 294 bool traverse(SExpr *E, TraversalKind K = TRV_Normal) { function in class:clang::threadSafety::til::VisitReducer [all...] |
/freebsd-12-stable/contrib/llvm-project/clang/lib/Tooling/Syntax/ |
H A D | Tree.cpp | 19 static void traverse(const syntax::Node *N, function in namespace:__anon3522 23 traverse(C, Visit); 27 static void traverse(syntax::Node *N, function in namespace:__anon3522 29 traverse(static_cast<const syntax::Node *>(N), [&](const syntax::Node *N) { 101 traverse(N, [&](Node *C) { C->Original = false; }); 196 traverse(this, [&](const syntax::Node *N) { 227 traverse(this, [&](const syntax::Node *N) { N->assertInvariants(); });
|
/freebsd-12-stable/cddl/usr.bin/ctfconvert/ |
H A D | Makefile | 27 traverse.c \
|
/freebsd-12-stable/cddl/usr.bin/ctfmerge/ |
H A D | Makefile | 22 traverse.c \
|
/freebsd-12-stable/contrib/llvm-project/clang/lib/ASTMatchers/ |
H A D | ASTMatchFinder.cpp | 86 // to traverse: use 1 for matching the children and INT_MAX for 109 traverse(*D); 111 traverse(*S); 114 traverse(*NNS); 117 traverse(*NNSLoc); 119 traverse(*Q); 121 traverse(*T); 123 traverse(*C); 139 return (DeclNode == nullptr) || traverse(*DeclNode); 182 // The QualType is matched inside traverse 332 bool traverse(const T &Node) { function in class:clang::ast_matchers::internal::__anon2762::MatchChildASTVisitor [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LoopTraversal.cpp | 24 LoopTraversal::TraversalOrder LoopTraversal::traverse(MachineFunction &MF) { function in class:LoopTraversal
|
H A D | ReachingDefAnalysis.cpp | 151 LoopTraversal::TraversalOrder TraversedMBBOrder = Traversal.traverse(mf);
|
H A D | RDFLiveness.cpp | 87 // is to traverse past phi nodes to the actual defs arising from the code 490 // Must traverse the reached-def chain. Consider: 611 // for a given phi use, and traverse the list until the propagated ref 803 traverse(&MF.front(), LiveIn); 928 void Liveness::traverse(MachineBasicBlock *B, RefMap &LiveIn) { function in class:Liveness 940 // traverse(C, LU) 957 traverse(SB, L);
|
H A D | ExecutionDomainFix.cpp | 456 LoopTraversal::TraversalOrder TraversedMBBOrder = Traversal.traverse(mf);
|
/freebsd-12-stable/bin/ls/ |
H A D | ls.c | 101 static void traverse(int, char **, int); 606 traverse(argc, argv, fts_options); 608 traverse(1, dotav, fts_options); 621 traverse(int argc, char *argv[], int options) function
|
/freebsd-12-stable/contrib/byacc/ |
H A D | lalr.c | 27 static void traverse(int i); 582 traverse(i); 590 traverse(int i) function 613 traverse(j);
|
/freebsd-12-stable/contrib/llvm-project/clang/lib/ARCMigrate/ |
H A D | Transforms.h | 122 void traverse(TranslationUnitDecl *TU);
|
H A D | Transforms.cpp | 509 void MigrationContext::traverse(TranslationUnitDecl *TU) { function in class:MigrationContext 568 MigrateCtx.traverse(pass.Ctx.getTranslationUnitDecl());
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | LoopInfoImpl.h | 463 // this loop, which we must traverse. 484 void traverse(BlockT *EntryBlock); 492 void PopulateLoopsDFS<BlockT, LoopT>::traverse(BlockT *EntryBlock) { function in class:llvm::PopulateLoopsDFS 563 DFS.traverse(DomRoot->getBlock());
|
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/ASTMatchers/ |
H A D | ASTMatchers.h | 704 /// traverse(ast_type_traits::TK_IgnoreImplicitCastsAndParentheses, 710 internal::Matcher<T> traverse(ast_type_traits::TraversalKind TK, function in namespace:clang::ast_matchers 720 traverse(ast_type_traits::TraversalKind TK, function in namespace:clang::ast_matchers 731 traverse(ast_type_traits::TraversalKind TK, function in namespace:clang::ast_matchers 741 traverse(ast_type_traits::TraversalKind TK, function in namespace:clang::ast_matchers 753 traverse( function in namespace:clang::ast_matchers 766 traverse( function in namespace:clang::ast_matchers
|
/freebsd-12-stable/contrib/llvm-project/lldb/include/lldb/Core/ |
H A D | ValueObject.h | 241 SetSyntheticChildrenTraversal(SyntheticChildrenTraversal traverse) { argument 242 m_synthetic_children_traversal = traverse;
|
/freebsd-12-stable/sys/net/ |
H A D | radix.c | 468 log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p); 486 log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p); 1037 * At the top of the tree, no need to traverse the right
|
/freebsd-12-stable/sbin/routed/ |
H A D | radix.c | 393 log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p); 408 log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonLoopIdiomRecognition.cpp | 226 template <typename FuncT> void traverse(Value *V, FuncT F); 271 void Simplifier::Context::traverse(Value *V, FuncT F) { function in class:Simplifier::Context 356 traverse(V, Record); 364 traverse(V, Use); 377 traverse(V, Unuse);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | DebugInfo.cpp | 422 void traverseAndRemap(MDNode *N) { traverse(N); } 551 void traverse(MDNode *); 556 void DebugTypeInfoRemoval::traverse(MDNode *N) { function in class:DebugTypeInfoRemoval
|
/freebsd-12-stable/contrib/llvm-project/clang/lib/Analysis/ |
H A D | ThreadSafety.cpp | 1146 std::function<bool (const ValueDecl*)> traverse = [&](const ValueDecl* Vd) { 1171 if (traverse(Vdb)) { 1183 traverse(StartVd); 2253 /// We traverse the blocks in the CFG, compute the set of mutexes that are held 2549 /// We traverse the blocks in the CFG, compute the set of mutexes that are held
|