2018-04-05 14:35:11 +00:00
|
|
|
# i386 cross compile notes
|
|
|
|
|
|
|
|
|
|
I386_SRC=$(SRC_PATH)/tests/tcg/i386
|
|
|
|
|
|
|
|
|
|
# Set search path for all sources
|
|
|
|
|
VPATH += $(I386_SRC)
|
|
|
|
|
|
|
|
|
|
I386_SRCS=$(notdir $(wildcard $(I386_SRC)/*.c))
|
2019-08-07 14:35:22 +00:00
|
|
|
ALL_X86_TESTS=$(I386_SRCS:.c=)
|
2019-10-11 12:07:22 +00:00
|
|
|
SKIP_I386_TESTS=test-i386-ssse3
|
2019-08-07 14:35:22 +00:00
|
|
|
X86_64_TESTS:=$(filter test-i386-ssse3, $(ALL_X86_TESTS))
|
2018-04-05 14:35:11 +00:00
|
|
|
|
2020-06-25 23:58:31 +00:00
|
|
|
test-i386-sse-exceptions: CFLAGS += -msse4.1 -mfpmath=sse
|
|
|
|
|
run-test-i386-sse-exceptions: QEMU_OPTS += -cpu max
|
|
|
|
|
run-plugin-test-i386-sse-exceptions-%: QEMU_OPTS += -cpu max
|
|
|
|
|
|
target/i386: correct fix for pcmpxstrx substring search
This corrects a bug introduced in my previous fix for SSE4.2 pcmpestri
/ pcmpestrm / pcmpistri / pcmpistrm substring search, commit
ae35eea7e4a9f21dd147406dfbcd0c4c6aaf2a60.
That commit fixed a bug that showed up in four GCC tests with one libc
implementation. The tests in question generate random inputs to the
intrinsics and compare results to a C implementation, but they only
test 1024 possible random inputs, and when the tests use the cases of
those instructions that work with word rather than byte inputs, it's
easy to have problematic cases that show up much less frequently than
that. Thus, testing with a different libc implementation, and so a
different random number generator, showed up a problem with the
previous patch.
When investigating the previous test failures, I found the description
of these instructions in the Intel manuals (starting from computing a
16x16 or 8x8 set of comparison results) confusing and hard to match up
with the more optimized implementation in QEMU, and referred to AMD
manuals which described the instructions in a different way. Those
AMD descriptions are very explicit that the whole of the string being
searched for must be found in the other operand, not running off the
end of that operand; they say "If the prototype and the SUT are equal
in length, the two strings must be identical for the comparison to be
TRUE.". However, that statement is incorrect.
In my previous commit message, I noted:
The operation in this case is a search for a string (argument d to
the helper) in another string (argument s to the helper); if a copy
of d at a particular position would run off the end of s, the
resulting output bit should be 0 whether or not the strings match in
the region where they overlap, but the QEMU implementation was
wrongly comparing only up to the point where s ends and counting it
as a match if an initial segment of d matched a terminal segment of
s. Here, "run off the end of s" means that some byte of d would
overlap some byte outside of s; thus, if d has zero length, it is
considered to match everywhere, including after the end of s.
The description "some byte of d would overlap some byte outside of s"
is accurate only when understood to refer to overlapping some byte
*within the 16-byte operand* but at or after the zero terminator; it
is valid to run over the end of s if the end of s is the end of the
16-byte operand. So the fix in the previous patch for the case of d
being empty was correct, but the other part of that patch was not
correct (as it never allowed partial matches even at the end of the
16-byte operand). Nor was the code before the previous patch correct
for the case of d nonempty, as it would always have allowed partial
matches at the end of s.
Fix with a partial revert of my previous change, combined with
inserting a check for the special case of s having maximum length to
determine where it is necessary to check for matches.
In the added test, test 1 is for the case of empty strings, which
failed before my 2017 patch, test 2 is for the bug introduced by my
2017 patch and test 3 deals with the case where a match of an initial
segment at the end of the string is not valid when the string ends
before the end of the 16-byte operand (that is, the case that would be
broken by a simple revert of the non-empty-string part of my 2017
patch).
Signed-off-by: Joseph Myers <joseph@codesourcery.com>
Message-Id: <alpine.DEB.2.21.2006121344290.9881@digraph.polyomino.org.uk>
Signed-off-by: Paolo Bonzini <pbonzini@redhat.com>
2020-06-12 13:45:23 +00:00
|
|
|
test-i386-pcmpistri: CFLAGS += -msse4.2
|
|
|
|
|
run-test-i386-pcmpistri: QEMU_OPTS += -cpu max
|
2020-06-15 14:19:22 +00:00
|
|
|
run-plugin-test-i386-pcmpistri-%: QEMU_OPTS += -cpu max
|
target/i386: correct fix for pcmpxstrx substring search
This corrects a bug introduced in my previous fix for SSE4.2 pcmpestri
/ pcmpestrm / pcmpistri / pcmpistrm substring search, commit
ae35eea7e4a9f21dd147406dfbcd0c4c6aaf2a60.
That commit fixed a bug that showed up in four GCC tests with one libc
implementation. The tests in question generate random inputs to the
intrinsics and compare results to a C implementation, but they only
test 1024 possible random inputs, and when the tests use the cases of
those instructions that work with word rather than byte inputs, it's
easy to have problematic cases that show up much less frequently than
that. Thus, testing with a different libc implementation, and so a
different random number generator, showed up a problem with the
previous patch.
When investigating the previous test failures, I found the description
of these instructions in the Intel manuals (starting from computing a
16x16 or 8x8 set of comparison results) confusing and hard to match up
with the more optimized implementation in QEMU, and referred to AMD
manuals which described the instructions in a different way. Those
AMD descriptions are very explicit that the whole of the string being
searched for must be found in the other operand, not running off the
end of that operand; they say "If the prototype and the SUT are equal
in length, the two strings must be identical for the comparison to be
TRUE.". However, that statement is incorrect.
In my previous commit message, I noted:
The operation in this case is a search for a string (argument d to
the helper) in another string (argument s to the helper); if a copy
of d at a particular position would run off the end of s, the
resulting output bit should be 0 whether or not the strings match in
the region where they overlap, but the QEMU implementation was
wrongly comparing only up to the point where s ends and counting it
as a match if an initial segment of d matched a terminal segment of
s. Here, "run off the end of s" means that some byte of d would
overlap some byte outside of s; thus, if d has zero length, it is
considered to match everywhere, including after the end of s.
The description "some byte of d would overlap some byte outside of s"
is accurate only when understood to refer to overlapping some byte
*within the 16-byte operand* but at or after the zero terminator; it
is valid to run over the end of s if the end of s is the end of the
16-byte operand. So the fix in the previous patch for the case of d
being empty was correct, but the other part of that patch was not
correct (as it never allowed partial matches even at the end of the
16-byte operand). Nor was the code before the previous patch correct
for the case of d nonempty, as it would always have allowed partial
matches at the end of s.
Fix with a partial revert of my previous change, combined with
inserting a check for the special case of s having maximum length to
determine where it is necessary to check for matches.
In the added test, test 1 is for the case of empty strings, which
failed before my 2017 patch, test 2 is for the bug introduced by my
2017 patch and test 3 deals with the case where a match of an initial
segment at the end of the string is not valid when the string ends
before the end of the 16-byte operand (that is, the case that would be
broken by a simple revert of the non-empty-string part of my 2017
patch).
Signed-off-by: Joseph Myers <joseph@codesourcery.com>
Message-Id: <alpine.DEB.2.21.2006121344290.9881@digraph.polyomino.org.uk>
Signed-off-by: Paolo Bonzini <pbonzini@redhat.com>
2020-06-12 13:45:23 +00:00
|
|
|
|
2018-04-05 14:35:11 +00:00
|
|
|
#
|
|
|
|
|
# hello-i386 is a barebones app
|
|
|
|
|
#
|
|
|
|
|
hello-i386: CFLAGS+=-ffreestanding
|
|
|
|
|
hello-i386: LDFLAGS+=-nostdlib
|
|
|
|
|
|
|
|
|
|
#
|
|
|
|
|
# test-386 includes a couple of additional objects that need to be linked together
|
|
|
|
|
#
|
|
|
|
|
|
|
|
|
|
test-i386: test-i386.c test-i386-code16.S test-i386-vm86.S test-i386.h test-i386-shift.h test-i386-muldiv.h
|
2019-08-07 14:35:22 +00:00
|
|
|
$(CC) $(CFLAGS) $(LDFLAGS) $(EXTRA_CFLAGS) -o $@ \
|
2018-04-05 14:35:11 +00:00
|
|
|
$(<D)/test-i386.c $(<D)/test-i386-code16.S $(<D)/test-i386-vm86.S -lm
|
2018-04-17 13:56:39 +00:00
|
|
|
|
2018-04-10 14:23:29 +00:00
|
|
|
ifeq ($(SPEED), slow)
|
|
|
|
|
|
|
|
|
|
test-i386-fprem.ref: test-i386-fprem
|
|
|
|
|
$(call quiet-command, ./$< > $@,"GENREF","generating $@")
|
|
|
|
|
|
|
|
|
|
run-test-i386-fprem: TIMEOUT=60
|
2019-07-05 10:48:02 +00:00
|
|
|
run-test-i386-fprem: test-i386-fprem test-i386-fprem.ref
|
2018-05-21 09:38:37 +00:00
|
|
|
$(call run-test,test-i386-fprem, $(QEMU) $<,"$< on $(TARGET_NAME)")
|
2019-07-05 10:48:02 +00:00
|
|
|
$(call diff-out,test-i386-fprem, test-i386-fprem.ref)
|
2018-04-10 14:23:29 +00:00
|
|
|
else
|
2019-10-11 12:07:22 +00:00
|
|
|
SKIP_I386_TESTS+=test-i386-fprem
|
2018-04-10 14:23:29 +00:00
|
|
|
endif
|
|
|
|
|
|
2019-10-11 12:07:22 +00:00
|
|
|
# Update TESTS
|
|
|
|
|
I386_TESTS:=$(filter-out $(SKIP_I386_TESTS), $(ALL_X86_TESTS))
|
|
|
|
|
TESTS=$(MULTIARCH_TESTS) $(I386_TESTS)
|
|
|
|
|
|
2018-04-17 13:56:39 +00:00
|
|
|
# On i386 and x86_64 Linux only supports 4k pages (large pages are a different hack)
|
|
|
|
|
EXTRA_RUNS+=run-test-mmap-4096
|