OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

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
This commit is contained in:
Richard Henderson 1999-11-30 14:28:43 -08:00 committed by Richard Henderson
parent e48addeebc
commit e5b7ca327d
3 changed files with 11 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
gcc/ChangeLog
View File

@ -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):

4
gcc/ggc-page.c
View File

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

4
gcc/lcm.c
View File

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