HomeSort by relevance Sort by last modified time
    Searched refs:DT (Results 1 - 25 of 1182) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /toolchain/binutils/binutils-2.27/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"
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Transforms/Utils/
OrderedInstructions.h 36 DominatorTree *DT;
40 OrderedInstructions(DominatorTree *DT) : DT(DT) {}
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Utils/
OrderedInstructions.h 36 DominatorTree *DT;
40 OrderedInstructions(DominatorTree *DT) : DT(DT) {}
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Utils/
OrderedInstructions.h 36 DominatorTree *DT;
40 OrderedInstructions(DominatorTree *DT) : DT(DT) {}
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Utils/
OrderedInstructions.h 36 DominatorTree *DT;
40 OrderedInstructions(DominatorTree *DT) : DT(DT) {}
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Utils/
OrderedInstructions.h 36 DominatorTree *DT;
40 OrderedInstructions(DominatorTree *DT) : DT(DT) {}
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Utils/
OrderedInstructions.h 36 DominatorTree *DT;
40 OrderedInstructions(DominatorTree *DT) : DT(DT) {}
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Transforms/Utils/
OrderedInstructions.h 36 DominatorTree *DT;
40 OrderedInstructions(DominatorTree *DT) : DT(DT) {}
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/Utils/
OrderedInstructions.h 36 DominatorTree *DT;
40 OrderedInstructions(DominatorTree *DT) : DT(DT) {}
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Transforms/Utils/
OrderedInstructions.h 36 DominatorTree *DT;
40 OrderedInstructions(DominatorTree *DT) : DT(DT) {}
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Transforms/Utils/
OrderedInstructions.h 36 DominatorTree *DT;
40 OrderedInstructions(DominatorTree *DT) : DT(DT) {}
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/Utils/
OrderedInstructions.h 36 DominatorTree *DT;
40 OrderedInstructions(DominatorTree *DT) : DT(DT) {}
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Transforms/Utils/
OrderedInstructions.h 36 DominatorTree *DT;
40 OrderedInstructions(DominatorTree *DT) : DT(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-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/darwin-x86/clang-4393122/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-4479392/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...]
  /prebuilts/clang/host/linux-x86/clang-4393122/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...]

Completed in 1623 milliseconds

1 2 3 4 5 6 7 8 91011>>