Searched refs:children (Results 76 - 100 of 143) sorted by relevance

123456

/linux-master/arch/loongarch/pci/
H A Dacpi.c241 list_for_each_entry(child, &bus->children, node)
/linux-master/arch/mips/pci/
H A Dpci-legacy.c130 list_for_each_entry(child, &bus->children, node)
/linux-master/arch/arm64/kernel/
H A Dpci.c217 list_for_each_entry(child, &bus->children, node)
/linux-master/include/sound/
H A Dinfo.h75 struct list_head children; member in struct:snd_info_entry
/linux-master/drivers/pci/hotplug/
H A Dpnv_php.c77 WARN_ON(!list_empty(&php_slot->children));
102 list_for_each_entry(tmp, &php_slot->children, link) {
131 * Remove pdn for all children of the indicated device node.
665 INIT_LIST_HEAD(&php_slot->children);
712 list_add_tail(&php_slot->link, &parent->children);
/linux-master/drivers/pci/
H A Dsearch.c124 list_for_each_entry(tmp, &bus->children, node) {
/linux-master/kernel/
H A Dexit.c472 * Search in the children
474 list_for_each_entry(c, &p->children, sibling) {
482 list_for_each_entry(c, &p->real_parent->children, sibling) {
617 * When we die, we re-parent all our children, and try to:
620 * child_subreaper for its children (like a service manager)
700 if (list_empty(&father->children))
704 list_for_each_entry(p, &father->children, sibling) {
722 list_splice_tail_init(&father->children, &reaper->children);
1056 * Wait for all children (clon
[all...]
/linux-master/drivers/net/ethernet/intel/ice/
H A Dice_devlink.c858 /* leaf nodes doesn't have children
874 ice_traverse_tx_tree(devlink, node->children[i], tc_node, pf);
892 tc_node = pi->root->children[0];
896 ice_traverse_tx_tree(devlink, tc_node->children[i], tc_node, pf);
908 ice_clear_rate_nodes(node->children[i]);
923 ice_clear_rate_nodes(pi->root->children[0]);
1077 tc_node = pi->root->children[0];
1086 /* can't allow to delete a node with children */
1229 tc_node = pi->root->children[0];
/linux-master/arch/powerpc/platforms/pseries/
H A Diommu.c590 int children; local
614 /* Count number of direct PCI children of the PHB. */
615 for (children = 0, tmp = dn->child; tmp; tmp = tmp->sibling)
616 children++;
618 pr_debug("Children: %d\n", children);
630 while (pci->phb->dma_window_size * children > 0x80000000ul)
655 /* Divide the rest (1.75GB) among the children */
657 while (pci->phb->dma_window_size * children > 0x70000000ul)
/linux-master/drivers/pci/controller/
H A Dpci-hyperv.c509 struct list_head children; member in struct:hv_pcibus_device
2156 list_for_each_entry(hpdev, &hbus->children, list_entry) {
2239 list_for_each_entry(hpdev, &hbus->children, list_entry) {
2247 list_for_each_entry(hpdev, &hbus->children, list_entry) {
2311 * Note that this function does not need to lock the children list
2314 * same ordered workqueue. Therefore hbus->children list will not change
2323 list_for_each_entry(hpdev, &hbus->children, list_entry) {
2345 list_for_each_entry(hpdev, &hbus->children, list_entry) {
2505 list_add_tail(&hpdev->list_entry, &hbus->children);
2534 list_for_each_entry(iter, &hbus->children, list_entr
[all...]
/linux-master/tools/testing/selftests/bpf/
H A Dbench.c380 .children = bench_parsers,
393 .children = bench_parsers,
/linux-master/arch/s390/mm/
H A Dgmap.c74 INIT_LIST_HEAD(&gmap->children);
258 if (!list_empty(&gmap->children)) {
260 list_for_each_entry_safe(sg, next, &gmap->children, list) {
1626 list_for_each_entry(sg, &parent->children, list) {
1710 list_for_each_entry(sg, &parent->children, list) {
1722 list_add(&new->list, &parent->children);
2287 if (!list_empty(&gmap->children) && (bits & PGSTE_VSIE_BIT)) {
2290 &gmap->children, list)
/linux-master/drivers/scsi/libsas/
H A Dsas_expander.c835 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/arch/alpha/kernel/
H A Dpci.c307 list_for_each_entry(child_bus, &b->children, node)
/linux-master/tools/cgroup/
H A Diocost_monitor.py87 blkcg.css.children.address_of_(), 'css.sibling'):
/linux-master/fs/ceph/
H A Dsnap.c131 INIT_LIST_HEAD(&realm->children);
317 list_add(&realm->child_item, &parent->children);
431 * rebuild snap context for the given realm and all of its children.
467 list_for_each_entry(child, &_realm->children, child_item) {
475 list_for_each_entry(child, &_realm->children, child_item)
719 * Queue cap_snaps for snap writeback for this realm and its children.
1010 * realm and its children.
1127 /* we may have taken some of the old realm's children. */
/linux-master/include/linux/
H A Dcgroup-defs.h170 /* siblings list anchored at the parent's ->children */
172 struct list_head children; member in struct:cgroup_subsys_state
188 * ->children lists are in the ascending order of ->serial_nr and
194 * Incremented by online self and children. Used to guarantee that
195 * parents are not offlined before their children.
434 * All children which have non-zero nr_populated_csets and/or
/linux-master/arch/x86/pci/
H A Dacpi.c465 list_for_each_entry(child, &bus->children, node)
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/steering/
H A Dfs_dr.c310 list_for_each_entry(dst, &fte->node.children, node.list) {
433 list_for_each_entry(dst, &fte->node.children, node.list) {
514 list_for_each_entry(dst, &fte->node.children, node.list) {
/linux-master/tools/perf/
H A Dbuiltin-annotate.c390 if (!list_empty(&member->children))
393 list_for_each_entry(child, &member->children, node)
396 if (!list_empty(&member->children))
/linux-master/fs/xfs/scrub/
H A Dtrace.h1414 __field(xfs_nlink_t, children)
1421 __entry->children = live->children;
1423 TP_printk("dev %d:%d ino 0x%llx parents %u backrefs %u children %u",
1428 __entry->children)
1441 __field(xfs_nlink_t, children)
1451 __entry->children = live->children;
1456 TP_printk("dev %d:%d ino 0x%llx parents %d:%u backrefs %d:%u children %d:%u",
1464 __entry->children)
[all...]
/linux-master/arch/sparc/kernel/
H A Dpci.c618 list_for_each_entry(child_bus, &bus->children, node)
684 list_for_each_entry(child_bus, &bus->children, node)
927 list_for_each_entry(bus, &pbus->children, node)
/linux-master/net/sched/
H A Dsch_hfsc.c124 struct list_head children; /* child classes */ member in struct:hfsc_class
128 struct rb_root vt_tree; /* active children sorted by cl_vt */
130 struct rb_root cf_tree; /* active children sorted by cl_f */
144 u64 cl_cfmin; /* earliest children's fit-time (used
147 children fit for link-sharing
152 the children */
165 u32 cl_nactive; /* number of active children */
854 list_for_each_entry(p, &cl->children, siblings) {
1067 INIT_LIST_HEAD(&cl->children);
1079 list_add_tail(&cl->siblings, &parent->children);
[all...]
H A Dsch_htb.c107 unsigned int children; member in struct:htb_class
1505 if (cl->parent->children > 1)
1673 cl->parent->children--;
1710 * refs so that we can remove children safely there ?
1712 if (cl->children || qdisc_class_in_use(&cl->common)) {
1751 cl->parent->children--;
1880 cl->children = 0;
1996 parent->children++;
/linux-master/net/ipv6/
H A Dip6_fib.c839 * 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) {

Completed in 280 milliseconds

123456