Home
last modified time | relevance | path

Searched refs:m (Results 1 – 25 of 27) sorted by relevance

12

/lib/
Dwin_minmax.c29 static u32 minmax_subwin_update(struct minmax *m, u32 win, in minmax_subwin_update() argument
32 u32 dt = val->t - m->s[0].t; in minmax_subwin_update()
42 m->s[0] = m->s[1]; in minmax_subwin_update()
43 m->s[1] = m->s[2]; in minmax_subwin_update()
44 m->s[2] = *val; in minmax_subwin_update()
45 if (unlikely(val->t - m->s[0].t > win)) { in minmax_subwin_update()
46 m->s[0] = m->s[1]; in minmax_subwin_update()
47 m->s[1] = m->s[2]; in minmax_subwin_update()
48 m->s[2] = *val; in minmax_subwin_update()
50 } else if (unlikely(m->s[1].t == m->s[0].t) && dt > win/4) { in minmax_subwin_update()
[all …]
Dextable.c76 void trim_init_extable(struct module *m) in trim_init_extable() argument
79 while (m->num_exentries && in trim_init_extable()
80 within_module_init(ex_to_insn(&m->extable[0]), m)) { in trim_init_extable()
81 m->extable++; in trim_init_extable()
82 m->num_exentries--; in trim_init_extable()
85 while (m->num_exentries && in trim_init_extable()
86 within_module_init(ex_to_insn(&m->extable[m->num_exentries - 1]), in trim_init_extable()
87 m)) in trim_init_extable()
88 m->num_exentries--; in trim_init_extable()
Dtest_hash.c89 u32 const m = ((u32)2 << (k-1)) - 1; /* Low k bits set */ in test_int_hash() local
93 if (h1 > m) { in test_int_hash()
94 pr_err("hash_32(%#x, %d) = %#x > %#x", h0, k, h1, m); in test_int_hash()
106 if (h2 > m) { in test_int_hash()
108 h0, k, h1, m); in test_int_hash()
115 if (h1 > m) { in test_int_hash()
116 pr_err("hash_64(%#llx, %d) = %#x > %#x", h64, k, h1, m); in test_int_hash()
128 if (h2 > m) { in test_int_hash()
130 h64, k, h1, m); in test_int_hash()
208 u32 const m = ((u32)2 << (i-1)) - 1; /* Low i bits set */ in test_hash_init() local
[all …]
Dsbitmap.c281 void sbitmap_show(struct sbitmap *sb, struct seq_file *m) in sbitmap_show() argument
283 seq_printf(m, "depth=%u\n", sb->depth); in sbitmap_show()
284 seq_printf(m, "busy=%u\n", sbitmap_weight(sb) - sbitmap_cleared(sb)); in sbitmap_show()
285 seq_printf(m, "cleared=%u\n", sbitmap_cleared(sb)); in sbitmap_show()
286 seq_printf(m, "bits_per_word=%u\n", 1U << sb->shift); in sbitmap_show()
287 seq_printf(m, "map_nr=%u\n", sb->map_nr); in sbitmap_show()
291 static inline void emit_byte(struct seq_file *m, unsigned int offset, u8 byte) in emit_byte() argument
295 seq_putc(m, '\n'); in emit_byte()
296 seq_printf(m, "%08x:", offset); in emit_byte()
299 seq_putc(m, ' '); in emit_byte()
[all …]
Dsiphash.c56 u64 m; in __siphash_aligned() local
59 m = le64_to_cpup(data); in __siphash_aligned()
60 v3 ^= m; in __siphash_aligned()
63 v0 ^= m; in __siphash_aligned()
89 u64 m; in __siphash_unaligned() local
92 m = get_unaligned_le64(data); in __siphash_unaligned()
93 v3 ^= m; in __siphash_unaligned()
96 v0 ^= m; in __siphash_unaligned()
257 u64 m; in __hsiphash_aligned() local
260 m = le64_to_cpup(data); in __hsiphash_aligned()
[all …]
Dbch.c84 #define GF_M(_p) ((_p)->m)
195 unsigned long m; in encode_bch() local
215 m = ((unsigned long)data) & 3; in encode_bch()
216 if (m) { in encode_bch()
217 mlen = (len < (4-m)) ? len : 4-m; in encode_bch()
351 unsigned int m; in compute_syndromes() local
358 m = ((unsigned int)s) & 31; in compute_syndromes()
359 if (m) in compute_syndromes()
360 ecc[s/32] &= ~((1u << (32-m))-1); in compute_syndromes()
445 const int m = GF_M(bch); in solve_linear_system() local
[all …]
Derror-inject.c158 static void *ei_seq_start(struct seq_file *m, loff_t *pos) in ei_seq_start() argument
164 static void ei_seq_stop(struct seq_file *m, void *v) in ei_seq_stop() argument
169 static void *ei_seq_next(struct seq_file *m, void *v, loff_t *pos) in ei_seq_next() argument
188 static int ei_seq_show(struct seq_file *m, void *v) in ei_seq_show() argument
192 seq_printf(m, "%ps\t%s\n", (void *)ent->start_addr, in ei_seq_show()
Ddynamic_debug.c768 static void *ddebug_proc_start(struct seq_file *m, loff_t *pos) in ddebug_proc_start() argument
770 struct ddebug_iter *iter = m->private; in ddebug_proc_start()
774 vpr_info("called m=%p *pos=%lld\n", m, (unsigned long long)*pos); in ddebug_proc_start()
793 static void *ddebug_proc_next(struct seq_file *m, void *p, loff_t *pos) in ddebug_proc_next() argument
795 struct ddebug_iter *iter = m->private; in ddebug_proc_next()
799 m, p, (unsigned long long)*pos); in ddebug_proc_next()
815 static int ddebug_proc_show(struct seq_file *m, void *p) in ddebug_proc_show() argument
817 struct ddebug_iter *iter = m->private; in ddebug_proc_show()
821 vpr_info("called m=%p p=%p\n", m, p); in ddebug_proc_show()
824 seq_puts(m, in ddebug_proc_show()
[all …]
Ddigsig.c77 const char *m; in digsig_verify_rsa() local
167 m = pkcs_1_v1_5_decode_emsa(out1, len, mblen, &len); in digsig_verify_rsa()
169 if (!m || len != hlen || memcmp(m, h, hlen)) in digsig_verify_rsa()
Ddebugobjects.c1000 static int debug_stats_show(struct seq_file *m, void *v) in debug_stats_show() argument
1007 seq_printf(m, "max_chain :%d\n", debug_objects_maxchain); in debug_stats_show()
1008 seq_printf(m, "max_checked :%d\n", debug_objects_maxchecked); in debug_stats_show()
1009 seq_printf(m, "warnings :%d\n", debug_objects_warnings); in debug_stats_show()
1010 seq_printf(m, "fixups :%d\n", debug_objects_fixups); in debug_stats_show()
1011 seq_printf(m, "pool_free :%d\n", obj_pool_free + obj_percpu_free); in debug_stats_show()
1012 seq_printf(m, "pool_pcp_free :%d\n", obj_percpu_free); in debug_stats_show()
1013 seq_printf(m, "pool_min_free :%d\n", obj_pool_min_free); in debug_stats_show()
1014 seq_printf(m, "pool_used :%d\n", obj_pool_used - obj_percpu_free); in debug_stats_show()
1015 seq_printf(m, "pool_max_used :%d\n", obj_pool_max_used); in debug_stats_show()
[all …]
Dinflate.c329 int *m /* maximum lookup bits, returns actual */ in huft_build() argument
385 *m = 0; in huft_build()
393 l = *m; in huft_build()
406 *m = l; in huft_build()
835 unsigned m; /* mask for bit lengths table */ in inflate_dynamic() local
913 m = mask_bits[bl]; in inflate_dynamic()
918 j = (td = tl + ((unsigned)b & m))->b; in inflate_dynamic()
Dseq_buf.c40 int seq_buf_print_seq(struct seq_file *m, struct seq_buf *s) in seq_buf_print_seq() argument
44 return seq_write(m, s->buffer, len); in seq_buf_print_seq()
DKconfig366 values for parameters 'm' (Galois field order) and 't'
372 usual (m,t) values (typically such that m*t < 200).
374 only a single (m,t) configuration. This is mainly useful
382 Constant value for Galois field order 'm'. If 'k' is the
383 number of data bits to protect, 'm' should be chosen such
384 that (k + m*t) <= 2**m - 1.
Dbitmap.c958 unsigned int n, m; /* same meaning as in above comment */ in bitmap_onto() local
974 m = 0; in bitmap_onto()
977 if (test_bit(m, orig)) in bitmap_onto()
979 m++; in bitmap_onto()
DKconfig.ubsan46 depends on m && UBSAN
DKconfig.debug592 depends on DEBUG_KMEMLEAK && m
1477 default m if PM_DEBUG
1688 depends on DEBUG_KERNEL || m
1698 depends on DEBUG_KERNEL || m
1739 depends on DEBUG_KERNEL || m
1758 depends on m && DEBUG_KERNEL
1863 depends on m
1878 depends on m
1889 depends on m
1901 depends on m && NET
[all …]
/lib/math/
Dint_sqrt.c21 unsigned long b, m, y = 0; in int_sqrt() local
26 m = 1UL << (__fls(x) & ~1UL); in int_sqrt()
27 while (m != 0) { in int_sqrt()
28 b = y + m; in int_sqrt()
33 y += m; in int_sqrt()
35 m >>= 2; in int_sqrt()
50 u64 b, m, y = 0; in int_sqrt64() local
55 m = 1ULL << ((fls64(x) - 1) & ~1ULL); in int_sqrt64()
56 while (m != 0) { in int_sqrt64()
57 b = y + m; in int_sqrt64()
[all …]
Dreciprocal_div.c16 u64 m; in reciprocal_value() local
20 m = ((1ULL << 32) * ((1ULL << l) - d)); in reciprocal_value()
21 do_div(m, d); in reciprocal_value()
22 ++m; in reciprocal_value()
23 R.m = (u32)m; in reciprocal_value()
62 R.m = (u32)mhigh; in reciprocal_value_adv()
Dprime_numbers.c95 unsigned long m; in clear_multiples() local
97 m = 2 * x; in clear_multiples()
98 if (m < start) in clear_multiples()
99 m = roundup(start, x); in clear_multiples()
101 while (m < end) { in clear_multiples()
102 __clear_bit(m, p); in clear_multiples()
103 m += x; in clear_multiples()
/lib/842/
D842_debugfs.h18 umode_t m = S_IRUGO | S_IWUSR; in sw842_debugfs_create() local
30 debugfs_create_atomic_t(name, m, sw842_debugfs_root, in sw842_debugfs_create()
33 debugfs_create_atomic_t("template_repeat", m, sw842_debugfs_root, in sw842_debugfs_create()
35 debugfs_create_atomic_t("template_zeros", m, sw842_debugfs_root, in sw842_debugfs_create()
37 debugfs_create_atomic_t("template_short_data", m, sw842_debugfs_root, in sw842_debugfs_create()
39 debugfs_create_atomic_t("template_end", m, sw842_debugfs_root, in sw842_debugfs_create()
/lib/zlib_deflate/
Ddeftree.c361 #define smaller(tree, n, m, depth) \ argument
362 (tree[n].Freq < tree[m].Freq || \
363 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
419 int n, m; /* iterate over the tree elements */ in gen_bitlen() local
474 m = s->heap[--h]; in gen_bitlen()
475 if (m > max_code) continue; in gen_bitlen()
476 if (tree[m].Len != (unsigned) bits) { in gen_bitlen()
477 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); in gen_bitlen()
478 s->opt_len += ((long)bits - (long)tree[m].Len) in gen_bitlen()
479 *(long)tree[m].Freq; in gen_bitlen()
[all …]
Ddeflate.c737 register unsigned n, m; in fill_window() local
775 m = *--p; in fill_window()
776 *p = (Pos)(m >= wsize ? m-wsize : NIL); in fill_window()
782 m = *--p; in fill_window()
783 *p = (Pos)(m >= wsize ? m-wsize : NIL); in fill_window()
/lib/livepatch/
Dtest_klp_livepatch.c11 static int livepatch_cmdline_proc_show(struct seq_file *m, void *v) in livepatch_cmdline_proc_show() argument
13 seq_printf(m, "%s: %s\n", THIS_MODULE->name, in livepatch_cmdline_proc_show()
Dtest_klp_atomic_replace.c15 static int livepatch_meminfo_proc_show(struct seq_file *m, void *v) in livepatch_meminfo_proc_show() argument
17 seq_printf(m, "%s: %s\n", THIS_MODULE->name, in livepatch_meminfo_proc_show()
/lib/raid6/
Ds390vx.uc64 : : "m" (*__ptr), "a" (__ptr), "i" (x),
74 : "=m" (*__ptr) : "a" (__ptr), "i" (x),

12