/linux-6.12.1/tools/net/sunrpc/xdrgen/ |
D | xdr_ast.py | 271 def identifier(self, children): argument 273 return _XdrIdentifier(children[0].value) 275 def value(self, children): argument 277 if isinstance(children[0], _XdrIdentifier): 278 return _XdrValue(children[0].symbol) 279 return _XdrValue(children[0].children[0].value) 281 def constant(self, children): argument 283 match children[0].data: 285 value = int(children[0].children[0].value, base=10) 287 value = int(children[0].children[0].value, base=16) [all …]
|
/linux-6.12.1/tools/perf/Documentation/ |
D | callchain-overhead-calculation.txt | 3 The overhead can be shown in two columns as 'Children' and 'Self' when 9 The 'children' overhead is calculated by adding all period values of 12 'Children' here means functions that are called from another (parent) 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 70 Children Self Symbol 96 'children' overhead of 'bar', 'main' and '\_\_libc_start_main'. 98 'children' overhead of 'main' and '\_\_libc_start_main'. [all …]
|
/linux-6.12.1/tools/testing/selftests/cgroup/ |
D | test_cpu.c | 236 int (*validate)(const struct cpu_hogger *children, int num_children)) in run_cpucg_weight_test() argument 240 struct cpu_hogger children[3] = {}; in run_cpucg_weight_test() local 252 for (i = 0; i < ARRAY_SIZE(children); i++) { in run_cpucg_weight_test() 253 children[i].cgroup = cg_name_indexed(parent, "cpucg_child", i); in run_cpucg_weight_test() 254 if (!children[i].cgroup) in run_cpucg_weight_test() 257 if (cg_create(children[i].cgroup)) in run_cpucg_weight_test() 260 if (cg_write_numeric(children[i].cgroup, "cpu.weight", in run_cpucg_weight_test() 265 for (i = 0; i < ARRAY_SIZE(children); i++) { in run_cpucg_weight_test() 266 pid_t pid = spawn_child(&children[i]); in run_cpucg_weight_test() 269 children[i].pid = pid; in run_cpucg_weight_test() [all …]
|
D | test_memcontrol.c | 404 char *children[4] = {NULL}; in test_memcg_protection() local 455 for (i = 0; i < ARRAY_SIZE(children); i++) { in test_memcg_protection() 456 children[i] = cg_name_indexed(parent[1], "child_memcg", i); in test_memcg_protection() 457 if (!children[i]) in test_memcg_protection() 460 if (cg_create(children[i])) in test_memcg_protection() 466 cg_run_nowait(children[i], alloc_pagecache_50M_noexit, in test_memcg_protection() 472 if (cg_write(children[0], attribute, "75M")) in test_memcg_protection() 474 if (cg_write(children[1], attribute, "25M")) in test_memcg_protection() 476 if (cg_write(children[2], attribute, "0")) in test_memcg_protection() 478 if (cg_write(children[3], attribute, "500M")) in test_memcg_protection() [all …]
|
/linux-6.12.1/drivers/net/ethernet/mellanox/mlx5/core/ |
D | fs_core.h | 161 struct list_head children; member 190 /* Type of children is mlx5_flow_group */ 243 struct list_head children; member 247 /* Type of children is mlx5_flow_rule */ 259 /* Type of children is mlx5_flow_table/namespace */ 268 /* Type of children is fs_prio */ 280 /* Type of children is fs_fte */ 346 list_for_each_entry_reverse(pos, &(prio)->node.children, list) 349 list_for_each_entry(pos, (&(prio)->node.children), list) 352 fs_list_for_each_entry(pos, &(ns)->node.children) [all …]
|
D | fs_core.c | 55 .children = (struct init_tree_node[]) {__VA_ARGS__},\ 65 .children = (struct init_tree_node[]) {__VA_ARGS__},\ 154 struct init_tree_node *children; member 165 .children = (struct init_tree_node[]){ 206 .children = (struct init_tree_node[]) { 248 .children = (struct init_tree_node[]) { 302 .children = (struct init_tree_node[]) { 378 INIT_LIST_HEAD(&node->children); in tree_init_node() 692 list_bulk_move_tail(&fte->node.children, in switch_to_pending_act_dests() 693 fte->dup->children.next, in switch_to_pending_act_dests() [all …]
|
/linux-6.12.1/tools/testing/selftests/arm64/fp/ |
D | fp-stress.c | 41 static struct child_data *children; variable 276 if (children[i].pid == info->si_pid) { in handle_child_signal() 277 children[i].exited = true; in handle_child_signal() 278 children[i].exit_status = info->si_status; in handle_child_signal() 306 child_stop(&children[i]); in handle_exit_signal() 512 children = calloc(sizeof(*children), tests); in main() 513 if (!children) in main() 522 /* Create a pipe which children will block on before execing */ in main() 528 /* Get signal handers ready before we start any children */ in main() 553 start_fpsimd(&children[num_children++], i, 0); in main() [all …]
|
/linux-6.12.1/tools/perf/ui/browsers/ |
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-6.12.1/drivers/mfd/ |
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-6.12.1/drivers/net/ethernet/netronome/nfp/abm/ |
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-6.12.1/lib/ |
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-6.12.1/fs/bcachefs/ |
D | snapshot.c | 210 prt_printf(out, "is_subvol %llu deleted %llu parent %10u children %10u %10u subvol %u tree %u", in bch2_snapshot_to_text() 214 le32_to_cpu(s.v->children[0]), in bch2_snapshot_to_text() 215 le32_to_cpu(s.v->children[1]), in bch2_snapshot_to_text() 247 bkey_fsck_err_on(le32_to_cpu(s.v->children[0]) < le32_to_cpu(s.v->children[1]), in bch2_snapshot_validate() 249 "children not normalized"); in bch2_snapshot_validate() 251 bkey_fsck_err_on(s.v->children[0] && s.v->children[0] == s.v->children[1], in bch2_snapshot_validate() 256 id = le32_to_cpu(s.v->children[i]); in bch2_snapshot_validate() 321 t->children[0] = le32_to_cpu(s.v->children[0]); in __bch2_mark_snapshot() 322 t->children[1] = le32_to_cpu(s.v->children[1]); in __bch2_mark_snapshot() 407 child[0] = le32_to_cpu(snap.v->children[0]); in bch2_snapshot_set_equiv() [all …]
|
/linux-6.12.1/fs/nfs/blocklayout/ |
D | dev.c | 57 bl_unregister_dev(&dev->children[i]); in bl_unregister_dev() 71 if (!bl_register_dev(&dev->children[i])) { in bl_register_dev() 73 bl_unregister_dev(&dev->children[--i]); in bl_register_dev() 94 bl_free_device(&dev->children[i]); in bl_free_device() 95 kfree(dev->children); in bl_free_device() 242 struct pnfs_block_dev *child = &dev->children[i]; in bl_map_concat() 280 child = &dev->children[chunk_idx]; in bl_map_stripe() 463 d->children = kcalloc(v->concat.volumes_count, in bl_parse_concat() 465 if (!d->children) in bl_parse_concat() 469 ret = bl_parse_deviceid(server, &d->children[i], in bl_parse_concat() [all …]
|
/linux-6.12.1/drivers/powercap/ |
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-6.12.1/samples/configfs/ |
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-6.12.1/Documentation/devicetree/bindings/mtd/ |
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-6.12.1/include/uapi/linux/ |
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-6.12.1/drivers/net/mdio/ |
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-6.12.1/include/linux/phy/ |
D | phy.h | 173 * @children: can be used to override the default (dev->of_node) child node 180 struct device_node *children; member 209 #define of_phy_provider_register_full(dev, children, xlate) \ argument 210 __of_phy_provider_register(dev, children, THIS_MODULE, xlate) 212 #define devm_of_phy_provider_register_full(dev, children, xlate) \ argument 213 __devm_of_phy_provider_register(dev, children, THIS_MODULE, xlate) 283 struct device_node *children, struct module *owner, 287 struct device_node *children, struct module *owner, 531 struct device *dev, struct device_node *children, struct module *owner, in __of_phy_provider_register() argument 539 *dev, struct device_node *children, struct module *owner, in __devm_of_phy_provider_register() argument
|
/linux-6.12.1/drivers/input/serio/ |
D | serio.c | 312 * Children are registered by driver's connect() handler so there can't be a 502 INIT_LIST_HEAD(&serio->children); in serio_init_port() 530 list_add_tail(&serio->child_node, &parent->children); in serio_add_port() 596 * Reconnect serio port and all its children (re-initialize attached 611 if (!list_empty(&s->children)) { in serio_reconnect_subtree() 612 s = list_first_entry(&s->children, in serio_reconnect_subtree() 626 if (!list_is_last(&s->child_node, &parent->children)) { in serio_reconnect_subtree() 639 * all children ports are unbound and destroyed. 646 * Children ports should be disconnected and destroyed in serio_disconnect_port() 649 while (!list_empty(&serio->children)) { in serio_disconnect_port() [all …]
|
/linux-6.12.1/drivers/iio/multiplexer/ |
D | iio-mux.c | 335 int children; in mux_probe() local 365 children = 0; in mux_probe() 368 children++; in mux_probe() 370 if (children <= 0) { in mux_probe() 376 sizeof_priv += sizeof(*mux->child) * children; in mux_probe() 377 sizeof_priv += sizeof(*mux->chan) * children; in mux_probe() 386 mux->chan = (struct iio_chan_spec *)(mux->child + children); in mux_probe() 400 indio_dev->num_channels = children; in mux_probe()
|
/linux-6.12.1/drivers/net/ethernet/intel/ice/ |
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() 188 node->children = devm_kcalloc(ice_hw_to_dev(hw), in ice_sched_add_node() 190 sizeof(*node->children), GFP_KERNEL); in ice_sched_add_node() [all …]
|
/linux-6.12.1/drivers/i2c/muxes/ |
D | i2c-mux-gpmux.c | 77 int children; in i2c_mux_probe() local 97 children = of_get_child_count(np); in i2c_mux_probe() 99 muxc = i2c_mux_alloc(parent, dev, children, 0, 0, in i2c_mux_probe() 132 dev_info(dev, "%d-port mux on %s adapter\n", children, parent->name); in i2c_mux_probe()
|
/linux-6.12.1/Documentation/driver-api/phy/ |
D | phy.rst | 53 of children that each represent a single PHY. Some bindings may nest the child 56 macros can be used to override the node containing the children. 60 #define of_phy_provider_register_full(dev, children, xlate) \ 61 __of_phy_provider_register(dev, children, THIS_MODULE, xlate) 63 #define devm_of_phy_provider_register_full(dev, children, xlate) \ 64 __devm_of_phy_provider_register_full(dev, children,
|
/linux-6.12.1/Documentation/devicetree/bindings/bus/ |
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 */
|