Home
last modified time | relevance | path

Searched refs:j (Results 1 – 25 of 2042) sorted by relevance

12345678910>>...82

/dragonfly/crypto/openssh/
H A Dsmult_curve25519_ref.c16 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 …]
/dragonfly/lib/libc/db/test/hash.tests/
H A Dtestit10 foreach j ( 11 14 21 )
14 foreach j ( 21 28 43 )
18 foreach j ( 43 57 85 )
36 echo "$i"_"$j"
45 echo "$i"_"$j"
54 echo "$i"_"$j"
63 echo "$i"_"$j"
72 echo "$i"_"$j"
81 echo "$i"_"$j"
113 echo "$i"_"$j"
[all …]
/dragonfly/games/rain/
H A Drain.c86 for (j = 4; j >= 0; --j) { in main()
98 mvaddch(ypos[j], xpos[j], 'o'); in main()
101 mvaddch(ypos[j], xpos[j], 'O'); in main()
104 mvaddch(ypos[j] - 1, xpos[j], '-'); in main()
105 mvaddstr(ypos[j], xpos[j] - 1, "|.|"); in main()
106 mvaddch(ypos[j] + 1, xpos[j], '-'); in main()
109 mvaddch(ypos[j] - 2, xpos[j], '-'); in main()
111 mvaddstr(ypos[j], xpos[j] - 2, "| O |"); in main()
113 mvaddch(ypos[j] + 2, xpos[j], '-'); in main()
116 mvaddch(ypos[j] - 2, xpos[j], ' '); in main()
[all …]
/dragonfly/crypto/libressl/apps/openssl/
H A Dspeed.c1025 for (j = 0; j < SIZE_NUM; j++) { in speed_main()
1038 for (j = 0; j < SIZE_NUM; j++) { in speed_main()
1509 for (j = 0; j < RSA_NUM; j++) { in speed_main()
1573 for (j++; j < RSA_NUM; j++) in speed_main()
1579 for (j = 0; j < DSA_NUM; j++) { in speed_main()
1648 for (j++; j < DSA_NUM; j++) in speed_main()
1653 for (j = 0; j < EC_NUM; j++) { in speed_main()
1733 for (j++; j < EC_NUM; j++) in speed_main()
1739 for (j = 0; j < EC_NUM; j++) { in speed_main()
1823 for (j++; j < EC_NUM; j++) in speed_main()
[all …]
/dragonfly/contrib/ncurses/ncurses/trace/
H A Dlib_tracedmp.c58 for (j = 0; j <= win->_maxx; ++j) { in NCURSES_EXPORT()
62 n = j; in NCURSES_EXPORT()
87 for (j = 0; j < width; ++j) { in NCURSES_EXPORT()
99 ep[j] = '\0'; in NCURSES_EXPORT()
109 for (j = 0; j < width; ++j) in NCURSES_EXPORT()
116 for (j = 0; j < width; ++j) { in NCURSES_EXPORT()
132 for (j = 0; j < width; ++j) in NCURSES_EXPORT()
139 for (j = 0; j < width; ++j) { in NCURSES_EXPORT()
162 for (j = 0; j < width; ++j) in NCURSES_EXPORT()
169 for (j = 0; j < width; ++j) in NCURSES_EXPORT()
[all …]
/dragonfly/games/backgammon/common_source/
H A Dboard.c59 for (j = 1; j < 50; j += 4) { in wrboard()
60 k = j / 4 + (j > 24 ? 12 : 13); in wrboard()
64 j += 4; in wrboard()
69 for (j = 1; j < 50; j += 4) { in wrboard()
70 k = j / 4 + (j > 24 ? 12 : 13); in wrboard()
73 j += 4; in wrboard()
105 for (j = 1; j < 50; j += 4) { in wrboard()
106 k = ((j > 24 ? 53 : 49) - j) / 4; in wrboard()
135 for (j = 1; j < 50; j += 4) { in wrboard()
136 k = ((j > 24 ? 53 : 49) - j) / 4; in wrboard()
[all …]
H A Dodds.c38 int i, j; in odds() local
42 for (j = 0; j < 6; j++) in odds()
43 table[i][j] = 0; in odds()
63 int j; in count() local
68 for (j = 0; j < 6; j++) in count()
69 total += table[i][j]; in count()
76 int j, k, b; in canhit() local
90 for (j = b; j != i; j += a) { in canhit()
91 if (board[j] * a > 0) { in canhit()
92 diff = abs(j - i); in canhit()
[all …]
/dragonfly/games/cribbage/
H A Dsupport.c91 j = -1; in cchose()
98 j = i; in cchose()
109 j = i; in cchose()
111 j = i; in cchose()
133 j = 0; in plyrhand()
159 int j; in comphand() local
163 msg("My %s scores %d", s, (j == 0 ? 19 : j)); in comphand()
251 for (j = i + 1; j < FULLHAND; j++) { in cdiscard()
268 j = 0; in cdiscard()
322 j = 0; in numofval()
[all …]
/dragonfly/contrib/grep/lib/
H A Dstr-two-way.h137 j = 0; in critical_factorization()
146 j += k; in critical_factorization()
157 j += p; in critical_factorization()
172 j = 0; in critical_factorization()
181 j += k; in critical_factorization()
192 j += p; in critical_factorization()
256 j = 0; in two_way_short_needle()
290 j = 0; in two_way_short_needle()
361 j = 0; in two_way_long_needle()
377 j += shift; in two_way_long_needle()
[all …]
/dragonfly/contrib/gdb-7/gdb/gnulib/import/
H A Dstr-two-way.h137 j = 0; in critical_factorization()
146 j += k; in critical_factorization()
157 j += p; in critical_factorization()
172 j = 0; in critical_factorization()
181 j += k; in critical_factorization()
192 j += p; in critical_factorization()
256 j = 0; in two_way_short_needle()
290 j = 0; in two_way_short_needle()
361 j = 0; in two_way_long_needle()
377 j += shift; in two_way_long_needle()
[all …]
/dragonfly/games/larn/
H A Dcreate.c73 for (j = 0; j < MAXX; j++) in newcavelevel()
74 know[j][i] = mitem[j][i] = 0; in newcavelevel()
90 for (j = 0; j < MAXY; j++) in newcavelevel()
118 for (j = 0; j < MAXX; j++) in makemaze()
145 for (j = myl; j < myh; j++) { in makemaze()
247 for (j = 0; j < MAXX; j++) { in cannedlevel()
330 for (j = ty - 1; j <= ty + ysize; j++) in troom()
333 for (j = ty; j < ty + ysize; j++) in troom()
338 for (j = ty + 1; j < ty + ysize - 1; j++) in troom()
400 if ((j > 1) && (j != MAXLEVEL)) in makeobject()
[all …]
H A Dmain.c315 for (j = 0; j <= k; j++) in qshowstr()
384 for (j = 0; j <= 26; j++) in showwear()
437 for (j = 0; j <= 26; j++) in showwield()
472 for (count = 2, j = 0; j <= 26; j++) in showread()
481 for (j = 0; j <= 26; j++) in showread()
504 for (count = 2, j = 0; j <= 26; j++) in showeat()
512 for (j = 0; j <= 26; j++) in showeat()
534 for (count = 2, j = 0; j <= 26; j++) in showquaff()
542 for (j = 0; j <= 26; j++) in showquaff()
768 for (j = playery - 1; j < playery + 2; j++) { in parse()
[all …]
/dragonfly/contrib/ncurses/ncurses/tinfo/
H A Ddb_iterator.c292 int j; in _nc_first_db() local
297 for (j = 0; j < dbdLAST; ++j) in _nc_first_db()
338 for (j = 0; j < dbdLAST; ++j) { in _nc_first_db()
347 for (j = 0; j < dbdLAST; ++j) { in _nc_first_db()
355 for (j = 0; my_blob[j] != '\0'; ++j) { in _nc_first_db()
364 for (j = 0; my_blob[j] != '\0'; ++j) { in _nc_first_db()
376 for (j = 0; my_list[j] != 0; ++j) { in _nc_first_db()
387 ++j; in _nc_first_db()
399 for (j = 0; my_list[j] != 0; ++j) { in _nc_first_db()
414 k = j; in _nc_first_db()
[all …]
/dragonfly/sys/contrib/dev/acpica/source/components/utilities/
H A Dutbuffer.c186 UINT32 j; in AcpiUtDumpBuffer() local
217 for (j = 0; j < 16;) in AcpiUtDumpBuffer()
224 j += Display; in AcpiUtDumpBuffer()
258 j += Display; in AcpiUtDumpBuffer()
268 for (j = 0; j < 16; j++) in AcpiUtDumpBuffer()
280 if (j == 0) in AcpiUtDumpBuffer()
376 UINT32 j; in AcpiUtDumpBufferToFile() local
402 for (j = 0; j < 16;) in AcpiUtDumpBufferToFile()
409 j += Display; in AcpiUtDumpBufferToFile()
443 j += Display; in AcpiUtDumpBufferToFile()
[all …]
/dragonfly/usr.sbin/cron/cron/
H A Djob.c37 job *j; in job_add() local
40 for (j=jhead; j; j=j->next) in job_add()
41 if (j->e == e && j->u == u) { return; } in job_add()
47 j->e = e; in job_add()
48 j->u = u; in job_add()
53 jtail = j; in job_add()
60 job *j, *jn; in job_runqueue() local
63 for (j=jhead; j; j=jn) { in job_runqueue()
64 do_command(j->e, j->u); in job_runqueue()
65 jn = j->next; in job_runqueue()
[all …]
/dragonfly/tools/test/malloc/
H A Dmain.c14 int i,j,k; in main() local
23 for (j = 0 ; j < 40960/i && j < NBUCKETS; j++) { in main()
26 for (j = 0 ; j < 40960/i && j < NBUCKETS; j++) { in main()
27 free(foo[j]); in main()
28 foo[j] = NULL; in main()
35 foo[j] = realloc(foo[j], k & 1 ? 0 : k); in main()
36 if (foo[j]) in main()
37 foo[j][0] = 1; in main()
40 for (j = 0 ; j < NBUCKETS ; j++) { in main()
41 if (foo[j]) { in main()
[all …]
/dragonfly/games/rogue/
H A Droom.c110 j <= rooms[rn].right_col; j++) { in light_up_room()
121 mvaddch(i, j, get_dungeon_char(i, j)); in light_up_room()
140 for (j = ((col > 0) ? -1 : 0); j <= j_end; j++) { in light_passage()
154 for (j = rooms[rn].left_col + 1; j < rooms[rn].right_col; j++) { in darken_room()
295 for (j = found = 0; ((!found) && (j < 250)); j++) { in party_objects()
375 for (j = 0; j < DCOLS; j++) { in draw_magic_map()
452 for (j = rooms[rn].left_col; j <= rooms[rn].right_col; j++) { in dr_course()
463 for (j = 0; j < 4; j++) { in dr_course()
519 for (j = 0; j < DCOLS; j++) { in edit_opts()
520 save[i][j] = mvinch(i, j); in edit_opts()
[all …]
/dragonfly/contrib/bzip2/
H A Dblocksort.c46 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 ) in fallbackSimpleSort()
47 fmap[j-4] = fmap[j]; in fallbackSimpleSort()
55 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ ) in fallbackSimpleSort()
56 fmap[j-1] = fmap[j]; in fallbackSimpleSort()
518 j = j - h; in mainSimpleSort()
532 j = j - h; in mainSimpleSort()
546 j = j - h; in mainSimpleSort()
886 for (j = 0; j <= 255; j++) { in mainSort()
919 for (j = 0; j <= 255; j++) { in mainSort()
946 for (j = 0; j <= 255; j++) ftab[(j << 8) + ss] |= SETMASK; in mainSort()
[all …]
/dragonfly/lib/libc/stdio/
H A Dxprintf_hexdump.c71 for (j = 0; j < l && j < u; j++) in __printf_render_hexdump()
74 for (; j < l; j++) in __printf_render_hexdump()
77 for (j = 0; j < l && j < u; j++) { in __printf_render_hexdump()
78 if (p[j] < ' ' || p[j] > '~') in __printf_render_hexdump()
81 *q++ = p[j]; in __printf_render_hexdump()
83 for (; j < l; j++) in __printf_render_hexdump()
88 j = l; in __printf_render_hexdump()
90 j = u; in __printf_render_hexdump()
91 p += j; in __printf_render_hexdump()
92 u -= j; in __printf_render_hexdump()
[all …]
/dragonfly/crypto/libressl/crypto/rsa/
H A Drsa_pk1.c71 int j; in RSA_padding_add_PKCS1_type_1() local
87 p += j; in RSA_padding_add_PKCS1_type_1()
98 int i, j; in RSA_padding_check_PKCS1_type_1() local
123 if (i == j) { in RSA_padding_check_PKCS1_type_1()
133 j -= i; in RSA_padding_check_PKCS1_type_1()
140 return j; in RSA_padding_check_PKCS1_type_1()
147 int i, j; in RSA_padding_add_PKCS1_type_2() local
180 int i, j; in RSA_padding_check_PKCS1_type_2() local
195 if (i == j) { in RSA_padding_check_PKCS1_type_2()
205 j -= i; in RSA_padding_check_PKCS1_type_2()
[all …]
/dragonfly/contrib/byacc/
H A Doutput.c399 ++j; in output_accessing_symbols()
423 for (j = 0; j + cbase < nconflicts; j++) in find_conflict_base()
454 for (j = 0; j < PER_STATE * ntokens; ++j) in token_actions()
565 for (j = 0; j < ntokens; ++j) in token_actions()
585 for (j = 0; j < ntokens; ++j) in token_actions()
606 for (j = 0; j < ntokens; ++j) in token_actions()
755 j--; in sort_actions()
757 while (j >= 0 && (width[order[j]] == w) && (tally[order[j]] < t)) in sort_actions()
758 j--; in sort_actions()
810 if (width[j] != w || tally[j] != t) in matching_vector()
[all …]
/dragonfly/contrib/wpa_supplicant/src/p2p/
H A Dp2p_utils.c83 size_t i, j; in p2p_reg_class_intersect() local
88 for (j = 0; j < b->channels; j++) { in p2p_reg_class_intersect()
121 for (j = 0; j < b->reg_classes; j++) { in p2p_channels_intersect()
144 for (j = 0; j < cl->channels; j++) { in p2p_op_class_union()
169 for (j = 0; j < b->reg_classes; j++) { in p2p_channels_union_inplace()
177 for (j = 0; j < b->reg_classes; j++) { in p2p_channels_union_inplace()
262 for (j = 0; j < reg->channels; j++) { in p2p_channels_includes()
277 for (j = 0; j < reg->channels; j++) { in p2p_channels_includes_freq()
359 for (j = 0; j < c->channels; j++) { in p2p_channels_dump()
389 for (j = 0; classes == NULL || classes[j]; j++) { in p2p_channel_select()
[all …]
/dragonfly/etc/rc.d/
H A Dinitdiskless212 subdir=${j##*/}
213 if [ -d $j -a -f $j/md_size ]; then
219 if [ -d $j -a -f $j/diskless_remount ]; then
224 mount_nfs $nfspt $j
241 subdir=${j##*/}
242 if [ -d $j ]; then
244 cp -Rp $j/* /$subdir
248 subdir=${j%*.cpio.gz}
250 if [ -f $j ]; then
257 subdir=${j%*.remove}
[all …]
/dragonfly/usr.bin/window/
H A Dwwdump.c46 int i, j; in wwdumpwin() local
52 for (j = w->ww_i.l; j < w->ww_i.r; j++) in wwdumpwin()
75 int i, j; in wwdumpsmap() local
81 for (j = 0; j < wwncol; j++) in wwdumpsmap()
82 (*tt.tt_putc)(cmap[wwsmap[i][j]]); in wwdumpsmap()
89 int i, j; in wwdumpns() local
94 for (j = 0; j < wwncol; j++) { in wwdumpns()
96 (*tt.tt_putc)(wwns[i][j].c_c); in wwdumpns()
104 int i, j; in wwdumpos() local
109 for (j = 0; j < wwncol; j++) { in wwdumpos()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/
H A Dspellcheck.c74 for (int j = 0; j < len_s + 1; j++) in levenshtein_distance() local
75 printf ("%i ", v0[j]); in levenshtein_distance()
86 for (int j = 0; j < len_s; j++) in levenshtein_distance() local
89 edit_distance_t deletion = v1[j] + 1; in levenshtein_distance()
94 v1[j + 1] = cheapest; in levenshtein_distance()
98 for (int j = 0; j < len_s + 1; j++) in levenshtein_distance() local
99 v0[j] = v1[j]; in levenshtein_distance()
105 for (int j = 0; j < len_s + 1; j++) in levenshtein_distance() local
106 printf ("%i ", v1[j]); in levenshtein_distance()
243 for (int j = 0; j < num_test_cases; j++) in test_metric_conditions() local
[all …]

12345678910>>...82