1. 07 Mar, 2014 1 commit
  2. 25 Feb, 2014 1 commit
  3. 30 Jan, 2014 1 commit
  4. 28 Jan, 2014 1 commit
  5. 27 Jan, 2014 1 commit
  6. 29 Nov, 2013 1 commit
  7. 31 Oct, 2013 2 commits
  8. 08 Aug, 2013 1 commit
    • Matthias Braun's avatar
      remove support for enumeration types · 89c75d37
      Matthias Braun authored
      It is not usefull for optimization in most languages:
      - In C/C++ you can't really change the value of enum constants as casting
        from/to integer has to produce the expected results.
      - In Java (and other OO languages) enum members are objects so the
        libfirm enumeration type can't be used there anyway
      89c75d37
  9. 02 Jul, 2013 1 commit
  10. 15 May, 2013 1 commit
  11. 06 May, 2013 1 commit
  12. 12 Mar, 2013 1 commit
    • Matthias Braun's avatar
      remove oparity_{unary|trinary|zero} · 9a1ec0a9
      Matthias Braun authored
      They weren't used in a sensible way and their semantic for
      non-arithmetic ops was unclear.
      Also implicitely fixes a bunch of bugs where these where set but no op_index
      was set at the same time.
      9a1ec0a9
  13. 12 Dec, 2012 1 commit
  14. 08 Dec, 2012 1 commit
  15. 06 Dec, 2012 1 commit
  16. 04 Dec, 2012 2 commits
  17. 03 Dec, 2012 1 commit
  18. 27 Nov, 2012 1 commit
  19. 25 Nov, 2012 1 commit
  20. 08 Nov, 2012 1 commit
  21. 11 Sep, 2012 1 commit
  22. 21 Aug, 2012 1 commit
    • Matthias Braun's avatar
      remove the concept of a strictconv · 31b3daf7
      Matthias Braun authored
      This means floatingpoint calculation in a firm graph must be performed
      in the mode specified (and may not be performed in a wider mode as
      before).
      31b3daf7
  23. 23 Jul, 2012 2 commits
  24. 13 Jul, 2012 1 commit
  25. 10 Jul, 2012 1 commit
  26. 13 Jun, 2012 1 commit
    • Matthias Braun's avatar
      remove extended basic block support · b4841b96
      Matthias Braun authored
      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.
      b4841b96
  27. 09 Feb, 2012 1 commit
  28. 14 Dec, 2011 1 commit
  29. 09 Dec, 2011 2 commits
  30. 07 Dec, 2011 1 commit
    • Matthias Braun's avatar
      correctly implement memop handling · 9fbdcb82
      Matthias Braun authored
      memops are nodes that have memory inputs, you can generically query them
      for their memory input. We can also get rid of get_fragile_op_mem in
      favor of get_memop_mem.
      9fbdcb82
  31. 17 Nov, 2011 3 commits
  32. 10 Nov, 2011 2 commits
  33. 02 Nov, 2011 1 commit
    • 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