Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 25 of 80) sorted by relevance

1234

/qemu/tests/unit/
H A Dtest-interval-tree.c12 static IntervalTreeNode nodes[20]; variable
41 nodes[0].start = 1; in test_find_one_point()
42 nodes[0].last = 1; in test_find_one_point()
44 interval_tree_insert(&nodes[0], &root); in test_find_one_point()
46 g_assert(interval_tree_iter_first(&root, 0, 9) == &nodes[0]); in test_find_one_point()
47 g_assert(interval_tree_iter_next(&nodes[0], 0, 9) == NULL); in test_find_one_point()
49 g_assert(interval_tree_iter_next(&nodes[0], 0, 0) == NULL); in test_find_one_point()
50 g_assert(interval_tree_iter_first(&root, 0, 1) == &nodes[0]); in test_find_one_point()
51 g_assert(interval_tree_iter_first(&root, 1, 1) == &nodes[0]); in test_find_one_point()
52 g_assert(interval_tree_iter_first(&root, 1, 2) == &nodes[0]); in test_find_one_point()
[all …]
H A Dtest-aio-multithread.c295 } nodes[NUM_CONTEXTS] __attribute__((__aligned__(64))); variable
303 nodes[id].next = -1; in mcs_mutex_lock()
304 nodes[id].locked = 1; in mcs_mutex_lock()
307 qatomic_set(&nodes[prev].next, id); in mcs_mutex_lock()
308 qemu_futex_wait(&nodes[id].locked, 1); in mcs_mutex_lock()
315 if (qatomic_read(&nodes[id].next) == -1) { in mcs_mutex_unlock()
321 while (qatomic_read(&nodes[id].next) == -1) { in mcs_mutex_unlock()
329 next = qatomic_read(&nodes[id].next); in mcs_mutex_unlock()
330 nodes[next].locked = 0; in mcs_mutex_unlock()
331 qemu_futex_wake(&nodes[next].locked, 1); in mcs_mutex_unlock()
/qemu/docs/sphinx/
H A Dqapidoc_legacy.py31 from docutils import nodes
69 self._top_node = nodes.section()
81 dlitem = nodes.definition_list_item()
82 dlterm = nodes.term('', '', *term)
85 dldef = nodes.definition()
87 dldef += nodes.paragraph('', '', *defn)
95 section = nodes.section(ids=[self._sphinx_directive.new_serialno()])
97 section += nodes.title(title, title)
110 doc = nodes.literal('', doc)
114 nodelist = [nodes.Text(' ('), nodes.strong('', 'If: ')]
[all …]
H A Dqapi_domain.py21 from docutils import nodes
45 from sphinx.util.nodes import make_id, make_refnode
58 from docutils.nodes import Element, Node
71 field: nodes.Node,
72 ) -> Tuple[nodes.field_name, nodes.field_body]:
76 assert isinstance(field, nodes.field)
78 assert isinstance(field.children[0], nodes.field_name)
79 assert isinstance(field.children[1], nodes.field_body)
140 document: nodes.document,
144 ) -> Tuple[List[nodes.Node], List[nodes.system_message]]:
[all …]
H A Ddbusdomain.py21 from docutils import nodes
22 from docutils.nodes import Element, Node
30 from sphinx.util import nodes as node_utils
93 section = nodes.section(ids=[name + "-section"])
94 section += nodes.title(name, "%s interface" % name)
145 if isinstance(child, nodes.field_list):
212 fieldlist = nodes.field_list()
221 content = nodes.Text(access)
222 fieldname = nodes.field_name("", _("Access"))
223 fieldbody = nodes.field_body("", nodes.paragraph("", "", content))
[all …]
H A Dqapidoc.py39 from docutils import nodes
66 from sphinx.util.nodes import nested_parse_with_titles
481 def run(self) -> Sequence[nodes.Node]:
484 def do_parse(self, rstlist: StringList, node: nodes.Node) -> None:
515 def transmogrify(self, schema: QAPISchema) -> nodes.Element:
540 contentnode = nodes.section()
547 node: nodes.Element = nodes.section()
551 node = nodes.paragraph()
592 def legacy(self, schema: QAPISchema) -> nodes.Element:
602 def run(self) -> Sequence[nodes.Node]:
[all …]
H A Dkerneldoc.py37 from docutils import nodes, statemachine
122 return [nodes.error(None, nodes.paragraph(text = "kernel-doc missing"))]
141 node = nodes.section()
149 return [nodes.error(None, nodes.paragraph(text = "kernel-doc missing"))]
H A Dhxtool.py23 from docutils import nodes
28 from sphinx.util.nodes import nested_parse_with_titles
153 current_node = nodes.section(ids=[section_id])
154 current_node += nodes.title(heading, heading)
164 current_node = nodes.section()
H A Dcompat.py14 from docutils import nodes
15 from docutils.nodes import Element, Node, Text
59 util.nodes.nested_parse_with_titles(
68 util.nodes.nested_parse_with_titles(
162 return nodes.inline(target, "", *result_nodes)
H A Ddbusdoc.py29 from docutils import nodes
30 from docutils.nodes import Element, Node
39 from sphinx.util.nodes import nested_parse_with_titles
54 self._top_node = nodes.section()
122 node = nodes.paragraph()
/qemu/util/
H A Dfdmon-poll.c25 static __thread AioHandler **nodes; variable
33 g_free(nodes); in pollfds_cleanup()
49 nodes = g_renew(AioHandler *, nodes, nalloc); in add_pollfd()
51 nodes[npfd] = node; in add_pollfd()
87 aio_add_ready_handler(ready_list, nodes[i], revents); in fdmon_poll_wait()
/qemu/contrib/plugins/
H A Dcflow.c97 static GHashTable *nodes; variable
146 g_hash_table_size(nodes)); in plugin_exit()
149 g_hash_table_foreach_remove(nodes, filter_non_branches, NULL); in plugin_exit()
151 data = g_hash_table_get_values(nodes); in plugin_exit()
195 nodes = g_hash_table_new(g_int64_hash, g_int64_equal); in plugin_init()
222 node = (NodeData *) g_hash_table_lookup(nodes, &addr); in fetch_node()
225 g_hash_table_insert(nodes, &node->addr, node); in fetch_node()
/qemu/hw/acpi/
H A Dhmat.c215 if (!numa_state->nodes[i].node_mem) { in hmat_build_table_structs()
220 if (numa_state->nodes[i].initiator < MAX_NODES) { in hmat_build_table_structs()
224 build_hmat_mpda(table_data, flags, numa_state->nodes[i].initiator, i); in hmat_build_table_structs()
228 if (numa_state->nodes[i].has_cpu || numa_state->nodes[i].has_gi) { in hmat_build_table_structs()
/qemu/hw/core/
H A Dnuma.c70 NodeInfo *numa_info = ms->numa_state->nodes; in parse_numa_node()
177 NodeInfo *numa_info = ms->numa_state->nodes; in parse_numa_distance()
213 NodeInfo *numa_info = numa_state->nodes; in parse_numa_hmat_lb()
393 NodeInfo *numa_info = ms->numa_state->nodes; in parse_numa_hmat_cache()
481 if (!ms->numa_state->nodes[object->u.cpu.node_id].present) { in set_numa_options()
565 NodeInfo *numa_info = ms->numa_state->nodes; in validate_numa_distance()
606 NodeInfo *numa_info = ms->numa_state->nodes; in complete_init_numa_distance()
632 uint64_t size = ms->numa_state->nodes[i].node_mem; in numa_init_memdev_container()
633 HostMemoryBackend *backend = ms->numa_state->nodes[i].node_memdev; in numa_init_memdev_container()
647 NodeInfo *numa_info = ms->numa_state->nodes; in numa_complete_configuration()
[all …]
/qemu/tests/qemu-iotests/tests/
H A Dinactive-node-nbd.out8 Exports activate nodes without allow-inactive
20 Exports activate nodes with allow-inactive=false
34 Export leaves nodes inactive with allow-inactive=true
50 Inactivating nodes with an export fails without allow-inactive
65 Inactivating nodes with an export fails with allow-inactive=false
80 Inactivating nodes with an export works with allow-inactive=true
95 === Inactive nodes with parent ===
97 Inactivating nodes with an active parent fails
105 Inactivating nodes with an inactive parent works
149 === Block jobs with inactive nodes ===
H A Dbackup-discard-source116 nodes = self.vm.cmd('query-named-block-nodes', flat=True)
117 temp = next(n for n in nodes if n['node-name'] == 'temp')
/qemu/
H A Dblockjob.c155 for (l = job->nodes; l; l = l->next) { in child_job_change_aio_ctx()
202 while (job->nodes) { in block_job_remove_all_bdrv()
203 GSList *l = job->nodes; in block_job_remove_all_bdrv()
206 job->nodes = l->next; in block_job_remove_all_bdrv()
221 for (el = job->nodes; el; el = el->next) { in block_job_has_bdrv()
245 job->nodes = g_slist_prepend(job->nodes, c); in block_job_add_bdrv()
/qemu/docs/
H A Dpci_expander_bridge.txt24 -object memory-backend-ram,size=1024M,policy=bind,host-nodes=0,id=ram-node0 -numa node,nodeid=0,cpu…
25 -object memory-backend-ram,size=1024M,policy=bind,host-nodes=1,id=ram-node1 -numa node,nodeid=1,cpu…
31 …- 2 NUMA nodes for the guest, 0 and 1. (both mapped to the same NUMA node in host, but you can and…
/qemu/hw/loongarch/
H A Dvirt-acpi-build.c188 int nodes, nb_numa_nodes = machine->numa_state->num_nodes; in build_srat() local
219 numa_info = machine->numa_state->nodes; in build_srat()
220 nodes = nb_numa_nodes; in build_srat()
221 if (!nodes) { in build_srat()
222 nodes = 1; in build_srat()
225 for (i = 0; i < nodes; i++) { in build_srat()
254 nodes - 1, in build_srat()
H A Dvirt-fdt-build.c131 int i, nb_numa_nodes, nodes; in fdt_add_memory_nodes() local
137 nodes = nb_numa_nodes = ms->numa_state->num_nodes; in fdt_add_memory_nodes()
138 numa_info = ms->numa_state->nodes; in fdt_add_memory_nodes()
139 if (!nodes) { in fdt_add_memory_nodes()
140 nodes = 1; in fdt_add_memory_nodes()
143 for (i = 0; i < nodes; i++) { in fdt_add_memory_nodes()
/qemu/hw/riscv/
H A Dnuma.c143 mem_offset += ms->numa_state->nodes[i].node_mem; in riscv_socket_mem_offset()
156 ms->numa_state->nodes[socket_id].node_mem : 0; in riscv_socket_mem_size()
184 cpu_to_be32(ms->numa_state->nodes[i].distance[j]); in riscv_socket_fdt_write_distance_matrix()
/qemu/docs/devel/testing/
H A Dqgraph.rst36 The graph is composed by nodes that represent machines, drivers, tests
52 for the same type of device, and offers an API to the nodes that
57 Notes for the nodes:
63 - QNODE_DRIVER: driver names must be unique, and machines and nodes
64 planned to be "consumed" by other nodes must match QEMU
70 An edge relation between two nodes (drivers or machines) ``X`` and ``Y`` can be:
81 - All nodes and edges are created in their respective
84 and machines (note that only machines and "consumed" nodes are mapped
127 While adding command line in edges is always used, not all nodes names are
129 are already added by QEMU, so only nodes that "consumes" will be used to
[all …]
/qemu/qapi/
H A Dcommon.json150 # @preferred: set the preferred host nodes for allocation
153 # nodes specified
156 # host nodes specified
/qemu/tests/qemu-iotests/
H A D216.out2 === Copy-on-read across nodes ===
H A D310.out2 === Copy-on-read across nodes ===

1234