[r27387]

- use Phi list to speed up algo
- initially clear the links of all nodes (block walker visits only initially reachable ones)
- track resources
- invalidate analysis info at end

[r27386]

[r27385]

[r27384]

[r27383]

[r27381]

[r27377]

...

[r27374]

[r27373]

[r27372]

[r27371]

[r27370]

[r27369]

[r27368]

This fixes testsuite/backend/floatset.c ...

[r27367]

[r27366]

fix consconfirm missing nodes in its statistics and worse not invalidating out-edges because of that

[r27365]

Partly undo r27277 and add a prototype for (formally undocumented) find_value(), needed by the edgjfe FE.

[r27363]

[r27362]

[r27360]

[r27359]

[r27356]

[r27352]

[r27350]

[r27348]

[r27347]

[r27346]

[r27333]

[r27332]

[r27330]

[r27328]

[r27325]

[r27324]

[r27323]

Loop inversion is more elegant and cleaned up now by using phases. Testsuite runs successfully with loop inversion.

[r27321]

[r27318]

[r27317]

[r27316]

[r27315]

[r27314]