Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVReader.cpp49 auto Traverse = [&](const auto *Set) { in checkIntegrityScopesTree() local
60 Traverse(Parent->getSymbols()); in checkIntegrityScopesTree()
61 Traverse(Parent->getTypes()); in checkIntegrityScopesTree()
62 Traverse(Parent->getLines()); in checkIntegrityScopesTree()
H A DLVScope.cpp438 // The current element represents the Root. Traverse each Compile Unit. in resolveReferences()
462 // Traverse the scope types and populate the given container with those in resolveReferencesChain()
680 auto Traverse = [&](auto &Set, LVSortFunction SortFunction) { in doPrint()
684 Traverse(Parent->Types, SortFunction); in sort()
685 Traverse(Parent->Symbols, SortFunction); in sort()
686 Traverse(Parent->Scopes, SortFunction); in sort()
687 Traverse(Parent->Ranges, compareRange); in sort()
688 Traverse(Parent->Children, SortFunction); in sort() local
702 // Traverse the parent tree. in sort()
728 auto Traverse in traverseParentsAndChildren()
736 auto Traverse = [&](const auto *Set) { traverseParentsAndChildren() local
2031 auto Traverse = [&](const auto *Set) { transformScopedName() local
[all...]
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DRecursiveASTVisitor.h346 decltype(&RecursiveASTVisitor::Traverse##NAME), \
347 decltype(&Derived::Traverse##NAME)>::value \
350 decltype(&RecursiveASTVisitor::Traverse##NAME), \
351 decltype(&Derived::Traverse##NAME)>::value, \
353 .Traverse##NAME(static_cast<CLASS *>(VAR), QUEUE) \
354 : getDerived().Traverse##NAME(static_cast<CLASS *>(VAR)))
369 bool Traverse##CLASS(CLASS *S, DataRecursionQueue *Queue = nullptr);
390 #define TYPE(CLASS, BASE) bool Traverse##CLASS##Type(CLASS##Type *T);
411 #define TYPELOC(CLASS, BASE) bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL);
444 #define DECL(CLASS, BASE) bool Traverse##CLASS##Decl(CLASS##Decl *D);
[all …]
/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); \
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DExprConstant.cpp13258 bool Traverse(const BinaryOperator *E) { in Traverse() function in __anonfb577fba2b11::DataRecursiveIntBinOpEvaluator
13924 return DataRecursiveIntBinOpEvaluator(*this, Result).Traverse(E); in VisitBinaryOperator()