| /linux/tools/net/sunrpc/xdrgen/ |
| H A D | xdr_ast.py | 554 def identifier(self, children): argument
556 token = children[0]
559 def value(self, children): argument
561 if isinstance(children[0], _XdrIdentifier):
562 return _XdrValue(children[0].symbol)
563 return _XdrValue(children[0].children[0].value)
565 def constant(self, children): argument
567 match children[0].data:
569 value = int(children[0].children[0].value, base=10)
571 value = int(children[0].children[0].value, base=16)
[all …]
|
| /linux/tools/perf/Documentation/ |
| H A D | callchain-overhead-calculation.txt | 3 The CPU overhead can be shown in two columns as 'Children' and 'Self'
10 The 'children' overhead is calculated by adding all period values of
13 'Children' here means functions that are called from another (parent)
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
71 Children Self Symbol
97 'children' overhead of 'bar', 'main' and '\_\_libc_start_main'.
99 'children' overhea
[all...] |
| /linux/tools/testing/selftests/cgroup/ |
| H A D | test_cpu.c | 313 int (*validate)(const struct cpu_hogger *children, int num_children)) in run_cpucg_weight_test() argument
317 struct cpu_hogger children[3] = {}; in run_cpucg_weight_test() local
329 for (i = 0; i < ARRAY_SIZE(children); i++) { in run_cpucg_weight_test()
330 children[i].cgroup = cg_name_indexed(parent, "cpucg_child", i); in run_cpucg_weight_test()
331 if (!children[i].cgroup) in run_cpucg_weight_test()
334 if (cg_create(children[i].cgroup)) in run_cpucg_weight_test()
337 if (cg_write_numeric(children[i].cgroup, "cpu.weight", in run_cpucg_weight_test()
342 for (i = 0; i < ARRAY_SIZE(children); i++) { in run_cpucg_weight_test()
343 pid_t pid = spawn_child(&children[i]); in run_cpucg_weight_test()
346 children[i].pid = pid; in run_cpucg_weight_test()
[all …]
|
| /linux/drivers/net/ethernet/mellanox/mlx5/core/ |
| H A D | fs_core.h | 152 struct list_head children; member
181 /* Type of children is mlx5_flow_group */
228 struct list_head children; member
232 /* Type of children is mlx5_flow_rule */
247 /* Type of children is mlx5_flow_table/namespace */
256 /* Type of children is fs_prio */
268 /* Type of children is fs_fte */
379 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
382 list_for_each_entry(pos, (&(prio)->node.children), list)
385 fs_list_for_each_entry(pos, &(ns)->node.children)
[all …]
|
| /linux/tools/testing/selftests/arm64/fp/ |
| H A D | fp-stress.c | 44 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()
525 /* Create a pipe which children will block on before execing */ in main()
531 /* Get signal handers ready before we start any children */ in main()
556 start_fpsimd(&children[num_children++], i, 0); in main()
[all …]
|
| /linux/tools/testing/selftests/arm64/gcs/ |
| H A D | gcs-stress.c | 40 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()
409 /* Create a pipe which children will block on before execing */ in main()
415 /* Get signal handers ready before we start any children */ in main()
440 start_thread(&children[i], i); in main()
[all …]
|
| /linux/drivers/net/ethernet/netronome/nfp/abm/ |
| H A D | qdisc.c | 23 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()
295 * MQ's children. in nfp_abm_qdisc_clear_mq()
310 if (mq->children[i] == qdisc) { in nfp_abm_qdisc_clear_mq()
311 mq->children[i] = NULL; in nfp_abm_qdisc_clear_mq()
[all …]
|
| /linux/tools/perf/ui/browsers/ |
| H A D | annotate-data.c | 26 struct list_head children; member
29 bool folded; /* only can be false when it has children */
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()
[all …]
|
| /linux/lib/ |
| H A D | generic-radix-tree.c | 49 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/fs/nfs/blocklayout/ |
| H A D | dev.c | 55 bl_unregister_dev(&dev->children[i]); in bl_unregister_dev()
70 if (!bl_register_dev(&dev->children[i])) { in bl_register_dev()
72 bl_unregister_dev(&dev->children[--i]); in bl_register_dev()
89 if (dev->children) { in bl_free_device()
93 bl_free_device(&dev->children[i]); in bl_free_device()
94 kfree(dev->children); in bl_free_device()
95 dev->children = NULL; in bl_free_device()
243 struct pnfs_block_dev *child = &dev->children[i]; in bl_map_concat()
282 child = &dev->children[chunk_idx]; in bl_map_stripe()
477 d->children = kzalloc_objs(struct pnfs_block_dev, in bl_parse_concat()
[all …]
|
| /linux/drivers/powercap/ |
| H A D | dtpm.c | 13 * 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) { in __get_power_uw()
91 list_for_each_entry(child, &dtpm->children, sibling) { in __dtpm_rebalance_weight()
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)) in dtpm_release_zone()
200 * given the weight of the children.
231 list_for_each_entry(child, &dtpm->children, sibling) { in __set_power_limit_uw()
322 INIT_LIST_HEAD(&dtpm->children); in dtpm_init()
[all …]
|
| /linux/samples/configfs/ |
| H A D | configfs_sample.c | 27 * on the subsystem. See the next example, 02-simple-children, for
113 * 02-simple-children
200 "[02-simple-children]\n" in simple_children_description_show()
240 .ci_namebuf = "02-simple-children",
249 * 03-group-children
255 * children of its own.
278 "[03-group-children]\n" in group_children_description_show()
281 "groups are like the subsystem simple-children.\n"); in group_children_description_show()
308 .ci_namebuf = "03-group-children",
|
| /linux/tools/testing/selftests/namespaces/ |
| H A D | stress_test.c | 120 /* Create many children, each with their own user namespace */ in TEST()
155 /* Wait for all children to signal ready */ in TEST()
159 /* If we fail to read, kill all children and exit */ in TEST()
169 /* List namespaces while all children are running */ in TEST()
173 TH_LOG("With %d children running: %zd active user namespaces", num_children, ret_during); in TEST()
178 /* Signal all children to exit */ in TEST()
182 /* If we fail to write, kill remaining children */ in TEST()
194 /* Wait for all children */ in TEST()
205 TH_LOG("After all children exit: %zd active user namespaces", ret_after); in TEST()
363 /* Create many children with user namespaces */ in TEST()
[all …]
|
| H A D | listns_efault_test.c | 151 /* Wait for all children to finish setup */ in TEST()
159 * Signal children to exit. This will destroy their mount namespaces in TEST()
166 /* Wait for all mount namespace children to exit and cleanup */ in TEST()
321 * Create more children with mount namespaces to increase the in TEST()
364 /* Wait for all children to finish setup */ in TEST()
371 /* Kill half the children */ in TEST()
378 /* Kill remaining children */ in TEST()
382 /* Wait for all children and cleanup */ in TEST()
472 /* Create children with mount namespaces */ in TEST()
513 /* Wait for all children t in TEST()
[all...] |
| /linux/include/uapi/linux/ |
| H A D | wait.h | 12 #define __WNOTHREAD 0x20000000 /* Don't wait on children of other threads in this group */
13 #define __WALL 0x40000000 /* Wait on all children, regardless of type */
14 #define __WCLONE 0x80000000 /* Wait only on non-SIGCHLD children */
|
| /linux/drivers/net/mdio/ |
| H A D | mdio-mux.c | 24 /* List of our children linked through their next fields. */
25 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/drivers/input/serio/ |
| H A D | serio.c | 291 * Children are registered by driver's connect() handler so there can't be a
475 INIT_LIST_HEAD(&serio->children); in serio_init_port()
504 list_add_tail(&serio->child_node, &parent->children); in serio_add_port()
569 * Reconnect serio port and all its children (re-initialize attached
584 if (!list_empty(&s->children)) { in serio_reconnect_subtree()
585 s = list_first_entry(&s->children, in serio_reconnect_subtree()
599 if (!list_is_last(&s->child_node, &parent->children)) { in serio_reconnect_subtree()
612 * all children ports are unbound and destroyed.
619 * Children ports should be disconnected and destroyed in serio_disconnect_port()
622 while (!list_empty(&serio->children)) { in serio_disconnect_port()
[all …]
|
| /linux/drivers/iio/multiplexer/ |
| H A D | iio-mux.c | 342 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()
407 indio_dev->num_channels = children; in mux_probe()
|
| /linux/tools/testing/selftests/sched_ext/ |
| H A D | init_enable_count.c | 41 * Fork a bunch of children before we attach the scheduler so that we in run_test()
46 * All children will block on read() on the pipe until the parent closes in run_test()
71 /* Signal all pre-forked children to exit. */ in run_test()
82 /* SCHED_EXT children */ in run_test()
112 /* SCHED_OTHER children */ in run_test()
|
| /linux/drivers/net/ethernet/mellanox/mlx5/core/esw/ |
| H A D | qos.c | 38 /* A computed value indicating relative min_rate between node's children. */
42 /* Entry in the parent node's children list. */
48 /* The children nodes of this node, empty list for leaf nodes.
51 struct list_head children; member
135 list_add_tail(&node->entry, &parent->children); in esw_qos_node_set_parent()
145 if (!list_empty(&node->children) && in esw_qos_nodes_set_parent()
149 list_for_each_entry(child, &node->children, entry) { in esw_qos_nodes_set_parent()
334 list_for_each_entry(node, &parent->children, entry) in esw_qos_calculate_min_rate_divider()
374 list_for_each_entry(node, &parent->children, entry) { in esw_qos_normalize_min_rate()
383 if (list_empty(&node->children)) in esw_qos_normalize_min_rate()
[all …]
|
| /linux/fs/tracefs/ |
| H A D | event_inode.c | 127 /* The ei should have no children if it is being freed. */ in free_ei()
128 WARN_ON_ONCE(!list_empty(&ei->children)); in free_ei()
134 * not use the child it acquired from ei->children, as in free_ei()
199 /* Preallocate the children mode array if necessary */ in eventfs_set_attr()
273 list_for_each_entry(ei_child, &ei->children, list) { in eventfs_set_attrs()
546 list_for_each_entry(ei_child, &ei->children, list) { in eventfs_root_lookup()
575 * Walk the children of a eventfs_inode to fill in getdents().
641 list_for_each_entry_srcu(ei_child, &ei->children, list, in eventfs_iterate()
645 * If the ei is being freed, then the ei->children may be in eventfs_iterate()
648 * the ei->children over to ei->rcu. The read memory barrier in eventfs_iterate()
[all …]
|
| /linux/drivers/net/ethernet/intel/ice/ |
| H A D | ice_sched.c | 31 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()
63 /* The node has no children or is at the max layer */ in ice_sched_find_node_by_teid()
69 /* Check if TEID matches to any of the children nodes */ in ice_sched_find_node_by_teid()
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()
[all …]
|
| /linux/Documentation/devicetree/bindings/bus/ |
| H A D | mvebu-mbus.txt | 76 /* more children ...*/
82 The MBus children address space is comprised of two cells: the first one for
123 /* other children */
135 /* more children ...*/
165 /* other children */
179 /* other children */
|
| /linux/drivers/acpi/acpica/ |
| H A D | nsalloc.c | 220 /* Link the new entry into the parent and existing children */ in acpi_ns_install_node()
258 * PARAMETERS: parent_node - Delete this objects children
262 * DESCRIPTION: Delete all children of the parent object. In other words,
278 /* Deallocate all children at this level */ in acpi_ns_delete_children()
352 /* Check if this node has any children */ in acpi_ns_delete_namespace_subtree()
365 * No more children of this parent node. in acpi_ns_delete_namespace_subtree()
371 * Now delete all of the children of this parent in acpi_ns_delete_namespace_subtree()
457 /* Check if this node has any children */ in acpi_ns_delete_namespace_by_owner()
472 * No more children of this parent node. in acpi_ns_delete_namespace_by_owner()
|
| /linux/drivers/phy/ |
| H A D | phy-core.c | 146 for_each_child_of_node_scoped(phy_provider->children, child) in of_phy_provider_lookup()
1130 * @children: device node containing children (if different from dev->of_node)
1138 * If the PHY provider doesn't nest children directly but uses a separate
1139 * child node to contain the individual children, the @children parameter
1146 struct device_node *children, struct module *owner, in __of_phy_provider_register() argument
1153 * If specified, the device node containing the children must itself in __of_phy_provider_register()
1157 if (children) { in __of_phy_provider_register()
1158 struct device_node *parent = of_node_get(children), *next; in __of_phy_provider_register()
1174 children = dev->of_node; in __of_phy_provider_register()
1182 phy_provider->children = of_node_get(children); in __of_phy_provider_register()
[all …]
|