Home
last modified time | relevance | path

Searched refs:Traverse (Results 1 – 8 of 8) sorted by relevance

/freebsd-13.1/contrib/llvm-project/clang/include/clang/AST/
H A DRecursiveASTVisitor.h349 decltype(&RecursiveASTVisitor::Traverse##NAME), \
350 decltype(&Derived::Traverse##NAME)>::value \
353 decltype(&RecursiveASTVisitor::Traverse##NAME), \
354 decltype(&Derived::Traverse##NAME)>::value, \
356 .Traverse##NAME(static_cast<CLASS *>(VAR), QUEUE) \
357 : getDerived().Traverse##NAME(static_cast<CLASS *>(VAR)))
372 bool Traverse##CLASS(CLASS *S, DataRecursionQueue *Queue = nullptr);
393 #define TYPE(CLASS, BASE) bool Traverse##CLASS##Type(CLASS##Type *T);
414 #define TYPELOC(CLASS, BASE) bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL);
447 #define DECL(CLASS, BASE) bool Traverse##CLASS##Decl(CLASS##Decl *D);
[all …]
/freebsd-13.1/contrib/ntp/scripts/ntpsweep/
H A Dntpsweep-opts.def38 descrip = 'Traverse peers up to this level (4 is a reasonable number)';
H A Dntpsweep-opts52 -m, --maxlevel=num Traverse peers up to this level (4 is a reasonable number)
H A Dinvoke-ntpsweep.texi54 -m, --maxlevel=num Traverse peers up to this level (4 is a reasonable number)
/freebsd-13.1/crypto/openssl/doc/man3/
H A DBIO_find_type.pod45 Traverse a chain looking for digest BIOs:
/freebsd-13.1/contrib/llvm-project/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp284 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder() local
287 Traverse(Child); in getSubtreePostorder()
290 Traverse(Root); in getSubtreePostorder()
/freebsd-13.1/contrib/llvm-project/clang/lib/CodeGen/
H A DCodeGenPGO.cpp255 bool Traverse##N(N *S) { \
256 Base::Traverse##N(S); \
/freebsd-13.1/contrib/llvm-project/clang/lib/AST/
H A DExprConstant.cpp12256 bool Traverse(const BinaryOperator *E) { in Traverse() function in __anon19193fee2811::DataRecursiveIntBinOpEvaluator
12886 return DataRecursiveIntBinOpEvaluator(*this, Result).Traverse(E); in VisitBinaryOperator()