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

Fix some too-long lines and move a comment. 

From-SVN: r87086
This commit is contained in:
Richard Kenner 2004-09-04 09:18:16 -04:00
parent eb1aef5308
commit d70bb61f70
1 changed files with 10 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
gcc/lcm.c
View File

@ -290,10 +290,11 @@ compute_laterin (struct edge_list *edge_list, sbitmap *earliest,
*qin++ = bb;
bb->aux = bb;
}
qin = worklist;
/* Note that we do not use the last allocated element for our queue,
as EXIT_BLOCK is never inserted into it. In fact the above allocation
of n_basic_blocks + 1 elements is not necessary. */
qin = worklist;
qend = &worklist[n_basic_blocks];
qlen = n_basic_blocks;
@ -310,7 +311,8 @@ compute_laterin (struct edge_list *edge_list, sbitmap *earliest,
/* Compute the intersection of LATERIN for each incoming edge to B. */
sbitmap_ones (laterin[bb->index]);
for (e = bb->pred; e != NULL; e = e->pred_next)
sbitmap_a_and_b (laterin[bb->index], laterin[bb->index], later[(size_t)e->aux]);
sbitmap_a_and_b (laterin[bb->index], laterin[bb->index],
later[(size_t)e->aux]);
/* Calculate LATER for all outgoing edges. */
for (e = bb->succ; e != NULL; e = e->succ_next)
@ -354,7 +356,8 @@ compute_insert_delete (struct edge_list *edge_list, sbitmap *antloc,
basic_block bb;
FOR_EACH_BB (bb)
sbitmap_difference (delete[bb->index], antloc[bb->index], laterin[bb->index]);
sbitmap_difference (delete[bb->index], antloc[bb->index],
laterin[bb->index]);
for (x = 0; x < NUM_EDGES (edge_list); x++)
{
@ -526,7 +529,8 @@ compute_available (sbitmap *avloc, sbitmap *kill, sbitmap *avout,
sbitmap_intersection_of_preds (avin[bb->index], avout, bb->index);
}
if (sbitmap_union_of_diff_cg (avout[bb->index], avloc[bb->index], avin[bb->index], kill[bb->index]))
if (sbitmap_union_of_diff_cg (avout[bb->index], avloc[bb->index],
avin[bb->index], kill[bb->index]))
/* If the out state of this block changed, then we need
to add the successors of this block to the worklist
if they are not already on the worklist. */
@ -683,7 +687,8 @@ compute_rev_insert_delete (struct edge_list *edge_list, sbitmap *st_avloc,
basic_block bb;
FOR_EACH_BB (bb)
sbitmap_difference (delete[bb->index], st_avloc[bb->index], nearerout[bb->index]);
sbitmap_difference (delete[bb->index], st_avloc[bb->index],
nearerout[bb->index]);
for (x = 0; x < NUM_EDGES (edge_list); x++)
{