Re: 64bit cleanups for alpha

[Richard Henderson <rth at cygnus dot com>]

On Sun, Nov 28, 1999 at 09:56:44PM -0500, Brad Lucier wrote:
> OK, but I'm still getting these errors on yesterday's snapshot; did you
> check in the changes?

Hmm.  Yes, but there seem to be new additions.


r~


        * 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.

Index: lcm.c
===================================================================
RCS file: /cvs/gcc/egcs/gcc/lcm.c,v
retrieving revision 1.8
diff -c -p -d -r1.8 lcm.c
*** lcm.c	1999/11/16 04:55:19	1.8
--- lcm.c	1999/11/30 22:20:47
*************** compute_laterin (edge_list, earliest, an
*** 274,280 ****
       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]);
  
    /* Add all the blocks to the worklist.  This prevents an early exit from
       the loop given our optimistic initialization of LATER above.  */
--- 274,280 ----
       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[(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.  */
*************** compute_nearerout (edge_list, farthest, 
*** 610,616 ****
       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]);
  
    /* Add all the blocks to the worklist.  This prevents an early exit
       from the loop given our optimistic initialization of NEARER.  */
--- 610,616 ----
       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[(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.  */
Index: ggc-page.c
===================================================================
RCS file: /cvs/gcc/egcs/gcc/ggc-page.c,v
retrieving revision 1.16
diff -c -p -d -r1.16 ggc-page.c
*** ggc-page.c	1999/11/01 06:57:01	1.16
--- ggc-page.c	1999/11/30 22:20:47
*************** ggc_page_print_statistics ()
*** 1192,1199 ****
  	  in_use += 
  	    (OBJECTS_PER_PAGE (i) - p->num_free_objects) * (1 << i);
  	}
!       fprintf (stderr, "%-3d %-15lu %-15u\n", i, 
! 	       (unsigned long) allocated, in_use);
      }
  
    /* Print out some global information.  */
--- 1192,1199 ----
  	  in_use += 
  	    (OBJECTS_PER_PAGE (i) - p->num_free_objects) * (1 << i);
  	}
!       fprintf (stderr, "%-3d %-15lu %-15lu\n", i, 
! 	       (unsigned long) allocated, (unsigned long) in_use);
      }
  
    /* Print out some global information.  */