| /external/llvm-project/polly/test/ScheduleOptimizer/ |
| D | pattern-matching-based-opts_5.ll | 42 ; CHECK-NEXT: for (int c0 = 0; c0 <= floord(nj - 1, 2048); c0 += 1)
44 ; CHECK-NEXT: for (int c3 = 2048 * c0; c3 <= min(nj - 1, 2048 * c0 + 2047); c3 += 1)
56 ; CHECK-NEXT: for (int c3 = 0; c3 <= min(255, -256 * c0 + nj / 8 - 1); c3 += 1…
170 … if (96 * c2 + 3 >= ni || 2048 * c0 + 7 >= nj || (2048 * c0 + 2047 >= nj && nj % 8…
171 ; CHECK-NEXT: if (2048 * c0 + 7 >= nj) {
178 ; CHECK-NEXT: if (nj >= 2048 * c0 + 2) {
180 ; CHECK-NEXT: if (nj >= 2048 * c0 + 3) {
182 ; CHECK-NEXT: if (nj >= 2048 * c0 + 4) {
184 ; CHECK-NEXT: if (nj >= 2048 * c0 + 5) {
186 ; CHECK-NEXT: if (nj >= 2048 * c0 + 6) {
[all …]
|
| D | full_partial_tile_separation.ll | 7 ; CHECK-NEXT: for (int c1 = 0; c1 <= floord(nj - 1, 32); c1 += 1)
12 ; CHECK-NEXT: for (int c4 = 0; c4 <= min(7, -8 * c1 + nj / 4 - 1); c4 += 1)
20 ; CHECK-NEXT: if (32 * c1 + 31 >= nj)
25 ; CHECK-NEXT: for (int c6 = 0; c6 < nj % 4; c6 += 1)
26 ; CHECK-NEXT: Stmt_for_body_6(32 * c0 + c3, -(nj % 4) + nj + c6, 32 * c2 + c5);
32 define void @kernel_gemm(i32 %ni, i32 %nj, i32 %nk, double %alpha, double %beta, [1024 x double]* %…
42 %cmp2.25 = icmp sgt i32 %nj, 0
78 %exitcond32 = icmp ne i32 %lftr.wideiv31, %nj
|
| /external/llvm-project/polly/lib/External/isl/test_inputs/codegen/ |
| D | hoist.c | 1 if (ni >= t0 + 1 && nj >= t1 + 1)
4 if (nj >= t1 + 17) {
6 if (nj >= t1 + 33) {
8 if (nj >= t1 + 49)
14 if (nj >= t1 + 17) {
16 if (nj >= t1 + 33) {
18 if (nj >= t1 + 49)
24 if (nj >= t1 + 17) {
26 if (nj >= t1 + 33) {
28 if (nj >= t1 + 49)
[all …]
|
| D | gemm.st | 1 …in: "[ni, nj, nk] -> { S_4[i, j, k] : k <= -1 + nk and k >= 0 and j <= -1 + nj and j >= 0 and i <=…
4 - filter: "[ni, nj, nk] -> { S_4[i, j, k]; S_2[i, j] }"
6 …schedule: "[ni, nj, nk] -> [{ S_4[i, j, k] -> [(i)]; S_2[i, j] -> [(i)] }, { S_4[i, j, k] -> [(j)]…
11 - filter: "[ni, nj, nk] -> { S_2[i, j] }"
12 - filter: "[ni, nj, nk] -> { S_4[i, j, k] }"
|
| D | hoist.in | 1 # check that the shared conditions ni >= t0 + 1 and nj >= t1 + 1
3 [ni, nj, nk, t0, t1] -> { S_1[i, j, k] -> [t0, t1, k, i, j] :
6 j <= -1 + nj and i >= 0 and i <= -1 + ni and k <= -1 + nk and
7 ni >= 1 and nj >= 1 and nk >= 1 and j <= 63 and t1 >= 0 and
|
| D | gemm.c | 2 for (int c1 = 0; c1 < nj; c1 += 1) {
|
| /external/icu/icu4c/source/data/rbnf/ |
| D | sq.txt | 16 "1: nj\u00EB;",
27 "20: nj\u00EBzet[ e >>];",
33 "1000000: nj\u00EB milion[ e >>];",
35 "1000000000: nj\u00EB miliar[ e >>];",
37 "1000000000000: nj\u00EB bilion[ e >>];",
39 "1000000000000000: nj\u00EB biliar[ e >>];",
46 "1: nj\u00EB;",
50 "20: nj\u00EBzet[ e >>];",
56 "1000000: nj\u00EB milion[ e >>];",
58 "1000000000: nj\u00EB miliar[ e >>];",
[all …]
|
| /external/llvm-project/polly/test/FlattenSchedule/ |
| D | gemm.ll | 5 ; C[ni][nj]
7 ; B[nk][nj]
11 define void @gemm(i32 %ni, i32 %nj, i32 %nk, double %alpha, double %beta, double* noalias nonnull %…
18 br i1 %i.cmp, label %nj.for, label %ni.exit
20 nj.for:
21 %j = phi i32 [0, %ni.for], [%j.inc, %nj.inc]
23 br i1 %j.cmp, label %nj_beta, label %nj.exit
26 %c_stride = mul nsw i32 %i, 3; %nj
47 %b_stride = mul nsw i32 %k, 3; %nj
70 br label %nj.inc
[all …]
|
| /external/OpenCL-CTS/test_conformance/subgroups/ |
| D | test_ifp.cpp | 235 int nj = (nw + ns - 1) / ns; in gen() local
239 if (nj == 1) return; in gen()
243 gen_insts(x, t, nj); in gen()
244 x += nj * (NUM_LOC + 1); in gen()
255 int nj = (nw + ns - 1) / ns; in chk() local
259 if (nj == 1) return 0; in chk()
265 run_insts(x, t, nj); in chk()
276 x += nj * (NUM_LOC + 1); in chk()
|
| D | test_subgroup_non_uniform_vote.cpp | 32 int nj = (nw + ns - 1) / ns; in gen() local
56 set_last_workgroup_params(non_uniform_size, nj, ns, nw, in gen()
59 for (j = 0; j < nj; ++j) in gen()
62 if (last_subgroup_size && j == nj - 1) in gen()
103 int nj = (nw + ns - 1) / ns; in chk() local
114 set_last_workgroup_params(non_uniform_size, nj, ns, nw, in chk()
123 for (j = 0; j < nj; ++j) in chk()
126 if (last_subgroup_size && j == nj - 1) in chk()
|
| D | subgroup_common_templates.h | 75 int nj = (nw + ns - 1) / ns; in gen() local
93 set_last_workgroup_params(non_uniform_size, nj, ns, nw, in gen()
96 for (j = 0; j < nj; ++j) in gen()
99 if (last_subgroup_size && j == nj - 1) in gen()
117 if (last_subgroup_size && j == nj - 1 in gen()
182 int nj = (nw + ns - 1) / ns; in chk() local
193 set_last_workgroup_params(non_uniform_size, nj, ns, nw, in chk()
202 for (j = 0; j < nj; ++j) in chk()
205 if (last_subgroup_size && j == nj - 1) in chk()
398 int nj = (nw + ns - 1) / ns; in genrand() local
[all …]
|
| D | test_barrier.cpp | 69 int nj = (nw + ns - 1) / ns; in gen() local
76 for (j = 0; j < nj; ++j) in gen()
102 int nj = (nw + ns - 1) / ns; in chk() local
120 for (j = 0; j < nj; ++j) in chk()
|
| D | test_subgroup.cpp | 34 int nj = (nw + ns - 1) / ns; in gen() local
41 for (j = 0; j < nj; ++j) in gen()
78 int nj = (nw + ns - 1) / ns; in chk() local
91 for (j = 0; j < nj; ++j) in chk()
|
| /external/llvm-project/polly/test/ScopInfo/ |
| D | multidim_fortran_2d_params.ll | 5 ; subroutine init_array(ni, nj, pi, pj, a)
8 ; double precision, dimension(nj, ni) :: a
9 ; integer*8 :: ni, nj
14 ; do j = 1, nj
29 define void @blam(i64* noalias %arg, i64* noalias %nj, i64* noalias %arg2, i64* noalias %arg3, [0 x…
34 %nj_loaded = load i64, i64* %nj, align 8
47 %nj_loaded2 = load i64, i64* %nj, align 8
|
| D | multidim_fortran_2d.ll | 4 ; subroutine init_array(ni, nj, pi, pj, a)
7 ; double precision, dimension(nj, ni) :: a
8 ; integer*8 :: ni, nj
13 ; do j = 1, nj
|
| /external/icu/icu4c/source/data/unit/ |
| D | yo_BJ.txt | 121 dnam{"àmì shíbí oúnjɛ́ kékeré"}
122 other{"{0} àmì shíbí oúnjɛ́ kékeré"}
125 dnam{"shíbí oúnjɛ kékeré"}
126 other{"{0} àmì oúnjɛ kékeré"}
237 dnam{"shíbí oúnjɛ́ kékeré"}
238 other{"{0} shíbí oúnjɛ́ kékeré"}
241 dnam{"àmì oúnjɛ kékeré"}
242 other{"{0} àmì oúnjɛ kékeré"}
|
| D | yo.txt | 137 dnam{"àmì ṣíbí oúnjẹ́ kékeré"}
138 other{"{0} àmì ṣíbí oúnjẹ́ kékeré"}
141 dnam{"ṣíbí oúnjẹ kékeré"}
142 other{"{0} àmì oúnjẹ kékeré"}
317 dnam{"ṣíbí oúnjẹ́ kékeré"}
318 other{"{0} ṣíbí oúnjẹ́ kékeré"}
321 dnam{"àmì oúnjẹ kékeré"}
322 other{"{0} àmì oúnjẹ kékeré"}
|
| /external/boringssl/src/crypto/fipsmodule/bn/asm/ |
| D | armv4-mont.pl | 80 $nj="r6";
166 ldr $nj,[$np],#4 @ np[0],np++
174 umlal $alo,$nlo,$nj,$n0 @ np[0]*n0+"t[0]"
180 ldr $nj,[$np],#4 @ np[j],np++
184 umlal $nlo,$nhi,$nj,$n0 @ np[j]*n0
207 ldr $nj,[$np,#-4] @ np[0]
215 umlal $alo,$nlo,$nj,$n0 @ np[0]*n0+"tp[0]"
221 ldr $nj,[$np],#4 @ np[j],np++
225 umlal $nlo,$nhi,$nj,$n0 @ np[j]*n0
262 ldr $nj,[$np],#4
[all …]
|
| D | armv8-mont.pl | 55 $lo1,$hi1,$nj,$m1,$nlo,$nhi,
93 ldp $hi1,$nj,[$np],#16 // np[0..1]
106 mul $nlo,$nj,$m1 // np[1]*m1
118 umulh $nhi,$nj,$m1
128 ldr $nj,[$np],#8
135 mul $nlo,$nj,$m1 // np[j]*m1
137 umulh $nhi,$nj,$m1
166 ldp $hi1,$nj,[$np],#16
177 mul $nlo,$nj,$m1 // np[1]*m1
180 umulh $nhi,$nj,$m1
[all …]
|
| /external/rust/crates/ring/crypto/fipsmodule/bn/asm/ |
| D | armv4-mont.pl | 80 $nj="r6";
168 ldr $nj,[$np],#4 @ np[0],np++
176 umlal $alo,$nlo,$nj,$n0 @ np[0]*n0+"t[0]"
182 ldr $nj,[$np],#4 @ np[j],np++
186 umlal $nlo,$nhi,$nj,$n0 @ np[j]*n0
209 ldr $nj,[$np,#-4] @ np[0]
217 umlal $alo,$nlo,$nj,$n0 @ np[0]*n0+"tp[0]"
223 ldr $nj,[$np],#4 @ np[j],np++
227 umlal $nlo,$nhi,$nj,$n0 @ np[j]*n0
264 ldr $nj,[$np],#4
[all …]
|
| D | armv8-mont.pl | 55 $lo1,$hi1,$nj,$m1,$nlo,$nhi,
93 ldp $hi1,$nj,[$np],#16 // np[0..1]
106 mul $nlo,$nj,$m1 // np[1]*m1
118 umulh $nhi,$nj,$m1
128 ldr $nj,[$np],#8
135 mul $nlo,$nj,$m1 // np[j]*m1
137 umulh $nhi,$nj,$m1
166 ldp $hi1,$nj,[$np],#16
177 mul $nlo,$nj,$m1 // np[1]*m1
180 umulh $nhi,$nj,$m1
[all …]
|
| /external/llvm-project/polly/test/Isl/CodeGen/OpenMP/ |
| D | two-parallel-loops-reference-outer-indvar.ll | 10 ; AST: for (int c0 = 1; c0 < -p_0 + nj - 1; c0 += 1)
18 define void @foo(i64 %nj, [512 x double]* %R) {
32 %cmp34 = icmp slt i64 %j.0, %nj
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/common/src/internal/ |
| D | ThreadSafeHeap.kt | 153 val nj = a[i]!! in swap() constant
155 a[j] = nj in swap()
157 nj.index = j in swap()
|
| /external/icu/icu4c/source/data/locales/ |
| D | nnh.txt | 166 "saŋ njÿoláʼ",
180 "saŋ njÿoláʼ",
196 "saŋ njÿoláʼ",
210 "saŋ njÿoláʼ",
|
| /external/icu/icu4c/source/test/testdata/ |
| D | ConverterSelectorTestUTF8.txt | 69 Unicode siguron një numër të vetëm për çdo gërmë,
74 …një numër (kod). Para zbulimit të Unicode-s, kishte qindra sisteme kodimi të ndryshëm për të caktu…
76 …e njëri-tjetrin. Dmth, dy kodime mundet që të përdorin të njëjtin numër për dy shënja krejt të ndr…
79 Unicode siguron një numër të vetëm për çdo gërmë, për cilëndo platformë, për cilindo program, për c…
81 …e përdorimin e kodimeve të mëparshme. Unicode bën të mundur që një produkt softuer ose një faqe in…
|