Home
last modified time | relevance | path

Searched refs:a (Results 1 – 25 of 114) sorted by relevance

12345

/lib/crypto/mpi/
A Dmpiutil.c34 MPI a; in mpi_alloc() local
36 a = kmalloc(sizeof *a, GFP_KERNEL); in mpi_alloc()
37 if (!a) in mpi_alloc()
38 return a; in mpi_alloc()
55 return a; in mpi_alloc()
71 if (!a) in mpi_free_limb_space()
80 a->d = ap; in mpi_assign_limb_space()
99 memcpy(p, a->d, a->alloced * sizeof(mpi_limb_t)); in mpi_resize()
113 if (!a) in mpi_free()
123 kfree(a); in mpi_free()
[all …]
A Dmpi-bit.c34 for (; a->nlimbs && !a->d[a->nlimbs - 1]; a->nlimbs--) in mpi_normalize()
45 mpi_normalize(a); in mpi_get_nbits()
47 if (a->nlimbs) { in mpi_get_nbits()
48 mpi_limb_t alimb = a->d[a->nlimbs - 1]; in mpi_get_nbits()
73 limb = a->d[limbno]; in mpi_test_bit()
90 for (i = a->nlimbs; i < a->alloced; i++) in mpi_set_bit()
91 a->d[i] = 0; in mpi_set_bit()
113 if (x == a) { in mpi_rshift()
130 xsize = a->nlimbs; in mpi_rshift()
131 x->sign = a->sign; in mpi_rshift()
[all …]
A Dmpicoder.c41 mpi_limb_t a; in mpi_read_raw_data() local
69 a = 0; in mpi_read_raw_data()
71 a <<= 8; in mpi_read_raw_data()
119 alimb = a->d[i]; in count_lzeros()
295 alimb = a->d[i] ? cpu_to_be32(a->d[i]) : 0; in mpi_write_to_sgl()
297 alimb = a->d[i] ? cpu_to_be64(a->d[i]) : 0; in mpi_write_to_sgl()
338 mpi_limb_t a; in mpi_read_raw_from_sgl() local
395 a = 0; in mpi_read_raw_from_sgl()
405 a <<= 8; in mpi_read_raw_from_sgl()
406 a |= *buff++; in mpi_read_raw_from_sgl()
[all …]
/lib/math/
A Dgcd.c29 a >>= __ffs(a); in binary_gcd()
30 if (a == 1) in binary_gcd()
32 if (a == b) in binary_gcd()
35 if (a < b) in binary_gcd()
37 a -= b; in binary_gcd()
72 a >>= 1; in gcd()
76 return a; in gcd()
80 a -= b; in gcd()
81 a >>= 1; in gcd()
83 a += b; in gcd()
[all …]
A Dlcm.c8 unsigned long lcm(unsigned long a, unsigned long b) in lcm() argument
10 if (a && b) in lcm()
11 return (a / gcd(a, b)) * b; in lcm()
17 unsigned long lcm_not_zero(unsigned long a, unsigned long b) in lcm_not_zero() argument
19 unsigned long l = lcm(a, b); in lcm_not_zero()
24 return (b ? : a); in lcm_not_zero()
A Drational.c58 unsigned long dp, a; in rational_best_approximation() local
66 a = n / d; in rational_best_approximation()
74 n2 = n0 + a * n1; in rational_best_approximation()
75 d2 = d0 + a * d1; in rational_best_approximation()
94 if (!d1 || 2u * t > a || (2u * t == a && d0 * dp > d1 * d)) { in rational_best_approximation()
A Dtest_mul_u64_u64_div_u64.c13 typedef struct { u64 a; u64 b; u64 c; u64 result; } test_params; member
73 u64 a = test_values[i].a; in test_init() local
77 u64 result = mul_u64_u64_div_u64(a, b, c); in test_init()
80 pr_err("ERROR: 0x%016llx * 0x%016llx / 0x%016llx\n", a, b, c); in test_init()
/lib/crypto/
A Ddes.c631 a = k[7]; a &= 0x0e; a <<= 4; a |= k[3] & 0x1e; a = pc1[a]; in des_ekey()
635 pe[13 * 2 + 0] = DES_PC2(b, c, d, a); a = rs[a]; d = rs[d]; in des_ekey()
659 a = k[3]; a &= 0xe0; a >>= 4; a |= k[7] & 0xf0; a = pc1[a + 1]; in des_ekey()
722 a = k[7]; a &= 0x0e; a <<= 4; a |= k[3] & 0x1e; a = pc1[a]; in dkey()
726 pe[ 2 * 2] = DES_PC2(b, c, d, a); a = rs[a]; d = rs[d]; in dkey()
728 pe[ 4 * 2] = DES_PC2(b, c, d, a); a = rs[a]; d = rs[d]; in dkey()
730 pe[ 6 * 2] = DES_PC2(b, c, d, a); a = rs[a]; d = rs[d]; in dkey()
732 pe[ 8 * 2] = DES_PC2(c, d, a, b); b = rs[b]; a = rs[a]; in dkey()
734 pe[10 * 2] = DES_PC2(c, d, a, b); b = rs[b]; a = rs[a]; in dkey()
736 pe[12 * 2] = DES_PC2(c, d, a, b); b = rs[b]; a = rs[a]; in dkey()
[all …]
A Dmemneq.c75 neq |= get_unaligned((unsigned long *)a) ^ in __crypto_memneq_generic()
78 a += sizeof(unsigned long); in __crypto_memneq_generic()
86 a += 1; in __crypto_memneq_generic()
100 neq |= get_unaligned((unsigned long *)a) ^ in __crypto_memneq_16()
103 neq |= get_unaligned((unsigned long *)(a + 8)) ^ in __crypto_memneq_16()
107 neq |= get_unaligned((unsigned int *)a) ^ in __crypto_memneq_16()
110 neq |= get_unaligned((unsigned int *)(a + 4)) ^ in __crypto_memneq_16()
113 neq |= get_unaligned((unsigned int *)(a + 8)) ^ in __crypto_memneq_16()
116 neq |= get_unaligned((unsigned int *)(a + 12)) ^ in __crypto_memneq_16()
169 return __crypto_memneq_16(a, b); in __crypto_memneq()
[all …]
A Dsm3.c44 ss2 = ss1 ^ rol32((a), 12); \
52 #define R1(a, b, c, d, e, f, g, h, t, w1, w2) \ argument
53 R(1, a, b, c, d, e, f, g, h, t, w1, w2)
54 #define R2(a, b, c, d, e, f, g, h, t, w1, w2) \ argument
55 R(2, a, b, c, d, e, f, g, h, t, w1, w2)
77 u32 a, b, c, d, e, f, g, h, ss1, ss2; in sm3_transform() local
79 a = sctx->state[0]; in sm3_transform()
88 R1(a, b, c, d, e, f, g, h, K[0], I(0), I(4)); in sm3_transform()
89 R1(d, a, b, c, h, e, f, g, K[1], I(1), I(5)); in sm3_transform()
90 R1(c, d, a, b, g, h, e, f, K[2], I(2), I(6)); in sm3_transform()
[all …]
A Darc4.c25 u32 a = ctx->S[i]; in arc4_setkey() local
27 j = (j + in_key[k] + a) & 0xff; in arc4_setkey()
29 ctx->S[j] = a; in arc4_setkey()
41 u32 x, y, a, b; in arc4_crypt() local
50 a = S[x]; in arc4_crypt()
51 y = (y + a) & 0xff; in arc4_crypt()
55 S[y] = a; in arc4_crypt()
56 a = (a + b) & 0xff; in arc4_crypt()
62 *out++ = *in++ ^ S[a]; in arc4_crypt()
66 a = ta; in arc4_crypt()
A Dgf128mul.c142 u64 a = be64_to_cpu(x->a); in gf128mul_x8_lle() local
147 x->a = cpu_to_be64((a >> 8) ^ (_tt << 48)); in gf128mul_x8_lle()
153 u64 a = be64_to_cpu(x->a); in gf128mul_x8_lle_ti() local
158 x->a = cpu_to_be64((a >> 8) ^ (_tt << 48)); in gf128mul_x8_lle_ti()
163 u64 a = be64_to_cpu(x->a); in gf128mul_x8_bbe() local
167 x->a = cpu_to_be64((a << 8) | (b >> 56)); in gf128mul_x8_bbe()
173 u64 a = le64_to_cpu(x->a); in gf128mul_x8_ble() local
177 r->a = cpu_to_le64((a << 8) | (b >> 56)); in gf128mul_x8_ble()
297 u8 *ap = (u8 *)a; in gf128mul_64k_bbe()
304 *a = *r; in gf128mul_64k_bbe()
[all …]
/lib/crypto/x86/
A Dsha256-avx-asm.S165 xor a, y1 # y1 = a ^ (a >> (22-13)
173 xor a, y1 # y1 = a ^ (a >> (13-2)) ^ (a >> (22-2))
200 xor a, y1 # y1 = a ^ (a >> (22-13)
209 xor a, y1 # y1 = a ^ (a >> (13-2)) ^ (a >> (22-2))
237 xor a, y1 # y1 = a ^ (a >> (22-13)
246 xor a, y1 # y1 = a ^ (a >> (13-2)) ^ (a >> (22-2))
277 xor a, y1 # y1 = a ^ (a >> (22-13)
284 xor a, y1 # y1 = a ^ (a >> (13-2)) ^ (a >> (22-2))
316 xor a, y1 # y1 = a ^ (a >> (22-13)
322 xor a, y1 # y1 = a ^ (a >> (13-2)) ^ (a >> (22-2))
[all …]
A Dsha256-ssse3-asm.S160 xor a, y1 # y1 = a ^ (a >> (22-13)
168 xor a, y1 # y1 = a ^ (a >> (13-2)) ^ (a >> (22-2))
172 ror $2, y1 # y1 = S0 = (a>>2) ^ (a>>13) ^ (a>>22)
200 xor a, y1 # y1 = a ^ (a >> (22-13)
209 xor a, y1 # y1 = a ^ (a >> (13-2)) ^ (a >> (22-2))
240 xor a, y1 # y1 = a ^ (a >> (22-13)
249 xor a, y1 # y1 = a ^ (a >> (13-2)) ^ (a >> (22-2))
283 xor a, y1 # y1 = a ^ (a >> (22-13)
290 xor a, y1 # y1 = a ^ (a >> (13-2)) ^ (a >> (22
323 xor a, y1 # y1 = a ^ (a >> (22-13)
[all …]
A Dsha256-avx2-asm.S164 rorx $13, a, T1 # T1 = a >> 13 # S0B
173 rorx $22, a, y1 # y1 = a >> 22 # S0A
179 rorx $2, a, T1 # T1 = (a >> 2) # S0
183 xor T1, y1 # y1 = (a>>22) ^ (a>>13) ^ (a>>2) # S0
234 xor T1, y1 # y1 = (a>>22) ^ (a>>13) ^ (a>>2) # S0
287 xor T1, y1 # y1 = (a>>22) ^ (a>>13) ^ (a>>2) # S0
342 xor T1, y1 # y1 = (a>>22) ^ (a>>13) ^ (a>>2) # S0
378 xor T1, y1 # y1 = (a>>22) ^ (a>>13) ^ (a>>2) # S0
417 xor T1, y1 # y1 = (a>>22) ^ (a>>13) ^ (a>>2) # S0
457 xor T1, y1 # y1 = (a>>22) ^ (a>>13) ^ (a>>2) # S0
[all …]
A Dsha512-avx2-asm.S187 rorx $34, a, T1 # T1 = a >> 34 # S0B
195 rorx $39, a, y1 # y1 = a >> 39 # S0A
200 rorx $28, a, T1 # T1 = (a >> 28) # S0
203 xor T1, y1 # y1 = (a>>39) ^ (a>>34) ^ (a>>28) # S0
268 xor T1, y1 # y1 = (a>>39) ^ (a>>34) ^ (a>>28) # S0
325 xor T1, y1 # y1 = (a>>39) ^ (a>>34) ^ (a>>28) # S0
387 xor T1, y1 # y1 = (a>>39) ^ (a>>34) ^ (a>>28) # S0
425 xor T1, y1 # y1 = (a>>39) ^ (a>>34) ^ (a>>28) # S0
463 xor T1, y1 # y1 = (a>>39) ^ (a>>34) ^ (a>>28) # S0
501 xor T1, y1 # y1 = (a>>39) ^ (a>>34) ^ (a>>28) # S0
[all …]
/lib/
A Dlist_sort.c21 *tail = a; in merge()
23 a = a->next; in merge()
24 if (!a) { in merge()
33 *tail = a; in merge()
60 tail = a; in merge_final()
61 a = a->next; in merge_final()
62 if (!a) in merge_final()
70 b = a; in merge_final()
227 struct list_head *a = *tail, *b = a->prev; in list_sort() local
229 a = merge(priv, cmp, b, a); in list_sort()
[all …]
A Dsort.c59 u32 t = *(u32 *)(a + (n -= 4)); in swap_words_32()
85 u64 t = *(u64 *)(a + (n -= 8)); in swap_words_64()
94 t = *(u32 *)(a + (n -= 4)); in swap_words_64()
112 char t = ((char *)a)[--n]; in swap_bytes()
145 swap_words_64(a, b, size); in do_swap()
147 swap_words_32(a, b, size); in do_swap()
149 swap_bytes(a, b, size); in do_swap()
160 return cmp(a, b, priv); in do_cmp()
229 a -= size << shift; in __sort_r()
234 a = size << shift; in __sort_r()
[all …]
A Dtest_fpu_impl.c15 volatile double a, b, c, d, e, f, g; in test_fpu() local
17 a = 4.0; in test_fpu()
22 d = a + b; in test_fpu()
25 e = a + b / 2; in test_fpu()
31 g = a + c * f; in test_fpu()
33 if (d > a && e > a && g > a) in test_fpu()
A Dbch.c331 return (a && b) ? bch->a_pow_tab[mod_s(bch, bch->a_log_tab[a]+ in gf_mul()
343 return a ? bch->a_pow_tab[mod_s(bch, bch->a_log_tab[a]+ in gf_div()
682 if (a) { in find_poly_deg4_roots()
732 int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]); in gf_poly_logrep()
736 rep[i] = a->c[i] ? mod_s(bch, a_log(bch, a->c[i])+l) : -1; in gf_poly_logrep()
770 a->deg = d-1; in gf_poly_mod()
771 while (!c[a->deg] && a->deg) in gf_poly_mod()
772 a->deg--; in gf_poly_mod()
802 swap(a, b); in gf_poly_gcd()
806 swap(a, b); in gf_poly_gcd()
[all …]
/lib/tests/
A Dtest_sort.c13 static int cmpint(const void *a, const void *b) in cmpint() argument
15 return *(int *)a - *(int *)b; in cmpint()
20 int *a, i, r = 1; in test_sort() local
22 a = kunit_kmalloc_array(test, TEST_LEN, sizeof(*a), GFP_KERNEL); in test_sort()
23 KUNIT_ASSERT_NOT_ERR_OR_NULL(test, a); in test_sort()
27 a[i] = r; in test_sort()
30 sort(a, TEST_LEN, sizeof(*a), cmpint, NULL); in test_sort()
33 KUNIT_ASSERT_LE(test, a[i], a[i + 1]); in test_sort()
39 a[i] = r; in test_sort()
42 sort(a, TEST_LEN - 1, sizeof(*a), cmpint, NULL); in test_sort()
[all …]
A Dlist-test.c49 struct list_head a, b; in list_test_list_add() local
52 list_add(&a, &list); in list_test_list_add()
63 struct list_head a, b; in list_test_list_add_tail() local
84 list_del(&a); in list_test_list_del()
139 list_swap(&a, &b); in list_test_list_swap()
161 list_del_init(&a); in list_test_list_del_init()
267 INIT_LIST_HEAD(&a); in list_test_list_is_head()
271 KUNIT_EXPECT_TRUE_MSG(test, list_is_head(&a, &a), in list_test_list_is_head()
306 struct list_head a; in list_test_list_empty() local
901 hlist_del(&a); in hlist_test_del()
[all …]
A Dhashtable_test.c41 a.key = 1; in hashtable_test_hash_empty()
42 a.data = 13; in hashtable_test_hash_empty()
43 hash_add(hash, &a.node, a.key); in hashtable_test_hash_empty()
54 a.key = 1; in hashtable_test_hash_hashed()
55 a.data = 13; in hashtable_test_hash_hashed()
56 hash_add(hash, &a.node, a.key); in hashtable_test_hash_hashed()
71 a.key = 1; in hashtable_test_hash_add()
72 a.data = 13; in hashtable_test_hash_add()
74 hash_add(hash, &a.node, a.key); in hashtable_test_hash_add()
100 a.key = 1; in hashtable_test_hash_del()
[all …]
/lib/raid6/
A Dmktables.c21 static uint8_t gfmul(uint8_t a, uint8_t b) in gfmul() argument
27 v ^= a; in gfmul()
28 a = (a << 1) ^ (a & 0x80 ? 0x1d : 0); in gfmul()
35 static uint8_t gfpow(uint8_t a, int b) in gfpow() argument
45 v = gfmul(v, a); in gfpow()
46 a = gfmul(a, a); in gfpow()
/lib/crypto/powerpc/
A Dsha1-spe-asm.S118 and rT1,a,b; /* 2: F' = B and C */ \
120 andc rT2,c,a; /* 2: F" = ~B and D */ \
125 rotrwi a,a,2; /* 2: B = B rotl 30 */ \
148 and rT2,a,b; /* 2: F' = B and C */ \
149 andc rT1,c,a; /* 2: F" = ~B and D */ \
153 rotrwi a,a,2; /* 2: B = B rotl 30 */ \
172 xor rT2,a,b; /* 2: F' = B xor C */ \
177 rotrwi a,a,2; /* 2: B = B rotl 30 */ \
198 and rT2,a,b; /* 2: F' = B and C */ \
199 or rT0,a,b; /* 2: F" = B or C */ \
[all …]

Completed in 48 milliseconds

12345