HomeSort by relevance Sort by last modified time
    Searched full:unordered (Results 1 - 25 of 475) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/clang/test/CodeGen/
const-unordered-compare.c 3 // Checks folding of an unordered comparison
  /external/llvm/test/YAMLParser/
construct-map.data 3 # Unordered set of key: value pairs.
  /external/llvm/test/Transforms/GVN/
atomic.ll 9 ; GVN across unordered store (allowed)
15 store atomic i32 %x, i32* @x unordered, align 4
33 ; GVN across unordered load (allowed)
39 %y = load atomic i32* @x unordered, align 4
60 ; GVN load to unordered load (allowed)
65 %x = load atomic i32* @x unordered, align 4
71 ; GVN unordered load to load (unordered load must not be removed)
74 ; CHECK: load atomic i32* @x unordered
77 %x2 = load atomic i32* @x unordered, align
    [all...]
  /external/llvm/test/Transforms/DeadStoreElimination/
atomic.ll 15 ; DSE across unordered store (allowed)
22 store atomic i32 0, i32* @y unordered, align 4
51 ; DSE remove unordered store (allowed)
57 store atomic i32 0, i32* @x unordered, align 4
62 ; DSE unordered store overwriting non-atomic store (allowed)
68 store atomic i32 1, i32* @x unordered, align 4
72 ; DSE no-op unordered atomic store (allowed)
78 %x = load atomic i32* @x unordered, align 4
79 store atomic i32 %x, i32* @x unordered, align 4
  /external/markdown/tests/misc/
br.txt 13 Unordered (bulleted) lists use asterisks, pluses, and hyphens (`*`,
br.html 9 <p>Unordered (bulleted) lists use asterisks, pluses, and hyphens (<code>*</code>,
  /external/chromium_org/third_party/sqlite/src/test/
unordered.test 17 set testprefix unordered
33 foreach idxmode {ordered unordered} {
34 if {$idxmode == "unordered"} {
35 execsql { UPDATE sqlite_stat1 SET stat = stat || ' unordered' }
39 foreach {tn sql r(ordered) r(unordered)} {
  /external/llvm/test/Transforms/LICM/
atomics.ll 3 ; Check that we can hoist unordered loads
10 %val = load atomic i32* %y unordered, align 4
42 ; Check that we hoist unordered around monotonic.
51 %valb = load atomic i32* %x unordered, align 4
58 ; CHECK: load atomic i32* %x unordered
62 ; Don't try to "sink" unordered stores yet; it is legal, but the machinery
70 store atomic i32 %vala, i32* %x unordered, align 4
  /external/llvm/test/Transforms/MemCpyOpt/
atomic.ll 20 store atomic i32 0, i32* %gep1 unordered, align 4
26 ; memcpyopt across unordered store
35 store atomic i32 0, i32* @x unordered, align 4
  /external/lldb/source/Plugins/Process/Utility/
ARMDefines.h 30 #define COND_NE 0x1 // Not equal Not equal, or unordered Z == 0
31 #define COND_CS 0x2 // Carry set >, ==, or unordered C == 1
36 #define COND_PL 0x5 // Plus, positive or zero >, ==, or unordered N == 0
37 #define COND_VS 0x6 // Overflow Unordered V == 1
38 #define COND_VC 0x7 // No overflow Not unordered V == 0
39 #define COND_HI 0x8 // Unsigned higher Greater than, or unordered C == 1 and Z == 0
42 #define COND_LT 0xB // Less than Less than, or unordered N != V
44 #define COND_LE 0xD // Less than or equal <, ==, or unordered Z == 1 or N != V
  /external/clang/test/CodeGenCXX/
static-member-variable-explicit-specialization.cpp 24 template int A<short>::a; // Unordered
27 int d = A<void>::a; // Unordered
38 template short x<short>; // Unordered
40 int e = x<char>; // Unordered
  /external/llvm/test/CodeGen/AArch64/
arm64-atomic.ll 123 %val_regoff = load atomic i8* %ptr_regoff unordered, align 1
133 %val_random = load atomic i8* %ptr_random unordered, align 1
148 %val_regoff = load atomic i16* %ptr_regoff unordered, align 2
158 %val_random = load atomic i16* %ptr_random unordered, align 2
173 %val_regoff = load atomic i32* %ptr_regoff unordered, align 4
183 %val_random = load atomic i32* %ptr_random unordered, align 4
198 %val_regoff = load atomic i64* %ptr_regoff unordered, align 8
208 %val_random = load atomic i64* %ptr_random unordered, align 8
231 store atomic i8 %val, i8* %ptr_regoff unordered, align 1
239 store atomic i8 %val, i8* %ptr_random unordered, align
    [all...]
  /external/markdown/tests/markdown-test/
benchmark.dat 17 ordered-and-unordered-list:0.530000:0.000000
  /external/guava/guava-testlib/src/com/google/common/collect/testing/
TestStringSetGenerator.java 63 * unordered container. An equally valid implementation for an unordered
  /external/llvm/test/Assembler/
atomic.ll 5 ; CHECK: load atomic i32* %x unordered, align 4
6 load atomic i32* %x unordered, align 4
  /external/llvm/lib/Target/Sparc/
Sparc.h 64 FCC_U = 7+16, // Unordered
66 FCC_UG = 5+16, // Unordered or Greater
68 FCC_UL = 3+16, // Unordered or Less
72 FCC_UE = 10+16, // Unordered or Equal
74 FCC_UGE = 12+16, // Unordered or Greater or Equal
76 FCC_ULE = 14+16, // Unordered or Less or Equal
  /external/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/
erase_key.pass.cpp 25 template <typename Unordered>
26 bool only_deletions ( const Unordered &whole, const Unordered &part ) {
27 typename Unordered::const_iterator w = whole.begin();
28 typename Unordered::const_iterator p = part.begin();
  /external/libcxx/test/containers/unord/unord.multiset/
erase_key.pass.cpp 25 template <typename Unordered>
26 bool only_deletions ( const Unordered &whole, const Unordered &part ) {
27 typename Unordered::const_iterator w = whole.begin();
28 typename Unordered::const_iterator p = part.begin();
  /external/libcxx/test/containers/unord/unord.set/
erase_key.pass.cpp 25 template <typename Unordered>
26 bool only_deletions ( const Unordered &whole, const Unordered &part ) {
27 typename Unordered::const_iterator w = whole.begin();
28 typename Unordered::const_iterator p = part.begin();
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/
erase_key.pass.cpp 25 template <typename Unordered>
26 bool only_deletions ( const Unordered &whole, const Unordered &part ) {
27 typename Unordered::const_iterator w = whole.begin();
28 typename Unordered::const_iterator p = part.begin();
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/
erase_key.pass.cpp 25 template <typename Unordered>
26 bool only_deletions ( const Unordered &whole, const Unordered &part ) {
27 typename Unordered::const_iterator w = whole.begin();
28 typename Unordered::const_iterator p = part.begin();
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/
erase_key.pass.cpp 25 template <typename Unordered>
26 bool only_deletions ( const Unordered &whole, const Unordered &part ) {
27 typename Unordered::const_iterator w = whole.begin();
28 typename Unordered::const_iterator p = part.begin();
  /external/clang/test/CodeGenObjC/
atomic-aggregate-property.m 32 // CHECK-LP64: load atomic i64* {{%.*}} unordered, align 8
35 // CHECK-LP64: store atomic i64 {{%.*}}, i64* {{%.*}} unordered, align 8
  /external/easymock/src/org/easymock/internal/
UnorderedBehavior.java 82 boolean unordered = !checkOrder;
87 if (unordered && validCallCount && !match) {
  /external/llvm/test/CodeGen/SystemZ/
spill-01.ll 258 %val0 = load atomic i32 *%ptr0 unordered, align 4
259 %val1 = load atomic i32 *%ptr1 unordered, align 4
260 %val2 = load atomic i32 *%ptr2 unordered, align 4
261 %val3 = load atomic i32 *%ptr3 unordered, align 4
262 %val4 = load atomic i32 *%ptr4 unordered, align 4
263 %val5 = load atomic i32 *%ptr5 unordered, align 4
264 %val6 = load atomic i32 *%ptr6 unordered, align 4
265 %val7 = load atomic i32 *%ptr7 unordered, align 4
266 %val8 = load atomic i32 *%ptr8 unordered, align 4
270 store atomic i32 %val0, i32 *%ptr0 unordered, align
    [all...]

Completed in 731 milliseconds

1 2 3 4 5 6 7 8 91011>>