/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/ADT/ |
H A D | DepthFirstIterator.h | 49 SetType Visited; member in class:llvm::df_iterator_storage 55 df_iterator_storage(SetType &VSet) : Visited(VSet) {} 56 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {} 57 SetType &Visited; member in class:llvm::df_iterator_storage 81 this->Visited.insert(Node); 93 this->Visited.insert(Node); 115 if (Next && !this->Visited.count(Next)) { 117 this->Visited.insert(Next); 183 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); }
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/Analysis/ |
H A D | CaptureTracking.cpp | 80 SmallSet<Use*, Threshold> Visited; local 92 Visited.insert(U); 147 if (Visited.insert(U))
|
H A D | MemoryDependenceAnalysis.cpp | 656 SmallPtrSet<BasicBlock*, 64> Visited; local 667 if (!Visited.insert(DirtyBB)) 763 DenseMap<BasicBlock*, Value*> Visited; local 765 Result, Visited, true)) 882 /// 'Visited'. 896 DenseMap<BasicBlock*, Value*> &Visited, 934 isLoad, StartBB, Result, Visited, 953 isLoad, StartBB, Result, Visited, 968 if (!Visited.empty()) { 971 DenseMap<BasicBlock*, Value*>::iterator VI = Visited 892 getNonLocalPointerDepFromBB(const PHITransAddr &Pointer, const AliasAnalysis::Location &Loc, bool isLoad, BasicBlock *StartBB, SmallVectorImpl<NonLocalDepResult> &Result, DenseMap<BasicBlock*, Value*> &Visited, bool SkipFirstBlock) argument [all...] |
H A D | Lint.cpp | 100 SmallPtrSet<Value *, 4> &Visited) const; 593 SmallPtrSet<Value *, 4> Visited; local 594 return findValueImpl(V, OffsetOk, Visited); 599 SmallPtrSet<Value *, 4> &Visited) const { 601 if (!Visited.insert(V)) 618 return findValueImpl(U, OffsetOk, Visited); 627 return findValueImpl(W, OffsetOk, Visited); 631 return findValueImpl(CI->getOperand(0), OffsetOk, Visited); 636 return findValueImpl(W, OffsetOk, Visited); 645 return findValueImpl(CE->getOperand(0), OffsetOk, Visited); [all...] |
H A D | BasicAliasAnalysis.cpp | 496 // Visited - Track instructions visited by pointsToConstantMemory. 497 SmallPtrSet<const Value*, 16> Visited; member in struct:__anon9870::BasicAliasAnalysis 547 assert(Visited.empty() && "Visited must be cleared after use!"); 554 if (!Visited.insert(V)) { 555 Visited.clear(); 569 Visited.clear(); 587 Visited.clear(); 596 Visited.clear(); 601 Visited [all...] |
/macosx-10.10.1/llvmCore-3425.0.34/lib/Transforms/Scalar/ |
H A D | LoopInstSimplify.cpp | 82 SmallPtrSet<BasicBlock*, 32> Visited; local 90 Visited.clear(); 136 if (!Visited.insert(SuccBB)) 149 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
|
H A D | ObjCARC.cpp | 1183 SmallPtrSet<const Value *, 8> Visited; local 1186 Visited.insert(P); 1205 if (Visited.insert(Ur)) 2096 SmallPtrSet<const BasicBlock *, 4> &Visited, 2118 if (Visited.insert(PredBB)) 2135 for (SmallPtrSet<const BasicBlock *, 4>::const_iterator I = Visited.begin(), 2136 E = Visited.end(); I != E; ++I) { 2143 if (Succ != StartBB && !Visited.count(Succ)) { 2419 SmallPtrSet<const BasicBlock *, 4> Visited; local 2433 DependingInstructions, Visited, P 2092 FindDependencies(DependenceKind Flavor, const Value *Arg, BasicBlock *StartBB, Instruction *StartInst, SmallPtrSet<Instruction *, 4> &DependingInstructions, SmallPtrSet<const BasicBlock *, 4> &Visited, ProvenanceAnalysis &PA) argument 2988 SmallPtrSet<BasicBlock *, 16> Visited; local 3571 SmallPtrSet<const BasicBlock *, 4> Visited; local 3875 ContractAutorelease(Function &F, Instruction *Autorelease, InstructionClass Class, SmallPtrSet<Instruction *, 4> &DependingInstructions, SmallPtrSet<const BasicBlock *, 4> &Visited) argument 4063 SmallPtrSet<const BasicBlock *, 4> Visited; local [all...] |
H A D | LoopUnswitch.cpp | 499 std::set<BasicBlock*> &Visited) { 500 if (!Visited.insert(BB).second) { 515 if (!isTrivialLoopExitBlockHelper(L, *SI, ExitBB, Visited)) 532 std::set<BasicBlock*> Visited; local 533 Visited.insert(L->getHeader()); // Branches to header make infinite loops. 535 if (isTrivialLoopExitBlockHelper(L, BB, ExitBB, Visited)) 497 isTrivialLoopExitBlockHelper(Loop *L, BasicBlock *BB, BasicBlock *&ExitBB, std::set<BasicBlock*> &Visited) argument
|
H A D | IndVarSimplify.cpp | 1277 static bool hasConcreteDefImpl(Value *V, SmallPtrSet<Value*, 8> &Visited, argument 1297 if (!Visited.insert(*OI)) 1299 if (!hasConcreteDefImpl(*OI, Visited, Depth+1)) 1311 SmallPtrSet<Value*, 8> Visited; local 1312 Visited.insert(V); 1313 return hasConcreteDefImpl(V, Visited, 0);
|
H A D | Reassociate.cpp | 497 SmallPtrSet<Value*, 8> Visited; // For sanity checking the iteration scheme. local 519 assert(Visited.insert(Op) && "Not first visit!"); 529 assert(Visited.insert(Op) && "Not first visit!"); 541 assert(Visited.count(Op) && "In leaf map but not visited!"); 1491 SmallPtrSet<Instruction *, 8> Visited; // Detect self-referential nodes. 1498 Visited.insert(Op))
|
/macosx-10.10.1/llvmCore-3425.0.34/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 | DominatorInternals.h | 116 SmallPtrSet<typename GraphT::NodeType*, 32> Visited; local 128 if (Visited.insert(VAncestor) && VInfo.Parent >= LastLinked) {
|
H A D | ScalarEvolutionExpressions.h | 509 SmallPtrSet<const SCEV *, 8> Visited; member in class:llvm::SCEVTraversal 512 if (Visited.insert(S) && Visitor.follow(S))
|
H A D | MemoryDependenceAnalysis.h | 425 DenseMap<BasicBlock*, Value*> &Visited,
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/VMCore/ |
H A D | Value.cpp | 340 SmallPtrSet<Value *, 4> Visited; 342 Visited.insert(V); 370 } while (Visited.insert(V)); 391 SmallPtrSet<const Value *, 32> &Visited) { 413 if (!Visited.insert(GEP->getOperand(0))) 415 if (!isDereferenceablePointer(GEP->getOperand(0), Visited)) 452 SmallPtrSet<const Value *, 32> Visited; local 453 return ::isDereferenceablePointer(this, Visited); 390 isDereferenceablePointer(const Value *V, SmallPtrSet<const Value *, 32> &Visited) argument
|
H A D | Globals.cpp | 242 SmallPtrSet<const GlobalValue*, 3> Visited; local 249 Visited.insert(GV); 258 if (!Visited.insert(GV))
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 462 Visited.resize(DAGSize); 487 Visited.reset(); 491 Shift(Visited, LowerBound, UpperBound); 514 Visited.set(SU->NodeNum); 522 if (!Visited.test(s) && Node2Index[s] < UpperBound) { 531 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, 540 if (Visited.test(w)) { 542 Visited.reset(w); 581 Visited.reset();
|
H A D | ScheduleDAGInstrs.cpp | 531 SmallPtrSet<const SUnit*, 16> &Visited) { 536 if (!Visited.insert(SUb)) 567 iterateChainSucc (AA, MFI, SUa, I->getSUnit(), ExitSU, Depth, Visited); 581 SmallPtrSet<const SUnit*, 16> Visited; 599 ExitSU, &Depth, Visited); 529 iterateChainSucc(AliasAnalysis *AA, const MachineFrameInfo *MFI, SUnit *SUa, SUnit *SUb, SUnit *ExitSU, unsigned *Depth, SmallPtrSet<const SUnit*, 16> &Visited) argument
|
H A D | LiveVariables.cpp | 527 SmallPtrSet<MachineBasicBlock*,16> Visited; local 530 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited); 688 assert(Visited.count(&*i) != 0 && "unreachable basic block found");
|
/macosx-10.10.1/llvmCore-3425.0.34/utils/TableGen/ |
H A D | DFAPacketizerEmitter.cpp | 446 std::map<std::set<unsigned>, State*> Visited; local 456 // Visited = {} 463 // If S' is not in Visited: 465 // Add S' to Visited 489 if ((VI = Visited.find(NewStateResources)) != Visited.end()) 495 Visited[NewStateResources] = NewState;
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/Transforms/Utils/ |
H A D | PromoteMemoryToRegister.cpp | 234 /// Visited - The set of basic blocks the renamer has already visited. 236 SmallPtrSet<BasicBlock*, 16> Visited; member in struct:__anon10460::PromoteMem2Reg 562 // The renamer uses the Visited set to avoid infinite loops. Clear it now. 563 Visited.clear(); 770 SmallPtrSet<DomTreeNode*, 32> Visited; local 803 if (!Visited.insert(SuccNode)) 817 if (!Visited.count(*CI)) 1066 if (!Visited.insert(BB)) return;
|
H A D | BasicBlockUtils.cpp | 612 SmallPtrSet<const BasicBlock*, 8> Visited; 616 Visited.insert(BB); 627 if (Visited.insert(BB)) {
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGSDNodes.cpp | 217 SmallPtrSet<SDNode*, 16> Visited; 225 if (User == Node || !Visited.insert(User)) 326 SmallPtrSet<SDNode*, 64> Visited; 328 Visited.insert(DAG->getRoot().getNode()); 336 if (Visited.insert(NI->getOperand(i).getNode()))
|
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 664 /// Visited - a set of nodes visited during a DFS traversal. 665 BitVector Visited; member in class:llvm::ScheduleDAGTopologicalSort 674 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|