/external/llvm/lib/Transforms/ObjCARC/ |
H A D | ProvenanceAnalysis.cpp | 76 SmallPtrSet<const Value *, 8> Visited; local 79 Visited.insert(P); 97 if (Visited.insert(Ur))
|
H A D | DependencyAnalysis.cpp | 210 SmallPtrSet<const BasicBlock *, 4> &Visited, 232 if (Visited.insert(PredBB)) 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)) { 206 FindDependencies(DependenceKind Flavor, const Value *Arg, BasicBlock *StartBB, Instruction *StartInst, SmallPtrSet<Instruction *, 4> &DependingInsts, SmallPtrSet<const BasicBlock *, 4> &Visited, ProvenanceAnalysis &PA) argument
|
H A D | ObjCARCContract.cpp | 78 &Visited); 156 &Visited) { 165 DependingInstructions, Visited, PA); 169 DependingInstructions, Visited, PA); 171 Visited.clear(); 343 SmallPtrSet<const BasicBlock *, 4> Visited; local 358 if (ContractAutorelease(F, Inst, Class, DependingInstructions, Visited)) 151 ContractAutorelease(Function &F, Instruction *Autorelease, InstructionClass Class, SmallPtrSet<Instruction *, 4> &DependingInstructions, SmallPtrSet<const BasicBlock *, 4> &Visited) argument
|
/external/llvm/lib/Analysis/ |
H A D | CaptureTracking.cpp | 85 SmallSet<const Use *, Threshold> Visited; local 95 Visited.insert(&U); 155 if (Visited.insert(&UU))
|
H A D | CFG.cpp | 33 SmallPtrSet<const BasicBlock*, 8> Visited; 37 Visited.insert(BB); 48 if (Visited.insert(BB)) { 141 SmallSet<const BasicBlock*, 64> Visited; local 144 if (!Visited.insert(BB))
|
H A D | LazyCallGraph.cpp | 24 SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited, 51 if (Visited.insert(cast<Constant>(Op))) 62 SmallPtrSet<Constant *, 16> Visited; local 69 if (Visited.insert(C)) 75 findCallees(Worklist, Visited, Callees, CalleeIndexMap); 113 SmallPtrSet<Constant *, 16> Visited; local 116 if (Visited.insert(GV.getInitializer())) 121 findCallees(Worklist, Visited, EntryNodes, EntryIndexMap); 23 findCallees( SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited, SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &Callees, DenseMap<Function *, size_t> &CalleeIndexMap) argument
|
H A D | Lint.cpp | 99 SmallPtrSet<Value *, 4> &Visited) const; 619 SmallPtrSet<Value *, 4> Visited; local 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/ |
H A D | AnalysisBasedWarnings.h | 51 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 }; enumerator in enum:clang::sema::AnalysisBasedWarnings::VisitFlag
|
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 116 SmallPtrSet<typename GraphT::NodeType*, 32> Visited; local 128 if (Visited.insert(VAncestor) && VInfo.Parent >= LastLinked) {
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopInstSimplify.cpp | 90 SmallPtrSet<BasicBlock*, 32> Visited; local 98 Visited.clear(); 151 if (!Visited.insert(SuccBB)) 164 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
|
/external/llvm/include/llvm/ADT/ |
H A D | DepthFirstIterator.h | 50 SetType Visited; member in class:llvm::df_iterator_storage 56 df_iterator_storage(SetType &VSet) : Visited(VSet) {} 57 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {} 58 SetType &Visited; member in class:llvm::df_iterator_storage 82 this->Visited.insert(Node); 94 this->Visited.insert(Node); 116 if (Next && !this->Visited.count(Next)) { 118 this->Visited.insert(Next); 184 return this->Visited [all...] |
H A D | PostOrderIterator.h | 55 SetType Visited; member in class:llvm::po_iterator_storage 60 return Visited.insert(To); 71 SetType &Visited; member in class:llvm::po_iterator_storage 73 po_iterator_storage(SetType &VSet) : Visited(VSet) {} 74 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {} 80 bool insertEdge(NodeType *From, NodeType *To) { return Visited.insert(To); }
|
H A D | SCCIterator.h | 159 typename DenseMap<NodeType *, unsigned>::iterator Visited = local 161 if (Visited == nodeVisitNumbers.end()) { 167 unsigned childNum = Visited->second;
|
/external/llvm/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 92 std::set<BasicBlock*> Visited; member in class:llvm::IntervalIterator 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!
|
H A D | ScalarEvolutionExpressions.h | 577 SmallPtrSet<const SCEV *, 8> Visited; member in class:llvm::SCEVTraversal 580 if (Visited.insert(S) && Visitor.follow(S))
|
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCCTRLoops.cpp | 573 SmallSet<MachineBasicBlock *, 16> Visited; local 578 Visited.insert(MBB); 584 Visited.insert(MBB); 630 if (!Visited.count(MBB)) {
|
/external/llvm/utils/TableGen/ |
H A D | DFAPacketizerEmitter.cpp | 439 std::map<std::set<unsigned>, const State*> Visited; local 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/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
H A D | R600KernelParameters.cpp | 73 bool IsIndirect(Value *Val, std::set<Value*> &Visited); 139 bool R600KernelParameters::IsIndirect(Value *Val, std::set<Value*> &Visited) { argument 152 if (Visited.count(Val)) { 156 Visited.insert(Val); 173 if (IsIndirect(V2, Visited)) { 191 std::set<Value*> Visited; local 192 P.IsIndirect = IsIndirect(P.Val, Visited);
|
/external/clang/lib/Analysis/ |
H A D | ReachableCode.cpp | 345 llvm::BitVector Visited; member in class:__anon17781::DeadCodeScan 357 : Visited(reachable.size()), 377 if (Reachable[blockID] || Visited[blockID]) 379 Visited[blockID] = true; 390 if (Visited[blockID]) { 396 Visited[blockID] = true;
|
H A D | AnalysisDeclContext.cpp | 460 llvm::SmallPtrSet<const VarDecl*, 4> Visited; member in class:__anon17768::FindBlockDeclRefExprsVals 477 if (Visited.insert(VD))
|
/external/clang/lib/Serialization/ |
H A D | ModuleManager.cpp | 212 assert(State->NextState == nullptr && "Visited state is in list?"); 364 SmallVectorImpl<bool> &Visited) { 373 if (Visited[(*IM)->Index]) 375 Visited[(*IM)->Index] = true; 377 if (visitDepthFirst(**IM, Visitor, UserData, Visited)) 388 SmallVector<bool, 16> Visited(size(), false); 390 if (Visited[Chain[I]->Index]) 392 Visited[Chain[I]->Index] = true; 394 if (::visitDepthFirst(*Chain[I], Visitor, UserData, Visited)) 360 visitDepthFirst(ModuleFile &M, bool (*Visitor)(ModuleFile &M, bool Preorder, void *UserData), void *UserData, SmallVectorImpl<bool> &Visited) argument
|
/external/llvm/lib/IR/ |
H A D | Value.cpp | 384 SmallPtrSet<Value *, 4> Visited; 386 Visited.insert(V); 416 } while (Visited.insert(V)); 445 SmallPtrSet<Value *, 4> Visited; local 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)) 476 isDereferenceablePointer(const Value *V, const DataLayout *DL, SmallPtrSet<const Value *, 32> &Visited) argument 553 SmallPtrSet<const Value *, 32> Visited; local [all...] |
/external/mesa3d/src/gallium/drivers/radeon/ |
H A D | R600KernelParameters.cpp | 73 bool IsIndirect(Value *Val, std::set<Value*> &Visited); 139 bool R600KernelParameters::IsIndirect(Value *Val, std::set<Value*> &Visited) { argument 152 if (Visited.count(Val)) { 156 Visited.insert(Val); 173 if (IsIndirect(V2, Visited)) { 191 std::set<Value*> Visited; local 192 P.IsIndirect = IsIndirect(P.Val, Visited);
|
/external/clang/lib/ASTMatchers/ |
H A D | ASTMatchFinder.cpp | 536 llvm::DenseSet<const void *> Visited; local 554 if (Visited.insert(I->getMemoizationData()).second)
|
/external/llvm/lib/CodeGen/ |
H A D | LiveVariables.cpp | 526 SmallPtrSet<MachineBasicBlock*,16> Visited; local 529 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited); 664 assert(Visited.count(&*i) != 0 && "unreachable basic block found");
|