1. 01 Jun, 2007 1 commit
  2. 27 Apr, 2007 2 commits
  3. 08 Jan, 2007 1 commit
  4. 29 Sep, 2006 1 commit
  5. 03 Jun, 2006 1 commit
  6. 19 May, 2006 1 commit
  7. 07 Mar, 2006 1 commit
  8. 21 Feb, 2006 1 commit
  9. 13 Jan, 2006 1 commit
  10. 01 Nov, 2005 1 commit
  11. 03 Aug, 2005 2 commits
  12. 15 Jun, 2005 1 commit
  13. 29 Apr, 2005 1 commit
  14. 15 Apr, 2005 1 commit
  15. 14 Mar, 2005 1 commit
  16. 09 Mar, 2005 1 commit
  17. 23 Feb, 2005 1 commit
  18. 18 Jan, 2005 1 commit
  19. 04 Jan, 2005 1 commit
  20. 02 Dec, 2004 1 commit
  21. 11 Nov, 2004 2 commits
  22. 25 Sep, 2004 1 commit
  23. 02 Sep, 2004 1 commit
  24. 31 Aug, 2004 1 commit
  25. 13 Aug, 2004 1 commit
  26. 14 Jul, 2004 1 commit
  27. 13 Jul, 2004 1 commit
  28. 08 Jul, 2004 1 commit
  29. 08 Jun, 2004 1 commit
  30. 19 May, 2004 1 commit
  31. 02 Apr, 2004 1 commit
  32. 20 Nov, 2003 1 commit
  33. 19 Aug, 2003 1 commit
  34. 19 Feb, 2003 1 commit
  35. 04 Feb, 2003 1 commit
  36. 04 Nov, 2002 1 commit
  37. 07 Aug, 2002 1 commit
    • Götz Lindenmaier's avatar
      implemented scc algorithm. Added datastructure to mark · 66f846a2
      Götz Lindenmaier authored
        backedges (ana/backedge.h) and to represent loops
        (ana/irloop.h).  The scc algorithm (ana/irscc.c) builds
        both datastructures.
        The algorithm does not yet work properly for interprocedural
        graphs.  Finds more loops than only recursions.
      
        Improved place_code: now moves nodes out of loops.
        Fixed bug in iropt.c:  wrong parameter in debug info: iropt_dbg.c
        Now flag set_opt_control_flow can be set to 1 again.
      
      [r457]
      66f846a2