/openbsd/gnu/gcc/libgomp/testsuite/libgomp.fortran/ |
H A D | do2.f90 | 31 j = j + 1 44 j = j - 1 57 j = j + 2 70 j = j - 4 83 j = j - 12 100 j = j + 1 113 j = j - 1 126 j = j + 2 139 j = j - 4 169 j = j + 1 [all …]
|
H A D | omp_parse1.f90 | 22 j = 16 68 j = 16 79 do 200 i = 1, j 86 do 201 i = j + 1, 2 * j 106 j = 0 108 if (d(i) .lt. j .or. d(i) .ge. j + k) call abort 118 j = 10 144 j = 271 162 j = 300 174 j = -1 [all …]
|
H A 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 48 j = i + 5 80 if (x .ne. j .or. y .ne. j + 1024 .or. z .ne. j + 4096) & [all …]
|
/openbsd/sbin/iked/ |
H A D | smult_curve25519_ref.c | 16 for (j = 0;j < 31;++j) { u += a[j] + b[j]; out[j] = u & 255; u >>= 8; } in add() 25 for (j = 0;j < 31;++j) { in sub() 39 for (j = 0;j < 31;++j) { u += a[j]; a[j] = u & 255; u >>= 8; } in squeeze() 56 for (j = 0;j < 32;++j) aorig[j] = a[j]; in freeze() 59 for (j = 0;j < 32;++j) a[j] ^= negative & (aorig[j] ^ a[j]); in freeze() 70 for (j = 0;j <= i;++j) u += a[j] * b[i - j]; in mult() 98 for (j = 0;j < i - j;++j) u += a[j] * a[i - j]; in square() 99 for (j = i + 1;j < i + 32 - j;++j) u += 38 * a[j] * a[i + 32 - j]; in square() 145 for (j = 0;j < 32;++j) xzm1[j] = work[j]; in mainloop() 150 for (j = 1;j < 64;++j) xzm[j] = 0; in mainloop() [all …]
|
/openbsd/usr.bin/ssh/ |
H A D | smult_curve25519_ref.c | 16 for (j = 0;j < 31;++j) { u += a[j] + b[j]; out[j] = u & 255; u >>= 8; } in add() 25 for (j = 0;j < 31;++j) { in sub() 39 for (j = 0;j < 31;++j) { u += a[j]; a[j] = u & 255; u >>= 8; } in squeeze() 56 for (j = 0;j < 32;++j) aorig[j] = a[j]; in freeze() 59 for (j = 0;j < 32;++j) a[j] ^= negative & (aorig[j] ^ a[j]); in freeze() 70 for (j = 0;j <= i;++j) u += a[j] * b[i - j]; in mult() 98 for (j = 0;j < i - j;++j) u += a[j] * a[i - j]; in square() 99 for (j = i + 1;j < i + 32 - j;++j) u += 38 * a[j] * a[i + 32 - j]; in square() 145 for (j = 0;j < 32;++j) xzm1[j] = work[j]; in mainloop() 150 for (j = 1;j < 64;++j) xzm[j] = 0; in mainloop() [all …]
|
/openbsd/bin/ksh/ |
H A D | jobs.c | 251 for (j = job_list; j != NULL; j = j->next) { in j_exit() 623 for (j = job_list; j; j = j->next) in waitfor() 799 for (j = job_list; j != NULL; j = j->next) { in j_stopped_running() 825 for (j = job_list; j; j = j->next) in j_njobs() 860 for (; j; j = j->next) { in j_jobs() 888 for (j = job_list; j; j = j->next) { in j_notify() 1146 for (j = job_list; j; j = j->next) in j_sigchld() 1162 for (j = job_list; j != NULL; j = j->next) in j_sigchld() 1429 for (j = job_list; j != NULL; j = j->next) in j_lookup() 1435 for (j = job_list; j != NULL; j = j->next) in j_lookup() [all …]
|
/openbsd/games/rain/ |
H A D | rain.c | 101 for (j = 4; j >= 0; --j) { in main() 113 mvaddch(ypos[j], xpos[j], 'o'); in main() 116 mvaddch(ypos[j], xpos[j], 'O'); in main() 119 mvaddch(ypos[j] - 1, xpos[j], '-'); in main() 120 mvaddstr(ypos[j], xpos[j] - 1, "|.|"); in main() 121 mvaddch(ypos[j] + 1, xpos[j], '-'); in main() 124 mvaddch(ypos[j] - 2, xpos[j], '-'); in main() 126 mvaddstr(ypos[j], xpos[j] - 2, "| O |"); in main() 128 mvaddch(ypos[j] + 2, xpos[j], '-'); in main() 131 mvaddch(ypos[j] - 2, xpos[j], ' '); in main() [all …]
|
/openbsd/gnu/usr.bin/perl/t/op/ |
H A D | splice.t | 13 sub j { join(":",@_) } 16 is( j(@a), j(1..12), '... added two elements'); 19 is( j(@a), j(1..11), '... removed last element'); 22 is( j(@a), j(2..11), '... first element removed'); 28 is( j(@a), j(0..11), '... list remains the same'); 34 is( j(@a), j(1..3), '... array only contains new elements'); 37 is( j(@a), j(1,7,7,3), '... array 1,7,7,3'); 40 is( j(@a), j(1,2,7,3), '... array has 1,2,7,3'); 62 is( j(@a), j(2,1), 'splice and replace with indexes 1, 0'); 66 is( j(@a), j(1,2), 'splice and replace with indexes 0, 1'); [all …]
|
/openbsd/usr.bin/openssl/ |
H A D | speed.c | 943 for (j = 0; j < SIZE_NUM; j++) { in speed_main() 956 for (j = 0; j < SIZE_NUM; j++) { in speed_main() 1427 for (j = 0; j < RSA_NUM; j++) { in speed_main() 1491 for (j++; j < RSA_NUM; j++) in speed_main() 1497 for (j = 0; j < DSA_NUM; j++) { in speed_main() 1566 for (j++; j < DSA_NUM; j++) in speed_main() 1571 for (j = 0; j < EC_NUM; j++) { in speed_main() 1651 for (j++; j < EC_NUM; j++) in speed_main() 1657 for (j = 0; j < EC_NUM; j++) { in speed_main() 1741 for (j++; j < EC_NUM; j++) in speed_main() [all …]
|
/openbsd/gnu/gcc/libgomp/testsuite/libgomp.c/ |
H A 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() 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() 48 for (j = 0; j < n; j++) in bar() 49 v[j] = j + omp_get_thread_num (); in bar() [all …]
|
H A 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() 43 for (j = 0; j < 1000; j++) in main() 51 for (j = 0; j < 1000; j++) in main() 59 for (j = 0; j < 1000; j++) in main() 67 for (j = 0; j < 1000; j++) in main() [all …]
|
/openbsd/usr.sbin/cron/ |
H A D | job.c | 45 job *j; in job_add() local 49 if (j->e == e && j->u == u) { in job_add() 52 j->u->name, j->e->cmd); in job_add() 61 j->e = e; in job_add() 62 j->u = u; in job_add() 75 if (j->e == e && j->u == u) { in job_remove() 80 free(j); in job_remove() 83 prev = j; in job_remove() 99 free(j); in job_exit() 110 job *j; in job_runqueue() local [all …]
|
/openbsd/gnu/usr.bin/gcc/gcc/testsuite/g77.f-torture/execute/ |
H A D | f90-intrinsic-bit.f | 32 j = 0 33 j = not(j) 36 j = ishft(j,-1) 57 j = 7 81 j = 3 97 j = 14 187 call c_i2(ISHFT(j,BIT_SIZE(j)),j3, 189 call c_i2(ISHFT(j,-BIT_SIZE(j)),j3, 343 call c_i2(ISHFTC(j,BIT_SIZE(j),BIT_SIZE(j)),j, 345 call c_i2(ISHFTC(j,0,BIT_SIZE(j)),j, [all …]
|
H A D | f90-intrinsic-numeric.f | 19 j = -9 21 k = j 54 j = 1 76 j = 5 87 j = -8 106 j = 5 116 j = 1 129 j = 1 146 j = 8 178 j = -2 [all …]
|
/openbsd/games/backgammon/teachgammon/ |
H A D | tutor.c | 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() 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() 107 p[j] = test[i].mp[j]; in tutor() 108 g[j] = test[i].mg[j]; in tutor() 112 for (j = 0; j < mvlim; j++) in tutor() [all …]
|
/openbsd/games/cribbage/ |
H A D | support.c | 84 j = -1; in cchose() 91 j = i; in cchose() 102 j = i; in cchose() 104 j = i; in cchose() 128 j = 0; in plyrhand() 160 int j; in comphand() local 164 msg("My %s scores %d", s, (j == 0 ? 19 : j)); in comphand() 252 for (j = i + 1; j < FULLHAND; j++) { in cdiscard() 269 j = 0; in cdiscard() 323 j = 0; in numofval() [all …]
|
/openbsd/gnu/gcc/gcc/ |
H A D | lambda-mat.c | 68 for (j = 0; j < size; j++) in lambda_matrix_id() 79 for (j = 0; j < size; j++) in lambda_matrix_id_p() 115 for (j = 0; j < m; j++) in lambda_matrix_transpose() 158 for (j = 0; j < n; j++) in lambda_matrix_mult() 357 for (j = 0; j < n; j++) in lambda_matrix_inverse_hard() 396 for (j = n - 1; j >= 0; j--) in lambda_matrix_inverse_hard() 451 for (j = 0; j < n; j++) in lambda_matrix_hermite() 498 for (j = 0; j < n; j++) in lambda_matrix_right_hermite() 543 for (j = 0; j < n; j++) in lambda_matrix_left_hermite() 582 for (j = startrow; (j < rowsize) && !found; j++) in lambda_matrix_first_nz_vec() [all …]
|
/openbsd/lib/libcrypto/bn/asm/ |
H A D | x86-mont.pl | 129 &xor ($j,$j); # j=0 167 &lea ($j,&DWP(1,$j)); 189 &xor ($j,$j); # j=0 284 &xor ($j,$j); # j=0 300 &lea ($j,&DWP(1,$j)); 316 &xor ($j,$j); 333 &lea ($j,&DWP(1,$j)); 352 &xor ($j,$j); 370 &lea ($j,&DWP(1,$j)); 400 &xor ($j,$j); [all …]
|
H A D | x86_64-mont.pl | 102 xor $j,$j # j=0 118 lea 1($j),$j # j++ 137 lea 1($j),$j # j++ 164 xor $j,$j # j=0 309 xor $j,$j # j=0 785 lea 16($j),$j 855 lea 32($j),$j 926 lea 16($j),$j 1205 xor $j,$j 1271 lea 32($j),$j [all …]
|
/openbsd/lib/libcurses/tinfo/ |
H A D | db_iterator.c | 302 int j; in _nc_first_db() local 307 for (j = 0; j < dbdLAST; ++j) in _nc_first_db() 348 for (j = 0; j < dbdLAST; ++j) { in _nc_first_db() 357 for (j = 0; j < dbdLAST; ++j) { in _nc_first_db() 365 for (j = 0; my_blob[j] != '\0'; ++j) { in _nc_first_db() 374 for (j = 0; my_blob[j] != '\0'; ++j) { in _nc_first_db() 386 for (j = 0; my_list[j] != 0; ++j) { in _nc_first_db() 400 ++j; in _nc_first_db() 412 for (j = 0; my_list[j] != 0; ++j) { in _nc_first_db() 427 k = j; in _nc_first_db() [all …]
|
/openbsd/libexec/login_yubikey/ |
H A D | yubikey.c | 143 for (j = 4; j < 16; j++) in yubikey_aes_decrypt() 144 round_key[j] ^= round_key[j - 4]; in yubikey_aes_decrypt() 182 for (j = 15; j > 3; j--) in yubikey_aes_decrypt() 183 round_key[j] ^= round_key[j - 4]; in yubikey_aes_decrypt() 192 for (j = 0; j < 16; j++) in yubikey_aes_decrypt() 193 state[j] ^= round_key[j]; in yubikey_aes_decrypt() 197 for (j = 0; j < 16; j += 4) { in yubikey_aes_decrypt() 198 k1 = state[j] ^ state[j + 2]; in yubikey_aes_decrypt() 200 k2 = state[j + 1] ^ state[j + 3]; in yubikey_aes_decrypt() 235 if (j) in yubikey_crc16() [all …]
|
/openbsd/lib/libcrypto/des/ |
H A D | str2key.c | 67 unsigned char j; in DES_string_to_key() local 76 j = str[i]; in DES_string_to_key() 81 j = ((j << 4) & 0xf0)|((j >> 4) & 0x0f); in DES_string_to_key() 82 j = ((j << 2) & 0xcc)|((j >> 2) & 0x33); in DES_string_to_key() 83 j = ((j << 1) & 0xaa)|((j >> 1) & 0x55); in DES_string_to_key() 84 (*key)[7 - (i % 8)] ^= j; in DES_string_to_key() 107 unsigned char j; in DES_string_to_2keys() local 127 j = str[i]; in DES_string_to_2keys() 134 j = ((j << 4) & 0xf0)|((j >> 4) & 0x0f); in DES_string_to_2keys() 135 j = ((j << 2) & 0xcc)|((j >> 2) & 0x33); in DES_string_to_2keys() [all …]
|
/openbsd/regress/lib/libcrypto/x509/ |
H A 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() 395 int j, failure = 0; in test_valid_uri() local 398 for (j = 0; validuri[j] != NULL; j++) { in test_valid_uri() 402 validuri[j]); in test_valid_uri() 423 int i, j; in test_constraints1() local 468 for (j = 0; matching[j] != NULL; j++) { in test_constraints1() 478 for (j = 0; matchinguri[j] != NULL; j++) { in test_constraints1() 489 for (j = 0; failing[j] != NULL; j++) { in test_constraints1() 499 for (j = 0; failinguri[j] != NULL; j++) { in test_constraints1() [all …]
|
/openbsd/usr.bin/yacc/ |
H A D | output.c | 173 int j; in output_rule_data() local 187 ++j; in output_rule_data() 206 j++; in output_rule_data() 228 ++j; in output_yydefred() 285 for (j = 0; j < 2 * ntokens; ++j) in token_actions() 311 for (j = 0; j < ntokens; ++j) { in token_actions() 328 for (j = 0; j < ntokens; ++j) { in token_actions() 365 ++j; in goto_actions() 469 while (j >= 0 && (width[order[j]] < w)) in sort_actions() 559 if (width[j] != w || tally[j] != t) in matching_vector() [all …]
|
/openbsd/lib/libcrypto/sha/asm/ |
H A D | sha1-alpha.pl | 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] 127 addl @X[$j%16],@X[$j%16],@X[$j%16] 142 xor @X[($j+2)%16],@X[$j%16],@X[$j%16] 147 xor @X[($j+8)%16],@X[$j%16],@X[$j%16] 152 xor @X[($j+13)%16],@X[$j%16],@X[$j%16] 157 addl @X[$j%16],@X[$j%16],@X[$j%16] 199 xor @X[($j+2)%16],@X[$j%16],@X[$j%16] 204 xor @X[($j+8)%16],@X[$j%16],@X[$j%16] [all …]
|