Jason Moxham on Sat, 04 Jul 2009 22:34:19 +0200

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

 Re: Some bugs?

----- Original Message ----- From: "Bill Allombert" <Bill.Allombert@math.u-bordeaux1.fr>
To: <pari-dev@list.cr.yp.to>
Sent: Saturday, July 04, 2009 9:17 PM
Subject: Re: Some bugs?


On Sat, Jul 04, 2009 at 08:31:40PM +0100, Jason Moxham wrote:



On Sat, Jul 04, 2009 at 12:24:00PM +0100, Jason Moxham wrote:

On Thursday 02 July 2009 23:11:31 Jason Moxham wrote:
I manage to get rid of a few more bugs, and I'm left with these

polred,rnf,rnfkummer all have this error

x^7 + Mod(7*y - 7, y^2 - y - 1)*x^6 + Mod(-21*y + 28, y^2 - y -
1)*x^5 - 35*
x^4 + Mod(35*y - 49, y^2 - y - 1)*x^3 + Mod(-7*y + 84, y^2 - y -
1)*x^2 + Mo
d(-14*y + 21, y^2 - y - 1)*x + Mod(-y - 43, y^2 - y - 1)
***   at top-level: rnfpolredabs(nfinit(
***                 ^--------------------
*** rnfpolredabs: could not open requested file ./MPQS.gpa/FREL.


There might a problem with the way MPQS creates temporary files.
Try factor(2^128+1)
The code to create temporary files is in src/language/es.c.
Maybe we use a wrong directory or a wrong filename.



Yes it is , mpqs assumes the function below creates the directory as well
as testing existence

line 4175 in language/es.c
static int
pari_dir_exists(const char *s) { return 0; }

change to

static int
pari_dir_exists(const char *s) { return mkdir(s); }

So this is the same as the UNIX one but without the mode
So I suppose we will need this for MSVC and MinGW


Well, the code is fundamentally flawed. This need to be improved.
There is no excuse for a function 'pari_dir_exists' to create a directory.
We should improve that part.


this fixes polred,rnf,rnfkummer  tests for Win32 MSVC


Good!

Bill.


And it also changes the errors for the last two failures

ffisom test  with a bit of debug

C:\Users\jasonadmin\parisvn-msvc32nogmp>type src\test\in\ffisom | gp.exe
GP/PARI CALCULATOR Version 2.4.3 (development svn-11782)
ix86 running Windows 3.2 (ix86 kernel) 32-bit version
compiled: Jul  4 2009, MSVC-1500
(readline not compiled in, extended help not enabled)

Copyright (C) 2000-2008 The PARI Group


PARI/GP is free software, covered by the GNU General Public License, and comes
WITHOUT ANY WARRANTY WHATSOEVER.

Type ? for help, \q to quit.
Type ?12 for how to get moral (and possibly technical) support.

parisize = 4000000, primelimit = 500509
debug = 4
***   Warning: compiler generates copy for a'.
***   Warning: compiler generates copy for l'.
***   Warning: compiler generates copy for P'.
***   Warning: compiler generates copy for Q'.
-------------e=0--------------
Time FpM_ker: 0
Time Fp_sqrtn: 0
[0, 0, 0, 0]
Time FpM_ker: 0
Time Fp_sqrtn: 0
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Time pol[Frobenius]: 0
Time U[Frobenius]: 0
Time matrix polcyclo: 0
Time pol[Frobenius]: 0
Time U[Frobenius]: 15
Time matrix polcyclo: 0
Time pows [P,Q]: 0
Time FpXQ_sqrtn: 0
[0, 0, 0]
Time pol[Frobenius]: 0
Time U[Frobenius]: 0
Time matrix polcyclo: 0
Time pol[Frobenius]: 0
Time U[Frobenius]: 0
Time matrix polcyclo: 0
Time pows [P,Q]: 0
Time FpXQ_sqrtn: 0
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Time FpM_ker: 0
Time Fp_sqrtn: 0
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Time pol[Frobenius]: 0
Time U[Frobenius]: 0
Time matrix polcyclo: 0
Time pol[Frobenius]: 0
Time U[Frobenius]: 0
Time matrix polcyclo: 0
Time pows [P,Q]: 0
Time FpXQ_sqrtn: 0
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Time pol[Frobenius]: 0
Time U[Frobenius]: 0
Time matrix polcyclo: 0
Time pol[Frobenius]: 0
Time U[Frobenius]: 0
Time matrix polcyclo: 0
Time pows [P,Q]: 0
Time FpXQ_sqrtn: 0
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
***   at top-level: ...Mod(1,10007)*(x^30+9557*x^29+7812*x^28+7090*x
***                                             ^--------------------
*** _^s: degree overflow in pow_monome.
Time pol[Frobenius]: 0
Time U[Frobenius]: 0
Time matrix polcyclo: 0
Time pol[Frobenius]: 0
Time U[Frobenius]: 0
Time matrix polcyclo: 0
Time pows [P,Q]: 0
Time FpXQ_sqrtn: 0

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
, 0, 0, 0]
-------------e=1--------------
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Time FpM_ker: 0
Time Fp_sqrtn: 0
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]

for this bit
***   at top-level: ...Mod(1,10007)*(x^30+9557*x^29+7812*x^28+7090*x
***                                             ^--------------------
*** _^s: degree overflow in pow_monome.

the ^------------------   points to the x^29

Jason



• Follow-Ups:
• Re: Some bugs?
• From: Bill Allombert <Bill.Allombert@math.u-bordeaux1.fr>
• References:
• Some bugs?
• From: "Jason Moxham" <jason@njkfrudils.plus.com>
• Re: Some bugs?
• From: Bill Allombert <Bill.Allombert@math.u-bordeaux1.fr>
• Re: Some bugs?
• From: "Jason Moxham" <jason@njkfrudils.plus.com>
• Re: Some bugs?
• From: Jason Moxham <jason@njkfrudils.plus.com>
• Re: Some bugs?
• From: Bill Allombert <Bill.Allombert@math.u-bordeaux1.fr>
• Re: Some bugs?
• From: "Jason Moxham" <jason@njkfrudils.plus.com>
• Re: Some bugs?
• From: Bill Allombert <Bill.Allombert@math.u-bordeaux1.fr>