1 /* This file is part of the Sub::Nary Perl module.
2 * See http://search.cpan.org/dist/Sub::Nary/ */
4 #define PERL_NO_GET_CONTEXT
10 # define mPUSHi(I) PUSHs(sv_2mortal(newSViv(I)))
18 STATIC U32 sn_hash_list = 0;
20 /* --- XS ------------------------------------------------------------------ */
22 MODULE = Sub::Nary PACKAGE = Sub::Nary
28 PERL_HASH(sn_hash_list, "list", 4);
35 ST(0) = sv_2mortal(newSVuv(SvUV(SvRV(op))));
44 o = INT2PTR(OP *, SvUV(SvRV(op)));
45 ST(0) = sv_2mortal(newSVuv(o == NULL));
58 res = SvNOK(sv) ? SvNV(sv) == 0.0 : SvUV(sv) == 0;
62 res = hv_exists(hv, "0", 1) && hv_iterinit(hv) == 1;
75 res = strEQ(SvPV_nolen(sv), "list");
79 res = hv_exists(hv, "list", 4) && hv_iterinit(hv) == 1;
96 while (key = hv_iternext(hv)) {
97 c += SvNV(HeVAL(key));
115 if (!hv_store_ent(res, sv, val, 0))
118 hv = (HV *) SvRV(sv);
119 if (!hv_iterinit(hv)) {
121 if (!hv_store(res, "0", 1, val, 0))
124 while (key = hv_iternext(hv)) {
125 c += SvNV(HeVAL(key));
128 while (key = hv_iternext(hv)) {
129 val = newSVnv(SvNV(HeVAL(key)) / c);
130 if (!hv_store_ent(res, HeSVKEY_force(key), val, HeHASH(key)))
135 ST(0) = sv_2mortal(newRV_noinc((SV *) res));
139 scale(SV *csv, SV *sv)
154 if (!hv_store_ent(res, sv, val, 0))
157 hv = (HV *) SvRV(sv);
158 if (!hv_iterinit(hv)) {
160 if (!hv_store(res, "0", 1, val, 0))
164 while (key = hv_iternext(hv)) {
165 val = newSVnv(SvNV(HeVAL(key)) * c);
166 if (!hv_store_ent(res, HeSVKEY_force(key), val, HeHASH(key)))
171 ST(0) = sv_2mortal(newRV_noinc((SV *) res));
186 UV shift = 0, do_shift = 0;
187 sn_combcache *cache = NULL;
192 res[0] = res[1] = NULL;
193 for (i = 0; i < items; ++i) {
198 if (strEQ(SvPV_nolen(cur), "list")) {
202 if (!hv_store(res[0], "list", 4, val, sn_hash_list))
216 while (key = hv_iternext((HV *) cur)) {
217 val = newSVsv(HeVAL(key));
218 if (!hv_store_ent(res[0], HeSVKEY_force(key), val, 0))
226 temp = sv_2mortal(newSViv(0));
227 for (++i; i < items; ++i) {
232 if (strEQ(SvPV_nolen(cur), "list")) {
235 if (!hv_store(res[n], "list", 4, val, sn_hash_list))
251 list1 = hv_delete((HV *) cur, "list", 4, 0);
252 n1 = hv_iterinit((HV *) cur);
253 list2 = hv_delete(res[n], "list", 4, 0);
254 n2 = hv_iterinit(res[n]);
255 if ((list1 && !n1) || (list2 && !n2)) {
257 if (!hv_store(res[o], "list", 4, val, sn_hash_list))
261 } else if (list1 || list2) {
262 NV l1 = list1 ? SvNV(list1) : 0;
263 NV l2 = list2 ? SvNV(list2) : 0;
264 val = newSVnv(l1 + l2 - l1 * l2);
265 if (!hv_store(res[o], "list", 4, val, sn_hash_list))
269 Renew(cache, n2, sn_combcache);
273 while (key = hv_iternext(res[n])) {
274 cache[j].k = SvUV(HeSVKEY_force(key));
275 cache[j].v = SvNV(HeVAL(key));
278 while (key = hv_iternext((HV *) cur)) {
279 IV k = SvUV(HeSVKEY_force(key));
280 NV v = SvNV(HeVAL(key));
281 for (j = 0; j < n2; ++j) {
282 sv_setiv(temp, k + cache[j].k);
283 if ((old = hv_fetch_ent(res[o], temp, 1, 0)) && SvOK(val = HeVAL(old))) {
284 val = newSVnv(SvNV(val) + v * cache[j].v);
286 val = newSVnv(v * cache[j].v);
288 if (!hv_store_ent(res[o], temp, val, 0))
295 if (shift || do_shift) {
298 sv_setiv(temp, shift);
300 if (!hv_store_ent(res[n], temp, val, 0))
308 list1 = hv_delete(res[n], "list", 4, 0);
310 while (key = hv_iternext(res[n])) {
311 sv_setiv(temp, SvUV(HeSVKEY_force(key)) + shift);
312 val = newSVsv(HeVAL(key));
313 if (!hv_store_ent(res[o], temp, val, 0))
317 val = newSVsv(list1);
318 if (!hv_store(res[o], "list", 4, val, sn_hash_list))
323 } else if (!res[0] && !res[1])
326 SvREFCNT_dec(res[0]);
328 SvREFCNT_dec(res[1]);
329 ST(0) = sv_2mortal(newRV_noinc((SV *) res[n]));
340 if (cxt == G_SCALAR) {
341 for (i = 0; i < OP_max; ++i) {
342 count += (PL_opargs[i] & (OA_RETSCALAR | OA_RETINTEGER)) != 0;
347 } else if (cxt == G_ARRAY) {
348 for (i = 0; i < OP_max; ++i) {
349 if (PL_opargs[i] & (OA_RETSCALAR | OA_RETINTEGER)) {
350 const char *name = PL_op_name[i];
351 XPUSHs(sv_2mortal(newSVpvn_share(name, strlen(name), 0)));