Re: Data structure documentation & BUG?

[Guy Laden <laden@math.tau.ac.il>]

I forgot an obvious stage in the simple storage allocator I described
in my previous msg:
i think that before doing all the rest, a traversal of the region's
instructions must be done, and for each gate, a location
must be set that is the same for all of the different paths.
ie: for each gate, we allocate a new location. then, 
we must traverse the useList for each of the gate's operands,
setting it's location to the newly allocated one.

guy.