diff options
| author | rth <rth@138bc75d-0d04-0410-961f-82ee72b054a4> | 1999-11-16 04:55:19 +0000 |
|---|---|---|
| committer | rth <rth@138bc75d-0d04-0410-961f-82ee72b054a4> | 1999-11-16 04:55:19 +0000 |
| commit | 9ffd5d6d55f198455c1715b04476596dd7a6a898 (patch) | |
| tree | 843dc855bf9ff6321be0e9793797d36b421d0ea5 /gcc/lcm.c | |
| parent | b6f738586d2efcebe2af7d6e0eed0a77e547df29 (diff) | |
| download | gcc-9ffd5d6d55f198455c1715b04476596dd7a6a898.tar.gz | |
* ggc-common.c (ggc_print_statistics): Cast size_t to unsigned long
for printing.
* ggc.h (struct ggc_statistics): Rearrange elements for better
packing on 64-bit hosts.
* lcm.c (compute_laterin): Store a size_t not an int in bb->aux.
(compute_nearerout): Likewise.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@30547 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/lcm.c')
| -rw-r--r-- | gcc/lcm.c | 21 |
1 files changed, 11 insertions, 10 deletions
diff --git a/gcc/lcm.c b/gcc/lcm.c index dd900b6132d..a6cdd7d4974 100644 --- a/gcc/lcm.c +++ b/gcc/lcm.c @@ -255,7 +255,7 @@ compute_laterin (edge_list, earliest, antloc, later, laterin) /* Initialize a mapping from each edge to its index. */ for (i = 0; i < num_edges; i++) - INDEX_EDGE (edge_list, i)->aux = (void *)i; + INDEX_EDGE (edge_list, i)->aux = (void *) (size_t) i; /* We want a maximal solution, so initially consider LATER true for all edges. This allows propagation through a loop since the incoming @@ -296,13 +296,13 @@ compute_laterin (edge_list, earliest, antloc, later, laterin) bb = b->index; sbitmap_ones (laterin[bb]); for (e = b->pred; e != NULL; e = e->pred_next) - sbitmap_a_and_b (laterin[bb], laterin[bb], later[(int)e->aux]); + sbitmap_a_and_b (laterin[bb], laterin[bb], later[(size_t)e->aux]); /* Calculate LATER for all outgoing edges. */ for (e = b->succ; e != NULL; e = e->succ_next) { - if (sbitmap_union_of_diff (later[(int)e->aux], - earliest[(int)e->aux], + if (sbitmap_union_of_diff (later[(size_t) e->aux], + earliest[(size_t) e->aux], laterin[e->src->index], antloc[e->src->index])) { @@ -324,7 +324,7 @@ compute_laterin (edge_list, earliest, antloc, later, laterin) for (e = EXIT_BLOCK_PTR->pred; e != NULL; e = e->pred_next) sbitmap_a_and_b (laterin[n_basic_blocks], laterin[n_basic_blocks], - later[(int)e->aux]); + later[(size_t) e->aux]); free (tos); } @@ -600,7 +600,7 @@ compute_nearerout (edge_list, farthest, st_avloc, nearer, nearerout) /* Initialize NEARER for each edge and build a mapping from an edge to its index. */ for (i = 0; i < num_edges; i++) - INDEX_EDGE (edge_list, i)->aux = (void *)i; + INDEX_EDGE (edge_list, i)->aux = (void *) (size_t) i; /* We want a maximal solution. */ sbitmap_vector_ones (nearer, num_edges); @@ -632,13 +632,14 @@ compute_nearerout (edge_list, farthest, st_avloc, nearer, nearerout) bb = b->index; sbitmap_ones (nearerout[bb]); for (e = b->succ; e != NULL; e = e->succ_next) - sbitmap_a_and_b (nearerout[bb], nearerout[bb], nearer[(int)e->aux]); + sbitmap_a_and_b (nearerout[bb], nearerout[bb], + nearer[(size_t) e->aux]); /* Calculate NEARER for all incoming edges. */ for (e = b->pred; e != NULL; e = e->pred_next) { - if (sbitmap_union_of_diff (nearer[(int)e->aux], - farthest[(int)e->aux], + if (sbitmap_union_of_diff (nearer[(size_t) e->aux], + farthest[(size_t) e->aux], nearerout[e->dest->index], st_avloc[e->dest->index])) { @@ -660,7 +661,7 @@ compute_nearerout (edge_list, farthest, st_avloc, nearer, nearerout) for (e = ENTRY_BLOCK_PTR->succ; e != NULL; e = e->succ_next) sbitmap_a_and_b (nearerout[n_basic_blocks], nearerout[n_basic_blocks], - nearer[(int)e->aux]); + nearer[(size_t) e->aux]); free (tos); } |