| /lib/ |
| D | radix-tree.c | 83 static inline gfp_t root_gfp_mask(struct radix_tree_root *root) in root_gfp_mask() argument
85 return root->gfp_mask & __GFP_BITS_MASK; in root_gfp_mask()
106 static inline void root_tag_set(struct radix_tree_root *root, unsigned int tag) in root_tag_set() argument
108 root->gfp_mask |= (__force gfp_t)(1 << (tag + __GFP_BITS_SHIFT)); in root_tag_set()
111 static inline void root_tag_clear(struct radix_tree_root *root, unsigned int tag) in root_tag_clear() argument
113 root->gfp_mask &= (__force gfp_t)~(1 << (tag + __GFP_BITS_SHIFT)); in root_tag_clear()
116 static inline void root_tag_clear_all(struct radix_tree_root *root) in root_tag_clear_all() argument
118 root->gfp_mask &= __GFP_BITS_MASK; in root_tag_clear_all()
121 static inline int root_tag_get(struct radix_tree_root *root, unsigned int tag) in root_tag_get() argument
123 return (__force unsigned)root->gfp_mask & (1 << (tag + __GFP_BITS_SHIFT)); in root_tag_get()
[all …]
|
| D | rbtree_test.c | 26 static struct rb_root root = RB_ROOT; variable
31 static void insert(struct test_node *node, struct rb_root *root) in insert() argument
33 struct rb_node **new = &root->rb_node, *parent = NULL; in insert()
45 rb_insert_color(&node->rb, root); in insert()
48 static inline void erase(struct test_node *node, struct rb_root *root) in erase() argument
50 rb_erase(&node->rb, root); in erase()
74 static void insert_augmented(struct test_node *node, struct rb_root *root) in RB_DECLARE_CALLBACKS()
76 struct rb_node **new = &root->rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS()
94 rb_insert_augmented(&node->rb, root, &augment_callbacks); in RB_DECLARE_CALLBACKS()
97 static void erase_augmented(struct test_node *node, struct rb_root *root) in erase_augmented() argument
[all …]
|
| D | rbtree.c | 88 struct rb_root *root, int color) in __rb_rotate_set_parents() argument
93 __rb_change_child(old, new, parent, root); in __rb_rotate_set_parents()
97 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
181 __rb_rotate_set_parents(gparent, parent, root, RB_RED); in __rb_insert()
216 __rb_rotate_set_parents(gparent, parent, root, RB_RED); in __rb_insert()
228 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color() argument
257 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color()
334 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color()
346 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color()
387 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color()
[all …]
|
| D | interval_tree_test.c | 22 static struct rb_root root = RB_ROOT; variable
29 search(struct rb_root *root, unsigned long start, unsigned long last) in search() argument
34 for (node = interval_tree_iter_first(root, start, last); node; in search()
86 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
88 interval_tree_remove(nodes + j, &root); in interval_tree_test_init()
100 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
110 results += search(&root, start, last); in interval_tree_test_init()
|
| D | assoc_array.c | 23 static int assoc_array_subtree_iterate(const struct assoc_array_ptr *root, in assoc_array_subtree_iterate() argument
35 cursor = root; in assoc_array_subtree_iterate()
150 struct assoc_array_ptr *root = ACCESS_ONCE(array->root); in assoc_array_iterate() local
152 if (!root) in assoc_array_iterate()
154 return assoc_array_subtree_iterate(root, NULL, iterator, iterator_data); in assoc_array_iterate()
197 cursor = ACCESS_ONCE(array->root); in assoc_array_walk()
360 static void assoc_array_destroy_subtree(struct assoc_array_ptr *root, in assoc_array_destroy_subtree() argument
370 cursor = root; in assoc_array_destroy_subtree()
461 assoc_array_destroy_subtree(array->root, ops); in assoc_array_destroy()
462 array->root = NULL; in assoc_array_destroy()
[all …]
|
| D | Kconfig.debug | 1447 ones, so root partition specified using device number
1448 directly (via rdev or root=MAJ:MIN) won't work anymore.
1449 Textual device names (root=/dev/sdXn) will continue to work.
|
| /lib/zlib_inflate/ |
| D | inftrees.c | 29 unsigned root; /* number of index bits for root table */ in zlib_inflate_table() local
99 root = *bits; in zlib_inflate_table()
102 if (root > max) root = max; in zlib_inflate_table()
114 if (root < min) root = min; in zlib_inflate_table()
191 curr = root; /* current table index bits */ in zlib_inflate_table()
194 used = 1U << root; /* use root table entries */ in zlib_inflate_table()
246 if (len > root && (huff & mask) != low) { in zlib_inflate_table()
249 drop = root; in zlib_inflate_table()
272 (*table)[low].bits = (unsigned char)root; in zlib_inflate_table()
291 len = root; in zlib_inflate_table()
[all …]
|
| /lib/reed_solomon/ |
| D | reed_solomon.c | 70 int i, j, sr, root, iprim; in rs_init() local
132 for (i = 0, root = fcr * prim; i < nroots; i++, root += prim) { in rs_init()
139 rs->index_of[rs->genpoly[j]] + root)]; in rs_init()
146 rs->index_of[rs->genpoly[0]] + root)]; in rs_init()
|
| D | decode_rs.c | 36 uint16_t root[nroots], reg[nroots + 1], loc[nroots]; variable
202 root[count] = i;
242 i * root[j])];
244 num2 = alpha_to[rs_modnn(rs, root[j] * (fcr - 1) + nn)];
252 i * root[j])];
|