/lib/ |
D | percpu_test.c | 27 long l = 0; in percpu_test_init() local 34 l += -1; in percpu_test_init() 36 CHECK(l, long_counter, -1); in percpu_test_init() 38 l += 1; in percpu_test_init() 40 CHECK(l, long_counter, 0); in percpu_test_init() 65 l += -ui_one; in percpu_test_init() 67 CHECK(l, long_counter, 0xffffffff); in percpu_test_init() 69 l += ui_one; in percpu_test_init() 71 CHECK(l, long_counter, (long)0x100000000LL); in percpu_test_init() 74 l = 0; in percpu_test_init() [all …]
|
D | kfifo.c | 94 unsigned int l; in kfifo_copy_in() local 102 l = min(len, size - off); in kfifo_copy_in() 104 memcpy(fifo->data + off, src, l); in kfifo_copy_in() 105 memcpy(fifo->data, src + l, len - l); in kfifo_copy_in() 116 unsigned int l; in __kfifo_in() local 118 l = kfifo_unused(fifo); in __kfifo_in() 119 if (len > l) in __kfifo_in() 120 len = l; in __kfifo_in() 133 unsigned int l; in kfifo_copy_out() local 141 l = min(len, size - off); in kfifo_copy_out() [all …]
|
D | inflate.c | 344 int l; /* bits per table (returned in m) */ in huft_build() local 393 l = *m; in huft_build() 398 if ((unsigned)l < j) in huft_build() 399 l = j; in huft_build() 404 if ((unsigned)l > i) in huft_build() 405 l = i; in huft_build() 406 *m = l; in huft_build() 447 w = -l; /* bits decoded == (l * h) */ in huft_build() 463 while (k > w + l) in huft_build() 467 w += l; /* previous table always l bits */ in huft_build() [all …]
|
D | decompress_unlzo.c | 43 int l; in parse_header() local 58 for (l = 0; l < 9; l++) { in parse_header() 59 if (*parse++ != lzop_magic[l]) in parse_header() 88 l = *parse++; in parse_header() 90 if (end - parse < l + 4) in parse_header() 92 parse += l + 4; in parse_header()
|
D | bch.c | 126 const int l = BCH_ECC_WORDS(bch)-1; in encode_bch_unaligned() local 129 p = bch->mod8_tab + (l+1)*(((ecc[0] >> 24)^(*data++)) & 0xff); in encode_bch_unaligned() 131 for (i = 0; i < l; i++) in encode_bch_unaligned() 134 ecc[l] = (ecc[l] << 8)^(*p); in encode_bch_unaligned() 193 const unsigned int l = BCH_ECC_WORDS(bch)-1; in encode_bch() local 199 const uint32_t * const tab1 = tab0 + 256*(l+1); in encode_bch() 200 const uint32_t * const tab2 = tab1 + 256*(l+1); in encode_bch() 201 const uint32_t * const tab3 = tab2 + 256*(l+1); in encode_bch() 244 p0 = tab0 + (l+1)*((w >> 0) & 0xff); in encode_bch() 245 p1 = tab1 + (l+1)*((w >> 8) & 0xff); in encode_bch() [all …]
|
D | test_hexdump.c | 73 size_t l = len; in test_hexdump_prepare_test() local 81 if (l > rs) in test_hexdump_prepare_test() 82 l = rs; in test_hexdump_prepare_test() 98 for (i = 0; i < l / gs; i++) { in test_hexdump_prepare_test() 116 strncpy(p, data_a, l); in test_hexdump_prepare_test() 117 p += l; in test_hexdump_prepare_test()
|
D | find_bit_benchmark.c | 82 unsigned long l, cnt = 0; in test_find_last_bit() local 88 l = find_last_bit(bitmap, len); in test_find_last_bit() 89 if (l >= len) in test_find_last_bit() 91 len = l; in test_find_last_bit()
|
D | decompress_inflate.c | 147 long l = strm->next_out - out_buf; in __gunzip() local 148 if (l != flush(out_buf, l)) { in __gunzip()
|
D | digsig.c | 74 unsigned nret, l; in digsig_verify_rsa() local 154 p = mpi_get_buffer(res, &l, NULL); in digsig_verify_rsa() 161 head = len - l; in digsig_verify_rsa() 163 memcpy(out1 + head, p, l); in digsig_verify_rsa()
|
D | logic_pio.c | 309 BUILD_LOGIC_IO(l, u32)
|
/lib/math/ |
D | reciprocal_div.c | 17 int l; in reciprocal_value() local 19 l = fls(d - 1); in reciprocal_value() 20 m = ((1ULL << 32) * ((1ULL << l) - d)); in reciprocal_value() 24 R.sh1 = min(l, 1); in reciprocal_value() 25 R.sh2 = max(l - 1, 0); in reciprocal_value() 34 u32 l, post_shift; in reciprocal_value_adv() local 38 l = fls(d - 1); in reciprocal_value_adv() 43 WARN(l == 32, in reciprocal_value_adv() 46 post_shift = l; in reciprocal_value_adv() 47 mlow = 1ULL << (32 + l); in reciprocal_value_adv() [all …]
|
D | lcm.c | 19 unsigned long l = lcm(a, b); in lcm_not_zero() local 21 if (l) in lcm_not_zero() 22 return l; in lcm_not_zero()
|
/lib/lzo/ |
D | lzo1x_compress.c | 298 size_t l = in_len; in lzogeneric1x_1_compress() local 315 while (l > 20) { in lzogeneric1x_1_compress() 316 size_t ll = l <= (m4_max_offset + 1) ? l : (m4_max_offset + 1); in lzogeneric1x_1_compress() 326 l -= ll; in lzogeneric1x_1_compress() 328 t += l; in lzogeneric1x_1_compress()
|
/lib/xz/ |
D | xz_dec_lzma2.c | 619 static void lzma_len(struct xz_dec_lzma2 *s, struct lzma_len_dec *l, in lzma_len() argument 625 if (!rc_bit(&s->rc, &l->choice)) { in lzma_len() 626 probs = l->low[pos_state]; in lzma_len() 630 if (!rc_bit(&s->rc, &l->choice2)) { in lzma_len() 631 probs = l->mid[pos_state]; in lzma_len() 635 probs = l->high; in lzma_len()
|
/lib/mpi/ |
D | longlong.h | 440 #define rshift_rhlc(r, h, l, c) \ argument 443 "=r" (r) : "r" (h), "r" (l), "rn" (c)) 499 #define rshift_rhlc(r, h, l, c) \ argument 504 __nn.__i.__h = (h); __nn.__i.__l = (l); \
|
/lib/lz4/ |
D | lz4_decompress.c | 47 #define DEBUGLOG(l, ...) {} /* disabled */ argument
|