[r27077]

[r27076]

[r27075]

[r27064]

[r27063]

[r27062]

[r27061]

[r27060]

[r27058]

[r27057]

a new garbage collection pass less conservative than gc_irgs (but does not respect properties of object-oriented programs)

[r27056]

[r27055]

[r27054]

New setcc framework can handle all mux_is_abs(..., Const, Const) using set and up to 3 instructions ...

[r27053]

[r27052]

[r27048]

[r27046]

[r27045]

[r27044]

[r27042]

  clumsy. Bring back get_entity_visibility and set_entity_visibility

[r27039]

[r27037]

[r27036]

[r27034]

[r27032]

[r27031]

- Merge stickyness, visibility and variability into ir_linkage
- Add proper support for common symbols, weak symbols and C++ COMDAT stuff
- Mark OO-features type_visibility, peculiarity and allocation as deprecated
  OO feature will be separated from firm core into higher levels in the long run
- Rework, simplify and fix bugs in begnuas.c

[r27030]

[r27029]

[r27026]

make the character used for specifying elf types configurable in begnuas and use generic function prolog in arm backend

[r27022]

[r27021]

[r27019]

[r27018]

[r27014]

[r27012]

[r27011]

[r27008]

In mode_b lowering move the assertion for mode_b below the check, whether the node was replaced already. Some nodes are their own replacement and therefore do not have mode_b anymore after lowering.

[r27007]

Consistently record the replacement nodes and removal candidates when doing mode_b lowering. This was not done in some cases, most importantly the former was not done for certain Projs, which are their own replacement (just their mode gets changed). Also add a FIXME that the algorithm is subtly broken and may replace the same node twice due to recursion over Phis.

[r27006]