Searched refs:children (Results 51 - 75 of 143) sorted by relevance

123456

/linux-master/drivers/input/serio/
H A Dserio.c502 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...]
/linux-master/drivers/net/ethernet/intel/ice/
H A Dice_sched.c32 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/tools/cgroup/
H A Dmemcg_slabinfo.py37 if not list_empty(css.children.address_of_()):
39 css.children.address_of_(),
/linux-master/init/
H A Dinit_task.c105 .children = LIST_HEAD_INIT(init_task.children),
/linux-master/drivers/base/
H A Dswnode.c36 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/net/ethernet/mellanox/mlx5/core/
H A Dfs_core.c55 .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/scripts/dtc/
H A Ddtc.h221 struct node *children; member in struct:node
254 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
269 struct node *build_node(struct property *proplist, struct node *children,
/linux-master/drivers/net/ethernet/netronome/nfp/flower/
H A Dconntrack.c1240 list_add(&nft_m_entry->tc_merge_list, &tc_m_entry->children);
1241 list_add(&nft_m_entry->nft_flow_list, &nft_entry->children);
1315 list_add(&m_entry->post_ct_list, &post_ct_entry->children);
1316 list_add(&m_entry->pre_ct_list, &pre_ct_entry->children);
1317 INIT_LIST_HEAD(&m_entry->children);
1567 INIT_LIST_HEAD(&entry->children);
1654 list_for_each_entry_safe(m_entry, tmp, &ct_entry->children,
1662 list_for_each_entry_safe(m_entry, tmp, &ct_entry->children,
1684 if (!list_empty(&m_ent->children))
1695 list_for_each_entry_safe(m_ent, tmp, &entry->children, pre_ct_lis
[all...]
/linux-master/include/linux/mfd/
H A Dwl1273-core.h241 unsigned int children; member in struct:wl1273_fm_platform_data
/linux-master/drivers/net/ethernet/netronome/nfp/abm/
H A Dmain.h131 * @num_children: current size of the @children array
132 * @children: pointers to children
159 struct nfp_qdisc **children; member in struct:nfp_qdisc
/linux-master/arch/s390/include/asm/
H A Dgmap.h37 * @children: list of shadow gmap structures
63 struct list_head children; member in struct:gmap
/linux-master/drivers/sh/clk/
H A Dcore.c219 list_add(&child->sibling, &parent->children);
225 /* Propagate rate to children */
230 list_for_each_entry(clkp, &tclk->children, sibling) {
426 INIT_LIST_HEAD(&clk->children);
434 list_add(&clk->sibling, &clk->parent->children);
/linux-master/fs/nfs/blocklayout/
H A Dblocklayout.h108 struct pnfs_block_dev *children; member in struct:pnfs_block_dev
/linux-master/Documentation/sphinx/
H A Dkerneldoc.py148 return node.children
/linux-master/net/ieee802154/
H A Dcore.c210 list_for_each_entry_safe(child, tmp, &wpan_dev->children, node) {
299 INIT_LIST_HEAD(&wpan_dev->children);
/linux-master/drivers/gpu/drm/xe/
H A Dxe_pt.c23 /** @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/clk/
H A Dclk.c88 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/arch/sparc/kernel/
H A Dpci_common.c498 list_for_each_entry(bus, &pbus->children, node)
521 list_for_each_entry(bus, &pbus->children, node)
545 list_for_each_entry(bus, &pbus->children, node)
/linux-master/drivers/phy/tegra/
H A Dxusb.c190 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/fs/kernfs/
H A Ddir.c353 * @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/tools/perf/tests/
H A Dhists_cumulate.c175 u64 children; member in struct:result
229 TEST_ASSERT_VAL(buf, he->stat_acc->period == expected[i].children);
262 /* NO callchain + NO children */
313 /* callchain + NO children */
461 /* NO callchain + children */
518 /* callchain + children */
/linux-master/fs/
H A Dpnode.c487 * already unmounted or marked as without children.
501 goto children;
508 /* If a mount is without children and not locked umount it. */
512 children:
/linux-master/include/linux/
H A Dkernfs.h155 /* 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 Dsh_clk.h47 struct list_head children; member in struct:clk
48 struct list_head sibling; /* node for children */
/linux-master/arch/x86/pci/
H A Di386.c240 list_for_each_entry(child, &bus->children, node)

Completed in 307 milliseconds

123456