External/libvirt
1
0
Fork 0
mirror of https://gitlab.com/libvirt/libvirt.git synced 2024-11-05 12:51:12 +00:00
Code Issues Packages Projects Releases Wiki Activity
d9dd94711d
libvirt/tests/qemumonitorjsondata/qemumonitorjson-nodename-basic-named-nodes.json

269 lines
7.2 KiB
JSON
Raw Normal View History

tests: qemumonitorjson: Add test case for node name detection code The code is rather magic so a test case will help making sure that everything works well. The first case is a simple backing chain.
2017-03-13 11:47:46 +00:00
[
{
"iops_rd": 0,
"detect_zeroes": "off",
"image": {
"virtual-size": 9663676416,
"filename": "/var/lib/libvirt/images/rhel7.3.qcow2",
"cluster-size": 65536,
"format": "qcow2",
"actual-size": 9665384448,
"format-specific": {
"type": "qcow2",
"data": {
"compat": "1.1",
"lazy-refcounts": true,
"refcount-bits": 16,
"corrupt": false
}
},
"dirty-flag": false
},
"iops_wr": 0,
"ro": true,
qemu: block: Refactor node name detection code Remove the complex and unreliable code which inferred the node name hierarchy only from data returned by 'query-named-block-nodes'. It turns out that query-blockstats contain the full hierarchy of nodes as perceived by qemu so the inference code is not necessary. In query blockstats, the 'parent' object corresponds to the storage behind a storage volume and 'backing' corresponds to the lower level of backing chain. Since all have node names this data can be really easily used to detect node names. In addition to the code refactoring the one remaining test case needed to be fixed along. Reviewed-by: Eric Blake <eblake@redhat.com>
2017-07-26 07:36:21 +00:00
"node-name": "#block558",
tests: qemumonitorjson: Add test case for node name detection code The code is rather magic so a test case will help making sure that everything works well. The first case is a simple backing chain.
2017-03-13 11:47:46 +00:00
"backing_file_depth": 0,
"drv": "qcow2",
"iops": 0,
"bps_wr": 0,
"write_threshold": 0,
"encrypted": false,
"bps": 0,
"bps_rd": 0,
"cache": {
"no-flush": false,
"direct": false,
"writeback": true
},
"file": "/var/lib/libvirt/images/rhel7.3.qcow2",
"encryption_key_missing": false
},
{
"iops_rd": 0,
"detect_zeroes": "off",
"image": {
"virtual-size": 9665380352,
"filename": "/var/lib/libvirt/images/rhel7.3.qcow2",
"format": "file",
"actual-size": 9665384448,
"dirty-flag": false
},
"iops_wr": 0,
"ro": true,
qemu: block: Refactor node name detection code Remove the complex and unreliable code which inferred the node name hierarchy only from data returned by 'query-named-block-nodes'. It turns out that query-blockstats contain the full hierarchy of nodes as perceived by qemu so the inference code is not necessary. In query blockstats, the 'parent' object corresponds to the storage behind a storage volume and 'backing' corresponds to the lower level of backing chain. Since all have node names this data can be really easily used to detect node names. In addition to the code refactoring the one remaining test case needed to be fixed along. Reviewed-by: Eric Blake <eblake@redhat.com>
2017-07-26 07:36:21 +00:00
"node-name": "#block481",
tests: qemumonitorjson: Add test case for node name detection code The code is rather magic so a test case will help making sure that everything works well. The first case is a simple backing chain.
2017-03-13 11:47:46 +00:00
"backing_file_depth": 0,
"drv": "file",
"iops": 0,
"bps_wr": 0,
"write_threshold": 0,
"encrypted": false,
"bps": 0,
"bps_rd": 0,
"cache": {
"no-flush": false,
"direct": false,
"writeback": true
},
"file": "/var/lib/libvirt/images/rhel7.3.qcow2",
"encryption_key_missing": false
},
{
"iops_rd": 0,
"detect_zeroes": "off",
"image": {
"backing-image": {
"virtual-size": 9663676416,
"filename": "/var/lib/libvirt/images/rhel7.3.qcow2",
"cluster-size": 65536,
"format": "qcow2",
"actual-size": 9665384448,
"format-specific": {
"type": "qcow2",
"data": {
"compat": "1.1",
"lazy-refcounts": true,
"refcount-bits": 16,
"corrupt": false
}
},
"dirty-flag": false
},
"backing-filename-format": "qcow2",
"virtual-size": 9663676416,
"filename": "/var/lib/libvirt/images/rhel7.3.1483536402",
"cluster-size": 65536,
"format": "qcow2",
"actual-size": 200704,
"format-specific": {
"type": "qcow2",
"data": {
"compat": "1.1",
"lazy-refcounts": false,
"refcount-bits": 16,
"corrupt": false
}
},
"full-backing-filename": "/var/lib/libvirt/images/rhel7.3.qcow2",
"backing-filename": "/var/lib/libvirt/images/rhel7.3.qcow2",
"dirty-flag": false
},
"iops_wr": 0,
"ro": true,
qemu: block: Refactor node name detection code Remove the complex and unreliable code which inferred the node name hierarchy only from data returned by 'query-named-block-nodes'. It turns out that query-blockstats contain the full hierarchy of nodes as perceived by qemu so the inference code is not necessary. In query blockstats, the 'parent' object corresponds to the storage behind a storage volume and 'backing' corresponds to the lower level of backing chain. Since all have node names this data can be really easily used to detect node names. In addition to the code refactoring the one remaining test case needed to be fixed along. Reviewed-by: Eric Blake <eblake@redhat.com>
2017-07-26 07:36:21 +00:00
"node-name": "#block306",
tests: qemumonitorjson: Add test case for node name detection code The code is rather magic so a test case will help making sure that everything works well. The first case is a simple backing chain.
2017-03-13 11:47:46 +00:00
"backing_file_depth": 1,
"drv": "qcow2",
"iops": 0,
"bps_wr": 0,
"write_threshold": 0,
"backing_file": "/var/lib/libvirt/images/rhel7.3.qcow2",
"encrypted": false,
"bps": 0,
"bps_rd": 0,
"cache": {
"no-flush": false,
"direct": false,
"writeback": true
},
"file": "/var/lib/libvirt/images/rhel7.3.1483536402",
"encryption_key_missing": false
},
{
"iops_rd": 0,
"detect_zeroes": "off",
"image": {
"virtual-size": 197120,
"filename": "/var/lib/libvirt/images/rhel7.3.1483536402",
"format": "file",
"actual-size": 200704,
"dirty-flag": false
},
"iops_wr": 0,
"ro": true,
qemu: block: Refactor node name detection code Remove the complex and unreliable code which inferred the node name hierarchy only from data returned by 'query-named-block-nodes'. It turns out that query-blockstats contain the full hierarchy of nodes as perceived by qemu so the inference code is not necessary. In query blockstats, the 'parent' object corresponds to the storage behind a storage volume and 'backing' corresponds to the lower level of backing chain. Since all have node names this data can be really easily used to detect node names. In addition to the code refactoring the one remaining test case needed to be fixed along. Reviewed-by: Eric Blake <eblake@redhat.com>
2017-07-26 07:36:21 +00:00
"node-name": "#block220",
tests: qemumonitorjson: Add test case for node name detection code The code is rather magic so a test case will help making sure that everything works well. The first case is a simple backing chain.
2017-03-13 11:47:46 +00:00
"backing_file_depth": 0,
"drv": "file",
"iops": 0,
"bps_wr": 0,
"write_threshold": 0,
"encrypted": false,
"bps": 0,
"bps_rd": 0,
"cache": {
"no-flush": false,
"direct": false,
"writeback": true
},
"file": "/var/lib/libvirt/images/rhel7.3.1483536402",
"encryption_key_missing": false
},
{
"iops_rd": 0,
"detect_zeroes": "off",
"image": {
"backing-image": {
"backing-image": {
"virtual-size": 9663676416,
"filename": "/var/lib/libvirt/images/rhel7.3.qcow2",
"cluster-size": 65536,
"format": "qcow2",
"actual-size": 9665384448,
"format-specific": {
"type": "qcow2",
"data": {
"compat": "1.1",
"lazy-refcounts": true,
"refcount-bits": 16,
"corrupt": false
}
},
"dirty-flag": false
},
"backing-filename-format": "qcow2",
"virtual-size": 9663676416,
"filename": "/var/lib/libvirt/images/rhel7.3.1483536402",
"cluster-size": 65536,
"format": "qcow2",
"actual-size": 200704,
"format-specific": {
"type": "qcow2",
"data": {
"compat": "1.1",
"lazy-refcounts": false,
"refcount-bits": 16,
"corrupt": false
}
},
"full-backing-filename": "/var/lib/libvirt/images/rhel7.3.qcow2",
"backing-filename": "/var/lib/libvirt/images/rhel7.3.qcow2",
"dirty-flag": false
},
"backing-filename-format": "qcow2",
"virtual-size": 9663676416,
"filename": "/var/lib/libvirt/images/rhel7.3.1483545313",
"cluster-size": 65536,
"format": "qcow2",
qemu: block: Refactor node name detection code Remove the complex and unreliable code which inferred the node name hierarchy only from data returned by 'query-named-block-nodes'. It turns out that query-blockstats contain the full hierarchy of nodes as perceived by qemu so the inference code is not necessary. In query blockstats, the 'parent' object corresponds to the storage behind a storage volume and 'backing' corresponds to the lower level of backing chain. Since all have node names this data can be really easily used to detect node names. In addition to the code refactoring the one remaining test case needed to be fixed along. Reviewed-by: Eric Blake <eblake@redhat.com>
2017-07-26 07:36:21 +00:00
"actual-size": 33165312,
tests: qemumonitorjson: Add test case for node name detection code The code is rather magic so a test case will help making sure that everything works well. The first case is a simple backing chain.
2017-03-13 11:47:46 +00:00
"format-specific": {
"type": "qcow2",
"data": {
"compat": "1.1",
"lazy-refcounts": false,
"refcount-bits": 16,
"corrupt": false
}
},
"full-backing-filename": "/var/lib/libvirt/images/rhel7.3.1483536402",
"backing-filename": "/var/lib/libvirt/images/rhel7.3.1483536402",
"dirty-flag": false
},
"iops_wr": 0,
"ro": false,
qemu: block: Refactor node name detection code Remove the complex and unreliable code which inferred the node name hierarchy only from data returned by 'query-named-block-nodes'. It turns out that query-blockstats contain the full hierarchy of nodes as perceived by qemu so the inference code is not necessary. In query blockstats, the 'parent' object corresponds to the storage behind a storage volume and 'backing' corresponds to the lower level of backing chain. Since all have node names this data can be really easily used to detect node names. In addition to the code refactoring the one remaining test case needed to be fixed along. Reviewed-by: Eric Blake <eblake@redhat.com>
2017-07-26 07:36:21 +00:00
"node-name": "#block187",
tests: qemumonitorjson: Add test case for node name detection code The code is rather magic so a test case will help making sure that everything works well. The first case is a simple backing chain.
2017-03-13 11:47:46 +00:00
"backing_file_depth": 2,
"drv": "qcow2",
"iops": 0,
"bps_wr": 0,
"write_threshold": 0,
"backing_file": "/var/lib/libvirt/images/rhel7.3.1483536402",
"encrypted": false,
"bps": 0,
"bps_rd": 0,
"cache": {
"no-flush": false,
"direct": false,
"writeback": true
},
"file": "/var/lib/libvirt/images/rhel7.3.1483545313",
"encryption_key_missing": false
},
{
"iops_rd": 0,
"detect_zeroes": "off",
"image": {
qemu: block: Refactor node name detection code Remove the complex and unreliable code which inferred the node name hierarchy only from data returned by 'query-named-block-nodes'. It turns out that query-blockstats contain the full hierarchy of nodes as perceived by qemu so the inference code is not necessary. In query blockstats, the 'parent' object corresponds to the storage behind a storage volume and 'backing' corresponds to the lower level of backing chain. Since all have node names this data can be really easily used to detect node names. In addition to the code refactoring the one remaining test case needed to be fixed along. Reviewed-by: Eric Blake <eblake@redhat.com>
2017-07-26 07:36:21 +00:00
"virtual-size": 33226752,
tests: qemumonitorjson: Add test case for node name detection code The code is rather magic so a test case will help making sure that everything works well. The first case is a simple backing chain.
2017-03-13 11:47:46 +00:00
"filename": "/var/lib/libvirt/images/rhel7.3.1483545313",
"format": "file",
qemu: block: Refactor node name detection code Remove the complex and unreliable code which inferred the node name hierarchy only from data returned by 'query-named-block-nodes'. It turns out that query-blockstats contain the full hierarchy of nodes as perceived by qemu so the inference code is not necessary. In query blockstats, the 'parent' object corresponds to the storage behind a storage volume and 'backing' corresponds to the lower level of backing chain. Since all have node names this data can be really easily used to detect node names. In addition to the code refactoring the one remaining test case needed to be fixed along. Reviewed-by: Eric Blake <eblake@redhat.com>
2017-07-26 07:36:21 +00:00
"actual-size": 33165312,
tests: qemumonitorjson: Add test case for node name detection code The code is rather magic so a test case will help making sure that everything works well. The first case is a simple backing chain.
2017-03-13 11:47:46 +00:00
"dirty-flag": false
},
"iops_wr": 0,
"ro": false,
qemu: block: Refactor node name detection code Remove the complex and unreliable code which inferred the node name hierarchy only from data returned by 'query-named-block-nodes'. It turns out that query-blockstats contain the full hierarchy of nodes as perceived by qemu so the inference code is not necessary. In query blockstats, the 'parent' object corresponds to the storage behind a storage volume and 'backing' corresponds to the lower level of backing chain. Since all have node names this data can be really easily used to detect node names. In addition to the code refactoring the one remaining test case needed to be fixed along. Reviewed-by: Eric Blake <eblake@redhat.com>
2017-07-26 07:36:21 +00:00
"node-name": "#block033",
tests: qemumonitorjson: Add test case for node name detection code The code is rather magic so a test case will help making sure that everything works well. The first case is a simple backing chain.
2017-03-13 11:47:46 +00:00
"backing_file_depth": 0,
"drv": "file",
"iops": 0,
"bps_wr": 0,
"write_threshold": 0,
"encrypted": false,
"bps": 0,
"bps_rd": 0,
"cache": {
"no-flush": false,
"direct": false,
"writeback": true
},
"file": "/var/lib/libvirt/images/rhel7.3.1483545313",
"encryption_key_missing": false
}
]
Reference in New Issue Copy Permalink