Searched refs:children (Results 26 - 50 of 143) sorted by relevance

123456

/linux-master/drivers/mfd/
H A Dretu-mfd.c124 const struct mfd_cell *children; member in struct:retu_data
131 .children = retu_devs,
138 .children = tahvo_devs,
274 ret = mfd_add_devices(rdev->dev, -1, rdat->children, rdat->nchildren,
H A Dtwl6040.c638 int irq, ret, children = 0; local
756 cell = &twl6040->cells[children];
762 children++;
768 cell = &twl6040->cells[children];
774 children++;
778 cell = &twl6040->cells[children];
780 children++;
783 cell = &twl6040->cells[children];
785 children++;
791 ret = mfd_add_devices(&client->dev, -1, twl6040->cells, children,
[all...]
/linux-master/drivers/gpu/drm/xe/
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
H A Dxe_pt_walk.c77 struct xe_ptw **entries = parent->children ? parent->children : NULL;
/linux-master/tools/perf/util/
H A Dannotate-data.h17 * @children: List head for child nodes
27 struct list_head children; member in struct:annotated_member
H A Dannotate-data.c92 INIT_LIST_HEAD(&member->children);
93 list_add_tail(&member->node, &parent->children);
118 list_for_each_entry_safe(child, tmp, &member->children, node) {
162 INIT_LIST_HEAD(&result->self.children);
/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/scripts/
H A Dasn1_compiler.c686 struct element *children; member in struct:element
942 element->children = alloc_elem();
943 element = element->children;
1027 element->children = parse_compound(&cursor, end, 1);
1041 element->children = parse_type(&cursor, end, NULL);
1043 element->children = parse_compound(&cursor, end, 0);
1058 element->children = parse_type(&cursor, end, NULL);
1060 element->children = parse_compound(&cursor, end, 1);
1150 struct element *children, **child_p = &children, *elemen local
[all...]
/linux-master/drivers/input/misc/
H A Dsoc_button_array.c48 struct platform_device *children[BUTTON_TYPES]; member in struct:soc_button_data
426 if (priv->children[i])
427 platform_device_unregister(priv->children[i]);
478 priv->children[i] = pd;
481 if (!priv->children[0] && !priv->children[1])
/linux-master/drivers/net/ethernet/netronome/nfp/flower/
H A Dconntrack.h121 * @children: List of tc_merge flows this flow forms part of
137 struct list_head children; member in struct:nfp_fl_ct_flow_entry
156 * @children: List of nft merged entries
166 struct list_head children; member in struct:nfp_fl_ct_tc_merge
/linux-master/arch/powerpc/include/asm/
H A Dpnv-pci.h71 struct list_head children; member in struct:pnv_php_slot
/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/Documentation/sphinx/
H A Dtranslations.py81 isinstance(xref, nodes.reference), node.children))
H A Dkernel_abi.py137 return node.children
H A Dkernel_feat.py133 return node.children
/linux-master/fs/bcachefs/
H A Dsnapshot.h147 int ret = s ? s->children[0] : -BCH_ERR_invalid_snapshot_node;
188 ret = (t->children[0]|t->children[1]) != 0;
/linux-master/drivers/dma-buf/
H A Dst-dma-fence-chain.c391 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/scripts/dtc/
H A Dlivetree.c88 struct node *build_node(struct property *proplist, struct node *children, argument
97 new->children = children;
192 while (new_node->children) {
194 new_child = new_node->children;
195 new_node->children = new_child->next_sibling;
305 p = &parent->children;
314 struct node *node = parent->children;
660 bootcpu = cpus->children;
786 node->children
[all...]
/linux-master/drivers/phy/
H A Dphy-core.c142 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/kernel/gcov/
H A Dfs.c35 * @children: child nodes
54 struct list_head children; member in struct:gcov_node
524 INIT_LIST_HEAD(&node->children);
562 list_add(&node->list, &parent->children);
607 while ((node != &root_node) && list_empty(&node->children)) {
623 list_for_each_entry(node, &parent->children, list) {
645 else if (list_empty(&node->children)) {
/linux-master/fs/xfs/scrub/
H A Dnlinks.c124 careful_add(&nl.children, children_delta);
296 /* Walk a directory to bump the observed link counts of the children. */
523 obs->children = nl.children;
562 obs.children = obs.backrefs;
594 if (obs.children != obs.backrefs)
608 * children.
610 if (obs.children != 0) {
H A Dnlinks_repair.c95 if (!S_ISDIR(VFS_I(ip)->i_mode) && obs.children != 0) {
/linux-master/fs/tracefs/
H A Devent_inode.c162 /* 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...]
/linux-master/block/partitions/
H A Dldm.h128 u8 children; member in struct:vblk_comp
/linux-master/include/linux/
H A Dserio.h41 /* Entry in parent->children list */
43 struct list_head children; member in struct:serio

Completed in 323 milliseconds

123456