Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | More updates to datalayout description in llvm BE | David Terei | 2010-06-22 | 1 | -7/+9 | |
| | ||||||
* | Update datalayout info in llvm BE | David Terei | 2010-06-22 | 1 | -2/+2 | |
| | ||||||
* | Fix handling of float literals in llvm BE | David Terei | 2010-06-22 | 1 | -1/+11 | |
| | ||||||
* | Declare some top level globals to be constant when appropriate | David Terei | 2010-06-21 | 9 | -102/+89 | |
| | | | | | | | This involved removing the old constant handling mechanism which was fairly hard to use. Now being constant or not is simply a property of a global variable instead of a separate type. | |||||
* | Reduce the number of passes over the cmm in llvm BE | David Terei | 2010-06-21 | 4 | -113/+71 | |
| | ||||||
* | Fix negate op not working for -0 in llvm backend | David Terei | 2010-06-21 | 3 | -18/+11 | |
| | ||||||
* | Add win32 datalayout support to llvm backend | David Terei | 2010-06-18 | 1 | -3/+6 | |
| | ||||||
* | Add support of TNTC to llvm backend | David Terei | 2010-06-18 | 9 | -241/+292 | |
| | | | | | | | We do this through a gnu as feature called subsections, where you can put data/code into a numbered subsection and those subsections will be joined together in descending order by gas at compile time. | |||||
* | Add new LLVM code generator to GHC. (Version 2) | David Terei | 2010-06-15 | 10 | -0/+2928 | |
This was done as part of an honours thesis at UNSW, the paper describing the work and results can be found at: http://www.cse.unsw.edu.au/~pls/thesis/davidt-thesis.pdf A Homepage for the backend can be found at: http://hackage.haskell.org/trac/ghc/wiki/Commentary/Compiler/Backends/LLVM Quick summary of performance is that for the 'nofib' benchmark suite, runtimes are within 5% slower than the NCG and generally better than the C code generator. For some code though, such as the DPH projects benchmark, the LLVM code generator outperforms the NCG and C code generator by about a 25% reduction in run times. |