| /external/llvm/lib/CodeGen/ |
| UnreachableBlockElim.cpp | 11 // job is to delete LLVM basic blocks that are not reachable from the entry
64 SmallPtrSet<BasicBlock*, 8> Reachable;
66 // Mark all reachable blocks.
68 df_ext_begin(&F, Reachable), E = df_ext_end(&F, Reachable); I != E; ++I)
69 /* Mark all reachable blocks */;
75 if (!Reachable.count(I)) {
120 SmallPtrSet<MachineBasicBlock*, 8> Reachable;
127 // Mark all reachable blocks.
129 I = df_ext_begin(&F, Reachable), E = df_ext_end(&F, Reachable)
[all...] |
| PrologEpilogInserter.cpp | 710 SmallPtrSet<MachineBasicBlock*, 8> Reachable;
712 // Iterate over the reachable blocks in DFS order.
714 DFI = df_ext_begin(&Fn, Reachable), DFE = df_ext_end(&Fn, Reachable);
720 assert(Reachable.count(StackPred) &&
731 if (Reachable.count(BB))
[all...] |
| MachineVerifier.cpp | 100 // Is this MBB reachable from the MF entry point?
101 bool reachable; member in struct:__anon9476::MachineVerifier::BBInfo
126 BBInfo() : reachable(false) {}
446 if (!MInfo.reachable) {
447 MInfo.reachable = true;
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| Consumed.h | 139 bool Reachable;
145 ConsumedStateMap() : Reachable(true), From(nullptr) {}
147 : Reachable(Other.Reachable), From(Other.From), VarMap(Other.VarMap),
171 /// \brief Return true if this block is reachable.
172 bool isReachable() const { return Reachable; }
|
| /external/clang/lib/Analysis/ |
| ReachableCode.cpp | 11 // determining reachable blocks within a CFG.
104 // well be reachable via a different control flow, thus it's not dead.
268 llvm::BitVector &Reachable,
276 // The entry block may have already been marked reachable
278 if (!Reachable[Start->getBlockID()]) {
280 Reachable[Start->getBlockID()] = true;
285 // Find the reachable blocks from 'Start'.
289 // There are cases where we want to treat all successors as reachable.
294 // Look at the successors and mark then reachable.
322 if (!Reachable[blockID])
[all...] |
| CFG.cpp | 190 /// distance - Calculates distance from this to L. L must be reachable from this
198 && "L iterator is not reachable from F iterator.");
492 /// Add a reachable successor to a block, with the alternate variant that is
[all...] |
| ThreadSafety.cpp | 905 bool Reachable; // Is this block reachable?
916 : EntryContext(EmptyCtx), ExitContext(EmptyCtx), Reachable(false)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | [all...] |
| /external/valgrind/main/memcheck/ |
| mc_include.h | 268 Reachable =0, // Definitely reachable from root-set.
269 Possible =1, // Possibly reachable from root-set; involves at
271 IndirectLeak =2, // Leaked, but reachable from another leaked block
274 // (At best, only reachable from itself via a cycle.)
284 (R2S(Reachable) | R2S(Possible) | R2S(IndirectLeak) | R2S(Unreached))
512 // std::string as reachable.
515 // reachable. Such interior pointers are used for arrays whose elements
519 // as reachable.
|
