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.
11 # include "patchlevel.h"
12 # define PERL_REVISION 5
13 # define PERL_VERSION PATCHLEVEL
14 # define PERL_SUBVERSION SUBVERSION
19 # define gv_stashpvn(n,l,c) gv_stashpv(n,c)
26 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
27 MAGIC *mg = mg_find(sv, 't');
28 if (mg && ((mg->mg_len & 1) || (mg->mg_len & 2) && mg->mg_obj == sv))
34 # define SvTAINTED_on(sv) sv_magic((sv), Nullsv, 't', Nullch, 0)
35 # define SvTAINTED(sv) (SvMAGICAL(sv) && sv_tainted(sv))
37 # define PL_defgv defgv
39 # define PL_curpad curpad
40 # define CALLRUNOPS runops
41 # define PL_curpm curpm
42 # define PL_sv_undef sv_undef
43 # define PERL_CONTEXT struct context
45 #if (PERL_VERSION < 5) || (PERL_VERSION == 5 && PERL_SUBVERSION <50)
47 # define PL_tainting tainting
49 # ifndef PL_stack_base
50 # define PL_stack_base stack_base
53 # define PL_stack_sp stack_sp
56 # define PL_ppaddr ppaddr
60 MODULE=List::Util PACKAGE=List::Util
78 for(index = 1 ; index < items ; index++) {
79 SV *stacksv = ST(index);
80 NV val = SvNV(stacksv);
81 if(val < retval ? !ix : ix) {
101 RETVAL = SvNV(ST(0));
102 for(index = 1 ; index < items ; index++) {
103 RETVAL += SvNV(ST(index));
124 sv_cmp & sv_cmp_locale return 1,0,-1 for gt,eq,lt
125 so we set ix to the value we are looking for
126 xsubpp does not allow -ve values, so we start with 0,2 and subtract 1
131 if(MAXARG & OPpLOCALE) {
132 for(index = 1 ; index < items ; index++) {
133 SV *right = ST(index);
134 if(sv_cmp_locale(left, right) == ix)
140 for(index = 1 ; index < items ; index++) {
141 SV *right = ST(index);
142 if(sv_cmp(left, right) == ix)
169 agv = gv_fetchpv("a", TRUE, SVt_PV);
170 bgv = gv_fetchpv("b", TRUE, SVt_PV);
173 cv = sv_2cv(block, &stash, &gv, 0);
174 reducecop = CvSTART(cv);
175 SAVESPTR(CvROOT(cv)->op_ppaddr);
176 CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
178 PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
182 for(index = 2 ; index < items ; index++) {
184 GvSV(bgv) = ST(index);
207 SAVESPTR(GvSV(PL_defgv));
208 cv = sv_2cv(block, &stash, &gv, 0);
209 reducecop = CvSTART(cv);
210 SAVESPTR(CvROOT(cv)->op_ppaddr);
211 CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
213 PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
216 for(index = 1 ; index < items ; index++) {
217 GvSV(PL_defgv) = ST(index);
220 if (SvTRUE(*PL_stack_sp)) {
228 MODULE=List::Util PACKAGE=Scalar::Util
238 char *ptr = SvPV(str,len);
239 ST(0) = sv_newmortal();
240 (void)SvUPGRADE(ST(0),SVt_PVNV);
241 sv_setpvn(ST(0),ptr,len);
242 if(SvNOKp(num) || !SvIOKp(num)) {
243 SvNVX(ST(0)) = SvNV(num);
247 SvIVX(ST(0)) = SvIV(num);
250 if(PL_tainting && (SvTAINTED(num) || SvTAINTED(str)))
263 if(!sv_isobject(sv)) {
266 RETVAL = sv_reftype(SvRV(sv),TRUE);
282 RETVAL = sv_reftype(SvRV(sv),FALSE);
295 croak("weak references are not implemented in this release of perl");
304 ST(0) = boolSV(SvROK(sv) && SvWEAKREF(sv));
307 croak("weak references are not implemented in this release of perl");
315 RETVAL = SvREADONLY(sv);
324 RETVAL = SvTAINTED(sv);
331 HV *stash = gv_stashpvn("Scalar::Util", 12, TRUE);
332 GV *vargv = *(GV**)hv_fetch(stash, "EXPORT_FAIL", 11, TRUE);
334 if (SvTYPE(vargv) != SVt_PVGV)
335 gv_init(vargv, stash, "Scalar::Util", 12, TRUE);
336 varav = GvAVn(vargv);
337 av_push(varav, newSVpv("weaken",6));
338 av_push(varav, newSVpv("isweak",6));