| version 1.57, 2010/05/01 02:17:49 |
version 1.60, 2015/08/08 14:19:41 |
|
|
| * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
| * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
| * |
* |
| * $OpenXM: OpenXM_contrib2/asir2000/builtin/dp-supp.c,v 1.56 2009/10/15 07:08:40 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/dp-supp.c,v 1.59 2013/11/05 02:55:03 noro Exp $ |
| */ |
*/ |
| #include "ca.h" |
#include "ca.h" |
| #include "base.h" |
#include "base.h" |
| Line 399 void dp_ptozp_d(DP p,DP *rp) |
|
| Line 399 void dp_ptozp_d(DP p,DP *rp) |
|
| if ( 0 ) |
if ( 0 ) |
| fprintf(stderr,"(%d,%d)",p_mag((P)d0)-blen,blen); |
fprintf(stderr,"(%d,%d)",p_mag((P)d0)-blen,blen); |
| } |
} |
| |
#if defined(__MINGW32__) || defined(__MINGW64__) |
| |
fflush(stderr); |
| |
#endif |
| } |
} |
| |
|
| void dp_ptozp2_d(DP p0,DP p1,DP *hp,DP *rp) |
void dp_ptozp2_d(DP p0,DP p1,DP *hp,DP *rp) |
| Line 651 void dp_sp(DP p1,DP p2,DP *rp) |
|
| Line 654 void dp_sp(DP p1,DP p2,DP *rp) |
|
| LIST hist; |
LIST hist; |
| NODE node; |
NODE node; |
| |
|
| node = mknode(4,ONE,0,s1,ONE); |
node = mknode(4,ONE,NULLP,s1,ONE); |
| MKLIST(hist,node); |
MKLIST(hist,node); |
| MKNODE(TraceList,hist,0); |
MKNODE(TraceList,hist,0); |
| |
|
| node = mknode(4,ONE,0,0,ONE); |
node = mknode(4,ONE,NULLP,NULLP,ONE); |
| chsgnd(s2,(DP *)&ARG2(node)); |
chsgnd(s2,(DP *)&ARG2(node)); |
| MKLIST(hist,node); |
MKLIST(hist,node); |
| MKNODE(node,hist,TraceList); TraceList = node; |
MKNODE(node,hist,TraceList); TraceList = node; |
| Line 704 void _dp_sp_dup(DP p1,DP p2,DP *rp) |
|
| Line 707 void _dp_sp_dup(DP p1,DP p2,DP *rp) |
|
| LIST hist; |
LIST hist; |
| NODE node; |
NODE node; |
| |
|
| node = mknode(4,ONE,0,s1,ONE); |
node = mknode(4,ONE,NULLP,s1,ONE); |
| MKLIST(hist,node); |
MKLIST(hist,node); |
| MKNODE(TraceList,hist,0); |
MKNODE(TraceList,hist,0); |
| |
|
| node = mknode(4,ONE,0,0,ONE); |
node = mknode(4,ONE,NULLP,NULLP,ONE); |
| chsgnd(s2,(DP *)&ARG2(node)); |
chsgnd(s2,(DP *)&ARG2(node)); |
| MKLIST(hist,node); |
MKLIST(hist,node); |
| MKNODE(node,hist,TraceList); TraceList = node; |
MKNODE(node,hist,TraceList); TraceList = node; |
| Line 1249 DP *dp_true_nf_and_quotient_marked (NODE b,DP g,DP *ps |
|
| Line 1252 DP *dp_true_nf_and_quotient_marked (NODE b,DP g,DP *ps |
|
| |
|
| dn = (P)ONE; |
dn = (P)ONE; |
| if ( !g ) { |
if ( !g ) { |
| *rp = 0; *dnp = dn; return; |
*rp = 0; *dnp = dn; return 0; |
| } |
} |
| for ( n = 0, l = b; l; l = NEXT(l), n++ ); |
for ( n = 0, l = b; l; l = NEXT(l), n++ ); |
| wb = (int *)ALLOCA(n*sizeof(int)); |
wb = (int *)ALLOCA(n*sizeof(int)); |
| Line 1306 DP *dp_true_nf_and_quotient_marked_mod(NODE b,DP g,DP |
|
| Line 1309 DP *dp_true_nf_and_quotient_marked_mod(NODE b,DP g,DP |
|
| for ( i = 0; i < n; i++ ) q[i] = 0; |
for ( i = 0; i < n; i++ ) q[i] = 0; |
| dn = (P)ONEM; |
dn = (P)ONEM; |
| if ( !g ) { |
if ( !g ) { |
| *rp = 0; *dnp = dn; return; |
*rp = 0; *dnp = dn; return 0; |
| } |
} |
| wb = (int *)ALLOCA(n*sizeof(int)); |
wb = (int *)ALLOCA(n*sizeof(int)); |
| for ( i = 0, l = b; i < n; l = NEXT(l), i++ ) |
for ( i = 0, l = b; i < n; l = NEXT(l), i++ ) |
| Line 2551 void _print_mp(int nv,MP m) |
|
| Line 2554 void _print_mp(int nv,MP m) |
|
| fprintf(stderr,">",C(m)); |
fprintf(stderr,">",C(m)); |
| } |
} |
| fprintf(stderr,"\n"); |
fprintf(stderr,"\n"); |
| |
#if defined(__MINGW32__) || defined(__MINGW64__) |
| |
fflush(stderr); |
| |
#endif |
| } |
} |
| |
|
| static int cmp_mp_nvar; |
static int cmp_mp_nvar; |