Home
last modified time | relevance | path

Searched full:stores (Results 1 – 25 of 1786) sorted by relevance

12345678910>>...72

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DLoadStoreOpt.h10 /// Specifically, it focuses on merging stores and loads to consecutive
68 /// aliasIsKnownForLoadStore just looks at the addresses of load/stores and is
98 // The base pointer used as the base for all stores in this candidate.
101 // order stores are writing to incremeneting consecutive addresses. So when
105 SmallVector<GStore *> Stores; in reset()
108 // unsigned value is an index into the Stores vector. The indexed store is in reset()
111 // alias checks that have been already done, only those with stores added
119 Stores.clear();
132 /// stores in the candidate \p C.
134 /// Merges the stores i
92 SmallVector<GStore *> Stores; global() variable
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonStoreWidening.cpp8 // Replace sequences of "narrow" stores to adjacent memory locations with
9 // a fewer "wide" stores that have the same effect.
17 // The purpose of this pass is to reduce the number of outstanding stores,
18 // or as one could say, "reduce store queue pressure". Also, wide stores
19 // mean fewer stores, and since there are only two memory instructions allowed
51 #define DEBUG_TYPE "hexagon-widen-stores"
96 bool instrAliased(InstrGroup &Stores, const MachineMemOperand &MMO);
97 bool instrAliased(InstrGroup &Stores, const MachineInstr *MI);
115 INITIALIZE_PASS_BEGIN(HexagonStoreWidening, "hexagon-widen-stores",
118 INITIALIZE_PASS_END(HexagonStoreWidening, "hexagon-widen-stores", in INITIALIZE_PASS_DEPENDENCY()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLoadStoreOpt.cpp48 STATISTIC(NumStoresMerged, "Number of stores merged");
306 // Try to merge all the stores in the vector, splitting into separate segments in mergeStores()
308 assert(StoresToMerge.size() > 1 && "Expected multiple stores to merge"); in mergeStores()
326 // Compute the biggest store we can generate to handle the number of stores. in mergeStores()
360 bool LoadStoreOpt::doSingleStoreMerge(SmallVectorImpl<GStore *> &Stores) { in doSingleStoreMerge() argument
361 assert(Stores.size() > 1); in doSingleStoreMerge()
362 // We know that all the stores are consecutive and there are no aliasing in doSingleStoreMerge()
367 GStore *FirstStore = Stores[0]; in doSingleStoreMerge()
368 const unsigned NumStores = Stores.size(); in doSingleStoreMerge()
374 DebugLoc MergedLoc = Stores.front()->getDebugLoc(); in doSingleStoreMerge()
[all …]
/freebsd/share/man/man9/
H A Datomic.992 ordinary loads and stores of integers in cache-coherent memory are
95 However, such loads and stores may be elided from the program by
188 Conversely, acquire semantics do not require that prior loads or stores have
198 completed before any subsequent loads and stores are performed, use
201 When an atomic operation has release semantics, all prior loads or stores
213 stores are completed before the addition is performed, use
220 of all prior stores by the releasing thread must become visible to
222 Moreover, the effects of all stores (by other threads) that were visible to
225 Other threads might observe these stores in a different order.
233 will prevent any loads or stores from moving outside of the critical
[all …]
H A Dstore.971 Stores a byte of data to the user-space address
74 Stores a word of data to the user-space address
77 Stores 16 bits of data to the user-space address
80 Stores 32 bits of data to the user-space address
83 Stores 64 bits of data to the user-space address
/freebsd/share/man/man3/
H A Dsnl.3177 Otherwise, the getter fetches the attribute value and stores it in the target,
187 stores a uint8_t type attribute into the uint8_t target field.
189 stores a uint16_t type attribute into the uint16_t target field.
191 stores a uint32_t type attribute into the uint32_t target field.
193 stores a uint64_t type attribute into the uint64_t target field.
197 stores a pointer to the sockaddr structure with the IPv4/IPv6 address contained
202 stores a pointer to the NULL-terminated string.
206 stores a pointer to the specified attribute.
208 stores a pointer to the non-NULL-terminated string.
224 fetches an uint8_t value and stores it in the target.
[all …]
H A Dbitstring.3209 stores in the location referenced by
222 stores in the location referenced by
234 stores in the location referenced by
251 stores in the location referenced by
268 stores in the location referenced by
286 function stores in the location referenced by
303 function stores in the location referenced by
320 function stores in the location referenced by
341 function stores in the location referenced by
362 function stores in the location referenced by
[all …]
/freebsd/contrib/elftoolchain/libdwarf/
H A Ddwarf_lineno.396 and stores it in the location pointed to by argument
105 stores the program address corresponding to the source line specified
138 stores the line number of the source line associated with the line
146 stores the column number within a line associated with descriptor
155 stores a pointer to a NUL-terminated string containing the source file
169 stores the index of the source file associated with the line descriptor
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/
H A DAArch64PostLegalizerCombiner.cpp305 /// Match a 128b store of zero and split it into two 64 bit stores, for
317 return false; // Don't split truncating stores. in matchSplitStoreZero128()
512 bool tryOptimizeConsecStores(SmallVectorImpl<StoreInfo> &Stores,
580 SmallVectorImpl<StoreInfo> &Stores, CSEMIRBuilder &MIB) { in tryOptimizeConsecStores() argument
581 if (Stores.size() <= 2) in tryOptimizeConsecStores()
585 int64_t BaseOffset = Stores[0].Offset; in tryOptimizeConsecStores()
586 unsigned NumPairsExpected = Stores.size() / 2; in tryOptimizeConsecStores()
587 unsigned TotalInstsExpected = NumPairsExpected + (Stores.size() % 2); in tryOptimizeConsecStores()
593 int SavingsExpected = Stores.size() - TotalInstsExpected; in tryOptimizeConsecStores()
599 // We have a series of consecutive stores. Factor out the common base in tryOptimizeConsecStores()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSink.cpp31 SmallPtrSetImpl<Instruction *> &Stores) { in isSafeToMove() argument
34 Stores.insert(Inst); in isSafeToMove()
40 for (Instruction *S : Stores) in isSafeToMove()
55 for (Instruction *S : Stores) in isSafeToMove()
79 // We cannot sink a load across a critical edge - there may be stores in in IsAcceptableTarget()
103 SmallPtrSetImpl<Instruction *> &Stores, in SinkInstruction()
113 if (!isSafeToMove(Inst, AA, Stores)) in SinkInstruction()
188 SmallPtrSet<Instruction *, 8> Stores; in ProcessBlock() local
201 if (SinkInstruction(Inst, Stores, DT, LI, AA)) { in ProcessBlock()
104 SinkInstruction(Instruction * Inst,SmallPtrSetImpl<Instruction * > & Stores,DominatorTree & DT,LoopInfo & LI,AAResults & AA) SinkInstruction() argument
H A DMergedLoadStoreMotion.cpp1 //===- MergedLoadStoreMotion.cpp - merge and hoist/sink load/stores -------===//
10 //! This pass performs merges of loads and stores on both sides of a
11 // diamond (hammock). It hoists the loads and sinks the stores.
15 // it sinks and merges two stores to the tail block (footer). The algorithm
113 // Routines for sinking stores
228 /// Check if 2 stores can be sunk, optionally together with corresponding GEPs.
242 /// Merge two stores to same address and sink into \p BB
262 // Insert bitcast for conflicting typed stores (or just use original value if in sinkStoresAndGEPs()
293 /// True when two stores are equivalent and can sink into the footer
328 // Don't sink non-simple (atomic, volatile) stores. in mergeStores()
[all …]
H A DLoopLoadElimination.cpp12 // distance of one between stores and loads. These form the candidates for the
17 // may-aliasing stores can't change the value in memory before it's read by the
250 /// stores), it means that it could be forwarding from multiple stores
270 // If Store is nullptr it means that we have multiple stores forwarding to in removeDependencesFromMultipleStores()
284 // Already multiple stores forward to this load. in removeDependencesFromMultipleStores()
288 // Handle the very basic case when the two stores are in the same block in removeDependencesFromMultipleStores()
307 << " The load may have multiple stores forwarding to " in removeDependencesFromMultipleStores()
338 // should overlap with any of the stores. in findPointersWrittenOnForwardingPath()
371 // We're looking for stores after the first forwarding store until the end in findPointersWrittenOnForwardingPath()
373 // forwarded-to load. Collect the pointer for the stores. in findPointersWrittenOnForwardingPath()
[all …]
/freebsd/sys/dev/isci/scil/
H A Dscif_sas_smp_remote_device.h114 * @brief The SCIF_SAS_SMP_REMOTE_DEVICE stores data for smp remote devices
121 * This field stores the current SMP request function in the discovering
133 * This field stores the current expander phy index for sending out SMP
139 * This field stores the current route index to config route table for
151 * This field stores the smp phy whose route entries are edited by sending
157 * This field stores the current smp phy on a destination device's smp phy list whose
165 * This field stores the current smp phy to which a PHY CONTROL (clear affiliation)
190 * This field stores the number of phys for expander device found by decoding
/freebsd/stand/libsa/
H A Dnvstore.c50 nvstore_list_t stores = STAILQ_HEAD_INITIALIZER(stores); variable
59 STAILQ_FOREACH(st, &stores, nvs_next) { in nvstore_get_store()
87 STAILQ_INSERT_TAIL(&stores, st, nvs_next); in nvstore_init()
100 STAILQ_REMOVE(&stores, st, nvstore, nvs_next); in nvstore_fini()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DMergedLoadStoreMotion.h1 //===- MergedLoadStoreMotion.h - merge and hoist/sink load/stores ---------===//
10 //! This pass performs merges of loads and stores on both sides of a
11 // diamond (hammock). It hoists the loads and sinks the stores.
15 // it sinks and merges two stores to the tail block (footer). The algorithm
/freebsd/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/
H A DLSUnit.h210 /// True if loads don't alias with stores.
212 /// By default, the LS unit assumes that loads and stores don't alias with
214 /// alias with stores.
320 // Stores are tracked by the STQ (store queue) from dispatch until commitment.
343 /// stores nor barriers in between the two loads.
351 /// stores (this would only affects rule 4).
353 /// identify aliasing loads and stores.
355 /// To enforce aliasing between loads and stores, flag `AssumeNoAlias` must be
361 /// provide different sets of rules for loads and stores by overriding method
390 /// load/store barrier enforces ordering of loads/stores:
[all …]
/freebsd/lib/libmp/
H A Dlibmp.3152 and stores the result in
191 power and stores the result in
203 number, and if successful, stores the result in
219 and stores the result in
260 and stores them in
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp75 // When Stores and Loads maps (or NonAliasStores and NonAliasLoads)
628 /// 1 for loads, 0 for stores. (see comment in SUList)
767 // on it, stores and loads kept separately. Two SUs are trivially in buildSchedGraph()
770 Value2SUsMap Stores, Loads(1 /*TrueMemOrderLatency*/); in buildSchedGraph() local
772 // Certain memory accesses are known to not alias any SU in Stores in buildSchedGraph()
782 // These do not depend on one other (or normal loads or stores), but in buildSchedGraph()
913 addBarrierChain(Stores); in buildSchedGraph()
955 // An unknown store depends on all stores and loads. in buildSchedGraph()
956 addChainDependencies(SU, Stores); in buildSchedGraph()
962 Stores.insert(SU, UnknownValue); in buildSchedGraph()
[all …]
/freebsd/crypto/openssl/doc/man3/
H A DBN_bn2bin.pod38 and stores it at B<to>. B<to> must point to BN_num_bytes(B<a>) bytes of
42 and stores it at B<to>. B<tolen> indicates the length of the output buffer
66 stores it in **B<a>. If *B<a> is NULL, a new B<BIGNUM> is created. If
81 BN_bn2mpi() stores the representation of B<a> at B<to>, where B<to>
86 a B<BIGNUM> and stores it at B<ret>, or in a newly allocated B<BIGNUM>
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdater.h143 /// Helper class for promoting a collection of loads and stores into SSA
147 /// and stores in one block.
162 /// Insts is a list of loads and stores to promote, and Name is the basename
163 /// for the PHIs to insert. After this is complete, the loads and stores are
174 /// This hook is invoked after all the stores are found and inserted as
188 /// Return false if a sub-class wants to keep one of the loads/stores
/freebsd/lib/libc/net/
H A Dethers.3163 stores the result in a static buffer;
165 stores the result in a user-passed buffer.
177 stores the result in a static buffer;
179 stores the result in a user-passed buffer.
/freebsd/sys/contrib/openzfs/module/icp/include/modes/
H A Dmodes.h92 * ccm_mac_len: Stores length of the MAC in CCM mode.
93 * ccm_mac_buf: Stores the intermediate value for MAC in CCM encrypt.
94 * In CCM decrypt, stores the input MAC value.
103 * ccm_pt_buf: Only used in CCM mode decrypt. It stores the
134 * gcm_ghash: Stores output from the GHASH function.
140 * gcm_pt_buf: Stores the decrypted plaintext returned by
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DSLPVectorizer.h9 // stores that can be put together into vector-stores. Next, it attempts to
108 /// Vectorize the store instructions collected in Stores.
163 ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R,
168 StoreListMap Stores; member
/freebsd/lib/libpmc/pmu-events/arch/x86/sapphirerapids/
H A Dvirtual-memory.json81 "BriefDescription": "Stores that miss the DTLB and hit the STLB.",
87 …"PublicDescription": "Counts stores that miss the DTLB (Data TLB) and hit the STLB (2nd Level TLB)…
110 …n": "Counts completed page walks (all page sizes) caused by demand data stores. This implies it m…
121 …"PublicDescription": "Counts completed page walks (1G sizes) caused by demand data stores. This i…
132 …tion": "Counts completed page walks (2M/4M sizes) caused by demand data stores. This implies addr…
143 …"PublicDescription": "Counts completed page walks (4K sizes) caused by demand data stores. This i…
/freebsd/lib/libpmc/pmu-events/arch/x86/amdzen1/
H A Dmemory.json11 …n": "Counts the number of operations dispatched to the LS unit. Unit Masks ADDed. Load-op-Stores.",
17 "BriefDescription": "Counts the number of stores dispatched to the LS unit. Unit Masks ADDed.",
43 "EventName": "ls_mab_alloc.stores",
45 "BriefDescription": "LS MAB allocates by type - stores.",

12345678910>>...72