Searched refs:children (Results 51 - 75 of 142) sorted by last modified time

123456

/linux-master/fs/xfs/scrub/
H A Dtrace.h1534 __field(xfs_nlink_t, children)
1541 __entry->children = live->children;
1543 TP_printk("dev %d:%d ino 0x%llx parents %u backrefs %u children %u",
1548 __entry->children)
1561 __field(xfs_nlink_t, children)
1571 __entry->children = live->children;
1576 TP_printk("dev %d:%d ino 0x%llx parents %d:%u backrefs %d:%u children %d:%u",
1584 __entry->children)
[all...]
H A Dnlinks.c140 careful_add(&nl.children, children_delta);
173 * we don't bump the link counts of the children.
379 /* Walk a directory to bump the observed link counts of the children. */
391 * we don't bump the link counts of the children.
635 obs->children = nl.children;
655 * doesn't bump the link counts for the children.
682 obs.children = obs.backrefs;
716 if (obs.children != obs.backrefs)
730 * children
[all...]
H A Dnlinks.h79 xfs_nlink_t children;
106 return ret + live->children;
72 xfs_nlink_t children; member in struct:xchk_nlink
H A Dnlinks_repair.c107 * doesn't bump the link counts for the children.
180 if (!S_ISDIR(VFS_I(ip)->i_mode) && obs.children != 0) {
/linux-master/drivers/powercap/
H A Ddtpm.c13 * children. It propagates the constraints set at its level to its
14 * children and collect the children power information. The leaves of
72 list_for_each_entry(child, &dtpm->children, sibling) {
91 list_for_each_entry(child, &dtpm->children, sibling) {
163 * release will be denied if the node has children. This function must
167 * Return: 0 on success, -EBUSY if there are children
174 if (!list_empty(&dtpm->children))
200 * given the weight of the children.
231 list_for_each_entry(child, &dtpm->children, siblin
[all...]
/linux-master/drivers/pci/
H A Dprobe.c567 INIT_LIST_HEAD(&b->children);
1185 list_add_tail(&child->node, &parent->children);
2831 * parents then children fashion. If this changes, then this code will not
2865 * Called after each bus is probed, but before its children are examined. This
3088 list_for_each_entry(child, &bus->children, node)
H A Dpci.c185 * pci_bus_max_busnr - returns maximum PCI bus number of given bus' children
197 list_for_each_entry(tmp, &bus->children, node) {
3068 * children won't change that.
3087 * so we need to go through all children to find out if one of them
/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/drivers/pci/controller/dwc/
H A Dpcie-tegra194.c1287 list_for_each_entry(child, &pp->bridge->bus->children, node) {
/linux-master/include/net/
H A Dcfg802154.h509 struct list_head children; member in struct:wpan_dev
/linux-master/fs/nfs/blocklayout/
H A Dblocklayout.h108 struct pnfs_block_dev *children; member in struct:pnfs_block_dev
H A Ddev.c23 bl_free_device(&dev->children[i]);
24 kfree(dev->children);
182 struct pnfs_block_dev *child = &dev->children[i];
220 child = &dev->children[chunk_idx];
407 d->children = kcalloc(v->concat.volumes_count,
409 if (!d->children)
413 ret = bl_parse_deviceid(server, &d->children[i],
419 d->children[i].start += len;
420 len += d->children[i].len;
436 d->children
[all...]
/linux-master/Documentation/sphinx/
H A Dkerneldoc.py148 return node.children
H A Dtranslations.py81 isinstance(xref, nodes.reference), node.children))
H A Dkernel_feat.py133 return node.children
/linux-master/arch/powerpc/platforms/pseries/
H A Dpci_dlpar.c64 /* We cannot to remove a root bus that has children */
65 if (!(list_empty(&b->children) && list_empty(&b->devices)))
/linux-master/drivers/gpu/drm/xe/
H A Dxe_pt_walk.c77 struct xe_ptw **entries = parent->children ? parent->children : NULL;
H A Dxe_pt_walk.h13 * @children: Pointer to an array of children if any.
19 struct xe_ptw **children; member in struct:xe_ptw
/linux-master/fs/proc/
H A Darray.c733 * us significant speedup on children-rich processes.
739 if (list_is_last(&task->sibling, &start->children))
751 * We might miss some children here if children
756 * "Just suppose that the parent sleeps, but N children
758 * skips N extra children, we miss N tasks." (c)
761 * its children to get a precise result.
763 list_for_each_entry(task, &start->children, sibling) {
/linux-master/fs/ceph/
H A Dsuper.h274 int split_by; /* i.e. 2^(split_by) children */
914 * are organized into a hierarchy, such that children inherit (some of)
936 struct list_head children; /* list of child realms */ member in struct:ceph_snap_realm
/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/drivers/net/ethernet/mellanox/mlx5/core/
H A Dfs_cmd.c469 list_for_each_entry(dst, &fte->node.children, node.list) {
636 list_for_each_entry(dst, &fte->node.children, node.list) {
715 list_for_each_entry(dst, &fte->node.children, node.list) {
/linux-master/fs/bcachefs/
H A Dsnapshot_format.h9 __le32 children[2]; member in struct:bch_snapshot
/linux-master/tools/perf/scripts/python/
H A Dexported-sql-viewer.py1000 def __init__(self, *children):
1004 for child in children:
1014 def __init__(self, *children):
1018 for child in children:
1028 def __init__(self, *children):
1030 self.vbox.setLayout(VBoxLayout(*children))
/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))

Completed in 270 milliseconds

123456