| /external/llvm/lib/Transforms/Scalar/ |
| LoopInterchange.cpp | 289 // Discard all loops above it added into Worklist.
459 // Build up a worklist of loop pairs to analyze.
460 SmallVector<LoopVector, 8> Worklist;
463 populateWorklist(*L, Worklist);
465 DEBUG(dbgs() << "Worklist size = " << Worklist.size() << "\n");
467 while (!Worklist.empty()) {
468 LoopVector LoopList = Worklist.pop_back_val();
[all...] |
| SROA.cpp | [all...] |
| GVN.cpp | [all...] |
| Reassociate.cpp | 548 // Worklist of non-leaf nodes (their operands are in the expression too) along
550 // If an operator occurs in the worklist multiple times then we found multiple
552 SmallVector<std::pair<BinaryOperator*, APInt>, 8> Worklist; // (Op, Weight)
553 Worklist.push_back(std::make_pair(I, APInt(Bitwidth, 1)));
578 while (!Worklist.empty()) {
579 std::pair<BinaryOperator*, APInt> P = Worklist.pop_back_val();
593 Worklist.push_back(std::make_pair(BO, Weight));
631 Worklist.push_back(std::make_pair(BO, It->second));
666 Worklist.push_back(std::make_pair(BO, Weight));
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | 425 SmallSetVector<Instruction *, 16> &WorkList,
443 WorkList.insert(OpI);
452 // Add the users to the worklist. CAREFUL: an instruction can use itself,
456 WorkList.insert(cast<Instruction>(U));
484 SmallSetVector<Instruction *, 16> WorkList;
485 // Iterate over the original function, only adding insts to the worklist
487 // the worklist with the entire function's worth of instructions.
494 // worklist from an earlier visit.
495 if (!WorkList.count(I))
496 MadeChange |= simplifyAndDCEInstruction(I, WorkList, DL, TLI)
[all...] |
| PromoteMemoryToRegister.cpp | 298 std::vector<RenamePassData> &Worklist);
649 // RenamePass may add new worklist entries.
781 // where the def is live. Blocks are added to the worklist if we need to
831 // live into it to. Add the preds to the worklist unless they are a
840 // Otherwise it is, add to the worklist.
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineCompares.cpp | 753 SmallVector<Use *, 32> Worklist;
755 if (Worklist.size() >= MaxIter)
757 Worklist.push_back(&U);
761 while (!Worklist.empty()) {
762 assert(Worklist.size() <= MaxIter);
763 Use *U = Worklist.pop_back_val();
798 if (Worklist.size() >= MaxIter)
800 Worklist.push_back(&U);
[all...] |
| InstCombineMulDivRem.cpp | 763 Worklist.Add(&*BBI);
766 Worklist.Add(&*BBI);
[all...] |
| InstCombineVectorOps.cpp | 205 Worklist.AddValue(EI.getOperand(0));
238 Worklist.AddValue(EE);
[all...] |
| InstCombineShifts.cpp | 204 IC.Worklist.Add(I);
[all...] |
| InstCombineSimplifyDemanded.cpp | [all...] |
| InstCombineCalls.cpp | [all...] |
| InstCombineCasts.cpp | [all...] |
| /external/llvm/lib/Transforms/IPO/ |
| FunctionAttrs.cpp | 408 SmallVector<Use *, 32> Worklist;
420 Worklist.push_back(&U);
423 while (!Worklist.empty()) {
424 Use *U = Worklist.pop_back_val();
436 Worklist.push_back(&UU);
450 Worklist.push_back(&UU);
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineLICM.cpp | 298 SmallVector<MachineLoop *, 8> Worklist(MLI->begin(), MLI->end());
299 while (!Worklist.empty()) {
300 CurLoop = Worklist.pop_back_val();
307 Worklist.append(CurLoop->begin(), CurLoop->end());
637 SmallVector<MachineDomTreeNode*, 8> WorkList;
642 WorkList.push_back(HeaderN);
643 while (!WorkList.empty()) {
644 MachineDomTreeNode *Node = WorkList.pop_back_val();
669 // Add children in reverse order as then the next popped worklist node is
675 WorkList.push_back(Child)
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolution.cpp | [all...] |
| ValueTracking.cpp | [all...] |
| InstructionSimplify.cpp | [all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | 670 SmallVector<SDNode*, 128> Worklist;
672 Worklist.push_back(CurDAG->getRoot().getNode());
678 SDNode *N = Worklist.pop_back_val();
684 // Otherwise, add all chain operands to the worklist.
687 Worklist.push_back(Op.getNode());
706 } while (!Worklist.empty());
[all...] |
| LegalizeTypes.h | 135 /// Worklist - This defines a worklist of nodes to process. In order to be
136 /// pushed onto this worklist, all operands of a node must have already been
138 SmallVector<SDNode*, 128> Worklist;
[all...] |
| SelectionDAG.cpp | 602 // Add all obviously-dead nodes to the DeadNodes worklist.
617 // Process the worklist, deleting the nodes and adding their uses to the
618 // worklist.
[all...] |
| DAGCombiner.cpp | 95 /// \brief Worklist of all of the nodes that need to be simplified.
100 /// The worklist will not contain duplicates but may contain null entries
102 SmallVector<SDNode *, 64> Worklist;
104 /// \brief Mapping from an SDNode to its position on the worklist.
106 /// This is used to find and remove nodes from the worklist (by nulling
108 /// stable indices of nodes within the worklist.
114 /// which have not yet been combined to the worklist.
131 /// Add to the worklist making sure its instance is at the back (next to be
139 if (WorklistMap.insert(std::make_pair(N, Worklist.size())).second)
140 Worklist.push_back(N)
[all...] |
| /external/clang/lib/Serialization/ |
| ASTWriter.cpp | [all...] |
| /external/llvm/include/llvm/CodeGen/ |
| SelectionDAGNodes.h | 615 /// In this helper the Visited and worklist sets are held externally to
618 /// hasPredecessor. Be sure to clear Visited and Worklist if the DAG
623 SmallVectorImpl<const SDNode *> &Worklist) const;
[all...] |
