| /busybox-1.35.0/testsuite/ |
| D | bc_bessel.bc | 1 j(0, 0)
2 j(0, .5)
3 j(0, -.5)
4 j(0, 1)
5 j(0, -1)
6 j(0, 1.5)
7 j(0, -1.5)
8 j(0, 1.74)
9 j(0, -1.74)
10 j(0, 2)
[all …]
|
| /busybox-1.35.0/archival/libarchive/bz/ |
| D | blocksort.c | 69 int32_t i, j, tmp; in fallbackSimpleSort() local
78 for (j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4) in fallbackSimpleSort()
79 fmap[j-4] = fmap[j]; in fallbackSimpleSort()
80 fmap[j-4] = tmp; in fallbackSimpleSort()
87 for (j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++) in fallbackSimpleSort()
88 fmap[j-1] = fmap[j]; in fallbackSimpleSort()
89 fmap[j-1] = tmp; in fallbackSimpleSort()
238 int32_t H, i, j, k, l, r, cc, cc1; in fallbackSort() local
256 j = ftab[0]; /* bbox: optimized */ in fallbackSort()
258 j += ftab[i]; in fallbackSort()
[all …]
|
| D | huffman.c | 111 int32_t nNodes, nHeap, n1, n2, i, j, k; in BZ2_hbMakeCodeLengths() local
159 j = 0; in BZ2_hbMakeCodeLengths()
163 j++; in BZ2_hbMakeCodeLengths()
165 len[i-1] = j; in BZ2_hbMakeCodeLengths()
166 if (j > maxLen) in BZ2_hbMakeCodeLengths()
191 j = weight[i] >> 8; in BZ2_hbMakeCodeLengths()
194 j = 1 + (j / 2); in BZ2_hbMakeCodeLengths()
195 weight[i] = j << 8; in BZ2_hbMakeCodeLengths()
|
| D | compress.c | 236 int32_t j; in generateMTFValues() local
239 j = ptr[i] - 1; in generateMTFValues()
240 if (j < 0) in generateMTFValues()
241 j += s->nblock; in generateMTFValues()
242 ll_i = s->unseqToSeq[s->block[j]]; in generateMTFValues()
278 j = inner_loop(yy, ll_i); in generateMTFValues()
279 s->mtfv[wr] = j+1; in generateMTFValues()
281 s->mtfFreq[j+1]++; in generateMTFValues()
533 unsigned j; in sendMTFValues() local
535 j = 0; in sendMTFValues()
[all …]
|
| /busybox-1.35.0/libbb/ |
| D | mode_string.c | 48 int i, j, k; in bb_mode_string() local
53 j = k = 0; in bb_mode_string()
56 if (mode & mode_flags[i+j]) { in bb_mode_string()
57 *p = mode_chars[j]; in bb_mode_string()
58 k = j; in bb_mode_string()
60 } while (++j < 3); in bb_mode_string()
61 if (mode & mode_flags[i+j]) { in bb_mode_string()
84 int i, j, k, m; in bb_mode_string() local
90 j = k = 0; in bb_mode_string()
94 *p = mode_chars[j]; in bb_mode_string()
[all …]
|
| D | getpty.c | 42 int j; in xgetpty() local
52 for (j = 0; j < 16; j++) { in xgetpty()
53 line[9] = j < 10 ? j + '0' : j - 10 + 'a'; in xgetpty()
|
| D | in_ether.c | 19 int i, j; in in_ether() local
33 j = val = 0; in in_ether()
41 if (j && (c == ':' || c == '\0')) in in_ether()
49 j ^= 1; in in_ether()
50 } while (j); in in_ether()
|
| D | pw_encrypt_des.c | 240 unsigned i, j, b; in const_des_init() local
250 for (j = 0; j < 64; j++) { in const_des_init()
251 b = (j & 0x20) | ((j & 1) << 4) | ((j >> 1) & 0xf); in const_des_init()
252 u_sbox[i][j] = sbox[i][b]; in const_des_init()
257 for (j = 0; j < 64; j+=2) in const_des_init()
258 fprintf(stderr, " 0x%02x,", u_sbox[i][j] + u_sbox[i][j+1]*16); in const_des_init()
267 for (j = 0; j < 64; j++) in const_des_init()
268 m_sbox[b][(i << 6) | j] = in const_des_init()
270 u_sbox[(b << 1) + 1][j]); in const_des_init()
280 for (j = 0; j < 64; j++) { in const_des_init()
[all …]
|
| D | find_pid_by_name.c | 115 int j; in pidlist_reverse() local
116 for (j = 0; i > j; i--, j++) { in pidlist_reverse()
118 pidList[i] = pidList[j]; in pidlist_reverse()
119 pidList[j] = k; in pidlist_reverse()
|
| D | crc32.c | 26 unsigned i, j; in crc32_filltable() local
33 for (j = 8; j; j--) { in crc32_filltable()
|
| D | pw_encrypt_sha.c | 206 unsigned j = i + 10; in sha_crypt() local
208 if (j >= 30) j -= 30; in sha_crypt()
210 b64_from_24bit(alt_result[i], alt_result[j], alt_result[k], 4); in sha_crypt()
232 unsigned j = i + 21; in sha_crypt() local
234 if (j >= 63) j -= 63; in sha_crypt()
236 b64_from_24bit(alt_result[i], alt_result[j], alt_result[k], 4); in sha_crypt()
237 if (j == 20) in sha_crypt()
239 i = j + 1; in sha_crypt()
|
| D | compare_string_array.c | 66 int j, idx = 0; in index_in_strings() local
70 for (j = 0; *strings == key[j]; ++j) { in index_in_strings()
|
| /busybox-1.35.0/coreutils/ |
| D | tr.c | 79 unsigned i, j; in map() local
81 for (j = 0, i = 0; i < string1_len; i++) { in map()
82 if (string2_len <= j) in map()
85 pvector[(unsigned char)(string1[i])] = last = string2[j++]; in map()
174 smalluint j; in expand() local
180 j = index_in_strings(classes, tmp) + 1; in expand()
183 if (j == CLASS_invalid) in expand()
187 if (j == CLASS_alnum || j == CLASS_digit || j == CLASS_xdigit) { in expand()
191 if (j == CLASS_alpha || j == CLASS_alnum || j == CLASS_upper) { in expand()
195 if (j == CLASS_alpha || j == CLASS_alnum || j == CLASS_lower) { in expand()
[all …]
|
| D | sort.c | 146 int len, j; in get_key() local
158 for (j = 0; j < 2; j++) { in get_key()
159 if (!key->range[2*j]) in get_key()
166 for (i = 1; i < key->range[2*j] + j; i++) { in get_key()
187 if (j && ch) { in get_key()
195 if (!j) start = end; in get_key()
586 int j = (option_mask32 & FLAG_u) ? -1 : 0; in sort_main() local
588 if (compare_keys(&lines[i-1], &lines[i]) > j) { in sort_main()
619 int j = 0; in sort_main() local
626 if (compare_keys(&lines[j], &lines[i]) == 0) in sort_main()
[all …]
|
| /busybox-1.35.0/console-tools/ |
| D | dumpkmap.c | 48 int i, j, fd; in dumpkmap_main() local
72 for (j = 0; j < NR_KEYS; j++) { in dumpkmap_main()
73 ke.kb_index = j; in dumpkmap_main()
77 j, i) in dumpkmap_main()
|
| D | loadkmap.c | 51 int i, j, fd; in loadkmap_main() local
79 for (j = 0; j < NR_KEYS; j++) { in loadkmap_main()
80 ke.kb_index = j; in loadkmap_main()
82 ke.kb_value = ibuff[j]; in loadkmap_main()
|
| /busybox-1.35.0/editors/ |
| D | diff.c | 276 int i, j; in search() local
281 for (i = 0, j = k + 1;;) { in search()
282 const int l = (i + j) >> 1; in search()
286 j = l; in search()
312 int j = a[cand.x], oldl = 0; in stone() local
314 if (j == 0) in stone()
316 cand.y = -b[j]; in stone()
342 } while ((cand.y = b[++j]) > 0 && numtries < bound); in stone()
364 int i = 1, j = 1; in equiv() local
366 while (i <= n && j <= m) { in equiv()
[all …]
|
| /busybox-1.35.0/archival/libarchive/ |
| D | decompress_gunzip.c | 312 unsigned j; /* counter */ in huft_build() local
351 for (j = 1; (j <= BMAX) && (c[j] == 0); j++) in huft_build()
353 k = j; /* minimum code length */ in huft_build()
357 *m = (*m < j) ? j : ((*m > i) ? i : *m); in huft_build()
360 for (y = 1 << j; j < i; j++, y <<= 1) { in huft_build()
361 y -= c[j]; in huft_build()
371 x[1] = j = 0; in huft_build()
375 j += *p++; in huft_build()
376 *xp++ = j; in huft_build()
387 j = *p++; in huft_build()
[all …]
|
| /busybox-1.35.0/miscutils/ |
| D | i2c_tools.c | 804 int i, j, res; in dump_data() local
818 for (j = 0; j < 16; j++) { in dump_data()
821 if (i+j < first || i+j > last) { in dump_data()
825 j++; in dump_data()
832 res = i2c_smbus_read_byte_data(bus_fd, i+j); in dump_data()
833 block[i+j] = res; in dump_data()
836 res = i2c_smbus_read_word_data(bus_fd, i+j); in dump_data()
838 block[i+j] = res; in dump_data()
839 block[i+j+1] = res; in dump_data()
841 block[i+j] = res & 0xff; in dump_data()
[all …]
|
| /busybox-1.35.0/modutils/ |
| D | modinfo.c | 65 int j; in modinfo() local
85 for (j = 1; (1<<j) & (OPT_TAGS|OPT_F); j++) { in modinfo()
88 if (!((1<<j) & tags)) in modinfo()
92 if ((1<<j) & OPT_TAGS) in modinfo()
93 pattern = shortcuts[j-2]; in modinfo()
|
| /busybox-1.35.0/applets/ |
| D | applet_tables.c | 68 int i, j; in main() local
91 for (i = j = 0; i < NUM_APPLETS-1; ++i) { in main()
95 j = 1; in main()
99 if (j != 0 || !argv[1]) in main()
124 for (j = 0; j < KNOWN_APPNAME_OFFSETS; j++) in main()
125 if (i == index[j]) in main()
126 offset[j] = ofs; in main()
|
| /busybox-1.35.0/scripts/kconfig/lxdialog/ |
| D | util.c | 109 int i, j; in attr_clear() local
114 for (j = 0; j < width; j++) in attr_clear()
293 int i, j; in draw_box() local
298 for (j = 0; j < width; j++) in draw_box()
299 if (!i && !j) in draw_box()
301 else if (i == height - 1 && !j) in draw_box()
303 else if (!i && j == width - 1) in draw_box()
305 else if (i == height - 1 && j == width - 1) in draw_box()
311 else if (!j) in draw_box()
313 else if (j == width - 1) in draw_box()
|
| /busybox-1.35.0/util-linux/volume_id/ |
| D | util.c | 25 unsigned i, j; in volume_id_set_unicode16() local
28 j = 0; in volume_id_set_unicode16()
36 if (j+1 >= len) in volume_id_set_unicode16()
42 if (j+2 >= len) in volume_id_set_unicode16()
47 if (j+3 >= len) in volume_id_set_unicode16()
50 str[j++] = (uint8_t) (0xe0 | (c >> 12)); in volume_id_set_unicode16()
53 str[j++] = (uint8_t) (topbits | ((c >> 6) & 0x3f)); in volume_id_set_unicode16()
56 str[j++] = (uint8_t) c; in volume_id_set_unicode16()
58 str[j] = '\0'; in volume_id_set_unicode16()
|
| /busybox-1.35.0/util-linux/ |
| D | fdisk_sun.c | 410 int i,j,k,starto,endo; in verify_sun() local
421 for (j = 0; j < i; j++) in verify_sun()
422 if (lens[j]) { in verify_sun()
423 if (starts[j] == starts[i]+lens[i]) { in verify_sun()
424 starts[j] = starts[i]; lens[j] += lens[i]; in verify_sun()
426 } else if (starts[i] == starts[j]+lens[j]){ in verify_sun()
427 lens[j] += lens[i]; in verify_sun()
430 if (starts[i] < starts[j]+lens[j] in verify_sun()
431 && starts[j] < starts[i]+lens[i]) { in verify_sun()
433 if (starts[j] > starto) in verify_sun()
[all …]
|
| /busybox-1.35.0/archival/libarchive/unxz/ |
| D | xz_dec_bcj.c | 101 uint32_t j; in bcj_x86() local
137 j = mask_to_bit_num[prev_mask] * 8; in bcj_x86()
138 b = (uint8_t)(dest >> (24 - j)); in bcj_x86()
142 src = dest ^ (((uint32_t)1 << (32 - j)) - 1); in bcj_x86()
201 size_t j; in bcj_ia64() local
234 for (j = 0; j < 6; ++j) in bcj_ia64()
235 instr |= (uint64_t)(buf[i + j + byte_pos]) in bcj_ia64()
236 << (8 * j); in bcj_ia64()
256 for (j = 0; j < 6; j++) in bcj_ia64()
257 buf[i + j + byte_pos] in bcj_ia64()
[all …]
|