| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/test/CodeGen/WebAssembly/ |
| H A D | simd-scalar-to-vector.ll | 33 …%shuffle.i214 = shufflevector <16 x i8> %0, <16 x i8> <i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i…
34 %1 = bitcast <16 x i8> %shuffle.i214 to <8 x i16>
|
| /dports/devel/llvm10/llvm-10.0.1.src/test/CodeGen/WebAssembly/ |
| H A D | simd-scalar-to-vector.ll | 33 …%shuffle.i214 = shufflevector <16 x i8> %0, <16 x i8> <i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i…
34 %1 = bitcast <16 x i8> %shuffle.i214 to <8 x i16>
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/test/CodeGen/WebAssembly/ |
| H A D | simd-scalar-to-vector.ll | 32 …%shuffle.i214 = shufflevector <16 x i8> %0, <16 x i8> <i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i…
33 %1 = bitcast <16 x i8> %shuffle.i214 to <8 x i16>
|
| /dports/graphics/llvm-mesa/llvm-13.0.1.src/test/CodeGen/WebAssembly/ |
| H A D | simd-scalar-to-vector.ll | 32 …%shuffle.i214 = shufflevector <16 x i8> %0, <16 x i8> <i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i…
33 %1 = bitcast <16 x i8> %shuffle.i214 to <8 x i16>
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/llvm/test/CodeGen/WebAssembly/ |
| H A D | simd-scalar-to-vector.ll | 33 …%shuffle.i214 = shufflevector <16 x i8> %0, <16 x i8> <i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i…
34 %1 = bitcast <16 x i8> %shuffle.i214 to <8 x i16>
|
| /dports/devel/llvm11/llvm-11.0.1.src/test/CodeGen/WebAssembly/ |
| H A D | simd-scalar-to-vector.ll | 33 …%shuffle.i214 = shufflevector <16 x i8> %0, <16 x i8> <i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i…
34 %1 = bitcast <16 x i8> %shuffle.i214 to <8 x i16>
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/test/CodeGen/WebAssembly/ |
| H A D | simd-scalar-to-vector.ll | 32 …%shuffle.i214 = shufflevector <16 x i8> %0, <16 x i8> <i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i…
33 %1 = bitcast <16 x i8> %shuffle.i214 to <8 x i16>
|
| /dports/devel/llvm90/llvm-9.0.1.src/test/CodeGen/WebAssembly/ |
| H A D | simd-scalar-to-vector.ll | 33 …%shuffle.i214 = shufflevector <16 x i8> %0, <16 x i8> <i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i…
34 %1 = bitcast <16 x i8> %shuffle.i214 to <8 x i16>
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/test/CodeGen/WebAssembly/ |
| H A D | simd-scalar-to-vector.ll | 33 …%shuffle.i214 = shufflevector <16 x i8> %0, <16 x i8> <i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i…
34 %1 = bitcast <16 x i8> %shuffle.i214 to <8 x i16>
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/test/CodeGen/WebAssembly/ |
| H A D | simd-scalar-to-vector.ll | 33 …%shuffle.i214 = shufflevector <16 x i8> %0, <16 x i8> <i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i…
34 %1 = bitcast <16 x i8> %shuffle.i214 to <8 x i16>
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/test/CodeGen/WebAssembly/ |
| H A D | simd-scalar-to-vector.ll | 33 …%shuffle.i214 = shufflevector <16 x i8> %0, <16 x i8> <i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i…
34 %1 = bitcast <16 x i8> %shuffle.i214 to <8 x i16>
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/llvm/test/CodeGen/WebAssembly/ |
| H A D | simd-scalar-to-vector.ll | 32 …%shuffle.i214 = shufflevector <16 x i8> %0, <16 x i8> <i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i8 0, i…
33 %1 = bitcast <16 x i8> %shuffle.i214 to <8 x i16>
|
| /dports/math/yices/yices-2.6.2/tests/regress/wd/ |
| H A D | prp-1-22.smt2 | 13 (declare-fun i214 () Int)
22 …11 (ite ?v_14 23 (ite ?v_15 23 ?v_10))) (?v_16 (<= (ite ?v_12 i214 (ite (not ?v_13) 0 i214)) (+ (i…
|
| /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 | 371 int i214[] = {1, 0, 1, 1, 1, 1, 0}; in test() local
498 assert(std::is_heap(i214, i214+7) == (std::is_heap_until(i214, i214+7) == i214+7)); in test()
|
| H A D | is_heap_until.pass.cpp | 371 int i214[] = {1, 0, 1, 1, 1, 1, 0}; in test() local
498 assert(std::is_heap_until(i214, i214+7) == i214+3); 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 | 371 int i214[] = {1, 0, 1, 1, 1, 1, 0}; in test() local
498 assert(std::is_heap(i214, i214+7) == (std::is_heap_until(i214, i214+7) == i214+7)); 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 | 371 int i214[] = {1, 0, 1, 1, 1, 1, 0}; in test() local
498 assert(std::is_heap(i214, i214+7) == (std::is_heap_until(i214, i214+7) == i214+7)); 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 | 371 int i214[] = {1, 0, 1, 1, 1, 1, 0}; in test() local
498 assert(std::is_heap(i214, i214+7) == (std::is_heap_until(i214, i214+7) == i214+7)); 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 | 371 int i214[] = {1, 0, 1, 1, 1, 1, 0}; in test() local
498 assert(std::is_heap(i214, i214+7) == (std::is_heap_until(i214, i214+7) == i214+7)); 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 | 371 int i214[] = {1, 0, 1, 1, 1, 1, 0}; in test() local
498 assert(std::is_heap(i214, i214+7) == (std::is_heap_until(i214, i214+7) == i214+7)); 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 | 371 int i214[] = {1, 0, 1, 1, 1, 1, 0}; in test() local
498 assert(std::is_heap(i214, i214+7) == (std::is_heap_until(i214, i214+7) == i214+7)); 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 | 371 int i214[] = {1, 0, 1, 1, 1, 1, 0}; in test() local
498 assert(std::is_heap(i214, i214+7) == (std::is_heap_until(i214, i214+7) == i214+7)); 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 | 371 int i214[] = {1, 0, 1, 1, 1, 1, 0}; in test() local
498 assert(std::is_heap(i214, i214+7) == (std::is_heap_until(i214, i214+7) == i214+7)); 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 | 371 int i214[] = {1, 0, 1, 1, 1, 1, 0}; in test() local
498 assert(std::is_heap(i214, i214+7) == (std::is_heap_until(i214, i214+7) == i214+7)); in test()
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 371 int i214[] = {1, 0, 1, 1, 1, 1, 0}; in test() local
498 assert(std::is_heap(i214, i214+7) == (std::is_heap_until(i214, i214+7) == i214+7)); in test()
|