| /lib/ |
| D | klist.c | 95 static void add_head(struct klist *k, struct klist_node *n) in add_head()
102 static void add_tail(struct klist *k, struct klist_node *n) in add_tail()
109 static void klist_node_init(struct klist *k, struct klist_node *n) in klist_node_init()
123 void klist_add_head(struct klist_node *n, struct klist *k) in klist_add_head()
135 void klist_add_tail(struct klist_node *n, struct klist *k) in klist_add_tail()
147 void klist_add_behind(struct klist_node *n, struct klist_node *pos) in klist_add_behind()
163 void klist_add_before(struct klist_node *n, struct klist_node *pos) in klist_add_before()
187 struct klist_node *n = container_of(kref, struct klist_node, n_ref); in klist_release() local
205 static int klist_dec_and_del(struct klist_node *n) in klist_dec_and_del()
210 static void klist_put(struct klist_node *n, bool kill) in klist_put()
[all …]
|
| D | div64.c | 26 uint32_t __attribute__((weak)) __div64_32(uint64_t *n, uint32_t base) in __div64_32()
103 int n = fls(high); in div64_u64_rem() local
141 int n = fls(high); in div64_u64() local
|
| D | strnlen_user.c | 9 # define aligned_byte_mask(n) ((1ul << 8*(n))-1) argument
11 # define aligned_byte_mask(n) (~0xfful << (BITS_PER_LONG - 8 - 8*(n))) argument
|
| D | inflate.c | 142 ush n; /* literal, length base, or distance base */ member
233 #define NEEDBITS(n) {while(k<(n)){b|=((ulg)NEXTBYTE())<<k;k+=8;}} argument
234 #define DUMPBITS(n) {b>>=(n);k-=(n);} argument
323 unsigned n, /* number of codes (assumed <= N_MAX) */ in huft_build()
598 unsigned n, d; /* length and index for copy */ in inflate_codes() local
706 unsigned n; /* number of bytes in block */ in inflate_stored() local
835 unsigned n; /* number of lengths to get */ in inflate_dynamic() local
|
| D | idr.c | 223 int n, m, sh; in sub_alloc() local
514 int n; in sub_remove() local
585 int n, id, max; in __idr_remove_all() local
644 int n; in idr_find_slowpath() local
689 int n, id, max, error = 0; in idr_for_each() local
741 int n, max; in idr_get_next() local
795 int n; in idr_replace() local
1016 int n; in ida_remove() local
|
| D | kfifo.c | 312 int n; in setup_sgl_buf() local
354 unsigned int n; in setup_sgl() local
435 static void __kfifo_poke_n(struct __kfifo *fifo, unsigned int n, size_t recsize) in __kfifo_poke_n()
467 void *buf, unsigned int len, size_t recsize, unsigned int *n) in kfifo_out_copy_r()
481 unsigned int n; in __kfifo_out_peek_r() local
493 unsigned int n; in __kfifo_out_r() local
506 unsigned int n; in __kfifo_skip_r() local
541 unsigned int n; in __kfifo_to_user_r() local
|
| D | cpumask.c | 16 int cpumask_next_and(int n, const struct cpumask *src1p, in cpumask_next_and()
57 int cpumask_next_wrap(int n, const struct cpumask *mask, int start, bool wrap) in cpumask_next_wrap()
|
| D | iov_iter.c | 8 #define iterate_iovec(i, n, __v, __p, skip, STEP) { \ argument
36 #define iterate_kvec(i, n, __v, __p, skip, STEP) { \ argument
59 #define iterate_bvec(i, n, __v, __p, skip, STEP) { \ argument
84 #define iterate_all_kinds(i, n, v, I, B, K) { \ argument
101 #define iterate_and_advance(i, n, v, I, B, K) { \ argument
589 static struct page **get_pages_array(size_t n) in get_pages_array()
780 ssize_t n; in import_iovec() local
803 ssize_t n; in compat_import_iovec() local
|
| D | asn1_decoder.c | 65 size_t dp = *_dp, len, n; in asn1_find_indefinite_length() local
273 int n = len - 0x80; in asn1_ber_decoder() local
|
| D | rational.c | 35 unsigned long n, d, n0, d0, n1, d1; in rational_best_approximation() local
|
| D | btree.c | 103 static int longcmp(const unsigned long *l1, const unsigned long *l2, size_t n) in longcmp()
117 size_t n) in longcpy()
126 static unsigned long *longset(unsigned long *s, unsigned long c, size_t n) in longset()
148 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey()
153 static void *bval(struct btree_geo *geo, unsigned long *node, int n) in bval()
158 static void setkey(struct btree_geo *geo, unsigned long *node, int n, in setkey()
164 static void setval(struct btree_geo *geo, unsigned long *node, int n, in setval()
170 static void clearpair(struct btree_geo *geo, unsigned long *node, int n) in clearpair()
|
| D | bch.c | 258 const unsigned int n = GF_N(bch); in modulo() local
271 const unsigned int n = GF_N(bch); in mod_s() local
380 const unsigned int n = GF_N(bch); in compute_error_locator_polynomial() local
548 int n = 0; in find_poly_deg1_roots() local
563 int n = 0, i, l0, l1, l2; in find_poly_deg2_roots() local
605 int i, n = 0; in find_poly_deg3_roots() local
638 int i, l, n = 0; in find_poly_deg4_roots() local
1168 int n, err = 0; in compute_generator_polynomial() local
|
| D | cmdline.c | 25 static int get_range(char **str, int *pint, int n) in get_range()
|
| D | rbtree.c | 452 struct rb_node *n; in rb_first() local
465 struct rb_node *n; in rb_last() local
|
| D | oid_registry.c | 114 unsigned char n; in sprint_oid() local
|
| D | sort.c | 64 int i = (num/2 - 1) * size, n = num * size, c, r; in sort() local
|
| D | glob.c | 253 unsigned n = 0; in glob_init() local
|
| D | plist.c | 34 struct list_head *n) in plist_check_prev_next()
|
| /lib/mpi/ |
| D | mpi-internal.h | 76 #define MPN_COPY(d, s, n) \ argument
83 #define MPN_COPY_INCR(d, s, n) \ argument
90 #define MPN_COPY_DECR(d, s, n) \ argument
98 #define MPN_ZERO(d, n) \ argument
105 #define MPN_NORMALIZE(d, n) \ argument
114 #define MPN_NORMALIZE_NOT_ZERO(d, n) \ argument
|
| D | mpi-bit.c | 41 unsigned n; in mpi_get_nbits() local
|
| D | mpicoder.c | 165 unsigned int n = mpi_get_size(a); in mpi_read_buffer() local
231 unsigned int n; in mpi_get_buffer() local
355 unsigned int n = mpi_get_size(a); in mpi_write_to_sgl() local
|
| /lib/zlib_deflate/ |
| D | deftree.c | 228 int n; /* iterates over tree elements */ in tr_static_init() local
330 int n; /* iterates over tree elements */ in init_block() local
361 #define smaller(tree, n, m, depth) \ argument
419 int n, m; /* iterate over the tree elements */ in gen_bitlen() local
504 int n; /* code index */ in gen_codes() local
546 int n, m; /* iterate over heap elements */ in build_tree() local
632 int n; /* iterates over all tree elements */ in scan_tree() local
678 int n; /* iterates over all tree elements */ in send_tree() local
1076 int n = 0; local
|
| /lib/842/ |
| D | 842_decompress.c | 76 static int __split_next_bits(struct sw842_param *p, u64 *d, u8 n, u8 s) in __split_next_bits()
96 static int next_bits(struct sw842_param *p, u64 *d, u8 n) in next_bits()
140 static int do_data(struct sw842_param *p, u8 n) in do_data()
217 static int do_index(struct sw842_param *p, u8 n) in do_index()
|
| D | 842_compress.c | 131 #define find_index(p, b, n) ({ \ argument
143 #define check_index(p, b, n) \ argument
163 static int __split_add_bits(struct sw842_param *p, u64 d, u8 n, u8 s) in __split_add_bits()
176 static int add_bits(struct sw842_param *p, u64 d, u8 n) in add_bits()
|
| /lib/zlib_inflate/ |
| D | inflate.c | 206 #define NEEDBITS(n) \ argument
213 #define BITS(n) \ argument
217 #define DROPBITS(n) \ argument
|