Home
last modified time | relevance | path

Searched refs:children (Results 1 – 25 of 435) sorted by relevance

12345678910>>...18

/openbmc/openbmc/poky/meta/recipes-devtools/apt/apt/
H A Dtriehash226 $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);
345 foreach my $key (sort keys %{$self->{children}}) {
[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 …]
H A Dtest_memcontrol.c292 char *children[4] = {NULL}; in test_memcg_protection() local
343 for (i = 0; i < ARRAY_SIZE(children); i++) { in test_memcg_protection()
344 children[i] = cg_name_indexed(parent[1], "child_memcg", i); in test_memcg_protection()
345 if (!children[i]) in test_memcg_protection()
348 if (cg_create(children[i])) in test_memcg_protection()
354 cg_run_nowait(children[i], alloc_pagecache_50M_noexit, in test_memcg_protection()
360 if (cg_write(children[0], attribute, "75M")) in test_memcg_protection()
362 if (cg_write(children[1], attribute, "25M")) in test_memcg_protection()
364 if (cg_write(children[2], attribute, "0")) in test_memcg_protection()
366 if (cg_write(children[3], attribute, "500M")) in test_memcg_protection()
[all …]
/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/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/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/
Dopengrok1.0.log[all...]
Dopengrok2.0.log[all...]
/openbmc/linux/tools/perf/Documentation/
H A Dcallchain-overhead-calculation.txt9 The 'children' overhead is calculated by adding all period values of
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
96 'children' overhead of 'bar', 'main' and '\_\_libc_start_main'.
98 'children' overhead of 'main' and '\_\_libc_start_main'.
101 same (100%) 'children' overhead (even though they have zero 'self'
104 Since v3.16 the 'children' overhead is shown by default and the output
105 is sorted by its values. The 'children' overhead is disabled by
[all …]
/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/rest-dbus/resources/
H A Ddbus.js10 var children = [];
15 children.push({
23 cb(children);
32 var children = [];
35 children.push({
44 cb(children);
55 var children = [];
58 children.push({
68 cb(children);
214 var children = [];
[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/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()
545 start_fpsimd(&children[num_children++], i, j); in main()
548 start_sve(&children[num_children++], sve_vls[j], i); in main()
551 start_ssve(&children[num_children++], sme_vls[j], i); in main()
[all …]
/openbmc/qemu/block/
H A Dquorum.c74 BdrvChild **children; /* children BlockDriverStates */ member
268 s->children[item->index]->bs->node_name, 0); in quorum_report_bad_versions()
287 bdrv_co_pwritev(s->children[co->idx], acb->offset, acb->bytes, in quorum_rewrite_entry()
590 sacb->bs = s->children[i]->bs; in read_quorum_children_entry()
591 sacb->ret = bdrv_co_preadv(s->children[i], acb->offset, acb->bytes, in read_quorum_children_entry()
617 acb->qcrs[i].buf = qemu_blockalign(s->children[i]->bs, acb->qiov->size); in read_quorum_children()
659 acb->qcrs[n].bs = s->children[n]->bs; in read_fifo_child()
660 ret = bdrv_co_preadv(s->children[n], acb->offset, acb->bytes, in read_fifo_child()
705 sacb->bs = s->children[i]->bs; in write_quorum_entry()
707 sacb->ret = bdrv_co_pwrite_zeroes(s->children[i], acb->offset, in write_quorum_entry()
[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()
214 __func__, children); in wl1273_core_probe()
217 children, NULL, 0, NULL); in wl1273_core_probe()
/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/webui-vue/docs/.vuepress/
H A Dconfig.js30 children: [ property in module.exports.themeConfig.sidebar.AnonymousClass8cdfb32d0401
37 children: [ property in module.exports.themeConfig.sidebar.AnonymousClass8cdfb32d0501
47 children: [ property in module.exports.themeConfig.sidebar.AnonymousClass8cdfb32d0601
62 children: [ property in module.exports.themeConfig.sidebar.AnonymousClass8cdfb32d0701
/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/drivers/net/ethernet/mellanox/mlx5/core/
H A Dfs_core.h158 struct list_head children; member
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)
346 fs_list_for_each_entry(pos, &(prio)->node.children)
349 fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)
352 fs_list_for_each_entry(pos, &(ft)->node.children)
355 fs_list_for_each_entry(pos, &(fg)->node.children)
358 fs_list_for_each_entry(pos, &(fte)->node.children)
/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()
310 if (mq->children[i] == qdisc) { in nfp_abm_qdisc_clear_mq()
311 mq->children[i] = NULL; in nfp_abm_qdisc_clear_mq()
332 kfree(qdisc->children); in nfp_abm_qdisc_free()
[all …]
/openbmc/webui-vue/src/env/components/AppNavigation/
H A Dintel.js42 children: [ property in AppNavigationMixin.data.AnonymousClass87c7ff850201
59 children: [ property in AppNavigationMixin.data.AnonymousClass87c7ff850501
76 children: [ property in AppNavigationMixin.data.AnonymousClass87c7ff850801
115 children: [ property in AppNavigationMixin.data.AnonymousClass87c7ff850f01
132 children: [ property in AppNavigationMixin.data.AnonymousClass87c7ff851201
159 children: [ property in AppNavigationMixin.data.AnonymousClass87c7ff851701
H A Dibm.js35 children: [ property in AppNavigationMixin.data.AnonymousClassa1ee90c10201
57 children: [ property in AppNavigationMixin.data.AnonymousClassa1ee90c10601
74 children: this.operationsNavigationItems(), property in AppNavigationMixin.data.AnonymousClassa1ee90c10901
80 children: [ property in AppNavigationMixin.data.AnonymousClassa1ee90c10a01
102 children: [ property in AppNavigationMixin.data.AnonymousClassa1ee90c10e01
134 children: [ property in AppNavigationMixin.data.AnonymousClassa1ee90c11401
/openbmc/webui-vue/src/components/AppNavigation/
H A DAppNavigationMixin.js41 children: [ property in AppNavigationMixin.data.AnonymousClassbd1bea070201
63 children: [ property in AppNavigationMixin.data.AnonymousClassbd1bea070601
80 children: [ property in AppNavigationMixin.data.AnonymousClassbd1bea070901
129 children: [ property in AppNavigationMixin.data.AnonymousClassbd1bea071201
156 children: [ property in AppNavigationMixin.data.AnonymousClassbd1bea071701
188 children: [ property in AppNavigationMixin.data.AnonymousClassbd1bea071d01
/openbmc/linux/fs/nfs/blocklayout/
H A Ddev.c23 bl_free_device(&dev->children[i]); in bl_free_device()
24 kfree(dev->children); in bl_free_device()
182 struct pnfs_block_dev *child = &dev->children[i]; in bl_map_concat()
220 child = &dev->children[chunk_idx]; in bl_map_stripe()
406 d->children = kcalloc(v->concat.volumes_count, in bl_parse_concat()
408 if (!d->children) in bl_parse_concat()
412 ret = bl_parse_deviceid(server, &d->children[i], in bl_parse_concat()
418 d->children[i].start += len; in bl_parse_concat()
419 len += d->children[i].len; in bl_parse_concat()
435 d->children = kcalloc(v->stripe.volumes_count, in bl_parse_stripe()
[all …]

12345678910>>...18