| /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)
|
| Loads.cpp | 47 const TargetLibraryInfo *TLI, SmallPtrSetImpl<const Value *> &Visited,
55 // Already visited? Bail out, we've likely hit unreachable code.
56 if (!Visited.insert(V).second)
65 Size, DL, CtxI, DT, TLI, Visited,
68 Size, DL, CtxI, DT, TLI, Visited,
77 Visited, MaxDepth);
137 // Offset and Size may have different bit widths if we have visited an
141 CtxI, DT, TLI, Visited, MaxDepth);
148 TLI, Visited, MaxDepth);
153 Visited, MaxDepth)
[all...] |
| ImportedFunctionsInliningStatistics.cpp | 182 if (!Node.Visited)
188 assert(!GraphNode.Visited);
189 GraphNode.Visited = true;
192 if (!InlinedFunctionNode->Visited)
|
| Lint.cpp | 123 SmallPtrSetImpl<Value *> &Visited) const;
632 SmallPtrSet<Value *, 4> Visited;
633 return findValueImpl(V, OffsetOk, Visited);
638 SmallPtrSetImpl<Value *> &Visited) const {
640 if (!Visited.insert(V).second)
658 return findValueImpl(U, OffsetOk, Visited);
668 return findValueImpl(W, OffsetOk, Visited);
671 return findValueImpl(CI->getOperand(0), OffsetOk, Visited);
676 return findValueImpl(W, OffsetOk, Visited);
683 return findValueImpl(CE->getOperand(0), OffsetOk, Visited);
[all...] |
| /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
|
| MustExecute.h | 285 : Visited(Other.Visited), Explorer(Other.Explorer),
289 : Visited(std::move(Other.Visited)), Explorer(Other.Explorer),
294 std::swap(Visited, Other.Visited);
335 return Visited.count({I, ExplorationDirection::FORWARD}) ||
336 Visited.count({I, ExplorationDirection::BACKWARD});
358 /// A set to track the visited instructions in order to deal with endless
360 VisitedSetTy Visited;
[all...] |
| 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!
|
| /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/include/llvm/ADT/ |
| 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...] |
| 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)
|
| /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/CodeGen/ |
| ScheduleDAG.cpp | 509 Visited.resize(DAGSize);
556 Visited.reset();
560 Shift(Visited, LowerBound, UpperBound);
579 Visited.set(SU->NodeNum);
591 if (!Visited.test(s) && Node2Index[s] < UpperBound) {
614 Visited.reset();
633 if (!Visited.test(s) && Node2Index[s] < UpperBound) {
634 Visited.set(s);
650 // to LowerBound. SUs that are visited by the two
666 if (!VisitedBack.test(s) && Visited.test(s))
[all...] |
| ReachingDefAnalysis.cpp | 382 SmallPtrSet<MachineBasicBlock*, 4>Visited;
386 if (Visited.count(MBB) || !MBB->isLiveIn(PhysReg))
390 Visited.insert(MBB);
603 SmallPtrSet<MachineInstr*, 2> Visited;
604 return isSafeToRemove(MI, Visited, ToRemove, Ignore);
610 SmallPtrSet<MachineInstr*, 2> Visited;
611 return isSafeToRemove(MI, Visited, ToRemove, Ignore);
615 ReachingDefAnalysis::isSafeToRemove(MachineInstr *MI, InstSet &Visited,
617 if (Visited.count(MI) || Ignore.count(MI))
625 Visited.insert(MI)
[all...] |
| /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/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/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/Utils/ |
| BypassSlowDivision.cpp | 83 bool isHashLikeValue(Value *V, VisitedSetTy &Visited);
84 ValueRange getValueRange(Value *Op, VisitedSetTy &Visited);
190 bool FastDivInsertionTask::isHashLikeValue(Value *V, VisitedSetTy &Visited) {
212 if (Visited.size() >= 16)
214 // Do not visit nodes that have been visited already. We return true because
216 if (!Visited.insert(I).second)
221 return getValueRange(V, Visited) == VALRNG_LIKELY_LONG ||
231 VisitedSetTy &Visited) {
253 if (isHashLikeValue(V, Visited))
|
| /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/clang/lib/Analysis/ |
| ThreadSafetyTIL.cpp | 167 if (Visited) return ID;
168 Visited = true;
191 // Visited is assumed to have been set by the topologicalSort. This pass
192 // assumes !Visited means that we've visited this node before.
193 if (!Visited) return ID;
194 Visited = false;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/Utils/ |
| ImportedFunctionsInliningStatistics.h | 60 bool Visited = false;
|
| /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/clang/lib/StaticAnalyzer/Frontend/ |
| AnalysisConsumer.cpp | 60 "The # of visited basic blocks in the analyzed functions.");
238 getInliningModeForFunction(const Decl *D, const SetOfConstDecls &Visited);
241 /// use it to define the order in which the functions should be visited.
385 const SetOfConstDecls &Visited,
414 // Otherwise, if we visited the function before, do not reanalyze it.
415 return Visited.count(D);
420 const SetOfConstDecls &Visited) {
424 if (Visited.count(D) && isa<ObjCMethodDecl>(D)) {
445 // the previously processed functions. Use external Visited set to identify
449 SetOfConstDecls Visited;
[all...] |
