[new-regalloc] What is the status on current sources

[Michael Matz]

Hi,

On Sat, 10 Feb 2001, Zack Weinberg wrote:
> 
> There's also the extremely sparse set algorithm from the Morgan book
> (pp. 90-92; cites _ACM Letters on Programming Languages and Systems_
> 2(1-4): 59-69).  This is O(1) for insert, delete, and lookup,
> O(members) for scanning, but needs two ints per set member so it can
> take a lot more memory in the worst case.

Yep, Briggs sparse set representation is only usefull if you have only few
sets, unlike in the interference graph.  I guess, the compressed bitmaps
are fairly optimal for our case.


Ciao,
Michael.