This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
64bit cleanups for alpha
- To: gcc-patches at gcc dot gnu dot org
- Subject: 64bit cleanups for alpha
- From: Brad Lucier <lucier at math dot purdue dot edu>
- Date: Fri, 26 Nov 1999 11:35:39 -0500 (EST)
- Cc: lucier at math dot purdue dot edu
These small patches remove two warnings on alpha that often indicate
a problem.
Brad Lucier
* ggc-page.c (ggc_page_print_statistics): make format match variable
* lcm.c (compute_laterin): use size_t, not int, to access later/earlier
(compute_nearerout): Likewise
===================================================================
RCS file: RCS/ggc-page.c,v
retrieving revision 1.1
diff -c -r1.1 ggc-page.c
*** ggc-page.c 1999/11/26 15:33:44 1.1
--- ggc-page.c 1999/11/26 15:35:31
***************
*** 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. */
===================================================================
RCS file: RCS/lcm.c,v
retrieving revision 1.2
diff -c -r1.2 lcm.c
*** lcm.c 1999/11/26 15:30:01 1.2
--- lcm.c 1999/11/26 15:32:37
***************
*** 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. */
***************
*** 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. */