- 17 Jun, 2004 1 commit
-
-
Götz Lindenmaier authored
cgana: bugfix, skip_Tuple rta: improved [r3133]
-
- 15 Jun, 2004 1 commit
-
-
Michael Beck authored
small functions that should be inlined in libFirm are implemented in _t.h files with a __ prefix. Preprocessor magic is used to automatically inline these functions whenever a _t.h file is included instead of a .h file. Note that this magic did not work outside libFirm without accessing _t.h files. [r3085]
-
- 10 Jun, 2004 1 commit
-
-
Götz Lindenmaier authored
[r3047]
-
- 04 Jun, 2004 1 commit
-
-
Andreas Schösser authored
It always walks to Block nodes first. Bug-Fix that prevents walking from floating nodes to blocks. Inserted experimental code to guarantee that CallBegin Nodes are put on the LoopTree first (before the corresponding CallEnd node) but commented it out through the macro "EXPERIMENTAL_LOOP_TREE" for now. [r3013]
-
- 12 May, 2004 1 commit
-
-
Götz Lindenmaier authored
[r2872]
-
- 11 May, 2004 1 commit
-
-
Götz Lindenmaier authored
[r2869]
-
- 03 May, 2004 1 commit
-
-
Andreas Schösser authored
[r2842]
-
- 29 Apr, 2004 1 commit
-
-
Florian Liekweg authored
[r2822]
-
- 28 Apr, 2004 2 commits
-
-
Götz Lindenmaier authored
[r2806]
-
Florian Liekweg authored
[r2800]
-
- 27 Apr, 2004 1 commit
-
-
Götz Lindenmaier authored
faster accesses [r2786]
-
- 24 Mar, 2004 1 commit
-
-
Michael Beck authored
[r2557]
-
- 05 Mar, 2004 1 commit
-
-
Götz Lindenmaier authored
[r2499]
-
- 26 Feb, 2004 1 commit
-
-
Götz Lindenmaier authored
[r2458]
-
- 20 Jan, 2004 1 commit
-
-
Götz Lindenmaier authored
improvements of test bugfix free routines [r2326]
-
- 19 Jan, 2004 1 commit
-
-
Götz Lindenmaier authored
[r2311]
-
- 16 Jan, 2004 1 commit
-
-
Götz Lindenmaier authored
[r2304]
-
- 15 Jan, 2004 2 commits
-
-
Götz Lindenmaier authored
[r2299]
-
Götz Lindenmaier authored
[r2297]
-
- 14 Jan, 2004 1 commit
-
-
Andreas Schösser authored
[r2294]
-
- 13 Jan, 2004 1 commit
-
-
Michael Beck authored
[r2284]
-
- 19 Dec, 2003 2 commits
-
-
Götz Lindenmaier authored
[r2254]
-
Götz Lindenmaier authored
[r2248]
-
- 17 Dec, 2003 1 commit
-
-
Götz Lindenmaier authored
[r2230]
-
- 15 Dec, 2003 1 commit
-
-
Andreas Schösser authored
Loop nodes which have no loop nodes are now eliminated before finishing the tree. [r2224]
-
- 21 Nov, 2003 1 commit
-
-
Michael Beck authored
[r2091]
-
- 19 Aug, 2003 1 commit
-
-
Götz Lindenmaier authored
[r1707]
-
- 26 Jun, 2003 1 commit
-
-
Till Riedel authored
[r1407]
-
- 23 Jun, 2003 1 commit
-
-
Till Riedel authored
[r1385]
-
- 01 May, 2003 1 commit
-
-
Till Riedel authored
[r1115]
-
- 28 Mar, 2003 1 commit
-
-
Götz Lindenmaier authored
[r1006]
-
- 27 Mar, 2003 1 commit
-
-
Andreas Schösser authored
[r1000]
-
- 17 Feb, 2003 1 commit
-
-
Michael Beck authored
[r785]
-
- 04 Feb, 2003 1 commit
-
-
Götz Lindenmaier authored
[r739]
-
- 30 Jan, 2003 1 commit
-
-
Götz Lindenmaier authored
[r674]
-
- 13 Jan, 2003 1 commit
-
-
Sebastian Felis authored
[r593]
-
- 19 Dec, 2002 1 commit
-
-
Götz Lindenmaier authored
Fixed error in backedge: backedge array was not updated when in array was changed. [r564]
-
- 11 Sep, 2002 1 commit
-
-
Götz Lindenmaier authored
interprocedural loops [r471]
-
- 23 Aug, 2002 1 commit
-
-
Boris Boesler authored
[r463]
-
- 07 Aug, 2002 1 commit
-
-
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. [r455]
-