[r19744]

[r19743]

- set be_ops only once
- do not overwrite already set be_ops

[r19742]

[r19741]

[r19740]

[r19739]

- removed arch_irn_handler stuff

[r19738]

[r19733]

greater function...

[r19732]

[r19721]

[r19720]

[r19719]

[r19718]

- clarify some comments

[r19717]

[r19716]

[r19715]

[r19714]

[r19713]

- replaced O(n) test by O(1) test
- simplified code

[r19712]

- simplified be_node_classify()

[r19711]

- create code for unsigned Doz (a - b < 0 ? 0 : a - b)

[r19704]

[r19703]

we can safely IGNORE the should_be_different constraint, iff
we have only one, one should be same and both inputs are identical, for instance in
sbb(x,x)

[r19702]

- preliminary support for If-conversion without Cmov

[r19689]

[r19661]

[r19660]

[r19659]

[r19658]

[r19657]

[r19656]

[r19655]

[r19653]

  previously removed after visiting:
  This could lead to visiting the same subgraph more than once (and
  quadratic runtime), but is not neccessary:
  If a subgraph was once visited, all addresses were already added to
  the set of "free" nodes.
  This fixes the mostly endless runs of the compiler for big methods,
  for instance in 176.gcc/calls.c after running cond_eval.c once more
- BugFix: add missing call to new initializer handling
- BugFix: if a node is exchanged, use the new node (not the Id) for
  further checks
- simplified the code
- fixed indentation

[r19652]

- use the set_using_irn_link() api
- fixed debugging output
- use is_Call()

[r19651]

[r19644]

[r19643]

- don't take delayed nodes too aggressively: if they're already dead in the
  known preds, then we'll only induce unnecessary reloads

[r19629]

[r19628]

 - inline recursive calls in rary cases only (BIG benefice or all
   arguments constant)
 - change some weights to hopefully better values

[r19625]

[r19623]