HomeSort by: relevance | last modified time | path
    Searched defs:Reachable (Results 1 - 10 of 10) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
UnreachableBlockElim.cpp 10 // job is to delete LLVM basic blocks that are not reachable from the entry
104 df_iterator_default_set<MachineBasicBlock*> Reachable;
110 // Mark all reachable blocks.
111 for (MachineBasicBlock *BB : depth_first_ext(&F, Reachable))
112 (void)BB/* Mark all reachable blocks */;
119 if (!Reachable.count(&BB)) {
PrologEpilogInserter.cpp 1162 df_iterator_default_set<MachineBasicBlock*> Reachable;
1164 // Iterate over the reachable blocks in DFS order.
1165 for (auto DFI = df_ext_begin(&MF, Reachable), DFE = df_ext_end(&MF, Reachable);
1171 assert(Reachable.count(StackPred) &&
1182 if (Reachable.count(&BB))
MachineVerifier.cpp 130 // Is this MBB reachable from the MF entry point?
131 bool reachable = false; member in struct:__anon4245::MachineVerifier::BBInfo
558 if (!MInfo.reachable) {
559 MInfo.reachable = true;
2464 assert(Info.reachable);
2470 if (!PredInfo.reachable)
2574 if (MInfo.reachable) {
2577 if (!MO0.isUndef() && PrInfo.reachable &&
2584 if (MInfo.reachable) {
3127 df_iterator_default_set<const MachineBasicBlock*> Reachable;
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/
Consumed.h 148 bool Reachable = true;
156 : Reachable(Other.Reachable), From(Other.From), VarMap(Other.VarMap),
180 /// Return true if this block is reachable.
181 bool isReachable() const { return Reachable; }
  /src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/
Tree.cpp 132 auto Reachable = [](Node *From, Node *N) {
140 assert(Reachable(FirstChild, Begin) && "`Begin` is not reachable.");
141 assert(Reachable(Begin, End) && "`End` is not after `Begin`.");
288 "Last child is reachable by advancing from the first child.");
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
PhiValues.cpp 33 // The goal here is to find all of the non-phi values reachable from this phi,
34 // and to do the same for all of the phis reachable from this phi, as doing so
38 // * All phis in a strongly connected component will have the same reachable
40 // reachable values, but finding out that isn't really necessary (it would
43 // never completes a component before the components reachable from it have
45 // everything we need to collect the values reachable from that component.
46 // * We collect both the non-phi values reachable from each SCC, as that's what
47 // we're ultimately interested in, and all of the reachable values, i.e.
83 // Collect the reachable values for this component. The phis of this
86 ConstValueSet &Reachable = ReachableMap[RootDepthNumber]
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
WebAssemblyFixIrreducibleControlFlow.cpp 102 auto I = Reachable.find(From);
103 if (I == Reachable.end())
133 DenseMap<MachineBasicBlock *, BlockSet> Reachable;
145 Reachable[MBB].insert(Succ);
159 if (Reachable[Pred].insert(Succ).second) {
174 // Find the loop entries - loopers reachable from blocks not in that loop -
  /src/external/apache2/llvm/dist/clang/lib/Analysis/
ReachableCode.cpp 10 // determining reachable blocks within a CFG.
127 // well be reachable via a different control flow, thus it's not dead.
310 llvm::BitVector &Reachable,
318 // The entry block may have already been marked reachable
320 if (!Reachable[Start->getBlockID()]) {
322 Reachable[Start->getBlockID()] = true;
327 // Find the reachable blocks from 'Start'.
331 // There are cases where we want to treat all successors as reachable.
336 // Look at the successors and mark then reachable.
364 if (!Reachable[blockID])
    [all...]
CFG.cpp 326 /// distance - Calculates distance from this to L. L must be reachable from this
334 "L iterator is not reachable from F iterator.");
343 /// that is in a scope reachable through the parents of L.
361 "L iterator is not reachable from F iterator.");
890 /// Add a reachable successor to a block, with the alternate variant that is
1618 /// directly tied to the exit block in order to be reachable.
4977 // Iterate over reachable successors.
5733 bool Reachable = true;
5735 Reachable = false;
5740 if (!Reachable)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
BasicBlockUtils.cpp 120 df_iterator_default_set<BasicBlock*> Reachable;
122 // Mark all reachable blocks.
123 for (BasicBlock *BB : depth_first_ext(&F, Reachable))
124 (void)BB/* Mark all reachable blocks */;
129 if (!Reachable.count(&BB))
239 // making the blocks reachable again. Such DT updates lead to high compile
929 // Preds that are not reachable from entry should not be used to identify if

Completed in 54 milliseconds