Home
last modified time | relevance | path

Searched refs:b (Results 1 – 25 of 39) sorted by relevance

12

/lib/
Dmd5.c15 u32 a, b, c, d; in md5_transform() local
18 b = hash[1]; in md5_transform()
22 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); in md5_transform()
23 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); in md5_transform()
24 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); in md5_transform()
25 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); in md5_transform()
26 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); in md5_transform()
27 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); in md5_transform()
28 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); in md5_transform()
29 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); in md5_transform()
[all …]
Ddecompress_unxz.c177 static bool memeq(const void *a, const void *b, size_t size) in memeq() argument
180 const uint8_t *y = b; in memeq()
194 uint8_t *b = buf; in memzero() local
195 uint8_t *e = b + size; in memzero()
197 while (b != e) in memzero()
198 *b++ = '\0'; in memzero()
257 struct xz_buf b; in unxz() local
278 b.out = out; in unxz()
279 b.out_size = (size_t)-1; in unxz()
281 b.out_size = XZ_IOBUF_SIZE; in unxz()
[all …]
Dhalfmd4.c17 #define ROUND(f, a, b, c, d, x, s) \ argument
18 (a += f(b, c, d) + x, a = rol32(a, s))
28 __u32 a = buf[0], b = buf[1], c = buf[2], d = buf[3]; in half_md4_transform() local
31 ROUND(F, a, b, c, d, in[0] + K1, 3); in half_md4_transform()
32 ROUND(F, d, a, b, c, in[1] + K1, 7); in half_md4_transform()
33 ROUND(F, c, d, a, b, in[2] + K1, 11); in half_md4_transform()
34 ROUND(F, b, c, d, a, in[3] + K1, 19); in half_md4_transform()
35 ROUND(F, a, b, c, d, in[4] + K1, 3); in half_md4_transform()
36 ROUND(F, d, a, b, c, in[5] + K1, 7); in half_md4_transform()
37 ROUND(F, c, d, a, b, in[6] + K1, 11); in half_md4_transform()
[all …]
Duuid.c26 static void __uuid_gen_common(__u8 b[16]) in __uuid_gen_common()
28 prandom_bytes(b, 16); in __uuid_gen_common()
30 b[8] = (b[8] & 0x3F) | 0x80; in __uuid_gen_common()
35 __uuid_gen_common(lu->b); in uuid_le_gen()
37 lu->b[7] = (lu->b[7] & 0x0F) | 0x40; in uuid_le_gen()
43 __uuid_gen_common(bu->b); in uuid_be_gen()
45 bu->b[6] = (bu->b[6] & 0x0F) | 0x40; in uuid_be_gen()
Dsiphash.c34 u64 b = ((u64)(len)) << 56; \
41 v3 ^= b; \
44 v0 ^= b; \
68 b |= le64_to_cpu((__force __le64)(load_unaligned_zeropad(data) & in __siphash_aligned()
72 case 7: b |= ((u64)end[6]) << 48; in __siphash_aligned()
73 case 6: b |= ((u64)end[5]) << 40; in __siphash_aligned()
74 case 5: b |= ((u64)end[4]) << 32; in __siphash_aligned()
75 case 4: b |= le32_to_cpup(data); break; in __siphash_aligned()
76 case 3: b |= ((u64)end[2]) << 16; in __siphash_aligned()
77 case 2: b |= le16_to_cpup(data); break; in __siphash_aligned()
[all …]
Dgcd.c6 unsigned long gcd(unsigned long a, unsigned long b) in gcd() argument
10 if (a < b) in gcd()
11 swap(a, b); in gcd()
13 if (!b) in gcd()
15 while ((r = a % b) != 0) { in gcd()
16 a = b; in gcd()
17 b = r; in gcd()
19 return b; in gcd()
Dlcm.c7 unsigned long lcm(unsigned long a, unsigned long b) in lcm() argument
9 if (a && b) in lcm()
10 return (a / gcd(a, b)) * b; in lcm()
16 unsigned long lcm_not_zero(unsigned long a, unsigned long b) in lcm_not_zero() argument
18 unsigned long l = lcm(a, b); in lcm_not_zero()
23 return (b ? : a); in lcm_not_zero()
Dlist_sort.c21 struct list_head *b), in merge() argument
22 struct list_head *a, struct list_head *b) in merge()
26 while (a && b) { in merge()
28 if ((*cmp)(priv, a, b) <= 0) { in merge()
32 tail->next = b; in merge()
33 b = b->next; in merge()
37 tail->next = a?:b; in merge()
50 struct list_head *b), in merge_and_restore_back_links() argument
52 struct list_head *a, struct list_head *b) in merge_and_restore_back_links()
57 while (a && b) { in merge_and_restore_back_links()
[all …]
Dsort.c17 static void u32_swap(void *a, void *b, int size) in u32_swap() argument
20 *(u32 *)a = *(u32 *)b; in u32_swap()
21 *(u32 *)b = t; in u32_swap()
24 static void u64_swap(void *a, void *b, int size) in u64_swap() argument
27 *(u64 *)a = *(u64 *)b; in u64_swap()
28 *(u64 *)b = t; in u64_swap()
31 static void generic_swap(void *a, void *b, int size) in generic_swap() argument
37 *(char *)a++ = *(char *)b; in generic_swap()
38 *(char *)b++ = t; in generic_swap()
109 int cmpint(const void *a, const void *b)
[all …]
Dinflate.c140 uch b; /* number of bits in this code or subcode */ member
233 #define NEEDBITS(n) {while(k<(n)){b|=((ulg)NEXTBYTE())<<k;k+=8;}}
234 #define DUMPBITS(n) {b>>=(n);k-=(n);}
322 unsigned *b, /* code lengths in bits (all assumed <= BMAX) */ in huft_build() argument
374 p = b; i = n; in huft_build()
433 p = b; i = 0; in huft_build()
506 r.b = (uch)l; /* bits to dump before this table */ in huft_build()
517 r.b = (uch)(k - w); in huft_build()
602 register ulg b; /* bit buffer */ in inflate_codes() local
607 b = bb; /* initialize bit buffer */ in inflate_codes()
[all …]
Ddiv64.c29 uint64_t b = base; in __div64_32() local
41 while ((int64_t)b > 0 && b < rem) { in __div64_32()
42 b = b+b; in __div64_32()
47 if (rem >= b) { in __div64_32()
48 rem -= b; in __div64_32()
51 b >>= 1; in __div64_32()
Dint_sqrt.c20 unsigned long b, m, y = 0; in int_sqrt() local
27 b = y + m; in int_sqrt()
30 if (x >= b) { in int_sqrt()
31 x -= b; in int_sqrt()
Dextable.c30 static void swap_ex(void *a, void *b, int size) in swap_ex() argument
32 struct exception_table_entry *x = a, *y = b, tmp; in swap_ex()
33 int delta = b - a; in swap_ex()
54 static int cmp_ex(const void *a, const void *b) in cmp_ex() argument
56 const struct exception_table_entry *x = a, *y = b; in cmp_ex()
Dbch.c296 unsigned int b) in gf_mul() argument
298 return (a && b) ? bch->a_pow_tab[mod_s(bch, bch->a_log_tab[a]+ in gf_mul()
299 bch->a_log_tab[b])] : 0; in gf_mul()
308 unsigned int b) in gf_div() argument
311 GF_N(bch)-bch->a_log_tab[b])] : 0; in gf_div()
509 unsigned int b, unsigned int c, in find_affine4_roots() argument
516 j = a_log(bch, b); in find_affine4_roots()
524 (b ? bch->a_pow_tab[mod_s(bch, j)] : 0); in find_affine4_roots()
606 unsigned int a, b, c, a2, b2, c2, e3, tmp[4]; in find_poly_deg3_roots() local
617 b = gf_mul(bch, a2, b2)^c2; /* b = a2b2 + c2 */ in find_poly_deg3_roots()
[all …]
Ducs2_string.c35 ucs2_strncmp(const ucs2_char_t *a, const ucs2_char_t *b, size_t len) in ucs2_strncmp() argument
40 if (*a < *b) in ucs2_strncmp()
42 if (*a > *b) in ucs2_strncmp()
47 b++; in ucs2_strncmp()
Dglob.c81 unsigned char b = a; in glob_match() local
87 b = class[1]; in glob_match()
89 if (b == '\0') in glob_match()
95 match |= (a <= c && c <= b); in glob_match()
Doid_registry.c80 unsigned char b = octets[len]; in look_up_OID() local
81 if (a > b) { in look_up_OID()
85 if (a < b) { in look_up_OID()
/lib/xz/
Dxz_dec_stream.c157 static bool fill_temp(struct xz_dec *s, struct xz_buf *b) in fill_temp() argument
160 b->in_size - b->in_pos, s->temp.size - s->temp.pos); in fill_temp()
162 memcpy(s->temp.buf + s->temp.pos, b->in + b->in_pos, copy_size); in fill_temp()
163 b->in_pos += copy_size; in fill_temp()
218 static enum xz_ret dec_block(struct xz_dec *s, struct xz_buf *b) in dec_block() argument
222 s->in_start = b->in_pos; in dec_block()
223 s->out_start = b->out_pos; in dec_block()
227 ret = xz_dec_bcj_run(s->bcj, s->lzma2, b); in dec_block()
230 ret = xz_dec_lzma2_run(s->lzma2, b); in dec_block()
232 s->block.compressed += b->in_pos - s->in_start; in dec_block()
[all …]
Dxz_dec_bcj.c83 static inline int bcj_x86_test_msbyte(uint8_t b) in bcj_x86_test_msbyte() argument
85 return b == 0x00 || b == 0xFF; in bcj_x86_test_msbyte()
101 uint8_t b; in bcj_x86() local
117 b = buf[i + 4 - mask_to_bit_num[prev_mask]]; in bcj_x86()
119 || bcj_x86_test_msbyte(b)) { in bcj_x86()
137 b = (uint8_t)(dest >> (24 - j)); in bcj_x86()
138 if (!bcj_x86_test_msbyte(b)) in bcj_x86()
399 static void bcj_flush(struct xz_dec_bcj *s, struct xz_buf *b) in bcj_flush() argument
403 copy_size = min_t(size_t, s->temp.filtered, b->out_size - b->out_pos); in bcj_flush()
404 memcpy(b->out + b->out_pos, s->temp.buf, copy_size); in bcj_flush()
[all …]
Dxz_dec_lzma2.c286 static void dict_reset(struct dictionary *dict, struct xz_buf *b) in dict_reset() argument
289 dict->buf = b->out + b->out_pos; in dict_reset()
290 dict->end = b->out_size - b->out_pos; in dict_reset()
374 static void dict_uncompressed(struct dictionary *dict, struct xz_buf *b, in dict_uncompressed() argument
379 while (*left > 0 && b->in_pos < b->in_size in dict_uncompressed()
380 && b->out_pos < b->out_size) { in dict_uncompressed()
381 copy_size = min(b->in_size - b->in_pos, in dict_uncompressed()
382 b->out_size - b->out_pos); in dict_uncompressed()
397 memmove(dict->buf + dict->pos, b->in + b->in_pos, copy_size); in dict_uncompressed()
411 memmove(b->out + b->out_pos, b->in + b->in_pos, in dict_uncompressed()
[all …]
Dxz_private.h40 # define memeq(a, b, size) (memcmp(a, b, size) == 0) argument
123 struct xz_buf *b);
150 struct xz_buf *b);
/lib/842/
D842_compress.c118 #define get_input_data(p, o, b) \ argument
119 be##b##_to_cpu(get_unaligned((__be##b *)((p)->in + (o))))
121 #define init_hashtable_nodes(p, b) do { \ argument
123 hash_init((p)->htable##b); \
124 for (_i = 0; _i < ARRAY_SIZE((p)->node##b); _i++) { \
125 (p)->node##b[_i].index = _i; \
126 (p)->node##b[_i].data = 0; \
127 INIT_HLIST_NODE(&(p)->node##b[_i].node); \
131 #define find_index(p, b, n) ({ \ argument
132 struct sw842_hlist_node##b *_n; \
[all …]
/lib/raid6/
Dmktables.c24 static uint8_t gfmul(uint8_t a, uint8_t b) in gfmul() argument
28 while (b) { in gfmul()
29 if (b & 1) in gfmul()
32 b >>= 1; in gfmul()
38 static uint8_t gfpow(uint8_t a, int b) in gfpow() argument
42 b %= 255; in gfpow()
43 if (b < 0) in gfpow()
44 b += 255; in gfpow()
46 while (b) { in gfpow()
47 if (b & 1) in gfpow()
[all …]
/lib/reed_solomon/
Ddecode_rs.c35 uint16_t b[nroots + 1], t[nroots + 1], omega[nroots + 1]; variable
126 b[i] = index_of[lambda[i]];
148 memmove (&b[1], b, nroots * sizeof (b[0]));
149 b[0] = nn;
154 if (b[i] != nn) {
157 b[i])];
168 b[i] = (lambda[i] == 0) ? nn :
174 memmove(&b[1], b, nroots * sizeof(b[0]));
175 b[0] = nn;
/lib/zlib_inflate/
Dinffast.c15 unsigned char b[2]; member
23 unsigned char *b = (unsigned char *)p; in get_unaligned16() local
25 mm.b[0] = b[0]; in get_unaligned16()
26 mm.b[1] = b[1]; in get_unaligned16()
273 mm.b[0] = mm.b[1]; in inflate_fast()

12