-
Notifications
You must be signed in to change notification settings - Fork 0
/
Pari.xs
4043 lines (3518 loc) · 82.5 KB
/
Pari.xs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#ifdef _WIN32 /* including windows.h later leads to macro name collisions */
# define WIN32_LEAN_AND_MEAN
# include <windows.h>
#endif
# include <pari.h>
# include <graph/rect.h>
# include <language/anal.h>
#ifdef HAVE_PARIPRIV
# include <headers/paripriv.h>
#endif
# include <gp/gp.h> /* init_opts */
/* On some systems /usr/include/sys/dl.h attempts to declare
ladd which pari.h already defined with a different meaning.
It is not clear whether this is a correct fix...
*/
#undef ladd
#define PERL_POLLUTE /* We use older varnames */
#ifdef __cplusplus
extern "C" {
#endif
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"
#include "func_codes.h"
#ifdef __cplusplus
}
#endif
#if !defined(na) && defined(PERL_VERSION) && (PERL_VERSION > 7) /* Added in 6 (???), Removed in 13 */
# define na PL_na
# define sv_no PL_sv_no
# define sv_yes PL_sv_yes
#endif
#if PARI_VERSION_EXP < 2002012
void init_defaults(int force); /* Probably, will never be fixed in 2.1.* */
#endif
/* This should not be defined at this moment, but in 5.001n is. */
#ifdef coeff
# undef coeff
#endif
#ifdef warner
# undef warner
#endif
/* $Id: Pari.xs,v 1.7 1995/01/23 18:50:58 ilya Exp ilya $ */
/* dFUNCTION should be the last declaration! */
#ifdef __cplusplus
#define VARARG ...
#else
#define VARARG
#endif
#define dFUNCTION(retv) retv (*FUNCTION)(VARARG) = \
(retv (*)(VARARG)) XSANY.any_dptr
#if DEBUG_PARI
static int pari_debug = 0;
# define RUN_IF_DEBUG_PARI(a) \
do { if (pari_debug) {a;} } while (0)
# define PARI_DEBUG_set(d) ((pari_debug = (d)), 1)
# define PARI_DEBUG() (pari_debug)
#else
# define RUN_IF_DEBUG_PARI(a)
# define PARI_DEBUG_set(d) (0)
# define PARI_DEBUG(d) (0)
#endif
#define DO_INTERFACE(inter) math_pari_subaddr = CAT2(XS_Math__Pari_interface, inter)
#define CASE_INTERFACE(inter) case inter: \
DO_INTERFACE(inter); break
#ifndef XSINTERFACE_FUNC_SET /* Not in 5.004_04 */
# define XSINTERFACE_FUNC_SET(cv,f) \
CvXSUBANY(cv).any_dptr = (void (*) (void*))(f)
#endif
#ifndef SvPV_nolen
STRLEN n___a;
# define SvPV_nolen(sv) SvPV((sv),n___a)
#endif
#ifndef PERL_UNUSED_VAR
# define PERL_UNUSED_VAR(var) if (0) var = var
#endif
/* Here is the rationals for managing SVs which keep GENs: when newly
created SVs from GENs on stack, the same moved to heap, and
originally from heap. We assume that we do not need to free stuff
that was originally on heap. However, we need to free the stuff we
moved from the stack ourself.
Here is how we do it: The variables that were initially off stack
have SvPVX == GENheap.
The variables that were moved from the stack have SvPVX ==
GENmovedOffStack.
If the variable is on stack, and it is the oldest one which is on
stack, then SvPVX == GENfirstOnStack.
Otherwise SvPVX is the next older SV that refers to a GEN on stack.
In the last two cases SvCUR is the offset on stack of the stack
frame on the entry into the function for which SV is the argument.
*/
#ifndef USE_SLOW_NARGS_ACCESS
# define USE_SLOW_NARGS_ACCESS (defined(PERL_VERSION) && (PERL_VERSION > 9))
#endif
#if USE_SLOW_NARGS_ACCESS
# define PARI_MAGIC_TYPE ((char)0xDE)
# define PARI_MAGIC_PRIVATE 0x2020
/* Can't return IV, since may not fit in mg_ptr;
However, we use it to store numargs, and result of gclone() */
static void**
PARI_SV_to_voidpp(SV *const sv)
{
MAGIC *mg;
for (mg = SvMAGIC(sv); mg; mg = mg->mg_moremagic) {
if (mg->mg_type == PARI_MAGIC_TYPE
&& mg->mg_private == PARI_MAGIC_PRIVATE)
return (void **) &mg->mg_ptr;
}
croak("panic: PARI narg value not attached");
return NULL;
}
# define PARI_SV_to_intp(sv) ((int*)PARI_SV_to_voidpp(sv))
static void
SV_myvoidp_set(SV *sv, void *p)
{
MAGIC *mg;
mg = sv_magicext((SV*)sv, NULL, PARI_MAGIC_TYPE, NULL, p, 0);
mg->mg_private = PARI_MAGIC_PRIVATE;
}
# define SV_myvoidp_reset_clone(sv) \
STMT_START { \
if(SvTYPE(sv) == SVt_PVAV) { \
void **p = PARI_SV_to_voidpp(sv); \
*p = (void*) gclone((GEN)*p); \
} else { \
SV_myvoidp_reset_clone_IVX(sv); \
} } STMT_END
/* Should be applied to SV* and AV* only */
# define SV_myvoidp_get(sv) \
((SvTYPE(sv) == SVt_PVAV) ? *PARI_SV_to_voidpp(sv) : INT2PTR(void*,SvIV(sv)))
# define CV_myint_get(sv) INT2PTR(int, *PARI_SV_to_voidpp(sv))
# define CV_myint_set(sv,i) SV_myvoidp_set((sv), INT2PTR(void*,i))
#else /* !USE_SLOW_NARGS_ACCESS */
# define CV_myint_get(sv) SvIVX(sv) /* IVOK is not set! */
# define CV_myint_set(sv, i) (SvIVX(sv) = (i))
# define SV_myvoidp_get(sv) INT2PTR(void*, SvIVX(sv))
# define SV_myvoidp_set(sv, p) (SvIVX(sv) = PTR2IV(p))
# define SV_myvoidp_reset_clone SV_myvoidp_reset_clone_IVX
#endif
#define SV_myvoidp_reset_clone_IVX(sv) (SvIVX(sv) = PTR2IV(gclone(INT2PTR(GEN, SvIV(sv)))))
#define CV_NUMARGS_get CV_myint_get
#define CV_NUMARGS_set CV_myint_set
#ifndef USE_SLOW_ARRAY_ACCESS
# define USE_SLOW_ARRAY_ACCESS (defined(PERL_VERSION) && (PERL_VERSION > 9))
#endif
#if USE_SLOW_ARRAY_ACCESS
/* 5.9.x and later assert that you're not using SvPVX() and SvCUR() on arrays,
so need a little more code to cheat round this. */
# define NEED_SLOW_ARRAY_ACCESS(sv) (SvTYPE(sv) == SVt_PVAV)
# define AV_SET_LEVEL(sv, val) (AvARRAY(sv) = (SV **)(val))
# define AV_GET_LEVEL(sv) ((char*)AvARRAY(sv))
#else
# define NEED_SLOW_ARRAY_ACCESS(sv) 0
# define AV_SET_LEVEL(sv, val) croak("Panic AV LEVEL") /* This will never be called */
# define AV_GET_LEVEL(sv) (croak("Panic AV LEVEL"),Nullch) /* This will never be called */
#endif
/* XXXX May need a flavor when we know it is an AV??? */
#define SV_PARISTACK_set(sv, stack) \
(NEED_SLOW_ARRAY_ACCESS(sv) ? ( \
AV_SET_LEVEL(sv, stack), (void)0 \
) : ( \
SvPVX(sv) = stack, (void)0 \
))
#define SV_OAVMA_PARISTACK_set(sv, level, stack) \
(NEED_SLOW_ARRAY_ACCESS(sv) ? ( \
AvFILLp(sv) = (level), \
AV_SET_LEVEL(sv, (stack)), (void)0 \
) : ( \
SvCUR(sv) = (level), \
SvPVX(sv) = (char*)(stack), (void)0 \
))
#define SV_OAVMA_PARISTACK_get(sv, level, stack) \
(NEED_SLOW_ARRAY_ACCESS(sv) ? ( \
(level) = AvFILLp(sv), \
(stack) = AV_GET_LEVEL(sv), (void)0 \
) : ( \
(level) = SvCUR(sv), \
(stack) = SvPVX(sv), (void)0 \
))
#define SV_OAVMA_switch(next, sv, newval) \
( NEED_SLOW_ARRAY_ACCESS(sv) ? ( \
(next) = (SV *)AvARRAY(sv), \
AV_SET_LEVEL(sv, newval), (void)0 \
) : ( \
next = (SV *) SvPVX(sv), \
SvPVX(sv) = newval, (void)0 \
))
#define GENmovedOffStack ((char*) 1) /* Just an atom. */
#define GENfirstOnStack ((char*) 2) /* Just an atom. */
#define GENheap NULL
#define ifact mpfact
typedef entree * PariVar; /* For loop variables. */
typedef entree * PariName; /* For changevalue. */
typedef char * PariExpr;
typedef GEN * GEN_Ptr;
XS((*math_pari_subaddr)); /* On CygWin XS() has attribute conflicting with static */
#if defined(MYMALLOC) && defined(EMBEDMYMALLOC) && defined(UNEMBEDMYMALLOC)
Malloc_t
malloc(register size_t nbytes)
{
return Perl_malloc(nbytes);
}
Free_t
free(void *mp)
{
Perl_mfree(mp); /* What to return? */
}
Malloc_t
realloc(void *mp, size_t nbytes)
{
return Perl_realloc(mp, nbytes);
}
#endif
/* We make a "fake" PVAV, not enough entries. */
/* This macro resets avma *immediately* if IN is a global
static GEN (such as gnil, gun etc). So it should be called near
the end of stack-manipulating scope */
#define setSVpari(sv, in, oldavma) \
setSVpari_or_do(sv, in, oldavma, avma = oldavma)
#define setSVpari_keep_avma(sv, in, oldavma) \
setSVpari_or_do(sv, in, oldavma, ((void)0))
#define setSVpari_or_do(sv, in, oldavma, action) do { \
sv_setref_pv(sv, "Math::Pari", (void*)in); \
morphSVpari(sv, in, oldavma, action); \
} while (0)
#define morphSVpari(sv, in, oldavma, action) do { \
if (is_matvec_t(typ(in)) && SvTYPE(SvRV(sv)) != SVt_PVAV) { \
make_PariAV(sv); \
} \
if (isonstack(in)) { \
SV* g = SvRV(sv); \
SV_OAVMA_PARISTACK_set(g, oldavma - bot, PariStack); \
PariStack = g; \
perlavma = avma; \
onStack_inc; \
} else { \
action; \
} \
SVnum_inc; \
} while (0)
SV* PariStack; /* PariStack keeps the latest SV that
* keeps a GEN on stack. */
long perlavma; /* How much stack is needed
for GENs in Perl variables. */
long sentinel; /* How much stack was used
when Pari called Perl. */
#ifdef DEBUG_PARI
long SVnum;
long SVnumtotal;
long onStack;
long offStack;
# define SVnum_inc (SVnum++, SVnumtotal++)
# define SVnum_dec (SVnum--)
# define onStack_inc (onStack++)
# define onStack_dec (onStack--)
# define offStack_inc (offStack++)
#else /* !defined DEBUG_PARI */
# define SVnum_inc
# define SVnum_dec
# define onStack_inc
# define onStack_dec
# define offStack_inc
#endif /* !defined DEBUG_PARI */
#define pari_version_exp() PARI_VERSION_EXP
#if PARI_VERSION_EXP >= 2002012
# define prec precreal
#endif
#if PARI_VERSION_EXP >= 2000018
GEN
_gbitneg(GEN g)
{
return gbitneg(g,-1);
}
#endif /* PARI_VERSION_EXP >= 2000018 */
#if PARI_VERSION_EXP >= 2002001
GEN
_gbitshiftl(GEN g, long s)
{
return gshift(g, s);
}
#endif
#if PARI_VERSION_EXP >= 2002001 && PARI_VERSION_EXP <= 2002007
GEN
_gbitshiftr(GEN g, long s)
{
return gshift3(g, -s, signe(g) < 0); /* Bug up to 2.2.2: 1 should be OK */
}
#endif /* PARI_VERSION_EXP >= 2002001 && PARI_VERSION_EXP <= 2002007 */
/* Upgrade to PVAV, attach a magic of type 'P' which is just a reference to
ourselves (non-standard refcounts, so needs special logic on DESTROY) */
void
make_PariAV(SV *sv)
{
AV *av = (AV*)SvRV(sv);
char *s = SvPVX(av);
void *p = INT2PTR(void*, SvIVX(av));
SV *newsub = newRV_noinc((SV*)av); /* cannot use sv, it may be
sv_restore()d */
(void)SvUPGRADE((SV*)av, SVt_PVAV);
SV_PARISTACK_set(av, s);
SV_myvoidp_set((SV*)av, p);
sv_magic((SV*)av, newsub, 'P', Nullch, 0);
SvREFCNT_dec(newsub); /* now RC(newsub)==1 */
/* We avoid an reference loop, so should be careful on DESTROY */
#if 0
if ((mg = SvMAGIC((SV*)av)) && mg->mg_type == 'P' /* be extra paranoid */
&& (mg->mg_flags & MGf_REFCOUNTED)) {
/* mg->mg_flags &= ~MGf_REFCOUNTED; */
/* SvREFCNT_dec(sv); */
sv_2mortal((SV*)av); /* We restore refcount on DESTROY */
}
#endif
}
SV*
wrongT(SV *sv, char *file, int line)
{
if (SvTYPE(sv) != SVt_PVCV && SvTYPE(sv) != SVt_PVGV) {
croak("Got the type 0x%x instead of CV=0x%x or GV=0x%x in %s, %i",
SvTYPE(sv), SVt_PVCV, SVt_PVGV, file, line);
} else {
croak("Something very wrong in %s, %i", file, line);
}
return NULL; /* To pacify compiler. */
}
HV *pariStash; /* For quick id. */
HV *pariEpStash;
#if PARI_VERSION_EXP >= 2002012 /* Probably earlier too */
# define HAVE_FETCH_NAMED_VAR
#else
/* Copied from anal.c. */
static entree *
installep(void *f, char *name, int len, int valence, int add, entree **table)
{
entree *ep = (entree *) gpmalloc(sizeof(entree) + add + len+1);
const entree *ep1 = initial_value(ep);
char *u = (char *) ep1 + add;
ep->name = u; strncpy(u, name,len); u[len]=0;
ep->args = NULL; ep->help = NULL; ep->code = NULL;
ep->value = f? f: (void *) ep1;
ep->next = *table;
ep->valence = valence;
ep->menu = 0;
return *table = ep;
}
#endif /* PARI_VERSION_EXP >= 2002012 */
#if PARI_VERSION_EXP <= 2002000 /* Global after 2.2.0 */
static void
changevalue(entree *ep, GEN val)
{
GEN y = gclone(val), x = (GEN)ep->value;
ep->value = (void *)y;
if (x == (GEN) initial_value(ep) || !isclone(x))
{
y[-1] = (long)x; /* push new value */
return;
}
y[-1] = x[-1]; /* save initial value */
killbloc(x); /* destroy intermediate one */
}
#endif
static GEN
my_gpui(GEN x, GEN y)
{
return gpui(x, y, prec);
}
static long
numvar(GEN x)
{
if (typ(x) != t_POL || lgef(x) != 4 ||
!gcmp0((GEN)x[2]) || !gcmp1((GEN)x[3]))
croak("Corrupted data: should be variable");
return varn(x);
}
static SV *
PARIvar(char *s)
{
#if 0
char *olds = s, *u, *v;
GEN p1;
#endif
long hash;
SV *sv;
entree *ep;
#ifdef HAVE_FETCH_NAMED_VAR
ep = fetch_named_var(s);
#else
ep = is_entry_intern(s, functions_hash, &hash);
if (ep) {
if (EpVALENCE(ep) != EpVAR)
croak("Got a function name instead of a variable");
} else {
ep = installep(NULL, s, strlen(s), EpVAR, 7*sizeof(long),
functions_hash + hash);
manage_var(0,ep);
# if 0
ep = (entree *)gpmalloc(sizeof(entree) + 7*BYTES_IN_LONG
+ s - olds + 1);
ep->name = (char *)ep + sizeof(entree) + 7*BYTES_IN_LONG;
for (u = ep->name, v = olds; v < s;) *u++ = *v++; *u = 0;
ep->value = (void *)((char *)ep + sizeof(entree));
ep->code = ep->help = NULL;
ep->next = hashtable[n];
hashtable[n] = ep;
p1 = (GEN)ep->value;
if (nvar == MAXVAR) err(trucer1);
ep->valence = 200;
p1[0] = evaltyp(10)+evalpere(1)+evallg(4);
p1[1] = evalsigne(1)+evallgef(4)+evalvarn(nvar);
p1[2] = zero; p1[3] = un;
polx[nvar] = p1;
polvar[nvar+1] = (long)p1;
p1 += 4;
p1[0] = evaltyp(10)+evalpere(1)+evallg(3);
p1[1] = evalsigne(1)+evallgef(3)+evalvarn(nvar); p1[2] = un;
polun[nvar] = p1;
varentries[nvar++] = ep;
setlg(polvar, nvar+1);
# endif
}
#endif /* !( defined HAVE_FETCH_NAMED_VAR ) */
#if 0
found:
#endif
sv = NEWSV(909,0);
sv_setref_pv(sv, "Math::Pari::Ep", (void*)ep);
make_PariAV(sv);
return sv;
}
static entree *
findVariable(SV *sv, int generate)
{
/* There may be 4 important cases:
a) we got a 'word' string, which we interpret as the name of
the variable to use;
b1) It is a pari value containing a polynomial 0+1*v, we use it;
b2) It is other pari value, we ignore it;
c) it is a string containing junk, same as 'b';
d) It is an ep value => typo (same iterator in two loops).
In any case we localize the value.
*/
char *s = Nullch;
char *s1;
long hash;
entree *ep;
char name[50];
#if 0
char *u, *v;
GEN p1;
#endif
if (SvROK(sv)) {
SV* tsv = SvRV(sv);
if (SvOBJECT(tsv)) {
if (SvSTASH(tsv) == pariStash) {
is_pari:
{
GEN x = (GEN)SV_myvoidp_get(tsv);
if (typ(x) == t_POL /* Polynomial. */
&& lgef(x)==4 /* 2 terms */
&& (gcmp0((GEN)x[2])) /* Free */
&& (gcmp1((GEN)x[3]))) { /* Leading */
s = varentries[ordvar[varn(x)]]->name;
goto repeat;
}
goto ignore;
}
} else if (SvSTASH(tsv) == pariEpStash) {
is_pari_ep:
{
/* Itsn't good to croak: $v=PARIvar 'v'; vector(3,$v,'v'); */
if (generate)
/*croak("Same iterator in embedded PARI loop construct")*/;
return (entree*) SV_myvoidp_get(tsv);
}
} else if (sv_derived_from(sv, "Math::Pari")) { /* Avoid recursion */
if (sv_derived_from(sv, "Math::Pari::Ep"))
goto is_pari_ep;
else
goto is_pari;
}
}
}
if (!SvOK(sv))
goto ignore;
s = SvPV(sv,na);
repeat:
s1 = s;
while (isalnum((unsigned char)*s1))
s1++;
if (*s1 || s1 == s || !isalpha((unsigned char)*s)) {
static int depth;
ignore:
if (!generate)
croak("Bad PARI variable name \"%s\" specified",s);
SAVEINT(depth);
sprintf(name, "intiter%i",depth++);
s = name;
goto repeat;
}
#ifdef HAVE_FETCH_NAMED_VAR
ep = fetch_named_var(s);
#else
ep = is_entry_intern(s, functions_hash, &hash);
if (ep) {
if (EpVALENCE(ep) != EpVAR)
croak("Got a function name instead of a variable");
} else {
ep = installep(NULL, s, s1 - s, EpVAR, 7*sizeof(long),
functions_hash + hash);
manage_var(0,ep);
}
#endif /* !( defined HAVE_FETCH_NAMED_VAR ) */
#if 0
olds = s;
for (n = 0; isalnum(*s); s++) n = n << 1 ^ *s;
if (n < 0) n = -n; n %= TBLSZ;
for(ep = hashtable[n]; ep; ep = ep->next)
{
for(u = ep->name, v = olds; (*u) && *u == *v; u++, v++);
if (!*u && !*v) {
if (EpVALENCE(ep) != 200)
croak("Got a function name instead of a variable");
return ep;
}
}
ep = (entree *)gpmalloc(sizeof(entree) + 7*BYTES_IN_LONG
+ s - olds + 1);
ep->name = (char *)ep + sizeof(entree) + 7*BYTES_IN_LONG;
for (u = ep->name, v = olds; v < s;) *u++ = *v++; *u = 0;
ep->value = (void *)((char *)ep + sizeof(entree));
ep->code = ep->help = NULL;
ep->next = hashtable[n];
hashtable[n] = ep;
p1 = (GEN)ep->value;
if (nvar == MAXVAR) err(trucer1);
ep->valence = 200;
p1[0] = evaltyp(10)+evalpere(1)+evallg(4);
p1[1] = evalsigne(1)+evallgef(4)+evalvarn(nvar);
p1[2] = zero; p1[3] = un;
polx[nvar] = p1;
polvar[nvar+1] = (long)p1;
p1 += 4;
p1[0] = evaltyp(10)+evalpere(1)+evallg(3);
p1[1] = evalsigne(1)+evallgef(3)+evalvarn(nvar); p1[2] = un;
polun[nvar] = p1;
varentries[nvar++] = ep;
setlg(polvar, nvar+1);
#endif
return ep;
}
static PariVar
bindVariable(SV *sv)
{
/* There may be 4 important cases:
a) we got a 'word' string, which we interpret as the name of
the variable to use;
b1) It is a pari value containing a polynomial 0+1*v, we use it;
b2) It is other pari value, we ignore it;
c) it is a string containing junk, same as 'b';
d) It is an ep value => typo (same iterator in two loops).
In any case we localize the value.
*/
long override = 0;
entree *ep;
if (!SvREADONLY(sv)) {
save_item(sv); /* Localize it. */
override = 1;
}
ep = findVariable(sv, 1);
if (override) {
sv_setref_pv(sv, "Math::Pari::Ep", (void*)ep);
make_PariAV(sv);
}
return ep;
}
static int
not_here(char *s)
{
croak("%s not implemented on this architecture", s);
return -1;
}
unsigned long
longword(GEN x, long n)
{
if (n < 0 || n >= lg(x))
croak("The longword %ld ordinal out of bound", n);
return x[n];
}
SV* worksv;
SV* workErrsv;
void
svputc(char c)
{
sv_catpvn(worksv,&c,1);
}
#if PARI_VERSION_EXP >= 2002005
# define PUTS_CONST const
#else
# define PUTS_CONST
#endif
void
svputs(PUTS_CONST char* p)
{
sv_catpv(worksv,p);
}
void
svErrputc(char c)
{
sv_catpvn(workErrsv,&c,1);
}
void
svErrputs(PUTS_CONST char* p)
{
sv_catpv(workErrsv,p);
}
void
svOutflush(void)
{
/* EMPTY */
}
/* Support error messages of the form (calling PARI('O(det2($mat))')):
PARI: *** obsolete function: O(det2($mat))
^----------- */
void
svErrflush(void)
{
STRLEN l;
char *s = SvPV(workErrsv, l);
if (s && l) {
char *nl = memchr(s,'\n',l);
/* Avoid signed/unsigned mismatch */
if (nl && (STRLEN)(nl - s) < l - 1)
warn("PARI: %.*s%*s%s", nl + 1 - s, s, 6, "", nl + 1);
else
warn("PARI: %s", s);
sv_setpv(workErrsv,"");
}
}
void
svErrdie(void)
{
SV *errSv = newSVsv(workErrsv);
STRLEN l;
char *s = SvPV(errSv,l);
char *nl = memchr(s,'\n',l);
sv_setpv(workErrsv,"");
sv_2mortal(errSv);
/* Avoid signed/unsigned mismatch */
if (nl && (STRLEN)(nl - s) < l - 1)
croak("PARI: %.*s%*s%s", nl + 1 - s, s, 6, "", nl + 1);
else
croak("PARI: %s", s);
}
PariOUT perlOut={svputc, svputs, svOutflush, NULL};
PariOUT perlErr={svErrputc, svErrputs, svErrflush, svErrdie};
static GEN
my_ulongtoi(ulong uv)
{
long oldavma = avma;
GEN a = stoi((long)(uv>>1));
a = gshift(a, 1);
if (uv & 0x1)
a = gadd(a, gun);
return gerepileupto(oldavma, a);
}
#ifdef LONG_SHORTER_THAN_IV
GEN
my_UVtoi(UV uv)
{
long oldavma = avma;
GEN a = my_ulongtoi((ulong)(uv>>(8*sizeof(ulong))));
GEN b = my_ulongtoi((ulong)(uv & ((((UV)1)<<(8*sizeof(ulong))) - 1)));
a = gshift(a, (8*sizeof(ulong)));
return gerepileupto(oldavma, gadd(a,b));
}
GEN
my_IVtoi(IV iv)
{
long oldavma = avma;
GEN a;
if (iv >= 0)
return my_UVtoi((UV)iv);
oldavma = avma;
return gerepileupto(oldavma, gneg(my_UVtoi((UV)-iv)));
}
#else
#define my_IVtoi stoi
#define my_UVtoi my_ulongtoi
#endif
#ifdef SvIsUV
# define mySvIsUV SvIsUV
#else
# define mySvIsUV(sv) 0
#endif
#define PerlInt_to_i(sv) (mySvIsUV(sv) ? my_UVtoi(SvUV(sv)) : my_IVtoi(SvIV(sv)))
GEN
sv2pari(SV* sv)
{
if (SvGMAGICAL(sv)) mg_get(sv); /* MAYCHANGE in perlguts.pod - bug in perl */
if (SvROK(sv)) {
SV* tsv = SvRV(sv);
if (SvOBJECT(tsv)) {
if (SvSTASH(tsv) == pariStash) {
is_pari:
{
return (GEN) SV_myvoidp_get(tsv);
}
} else if (SvSTASH(tsv) == pariEpStash) {
is_pari_ep:
{
return (GEN)(((entree*) SV_myvoidp_get(tsv))->value);
}
} else if (sv_derived_from(sv, "Math::Pari")) { /* Avoid recursion */
if (sv_derived_from(sv, "Math::Pari::Ep"))
goto is_pari_ep;
else
goto is_pari;
}
}
{
int type = SvTYPE(tsv);
if (type==SVt_PVAV) {
AV* av=(AV*) tsv;
I32 len=av_len(av); /* Length-1 */
GEN ret=cgetg(len+2, t_VEC);
int i;
for (i=0;i<=len;i++) {
SV** svp=av_fetch(av,i,0);
if (!svp) croak("Internal error in sv2pari!");
ret[i+1]=(long)sv2pari(*svp);
}
return ret;
} else {
return lisexpr(SvPV(sv,na)); /* For overloading */
}
}
}
else if (SvIOK(sv)) return PerlInt_to_i(sv);
else if (SvNOK(sv)) {
double n = (double)SvNV(sv);
#if !defined(PERL_VERSION) || (PERL_VERSION < 6)
/* Earlier needed more voodoo, since sv_true sv_false are NOK,
but not IOK. Now we propagate them to IOK in Pari.pm;
This works at least with 5.5.640 onwards. */
/* With 5.00553 they are (NOK,POK,READONLY,pNOK,pPOK).
This would special-case all READONLY double-headed stuff;
let's hope it is not too frequent... */
if (SvREADONLY(sv) && SvPOK(sv) && (n == 1 || n == 0))
return stoi((long)n);
#endif /* !defined(PERL_VERSION) || (PERL_VERSION < 6) */
return dbltor(n);
}
else if (SvPOK(sv)) return lisexpr(SvPV(sv,na));
else if (SvIOKp(sv)) return PerlInt_to_i(sv);
else if (SvNOKp(sv)) return dbltor((double)SvNV(sv));
else if (SvPOKp(sv)) return lisexpr(SvPV(sv,na));
else if (SvOK(sv)) croak("Variable in sv2pari is not of known type");
return stoi(0); /* !SvOK(sv) */
}
GEN
sv2parimat(SV* sv)
{
GEN in=sv2pari(sv);
if (typ(in)==t_VEC) {
long len=lg(in)-1;
long t;
long l=lg(in[1]);
for (;len;len--) {
if ((t=typ(in[len])) == t_VEC) {
settyp(in[len], t_COL);
} else if (t != t_COL) {
croak("Not a vector where column of a matrix expected");
}
if (lg(in[len])!=l) {
croak("Columns of input matrix are of different height");
}
}
settyp(in, t_MAT);
} else if (typ(in) != t_MAT) {
croak("Not a matrix where matrix expected");
}
return in;
}
SV*
pari2iv(GEN in)
{
#ifdef SvIsUV
# define HAVE_UVs 1
UV uv;
#else
# define HAVE_UVs 0
IV uv;
#endif
int overflow = 0;
if (typ(in) != t_INT)
return newSViv((IV)gtolong(in));
switch (lgef(in)) {
case 2:
uv = 0;
break;
case 3:
uv = in[2];
if (sizeof(long) >= sizeof(IV) && in[2] < 0)
overflow = 1;
break;
case 4:
if ( 2 * sizeof(long) > sizeof(IV)
|| ((2 * sizeof(long) == sizeof(IV)) && !HAVE_UVs && in[2] < 0) )
goto do_nv;
uv = in[2];
uv = (uv << TWOPOTBYTES_IN_LONG) + in[3];
break;
default:
goto do_nv;
}
if (overflow) {
#ifdef SvIsUV
if (signe(in) > 0) {
SV *sv = newSViv((IV)uv);
SvIsUV_on(sv);
return sv;
} else
#endif
goto do_nv;
}
return newSViv(signe(in) > 0 ? (IV)uv : -(IV)uv);
do_nv:
return newSVnv(gtodouble(in)); /* XXXX to NV, not to double? */
}
#if PARI_VERSION_EXP >= 2002005 && PARI_VERSION_EXP <= 2002007
# define _gtodouble gtodouble
static void
_initout(pariout_t *T, char f, long sigd, long sp, long fieldw, int prettyp)
{
T->format = f;
T->sigd = sigd;
T->sp = sp;
T->fieldw = fieldw;
T->initial = 1;
T->prettyp = prettyp;
}
void
mybruteall(GEN g, char f, long d, long sp)
{
pariout_t T; _initout(&T,f,d,sp,0, f_RAW);
gen_output(g, &T);
}
#else
#ifndef m_evallg
# define m_evallg _evallg
#endif
double
_gtodouble(GEN x)
{
static long reel4[4]={ evaltyp(t_REAL) | m_evallg(4),0,0,0 };
if (typ(x)==t_REAL) return rtodbl(x);
gaffect(x,(GEN)reel4); return rtodbl((GEN)reel4);
}
#define mybruteall bruteall
#endif
SV*
pari2nv(GEN in)
{