Home
last modified time | relevance | path

Searched refs:children (Results 1 – 25 of 199) sorted by relevance

12345678

/linux/tools/testing/selftests/cgroup/
H A Dtest_cpu.c311 int (*validate)(const struct cpu_hogger *children, int num_children)) in run_cpucg_weight_test() argument
315 struct cpu_hogger children[3] = {}; in run_cpucg_weight_test() local
327 for (i = 0; i < ARRAY_SIZE(children); i++) { in run_cpucg_weight_test()
328 children[i].cgroup = cg_name_indexed(parent, "cpucg_child", i); in run_cpucg_weight_test()
329 if (!children[i].cgroup) in run_cpucg_weight_test()
332 if (cg_create(children[i].cgroup)) in run_cpucg_weight_test()
335 if (cg_write_numeric(children[i].cgroup, "cpu.weight", in run_cpucg_weight_test()
340 for (i = 0; i < ARRAY_SIZE(children); i++) { in run_cpucg_weight_test()
341 pid_t pid = spawn_child(&children[i]); in run_cpucg_weight_test()
344 children[i].pid = pid; in run_cpucg_weight_test()
[all …]
H A Dtest_memcontrol.c483 char *children[4] = {NULL}; in test_memcg_protection() local
534 for (i = 0; i < ARRAY_SIZE(children); i++) { in test_memcg_protection()
535 children[i] = cg_name_indexed(parent[1], "child_memcg", i); in test_memcg_protection()
536 if (!children[i]) in test_memcg_protection()
539 if (cg_create(children[i])) in test_memcg_protection()
545 cg_run_nowait(children[i], alloc_pagecache_50M_noexit, in test_memcg_protection()
551 if (cg_write(children[0], attribute, "75M")) in test_memcg_protection()
553 if (cg_write(children[1], attribute, "25M")) in test_memcg_protection()
555 if (cg_write(children[2], attribute, "0")) in test_memcg_protection()
557 if (cg_write(children[3], attribute, "500M")) in test_memcg_protection()
[all …]
/linux/tools/perf/Documentation/
H A Dcallchain-overhead-calculation.txt10 The 'children' overhead is calculated by adding all period values of
16 It might be confusing that the sum of all the 'children' overhead
20 spread over the children.
65 When the --children option is enabled, the 'self' overhead values of
67 calculate the 'children' overhead. In this case the report could be
97 'children' overhead of 'bar', 'main' and '\_\_libc_start_main'.
99 'children' overhead of 'main' and '\_\_libc_start_main'.
102 same (100%) 'children' overhead (even though they have zero 'self'
105 Since v3.16 the 'children' overhead is shown by default and the output
106 is sorted by its values. The 'children' overhea
[all...]
/linux/tools/testing/selftests/arm64/fp/
H A Dfp-stress.c44 static struct child_data *children; variable
278 if (children[i].pid == info->si_pid) { in handle_child_signal()
279 children[i].exited = true; in handle_child_signal()
280 children[i].exit_status = info->si_status; in handle_child_signal()
308 child_stop(&children[i]); in handle_exit_signal()
515 children = calloc(sizeof(*children), tests); in main()
516 if (!children) in main()
556 start_fpsimd(&children[num_children++], i, 0); in main()
557 start_kernel(&children[num_children++], i, 0); in main()
560 start_sve(&children[num_children++], sve_vls[j], i); in main()
[all …]
/linux/tools/testing/selftests/arm64/gcs/
H A Dgcs-stress.c40 static struct child_data *children; variable
294 if (children[i].pid == info->si_pid) { in handle_child_signal()
295 children[i].exited = true; in handle_child_signal()
296 children[i].exit_status = info->si_status; in handle_child_signal()
324 child_stop(&children[i]); in handle_exit_signal()
399 children = calloc(sizeof(*children), tests); in main()
400 if (!children) in main()
440 start_thread(&children[i], i); in main()
490 if (children[i].output_seen || in main()
491 children[i].exited) in main()
[all …]
/linux/lib/
H A Dgeneric-radix-tree.c49 new_node->children[0] = n; in __genradix_ptr_alloc()
57 new_node->children[0] = NULL; in __genradix_ptr_alloc()
63 &n->children[offset >> genradix_depth_shift(level)]; in __genradix_ptr_alloc()
114 while (!n->children[i]) { in __genradix_iter_peek()
132 n = n->children[i]; in __genradix_iter_peek()
173 while (!n->children[i]) { in __genradix_iter_peek_prev()
190 n = n->children[i]; in __genradix_iter_peek_prev()
203 if (n->children[i]) in genradix_free_recurse()
204 genradix_free_recurse(n->children[i], level - 1); in genradix_free_recurse()
/linux/tools/perf/ui/browsers/
H A Dannotate-data.c26 struct list_head children; member
104 INIT_LIST_HEAD(&entry->children); in add_child_entries()
106 parent_list = &parent->children; in add_child_entries()
112 list_for_each_entry(pos, &member->children, node) { in add_child_entries()
120 if (!list_empty(&member->children)) { in add_child_entries()
132 INIT_LIST_HEAD(&bracket->children); in add_child_entries()
133 list_add_tail(&bracket->node, &entry->children); in add_child_entries()
182 if (list_empty(&entry->children)) in get_first_child()
185 return list_first_entry(&entry->children, struct browser_entry, node); in get_first_child()
190 if (list_empty(&entry->children)) in get_last_child()
[all …]
/linux/drivers/net/ethernet/mellanox/mlx5/core/
H A Dfs_core.h152 struct list_head children; member
238 struct list_head children; member
388 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
391 list_for_each_entry(pos, (&(prio)->node.children), list)
394 fs_list_for_each_entry(pos, &(ns)->node.children)
397 fs_list_for_each_entry(pos, &(prio)->node.children)
400 fs_list_for_each_entry(pos, &(prio)->node.children)
403 fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)
406 fs_list_for_each_entry(pos, &(ft)->node.children)
409 fs_list_for_each_entry(pos, &(fg)->node.children)
[all …]
H A Dfs_core.c55 .children = (struct init_tree_node[]) {__VA_ARGS__},\
65 .children = (struct init_tree_node[]) {__VA_ARGS__},\
157 struct init_tree_node *children; member
168 .children = (struct init_tree_node[]){
211 .children = (struct init_tree_node[]) {
253 .children = (struct init_tree_node[]) {
307 .children = (struct init_tree_node[]) {
383 INIT_LIST_HEAD(&node->children); in tree_init_node()
698 list_bulk_move_tail(&fte->node.children, in switch_to_pending_act_dests()
699 fte->dup->children.next, in switch_to_pending_act_dests()
[all …]
/linux/drivers/net/ethernet/netronome/nfp/abm/
H A Dqdisc.c23 return qdisc->children[id] && in nfp_abm_qdisc_child_valid()
24 qdisc->children[id] != NFP_QDISC_UNTRACKED; in nfp_abm_qdisc_child_valid()
80 nfp_abm_stats_update_red(alink, qdisc->children[i], i); in nfp_abm_stats_update_mq()
113 qdisc->children[i]->use_cnt--; in nfp_abm_qdisc_unlink_children()
114 qdisc->children[i] = NULL; in nfp_abm_qdisc_unlink_children()
201 !qdisc->children[0]; in nfp_abm_offload_compile_red()
236 struct nfp_qdisc *child = qdisc->children[i]; in nfp_abm_offload_compile_mq()
310 if (mq->children[i] == qdisc) { in nfp_abm_qdisc_clear_mq()
311 mq->children[i] = NULL; in nfp_abm_qdisc_clear_mq()
332 kfree(qdisc->children); in nfp_abm_qdisc_free()
[all …]
/linux/fs/nfs/blocklayout/
H A Ddev.c54 bl_unregister_dev(&dev->children[i]); in bl_unregister_dev()
69 if (!bl_register_dev(&dev->children[i])) { in bl_register_dev()
71 bl_unregister_dev(&dev->children[--i]); in bl_register_dev()
92 bl_free_device(&dev->children[i]); in bl_free_device()
93 kfree(dev->children); in bl_free_device()
240 struct pnfs_block_dev *child = &dev->children[i]; in bl_map_concat()
279 child = &dev->children[chunk_idx]; in bl_map_stripe()
462 d->children = kcalloc(v->concat.volumes_count, in bl_parse_concat()
464 if (!d->children) in bl_parse_concat()
468 ret = bl_parse_deviceid(server, &d->children[i], in bl_parse_concat()
[all …]
/linux/include/linux/phy/
H A Dphy.h198 struct device_node *children; member
227 #define of_phy_provider_register_full(dev, children, xlate) \ argument
228 __of_phy_provider_register(dev, children, THIS_MODULE, xlate)
230 #define devm_of_phy_provider_register_full(dev, children, xlate) \ argument
231 __devm_of_phy_provider_register(dev, children, THIS_MODULE, xlate)
300 struct device_node *children, struct module *owner,
304 struct device_node *children, struct module *owner,
545 struct device *dev, struct device_node *children, struct module *owner, in __of_phy_provider_register() argument
553 *dev, struct device_node *children, struct module *owner, in __devm_of_phy_provider_register() argument
/linux/drivers/iio/multiplexer/
H A Diio-mux.c343 int children; in mux_probe() local
373 children = 0; in mux_probe()
376 children++; in mux_probe()
378 if (children <= 0) { in mux_probe()
384 sizeof_priv += sizeof(*mux->child) * children; in mux_probe()
385 sizeof_priv += sizeof(*mux->chan) * children; in mux_probe()
394 mux->chan = (struct iio_chan_spec *)(mux->child + children); in mux_probe()
408 indio_dev->num_channels = children; in mux_probe()
/linux/net/ieee802154/
H A Dpan.c36 is_assoc = !list_empty(&wpan_dev->children) || wpan_dev->parent; in cfg802154_device_is_associated()
59 list_for_each_entry(child, &wpan_dev->children, node) in cfg802154_device_is_child()
86 list_for_each_entry(child, &wpan_dev->children, node) in cfg802154_get_free_short_addr()
/linux/Documentation/devicetree/bindings/mtd/
H A Dnvidia-tegra20-nand.txt17 Optional children nodes:
18 Individual NAND chips are children of the NAND controller node. Currently
21 Required children node properties:
24 Optional children node properties:
/linux/drivers/net/mdio/
H A Dmdio-mux.c25 struct mdio_mux_child_bus *children; member
130 struct mdio_mux_child_bus *cb = pb->children; in mdio_mux_uninit_children()
237 cb->next = pb->children; in mdio_mux_init()
238 pb->children = cb; in mdio_mux_init()
241 if (pb->children) { in mdio_mux_init()
/linux/scripts/
H A Dasn1_compiler.c686 struct element *children; member
942 element->children = alloc_elem(); in parse_type()
943 element = element->children; in parse_type()
1027 element->children = parse_compound(&cursor, end, 1); in parse_type()
1041 element->children = parse_type(&cursor, end, NULL); in parse_type()
1043 element->children = parse_compound(&cursor, end, 0); in parse_type()
1058 element->children = parse_type(&cursor, end, NULL); in parse_type()
1060 element->children = parse_compound(&cursor, end, 1); in parse_type()
1150 struct element *children, **child_p = &children, *element; in parse_compound() local
1193 children->flags &= ~ELEMENT_CONDITIONAL; in parse_compound()
[all …]
/linux/tools/perf/util/
H A Dcall-path.c23 cp->children = RB_ROOT; in call_path__init()
92 p = &parent->children.rb_node; in call_path__findnew()
111 rb_insert_color(&cp->rb_node, &parent->children); in call_path__findnew()
/linux/tools/power/cpupower/lib/
H A Dpowercap.c235 if (zone->children[i] == NULL) { in powercap_read_zone()
236 zone->children[i] = child_zone; in powercap_read_zone()
303 if (zone->children[i] != NULL) in powercap_walk_zones()
304 powercap_walk_zones(zone->children[i], f); in powercap_walk_zones()
/linux/tools/perf/scripts/python/
H A Dflamegraph.py59 self.children: list[Node] = []
66 "c": [x.to_json() for x in self.children]
88 for child in node.children:
93 node.children.append(child)
/linux/drivers/input/misc/
H A Dsoc_button_array.c48 struct platform_device *children[BUTTON_TYPES]; member
426 if (priv->children[i]) in soc_button_remove()
427 platform_device_unregister(priv->children[i]); in soc_button_remove()
478 priv->children[i] = pd; in soc_button_probe()
481 if (!priv->children[0] && !priv->children[1]) in soc_button_probe()
/linux/Documentation/translations/zh_CN/driver-api/phy/
H A Dphy.rst59 #define of_phy_provider_register_full(dev, children, xlate) \
60 __of_phy_provider_register(dev, children, THIS_MODULE, xlate)
62 #define devm_of_phy_provider_register_full(dev, children, xlate) \
63 __devm_of_phy_provider_register_full(dev, children,
/linux/drivers/net/ethernet/intel/ice/
H A Dice_sched.c31 root->children = devm_kcalloc(ice_hw_to_dev(hw), hw->max_children[0], in ice_sched_add_root_node()
32 sizeof(*root->children), GFP_KERNEL); in ice_sched_add_root_node()
33 if (!root->children) { in ice_sched_add_root_node()
71 if (ICE_TXSCHED_GET_NODE_TEID(start_node->children[i]) == teid) in ice_sched_find_node_by_teid()
72 return start_node->children[i]; in ice_sched_find_node_by_teid()
78 tmp = ice_sched_find_node_by_teid(start_node->children[i], in ice_sched_find_node_by_teid()
209 node->children = devm_kcalloc(ice_hw_to_dev(hw), in ice_sched_add_node()
211 sizeof(*node->children), GFP_KERNEL); in ice_sched_add_node()
212 if (!node->children) { in ice_sched_add_node()
221 parent->children[parent->num_children++] = node; in ice_sched_add_node()
[all …]
/linux/drivers/phy/
H A Dphy-core.c147 for_each_child_of_node(phy_provider->children, child) in of_phy_provider_lookup()
1149 struct device_node *children, struct module *owner, in __of_phy_provider_register() argument
1160 if (children) { in __of_phy_provider_register()
1161 struct device_node *parent = of_node_get(children), *next; in __of_phy_provider_register()
1177 children = dev->of_node; in __of_phy_provider_register()
1185 phy_provider->children = of_node_get(children); in __of_phy_provider_register()
1212 struct device_node *children, struct module *owner, in __devm_of_phy_provider_register() argument
1222 phy_provider = __of_phy_provider_register(dev, children, owner, in __devm_of_phy_provider_register()
1248 of_node_put(phy_provider->children); in of_phy_provider_unregister()
/linux/drivers/mfd/
H A Dretu-mfd.c124 const struct mfd_cell *children; member
131 .children = retu_devs,
138 .children = tahvo_devs,
274 ret = mfd_add_devices(rdev->dev, -1, rdat->children, rdat->nchildren, in retu_probe()

12345678