Home
last modified time | relevance | path

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

12

/lib/
A Dwin_minmax.c42 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()
46 m->s[0] = m->s[1]; in minmax_subwin_update()
47 m->s[1] = m->s[2]; in minmax_subwin_update()
50 } else if (unlikely(m->s[1].t == m->s[0].t) && dt > win/4) { in minmax_subwin_update()
55 m->s[2] = m->s[1] = *val; in minmax_subwin_update()
56 } else if (unlikely(m->s[2].t == m->s[1].t) && dt > win/2) { in minmax_subwin_update()
76 m->s[2] = m->s[1] = val; in minmax_running_max()
78 m->s[2] = val; in minmax_running_max()
[all …]
A Dextable.c75 void trim_init_extable(struct module *m) in trim_init_extable() argument
78 while (m->num_exentries && in trim_init_extable()
79 within_module_init(ex_to_insn(&m->extable[0]), m)) { in trim_init_extable()
80 m->extable++; in trim_init_extable()
81 m->num_exentries--; in trim_init_extable()
84 while (m->num_exentries && in trim_init_extable()
85 within_module_init(ex_to_insn(&m->extable[m->num_exentries - 1]), in trim_init_extable()
86 m)) in trim_init_extable()
87 m->num_exentries--; in trim_init_extable()
A Dsiphash.c50 u64 m; in __siphash_aligned() local
54 v3 ^= m; in __siphash_aligned()
57 v0 ^= m; in __siphash_aligned()
83 u64 m; in __siphash_unaligned() local
87 v3 ^= m; in __siphash_unaligned()
90 v0 ^= m; in __siphash_unaligned()
251 u64 m; in __hsiphash_aligned() local
255 v3 ^= m; in __hsiphash_aligned()
284 u64 m; in __hsiphash_unaligned() local
413 u32 m; in __hsiphash_aligned() local
[all …]
A Dbch.c233 if (m) { in bch_encode()
234 mlen = (len < (4-m)) ? len : 4-m; in bch_encode()
382 if (m) in compute_syndromes()
473 mask = 1 << m; in solve_linear_system()
745 int la, p, m; in gf_poly_mod() local
763 m = rep[i]; in gf_poly_mod()
940 int m; in chien_search() local
953 if (m >= 0) in chien_search()
1299 if ((m < min_m) || (m > BCH_MAX_M)) in bch_init()
1315 if ((t < 1) || (m*t >= ((1 << m)-1))) in bch_init()
[all …]
A Dsbitmap.c394 seq_putc(m, '\n'); in emit_byte()
398 seq_putc(m, ' '); in emit_byte()
399 seq_printf(m, "%02x", byte); in emit_byte()
432 emit_byte(m, offset, byte); in sbitmap_bitmap_show()
436 seq_putc(m, '\n'); in sbitmap_bitmap_show()
730 sbitmap_show(&sbq->sb, m); in sbitmap_queue_show()
732 seq_puts(m, "alloc_hint={"); in sbitmap_queue_show()
736 seq_puts(m, ", "); in sbitmap_queue_show()
740 seq_puts(m, "}\n"); in sbitmap_queue_show()
746 seq_puts(m, "ws={\n"); in sbitmap_queue_show()
[all …]
A Dratelimit.c74 int m; in ___ratelimit() local
84 m = ratelimit_state_reset_miss(rs); in ___ratelimit()
85 if (m) { in ___ratelimit()
87 "%s: %d callbacks suppressed\n", func, m); in ___ratelimit()
A Derror-inject.c165 static void *ei_seq_start(struct seq_file *m, loff_t *pos) in ei_seq_start() argument
171 static void ei_seq_stop(struct seq_file *m, void *v) in ei_seq_stop() argument
176 static void *ei_seq_next(struct seq_file *m, void *v, loff_t *pos) in ei_seq_next() argument
197 static int ei_seq_show(struct seq_file *m, void *v) in ei_seq_show() argument
201 seq_printf(m, "%ps\t%s\n", (void *)ent->start_addr, in ei_seq_show()
A 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()
A Dbootconfig.c790 struct xbc_node *n, *m; in xbc_verify_tree() local
824 m = xbc_node_get_child(n); in xbc_verify_tree()
825 if (m && xbc_node_is_key(m)) { in xbc_verify_tree()
826 n = m; in xbc_verify_tree()
834 m = xbc_node_get_next(n); in xbc_verify_tree()
835 while (!m) { in xbc_verify_tree()
841 m = xbc_node_get_next(n); in xbc_verify_tree()
843 n = m; in xbc_verify_tree()
A Ddynamic_debug.c1078 struct ddebug_iter *iter = m->private; in ddebug_proc_start()
1101 struct ddebug_iter *iter = m->private; in ddebug_proc_next()
1132 static int ddebug_proc_show(struct seq_file *m, void *p) in ddebug_proc_show() argument
1134 struct ddebug_iter *iter = m->private; in ddebug_proc_show()
1140 seq_puts(m, in ddebug_proc_show()
1145 seq_printf(m, "%s:%u [%s]%s =%s \"", in ddebug_proc_show()
1149 seq_escape_str(m, dp->format, ESCAPE_SPACE, "\t\r\n\""); in ddebug_proc_show()
1150 seq_putc(m, '"'); in ddebug_proc_show()
1155 seq_printf(m, " class:%s", class); in ddebug_proc_show()
1157 seq_printf(m, " class unknown, _id:%d", dp->class_id); in ddebug_proc_show()
[all …]
A Ddebugobjects.c1135 static int debug_stats_show(struct seq_file *m, void *v) in debug_stats_show() argument
1152 seq_printf(m, "max_chain : %d\n", debug_objects_maxchain); in debug_stats_show()
1153 seq_printf(m, "max_checked : %d\n", debug_objects_maxchecked); in debug_stats_show()
1154 seq_printf(m, "warnings : %d\n", debug_objects_warnings); in debug_stats_show()
1155 seq_printf(m, "fixups : %d\n", debug_objects_fixups); in debug_stats_show()
1156 seq_printf(m, "pool_free : %u\n", pool_count(&pool_global) + pcp_free); in debug_stats_show()
1157 seq_printf(m, "pool_pcp_free : %u\n", pcp_free); in debug_stats_show()
1159 seq_printf(m, "pool_used : %u\n", pool_used); in debug_stats_show()
1161 seq_printf(m, "on_free_list : %u\n", pool_count(&pool_to_free)); in debug_stats_show()
1162 seq_printf(m, "objs_allocated: %d\n", debug_objects_allocated); in debug_stats_show()
[all …]
A Dalloc_tag.c48 static void *allocinfo_start(struct seq_file *m, loff_t *pos) in allocinfo_start() argument
53 priv = (struct allocinfo_private *)m->private; in allocinfo_start()
63 static void *allocinfo_next(struct seq_file *m, void *arg, loff_t *pos) in allocinfo_next() argument
75 static void allocinfo_stop(struct seq_file *m, void *arg) in allocinfo_stop() argument
99 static int allocinfo_show(struct seq_file *m, void *arg) in allocinfo_show() argument
103 size_t n = seq_get_buf(m, &bufp); in allocinfo_show()
112 seq_commit(m, seq_buf_used(&buf)); in allocinfo_show()
/lib/math/
A Dint_sqrt.c22 unsigned long b, m, y = 0; in int_sqrt() local
27 m = 1UL << (__fls(x) & ~1UL); in int_sqrt()
28 while (m != 0) { in int_sqrt()
29 b = y + m; in int_sqrt()
34 y += m; in int_sqrt()
36 m >>= 2; in int_sqrt()
51 u64 b, m, y = 0; in int_sqrt64() local
57 while (m != 0) { in int_sqrt64()
58 b = y + m; in int_sqrt64()
63 y += m; in int_sqrt64()
[all …]
A Dreciprocal_div.c20 u64 m; in reciprocal_value() local
24 m = ((1ULL << 32) * ((1ULL << l) - d)); in reciprocal_value()
25 do_div(m, d); in reciprocal_value()
26 ++m; in reciprocal_value()
27 R.m = (u32)m; in reciprocal_value()
66 R.m = (u32)mhigh; in reciprocal_value_adv()
A Dprime_numbers.c104 unsigned long m; in clear_multiples() local
106 m = 2 * x; in clear_multiples()
107 if (m < start) in clear_multiples()
108 m = roundup(start, x); in clear_multiples()
110 while (m < end) { in clear_multiples()
111 __clear_bit(m, p); in clear_multiples()
112 m += x; in clear_multiples()
/lib/842/
A 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/tests/
A Dtest_hash.c95 *params->h64, *k, params->h1, *m); in test_int_hash_64()
123 u32 const m = ((u32)2 << (k-1)) - 1; /* Low k bits set */ in test_int_hash() local
127 KUNIT_EXPECT_LE_MSG(test, params.h1, m, in test_int_hash()
129 params.h0, k, params.h1, m); in test_int_hash()
133 KUNIT_EXPECT_LE_MSG(test, params.h1, m, in test_int_hash()
135 h64, k, params.h1, m); in test_int_hash()
137 test_int_hash_64(test, &params, &m, &k); in test_int_hash()
215 KUNIT_EXPECT_EQ_MSG(test, hash_or[0][i], m, in test_hash_or()
217 i, hash_or[0][i], m); in test_hash_or()
218 KUNIT_EXPECT_EQ_MSG(test, hash_or[1][i], m, in test_hash_or()
[all …]
A Dcpumask_kunit.c12 #define MASK_MSG(m) \ argument
13 "%s contains %sCPUs %*pbl", #m, (cpumask_weight(m) ? "" : "no "), \
14 nr_cpumask_bits, cpumask_bits(m)
18 const cpumask_t *m = (mask); \
19 int mask_weight = cpumask_weight(m); \
21 for_each_cpu(cpu, m) \
41 const cpumask_t *m = (mask); \
42 int mask_weight = cpumask_weight(m); \
44 for_each_cpu_wrap(cpu, m, nr_cpu_ids / 2) \
/lib/crypto/
A Dblake2s-generic.c47 u32 m[16]; in blake2s_compress_generic() local
56 memcpy(m, block, BLAKE2S_BLOCK_SIZE); in blake2s_compress_generic()
57 le32_to_cpu_array(m, ARRAY_SIZE(m)); in blake2s_compress_generic()
69 a += b + m[blake2s_sigma[r][2 * i + 0]]; \ in blake2s_compress_generic()
73 a += b + m[blake2s_sigma[r][2 * i + 1]]; \ in blake2s_compress_generic()
/lib/zlib_deflate/
A Ddeftree.c307 #define smaller(tree, n, m, depth) \ argument
308 (tree[n].Freq < tree[m].Freq || \
309 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
420 m = s->heap[--h]; in gen_bitlen()
421 if (m > max_code) continue; in gen_bitlen()
422 if (tree[m].Len != (unsigned) bits) { in gen_bitlen()
423 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); in gen_bitlen()
426 tree[m].Len = (ush)bits; in gen_bitlen()
539 s->heap[--(s->heap_max)] = m; in build_tree()
544 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()
[all …]
/lib/crypto/arm/
A Dsha1-ce-core.S102 add_update m, 0, k2, 10, 11, 8, 9
103 add_update m, 1, k2, 11, 8, 9, 10
104 add_update m, 0, k2, 8, 9, 10, 11
105 add_update m, 1, k2, 9, 10, 11, 8
106 add_update m, 0, k3, 10, 11, 8, 9
/lib/crypto/arm64/
A Dsha1-ce-core.S103 add_update m, ev, k2, 10, 11, 8, 9
104 add_update m, od, k2, 11, 8, 9, 10
105 add_update m, ev, k2, 8, 9, 10, 11
106 add_update m, od, k2, 9, 10, 11, 8
107 add_update m, ev, k3, 10, 11, 8, 9
/lib/crypto/mpi/
A Dmpi-add.c108 int mpi_addm(MPI w, MPI u, MPI v, MPI m) in mpi_addm() argument
111 mpi_mod(w, w, m); in mpi_addm()
115 int mpi_subm(MPI w, MPI u, MPI v, MPI m) in mpi_subm() argument
118 mpi_mod(w, w, m); in mpi_subm()
A Dmpi-mul.c106 int mpi_mulm(MPI w, MPI u, MPI v, MPI m) in mpi_mulm() argument
109 mpi_tdiv_r(w, w, m); in mpi_mulm()
/lib/crypto/powerpc/
A Dpoly1305-p10-glue.c15 asmlinkage void poly1305_p10le_4blocks(struct poly1305_block_state *state, const u8 *m, u32 mlen);
16 asmlinkage void poly1305_64s(struct poly1305_block_state *state, const u8 *m, u32 mlen, int highbit…

Completed in 46 milliseconds

12