[patch] bitmap.c: Speed up bitmap_find_bit.

[Daniel Berlin]

On Thu, 2004-11-25 at 10:06 -0700, Jeffrey A Law wrote:
> On Thu, 2004-11-25 at 11:46 -0500, Diego Novillo wrote:
> > True, but we should also try and optimize the data structure itself.  We
> > can't always avoid random accesses to bitmaps.
> > 
> > Perhaps we should have another instance of bitmaps more streamlined for
> > non-linear references?
> They're call sbitmaps.
> 
So that's what the s stands for :)

Seriously though, most of the bitmaps we are doing random access to are
O(num_ssa_names), and there are max O(num_ssa_names) of them (pt_vars is
an example).

sbitmaps just ain't gonna work there.



> jeff
> 
> 
>