toplev.c (floor_log2_wide): Replace loop with faster bit operations.
* toplev.c (floor_log2_wide): Replace loop with faster bit operations. (exact_log2_wide): Define in terms of the above. * toplev.h (floor_log2): Use _builtin_clz family of builtins if available. From-SVN: r82778
This commit is contained in:
parent
3b48085e66
commit
73d10efa86
3 changed files with 65 additions and 22 deletions
|
@ -1,3 +1,11 @@
|
|||
2004-06-08 DJ Delorie <dj@redhat.com>
|
||||
|
||||
* toplev.c (floor_log2_wide): Replace loop with faster bit
|
||||
operations.
|
||||
(exact_log2_wide): Define in terms of the above.
|
||||
* toplev.h (floor_log2): Use _builtin_clz family of builtins if
|
||||
available.
|
||||
|
||||
2004-06-08 Andrew Pinski <pinskia@physics.uc.edu>
|
||||
|
||||
* config/rs6000/rs6000.c (print_operand, <case 'z'>):
|
||||
|
|
56
gcc/toplev.c
56
gcc/toplev.c
|
@ -1248,23 +1248,6 @@ read_integral_parameter (const char *p, const char *pname, const int defval)
|
|||
return atoi (p);
|
||||
}
|
||||
|
||||
/* Return the logarithm of X, base 2, considering X unsigned,
|
||||
if X is a power of 2. Otherwise, returns -1.
|
||||
|
||||
This should be used via the `exact_log2' macro. */
|
||||
|
||||
int
|
||||
exact_log2_wide (unsigned HOST_WIDE_INT x)
|
||||
{
|
||||
int log = 0;
|
||||
/* Test for 0 or a power of 2. */
|
||||
if (x == 0 || x != (x & -x))
|
||||
return -1;
|
||||
while ((x >>= 1) != 0)
|
||||
log++;
|
||||
return log;
|
||||
}
|
||||
|
||||
/* Given X, an unsigned number, return the largest int Y such that 2**Y <= X.
|
||||
If X is 0, return -1.
|
||||
|
||||
|
@ -1273,11 +1256,40 @@ exact_log2_wide (unsigned HOST_WIDE_INT x)
|
|||
int
|
||||
floor_log2_wide (unsigned HOST_WIDE_INT x)
|
||||
{
|
||||
int log = -1;
|
||||
while (x != 0)
|
||||
log++,
|
||||
x >>= 1;
|
||||
return log;
|
||||
int t=0;
|
||||
if (x == 0)
|
||||
return -1;
|
||||
if (sizeof (HOST_WIDE_INT)*8 > 64)
|
||||
if (x >= (unsigned HOST_WIDE_INT)(1 << (t+64)))
|
||||
t += 64;
|
||||
if (sizeof (HOST_WIDE_INT)*8 > 32)
|
||||
if (x >= (unsigned HOST_WIDE_INT)(1 << (t+32)))
|
||||
t += 32;
|
||||
if (x >= (unsigned HOST_WIDE_INT)(1 << (t+16)))
|
||||
t += 16;
|
||||
if (x >= (unsigned HOST_WIDE_INT)(1 << (t+8)))
|
||||
t += 8;
|
||||
if (x >= (unsigned HOST_WIDE_INT)(1 << (t+4)))
|
||||
t += 4;
|
||||
if (x >= (unsigned HOST_WIDE_INT)(1 << (t+2)))
|
||||
t += 2;
|
||||
if (x >= (unsigned HOST_WIDE_INT)(1 << (t+1)))
|
||||
t += 1;
|
||||
return t;
|
||||
}
|
||||
|
||||
/* Return the logarithm of X, base 2, considering X unsigned,
|
||||
if X is a power of 2. Otherwise, returns -1.
|
||||
|
||||
This should be used via the `exact_log2' macro. */
|
||||
|
||||
int
|
||||
exact_log2_wide (unsigned HOST_WIDE_INT x)
|
||||
{
|
||||
/* Test for 0 or a power of 2. */
|
||||
if (x == 0 || x != (x & -x))
|
||||
return -1;
|
||||
return floor_log2_wide (x);
|
||||
}
|
||||
|
||||
/* Handler for fatal signals, such as SIGSEGV. These are transformed
|
||||
|
|
23
gcc/toplev.h
23
gcc/toplev.h
|
@ -152,7 +152,30 @@ extern bool fast_math_flags_set_p (void);
|
|||
|
||||
#ifndef exact_log2
|
||||
#define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
|
||||
|
||||
#if (__GNUC__ * 1000 + __GNUC_MINOR__) >= 3004
|
||||
#if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONGLONG
|
||||
#define FL2T__ HOST_WIDE_INT
|
||||
#define FL2T_CLZ__ __builtin_clzll
|
||||
#else
|
||||
#if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
|
||||
#define FL2T__ HOST_WIDE_INT
|
||||
#define FL2T_CLZ__ __builtin_clzl
|
||||
#else
|
||||
#define FL2T__ int
|
||||
#define FL2T_CLZ__ __builtin_clz
|
||||
#endif
|
||||
#endif
|
||||
static inline int floor_log2(FL2T__ n)
|
||||
{
|
||||
if (n)
|
||||
return (sizeof(FL2T__)*8-1) - (int)FL2T_CLZ__(n);
|
||||
return -1;
|
||||
}
|
||||
#else
|
||||
#define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
|
||||
#endif
|
||||
|
||||
#endif
|
||||
extern int exact_log2_wide (unsigned HOST_WIDE_INT);
|
||||
extern int floor_log2_wide (unsigned HOST_WIDE_INT);
|
||||
|
|
Loading…
Add table
Reference in a new issue