| /freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | GICombinerEmitter.cpp | |
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | ImmutableMap.h | 159 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} in iterator()
289 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} in iterator()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGenData/ |
| H A D | OutlinedHashTree.cpp | 90 void OutlinedHashTree::merge(const OutlinedHashTree *Tree) { in merge()
|
| /freebsd/contrib/llvm-project/clang/include/clang/Tooling/Syntax/ |
| H A D | Tree.h | 44 class Tree; variable
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | InlineSizeEstimatorAnalysis.cpp | 142 const DominatorTree &Tree) { in getMaxDominatorTreeDepth()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/MC/ |
| H A D | MCPseudoProbe.h | 186 MCDecodedPseudoProbeInlineTree *Tree) in MCDecodedPseudoProbe()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/ |
| H A D | CodeGenDAGPatterns.cpp | 1388 for (const auto &Tree : PatFragRec->getTrees()) { in getCodeToRunOnSDNode() local
3135 for (const TreePatternNodePtr &Tree : Trees) in InferAllTypes() local
3153 for (const TreePatternNodePtr &Tree : Trees) { in print() local
3743 static void getInstructionsInTree(TreePatternNode &Tree, in getInstructionsInTree()
4365 DagInit *Tree = CurPattern->getValueAsDag("PatternToMatch"); in ParsePatterns() local
|
| H A D | CodeGenDAGPatterns.h | 922 void setTree(unsigned i, TreePatternNodePtr Tree) { Trees[i] = Tree; } in setTree()
|
| /freebsd/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
2545 static bool containsNewBackedge(MRT *Tree, in containsNewBackedge()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | Reassociate.cpp | 1105 SmallVector<RepeatedValue, 8> Tree; in RemoveFactorFromExpression() local
2285 SmallVector<RepeatedValue, 8> Tree; in ReassociateExpression() local
|
| /freebsd/contrib/llvm-project/clang/lib/Basic/ |
| H A D | Diagnostic.cpp | 871 SmallString<64> Tree; in FormatDiagnostic() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonLoopIdiomRecognition.cpp | 396 Value *Simplifier::Context::subst(Value *Tree, Value *OldV, Value *NewV) { in subst()
494 Value *Simplifier::Context::find(Value *Tree, Value *Sub) const { in find()
|
| H A D | HexagonConstExtenders.cpp | 1337 RangeTree Tree; in assignInits() local
|
| /freebsd/contrib/llvm-project/clang/lib/AST/ |
| H A D | ASTDiagnostic.cpp | 952 DiffTree Tree; member in __anon44eed8fe0111::TemplateDiff
|
| /freebsd/contrib/llvm-project/clang/lib/Sema/ |
| H A D | SemaChecking.cpp | 11889 SequenceTree Tree; member in __anon28c3fbb12811::SequenceChecker
|