| /linux/tools/net/sunrpc/xdrgen/ |
| H A D | xdr_ast.py | 535 def identifier(self, children): argument
537 return _XdrIdentifier(children[0].value)
539 def value(self, children): argument
541 if isinstance(children[0], _XdrIdentifier):
542 return _XdrValue(children[0].symbol)
543 return _XdrValue(children[0].children[0].value)
545 def constant(self, children): argument
547 match children[0].data:
549 value = int(children[
556 type_specifier(self, children) global() argument
565 constant_def(self, children) global() argument
573 enum(self, children) global() argument
588 fixed_length_opaque(self, children) global() argument
595 variable_length_opaque(self, children) global() argument
605 string(self, children) global() argument
615 fixed_length_array(self, children) global() argument
623 variable_length_array(self, children) global() argument
634 optional_data(self, children) global() argument
641 basic(self, children) global() argument
648 void(self, children) global() argument
653 struct(self, children) global() argument
667 typedef(self, children) global() argument
673 case_spec(self, children) global() argument
682 default_spec(self, children) global() argument
688 union(self, children) global() argument
699 procedure_def(self, children) global() argument
708 version_def(self, children) global() argument
716 program_def(self, children) global() argument
724 pragma_def(self, children) global() argument
[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 | 311 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[ in run_cpucg_weight_test()
396 overprovision_validate(const struct cpu_hogger * children,int num_children) overprovision_validate() argument
442 underprovision_validate(const struct cpu_hogger * children,int num_children) underprovision_validate() argument
[all...] |
| /linux/drivers/net/ethernet/mellanox/mlx5/core/ |
| H A D | fs_core.h | 172 struct list_head children; member
201 /* Type of children is mlx5_flow_group */
257 struct list_head children; member
261 /* Type of children is mlx5_flow_rule */
276 /* Type of children is mlx5_flow_table/namespace */
285 /* Type of children is fs_prio */
297 /* Type of children is fs_fte */
402 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
405 list_for_each_entry(pos, (&(prio)->node.children), list)
408 fs_list_for_each_entry(pos, &(ns)->node.children)
[all...] |
| /linux/tools/perf/scripts/python/ |
| H A D | mem-phys-addr.py | 29 children: Dict[IomemEntry, set[IomemEntry]] = collections.defaultdict(set) variable
41 global children
58 children[parent].add(entry)
81 # Add count from children into the parent.
86 global children
87 for child in children[entry]:
92 """Print counts from parents down to their children"""
93 global children
102 print_entries(children[entry])
|
| /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()
[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, NUL in wl1273_core_probe()
[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()
[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[ in nfp_abm_qdisc_clear_mq()
341 nfp_abm_qdisc_alloc(struct net_device * netdev,struct nfp_abm_link * alink,enum nfp_qdisc_type type,u32 parent_handle,u32 handle,unsigned int children) nfp_abm_qdisc_alloc() argument
389 nfp_abm_qdisc_replace(struct net_device * netdev,struct nfp_abm_link * alink,enum nfp_qdisc_type type,u32 parent_handle,u32 handle,unsigned int children,struct nfp_qdisc ** qdisc) nfp_abm_qdisc_replace() argument
[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, struc 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/bcachefs/ |
| H A D | snapshot.c | 215 prt_printf(out, "parent %10u children %10u %10u subvol %u tree %u", in bch2_snapshot_to_text()
217 le32_to_cpu(s.v->children[0]), in bch2_snapshot_to_text()
218 le32_to_cpu(s.v->children[1]), in bch2_snapshot_to_text()
250 bkey_fsck_err_on(le32_to_cpu(s.v->children[0]) < le32_to_cpu(s.v->children[1]), in bch2_snapshot_validate()
252 "children not normalized"); in bch2_snapshot_validate()
254 bkey_fsck_err_on(s.v->children[0] && s.v->children[0] == s.v->children[1], in bch2_snapshot_validate()
259 id = le32_to_cpu(s.v->children[ in bch2_snapshot_validate()
[all...] |
| /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[ 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, siblin in __set_power_limit_uw()
[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, whic
[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/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/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/drivers/net/ethernet/mellanox/mlx5/core/esw/ |
| H A D | qos.c | 87 /* A computed value indicating relative min_rate between node's children. */
91 /* Entry in the parent node's children list. */
97 /* The children nodes of this node, empty list for leaf nodes. */
98 struct list_head children; member
110 /* Root children are assigned a depth level of 2. */ in esw_qos_node_attach_to_parent()
115 list_add_tail(&node->entry, &node->parent->children); in esw_qos_node_attach_to_parent()
143 if (!list_empty(&node->children) && in esw_qos_nodes_set_parent()
147 list_for_each_entry(child, &node->children, entry) { in esw_qos_nodes_set_parent()
325 struct list_head *nodes = parent ? &parent->children : &esw->qos.domain->nodes; in esw_qos_calculate_min_rate_divider()
380 struct list_head *nodes = parent ? &parent->children in esw_qos_normalize_min_rate()
[all...] |
| /linux/drivers/i2c/muxes/ |
| H A 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/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_KERNE in ice_sched_add_node()
[all...] |
| /linux/Documentation/driver-api/phy/ |
| H A 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/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()
|