| /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...] |
| InfSourceSectionParser.py | 25 from Library import DataType as DT
53 if SrcLineContent.strip().startswith(DT.TAB_COMMENT_SPLIT):
59 SectionContent += SrcLineContent + DT.END_OF_LINE
71 SectionContent += SrcLineContent + DT.END_OF_LINE
80 LineCommentContent += Item[0] + DT.END_OF_LINE
86 if SrcLineContent.find(DT.TAB_COMMENT_SPLIT) > -1:
87 TailComments = SrcLineContent[SrcLineContent.find(DT.TAB_COMMENT_SPLIT):]
88 SrcLineContent = SrcLineContent[:SrcLineContent.find(DT.TAB_COMMENT_SPLIT)]
98 DT.MODEL_EFI_SOURCE_FILE,
114 TokenList = GetSplitValueList(SrcLineContent, DT.TAB_VALUE_SPLIT, 4)
[all...] |
| InfParser.py | 33 from Library import DataType as DT
92 self.SupArchList = DT.ARCH_LIST
123 CurrentSection = DT.MODEL_UNKNOWN
201 if Line.startswith(DT.TAB_SPECIAL_COMMENT) and \
202 (Line.find(DT.TAB_HEADER_COMMENT) > -1) and \
205 CurrentSection = DT.MODEL_META_DATA_FILE_HEADER
217 if (Line.startswith(DT.TAB_COMMENT_SPLIT) and CurrentSection == DT.MODEL_META_DATA_FILE_HEADER) and\
218 HeaderCommentStart and not Line.startswith(DT.TAB_SPECIAL_COMMENT) and not\
225 if (Line.startswith(DT.TAB_SPECIAL_COMMENT) or not Line.strip().startswith("#")) and HeaderCommentStart \
[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);
|
| /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...] |
| InstructionSimplify.h | 33 const TargetData *TD = 0, const DominatorTree *DT = 0);
38 const TargetData *TD = 0, const DominatorTree *DT = 0);
43 const DominatorTree *DT = 0);
48 const DominatorTree *DT = 0);
53 const DominatorTree *DT = 0);
58 const DominatorTree *DT = 0);
63 const DominatorTree *DT = 0);
68 const DominatorTree *DT = 0);
73 const DominatorTree *DT = 0);
78 const TargetData *TD = 0, const DominatorTree *DT = 0)
[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...] |
| MachineDominators.h | 62 /// \brief Apply all the recorded critical edges to the DT.
63 /// This updates the underlying DT information in a way that uses
64 /// the fast query path of DT as much as possible.
71 DominatorTreeBase<MachineBasicBlock>* DT;
79 return *DT;
90 return DT->getRoots();
95 return DT->getRoot();
100 return DT->getRootNode();
108 return DT->dominates(A, B);
114 return DT->dominates(A, B)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 49 IDFCalculator(DominatorTreeBase<BasicBlock> &DT) : DT(DT), useLiveIn(false) {}
87 DominatorTreeBase<BasicBlock> &DT;
|
| /external/llvm/lib/CodeGen/ |
| MachinePostDominators.cpp | 27 DT = new DominatorTreeBase<MachineBasicBlock>(true); //true indicate
38 DT->recalculate(F);
43 delete DT;
54 DT->print(OS);
|
| MachineDominators.cpp | 52 DT->recalculate(F);
60 DT = new DominatorTreeBase<MachineBasicBlock>(false);
64 delete DT;
68 DT->releaseMemory();
77 DT->print(OS);
93 // the underlying DT.
97 MachineDomTreeNode *SuccDTNode = DT->getNode(Succ);
113 // FromBB2 since Split2 is still unknown of the underlying DT structure.
120 if (!DT->dominates(SuccDTNode, DT->getNode(PredBB)))
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| MachineDominators.h | 43 DominatorTreeBase<MachineBasicBlock>* DT;
49 DominatorTreeBase<MachineBasicBlock>& getBase() { return *DT; }
58 return DT->getRoots();
62 return DT->getRoot();
66 return DT->getRootNode();
72 return DT->dominates(A, B);
76 return DT->dominates(A, B);
83 if (BBA != BBB) return DT->dominates(BBA, BBB);
90 //if(!DT.IsPostDominators) {
101 return DT->properlyDominates(A, B)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/ |
| FunctionUtils.h | 29 Function* ExtractCodeRegion(DominatorTree& DT,
35 Function* ExtractLoop(DominatorTree& DT, Loop *L,
|
| PromoteMemToReg.h | 41 DominatorTree &DT, AliasSetTracker *AST = 0);
|
| /external/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 41 llvm::DominatorTreeBase<CFGBlock>* DT;
44 DT = new llvm::DominatorTreeBase<CFGBlock>(false);
47 ~DominatorTree() override { delete DT; }
49 llvm::DominatorTreeBase<CFGBlock>& getBase() { return *DT; }
54 return DT->getRoot();
60 return DT->getRootNode();
74 if (DT->compare(Other.getBase()))
85 DT->recalculate(*cfg);
95 if(DT->getNode(*I)->getIDom())
98 << DT->getNode(*I)->getIDom()->getBlock()->getBlockID(
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| MachineDominators.cpp | 38 DT->recalculate(F);
46 DT = new DominatorTreeBase<MachineBasicBlock>(false);
50 delete DT;
54 DT->releaseMemory();
58 DT->print(OS);
|
