| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-plugin/ |
| lto-16a.d | 2 [0-9a-f]+ [DT] foo
|
| lto-16b.d | 2 [0-9a-f]+ [DT] bar
|
| lto-17a.d | 2 [0-9a-f]+ [DT] bar
|
| lto-17b-2.d | 2 [0-9a-f]+ [DT] foo
|
| /external/dtc/ |
| dtdiff | 11 DT="$1"
12 if [ -d "$DT" ]; then
14 elif [ -f "$DT" ]; then
15 case "$DT" in
26 echo "Unrecognized format for $DT" >&2
30 $DTC -I $IFORMAT -O dts -qq -f -s -o - "$DT"
|
| /device/linaro/bootloader/edk2/BaseTools/Source/Python/UPT/Parser/ |
| InfParserMisc.py | 25 from Library import DataType as DT
41 DT.TAB_UNKNOWN.upper() : DT.MODEL_UNKNOWN,
42 DT.TAB_HEADER.upper() : DT.MODEL_META_DATA_FILE_HEADER,
43 DT.TAB_INF_DEFINES.upper() : DT.MODEL_META_DATA_DEFINE,
44 DT.TAB_BUILD_OPTIONS.upper() : DT.MODEL_META_DATA_BUILD_OPTION,
45 DT.TAB_LIBRARY_CLASSES.upper() : DT.MODEL_EFI_LIBRARY_CLASS,
[all...] |
| /external/llvm/unittests/IR/ |
| DominatorTreeTest.cpp | 30 DominatorTree *DT =
61 EXPECT_TRUE(DT->isReachableFromEntry(BB0));
62 EXPECT_TRUE(DT->isReachableFromEntry(BB1));
63 EXPECT_TRUE(DT->isReachableFromEntry(BB2));
64 EXPECT_FALSE(DT->isReachableFromEntry(BB3));
65 EXPECT_TRUE(DT->isReachableFromEntry(BB4));
68 EXPECT_TRUE(DT->dominates(BB0, BB0));
69 EXPECT_TRUE(DT->dominates(BB0, BB1));
70 EXPECT_TRUE(DT->dominates(BB0, BB2));
71 EXPECT_TRUE(DT->dominates(BB0, BB3))
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| PostDominators.cpp | 35 DT->recalculate(F);
40 delete DT;
44 DT->print(OS);
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 52 unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
57 DFStorage(DT.Info);
62 auto &BBInfo = DT.Info[BB];
68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
69 DT.Vertex.push_back(BB); // Vertex[n] = V;
79 unsigned DFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
84 DFStorage(DT.Info);
88 auto &BBInfo = DT.Info[BB];
94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
95 DT.Vertex.push_back(BB); // Vertex[n] = V
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 52 unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
57 DFStorage(DT.Info);
62 auto &BBInfo = DT.Info[BB];
68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
69 DT.Vertex.push_back(BB); // Vertex[n] = V;
79 unsigned DFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
84 DFStorage(DT.Info);
88 auto &BBInfo = DT.Info[BB];
94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
95 DT.Vertex.push_back(BB); // Vertex[n] = V
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 52 unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
57 DFStorage(DT.Info);
62 auto &BBInfo = DT.Info[BB];
68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
69 DT.Vertex.push_back(BB); // Vertex[n] = V;
79 unsigned DFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
84 DFStorage(DT.Info);
88 auto &BBInfo = DT.Info[BB];
94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
95 DT.Vertex.push_back(BB); // Vertex[n] = V
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 52 unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
57 DFStorage(DT.Info);
62 auto &BBInfo = DT.Info[BB];
68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
69 DT.Vertex.push_back(BB); // Vertex[n] = V;
79 unsigned DFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
84 DFStorage(DT.Info);
88 auto &BBInfo = DT.Info[BB];
94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
95 DT.Vertex.push_back(BB); // Vertex[n] = V
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 52 unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
57 DFStorage(DT.Info);
62 auto &BBInfo = DT.Info[BB];
68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
69 DT.Vertex.push_back(BB); // Vertex[n] = V;
79 unsigned DFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
84 DFStorage(DT.Info);
88 auto &BBInfo = DT.Info[BB];
94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
95 DT.Vertex.push_back(BB); // Vertex[n] = V
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 52 unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
57 DFStorage(DT.Info);
62 auto &BBInfo = DT.Info[BB];
68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
69 DT.Vertex.push_back(BB); // Vertex[n] = V;
79 unsigned DFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
84 DFStorage(DT.Info);
88 auto &BBInfo = DT.Info[BB];
94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
95 DT.Vertex.push_back(BB); // Vertex[n] = V
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 52 unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
57 DFStorage(DT.Info);
62 auto &BBInfo = DT.Info[BB];
68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
69 DT.Vertex.push_back(BB); // Vertex[n] = V;
79 unsigned DFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
84 DFStorage(DT.Info);
88 auto &BBInfo = DT.Info[BB];
94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
95 DT.Vertex.push_back(BB); // Vertex[n] = V
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 52 unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
57 DFStorage(DT.Info);
62 auto &BBInfo = DT.Info[BB];
68 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
69 DT.Vertex.push_back(BB); // Vertex[n] = V;
79 unsigned DFSPass(DominatorTreeBaseByGraphTraits<GraphT> &DT,
84 DFStorage(DT.Info);
88 auto &BBInfo = DT.Info[BB];
94 BBInfo.Parent = DT.Info[I.getPath(I.getPathLength() - 2)].DFSNum;
95 DT.Vertex.push_back(BB); // Vertex[n] = V
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SimplifyIndVar.h | 35 const DominatorTree *DT;
40 IVVisitor() : DT(nullptr) {}
43 const DominatorTree *getDomTree() const { return DT; }
49 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
55 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 33 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT,
39 InfoRec &VInfo = DT.Info[DT.Roots[i]];
46 InfoRec &SuccVInfo = DT.Info[*SI];
49 N = DTDFSPass(DT, *SI, N);
63 DT.Info[BB];
70 DT.Vertex.push_back(BB); // Vertex[n] = V;
95 DT.Info[Succ];
107 Eval(DominatorTreeBase<typename GraphT::NodeType> &DT,
110 DT.Info[VIn]
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| DominatorInternals.h | 34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT,
40 InfoRec &VInfo = DT.Info[DT.Roots[i]];
47 InfoRec &SuccVInfo = DT.Info[*SI];
50 N = DTDFSPass(DT, *SI, N);
64 DT.Info[BB];
71 DT.Vertex.push_back(BB); // Vertex[n] = V;
96 DT.Info[Succ];
108 Eval(DominatorTreeBase<typename GraphT::NodeType>& DT,
111 DT.Info[VIn]
[all...] |
| PostDominators.h | 26 DominatorTreeBase<BasicBlock>* DT;
30 DT = new DominatorTreeBase<BasicBlock>(true);
42 return DT->getRoots();
46 return DT->getRootNode();
50 return DT->getNode(BB);
54 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
66 return DT->properlyDominates(A, B);
70 return DT->properlyDominates(A, B)
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachinePostDominators.h | 29 DominatorTreeBase<MachineBasicBlock> *DT;
41 return DT->getRoots();
45 return DT->getRootNode();
49 return DT->getNode(BB);
53 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
67 return DT->properlyDominates(A, B);
72 return DT->properlyDominates(A, B);
77 return DT->findNearestCommonDominator(A, B)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachinePostDominators.h | 29 DominatorTreeBase<MachineBasicBlock> *DT;
41 return DT->getRoots();
45 return DT->getRootNode();
49 return DT->getNode(BB);
53 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
67 return DT->properlyDominates(A, B);
72 return DT->properlyDominates(A, B);
77 return DT->findNearestCommonDominator(A, B)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachinePostDominators.h | 29 DominatorTreeBase<MachineBasicBlock> *DT;
41 return DT->getRoots();
45 return DT->getRootNode();
49 return DT->getNode(BB);
53 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
67 return DT->properlyDominates(A, B);
72 return DT->properlyDominates(A, B);
77 return DT->findNearestCommonDominator(A, B)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachinePostDominators.h | 29 DominatorTreeBase<MachineBasicBlock> *DT;
41 return DT->getRoots();
45 return DT->getRootNode();
49 return DT->getNode(BB);
53 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
67 return DT->properlyDominates(A, B);
72 return DT->properlyDominates(A, B);
77 return DT->findNearestCommonDominator(A, B)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachinePostDominators.h | 29 DominatorTreeBase<MachineBasicBlock> *DT;
41 return DT->getRoots();
45 return DT->getRootNode();
49 return DT->getNode(BB);
53 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
67 return DT->properlyDominates(A, B);
72 return DT->properlyDominates(A, B);
77 return DT->findNearestCommonDominator(A, B)
[all...] |
