Home
last modified time | relevance | path

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

12

/lib/lzo/
Dlzo1x_decompress_safe.c44 size_t t, next; in lzo1x_decompress_safe() local
66 t = *ip++ - 17; in lzo1x_decompress_safe()
67 if (t < 4) { in lzo1x_decompress_safe()
68 next = t; in lzo1x_decompress_safe()
75 t = *ip++; in lzo1x_decompress_safe()
76 if (t < 16) { in lzo1x_decompress_safe()
78 if (unlikely(t == 0)) { in lzo1x_decompress_safe()
91 t += offset + 15 + *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()
[all …]
Dlzo1x_compress.c41 size_t t, m_len, m_off; in lzo1x_1_do_compress() local
108 t = ((dv * 0x1824429d) >> (32 - D_BITS)) & D_MASK; in lzo1x_1_do_compress()
109 m_pos = in + dict[t]; in lzo1x_1_do_compress()
110 dict[t] = (lzo_dict_t) (ip - in); in lzo1x_1_do_compress()
117 t = ip - ii; in lzo1x_1_do_compress()
118 if (t != 0) { in lzo1x_1_do_compress()
119 if (t <= 3) { in lzo1x_1_do_compress()
120 op[*state_offset] |= t; in lzo1x_1_do_compress()
122 op += t; in lzo1x_1_do_compress()
123 } else if (t <= 16) { in lzo1x_1_do_compress()
[all …]
/lib/
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()
85 u32 minmax_running_min(struct minmax *m, u32 win, u32 t, u32 meas) in minmax_running_min() argument
87 struct minmax_sample val = { .t = t, .v = meas }; in minmax_running_min()
[all …]
Dsha1.c53 #define SHA_SRC(t) get_unaligned_be32((__u32 *)data + t) argument
54 #define SHA_MIX(t) rol32(W(t+13) ^ W(t+8) ^ W(t+2) ^ W(t), 1) argument
56 #define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ argument
57 __u32 TEMP = input(t); setW(t, TEMP); \
62 #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
63 #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
64 #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
65 #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
66 #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
Dcrc8.c33 u8 t = msbit; in crc8_populate_msb() local
38 t = (t << 1) ^ (t & msbit ? polynomial : 0); in crc8_populate_msb()
40 table[i+j] = table[j] ^ t; in crc8_populate_msb()
54 u8 t = 1; in crc8_populate_lsb() local
59 t = (t >> 1) ^ (t & 1 ? polynomial : 0); in crc8_populate_lsb()
61 table[i+j] = table[j] ^ t; in crc8_populate_lsb()
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); \
Dtest_vmalloc.c413 struct test_driver *t = private; in test_func() local
430 t->start = get_cycles(); in test_func()
443 t->data[index].test_passed++; in test_func()
445 t->data[index].test_failed++; in test_func()
454 t->data[index].time = delta; in test_func()
456 t->stop = get_cycles(); in test_func()
511 struct test_driver *t = &tdriver[i]; in do_concurrent_test() local
513 t->task = kthread_run(test_func, t, "vmalloc_test/%d", i); in do_concurrent_test()
515 if (!IS_ERR(t->task)) in do_concurrent_test()
538 struct test_driver *t = &tdriver[i]; in do_concurrent_test() local
[all …]
Dlocking-selftest.c58 static struct ww_acquire_ctx t, t2; variable
1373 I_WW(t); I_WW(t2); I_WW(o.base); I_WW(o2.base); I_WW(o3.base);
1386 memset(&t, 0, sizeof(t)); memset(&t2, 0, sizeof(t2));
1624 WWAI(&t); in ww_test_fail_acquire()
1625 t.stamp++; in ww_test_fail_acquire()
1627 ret = WWL(&o, &t); in ww_test_fail_acquire()
1634 ret = WWL(&o, &t); in ww_test_fail_acquire()
1640 t2 = t; in ww_test_fail_acquire()
1658 WWAI(&t); in ww_test_normal()
1710 mutex_lock_nest_lock(&o.base, &t); in ww_test_normal()
[all …]
Dinflate.c144 struct huft *t; /* pointer to next level of table */ member
328 struct huft **t, /* result: starting table */ in huft_build() argument
384 *t = (struct huft *)NULL; in huft_build()
498 *t = q + 1; /* link to list for huft_free() */ in huft_build()
499 *(t = &(q->v.t)) = (struct huft *)NULL; in huft_build()
509 r.v.t = q; /* pointer to this table */ in huft_build()
568 struct huft *t /* table to free */ in huft_free() argument
578 p = t; in huft_free()
581 q = (--p)->v.t; in huft_free()
601 struct huft *t; /* pointer to table entry */ in inflate_codes() local
[all …]
Dsort.c61 u32 t = *(u32 *)(a + (n -= 4)); in swap_words_32() local
63 *(u32 *)(b + n) = t; in swap_words_32()
87 u64 t = *(u64 *)(a + (n -= 8)); in swap_words_64() local
89 *(u64 *)(b + n) = t; in swap_words_64()
92 u32 t = *(u32 *)(a + (n -= 4)); in swap_words_64()
94 *(u32 *)(b + n) = t; in swap_words_64()
96 t = *(u32 *)(a + (n -= 4)); in swap_words_64()
98 *(u32 *)(b + n) = t; in swap_words_64()
114 char t = ((char *)a)[--n]; in swap_bytes() local
116 ((char *)b)[n] = t; in swap_bytes()
Dtest_overflow.c17 #define DEFINE_TEST_ARRAY(t) \ argument
18 static const struct test_ ## t { \
19 t a, b; \
20 t sum, diff, prod; \
22 } t ## _tests[] __initconst
218 #define check_one_op(t, fmt, op, sym, a, b, r, of) do { \ argument
219 t _r; \
226 a, b, of ? "" : " not", #t); \
232 a, b, r, _r, #t); \
237 #define DEFINE_TEST_FUNC(t, fmt) \ argument
[all …]
Ddecompress_bunzip2.c162 i, j, k, t, runPos, symCount, symTotal, nSelectors, *byteCount; in get_next_block() local
195 t = get_bits(bd, 16); in get_next_block()
198 if (t&(1 << (15-i))) { in get_next_block()
246 t = get_bits(bd, 5)-1; in get_next_block()
249 if (((unsigned)t) > (MAX_HUFCODE_BITS-1)) in get_next_block()
265 t += (((k+1)&2)-1); in get_next_block()
269 length[i] = t+1; in get_next_block()
310 for (t = 0; t < symCount; t++) in get_next_block()
311 if (length[t] == i) in get_next_block()
312 hufGroup->permute[pp++] = t; in get_next_block()
[all …]
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()
Dtest_bitmap.c669 struct test_bitmap_cut *t = &test_cut[i]; in test_bitmap_cut() local
671 memcpy(in, t->in, sizeof(t->in)); in test_bitmap_cut()
673 bitmap_cut(out, in, t->first, t->cut, t->nbits); in test_bitmap_cut()
675 expect_eq_bitmap(t->expected, out, t->nbits); in test_bitmap_cut()
789 const struct test_bitmap_print *t = &test_print[i]; in test_bitmap_print_buf() local
792 n = bitmap_print_bitmask_to_buf(print_buf, t->bitmap, t->nbits, in test_bitmap_print_buf()
794 expect_eq_uint(strlen(t->mask) + 1, n); in test_bitmap_print_buf()
795 expect_eq_str(t->mask, print_buf, n); in test_bitmap_print_buf()
797 n = bitmap_print_list_to_buf(print_buf, t->bitmap, t->nbits, in test_bitmap_print_buf()
799 expect_eq_uint(strlen(t->list) + 1, n); in test_bitmap_print_buf()
[all …]
Dcrc64.c46 size_t i, t; in crc64_be() local
51 t = ((crc >> 56) ^ (*_p++)) & 0xFF; in crc64_be()
52 crc = crc64table[t] ^ (crc << 8); in crc64_be()
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
Dbch.c85 #define GF_T(_p) ((_p)->t)
410 const int t = GF_T(bch); in compute_syndromes() local
418 memset(syn, 0, 2*t*sizeof(*syn)); in compute_syndromes()
426 for (j = 0; j < 2*t; j += 2) in compute_syndromes()
434 for (j = 0; j < t; j++) in compute_syndromes()
446 const unsigned int t = GF_T(bch); in compute_error_locator_polynomial() local
454 memset(pelp, 0, GF_POLY_SZ(2*t)); in compute_error_locator_polynomial()
455 memset(elp, 0, GF_POLY_SZ(2*t)); in compute_error_locator_polynomial()
463 for (i = 0; (i < t) && (elp->deg <= t); i++) { in compute_error_locator_polynomial()
485 if (i < t-1) { in compute_error_locator_polynomial()
[all …]
Dtest_printf.c517 time64_t t = 1546615943; in time_and_date() local
527 test("2019-01-04T15:32:23", "%ptT", &t); in time_and_date()
528 test("0119-00-04T15:32:23", "%ptTr", &t); in time_and_date()
529 test("15:32:23|2019-01-04", "%ptTt|%ptTd", &t, &t); in time_and_date()
530 test("15:32:23|0119-00-04", "%ptTtr|%ptTdr", &t, &t); in time_and_date()
532 test("2019-01-04 15:32:23", "%ptTs", &t); in time_and_date()
533 test("0119-00-04 15:32:23", "%ptTsr", &t); in time_and_date()
534 test("15:32:23|2019-01-04", "%ptTts|%ptTds", &t, &t); in time_and_date()
535 test("15:32:23|0119-00-04", "%ptTtrs|%ptTdrs", &t, &t); in time_and_date()
Dkobject.c68 struct kobj_type *t = get_ktype(kobj); in populate_dir() local
73 if (t && t->default_attrs) { in populate_dir()
74 for (i = 0; (attr = t->default_attrs[i]) != NULL; i++) { in populate_dir()
308 char *t; in kobject_set_name_vargs() local
310 t = kstrdup(s, GFP_KERNEL); in kobject_set_name_vargs()
312 if (!t) in kobject_set_name_vargs()
314 strreplace(t, '/', '!'); in kobject_set_name_vargs()
315 s = t; in kobject_set_name_vargs()
690 struct kobj_type *t = get_ktype(kobj); in kobject_cleanup() local
696 if (t && !t->release) in kobject_cleanup()
[all …]
Dts_fsm.c126 static inline int match_token(struct ts_fsm_token *t, u8 d) in match_token() argument
128 if (t->type) in match_token()
129 return (token_lookup_tbl[d] & t->type) != 0; in match_token()
131 return t->value == d; in match_token()
272 struct ts_fsm_token *t = &tokens[i]; in fsm_init() local
274 if (t->type > TS_FSM_TYPE_MAX || t->recur > TS_FSM_RECUR_MAX) in fsm_init()
277 if (t->recur == TS_FSM_HEAD_IGNORE && in fsm_init()
292 struct ts_fsm_token *t = &fsm->tokens[i]; in fsm_init() local
293 t->type = token_map[t->type]; in fsm_init()
/lib/math/
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()
Ddiv64.c174 s64 quot, t; in div64_s64() local
177 t = (dividend ^ divisor) >> 63; in div64_s64()
179 return (quot ^ t) - t; in div64_s64()
/lib/842/
D842_compress.c225 u8 *t = comp_ops[c]; in add_template() local
231 pr_debug("template %x\n", t[4]); in add_template()
233 ret = add_bits(p, t[4], OP_BITS); in add_template()
238 pr_debug("op %x\n", t[i]); in add_template()
240 switch (t[i] & OP_AMOUNT) { in add_template()
244 else if (t[i] & OP_ACTION_INDEX) in add_template()
246 else if (t[i] & OP_ACTION_DATA) in add_template()
252 if (b == 2 && t[i] & OP_ACTION_DATA) in add_template()
256 else if (t[i] & OP_ACTION_INDEX) in add_template()
258 else if (t[i] & OP_ACTION_DATA) in add_template()
[all …]
/lib/mpi/
Dec.c116 if (ec->t.p_barrett) in ec_mod()
117 mpi_mod_barrett(w, w, ec->t.p_barrett); in ec_mod()
488 ec->t.valid.a_is_pminus3 = 0; in mpi_ec_get_reset()
489 ec->t.valid.two_inv_p = 0; in mpi_ec_get_reset()
497 if (!ec->t.valid.a_is_pminus3) { in ec_get_a_is_pminus3()
498 ec->t.valid.a_is_pminus3 = 1; in ec_get_a_is_pminus3()
501 ec->t.a_is_pminus3 = !mpi_cmp(ec->a, tmp); in ec_get_a_is_pminus3()
505 return ec->t.a_is_pminus3; in ec_get_a_is_pminus3()
511 if (!ec->t.valid.two_inv_p) { in ec_get_two_inv_p()
512 ec->t.valid.two_inv_p = 1; in ec_get_two_inv_p()
[all …]
/lib/crypto/
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()

12