/linux-master/kernel/sched/ |
H A D | sched.h | 414 struct list_head children; member in struct:task_group 1853 * the SDF_SHARED_CHILD metaflag, all the children domains also have @flag.
|
H A D | core.c | 1302 list_for_each_entry_rcu(child, &parent->children, siblings) { 9980 INIT_LIST_HEAD(&root_task_group.children); 10405 INIT_LIST_HEAD(&tg->children); 10406 list_add_rcu(&tg->siblings, &parent->children);
|
/linux-master/drivers/clk/ |
H A D | clk.c | 88 struct hlist_head children; member in struct:clk_core 395 hlist_for_each_entry(child, &core->children, child_node) { 1324 hlist_for_each_entry(child, &core->children, child_node) { 1343 hlist_for_each_entry(child, &core->children, child_node) 1463 hlist_for_each_entry(child, &core->children, child_node) 1489 hlist_for_each_entry(child, &core->children, child_node) 1894 hlist_for_each_entry(child, &core->children, child_node) 1980 hlist_for_each_entry(child, &core->children, child_node) 2078 * Update the orphan status of @core and all its children. 2086 hlist_for_each_entry(child, &core->children, child_nod [all...] |
/linux-master/tools/perf/util/ |
H A D | annotate.c | 116 .children = LIST_HEAD_INIT(stackop_type.self.children),
|
/linux-master/kernel/ |
H A D | fork.c | 2278 INIT_LIST_HEAD(&p->children); 2542 /* Don't start children in a dying pid namespace */ 2585 list_add_tail(&p->sibling, &p->real_parent->children); 3111 list_for_each_entry(child, &parent->children, sibling) {
|
/linux-master/net/ipv6/ |
H A D | ip6_fib.c | 839 * Create new leaf node without children. 1794 int children; local 1830 children = 0; 1834 children |= 1; 1838 children |= 2; 1841 if (children == 3 || FIB6_SUBTREE(fn) 1844 || (children && fn->fn_flags & RTN_ROOT) 1894 if (children&2) {
|
/linux-master/fs/tracefs/ |
H A D | event_inode.c | 162 /* Preallocate the children mode array if necessary */ 297 * If the ei is being freed, the ownership of the children 542 list_for_each_entry(ei_child, &ei->children, list) { 574 * Walk the children of a eventfs_inode to fill in getdents(). 644 list_for_each_entry_srcu(ei_child, &ei->children, list, 686 * used to create other children underneath. 727 INIT_LIST_HEAD(&ei->children); 732 list_add_tail(&ei->list, &parent->children); 805 INIT_LIST_HEAD(&ei->children); 866 list_for_each_entry(ei_child, &ei->children, lis [all...] |
H A D | internal.h | 36 * @children: link list into the child eventfs_inode 53 struct list_head children; member in struct:eventfs_inode
|
/linux-master/fs/bcachefs/ |
H A D | snapshot.c | 208 prt_printf(out, "is_subvol %llu deleted %llu parent %10u children %10u %10u subvol %u tree %u", 212 le32_to_cpu(s.v->children[0]), 213 le32_to_cpu(s.v->children[1]), 246 bkey_fsck_err_on(le32_to_cpu(s.v->children[0]) < le32_to_cpu(s.v->children[1]), c, err, 248 "children not normalized"); 250 bkey_fsck_err_on(s.v->children[0] && s.v->children[0] == s.v->children[1], c, err, 255 id = le32_to_cpu(s.v->children[ 1427 u32 children[2]; local [all...] |
H A D | snapshot.h | 147 int ret = s ? s->children[0] : -BCH_ERR_invalid_snapshot_node; 188 ret = (t->children[0]|t->children[1]) != 0;
|
H A D | subvolume_types.h | 15 u32 children[2]; member in struct:snapshot_t
|
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/ |
H A D | fs_core.c | 55 .children = (struct init_tree_node[]) {__VA_ARGS__},\ 65 .children = (struct init_tree_node[]) {__VA_ARGS__},\ 154 struct init_tree_node *children; member in struct:init_tree_node 165 .children = (struct init_tree_node[]){ 206 .children = (struct init_tree_node[]) { 248 .children = (struct init_tree_node[]) { 302 .children = (struct init_tree_node[]) { 378 INIT_LIST_HEAD(&node->children); 764 list_add_tail(&fte->node.list, &fg->node.children); 916 list_for_each_advance_continue(iter, &root->children, revers [all...] |
/linux-master/drivers/scsi/libsas/ |
H A D | sas_expander.c | 835 list_add_tail(&child->siblings, &parent_ex->children); 945 list_add_tail(&child->siblings, &parent->ex_dev.children); 1073 list_for_each_entry(child, &ex->children, siblings) { 1801 list_for_each_entry(ch, &ex->children, siblings) { 1817 list_for_each_entry_safe(child, n, &ex->children, siblings) { 1835 &ex_dev->children, siblings) { 1866 list_for_each_entry(child, &ex_root->children, siblings) { 1917 list_for_each_entry(child, &dev->ex_dev.children, siblings) {
|
/linux-master/drivers/gpu/drm/xe/ |
H A D | xe_pt.c | 23 /** @children: Array of page-table child nodes */ 24 struct xe_ptw *children[XE_PDES]; member in struct:xe_pt_dir 47 return container_of(pt_dir->children[index], struct xe_pt, base); 121 pt->base.children = level ? as_xe_pt_dir(pt)->children : NULL; 184 * Puts the page-table bo, recursively calls xe_pt_destroy on all children 372 parent->base.children[offset] = &xe_child->base; 872 pt_dir->children[j_] = &newpte->base; 1533 pt_dir->children[i] = NULL;
|
/linux-master/drivers/dma-buf/ |
H A D | st-dma-fence-chain.c | 391 atomic_t children; member in struct:find_race 437 if (atomic_dec_and_test(&data->children)) 438 wake_up_var(&data->children); 461 atomic_set(&data.children, 0); 468 atomic_inc(&data.children); 472 wait_var_event_timeout(&data.children, 473 !atomic_read(&data.children),
|
/linux-master/drivers/net/ethernet/intel/ice/ |
H A D | ice_lag.c | 449 parent = ice_sched_get_free_vsi_parent(hw, aggnode->children[n], 472 parent = parent->children[0];
|
H A D | ice_sched.c | 32 root->children = devm_kcalloc(ice_hw_to_dev(hw), hw->max_children[0], 34 if (!root->children) { 64 /* The node has no children or is at the max layer */ 70 /* Check if TEID matches to any of the children nodes */ 72 if (ICE_TXSCHED_GET_NODE_TEID(start_node->children[i]) == teid) 73 return start_node->children[i]; 79 tmp = ice_sched_find_node_by_teid(start_node->children[i], 190 node->children = devm_kcalloc(ice_hw_to_dev(hw), 193 if (!node->children) { 202 parent->children[paren [all...] |
/linux-master/include/linux/phy/ |
H A D | phy.h | 173 * @children: can be used to override the default (dev->of_node) child node 180 struct device_node *children; member in struct:phy_provider 209 #define of_phy_provider_register_full(dev, children, xlate) \ 210 __of_phy_provider_register(dev, children, THIS_MODULE, xlate) 212 #define devm_of_phy_provider_register_full(dev, children, xlate) \ 213 __devm_of_phy_provider_register(dev, children, THIS_MODULE, xlate) 283 struct device_node *children, struct module *owner, 287 struct device_node *children, struct module *owner, 531 struct device *dev, struct device_node *children, struct module *owner, 539 *dev, struct device_node *children, struc 530 __of_phy_provider_register( struct device *dev, struct device_node *children, struct module *owner, struct phy * (*of_xlate)(struct device *dev, const struct of_phandle_args *args)) argument 538 __devm_of_phy_provider_register(struct device *dev, struct device_node *children, struct module *owner, struct phy * (*of_xlate)(struct device *dev, const struct of_phandle_args *args)) argument [all...] |
/linux-master/include/linux/ |
H A D | kernfs.h | 155 /* children rbtree starts here and goes through kn->rb */ 156 struct rb_root children; member in struct:kernfs_elem_dir 376 * under it. All children of @kn must have non-NULL namespace tags and 382 WARN_ON_ONCE(!RB_EMPTY_ROOT(&kn->dir.children)); 390 * Test whether namespace filtering is enabled for the children of @ns.
|
H A D | serio.h | 41 /* Entry in parent->children list */ 43 struct list_head children; member in struct:serio
|
/linux-master/fs/kernfs/ |
H A D | dir.c | 353 * @kn->parent->dir.children. 363 struct rb_node **node = &kn->parent->dir.children.rb_node; 383 rb_insert_color(&kn->rb, &kn->parent->dir.children); 400 * kn->parent->dir.children. 419 rb_erase(&kn->rb, &kn->parent->dir.children); 764 * directory and link into the children list of the parent. 841 struct rb_node *node = parent->dir.children.rb_node; 1325 rbn = rb_first(&pos->dir.children); 1803 struct rb_node *node = parent->dir.children.rb_node;
|
/linux-master/drivers/phy/tegra/ |
H A D | xusb.c | 190 struct device_node *children; local 195 children = of_get_child_by_name(pad->dev.of_node, "lanes"); 196 if (!children) 202 of_node_put(children); 234 pad->provider = of_phy_provider_register_full(&pad->dev, children, 247 of_node_put(children);
|
/linux-master/drivers/phy/ |
H A D | phy-core.c | 142 for_each_child_of_node(phy_provider->children, child) 1127 * @children: device node containing children (if different from dev->of_node) 1135 * If the PHY provider doesn't nest children directly but uses a separate 1136 * child node to contain the individual children, the @children parameter 1143 struct device_node *children, struct module *owner, 1150 * If specified, the device node containing the children must itself 1154 if (children) { 1155 struct device_node *parent = of_node_get(children), *nex 1142 __of_phy_provider_register(struct device *dev, struct device_node *children, struct module *owner, struct phy * (*of_xlate)(struct device *dev, const struct of_phandle_args *args)) argument 1205 __devm_of_phy_provider_register(struct device *dev, struct device_node *children, struct module *owner, struct phy * (*of_xlate)(struct device *dev, const struct of_phandle_args *args)) argument [all...] |
/linux-master/drivers/base/ |
H A D | swnode.c | 36 struct list_head children; member in struct:swnode 469 if (!p || list_empty(&p->children) || 470 (c && list_is_last(&c->entry, &p->children))) { 478 c = list_first_entry(&p->children, struct swnode, entry); 491 if (!swnode || list_empty(&swnode->children)) 494 list_for_each_entry(child, &swnode->children, entry) { 576 * children that follow that convention. 808 INIT_LIST_HEAD(&swnode->children); 830 list_add_tail(&swnode->entry, &parent->children); 872 * parents come before their children [all...] |
/linux-master/drivers/input/serio/ |
H A D | serio.c | 502 INIT_LIST_HEAD(&serio->children); 530 list_add_tail(&serio->child_node, &parent->children); 596 * Reconnect serio port and all its children (re-initialize attached 611 if (!list_empty(&s->children)) { 612 s = list_first_entry(&s->children, 626 if (!list_is_last(&s->child_node, &parent->children)) { 639 * all children ports are unbound and destroyed. 649 while (!list_empty(&serio->children)) { 652 while (!list_empty(&s->children)) 653 s = list_first_entry(&s->children, [all...] |