blob: f733a559345e41a0b78b15299a6e9c3d845d108d [file] [log] [blame]
Chris Lattnera4fbb1a2001-06-20 23:09:27 +00001* The dropAllReferences code can be a noop when NDEBUG!!!
Chris Lattner1ffbbf42001-06-20 19:26:00 +00002* Finish xvcg output
Chris Lattnerdb092622001-06-11 15:03:43 +00003* pred/succ iterators on basic blocks don't handle switch statements correctly
Chris Lattner753bfec2001-06-07 16:58:13 +00004* Enhance BB to make predecessor handling easier (to update PHI nodes)
Chris Lattner00950542001-06-06 20:29:01 +00005* Provide a pass that eliminates critical edges from the CFG
Chris Lattnerdb092622001-06-11 15:03:43 +00006* Provide a print pass to print out xvcg format files for vis
Chris Lattner00950542001-06-06 20:29:01 +00007* I need to provide an option to the bytecode loader to ignore memory
8 dependance edges. Instead, the VM would just treat memory operations
9 (load, store, getfield, putfield, call) as pinned instructions.
10* I need to have a way to prevent taking the address of a constant pool
11 reference. You should only be able to take the address of a variable.
12 Maybe taking the address of a constant copies it? What about virtual
13 function tables? Maybe a const pointer would be better...
14* Structures should be accessed something like this: ubyte is ok. Limits
15 structure size to 256 members. This can be fixed later by either:
16 1. adding varient that takes ushort
17 2. Splitting structures into nested structures each of half size
Chris Lattnerdb092622001-06-11 15:03:43 +000018 <float> %f = load *{int, {float}} Str, 1, 0
19 store float %f, *{int, {float}} Str, 1, 0
Chris Lattner00950542001-06-06 20:29:01 +000020* I'm noticing me writing a lot of code that looks like this (dtor material here):
21 ConstPool.dropAllReferences();
22 ConstPool.delete_all();
23 ConstPool.setParent(0);
24 ~ConstPool
25
26* Need a way to attach bytecode block info at various levels of asm code.
27* Rename "ConstantPool" to "ConstPool"
28* Maybe ConstantPool objects should keep themselves sorted as things are
29 inserted.
30* Need to be able to inflate recursive types. %x = { *%x }, %x = %x ()
31* Recognize and save comments in assembly and bytecode format
32* Encode line number table in bytecode (like #line), optional table
33
34* Encode negative relative offsets in the bytecode file
35
36* Implement switch to switch on a constant pool array of type:
37 [{ label, int }] or [label] (lookup vs index switch)
38* Apparently bison has a %pure_parser option. Maybe useful for Assembly/Parser
39
40* Implement a header file that can read either assembly or bytecode, implement
41 a writer that can output either based on what is read with this reader..
42* Implement the following derived types:
43 * structure/record { int %foo, int %bar} or { %foo = int, int }
44 * pointer int *
45 * "packed format", like this: [4 x sbyte]: Packed SIMD datatype
46* Maybe 'tailcall' also?
Chris Lattner00950542001-06-06 20:29:01 +000047* Include a method level bytecode block that defines a mapping between values
48 and registers that defines a minimally register allocated code. This can
49 make me finally address how to encode extensions in assembly.
50* Bytecode reader should use extensions that may or may not be linked into the
51 application to read blocks. Thus an easy way to ignore symbol table info
52 would be to not link in that reader into the app.