From 293be7fd22c09dafed1a8d44fe4a63ff61901cb0 Mon Sep 17 00:00:00 2001 From: Adam Nemet Date: Wed, 1 Nov 2006 19:22:02 +0000 Subject: [PATCH] fold-mod-1.c: Match the leading 0x for the hexadecimal value. * gcc.dg/fold-mod-1.c: Match the leading 0x for the hexadecimal value. * gcc.dg/tree-prof/val-prof-2.c: Likewise. * gcc.dg/pr14796-2.c: Likewise. From-SVN: r118394 --- gcc/testsuite/ChangeLog | 7 +++++++ gcc/testsuite/gcc.dg/fold-mod-1.c | 2 +- gcc/testsuite/gcc.dg/pr14796-2.c | 2 +- gcc/testsuite/gcc.dg/tree-prof/val-prof-2.c | 2 +- 4 files changed, 10 insertions(+), 3 deletions(-) diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index dece2c3eb65c..39225777248a 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,10 @@ +2006-11-01 Adam Nemet + + * gcc.dg/fold-mod-1.c: Match the leading 0x for the + hexadecimal value. + * gcc.dg/tree-prof/val-prof-2.c: Likewise. + * gcc.dg/pr14796-2.c: Likewise. + 2006-11-01 Eric Botcazou * gcc.c-torture/execute/20061101-1.c: New test. diff --git a/gcc/testsuite/gcc.dg/fold-mod-1.c b/gcc/testsuite/gcc.dg/fold-mod-1.c index 3f7696f17600..a8e2a5802ddc 100644 --- a/gcc/testsuite/gcc.dg/fold-mod-1.c +++ b/gcc/testsuite/gcc.dg/fold-mod-1.c @@ -21,6 +21,6 @@ unsigned int k (unsigned int d) { return d % 8; } -/* { dg-final { scan-tree-dump "a % (4294967288|0fffffff8)" "gimple" } } */ +/* { dg-final { scan-tree-dump "a % (4294967288|0x0fffffff8)" "gimple" } } */ /* { dg-final { scan-tree-dump-times " & 7" 3 "gimple" } } */ /* { dg-final { cleanup-tree-dump "gimple" } } */ diff --git a/gcc/testsuite/gcc.dg/pr14796-2.c b/gcc/testsuite/gcc.dg/pr14796-2.c index 2de5411a4907..c0a91dc955bf 100644 --- a/gcc/testsuite/gcc.dg/pr14796-2.c +++ b/gcc/testsuite/gcc.dg/pr14796-2.c @@ -19,5 +19,5 @@ long long j (long long c) { } /* { dg-final { scan-tree-dump-times "= 0" 2 "gimple" } } */ /* { dg-final { scan-tree-dump "b >> 31" "gimple" } } */ -/* { dg-final { scan-tree-dump "c & -(34359738368|800000000)" "gimple" } } */ +/* { dg-final { scan-tree-dump "c & -(34359738368|0x800000000)" "gimple" } } */ /* { dg-final { cleanup-tree-dump "gimple" } } */ diff --git a/gcc/testsuite/gcc.dg/tree-prof/val-prof-2.c b/gcc/testsuite/gcc.dg/tree-prof/val-prof-2.c index 7cefcfc7d815..66b0614c5efb 100644 --- a/gcc/testsuite/gcc.dg/tree-prof/val-prof-2.c +++ b/gcc/testsuite/gcc.dg/tree-prof/val-prof-2.c @@ -26,7 +26,7 @@ main () /* { dg-final-use { scan-tree-dump "Mod power of 2 transformation on insn" "tree_profile"} } */ /* This is part of code checking that n is power of 2, so we are sure that the transformation didn't get optimized out. */ -/* { dg-final-use { scan-tree-dump "n \\+ ffff" "optimized"} } */ +/* { dg-final-use { scan-tree-dump "n \\+ 0xffff" "optimized"} } */ /* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */ /* { dg-final-use { cleanup-tree-dump "optimized" } } */ /* { dg-final-use { cleanup-tree-dump "tree_profile" } } */ -- 2.47.2