| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.set/ |
| H A D | erase_key.pass.cpp | 25 template <typename Unordered>
26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { in only_deletions()
27 typename Unordered::const_iterator w = whole.begin(); in only_deletions()
28 typename Unordered::const_iterator p = part.begin(); in only_deletions()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| H A D | erase_key.pass.cpp | 25 template <typename Unordered>
26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { in only_deletions()
27 typename Unordered::const_iterator w = whole.begin(); in only_deletions()
28 typename Unordered::const_iterator p = part.begin(); in only_deletions()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multiset/ |
| H A D | erase_key.pass.cpp | 25 template <typename Unordered>
26 bool only_deletions ( const Unordered &whole, const Unordered &part ) { in only_deletions()
27 typename Unordered::const_iterator w = whole.begin(); in only_deletions()
28 typename Unordered::const_iterator p = part.begin(); in only_deletions()
|
| /llvm-project-15.0.7/clang/include/clang/AST/ |
| H A D | ComparisonCategories.h | 71 Unordered, enumerator
72 Last = Unordered
169 return getValueInfo(ComparisonCategoryResult::Unordered); in getUnordered()
|
| /llvm-project-15.0.7/clang-tools-extra/clang-tidy/performance/ |
| H A D | InefficientAlgorithmCheck.cpp | 71 const bool Unordered = in check() local
83 if (AlgCall->getNumArgs() == 4 && !Unordered) { in check()
104 if (Unordered && AlgDecl->getName().find("bound") != llvm::StringRef::npos) in check()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | LowerMemIntrinsics.cpp | 101 Load->setAtomic(AtomicOrdering::Unordered); in createMemCpyLoopKnownSize()
102 Store->setAtomic(AtomicOrdering::Unordered); in createMemCpyLoopKnownSize()
166 Load->setAtomic(AtomicOrdering::Unordered); in createMemCpyLoopKnownSize()
167 Store->setAtomic(AtomicOrdering::Unordered); in createMemCpyLoopKnownSize()
254 Load->setAtomic(AtomicOrdering::Unordered); in createMemCpyLoopUnknownSize()
255 Store->setAtomic(AtomicOrdering::Unordered); in createMemCpyLoopUnknownSize()
331 Load->setAtomic(AtomicOrdering::Unordered); in createMemCpyLoopUnknownSize()
332 Store->setAtomic(AtomicOrdering::Unordered); in createMemCpyLoopUnknownSize()
|
| /llvm-project-15.0.7/llvm/include/llvm/Support/ |
| H A D | AtomicOrdering.h | 58 Unordered = 1, enumerator
121 return isStrongerThan(AO, AtomicOrdering::Unordered); in isStrongerThanUnordered()
|
| /llvm-project-15.0.7/flang/unittests/Evaluate/ |
| H A D | real.cpp | 89 TEST(zero.Compare(nan) == Relation::Unordered)(desc); in basicTests()
90 TEST(minusZero.Compare(nan) == Relation::Unordered)(desc); in basicTests()
91 TEST(nan.Compare(zero) == Relation::Unordered)(desc); in basicTests()
92 TEST(nan.Compare(minusZero) == Relation::Unordered)(desc); in basicTests()
93 TEST(nan.Compare(nan) == Relation::Unordered)(desc); in basicTests()
107 TEST(nan.Compare(inf) == Relation::Unordered)(desc); in basicTests()
124 TEST(nan.Compare(negInf) == Relation::Unordered)(desc); in basicTests()
|
| /llvm-project-15.0.7/llvm/test/YAMLParser/ |
| H A D | construct-map.test | 3 # Unordered set of key: value pairs.
|
| /llvm-project-15.0.7/clang/lib/AST/ |
| H A D | ComparisonCategories.cpp | 195 case CCVT::Unordered: in getResultString()
212 Values.push_back(CCR::Unordered); in getPossibleResultsForType()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| H A D | erase_key.pass.cpp | 28 template <typename Unordered>
29 bool only_deletions ( const Unordered &whole, const Unordered &part ) { in only_deletions()
30 typename Unordered::const_iterator w = whole.begin(); in only_deletions()
31 typename Unordered::const_iterator p = part.begin(); in only_deletions()
|
| /llvm-project-15.0.7/mlir/test/Target/SPIRV/ |
| H A D | logical-ops.mlir | 81 // CHECK: spv.Unordered
82 %14 = spv.Unordered %arg0, %arg1 : f32
|
| /llvm-project-15.0.7/llvm/test/TableGen/ |
| H A D | GlobalISelEmitter-atomic_store.td | 13 …-NEXT: GIM_CheckAtomicOrderingOrStrongerThan, /*MI*/0, /*Order*/(int64_t)AtomicOrdering::Unordered,
|
| /llvm-project-15.0.7/flang/include/flang/Evaluate/ |
| H A D | common.h | 37 ENUM_CLASS(Relation, Less, Equal, Greater, Unordered) in ENUM_CLASS()
123 case Relation::Unordered: in Satisfies()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineAtomicRMW.cpp | 121 Ordering != AtomicOrdering::Unordered && in visitAtomicRMWInst()
|
| /llvm-project-15.0.7/llvm/docs/ |
| H A D | Atomics.rst | 155 for a "safe" language like Java, use Unordered to load and store any shared
176 Unordered section in Atomic orderings
179 Unordered is the lowest level of atomicity. It essentially guarantees that races
238 it is legal to reorder non-atomic and Unordered loads around Monotonic
365 Unordered. This would be checked, for example, by LICM before hoisting an
382 optimize some atomic operations (Unordered operations in particular), make sure
392 * LICM: Unordered loads/stores can be moved out of a loop. It just treats
396 * DSE: Unordered stores can be DSE'ed like normal stores. Monotonic stores can
|
| /llvm-project-15.0.7/llvm/lib/Target/SPIRV/ |
| H A D | SPIRVUtils.cpp | 203 case AtomicOrdering::Unordered: in getMemSemantics()
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | MachineMemOperand.h | 305 getSuccessOrdering() == AtomicOrdering::Unordered) && in isUnordered()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/ARM/ |
| H A D | fp16-vminmaxnm-vector.ll | 80 ; Unordered
230 ; Unordered
|
| /llvm-project-15.0.7/llvm/unittests/CodeGen/GlobalISel/ |
| H A D | MachineIRBuilderTest.cpp | 310 AAMDNodes(), nullptr, SyncScope::System, AtomicOrdering::Unordered); in TEST_F()
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/SPIRV/IR/ |
| H A D | SPIRVLogicalOps.td | 1126 def SPV_UnorderedOp : SPV_LogicalBinaryOp<"Unordered", SPV_Float, [Commutative]> {
1147 unordered-op ::= ssa-id `=` `spv.Unordered` ssa-use, ssa-use
1153 %4 = spv.Unordered %0, %1 : f32
1154 %5 = spv.Unordered %2, %3 : vector<4xf32>
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | AliasAnalysis.cpp | 483 if (isStrongerThan(L->getOrdering(), AtomicOrdering::Unordered)) in getModRefInfo()
508 if (isStrongerThan(S->getOrdering(), AtomicOrdering::Unordered)) in getModRefInfo()
|
| /llvm-project-15.0.7/flang/lib/Evaluate/ |
| H A D | fold-real.cpp | 288 case Relation::Unordered: in FoldIntrinsicFunction()
|
| /llvm-project-15.0.7/llvm/lib/Target/Sparc/ |
| H A D | SparcInstrInfo.td | 322 def FCC_U : FCC_VAL<23>; // Unordered
324 def FCC_UG : FCC_VAL<21>; // Unordered or Greater
326 def FCC_UL : FCC_VAL<19>; // Unordered or Less
330 def FCC_UE : FCC_VAL<26>; // Unordered or Equal
332 def FCC_UGE : FCC_VAL<28>; // Unordered or Greater or Equal
334 def FCC_ULE : FCC_VAL<30>; // Unordered or Less or Equal
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | AtomicExpandPass.cpp | 464 if (Order == AtomicOrdering::Unordered) in expandAtomicLoadToCmpXchg()
520 AtomicOrdering RMWOrdering = Ordering == AtomicOrdering::Unordered in expandAtomicStore()
1488 MemOpOrder == AtomicOrdering::Unordered in insertRMWCmpXchgLoop()
|