Home
last modified time | relevance | path

Searched refs:ij (Results 1 – 18 of 18) sorted by relevance

/llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/
H A Ddefault.pass.cpp79 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
118 char ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
119 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2()
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 Ddefault.pass.cpp80 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
119 char ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
120 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2()
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 Ddefault.pass.cpp80 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
119 char ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
120 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2()
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 Ddefault.pass.cpp81 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
82 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
85 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
120 char ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
121 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2()
124 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
/llvm-project-15.0.7/clang/test/CodeGen/
H A Dunsigned-overflow.c6 unsigned int ii, ij, ik; variable
78 ii = ij + ik; in testintadd()
90 ii = ij - ik; in testintsub()
102 ii = ij * ik; in testintmul()
/llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/
H A Ddefault.pass.cpp80 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
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 Dmake_default_searcher.pass.cpp65 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
66 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
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 Ddefault.pass.cpp80 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
/llvm-project-15.0.7/llvm/test/Transforms/LoopStrengthReduce/AMDGPU/
H A Dlsr-void.ll14 %ij = phi i32 [ 0, %for.body ], [ %inc14, %for.body.i ]
16 %inc13 = or i32 %ij, 2
26 %inc1 = or i32 %ij, 3
35 %inc14 = add nuw nsw i32 %ij, 4
H A Dlsr-void-inseltpoison.ll14 %ij = phi i32 [ 0, %for.body ], [ %inc14, %for.body.i ]
16 %inc13 = or i32 %ij, 2
26 %inc1 = or i32 %ij, 3
35 %inc14 = add nuw nsw i32 %ij, 4
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dsearch.pass.cpp104 int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
105 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test()
108 assert(std::search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk)) == Iter1(ij+6)); in test()
/llvm-project-15.0.7/llvm/test/Transforms/CanonicalizeFreezeInLoops/
H A Dphis.ll64 %ij = add i32 %i, %j
65 %ij.fr = freeze i32 %ij
66 call void @call(i32 %ij.fr)
104 %ij = add i32 %i, %j
105 %ijk = add i32 %ij, %k
/llvm-project-15.0.7/flang/test/Lower/forall/
H A Dforall-2.f9094 integer :: ii, ij local
96 forall (i = ii:ij:8)
/llvm-project-15.0.7/mlir/test/Dialect/Linalg/
H A Dloops.mlir326 %ij = arith.addi %i, %j : index
327 %ijk = arith.addi %ij, %k : index
345 // CHECK: %[[ij:.*]] = arith.addi %[[i]], %[[j]] : index
346 // CHECK: %[[ijk:.*]] = arith.addi %[[ij]], %[[k]] : index
359 // CHECKPARALLEL: %[[ij:.*]] = arith.addi %[[i]], %[[j]] : index
360 // CHECKPARALLEL: %[[ijk:.*]] = arith.addi %[[ij]], %[[k]] : index
440 %ij = arith.addi %i, %j : index
441 %ij_int = arith.index_cast %ij : index to i32
454 // CHECK: %[[ij:.*]] = arith.addi %[[i]], %[[j]] : index
455 // CHECK: %[[ij_int:.*]] = arith.index_cast %[[ij]] : index to i32
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/Affine/
H A Dloop-coalescing.mlir56 // CHECK: %[[ij:.*]] = arith.divsi %[[iv]], %[[k_extent]]
57 // CHECK: %[[j_unshifted:.*]] = arith.remsi %[[ij]], %[[j_extent:.*]]
58 // CHECK: %[[i_unshifted:.*]] = arith.divsi %[[ij]], %[[j_extent]]
/llvm-project-15.0.7/lldb/test/API/functionalities/postmortem/FreeBSDKernel/
H A Dvmcore-arm64-minidump.bz21minidump FreeBSD/arm64�������� ����j������������
/llvm-project-15.0.7/flang/include/flang/Optimizer/Dialect/
H A DFIROps.td1340 // %r_{ij} = %f if (i,j) = (%i,%j), %v_{ij} otherwise
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/misc/ConfusableTable/
H A Dconfusables.txt2427 0133 ; 0069 006A ; MA # ( ij → ij ) LATIN SMALL LIGATURE IJ → LATIN SMALL LETTER I, LATIN SMALL LETT…