GitLab

- For equal destinations merge the switch table entries and Proj nodes
- Handle Switches with just a default Proj like Jmp nodes

- No strange split between no-phi and phi variants anymore. The phi
  variant can perform everything now.
- Repeat till we reach the fixpoint.

The were some comments in the code indicating that in case of SSA
destruction problems critical edges were not created. But we deal with
these cases anyway during SSA destruction so no need to avoid them
earlier.

This should fix the case where it would remove an unused PhiM in an endless
loop (which is not correct).

Previously a Bad node was returned which could hide problems and more
importantly you create new nodes (the BadBB) in an operation that apparently
only queries the graph.

All users of NEW_ARR_A used it to construct a simple array, yet noone
cared about it actually being an array with a length field in front. For
this simple use case you should use ALLOCAN.

Nobody uses it currently, and it is a burden for everyone writing a new
pass.

It has been empty for nearly all systems. People who used to put stuff
in config.h can still create a config.h on their own and inject
-include (gcc) or /FI (msvc) into their CPPFLAGS.

This fixes opt/fehler211.c and opt/fehler212.c.

Use a fresh variable in the following code,
so it does not hide the "unusedness".

Just state the copyright and the project the files belong to. You can
then find the COPYING file for the whole project.

The start block does not end in a Jmp, which the next if checks.

All Conds are boolean.

cleanup: Remove pointless assert(is_${NODE}(x)) just before get_${NODE}_${FOO}(x), which do the same assert.

The opt_manage framework didn't really do much except assuring that some
analysis info is computed before a pass starts. We can achieve this
simpler by providing an assure_irg_properties function.
This commit also fixes some places where analysis info was potentially
not invalidated before.

graph_properties are things that a transformation may destroy but which
can be easily recalculated.

graph_constraints are set after lowering phases have been running and
forbid certain constructs that no (later) transformation is allowed to construct

First it is unclear what is a good way to deconstruct a program into extended
basic blocks, also none of our optimizations works on extended basic
blocks.

Merge a block with its only control flow predecessor,
if it contains no phi nodes and the block is the only successor of the predecessor.

The preconditions were too tight