1. 08 Nov, 2012 1 commit
    • Christoph Mallon's avatar
      Remove keep-edge hacks for endless loop. · 908b8128
      Christoph Mallon authored
      It is the job of the frontend to keep loops.
      These hacks here only worked for some, but not all cases.
      In particular a more clever SSA-construction algorithm might not place redundant PhiMs, which would render memory before memory-less loops unkept.
      908b8128
  2. 07 Nov, 2012 1 commit
  3. 24 Oct, 2012 1 commit
  4. 15 Oct, 2012 1 commit
  5. 21 Aug, 2012 2 commits
  6. 23 Jul, 2012 1 commit
  7. 10 Jul, 2012 1 commit
  8. 19 Jun, 2012 2 commits
  9. 15 Jun, 2012 1 commit
  10. 08 Dec, 2011 1 commit
  11. 07 Dec, 2011 2 commits
  12. 18 Nov, 2011 1 commit
  13. 17 Nov, 2011 4 commits
  14. 14 Nov, 2011 1 commit
  15. 10 Nov, 2011 1 commit
  16. 02 Nov, 2011 2 commits
    • Matthias Braun's avatar
      introduce Switch node · 1c89dc2a
      Matthias Braun authored
      This is the new way of handling switch-jumps. The node contains a table
      which maps (ranges of) input values to proj numbers. Compared to a
      Cond-node this results in a clean consecutive sequence of Proj numbers
      (no searching for a free number for the default_pn anymore) and allows
      factoring multiple cases jumping to the same block in a single Proj
      (though we still need the optimisation in cfopt for that).
      1c89dc2a
    • Matthias Braun's avatar
      generate irdump proj-number lookup tables · 1e799c3b
      Matthias Braun authored
      1e799c3b
  17. 06 Sep, 2011 1 commit
  18. 01 Jun, 2011 1 commit
  19. 31 May, 2011 1 commit
  20. 25 May, 2011 2 commits
  21. 06 May, 2011 1 commit
  22. 28 Apr, 2011 1 commit
  23. 30 Mar, 2011 3 commits
  24. 25 Mar, 2011 1 commit
  25. 09 Mar, 2011 1 commit
  26. 28 Feb, 2011 1 commit
  27. 26 Feb, 2011 1 commit
  28. 09 Feb, 2011 2 commits
  29. 08 Jan, 2011 1 commit