| /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
46 // store the visited set.
50 SetType Visited;
56 df_iterator_storage(SetType &VSet) : Visited(VSet) {}
57 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
58 SetType &Visited;
82 this->Visited.insert(Node);
94 this->Visited.insert(Node)
[all...] |
| PostOrderIterator.h | 27 // visited nodes during the po_iterator's depth-first traversal.
29 // The default implementation simply contains a set of visited nodes, while
35 // those nodes won't be visited again. This is useful for restarting a
55 SetType Visited;
57 // Return true if edge destination should be visited.
60 return Visited.insert(To);
63 // Called after all children of BB have been visited.
71 SetType &Visited;
73 po_iterator_storage(SetType &VSet) : Visited(VSet) {}
74 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {
[all...] |
| SCCIterator.h | 159 typename DenseMap<NodeType *, unsigned>::iterator Visited =
161 if (Visited == nodeVisitNumbers.end()) {
167 unsigned childNum = Visited->second;
|
| /external/llvm/lib/Analysis/ |
| CaptureTracking.cpp | 85 SmallSet<const Use *, Threshold> Visited;
95 Visited.insert(&U);
155 if (Visited.insert(&UU))
|
| CFG.cpp | 33 SmallPtrSet<const BasicBlock*, 8> Visited;
37 Visited.insert(BB);
48 if (Visited.insert(BB)) {
141 SmallSet<const BasicBlock*, 64> Visited;
144 if (!Visited.insert(BB))
|
| MemoryDependenceAnalysis.cpp | 677 SmallPtrSet<BasicBlock*, 64> Visited;
688 if (!Visited.insert(DirtyBB))
784 DenseMap<BasicBlock*, Value*> Visited;
786 Result, Visited, true))
[all...] |
| Lint.cpp | 99 SmallPtrSet<Value *, 4> &Visited) const;
619 SmallPtrSet<Value *, 4> Visited;
620 return findValueImpl(V, OffsetOk, Visited);
625 SmallPtrSet<Value *, 4> &Visited) const {
627 if (!Visited.insert(V))
644 return findValueImpl(U, OffsetOk, Visited);
653 return findValueImpl(W, OffsetOk, Visited);
656 return findValueImpl(CI->getOperand(0), OffsetOk, Visited);
661 return findValueImpl(W, OffsetOk, Visited);
670 return findValueImpl(CE->getOperand(0), OffsetOk, Visited);
[all...] |
| /external/clang/include/clang/Sema/ |
| AnalysisBasedWarnings.h | 51 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 };
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| DependencyAnalysis.h | 57 SmallPtrSet<const BasicBlock *, 4> &Visited,
|
| DependencyAnalysis.cpp | 210 SmallPtrSet<const BasicBlock *, 4> &Visited,
232 if (Visited.insert(PredBB))
247 // visited. If not, insert a sentinal indicating that most optimizations are
249 for (SmallPtrSet<const BasicBlock *, 4>::const_iterator I = Visited.begin(),
250 E = Visited.end(); I != E; ++I) {
257 if (Succ != StartBB && !Visited.count(Succ)) {
|
| ProvenanceAnalysis.cpp | 76 SmallPtrSet<const Value *, 8> Visited;
79 Visited.insert(P);
97 if (Visited.insert(Ur))
|
| ObjCARCContract.cpp | 78 &Visited);
156 &Visited) {
165 DependingInstructions, Visited, PA);
169 DependingInstructions, Visited, PA);
171 Visited.clear();
343 SmallPtrSet<const BasicBlock *, 4> Visited;
358 if (ContractAutorelease(F, Inst, Class, DependingInstructions, Visited))
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 90 SmallPtrSet<BasicBlock*, 32> Visited;
98 Visited.clear();
151 if (!Visited.insert(SuccBB))
164 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
|
| StructurizeCFG.cpp | 171 BBSet Visited;
293 if (Visited.count(Exit))
304 if (Visited.count(Succ))
385 if (Visited.count(*PI)) {
390 if (Visited.count(Other) && !Loops.count(Other) &&
417 if (Visited.count(Entry))
434 // Reset the visited nodes
435 Visited.clear();
444 Visited.insert((*OI)->getEntry());
722 Visited.insert(Node->getEntry())
[all...] |
| TailRecursionElimination.cpp | 174 SmallPtrSet<Use *, 32> Visited;
178 if (!Visited.insert(&U))
269 // contain the escaping instruction will be marked as being visited without an
276 DenseMap<BasicBlock *, VisitType> Visited;
339 auto &State = Visited[SuccBB];
356 if (Visited[NextBB] == UNESCAPED) {
366 if (Visited[CI->getParent()] != ESCAPED) {
[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.
417 const SetOfConstDecls &Visited,
432 // Otherwise, if we visited the function before, do not reanalyze it.
433 return Visited.count(D);
438 const SetOfConstDecls &Visited) {
442 if (Visited.count(D)) {
465 // the previously processed functions. Use external Visited set to identify
469 SetOfConstDecls Visited;
485 if (shouldSkipFunction(D, Visited, VisitedAsTopLevel)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| 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/IR/ |
| Value.cpp | 384 SmallPtrSet<Value *, 4> Visited;
386 Visited.insert(V);
416 } while (Visited.insert(V));
445 SmallPtrSet<Value *, 4> Visited;
446 Visited.insert(this);
465 } while (Visited.insert(V));
477 SmallPtrSet<const Value *, 32> &Visited) {
500 return isDereferenceablePointer(BC->getOperand(0), DL, Visited);
514 if (!Visited.insert(GEP->getOperand(0)))
516 if (!isDereferenceablePointer(GEP->getOperand(0), DL, Visited))
[all...] |
| /external/clang/lib/Serialization/ |
| ModuleManager.cpp | 212 assert(State->NextState == nullptr && "Visited state is in list?");
283 // stack (if it hasn't already been marked as visited).
291 // queue to be visited.
309 // index that is *not* in that set as 'visited'.
333 // behavior, we mark all of the reachable modules as having been visited.
337 // stack (if it hasn't already been marked as visited).
364 SmallVectorImpl<bool> &Visited) {
373 if (Visited[(*IM)->Index])
375 Visited[(*IM)->Index] = true;
377 if (visitDepthFirst(**IM, Visitor, UserData, Visited))
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
| R600KernelParameters.cpp | 73 bool IsIndirect(Value *Val, std::set<Value*> &Visited);
139 bool R600KernelParameters::IsIndirect(Value *Val, std::set<Value*> &Visited) {
152 if (Visited.count(Val)) {
156 Visited.insert(Val);
173 if (IsIndirect(V2, Visited)) {
191 std::set<Value*> Visited;
192 P.IsIndirect = IsIndirect(P.Val, Visited);
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| R600KernelParameters.cpp | 73 bool IsIndirect(Value *Val, std::set<Value*> &Visited);
139 bool R600KernelParameters::IsIndirect(Value *Val, std::set<Value*> &Visited) {
152 if (Visited.count(Val)) {
156 Visited.insert(Val);
173 if (IsIndirect(V2, Visited)) {
191 std::set<Value*> Visited;
192 P.IsIndirect = IsIndirect(P.Val, Visited);
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 503 Visited.resize(DAGSize);
528 Visited.reset();
532 Shift(Visited, LowerBound, UpperBound);
555 Visited.set(SU->NodeNum);
566 if (!Visited.test(s) && Node2Index[s] < UpperBound) {
575 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,
584 if (Visited.test(w)) {
586 Visited.reset(w);
626 Visited.reset();
|
| /external/llvm/utils/TableGen/ |
| DFAPacketizerEmitter.cpp | 439 std::map<std::set<unsigned>, const State*> Visited;
449 // Visited = {}
456 // If S' is not in Visited:
458 // Add S' to Visited
481 auto VI = Visited.find(NewStateResources);
482 if (VI != Visited.end())
487 Visited[NewStateResources] = NewState;
|
| /external/clang/lib/Sema/ |
| SemaLookup.cpp | 96 llvm::SmallPtrSet<DeclContext*, 8> visited; member in class:__anon1769::UnqualUsingDirectiveSet
127 // A given context is only every visited once, so it is important
128 // that contexts be visited from the inside out in order to get
131 if (!visited.insert(DC))
142 if (!visited.insert(NS))
157 if (visited.insert(NS)) {
[all...] |
| /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;
|
