/qemu/tests/qemu-iotests/ |
H A D | 258 | 54 def find_graph_node(graph, node_id): argument 55 return next(node for node in graph['nodes'] if node['id'] == node_id) 144 graph = vm.qmp('x-debug-query-block-graph')['return'] 145 for edge in graph['edges']: 147 find_graph_node(graph, edge['parent'])['name'] == 'node3': 148 assert find_graph_node(graph, edge['child'])['name'] == 'node0'
|
H A D | iotests.py | 1111 def assert_block_path(self, root, path, expected_node, graph=None): argument 1135 if graph is None: 1136 graph = self.qmp('x-debug-query-block-graph')['return'] 1143 node = next((node for node in graph['nodes'] if node['name'] == root), 1153 node_id = next(edge['child'] for edge in graph['edges'] 1157 node = next(node for node in graph['nodes']
|
H A D | 245 | 129 def check_node_graph(self, graph): argument 131 self.assertEqual(json.dumps(graph, sort_keys=True),
|
/qemu/scripts/ |
H A D | render_block_graph.py | 54 graph = Digraph(comment='Block Nodes Graph') 55 graph.format = format 56 graph.node('permission symbols:\l' 83 graph.node(str(n['id']), label, shape=shape) 88 graph.edge(str(e['parent']), str(e['child']), label=label) 90 graph.render(filename)
|
H A D | decodetree.py | 94 def __init__(self, graph=None): argument 95 self.graph = graph 103 if not self.graph: 107 for k, v in self.graph.items(): 507 graph = {} 510 graph[n] = refs 513 ts = TopologicalSorter(graph)
|
H A D | meson-buildoptions.sh | 292 --enable-debug-graph-lock) printf "%s" -Ddebug_graph_lock=true ;; 293 --disable-debug-graph-lock) printf "%s" -Ddebug_graph_lock=false ;;
|
/qemu/tests/rocker/ |
H A D | tut.dot | 1 graph G { 2 graph [hostidtype="hostname", version="1:0", date="04/12/2013"];
|
/qemu/qapi/ |
H A D | yank.json | 23 # Specifies which block graph node to yank. See @YankInstance for 26 # @node-name: the name of the block graph node
|
H A D | block-core.json | 331 # Information about all nodes in the block graph starting at some 338 # @info: Block graph information starting at this node 351 # Information about all nodes in a block (sub)graph in the form of 353 # information for the (sub)graph's root node. 2032 # the whole graph (with block-jobs and block-backends). 2073 # Block Graph edge description for x-debug-query-block-graph. 2104 # @x-debug-query-block-graph: 2106 # Get the block graph. 4898 # @node-name: Name of the graph node to delete. 6013 # @node-name: the graph node name of the block driver state [all …]
|
H A D | job.json | 217 # part of any transaction) to finalize any graph changes and do any
|
H A D | block-export.json | 163 # Options for exporting a block graph node on some (file) mountpoint
|
H A D | qom.json | 34 # graph.
|
/qemu/stubs/ |
H A D | meson.build | 34 stub_ss.add(files('graph-lock.c'))
|
/qemu/docs/devel/ |
H A D | qgraph.rst | 21 The aim of qgraph is to create a graph of drivers, machines and tests such that 36 The graph is composed by nodes that represent machines, drivers, tests 86 - The framework walks the graph starting from the available machines and 582 Final graph will be like this::
|
H A D | zoned-storage.rst | 27 a BlockDriverState graph(for example, raw format on top of file-posix). The
|
H A D | memory.rst | 19 Memory is modelled as an acyclic graph of MemoryRegion objects. Sinks
|
/qemu/block/ |
H A D | meson.build | 19 'graph-lock.c',
|
/qemu/tests/unit/ |
H A D | meson.build | 71 'test-bdrv-graph-mod': [testblock],
|
/qemu/ |
H A D | block.c | 6232 XDbgBlockGraph *graph; member 6240 gr->graph = g_new0(XDbgBlockGraph, 1); in xdbg_graph_new() 6248 XDbgBlockGraph *graph = gr->graph; in xdbg_graph_finalize() local 6253 return graph; in xdbg_graph_finalize() 6285 QAPI_LIST_PREPEND(gr->graph->nodes, n); in xdbg_graph_add_node() 6312 QAPI_LIST_PREPEND(gr->graph->edges, edge); in xdbg_graph_add_edge()
|
H A D | meson_options.txt | 350 description: 'graph lock debugging support')
|
H A D | configure | 710 meson_option_parse --enable-debug-graph-lock ""
|
/qemu/docs/ |
H A D | throttle.txt | 263 graph, allowing for more flexibility.
|
/qemu/docs/interop/ |
H A D | live-block-operations.rst | 805 ``drive-mirror``, except that it operates at node-level in a BDS graph. 990 State (BDS) graph.
|
H A D | bitmaps.rst | 51 node in the storage graph, but are most useful conceptually when attached to 56 attaching the bitmap elsewhere in the storage graph. This is beyond the scope
|