| /Linux-v4.19/tools/testing/selftests/cgroup/ |
| D | test_memcontrol.c | 264 char *children[4] = {NULL}; in test_memcg_min() local
311 for (i = 0; i < ARRAY_SIZE(children); i++) { in test_memcg_min()
312 children[i] = cg_name_indexed(parent[1], "child_memcg", i); in test_memcg_min()
313 if (!children[i]) in test_memcg_min()
316 if (cg_create(children[i])) in test_memcg_min()
322 cg_run_nowait(children[i], alloc_pagecache_50M_noexit, in test_memcg_min()
330 if (cg_write(children[0], "memory.min", "75M")) in test_memcg_min()
332 if (cg_write(children[1], "memory.min", "25M")) in test_memcg_min()
334 if (cg_write(children[2], "memory.min", "500M")) in test_memcg_min()
336 if (cg_write(children[3], "memory.min", "0")) in test_memcg_min()
[all …]
|
| /Linux-v4.19/tools/perf/Documentation/ |
| D | callchain-overhead-calculation.txt | 9 The 'children' overhead is calculated by adding all period values of
15 It might be confusing that the sum of all the 'children' overhead
19 spread over the children.
64 When the --children option is enabled, the 'self' overhead values of
66 calculate the 'children' overhead. In this case the report could be
96 'children' overhead of 'bar', 'main' and '\_\_libc_start_main'.
98 'children' overhead of 'main' and '\_\_libc_start_main'.
101 same (100%) 'children' overhead (even though they have zero 'self'
104 Since v3.16 the 'children' overhead is shown by default and the output
105 is sorted by its values. The 'children' overhead is disabled by
[all …]
|
| /Linux-v4.19/drivers/net/ethernet/mellanox/mlx5/core/ |
| D | fs_core.h | 84 struct list_head children; member
249 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
252 list_for_each_entry(pos, (&(prio)->node.children), list)
255 fs_list_for_each_entry(pos, &(ns)->node.children)
258 fs_list_for_each_entry(pos, &(prio)->node.children)
261 fs_list_for_each_entry(pos, &(prio)->node.children)
264 fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)
267 fs_list_for_each_entry(pos, &(ft)->node.children)
270 fs_list_for_each_entry(pos, &(fg)->node.children)
273 fs_list_for_each_entry(pos, &(fte)->node.children)
|
| D | fs_core.c | 53 .children = (struct init_tree_node[]) {__VA_ARGS__},\
62 .children = (struct init_tree_node[]) {__VA_ARGS__},\
117 struct init_tree_node *children; member
127 .children = (struct init_tree_node[]) {
202 INIT_LIST_HEAD(&node->children); in tree_init_node()
549 list_add_tail(&fte->node.list, &fg->node.children); in insert_fte()
700 list_for_each_advance_continue(iter, &root->children, reverse) { in find_closest_ft_recursive()
705 ft = find_closest_ft_recursive(iter, &iter->children, reverse); in find_closest_ft_recursive()
911 if (list_empty(&prio->node.children)) { in connect_flow_table()
931 struct list_head *prev = &prio->node.children; in list_add_flow_table()
[all …]
|
| /Linux-v4.19/drivers/mfd/ |
| D | wl1273-core.c | 179 int children = 0; in wl1273_core_probe() local
189 if (!(pdata->children & WL1273_RADIO_CHILD)) { in wl1273_core_probe()
206 cell = &core->cells[children]; in wl1273_core_probe()
210 children++; in wl1273_core_probe()
218 if (pdata->children & WL1273_CODEC_CHILD) { in wl1273_core_probe()
219 cell = &core->cells[children]; in wl1273_core_probe()
225 children++; in wl1273_core_probe()
229 __func__, children); in wl1273_core_probe()
232 children, NULL, 0, NULL); in wl1273_core_probe()
|
| D | twl6040.c | 644 int irq, ret, children = 0; in twl6040_probe() local
764 cell = &twl6040->cells[children]; in twl6040_probe()
770 children++; in twl6040_probe()
776 cell = &twl6040->cells[children]; in twl6040_probe()
782 children++; in twl6040_probe()
786 cell = &twl6040->cells[children]; in twl6040_probe()
788 children++; in twl6040_probe()
791 cell = &twl6040->cells[children]; in twl6040_probe()
793 children++; in twl6040_probe()
799 ret = mfd_add_devices(&client->dev, -1, twl6040->cells, children, in twl6040_probe()
|
| D | retu-mfd.c | 124 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()
|
| /Linux-v4.19/drivers/platform/x86/ |
| D | surface3_button.c | 69 struct platform_device *children[BUTTON_TYPES]; member
171 if (priv->children[i]) in surface3_button_remove()
172 platform_device_unregister(priv->children[i]); in surface3_button_remove()
224 priv->children[i] = pd; in surface3_button_probe()
227 if (!priv->children[0] && !priv->children[1]) in surface3_button_probe()
|
| /Linux-v4.19/include/linux/phy/ |
| D | phy.h | 109 struct device_node *children; member
138 #define of_phy_provider_register_full(dev, children, xlate) \ argument
139 __of_phy_provider_register(dev, children, THIS_MODULE, xlate)
141 #define devm_of_phy_provider_register_full(dev, children, xlate) \ argument
142 __devm_of_phy_provider_register(dev, children, THIS_MODULE, xlate)
200 struct device_node *children, struct module *owner,
204 struct device_node *children, struct module *owner,
393 struct device *dev, struct device_node *children, struct module *owner, in __of_phy_provider_register() argument
401 *dev, struct device_node *children, struct module *owner, in __devm_of_phy_provider_register() argument
|
| /Linux-v4.19/arch/s390/numa/ |
| D | toptree.h | 21 struct list_head children; member
37 list_for_each_entry(child, &ptree->children, sibling)
40 list_for_each_entry_safe(child, ptmp, &ptree->children, sibling)
44 (ptree->parent->children.prev == &ptree->sibling))
|
| D | toptree.c | 41 INIT_LIST_HEAD(&res->children); in toptree_alloc()
105 list_for_each_entry(child, &cand->children, sibling) in toptree_update_mask()
128 list_add_tail(&cand->sibling, &target->children); in toptree_insert()
264 if (!list_empty(&context->children)) { in toptree_first()
265 list_for_each_entry(child, &context->children, sibling) { in toptree_first()
287 if (cur == list_last_entry(&cur->parent->children, in toptree_next_sibling()
|
| /Linux-v4.19/fs/nfs/blocklayout/ |
| D | dev.c | 23 bl_free_device(&dev->children[i]); in bl_free_device()
24 kfree(dev->children); in bl_free_device()
182 struct pnfs_block_dev *child = &dev->children[i]; in bl_map_concat()
220 child = &dev->children[chunk_idx]; in bl_map_stripe()
424 d->children = kcalloc(v->concat.volumes_count, in bl_parse_concat()
426 if (!d->children) in bl_parse_concat()
430 ret = bl_parse_deviceid(server, &d->children[i], in bl_parse_concat()
436 d->children[i].start += len; in bl_parse_concat()
437 len += d->children[i].len; in bl_parse_concat()
453 d->children = kcalloc(v->stripe.volumes_count, in bl_parse_stripe()
[all …]
|
| /Linux-v4.19/drivers/net/ethernet/intel/ice/ |
| D | ice_sched.c | 32 root->children = devm_kcalloc(ice_hw_to_dev(hw), max_children, in ice_sched_add_root_node()
34 if (!root->children) { in ice_sched_add_root_node()
72 if (ICE_TXSCHED_GET_NODE_TEID(start_node->children[i]) == teid) in ice_sched_find_node_by_teid()
73 return start_node->children[i]; in ice_sched_find_node_by_teid()
79 tmp = ice_sched_find_node_by_teid(start_node->children[i], in ice_sched_find_node_by_teid()
125 node->children = devm_kcalloc(ice_hw_to_dev(hw), max_children, in ice_sched_add_node()
127 if (!node->children) { in ice_sched_add_node()
136 parent->children[parent->num_children++] = node; in ice_sched_add_node()
224 struct ice_sched_node *node = parent->children[i]; in ice_sched_get_first_node()
252 if (pi->root->children[i]->tc_num == tc) in ice_sched_get_tc_node()
[all …]
|
| /Linux-v4.19/drivers/net/phy/ |
| D | mdio-mux.c | 28 struct mdio_mux_child_bus *children; member
177 cb->next = pb->children; in mdio_mux_init()
178 pb->children = cb; in mdio_mux_init()
181 if (pb->children) { in mdio_mux_init()
199 struct mdio_mux_child_bus *cb = pb->children; in mdio_mux_uninit()
|
| /Linux-v4.19/drivers/i2c/muxes/ |
| D | i2c-mux-gpmux.c | 80 int children; in i2c_mux_probe() local
104 children = of_get_child_count(np); in i2c_mux_probe()
106 muxc = i2c_mux_alloc(parent, dev, children, 0, 0, in i2c_mux_probe()
139 dev_info(dev, "%d-port mux on %s adapter\n", children, parent->name); in i2c_mux_probe()
|
| /Linux-v4.19/Documentation/devicetree/bindings/mtd/ |
| D | ingenic,jz4780-nand.txt | 6 be children of the NEMC node.
19 Optional children nodes:
20 - Individual NAND chips are children of the NAND controller node.
22 Required children node properties:
25 Optional children node properties:
|
| D | nvidia-tegra20-nand.txt | 17 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-v4.19/drivers/iio/multiplexer/ |
| D | iio-mux.c | 351 int children; in mux_probe() local
372 children = 0; in mux_probe()
375 children++; in mux_probe()
377 if (children <= 0) { in mux_probe()
383 sizeof_priv += sizeof(*mux->child) * children; in mux_probe()
384 sizeof_priv += sizeof(*mux->chan) * children; in mux_probe()
393 mux->chan = (struct iio_chan_spec *)(mux->child + children); in mux_probe()
405 indio_dev->num_channels = children; in mux_probe()
|
| /Linux-v4.19/drivers/input/misc/ |
| D | soc_button_array.c | 40 struct platform_device *children[BUTTON_TYPES]; member
303 if (priv->children[i]) in soc_button_remove()
304 platform_device_unregister(priv->children[i]); in soc_button_remove()
354 priv->children[i] = pd; in soc_button_probe()
357 if (!priv->children[0] && !priv->children[1]) in soc_button_probe()
|
| /Linux-v4.19/tools/perf/util/ |
| D | call-path.c | 31 cp->children = RB_ROOT; in call_path__init()
100 p = &parent->children.rb_node; in call_path__findnew()
119 rb_insert_color(&cp->rb_node, &parent->children); in call_path__findnew()
|
| /Linux-v4.19/drivers/phy/ |
| D | phy-core.c | 144 for_each_child_of_node(phy_provider->children, child) in of_phy_provider_lookup()
899 struct device_node *children, struct module *owner, in __of_phy_provider_register() argument
910 if (children) { in __of_phy_provider_register()
911 struct device_node *parent = of_node_get(children), *next; in __of_phy_provider_register()
927 children = dev->of_node; in __of_phy_provider_register()
935 phy_provider->children = of_node_get(children); in __of_phy_provider_register()
961 struct device_node *children, struct module *owner, in __devm_of_phy_provider_register() argument
971 phy_provider = __of_phy_provider_register(dev, children, owner, in __devm_of_phy_provider_register()
997 of_node_put(phy_provider->children); in of_phy_provider_unregister()
|
| /Linux-v4.19/scripts/ |
| D | asn1_compiler.c | 690 struct element *children; member
946 element->children = alloc_elem(cursor); in parse_type()
947 element = element->children; in parse_type()
1031 element->children = parse_compound(&cursor, end, 1); in parse_type()
1045 element->children = parse_type(&cursor, end, NULL); in parse_type()
1047 element->children = parse_compound(&cursor, end, 0); in parse_type()
1062 element->children = parse_type(&cursor, end, NULL); in parse_type()
1064 element->children = parse_compound(&cursor, end, 1); in parse_type()
1154 struct element *children, **child_p = &children, *element; in parse_compound() local
1197 children->flags &= ~ELEMENT_CONDITIONAL; in parse_compound()
[all …]
|
| /Linux-v4.19/arch/c6x/platforms/ |
| D | pll.c | 102 list_for_each_entry(clk, &root->children, childnode) { in propagate_rate()
146 list_add(&clk->childnode, &clk->parent->children); in clk_set_parent()
172 list_add_tail(&clk->childnode, &clk->parent->children); in clk_register()
329 INIT_LIST_HEAD(&clk->children); in __init_clk()
403 list_for_each_entry(clk, &parent->children, childnode) { in dump_clock()
|
| /Linux-v4.19/scripts/dtc/ |
| D | livetree.c | 100 struct node *build_node(struct property *proplist, struct node *children) in build_node() argument
108 new->children = children; in build_node()
199 while (new_node->children) { in merge_nodes()
201 new_child = new_node->children; in merge_nodes()
202 new_node->children = new_child->next_sibling; in merge_nodes()
309 p = &parent->children; in add_child()
318 struct node *node = parent->children; in delete_node_by_name()
635 bootcpu = cpus->children; in guess_boot_cpuid()
761 node->children = tbl[0]; in sort_subnodes()
|
| /Linux-v4.19/drivers/input/serio/ |
| D | serio.c | 517 INIT_LIST_HEAD(&serio->children); in serio_init_port()
545 list_add_tail(&serio->child_node, &parent->children); in serio_add_port()
626 if (!list_empty(&s->children)) { in serio_reconnect_subtree()
627 s = list_first_entry(&s->children, in serio_reconnect_subtree()
641 if (!list_is_last(&s->child_node, &parent->children)) { in serio_reconnect_subtree()
664 while (!list_empty(&serio->children)) { in serio_disconnect_port()
667 while (!list_empty(&s->children)) in serio_disconnect_port()
668 s = list_first_entry(&s->children, in serio_disconnect_port()
734 list_for_each_entry_safe(s, next, &serio->children, child_node) { in serio_unregister_child_port()
|
