| /freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
| H A D | ThreadSafetyTIL.h | 408 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
468 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
470 return Vs.traverse(Result, Ctx); in traverse()
500 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
521 template <class V> typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
555 template <class V> typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx);
587 typename V::R_SExpr Literal::traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
656 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
695 typename V::R_SExpr traverse(V &Vs, typename V::R_Ctx Ctx) { in traverse() function
697 auto E0 = Vs.traverse(VarDecl->Definition, Vs.typeCtx(Ctx)); in traverse()
[all …]
|
| H A D | ThreadSafetyTraverse.h | 68 typename R::R_SExpr traverse(T* &E, typename R::R_Ctx Ctx) { in traverse() function
83 return self()->traverse##X(cast<X>(E), Ctx); in traverseByCase()
93 typename R::R_SExpr traverse##X(X *e, typename R::R_Ctx Ctx) { \
94 return e->traverse(*self(), Ctx); \
294 bool traverse(SExpr *E, TraversalKind K = TRV_Normal) {
301 return Visitor.traverse(E, TRV_Normal); in visit()
|
| /freebsd/contrib/llvm-project/clang/lib/ASTMatchers/ |
| H A D | ASTMatchFinder.cpp | 121 traverse(*D); in findMatch()
123 traverse(*S); in findMatch()
126 traverse(*NNS); in findMatch()
129 traverse(*NNSLoc); in findMatch()
131 traverse(*Q); in findMatch()
133 traverse(*T); in findMatch()
135 traverse(*C); in findMatch()
138 traverse(*TALoc); in findMatch()
140 traverse(*A); in findMatch()
161 return (DeclNode == nullptr) || traverse(*DeclNode); in TraverseDecl()
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Tooling/Syntax/ |
| H A D | Tree.cpp | 18 static void traverse(const syntax::Node *N, in traverse() function
22 traverse(&C, Visit); in traverse()
26 static void traverse(syntax::Node *N, in traverse() function
28 traverse(static_cast<const syntax::Node *>(N), [&](const syntax::Node *N) { in traverse()
145 traverse(N, [](Node *C) { C->Original = false; }); in replaceChildRangeLowLevel()
229 traverse(this, [&](const syntax::Node *N) { in dumpTokens()
278 traverse(this, [&](const syntax::Node *N) { N->assertInvariants(); }); in assertInvariantsRecursive()
|
| /freebsd/sys/fs/fdescfs/ |
| H A D | fdesc_vnops.c | 251 bool traverse; member
265 if ((a->traverse || (fdm->flags & FMNT_NODUP) != 0) && in fdesc_get_ino_alloc()
297 bool traverse; in fdesc_lookup() local
342 traverse = ((cnp->cn_flags & ISLASTCN) == 0 || in fdesc_lookup()
345 if (traverse && fp->f_type != DTYPE_VNODE) { in fdesc_lookup()
366 arg.traverse = traverse; in fdesc_lookup()
|
| /freebsd/contrib/llvm-project/clang/include/clang/ExtractAPI/Serialization/ |
| H A D | APISetVisitor.h | 93 bool traverse##CLASS(const CLASS *Record) { \
155 TRY_TO(traverse##CLASS(static_cast<const CLASS *>(Record))); \ in traverseAPIRecord()
|
| /freebsd/contrib/pkgconf/t/cli/ |
| H A D | maximum-traverse-depth.test | 2 ToolArgs: --maximum-traverse-depth=1 --libs bar
|
| /freebsd/contrib/byacc/ |
| H A D | lalr.c | 27 static void traverse(int i);
577 traverse(i); in digraph()
585 traverse(int i) in traverse() function
608 traverse(j); in traverse()
|
| /freebsd/sbin/dump/ |
| H A D | Makefile | 21 SRCS= itime.c main.c optr.c dumprmt.c tape.c traverse.c unctime.c cache.c
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | LoopTraversal.h | 106 TraversalOrder traverse(MachineFunction &MF);
|
| H A D | RDFLiveness.h | 147 void traverse(MachineBasicBlock *B, RefMap &LiveIn);
|
| H A D | ReachingDefAnalysis.h | 185 void traverse();
|
| /freebsd/sys/contrib/device-tree/src/arm64/freescale/ |
| H A D | fsl-ls1088a-ten64.dts | 8 * Author: Mathew McBride <matt@traverse.com.au>
20 compatible = "traverse,ten64", "fsl,ls1088a";
257 compatible = "traverse,ten64-controller";
|
| /freebsd/bin/ls/ |
| H A D | ls.c | 88 static void traverse(int, char **, int);
636 traverse(argc, argv, fts_options); in main()
638 traverse(1, dotav, fts_options); in main()
651 traverse(int argc, char *argv[], int options) in traverse() function
|
| /freebsd/cddl/usr.bin/ctfmerge/ |
| H A D | Makefile | 21 traverse.c \
|
| /freebsd/cddl/usr.bin/ctfconvert/ |
| H A D | Makefile | 24 traverse.c \
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | LoopTraversal.cpp | 24 LoopTraversal::TraversalOrder LoopTraversal::traverse(MachineFunction &MF) { in traverse() function in LoopTraversal
|
| H A D | ReachingDefAnalysis.cpp | 284 traverse(); in runOnMachineFunction()
302 traverse(); in reset()
313 TraversedMBBOrder = Traversal.traverse(*MF); in init()
316 void ReachingDefAnalysis::traverse() { in traverse() function in ReachingDefAnalysis
|
| /freebsd/sys/contrib/openzfs/config/ |
| H A D | kernel-follow-down.m4 | 5 dnl # symbol still exists but will traverse down all the layers.
|
| /freebsd/sys/contrib/device-tree/Bindings/leds/ |
| H A D | leds-trigger-pattern.txt | 4 The LED is expected to traverse the series and each brightness value for the
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericLoopInfoImpl.h | 524 void traverse(BlockT *EntryBlock);
532 void PopulateLoopsDFS<BlockT, LoopT>::traverse(BlockT *EntryBlock) { in traverse() function
602 DFS.traverse(DomRoot->getBlock()); in analyze()
|
| /freebsd/crypto/openssl/doc/man3/ |
| H A D | BIO_find_type.pod | 29 BIO_next() returns the next BIO in a chain. It can be used to traverse all BIOs
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | NumberObjectConversionChecker.cpp | 340 F.addMatcher(traverse(TK_AsIs, stmt(forEachDescendant(FinalM))), &CB); in checkASTCodeBody()
|
| /freebsd/contrib/ntp/scripts/ntpsweep/ |
| H A D | invoke-ntpsweep.texi | 90 This is the ``traverse peers up to this level (4 is a reasonable number)'' option.
|
| /freebsd/contrib/llvm-project/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchers.h | 818 internal::Matcher<T> traverse(TraversalKind TK, in traverse() function
828 traverse(TraversalKind TK, const internal::BindableMatcher<T> &InnerMatcher) { in traverse() function
838 traverse(TraversalKind TK, in traverse() function
848 traverse(TraversalKind TK, const internal::ArgumentAdaptingMatcherFuncAdaptor< in traverse() function
859 traverse(TraversalKind TK, in traverse() function
869 traverse(TraversalKind TK, const internal::MapAnyOfHelper<T...> &InnerMatcher) { in traverse() function
870 return traverse(TK, InnerMatcher.with()); in traverse()
|