HomeSort by relevance Sort by last modified time
    Searched defs:DominatorTree (Results 1 - 4 of 4) sorted by null

  /external/clang/include/clang/Analysis/Analyses/
Dominators.h 38 class DominatorTree : public ManagedAnalysis {
43 DominatorTree() {
47 ~DominatorTree() override { delete DT; }
67 inline bool compare(DominatorTree &Other) const {
165 /// DominatorTree GraphTraits specialization so the DominatorTree can be
194 template <> struct GraphTraits< ::clang::DominatorTree* >
196 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
200 static nodes_iterator nodes_begin(::clang::DominatorTree *N) {
204 static nodes_iterator nodes_end(::clang::DominatorTree *N)
    [all...]
  /external/llvm/include/llvm/IR/
Dominators.h 10 // This file defines the DominatorTree class, which provides fast and efficient
71 class DominatorTree : public DominatorTreeBase<BasicBlock> {
75 DominatorTree() : DominatorTreeBase<BasicBlock>(false) {}
77 DominatorTree(DominatorTree &&Arg)
79 DominatorTree &operator=(DominatorTree &&RHS) {
86 inline bool compare(const DominatorTree &Other) const {
126 // DominatorTree GraphTraits specializations so the DominatorTree can b
    [all...]
  /external/mesa3d/src/gallium/drivers/nv50/codegen/
nv50_ir_ssa.cpp 30 // DominatorTree implements an algorithm for finding immediate dominators,
32 class DominatorTree : public Graph
35 DominatorTree(Graph *cfg);
36 ~DominatorTree() { }
65 void DominatorTree::debugPrint()
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph),
97 void DominatorTree::buildDFS(Graph::Node *node)
109 void DominatorTree::squash(int v)
120 int DominatorTree::eval(int v
    [all...]
  /prebuilts/tools/common/m2/repository/com/squareup/haha/haha/1.3/
haha-1.3.jar 

Completed in 188 milliseconds