| /external/llvm/lib/Transforms/ObjCARC/ |
| ProvenanceAnalysis.cpp | 76 SmallPtrSet<const Value *, 8> Visited;
79 Visited.insert(P);
98 if (Visited.insert(Ur))
|
| ObjCARCContract.cpp | 77 &Visited);
155 &Visited) {
164 DependingInstructions, Visited, PA);
168 DependingInstructions, Visited, PA);
170 Visited.clear();
342 SmallPtrSet<const BasicBlock *, 4> Visited;
357 if (ContractAutorelease(F, Inst, Class, DependingInstructions, Visited))
|
| /external/llvm/lib/Analysis/ |
| CaptureTracking.cpp | 85 SmallSet<Use*, Threshold> Visited;
97 Visited.insert(U);
152 if (Visited.insert(U))
|
| CFG.cpp | 34 SmallPtrSet<const BasicBlock*, 8> Visited;
38 Visited.insert(BB);
49 if (Visited.insert(BB)) {
192 SmallSet<const BasicBlock*, 64> Visited;
198 if (!Visited.insert(BB))
|
| Lint.cpp | 100 SmallPtrSet<Value *, 4> &Visited) const;
591 SmallPtrSet<Value *, 4> Visited;
592 return findValueImpl(V, OffsetOk, Visited);
597 SmallPtrSet<Value *, 4> &Visited) const {
599 if (!Visited.insert(V))
616 return findValueImpl(U, OffsetOk, Visited);
625 return findValueImpl(W, OffsetOk, Visited);
629 return findValueImpl(CI->getOperand(0), OffsetOk, Visited);
634 return findValueImpl(W, OffsetOk, Visited);
643 return findValueImpl(CE->getOperand(0), OffsetOk, Visited);
[all...] |
| BasicAliasAnalysis.cpp | 536 // Visited - Track instructions visited by pointsToConstantMemory.
537 SmallPtrSet<const Value*, 16> Visited;
587 assert(Visited.empty() && "Visited must be cleared after use!");
594 if (!Visited.insert(V)) {
595 Visited.clear();
609 Visited.clear();
627 Visited.clear();
636 Visited.clear()
[all...] |
| /external/clang/include/clang/Sema/ |
| AnalysisBasedWarnings.h | 50 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 };
|
| /external/llvm/include/llvm/Analysis/ |
| DominatorInternals.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) {
|
| 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 | 495 SmallPtrSet<const SCEV *, 8> Visited;
498 if (Visited.insert(S) && Visitor.follow(S))
|
| /external/llvm/lib/IR/ |
| Globals.cpp | 248 SmallPtrSet<const GlobalValue*, 3> Visited;
255 Visited.insert(GV);
264 if (!Visited.insert(GV))
|
| Value.cpp | 347 SmallPtrSet<Value *, 4> Visited;
349 Visited.insert(V);
378 } while (Visited.insert(V));
403 SmallPtrSet<const Value *, 32> &Visited) {
425 if (!Visited.insert(GEP->getOperand(0)))
427 if (!isDereferenceablePointer(GEP->getOperand(0), Visited))
464 SmallPtrSet<const Value *, 32> Visited;
465 return ::isDereferenceablePointer(this, Visited);
|
| /external/clang/lib/Analysis/ |
| ReachableCode.cpp | 30 llvm::BitVector Visited;
41 : Visited(reachable.size()),
59 if (Reachable[blockID] || Visited[blockID])
61 Visited[blockID] = true;
72 if (Visited[blockID]) {
78 Visited[blockID] = true;
|
| AnalysisDeclContext.cpp | 450 llvm::SmallPtrSet<const VarDecl*, 4> Visited;
472 if (Visited.insert(VD))
|
| /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
45 // store the visited set.
49 SetType Visited;
55 df_iterator_storage(SetType &VSet) : Visited(VSet) {}
56 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
57 SetType &Visited;
81 this->Visited.insert(Node);
93 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...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 83 SmallPtrSet<BasicBlock*, 32> Visited;
91 Visited.clear();
137 if (!Visited.insert(SuccBB))
150 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
|
| /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/Target/PowerPC/ |
| PPCCTRLoops.cpp | 547 SmallSet<MachineBasicBlock *, 16> Visited;
552 Visited.insert(MBB);
558 Visited.insert(MBB);
604 if (!Visited.count(MBB)) {
|
| /external/llvm/utils/TableGen/ |
| DFAPacketizerEmitter.cpp | 455 std::map<std::set<unsigned>, State*> Visited;
465 // Visited = {}
472 // If S' is not in Visited:
474 // Add S' to Visited
498 if ((VI = Visited.find(NewStateResources)) != Visited.end())
504 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/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 | 412 SmallSet<Use*, 32> Visited;
424 Visited.insert(U);
442 if (Visited.insert(U))
[all...] |
| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 537 llvm::DenseSet<const void *> Visited;
555 if (Visited.insert(I->getMemoizationData()).second)
|
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| AnalysisConsumer.cpp | 291 getInliningModeForFunction(const Decl *D, SetOfConstDecls Visited);
294 /// use it to define the order in which the functions should be visited.
393 SetOfConstDecls Visited,
408 // Otherwise, if we visited the function before, do not reanalyze it.
409 return Visited.count(D);
414 SetOfConstDecls Visited) {
418 if (Visited.count(D)) {
441 // the previously processed functions. Use external Visited set to identify
445 SetOfConstDecls Visited;
461 if (shouldSkipFunction(D, Visited, VisitedAsTopLevel)
[all...] |
