Home
last modified time | relevance | path

Searched defs:t (Results 1 – 25 of 34) sorted by relevance

12

/lib/crypto/
Dsha1.c54 #define SHA_SRC(t) get_unaligned_be32((__u32 *)data + t) argument
55 #define SHA_MIX(t) rol32(W(t+13) ^ W(t+8) ^ W(t+2) ^ W(t), 1) argument
57 #define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ argument
63 #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
64 #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
65 #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
66 #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
67 #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
Dgf128mul.c282 struct gf128mul_64k *t; in gf128mul_init_64k_bbe() local
322 void gf128mul_free_64k(struct gf128mul_64k *t) in gf128mul_free_64k()
332 void gf128mul_64k_bbe(be128 *a, const struct gf128mul_64k *t) in gf128mul_64k_bbe()
363 struct gf128mul_4k *t; in gf128mul_init_4k_lle() local
385 struct gf128mul_4k *t; in gf128mul_init_4k_bbe() local
405 void gf128mul_4k_lle(be128 *a, const struct gf128mul_4k *t) in gf128mul_4k_lle()
420 void gf128mul_4k_bbe(be128 *a, const struct gf128mul_4k *t) in gf128mul_4k_bbe()
/lib/
Doverflow_kunit.c31 # define SKIP_SIGN_MISMATCH(t) SKIP(t, "Clang 11 unwanted libcalls") argument
33 # define SKIP_SIGN_MISMATCH(t) do { } while (0) argument
42 # define SKIP_64_ON_32(t) SKIP(t, "Clang 13 unwanted libcalls") argument
44 # define SKIP_64_ON_32(t) do { } while (0) argument
47 #define DEFINE_TEST_ARRAY_TYPED(t1, t2, t) \ argument
55 #define DEFINE_TEST_ARRAY(t) DEFINE_TEST_ARRAY_TYPED(t, t, t) argument
252 #define check_one_op(t, fmt, op, sym, a, b, r, of) do { \ argument
271 #define DEFINE_TEST_FUNC_TYPED(n, t, fmt) \ argument
296 #define DEFINE_TEST_FUNC(t, fmt) \ argument
336 #define TEST_ONE_SHIFT(a, s, t, expect, of) do { \ argument
[all …]
Dwin_minmax.c67 u32 minmax_running_max(struct minmax *m, u32 win, u32 t, u32 meas) in minmax_running_max()
85 u32 minmax_running_min(struct minmax *m, u32 win, u32 t, u32 meas) in minmax_running_min()
Dcrc8.c33 u8 t = msbit; in crc8_populate_msb() local
54 u8 t = 1; in crc8_populate_lsb() local
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
Dts_fsm.c126 static inline int match_token(struct ts_fsm_token *t, u8 d) in match_token()
272 struct ts_fsm_token *t = &tokens[i]; in fsm_init() local
292 struct ts_fsm_token *t = &fsm->tokens[i]; in fsm_init() local
Dsort.c61 u32 t = *(u32 *)(a + (n -= 4)); in swap_words_32() local
87 u64 t = *(u64 *)(a + (n -= 8)); in swap_words_64() local
114 char t = ((char *)a)[--n]; in swap_bytes() local
Dis_single_threaded.c19 struct task_struct *p, *t; in current_is_single_threaded() local
Dinflate.c144 struct huft *t; /* pointer to next level of table */ member
328 struct huft **t, /* result: starting table */ in huft_build()
568 struct huft *t /* table to free */ in huft_free()
601 struct huft *t; /* pointer to table entry */ in inflate_codes() local
1039 unsigned t; /* block type */ in inflate_block() local
Dcrc64.c53 size_t i, t; in crc64_be() local
Dtest_ref_tracker.c57 static void test_ref_tracker_timer_func(struct timer_list *t) in test_ref_tracker_timer_func()
Drefcount.c13 void refcount_warn_saturate(refcount_t *r, enum refcount_saturation_type t) in refcount_warn_saturate()
Dtest_vmalloc.c446 struct test_driver *t = private; in test_func() local
544 struct test_driver *t = &tdriver[i]; in do_concurrent_test() local
571 struct test_driver *t = &tdriver[i]; in do_concurrent_test() local
Dplist.c32 static void plist_check_prev_next(struct list_head *t, struct list_head *p, in plist_check_prev_next()
Dbch.c376 const int t = GF_T(bch); in compute_syndromes() local
412 const unsigned int t = GF_T(bch); in compute_error_locator_polynomial() local
547 unsigned int mask = 0xff, t, rows[16] = {0,}; in find_affine4_roots() local
1202 const unsigned int t = GF_T(bch); in compute_generator_polynomial() local
1285 struct bch_control *bch_init(int m, int t, unsigned int prim_poly, in bch_init()
Dts_bm.c64 u8 t = *(text-i); in matchpat() local
Dkobject.c285 char *t; in kobject_set_name_vargs() local
666 const struct kobj_type *t = get_ktype(kobj); in kobject_cleanup() local
Dtest_bitmap.c1021 struct test_bitmap_cut *t = &test_cut[i]; in test_bitmap_cut() local
1141 const struct test_bitmap_print *t = &test_print[i]; in test_bitmap_print_buf() local
/lib/lzo/
Dlzo1x_compress.c41 size_t t, m_len, m_off; in lzo1x_1_do_compress() local
310 size_t t = 0; in lzogeneric1x_1_compress() local
Dlzo1x_decompress_safe.c44 size_t t, next; in lzo1x_decompress_safe() local
/lib/math/
Drational.c83 unsigned long t = ULONG_MAX; in rational_best_approximation() local
Ddiv64.c163 s64 quot, t; in div64_s64() local
/lib/reed_solomon/
Ddecode_rs.c35 uint16_t *t = rsc->buffers + RS_DECODE_T * (nroots + 1); variable
/lib/842/
D842_compress.c225 u8 *t = comp_ops[c]; in add_template() local
382 u8 *t = comp_ops[c]; in check_template() local

12