/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | CodeMetrics.cpp | 29 SmallPtrSetImpl<const Value *> &Visited, 36 if (Visited.insert(Operand).second) 41 static void completeEphemeralValues(SmallPtrSetImpl<const Value *> &Visited, argument 54 assert(Visited.count(V) && 65 appendSpeculatableOperands(V, Visited, Worklist); 73 SmallPtrSet<const Value *, 32> Visited; local 88 appendSpeculatableOperands(I, Visited, Worklist); 91 completeEphemeralValues(Visited, Worklist, EphValues); 97 SmallPtrSet<const Value *, 32> Visited; local 108 appendSpeculatableOperands(I, Visited, Worklis 28 appendSpeculatableOperands(const Value *V, SmallPtrSetImpl<const Value *> &Visited, SmallVectorImpl<const Value *> &Worklist) argument [all...] |
H A D | Loads.cpp | 55 SmallPtrSetImpl<const Value *> &Visited) { 57 if (!Visited.insert(V).second) 66 Size, DL, CtxI, DT, Visited); 102 CtxI, DT, Visited); 108 RelocateInst->getDerivedPtr(), Alignment, Size, DL, CtxI, DT, Visited); 112 Size, DL, CtxI, DT, Visited); 117 DT, Visited); 133 SmallPtrSet<const Value *, 32> Visited; local 135 Visited); 52 isDereferenceableAndAlignedPointer( const Value *V, Align Alignment, const APInt &Size, const DataLayout &DL, const Instruction *CtxI, const DominatorTree *DT, SmallPtrSetImpl<const Value *> &Visited) argument
|
H A D | CFG.cpp | 33 SmallPtrSet<const BasicBlock*, 8> Visited; 37 Visited.insert(BB); 48 if (Visited.insert(BB).second) { 160 SmallPtrSet<const BasicBlock*, 32> Visited; local 163 if (!Visited.insert(BB).second)
|
H A D | MemoryDependenceAnalysis.cpp | 829 SmallPtrSet<BasicBlock *, 32> Visited; local 840 if (!Visited.insert(DirtyBB).second) 964 DenseMap<BasicBlock *, Value *> Visited; local 966 Result, Visited, true)) 1084 /// blocks are visited in 'Visited'. 1097 DenseMap<BasicBlock *, Value *> &Visited, bool SkipFirstBlock) { 1146 StartBB, Result, Visited, SkipFirstBlock); 1165 Visited, SkipFirstBlock); 1179 if (!Visited.empty()) { 1182 Visited 1093 getNonLocalPointerDepFromBB( Instruction *QueryInst, const PHITransAddr &Pointer, const MemoryLocation &Loc, bool isLoad, BasicBlock *StartBB, SmallVectorImpl<NonLocalDepResult> &Result, DenseMap<BasicBlock *, Value *> &Visited, bool SkipFirstBlock) argument [all...] |
H A D | Lint.cpp | 126 SmallPtrSetImpl<Value *> &Visited) const; 658 SmallPtrSet<Value *, 4> Visited; local 659 return findValueImpl(V, OffsetOk, Visited); 664 SmallPtrSetImpl<Value *> &Visited) const { 666 if (!Visited.insert(V).second) 684 return findValueImpl(U, OffsetOk, Visited); 693 return findValueImpl(W, OffsetOk, Visited); 696 return findValueImpl(CI->getOperand(0), OffsetOk, Visited); 701 return findValueImpl(W, OffsetOk, Visited); 708 return findValueImpl(CE->getOperand(0), OffsetOk, Visited); [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | CFG.h | 157 SmallPtrSet<NodeT, 32> Visited; local 159 Visited.insert(Node); 162 if (!Visited.count(Succ))
|
H A D | MustExecute.h | 284 : Visited(Other.Visited), Explorer(Other.Explorer), 288 : Visited(std::move(Other.Visited)), Explorer(Other.Explorer), 293 std::swap(Visited, Other.Visited); 331 bool count(const Instruction *I) const { return Visited.count(I); } 350 VisitedSetTy Visited; member in struct:llvm::MustBeExecutedIterator
|
H A D | IntervalIterator.h | 91 std::set<BasicBlock *> Visited; member in class:llvm::IntervalIterator 109 : IntStack(std::move(x.IntStack)), Visited(std::move(x.Visited)), 178 if (!Visited.insert(Header).second) 206 if (Visited.count(NodeHeader)) { // Node already been visited? 226 Visited.insert(NodeHeader); // The node has now been visited!
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | DepthFirstIterator.h | 52 SetType Visited; member in class:llvm::df_iterator_storage 58 df_iterator_storage(SetType &VSet) : Visited(VSet) {} 59 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {} 61 SetType &Visited; member in class:llvm::df_iterator_storage 102 this->Visited.insert(Node); 110 if (this->Visited.insert(Node).second) 133 if (this->Visited.insert(Next).second) { 139 this->Visited.completed(Node); 201 return this->Visited [all...] |
H A D | PostOrderIterator.h | 58 SetType Visited; member in class:llvm::po_iterator_storage 64 return Visited.insert(To).second; 74 SetType &Visited; member in class:llvm::po_iterator_storage 77 po_iterator_storage(SetType &VSet) : Visited(VSet) {} 78 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {} 84 return Visited.insert(To).second;
|
H A D | BreadthFirstIterator.h | 35 SetType Visited; member in class:llvm::bf_iterator_storage 67 this->Visited.insert(Node); 89 if (this->Visited.insert(Next).second)
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | BDCE.cpp | 45 SmallPtrSet<Instruction *, 16> Visited; local 53 Visited.insert(J); 82 if (K && Visited.insert(K).second && K->getType()->isIntOrIntVectorTy() &&
|
H A D | StructurizeCFG.cpp | 198 BBSet Visited; member in class:__anon2763::StructurizeCFG 390 if (Visited.count(Exit)) 399 if (Visited.count(Succ)) 471 if (Visited.count(P)) { 476 if (Visited.count(Other) && !Loops.count(Other) && 500 if (Visited.count(Entry)) 518 Visited.clear(); 530 Visited.insert(RN->getEntry()); 808 Visited.insert(Node->getEntry()); 830 while (!Order.empty() && !Visited [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | ImportedFunctionsInliningStatistics.h | 60 bool Visited = false; member in struct:llvm::ImportedFunctionsInliningStatistics::InlineGraphNode
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Sema/ |
H A D | AnalysisBasedWarnings.h | 50 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 }; enumerator in enum:clang::sema::AnalysisBasedWarnings::VisitFlag
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCCTRLoops.cpp | 131 SmallSet<MachineBasicBlock *, 16> Visited; local 136 Visited.insert(MBB); 142 Visited.insert(MBB); 188 if (!Visited.count(MBB)) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | ImportedFunctionsInliningStatistics.cpp | 170 if (!Node.Visited) 176 assert(!GraphNode.Visited); 177 GraphNode.Visited = true; 180 if (!InlinedFunctionNode->Visited)
|
H A D | BypassSlowDivision.cpp | 83 bool isHashLikeValue(Value *V, VisitedSetTy &Visited); 84 ValueRange getValueRange(Value *Op, VisitedSetTy &Visited); 190 bool FastDivInsertionTask::isHashLikeValue(Value *V, VisitedSetTy &Visited) { argument 212 if (Visited.size() >= 16) 216 if (Visited.find(I) != Visited.end()) 218 Visited.insert(I); 222 return getValueRange(V, Visited) == VALRNG_LIKELY_LONG || 232 VisitedSetTy &Visited) { 254 if (isHashLikeValue(V, Visited)) [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 509 Visited.resize(DAGSize); 556 Visited.reset(); 560 Shift(Visited, LowerBound, UpperBound); 579 Visited.set(SU->NodeNum); 591 if (!Visited.test(s) && Node2Index[s] < UpperBound) { 614 Visited.reset(); 633 if (!Visited.test(s) && Node2Index[s] < UpperBound) { 634 Visited.set(s); 666 if (!VisitedBack.test(s) && Visited.test(s)) { 679 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, in [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | ProvenanceAnalysis.cpp | 85 SmallPtrSet<const Value *, 8> Visited; local 88 Visited.insert(P); 106 if (Visited.insert(Ur).second)
|
H A D | DependencyAnalysis.cpp | 223 SmallPtrSetImpl<const BasicBlock *> &Visited, 245 if (Visited.insert(PredBB).second) 262 for (const BasicBlock *BB : Visited) { 266 if (Succ != StartBB && !Visited.count(Succ)) { 219 FindDependencies(DependenceKind Flavor, const Value *Arg, BasicBlock *StartBB, Instruction *StartInst, SmallPtrSetImpl<Instruction *> &DependingInsts, SmallPtrSetImpl<const BasicBlock *> &Visited, ProvenanceAnalysis &PA) argument
|
H A D | DependencyAnalysis.h | 57 SmallPtrSetImpl<const BasicBlock *> &Visited,
|
H A D | ObjCARCContract.cpp | 86 SmallPtrSetImpl<const BasicBlock *> &Visited, 96 SmallPtrSetImpl<const BasicBlock *> &Visited); 159 SmallPtrSetImpl<const BasicBlock *> &Visited) { 168 DependingInstructions, Visited, PA); 172 DependingInstructions, Visited, PA); 174 Visited.clear(); 450 SmallPtrSetImpl<const BasicBlock *> &Visited, bool &TailOkForStoreStrongs, 461 return contractAutorelease(F, Inst, Class, DependingInsts, Visited); 581 SmallPtrSet<const BasicBlock *, 4> Visited; local 607 if (tryToPeepholeInstruction(F, Inst, I, DependingInstructions, Visited, 156 contractAutorelease( Function &F, Instruction *Autorelease, ARCInstKind Class, SmallPtrSetImpl<Instruction *> &DependingInstructions, SmallPtrSetImpl<const BasicBlock *> &Visited) argument 447 tryToPeepholeInstruction( Function &F, Instruction *Inst, inst_iterator &Iter, SmallPtrSetImpl<Instruction *> &DependingInsts, SmallPtrSetImpl<const BasicBlock *> &Visited, bool &TailOkForStoreStrongs, const DenseMap<BasicBlock *, ColorVector> &BlockColors) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUAlwaysInlinePass.cpp | 61 SmallPtrSet<const Value *, 8> Visited; local 68 if (!Visited.insert(U).second)
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/ |
H A D | ThreadSafetyTIL.cpp | 167 if (Visited) return ID; 168 Visited = true; 191 // Visited is assumed to have been set by the topologicalSort. This pass 192 // assumes !Visited means that we've visited this node before. 193 if (!Visited) return ID; 194 Visited = false;
|