Searched refs:Worklist (Results 1 - 25 of 45) sorted by relevance

12

/freebsd-10.0-release/contrib/llvm/lib/Transforms/InstCombine/
H A DInstCombineWorklist.h1 //===- InstCombineWorklist.h - Worklist for the InstCombine pass ----------===//
26 SmallVector<Instruction*, 256> Worklist; member in class:llvm::InstCombineWorklist
34 bool isEmpty() const { return Worklist.empty(); }
39 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
41 Worklist.push_back(I);
54 assert(Worklist.empty() && "Worklist must be empty to add initial group");
55 Worklist.reserve(NumEntries+16);
61 Worklist.push_back(I);
71 Worklist[I
[all...]
H A DInstCombine.h60 InstCombineWorklist &Worklist; member in class:llvm::InstCombineIRInserter
62 InstCombineIRInserter(InstCombineWorklist &WL) : Worklist(WL) {}
67 Worklist.Add(I);
81 /// Worklist - All of the instructions that need to be simplified.
82 InstCombineWorklist Worklist; member in class:llvm::InstCombiner
247 Worklist.Add(New);
266 Worklist.AddUsersToWorkList(I); // Add all modified instrs to worklist.
293 Worklist.Add(Op);
295 Worklist.Remove(&I);
H A DInstructionCombining.cpp1028 Worklist.Add(Parent.first);
1046 Worklist.Add(Ancestor);
1380 SmallVector<Instruction*, 4> Worklist; local
1381 Worklist.push_back(AI);
1384 Instruction *PI = Worklist.pop_back_val();
1396 Worklist.push_back(I);
1451 } while (!Worklist.empty());
1607 Worklist.Add(Cond);
1623 Worklist.Add(Cond);
1647 Worklist
2194 SmallVector<BasicBlock*, 256> Worklist; local
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Analysis/
H A DCaptureTracking.cpp84 SmallVector<Use*, Threshold> Worklist; local
98 Worklist.push_back(U);
101 while (!Worklist.empty()) {
102 Use *U = Worklist.pop_back_val();
160 Worklist.push_back(U);
H A DPtrUseVisitor.cpp26 Worklist.push_back(llvm_move(NewU));
H A DBasicAliasAnalysis.cpp579 SmallVector<const Value *, 16> Worklist; local
580 Worklist.push_back(Loc.Ptr);
582 const Value *V = GetUnderlyingObject(Worklist.pop_back_val(), TD);
606 Worklist.push_back(SI->getTrueValue());
607 Worklist.push_back(SI->getFalseValue());
620 Worklist.push_back(PN->getIncomingValue(i));
628 } while (!Worklist.empty() && --MaxLookup);
631 return Worklist.empty();
H A DScalarEvolution.cpp2934 /// onto the given Worklist.
2937 SmallVectorImpl<Instruction *> &Worklist) {
2938 // Push the def-use children onto the Worklist stack.
2941 Worklist.push_back(cast<Instruction>(*UI));
2950 SmallVector<Instruction *, 16> Worklist;
2951 PushDefUseChildren(PN, Worklist);
2955 while (!Worklist.empty()) {
2956 Instruction *I = Worklist.pop_back_val();
2984 PushDefUseChildren(I, Worklist);
4038 /// onto the given Worklist
[all...]
H A DMemoryDependenceAnalysis.cpp1026 SmallVector<BasicBlock*, 32> Worklist; local
1027 Worklist.push_back(StartBB);
1040 while (!Worklist.empty()) {
1041 BasicBlock *BB = Worklist.pop_back_val();
1097 Worklist.append(NewBlocks.begin(), NewBlocks.end());
/freebsd-10.0-release/contrib/llvm/lib/Transforms/ObjCARC/
H A DProvenanceAnalysis.cpp77 SmallVector<const Value *, 8> Worklist; local
78 Worklist.push_back(P);
81 P = Worklist.pop_back_val();
99 Worklist.push_back(Ur);
101 } while (!Worklist.empty());
H A DDependencyAnalysis.cpp213 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; local
214 Worklist.push_back(std::make_pair(StartBB, StartPos));
217 Worklist.pop_back_val();
232 Worklist.push_back(std::make_pair(PredBB, PredBB->end()));
243 } while (!Worklist.empty());
H A DObjCARCOpts.cpp180 SmallVector<const Value *, 4> Worklist; local
181 Worklist.push_back(Ptr);
185 Worklist.push_back(*I);
192 const Value *V = Worklist.pop_back_val();
227 Worklist.push_back(UUser);
249 } while (!Worklist.empty());
1539 SmallVector<std::pair<Instruction *, const Value *>, 4> Worklist; local
1540 Worklist.push_back(std::make_pair(Inst, Arg));
1542 std::pair<Instruction *, const Value *> Pair = Worklist.pop_back_val();
1622 Worklist
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopUnswitch.cpp214 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
216 std::vector<Instruction*> &Worklist, Loop *l);
920 std::vector<Instruction*> &Worklist) {
922 Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), I),
923 Worklist.end());
929 std::vector<Instruction*> &Worklist,
936 Worklist.push_back(Use);
941 Worklist
919 RemoveFromWorklist(Instruction *I, std::vector<Instruction*> &Worklist) argument
928 ReplaceUsesOfWith(Instruction *I, Value *V, std::vector<Instruction*> &Worklist, Loop *L, LPPassManager *LPM) argument
952 RemoveBlockIfDead(BasicBlock *BB, std::vector<Instruction*> &Worklist, Loop *L) argument
1088 std::vector<Instruction*> Worklist; local
1203 SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L) argument
[all...]
H A DSimplifyCFGPass.cpp119 SmallVector<BasicBlock*, 128> Worklist; local
120 Worklist.push_back(BB);
124 BB = Worklist.pop_back_val();
185 Worklist.push_back(*SI);
186 } while (!Worklist.empty());
H A DReassociate.cpp519 // Worklist of non-leaf nodes (their operands are in the expression too) along
523 SmallVector<std::pair<BinaryOperator*, APInt>, 8> Worklist; // (Op, Weight) local
524 Worklist.push_back(std::make_pair(I, APInt(Bitwidth, 1)));
549 while (!Worklist.empty()) {
550 std::pair<BinaryOperator*, APInt> P = Worklist.pop_back_val();
564 Worklist.push_back(std::make_pair(BO, Weight));
602 Worklist.push_back(std::make_pair(BO, It->second));
634 Worklist.push_back(std::make_pair(BO, Weight));
H A DLoopStrengthReduce.cpp2220 SmallVector<const SCEV *, 4> Worklist; local
2228 Worklist.push_back(Expr);
2230 const SCEV *S = Worklist.pop_back_val();
2234 Worklist.push_back(AR->getStart());
2236 Worklist.append(Add->op_begin(), Add->op_end());
2238 } while (!Worklist.empty());
2949 SmallVector<const SCEV *, 8> Worklist(RegUses.begin(), RegUses.end());
2952 while (!Worklist.empty()) {
2953 const SCEV *S = Worklist.pop_back_val();
2956 Worklist
3227 SmallVector<int64_t, 2> Worklist; local
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DDominatorInternals.h57 typename GraphT::ChildIteratorType>, 32> Worklist; local
58 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V)));
59 while (!Worklist.empty()) {
60 typename GraphT::NodeType* BB = Worklist.back().first;
61 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second;
85 Worklist.pop_back();
90 ++Worklist.back().second;
99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
H A DPtrUseVisitor.h124 SmallVector<UseToVisit, 8> Worklist; member in class:llvm::detail::PtrUseVisitorBase
217 while (!Worklist.empty()) {
218 UseToVisit ToVisit = Worklist.pop_back_val();
H A DScalarEvolutionExpressions.h494 SmallVector<const SCEV *, 8> Worklist; member in class:llvm::SCEVTraversal
499 Worklist.push_back(S);
506 while (!Worklist.empty() && !Visitor.isDone()) {
507 const SCEV *S = Worklist.pop_back_val();
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Utils/
H A DPromoteMemoryToRegister.cpp294 std::vector<RenamePassData> &Worklist);
496 SmallVector<DomTreeNode*, 32> Worklist; local
500 Worklist.push_back(Root);
502 while (!Worklist.empty()) {
503 DomTreeNode *Node = Worklist.pop_back_val();
508 Worklist.push_back(*CI);
779 SmallVector<DomTreeNode*, 32> Worklist; local
791 Worklist.clear();
792 Worklist.push_back(Root);
794 while (!Worklist
1026 RenamePass(BasicBlock *BB, BasicBlock *Pred, RenamePassData::ValVector &IncomingVals, std::vector<RenamePassData> &Worklist) argument
[all...]
H A DLocal.cpp995 SmallVector<BasicBlock*, 128> Worklist; local
996 Worklist.push_back(&F.getEntryBlock());
999 BasicBlock *BB = Worklist.pop_back_val();
1002 Worklist.push_back(*SI);
1003 } while (!Worklist.empty());
/freebsd-10.0-release/contrib/llvm/lib/Transforms/IPO/
H A DMergeFunctions.cpp627 std::vector<WeakVH> Worklist; local
628 Deferred.swap(Worklist);
631 DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n');
635 for (std::vector<WeakVH>::iterator I = Worklist.begin(),
636 E = Worklist.end(); I != E; ++I) {
650 for (std::vector<WeakVH>::iterator I = Worklist.begin(),
651 E = Worklist.end(); I != E; ++I) {
864 std::vector<Value *> Worklist; local
865 Worklist.push_back(V);
866 while (!Worklist
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp208 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
209 while (!Worklist.empty()) {
210 change_ty Change = Worklist.back();
211 Worklist.pop_back();
218 Worklist.push_back(*it);
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp199 Worklist.push_back(I);
206 while (!Worklist.empty()) {
212 SDNode *N = Worklist.back();
213 Worklist.pop_back();
363 Worklist.push_back(User);
381 Worklist.push_back(User);
514 Worklist.push_back(N);
H A DScheduleDAGSDNodes.cpp325 SmallVector<SDNode*, 64> Worklist;
327 Worklist.push_back(DAG->getRoot().getNode());
331 while (!Worklist.empty()) {
332 SDNode *NI = Worklist.pop_back_val();
337 Worklist.push_back(NI->getOperand(i).getNode());
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DMachineLICM.cpp355 SmallVector<MachineLoop *, 8> Worklist(MLI->begin(), MLI->end());
356 while (!Worklist.empty()) {
357 CurLoop = Worklist.pop_back_val();
364 Worklist.append(CurLoop->begin(), CurLoop->end());

Completed in 379 milliseconds

12