HomeSort by relevance Sort by last modified time
    Searched defs:Loads (Results 1 - 7 of 7) sorted by null

  /external/llvm/lib/Transforms/Utils/
DemoteRegToStack.cpp 51 // node that we cannot have multiple loads. The problem is that the
54 // keep track of and reuse loads we insert.
55 DenseMap<BasicBlock*, Value*> Loads;
58 Value *&V = Loads[PN->getIncomingBlock(i)];
  /external/llvm/lib/Target/ARM/
ARMSelectionDAGInfo.cpp 36 // Do repeated 4-byte loads and stores. To be improved.
57 SDValue Loads[MAX_LOADS_IN_LDM];
60 // Emit up to MAX_LOADS_IN_LDM loads, then a TokenFactor barrier, then the
61 // same number of stores. The loads and stores will get combined into
66 Loads[i] = DAG.getLoad(VT, dl, Chain,
71 TFOps[i] = Loads[i].getValue(1);
78 TFOps[i] = DAG.getStore(Chain, dl, Loads[i],
93 // Issue loads / stores for the trailing (1 - 3) bytes.
105 Loads[i] = DAG.getLoad(VT, dl, Chain,
110 TFOps[i] = Loads[i].getValue(1)
    [all...]
  /external/llvm/lib/Analysis/
AliasAnalysisEvaluator.cpp 147 SetVector<Value *> Loads;
158 Loads.insert(&*I);
219 for (SetVector<Value *>::iterator I1 = Loads.begin(), E = Loads.end();
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGSDNodes.cpp 38 STATISTIC(LoadsClustered, "Number of loads clustered together");
202 /// ClusterNeighboringLoads - Force nearby loads together by "gluing" them.
203 /// This function finds loads of the same base and different offsets. If the
215 // Look for other loads of the same chain. Find loads that are loading from
231 // optimizations really should have eliminated one of the loads.
248 // Check if the loads are close enough.
249 SmallVector<SDNode*, 4> Loads;
253 Loads.push_back(BaseLoad);
258 break; // Stop right here. Ignore loads that are further away
    [all...]
LegalizeVectorTypes.cpp     [all...]
  /external/llvm/lib/Transforms/IPO/
ArgumentPromotion.cpp 311 // We can only promote this argument if all of the uses are loads, or are GEP
319 // In the former case, invalid loads can happen, but would have happened
320 // anyway, in the latter case, invalid loads won't happen. This prevents us
336 // First, iterate the entry block and mark loads of (geps of) arguments as
348 // This load actually loads (part of) Arg? Check the indices then.
364 // Direct loads are equivalent to a GEP with a single 0 index.
370 // not (GEP+)loads, or any (GEP+)loads that are not safe to promote.
371 SmallVector<LoadInst*, 16> Loads;
378 // Don't hack volatile/atomic loads
    [all...]
  /external/llvm/lib/Target/R600/
R600ISelLowering.cpp 75 // Legalize loads and stores to the private address space.
    [all...]

Completed in 289 milliseconds