/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...] |
H A D | perf-config.txt | 124 children = true 152 % perf config report.queue-size call-graph.order report.children 490 If this option is not set and report.children or top.children is 528 report.children:: 529 'Children' means functions called from another function. 530 If this option is true, 'perf report' cumulates callchains of children 557 top.children:: 558 Same as 'report.children'. So if it is enabled, the output of 'top' 559 command will have 'Children' overhead column as well as 'Self' overhead 641 Do not follow children threads.
|
/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/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/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/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/drivers/mfd/ |
H A D | wl1273-core.c | 164 int children = 0; in wl1273_core_probe() local 174 if (!(pdata->children & WL1273_RADIO_CHILD)) { in wl1273_core_probe() 191 cell = &core->cells[children]; in wl1273_core_probe() 195 children++; in wl1273_core_probe() 203 if (pdata->children & WL1273_CODEC_CHILD) { in wl1273_core_probe() 204 cell = &core->cells[children]; in wl1273_core_probe() 210 children++; in wl1273_core_probe() 213 dev_dbg(&client->dev, "%s: number of children: %d.\n", in wl1273_core_probe() 214 __func__, children); in wl1273_core_probe() 217 children, NULL, 0, NULL); in wl1273_core_probe()
|
/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 | 54 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/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/Documentation/filesystems/ |
H A D | propagate_umount.txt | 19 3) A set S is closed if it contains all children of its elements. 141 Note 3: if y has no children outside of S, it can't forbid anything in S. 150 Note that if m does not belong to S or has no children outside of S we 217 for each n in children(m) 236 to S. If m has no such children, Trim(S, m) is equal to S. 292 for each n in children(m) 323 * the loop over children in Trim_one() never looks at the same child 325 * iterations of that loop for children in S are no more than O(#S) 327 * at most two children that are not elements of S are considered per 339 lists of children, which means that checking if child belongs to S is [all …]
|
H A D | directory-locking.rst | 103 exclusive prevents such changes involving its children and holding the 214 cross-directory rename; parents first, then possibly their children. 220 children must be involved and thus neither of them could be a descendent 225 a loop, since the parents are locked before the children, so the parent 233 among the children, in some order. But that is also impossible, since 234 neither of the children is a descendent of another. 284 children", so if we are going to introduce hybrid objects we will need
|
/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/Documentation/devicetree/bindings/mtd/ |
H A 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/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/input/serio/ |
H A D | serio.c | 290 * Children are registered by driver's connect() handler so there can't be a 474 INIT_LIST_HEAD(&serio->children); in serio_init_port() 503 list_add_tail(&serio->child_node, &parent->children); in serio_add_port() 568 * Reconnect serio port and all its children (re-initialize attached 583 if (!list_empty(&s->children)) { in serio_reconnect_subtree() 584 s = list_first_entry(&s->children, in serio_reconnect_subtree() 598 if (!list_is_last(&s->child_node, &parent->children)) { in serio_reconnect_subtree() 611 * all children ports are unbound and destroyed. 618 * Children ports should be disconnected and destroyed in serio_disconnect_port() 621 while (!list_empty(&serio->children)) { in serio_disconnect_port() [all …]
|
/linux/include/linux/phy/ |
H A D | phy.h | 180 * @children: can be used to override the default (dev->of_node) child node 187 struct device_node *children; member 216 #define of_phy_provider_register_full(dev, children, xlate) \ argument 217 __of_phy_provider_register(dev, children, THIS_MODULE, xlate) 219 #define devm_of_phy_provider_register_full(dev, children, xlate) \ argument 220 __devm_of_phy_provider_register(dev, children, THIS_MODULE, xlate) 288 struct device_node *children, struct module *owner, 292 struct device_node *children, struct module *owner, 526 struct device *dev, struct device_node *children, struct module *owner, in __of_phy_provider_register() argument 534 *dev, struct device_node *children, struct module *owner, in __devm_of_phy_provider_register() argument
|
/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/iio/multiplexer/ |
H A D | iio-mux.c | 343 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/tools/testing/selftests/cgroup/ |
H A D | test_memcontrol.c | 483 char *children[4] = {NULL}; in test_memcg_protection() 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[ in test_memcg_protection() 405 char *children[4] = {NULL}; test_memcg_protection() local [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/phy/ |
H A D | phy-core.c | 147 for_each_child_of_node(phy_provider->children, child) in of_phy_provider_lookup() 1108 * @children: device node containing children (if different from dev->of_node) 1116 * If the PHY provider doesn't nest children directly but uses a separate 1117 * child node to contain the individual children, the @children parameter 1124 struct device_node *children, struct module *owner, in __of_phy_provider_register() argument 1131 * If specified, the device node containing the children must itself in __of_phy_provider_register() 1135 if (children) { in __of_phy_provider_register() 1136 struct device_node *parent = of_node_get(children), *next; in __of_phy_provider_register() 1152 children = dev->of_node; in __of_phy_provider_register() 1160 phy_provider->children = of_node_get(children); in __of_phy_provider_register() [all …]
|
/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/net/ieee802154/ |
H A D | pan.c | 36 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()
|