Home
last modified time | relevance | path

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

12

/lib/lzo/
Dlzo1x_decompress_safe.c43 size_t t, next; in lzo1x_decompress_safe() local
55 t = *ip++ - 17; in lzo1x_decompress_safe()
56 if (t < 4) { in lzo1x_decompress_safe()
57 next = t; in lzo1x_decompress_safe()
64 t = *ip++; in lzo1x_decompress_safe()
65 if (t < 16) { in lzo1x_decompress_safe()
67 if (unlikely(t == 0)) { in lzo1x_decompress_safe()
80 t += offset + 15 + *ip++; in lzo1x_decompress_safe()
82 t += 3; in lzo1x_decompress_safe()
85 if (likely(HAVE_IP(t + 15) && HAVE_OP(t + 15))) { in lzo1x_decompress_safe()
[all …]
Dlzo1x_compress.c39 size_t t, m_len, m_off; in lzo1x_1_do_compress() local
47 t = ((dv * 0x1824429d) >> (32 - D_BITS)) & D_MASK; in lzo1x_1_do_compress()
48 m_pos = in + dict[t]; in lzo1x_1_do_compress()
49 dict[t] = (lzo_dict_t) (ip - in); in lzo1x_1_do_compress()
55 t = ip - ii; in lzo1x_1_do_compress()
56 if (t != 0) { in lzo1x_1_do_compress()
57 if (t <= 3) { in lzo1x_1_do_compress()
58 op[-2] |= t; in lzo1x_1_do_compress()
60 op += t; in lzo1x_1_do_compress()
61 } else if (t <= 16) { in lzo1x_1_do_compress()
[all …]
/lib/
Dwin_minmax.c31 u32 dt = val->t - m->s[0].t; in minmax_subwin_update()
44 if (unlikely(val->t - m->s[0].t > win)) { in minmax_subwin_update()
49 } else if (unlikely(m->s[1].t == m->s[0].t) && dt > win/4) { in minmax_subwin_update()
55 } else if (unlikely(m->s[2].t == m->s[1].t) && dt > win/2) { in minmax_subwin_update()
66 u32 minmax_running_max(struct minmax *m, u32 win, u32 t, u32 meas) in minmax_running_max() argument
68 struct minmax_sample val = { .t = t, .v = meas }; in minmax_running_max()
71 unlikely(val.t - m->s[2].t > win)) /* nothing left in window? */ in minmax_running_max()
72 return minmax_reset(m, t, meas); /* forget earlier samples */ in minmax_running_max()
84 u32 minmax_running_min(struct minmax *m, u32 win, u32 t, u32 meas) in minmax_running_min() argument
86 struct minmax_sample val = { .t = t, .v = meas }; in minmax_running_min()
[all …]
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()
Dlocking-selftest.c50 static struct ww_acquire_ctx t, t2; variable
951 I_WW(t); I_WW(t2); I_WW(o.base); I_WW(o2.base); I_WW(o3.base);
957 memset(&t, 0, sizeof(t)); memset(&t2, 0, sizeof(t2));
1138 WWAI(&t); in ww_test_fail_acquire()
1139 t.stamp++; in ww_test_fail_acquire()
1141 ret = WWL(&o, &t); in ww_test_fail_acquire()
1148 ret = WWL(&o, &t); in ww_test_fail_acquire()
1154 t2 = t; in ww_test_fail_acquire()
1172 WWAI(&t); in ww_test_normal()
1224 mutex_lock_nest_lock(&o.base, &t); in ww_test_normal()
[all …]
Drational.c41 unsigned long t, a; in rational_best_approximation() local
49 t = d; in rational_best_approximation()
52 n = t; in rational_best_approximation()
53 t = n0 + a * n1; in rational_best_approximation()
55 n1 = t; in rational_best_approximation()
56 t = d0 + a * d1; in rational_best_approximation()
58 d1 = t; in rational_best_approximation()
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); \
Dsha1.c51 #define SHA_SRC(t) get_unaligned_be32((__u32 *)data + t) argument
52 #define SHA_MIX(t) rol32(W(t+13) ^ W(t+8) ^ W(t+2) ^ W(t), 1) argument
54 #define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ argument
55 __u32 TEMP = input(t); setW(t, TEMP); \
59 #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
60 #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
61 #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
62 #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
63 #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
Dinflate.c143 struct huft *t; /* pointer to next level of table */ member
327 struct huft **t, /* result: starting table */ in huft_build() argument
383 *t = (struct huft *)NULL; in huft_build()
497 *t = q + 1; /* link to list for huft_free() */ in huft_build()
498 *(t = &(q->v.t)) = (struct huft *)NULL; in huft_build()
508 r.v.t = q; /* pointer to this table */ in huft_build()
567 struct huft *t /* table to free */ in huft_free() argument
577 p = t; in huft_free()
580 q = (--p)->v.t; in huft_free()
600 struct huft *t; /* pointer to table entry */ in inflate_codes() local
[all …]
Dsort.c19 u32 t = *(u32 *)a; in u32_swap() local
21 *(u32 *)b = t; in u32_swap()
26 u64 t = *(u64 *)a; in u64_swap() local
28 *(u64 *)b = t; in u64_swap()
33 char t; in generic_swap() local
36 t = *(char *)a; in generic_swap()
38 *(char *)b++ = t; in generic_swap()
Dis_single_threaded.c22 struct task_struct *p, *t; in current_is_single_threaded() local
39 for_each_thread(p, t) { in current_is_single_threaded()
40 if (unlikely(t->mm == mm)) in current_is_single_threaded()
42 if (likely(t->mm)) in current_is_single_threaded()
Ddecompress_bunzip2.c161 i, j, k, t, runPos, symCount, symTotal, nSelectors, *byteCount; in get_next_block() local
194 t = get_bits(bd, 16); in get_next_block()
197 if (t&(1 << (15-i))) { in get_next_block()
245 t = get_bits(bd, 5)-1; in get_next_block()
248 if (((unsigned)t) > (MAX_HUFCODE_BITS-1)) in get_next_block()
264 t += (((k+1)&2)-1); in get_next_block()
268 length[i] = t+1; in get_next_block()
309 for (t = 0; t < symCount; t++) in get_next_block()
310 if (length[t] == i) in get_next_block()
311 hufGroup->permute[pp++] = t; in get_next_block()
[all …]
Dbch.c83 #define GF_T(_p) ((_p)->t)
343 const int t = GF_T(bch); in compute_syndromes() local
351 memset(syn, 0, 2*t*sizeof(*syn)); in compute_syndromes()
359 for (j = 0; j < 2*t; j += 2) in compute_syndromes()
367 for (j = 0; j < t; j++) in compute_syndromes()
379 const unsigned int t = GF_T(bch); in compute_error_locator_polynomial() local
387 memset(pelp, 0, GF_POLY_SZ(2*t)); in compute_error_locator_polynomial()
388 memset(elp, 0, GF_POLY_SZ(2*t)); in compute_error_locator_polynomial()
396 for (i = 0; (i < t) && (elp->deg <= t); i++) { in compute_error_locator_polynomial()
418 if (i < t-1) { in compute_error_locator_polynomial()
[all …]
Dkobject.c51 struct kobj_type *t = get_ktype(kobj); in populate_dir() local
56 if (t && t->default_attrs) { in populate_dir()
57 for (i = 0; (attr = t->default_attrs[i]) != NULL; i++) { in populate_dir()
276 char *t; in kobject_set_name_vargs() local
278 t = kstrdup(s, GFP_KERNEL); in kobject_set_name_vargs()
280 if (!t) in kobject_set_name_vargs()
282 strreplace(t, '/', '!'); in kobject_set_name_vargs()
283 s = t; in kobject_set_name_vargs()
617 struct kobj_type *t = get_ktype(kobj); in kobject_cleanup() local
623 if (t && !t->release) in kobject_cleanup()
[all …]
Ddiv64.c165 s64 quot, t; in div64_s64() local
168 t = (dividend ^ divisor) >> 63; in div64_s64()
170 return (quot ^ t) - t; in div64_s64()
Dts_fsm.c130 static inline int match_token(struct ts_fsm_token *t, u8 d) in match_token() argument
132 if (t->type) in match_token()
133 return (token_lookup_tbl[d] & t->type) != 0; in match_token()
135 return t->value == d; in match_token()
276 struct ts_fsm_token *t = &tokens[i]; in fsm_init() local
278 if (t->type > TS_FSM_TYPE_MAX || t->recur > TS_FSM_RECUR_MAX) in fsm_init()
281 if (t->recur == TS_FSM_HEAD_IGNORE && in fsm_init()
296 struct ts_fsm_token *t = &fsm->tokens[i]; in fsm_init() local
297 t->type = token_map[t->type]; in fsm_init()
Dplist.c33 static void plist_check_prev_next(struct list_head *t, struct list_head *p, in plist_check_prev_next() argument
40 t, t->next, t->prev, in plist_check_prev_next()
Didr.c939 int t, id; in ida_get_new_above() local
943 t = idr_get_empty_slot(&ida->idr, idr_id, pa, 0, &ida->idr); in ida_get_new_above()
944 if (t < 0) in ida_get_new_above()
945 return t == -ENOMEM ? -EAGAIN : t; in ida_get_new_above()
947 if (t * IDA_BITMAP_BITS >= MAX_IDR_BIT) in ida_get_new_above()
950 if (t != idr_id) in ida_get_new_above()
952 idr_id = t; in ida_get_new_above()
972 t = find_next_zero_bit(bitmap->bitmap, IDA_BITMAP_BITS, offset); in ida_get_new_above()
973 if (t == IDA_BITMAP_BITS) { in ida_get_new_above()
980 id = idr_id * IDA_BITMAP_BITS + t; in ida_get_new_above()
[all …]
DKconfig.kasan20 Currently CONFIG_KASAN doesn't work with CONFIG_DEBUG_SLAB
34 however it doesn't bloat size of kernel's .text section so
DKconfig304 values for parameters 'm' (Galois field order) and 't'
310 usual (m,t) values (typically such that m*t < 200).
312 only a single (m,t) configuration. This is mainly useful
322 that (k + m*t) <= 2**m - 1.
329 Constant value for error correction capability in bits 't'.
441 working on the code to ensure they haven't introduced any
446 it, but you probably don't need it.
DKconfig.ubsan27 If you don't enable this option, you have to explicitly specify
/lib/842/
D842_compress.c234 u8 *t = comp_ops[c]; in add_template() local
240 pr_debug("template %x\n", t[4]); in add_template()
242 ret = add_bits(p, t[4], OP_BITS); in add_template()
247 pr_debug("op %x\n", t[i]); in add_template()
249 switch (t[i] & OP_AMOUNT) { in add_template()
253 else if (t[i] & OP_ACTION_INDEX) in add_template()
255 else if (t[i] & OP_ACTION_DATA) in add_template()
261 if (b == 2 && t[i] & OP_ACTION_DATA) in add_template()
265 else if (t[i] & OP_ACTION_INDEX) in add_template()
267 else if (t[i] & OP_ACTION_DATA) in add_template()
[all …]
/lib/reed_solomon/
Ddecode_rs.c35 uint16_t b[nroots + 1], t[nroots + 1], omega[nroots + 1]; variable
142 t[0] = lambda[0];
145 t[i + 1] = lambda[i + 1] ^
149 t[i + 1] = lambda[i + 1];
167 memcpy(lambda, t, (nroots + 1) * sizeof(t[0]));
/lib/xz/
DKconfig56 Unless you are developing the XZ decoder, you don't need this
/lib/fonts/
DKconfig17 Note that the answer to this question won't directly affect the
52 framebuffer drivers don't support this one at all.

12