Message352114
Consider a flow graph of four nodes, A, B, C, D
where the A, B, C are "next" successors of each other (in order) and C branches to B and B branches to D. Note that there is no "next" link to the D block.
The correct order is A, B, C, D but the 'dfs' function in compile.c produces the order A, B, D, C.
This is not an issue with the current compiler as it always add the "next" link from C to D, but this will become an issue when we use a more powerful CFG based optimizer than the current "peephole" optimizer. |
|
Date |
User |
Action |
Args |
2019-09-12 11:19:40 | Mark.Shannon | set | recipients:
+ Mark.Shannon |
2019-09-12 11:19:40 | Mark.Shannon | set | messageid: <1568287180.55.0.964846639884.issue38135@roundup.psfhosted.org> |
2019-09-12 11:19:40 | Mark.Shannon | link | issue38135 messages |
2019-09-12 11:19:40 | Mark.Shannon | create | |
|