| /external/clang/lib/Analysis/ |
| ReachableCode.cpp | 345 llvm::BitVector Visited;
357 : Visited(reachable.size()),
377 if (Reachable[blockID] || Visited[blockID])
379 Visited[blockID] = true;
390 if (Visited[blockID]) {
396 Visited[blockID] = true;
|
| /external/llvm/lib/IR/ |
| Value.cpp | 430 SmallPtrSet<Value *, 4> Visited;
432 Visited.insert(V);
462 } while (Visited.insert(V).second);
491 SmallPtrSet<Value *, 4> Visited;
492 Visited.insert(this);
511 } while (Visited.insert(V).second);
|
| Type.cpp | 155 bool Type::isSizedDerivedType(SmallPtrSetImpl<Type*> *Visited) const {
157 return ATy->getElementType()->isSized(Visited);
160 return VTy->getElementType()->isSized(Visited);
162 return cast<StructType>(this)->isSized(Visited);
554 bool StructType::isSized(SmallPtrSetImpl<Type*> *Visited) const {
560 if (Visited && !Visited->insert(const_cast<StructType*>(this)).second)
567 if (!(*I)->isSized(Visited))
|
| /external/llvm/lib/Transforms/Scalar/ |
| TailRecursionElimination.cpp | 180 SmallPtrSet<Use *, 32> Visited;
184 if (!Visited.insert(&U).second)
273 // contain the escaping instruction will be marked as being visited without an
280 DenseMap<BasicBlock *, VisitType> Visited;
345 auto &State = Visited[SuccBB];
362 if (Visited[NextBB] == UNESCAPED) {
372 if (Visited[CI->getParent()] != ESCAPED) {
[all...] |
| LoopRerollPass.cpp | [all...] |
| AlignmentFromAssumptions.cpp | 314 SmallPtrSet<Instruction *, 32> Visited;
402 Visited.insert(J);
405 if (!Visited.count(K) && isValidAssumeForContext(ACall, K, DT))
|
| LoopUnswitch.cpp | 608 std::set<BasicBlock*> &Visited) {
609 if (!Visited.insert(BB).second) {
610 // Already visited. Without more analysis, this could indicate an infinite
625 if (!isTrivialLoopExitBlockHelper(L, *SI, ExitBB, Visited))
642 std::set<BasicBlock*> Visited;
643 Visited.insert(L->getHeader()); // Branches to header make infinite loops.
645 if (isTrivialLoopExitBlockHelper(L, BB, ExitBB, Visited))
827 SmallSet<BasicBlock*, 8> Visited;
830 // If we exit loop or reach a previous visited block, then
[all...] |
| /external/llvm/include/llvm/IR/ |
| Type.h | 261 bool isSized(SmallPtrSetImpl<Type*> *Visited = nullptr) const {
273 return isSizedDerivedType(Visited);
419 bool isSizedDerivedType(SmallPtrSetImpl<Type*> *Visited = nullptr) const;
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 204 SmallPtrSetImpl<Instruction *> &Visited,
214 SmallPtrSetImpl<Instruction *> &Visited,
|
| /external/llvm/lib/Analysis/ |
| LazyCallGraph.cpp | 24 SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited,
51 if (Visited.insert(cast<Constant>(Op)).second)
62 SmallPtrSet<Constant *, 16> Visited;
69 if (Visited.insert(C).second)
75 findCallees(Worklist, Visited, Callees, CalleeIndexMap);
113 SmallPtrSet<Constant *, 16> Visited;
116 if (Visited.insert(GV.getInitializer()).second)
121 findCallees(Worklist, Visited, EntryNodes, EntryIndexMap);
|
| BasicAliasAnalysis.cpp | 475 assert(Visited.empty() && "Visited must be cleared after use!");
482 if (!Visited.insert(V).second) {
483 Visited.clear();
497 Visited.clear();
515 Visited.clear();
524 Visited.clear();
529 Visited.clear();
[all...] |
| VectorUtils.cpp | 452 SmallPtrSet<Value *, 16> Visited;
489 if (Visited.count(Val))
491 Visited.insert(Val);
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGStackify.cpp | 176 // successors are visited in (see above). Also, we can sort the blocks in the
178 SmallPtrSet<MachineBasicBlock *, 16> Visited;
182 Visited.insert(EntryBlock);
190 if (Visited.insert(Succ).second)
|
| WebAssemblyPEI.cpp | 389 // Visited will contain all the basic blocks that are in the region
396 SmallPtrSet<MachineBasicBlock *, 8> Visited;
406 Visited.insert(Entry);
408 Visited.insert(Save);
412 // By construction Restore cannot be visited, otherwise it
423 // Enqueue all the successors not already visited.
426 if (Visited.insert(SuccBB).second)
433 for (MachineBasicBlock *MBB : Visited) {
842 "DFS stack predecessor is already visited.\n");
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| BasicAliasAnalysis.h | 115 /// Tracks phi nodes we have visited.
131 /// Tracks instructions visited by pointsToConstantMemory.
132 SmallPtrSet<const Value *, 16> Visited;
|
| MemoryDependenceAnalysis.h | 451 DenseMap<BasicBlock *, Value *> &Visited,
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCCTRLoops.cpp | 608 SmallSet<MachineBasicBlock *, 16> Visited;
613 Visited.insert(MBB);
619 Visited.insert(MBB);
665 if (!Visited.count(MBB)) {
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUtils.cpp | 71 SmallPtrSetImpl<Instruction *> &Visited,
86 Visited.insert(Phi);
96 SmallPtrSetImpl<Instruction *> &Visited,
117 if (Visited.count(J)) {
122 // If the operand is not in Visited, it is not a reduction operation, but
|
| /external/llvm/utils/TableGen/ |
| DFAPacketizerEmitter.cpp | 899 std::map<std::set<unsigned>, const State*> Visited;
909 // Visited = {}
[all...] |
| /external/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 65 // First time we visited this BB?
91 // Visit the successor next, if it isn't already visited.
115 SmallPtrSet<typename GraphT::NodeType*, 32> Visited;
127 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) {
|
| /external/llvm/lib/CodeGen/ |
| PrologEpilogInserter.cpp | 373 // Visited will contain all the basic blocks that are in the region
380 SmallPtrSet<MachineBasicBlock *, 8> Visited;
390 Visited.insert(Entry);
392 Visited.insert(Save);
396 // By construction Restore cannot be visited, otherwise it
407 // Enqueue all the successors not already visited.
410 if (Visited.insert(SuccBB).second)
417 for (MachineBasicBlock *MBB : Visited) {
826 "DFS stack predecessor is already visited.\n");
[all...] |
| LiveInterval.cpp | 788 SmallPtrSetImpl<const MachineBasicBlock*> &Visited) {
803 if (!Visited.insert(Pred).second)
806 VNI = searchForVNI(Indexes, LR, Pred, Visited);
817 SmallPtrSet<const MachineBasicBlock*, 5> Visited;
828 Visited.clear();
831 VNInfo *VNI = searchForVNI(Indexes, LI, Pred, Visited);
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.cpp | 212 SmallPtrSet<SDNode*, 16> Visited;
223 if (User == Node || !Visited.insert(User).second)
324 SmallPtrSet<SDNode*, 64> Visited;
326 Visited.insert(DAG->getRoot().getNode());
334 if (Visited.insert(Op.getNode()).second)
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 700 /// Visited - a set of nodes visited during a DFS traversal.
701 BitVector Visited;
710 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|
| /external/llvm/lib/Target/ARM/ |
| Thumb2SizeReduction.cpp | 197 // Has this block been visited yet?
198 bool Visited;
200 MBBInfo() : HighLatencyCPSR(false), Visited(false) {}
[all...] |
