- Added 2 new blockschedulers, a greedy algorithm and an "optimal" ILP that
authorMatthias Braun <matze@braunis.de>
Sat, 30 Sep 2006 10:16:53 +0000 (10:16 +0000)
committerMatthias Braun <matze@braunis.de>
Sat, 30 Sep 2006 10:16:53 +0000 (10:16 +0000)
commit97927c8e372f337e8342b698072facf4ffa453ad
tree3d55fb5a216785b65627dbdc91edce0d7776e1df
parent8d3747b480395d0097ef78e4a764c86f69cfcc7b
- Added 2 new blockschedulers, a greedy algorithm and an "optimal" ILP that
  both try to transform as many jumps as possible to fallthroughs (weighted by
  execution frequency). The results are most of the times better than the extbb
  blockscheduler.
  Though it seems like x86 branch prediction sees conditional backward
  jumps as always taken, so we have to make sure that for 50/50 jumps we don't
  create backward jumps. (nothing implemented for this yet)
ir/be/beblocksched.c [new file with mode: 0644]
ir/be/beblocksched.h [new file with mode: 0644]
ir/be/bemain.c
ir/be/besched.c
ir/be/bespill.c
ir/be/bespillmorgan.c