| /freebsd-13.1/contrib/llvm-project/clang/lib/Tooling/ASTDiff/ |
| H A D | ASTDiff.cpp | 71 NodeId getMapped(const std::unique_ptr<SyntaxTree::Impl> &Tree, in getMapped()
193 SyntaxTree::Impl &Tree; member
281 static std::vector<NodeId> getSubtreePostorder(const SyntaxTree::Impl &Tree, in getSubtreePostorder()
294 static std::vector<NodeId> getSubtreeBfs(const SyntaxTree::Impl &Tree, in getSubtreeBfs()
489 const SyntaxTree::Impl &Tree; member in clang::diff::Subtree
498 Subtree(const SyntaxTree::Impl &Tree, NodeId SubtreeRoot) : Tree(Tree) { in Subtree()
710 const SyntaxTree::Impl &Tree; member
721 const SyntaxTree::Impl &Tree; member in clang::diff::__anonc66ce18a0611::PriorityList
727 PriorityList(const SyntaxTree::Impl &Tree) in PriorityList()
|
| /freebsd-13.1/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | GICombinerEmitter.cpp | 72 const GIMatchTree &Tree; member in __anon5fed5ee80111::format_partition_name
76 format_partition_name(const GIMatchTree &Tree, unsigned Idx) in format_partition_name()
721 const GIMatchTree &Tree, in generateCodeForTree()
860 std::unique_ptr<GIMatchTree> Tree; in run() local
|
| H A D | CodeGenDAGPatterns.cpp | 1348 for (const auto &Tree : PatFragRec->getTrees()) { in getCodeToRunOnSDNode() local
3077 for (const TreePatternNodePtr &Tree : Trees) in InferAllTypes() local
3095 for (const TreePatternNodePtr &Tree : Trees) { in print() local
3675 getInstructionsInTree(TreePatternNode *Tree, SmallVectorImpl<Record*> &Instrs) { in getInstructionsInTree()
4282 DagInit *Tree = CurPattern->getValueAsDag("PatternToMatch"); in ParsePatterns() local
|
| H A D | CodeGenDAGPatterns.h | 914 void setTree(unsigned i, TreePatternNodePtr Tree) { Trees[i] = Tree; } in setTree()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | ImmutableMap.h | 195 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} in iterator()
325 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} in iterator()
|
| /freebsd-13.1/contrib/llvm-project/clang/utils/TableGen/ |
| H A D | ClangASTNodesEmitter.cpp | 41 ChildMap Tree; member in __anon955178b90111::ClangASTNodesEmitter
|
| /freebsd-13.1/contrib/llvm-project/clang/include/clang/Tooling/Syntax/ |
| H A D | Tree.h | 70 class Tree; variable
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | InlineSizeEstimatorAnalysis.cpp | 144 const DominatorTree &Tree) { in getMaxDominatorTreeDepth()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUMachineCFGStructurizer.cpp | 528 void addChild(MRT *Tree) { Children.insert(Tree); } in addChild()
553 MRT *Tree = Children.back(); in getEntry() local
559 MRT *Tree = Children.front(); in getExit() local
2580 static bool containsNewBackedge(MRT *Tree, in containsNewBackedge()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | Reassociate.cpp | 1145 SmallVector<RepeatedValue, 8> Tree; in RemoveFactorFromExpression() local
2313 SmallVector<RepeatedValue, 8> Tree; in ReassociateExpression() local
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/Basic/ |
| H A D | Diagnostic.cpp | 817 SmallString<64> Tree; in FormatDiagnostic() local
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonLoopIdiomRecognition.cpp | 398 Value *Simplifier::Context::subst(Value *Tree, Value *OldV, Value *NewV) { in subst()
496 Value *Simplifier::Context::find(Value *Tree, Value *Sub) const { in find()
|
| H A D | HexagonConstExtenders.cpp | 1331 RangeTree Tree; in assignInits() local
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/AST/ |
| H A D | ASTDiagnostic.cpp | 920 DiffTree Tree; member in __anon1ae89fb20111::TemplateDiff
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/Sema/ |
| H A D | SemaChecking.cpp | 13597 SequenceTree Tree; member in __anonfebdc2651f11::SequenceChecker
|