lib/PDL/Ufunc.xs

filter: Statementstmt 81.2% 134 / 165 Branchbran 35.2% 441 / 1252 Conditioncond n/a MC/DCmcdc n/a Subroutinesub n/a Podpod n/a totaltotal 40.5% 575 / 1417 CC 0 SCAR 0
CC
0
Cov
0%
CRAP 0
« lib/PDL/Ops-pp-eq.c ↑ Summary lib/PDL/Primitive-xoshiro256plus.c »
1  
2 #line 453 "lib/PDL/PP.pm"
3 /*
4 * THIS FILE WAS GENERATED BY PDL::PP from lib/PDL/Ufunc.pd! Do not modify!
5 */
6  
7 #define PDL_FREE_CODE(trans, destroy, comp_free_code, ntpriv_free_code) \
8 if (destroy) { \
9 comp_free_code \
10 } \
11 if ((trans)->dims_redone) { \
12 ntpriv_free_code \
13 }
14  
15 #include "EXTERN.h"
16 #include "perl.h"
17 #include "XSUB.h"
18 #include "pdl.h"
19 #include "pdlcore.h"
20 #define PDL PDL_Ufunc
21 extern Core* PDL; /* Structure hold core C functions */
22 #line 23 "lib/PDL/Ufunc.xs"
23 pdl_error pdl_run_prodover(pdl *a,pdl *b);
24 pdl_error pdl_run_dprodover(pdl *a,pdl *b);
25 pdl_error pdl_run_cumuprodover(pdl *a,pdl *b);
26 pdl_error pdl_run_dcumuprodover(pdl *a,pdl *b);
27 pdl_error pdl_run_sumover(pdl *a,pdl *b);
28 pdl_error pdl_run_dsumover(pdl *a,pdl *b);
29 pdl_error pdl_run_cumusumover(pdl *a,pdl *b);
30 pdl_error pdl_run_dcumusumover(pdl *a,pdl *b);
31 pdl_error pdl_run_andover(pdl *a,pdl *b);
32 pdl_error pdl_run_bandover(pdl *a,pdl *b);
33 pdl_error pdl_run_borover(pdl *a,pdl *b);
34 pdl_error pdl_run_bxorover(pdl *a,pdl *b);
35 pdl_error pdl_run_firstnonzeroover(pdl *a,pdl *b);
36 pdl_error pdl_run_orover(pdl *a,pdl *b);
37 pdl_error pdl_run_xorover(pdl *a,pdl *b);
38 pdl_error pdl_run_zcover(pdl *a,pdl *b);
39 pdl_error pdl_run_numdiff(pdl *x,pdl *dx);
40 pdl_error pdl_run_diffcentred(pdl *a,pdl *o);
41 pdl_error pdl_run_diff2(pdl *a,pdl *o);
42 pdl_error pdl_run_intover(pdl *a,pdl *b);
43 pdl_error pdl_run_average(pdl *a,pdl *b);
44 pdl_error pdl_run_caverage(pdl *a,pdl *b);
45 pdl_error pdl_run_daverage(pdl *a,pdl *b);
46 pdl_error pdl_run_minimum(pdl *a,pdl *c);
47 pdl_error pdl_run_minimum_ind(pdl *a,pdl *c);
48 pdl_error pdl_run_minimum_n_ind(pdl *a,pdl *c,PDL_Indx m_size);
49 pdl_error pdl_run_maximum(pdl *a,pdl *c);
50 pdl_error pdl_run_maximum_ind(pdl *a,pdl *c);
51 pdl_error pdl_run_maximum_n_ind(pdl *a,pdl *c,PDL_Indx m_size);
52 pdl_error pdl_run_minmaximum(pdl *a,pdl *cmin,pdl *cmax,pdl *cmin_ind,pdl *cmax_ind);
53 pdl_error pdl_run_medover(pdl *a,pdl *b);
54 pdl_error pdl_run_oddmedover(pdl *a,pdl *b);
55 pdl_error pdl_run_modeover(pdl *data,pdl *out);
56 pdl_error pdl_run_pctover(pdl *a,pdl *p,pdl *b);
57 pdl_error pdl_run_oddpctover(pdl *a,pdl *p,pdl *b);
58 pdl_error pdl_run_qsort(pdl *a,pdl *b);
59 pdl_error pdl_run_qsorti(pdl *a,pdl *indx);
60 pdl_error pdl_run_qsortvec(pdl *a,pdl *b);
61 pdl_error pdl_run_qsortveci(pdl *a,pdl *indx);
62 pdl_error pdl_run_magnover(pdl *a,pdl *b);
63  
64 #line 449 "lib/PDL/PP.pm"
65 #include "pdlperl.h"
66 #line 67 "lib/PDL/Ufunc.xs"
67  
68 Core* PDL = NULL; /* Structure hold core C functions */
69  
70 MODULE = PDL::Ufunc PACKAGE = PDL PREFIX=pdl_run_
71  
72 PROTOTYPES: DISABLE
73  
74  
75 void
76 pdl_run_prodover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
77 SV *b_SV = items > 1 ? ST(1) : NULL;
78 PREINIT:
79 210 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 210 0 210
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 210 210
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 210 0 210
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 210 0 210
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 210 0 210
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 210 210
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 210 0 210
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 210 210
80 INPUT:
81 pdl *a
82 pdl *b
83 PPCODE:
84 210 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("prodover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("prodover: a->inplace but not supported"); 0 210 210
85 210 PDL->barf_if_error(pdl_run_prodover(a,b));
86 210 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 210 0 210
PDL_XS_RETURN(ST(0) = b_SV) 210 0 210
PDL_XS_RETURN(ST(0) = b_SV) 210 0 210
PDL_XS_RETURN(ST(0) = b_SV) 0 210 210
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
87  
88 void
89 pdl_run_dprodover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
90 SV *b_SV = items > 1 ? ST(1) : NULL;
91 PREINIT:
92 0 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
93 INPUT:
94 pdl *a
95 pdl *b
96 PPCODE:
97 0 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("dprodover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("dprodover: a->inplace but not supported"); 0 0 0
98 0 PDL->barf_if_error(pdl_run_dprodover(a,b));
99 0 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
100  
101 void
102 pdl_run_cumuprodover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
103 SV *b_SV = items > 1 ? ST(1) : NULL;
104 PREINIT:
105 0 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
106 INPUT:
107 pdl *a
108 pdl *b
109 PPCODE:
110 0 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("cumuprodover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("cumuprodover: a->inplace but not supported"); 0 0 0
111 0 PDL->barf_if_error(pdl_run_cumuprodover(a,b));
112 0 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
113  
114 void
115 pdl_run_dcumuprodover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
116 SV *b_SV = items > 1 ? ST(1) : NULL;
117 PREINIT:
118 0 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
119 INPUT:
120 pdl *a
121 pdl *b
122 PPCODE:
123 0 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("dcumuprodover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("dcumuprodover: a->inplace but not supported"); 0 0 0
124 0 PDL->barf_if_error(pdl_run_dcumuprodover(a,b));
125 0 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
126  
127 void
128 pdl_run_sumover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
129 SV *b_SV = items > 1 ? ST(1) : NULL;
130 PREINIT:
131 742 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 742 0 742
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 7 735 742
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 4 3 7
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 738 1 739
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 738 0 738
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 738 0 738
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 738 738
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 738 0 738
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 738 738
132 INPUT:
133 pdl *a
134 pdl *b
135 PPCODE:
136 738 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("sumover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("sumover: a->inplace but not supported"); 0 738 738
137 738 PDL->barf_if_error(pdl_run_sumover(a,b));
138 738 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 737 1 738
PDL_XS_RETURN(ST(0) = b_SV) 737 0 737
PDL_XS_RETURN(ST(0) = b_SV) 737 0 737
PDL_XS_RETURN(ST(0) = b_SV) 0 737 737
PDL_XS_RETURN(ST(0) = b_SV) 0 1 1
139  
140 void
141 pdl_run_dsumover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
142 SV *b_SV = items > 1 ? ST(1) : NULL;
143 PREINIT:
144 1 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1 0 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 1 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1 0 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1 0 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1 0 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 1 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1 0 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 1 1
145 INPUT:
146 pdl *a
147 pdl *b
148 PPCODE:
149 1 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("dsumover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("dsumover: a->inplace but not supported"); 0 1 1
150 1 PDL->barf_if_error(pdl_run_dsumover(a,b));
151 1 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 1 0 1
PDL_XS_RETURN(ST(0) = b_SV) 1 0 1
PDL_XS_RETURN(ST(0) = b_SV) 1 0 1
PDL_XS_RETURN(ST(0) = b_SV) 0 1 1
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
152  
153 void
154 pdl_run_cumusumover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
155 SV *b_SV = items > 1 ? ST(1) : NULL;
156 PREINIT:
157 2 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
158 INPUT:
159 pdl *a
160 pdl *b
161 PPCODE:
162 2 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("cumusumover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("cumusumover: a->inplace but not supported"); 0 2 2
163 2 PDL->barf_if_error(pdl_run_cumusumover(a,b));
164 2 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 2 0 2
PDL_XS_RETURN(ST(0) = b_SV) 2 0 2
PDL_XS_RETURN(ST(0) = b_SV) 2 0 2
PDL_XS_RETURN(ST(0) = b_SV) 0 2 2
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
165  
166 void
167 pdl_run_dcumusumover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
168 SV *b_SV = items > 1 ? ST(1) : NULL;
169 PREINIT:
170 0 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
171 INPUT:
172 pdl *a
173 pdl *b
174 PPCODE:
175 0 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("dcumusumover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("dcumusumover: a->inplace but not supported"); 0 0 0
176 0 PDL->barf_if_error(pdl_run_dcumusumover(a,b));
177 0 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
178  
179 void
180 pdl_run_andover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
181 SV *b_SV = items > 1 ? ST(1) : NULL;
182 PREINIT:
183 1905 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1905 0 1905
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 1905 1905
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1905 0 1905
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1905 0 1905
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1905 0 1905
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 1905 1905
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1905 0 1905
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 1905 1905
184 INPUT:
185 pdl *a
186 pdl *b
187 PPCODE:
188 1905 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("andover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("andover: a->inplace but not supported"); 0 1905 1905
189 1905 PDL->barf_if_error(pdl_run_andover(a,b));
190 1905 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 1905 0 1905
PDL_XS_RETURN(ST(0) = b_SV) 1905 0 1905
PDL_XS_RETURN(ST(0) = b_SV) 1905 0 1905
PDL_XS_RETURN(ST(0) = b_SV) 0 1905 1905
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
191  
192 void
193 pdl_run_bandover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
194 SV *b_SV = items > 1 ? ST(1) : NULL;
195 PREINIT:
196 2 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
197 INPUT:
198 pdl *a
199 pdl *b
200 PPCODE:
201 2 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("bandover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("bandover: a->inplace but not supported"); 0 2 2
202 2 PDL->barf_if_error(pdl_run_bandover(a,b));
203 2 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 2 0 2
PDL_XS_RETURN(ST(0) = b_SV) 2 0 2
PDL_XS_RETURN(ST(0) = b_SV) 2 0 2
PDL_XS_RETURN(ST(0) = b_SV) 0 2 2
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
204  
205 void
206 pdl_run_borover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
207 SV *b_SV = items > 1 ? ST(1) : NULL;
208 PREINIT:
209 2 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
210 INPUT:
211 pdl *a
212 pdl *b
213 PPCODE:
214 2 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("borover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("borover: a->inplace but not supported"); 0 2 2
215 2 PDL->barf_if_error(pdl_run_borover(a,b));
216 2 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 2 0 2
PDL_XS_RETURN(ST(0) = b_SV) 2 0 2
PDL_XS_RETURN(ST(0) = b_SV) 2 0 2
PDL_XS_RETURN(ST(0) = b_SV) 0 2 2
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
217  
218 void
219 pdl_run_bxorover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
220 SV *b_SV = items > 1 ? ST(1) : NULL;
221 PREINIT:
222 3 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 3 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 3 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 3 3
223 INPUT:
224 pdl *a
225 pdl *b
226 PPCODE:
227 3 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("bxorover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("bxorover: a->inplace but not supported"); 0 3 3
228 3 PDL->barf_if_error(pdl_run_bxorover(a,b));
229 3 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 3 0 3
PDL_XS_RETURN(ST(0) = b_SV) 3 0 3
PDL_XS_RETURN(ST(0) = b_SV) 3 0 3
PDL_XS_RETURN(ST(0) = b_SV) 0 3 3
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
230  
231 void
232 pdl_run_firstnonzeroover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
233 SV *b_SV = items > 1 ? ST(1) : NULL;
234 PREINIT:
235 1 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1 0 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 1 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1 0 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1 0 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1 0 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 1 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1 0 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 1 1
236 INPUT:
237 pdl *a
238 pdl *b
239 PPCODE:
240 1 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("firstnonzeroover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("firstnonzeroover: a->inplace but not supported"); 0 1 1
241 1 PDL->barf_if_error(pdl_run_firstnonzeroover(a,b));
242 1 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 1 0 1
PDL_XS_RETURN(ST(0) = b_SV) 1 0 1
PDL_XS_RETURN(ST(0) = b_SV) 1 0 1
PDL_XS_RETURN(ST(0) = b_SV) 0 1 1
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
243  
244 void
245 pdl_run_orover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
246 SV *b_SV = items > 1 ? ST(1) : NULL;
247 PREINIT:
248 83 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 83 0 83
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 83 83
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 83 0 83
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 83 0 83
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 83 0 83
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 83 83
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 83 0 83
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 83 83
249 INPUT:
250 pdl *a
251 pdl *b
252 PPCODE:
253 83 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("orover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("orover: a->inplace but not supported"); 0 83 83
254 83 PDL->barf_if_error(pdl_run_orover(a,b));
255 83 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 83 0 83
PDL_XS_RETURN(ST(0) = b_SV) 83 0 83
PDL_XS_RETURN(ST(0) = b_SV) 83 0 83
PDL_XS_RETURN(ST(0) = b_SV) 0 83 83
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
256  
257 void
258 pdl_run_xorover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
259 SV *b_SV = items > 1 ? ST(1) : NULL;
260 PREINIT:
261 3 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 3 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 3 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 3 3
262 INPUT:
263 pdl *a
264 pdl *b
265 PPCODE:
266 3 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("xorover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("xorover: a->inplace but not supported"); 0 3 3
267 3 PDL->barf_if_error(pdl_run_xorover(a,b));
268 3 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 3 0 3
PDL_XS_RETURN(ST(0) = b_SV) 3 0 3
PDL_XS_RETURN(ST(0) = b_SV) 3 0 3
PDL_XS_RETURN(ST(0) = b_SV) 0 3 3
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
269  
270 void
271 pdl_run_zcover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
272 SV *b_SV = items > 1 ? ST(1) : NULL;
273 PREINIT:
274 2 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
275 INPUT:
276 pdl *a
277 pdl *b
278 PPCODE:
279 2 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("zcover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("zcover: a->inplace but not supported"); 0 2 2
280 2 PDL->barf_if_error(pdl_run_zcover(a,b));
281 2 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 2 0 2
PDL_XS_RETURN(ST(0) = b_SV) 2 0 2
PDL_XS_RETURN(ST(0) = b_SV) 2 0 2
PDL_XS_RETURN(ST(0) = b_SV) 0 2 2
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
282  
283 void
284 pdl_run_numdiff(x, dx=dx)
285 SV *dx_SV = items > 1 ? ST(1) : NULL;
286 PREINIT:
287 4 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 4 0 4
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 4 4
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 4 0 4
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 4 0 4
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 4 0 4
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 4 4
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 4 0 4
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 4 4
288 INPUT:
289 pdl *x
290 pdl *dx=NO_INIT
291 PPCODE:
292 4 ▶ PDL_XS_INPLACE(x, dx)
Branch: 4 branches
BranchTrueFalseTotal
PDL_XS_INPLACE(x, dx) 1 3 4
PDL_XS_INPLACE(x, dx) 0 1 1
PDL_XS_INPLACE(x, dx) 0 3 3
PDL_XS_INPLACE(x, dx) 0 3 3
293 4 PDL->barf_if_error(pdl_run_numdiff(x,dx));
294 4 ▶ PDL_XS_RETURN(ST(0) = dx_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = dx_SV) 4 0 4
PDL_XS_RETURN(ST(0) = dx_SV) 4 0 4
PDL_XS_RETURN(ST(0) = dx_SV) 4 0 4
PDL_XS_RETURN(ST(0) = dx_SV) 0 4 4
PDL_XS_RETURN(ST(0) = dx_SV) 0 0 0
295  
296 void
297 pdl_run_diffcentred(a, o=PDL_XS_PERLINIT_initsv(o_SV))
298 SV *o_SV = items > 1 ? ST(1) : NULL;
299 PREINIT:
300 5 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 5 0 5
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 5 5
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 5 0 5
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 5 0 5
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 5 0 5
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 5 5
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 5 0 5
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 5 5
301 INPUT:
302 pdl *a
303 pdl *o
304 PPCODE:
305 5 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("diffcentred: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("diffcentred: a->inplace but not supported"); 0 5 5
306 5 PDL->barf_if_error(pdl_run_diffcentred(a,o));
307 5 ▶ PDL_XS_RETURN(ST(0) = o_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = o_SV) 5 0 5
PDL_XS_RETURN(ST(0) = o_SV) 5 0 5
PDL_XS_RETURN(ST(0) = o_SV) 5 0 5
PDL_XS_RETURN(ST(0) = o_SV) 0 5 5
PDL_XS_RETURN(ST(0) = o_SV) 0 0 0
308  
309 void
310 pdl_run_diff2(a, o=PDL_XS_PERLINIT_initsv(o_SV))
311 SV *o_SV = items > 1 ? ST(1) : NULL;
312 PREINIT:
313 34 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 34 0 34
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 34 34
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 34 0 34
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 34 0 34
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 34 0 34
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 34 34
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 34 0 34
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 34 34
314 INPUT:
315 pdl *a
316 pdl *o
317 PPCODE:
318 34 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("diff2: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("diff2: a->inplace but not supported"); 0 34 34
319 34 PDL->barf_if_error(pdl_run_diff2(a,o));
320 33 ▶ PDL_XS_RETURN(ST(0) = o_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = o_SV) 33 0 33
PDL_XS_RETURN(ST(0) = o_SV) 33 0 33
PDL_XS_RETURN(ST(0) = o_SV) 33 0 33
PDL_XS_RETURN(ST(0) = o_SV) 0 33 33
PDL_XS_RETURN(ST(0) = o_SV) 0 0 0
321  
322 void
323 pdl_run_intover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
324 SV *b_SV = items > 1 ? ST(1) : NULL;
325 PREINIT:
326 7 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 7 0 7
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 7 7
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 7 0 7
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 7 0 7
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 7 0 7
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 7 7
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 7 0 7
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 7 7
327 INPUT:
328 pdl *a
329 pdl *b
330 PPCODE:
331 7 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("intover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("intover: a->inplace but not supported"); 0 7 7
332 7 PDL->barf_if_error(pdl_run_intover(a,b));
333 7 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 7 0 7
PDL_XS_RETURN(ST(0) = b_SV) 7 0 7
PDL_XS_RETURN(ST(0) = b_SV) 7 0 7
PDL_XS_RETURN(ST(0) = b_SV) 0 7 7
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
334  
335 void
336 pdl_run_average(a, b=PDL_XS_PERLINIT_initsv(b_SV))
337 SV *b_SV = items > 1 ? ST(1) : NULL;
338 PREINIT:
339 27 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 27 0 27
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 27 27
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 27 0 27
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 27 0 27
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 27 0 27
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 27 27
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 27 0 27
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 27 27
340 INPUT:
341 pdl *a
342 pdl *b
343 PPCODE:
344 27 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("average: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("average: a->inplace but not supported"); 0 27 27
345 27 PDL->barf_if_error(pdl_run_average(a,b));
346 27 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 27 0 27
PDL_XS_RETURN(ST(0) = b_SV) 27 0 27
PDL_XS_RETURN(ST(0) = b_SV) 27 0 27
PDL_XS_RETURN(ST(0) = b_SV) 0 27 27
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
347  
348 void
349 pdl_run_caverage(a, b=PDL_XS_PERLINIT_initsv(b_SV))
350 SV *b_SV = items > 1 ? ST(1) : NULL;
351 PREINIT:
352 0 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
353 INPUT:
354 pdl *a
355 pdl *b
356 PPCODE:
357 0 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("caverage: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("caverage: a->inplace but not supported"); 0 0 0
358 0 PDL->barf_if_error(pdl_run_caverage(a,b));
359 0 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
360  
361 void
362 pdl_run_daverage(a, b=PDL_XS_PERLINIT_initsv(b_SV))
363 SV *b_SV = items > 1 ? ST(1) : NULL;
364 PREINIT:
365 0 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
366 INPUT:
367 pdl *a
368 pdl *b
369 PPCODE:
370 0 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("daverage: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("daverage: a->inplace but not supported"); 0 0 0
371 0 PDL->barf_if_error(pdl_run_daverage(a,b));
372 0 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
373  
374 void
375 pdl_run_minimum(a, c=PDL_XS_PERLINIT_initsv(c_SV))
376 SV *c_SV = items > 1 ? ST(1) : NULL;
377 PREINIT:
378 150 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 150 0 150
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 150 150
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 150 0 150
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 150 0 150
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 150 0 150
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 150 150
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 150 0 150
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 150 150
379 INPUT:
380 pdl *a
381 pdl *c
382 PPCODE:
383 150 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("minimum: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("minimum: a->inplace but not supported"); 0 150 150
384 150 PDL->barf_if_error(pdl_run_minimum(a,c));
385 150 ▶ PDL_XS_RETURN(ST(0) = c_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = c_SV) 149 1 150
PDL_XS_RETURN(ST(0) = c_SV) 149 0 149
PDL_XS_RETURN(ST(0) = c_SV) 149 0 149
PDL_XS_RETURN(ST(0) = c_SV) 0 149 149
PDL_XS_RETURN(ST(0) = c_SV) 0 1 1
386  
387 void
388 pdl_run_minimum_ind(a, c=PDL_XS_PERLINIT_initsv(c_SV))
389 SV *c_SV = items > 1 ? ST(1) : NULL;
390 PREINIT:
391 0 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
392 INPUT:
393 pdl *a
394 pdl *c
395 PPCODE:
396 0 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("minimum_ind: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("minimum_ind: a->inplace but not supported"); 0 0 0
397 0 PDL->barf_if_error(pdl_run_minimum_ind(a,c));
398 0 ▶ PDL_XS_RETURN(ST(0) = c_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = c_SV) 0 0 0
PDL_XS_RETURN(ST(0) = c_SV) 0 0 0
PDL_XS_RETURN(ST(0) = c_SV) 0 0 0
PDL_XS_RETURN(ST(0) = c_SV) 0 0 0
PDL_XS_RETURN(ST(0) = c_SV) 0 0 0
399  
400 void
401 _minimum_n_ind_int(a,c,m_size)
402 pdl *a
403 pdl *c
404 PDL_Indx m_size
405 CODE:
406 6 PDL->barf_if_error(pdl_run_minimum_n_ind(a,c,m_size));
407  
408 void
409 pdl_run_maximum(a, c=PDL_XS_PERLINIT_initsv(c_SV))
410 SV *c_SV = items > 1 ? ST(1) : NULL;
411 PREINIT:
412 1036 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1036 0 1036
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1 1035 1036
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1 0 1
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1036 0 1036
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1036 0 1036
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1036 0 1036
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 1036 1036
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 1036 0 1036
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 1036 1036
413 INPUT:
414 pdl *a
415 pdl *c
416 PPCODE:
417 1036 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("maximum: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("maximum: a->inplace but not supported"); 0 1036 1036
418 1036 PDL->barf_if_error(pdl_run_maximum(a,c));
419 1036 ▶ PDL_XS_RETURN(ST(0) = c_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = c_SV) 1035 1 1036
PDL_XS_RETURN(ST(0) = c_SV) 1035 0 1035
PDL_XS_RETURN(ST(0) = c_SV) 1035 0 1035
PDL_XS_RETURN(ST(0) = c_SV) 0 1035 1035
PDL_XS_RETURN(ST(0) = c_SV) 0 1 1
420  
421 void
422 pdl_run_maximum_ind(a, c=PDL_XS_PERLINIT_initsv(c_SV))
423 SV *c_SV = items > 1 ? ST(1) : NULL;
424 PREINIT:
425 94 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 94 0 94
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 94 94
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 94 0 94
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 94 0 94
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 94 0 94
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 94 94
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 94 0 94
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 94 94
426 INPUT:
427 pdl *a
428 pdl *c
429 PPCODE:
430 94 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("maximum_ind: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("maximum_ind: a->inplace but not supported"); 0 94 94
431 94 PDL->barf_if_error(pdl_run_maximum_ind(a,c));
432 94 ▶ PDL_XS_RETURN(ST(0) = c_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = c_SV) 94 0 94
PDL_XS_RETURN(ST(0) = c_SV) 94 0 94
PDL_XS_RETURN(ST(0) = c_SV) 94 0 94
PDL_XS_RETURN(ST(0) = c_SV) 0 94 94
PDL_XS_RETURN(ST(0) = c_SV) 0 0 0
433  
434 void
435 _maximum_n_ind_int(a,c,m_size)
436 pdl *a
437 pdl *c
438 PDL_Indx m_size
439 CODE:
440 1 PDL->barf_if_error(pdl_run_maximum_n_ind(a,c,m_size));
441  
442 void
443 pdl_run_minmaximum(a, cmin=PDL_XS_PERLINIT_initsv(cmin_SV), cmax=PDL_XS_PERLINIT_initsv(cmax_SV), cmin_ind=PDL_XS_PERLINIT_initsv(cmin_ind_SV), cmax_ind=PDL_XS_PERLINIT_initsv(cmax_ind_SV))
444 SV *cmin_SV = items > 1 ? ST(1) : NULL;
445 SV *cmax_SV = items > 2 ? ST(2) : NULL;
446 SV *cmin_ind_SV = items > 3 ? ST(3) : NULL;
447 SV *cmax_ind_SV = items > 4 ? ST(4) : NULL;
448 PREINIT:
449 34 ▶ PDL_XS_PREAMBLE((items == 5) ? 0 : 4);
Branch: 11 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 5) ? 0 : 4); 0 34 34
PDL_XS_PREAMBLE((items == 5) ? 0 : 4); 34 0 34
PDL_XS_PREAMBLE((items == 5) ? 0 : 4); 1 33 34
PDL_XS_PREAMBLE((items == 5) ? 0 : 4); 1 0 1
PDL_XS_PREAMBLE((items == 5) ? 0 : 4); 34 0 34
PDL_XS_PREAMBLE((items == 5) ? 0 : 4); 34 0 34
PDL_XS_PREAMBLE((items == 5) ? 0 : 4); 34 0 34
PDL_XS_PREAMBLE((items == 5) ? 0 : 4); 0 34 34
PDL_XS_PREAMBLE((items == 5) ? 0 : 4); 0 0 0
PDL_XS_PREAMBLE((items == 5) ? 0 : 4); 34 0 34
PDL_XS_PREAMBLE((items == 5) ? 0 : 4); 0 34 34
450 INPUT:
451 pdl *a
452 pdl *cmin
453 pdl *cmax
454 pdl *cmin_ind
455 pdl *cmax_ind
456 PPCODE:
457 34 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("minmaximum: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("minmaximum: a->inplace but not supported"); 0 34 34
458 34 PDL->barf_if_error(pdl_run_minmaximum(a,cmin,cmax,cmin_ind,cmax_ind));
459 34 ▶ PDL_XS_RETURN(ST(0) = cmin_SV;ST(1) = cmax_SV;ST(2) = cmin_ind_SV;ST(3) = cmax_ind_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = cmin_SV;ST(1) = cmax_SV;ST(2) = cmin_ind_SV;ST(3) = cmax_ind_SV) 34 0 34
PDL_XS_RETURN(ST(0) = cmin_SV;ST(1) = cmax_SV;ST(2) = cmin_ind_SV;ST(3) = cmax_ind_SV) 34 0 34
PDL_XS_RETURN(ST(0) = cmin_SV;ST(1) = cmax_SV;ST(2) = cmin_ind_SV;ST(3) = cmax_ind_SV) 34 0 34
PDL_XS_RETURN(ST(0) = cmin_SV;ST(1) = cmax_SV;ST(2) = cmin_ind_SV;ST(3) = cmax_ind_SV) 0 34 34
PDL_XS_RETURN(ST(0) = cmin_SV;ST(1) = cmax_SV;ST(2) = cmin_ind_SV;ST(3) = cmax_ind_SV) 0 0 0
460  
461 void
462 pdl_run_medover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
463 SV *b_SV = items > 1 ? ST(1) : NULL;
464 PREINIT:
465 33 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 33 0 33
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 33 33
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 33 0 33
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 33 0 33
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 33 0 33
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 33 33
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 33 0 33
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 33 33
466 INPUT:
467 pdl *a
468 pdl *b
469 PPCODE:
470 33 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("medover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("medover: a->inplace but not supported"); 0 33 33
471 33 PDL->barf_if_error(pdl_run_medover(a,b));
472 32 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 32 0 32
PDL_XS_RETURN(ST(0) = b_SV) 32 0 32
PDL_XS_RETURN(ST(0) = b_SV) 32 0 32
PDL_XS_RETURN(ST(0) = b_SV) 0 32 32
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
473  
474 void
475 pdl_run_oddmedover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
476 SV *b_SV = items > 1 ? ST(1) : NULL;
477 PREINIT:
478 3 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 3 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 3 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 3 0 3
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 3 3
479 INPUT:
480 pdl *a
481 pdl *b
482 PPCODE:
483 3 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("oddmedover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("oddmedover: a->inplace but not supported"); 0 3 3
484 3 PDL->barf_if_error(pdl_run_oddmedover(a,b));
485 3 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 3 0 3
PDL_XS_RETURN(ST(0) = b_SV) 3 0 3
PDL_XS_RETURN(ST(0) = b_SV) 3 0 3
PDL_XS_RETURN(ST(0) = b_SV) 0 3 3
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
486  
487 void
488 pdl_run_modeover(data, out=PDL_XS_PERLINIT_initsv(out_SV))
489 SV *out_SV = items > 1 ? ST(1) : NULL;
490 PREINIT:
491 2 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 2 0 2
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 2 2
492 INPUT:
493 pdl *data
494 pdl *out
495 PPCODE:
496 2 ▶ if (PDL_IS_INPLACE(data)) PDL->pdl_barf("modeover: data->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(data)) PDL->pdl_barf("modeover: data->inplace but not supported"); 0 2 2
497 2 PDL->barf_if_error(pdl_run_modeover(data,out));
498 2 ▶ PDL_XS_RETURN(ST(0) = out_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = out_SV) 2 0 2
PDL_XS_RETURN(ST(0) = out_SV) 2 0 2
PDL_XS_RETURN(ST(0) = out_SV) 2 0 2
PDL_XS_RETURN(ST(0) = out_SV) 0 2 2
PDL_XS_RETURN(ST(0) = out_SV) 0 0 0
499  
500 void
501 pdl_run_pctover(a, p, b=PDL_XS_PERLINIT_initsv(b_SV))
502 SV *b_SV = items > 2 ? ST(2) : NULL;
503 PREINIT:
504 10 ▶ PDL_XS_PREAMBLE((items == 3) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 10 0 10
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 0 10 10
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 10 0 10
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 10 0 10
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 10 0 10
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 0 10 10
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 10 0 10
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 0 10 10
505 INPUT:
506 pdl *a
507 pdl *p
508 pdl *b
509 PPCODE:
510 10 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("pctover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("pctover: a->inplace but not supported"); 0 10 10
511 10 ▶ if (PDL_IS_INPLACE(p)) PDL->pdl_barf("pctover: p->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(p)) PDL->pdl_barf("pctover: p->inplace but not supported"); 0 10 10
512 10 PDL->barf_if_error(pdl_run_pctover(a,p,b));
513 10 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 7 3 10
PDL_XS_RETURN(ST(0) = b_SV) 7 0 7
PDL_XS_RETURN(ST(0) = b_SV) 7 0 7
PDL_XS_RETURN(ST(0) = b_SV) 0 7 7
PDL_XS_RETURN(ST(0) = b_SV) 0 3 3
514  
515 void
516 pdl_run_oddpctover(a, p, b=PDL_XS_PERLINIT_initsv(b_SV))
517 SV *b_SV = items > 2 ? ST(2) : NULL;
518 PREINIT:
519 4 ▶ PDL_XS_PREAMBLE((items == 3) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 4 0 4
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 0 4 4
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 4 0 4
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 4 0 4
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 4 0 4
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 0 4 4
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 4 0 4
PDL_XS_PREAMBLE((items == 3) ? 0 : 1); 0 4 4
520 INPUT:
521 pdl *a
522 pdl *p
523 pdl *b
524 PPCODE:
525 4 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("oddpctover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("oddpctover: a->inplace but not supported"); 0 4 4
526 4 ▶ if (PDL_IS_INPLACE(p)) PDL->pdl_barf("oddpctover: p->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(p)) PDL->pdl_barf("oddpctover: p->inplace but not supported"); 0 4 4
527 4 PDL->barf_if_error(pdl_run_oddpctover(a,p,b));
528 4 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 0 4 4
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
PDL_XS_RETURN(ST(0) = b_SV) 0 4 4
529  
530 void
531 pdl_run_qsort(a, b=b)
532 SV *b_SV = items > 1 ? ST(1) : NULL;
533 PREINIT:
534 66 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 66 0 66
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 66 66
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 66 0 66
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 66 0 66
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 66 0 66
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 66 66
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 66 0 66
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 66 66
535 INPUT:
536 pdl *a
537 pdl *b=NO_INIT
538 PPCODE:
539 66 ▶ PDL_XS_INPLACE(a, b)
Branch: 4 branches
BranchTrueFalseTotal
PDL_XS_INPLACE(a, b) 10 56 66
PDL_XS_INPLACE(a, b) 0 10 10
PDL_XS_INPLACE(a, b) 1 55 56
PDL_XS_INPLACE(a, b) 0 55 55
540 66 PDL->barf_if_error(pdl_run_qsort(a,b));
541 65 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 65 0 65
PDL_XS_RETURN(ST(0) = b_SV) 65 0 65
PDL_XS_RETURN(ST(0) = b_SV) 65 0 65
PDL_XS_RETURN(ST(0) = b_SV) 0 65 65
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
542  
543 void
544 pdl_run_qsorti(a, indx=PDL_XS_PERLINIT_initsv(indx_SV))
545 SV *indx_SV = items > 1 ? ST(1) : NULL;
546 PREINIT:
547 15 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 15 0 15
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 15 15
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 15 0 15
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 15 0 15
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 15 0 15
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 15 15
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 15 0 15
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 15 15
548 INPUT:
549 pdl *a
550 pdl *indx
551 PPCODE:
552 15 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("qsorti: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("qsorti: a->inplace but not supported"); 0 15 15
553 15 PDL->barf_if_error(pdl_run_qsorti(a,indx));
554 14 ▶ PDL_XS_RETURN(ST(0) = indx_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = indx_SV) 14 0 14
PDL_XS_RETURN(ST(0) = indx_SV) 14 0 14
PDL_XS_RETURN(ST(0) = indx_SV) 14 0 14
PDL_XS_RETURN(ST(0) = indx_SV) 0 14 14
PDL_XS_RETURN(ST(0) = indx_SV) 0 0 0
555  
556 void
557 pdl_run_qsortvec(a, b=b)
558 SV *b_SV = items > 1 ? ST(1) : NULL;
559 PREINIT:
560 30 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 30 0 30
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 30 30
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 30 0 30
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 30 0 30
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 30 0 30
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 30 30
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 30 0 30
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 30 30
561 INPUT:
562 pdl *a
563 pdl *b=NO_INIT
564 PPCODE:
565 30 ▶ PDL_XS_INPLACE(a, b)
Branch: 4 branches
BranchTrueFalseTotal
PDL_XS_INPLACE(a, b) 3 27 30
PDL_XS_INPLACE(a, b) 0 3 3
PDL_XS_INPLACE(a, b) 1 26 27
PDL_XS_INPLACE(a, b) 0 26 26
566 30 PDL->barf_if_error(pdl_run_qsortvec(a,b));
567 29 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 29 0 29
PDL_XS_RETURN(ST(0) = b_SV) 29 0 29
PDL_XS_RETURN(ST(0) = b_SV) 29 0 29
PDL_XS_RETURN(ST(0) = b_SV) 0 29 29
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
568  
569 void
570 pdl_run_qsortveci(a, indx=PDL_XS_PERLINIT_initsv(indx_SV))
571 SV *indx_SV = items > 1 ? ST(1) : NULL;
572 PREINIT:
573 8 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 8 0 8
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 8 8
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 8 0 8
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 8 0 8
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 8 0 8
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 8 8
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 8 0 8
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 8 8
574 INPUT:
575 pdl *a
576 pdl *indx
577 PPCODE:
578 8 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("qsortveci: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("qsortveci: a->inplace but not supported"); 0 8 8
579 8 PDL->barf_if_error(pdl_run_qsortveci(a,indx));
580 7 ▶ PDL_XS_RETURN(ST(0) = indx_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = indx_SV) 6 1 7
PDL_XS_RETURN(ST(0) = indx_SV) 6 0 6
PDL_XS_RETURN(ST(0) = indx_SV) 6 0 6
PDL_XS_RETURN(ST(0) = indx_SV) 0 6 6
PDL_XS_RETURN(ST(0) = indx_SV) 0 1 1
581  
582 void
583 pdl_run_magnover(a, b=PDL_XS_PERLINIT_initsv(b_SV))
584 SV *b_SV = items > 1 ? ST(1) : NULL;
585 PREINIT:
586 29 ▶ PDL_XS_PREAMBLE((items == 2) ? 0 : 1);
Branch: 10 branches
BranchTrueFalseTotal
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 29 0 29
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 29 29
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 29 0 29
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 29 0 29
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 29 0 29
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 29 29
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 0 0
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 29 0 29
PDL_XS_PREAMBLE((items == 2) ? 0 : 1); 0 29 29
587 INPUT:
588 pdl *a
589 pdl *b
590 PPCODE:
591 29 ▶ if (PDL_IS_INPLACE(a)) PDL->pdl_barf("magnover: a->inplace but not supported");
Branch: 1 branch
BranchTrueFalseTotal
if (PDL_IS_INPLACE(a)) PDL->pdl_barf("magnover: a->inplace but not supported"); 0 29 29
592 29 PDL->barf_if_error(pdl_run_magnover(a,b));
593 29 ▶ PDL_XS_RETURN(ST(0) = b_SV)
Branch: 5 branches
BranchTrueFalseTotal
PDL_XS_RETURN(ST(0) = b_SV) 29 0 29
PDL_XS_RETURN(ST(0) = b_SV) 29 0 29
PDL_XS_RETURN(ST(0) = b_SV) 29 0 29
PDL_XS_RETURN(ST(0) = b_SV) 0 29 29
PDL_XS_RETURN(ST(0) = b_SV) 0 0 0
594  
595  
596 #line 483 "lib/PDL/PP.pm"
597 BOOT:
598 /* Get pointer to structure of core shared C routines */
599 /* make sure PDL::Core is loaded */
600 #line 601 "lib/PDL/Ufunc.xs"
601 71 perl_require_pv ("PDL/Core.pm"); /* make sure PDL::Core is loaded */
602 #ifndef aTHX_
603 #define aTHX_
604 #endif
605 71 ▶ if (SvTRUE (ERRSV)) Perl_croak(aTHX_ "%s",SvPV_nolen (ERRSV));
Branch: 3 branches
BranchTrueFalseTotal
if (SvTRUE (ERRSV)) Perl_croak(aTHX_ "%s",SvPV_nolen (ERRSV)); 71 0 71
if (SvTRUE (ERRSV)) Perl_croak(aTHX_ "%s",SvPV_nolen (ERRSV)); 0 71 71
if (SvTRUE (ERRSV)) Perl_croak(aTHX_ "%s",SvPV_nolen (ERRSV)); 0 0 0
606 71 SV* CoreSV = perl_get_sv("PDL::SHARE",FALSE); /* var with core structure */
607 71 ▶ if (!CoreSV)
Branch: 1 branch
BranchTrueFalseTotal
if (!CoreSV) 0 71 71
608 0 Perl_croak(aTHX_ "We require the PDL::Core module, which was not found");
609 71 ▶ if (!(PDL = INT2PTR(Core*,SvIV( CoreSV )))) /* Core* value */
Branch: 1 branch
BranchTrueFalseTotal
if (!(PDL = INT2PTR(Core*,SvIV( CoreSV )))) /* Core* value */ 0 71 71
610 0 Perl_croak(aTHX_ "Got NULL pointer for PDL");
611 71 ▶ if (PDL->Version != PDL_CORE_VERSION)
Branch: 1 branch
BranchTrueFalseTotal
if (PDL->Version != PDL_CORE_VERSION) 0 71 71
612 0 Perl_croak(aTHX_ "[PDL->Version: %ld PDL_CORE_VERSION: %ld XS_VERSION: %s] PDL::Ufunc needs to be recompiled against the newly installed PDL", (long int)PDL->Version, (long int)PDL_CORE_VERSION, XS_VERSION);
« lib/PDL/Ops-pp-eq.c ↑ Summary lib/PDL/Primitive-xoshiro256plus.c »