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

+2006-11-01  Adam Nemet  <anemet@caviumnetworks.com>
+
+	* 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  <ebotcazou@libertysurf.fr>
 
 	* gcc.c-torture/execute/20061101-1.c: New test.

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" } } */

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" } } */

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" } } */