Home
last modified time | relevance | path

Searched full:ordering (Results 1 – 25 of 1112) sorted by relevance

12345678910>>...45

/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVExpandAtomicPseudoInsts.cpp153 static unsigned getLRForRMW32(AtomicOrdering Ordering, in getLRForRMW32()
155 switch (Ordering) { in getLRForRMW32()
175 static unsigned getSCForRMW32(AtomicOrdering Ordering, in getSCForRMW32()
177 switch (Ordering) { in getSCForRMW32()
197 static unsigned getLRForRMW64(AtomicOrdering Ordering, in getLRForRMW64()
199 switch (Ordering) { in getLRForRMW64()
219 static unsigned getSCForRMW64(AtomicOrdering Ordering, in getLRForRMW() argument
221 switch (Ordering) { in getLRForRMW()
241 static unsigned getLRForRMW(AtomicOrdering Ordering, int Width, in doAtomicBinOpExpansion()
244 return getLRForRMW32(Ordering, Subtarge in doAtomicBinOpExpansion() local
151 getLRForRMW32(AtomicOrdering Ordering) getLRForRMW32() argument
168 getSCForRMW32(AtomicOrdering Ordering) getSCForRMW32() argument
185 getLRForRMW64(AtomicOrdering Ordering) getLRForRMW64() argument
202 getSCForRMW64(AtomicOrdering Ordering) getSCForRMW64() argument
227 getSCForRMW(AtomicOrdering Ordering,int Width) getSCForRMW() argument
307 AtomicOrdering Ordering = doMaskedAtomicBinOpExpansion() local
448 AtomicOrdering Ordering = expandAtomicMinMaxOp() local
631 AtomicOrdering Ordering = expandAtomicCmpXchg() local
[all...]
H A DRISCVInstrInfoA.td193 (ins GPR:$addr, GPR:$incr, ixlenimm:$ordering), []> {
202 (ins GPR:$addr, GPR:$incr, GPR:$mask, ixlenimm:$ordering), []> {
212 ixlenimm:$ordering), []> {
222 (ins GPR:$addr, GPR:$incr, GPR:$mask, ixlenimm:$ordering), []> {
231 : Pat<(intrin GPR:$addr, GPR:$incr, GPR:$mask, timm:$ordering),
232 (AMOInst GPR:$addr, GPR:$incr, GPR:$mask, timm:$ordering)>;
236 timm:$ordering),
238 timm:$ordering)>;
244 // Ordering constants must be kept in sync with the AtomicOrdering enum in
295 // Ordering constants must be kept in sync with the AtomicOrdering enum in
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineMemOperand.h164 /// Atomic ordering requirements for this memory operation. For cmpxchg
165 /// atomic operations, atomic ordering requirements when store occurs.
166 unsigned Ordering : 4; // enum AtomicOrdering member
167 /// For cmpxchg atomic operations, atomic ordering requirements when store
187 /// and atomic ordering requirements must also be specified. For cmpxchg
188 /// atomic operations the atomic ordering requirements when store does not
194 AtomicOrdering Ordering = AtomicOrdering::NotAtomic,
200 AtomicOrdering Ordering = AtomicOrdering::NotAtomic,
275 /// Return the atomic ordering requirements for this memory operation. For
276 /// cmpxchg atomic operations, return the atomic ordering requirements when
[all …]
/freebsd/contrib/llvm-project/openmp/runtime/src/include/
H A Dompx.h.var83 _TGT_KERNEL_LANGUAGE_HOST_IMPL_SYNC_C(void, sync_block, int Ordering,
87 _TGT_KERNEL_LANGUAGE_HOST_IMPL_SYNC_C(void, sync_block_divergent, int Ordering,
88 ompx_sync_block(Ordering))
119 _TGT_KERNEL_LANGUAGE_DECL_SYNC_C(void, sync_block, int Ordering)
121 _TGT_KERNEL_LANGUAGE_DECL_SYNC_C(void, sync_block_divergent, int Ordering)
200 _TGT_KERNEL_LANGUAGE_HOST_IMPL_SYNC_CXX(void, sync_block, int Ordering = acc_rel,
201 Ordering)
203 int Ordering = acc_rel, Ordering)
/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/aggs/
H A Dtst.negorder.d64 printf("Ordering of quantize() with some negative weights:\n");
68 printf("Ordering of lquantize() with some negative weights:\n");
72 printf("Ordering of sum() with some negative weights:\n");
76 printf("Ordering of max() with some negative weights:\n");
80 printf("Ordering of min() with some negative weights:\n");
/freebsd/sbin/rcorder/
H A Drcorder.837 .Nd print a dependency ordering of interdependent files
47 utility is designed to print out a dependency ordering of a set of
108 Generate ordering suitable for parallel startup, placing files that can be
145 in order for it to find a starting place in the dependency ordering.
166 Print the dependency ordering of the services from the base system and
254 the dependency ordering.
262 script in the dependency ordering,
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DAtomicOrdering.h1 //===-- llvm/Support/AtomicOrdering.h ---Atomic Ordering---------*- C++ -*-===//
10 /// Atomic ordering constants.
12 /// These values are used by LLVM to represent atomic ordering for C++11's
24 /// Atomic ordering for C11 / C++11's memory models.
49 /// Atomic ordering for LLVM's memory model.
51 /// C++ defines ordering as a lattice. LLVM supplements this with NotAtomic and
81 /// String used by LLVM IR to represent atomic ordering.
137 /// Return a single atomic ordering that is at least as strong as both the \p AO
/freebsd/share/man/man9/
H A Dnetisr.9103 of source ordering and protocol-specific ordering and work-placement
110 should maintain source ordering without advice from the protocol.
117 should maintain flow ordering as defined by the
126 doesn't have a flow ID, falling back on source ordering.
180 The ordering and work placement policy for the protocol, as described
H A Datomic.9179 variant, performs the operation without imposing any ordering constraints on
229 synchronization primitives to express their ordering requirements without
230 also imposing unnecessary ordering.
285 will read the value written by an (atomic) store, the ordering constraints
290 Although fences impose more restrictive ordering than acquire loads and
291 release stores, by separating access from ordering, they can sometimes
298 function establishes ordering between its call location and any interrupt
H A DSYSINIT.942 ordering metadata.
43 It allows runtime ordering of subsystem initialization in the kernel as well
55 and initialization ordering constants
/freebsd/contrib/llvm-project/clang/lib/Headers/
H A Draointintrin.h23 /// This intrinsic should be used for contention or weak ordering. It may
45 /// This intrinsic should be used for contention or weak ordering. It may
67 /// This intrinsic should be used for contention or weak ordering. It may
89 /// This intrinsic should be used for contention or weak ordering. It may
112 /// This intrinsic should be used for contention or weak ordering. It may
135 /// This intrinsic should be used for contention or weak ordering. It may
158 /// This intrinsic should be used for contention or weak ordering. It may
181 /// This intrinsic should be used for contention or weak ordering. It may
/freebsd/sys/net/
H A Dnetisr.h62 * Protocol ordering and affinity policy constants. See the detailed
65 #define NETISR_POLICY_SOURCE 1 /* Maintain source ordering. */
66 #define NETISR_POLICY_FLOW 2 /* Maintain flow ordering. */
144 * Protocols express ordering constraints and affinity preferences by
150 * NETISR_POLICY_SOURCE - netisr should maintain source ordering without
155 * NETISR_POLICY_FLOW - netisr should maintain flow ordering as defined by
159 * flow ID, falling back on source ordering.
218 * Supplemental source ordering information can be passed using the _src
/freebsd/contrib/llvm-project/libcxx/include/__debug_utils/
H A Dstrict_weak_ordering_check.h36 "The range is not sorted after the sort, your comparator is not a valid strict-weak ordering"); in __check_strict_weak_ordering_sorted()
50 !__comp(*(__first + __a), *(__first + __b)), "Your comparator is not a valid strict-weak ordering"); in __check_strict_weak_ordering_sorted()
52 !__comp(*(__first + __b), *(__first + __a)), "Your comparator is not a valid strict-weak ordering"); in __check_strict_weak_ordering_sorted()
59 __comp(*(__first + __a), *(__first + __b)), "Your comparator is not a valid strict-weak ordering"); in __check_strict_weak_ordering_sorted()
61 !__comp(*(__first + __b), *(__first + __a)), "Your comparator is not a valid strict-weak ordering"); in __check_strict_weak_ordering_sorted()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DWarnMissedTransforms.cpp34 "specified as part of an unsupported transformation ordering"); in warnAboutLeftoverTransformations()
45 "or specified as part of an unsupported transformation ordering"); in warnAboutLeftoverTransformations()
62 "or specified as part of an unsupported transformation ordering"); in warnAboutLeftoverTransformations()
70 "or specified as part of an unsupported transformation ordering"); in warnAboutLeftoverTransformations()
81 "specified as part of an unsupported transformation ordering"); in warnAboutLeftoverTransformations()
/freebsd/contrib/elftoolchain/libelf/
H A Dgelf_xlatetof.365 the byte ordering and data alignment restrictions dictated by the host
70 ordering from that of the host, or could use a different layout within
164 File objects use the library's native byte ordering.
166 File objects use a little-endian ordering.
168 File objects use a big-endian ordering.
/freebsd/lib/libc/string/
H A Dstrverscmp.336 (thus, the ordering would be "a", "b", "train").
38 (thus, the ordering would be "9", "10", "420" which is different to lexicographic order,
44 (thus, the ordering would be "000", "00", "01", "010", "09", "0", "1", "9", "10").
/freebsd/lib/libpmc/pmu-events/arch/x86/goldmont/
H A Dmemory.json3 "BriefDescription": "Machine clears due to memory ordering issue",
8 …e clears due to memory ordering issues. This occurs when a snoop request happens and the machine …
/freebsd/lib/libpmc/pmu-events/arch/x86/goldmontplus/
H A Dmemory.json3 "BriefDescription": "Machine clears due to memory ordering issue",
10 …e clears due to memory ordering issues. This occurs when a snoop request happens and the machine …
/freebsd/crypto/openssl/test/
H A Dpkey_meth_test.c10 /* Internal tests for EVP_PKEY method ordering */
21 /* Test of EVP_PKEY_ASN1_METHOD ordering */
54 /* Test of EVP_PKEY_METHOD ordering */
/freebsd/lib/libpmc/pmu-events/arch/x86/silvermont/
H A Dmemory.json3 "BriefDescription": "Stalls due to Memory ordering",
7 …: "This event counts the number of times that pipeline was cleared due to memory ordering issues.",
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DGlobalStatus.cpp30 /// Return the stronger of the two ordering. If the two orderings are acquire
97 GS.Ordering = strongerOrdering(GS.Ordering, LI->getOrdering()); in analyzeGlobalAux()
109 GS.Ordering = strongerOrdering(GS.Ordering, SI->getOrdering()); in analyzeGlobalAux()
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DTypeOrdering.h1 //===-------------- TypeOrdering.h - Total ordering for types ---*- C++ -*-===//
12 /// Defines clang::QualTypeOrdering, a total ordering on clang::QualType,
27 /// Function object that provides a total ordering on QualType values.
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zfs_mount/
H A Dzfs_mount_test_race.ksh23 # Verify parallel mount ordering is consistent.
66 log_note "Verify parallel mount ordering is consistent"
115 log_pass "Verify parallel mount ordering is consistent passed"
/freebsd/contrib/ofed/include/
H A Dudma_barrier.h49 device, pMEM). Generally speaking the ordering is only relative
56 The ordering guarantee is always stated between those two streams. Eg what
181 If done while holding a lock then the ordering of MMIO writes across CPUs
182 must be guaranteed to follow the natural ordering implied by the lock.
226 This must act as a barrier to prevent write re-ordering from different
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMemoryLegalizer.cpp95 AtomicOrdering Ordering = AtomicOrdering::NotAtomic; member in __anone9343ac70111::SIMemOpInfo
106 AtomicOrdering Ordering = AtomicOrdering::SequentiallyConsistent, in SIMemOpInfo() argument
114 : Ordering(Ordering), FailureOrdering(FailureOrdering), Scope(Scope), in SIMemOpInfo()
120 if (Ordering == AtomicOrdering::NotAtomic) { in SIMemOpInfo()
134 // There is also no cross address space ordering if the ordering in SIMemOpInfo()
164 /// \returns Ordering constraint of the machine instruction used to
167 return Ordering; in getOrdering()
170 /// \returns Failure ordering constraint of the machine instruction used to
188 /// \returns Return true iff memory ordering of operations on
210 /// \returns True if ordering constraint of the machine instruction used to
[all …]

12345678910>>...45