#ifndef ASMINLINE
#line 2 "../src/kernel/none/addll.h"
/* $Id: addll.h,v 1.4 2006/04/14 15:26:51 kb Exp $
Copyright (C) 2003 The PARI group.
This file is part of the PARI/GP package.
PARI/GP is free software; you can redistribute it and/or modify it under the
terms of the GNU General Public License as published by the Free Software
Foundation. It is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY WHATSOEVER.
Check the License for details. You should have received a copy of it, along
with the package; see the file 'COPYING'. If not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
/* This file originally adapted from gmp-3.1.1 (from T. Granlund), files
* longlong.h and gmp-impl.h
Copyright (C) 2000 Free Software Foundation, Inc. */
#undef LOCAL_OVERFLOW
#define LOCAL_OVERFLOW
extern ulong overflow;
#if !defined(INLINE)
extern long addll(ulong x, ulong y);
extern long addllx(ulong x, ulong y);
extern long subll(ulong x, ulong y);
extern long subllx(ulong x, ulong y);
#else
#if defined(__GNUC__) && !defined(DISABLE_INLINE)
#undef LOCAL_OVERFLOW
#define LOCAL_OVERFLOW register ulong overflow
#define addll(a, b) \
({ ulong __arg1 = (a), __arg2 = (b), __value = __arg1 + __arg2; \
overflow = (__value < __arg1); \
__value; \
})
#define addllx(a, b) \
({ ulong __arg1 = (a), __arg2 = (b), __value, __tmp = __arg1 + overflow;\
overflow = (__tmp < __arg1); \
__value = __tmp + __arg2; \
overflow |= (__value < __tmp); \
__value; \
})
#define subll(a, b) \
({ ulong __arg1 = (a), __arg2 = (b); \
overflow = (__arg2 > __arg1); \
__arg1 - __arg2; \
})
#define subllx(a, b) \
({ ulong __arg1 = (a), __arg2 = (b), __value, __tmp = __arg1 - overflow;\
overflow = (__arg1 < overflow); \
__value = __tmp - __arg2; \
overflow |= (__arg2 > __tmp); \
__value; \
})
#else /* __GNUC__ */
INLINE long
addll(ulong x, ulong y)
{
const ulong z = x+y;
overflow=(z<x);
return (long) z;
}
INLINE long
addllx(ulong x, ulong y)
{
const ulong z = x+y+overflow;
overflow = (z<x || (z==x && overflow));
return (long) z;
}
INLINE long
subll(ulong x, ulong y)
{
const ulong z = x-y;
overflow = (z>x);
return (long) z;
}
INLINE long
subllx(ulong x, ulong y)
{
const ulong z = x-y-overflow;
overflow = (z>x || (z==x && overflow));
return (long) z;
}
#endif /* __GNUC__ */
#endif
#line 2 "../src/kernel/none/mulll.h"
/* $Id: mulll.h,v 1.4 2006/04/14 15:26:51 kb Exp $
Copyright (C) 2000 The PARI group.
This file is part of the PARI/GP package.
PARI/GP is free software; you can redistribute it and/or modify it under the
terms of the GNU General Public License as published by the Free Software
Foundation. It is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY WHATSOEVER.
Check the License for details. You should have received a copy of it, along
with the package; see the file 'COPYING'. If not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
#undef LOCAL_HIREMAINDER
#define LOCAL_HIREMAINDER
extern ulong hiremainder;
/* Version Peter Montgomery */
/*
* Assume (for presentation) that BITS_IN_LONG = 32.
* Then 0 <= xhi, xlo, yhi, ylo <= 2^16 - 1. Hence
*
* -2^31 + 2^16 <= (xhi-2^15)*(ylo-2^15) + (xlo-2^15)*(yhi-2^15) <= 2^31.
*
* If xhi*ylo + xlo*yhi = 2^32*overflow + xymid, then
*
* -2^32 + 2^16 <= 2^32*overflow + xymid - 2^15*(xhi + ylo + xlo + yhi) <= 0.
*
* 2^16*overflow <= (xhi+xlo+yhi+ylo)/2 - xymid/2^16 <= 2^16*overflow + 2^16-1
*
* This inequality was derived using exact (rational) arithmetic;
* it remains valid when we truncate the two middle terms.
*/
#if !defined(INLINE)
extern long mulll(ulong x, ulong y);
extern long addmul(ulong x, ulong y);
#else
#if defined(__GNUC__) && !defined(DISABLE_INLINE)
#undef LOCAL_HIREMAINDER
#define LOCAL_HIREMAINDER register ulong hiremainder
#define mulll(x, y) \
({ \
const ulong __x = (x), __y = (y);\
const ulong __xlo = LOWWORD(__x), __xhi = HIGHWORD(__x); \
const ulong __ylo = LOWWORD(__y), __yhi = HIGHWORD(__y); \
ulong __xylo,__xymid,__xyhi,__xymidhi,__xymidlo; \
ulong __xhl,__yhl; \
\
__xylo = __xlo*__ylo; __xyhi = __xhi*__yhi; \
__xhl = __xhi+__xlo; __yhl = __yhi+__ylo; \
__xymid = __xhl*__yhl - (__xyhi+__xylo); \
\
__xymidhi = HIGHWORD(__xymid); \
__xymidlo = __xymid << BITS_IN_HALFULONG; \
\
__xylo += __xymidlo; \
hiremainder = __xyhi + __xymidhi + (__xylo < __xymidlo) \
+ ((((__xhl + __yhl) >> 1) - __xymidhi) & HIGHMASK); \
\
__xylo; \
})
#define addmul(x, y) \
({ \
const ulong __x = (x), __y = (y);\
const ulong __xlo = LOWWORD(__x), __xhi = HIGHWORD(__x); \
const ulong __ylo = LOWWORD(__y), __yhi = HIGHWORD(__y); \
ulong __xylo,__xymid,__xyhi,__xymidhi,__xymidlo; \
ulong __xhl,__yhl; \
\
__xylo = __xlo*__ylo; __xyhi = __xhi*__yhi; \
__xhl = __xhi+__xlo; __yhl = __yhi+__ylo; \
__xymid = __xhl*__yhl - (__xyhi+__xylo); \
\
__xylo += hiremainder; __xyhi += (__xylo < hiremainder); \
\
__xymidhi = HIGHWORD(__xymid); \
__xymidlo = __xymid << BITS_IN_HALFULONG; \
\
__xylo += __xymidlo; \
hiremainder = __xyhi + __xymidhi + (__xylo < __xymidlo) \
+ ((((__xhl + __yhl) >> 1) - __xymidhi) & HIGHMASK); \
\
__xylo; \
})
#else
INLINE long
mulll(ulong x, ulong y)
{
const ulong xlo = LOWWORD(x), xhi = HIGHWORD(x);
const ulong ylo = LOWWORD(y), yhi = HIGHWORD(y);
ulong xylo,xymid,xyhi,xymidhi,xymidlo;
ulong xhl,yhl;
xylo = xlo*ylo; xyhi = xhi*yhi;
xhl = xhi+xlo; yhl = yhi+ylo;
xymid = xhl*yhl - (xyhi+xylo);
xymidhi = HIGHWORD(xymid);
xymidlo = xymid << BITS_IN_HALFULONG;
xylo += xymidlo;
hiremainder = xyhi + xymidhi + (xylo < xymidlo)
+ ((((xhl + yhl) >> 1) - xymidhi) & HIGHMASK);
return xylo;
}
INLINE long
addmul(ulong x, ulong y)
{
const ulong xlo = LOWWORD(x), xhi = HIGHWORD(x);
const ulong ylo = LOWWORD(y), yhi = HIGHWORD(y);
ulong xylo,xymid,xyhi,xymidhi,xymidlo;
ulong xhl,yhl;
xylo = xlo*ylo; xyhi = xhi*yhi;
xhl = xhi+xlo; yhl = yhi+ylo;
xymid = xhl*yhl - (xyhi+xylo);
xylo += hiremainder; xyhi += (xylo < hiremainder);
xymidhi = HIGHWORD(xymid);
xymidlo = xymid << BITS_IN_HALFULONG;
xylo += xymidlo;
hiremainder = xyhi + xymidhi + (xylo < xymidlo)
+ ((((xhl + yhl) >> 1) - xymidhi) & HIGHMASK);
return xylo;
}
#endif
#endif
#line 2 "../src/kernel/none/bfffo.h"
/* $Id: bfffo.h,v 1.7 2006/04/14 15:26:51 kb Exp $
Copyright (C) 2000 The PARI group.
This file is part of the PARI/GP package.
PARI/GP is free software; you can redistribute it and/or modify it under the
terms of the GNU General Public License as published by the Free Software
Foundation. It is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY WHATSOEVER.
Check the License for details. You should have received a copy of it, along
with the package; see the file 'COPYING'. If not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
#if !defined(INLINE)
extern int bfffo(ulong x);
#else
#if defined(__GNUC__) && !defined(DISABLE_INLINE)
#ifdef LONG_IS_64BIT
# define bfffo(x) \
({\
static int __bfffo_tabshi[16]={4,3,2,2,1,1,1,1,0,0,0,0,0,0,0,0};\
int __value = BITS_IN_LONG - 4; \
ulong __arg1=(x); \
if (__arg1 & ~0xffffffffUL) {__value -= 32; __arg1 >>= 32;}\
if (__arg1 & ~0xffffUL) {__value -= 16; __arg1 >>= 16;} \
if (__arg1 & ~0x00ffUL) {__value -= 8; __arg1 >>= 8;} \
if (__arg1 & ~0x000fUL) {__value -= 4; __arg1 >>= 4;} \
__value + __bfffo_tabshi[__arg1]; \
})
#else
# define bfffo(x) \
({\
static int __bfffo_tabshi[16]={4,3,2,2,1,1,1,1,0,0,0,0,0,0,0,0};\
int __value = BITS_IN_LONG - 4; \
ulong __arg1=(x); \
if (__arg1 & ~0xffffUL) {__value -= 16; __arg1 >>= 16;} \
if (__arg1 & ~0x00ffUL) {__value -= 8; __arg1 >>= 8;} \
if (__arg1 & ~0x000fUL) {__value -= 4; __arg1 >>= 4;} \
__value + __bfffo_tabshi[__arg1]; \
})
#endif
#else
INLINE int
bfffo(ulong x)
{
static int tabshi[16]={4,3,2,2,1,1,1,1,0,0,0,0,0,0,0,0};
int value = BITS_IN_LONG - 4;
ulong arg1=x;
#ifdef LONG_IS_64BIT
if (arg1 & ~0xffffffffUL) {value -= 32; arg1 >>= 32;}
#endif
if (arg1 & ~0xffffUL) {value -= 16; arg1 >>= 16;}
if (arg1 & ~0x00ffUL) {value -= 8; arg1 >>= 8;}
if (arg1 & ~0x000fUL) {value -= 4; arg1 >>= 4;}
return value + tabshi[arg1];
}
#endif
#endif
#line 2 "../src/kernel/none/divll.h"
/* $Id: divll.h,v 1.11 2006/04/14 15:26:51 kb Exp $
Copyright (C) 2003 The PARI group.
This file is part of the PARI/GP package.
PARI/GP is free software; you can redistribute it and/or modify it under the
terms of the GNU General Public License as published by the Free Software
Foundation. It is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY WHATSOEVER.
Check the License for details. You should have received a copy of it, along
with the package; see the file 'COPYING'. If not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
/* This file originally adapted from gmp-3.1.1 (from T. Granlund), files
* longlong.h and gmp-impl.h
Copyright (C) 2000 Free Software Foundation, Inc. */
#undef LOCAL_HIREMAINDER
#define LOCAL_HIREMAINDER
extern ulong hiremainder;
#if !defined(INLINE)
extern long divll(ulong x, ulong y);
#else
#define __GLUE(hi, lo) (((hi) << BITS_IN_HALFULONG) | (lo))
#define __SPLIT(a, b, c) b = HIGHWORD(a); c = LOWWORD(a)
#define __LDIV(a, b, q, r) q = a / b; r = a - q*b
extern ulong hiremainder;
/* divide (hiremainder * 2^BITS_IN_LONG + n0) by d; assume hiremainder < d.
* Return quotient, set hiremainder to remainder */
#if defined(__GNUC__) && !defined(DISABLE_INLINE)
#undef LOCAL_HIREMAINDER
#define LOCAL_HIREMAINDER register ulong hiremainder
#define divll(n0, d) \
({ \
ulong __d1, __d0, __q1, __q0, __r1, __r0, __m, __n1, __n0; \
ulong __k, __d; \
\
__n1 = hiremainder; __n0 = n0; __d = d; \
if (__n1 == 0) \
{ /* Only one division needed */ \
__LDIV(__n0, __d, __q1, hiremainder); \
} \
else if (__d < LOWMASK) \
{ /* Two half-word divisions */ \
__n1 = __GLUE(__n1, HIGHWORD(__n0)); \
__LDIV(__n1, __d, __q1, __r1); \
__n1 = __GLUE(__r1, LOWWORD(__n0)); \
__LDIV(__n1, __d, __q0, hiremainder); \
__q1 = __GLUE(__q1, __q0); \
} \
else \
{ /* General case */ \
if (__d & HIGHBIT) \
{ \
__k = 0; __SPLIT(__d, __d1, __d0); \
} \
else \
{ \
__k = bfffo(__d); \
__n1 = (__n1 << __k) | (__n0 >> (BITS_IN_LONG - __k)); \
__n0 <<= __k; \
__d = __d << __k; __SPLIT(__d, __d1, __d0); \
} \
__LDIV(__n1, __d1, __q1, __r1); \
__m = __q1 * __d0; \
__r1 = __GLUE(__r1, HIGHWORD(__n0)); \
if (__r1 < __m) \
{ \
__q1--, __r1 += __d; \
if (__r1 >= __d) /* we didn't get carry when adding to __r1 */ \
if (__r1 < __m) __q1--, __r1 += __d; \
} \
__r1 -= __m; \
__LDIV(__r1, __d1, __q0, __r0); \
__m = __q0 * __d0; \
__r0 = __GLUE(__r0, LOWWORD(__n0)); \
if (__r0 < __m) \
{ \
__q0--, __r0 += __d; \
if (__r0 >= __d) \
if (__r0 < __m) __q0--, __r0 += __d; \
} \
hiremainder = (__r0 - __m) >> __k; \
__q1 = __GLUE(__q1, __q0); \
} \
__q1; \
})
#else /* __GNUC__ */
INLINE long
divll(ulong n0, ulong d)
{
ulong __d1, __d0, __q1, __q0, __r1, __r0, __m, __n1, __n0;
ulong __k, __d;
__n1 = hiremainder; __n0 = n0; __d = d;
if (__n1 == 0)
{ /* Only one division needed */
__LDIV(__n0, __d, __q1, hiremainder);
}
else if (__d < LOWMASK)
{ /* Two half-word divisions */
__n1 = __GLUE(__n1, HIGHWORD(__n0));
__LDIV(__n1, __d, __q1, __r1);
__n1 = __GLUE(__r1, LOWWORD(__n0));
__LDIV(__n1, __d, __q0, hiremainder);
__q1 = __GLUE(__q1, __q0);
}
else
{ /* General case */
if (__d & HIGHBIT)
{
__k = 0; __SPLIT(__d, __d1, __d0);
}
else
{
__k = bfffo(__d);
__n1 = (__n1 << __k) | (__n0 >> (BITS_IN_LONG - __k));
__n0 = __n0 << __k;
__d = __d << __k; __SPLIT(__d, __d1, __d0);
}
__LDIV(__n1, __d1, __q1, __r1);
__m = __q1 * __d0;
__r1 = __GLUE(__r1, HIGHWORD(__n0));
if (__r1 < __m)
{
__q1--, __r1 += __d;
if (__r1 >= __d) /* we didn't get carry when adding to __r1 */
if (__r1 < __m) __q1--, __r1 += __d;
}
__r1 -= __m;
__LDIV(__r1, __d1, __q0, __r0);
__m = __q0 * __d0;
__r0 = __GLUE(__r0, LOWWORD(__n0));
if (__r0 < __m)
{
__q0--, __r0 += __d;
if (__r0 >= __d)
if (__r0 < __m) __q0--, __r0 += __d;
}
hiremainder = (__r0 - __m) >> __k;
__q1 = __GLUE(__q1, __q0);
}
return __q1;
}
#endif /* __GNUC__ */
#endif
#endif
#line 2 "../src/kernel/ix86/level0.h"
/* $Id: asm0.h,v 1.3 2006/04/18 17:23:00 kb Exp $
Copyright (C) 2000 The PARI group.
This file is part of the PARI/GP package.
PARI/GP is free software; you can redistribute it and/or modify it under the
terms of the GNU General Public License as published by the Free Software
Foundation. It is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY WHATSOEVER.
Check the License for details. You should have received a copy of it, along
with the package; see the file 'COPYING'. If not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
/* This file defines some "level 0" kernel functions for Intel ix86 */
/* It is intended for use with an external "asm" definition */
/*
ASM addll mulll bfffo divll
*/
#ifdef ASMINLINE
/* Written by Bruno Haible, 1996-1998. */
/* This file can assume the GNU C extensions.
(It is included only if __GNUC__ is defined.) */
/* Use local variables whenever possible. */
#define LOCAL_HIREMAINDER register ulong hiremainder
#define LOCAL_OVERFLOW register ulong overflow
#define addll(a,b) \
({ ulong __value, __arg1 = (a), __arg2 = (b); \
__asm__ ("addl %3,%0 ; adcl %1,%1" \
: "=r" (__value), "=r" (overflow) \
: "0" (__arg1), "g" (__arg2), "1" ((ulong)0) \
: "cc"); \
__value; \
})
#define addllx(a,b) \
({ ulong __value, __arg1 = (a), __arg2 = (b), __temp; \
__asm__ ("subl %5,%2 ; adcl %4,%0 ; adcl %1,%1" \
: "=r" (__value), "=r" (overflow), "=r" (__temp) \
: "0" (__arg1), "g" (__arg2), "g" (overflow), "1" ((ulong)0), "2" ((ulong)0) \
: "cc"); \
__value; \
})
#define subll(a,b) \
({ ulong __value, __arg1 = (a), __arg2 = (b); \
__asm__ ("subl %3,%0 ; adcl %1,%1" \
: "=r" (__value), "=r" (overflow) \
: "0" (__arg1), "g" (__arg2), "1" ((ulong)0) \
: "cc"); \
__value; \
})
#define subllx(a,b) \
({ ulong __value, __arg1 = (a), __arg2 = (b), __temp; \
__asm__ ("subl %5,%2 ; sbbl %4,%0 ; adcl %1,%1" \
: "=r" (__value), "=r" (overflow), "=r" (__temp) \
: "0" (__arg1), "g" (__arg2), "g" (overflow), "1" ((ulong)0), "2" ((ulong)0) \
: "cc"); \
__value; \
})
#define mulll(a,b) \
({ ulong __valuelo, __arg1 = (a), __arg2 = (b); \
__asm__ ("mull %3" \
: "=a" /* %eax */ (__valuelo), "=d" /* %edx */ (hiremainder) \
: "0" (__arg1), "rm" (__arg2)); \
__valuelo; \
})
#define addmul(a,b) \
({ ulong __valuelo, __arg1 = (a), __arg2 = (b), __temp; \
__asm__ ("mull %4 ; addl %5,%0 ; adcl %6,%1" \
: "=a" /* %eax */ (__valuelo), "=&d" /* %edx */ (hiremainder), "=r" (__temp) \
: "0" (__arg1), "rm" (__arg2), "g" (hiremainder), "2" ((ulong)0)); \
__valuelo; \
})
#define divll(a,b) \
({ ulong __value, __arg1 = (a), __arg2 = (b); \
__asm__ ("divl %4" \
: "=a" /* %eax */ (__value), "=d" /* %edx */ (hiremainder) \
: "0" /* %eax */ (__arg1), "1" /* %edx */ (hiremainder), "mr" (__arg2)); \
__value; \
})
#define bfffo(x) \
({ ulong __arg = (x); \
int leading_one_position; \
__asm__ ("bsrl %1,%0" : "=r" (leading_one_position) : "rm" (__arg)); \
31 - leading_one_position; \
})
#endif
syntax highlighted by Code2HTML, v. 0.9.1