| /llvm-project-15.0.7/clang/test/CodeGen/ |
| H A D | unsigned-promotion.c | 9 unsigned short si, sj, sk; variable
29 si = sj * sk; in testshortmul()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/X86/ |
| H A D | late-address-taken.ll | 58 br i1 %b, label %early_out, label %sj
61 sj:
70 ; CHECK: # %sj
74 ; CHECK-NEXT: # %sj
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Mips/Fast-ISel/ |
| H A D | div1.ll | 6 @sj = global i32 200000, align 4
21 ; CHECK-DAG: lw $[[J_ADDR:[0-9]+]], %got(sj)($[[GOT]])
28 %1 = load i32, i32* @sj, align 4
|
| H A D | rem1.ll | 6 @sj = global i32 200, align 4
21 ; CHECK-DAG: lw $[[J_ADDR:[0-9]+]], %got(sj)($[[GOT]])
28 %1 = load i32, i32* @sj, align 4
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| H A D | default.pass.cpp | 80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
119 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2() local
122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| H A D | default.pass.cpp | 81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
120 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2() local
123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| H A D | default.pass.cpp | 81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
120 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2() local
123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| H A D | default.pass.cpp | 82 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local
85 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
121 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2() local
124 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| H A D | default.pass.cpp | 81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| H A D | make_default_searcher.pass.cpp | 66 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local
69 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.default/ |
| H A D | default.pass.cpp | 81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| H A D | search.pass.cpp | 105 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local
108 assert(std::search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk)) == Iter1(ij+6)); in test()
|
| /llvm-project-15.0.7/mlir/test/Conversion/SCFToSPIRV/ |
| H A D | for.mlir | 73 %result:2 = scf.for %i0 = %lb to %ub step %step iter_args(%si = %s0, %sj = %s1) -> (f32, f32) {
|
| /llvm-project-15.0.7/mlir/test/Conversion/SCFToControlFlow/ |
| H A D | convert-to-cfg.mlir | 281 …%result:2 = scf.for %i0 = %arg0 to %arg1 step %arg2 iter_args(%si = %s0, %sj = %s1) -> (f32, f32) {
282 %sn = arith.addf %si, %sj : f32
|