HomeSort by: relevance | last modified time | path
    Searched defs:Visited (Results 1 - 25 of 148) sorted by relevancy

1 2 3 4 5 6

  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
CFG.h 160 SmallPtrSet<NodeT, 32> Visited;
162 Visited.insert(Node);
164 // Succ hasn't been visited yet
165 if (!Visited.count(Succ))
167 // We already visited Succ, thus Node->Succ must be a backedge. Check that
DemandedBits.h 91 // The set of visited instructions (non-integer-typed only).
92 SmallPtrSet<Instruction*, 32> Visited;
IntervalIterator.h 91 std::set<BasicBlock *> Visited;
109 : IntStack(std::move(x.IntStack)), Visited(std::move(x.Visited)),
142 // All of the intervals on the stack have been visited. Try visiting
178 if (!Visited.insert(Header).second)
206 if (Visited.count(NodeHeader)) { // Node already been visited?
226 Visited.insert(NodeHeader); // The node has now been visited!
BasicAliasAnalysis.h 164 /// Tracks phi nodes we have visited.
180 /// Tracks instructions visited by pointsToConstantMemory.
181 SmallPtrSet<const Value *, 16> Visited;
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
CodeMetrics.cpp 29 SmallPtrSetImpl<const Value *> &Visited,
36 if (Visited.insert(Operand).second)
41 static void completeEphemeralValues(SmallPtrSetImpl<const Value *> &Visited,
54 assert(Visited.count(V) &&
55 "Failed to add a worklist entry to our visited set!");
65 appendSpeculatableOperands(V, Visited, Worklist);
73 SmallPtrSet<const Value *, 32> Visited;
88 appendSpeculatableOperands(I, Visited, Worklist);
91 completeEphemeralValues(Visited, Worklist, EphValues);
97 SmallPtrSet<const Value *, 32> Visited;
    [all...]
CFG.cpp 40 SmallPtrSet<const BasicBlock*, 8> Visited;
44 Visited.insert(BB);
55 if (Visited.insert(BB).second) {
165 SmallPtrSet<const BasicBlock*, 32> Visited;
168 if (!Visited.insert(BB).second)
CaptureTracking.cpp 214 SmallSet<const Use *, 20> Visited;
225 if (!Visited.insert(&U).second)
LazyCallGraph.cpp 83 SmallPtrSet<Constant *, 16> Visited;
107 Visited.insert(Callee);
114 if (Visited.insert(C).second)
121 visitReferences(Worklist, Visited, [&](Function &F) {
129 if (!Visited.count(F))
195 SmallPtrSet<Constant *, 16> Visited;
198 if (Visited.insert(GV.getInitializer()).second)
204 visitReferences(Worklist, Visited, [&](Function &F) {
263 SmallPtrSet<Node *, 4> Visited;
267 if (!Visited.insert(VisitingNode).second
    [all...]
LoopNestAnalysis.cpp 221 // Visited is used to avoid running into an infinite loop.
222 SmallPtrSet<const BasicBlock *, 4> Visited;
225 while (BB && BB != End && IsEmpty(BB) && !Visited.count(BB) &&
227 Visited.insert(BB);
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/Utils/
AMDGPULDSUtils.cpp 38 SmallPtrSet<User *, 8> Visited;
44 Visited.insert(V);
61 if (Visited.insert(*EU).second) {
  /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
PPCCTRLoops.cpp 101 SmallSet<MachineBasicBlock *, 16> Visited;
106 Visited.insert(MBB);
112 Visited.insert(MBB);
156 if (!Visited.count(MBB)) {
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/
ProvenanceAnalysis.cpp 82 SmallPtrSet<const Value *, 8> Visited;
85 Visited.insert(P);
103 if (Visited.insert(Ur).second)
DependencyAnalysis.cpp 217 SmallPtrSet<const BasicBlock *, 4> Visited;
235 if (Visited.insert(PredBB).second)
250 // visited. If not, insert a sentinal indicating that most optimizations are
252 for (const BasicBlock *BB : Visited) {
256 if (Succ != StartBB && !Visited.count(Succ))
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/Utils/
ImportedFunctionsInliningStatistics.h 60 bool Visited = false;
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPUAlwaysInlinePass.cpp 59 SmallPtrSet<const Value *, 8> Visited;
63 if (!Visited.insert(U).second)
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
BDCE.cpp 49 SmallPtrSet<Instruction *, 16> Visited;
57 Visited.insert(J);
86 if (K && Visited.insert(K).second && K->getType()->isIntOrIntVectorTy() &&
  /src/external/apache2/llvm/dist/clang/include/clang/Sema/
AnalysisBasedWarnings.h 54 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 };
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
BreadthFirstIterator.h 32 // store the visited set. We only provide a non-external variant for now.
35 SetType Visited;
38 // The visited state for the iteration is a simple set.
70 this->Visited.insert(Node);
91 // Already visited?
92 if (this->Visited.insert(Next).second)
DepthFirstIterator.h 20 // This iterator stores the 'visited' set in an external set, which allows
26 // This iterator stores the 'visited' set in an external set, which allows
48 // store the visited set.
52 SetType Visited;
58 df_iterator_storage(SetType &VSet) : Visited(VSet) {}
59 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
61 SetType &Visited;
64 // The visited stated for the iteration is a simple set augmented with
106 this->Visited.insert(Node)
    [all...]
PostOrderIterator.h 31 // visited nodes during the po_iterator's depth-first traversal.
33 // The default implementation simply contains a set of visited nodes, while
39 // those nodes won't be visited again. This is useful for restarting a
59 SetType Visited;
62 // Return true if edge destination should be visited.
65 return Visited.insert(To).second;
68 // Called after all children of BB have been visited.
75 SetType &Visited;
78 po_iterator_storage(SetType &VSet) : Visited(VSet) {}
79 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {
    [all...]
SCCIterator.h 163 typename DenseMap<NodeRef, unsigned>::iterator Visited =
165 if (Visited == nodeVisitNumbers.end()) {
171 unsigned childNum = Visited->second;
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
MVELaneInterleavingPass.cpp 154 SmallPtrSetImpl<Instruction *> &Visited) {
182 Visited.insert(I);
382 SmallPtrSet<Instruction *, 16> Visited;
385 (isa<TruncInst>(I) || isa<FPTruncInst>(I)) && !Visited.count(&I))
386 Changed |= tryInterleave(&I, Visited);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
SplitModule.cpp 171 SmallPtrSet<const GlobalValue *, 32> Visited;
201 if (!Visited.insert(*MI).second)
205 Visited.insert(*MI);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGSDNodes.cpp 223 SmallPtrSet<SDNode*, 16> Visited;
241 if (User == Node || !Visited.insert(User).second)
344 SmallPtrSet<SDNode*, 32> Visited;
346 Visited.insert(DAG->getRoot().getNode());
354 if (Visited.insert(Op.getNode()).second)
764 // either that node is no longer available or we just haven't visited the
767 // dependent nodes have been visited.
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
SwiftErrorValueTracking.cpp 182 SmallSet<const MachineBasicBlock *, 8> Visited;
184 if (!Visited.insert(Pred).second)

Completed in 27 milliseconds

1 2 3 4 5 6