Searched defs:Visited (Results 1 - 25 of 72) sorted by relevance

123

/external/llvm/lib/Analysis/
H A DCodeMetrics.cpp32 SmallPtrSet<const Value *, 32> Visited; local
44 if (!Visited.insert(V).second)
H A DCaptureTracking.cpp172 SmallSet<const Use *, Threshold> Visited; local
182 Visited.insert(&U);
242 if (Visited.insert(&UU).second)
H A DCFG.cpp33 SmallPtrSet<const BasicBlock*, 8> Visited;
37 Visited.insert(BB);
48 if (Visited.insert(BB).second) {
141 SmallSet<const BasicBlock*, 64> Visited; local
144 if (!Visited.insert(BB).second)
H A DLazyCallGraph.cpp24 SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited,
51 if (Visited.insert(cast<Constant>(Op)).second)
62 SmallPtrSet<Constant *, 16> Visited; local
69 if (Visited.insert(C).second)
75 findCallees(Worklist, Visited, Callees, CalleeIndexMap);
113 SmallPtrSet<Constant *, 16> Visited; local
116 if (Visited.insert(GV.getInitializer()).second)
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 DLint.cpp103 SmallPtrSetImpl<Value *> &Visited) const;
818 SmallPtrSet<Value *, 4> Visited; local
819 return findValueImpl(V, DL, OffsetOk, Visited);
824 SmallPtrSetImpl<Value *> &Visited) const {
826 if (!Visited.insert(V).second)
844 return findValueImpl(U, DL, OffsetOk, Visited);
853 return findValueImpl(W, DL, OffsetOk, Visited);
856 return findValueImpl(CI->getOperand(0), DL, OffsetOk, Visited);
861 return findValueImpl(W, DL, OffsetOk, Visited);
868 return findValueImpl(CE->getOperand(0), DL, OffsetOk, Visited);
[all...]
/external/llvm/lib/Transforms/ObjCARC/
H A DProvenanceAnalysis.cpp78 SmallPtrSet<const Value *, 8> Visited; local
81 Visited.insert(P);
99 if (Visited.insert(Ur).second)
H A DDependencyAnalysis.cpp227 SmallPtrSetImpl<const BasicBlock *> &Visited,
249 if (Visited.insert(PredBB).second)
266 for (const BasicBlock *BB : Visited) {
272 if (Succ != StartBB && !Visited.count(Succ)) {
223 FindDependencies(DependenceKind Flavor, const Value *Arg, BasicBlock *StartBB, Instruction *StartInst, SmallPtrSetImpl<Instruction *> &DependingInsts, SmallPtrSetImpl<const BasicBlock *> &Visited, ProvenanceAnalysis &PA) argument
H A DObjCARCContract.cpp80 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; local
541 if (tryToPeepholeInstruction(F, Inst, I, DependingInstructions, Visited,
146 contractAutorelease( Function &F, Instruction *Autorelease, ARCInstKind Class, SmallPtrSetImpl<Instruction *> &DependingInstructions, SmallPtrSetImpl<const BasicBlock *> &Visited) argument
404 tryToPeepholeInstruction( Function &F, Instruction *Inst, inst_iterator &Iter, SmallPtrSetImpl<Instruction *> &DependingInsts, SmallPtrSetImpl<const BasicBlock *> &Visited, bool &TailOkForStoreStrongs) argument
[all...]
/external/clang/include/clang/Sema/
H A DAnalysisBasedWarnings.h51 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 }; enumerator in enum:clang::sema::AnalysisBasedWarnings::VisitFlag
/external/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h116 SmallPtrSet<typename GraphT::NodeType*, 32> Visited; local
128 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) {
/external/llvm/lib/Transforms/Scalar/
H A DBDCE.cpp272 SmallPtrSet<Instruction*, 128> Visited; local
301 // To save memory, we don't add I to the Visited set here. Instead, we
320 Visited.insert(UserI);
356 } else if (!Visited.count(I)) {
387 } else if (Visited.count(&I)) {
H A DLoopInstSimplify.cpp95 SmallPtrSet<BasicBlock*, 32> Visited; local
103 Visited.clear();
157 if (!Visited.insert(SuccBB).second)
170 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB).second)
H A DAlignmentFromAssumptions.cpp311 SmallPtrSet<Instruction *, 32> Visited; local
399 Visited.insert(J);
402 if (!Visited.count(K) && isValidAssumeForContext(ACall, K, DT))
/external/llvm/include/llvm/ADT/
H A DDepthFirstIterator.h50 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.insert(Next).second) {
182 return this->Visited.count(Node) != 0;
H A DPostOrderIterator.h56 SetType Visited; member in class:llvm::po_iterator_storage
61 return Visited.insert(To).second;
72 SetType &Visited; member in class:llvm::po_iterator_storage
74 po_iterator_storage(SetType &VSet) : Visited(VSet) {}
75 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {}
81 return Visited.insert(To).second;
H A DSCCIterator.h159 typename DenseMap<NodeType *, unsigned>::iterator Visited = local
161 if (Visited == nodeVisitNumbers.end()) {
167 unsigned childNum = Visited->second;
/external/llvm/include/llvm/Analysis/
H A DIntervalIterator.h92 std::set<BasicBlock*> Visited; member in class:llvm::IntervalIterator
108 : IntStack(std::move(x.IntStack)), Visited(std::move(x.Visited)),
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!
H A DScalarEvolutionExpressions.h577 SmallPtrSet<const SCEV *, 8> Visited; member in class:llvm::SCEVTraversal
580 if (Visited.insert(S).second && Visitor.follow(S))
/external/llvm/utils/TableGen/
H A DDFAPacketizerEmitter.cpp439 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/clang/lib/Analysis/
H A DReachableCode.cpp345 llvm::BitVector Visited; member in class:__anon901::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 DAnalysisDeclContext.cpp467 llvm::SmallPtrSet<const VarDecl*, 4> Visited; member in class:__anon888::FindBlockDeclRefExprsVals
484 if (Visited.insert(VD).second)
/external/clang/lib/Serialization/
H A DModuleManager.cpp252 assert(State->NextState == nullptr && "Visited state is in list?");
406 SmallVectorImpl<bool> &Visited) {
415 if (Visited[(*IM)->Index])
417 Visited[(*IM)->Index] = true;
419 if (visitDepthFirst(**IM, Visitor, UserData, Visited))
430 SmallVector<bool, 16> Visited(size(), false);
432 if (Visited[Chain[I]->Index])
434 Visited[Chain[I]->Index] = true;
436 if (::visitDepthFirst(*Chain[I], Visitor, UserData, Visited))
402 visitDepthFirst(ModuleFile &M, bool (*Visitor)(ModuleFile &M, bool Preorder, void *UserData), void *UserData, SmallVectorImpl<bool> &Visited) argument
/external/llvm/lib/IR/
H A DValue.cpp389 SmallPtrSet<Value *, 4> Visited;
391 Visited.insert(V);
421 } while (Visited.insert(V).second);
450 SmallPtrSet<Value *, 4> Visited; local
451 Visited.insert(this);
471 } while (Visited.insert(V).second);
485 SmallPtrSetImpl<const Value *> &Visited) {
505 return isDereferenceablePointer(BC->getOperand(0), DL, Visited);
539 if (!Visited.insert(GEP->getOperand(0)).second)
541 if (!isDereferenceablePointer(GEP->getOperand(0), DL, Visited))
484 isDereferenceablePointer(const Value *V, const DataLayout &DL, SmallPtrSetImpl<const Value *> &Visited) argument
607 SmallPtrSet<const Value *, 32> Visited; local
[all...]
/external/llvm/lib/Target/PowerPC/
H A DPPCCTRLoops.cpp592 SmallSet<MachineBasicBlock *, 16> Visited; local
597 Visited.insert(MBB);
603 Visited.insert(MBB);
649 if (!Visited.count(MBB)) {
/external/mesa3d/src/gallium/drivers/radeon/
H A DR600KernelParameters.cpp73 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);

Completed in 1908 milliseconds

123