| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| ReachableCode.h | 58 /// ScanReachableFromBlock - Mark all blocks reachable from Start.
59 /// Returns the total number of blocks that were marked reachable.
61 llvm::BitVector &Reachable);
|
| 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/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...] |
| ThreadSafety.cpp | 352 // Is this block reachable?
353 bool Reachable = false;
2308 // Mark entry block as reachable
2309 BlockInfo[CFGraph->getEntry().getBlockID()].Reachable = true;
2412 if (neverReturns(*PI) || !PrevBlockInfo->Reachable)
2416 CurrBlockInfo->Reachable = true;
2442 // Skip rest of block if it's not reachable.
2443 if (!CurrBlockInfo->Reachable)
2528 if (!Final->Reachable)
|
| Consumed.cpp | 1135 if (this->From && this->From == Other.From && !Other.Reachable) {
1173 this->Reachable = false;
|
| 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/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/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/lib/StaticAnalyzer/Core/ |
| WorkList.cpp | 31 // Worklist classes for exploration of reachable states.
142 llvm::DenseSet<LocIdentifier> Reachable;
161 auto InsertInfo = Reachable.insert(LocId);
169 MaxReachableSize.updateMax(Reachable.size());
|
| ProgramState.cpp | 621 // Regions captured by a block are also implicitly reachable.
640 llvm::iterator_range<region_iterator> Reachable,
643 for (const MemRegion *R : Reachable) {
|
| /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/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/clang/lib/Sema/ |
| JumpDiagnostics.cpp | 763 // For each target scope, make sure it's trivially reachable from
771 llvm::BitVector Reachable(Scopes.size(), false);
777 Reachable.reset();
784 Reachable.set(Min);
802 // we've marked reachable. For well-formed code this amortizes
808 if (Reachable.test(Scope)) {
809 // If we find something reachable, mark all the scopes we just
810 // walked through as reachable.
812 Reachable.set(S);
818 // gotten shallower than the shallowest reachable scope
[all...] |
| AnalysisBasedWarnings.cpp | 323 llvm::BitVector Reachable(BodyCFG->getNumBlockIDs());
324 clang::reachable_code::ScanReachableFromBlock(&BodyCFG->getEntry(), Reachable);
326 if (!Reachable[B->getBlockID()])
435 // Ignore default cases that aren't likely to be reachable because all
1070 // Mark all case blocks reachable to avoid problems with switching on
2318 // reachable.
|
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ProgramState.h | 357 /// Visits the symbols reachable from the given SVal using the provided
366 /// Visits the symbols reachable from the regions in the given
368 bool scanReachableSymbols(llvm::iterator_range<region_iterator> Reachable,
373 scanReachableSymbols(llvm::iterator_range<region_iterator> Reachable) const;
855 llvm::iterator_range<region_iterator> Reachable) const {
857 scanReachableSymbols(Reachable, cb);
862 /// A utility class that visits the reachable symbols using a custom
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| Local.cpp | 2224 SmallPtrSetImpl<BasicBlock *> &Reachable,
2229 Reachable.insert(BB);
2391 if (Reachable.insert(Successor).second)
2433 /// removeUnreachableBlocks - Remove blocks that are not reachable, even
2438 SmallPtrSet<BasicBlock *, 16> Reachable;
2439 bool Changed = markAliveBlocks(F, Reachable, DTU);
2442 if (Reachable.size() == F.size())
2445 assert(Reachable.size() < F.size());
2450 // Skip reachable basic blocks
2451 if (Reachable.count(&BB)
[all...] |
| 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
|
