/lib/crypto/ |
D | sha256.c | 48 u32 a, b, c, d, e, f, g, h, t1, t2; in sha256_transform() local 62 e = state[4]; f = state[5]; g = state[6]; h = state[7]; in sha256_transform() 65 t1 = h + e1(e) + Ch(e, f, g) + 0x428a2f98 + W[0]; in sha256_transform() 67 t1 = g + e1(d) + Ch(d, e, f) + 0x71374491 + W[1]; in sha256_transform() 69 t1 = f + e1(c) + Ch(c, d, e) + 0xb5c0fbcf + W[2]; in sha256_transform() 70 t2 = e0(g) + Maj(g, h, a); b += t1; f = t1 + t2; in sha256_transform() 72 t2 = e0(f) + Maj(f, g, h); a += t1; e = t1 + t2; in sha256_transform() 74 t2 = e0(e) + Maj(e, f, g); h += t1; d = t1 + t2; in sha256_transform() 76 t2 = e0(d) + Maj(d, e, f); g += t1; c = t1 + t2; in sha256_transform() 78 t2 = e0(c) + Maj(c, d, e); f += t1; b = t1 + t2; in sha256_transform() [all …]
|
D | blake2s-generic.c | 65 v[14] = BLAKE2S_IV6 ^ state->f[0]; in blake2s_compress_generic() 66 v[15] = BLAKE2S_IV7 ^ state->f[1]; in blake2s_compress_generic()
|
/lib/fonts/ |
D | fonts.c | 110 const struct font_desc *f, *g; in get_default_font() local 115 f = fonts[i]; in get_default_font() 116 c = f->pref; in get_default_font() 119 if (MACH_IS_AMIGA && f->idx == PEARL8x8_IDX) in get_default_font() 123 if (MACH_IS_MAC && xres < 640 && f->idx == VGA6x11_IDX) in get_default_font() 127 if ((yres < 400) == (f->height <= 8)) in get_default_font() 131 res = (xres / f->width) * (yres / f->height) / 1000; in get_default_font() 135 if ((font_w & (1U << (f->width - 1))) && in get_default_font() 136 (font_h & (1U << (f->height - 1)))) in get_default_font() 141 g = f; in get_default_font()
|
/lib/ |
D | test_hexdump.c | 167 int ae, he, e, f, r; in test_hexdump_overflow() local 188 f = min_t(int, e + 1, buflen); in test_hexdump_overflow() 191 test[f - 1] = '\0'; in test_hexdump_overflow() 193 memset(test + f, FILL_CHAR, sizeof(test) - f); in test_hexdump_overflow()
|
D | bch.c | 649 unsigned int a, b, c, d, e = 0, f, a2, b2, c2, e4; in find_poly_deg4_roots() local 666 f = gf_div(bch, c, a); in find_poly_deg4_roots() 667 l = a_log(bch, f); in find_poly_deg4_roots() 677 d = a_pow(bch, 2*l)^gf_mul(bch, b, f)^d; in find_poly_deg4_roots() 698 f = a ? gf_inv(bch, roots[i]) : roots[i]; in find_poly_deg4_roots() 699 roots[i] = a_ilog(bch, f^e); in find_poly_deg4_roots() 806 const struct gf_poly *f, struct gf_poly *z, in compute_trace_bk_mod() argument 818 memset(out, 0, GF_POLY_SZ(f->deg)); in compute_trace_bk_mod() 821 gf_poly_logrep(bch, f, bch->cache); in compute_trace_bk_mod() 836 gf_poly_mod(bch, z, f, bch->cache); in compute_trace_bk_mod() [all …]
|
D | kstrtox.c | 394 #define kstrto_from_user(f, g, type) \ argument 395 int f(const char __user *s, size_t count, unsigned int base, type *res) \ 406 EXPORT_SYMBOL(f)
|
D | inflate.c | 338 unsigned f; /* i repeats in table every f entries */ in huft_build() local 471 if ((f = 1 << (j = k - w)) > a + 1) /* try a k-w bit table */ in huft_build() 474 f -= a + 1; /* deduct codes from patterns left */ in huft_build() 479 if ((f <<= 1) <= *++xp) in huft_build() 481 f -= *xp; /* else deduct codes from patterns */ in huft_build() 535 f = 1 << (k - w); in huft_build() 536 for (j = i >> w; j < z; j += f) in huft_build()
|
D | iov_iter.c | 1695 int (*f)(struct kvec *vec, void *context), in iov_iter_for_each_range() 1706 err = f(&w, context); in iov_iter_for_each_range() 1710 err = f(&w, context);}) in iov_iter_for_each_range()
|
D | vsprintf.c | 926 char *file_dentry_name(char *buf, char *end, const struct file *f, in file_dentry_name() argument 929 if (check_pointer(&buf, end, f, spec)) in file_dentry_name() 932 return dentry_name(buf, end, f->f_path.dentry, spec, fmt); in file_dentry_name()
|
D | test_firmware.c | 109 static ssize_t test_fw_misc_read(struct file *f, char __user *buf, in test_fw_misc_read() argument
|
/lib/zstd/ |
D | zstd_internal.h | 41 #define CHECK_F(f) \ argument 43 size_t const errcod = f; \ 47 #define CHECK_E(f, e) \ argument 49 size_t const errcod = f; \
|
D | huf_compress.c | 56 #define CHECK_V_F(e, f) \ argument 57 size_t const e = f; \ 59 return f 60 #define CHECK_F(f) \ argument 62 CHECK_V_F(_var_err__, f); \
|
D | fse_decompress.c | 64 #define CHECK_F(f) \ argument 66 size_t const e = f; \
|
/lib/xz/ |
D | xz_dec_test.c | 64 static int xz_dec_test_open(struct inode *i, struct file *f) in xz_dec_test_open() argument 83 static int xz_dec_test_release(struct inode *i, struct file *f) in xz_dec_test_release() argument
|
/lib/zlib_deflate/ |
D | deftree.c | 422 ush f; /* frequency */ in gen_bitlen() local 444 f = tree[n].Freq; in gen_bitlen() 445 s->opt_len += (ulg)f * (bits + xbits); in gen_bitlen() 446 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits); in gen_bitlen()
|