Home
last modified time | relevance | path

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

/freebsd-14.2/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.cpp684 Traverse(Parent->Types, SortFunction); in sort()
686 Traverse(Parent->Scopes, SortFunction); in sort()
687 Traverse(Parent->Ranges, compareRange); in sort()
728 auto Traverse = [&](const auto *Set) { in traverseParentsAndChildren() local
736 Traverse(Scope->getTypes()); in traverseParentsAndChildren()
737 Traverse(Scope->getSymbols()); in traverseParentsAndChildren()
738 Traverse(Scope->getLines()); in traverseParentsAndChildren()
2023 auto Traverse = [&](const auto *Set) { in transformScopedName() local
2033 Traverse(Parent->getSymbols()); in transformScopedName()
2034 Traverse(Parent->getTypes()); in transformScopedName()
[all …]
/freebsd-14.2/contrib/llvm-project/clang/include/clang/AST/
H A DRecursiveASTVisitor.h344 decltype(&RecursiveASTVisitor::Traverse##NAME), \
345 decltype(&Derived::Traverse##NAME)>::value \
348 decltype(&RecursiveASTVisitor::Traverse##NAME), \
349 decltype(&Derived::Traverse##NAME)>::value, \
351 .Traverse##NAME(static_cast<CLASS *>(VAR), QUEUE) \
352 : getDerived().Traverse##NAME(static_cast<CLASS *>(VAR)))
367 bool Traverse##CLASS(CLASS *S, DataRecursionQueue *Queue = nullptr);
388 #define TYPE(CLASS, BASE) bool Traverse##CLASS##Type(CLASS##Type *T);
409 #define TYPELOC(CLASS, BASE) bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL);
442 #define DECL(CLASS, BASE) bool Traverse##CLASS##Decl(CLASS##Decl *D);
[all …]
/freebsd-14.2/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-14.2/sys/contrib/device-tree/src/arm64/freescale/
H A Dfsl-ls1088a-ten64.dts6 * Copyright 2019-2021 Traverse Technologies
19 model = "Traverse Ten64";
/freebsd-14.2/crypto/openssl/doc/man3/
H A DBIO_find_type.pod45 Traverse a chain looking for digest BIOs:
/freebsd-14.2/contrib/llvm-project/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp283 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder() local
286 Traverse(Child); in getSubtreePostorder()
289 Traverse(Root); in getSubtreePostorder()
/freebsd-14.2/contrib/llvm-project/clang/lib/CodeGen/
H A DCodeGenPGO.cpp383 bool Traverse##N(N *S) { \
384 Base::Traverse##N(S); \
/freebsd-14.2/sys/contrib/device-tree/Bindings/
H A Dvendor-prefixes.yaml1394 description: Traverse Technologies Australia Pty Ltd
/freebsd-14.2/sys/contrib/device-tree/Bindings/arm/
H A Dfsl.yaml1394 - description: Traverse LS1088A based Boards
/freebsd-14.2/contrib/llvm-project/clang/lib/AST/
H A DExprConstant.cpp12891 bool Traverse(const BinaryOperator *E) { in Traverse() function in __anon7ee061302a11::DataRecursiveIntBinOpEvaluator
13557 return DataRecursiveIntBinOpEvaluator(*this, Result).Traverse(E); in VisitBinaryOperator()