Home
last modified time | relevance | path

Searched defs:m (Results 1 – 22 of 22) sorted by relevance

/lib/
Dwin_minmax.c29 static u32 minmax_subwin_update(struct minmax *m, u32 win, in minmax_subwin_update()
67 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()
Derror-inject.c158 static void *ei_seq_start(struct seq_file *m, loff_t *pos) in ei_seq_start()
164 static void ei_seq_stop(struct seq_file *m, void *v) in ei_seq_stop()
169 static void *ei_seq_next(struct seq_file *m, void *v, loff_t *pos) in ei_seq_next()
188 static int ei_seq_show(struct seq_file *m, void *v) in ei_seq_show()
Dsiphash.c56 u64 m; in __siphash_aligned() local
89 u64 m; in __siphash_unaligned() local
257 u64 m; in __hsiphash_aligned() local
290 u64 m; in __hsiphash_unaligned() local
425 u32 m; in __hsiphash_aligned() local
448 u32 m; in __hsiphash_unaligned() local
Dtest_hash.c89 u32 const m = ((u32)2 << (k-1)) - 1; /* Low k bits set */ in test_int_hash() local
208 u32 const m = ((u32)2 << (i-1)) - 1; /* Low i bits set */ in test_hash_init() local
Dbch.c195 unsigned long m; in encode_bch() local
351 unsigned int m; in compute_syndromes() local
445 const int m = GF_M(bch); in solve_linear_system() local
523 const int m = GF_M(bch); in find_affine4_roots() local
725 int la, p, m; in gf_poly_mod() local
809 const int m = GF_M(bch); in compute_trace_bk_mod() local
927 int m; in chien_search() local
1125 const int m = GF_M(bch); in build_deg2_base() local
1176 const unsigned int m = GF_M(bch); in compute_generator_polynomial() local
1259 struct bch_control *init_bch(int m, int t, unsigned int prim_poly) in init_bch()
Dsbitmap.c281 void sbitmap_show(struct sbitmap *sb, struct seq_file *m) in sbitmap_show()
291 static inline void emit_byte(struct seq_file *m, unsigned int offset, u8 byte) in emit_byte()
303 void sbitmap_bitmap_show(struct sbitmap *sb, struct seq_file *m) in sbitmap_bitmap_show()
627 void sbitmap_queue_show(struct sbitmap_queue *sbq, struct seq_file *m) in sbitmap_queue_show()
Dextable.c76 void trim_init_extable(struct module *m) in trim_init_extable()
Ddynamic_debug.c768 static void *ddebug_proc_start(struct seq_file *m, loff_t *pos) in ddebug_proc_start()
793 static void *ddebug_proc_next(struct seq_file *m, void *p, loff_t *pos) in ddebug_proc_next()
815 static int ddebug_proc_show(struct seq_file *m, void *p) in ddebug_proc_show()
843 static void ddebug_proc_stop(struct seq_file *m, void *p) in ddebug_proc_stop()
Ddigsig.c77 const char *m; in digsig_verify_rsa() local
Dseq_buf.c40 int seq_buf_print_seq(struct seq_file *m, struct seq_buf *s) in seq_buf_print_seq()
Dinflate.c329 int *m /* maximum lookup bits, returns actual */ in huft_build()
835 unsigned m; /* mask for bit lengths table */ in inflate_dynamic() local
Dlocking-selftest.c1182 #define dotest_rt(fn, e, m) dotest((fn), (e), (m)) argument
1184 #define dotest_rt(fn, e, m) argument
Ddebugobjects.c1000 static int debug_stats_show(struct seq_file *m, void *v) in debug_stats_show()
Dbitmap.c958 unsigned int n, m; /* same meaning as in above comment */ in bitmap_onto() local
/lib/math/
Dint_sqrt.c21 unsigned long b, m, y = 0; in int_sqrt() local
50 u64 b, m, y = 0; in int_sqrt64() local
Dreciprocal_div.c16 u64 m; in reciprocal_value() local
Dprime_numbers.c95 unsigned long m; in clear_multiples() local
/lib/livepatch/
Dtest_klp_livepatch.c11 static int livepatch_cmdline_proc_show(struct seq_file *m, void *v) 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()
/lib/842/
D842_debugfs.h18 umode_t m = S_IRUGO | S_IWUSR; in sw842_debugfs_create() local
/lib/zlib_deflate/
Ddeftree.c361 #define smaller(tree, n, m, depth) \ argument
419 int n, m; /* iterate over the tree elements */ in gen_bitlen() local
546 int n, m; /* iterate over heap elements */ in build_tree() local
Ddeflate.c737 register unsigned n, m; in fill_window() local