lcm.c (compute_laterin): Cast bb->aux to size_t not int.

        * lcm.c (compute_laterin): Cast bb->aux to size_t not int.
        (compute_nearerout): Likewise.
        * ggc-page.c (ggc_page_print_statistics): Explicitly cast
        size_t to unsigned long for formatting.

From-SVN: r30728

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 6210e8ae6087f36d51ac3f0310df64b511192d74..317ee8f0f4a45c30b56e1d2794aa7ff7006ec64d 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,10 @@
+Tue Nov 30 14:21:00 1999  Richard Henderson  <rth@cygnus.com>
+
+       * lcm.c (compute_laterin): Cast bb->aux to size_t not int.
+       (compute_nearerout): Likewise.
+       * ggc-page.c (ggc_page_print_statistics): Explicitly cast
+       size_t to unsigned long for formatting.
+
 1999-11-30  Jakub Jelinek  <jakub@redhat.com>
 
        * config/sparc/sparc.h (FIXED_REGISTERS, CONDITIONAL_REGISTER_USAGE):

diff --git a/gcc/ggc-page.c b/gcc/ggc-page.c
index 2497f55f069d2609f087e06f65289d8fe1001700..7687cef0ba397d645ac06468207c6b1adb728216 100644 (file)
--- a/gcc/ggc-page.c
+++ b/gcc/ggc-page.c
@@ -1192,8 +1192,8 @@ ggc_page_print_statistics ()
          in_use += 
            (OBJECTS_PER_PAGE (i) - p->num_free_objects) * (1 << i);
        }
-      fprintf (stderr, "%-3d %-15lu %-15u\n", i, 
-              (unsigned long) allocated, in_use);
+      fprintf (stderr, "%-3d %-15lu %-15lu\n", i, 
+              (unsigned long) allocated, (unsigned long) in_use);
     }
 
   /* Print out some global information.  */

diff --git a/gcc/lcm.c b/gcc/lcm.c
index a6cdd7d4974e963cd39d9e9cb6e9df595b69ba79..64a00a422c12cfa0fa1137a0fcc05d5f59114748 100644 (file)
--- a/gcc/lcm.c
+++ b/gcc/lcm.c
@@ -274,7 +274,7 @@ compute_laterin (edge_list, earliest, antloc, later, laterin)
      the entry block.  That edge should always have a LATER value the
      same as EARLIEST for that edge.  */
   for (e = ENTRY_BLOCK_PTR->succ; e; e = e->succ_next)
-    sbitmap_copy (later[(int)e->aux], earliest[(int)e->aux]);
+    sbitmap_copy (later[(size_t)e->aux], earliest[(size_t)e->aux]);
 
   /* Add all the blocks to the worklist.  This prevents an early exit from
      the loop given our optimistic initialization of LATER above.  */
@@ -610,7 +610,7 @@ compute_nearerout (edge_list, farthest, st_avloc, nearer, nearerout)
      the exit block.  That edge should always have a NEARER value the
      same as FARTHEST for that edge.  */
   for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
-    sbitmap_copy (nearer[(int)e->aux], farthest[(int)e->aux]);
+    sbitmap_copy (nearer[(size_t)e->aux], farthest[(size_t)e->aux]);
 
   /* Add all the blocks to the worklist.  This prevents an early exit
      from the loop given our optimistic initialization of NEARER.  */