Home
last modified time | relevance | path

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

12345

/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 …]
/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
H A D31266 quorum="$quorum,file.children.0.file.filename=$TEST_IMG.0"
67 quorum="$quorum,file.children.1.file.filename=$TEST_IMG.1"
68 quorum="$quorum,file.children.2.file.filename=$TEST_IMG.2"
69 quorum="$quorum,file.children.0.driver=$IMGFMT"
70 quorum="$quorum,file.children.1.driver=$IMGFMT"
71 quorum="$quorum,file.children.2.driver=$IMGFMT"
H A D081.out62 "children": [ "file1", "file2", "file3" ]
135 {"error": {"class": "GenericError", "desc": "The number of children cannot be lower than the vote t…
151 {"error": {"class": "GenericError", "desc": "The number of children cannot be lower than the vote t…
/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()
/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()
H A Dclock.c90 QLIST_FOREACH(child, &clk->children, sibling) { in clock_propagate_period()
121 QLIST_INSERT_HEAD(&src->children, clk, sibling); in clock_set_source()
171 * it's unparented the children. Avoid having a callback to a deleted in clock_unparent()
185 QLIST_INIT(&clk->children); in clock_initfn()
198 /* clear our list of children */ in clock_finalizefn()
199 QLIST_FOREACH_SAFE(child, &clk->children, sibling, next) { in clock_finalizefn()
203 /* remove us from source's children list */ in clock_finalizefn()
H A Dbus.c53 QTAILQ_FOREACH_RCU(kid, &bus->children, sibling) { in qbus_walk_children()
96 QTAILQ_FOREACH_RCU(kid, &bus->children, sibling) { in bus_reset_child_foreach()
146 while ((kid = QTAILQ_FIRST(&bus->children)) != NULL) { in bus_unparent()
203 QTAILQ_FOREACH_RCU(kid, &bus->children, sibling) { in bus_set_realized()
220 QTAILQ_INIT(&bus->children); in qbus_initfn()
H A Dvm-change-state-handler.c48 * of children depend on their parent's callback having completed first.
51 * controller's callback is invoked before the children on its bus when the VM
/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)
/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 …]
/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
/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()
/qemu/docs/
H A Dblock-replication.txt85 children, providing replication between a primary disk and the host that
155 children.0.file.filename=1.raw,\
156 children.0.driver=raw
178 6. After primary failover we need remove children.1 (replication driver).
189 vote-threshold=1,children.0=childs1
229 "child": "children.1"
/qemu/docs/sphinx/
H A Dqapi_domain.py76 assert len(field.children) == 2
77 assert isinstance(field.children[0], nodes.field_name)
78 assert isinstance(field.children[1], nodes.field_body)
79 return (field.children[0], field.children[1])
422 if infopips.children:
483 for field in child.children:
496 if par.children[0].astext() != "q_dummy":
501 del par.children[:-1]
640 assert isinstance(desc_node.children[1], addnodes.desc_content)
641 ret.extend(desc_node.children[1].children)
[all …]
/qemu/tests/unit/
H A Dtest-bdrv-graph-mod.c276 * write-to-selected node may have several DATA children, one of them may be
314 * Consider the block driver (write-to-selected) which has two children: one is
318 * And, these two children has a common base child, like this:
351 * With topological-sort order we always update parents before children, so fl1
394 bdrv_child_refresh_perms(top, top->children.lh_first, &error_abort); in test_parallel_perm_update()
401 bdrv_child_refresh_perms(top, top->children.lh_first, &error_abort); in test_parallel_perm_update()
408 bdrv_child_refresh_perms(top, top->children.lh_first, &error_abort); in test_parallel_perm_update()
H A Dtest-xs-node.c51 if (n->children) { in dump_ref()
52 g_hash_table_foreach(n->children, (void *)dump_ref, in dump_ref()
135 if (n1->children) { in compare_nodes()
136 nr_children1 = g_hash_table_size(n1->children); in compare_nodes()
138 if (n2->children) { in compare_nodes()
139 nr_children2 = g_hash_table_size(n2->children); in compare_nodes()
155 g_hash_table_foreach(n1->children, compare_child, cw); in compare_nodes()
166 XsNode *child2 = g_hash_table_lookup(cw->parent_2->children, childname); in compare_child()
/qemu/tests/tcg/multiarch/
H A Dfollow-fork-mode.c5 * Parents sends one byte to their children, and children return their
/qemu/include/block/
H A Dblock-common.h438 * = Connection with bs->children, bs->file and bs->backing fields =
445 * children which must not have these bits (one example is the
448 * Filter nodes never have COW children.
466 * Don't have any FILTERED children.
474 * May also have some other children that don't have the PRIMARY or COW bit set.
479 * Any node may have an arbitrary number of such children.
486 * children.
/qemu/hw/s390x/
H A Devent-facility.c59 QTAILQ_FOREACH(kid, &ef->sbus.qbus.children, sibling) { in event_pending()
78 QTAILQ_FOREACH(kid, &ef->sbus.qbus.children, sibling) { in get_host_send_mask()
94 QTAILQ_FOREACH(kid, &ef->sbus.qbus.children, sibling) { in get_host_receive_mask()
133 QTAILQ_FOREACH(kid, &ef->sbus.qbus.children, sibling) { in handle_write_event_buf()
212 QTAILQ_FOREACH(kid, &ef->sbus.qbus.children, sibling) { in handle_sccb_read_events()
/qemu/hw/cpu/
H A Dcluster.c51 /* Iterate through all our CPU children and set their cluster_index */ in cpu_cluster_realize()
82 /* This is not directly for users, CPU children must be attached by code */ in cpu_cluster_class_init()
/qemu/include/hw/
H A Dclock.h66 * @children: list of clocks connected to this one (it is their source)
90 QLIST_HEAD(, Clock) children;
354 * By default, a Clock's children will all run with the same period
359 * so if the parent clock is an 8MHz clock the children will
/qemu/hw/i386/
H A Dmicrovm-dt.c70 if (QTAILQ_EMPTY(&mmio_bus->children)) { in dt_add_virtio()
231 QTAILQ_FOREACH(kid, &bus->children, sibling) { in dt_setup_isa_bus()
263 QTAILQ_FOREACH(kid, &bus->children, sibling) { in dt_setup_sys_bus()
274 QTAILQ_FOREACH(kid, &bus->children, sibling) { in dt_setup_sys_bus()
/qemu/
H A Dblock.c1377 * Pure and non-filtered data children of non-format nodes should in bdrv_inherited_options()
1391 * All children of format nodes (except for COW children) and all in bdrv_inherited_options()
1392 * metadata children in general should never be format-probed. in bdrv_inherited_options()
1445 QLIST_INSERT_HEAD(&bs->children, child, next); in bdrv_child_cb_attach()
1450 * FILTERED child, and that they may have multiple more children, which in bdrv_child_cb_attach()
2319 QLIST_FOREACH(child, &bs->children, next) { in bdrv_topological_dfs()
2563 /* Drivers that never have children can omit .bdrv_child_perm() */ in bdrv_node_refresh_perm()
2565 assert(QLIST_EMPTY(&bs->children)); in bdrv_node_refresh_perm()
2569 /* Check all children */ in bdrv_node_refresh_perm()
2570 QLIST_FOREACH(c, &bs->children, next) { in bdrv_node_refresh_perm()
[all …]

12345