Home
last modified time | relevance | path

Searched full:children (Results 1 – 25 of 998) sorted by relevance

12345678910>>...40

/openbmc/linux/tools/perf/Documentation/
H A Dcallchain-overhead-calculation.txt3 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 …]
/openbmc/
Dopengrok1.0.log[all...]
Dopengrok2.0.log[all...]
/openbmc/qemu/block/
H A Dquorum.c74 BdrvChild **children; /* children BlockDriverStates */ member
75 int num_children; /* children count */
79 int threshold; /* if less than threshold children reads gave the
83 * Writes are mirrored on two children devices.
84 * On reads the two children devices' contents are
100 * performs on its children.
115 * used to do operations on each children and track overall progress.
140 int children_read; /* how many children have been read from */
268 s->children[item->index]->bs->node_name, 0); in quorum_report_bad_versions()
286 * area with different data from the other children. */ in quorum_rewrite_entry()
[all …]
/openbmc/linux/tools/testing/selftests/cgroup/
H A Dtest_cpu.c236 int (*validate)(const struct cpu_hogger *children, int num_children)) in run_cpucg_weight_test() argument
240 struct cpu_hogger children[3] = {NULL}; 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 …]
/openbmc/rest-dbus/resources/
H A Ddbus.js10 var children = [];
15 children.push({
17 'children': true, property in AnonymousClass9ebe46fd0201
23 cb(children);
32 var children = [];
35 children.push({
37 'children': true, property in AnonymousClass9ebe46fd0401
44 cb(children);
55 var children = [];
58 children.push({
[all …]
H A Djstree.min.js2 …children:[],children_d:[],state:{loaded:!1}},this.element=a(b).addClass("jstree jstree-"+this._id)… property in AnonymousClassf811328e6301
3 …children(".jstree-children")[0]),r=b.children(".jstree-anchor")[0]===i.activeElement,b.remove();el… property in _model._model
4 …children(".jstree-anchor").children(".jstree-themeicon"),d===!1?this.hide_icon(c):d===!0||null===d…
5 …children(".jstree-anchor").hasClass("jstree-clicked")))return!0;var c=this.get_node(b.target),d=th…
/openbmc/qemu/tests/qtest/
H A Dqom-test.c25 GSList *children = NULL, *links = NULL; in test_properties() local
50 children = g_slist_prepend(children, child_path); in test_properties()
74 while (children) { in test_properties()
75 test_properties(qts, children->data, true); in test_properties()
76 g_free(children->data); in test_properties()
77 children = g_slist_delete_link(children, children); in test_properties()
/openbmc/qemu/tests/qemu-iotests/
H A D08163 quorum="$quorum,file.children.0.file.filename=$TEST_DIR/1.raw"
64 quorum="$quorum,file.children.1.file.filename=$TEST_DIR/2.raw"
65 quorum="$quorum,file.children.2.file.filename=$TEST_DIR/3.raw"
66 quorum="$quorum,file.children.0.driver=raw"
67 quorum="$quorum,file.children.1.driver=raw"
68 quorum="$quorum,file.children.2.driver=raw"
121 "children": [
195 "children": [ "file1", "file2", "file3" ]
228 quorum="$quorum,file.children.0.file.filename=$TEST_DIR/1.raw"
229 quorum="$quorum,file.children.1.file.filename=$TEST_DIR/2.raw"
[all …]
H A D14858 driveopts.append('children.%d.driver=%s' % (i, iotests.imgfmt))
59 driveopts.append('children.%d.file.driver=blkdebug' % i)
60 driveopts.append('children.%d.file.config=%s' % (i, img_conf[i]))
61 driveopts.append('children.%d.file.image.filename=%s' % (i, imgs[i]))
62 driveopts.append('children.%d.node-name=img%d' % (i, i))
110 # I/O errors in different children: all events are emitted
122 # I/O errors in different children: all events are emitted
/openbmc/qemu/hw/core/
H A Dresetcontainer.c24 GPtrArray *children; member
32 g_ptr_array_add(rc->children, obj); in resettable_container_add()
37 g_ptr_array_remove(rc->children, obj); in resettable_container_remove()
51 unsigned int len = rc->children->len; in resettable_container_child_foreach()
54 cb(g_ptr_array_index(rc->children, i), opaque, type); in resettable_container_child_foreach()
56 assert(len == rc->children->len); in resettable_container_child_foreach()
64 rc->children = g_ptr_array_new(); in resettable_container_init()
/openbmc/openbmc/poky/bitbake/lib/toaster/toastergui/static/js/
H A Djquery.treetable.js30 this.treeCell = $(this.row.children(this.settings.columnElType)[this.settings.column]);
33 this.children = [];
39 return this.children.push(child);
106 if(this.children.length > 0 || this.row.data(this.settings.branchAttr) === true) {
132 var i = $.inArray(child, this.children);
133 return this.children.splice(i, 1)
201 _ref = this.children;
230 _ref = this.children;
276 if (node.children.length > 0) {
277 return this.findLastNode(node.children[node.children.length - 1]);
[all …]
H A Dlayerdetails.js84 newLayerDep.children("span").tooltip();
86 var link = newLayerDep.children("a");
92 var trashItem = newLayerDep.children("span");
106 mParent.children("form").slideDown();
107 var currentVal = mParent.children(".current-value");
116 mParent.children(".text-muted").hide();
118 mParent.children(".delete-current-value").hide();
133 mParent.children("form").slideUp(function(){
134 mParent.children(".current-value").show();
136 if (!mParent.children(".current-value").html()){
[all …]
/openbmc/qemu/scripts/simplebench/
H A Dtable_templater.py38 for x in self.tree.children:
40 c_switches.append([el.children[0].value for el in x.children])
42 r_switches.append([el.children[0].value for el in x.children])
52 for x in self.tree.children:
54 result.append(x.children[0].value)
/openbmc/linux/drivers/net/ethernet/mellanox/mlx5/core/
H A Dfs_core.h158 struct list_head children; member
187 /* Type of children is mlx5_flow_group */
231 /* 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 */
334 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
337 list_for_each_entry(pos, (&(prio)->node.children), list)
340 fs_list_for_each_entry(pos, &(ns)->node.children)
343 fs_list_for_each_entry(pos, &(prio)->node.children)
[all …]
/openbmc/linux/tools/testing/selftests/arm64/fp/
H A Dfp-stress.c41 static struct child_data *children; variable
275 if (children[i].pid == info->si_pid) { in handle_child_signal()
276 children[i].exited = true; in handle_child_signal()
277 children[i].exit_status = info->si_status; in handle_child_signal()
305 child_stop(&children[i]); in handle_exit_signal()
503 children = calloc(sizeof(*children), tests); in main()
504 if (!children) in main()
513 /* Create a pipe which children will block on before execing */ in main()
519 /* Get signal handers ready before we start any children */ in main()
545 start_fpsimd(&children[num_children++], i, j); in main()
[all …]
/openbmc/linux/drivers/mfd/
H A Dwl1273-core.c164 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()
/openbmc/linux/drivers/net/ethernet/netronome/nfp/abm/
H A Dqdisc.c23 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 …]
/openbmc/openbmc/poky/meta/recipes-devtools/apt/apt/
H A Dtriehash212 # children - A hash of keys to other nodes
226 $self->{children} = {};
266 $self->{children}{$child} = Trie->new if (!defined($self->{children}{$child}));
268 $self->{children}{$child}->insert($tail, $label, $value);
282 foreach my $key (sort keys %{$self->{children}}) {
283 if ($togo > length($key) || defined $self->{children}{$key}->{value}) {
284 my $child = $self->{children}{$key}->filter_depth($togo - length($key));
286 $new->{children}{$key}= $child if defined $child;
307 foreach my $key (sort keys %{$self->{children}}) {
308 $self->{children}{$key}->reinsert_value_nodes_into($trie, $prefix . $key);
[all …]
/openbmc/qemu/hw/i386/kvm/
H A Dxenstore_impl.c36 GHashTable *children; member
144 if (n->children) { in xs_node_unref()
145 g_hash_table_unref(n->children); in xs_node_unref()
217 if (old->children) { in xs_node_copy()
218 n->children = g_hash_table_new_full(g_str_hash, g_str_equal, g_free, in xs_node_copy()
220 g_hash_table_foreach(old->children, do_child_insert, n->children); in xs_node_copy()
237 assert(n->children); in xs_node_add_child()
238 return g_hash_table_remove(n->children, path_elem); in xs_node_add_child()
245 if (!n->children) { in xs_node_add_child()
246 n->children = g_hash_table_new_full(g_str_hash, g_str_equal, g_free, in xs_node_add_child()
[all …]
/openbmc/linux/lib/
H A Dgeneric-radix-tree.c13 struct genradix_node *children[GENRADIX_ARY]; member
71 n = n->children[offset >> genradix_depth_shift(level)]; in __genradix_ptr()
127 new_node->children[0] = n; in __genradix_ptr_alloc()
135 new_node->children[0] = NULL; in __genradix_ptr_alloc()
141 &n->children[offset >> genradix_depth_shift(level)]; in __genradix_ptr_alloc()
192 while (!n->children[i]) { in __genradix_iter_peek()
210 n = n->children[i]; in __genradix_iter_peek()
223 if (n->children[i]) in genradix_free_recurse()
224 genradix_free_recurse(n->children[i], level - 1); in genradix_free_recurse()
/openbmc/pyphosphor/obmc/utils/
H A Dpathtree.py28 d = d[k]['children']
63 self.it = x[1]['children'].iteritems()
65 self.it = iter(x[1]['children'].items())
103 kids = 'children'
114 kids = 'children'
136 kids = 'children'
150 kids = 'children'
156 children = d.setdefault(elements[-1], {kids: {}})[kids]
157 d[elements[-1]].update({kids: children, 'data': value})
180 return [x for x in self._get_node(key)['children'].keys()]
/openbmc/qemu/include/hw/cpu/
H A Dcluster.h41 * The CPUs may be either direct children of the cluster object, or indirect
42 * children (e.g. children of children of the cluster object).
44 * All CPUs must be added as children before the cluster is realized.
45 * (Regrettably QOM provides no way to prevent adding children to a realized
/openbmc/openbmc/meta-openembedded/meta-python/recipes-devtools/python/python3-yappi/
H A D0001-test_functionality-convert-line-endings-to-Unix.patch265 - cs = fs[1].children
471 - self.assertTrue(fsa.children[0:1] is not None)
473 - prev_bchildfullname = fsa.children[fsb].full_name
477 - len(prev_bchildfullname) > len(fsa.children[fsb].full_name)
500 - childs_of_a = fsa.children.get().sort("tavg", "desc")
875 - self.assertEqual(fsa.children[fsb].ttot, fsb.ttot)
876 - self.assertEqual(fsa.children[fsb].tsub, fsb.tsub)
877 - self.assertEqual(fsb.children[fsc].ttot, fsc.ttot)
878 - self.assertEqual(fsb.children[fsc].tsub, fsc.tsub)
880 - self.assertEqual(fsc.children[fsd].ttot, fsd.ttot)
[all …]
/openbmc/linux/drivers/powercap/
H A Ddtpm.c13 * 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 …]

12345678910>>...40