Home
last modified time | relevance | path

Searched refs:t (Results 1 – 25 of 57) sorted by relevance

123

/lib/crypto/powerpc/
A Dsha1-powerpc-asm.S37 LWZ(W(t),(t)*4,r4)
40 andc r0,RD(t),RB(t); \
41 and r6,RB(t),RC(t); \
45 add RT(t),RT(t),r6; \
49 add RT(t),RT(t),r14
52 and r6,RB(t),RC(t); \
59 add RT(t),RT(t),r6; \
60 xor W((t)+4),W((t)+4-16),W((t)+4-14); \
74 add RT(t),RT(t),r0
84 xor W((t)+4),W((t)+4-16),W((t)+4-14); \
[all …]
/lib/lzo/
A Dlzo1x_decompress_safe.c68 next = t; in lzo1x_decompress_safe()
75 t = *ip++; in lzo1x_decompress_safe()
93 t += 3; in lzo1x_decompress_safe()
96 if (likely(HAVE_IP(t + 15) && HAVE_OP(t + 15))) { in lzo1x_decompress_safe()
136 t = 3; in lzo1x_decompress_safe()
143 t = (t >> 5) - 1 + (3 - 1); in lzo1x_decompress_safe()
145 t = (t & 31) + (3 - 1); in lzo1x_decompress_safe()
174 t &= 7; in lzo1x_decompress_safe()
186 t = (t & 7) + (3 - 1); in lzo1x_decompress_safe()
254 t = next; in lzo1x_decompress_safe()
[all …]
A Dlzo1x_compress.c127 t = ip - ii; in LZO_SAFE()
128 if (t != 0) { in LZO_SAFE()
133 op += t; in LZO_SAFE()
139 op += t; in LZO_SAFE()
156 NEED_OP(t); in LZO_SAFE()
162 t -= 16; in LZO_SAFE()
345 size_t t = 0; in LZO_SAFE() local
378 t += l; in LZO_SAFE()
380 if (t > 0) { in LZO_SAFE()
403 NEED_OP(t); in LZO_SAFE()
[all …]
/lib/crypto/
A Dgf128mul.c253 t->t[i] = kzalloc(sizeof(*t->t[i]), GFP_KERNEL); in gf128mul_init_64k_bbe()
261 t->t[0]->t[1] = *g; in gf128mul_init_64k_bbe()
263 gf128mul_x_bbe(&t->t[0]->t[j + j], &t->t[0]->t[j]); in gf128mul_init_64k_bbe()
268 be128_xor(&t->t[i]->t[j + k], in gf128mul_init_64k_bbe()
269 &t->t[i]->t[j], &t->t[i]->t[k]); in gf128mul_init_64k_bbe()
275 t->t[i]->t[j] = t->t[i - 1]->t[j]; in gf128mul_init_64k_bbe()
276 gf128mul_x8_bbe(&t->t[i]->t[j]); in gf128mul_init_64k_bbe()
301 *r = t->t[0]->t[ap[15]]; in gf128mul_64k_bbe()
333 t->t[128] = *g; in gf128mul_init_4k_lle()
335 gf128mul_x_lle(&t->t[j], &t->t[j+j]); in gf128mul_init_4k_lle()
[all …]
A Dsha1.c57 #define SHA_SRC(t) get_unaligned_be32((__u32 *)data + t) argument
58 #define SHA_MIX(t) rol32(W(t+13) ^ W(t+8) ^ W(t+2) ^ W(t), 1) argument
60 #define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ argument
61 __u32 TEMP = input(t); setW(t, TEMP); \
66 #define T_0_15(t, A, B, C, D, E) SHA_ROUND(t, SHA_SRC, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
67 #define T_16_19(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
68 #define T_20_39(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0x6ed9eba1, A, B, C, D, E ) argument
69 #define T_40_59(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, ((B&C)+(D&(B^C))) , 0x8f1bbcdc, A, B, C, D,… argument
70 #define T_60_79(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0xca62c1d6, A, B, C, D, E ) argument
A Dblake2s-generic.c36 state->t[0] += inc; in blake2s_increment_counter()
37 state->t[1] += (state->t[0] < inc); in blake2s_increment_counter()
63 v[12] = BLAKE2S_IV4 ^ state->t[0]; in blake2s_compress_generic()
64 v[13] = BLAKE2S_IV5 ^ state->t[1]; in blake2s_compress_generic()
/lib/
A Dlwq.c90 t->c++; in lwq_exercise()
113 t = kmalloc(sizeof(*t), GFP_KERNEL); in lwq_test()
114 if (!t) in lwq_test()
116 t->i = i; in lwq_test()
117 t->c = 0; in lwq_test()
132 if (t) in lwq_test()
133 printk(KERN_CONT " %d(%d)", t->i, t->c); in lwq_test()
134 kfree(t); in lwq_test()
142 kfree(t); in lwq_test()
143 t = NULL; in lwq_test()
[all …]
A Dwin_minmax.c32 u32 dt = val->t - m->s[0].t; in minmax_subwin_update()
45 if (unlikely(val->t - m->s[0].t > win)) { in minmax_subwin_update()
50 } else if (unlikely(m->s[1].t == m->s[0].t) && dt > win/4) { in minmax_subwin_update()
56 } else if (unlikely(m->s[2].t == m->s[1].t) && dt > win/2) { in minmax_subwin_update()
67 u32 minmax_running_max(struct minmax *m, u32 win, u32 t, u32 meas) in minmax_running_max() argument
69 struct minmax_sample val = { .t = t, .v = meas }; in minmax_running_max()
72 unlikely(val.t - m->s[2].t > win)) /* nothing left in window? */ in minmax_running_max()
73 return minmax_reset(m, t, meas); /* forget earlier samples */ in minmax_running_max()
87 struct minmax_sample val = { .t = t, .v = meas }; in minmax_running_min()
90 unlikely(val.t - m->s[2].t > win)) /* nothing left in window? */ in minmax_running_min()
[all …]
A Dtest-kstrtox.c31 const struct test_fail *t = &test[i]; \
36 rv = fn(t->str, t->base, &tmp); \
39 t->str, t->base, rv, tmp); \
50 const typeof(test[0]) *t = &test[i]; \
54 rv = fn(t->str, t->base, &res); \
57 t->str, t->base, t->expected_res, rv); \
60 if (res != t->expected_res) { \
62 t->str, t->base, t->expected_res, res); \
A Dtest_vmalloc.c464 t->start = get_cycles(); in test_func()
493 t->stop = get_cycles(); in test_func()
548 t->task = kthread_run(test_func, t, "vmalloc_test/%d", i); in do_concurrent_test()
550 if (!IS_ERR(t->task)) in do_concurrent_test()
576 if (!IS_ERR(t->task)) in do_concurrent_test()
577 kthread_stop(t->task); in do_concurrent_test()
586 t->data[j].test_passed, in do_concurrent_test()
587 t->data[j].test_failed, in do_concurrent_test()
588 t->data[j].test_xfailed, in do_concurrent_test()
590 t->data[j].time); in do_concurrent_test()
[all …]
A Dlocking-selftest.c1689 t2 = t; in ww_test_fail_acquire()
1858 t2 = t; in ww_test_edeadlk_normal()
1884 t2 = t; in ww_test_edeadlk_normal_slow()
1910 t2 = t; in ww_test_edeadlk_no_unlock()
1935 t2 = t; in ww_test_edeadlk_no_unlock_slow()
1960 t2 = t; in ww_test_edeadlk_acquire_more()
1981 t2 = t; in ww_test_edeadlk_acquire_more_slow()
2006 t2 = t; in ww_test_edeadlk_acquire_more_edeadlk()
2032 t2 = t; in ww_test_edeadlk_acquire_more_edeadlk_slow()
2053 t2 = t; in ww_test_edeadlk_acquire_wrong()
[all …]
A Dinflate.c499 *(t = &(q->v.t)) = (struct huft *)NULL; in huft_build()
578 p = t; in huft_free()
581 q = (--p)->v.t; in huft_free()
622 DUMPBITS(t->b) in inflate_codes()
625 } while ((e = (t = t->v.t + ((unsigned)b & mask_bits[e]))->e) > 16); in inflate_codes()
626 DUMPBITS(t->b) in inflate_codes()
657 } while ((e = (t = t->v.t + ((unsigned)b & mask_bits[e]))->e) > 16); in inflate_codes()
658 DUMPBITS(t->b) in inflate_codes()
1067 if (t == 2) in inflate_block()
1069 if (t == 0) in inflate_block()
[all …]
A Ddecompress_bunzip2.c195 t = get_bits(bd, 16); in get_next_block()
198 if (t&(1 << (15-i))) { in get_next_block()
247 t = get_bits(bd, 5)-1; in get_next_block()
266 t += (((k+1)&2)-1); in get_next_block()
270 length[i] = t+1; in get_next_block()
311 for (t = 0; t < symCount; t++) in get_next_block()
312 if (length[t] == i) in get_next_block()
324 pp = t = 0; in get_next_block()
416 t = 0; in get_next_block()
446 byteCount[uc] += t; in get_next_block()
[all …]
A Dis_single_threaded.c19 struct task_struct *p, *t; in current_is_single_threaded() local
36 for_each_thread(p, t) { in current_is_single_threaded()
37 if (unlikely(t->mm == mm)) in current_is_single_threaded()
39 if (likely(t->mm)) in current_is_single_threaded()
A Ddynamic_queue_limits.c28 unsigned long hist_head, t, start, end; in dql_check_stall() local
58 for (t = start; time_before_eq(t, end); t++) in dql_check_stall()
59 if (test_bit(t % (DQL_HIST_LEN * BITS_PER_LONG), in dql_check_stall()
64 if (!time_before_eq(t, end)) in dql_check_stall()
72 dql->stall_max = max_t(unsigned short, dql->stall_max, now - t); in dql_check_stall()
74 trace_dql_stall_detected(dql->stall_thrs, now - t, in dql_check_stall()
A Dsort.c59 u32 t = *(u32 *)(a + (n -= 4)); in swap_words_32() local
61 *(u32 *)(b + n) = t; in swap_words_32()
85 u64 t = *(u64 *)(a + (n -= 8)); in swap_words_64() local
87 *(u64 *)(b + n) = t; in swap_words_64()
90 u32 t = *(u32 *)(a + (n -= 4)); in swap_words_64()
92 *(u32 *)(b + n) = t; in swap_words_64()
94 t = *(u32 *)(a + (n -= 4)); in swap_words_64()
96 *(u32 *)(b + n) = t; in swap_words_64()
112 char t = ((char *)a)[--n]; in swap_bytes() local
114 ((char *)b)[n] = t; in swap_bytes()
A Dbcd.c13 const unsigned int t = (val * 103) >> 10; in _bin2bcd() local
15 return (t << 4) | (val - t * 10); in _bin2bcd()
A Dmuldi3.c11 #define __ll_lowpart(t) ((unsigned long) (t) & (__ll_B - 1)) argument
12 #define __ll_highpart(t) ((unsigned long) (t) >> (W_TYPE_SIZE / 2)) argument
A Dbch.c376 const int t = GF_T(bch); in compute_syndromes() local
392 for (j = 0; j < 2*t; j += 2) in compute_syndromes()
400 for (j = 0; j < t; j++) in compute_syndromes()
429 for (i = 0; (i < t) && (elp->deg <= t); i++) { in compute_error_locator_polynomial()
451 if (i < t-1) { in compute_error_locator_polynomial()
565 rows[k] ^= (t << j); in find_affine4_roots()
566 rows[k+j] ^= t; in find_affine4_roots()
1210 for (i = 0; i < t; i++) { in compute_generator_polynomial()
1307 if (t > BCH_MAX_T) in bch_init()
1315 if ((t < 1) || (m*t >= ((1 << m)-1))) in bch_init()
[all …]
/lib/crypto/x86/
A Dsha512-ssse3-asm.S98 # W[t]+K[t] (stack frame)
151 # Compute rounds t-2 and t-1
159 # [K_t(%%t)] and [K_t(%%t+1)] and stored at dqword [WK_2(%%t)]
162 # Eg. XMM2=W[t-2] really means XMM2={W[t-2]|W[t-1]}
253 paddq %xmm1, %xmm0 # XMM0 = s1(W[t-2]) + W[t-7] + s0(W[t-15]) + W[t-16]
313 paddq K_t(t), %xmm0 # Compute W[t]+K[t]
319 SHA512_Round t-2 # Round t-2
321 paddq K_t(t), %xmm0 # Compute W[t]+K[t]
322 SHA512_Round t-1 # Round t-1
323 movdqa %xmm0, WK_2(t) # Store W[t]+K[t] into WK
[all …]
A Dsha512-avx-asm.S77 # W[t] + K[t] | W[t+1] + K[t+1]
100 # W[t]+K[t] (stack frame)
156 # Compute rounds t-2 and t-1
164 # [K_t(t)] and [K_t(t+1)] and stored at dqword [WK_2(t)]
167 # Eg. XMM4=W[t-2] really means XMM4={W[t-2]|W[t-1]}
214 # W[t-15]>>7 ^ W[t-15]<<63
314 vpaddq K_t(t), %xmm0, %xmm0 # Compute W[t]+K[t]
320 SHA512_Round t-2 # Round t-2
322 vpaddq K_t(t), %xmm0, %xmm0 # Compute W[t]+K[t]
324 vmovdqa %xmm0, WK_2(t)# Store W[t]+K[t] into WK
[all …]
/lib/crc/
A Dcrc8.c34 u8 t = msbit; in crc8_populate_msb() local
39 t = (t << 1) ^ (t & msbit ? polynomial : 0); in crc8_populate_msb()
41 table[i+j] = table[j] ^ t; in crc8_populate_msb()
55 u8 t = 1; in crc8_populate_lsb() local
60 t = (t >> 1) ^ (t & 1 ? polynomial : 0); in crc8_populate_lsb()
62 table[i+j] = table[j] ^ t; in crc8_populate_lsb()
/lib/math/
A Drational.c83 unsigned long t = ULONG_MAX; in rational_best_approximation() local
86 t = (max_denominator - d0) / d1; in rational_best_approximation()
88 t = min(t, (max_numerator - n0) / n1); in rational_best_approximation()
94 if (!d1 || 2u * t > a || (2u * t == a && d0 * dp > d1 * d)) { in rational_best_approximation()
95 n1 = n0 + t * n1; in rational_best_approximation()
96 d1 = d0 + t * d1; in rational_best_approximation()
/lib/842/
A D842_compress.c225 u8 *t = comp_ops[c]; in add_template() local
238 pr_debug("op %x\n", t[i]); in add_template()
240 switch (t[i] & OP_AMOUNT) { in add_template()
266 if (t[i] & OP_ACTION_INDEX) in add_template()
286 c, i, t[0], t[1], t[2], t[3]); in add_template()
290 b += t[i] & OP_AMOUNT; in add_template()
295 c, b, t[0], t[1], t[2], t[3]); in add_template()
382 u8 *t = comp_ops[c]; in check_template() local
389 if (t[i] & OP_ACTION_INDEX) { in check_template()
390 if (t[i] & OP_AMOUNT_2) in check_template()
[all …]
/lib/tests/
A Doverflow_kunit.c32 # define SKIP_SIGN_MISMATCH(t) SKIP(t, "Clang 11 unwanted libcalls") argument
43 # define SKIP_64_ON_32(t) SKIP(t, "Clang 13 unwanted libcalls") argument
52 t sum, diff, prod; \
56 #define DEFINE_TEST_ARRAY(t) DEFINE_TEST_ARRAY_TYPED(t, t, t) argument
257 t _r; \
265 a, b, r, _r, #t); \
276 a, b, r, _r, #t); \
357 DEFINE_TEST_FUNC_TYPED(t ## _ ## t ## __ ## t, t, fmt)
400 t __d; \
410 if ((t)-1 < 0) \
[all …]

Completed in 44 milliseconds

123