Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/clang/lib/AST/
H A DDynamicRecursiveASTVisitor.cpp220 bool Traverse##CLASS##Decl(CLASS##Decl *D) { \
221 return Visitor.Traverse##CLASS##Decl(D); \
234 bool Traverse##CLASS(CLASS *S) { return Visitor.Traverse##CLASS(S); }
244 bool Traverse##CLASS##Type(CLASS##Type *T) { \
245 return Visitor.Traverse##CLASS##Type(T); \
258 bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL) { \
259 return Visitor.Traverse##CLASS##TypeLoc(TL); \
342 FORWARD_TO_BASE(Traverse##CLASS##Decl, CLASS##Decl, *) \
348 #define STMT(CLASS, PARENT) FORWARD_TO_BASE(Traverse##CLASS, CLASS, *)
357 FORWARD_TO_BASE(Traverse##CLASS##Type, CLASS##Type, *) \
[all …]
H A DExprConstant.cpp14080 bool Traverse(const BinaryOperator *E) { in Traverse() function in __anonfb577fba2d11::DataRecursiveIntBinOpEvaluator
14751 return DataRecursiveIntBinOpEvaluator(*this, Result).Traverse(E); in VisitBinaryOperator()
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DDynamicRecursiveASTVisitor.h255 virtual bool Traverse##CLASS##Decl(MaybeConst<CLASS##Decl> *D);
264 #define STMT(CLASS, PARENT) virtual bool Traverse##CLASS(MaybeConst<CLASS> *S);
276 virtual bool Traverse##CLASS##Type(MaybeConst<CLASS##Type> *T);
286 virtual bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL);
H A DRecursiveASTVisitor.h348 decltype(&RecursiveASTVisitor::Traverse##NAME), \
349 decltype(&Derived::Traverse##NAME)>::value \
352 decltype(&RecursiveASTVisitor::Traverse##NAME), \
353 decltype(&Derived::Traverse##NAME)>::value, \
355 .Traverse##NAME(static_cast<CLASS *>(VAR), QUEUE) \
356 : getDerived().Traverse##NAME(static_cast<CLASS *>(VAR)))
371 bool Traverse##CLASS(CLASS *S, DataRecursionQueue *Queue = nullptr);
392 #define TYPE(CLASS, BASE) bool Traverse##CLASS##Type(CLASS##Type *T);
413 #define TYPELOC(CLASS, BASE) bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL);
446 #define DECL(CLASS, BASE) bool Traverse##CLASS##Decl(CLASS##Decl *D);
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVScope.cpp687 auto Traverse = [&](auto &Set, LVSortFunction SortFunction) { in sort() local
691 Traverse(Parent->Types, SortFunction); in sort()
692 Traverse(Parent->Symbols, SortFunction); in sort()
693 Traverse(Parent->Scopes, SortFunction); in sort()
694 Traverse(Parent->Ranges, compareRange); in sort()
695 Traverse(Parent->Children, SortFunction); in sort()
735 auto Traverse = [&](const auto *Set) { in traverseParentsAndChildren() local
743 Traverse(Scope->getTypes()); in traverseParentsAndChildren()
744 Traverse(Scope->getSymbols()); in traverseParentsAndChildren()
745 Traverse(Scope->getLines()); in traverseParentsAndChildren()
[all …]
H A DLVReader.cpp48 auto Traverse = [&](const auto *Set) { in checkIntegrityScopesTree() local
59 Traverse(Parent->getSymbols()); in checkIntegrityScopesTree()
60 Traverse(Parent->getTypes()); in checkIntegrityScopesTree()
61 Traverse(Parent->getLines()); in checkIntegrityScopesTree()
/freebsd/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/sys/contrib/device-tree/src/arm64/freescale/
H A Dfsl-ls1088a-ten64.dts6 * Copyright 2019-2021 Traverse Technologies
19 model = "Traverse Ten64";
/freebsd/crypto/openssl/doc/man3/
H A DBIO_find_type.pod45 Traverse a chain looking for digest BIOs:
/freebsd/contrib/llvm-project/clang/lib/CodeGen/
H A DCodeGenPGO.cpp476 bool Traverse##N(N *S) { \
477 Base::Traverse##N(S); \