HomeSort by relevance Sort by last modified time
    Searched full:unordered (Results 1 - 25 of 477) 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/llvm/test/Assembler/
atomic.ll 5 ; CHECK: load atomic i32* %x unordered, align 4
6 load atomic i32* %x unordered, align 4
  /external/markdown/tests/markdown-test/
benchmark.dat 17 ordered-and-unordered-list:0.530000:0.000000
ordered-and-unordered-list.txt 0 ## Unordered
  /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/guava/guava-testlib/src/com/google/common/collect/testing/
TestStringSetGenerator.java 63 * unordered container. An equally valid implementation for an unordered
  /external/llvm/lib/Target/Sparc/
Sparc.h 56 FCC_U = 7+16, // Unordered
58 FCC_UG = 5+16, // Unordered or Greater
60 FCC_UL = 3+16, // Unordered or Less
64 FCC_UE = 10+16, // Unordered or Equal
66 FCC_UGE = 12+16, // Unordered or Greater or Equal
68 FCC_ULE = 14+16, // Unordered or Less or Equal
  /external/easymock/src/org/easymock/internal/
UnorderedBehavior.java 82 boolean unordered = !checkOrder;
87 if (unordered && validCallCount && !match) {
  /external/llvm/test/CodeGen/AArch64/
fp128.ll 154 ; CHECK: mov x[[UNORDERED:[0-9]+]], x0
159 ; CHECK: cmp w[[UNORDERED]], #0
160 ; CHECK: csinc [[UNORDERED:w[0-9]+]], wzr, wzr, eq
161 ; CHECK: orr w0, [[UNORDERED]], [[GT]]
178 ; CHECK: mov x[[UNORDERED:[0-9]+]], x0
184 ; CHECK: cmp w[[UNORDERED]], #0
185 ; CHECK: csinc [[UNORDERED:w[0-9]+]], wzr, wzr, eq
186 ; CHECK: orr [[UGE:w[0-9]+]], [[UNORDERED]], [[OGE]]
  /external/llvm/test/CodeGen/ARM/
atomic-load-store.ll 45 %val = load atomic i8* %ptr1 unordered, align 1
46 store atomic i8 %val, i8* %ptr2 unordered, align 1
  /external/llvm/test/CodeGen/SystemZ/
spill-01.ll 257 %val0 = load atomic i32 *%ptr0 unordered, align 4
258 %val1 = load atomic i32 *%ptr1 unordered, align 4
259 %val2 = load atomic i32 *%ptr2 unordered, align 4
260 %val3 = load atomic i32 *%ptr3 unordered, align 4
261 %val4 = load atomic i32 *%ptr4 unordered, align 4
262 %val5 = load atomic i32 *%ptr5 unordered, align 4
263 %val6 = load atomic i32 *%ptr6 unordered, align 4
264 %val7 = load atomic i32 *%ptr7 unordered, align 4
265 %val8 = load atomic i32 *%ptr8 unordered, align 4
269 store atomic i32 %val0, i32 *%ptr0 unordered, align
    [all...]
  /external/blktrace/
verify_blkparse.c 62 fprintf(stdout, "Events %Lu: %d unordered, %d aliases\n", total_entries, nr, alias);
  /external/e2fsprogs/tests/f_h_badroot/
expect.1 20 Problem in HTREE directory inode 80065: block #0 has an unordered hash table
  /external/llvm/docs/
Atomics.rst 155 for a "safe" language like Java, use Unordered to load and store any shared
176 Unordered
179 Unordered is the lowest level of atomicity. It essentially guarantees that races
195 languages would normally split a 64-bit store on ARM into two 32-bit unordered
204 call. Reordering unordered operations is safe, though, and optimizers should
205 take advantage of that because unordered operations are common in languages
210 unordered loads and unordered stores, a load cannot see a value which was
212 note that an unordered load or store cannot be split into multiple
238 it is legal to reorder non-atomic and Unordered loads around Monotoni
    [all...]
  /external/markdown/MarkdownTest/Tests_2004/
Ordered and unordered lists.text 0 ## Unordered
  /external/markdown/MarkdownTest/Tests_2007/
Ordered and unordered lists.text 0 ## Unordered
  /external/llvm/lib/Target/ARM/MCTargetDesc/
ARMBaseInfo.h 31 NE, // Not equal Not equal, or unordered
32 HS, // Carry set >, ==, or unordered
35 PL, // Plus, positive or zero >, ==, or unordered
36 VS, // Overflow Unordered
37 VC, // No overflow Not unordered
38 HI, // Unsigned higher Greater than, or unordered
41 LT, // Less than Less than, or unordered
43 LE, // Less than or equal <, ==, or unordered

Completed in 471 milliseconds

1 2 3 4 5 6 7 8 91011>>