/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 | 28 // visited nodes during the po_iterator's depth-first traversal. 30 // The default implementation simply contains a set of visited nodes, while 36 // those nodes won't be visited again. This is useful for restarting a 56 SetType Visited; 58 // Return true if edge destination should be visited. 61 return Visited.insert(To).second; 64 // Called after all children of BB have been visited. 72 SetType &Visited; 74 po_iterator_storage(SetType &VSet) : Visited(VSet) {} 75 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/clang/include/clang/Sema/ |
AnalysisBasedWarnings.h | 51 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 };
|
/external/llvm/include/llvm/Analysis/ |
DemandedBits.h | 65 // The set of visited instructions (non-integer-typed only). 66 SmallPtrSet<Instruction*, 128> Visited;
|
IntervalIterator.h | 92 std::set<BasicBlock*> Visited; 108 : IntStack(std::move(x.IntStack)), Visited(std::move(x.Visited)), 141 // All of the intervals on the stack have been visited. Try visiting 177 if (!Visited.insert(Header).second) 206 if (Visited.count(NodeHeader)) { // Node already been visited? 226 Visited.insert(NodeHeader); // The node has now been visited!
|
/external/llvm/lib/Transforms/Scalar/ |
LoopInstSimplify.cpp | 95 SmallPtrSet<BasicBlock*, 32> Visited; 103 Visited.clear(); 157 if (!Visited.insert(SuccBB).second) 170 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB).second)
|
StructurizeCFG.cpp | 176 BBSet Visited; 296 // for outer loops will be visited before backedges for inner loops. 318 // Make sure we have visited all blocks in this loop before moving back to 353 if (Visited.count(Exit)) 362 if (Visited.count(Succ)) 442 if (Visited.count(*PI)) { 447 if (Visited.count(Other) && !Loops.count(Other) && 474 if (Visited.count(Entry)) 491 // Reset the visited nodes 492 Visited.clear() [all...] |
/external/llvm/lib/Transforms/ObjCARC/ |
ObjCARCContract.cpp | 80 SmallPtrSetImpl<const BasicBlock *> &Visited, 89 SmallPtrSetImpl<const BasicBlock *> &Visited); 149 SmallPtrSetImpl<const BasicBlock *> &Visited) { 158 DependingInstructions, Visited, PA); 162 DependingInstructions, Visited, PA); 164 Visited.clear(); 407 SmallPtrSetImpl<const BasicBlock *> &Visited, 418 return contractAutorelease(F, Inst, Class, DependingInsts, Visited); 533 SmallPtrSet<const BasicBlock *, 4> Visited; 541 if (tryToPeepholeInstruction(F, Inst, I, DependingInstructions, Visited, [all...] |
ProvenanceAnalysis.cpp | 77 SmallPtrSet<const Value *, 8> Visited; 80 Visited.insert(P); 98 if (Visited.insert(Ur).second)
|
DependencyAnalysis.cpp | 227 SmallPtrSetImpl<const BasicBlock *> &Visited, 249 if (Visited.insert(PredBB).second) 264 // visited. If not, insert a sentinal indicating that most optimizations are 266 for (const BasicBlock *BB : Visited) { 272 if (Succ != StartBB && !Visited.count(Succ)) {
|
DependencyAnalysis.h | 57 SmallPtrSetImpl<const BasicBlock *> &Visited,
|
ObjCARCOpts.cpp | 88 SmallPtrSet<const Value *, 4> Visited; 98 if (!Visited.insert(P).second) 870 SmallPtrSet<const BasicBlock *, 4> Visited; [all...] |
/external/clang/lib/StaticAnalyzer/Frontend/ |
AnalysisConsumer.cpp | 311 getInliningModeForFunction(const Decl *D, const SetOfConstDecls &Visited); 314 /// use it to define the order in which the functions should be visited. 421 const SetOfConstDecls &Visited, 436 // Otherwise, if we visited the function before, do not reanalyze it. 437 return Visited.count(D); 442 const SetOfConstDecls &Visited) { 446 if (Visited.count(D)) { 469 // the previously processed functions. Use external Visited set to identify 473 SetOfConstDecls Visited; 489 if (shouldSkipFunction(D, Visited, VisitedAsTopLevel) [all...] |
/external/llvm/lib/Analysis/ |
CFG.cpp | 33 SmallPtrSet<const BasicBlock*, 8> Visited; 37 Visited.insert(BB); 48 if (Visited.insert(BB).second) { 141 SmallSet<const BasicBlock*, 64> Visited; 144 if (!Visited.insert(BB).second)
|
MemoryDependenceAnalysis.cpp | [all...] |
Lint.cpp | 104 SmallPtrSetImpl<Value *> &Visited) const; 620 SmallPtrSet<Value *, 4> Visited; 621 return findValueImpl(V, OffsetOk, Visited); 626 SmallPtrSetImpl<Value *> &Visited) const { 628 if (!Visited.insert(V).second) 647 return findValueImpl(U, OffsetOk, Visited); 656 return findValueImpl(W, OffsetOk, Visited); 659 return findValueImpl(CI->getOperand(0), OffsetOk, Visited); 664 return findValueImpl(W, OffsetOk, Visited); 671 return findValueImpl(CE->getOperand(0), OffsetOk, Visited); [all...] |
CodeMetrics.cpp | 32 SmallPtrSet<const Value *, 32> Visited; 44 if (!Visited.insert(V).second)
|
DemandedBits.cpp | 269 Visited.clear(); 301 // To save memory, we don't add I to the Visited set here. Instead, we 320 Visited.insert(UserI); 344 // been previously visited), then re-queue the operand to be visited 356 } else if (!Visited.count(I)) { 376 return !Visited.count(I) && AliveBits.find(I) == AliveBits.end() &&
|
CaptureTracking.cpp | 216 SmallSet<const Use *, Threshold> Visited; 226 Visited.insert(&U); 287 if (Visited.insert(&UU).second)
|
GlobalsModRef.cpp | 625 SmallPtrSet<const Value *, 8> Visited; 627 Visited.insert(V); 656 if (Visited.insert(LHS).second) 658 if (Visited.insert(RHS).second) 665 if (Visited.insert(Op).second) 711 SmallPtrSet<const Value *, 8> Visited; 713 Visited.insert(V); 773 if (Visited.insert(LHS).second) 775 if (Visited.insert(RHS).second) 782 if (Visited.insert(Op).second [all...] |
/external/clang/lib/Analysis/ |
ThreadSafetyTIL.cpp | 169 if (Visited) return ID; 170 Visited = true; 192 // Visited is assumed to have been set by the topologicalSort. This pass 193 // assumes !Visited means that we've visited this node before. 194 if (!Visited) return ID; 195 Visited = false;
|
/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 | 501 Visited.resize(DAGSize); 526 Visited.reset(); 530 Shift(Visited, LowerBound, UpperBound); 553 Visited.set(SU->NodeNum); 564 if (!Visited.test(s) && Node2Index[s] < UpperBound) { 573 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, 582 if (Visited.test(w)) { 584 Visited.reset(w); 624 Visited.reset();
|
/external/clang/lib/Sema/ |
SemaLookup.cpp | 100 llvm::SmallPtrSet<DeclContext*, 8> visited; member in class:__anon7507::UnqualUsingDirectiveSet 131 // A given context is only every visited once, so it is important 132 // that contexts be visited from the inside out in order to get 135 if (!visited.insert(DC).second) 146 if (!visited.insert(NS).second) 161 if (visited.insert(NS).second) { [all...] |