HomeSort by relevance Sort by last modified time
    Searched refs:PostNumbers (Results 1 - 3 of 3) sorted by null

  /external/swiftshader/third_party/LLVM/include/llvm/Analysis/
LoopIterator.h 53 DenseMap<BasicBlock*, unsigned> PostNumbers;
58 L(Container), PostNumbers(NextPowerOf2(Container->getNumBlocks())) {
85 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
89 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
90 return I != PostNumbers.end() && I->second;
95 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
96 assert(I != PostNumbers.end() && "block not visited by DFS");
107 PostNumbers.clear();
148 return DFS.PostNumbers.insert(std::make_pair(BB, 0)).second;
154 assert(DFS.PostNumbers.count(BB) && "Loop DFS skipped preorder")
    [all...]
  /external/llvm/include/llvm/Analysis/
LoopIterator.h 52 DenseMap<BasicBlock*, unsigned> PostNumbers;
57 L(Container), PostNumbers(NextPowerOf2(Container->getNumBlocks())) {
84 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
88 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
89 return I != PostNumbers.end() && I->second;
94 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
95 assert(I != PostNumbers.end() && "block not visited by DFS");
106 PostNumbers.clear();
157 return DFS.PostNumbers.insert(std::make_pair(BB, 0)).second;
163 assert(DFS.PostNumbers.count(BB) && "Loop DFS skipped preorder")
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
LoopIterator.h 112 DenseMap<BasicBlock*, unsigned> PostNumbers;
117 L(Container), PostNumbers(NextPowerOf2(Container->getNumBlocks())) {
144 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
148 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
149 return I != PostNumbers.end() && I->second;
154 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
155 assert(I != PostNumbers.end() && "block not visited by DFS");
166 PostNumbers.clear();
236 return DFS.PostNumbers.insert(std::make_pair(BB, 0)).second;
242 assert(DFS.PostNumbers.count(BB) && "Loop DFS skipped preorder")
    [all...]

Completed in 870 milliseconds