| /openbsd/src/gnu/gcc/libgomp/testsuite/libgomp.fortran/ |
| D | do2.f90 | 4 integer :: i, j variable
23 j = 8
30 if (i .ne. j) k = .true.
31 j = j + 1
36 j = 23
43 if (i .ne. j) k = .true.
44 j = j - 1
49 j = 28
56 if (i .ne. j) k = .true.
57 j = j + 2
[all …]
|
| D | omp_parse1.f90 | 10 integer :: a, b, c, e, f, g, i, j local
22 j = 16
35 if (b .eq. 0) j = 24
46 if (j .ne. 24) call abort
64 integer :: i, j, k, l, n local
68 j = 16
79 do 200 i = 1, j
86 do 201 i = j + 1, 2 * j
99 do i = 49, 4 * j
106 j = 0
[all …]
|
| D | omp_parse3.f90 | 15 integer :: i, j local
17 j = 0
20 if (omp_get_thread_num () .eq. 0) j = j + 1
23 if (omp_get_thread_num () .eq. 1) j = j + 2
26 if (omp_get_thread_num () .eq. 2) j = j + 3
30 if (omp_get_thread_num () .eq. 3) j = j + 4
35 integer :: i, j local
44 j = 1
46 if (i .eq. j) then
48 j = i + 5
[all …]
|
| /openbsd/src/usr.bin/ssh/ |
| D | smult_curve25519_ref.c | 13 unsigned int j; in add() local
16 for (j = 0;j < 31;++j) { u += a[j] + b[j]; out[j] = u & 255; u >>= 8; } in add()
22 unsigned int j; in sub() local
25 for (j = 0;j < 31;++j) { in sub()
26 u += a[j] + 65280 - b[j]; in sub()
27 out[j] = u & 255; in sub()
36 unsigned int j; in squeeze() local
39 for (j = 0;j < 31;++j) { u += a[j]; a[j] = u & 255; u >>= 8; } in squeeze()
42 for (j = 0;j < 31;++j) { u += a[j]; a[j] = u & 255; u >>= 8; } in squeeze()
53 unsigned int j; in freeze() local
[all …]
|
| /openbsd/src/sbin/iked/ |
| D | smult_curve25519_ref.c | 13 unsigned int j; in add() local
16 for (j = 0;j < 31;++j) { u += a[j] + b[j]; out[j] = u & 255; u >>= 8; } in add()
22 unsigned int j; in sub() local
25 for (j = 0;j < 31;++j) { in sub()
26 u += a[j] + 65280 - b[j]; in sub()
27 out[j] = u & 255; in sub()
36 unsigned int j; in squeeze() local
39 for (j = 0;j < 31;++j) { u += a[j]; a[j] = u & 255; u >>= 8; } in squeeze()
42 for (j = 0;j < 31;++j) { u += a[j]; a[j] = u & 255; u >>= 8; } in squeeze()
53 unsigned int j; in freeze() local
[all …]
|
| /openbsd/src/bin/ksh/ |
| D | jobs.c | 248 Job *j; in j_exit() local
251 for (j = job_list; j != NULL; j = j->next) { in j_exit()
252 if (j->ppid == procpid && in j_exit()
253 (j->state == PSTOPPED || in j_exit()
254 (j->state == PRUNNING && in j_exit()
255 ((j->flags & JF_FG) || in j_exit()
258 if (j->pgrp == 0) in j_exit()
259 kill_job(j, SIGHUP); in j_exit()
261 killpg(j->pgrp, SIGHUP); in j_exit()
262 if (j->state == PSTOPPED) { in j_exit()
[all …]
|
| /openbsd/src/games/rain/ |
| D | rain.c | 52 int x, y, j; in main() local
101 for (j = 4; j >= 0; --j) { in main()
102 xpos[j] = arc4random_uniform(tcols) + 2; in main()
103 ypos[j] = arc4random_uniform(tlines) + 2; in main()
105 for (j = 0;;) { in main()
113 mvaddch(ypos[j], xpos[j], 'o'); in main()
114 if (!j--) in main()
115 j = 4; in main()
116 mvaddch(ypos[j], xpos[j], 'O'); in main()
117 if (!j--) in main()
[all …]
|
| /openbsd/src/gnu/usr.bin/perl/t/op/ |
| D | splice.t | 13 sub j { join(":",@_) }
15 is( j(splice(@a,@a,0,11,12)), '', 'return value of splice when nothing is removed, only added');
16 is( j(@a), j(1..12), '... added two elements');
18 is( j(splice(@a,-1)), "12", 'remove last element, return value');
19 is( j(@a), j(1..11), '... removed last element');
21 is( j(splice(@a,0,1)), "1", 'remove first element, return value');
22 is( j(@a), j(2..11), '... first element removed');
24 is( j(splice(@a,0,0,0,1)), "", 'emulate shift, return value is empty');
25 is( j(@a), j(0..11), '... added two elements to beginning of the list');
27 is( j(splice(@a,5,1,5)), "5", 'remove and replace an element to the end of the list, return value i…
[all …]
|
| /openbsd/src/usr.bin/openssl/ |
| D | speed.c | 941 int i, j, k; in speed_main() local
1180 j = 0; in speed_main()
1186 j--; /* Otherwise, -elapsed gets confused with an in speed_main()
1206 j--; /* Otherwise, -decrypt gets confused with an in speed_main()
1220 j--; /* Otherwise, -multi gets confused with an in speed_main()
1237 j--; /* Otherwise, -unaligned gets confused with an in speed_main()
1241 j--; /* Otherwise, -mr gets confused with an in speed_main()
1331 j--; in speed_main()
1551 j++; in speed_main()
1557 if (j == 0) { in speed_main()
[all …]
|
| /openbsd/src/gnu/gcc/libgomp/testsuite/libgomp.c/ |
| D | ordered-3.c | 15 int j; in main() local
19 for (j = 0; j < 1000; j++) in main()
22 check (j); in main()
27 for (j = 0; j < 1000; j++) in main()
30 check (j); in main()
35 for (j = 0; j < 1000; j++) in main()
38 check (j); in main()
43 for (j = 0; j < 1000; j++) in main()
46 check (j); in main()
51 for (j = 0; j < 1000; j++) in main()
[all …]
|
| D | pr30494.c | 11 int j; in check() local
13 for (j = 0; j < m; j++) in check()
14 if (v[j] != j + n) in check()
17 for (j = 0; j < m * 3 + i; j++) in check()
18 if (w[j] != j + 10 + n) in check()
30 int v[n], w[n * 3 + i], j; in foo() local
31 for (j = 0; j < n; j++) in foo()
32 v[j] = j + omp_get_thread_num (); in foo()
33 for (j = 0; j < n * 3 + i; j++) in foo()
34 w[j] = j + 10 + omp_get_thread_num (); in foo()
[all …]
|
| /openbsd/src/usr.sbin/cron/ |
| D | job.c | 45 job *j; in job_add() local
48 SIMPLEQ_FOREACH(j, &jobs, entries) { in job_add()
49 if (j->e == e && j->u == u) { in job_add()
50 if ((j->e->flags & DONT_LOG) == 0) { in job_add()
52 j->u->name, j->e->cmd); in job_add()
59 if ((j = malloc(sizeof(job))) == NULL) in job_add()
61 j->e = e; in job_add()
62 j->u = u; in job_add()
63 j->pid = -1; in job_add()
66 SIMPLEQ_INSERT_TAIL(&jobs, j, entries); in job_add()
[all …]
|
| /openbsd/src/gnu/usr.bin/gcc/gcc/testsuite/g77.f-torture/execute/ |
| D | f90-intrinsic-bit.f | 14 integer*2 j, j2, j3, ja
32 j = 0
33 j = not(j)
34 do while ( (j.ne.0) .and. (ja.lt.127) )
36 j = ishft(j,-1)
38 call c_i2(BIT_SIZE(j),ja,'BIT_SIZE(integer*2)')
57 j = 7
67 call c_l(BTEST(j,3),.true.,'BTEST(integer*2,integer)')
68 call c_l(BTEST(j,j2),.true.,'BTEST(integer*2,integer*2)')
69 call c_l(BTEST(j,k2),.true.,'BTEST(integer*2,integer*1)')
[all …]
|
| D | f90-intrinsic-numeric.f | 12 integer*2 j, j2, ja
19 j = -9
21 k = j
24 call c_i2(ABS(j),ja,'ABS(integer*2)')
54 j = 1
60 call c_c(CMPLX(j),(1.,0.),'CMPLX(integer*2)')
61 call c_c(CMPLX(j,ja),(1.,2.),'CMPLX(integer*2, integer*2)')
76 j = 5
79 call c_d(DBLE(j),5.0d0,'DBLE(integer*2)')
87 j = -8
[all …]
|
| /openbsd/src/games/cribbage/ |
| D | support.c | 51 int i, j, l; in cchose() local
56 if ((j = anysumto(h, n, s, 4)) >= 0) in cchose()
57 return (j); in cchose()
58 if ((j = anysumto(h, n, s, 3)) >= 0 && s == 0) in cchose()
59 return (j); in cchose()
64 if ((j = anysumto(h, n, s, 21 - i)) >= 0) { in cchose()
66 if (l > 1 || VAL(h[j].rank) != i) in cchose()
67 return (j); in cchose()
75 if ((j = anysumto(h, n, s, tv[i])) >= 0) { in cchose()
78 VAL(h[j].rank) != 15 - tv[i]) in cchose()
[all …]
|
| /openbsd/src/games/backgammon/teachgammon/ |
| D | tutor.c | 40 int i, j, k; in tutor() local
68 for (j = 19; j < 26; j++) in tutor()
69 k += (board[j] > 0 ? board[j] : 0); in tutor()
71 for (j = 0; j < 19; j++) in tutor()
72 k += (board[j] > 0 ? board[j] : 0); in tutor()
82 getyx(stdscr, j, k); in tutor()
83 if (j == 19) { in tutor()
87 move(j > 19 ? j - 2 : j + 4, 25); in tutor()
104 for (j = 0; j < 4; j++) { in tutor()
105 if (test[i].mp[j] == test[i].mg[j]) in tutor()
[all …]
|
| /openbsd/src/gnu/gcc/gcc/ |
| D | lambda-mat.c | 65 int i, j; in lambda_matrix_id() local
68 for (j = 0; j < size; j++) in lambda_matrix_id()
69 mat[i][j] = (i == j) ? 1 : 0; in lambda_matrix_id()
77 int i, j; in lambda_matrix_id_p() local
79 for (j = 0; j < size; j++) in lambda_matrix_id_p()
81 if (i == j) in lambda_matrix_id_p()
83 if (mat[i][j] != 1) in lambda_matrix_id_p()
88 if (mat[i][j] != 0) in lambda_matrix_id_p()
112 int i, j; in lambda_matrix_transpose() local
115 for (j = 0; j < m; j++) in lambda_matrix_transpose()
[all …]
|
| /openbsd/src/lib/libcrypto/bn/asm/ |
| D | x86-mont.pl | 43 $j="ecx";
129 &xor ($j,$j); # j=0
151 &inc ($j); # j++
160 &movd ($acc1,&DWP(4,$np,$j,4)); # np[j+1]
162 &movd ($acc0,&DWP(4,$ap,$j,4)); # ap[j+1]
164 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[j-1]=
167 &lea ($j,&DWP(1,$j));
168 &cmp ($j,$num);
179 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[num-2]=
189 &xor ($j,$j); # j=0
[all …]
|
| D | x86_64-mont.pl | 55 $j="%r15";
102 xor $j,$j # j=0
118 lea 1($j),$j # j++
124 mov ($ap,$j,8),%rax
129 mov $hi1,-16(%rsp,$j,8) # tp[j-1]
135 mov ($np,$j,8),%rax
137 lea 1($j),$j # j++
141 cmp $num,$j
149 mov $hi1,-16(%rsp,$j,8) # tp[j-1]
164 xor $j,$j # j=0
[all …]
|
| /openbsd/src/lib/libcurses/tinfo/ |
| D | db_iterator.c | 302 int j; in _nc_first_db() local
307 for (j = 0; j < dbdLAST; ++j) in _nc_first_db()
308 values[j] = 0; in _nc_first_db()
348 for (j = 0; j < dbdLAST; ++j) { in _nc_first_db()
349 if (values[j] == 0) in _nc_first_db()
350 values[j] = ""; in _nc_first_db()
351 blobsize += 2 + strlen(values[j]); in _nc_first_db()
357 for (j = 0; j < dbdLAST; ++j) { in _nc_first_db()
358 add_to_blob(values[j], blobsize); in _nc_first_db()
365 for (j = 0; my_blob[j] != '\0'; ++j) { in _nc_first_db()
[all …]
|
| /openbsd/src/libexec/login_yubikey/ |
| D | yubikey.c | 129 uint8_t i, j, round_key[0x10]; in yubikey_aes_decrypt() local
143 for (j = 4; j < 16; j++) in yubikey_aes_decrypt()
144 round_key[j] ^= round_key[j - 4]; in yubikey_aes_decrypt()
159 j = state[13]; in yubikey_aes_decrypt()
163 state[1] = rijndael_inv_sbox[j]; in yubikey_aes_decrypt()
166 j = state[2]; in yubikey_aes_decrypt()
168 state[10] = rijndael_inv_sbox[j]; in yubikey_aes_decrypt()
169 j = state[6]; in yubikey_aes_decrypt()
171 state[14] = rijndael_inv_sbox[j]; in yubikey_aes_decrypt()
174 j = state[3]; in yubikey_aes_decrypt()
[all …]
|
| /openbsd/src/usr.bin/yacc/ |
| D | output.c | 173 int j; in output_rule_data() local
179 j = 10; in output_rule_data()
181 if (j >= 10) { in output_rule_data()
185 j = 1; in output_rule_data()
187 ++j; in output_rule_data()
198 j = 10; in output_rule_data()
200 if (j >= 10) { in output_rule_data()
204 j = 1; in output_rule_data()
206 j++; in output_rule_data()
218 int i, j; in output_yydefred() local
[all …]
|
| /openbsd/src/regress/lib/libcrypto/x509/ |
| D | constraints.c | 373 int j, failure = 0; in test_invalid_uri() local
376 for (j = 0; invaliduri[j] != NULL; j++) { in test_invalid_uri()
377 if (x509_constraints_uri_host(invaliduri[j], in test_invalid_uri()
378 strlen(invaliduri[j]), &hostpart) != 0) { in test_invalid_uri()
380 invaliduri[j]); in test_invalid_uri()
395 int j, failure = 0; in test_valid_uri() local
398 for (j = 0; validuri[j] != NULL; j++) { in test_valid_uri()
399 if (x509_constraints_uri_host(validuri[j], in test_valid_uri()
400 strlen(invaliduri[j]), &hostpart) == 0) { in test_valid_uri()
402 validuri[j]); in test_valid_uri()
[all …]
|
| /openbsd/src/lib/libcrypto/sha/asm/ |
| D | sha1-alpha.pl | 35 my $j=$i+1;
109 xor @X[($j+2)%16],@X[$j%16],@X[$j%16]
114 xor @X[($j+8)%16],@X[$j%16],@X[$j%16]
119 xor @X[($j+13)%16],@X[$j%16],@X[$j%16]
123 srl @X[$j%16],31,$t1
127 addl @X[$j%16],@X[$j%16],@X[$j%16]
131 or $t1,@X[$j%16],@X[$j%16]
137 my $j=$i+1;
142 xor @X[($j+2)%16],@X[$j%16],@X[$j%16]
147 xor @X[($j+8)%16],@X[$j%16],@X[$j%16]
[all …]
|
| /openbsd/src/regress/lib/libcrypto/bio/ |
| D | bio_chain.c | 89 size_t i, j; in bio_chain_pop_test() local
109 for (j = 0; j < nitems(bio); j++) { in bio_chain_pop_test()
110 if (j > 0) { in bio_chain_pop_test()
111 if (BIO_prev(bio[j]) != bio[j - 1]) { in bio_chain_pop_test()
114 i, j, j - 1); in bio_chain_pop_test()
118 if (j < nitems(bio) - 1) { in bio_chain_pop_test()
119 if (BIO_next(bio[j]) != bio[j + 1]) { in bio_chain_pop_test()
122 i, j, j + 1); in bio_chain_pop_test()
157 j = 2; in bio_chain_pop_test()
160 j = 1; in bio_chain_pop_test()
[all …]
|