Igor Schein on Wed, 12 Jun 2002 08:40:08 -0400 |
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
Re: 64bit HPUX binary buggy |
On Wed, Jun 12, 2002 at 02:01:59PM +0200, Karim BELABAS wrote: > On Tue, 11 Jun 2002, Igor Schein wrote: > > I compiled a 64bit gp binary on HPUX 11, but it's badly broken - > > a command as simple as bnfinit(x^2-2) keeps doubling the stack. > > I'd like to debug it, but I need some pointers on where to set > > breakpoints, what to look for, etc. > > Well, you can hardly call 'bnfinit' a "simple" command. > Anything simpler breaking ? In 'make bench' for instance (avoiding the > 'nfields' one), what benches are failing ? For what reason ? > > Esp. > > 1) is basic arithmetic right, e.g > (13:54) gp > nextprime(10^9) \\ 1000000007 > > 2) floating point ? (3.14, 1.2 * 3.4, sqrt(2), Pi, ...) > > 3) (tougher, but still sensible): polroots(), mathnf(). > > 4) then nfinit(), and number field stuff. You can check that nfinit(x^2-2) > gives the exact same answer on your HP and on a better supported > architecture. nfinit(x^2-2) and other simpler commands work fine and yield the same result as on other 64bit architectures. It's specifically bnfinit() that is completely shut down. All diffs in make bench are related to bnfinit() not working. > > P.S: Btw, HP cc + portable kernel, I gather ? gcc + portable kernel - I don't have ANSI cc for HPUX. Igor