| /external/llvm/lib/Transforms/Utils/ |
| H A D | DemoteRegToStack.cpp | 55 DenseMap<BasicBlock*, Value*> Loads; local
58 Value *&V = Loads[PN->getIncomingBlock(i)];
|
| /external/llvm/lib/Target/ARM/ |
| H A D | ARMSelectionDAGInfo.cpp | 58 SDValue Loads[6]; local
67 Loads[i] = DAG.getLoad(VT, dl, Chain,
72 TFOps[i] = Loads[i].getValue(1);
80 TFOps[i] = DAG.getStore(Chain, dl, Loads[i],
108 Loads[i] = DAG.getLoad(VT, dl, Chain,
113 TFOps[i] = Loads[i].getValue(1);
132 TFOps[i] = DAG.getStore(Chain, dl, Loads[i],
|
| /external/llvm/lib/Analysis/ |
| H A D | AliasAnalysisEvaluator.cpp | 146 SetVector<Value *> Loads; local
157 Loads.insert(&*I);
218 for (SetVector<Value *>::iterator I1 = Loads.begin(), E = Loads.end();
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGSDNodes.cpp | 255 SmallVector<SDNode*, 4> Loads; local
259 Loads.push_back(BaseLoad);
265 Loads.push_back(Load);
274 SDNode *Lead = Loads[0];
278 for (unsigned I = 1, E = Loads.size(); I != E; ++I) {
280 SDNode *Load = Loads[I];
|
| H A D | LegalizeVectorTypes.cpp | 2799 SmallVector<SDValue, 16> Loads; local
2800 Loads.push_back(L);
2803 Loads.push_back(DAG.getUNDEF(L->getValueType(0)));
2806 L = DAG.getNode(ISD::CONCAT_VECTORS, dl, LdOp->getValueType(0), Loads);
|
| H A D | DAGCombiner.cpp | 8084 unsigned Loads; member in struct:__anon25800::LoadedSlice::Cost
8091 : ForCodeSize(ForCodeSize), Loads(0), Truncates(0),
8096 : ForCodeSize(ForCodeSize), Loads(1), Truncates(0),
8124 Loads += RHS.Loads;
8133 return Loads == RHS.Loads && Truncates == RHS.Truncates &&
8143 unsigned ExpensiveOpsLHS = Loads + CrossRegisterBanksCopies;
8144 unsigned ExpensiveOpsRHS = RHS.Loads + RHS.CrossRegisterBanksCopies;
8457 assert(GlobalLSCost.Loads >
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| H A D | LoadCombine.cpp | 1 //===- LoadCombine.cpp - Combine Adjacent Loads ---------------------------===//
115 for (auto &Loads : LoadMap) {
116 if (Loads.second.size() < 2)
118 std::sort(Loads.second.begin(), Loads.second.end(),
122 if (aggregateLoads(Loads.second))
132 bool LoadCombine::aggregateLoads(SmallVectorImpl<LoadPOPPair> &Loads) { argument
133 assert(Loads.size() >= 2 && "Insufficient loads!");
139 for (auto &L : Loads) {
171 bool LoadCombine::combineLoads(SmallVectorImpl<LoadPOPPair> &Loads) { argument
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| H A D | ArgumentPromotion.cpp | 384 SmallVector<LoadInst*, 16> Loads; local
392 Loads.push_back(LI);
420 Loads.push_back(LI);
450 if (Loads.empty()) return true; // No users, this is a dead argument.
463 for (unsigned i = 0, e = Loads.size(); i != e; ++i) {
466 LoadInst *Load = Loads[i];
|
| /external/llvm/lib/Target/R600/ |
| H A D | R600ISelLowering.cpp | 1611 SDValue Loads[4]; local
1621 Loads[i] = DAG.getNode(AMDGPUISD::REGISTER_LOAD, DL, ElemVT,
1627 Loads[i] = DAG.getUNDEF(ElemVT);
1630 LoweredLoad = DAG.getNode(ISD::BUILD_VECTOR, DL, TargetVT, Loads);
|
| H A D | AMDGPUISelLowering.cpp | 1012 SmallVector<SDValue, 8> Loads; local
1027 Loads.push_back(NewLoad.getValue(0));
1032 DAG.getNode(ISD::BUILD_VECTOR, SL, LoadVT, Loads),
|
| /external/llvm/lib/CodeGen/ |
| H A D | MachineScheduler.cpp | 1243 void clusterNeighboringLoads(ArrayRef<SUnit*> Loads, ScheduleDAGMI *DAG);
1247 void LoadClusterMutation::clusterNeighboringLoads(ArrayRef<SUnit*> Loads, argument
1250 for (unsigned Idx = 0, End = Loads.size(); Idx != End; ++Idx) {
1251 SUnit *SU = Loads[Idx];
|