/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))
|
LazyCallGraph.cpp | 24 SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited, 51 if (Visited.insert(cast<Constant>(Op))) 62 SmallPtrSet<Constant *, 16> Visited; 69 if (Visited.insert(C)) 75 findCallees(Worklist, Visited, Callees, CalleeIndexMap); 113 SmallPtrSet<Constant *, 16> Visited; 116 if (Visited.insert(GV.getInitializer())) 121 findCallees(Worklist, Visited, EntryNodes, EntryIndexMap);
|
/external/llvm/lib/Transforms/ObjCARC/ |
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/clang/include/clang/Sema/ |
AnalysisBasedWarnings.h | 51 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 };
|
/external/llvm/include/llvm/Support/ |
GenericDomTreeConstruction.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) {
|
/external/llvm/include/llvm/ADT/ |
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;
|
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...] |
/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!
|
ScalarEvolutionExpressions.h | 577 SmallPtrSet<const SCEV *, 8> Visited; 580 if (Visited.insert(S) && Visitor.follow(S))
|
/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))
|
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/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/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/llvm/lib/Target/PowerPC/ |
PPCCTRLoops.cpp | 573 SmallSet<MachineBasicBlock *, 16> Visited; 578 Visited.insert(MBB); 584 Visited.insert(MBB); 630 if (!Visited.count(MBB)) {
|
/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/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/clang/lib/Analysis/ |
AnalysisDeclContext.cpp | 460 llvm::SmallPtrSet<const VarDecl*, 4> Visited; 477 if (Visited.insert(VD))
|
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;
|
/external/llvm/lib/CodeGen/ |
LiveVariables.cpp | 526 SmallPtrSet<MachineBasicBlock*,16> Visited; 529 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited); 664 assert(Visited.count(&*i) != 0 && "unreachable basic block found");
|
/external/llvm/lib/Transforms/IPO/ |
FunctionAttrs.cpp | 415 SmallSet<Use*, 32> Visited; 429 Visited.insert(&U); 446 if (Visited.insert(&UU)) 460 if (Visited.insert(&UU)) [all...] |
/external/clang/lib/ASTMatchers/ |
ASTMatchFinder.cpp | 536 llvm::DenseSet<const void *> Visited; 554 if (Visited.insert(I->getMemoizationData()).second)
|
/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...] |