| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/llvm10/llvm-10.0.1.src/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/graphics/llvm-mesa/llvm-13.0.1.src/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/llvm/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/llvm11/llvm-11.0.1.src/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/llvm90/llvm-9.0.1.src/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/llvm80/llvm-8.0.1.src/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/llvm70/llvm-7.0.1.src/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/llvm/test/CodeGen/PowerPC/ |
| H A D | no-dup-of-bdnz.ll | 42 %lsr.iv20.i116 = phi i64 [ %2, %BB_7 ], [ %lsr.iv.next21.i126, %BB_5 ]
43 %lsr.iv.next21.i126 = add i64 %lsr.iv20.i116, 1
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 210 int i116[] = {1, 1, 1, 0, 1, 1}; in test() local
273 assert(std::is_heap(i116, i116+6) == (std::is_heap_until(i116, i116+6) == i116+6)); in test()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 210 int i116[] = {1, 1, 1, 0, 1, 1}; in test() local
273 assert(std::is_heap(i116, i116+6) == (std::is_heap_until(i116, i116+6) == i116+6)); in test()
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 210 int i116[] = {1, 1, 1, 0, 1, 1}; in test() local
273 assert(std::is_heap(i116, i116+6) == (std::is_heap_until(i116, i116+6) == i116+6)); in test()
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 210 int i116[] = {1, 1, 1, 0, 1, 1}; in test() local
273 assert(std::is_heap(i116, i116+6) == (std::is_heap_until(i116, i116+6) == i116+6)); in test()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 210 int i116[] = {1, 1, 1, 0, 1, 1}; in test() local
273 assert(std::is_heap(i116, i116+6) == (std::is_heap_until(i116, i116+6) == i116+6)); in test()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 210 int i116[] = {1, 1, 1, 0, 1, 1}; in test() local
273 assert(std::is_heap(i116, i116+6) == (std::is_heap_until(i116, i116+6) == i116+6)); in test()
|
| /dports/devel/libc++/libcxx-10.0.1.src/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 210 int i116[] = {1, 1, 1, 0, 1, 1}; in test() local
273 assert(std::is_heap(i116, i116+6) == (std::is_heap_until(i116, i116+6) == i116+6)); in test()
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 210 int i116[] = {1, 1, 1, 0, 1, 1}; in test() local
273 assert(std::is_heap(i116, i116+6) == (std::is_heap_until(i116, i116+6) == i116+6)); in test()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 210 int i116[] = {1, 1, 1, 0, 1, 1}; in test() local
273 assert(std::is_heap(i116, i116+6) == (std::is_heap_until(i116, i116+6) == i116+6)); in test()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 210 int i116[] = {1, 1, 1, 0, 1, 1}; in test() local
273 assert(std::is_heap(i116, i116+6) == (std::is_heap_until(i116, i116+6) == i116+6)); in test()
|