Home
last modified time | relevance | path

Searched refs:parent (Results 1 – 23 of 23) sorted by relevance

/lib/
A Drbtree.c162 parent = node; in __rb_insert()
206 parent = node; in __rb_insert()
287 if (parent) in ____rb_erase_color()
377 if (parent) in ____rb_erase_color()
517 while ((parent = rb_parent(node)) && node == parent->rb_right) in rb_next()
518 node = parent; in rb_next()
520 return parent; in rb_next()
546 while ((parent = rb_parent(node)) && node == parent->rb_left) in rb_prev()
547 node = parent; in rb_prev()
549 return parent; in rb_prev()
[all …]
A Dunion_find.c15 struct uf_node *parent; in uf_find() local
17 while (node->parent != node) { in uf_find()
18 parent = node->parent; in uf_find()
19 node->parent = parent->parent; in uf_find()
20 node = parent; in uf_find()
42 root1->parent = root2; in uf_union()
44 root2->parent = root1; in uf_union()
46 root2->parent = root1; in uf_union()
A Dkobject.c119 parent = parent->parent; in get_kobj_path_length()
129 for (parent = kobj; parent; parent = parent->parent) { in fill_kobj_path()
225 parent = kobject_get(kobj->parent); in kobject_add_internal()
232 kobj->parent = parent; in kobject_add_internal()
237 parent ? kobject_name(parent) : "<NULL>", in kobject_add_internal()
253 parent ? kobject_name(parent) : "'none'"); in kobject_add_internal()
373 kobj->parent = parent; in kobject_add_varg()
626 parent = kobj->parent; in kobject_del()
665 struct kobject *parent = kobj->parent; in kobject_cleanup() local
1063 if (parent && parent->ktype && parent->ktype->child_ns_type) in kobj_child_ns_ops()
[all …]
A Drbtree_test.c39 parent = *new; in insert()
41 new = &parent->rb_left; in insert()
43 new = &parent->rb_right; in insert()
57 parent = *new; in insert_cached()
59 new = &parent->rb_left; in insert_cached()
61 new = &parent->rb_right; in insert_cached()
92 struct test_node *parent; in RB_DECLARE_CALLBACKS_MAX() local
98 parent->augmented = val; in RB_DECLARE_CALLBACKS_MAX()
99 if (key < parent->key) in RB_DECLARE_CALLBACKS_MAX()
116 struct test_node *parent; in insert_augmented_cached() local
[all …]
A Dradix-tree.c82 return parent ? slot - parent->slots : 0; in get_slot_offset()
284 ret->parent = parent; in radix_tree_node_alloc()
558 parent = node->parent; in delete_node()
559 if (parent) { in delete_node()
561 parent->count--; in delete_node()
576 node = parent; in delete_node()
756 parent = NULL; in __radix_tree_lookup()
775 *nodep = parent; in __radix_tree_lookup()
947 node = node->parent; in node_tag_set()
1007 node = node->parent; in node_tag_clear()
[all …]
A Dobjagg.c86 if (objagg_obj->parent) in objagg_obj_stats_inc()
94 if (objagg_obj->parent) in objagg_obj_stats_dec()
103 return !objagg_obj->parent; in objagg_obj_is_root()
181 objagg_obj->parent = parent; in objagg_obj_parent_assign()
186 parent, in objagg_obj_parent_assign()
218 objagg_obj->parent, in objagg_obj_parent_unassign()
303 struct objagg_obj *parent; in objagg_obj_init_with_hints() local
313 if (!hnode->parent) in objagg_obj_init_with_hints()
316 parent = __objagg_obj_get(objagg, hnode->parent->obj); in objagg_obj_init_with_hints()
317 if (IS_ERR(parent)) in objagg_obj_init_with_hints()
[all …]
A Dnotifier-error-inject.c22 struct dentry *parent, int *value) in debugfs_create_errno() argument
24 return debugfs_create_file(name, mode, parent, value, &fops_errno); in debugfs_create_errno()
50 struct dentry *notifier_err_inject_init(const char *name, struct dentry *parent, in notifier_err_inject_init() argument
61 dir = debugfs_create_dir(name, parent); in notifier_err_inject_init()
A Dclosure.c44 struct closure *parent = cl->parent; in closure_put_after_sub() local
52 if (parent) in closure_put_after_sub()
53 closure_put(parent); in closure_put_after_sub()
183 if (cl->parent) in closure_return_sync()
184 closure_put(cl->parent); in closure_return_sync()
269 cl, (void *) cl->ip, cl->fn, cl->parent, in debug_show()
A Dassoc_array.c92 if (parent == stop) in assoc_array_subtree_iterate()
97 cursor = parent; in assoc_array_subtree_iterate()
100 if (parent == stop) in assoc_array_subtree_iterate()
105 cursor = parent; in assoc_array_subtree_iterate()
367 parent = cursor; in assoc_array_destroy_subtree()
401 if (!parent) in assoc_array_destroy_subtree()
409 cursor = parent; in assoc_array_destroy_subtree()
414 if (!parent) in assoc_array_destroy_subtree()
422 cursor = parent; in assoc_array_destroy_subtree()
1180 parent = node; in assoc_array_delete()
[all …]
A Dxarray.c385 if (parent) { in xas_alloc()
387 parent->count++; in xas_alloc()
478 node->parent = NULL; in xas_shrink()
494 struct xa_node *parent; in xas_delete_node() local
501 xas->xa_node = parent; in xas_delete_node()
505 if (!parent) { in xas_delete_node()
512 parent->count--; in xas_delete_node()
513 XA_NODE_BUG_ON(parent, parent->count > XA_CHUNK_SIZE); in xas_delete_node()
514 node = parent; in xas_delete_node()
518 if (!node->parent) in xas_delete_node()
[all …]
A Dbtree.c518 unsigned long *parent, int lpos) in merge() argument
528 setval(geo, parent, lpos, right); in merge()
529 setval(geo, parent, lpos + 1, left); in merge()
551 parent = find_level(head, geo, key, level + 1); in rebalance()
552 i = getpos(geo, parent, key); in rebalance()
553 BUG_ON(bval(geo, parent, i) != child); in rebalance()
556 left = bval(geo, parent, i - 1); in rebalance()
562 parent, i - 1); in rebalance()
566 if (i + 1 < getfill(geo, parent, i)) { in rebalance()
567 right = bval(geo, parent, i + 1); in rebalance()
[all …]
A Dbootconfig.c145 return node->parent == XBC_NODE_MAX ? NULL : &xbc_nodes[node->parent]; in xbc_node_get_parent()
220 xbc_node_find_subkey(struct xbc_node *parent, const char *key) in xbc_node_find_subkey() argument
224 if (parent) in xbc_node_find_subkey()
225 node = xbc_node_get_subkey(parent); in xbc_node_find_subkey()
257 xbc_node_find_value(struct xbc_node *parent, const char *key, in xbc_node_find_value() argument
260 struct xbc_node *node = xbc_node_find_subkey(parent, key); in xbc_node_find_value()
461 node->parent = XBC_NODE_MAX; in __xbc_add_sibling()
465 node->parent = xbc_node_index(last_parent); in __xbc_add_sibling()
A Dfault-inject.c205 struct dentry *parent, unsigned long *value) in debugfs_create_ul() argument
207 debugfs_create_file(name, mode, parent, value, &fops_ul); in debugfs_create_ul()
224 struct dentry *parent, in debugfs_create_stacktrace_depth() argument
227 debugfs_create_file(name, mode, parent, value, &fops_stacktrace_depth); in debugfs_create_stacktrace_depth()
233 struct dentry *parent, struct fault_attr *attr) in fault_create_debugfs_attr() argument
238 dir = debugfs_create_dir(name, parent); in fault_create_debugfs_attr()
A Dmaple_tree.c575 parent = (void *)((unsigned long) node->parent & ~MAPLE_NODE_MASK); in ma_dead_node()
2171 parent = *mas; in mas_next_sibling()
2174 if (parent.offset > mas_data_end(&parent)) in mas_next_sibling()
2177 *mas = parent; in mas_next_sibling()
2947 mas_mn(&l_mas)->parent = mas_mn(mast->orig_l)->parent; in mas_spanning_rebalance()
3047 newnode->parent = node->parent; in mas_destroy_rebalance()
3099 new_left->parent = left->parent; in mas_destroy_rebalance()
3157 mte_to_node(ancestor)->parent = mas_mn(mas)->parent; in mas_split_final_node()
3851 newnode->parent = mas_mn(mas)->parent; in mas_wr_node_store()
5353 parent = enode; in mt_destroy_walk()
[all …]
A Dsort.c182 static size_t parent(size_t i, unsigned int lsbit, size_t size) in parent() function
260 b = parent(b, lsbit, size); in __sort_r()
263 b = parent(b, lsbit, size); in __sort_r()
A Dnotifier-error-inject.h24 struct dentry *parent, struct notifier_err_inject *err_inject,
A Ddynamic_debug.c929 if (dev && dev->dev.parent) { in __dynamic_netdev_dbg()
932 dev_printk_emit(LOGLEVEL_DEBUG, dev->dev.parent, in __dynamic_netdev_dbg()
935 dev_driver_string(dev->dev.parent), in __dynamic_netdev_dbg()
936 dev_name(dev->dev.parent), in __dynamic_netdev_dbg()
965 if (ibdev && ibdev->dev.parent) { in __dynamic_ibdev_dbg()
968 dev_printk_emit(LOGLEVEL_DEBUG, ibdev->dev.parent, in __dynamic_ibdev_dbg()
971 dev_driver_string(ibdev->dev.parent), in __dynamic_ibdev_dbg()
972 dev_name(ibdev->dev.parent), in __dynamic_ibdev_dbg()
A Dgenalloc.c883 struct device_node *np_pool, *parent; in of_gen_pool_get() local
894 parent = of_get_parent(np_pool); in of_gen_pool_get()
895 pdev = of_find_device_by_node(parent); in of_gen_pool_get()
896 of_node_put(parent); in of_gen_pool_get()
A Dkobject_uevent.c397 if (ksobj->parent != NULL) in kobject_uevent_net_broadcast()
398 ops = kobj_ns_ops(ksobj->parent); in kobject_uevent_net_broadcast()
498 while (!top_kobj->kset && top_kobj->parent) in kobject_uevent_env()
499 top_kobj = top_kobj->parent; in kobject_uevent_env()
A Dtest_maple_tree.c216 if (node->parent) in not_empty()
/lib/zstd/compress/
A Dhuf_compress.c47 U16 parent; member
692 huffNode[lowS].parent = huffNode[lowS-1].parent = (U16)nodeNb; in HUF_buildTree()
702 huffNode[n1].parent = huffNode[n2].parent = (U16)nodeNb; in HUF_buildTree()
709 huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1; in HUF_buildTree()
711 huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1; in HUF_buildTree()
/lib/kunit/
A Ddevice.c129 kunit_dev->dev.parent = kunit_bus_device; in kunit_device_register_internal()
/lib/tests/
A Dprintf_kunit.c681 const struct software_node second = { .name = "second", .parent = &first }; in fwnode_pointer()
682 const struct software_node third = { .name = "third", .parent = &second }; in fwnode_pointer()

Completed in 821 milliseconds