This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [PATCH]: Efficient sbitmap based bitset
On Wed, Aug 22, 2001 at 02:05:57PM -0400, Daniel Berlin wrote:
> > Which seems more than sufficient. If we need more than 500M bits
> > for a regset, we're in bigger trouble.
> I'm not so sure about that.
> The new register allocator, on 20001226-1.c, creates an interference
> graph bitmatrix of ~300M bits.
> However, i'm not so sure how common code that has 15000 defs in a
> single function is (IE whether we'd hit the limit).
It's not entirely uncommon. Seems like having a provision for
triple indirection is warrented then.
r~