Home
last modified time | relevance | path

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

123

/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/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/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 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 Dclock.c92 QLIST_FOREACH(child, &clk->children, sibling) { in clock_propagate_period()
123 QLIST_INSERT_HEAD(&src->children, clk, sibling); in clock_set_source()
168 QLIST_INIT(&clk->children); in clock_initfn()
177 QLIST_FOREACH_SAFE(child, &clk->children, sibling, next) { in clock_finalizefn()
H A Dqdev.c62 QTAILQ_FOREACH(kid, &bus->children, sibling) { in bus_remove_child()
67 QTAILQ_REMOVE_RCU(&bus->children, kid, sibling); in bus_remove_child()
91 QTAILQ_INSERT_HEAD_RCU(&bus->children, kid, sibling); in bus_add_child()
395 QTAILQ_FOREACH_RCU(kid, &bus->children, sibling) { in qdev_find_recursive()
/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 …]
/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 …]
/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/hw/s390x/
H A Devent-facility.c66 QTAILQ_FOREACH(kid, &ef->sbus.qbus.children, sibling) { in event_pending()
85 QTAILQ_FOREACH(kid, &ef->sbus.qbus.children, sibling) { in get_host_send_mask()
101 QTAILQ_FOREACH(kid, &ef->sbus.qbus.children, sibling) { in get_host_receive_mask()
140 QTAILQ_FOREACH(kid, &ef->sbus.qbus.children, sibling) { in handle_write_event_buf()
219 QTAILQ_FOREACH(kid, &ef->sbus.qbus.children, sibling) { in handle_sccb_read_events()
/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()
H A Dacpi-microvm.c58 QTAILQ_FOREACH(kid, &bus->children, sibling) { in acpi_dsdt_add_virtio()
67 if (QTAILQ_EMPTY(&mmio_bus->children)) { in acpi_dsdt_add_virtio()
/qemu/tests/unit/
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()
H A Dtest-bdrv-graph-mod.c386 bdrv_child_refresh_perms(top, top->children.lh_first, &error_abort); in test_parallel_perm_update()
393 bdrv_child_refresh_perms(top, top->children.lh_first, &error_abort); in test_parallel_perm_update()
400 bdrv_child_refresh_perms(top, top->children.lh_first, &error_abort); in test_parallel_perm_update()
/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/hw/ppc/
H A Dspapr_vio.c73 QTAILQ_FOREACH(kid, &bus->bus.children, sibling) { in spapr_vio_find_by_reg()
375 QTAILQ_FOREACH(kid, &bus->bus.children, sibling) { in rtas_quiesce()
394 QTAILQ_FOREACH(kid, &bus->bus.children, sibling) { in reg_conflict()
696 QTAILQ_FOREACH(kid, &bus->bus.children, sibling) { in spapr_dt_vdevice()
703 QTAILQ_FOREACH(kid, &bus->bus.children, sibling) { in spapr_dt_vdevice()
/qemu/hw/ssi/
H A Dssi.c35 QTAILQ_FOREACH(kid, &b->children, sibling) { in OBJECT_DECLARE_SIMPLE_TYPE()
163 QTAILQ_FOREACH(kid, &b->children, sibling) { in ssi_transfer()
/qemu/system/
H A Dqdev-monitor.c383 QTAILQ_FOREACH(kid, &bus->children, sibling) { in qbus_error_append_dev_list_hint()
417 QTAILQ_FOREACH(kid, &bus->children, sibling) { in qbus_find_dev()
423 QTAILQ_FOREACH(kid, &bus->children, sibling) { in qbus_find_dev()
429 QTAILQ_FOREACH(kid, &bus->children, sibling) { in qbus_find_dev()
480 QTAILQ_FOREACH(kid, &bus->children, sibling) { in qbus_find_recursive()
821 QTAILQ_FOREACH(kid, &bus->children, sibling) { in qbus_print()
/qemu/hw/acpi/
H A Dpcihp.c199 QTAILQ_FOREACH_SAFE(kid, &bus->qbus.children, sibling, next) { in acpi_pcihp_eject_slot()
245 QTAILQ_FOREACH_SAFE(kid, &bus->qbus.children, sibling, next) { in acpi_pcihp_update_hotplug_bus()
462 QTAILQ_FOREACH_SAFE(kid, &bus->qbus.children, sibling, next) { in pci_write()
H A Dacpi_interface.c20 QTAILQ_FOREACH(kid, &bus->children, sibling) { in qbus_build_aml()
/qemu/tests/qemu-iotests/
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/include/hw/intc/
H A Driscv_aplic.h60 struct RISCVAPLICState *children[QEMU_APLIC_MAX_CHILDREN]; member
/qemu/hw/smbios/
H A Dsmbios_type_38.c84 QTAILQ_FOREACH(kid, &bus->children, sibling) { in smbios_add_ipmi_devices()
/qemu/hw/usb/
H A Ddev-mtp.c179 QLIST_HEAD(, MTPObject) children;
446 while (!QLIST_EMPTY(&o->children)) { in usb_mtp_object_free()
447 iter = QLIST_FIRST(&o->children); in usb_mtp_object_free()
475 QLIST_INSERT_HEAD(&o->children, child, list); in usb_mtp_add_child()
479 QLIST_INIT(&child->children); in usb_mtp_add_child()
495 QLIST_FOREACH(iter, &parent->children, list) { in usb_mtp_object_lookup_name()
912 QLIST_FOREACH(iter, &o->children, list) { in usb_mtp_get_object_handles()
1163 QLIST_FOREACH(iter, &o->children, list) { in usb_mtp_deletefn()
1165 QLIST_FOREACH(iter2, &iter->children, list) { in usb_mtp_deletefn()
/qemu/hw/ipack/
H A Dipack.c23 QTAILQ_FOREACH(kid, &BUS(bus)->children, sibling) { in ipack_device_find()

123