Andrew MacLeod <[EMAIL PROTECTED]> writes: > > Do you mean implement this as a single linked list and then to find the > previous instruction, start at the beginning of the block and traverse > forward? Back in the early days of tree-ssa we did such a thing with the > tree iterators. It was too slow. there are many LARGE basic blocks which > make the computation too expensive for any pass that goes backwards > through a block.
In theory you could use xor lists (xor next and prev and if you know one element you can get the other). Problem is that garbage collectors require special casing for them and debuggers need special macros to walk those. -Andi
