Corrected scc algorithm.
authorAndreas Schösser <andi@ipd.info.uni-karlsruhe.de>
Fri, 4 Jun 2004 09:09:11 +0000 (09:09 +0000)
committerAndreas Schösser <andi@ipd.info.uni-karlsruhe.de>
Fri, 4 Jun 2004 09:09:11 +0000 (09:09 +0000)
commita64980c9ed66d8f83e1e0eb8cb3fc71c9e78b557
tree8822334712465875abec8dc1b0209ff7fa3a7738
parent156031114c735bb3745abfa9418dea44442d833d
Corrected scc algorithm.
It always walks to Block nodes first. Bug-Fix that prevents walking
from floating nodes to blocks.
Inserted experimental code to guarantee that CallBegin Nodes are put
on the LoopTree first (before the corresponding CallEnd node) but
commented it out through the macro "EXPERIMENTAL_LOOP_TREE" for now.

[r3013]
ir/ana/irscc.c