summary refs log tree commit diff stats
path: root/linux-user/mips/cpu_loop.c
diff options
context:
space:
mode:
authorMarkus Armbruster <armbru@redhat.com>2025-07-25 15:50:31 +0200
committerMarkus Armbruster <armbru@redhat.com>2025-09-01 13:43:43 +0200
commita60e1544b515e5205489141fc76cdf26de3a5f1b (patch)
treeeba4e0152b3f8d295e9227b3e357f35e49f5fa58 /linux-user/mips/cpu_loop.c
parent91589bcd9fee0e66b241d04e5f37cd4f218187a2 (diff)
downloadfocaccia-qemu-a60e1544b515e5205489141fc76cdf26de3a5f1b.tar.gz
focaccia-qemu-a60e1544b515e5205489141fc76cdf26de3a5f1b.zip
qtest/qom-test: Shallow testing of qom-list / qom-get
This test traverses the QOM sub-tree rooted at /machine with a
combination of qom-list and qom-get.  In my x86_64 testing, it runs
almost 12000 QMP commands in 34 seconds.  With -m slow, we test more
machines, and it takes almost 84000 commands in almost four minutes.

Since commit 3dd93992ffb (tests/qtest/qom-test: unit test for
qom-list-get), the test traverses this tree a second time, with
qom-list-get.  In my x86_64 testing, this takes some 200 QMP commands
and around two seconds, and some 1100 in just under 12s with -m slow.

Traversing the entire tree is useful, because it exercise the QOM
property getters.  Traversing it twice not so much.

Make the qom-list / qom-get test shallow unless -m slow is given:
don't recurse.  Cuts the number of commands to around 600, and run
time to under 5s for me.

Signed-off-by: Markus Armbruster <armbru@redhat.com>
Message-ID: <20250725135034.2280477-3-armbru@redhat.com>
Reviewed-by: Steve Sistare <steven.sistare@oracle.com>
Diffstat (limited to 'linux-user/mips/cpu_loop.c')
0 files changed, 0 insertions, 0 deletions