| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| LiveVariables.cpp | 502 SmallPtrSet<MachineBasicBlock*,16> Visited;
505 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
636 assert(Visited.count(&*i) != 0 && "unreachable basic block found");
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| Local.cpp | 324 SmallPtrSet<Instruction*, 4> Visited;
332 if (!Visited.insert(I)) {
[all...] |
| /external/swiftshader/third_party/LLVM/lib/VMCore/ |
| AutoUpgrade.cpp | 428 SmallPtrSet<BasicBlock*, 8> &Visited) {
429 if (!Visited.insert(BB)) return;
453 FindExnAndSelIntrinsics(*I, Exn, Sel, Visited);
542 SmallPtrSet<BasicBlock*, 8> Visited;
545 FindExnAndSelIntrinsics(UnwindDest, Exn, Sel, Visited);
|
| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 670 llvm::DenseSet<const void *> Visited;
685 if (Visited.insert(Parent.getMemoizationData()).second)
[all...] |
| /external/clang/lib/Lex/ |
| PPMacroExpansion.cpp | 242 llvm::DenseSet<ModuleMacro*> Visited;
263 if (Visited.insert(O).second)
[all...] |
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| AnalysisConsumer.cpp | 310 getInliningModeForFunction(const Decl *D, const SetOfConstDecls &Visited);
313 /// use it to define the order in which the functions should be visited.
420 const SetOfConstDecls &Visited,
435 // Otherwise, if we visited the function before, do not reanalyze it.
436 return Visited.count(D);
441 const SetOfConstDecls &Visited) {
445 if (Visited.count(D)) {
468 // the previously processed functions. Use external Visited set to identify
472 SetOfConstDecls Visited;
488 if (shouldSkipFunction(D, Visited, VisitedAsTopLevel)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpressions.h | 487 SmallPtrSet<const SCEV *, 8> Visited;
490 if (Visited.insert(S).second && Visitor.follow(S))
|
| /external/llvm/lib/Analysis/ |
| StratifiedSets.h | 326 SmallSet<StratifiedIndex, 16> Visited;
329 if (!Visited.insert(CurrentIndex).second)
|
| /external/llvm/lib/CodeGen/ |
| PrologEpilogInserter.cpp | 402 // Visited will contain all the basic blocks that are in the region
409 SmallPtrSet<MachineBasicBlock *, 8> Visited;
419 Visited.insert(Entry);
421 Visited.insert(Save);
425 // By construction Restore cannot be visited, otherwise it
436 // Enqueue all the successors not already visited.
439 if (Visited.insert(SuccBB).second)
446 for (MachineBasicBlock *MBB : Visited) {
[all...] |
| SafeStack.cpp | 270 SmallPtrSet<const Value *, 16> Visited;
349 if (Visited.insert(I).second)
[all...] |
| /external/llvm/lib/Target/ARM/ |
| Thumb2SizeReduction.cpp | 205 // Has this block been visited yet?
206 bool Visited;
208 MBBInfo() : HighLatencyCPSR(false), Visited(false) {}
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonOptAddrMode.cpp | 195 NodeSet Visited, Defs;
196 const auto &ReachingDefs = LV->getAllReachingDefsRec(UR, UN, Visited, Defs);
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 622 SmallPtrSet<Value *, 4> Visited;
629 if (!Visited.insert(P).second)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| Reassociate.cpp | 475 SmallPtrSet<Value*, 8> Visited; // For sanity checking the iteration scheme.
490 assert(Visited.insert(Op).second && "Not first visit!");
500 assert(Visited.insert(Op).second && "Not first visit!");
512 assert(Visited.count(Op) && "In leaf map but not visited!");
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 259 /// The set of basic blocks the renamer has already visited.
261 SmallPtrSet<BasicBlock *, 16> Visited;
653 // The renamer uses the Visited set to avoid infinite loops. Clear it now.
654 Visited.clear();
[all...] |
| /external/llvm/utils/TableGen/ |
| DFAPacketizerEmitter.cpp | 894 std::map<std::set<unsigned>, const State*> Visited;
904 // Visited = {}
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| BasicAliasAnalysis.cpp | 523 // Visited - Track instructions visited by pointsToConstantMemory.
524 SmallPtrSet<const Value*, 16> Visited;
573 assert(Visited.empty() && "Visited must be cleared after use!");
580 if (!Visited.insert(V)) {
581 Visited.clear();
595 Visited.clear();
613 Visited.clear();
622 Visited.clear()
[all...] |
| MemoryDependenceAnalysis.cpp | 634 SmallPtrSet<BasicBlock*, 64> Visited;
645 if (!Visited.insert(DirtyBB))
741 DenseMap<BasicBlock*, Value*> Visited;
743 Result, Visited, true))
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.cpp | 181 SmallPtrSet<SDNode*, 16> Visited;
189 if (User == Node || !Visited.insert(User))
286 SmallPtrSet<SDNode*, 64> Visited;
288 Visited.insert(DAG->getRoot().getNode());
296 if (Visited.insert(NI->getOperand(i).getNode()))
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| CodeGenPrepare.cpp | 722 SmallPtrSet<Value*, 16> Visited;
738 if (!Visited.insert(V)) {
[all...] |
| LoopUnswitch.cpp | 298 std::set<BasicBlock*> &Visited) {
299 if (!Visited.insert(BB).second) {
300 // Already visited. Without more analysis, this could indicate an infinte loop.
313 if (!isTrivialLoopExitBlockHelper(L, *SI, ExitBB, Visited))
330 std::set<BasicBlock*> Visited;
331 Visited.insert(L->getHeader()); // Branches to header make infinite loops.
333 if (isTrivialLoopExitBlockHelper(L, BB, ExitBB, Visited))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpressions.h | 487 SmallPtrSet<const SCEV *, 8> Visited;
490 if (Visited.insert(S).second && Visitor.follow(S))
586 auto* Visited = SCEVVisitor<SC, const SCEV *>::visit(S);
587 auto Result = RewriteResults.try_emplace(S, Visited);
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| ScalarEvolutionExpressions.h | 487 SmallPtrSet<const SCEV *, 8> Visited;
490 if (Visited.insert(S).second && Visitor.follow(S))
586 auto* Visited = SCEVVisitor<SC, const SCEV *>::visit(S);
587 auto Result = RewriteResults.try_emplace(S, Visited);
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| ScalarEvolutionExpressions.h | 487 SmallPtrSet<const SCEV *, 8> Visited;
490 if (Visited.insert(S).second && Visitor.follow(S))
586 auto* Visited = SCEVVisitor<SC, const SCEV *>::visit(S);
587 auto Result = RewriteResults.try_emplace(S, Visited);
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| ScalarEvolutionExpressions.h | 496 SmallPtrSet<const SCEV *, 8> Visited;
499 if (Visited.insert(S).second && Visitor.follow(S))
596 auto* Visited = SCEVVisitor<SC, const SCEV *>::visit(S);
597 auto Result = RewriteResults.try_emplace(S, Visited);
|
