Home
last modified time | relevance | path

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

12345678910>>...19

/openbmc/openbmc/poky/meta/recipes-devtools/apt/apt/
H A Dtriehash226 $self->{children} = {};
266 $self->{children}{$child} = Trie->new if (!defined($self->{children}{$child}));
307 foreach my $key (sort keys %{$self->{children}}) {
345 foreach my $key (sort keys %{$self->{children}}) {
354 $newself->{children} = {};
356 foreach my $key (sort keys %{$self->{children}}) {
360 $newself->{children}{$head} //= Trie->new;
361 $self->{children}{$key}->reinsert_value_nodes_into($newself->{children}{$head}, $tail);
364 $newself->{children}{$head} = $newself->{children}{$head}->rebuild_tree();
448 if (%{$trie->{children}}) {
[all …]
/openbmc/linux/tools/testing/selftests/cgroup/
H A Dtest_cpu.c240 struct cpu_hogger children[3] = {NULL}; in run_cpucg_weight_test() local
254 if (!children[i].cgroup) in run_cpucg_weight_test()
257 if (cg_create(children[i].cgroup)) in run_cpucg_weight_test()
269 children[i].pid = pid; in run_cpucg_weight_test()
283 children[i].usage = cg_read_key_long(children[i].cgroup, in run_cpucg_weight_test()
286 if (validate(children, ARRAY_SIZE(children))) in run_cpucg_weight_test()
292 cg_destroy(children[i].cgroup); in run_cpucg_weight_test()
293 free(children[i].cgroup); in run_cpucg_weight_test()
328 if (children[i + 1].usage <= children[i].usage) in overprovision_validate()
331 delta = children[i + 1].usage - children[i].usage; in overprovision_validate()
[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()
345 if (!children[i]) in test_memcg_protection()
348 if (cg_create(children[i])) in test_memcg_protection()
360 if (cg_write(children[0], attribute, "75M")) in test_memcg_protection()
364 if (cg_write(children[2], attribute, "0")) in test_memcg_protection()
383 for (i = 0; i < ARRAY_SIZE(children); i++) in test_memcg_protection()
408 if (!reclaim_until(children[0], MB(10))) in test_memcg_protection()
436 if (!children[i]) in test_memcg_protection()
439 cg_destroy(children[i]); 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/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'
105 is sorted by its values. The 'children' overhead is disabled by
106 specifying --no-children option on the command line or by adding
[all …]
/openbmc/openbmc/poky/bitbake/lib/toaster/toastergui/static/js/
H A Djquery.treetable.js33 this.children = [];
39 return this.children.push(child);
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]);
368 node.children.sort(sortFun);
377 var children, i;
384 node.children = [];
[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();
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();
137 mParent.children(".text-muted").fadeIn();
143 mParent.children(".glyphicon-edit").show();
[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 _model._model
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
276 if (children[i].pid == info->si_pid) { in handle_child_signal()
277 children[i].exited = true; in handle_child_signal()
306 child_stop(&children[i]); in handle_exit_signal()
504 children = calloc(sizeof(*children), tests); in main()
505 if (!children) in main()
607 if (children[i].output_seen || in main()
608 children[i].exited) in main()
624 child_tickle(&children[i]); in main()
637 child_stop(&children[i]); in main()
[all …]
/openbmc/webui-vue/docs/.vuepress/
H A Dconfig.js30 children: [
37 children: [
47 children: [
62 children: [
/openbmc/webui-vue/src/env/components/AppNavigation/
H A Dintel.js41 children: [ property in AppNavigationMixin.data.AnonymousClass87c7ff850201
58 children: [ property in AppNavigationMixin.data.AnonymousClass87c7ff850501
75 children: [ property in AppNavigationMixin.data.AnonymousClass87c7ff850801
114 children: [ property in AppNavigationMixin.data.AnonymousClass87c7ff850f01
131 children: [ property in AppNavigationMixin.data.AnonymousClass87c7ff851201
158 children: [ property in AppNavigationMixin.data.AnonymousClass87c7ff851701
H A Dibm.js34 children: [
56 children: [
73 children: this.operationsNavigationItems(),
79 children: [
101 children: [
133 children: [
/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/webui-vue/src/components/AppNavigation/
H A DAppNavigationMixin.js40 children: [ property in AppNavigationMixin.data.AnonymousClassbd1bea070201
57 children: [ property in AppNavigationMixin.data.AnonymousClassbd1bea070501
74 children: [ property in AppNavigationMixin.data.AnonymousClassbd1bea070801
123 children: [ property in AppNavigationMixin.data.AnonymousClassbd1bea071101
150 children: [ property in AppNavigationMixin.data.AnonymousClassbd1bea071601
182 children: [ property in AppNavigationMixin.data.AnonymousClassbd1bea071c01
/openbmc/qemu/block/
H A Dquorum.c590 sacb->bs = s->children[i]->bs; in read_quorum_children_entry()
659 acb->qcrs[n].bs = s->children[n]->bs; in read_fifo_child()
705 sacb->bs = s->children[i]->bs; in write_quorum_entry()
1023 if (!s->children[i]) { in quorum_open()
1048 g_free(s->children); in quorum_open()
1066 g_free(s->children); in quorum_close()
1105 s->children = g_renew(BdrvChild *, s->children, s->num_children + 1); in quorum_add_child()
1106 s->children[s->num_children++] = child; in quorum_add_child()
1118 if (s->children[i] == child) { in quorum_del_child()
1142 memmove(&s->children[i], &s->children[i + 1], in quorum_del_child()
[all …]
/openbmc/
H A Dopengrok1.0.log17828 2024-06-28 03:01:39.941-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
17842 2024-06-28 03:01:39.942-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
17846 2024-06-28 03:01:39.942-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
20360 2024-06-28 03:01:40.035-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
20666 2024-06-28 03:01:40.044-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
31463 2024-06-28 03:01:40.553-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
31973 2024-06-28 03:01:40.570-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
32021 2024-06-28 03:01:40.572-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
33552 2024-06-28 03:01:40.616-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
37153 2024-06-28 03:01:40.750-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
[all …]
H A Dopengrok2.0.log15485 2024-06-27 03:01:35.378-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
15499 2024-06-27 03:01:35.378-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
15503 2024-06-27 03:01:35.378-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
18017 2024-06-27 03:01:35.476-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
18323 2024-06-27 03:01:35.493-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
29120 2024-06-27 03:01:36.094-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
29630 2024-06-27 03:01:36.112-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
29678 2024-06-27 03:01:36.113-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
31209 2024-06-27 03:01:36.159-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
34810 2024-06-27 03:01:36.297-0500 FINEST t436 PendingFileCompleter.findFilelessChildren: its children pr…
[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/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()
139 &n->children[offset >> genradix_depth_shift(level)]; in __genradix_ptr_alloc()
190 while (!n->children[i]) { in __genradix_iter_peek()
208 n = n->children[i]; in __genradix_iter_peek()
221 if (n->children[i]) in genradix_free_recurse()
222 genradix_free_recurse(n->children[i], level - 1); in genradix_free_recurse()
/openbmc/qemu/hw/i386/kvm/
H A Dxenstore_impl.c36 GHashTable *children; member
144 if (n->children) { in xs_node_unref()
217 if (old->children) { in xs_node_copy()
220 g_hash_table_foreach(old->children, do_child_insert, n->children); in xs_node_copy()
245 if (!n->children) { in xs_node_add_child()
385 if (n->children) { in node_rm_recurse()
435 if (old->children) { in xs_node_copy_deleted()
998 if (n->children) { in tx_commit_walk()
1395 if (n->children) { in clear_serialized_tx()
1630 if (!n->children) { in lookup_node()
[all …]
/openbmc/linux/drivers/net/ethernet/netronome/nfp/abm/
H A Dqdisc.c23 return qdisc->children[id] && in nfp_abm_qdisc_child_valid()
114 qdisc->children[i] = NULL; in nfp_abm_qdisc_unlink_children()
201 !qdisc->children[0]; in nfp_abm_offload_compile_red()
311 mq->children[i] = NULL; in nfp_abm_qdisc_clear_mq()
332 kfree(qdisc->children); in nfp_abm_qdisc_free()
341 unsigned int children) in nfp_abm_qdisc_alloc() argument
351 if (children) { in nfp_abm_qdisc_alloc()
352 qdisc->children = kcalloc(children, sizeof(void *), GFP_KERNEL); in nfp_abm_qdisc_alloc()
353 if (!qdisc->children) in nfp_abm_qdisc_alloc()
374 kfree(qdisc->children); in nfp_abm_qdisc_alloc()
[all …]
/openbmc/phosphor-mrw-tools/
H A DUtil.pm35 my @children = $targetObj->getAllTargetChildren($chip);
37 for my $child (@children) {
54 my @children = $targetObj->getAllTargetChildren($chip);
55 for my $child (@children) {
/openbmc/qemu/qom/
H A Dqom-hmp-cmds.c112 GArray *children = g_array_new(false, false, sizeof(Object *)); in print_qom_composition() local
124 object_child_foreach(obj, insert_qom_composition_child, children); in print_qom_composition()
125 g_array_sort(children, qom_composition_compare); in print_qom_composition()
127 for (i = 0; i < children->len; i++) { in print_qom_composition()
128 print_qom_composition(mon, g_array_index(children, Object *, i), in print_qom_composition()
131 g_array_free(children, TRUE); in print_qom_composition()

12345678910>>...19