d0p1/ack
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Bug fixed in optimizing two adjacent basic blocks.

Browse source
This commit is contained in:
bal 1984-12-07 14:19:53 +00:00
parent af75a28622
commit 9019141137
1 changed files with 8 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
util/ego/cs/cs.c
View file

@ -1,3 +1,4 @@
/* C O M M O N S U B E X P R E S S I O N E L I M I N A T I O N */ /* C O M M O N S U B E X P R E S S I O N E L I M I N A T I O N */
@ -41,17 +42,19 @@ STATIC cs_optimize(p)
rbp = p->p_start; rbp = p->p_start;
while (rbp != (bblock_p) 0) { while (rbp != (bblock_p) 0) {
bdone = rbp->b_idom;
/* First we build a list of common expressions with the /* First we build a list of common expressions with the
* value numbering algorithm. We take blocks in textual order * value numbering algorithm. We take blocks in textual order
* as long as the next block can only be reached through the * as long as the next block can only be reached through the
* block we have just done. * block we have just done. Note that if a block is preceded
* by itself, the number of predecessors is greater than 1,
* but the previous block can still be its immediate dominator.
*/ */
while (rbp != (bblock_p) 0 && rbp->b_idom == bdone) { do { vnm(rbp); bdone = rbp;
vnm(rbp); bdone = rbp;
OUTTRACE("basic block %d processed", bdone->b_id); OUTTRACE("basic block %d processed", bdone->b_id);
rbp = rbp->b_next; rbp = rbp->b_next;
} } while (rbp != (bblock_p) 0 && rbp->b_idom == bdone &&
Lnrelems(rbp->b_pred) == 1
);
OUTTRACE("value numbering completed", 0); OUTTRACE("value numbering completed", 0);
OUTAVAILS(); OUTENTITIES(); OUTAVAILS(); OUTENTITIES();