| /external/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | [all...] |
| GVN.cpp | [all...] |
| SROA.cpp | 833 /// \brief Worklist of alloca instructions to simplify.
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | [all...] |
| /external/llvm/lib/CodeGen/ |
| MachineLICM.cpp | 355 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());
692 SmallVector<MachineDomTreeNode*, 8> WorkList;
697 WorkList.push_back(HeaderN);
699 MachineDomTreeNode *Node = WorkList.pop_back_val();
724 // Add children in reverse order as then the next popped worklist node is
730 WorkList.push_back(Child);
732 } while (!WorkList.empty())
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| FunctionAttrs.cpp | 411 SmallVector<Use*, 32> Worklist;
425 Worklist.push_back(U);
428 while (!Worklist.empty()) {
429 Use *U = Worklist.pop_back_val();
443 Worklist.push_back(U);
[all...] |
| /external/llvm/lib/Analysis/ |
| ValueTracking.cpp | [all...] |
| InstructionSimplify.cpp | [all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineMulDivRem.cpp | 646 Worklist.Add(BBI);
649 Worklist.Add(BBI);
[all...] |
| InstCombineVectorOps.cpp | 250 Worklist.AddValue(EI.getOperand(0));
282 Worklist.AddValue(EE);
[all...] |
| InstCombineCompares.cpp | [all...] |
| InstCombineLoadStoreAlloca.cpp | 648 Worklist.Add(U); // Dropped a use.
|
| InstCombineShifts.cpp | 199 IC.Worklist.Add(I);
|
| InstCombineSimplifyDemanded.cpp | [all...] |
| InstCombineCalls.cpp | [all...] |
| InstCombineCasts.cpp | [all...] |
| InstCombineAndOrXor.cpp | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | 536 SmallVector<SDNode*, 128> Worklist;
538 Worklist.push_back(CurDAG->getRoot().getNode());
544 SDNode *N = Worklist.pop_back_val();
550 // Otherwise, add all chain operands to the worklist.
553 Worklist.push_back(N->getOperand(i).getNode());
572 } while (!Worklist.empty());
[all...] |
| LegalizeTypes.h | 117 /// Worklist - This defines a worklist of nodes to process. In order to be
118 /// pushed onto this worklist, all operands of a node must have already been
120 SmallVector<SDNode*, 128> Worklist;
[all...] |
| SelectionDAG.cpp | 556 // Add all obviously-dead nodes to the DeadNodes worklist.
571 // Process the worklist, deleting the nodes and adding their uses to the
572 // worklist.
[all...] |
| DAGCombiner.cpp | 66 // Worklist of all of the nodes that need to be simplified.
68 // This has the semantics that when adding to the worklist,
74 // a set and a vector to maintain our worklist.
76 // The set contains the items on the worklist, but does not
111 /// removeFromWorkList - remove all instances of N from the worklist.
353 /// nodes from the worklist.
643 // Push the new nodes and any users onto the worklist
656 // Nodes can be reintroduced into the worklist. Make sure we do not
669 // are deleted, make sure to remove them from our worklist.
673 // Push the new node and any (possibly new) users onto the worklist
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | [all...] |
| /external/llvm/include/llvm/CodeGen/ |
| SelectionDAGNodes.h | 534 /// In this helper the Visited and worklist sets are held externally to
537 /// hasPredecessor. Be sure to clear Visited and Worklist if the DAG
542 SmallVectorImpl<const SDNode *> &Worklist) const;
[all...] |
