From 14ae5ba40c3217f7410c377bf36e21509b01eb8f Mon Sep 17 00:00:00 2001 From: xleroy Date: Wed, 3 Jul 2013 11:28:17 +0000 Subject: powerpc: faster implementation of long division modeled on that for IA32 test: add one test (2^64-1) / (2^32+3) to exercise a special case of this long division. git-svn-id: https://yquem.inria.fr/compcert/svn/compcert/trunk@2288 fca1b0fc-160b-0410-b1d3-a4f43f01ea2e --- runtime/test/test_int64.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'runtime/test/test_int64.c') diff --git a/runtime/test/test_int64.c b/runtime/test/test_int64.c index 2aa21117..ab7a231d 100644 --- a/runtime/test/test_int64.c +++ b/runtime/test/test_int64.c @@ -181,11 +181,11 @@ static void test1(u64 x, u64 y) error++, printf("(s64) %a = %lld, expected %lld\n", f, z, (s64) f); } -#define NSPECIFIC 8 +#define NSPECIFIC 9 unsigned long long specific[NSPECIFIC] = { 0, 1, -1, 0x7FFFFFFFULL, 0x80000000ULL, 0xFFFFFFFFULL, - 0x7FFFFFFFFFFFULL, 0x8000000000000000ULL + 0x7FFFFFFFFFFFULL, 0x8000000000000000ULL, 0x100000003ULL }; int main() -- cgit