HomeSort by relevance Sort by last modified time
    Searched defs:Loads (Results 1 - 9 of 9) 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.
55 // Emit a maximum of 4 loads in Thumb1 since we have fewer registers
58 SDValue Loads[6];
61 // Emit up to MAX_LOADS_IN_LDM loads, then a TokenFactor barrier, then the
62 // same number of stores. The loads and stores will get combined into
67 Loads[i] = DAG.getLoad(VT, dl, Chain,
72 TFOps[i] = Loads[i].getValue(1);
80 TFOps[i] = DAG.getStore(Chain, dl, Loads[i],
96 // Issue loads / stores for the trailing (1 - 3) bytes.
108 Loads[i] = DAG.getLoad(VT, dl, Chain
    [all...]
  /external/llvm/lib/Analysis/
AliasAnalysisEvaluator.cpp 146 SetVector<Value *> Loads;
157 Loads.insert(&*I);
218 for (SetVector<Value *>::iterator I1 = Loads.begin(), E = Loads.end();
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGSDNodes.cpp 39 STATISTIC(LoadsClustered, "Number of loads clustered together");
203 /// ClusterNeighboringLoads - Force nearby loads together by "gluing" them.
204 /// This function finds loads of the same base and different offsets. If the
216 // Look for other loads of the same chain. Find loads that are loading from
235 // optimizations really should have eliminated one of the loads.
254 // Check if the loads are close enough.
255 SmallVector<SDNode*, 4> Loads;
259 Loads.push_back(BaseLoad);
264 break; // Stop right here. Ignore loads that are further away
    [all...]
LegalizeVectorTypes.cpp     [all...]
DAGCombiner.cpp     [all...]
  /external/llvm/lib/Transforms/IPO/
ArgumentPromotion.cpp 321 // We can only promote this argument if all of the uses are loads, or are GEP
329 // In the former case, invalid loads can happen, but would have happened
330 // anyway, in the latter case, invalid loads won't happen. This prevents us
349 // First, iterate the entry block and mark loads of (geps of) arguments as
361 // This load actually loads (part of) Arg? Check the indices then.
377 // Direct loads are equivalent to a GEP with a single 0 index.
383 // not (GEP+)loads, or any (GEP+)loads that are not safe to promote.
384 SmallVector<LoadInst*, 16> Loads;
390 // Don't hack volatile/atomic loads
    [all...]
  /external/llvm/lib/Target/R600/
R600ISelLowering.cpp 115 // Legalize loads and stores to the private address space.
    [all...]
AMDGPUISelLowering.cpp 473 // places trying to reduce the sizes of loads. Shrinking loads to < 32-bits is
585 // properly handle illegal types or vectors. The private vector loads are not
    [all...]

Completed in 585 milliseconds