From: Jakub Narebski <jnareb@gmail.com>
Date: Mon, 16 Oct 2006 20:29:57 GMT
Subject: Re: git-diff-tree inordinately (O(M*N)) slow on files with many changes
Message-ID: <eh0q39$mb$1@sea.gmane.org>
In-Reply-To: <Pine.LNX.4.64.0610161225470.7697@alien.or.mcafeemobile.com>

Davide Libenzi wrote:

> I ended up using this one:
> 
> #define XDL_HASHLONG(v, b) ((((unsigned long) (v) >> ((CHAR_BIT *
sizeof(unsigned long)) - (b))) + \
>                             (unsigned long) (v)) & ((1UL << (b)) - 1))
> 
> The GR_PRIME selection does not make me feel good, and the 'static inline' 
> is puked-over by certain C compilers. It'd be probably fine to just use a 
> simple function, though the above should work just fine.
> 
> real    0m0.665s
> user    0m0.655s
> sys     0m0.010s
> 
> (Opteron 252)

Could you please do and post benchmarks for other solutions?
-- 
Jakub Narebski
Warsaw, Poland
ShadeHawk on #git