1 /* Copyright (c) 1997-2000 Graham Barr <gbarr@pobox.com>. All rights reserved.
2 * This program is free software; you can redistribute it and/or
3 * modify it under the same terms as Perl itself.
9 #include <patchlevel.h>
13 # define gv_stashpvn(n,l,c) gv_stashpv(n,c)
20 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
21 MAGIC *mg = mg_find(sv, 't');
22 if (mg && ((mg->mg_len & 1) || (mg->mg_len & 2) && mg->mg_obj == sv))
28 # define SvTAINTED_on(sv) sv_magic((sv), Nullsv, 't', Nullch, 0)
29 # define SvTAINTED(sv) (SvMAGICAL(sv) && sv_tainted(sv))
31 # define PL_defgv defgv
33 # define PL_curpad curpad
34 # define CALLRUNOPS runops
35 # define PL_curpm curpm
36 # define PL_sv_undef sv_undef
37 # define PERL_CONTEXT struct context
39 #if (PATCHLEVEL < 5) || (PATCHLEVEL == 5 && SUBVERSION <50)
41 # define PL_tainting tainting
43 # ifndef PL_stack_base
44 # define PL_stack_base stack_base
47 # define PL_stack_sp stack_sp
50 # define PL_ppaddr ppaddr
54 MODULE=List::Util PACKAGE=List::Util
72 for(index = 1 ; index < items ; index++) {
73 SV *stacksv = ST(index);
74 NV val = SvNV(stacksv);
75 if(val < retval ? !ix : ix) {
96 for(index = 1 ; index < items ; index++) {
97 RETVAL += SvNV(ST(index));
118 sv_cmp & sv_cmp_locale return 1,0,-1 for gt,eq,lt
119 so we set ix to the value we are looking for
120 xsubpp does not allow -ve values, so we start with 0,2 and subtract 1
125 if(MAXARG & OPpLOCALE) {
126 for(index = 1 ; index < items ; index++) {
127 SV *right = ST(index);
128 if(sv_cmp_locale(left, right) == ix)
134 for(index = 1 ; index < items ; index++) {
135 SV *right = ST(index);
136 if(sv_cmp(left, right) == ix)
164 agv = gv_fetchpv("a", TRUE, SVt_PV);
165 bgv = gv_fetchpv("b", TRUE, SVt_PV);
168 cv = sv_2cv(block, &stash, &gv, 0);
169 reducecop = CvSTART(cv);
170 SAVESPTR(CvROOT(cv)->op_ppaddr);
171 CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
173 PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
177 markix = sp - PL_stack_base;
178 for(index = 2 ; index < items ; index++) {
180 GvSV(bgv) = ST(index);
204 SAVESPTR(GvSV(PL_defgv));
205 cv = sv_2cv(block, &stash, &gv, 0);
206 reducecop = CvSTART(cv);
207 SAVESPTR(CvROOT(cv)->op_ppaddr);
208 CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
210 PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
213 markix = sp - PL_stack_base;
214 for(index = 1 ; index < items ; index++) {
215 GvSV(PL_defgv) = ST(index);
218 if (SvTRUE(*PL_stack_sp)) {
226 MODULE=List::Util PACKAGE=Scalar::Util
236 char *ptr = SvPV(str,len);
237 ST(0) = sv_newmortal();
238 (void)SvUPGRADE(ST(0),SVt_PVNV);
239 sv_setpvn(ST(0),ptr,len);
240 if(SvNOKp(num) || !SvIOKp(num)) {
241 SvNVX(ST(0)) = SvNV(num);
245 SvIVX(ST(0)) = SvIV(num);
248 if(PL_tainting && (SvTAINTED(num) || SvTAINTED(str)))
261 if(!sv_isobject(sv)) {
264 RETVAL = sv_reftype(SvRV(sv),TRUE);
280 RETVAL = sv_reftype(SvRV(sv),FALSE);
293 croak("weak references are not implemented in this release of perl");
302 ST(0) = boolSV(SvROK(sv) && SvWEAKREF(sv));
305 croak("weak references are not implemented in this release of perl");
313 RETVAL = SvREADONLY(sv);
322 RETVAL = SvTAINTED(sv);
329 HV *stash = gv_stashpvn("Scalar::Util", 12, TRUE);
330 GV *vargv = *(GV**)hv_fetch(stash, "EXPORT_FAIL", 11, TRUE);
332 if (SvTYPE(vargv) != SVt_PVGV)
333 gv_init(vargv, stash, "Scalar::Util", 12, TRUE);
334 varav = GvAVn(vargv);
335 av_push(varav, newSVpv("weaken",6));
336 av_push(varav, newSVpv("isweak",6));