mirror of
https://github.com/xen-project/xen.git
synced 2026-10-28 02:01:24 +01:00
tools/tests: introduce unit tests for domain ID allocator
Introduce some basic infrastructure for doing domain ID allocation unit tests, and add a few tests that ensure correctness of the domain ID allocator. Use <xen-tools/bitops.h> and xen/lib/find-next-bit.c in test hardness code. Adjust find-next-bit.c to be compiled with __XEN_TOOLS__. Signed-off-by: Denis Mukhin <dmukhin@ford.com> Reviewed-by: Anthony PERARD <anthony.perard@vates.tech>
This commit is contained in:
Denis Mukhin authored and Stefano Stabellini committed
1 parent
2d50650607
commit
b3d31533a0
7 files changed
+255
No files matched your search
@@ -12,6 +12,16 @@
|
||||
#define BITS_PER_LONG 32
|
||||
#endif
|
||||
|
||||
#define ffsl(x) __builtin_ffsl(x)
|
||||
|
||||
#define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
|
||||
|
||||
#define BITS_TO_LONGS(bits) \
|
||||
(((bits) + BITS_PER_LONG - 1) / BITS_PER_LONG)
|
||||
|
||||
#define DECLARE_BITMAP(name, bits) \
|
||||
unsigned long name[BITS_TO_LONGS(bits)]
|
||||
|
||||
#define BITMAP_ENTRY(_nr,_bmap) ((_bmap))[(_nr) / 8]
|
||||
#define BITMAP_SHIFT(_nr) ((_nr) % 8)
|
||||
|
||||
|
||||
@@ -2,6 +2,7 @@ XEN_ROOT = $(CURDIR)/../..
|
||||
include $(XEN_ROOT)/tools/Rules.mk
|
||||
|
||||
SUBDIRS-y :=
|
||||
SUBDIRS-y += domid
|
||||
SUBDIRS-y += resource
|
||||
SUBDIRS-$(CONFIG_X86) += cpu-policy
|
||||
SUBDIRS-$(CONFIG_X86) += tsx
|
||||
|
||||
@@ -0,0 +1,2 @@
|
||||
generated
|
||||
test-domid
|
||||
@@ -0,0 +1,88 @@
|
||||
# SPDX-License-Identifier: GPL-2.0-only
|
||||
#
|
||||
# Unit tests for domain ID allocator.
|
||||
#
|
||||
# Copyright 2025 Ford Motor Company
|
||||
|
||||
XEN_ROOT=$(CURDIR)/../../..
|
||||
include $(XEN_ROOT)/tools/Rules.mk
|
||||
|
||||
TESTS := test-domid
|
||||
|
||||
define list-c-headers
|
||||
$(shell sed -n -E \
|
||||
's/^[ \t]*# *include[ \t]*[<"]([^">]+)[">].*/\1/p' $(1) 2>/dev/null)
|
||||
endef
|
||||
|
||||
# NB: $1 cannot be a list
|
||||
define emit-harness-nested-rule
|
||||
$(1): $(CURDIR)/harness.h
|
||||
mkdir -p $$(@D);
|
||||
ln -sf $$< $$@;
|
||||
|
||||
endef
|
||||
|
||||
define emit-harness-rules
|
||||
$(foreach x,$(2),$(call emit-harness-nested-rule,$(CURDIR)/generated/$(x)))
|
||||
$(1:.c=.o): $(addprefix $(CURDIR)/generated/,$(2))
|
||||
endef
|
||||
|
||||
define emit-harness-deps
|
||||
$(if $(strip $(2)),$(call emit-harness-rules,$1,$2),)
|
||||
endef
|
||||
|
||||
define vpath-with-harness-deps
|
||||
vpath $(1) $(2)
|
||||
$(call emit-harness-deps,$(1),$(call list-c-headers,$(2)$(1)))
|
||||
endef
|
||||
|
||||
.PHONY: all
|
||||
all: $(TESTS)
|
||||
|
||||
.PHONY: run
|
||||
run: $(TESTS)
|
||||
set -e; $(foreach t,$(TESTS),./$(t);)
|
||||
|
||||
.PHONY: clean
|
||||
clean:
|
||||
$(RM) -r generated
|
||||
$(RM) -- *.o $(TESTS) $(DEPS_RM)
|
||||
|
||||
.PHONY: distclean
|
||||
distclean: clean
|
||||
$(RM) -- *~
|
||||
|
||||
.PHONY: install
|
||||
install: all
|
||||
$(INSTALL_DIR) $(DESTDIR)$(LIBEXEC)/tests
|
||||
$(INSTALL_PROG) test-domid $(DESTDIR)$(LIBEXEC)/tests
|
||||
|
||||
.PHONY: uninstall
|
||||
uninstall:
|
||||
$(RM) -- $(DESTDIR)$(LIBEXEC)/tests/test-domid
|
||||
|
||||
CFLAGS += -D__XEN_TOOLS__
|
||||
# find-next-bit.c
|
||||
CFLAGS += '-DEXPORT_SYMBOL(x)=' \
|
||||
-Dfind_first_bit \
|
||||
-Dfind_first_zero_bit \
|
||||
-Dfind_next_bit \
|
||||
-Dfind_next_bit_le \
|
||||
-Dfind_next_zero_bit_le
|
||||
CFLAGS += $(APPEND_CFLAGS)
|
||||
CFLAGS += $(CFLAGS_xeninclude)
|
||||
CFLAGS += -I./generated/
|
||||
|
||||
LDFLAGS += $(APPEND_LDFLAGS)
|
||||
|
||||
vpath find-next-bit.c $(XEN_ROOT)/xen/lib/
|
||||
|
||||
# Point to the hypervisor code and generate test harness dependencies
|
||||
# on the fly, making it possible to compile parts of the hypervisor
|
||||
# within a mocked environment.
|
||||
$(eval $(call vpath-with-harness-deps,domid.c,$(XEN_ROOT)/xen/common/))
|
||||
|
||||
test-domid: domid.o find-next-bit.o test-domid.o
|
||||
$(CC) $^ -o $@ $(LDFLAGS)
|
||||
|
||||
-include $(DEPS_INCLUDE)
|
||||
@@ -0,0 +1,54 @@
|
||||
/* SPDX-License-Identifier: GPL-2.0-only */
|
||||
/*
|
||||
* Unit test harness for domain ID allocator.
|
||||
*
|
||||
* Copyright 2025 Ford Motor Company
|
||||
*/
|
||||
|
||||
#ifndef _TEST_HARNESS_
|
||||
#define _TEST_HARNESS_
|
||||
|
||||
#include <assert.h>
|
||||
#include <stdbool.h>
|
||||
#include <stdint.h>
|
||||
#include <stdio.h>
|
||||
|
||||
#include <xen-tools/common-macros.h>
|
||||
#include <xen-tools/bitops.h>
|
||||
|
||||
typedef bool spinlock_t;
|
||||
typedef uint16_t domid_t;
|
||||
|
||||
extern domid_t domid_alloc(domid_t domid);
|
||||
extern void domid_free(domid_t domid);
|
||||
|
||||
extern unsigned long find_next_zero_bit(const unsigned long *addr,
|
||||
unsigned long size,
|
||||
unsigned long offset);
|
||||
|
||||
#define __test_and_set_bit(nr, addr) test_and_set_bit(nr, addr)
|
||||
#define __test_and_clear_bit(nr, addr) test_and_clear_bit(nr, addr)
|
||||
#define __set_bit(nr, addr) set_bit(nr, addr)
|
||||
|
||||
#define BUG_ON(x) assert(!(x))
|
||||
#define ASSERT(x) assert(x)
|
||||
|
||||
#define DEFINE_SPINLOCK(l) spinlock_t l
|
||||
#define spin_lock(l) (assert(!*(l)), *(l) = true)
|
||||
#define spin_unlock(l) (assert(*(l)), *(l) = false)
|
||||
|
||||
#define printk printf
|
||||
|
||||
#define DOMID_FIRST_RESERVED (100)
|
||||
#define DOMID_INVALID (101)
|
||||
|
||||
#endif /* _TEST_HARNESS_ */
|
||||
|
||||
/*
|
||||
* Local variables:
|
||||
* mode: C
|
||||
* c-file-style: "BSD"
|
||||
* c-basic-offset: 4
|
||||
* indent-tabs-mode: nil
|
||||
* End:
|
||||
*/
|
||||
@@ -0,0 +1,95 @@
|
||||
/* SPDX-License-Identifier: GPL-2.0-only */
|
||||
/*
|
||||
* Unit tests for domain ID allocator.
|
||||
*
|
||||
* Copyright 2025 Ford Motor Company
|
||||
*/
|
||||
|
||||
#include <sysexits.h>
|
||||
|
||||
#include "harness.h"
|
||||
|
||||
#define verify(exp, fmt, args...) \
|
||||
while (!(exp)) { \
|
||||
printf(fmt, ## args); \
|
||||
exit(EX_SOFTWARE); \
|
||||
}
|
||||
|
||||
/*
|
||||
* Fail on the first error, since tests are dependent on each other.
|
||||
*/
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
domid_t expected, allocated;
|
||||
|
||||
/* Test ID cannot be allocated twice. */
|
||||
for ( expected = 0; expected < DOMID_FIRST_RESERVED; expected++ )
|
||||
{
|
||||
allocated = domid_alloc(expected);
|
||||
verify(allocated == expected,
|
||||
"TEST 1: expected %u allocated %u\n", expected, allocated);
|
||||
}
|
||||
for ( expected = 0; expected < DOMID_FIRST_RESERVED; expected++ )
|
||||
{
|
||||
allocated = domid_alloc(expected);
|
||||
verify(allocated == DOMID_INVALID,
|
||||
"TEST 2: expected %u allocated %u\n", DOMID_INVALID, allocated);
|
||||
}
|
||||
|
||||
/* Ensure all IDs, including ID#0 are not allocated. */
|
||||
for ( expected = 0; expected < DOMID_FIRST_RESERVED; expected++ )
|
||||
domid_free(expected);
|
||||
|
||||
/*
|
||||
* Test that that two consecutive calls of domid_alloc(DOMID_INVALID)
|
||||
* will never return the same ID.
|
||||
* NB: ID#0 is reserved and shall not be allocated by
|
||||
* domid_alloc(DOMID_INVALID).
|
||||
*/
|
||||
for ( expected = 1; expected < DOMID_FIRST_RESERVED; expected++ )
|
||||
{
|
||||
allocated = domid_alloc(DOMID_INVALID);
|
||||
verify(allocated == expected,
|
||||
"TEST 3: expected %u allocated %u\n", expected, allocated);
|
||||
}
|
||||
for ( expected = 1; expected < DOMID_FIRST_RESERVED; expected++ )
|
||||
{
|
||||
allocated = domid_alloc(DOMID_INVALID);
|
||||
verify(allocated == DOMID_INVALID,
|
||||
"TEST 4: expected %u allocated %u\n", DOMID_INVALID, allocated);
|
||||
}
|
||||
|
||||
/* Re-allocate first ID from [1..DOMID_FIRST_RESERVED/2]. */
|
||||
for ( expected = 1; expected < DOMID_FIRST_RESERVED / 2; expected++ )
|
||||
domid_free(expected);
|
||||
for ( expected = 1; expected < DOMID_FIRST_RESERVED / 2; expected++ )
|
||||
{
|
||||
allocated = domid_alloc(DOMID_INVALID);
|
||||
verify(allocated == expected,
|
||||
"TEST 5: expected %u allocated %u\n", expected, allocated);
|
||||
}
|
||||
|
||||
/* Re-allocate last ID from [1..DOMID_FIRST_RESERVED - 1]. */
|
||||
expected = DOMID_FIRST_RESERVED - 1;
|
||||
domid_free(DOMID_FIRST_RESERVED - 1);
|
||||
allocated = domid_alloc(DOMID_INVALID);
|
||||
verify(allocated == expected,
|
||||
"TEST 6: expected %u allocated %u\n", expected, allocated);
|
||||
|
||||
/* Allocate an invalid ID. */
|
||||
expected = DOMID_INVALID;
|
||||
allocated = domid_alloc(DOMID_FIRST_RESERVED);
|
||||
verify(allocated == expected,
|
||||
"TEST 7: expected %u allocated %u\n", expected, allocated);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
* Local variables:
|
||||
* mode: C
|
||||
* c-file-style: "BSD"
|
||||
* c-basic-offset: 4
|
||||
* indent-tabs-mode: nil
|
||||
* End:
|
||||
*/
|
||||
@@ -8,8 +8,13 @@
|
||||
* as published by the Free Software Foundation; either version
|
||||
* 2 of the License, or (at your option) any later version.
|
||||
*/
|
||||
|
||||
#ifdef __XEN_TOOLS__
|
||||
#include <xen-tools/bitops.h>
|
||||
#else
|
||||
#include <xen/bitops.h>
|
||||
#include <xen/byteorder.h>
|
||||
#endif
|
||||
|
||||
#define __ffs(x) (ffsl(x) - 1)
|
||||
#define ffz(x) __ffs(~(x))
|
||||
|
||||