| Chris Lattner | 49fec96 | 2001-07-14 06:04:27 +0000 | [diff] [blame] | 1 | * Rewrite the llvm parser/lexer in http://www.antlr.org when time permits. |
| 2 | They actually do C++. Imagine that. |
| Chris Lattner | 05b9a7f | 2001-06-30 06:37:33 +0000 | [diff] [blame] | 3 | * Fix DCE to elminate br <c>, %L1, %L1 so that it can optimize the main of |
| 4 | fib.ll better. Currently I have to do this to get best results: |
| Chris Lattner | 100efcb | 2001-07-03 05:35:04 +0000 | [diff] [blame] | 5 | as < fib.ll | opt -inline -sccp -dce -sccp -dce |dis |
| Chris Lattner | 643ecd4 | 2001-09-07 16:10:35 +0000 | [diff] [blame] | 6 | * fix the constprop br <x> <dst1> <dst1> case. Must handle PHI nodes correctly |
| Chris Lattner | 0305cfd | 2001-06-27 23:24:50 +0000 | [diff] [blame] | 7 | * Think about whether edge split SSA form would be useful to do. |
| Chris Lattner | a4fbb1a | 2001-06-20 23:09:27 +0000 | [diff] [blame] | 8 | * The dropAllReferences code can be a noop when NDEBUG!!! |
| Chris Lattner | db09262 | 2001-06-11 15:03:43 +0000 | [diff] [blame] | 9 | * pred/succ iterators on basic blocks don't handle switch statements correctly |
| Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 10 | * Provide a pass that eliminates critical edges from the CFG |
| Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 11 | * I need to provide an option to the bytecode loader to ignore memory |
| 12 | dependance edges. Instead, the VM would just treat memory operations |
| 13 | (load, store, getfield, putfield, call) as pinned instructions. |
| Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 14 | * Need a way to attach bytecode block info at various levels of asm code. |
| Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 15 | * Recognize and save comments in assembly and bytecode format |
| 16 | * Encode line number table in bytecode (like #line), optional table |
| 17 | |
| 18 | * Encode negative relative offsets in the bytecode file |
| 19 | |
| 20 | * Implement switch to switch on a constant pool array of type: |
| 21 | [{ label, int }] or [label] (lookup vs index switch) |
| 22 | * Apparently bison has a %pure_parser option. Maybe useful for Assembly/Parser |
| 23 | |
| 24 | * Implement a header file that can read either assembly or bytecode, implement |
| 25 | a writer that can output either based on what is read with this reader.. |
| 26 | * Implement the following derived types: |
| Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 27 | * "packed format", like this: [4 x sbyte]: Packed SIMD datatype |
| 28 | * Maybe 'tailcall' also? |
| Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 29 | * Include a method level bytecode block that defines a mapping between values |
| 30 | and registers that defines a minimally register allocated code. This can |
| 31 | make me finally address how to encode extensions in assembly. |
| 32 | * Bytecode reader should use extensions that may or may not be linked into the |
| 33 | application to read blocks. Thus an easy way to ignore symbol table info |
| 34 | would be to not link in that reader into the app. |