/lib/ |
D | radix-tree.c | 104 static inline gfp_t root_gfp_mask(const struct radix_tree_root *root) in root_gfp_mask() argument 106 return root->xa_flags & (__GFP_BITS_MASK & ~GFP_ZONEMASK); in root_gfp_mask() 127 static inline void root_tag_set(struct radix_tree_root *root, unsigned tag) in root_tag_set() argument 129 root->xa_flags |= (__force gfp_t)(1 << (tag + ROOT_TAG_SHIFT)); in root_tag_set() 132 static inline void root_tag_clear(struct radix_tree_root *root, unsigned tag) in root_tag_clear() argument 134 root->xa_flags &= (__force gfp_t)~(1 << (tag + ROOT_TAG_SHIFT)); in root_tag_clear() 137 static inline void root_tag_clear_all(struct radix_tree_root *root) in root_tag_clear_all() argument 139 root->xa_flags &= (__force gfp_t)((1 << ROOT_TAG_SHIFT) - 1); in root_tag_clear_all() 142 static inline int root_tag_get(const struct radix_tree_root *root, unsigned tag) in root_tag_get() argument 144 return (__force int)root->xa_flags & (1 << (tag + ROOT_TAG_SHIFT)); in root_tag_get() [all …]
|
D | rbtree_test.c | 27 static struct rb_root_cached root = RB_ROOT_CACHED; variable 32 static void insert(struct test_node *node, struct rb_root_cached *root) in insert() argument 34 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert() 46 rb_insert_color(&node->rb, &root->rb_root); in insert() 49 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached() argument 51 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert_cached() 66 rb_insert_color_cached(&node->rb, root, leftmost); in insert_cached() 69 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase() argument 71 rb_erase(&node->rb, &root->rb_root); in erase() 74 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached() argument [all …]
|
D | rbtree.c | 76 struct rb_root *root, int color) in __rb_rotate_set_parents() argument 81 __rb_change_child(old, new, parent, root); in __rb_rotate_set_parents() 85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument 180 __rb_rotate_set_parents(gparent, parent, root, RB_RED); in __rb_insert() 215 __rb_rotate_set_parents(gparent, parent, root, RB_RED); in __rb_insert() 227 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color() argument 256 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color() 348 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color() 360 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color() 401 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color() [all …]
|
D | interval_tree_test.c | 23 static struct rb_root_cached root = RB_ROOT_CACHED; variable 30 search(struct rb_root_cached *root, unsigned long start, unsigned long last) in search() argument 35 for (node = interval_tree_iter_first(root, start, last); node; in search() 88 interval_tree_insert(nodes + j, &root); in interval_tree_test_init() 90 interval_tree_remove(nodes + j, &root); in interval_tree_test_init() 102 interval_tree_insert(nodes + j, &root); in interval_tree_test_init() 112 results += search(&root, start, last); in interval_tree_test_init()
|
D | test_objagg.c | 37 struct root { struct 131 struct root *root; in root_create() local 133 root = kzalloc(sizeof(*root), GFP_KERNEL); in root_create() 134 if (!root) in root_create() 136 memcpy(&root->key, key, sizeof(root->key)); in root_create() 137 memcpy(root->buf, world->next_root_buf, sizeof(root->buf)); in root_create() 139 return root; in root_create() 144 struct root *root = root_priv; in root_destroy() local 148 kfree(root); in root_destroy() 156 const struct root *root; in test_nodelta_obj_get() local [all …]
|
D | generic-radix-tree.c | 56 struct genradix_root *r = READ_ONCE(radix->root); in __genradix_ptr() 107 struct genradix_root *v = READ_ONCE(radix->root); in __genradix_ptr_alloc() 131 if ((v = cmpxchg_release(&radix->root, r, new_root)) == r) { in __genradix_ptr_alloc() 170 r = READ_ONCE(radix->root); in __genradix_iter_peek() 232 struct genradix_root *r = xchg(&radix->root, NULL); in __genradix_free()
|
D | assoc_array.c | 19 static int assoc_array_subtree_iterate(const struct assoc_array_ptr *root, in assoc_array_subtree_iterate() argument 31 cursor = root; in assoc_array_subtree_iterate() 138 struct assoc_array_ptr *root = READ_ONCE(array->root); /* Address dependency. */ in assoc_array_iterate() local 140 if (!root) in assoc_array_iterate() 142 return assoc_array_subtree_iterate(root, NULL, iterator, iterator_data); in assoc_array_iterate() 185 cursor = READ_ONCE(array->root); /* Address dependency. */ in assoc_array_walk() 343 static void assoc_array_destroy_subtree(struct assoc_array_ptr *root, in assoc_array_destroy_subtree() argument 353 cursor = root; in assoc_array_destroy_subtree() 444 assoc_array_destroy_subtree(array->root, ops); in assoc_array_destroy() 445 array->root = NULL; in assoc_array_destroy() [all …]
|
D | Kconfig.debug | 1444 ones, so root partition specified using device number 1445 directly (via rdev or root=MAJ:MIN) won't work anymore. 1446 Textual device names (root=/dev/sdXn) will continue to work. 2098 If this option is disabled, you allow userspace (root) access to all 2116 If this option is disabled, you allow userspace (root) access to all
|
/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 | 73 int i, j, sr, root, iprim; in codec_init() local 135 for (i = 0, root = fcr * prim; i < nroots; i++, root += prim) { in codec_init() 142 rs->index_of[rs->genpoly[j]] + root)]; in codec_init() 149 rs->index_of[rs->genpoly[0]] + root)]; in codec_init()
|
D | decode_rs.c | 37 uint16_t *root = rsc->buffers + RS_DECODE_ROOT * (nroots + 1); variable 217 root[count] = i; 258 i * root[j])]; 267 num2 = alpha_to[rs_modnn(rs, root[j] * (fcr - 1) + nn)]; 275 i * root[j])];
|