-
Notifications
You must be signed in to change notification settings - Fork 41
/
pdlcore.c.PL
1335 lines (1088 loc) · 42.7 KB
/
pdlcore.c.PL
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
# Create pdlcore.c
# - needed for bad-value handling in whichdatatype
use strict;
use Config;
use File::Basename qw(&basename &dirname);
require './Dev.pm'; PDL::Core::Dev->import;
use vars qw( %PDL_DATATYPES );
# check for bad value support
require './Config.pm'; # to load the PDL not the Perl one
die "No PDL::Config found" unless %PDL::Config;
my $bvalflag = $PDL::Config{WITH_BADVAL};
my $usenan = $PDL::Config{BADVAL_USENAN};
require './Types.pm';
PDL::Types->import(':All');
# This forces PL files to create target in same directory as PL file.
# This is so that make depend always knows where to find PL derivatives.
chdir(dirname($0));
my $file;
($file = basename($0)) =~ s/\.PL$//;
$file =~ s/\.pl$//
if ($Config{'osname'} eq 'VMS' or
$Config{'osname'} eq 'OS2'); # "case-forgiving"
if ( $bvalflag ) {
print "Extracting $file (WITH bad value support)\n";
} else {
print "Extracting $file (NO bad value support)\n";
}
open OUT,">$file" or die "Can't create $file: $!";
chmod 0644, $file;
print OUT <<"!WITH!SUBS!";
/* pdlcore.c - generated automatically by pdlcore.c.PL */
/* - bad value support = $bvalflag */
!WITH!SUBS!
print OUT <<'!HEADER!';
#undef FOODEB
#define PDL_CORE /* For certain ifdefs */
#include "pdl.h" /* Data structure declarations */
#include "pdlcore.h" /* Core declarations */
/* Needed to get badvals from the Core structure (in pdl_avref_<type>) */
extern Core PDL;
/***************
* So many ways to be undefined...
*/
#define sv_undef(sv) ( (!(sv) || ((sv)==&PL_sv_undef)) || !(SvNIOK(sv) || (SvTYPE(sv)==SVt_PVMG) || SvPOK(sv) || SvROK(sv)))
!HEADER!
##############################
# Figure out the best definition for the 'finite()' call or call-like macro
# We short-circuit the process for the cl compiler; for other compilers we search
# for 'isfinite' or 'finite', with a preference for 'isfinite' (IEEE recommends this).
if($Config{cc} eq 'cl') {
# _finite in VC++ 4.0
print OUT <<'FOO';
#define finite _finite
#include <float.h>
FOO
} else {
my $finite_inc;
my $use_isfinite = 0;
foreach my $inc ( qw/ math.h ieeefp.h / )
{
if ( trylink ("finite: $inc", "#include <$inc>", 'isfinite(3.2);', '' ) ) {
$finite_inc = $inc;
$use_isfinite = 1;
last;
}
if ( (!defined($finite_inc)) and trylink ("finite: $inc", "#include <$inc>", 'finite(3.2);','') ) {
$finite_inc = $inc;
}
}
if ( defined $finite_inc ) {
print OUT "#include <$finite_inc>\n";
print OUT "#define finite(a) (isfinite(a))\n";
}
else
{
print OUT <<'!NO!SUBS!';
/* Kludgy finite/isfinite because pdlcore.c.PL was unable to find one in your math library */
#ifndef finite
#ifdef isfinite
#define finite isfinite
#else
#define finite(a) (((a) * 0) == (0))
#endif
#endif
!NO!SUBS!
}
}
##############################
# PDL handling stuff starts here
#
print OUT <<'!NO!SUBS!'
int _anyval_eq_anyval(PDL_Anyval x, PDL_Anyval y) {
switch (x.type) {
case PDL_B:
switch (y.type) {
case PDL_B: return (x.value.B == y.value.B) ? 1 : 0;
case PDL_S: return ((PDL_Short)(x.value.B) == y.value.S) ? 1 : 0;
case PDL_US: return ((PDL_Ushort)(x.value.B) == y.value.U) ? 1 : 0;
case PDL_L: return ((PDL_Long)(x.value.B) == y.value.L) ? 1 : 0;
case PDL_IND: return ((PDL_Indx)(x.value.B) == y.value.N) ? 1 : 0;
case PDL_LL: return ((PDL_LongLong)(x.value.B) == y.value.Q) ? 1 : 0;
case PDL_F: return ((PDL_Float)(x.value.B) == y.value.F) ? 1 : 0;
case PDL_D: return ((PDL_Double)(x.value.B) == y.value.D) ? 1 : 0;
default: return 0;
}
case PDL_S:
switch (y.type) {
case PDL_B: return (x.value.S == (PDL_Short)(y.value.B)) ? 1 : 0;
case PDL_S: return (x.value.S == y.value.S) ? 1 : 0;
case PDL_US: return ((PDL_Long)(x.value.S) == (PDL_Long)(y.value.U)) ? 1 : 0;
case PDL_L: return ((PDL_Long)(x.value.S) == y.value.L) ? 1 : 0;
case PDL_IND: return ((PDL_Indx)(x.value.S) == y.value.N) ? 1 : 0;
case PDL_LL: return ((PDL_LongLong)(x.value.S) == y.value.Q) ? 1 : 0;
case PDL_F: return ((PDL_Float)(x.value.S) == y.value.F) ? 1 : 0;
case PDL_D: return ((PDL_Double)(x.value.S) == y.value.D) ? 1 : 0;
default: return 0;
}
case PDL_US:
switch (y.type) {
case PDL_B: return (x.value.U == (PDL_Ushort)(y.value.B)) ? 1 : 0;
case PDL_S: return ((PDL_Long)(x.value.U) == (PDL_Long)(y.value.S)) ? 1 : 0;
case PDL_US: return (x.value.U == y.value.U) ? 1 : 0;
case PDL_L: return ((PDL_Long)(x.value.U) == y.value.L) ? 1 : 0;
case PDL_IND: return ((PDL_Indx)(x.value.U) == y.value.N) ? 1 : 0;
case PDL_LL: return ((PDL_LongLong)(x.value.U) == y.value.Q) ? 1 : 0;
case PDL_F: return ((PDL_Float)(x.value.U) == y.value.F) ? 1 : 0;
case PDL_D: return ((PDL_Double)(x.value.U) == y.value.D) ? 1 : 0;
default: return 0;
}
case PDL_L:
switch (y.type) {
case PDL_B: return (x.value.L == (PDL_Long)(y.value.B)) ? 1 : 0;
case PDL_S: return (x.value.L == (PDL_Long)(y.value.S)) ? 1 : 0;
case PDL_US: return (x.value.L == (PDL_Long)(y.value.U)) ? 1 : 0;
case PDL_L: return (x.value.L == y.value.L) ? 1 : 0;
case PDL_IND: return ((PDL_Indx)(x.value.L) == y.value.N) ? 1 : 0;
case PDL_LL: return ((PDL_LongLong)(x.value.L) == y.value.Q) ? 1 : 0;
case PDL_F: return ((PDL_Float)(x.value.L) == y.value.F) ? 1 : 0;
case PDL_D: return ((PDL_Double)(x.value.L) == y.value.D) ? 1 : 0;
default: return 0;
}
case PDL_IND:
switch (y.type) {
case PDL_B: return (x.value.N == (PDL_Indx)(y.value.B)) ? 1 : 0;
case PDL_S: return (x.value.N == (PDL_Indx)(y.value.S)) ? 1 : 0;
case PDL_US: return (x.value.N == (PDL_Indx)(y.value.U)) ? 1 : 0;
case PDL_L: return (x.value.N == (PDL_Indx)(y.value.L)) ? 1 : 0;
case PDL_IND: return (x.value.N == y.value.N) ? 1 : 0;
case PDL_LL: return ((PDL_LongLong)(x.value.N) == y.value.Q) ? 1 : 0;
case PDL_F: return ((PDL_Float)(x.value.N) == y.value.F) ? 1 : 0;
case PDL_D: return ((PDL_Double)(x.value.N) == y.value.D) ? 1 : 0;
default: return 0;
}
case PDL_LL:
switch (y.type) {
case PDL_B: return (x.value.Q == (PDL_LongLong)(y.value.B)) ? 1 : 0;
case PDL_S: return (x.value.Q == (PDL_LongLong)(y.value.S)) ? 1 : 0;
case PDL_US: return (x.value.Q == (PDL_LongLong)(y.value.U)) ? 1 : 0;
case PDL_L: return (x.value.Q == (PDL_LongLong)(y.value.L)) ? 1 : 0;
case PDL_IND: return (x.value.Q == (PDL_LongLong)(y.value.N)) ? 1 : 0;
case PDL_LL: return (x.value.Q == y.value.Q) ? 1 : 0;
case PDL_F: return ((PDL_Float)(x.value.Q) == y.value.F) ? 1 : 0;
case PDL_D: return ((PDL_Double)(x.value.Q) == y.value.D) ? 1 : 0;
default: return 0;
}
case PDL_F:
switch (y.type) {
case PDL_B: return (x.value.F == (PDL_Float)(y.value.B)) ? 1 : 0;
case PDL_S: return (x.value.F == (PDL_Float)(y.value.S)) ? 1 : 0;
case PDL_US: return (x.value.F == (PDL_Float)(y.value.U)) ? 1 : 0;
case PDL_L: return (x.value.F == (PDL_Float)(y.value.L)) ? 1 : 0;
case PDL_IND: return (x.value.F == (PDL_Float)(y.value.N)) ? 1 : 0;
case PDL_LL: return (x.value.F == (PDL_Float)(y.value.Q)) ? 1 : 0;
case PDL_F: return (x.value.F == y.value.F) ? 1 : 0;
case PDL_D: return ((PDL_Double)(x.value.F) == y.value.D) ? 1 : 0;
default: return 0;
}
case PDL_D:
switch (y.type) {
case PDL_B: return (x.value.D == (PDL_Double)(y.value.B)) ? 1 : 0;
case PDL_S: return (x.value.D == (PDL_Double)(y.value.S)) ? 1 : 0;
case PDL_US: return (x.value.D == (PDL_Double)(y.value.U)) ? 1 : 0;
case PDL_L: return (x.value.D == (PDL_Double)(y.value.L)) ? 1 : 0;
case PDL_IND: return (x.value.D == (PDL_Double)(y.value.N)) ? 1 : 0;
case PDL_LL: return (x.value.D == (PDL_Double)(y.value.Q)) ? 1 : 0;
case PDL_F: return (x.value.D == (PDL_Double)(y.value.F)) ? 1 : 0;
case PDL_D: return (x.value.D == y.value.D) ? 1 : 0;
default: return 0;
}
default:
return 0;
}
}
static SV *getref_pdl(pdl *it) {
SV *newref;
if(!it->sv) {
SV *ref;
HV *stash = gv_stashpv("PDL",TRUE);
SV *psv = newSViv(PTR2IV(it));
it->sv = psv;
newref = newRV_noinc(it->sv);
(void)sv_bless(newref,stash);
} else {
newref = newRV_inc(it->sv);
SvAMAGIC_on(newref);
}
return newref;
}
void SetSV_PDL ( SV *sv, pdl *it ) {
SV *newref = getref_pdl(it); /* YUCK!!!! */
sv_setsv(sv,newref);
SvREFCNT_dec(newref);
}
/* Size of data type information */
int pdl_howbig (int datatype) {
switch (datatype) {
!NO!SUBS!
;
# generate the cases for the various types
for my $type (typesrtkeys()) {
my ($sym,$ctype) = map {typefld($type,$_)} qw/sym ctype/;
print OUT << "!WITH!SUBS!";
case $sym:
return sizeof($ctype);
!WITH!SUBS!
}
print OUT <<'!NO!SUBS!';
default:
croak("Unknown datatype code = %d",datatype);
}
}
/* Check minimum datatype required to represent number */
/* Microsoft compilers do some unbelievable things - hence
some #ifdef's inserted by Sisyphus */
#if defined _MSC_VER && _MSC_VER < 1400
#define TESTTYPE(b,a) {a foo = nv; a bar = foo; foo += 0; if(nv == bar) return b;}
#else
#define TESTTYPE(b,a) {a foo = nv; if(nv == foo) return b;}
#endif
#if defined _MSC_VER && _MSC_VER < 1400
#pragma optimize("", off)
#endif
int pdl_whichdatatype (IV nv) {
!NO!SUBS!
# generate the cases for the various types
for my $type (typesrtkeys()) {
my ($sym,$ctype) = map {typefld($type,$_)} qw/sym ctype/;
print OUT << "!WITH!SUBS!";
TESTTYPE($sym,$ctype)
!WITH!SUBS!
}
print OUT <<'!NO!SUBS!';
croak("Something's gone wrong: %ld cannot be converted by whichdatatype", nv);
}
/* Check minimum, at least float, datatype required to represent number */
int pdl_whichdatatype_double (NV nv) {
TESTTYPE(PDL_F,PDL_Float)
TESTTYPE(PDL_D,PDL_Double)
/* Default return type PDL_Double */
return PDL_D;
}
#if defined _MSC_VER && _MSC_VER < 1400
#pragma optimize("", on)
#endif
/* Make a scratch dataspace for a scalar pdl */
void pdl_makescratchhash(pdl *ret, PDL_Anyval data) {
STRLEN n_a;
HV *hash;
SV *dat; PDL_Indx fake[1];
/* Compress to smallest available type. */
ret->datatype = data.type;
/* Create a string SV of apropriate size. The string is arbitrary
* and just has to be larger than the largest datatype. */
dat = newSVpvn(" ",pdl_howbig(ret->datatype));
ret->data = SvPV(dat,n_a);
ret->datasv = dat;
/* Refcnt should be 1 already... */
/* Make the whole pdl mortal so destruction happens at the right time.
* If there are dangling references, pdlapi.c knows not to actually
* destroy the C struct. */
sv_2mortal(getref_pdl(ret));
pdl_setdims(ret, fake, 0); /* 0 dims in a scalar */
ret->nvals = 1; /* 1 val in a scalar */
/* NULLs should be ok because no dimensions. */
pdl_set(ret->data, ret->datatype, NULL, NULL, NULL, 0, 0, data);
}
/*
"Convert" a perl SV into a pdl (alright more like a mapping as
the data block is not actually copied in the most common case
of a single scalar) scalars are automatically converted to PDLs.
*/
pdl* SvPDLV ( SV* sv ) {
pdl* ret;
PDL_Indx fake[1];
SV *sv2;
if ( !SvROK(sv) ) {
/* The scalar is not a ref, so we can use direct conversion. */
SV *dat;
PDL_Anyval data;
int datatype;
NV tmp_NV;
IV tmp_IV;
ret = pdl_new(); /* Scratch pdl */
/* Scratch hash for the pdl :( - slow but safest. */
/* handle undefined values */
if( sv_undef(sv) ) {
sv = get_sv("PDL::undefval",1);
if(SvIV(get_sv("PDL::debug",1))){
fprintf(stderr,"Warning: SvPDLV converted undef to $PDL::undefval (%g).\n",SvNV(sv));
}
}
/* Figure datatype to use */
if ( !SvIOK(sv) ) { /* Perl Double (e.g. 2.0) */
tmp_NV = SvNV(sv);
!NO!SUBS!
##########
# If badvals and usenan are true, we default NaNs to type double.
if ( $bvalflag and $usenan ) {
print OUT q{
/*
* default NaN/Infs to double
*
*/
if ( finite(tmp_NV) == 0 ) {
datatype = PDL_D;
} else {
datatype = pdl_whichdatatype_double(tmp_NV);
}
}
} else {
print OUT q{
datatype = pdl_whichdatatype_double(tmp_NV);
}
} # if: $bvalflag
print OUT <<'!NO!SUBS!';
ANYVAL_FROM_CTYPE(data, datatype, tmp_NV);
} /* end of Perl Double case for data type */
else { /* Perl Int (e.g. 2) */
tmp_IV = SvIV(sv);
datatype = pdl_whichdatatype(tmp_IV);
ANYVAL_FROM_CTYPE(data, datatype, tmp_IV);
}
pdl_makescratchhash(ret, data);
return ret;
} /* End of scalar case */
/* If execution reaches here, then sv is NOT a scalar
* (i.e. it is a ref).
*/
if(SvTYPE(SvRV(sv)) == SVt_PVHV) {
HV *hash = (HV*)SvRV(sv);
SV **svp = hv_fetch(hash,"PDL",3,0);
if(svp == NULL) {
croak("Hash given as a pdl - but not {PDL} key!");
}
if(*svp == NULL) {
croak("Hash given as a pdl - but not {PDL} key (*svp)!");
}
/* This is the magic hook which checks to see if {PDL}
is a code ref, and if so executes it. It should
return a standard piddle. This allows
all kinds of funky objects to be derived from PDL,
and allow normal PDL functions to still work so long
as the {PDL} code returns a standard piddle on
demand - KGB */
if (SvROK(*svp) && SvTYPE(SvRV(*svp)) == SVt_PVCV) {
dSP;
int count;
ENTER ;
SAVETMPS ;
PUSHMARK(sp) ;
count = perl_call_sv(*svp, G_SCALAR|G_NOARGS);
SPAGAIN ;
if (count != 1)
croak("Execution of PDL structure failed to return one value\n") ;
sv=newSVsv(POPs);
PUTBACK ;
FREETMPS ;
LEAVE ;
}
else {
sv = *svp;
}
if(SvGMAGICAL(sv)) {
mg_get(sv);
}
if ( !SvROK(sv) ) { /* Got something from a hash but not a ref */
croak("Hash given as pdl - but PDL key is not a ref!");
}
}
if(SvTYPE(SvRV(sv)) == SVt_PVAV) {
/* This is similar to pdl_avref in Core.xs.PL -- we do the same steps here. */
AV *dims, *av;
int i, depth;
int datalevel = -1;
pdl *p;
av = (AV *)SvRV(sv);
dims = (AV *)sv_2mortal((SV *)newAV());
av_store(dims,0,newSViv( (IV) av_len(av)+1 ) );
/* Pull sizes using av_ndcheck */
depth = 1 + av_ndcheck(av,dims,0,&datalevel);
return pdl_from_array(av, dims, -1, NULL); /* -1 means pdltype autodetection */
} /* end of AV code */
if (SvTYPE(SvRV(sv)) != SVt_PVMG)
croak("Error - tried to use an unknown data structure as a PDL");
else if( !( sv_derived_from( sv, "PDL") ) )
croak("Error - tried to use an unknown Perl object type as a PDL");
sv2 = (SV*) SvRV(sv);
/* Return the pdl * pointer */
ret = INT2PTR(pdl *, SvIV(sv2));
/* Final check -- make sure it has the right magic number */
if(ret->magicno != PDL_MAGICNO) {
croak("Fatal error: argument is probably not a piddle, or\
magic no overwritten. You're in trouble, guv: %p %p %lu\n",sv2,ret,ret->magicno);
}
return ret;
}
/* Make a new pdl object as a copy of an old one and return - implement by
callback to perl method "copy" or "new" (for scalar upgrade) */
SV* pdl_copy( pdl* a, char* option ) {
SV* retval;
char meth[20];
dSP ; int count ;
retval = newSVpv("",0); /* Create the new SV */
ENTER ; SAVETMPS ; PUSHMARK(sp) ;
/* Push arguments */
#ifdef FOOBAR
if (sv_isobject((SV*)a->hash)) {
#endif
XPUSHs(sv_2mortal(getref_pdl(a)));
strcpy(meth,"copy");
XPUSHs(sv_2mortal(newSVpv(option, 0))) ;
#ifdef FOOBAR
}
else{
XPUSHs(perl_get_sv("PDL::name",FALSE)); /* Default object */
XPUSHs(sv_2mortal(getref_pdl(a)));
strcpy(meth,"new");
}
#endif
PUTBACK ;
count = perl_call_method(meth, G_SCALAR); /* Call Perl */
SPAGAIN;
if (count !=1)
croak("Error calling perl function\n");
sv_setsv( retval, POPs ); /* Save the perl returned value */
PUTBACK ; FREETMPS ; LEAVE ;
return retval;
}
/* Pack dims array - returns dims[] (pdl_malloced) and ndims */
PDL_Indx* pdl_packdims ( SV* sv, int *ndims ) {
SV* bar;
AV* array;
int i;
PDL_Indx *dims;
if (!(SvROK(sv) && SvTYPE(SvRV(sv))==SVt_PVAV)) /* Test */
return NULL;
array = (AV *) SvRV(sv); /* dereference */
*ndims = (int) av_len(array) + 1; /* Number of dimensions */
dims = (PDL_Indx *) pdl_malloc( (*ndims) * sizeof(*dims) ); /* Array space */
if (dims == NULL)
croak("Out of memory");
for(i=0; i<(*ndims); i++) {
bar = *(av_fetch( array, i, 0 )); /* Fetch */
dims[i] = (PDL_Indx) SvIV(bar);
}
return dims;
}
/* unpack dims array into PDL SV* */
void pdl_unpackdims ( SV* sv, PDL_Indx *dims, int ndims ) {
AV* array;
HV* hash;
int i;
hash = (HV*) SvRV( sv );
array = newAV();
(void)hv_store(hash, "Dims", strlen("Dims"), newRV( (SV*) array), 0 );
if (ndims==0 )
return;
for(i=0; i<ndims; i++)
av_store( array, i, newSViv( (IV)dims[i] ) );
}
PDL_Indx pdl_safe_indterm( PDL_Indx dsz, PDL_Indx at, char *file, int lineno)
{
if (at >= 0 && at < dsz) return at;
pdl_barf("access [%d] out of range [0..%d] (inclusive) at %s line %d",
at, dsz-1, file?file:"?", lineno);
return at; // This can never happen - placed to avoid a compiler warning.
}
/*
pdl_malloc - utility to get temporary memory space. Uses
a mortal *SV for this so it is automatically freed when the current
context is terminated without having to call free(). Naughty but
nice!
*/
void* pdl_malloc ( STRLEN nbytes ) {
STRLEN n_a;
SV* work;
work = sv_2mortal(newSVpv("", 0));
SvGROW( work, nbytes);
return (void *) SvPV(work, n_a);
}
/*********** Stuff for barfing *************/
/*
This routine barfs/warns in a thread-safe manner. If we're in the main thread,
this calls the perl-level barf/warn. If in a worker thread, we save the
message to barf/warn in the main thread later
*/
static void pdl_barf_or_warn(const char* pat, int iswarn, va_list* args)
{
/* If we're in a worker thread, we queue the
* barf/warn for later, and exit the thread ...
*/
if( pdl_pthread_barf_or_warn(pat, iswarn, args) )
return;
/* ... otherwise we fall through and barf by calling
* the perl-level PDL::barf() or PDL::cluck()
*/
{ /* scope block for C89 compatibility */
SV * sv;
dSP;
ENTER;
SAVETMPS;
PUSHMARK(SP);
sv = sv_2mortal(newSV(0));
sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
va_end(*args);
XPUSHs(sv);
PUTBACK;
if(iswarn) call_pv("PDL::cluck", G_DISCARD);
else call_pv("PDL::barf", G_DISCARD);
FREETMPS;
LEAVE;
} /* end C89 compatibility scope block */
}
#define GEN_PDL_BARF_OR_WARN_I_STDARG(type, iswarn) \
void pdl_##type(const char* pat, ...) \
{ \
va_list args; \
va_start(args, pat); \
pdl_barf_or_warn(pat, iswarn, &args); \
}
#define GEN_PDL_BARF_OR_WARN_LEGACY(type, iswarn) \
void pdl_##type(pat, va_alist) \
char *pat; \
va_dcl \
{ \
va_list args; \
va_start(args); \
pdl_barf_or_warn(pat, iswarn, &args); \
}
#ifdef I_STDARG
GEN_PDL_BARF_OR_WARN_I_STDARG(barf, 0)
GEN_PDL_BARF_OR_WARN_I_STDARG(warn, 1)
#else
GEN_PDL_BARF_OR_WARN_LEGACY(barf, 0)
GEN_PDL_BARF_OR_WARN_LEGACY(warn, 1)
#endif
/**********************************************************************
*
* CONSTRUCTOR/INGESTION HELPERS
*
* The following routines assist with the permissive constructor,
* which is designed to build a PDL out of basically anything thrown at it.
*
* They are all called by pdl_avref in Core.xs, which in turn is called by the constructors
* in Core.pm.PL. The main entry point is pdl_from_array(), which calls
* av_ndcheck() to identify the necessary size of the output PDL, and then dispatches
* the copy into pdl_setav_<type> according to the type of the output PDL.
*
*/
/******************************
* av_ndcheck -
* traverse a Perl array ref recursively, following down any number of
* levels of references, and generate a minimal PDL dim list that can
* encompass them all according to permissive-constructor rules.
*
* Scalars, array refs, and PDLs may be mixed in the incoming AV.
*
* The routine works out the dimensions of a corresponding
* piddle (in the AV dims) in reverse notation (vs PDL conventions).
*
* It does not enforce a rectangular array on the input, the idea being that
* omitted values will be set to zero or the undefval in the resulting piddle,
* i.e. we can make piddles from 'sparse' array refs.
*
* Empty PDLs are treated like any other dimension -- i.e. their
* 0-length dimensions are thrown into the mix just like nonzero
* dimensions would be.
*
* The possible presence of empty PDLs forces us to pad out dimensions
* to unity explicitly in cases like
* [ Empty[2x0x2], 5 ]
* where simple parsing would yield a dimlist of
* [ 2,0,2,2 ]
* which is still Empty.
*/
PDL_Indx av_ndcheck(AV* av, AV* dims, int level, int *datalevel)
{
PDL_Indx i, len, oldlen;
int newdepth, depth = 0;
int n_scalars = 0;
SV *el, **elp;
pdl *dest_pdl; /* Stores PDL argument */
if(dims==NULL) {
pdl_barf("av_ndcheck - got a null dim array! This is a bug in PDL.");
}
/* Start with a clean slate */
if(level==0) {
av_clear(dims);
}
len = av_len(av); /* Loop over elements of the AV */
for (i=0; i<= len; i++) {
newdepth = 0; /* Each element - find depth */
elp = av_fetch(av,i,0);
el = elp ? *elp : 0; /* Get the ith element */
if (el && SvROK(el)) { /* It is a reference */
if (SvTYPE(SvRV(el)) == SVt_PVAV) { /* It is an array reference */
/* Recurse to find depth inside the array reference */
newdepth = 1 + av_ndcheck((AV *) SvRV(el), dims, level+1, datalevel);
} else if ( (dest_pdl = SvPDLV(el)) ) {
/* It is a PDL - walk down its dimension list, exactly as if it
* were a bunch of nested array refs. We pull the ndims and dims
* fields out to local variables so that nulls can be treated specially.
*/
int j;
short pndims;
PDL_Indx *pdims;
PDL_Indx pnvals;
pdl_make_physdims(dest_pdl);
pndims = dest_pdl->ndims;
pdims = dest_pdl->dims;
pnvals = dest_pdl->nvals;
for(j=0;j<pndims;j++) {
int jl = pndims-j+level;
PDL_Indx siz = pdims[j];
if( av_len(dims) >= jl &&
av_fetch(dims,jl,0) != NULL &&
SvIOK(*(av_fetch(dims,jl,0)))) {
/* We have already found something that specifies this dimension -- so */
/* we keep the size if possible, or enlarge if necessary. */
oldlen=(PDL_Indx)SvIV(*(av_fetch(dims,jl,0)));
if(siz > oldlen) {
sv_setiv(*(av_fetch(dims,jl,0)),(IV)(pdims[j]));
}
} else {
/* Breaking new dimensional ground here -- if this is the first element */
/* in the arg list, then we can keep zero elements -- but if it is not */
/* the first element, we have to pad zero dims to unity (because the */
/* prior object had implicit size of 1 in all implicit dimensions) */
av_store(dims, jl, newSViv((IV)(siz?siz:(i?1:0))));
}
}
/* We have specified all the dims in this PDL. Now pad out the implicit */
/* dims of size unity, to wipe out any dims of size zero we have already */
/* marked. */
for(j=pndims+1; j <= av_len(dims); j++) {
SV **svp = av_fetch(dims,j,0);
if(!svp){
av_store(dims, j, newSViv((IV)1));
} else if( (int)SvIV(*svp) == 0 ) {
sv_setiv(*svp, (IV)1);
}
}
newdepth= pndims;
} else {
croak("av_ndcheck: non-array, non-PDL ref in structure\n\t(this is usually a problem with a pdl() call)");
}
} else {
/* got a scalar (not a ref) */
n_scalars++;
}
if (newdepth > depth)
depth = newdepth;
}
len++; // convert from funky av_len return value to real count
if (av_len(dims) >= level && av_fetch(dims, level, 0) != NULL
&& SvIOK(*(av_fetch(dims, level, 0)))) {
oldlen = (PDL_Indx) SvIV(*(av_fetch(dims, level, 0)));
if (len > oldlen)
sv_setiv(*(av_fetch(dims, level, 0)), (IV) len);
}
else
av_store(dims,level,newSViv((IV) len));
/* We found at least one element -- so pad dims to unity at levels earlier than this one */
if(n_scalars) {
for(i=0;i<level;i++) {
SV **svp = av_fetch(dims, i, 0);
if(!svp) {
av_store(dims, i, newSViv((IV)1));
} else if( (PDL_Indx)SvIV(*svp) == 0) {
sv_setiv(*svp, (IV)1);
}
}
for(i=level+1; i <= av_len(dims); i++) {
SV **svp = av_fetch(dims, i, 0);
if(!svp) {
av_store(dims, i, newSViv((IV)1));
} else if( (PDL_Indx)SvIV(*svp) == 0) {
sv_setiv(*svp, (IV)1);
}
}
}
return depth;
}
/* helper function used in pdl_from_array */
static int _detect_datatype(AV *av) {
SV **item;
AV *array;
int count, i;
if (!av) return PDL_D;
count = av_len(av);
for (i = 0; i < count; i++) {
item = av_fetch(av, i, 0);
if (*item) {
if (SvROK(*item)) {
array = (AV*)SvRV(*item);
if (_detect_datatype(array) == PDL_D) {
return PDL_D;
}
}
if (SvOK(*item) && !SvIOK(*item)) {
return PDL_D;
}
}
}
#if IVSIZE == 8
return PDL_LL;
#else
return PDL_L;
#endif
}
/**********************************************************************
* pdl_from_array - dispatcher gets called only by pdl_avref (defined in
* Core.xs) - it breaks out to pdl_setav_<type>, below, based on the
* type of the destination PDL.
*/
pdl* pdl_from_array(AV* av, AV* dims, int type, pdl* p)
{
int ndims, i, level=0;
PDL_Indx *pdims;
PDL_Anyval undefval = { -1, 0 };
ndims = av_len(dims)+1;
pdims = (PDL_Indx *) pdl_malloc( (ndims) * sizeof(*pdims) );
for (i=0; i<ndims; i++) {
pdims[i] = SvIV(*(av_fetch(dims, ndims-1-i, 0))); /* reverse order */
}
if (p == NULL)
p = pdl_new();
pdl_setdims (p, pdims, ndims);
if (type == -1) {
type = _detect_datatype(av);
}
p->datatype = type;
pdl_allocdata (p);
pdl_make_physical(p);
{
/******
* Copy the undefval to fill empty spots in the piddle...
*/
SV *sv = get_sv("PDL::undefval",0);
if ((!sv) || (sv==&PL_sv_undef)) {
ANYVAL_FROM_CTYPE(undefval, type, 0);
}
else {
/* Need to set undefvalue from the perl scalar */
if (SvIOK(sv)) {
ANYVAL_FROM_CTYPE(undefval, type, SvIV(sv));
}
else if (SvNOK(sv)) {
ANYVAL_FROM_CTYPE(undefval, type, SvNV(sv));
}
else {
ANYVAL_FROM_CTYPE(undefval, type, 0); /* this should not happen */
}
}
}
switch (type) {
!NO!SUBS!
##########
# Perl snippet autogenerates switch statement to distribute
# pdl_setav calls...
#
for my $type(typesrtkeys()){
my $t2 = $PDL_DATATYPES{$type};
$t2 =~ s/PDL_//;
print OUT <<"!WITH!SUBS!";
case $type:
pdl_setav_$t2(p->data,av,pdims,ndims,level, undefval.value.$PDL::Types::typehash{$type}->{ppsym}, p);
break;
!WITH!SUBS!
}
#
# Back to your regularly scheduled C code emission...
########
print OUT <<'!NO!SUBS!';
default:
croak("pdl_from_array: internal error: got type %d",type);
break;
}
p->state &= ~PDL_NOMYDIMS;
return p;
}
/*
* pdl_kludge_copy_<type> - copy a PDL into a part of a being-formed PDL.
* It is only used by pdl_setav_<type>, to handle the case where a PDL is part