summaryrefslogtreecommitdiffstats
path: root/docs/ChrisNotes.txt
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2001-06-11 15:03:43 +0000
committerChris Lattner <sabre@nondot.org>2001-06-11 15:03:43 +0000
commitdb0926260dae4ea1e6aa1dd90d604eb09bf865d6 (patch)
treeeceee3c946becf78e2ad31acbcd64825ad9d1eee /docs/ChrisNotes.txt
parent477c2ec3e01ddb67c3c079156f2ee2e1858bec42 (diff)
downloadexternal_llvm-db0926260dae4ea1e6aa1dd90d604eb09bf865d6.zip
external_llvm-db0926260dae4ea1e6aa1dd90d604eb09bf865d6.tar.gz
external_llvm-db0926260dae4ea1e6aa1dd90d604eb09bf865d6.tar.bz2
Update documentation to reflect:
* Changes in PHI node structure * Intentions for load instruction to work with structures git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'docs/ChrisNotes.txt')
-rw-r--r--docs/ChrisNotes.txt10
1 files changed, 4 insertions, 6 deletions
diff --git a/docs/ChrisNotes.txt b/docs/ChrisNotes.txt
index ada4b04..6af6115 100644
--- a/docs/ChrisNotes.txt
+++ b/docs/ChrisNotes.txt
@@ -1,7 +1,7 @@
-* Must update PHI node to have a pair between predecessor and value.
+* pred/succ iterators on basic blocks don't handle switch statements correctly
* Enhance BB to make predecessor handling easier (to update PHI nodes)
* Provide a pass that eliminates critical edges from the CFG
-* Provide a print hook to print out xvcg format files for vis
+* Provide a print pass to print out xvcg format files for vis
* I need to provide an option to the bytecode loader to ignore memory
dependance edges. Instead, the VM would just treat memory operations
(load, store, getfield, putfield, call) as pinned instructions.
@@ -13,8 +13,8 @@
structure size to 256 members. This can be fixed later by either:
1. adding varient that takes ushort
2. Splitting structures into nested structures each of half size
- <float> %f = loadfield *{int, {float}} Str, ubyte 1, ubyte 0
- storefield float %f, *{int, {float}} Str, ubyte 1, ubyte 0
+ <float> %f = load *{int, {float}} Str, 1, 0
+ store float %f, *{int, {float}} Str, 1, 0
* I'm noticing me writing a lot of code that looks like this (dtor material here):
ConstPool.dropAllReferences();
ConstPool.delete_all();
@@ -42,8 +42,6 @@
* pointer int *
* "packed format", like this: [4 x sbyte]: Packed SIMD datatype
* Maybe 'tailcall' also?
-* It might be nice to support enumerations of some sort... especially for use
- as a compiler IR
* Include a method level bytecode block that defines a mapping between values
and registers that defines a minimally register allocated code. This can
make me finally address how to encode extensions in assembly.