| /src/external/gpl3/gdb.old/dist/gdb/ |
| filename-seen-cache.h | 45 /* Traverse all cache entries, calling CALLBACK on each. The
47 void traverse (gdb::function_view<void (const char *filename)> callback) function in class:filename_seen_cache
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| LoopTraversal.cpp | 24 LoopTraversal::TraversalOrder LoopTraversal::traverse(MachineFunction &MF) { function in class:LoopTraversal
|
| ReachingDefAnalysis.cpp | 212 traverse();
227 traverse();
236 TraversedMBBOrder = Traversal.traverse(*MF);
239 void ReachingDefAnalysis::traverse() { function in class:ReachingDefAnalysis
240 // Traverse the basic blocks.
|
| RDFLiveness.cpp | 90 // is to traverse past phi nodes to the actual defs arising from the code
442 // Traverse all reached defs. This time dead defs cannot be ignored.
530 // Must traverse the reached-def chain. Consider:
651 // for a given phi use, and traverse the list until the propagated ref
860 traverse(&MF.front(), LiveIn);
982 void Liveness::traverse(MachineBasicBlock *B, RefMap &LiveIn) { function in class:Liveness
994 // traverse(C, LU)
1011 traverse(SB, L);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| hash-set.h | 91 void traverse (Arg a) const function in class:hash_set
|
| hash-map.h | 229 void traverse (Arg a) const function
239 void traverse (Arg a) const function
|
| symbol-summary.h | 192 void traverse (Arg a) const function
194 m_map.template traverse <f> (a);
380 void traverse (Arg a) const function
691 void traverse (Arg a) const function
693 m_map.template traverse <f> (a);
854 void traverse (Arg a) const function
|
| hash-table.h | 471 void traverse (Argument argument);
1189 hash_table<Descriptor, Lazy, Allocator>::traverse (Argument argument) function in class:hash_table
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| hash-set.h | 86 void traverse (Arg a) const function in class:hash_set
|
| hash-map.h | 225 void traverse (Arg a) const function
235 void traverse (Arg a) const function
|
| symbol-summary.h | 192 void traverse (Arg a) const function
194 m_map.template traverse <f> (a);
380 void traverse (Arg a) const function
691 void traverse (Arg a) const function
693 m_map.template traverse <f> (a);
854 void traverse (Arg a) const function
|
| hash-table.h | 471 void traverse (Argument argument);
1100 hash_table<Descriptor, Lazy, Allocator>::traverse (Argument argument) function in class:hash_table
|
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/ |
| Tree.cpp | 19 static void traverse(const syntax::Node *N, function in namespace:__anon3539
23 traverse(&C, Visit);
27 static void traverse(syntax::Node *N, function in namespace:__anon3539
29 traverse(static_cast<const syntax::Node *>(N), [&](const syntax::Node *N) {
164 traverse(N, [](Node *C) { C->Original = false; });
260 traverse(this, [&](const syntax::Node *N) {
308 traverse(this, [&](const syntax::Node *N) { N->assertInvariants(); });
|
| /src/external/apache2/llvm/dist/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 805 /// traverse(TK_IgnoreUnlessSpelledInSource,
811 internal::Matcher<T> traverse(TraversalKind TK, function in namespace:clang::ast_matchers
821 traverse(TraversalKind TK, const internal::BindableMatcher<T> &InnerMatcher) { function in namespace:clang::ast_matchers
831 traverse(TraversalKind TK, function in namespace:clang::ast_matchers
841 traverse(TraversalKind TK, const internal::ArgumentAdaptingMatcherFuncAdaptor< function in namespace:clang::ast_matchers
852 traverse(TraversalKind TK, function in namespace:clang::ast_matchers
862 traverse(TraversalKind TK, const internal::MapAnyOfHelper<T...> &InnerMatcher) { function in namespace:clang::ast_matchers
863 return traverse(TK, InnerMatcher.with());
|
| /src/bin/ls/ |
| ls.c | 73 static void traverse(int, char **, int);
403 traverse(argc, argv, fts_options);
405 traverse(1, dotav, fts_options);
413 * Traverse() walks the logical directory structure specified by the argv list
419 traverse(int argc, char *argv[], int options) function
517 * directory p, and will be signalled in traverse().
|
| /src/external/apache2/llvm/dist/clang/lib/ARCMigrate/ |
| Transforms.cpp | 510 void MigrationContext::traverse(TranslationUnitDecl *TU) { function in class:MigrationContext
569 MigrateCtx.traverse(pass.Ctx.getTranslationUnitDecl());
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 473 // this loop, which we must traverse.
494 void traverse(BlockT *EntryBlock);
502 void PopulateLoopsDFS<BlockT, LoopT>::traverse(BlockT *EntryBlock) { function in class:llvm::PopulateLoopsDFS
573 DFS.traverse(DomRoot->getBlock());
|
| /src/external/bsd/byacc/dist/ |
| lalr.c | 31 static void traverse(int i);
581 traverse(i);
589 traverse(int i) function
612 traverse(j);
|
| /src/sys/net/ |
| radix.c | 392 #define traverse(__head, __rn) rn_treeprint((__head), rn_dbg_print, (__rn)) macro
455 log(LOG_DEBUG, "%s: Going In:\n", __func__), traverse(head, p);
471 traverse(head, p);
831 log(LOG_DEBUG, "%s: Going In:\n", __func__), traverse(head, tt);
929 traverse(head, tt);
|
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| 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).
62 // Traverse an expression -- returning a result of type R_SExpr.
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);
90 // Traverse e, by static dispatch on the type "X" of e
294 bool traverse(SExpr *E, TraversalKind K = TRV_Normal) { function in class:clang::threadSafety::til::VisitReducer
[all...] |
| 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(V &Vs, typename V::R_Ctx Ctx) function in class:clang::threadSafety::Literal
648 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::LiteralPtr
685 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Function
740 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::SFunction
780 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Code
815 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Field
854 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Apply
891 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::SApply
945 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Project
979 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Call
1013 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Alloc
1042 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Load
1072 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Store
1108 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::ArrayIndex
1145 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::ArrayAdd
1184 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::UnaryOp
1229 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::BinaryOp
1270 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Cast
1325 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Phi
1388 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Goto
1438 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Branch
1472 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Return
1614 typename V::R_BasicBlock traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::BasicBlock
1756 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::SCFG
1797 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Identifier
1831 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::IfThenElse
1876 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { function in class:clang::threadSafety::Let
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 94 // to traverse: use 1 for matching the children and INT_MAX for
109 // - Traverse(node) calls BaseTraverse(node) when it needs
111 // - BaseTraverse(node) then calls (via VisitorBase::Traverse*(node))
112 // Traverse*(c) for each child c of 'node'.
113 // - Traverse*(c) in turn calls Traverse(c), completing the
118 traverse(*D);
120 traverse(*S);
123 traverse(*NNS);
126 traverse(*NNSLoc)
382 bool traverse(const T &Node) { function in class:clang::ast_matchers::internal::__anon2700::MatchChildASTVisitor
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| DebugInfo.cpp | 510 void traverseAndRemap(MDNode *N) { traverse(N); }
639 void traverse(MDNode *);
644 void DebugTypeInfoRemoval::traverse(MDNode *N) { function in class:DebugTypeInfoRemoval
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonLoopIdiomRecognition.cpp | 244 template <typename FuncT> void traverse(Value *V, FuncT F);
289 void Simplifier::Context::traverse(Value *V, FuncT F) { function in class:Simplifier::Context
374 traverse(V, Record);
382 traverse(V, Use);
395 traverse(V, Unuse);
|
| /src/external/bsd/openldap/dist/servers/slapd/overlays/ |
| homedir.c | 675 traverse( const char *path, const traverse_cb *cb, void *ctx ) function
687 "traverse: %s\n", path );
696 report_errno( "traverse", "lstat", path );
706 "traverse: top of loop with \"%s\"\n",
731 "traverse: grab_names %s failed\n",
775 "traverse: cb signaled completion\n" );
782 "traverse: cb signaled failure\n" );
786 "traverse: allocation failed\n" );
964 rc = traverse( source_path, &cb, ctx );
1030 /* traverse func for rm -rf *
[all...] |
