HomeSort by: relevance | last modified time | path
    Searched refs:Loads (Results 1 - 25 of 34) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86PreAMXConfig.cpp 107 bool checkVolatileModel(SmallSet<Value *, 4> &Loads, IntrinsicInst *Store,
214 bool X86PreAMXConfig::checkVolatileModel(SmallSet<Value *, 4> &Loads,
221 return (Loads.size() == 1) && Loads.contains(ST);
223 // All Loads should be operands of KeyAMX.
224 // All tile operands of KeyAMX should come from Loads.
227 if (!Loads.erase(Op))
233 return Loads.empty() && (ST == cast<Value>(KeyAMX));
272 SmallSet<Value *, 4> Loads;
282 Loads.insert(II)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ExpandMemCmp.cpp 9 // This pass tries to expand memcmp() calls into optimally-sized loads and
44 "memcmp-num-loads-per-block", cl::Hidden, cl::init(1),
45 cl::desc("The number of loads per basic block for inline expansion of "
49 "max-loads-per-memcmp", cl::Hidden,
50 cl::desc("Set maximum number of loads used in expanded memcmp"));
53 "max-loads-per-memcmp-opt-size", cl::Hidden,
54 cl::desc("Set maximum number of loads used in expanded memcmp for -Os/Oz"));
84 // comparing 33 bytes on X86+sse can be done with 2x16-byte loads and
149 // Do not expand if the total number of loads is larger than what the
178 // We try to do as many non-overlapping loads as possible starting from th
    [all...]
ScheduleDAGInstrs.cpp 79 // When Stores and Loads maps (or NonAliasStores and NonAliasLoads)
619 /// 1 for loads, 0 for stores. (see comment in SUList)
758 // on it, stores and loads kept separately. Two SUs are trivially
761 Value2SUsMap Stores, Loads(1 /*TrueMemOrderLatency*/);
764 // or Loads, and have therefore their own 'NonAlias'
773 // These do not depend on one other (or normal loads or stores), but
907 addBarrierChain(Loads);
948 // An unknown store depends on all stores and loads.
951 addChainDependencies(SU, Loads);
963 // Add dependencies to previous stores and loads mapped to V
    [all...]
WinEHPrepare.cpp 83 DenseMap<BasicBlock *, Value *> &Loads, Function &F);
1086 // TODO: Share loads when one use dominates another, or when a catchpad exit
1107 // loads of the slot before every use.
1108 DenseMap<BasicBlock *, Value *> Loads;
1112 // Use is on an EH pad phi. Leave it alone; we'll insert loads and
1116 replaceUseWithLoad(PN, U, SpillSlot, Loads, F);
1177 DenseMap<BasicBlock *, Value *> &Loads,
1192 // PHI node that we cannot have multiple loads. The problem is that
1195 // For this reason, we keep track of and reuse loads we insert.
1237 Value *&Load = Loads[IncomingBlock]
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
ARMParallelDSP.cpp 50 cl::desc("Limit the number of loads analysed"));
69 SmallVector<LoadInst*, 2> VecLd; // Container for loads to widen.
200 SmallVector<LoadInst*, 4> Loads;
205 append_range(Loads, Lds);
229 LoadInst* CreateWideLoad(MemInstList &Loads, IntegerType *LoadTy);
318 LLVM_DEBUG(dbgs() << "Loads are sequential and valid:\n";
348 /// Iterate through the block and record base, offset pairs of loads which can
351 SmallVector<LoadInst*, 8> Loads;
356 // Collect loads and instruction that may write to memory. For now we only
357 // record loads which are simple, sign-extended and have a single user
    [all...]
ARMSelectionDAGInfo.cpp 182 // Do repeated 4-byte loads and stores. To be improved.
202 // Emit a maximum of 4 loads in Thumb1 since we have fewer registers
205 SDValue Loads[6];
247 // Issue loads / stores for the trailing (1 - 3) bytes.
260 Loads[i] = DAG.getLoad(VT, dl, Chain,
264 TFOps[i] = Loads[i].getValue(1);
277 TFOps[i] = DAG.getStore(Chain, dl, Loads[i],
  /src/external/apache2/llvm/dist/llvm/bindings/go/llvm/
support.go 27 // Loads a dynamic library such that it may be used as an LLVM plugin.
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
DemoteRegToStack.cpp 65 // node that we cannot have multiple loads. The problem is that the
68 // keep track of and reuse loads we insert.
69 DenseMap<BasicBlock*, Value*> Loads;
72 Value *&V = Loads[PN->getIncomingBlock(i)];
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
AliasAnalysisEvaluator.cpp 104 SetVector<Value *> Loads;
115 Loads.insert(&Inst);
179 for (Value *Load : Loads) {
LoopAccessAnalysis.cpp 1302 // If loads occur at a distance that is not a multiple of a feasible vector
1669 // Check loads only against next equivalent class, but stores also against
1786 SmallVector<LoadInst *, 16> Loads;
1809 // Scan the BB and collect legal loads and stores. Also detect any
1860 Loads.push_back(Ld);
1897 // Now we have two lists that hold the loads and the stores.
1964 for (LoadInst *LD : Loads) {
  /src/external/apache2/llvm/lib/libLLVMAnalysis/
Makefile 69 Loads.cpp \
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGSDNodes.cpp 39 STATISTIC(LoadsClustered, "Number of loads clustered together");
195 /// ClusterNeighboringLoads - Force nearby loads together by "gluing" them.
196 /// This function finds loads of the same base and different offsets. If the
221 // Look for other loads of the same chain. Find loads that are loading from
248 // optimizations really should have eliminated one of the loads.
268 // Check if the loads are close enough.
269 SmallVector<SDNode*, 4> Loads;
273 Loads.push_back(BaseLoad);
278 break; // Stop right here. Ignore loads that are further away
    [all...]
DAGCombiner.cpp 114 cl::desc("DAG combiner may split indexing from loads"));
683 /// Used by BackwardsPropagateMask to find suitable loads.
684 bool SearchForAndLoads(SDNode *N, SmallVectorImpl<LoadSDNode*> &Loads,
688 /// can be combined into narrow loads.
5209 // Do not change the width of a volatile or atomic loads.
5213 // Do not generate loads of non-round integer types since these can
5237 // Do not generate loads of non-round integer types since these can
5242 // Don't change the width of a volatile or atomic loads.
5317 SmallVectorImpl<LoadSDNode*> &Loads,
5321 // Recursively search for the operands, looking for loads which can b
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
ArgumentPromotion.cpp 47 #include "llvm/Analysis/Loads.h"
127 // We need to keep the original loads for each argument and the elements
157 // Okay, this is being promoted. This means that the only uses are loads
158 // or GEPs which are only used by loads
161 // (where direct loads are tracked as no indices).
178 // Since loads will only have a single operand, and GEPs only a single
179 // non-index operand, this will record direct loads without any indices,
180 // and gep+loads with the GEP indices.
184 // GEPs with a single 0 index can be merged with direct loads
253 // Loop over the operands, inserting GEP and loads in the caller a
    [all...]
GlobalOpt.cpp 416 // Loads are ok.
710 /// Return true if all uses of any loads from GV will trap if the loaded value
809 // Replace all uses of loads with uses of uses of the stored value.
814 // If we were able to delete all uses of the loads
839 LLVM_DEBUG(dbgs() << "OPTIMIZED LOADS FROM STORED ONCE POINTER: " << *GV
844 // If we nuked all of the loads, then none of the stores are needed either,
885 /// loads of GV as uses of the new global.
1101 // users of the loaded value (often calls and loads) that would trap if the
1138 // where v1 and v2 both require constant pool loads, a big loss.
1324 SmallVector<LoadInst *, 4> Loads;
    [all...]
  /src/external/gpl3/gcc/dist/libgcc/config/c6x/
libunwind.S 52 ;; Loads have 4 delay slots. Take advantage of this to restore the
  /src/external/gpl3/gcc.old/dist/libgcc/config/c6x/
libunwind.S 52 ;; Loads have 4 delay slots. Take advantage of this to restore the
  /src/sys/arch/ia64/stand/common/
help.common 68 Loads the module contained in <filename> into memory. If no other
  /src/external/lgpl3/gmp/dist/mpn/alpha/ev6/
add_n.asm 53 C Pair loads and stores where possible
56 C Loads and stores are delayed by fills
58 C L moves because of loads and stores
sub_n.asm 53 C Pair loads and stores where possible
56 C Loads and stores are delayed by fills
58 C L moves because of loads and stores
  /src/crypto/external/apache2/openssl/dist/util/perl/OpenSSL/
Ordinals.pm 107 Loads the data from FILENAME into the instance. Any previously loaded data
  /src/crypto/external/bsd/openssl/dist/util/perl/OpenSSL/
Ordinals.pm 107 Loads the data from FILENAME into the instance. Any previously loaded data
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
CombinerHelper.cpp 358 // sensible if the target has extending loads. If you end up lowering back
438 // We match the loads and follow the uses to the extend instead of matching
457 // Most architectures are going to legalize <s8 loads into at least a 1 byte
466 // loads. Don't bother trying to match them into extending loads.
486 // For atomics, only form anyextending loads.
706 // Don't do this for non-simple loads.
1394 LLVM_DEBUG(dbgs() << "Inlining memcpy: " << MI << " into loads & stores\n");
1400 // of that value loaded. This can result in a sequence of loads and stores
1499 LLVM_DEBUG(dbgs() << "Inlining memmove: " << MI << " into loads & stores\n")
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
SROA.cpp 42 #include "llvm/Analysis/Loads.h"
109 STATISTIC(NumLoadsSpeculated, "Number of loads speculated to allow promotion");
688 // but that is not so! There may be widened loads or PHI-node uses where
768 // We allow splitting of non-volatile loads and stores where the type is an
778 "All simple FCA loads should have been pre-split");
968 // If there are no loads or stores, the access is dead. We mark that as
1193 /// We can do this to a select if its only uses are loads and if the operands
1215 // For now we only allow loads in the same block as the PHI. This is
1216 // a common case that happens when instcombine merges two loads through
1236 // We can only transform this if it is safe to push the loads into th
    [all...]
  /src/crypto/external/apache2/openssl/lib/libcrypto/arch/sparc/
des_enc-sparc.S 106 ! The macro also loads address sbox 1 to 5 to global 1 to 5, address
111 ! Loads key first round from address in parameter 5 to out0, out1.
197 ! also adds -8 to length in2 and loads loop counter to out4
229 ! Loads 1 to 7 bytes little endian
281 ! loads key next encryption/decryption first round from [in4]
535 ! loads key next encryption/decryption first round from [in3]
2488 ! also adds -8 to length in2 and loads loop counter to out4
2859 ! Loads 1 to 7 bytes little endian to global4, out4
3727 ! also adds -8 to length in2 and loads loop counter to out4

Completed in 85 milliseconds

1 2