1. 02 Aug, 2012 3 commits
  2. 19 Jul, 2012 1 commit
  3. 17 Jul, 2012 1 commit
  4. 16 Jul, 2012 1 commit
  5. 13 Jul, 2012 1 commit
  6. 15 Jun, 2012 1 commit
  7. 09 Feb, 2012 2 commits
  8. 10 Jan, 2012 1 commit
  9. 09 Jan, 2012 1 commit
  10. 15 Dec, 2011 1 commit
    • Matthias Braun's avatar
      make unique types/entities part of irprog · 274626e2
      Matthias Braun authored
      unknown_type, code_type, none_type, unknown_entity reference are hold in
      the irprog now. This makes handling more consistent since now all types
      and entities are equally part of irprog.
      274626e2
  11. 06 Dec, 2011 1 commit
  12. 05 Dec, 2011 1 commit
  13. 01 Dec, 2011 1 commit
  14. 10 Nov, 2011 1 commit
  15. 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
  16. 17 Oct, 2011 1 commit
  17. 11 Oct, 2011 1 commit
  18. 27 Sep, 2011 2 commits
  19. 21 Sep, 2011 1 commit
  20. 15 Sep, 2011 1 commit
    • Matthias Braun's avatar
      lower_mode_b: refactoring, make it more robust · a00e3544
      Matthias Braun authored
      - Make API private as it should only be called by backends
      - Let ia32 backend create special ia32_Set nodes instead of relying
        on muxes which must not be touched anymore
      - Does not create ConvB nodes anymore but instead produces the Cmp
        directly. (All backends did this anyway during code-selection so I was
        able to leave this case out code-selection)
      - First collect nodes to lower, then lower them. This avoids robustness
        problems when transforming the graph while at the same time walking
        it.
      a00e3544
  21. 12 Sep, 2011 2 commits
  22. 06 Sep, 2011 5 commits
  23. 22 Aug, 2011 2 commits
  24. 18 Aug, 2011 2 commits
  25. 17 Aug, 2011 1 commit
  26. 15 Aug, 2011 4 commits
    • Matthias Braun's avatar
      big refactoring of arch_XXX functions · 41dc42af
      Matthias Braun authored
      This tries to get the names in a consistent format. We basically have 2
      views on register allocation/constraints now:
      
      1) Register Requirements and Assigments are per-instruction. Each
         instruction has requirements on its inputs and outputs, register get
         assigned for outputs of an instruction (assignment is an attribute of
         an instruction, not of the Proj-nodes).
         The internal datastructures model this form!
      
         The functions here have the form:
           arch_get_irn_register_req_in(node, input_nr)
           arch_get_irn_register_in(node, input_nr)
           arch_get_irn_register_req_out(node, output_nr)
           arch_set_irn_register_out(node, output_nr, register)
      
      2) Register Requirements and Assignments are on firm-values. This view
         allows to query/assign requirements and registers at the Proj nodes
         instead of the repsective predecessors.
         This is a convenience interface modeled on top of the other!
      
         The functions have the form:
           arch_get_irn_register_req(node)
           arch_get_irn_register(node)
           arch_set_irn_register(node, register)
      41dc42af
    • Matthias Braun's avatar
      37a95d35
    • Matthias Braun's avatar
      22eb6c0a
    • Matthias Braun's avatar
      custom stack bias code for sparc · 8f4eae8e
      Matthias Braun authored
      8f4eae8e