| /external/llvm/lib/Analysis/ |
| CaptureTracking.cpp | 50 SmallSet<Use*, Threshold> Visited;
61 Visited.insert(U);
124 if (Visited.insert(U))
|
| BranchProbabilityInfo.cpp | 78 SmallPtrSet<BasicBlock *, 8> Visited;
92 Visited.insert(BB);
96 if (Visited.count(BB))
|
| Lint.cpp | 99 SmallPtrSet<Value *, 4> &Visited) const;
554 SmallPtrSet<Value *, 4> Visited;
555 return findValueImpl(V, OffsetOk, Visited);
560 SmallPtrSet<Value *, 4> &Visited) const {
562 if (!Visited.insert(V))
579 return findValueImpl(U, OffsetOk, Visited);
588 return findValueImpl(W, OffsetOk, Visited);
592 return findValueImpl(CI->getOperand(0), OffsetOk, Visited);
597 return findValueImpl(W, OffsetOk, Visited);
606 return findValueImpl(CE->getOperand(0), OffsetOk, Visited);
[all...] |
| BasicAliasAnalysis.cpp | 520 // Visited - Track instructions visited by pointsToConstantMemory.
521 SmallPtrSet<const Value*, 16> Visited;
565 assert(Visited.empty() && "Visited must be cleared after use!");
572 if (!Visited.insert(V)) {
573 Visited.clear();
587 Visited.clear();
605 Visited.clear();
614 Visited.clear()
[all...] |
| MemoryDependenceAnalysis.cpp | 618 SmallPtrSet<BasicBlock*, 64> Visited;
629 if (!Visited.insert(DirtyBB))
725 DenseMap<BasicBlock*, Value*> Visited;
727 Result, Visited, true))
[all...] |
| /external/clang/include/clang/Sema/ |
| AnalysisBasedWarnings.h | 49 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 };
|
| /external/llvm/include/llvm/Analysis/ |
| DominatorInternals.h | 66 // First time we visited this BB?
92 // Visit the successor next, if it isn't already visited.
116 SmallPtrSet<typename GraphT::NodeType*, 32> Visited;
128 if (Visited.insert(VAncestor) && VInfo.Parent >= LastLinked) {
|
| IntervalIterator.h | 92 std::set<BasicBlock*> Visited;
134 // All of the intervals on the stack have been visited. Try visiting
168 if (Visited.count(Header)) return false;
171 Visited.insert(Header); // The header has now been visited!
197 if (Visited.count(NodeHeader)) { // Node already been visited?
217 Visited.insert(NodeHeader); // The node has now been visited!
|
| /external/llvm/lib/VMCore/ |
| Globals.cpp | 242 SmallPtrSet<const GlobalValue*, 3> Visited;
249 Visited.insert(GV);
258 if (!Visited.insert(GV))
|
| /external/llvm/include/llvm/ADT/ |
| DepthFirstIterator.h | 21 // This iterator stores the 'visited' set in an external set, which allows
27 // This iterator stores the 'visited' set in an external set, which allows
45 // store the visited set.
49 SetType Visited;
55 df_iterator_storage(SetType &VSet) : Visited(VSet) {}
56 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
57 SetType &Visited;
81 this->Visited.insert(Node);
93 this->Visited.insert(Node)
[all...] |
| PostOrderIterator.h | 29 SetType Visited;
35 po_iterator_storage(SetType &VSet) : Visited(VSet) {}
36 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {}
37 SetType &Visited;
59 if (this->Visited.insert(BB)) { // If the block is not visited...
66 this->Visited.insert(BB);
74 if (this->Visited.insert(BB)) {
|
| /external/llvm/lib/CodeGen/ |
| ProcessImplicitDefs.cpp | 95 SmallPtrSet<MachineBasicBlock*,16> Visited;
100 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
|
| 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");
|
| InlineSpiller.cpp | 299 SmallPtrSet<VNInfo*, 8> Visited;
314 if (!Visited.insert(VNI))
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 78 SmallPtrSet<BasicBlock*, 32> Visited;
86 Visited.clear();
132 if (!Visited.insert(SuccBB))
145 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
|
| CodeGenPrepare.cpp | 733 SmallPtrSet<Value*, 16> Visited;
749 if (Visited.count(V)) {
754 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...] |
| /external/webkit/Source/WebKit/android/nav/ |
| CachedHistory.h | 31 #define NAVIGATION_VISIT_DEPTH 8 // the number of nodes last visited -- used to detect ping-ponging (number should be tuned)
38 // It uses blind pointers for comparison in the previously visited nodes.
60 struct Visited {
|
| /external/clang/lib/Analysis/ |
| AnalysisContext.cpp | 316 llvm::DenseMap<const VarDecl*, unsigned> Visited;
338 unsigned &flag = Visited[VD];
348 unsigned &flag = Visited[VD];
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| FunctionLoweringInfo.cpp | 432 SmallPtrSet<const BasicBlock*, 4> Visited;
437 while (Visited.insert(SuccBB)) {
|
| 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/llvm/lib/Target/X86/ |
| SSEDomainFix.cpp | 465 SmallPtrSet<MachineBasicBlock*, 16> Visited;
467 DFI = df_ext_begin(Entry, Visited), DFE = df_ext_end(Entry, Visited);
|
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | 315 SmallPtrSet<Instruction*, 4> Visited;
323 if (!Visited.insert(I)) {
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 672 /// Visited - a set of nodes visited during a DFS traversal.
673 BitVector Visited;
682 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstructionCombining.cpp | [all...] |
