On Tue, Feb 19, 2013 at 04:08:57PM +0100, Richard Biener wrote:
> Well, I used the lame variant to avoid a zero argument to ceil_log2 ...
> I'll use yours instead.
>
> Ok?
Yep.
Jakub
On Tue, 19 Feb 2013, Jakub Jelinek wrote:
> On Tue, Feb 19, 2013 at 02:59:46PM +0100, Richard Biener wrote:
> > This speeds up IVOPTs by optimizing its hottest function when compiling
> > polyhedron linpk. The datastructure used for recording use, candidate
> > costs (a hashtable) should make O(1
On Tue, Feb 19, 2013 at 02:59:46PM +0100, Richard Biener wrote:
> This speeds up IVOPTs by optimizing its hottest function when compiling
> polyhedron linpk. The datastructure used for recording use, candidate
> costs (a hashtable) should make O(1) queries on average - but it turns
> out that for
