[p5sagit/p5-mst-13.2.git] / ext / List / Util / Util.xs

/* Copyright (c) 1997-2000 Graham Barr <gbarr@pobox.com>. All rights reserved.
 * This program is free software; you can redistribute it and/or
 * modify it under the same terms as Perl itself.
 */

#include <EXTERN.h>
#include <perl.h>
#include <XSUB.h>

#ifndef PERL_VERSION
#    include <patchlevel.h>
#    if !(defined(PERL_VERSION) || (SUBVERSION > 0 && defined(PATCHLEVEL)))
#        include <could_not_find_Perl_patchlevel.h>
#    endif
#    define PERL_REVISION	5
#    define PERL_VERSION	PATCHLEVEL
#    define PERL_SUBVERSION	SUBVERSION
#endif

#ifndef aTHX
#  define aTHX
#  define pTHX
#endif

/* Some platforms have strict exports. And before 5.7.3 cxinc (or Perl_cxinc)
   was not exported. Therefore platforms like win32, VMS etc have problems
   so we redefine it here -- GMB
*/
#if PERL_VERSION < 7
/* Not in 5.6.1. */
#  define SvUOK(sv)           SvIOK_UV(sv)
#  ifdef cxinc
#    undef cxinc
#  endif
#  define cxinc() my_cxinc(aTHX)
static I32
my_cxinc(pTHX)
{
    cxstack_max = cxstack_max * 3 / 2;
    Renew(cxstack, cxstack_max + 1, struct context);      /* XXX should fix CXINC macro */
    return cxstack_ix + 1;
}
#endif

#if PERL_VERSION < 6
#    define NV double
#endif

#ifdef SVf_IVisUV
#  define slu_sv_value(sv) (SvIOK(sv)) ? (SvIOK_UV(sv)) ? (NV)(SvUVX(sv)) : (NV)(SvIVX(sv)) : (SvNV(sv))
#else
#  define slu_sv_value(sv) (SvIOK(sv)) ? (NV)(SvIVX(sv)) : (SvNV(sv))
#endif

#ifndef Drand01
#    define Drand01()		((rand() & 0x7FFF) / (double) ((unsigned long)1 << 15))
#endif

#if PERL_VERSION < 5
#  ifndef gv_stashpvn
#    define gv_stashpvn(n,l,c) gv_stashpv(n,c)
#  endif
#  ifndef SvTAINTED

static bool
sv_tainted(SV *sv)
{
    if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
	MAGIC *mg = mg_find(sv, 't');
	if (mg && ((mg->mg_len & 1) || (mg->mg_len & 2) && mg->mg_obj == sv))
	    return TRUE;
    }
    return FALSE;
}

#    define SvTAINTED_on(sv) sv_magic((sv), Nullsv, 't', Nullch, 0)
#    define SvTAINTED(sv) (SvMAGICAL(sv) && sv_tainted(sv))
#  endif
#  define PL_defgv defgv
#  define PL_op op
#  define PL_curpad curpad
#  define CALLRUNOPS runops
#  define PL_curpm curpm
#  define PL_sv_undef sv_undef
#  define PERL_CONTEXT struct context
#endif
#if (PERL_VERSION < 5) || (PERL_VERSION == 5 && PERL_SUBVERSION <50)
#  ifndef PL_tainting
#    define PL_tainting tainting
#  endif
#  ifndef PL_stack_base
#    define PL_stack_base stack_base
#  endif
#  ifndef PL_stack_sp
#    define PL_stack_sp stack_sp
#  endif
#  ifndef PL_ppaddr
#    define PL_ppaddr ppaddr
#  endif
#endif

#ifndef PTR2UV
#  define PTR2UV(ptr) (UV)(ptr)
#endif

#ifndef SvUV_set
#  define SvUV_set(sv, val) (((XPVUV*)SvANY(sv))->xuv_uv = (val))
#endif

#ifdef HASATTRIBUTE
#  if (defined(__GNUC__) && defined(__cplusplus)) || defined(__INTEL_COMPILER)
#    define PERL_UNUSED_DECL
#  else
#    define PERL_UNUSED_DECL __attribute__((unused))
#  endif
#else
#  define PERL_UNUSED_DECL
#endif

#ifndef dNOOP
#define dNOOP extern int Perl___notused PERL_UNUSED_DECL
#endif

#ifndef dVAR
#define dVAR dNOOP
#endif

MODULE=List::Util	PACKAGE=List::Util

void
min(...)
PROTOTYPE: @
ALIAS:
    min = 0
    max = 1
CODE:
{
    int index;
    NV retval;
    SV *retsv;
    if(!items) {
	XSRETURN_UNDEF;
    }
    retsv = ST(0);
    retval = slu_sv_value(retsv);
    for(index = 1 ; index < items ; index++) {
	SV *stacksv = ST(index);
	NV val = slu_sv_value(stacksv);
	if(val < retval ? !ix : ix) {
	    retsv = stacksv;
	    retval = val;
	}
    }
    ST(0) = retsv;
    XSRETURN(1);
}


NV
sum(...)
PROTOTYPE: @
CODE:
{
    SV *sv;
    int index;
    if(!items) {
	XSRETURN_UNDEF;
    }
    sv = ST(0);
    RETVAL = slu_sv_value(sv);
    for(index = 1 ; index < items ; index++) {
	sv = ST(index);
	RETVAL += slu_sv_value(sv);
    }
}
OUTPUT:
    RETVAL


void
minstr(...)
PROTOTYPE: @
ALIAS:
    minstr = 2
    maxstr = 0
CODE:
{
    SV *left;
    int index;
    if(!items) {
	XSRETURN_UNDEF;
    }
    /*
      sv_cmp & sv_cmp_locale return 1,0,-1 for gt,eq,lt
      so we set ix to the value we are looking for
      xsubpp does not allow -ve values, so we start with 0,2 and subtract 1
    */
    ix -= 1;
    left = ST(0);
#ifdef OPpLOCALE
    if(MAXARG & OPpLOCALE) {
	for(index = 1 ; index < items ; index++) {
	    SV *right = ST(index);
	    if(sv_cmp_locale(left, right) == ix)
		left = right;
	}
    }
    else {
#endif
	for(index = 1 ; index < items ; index++) {
	    SV *right = ST(index);
	    if(sv_cmp(left, right) == ix)
		left = right;
	}
#ifdef OPpLOCALE
    }
#endif
    ST(0) = left;
    XSRETURN(1);
}


void
reduce(block,...)
    SV * block
PROTOTYPE: &@
CODE:
{
    dVAR;
    SV *ret = sv_newmortal();
    int index;
    GV *agv,*bgv,*gv;
    HV *stash;
    CV *cv;
    OP *reducecop;
    PERL_CONTEXT *cx;
    SV** newsp;
    I32 gimme = G_SCALAR;
    U8 hasargs = 0;
    bool oldcatch = CATCH_GET;

    if(items <= 1) {
	XSRETURN_UNDEF;
    }
    agv = gv_fetchpv("a", TRUE, SVt_PV);
    bgv = gv_fetchpv("b", TRUE, SVt_PV);
    SAVESPTR(GvSV(agv));
    SAVESPTR(GvSV(bgv));
    GvSV(agv) = ret;
    cv = sv_2cv(block, &stash, &gv, 0);
    reducecop = CvSTART(cv);
    SAVESPTR(CvROOT(cv)->op_ppaddr);
    CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
#ifdef PAD_SET_CUR
    PAD_SET_CUR(CvPADLIST(cv),1);
#else
    SAVESPTR(PL_curpad);
    PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
#endif
    SAVETMPS;
    SAVESPTR(PL_op);
    SvSetSV(ret, ST(1));
    CATCH_SET(TRUE);
    PUSHBLOCK(cx, CXt_SUB, SP);
    PUSHSUB(cx);
    for(index = 2 ; index < items ; index++) {
	GvSV(bgv) = ST(index);
	PL_op = reducecop;
	CALLRUNOPS(aTHX);
	SvSetSV(ret, *PL_stack_sp);
    }
    ST(0) = ret;
    POPBLOCK(cx,PL_curpm);
    CATCH_SET(oldcatch);
    XSRETURN(1);
}

void
first(block,...)
    SV * block
PROTOTYPE: &@
CODE:
{
    dVAR;
    int index;
    GV *gv;
    HV *stash;
    CV *cv;
    OP *reducecop;
    PERL_CONTEXT *cx;
    SV** newsp;
    I32 gimme = G_SCALAR;
    U8 hasargs = 0;
    bool oldcatch = CATCH_GET;

    if(items <= 1) {
	XSRETURN_UNDEF;
    }
    SAVESPTR(GvSV(PL_defgv));
    cv = sv_2cv(block, &stash, &gv, 0);
    reducecop = CvSTART(cv);
    SAVESPTR(CvROOT(cv)->op_ppaddr);
    CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
#ifdef PAD_SET_CUR
    PAD_SET_CUR(CvPADLIST(cv),1);
#else
    SAVESPTR(PL_curpad);
    PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
#endif
    SAVETMPS;
    SAVESPTR(PL_op);
    CATCH_SET(TRUE);
    PUSHBLOCK(cx, CXt_SUB, SP);
    PUSHSUB(cx);

    for(index = 1 ; index < items ; index++) {
	GvSV(PL_defgv) = ST(index);
	PL_op = reducecop;
	CALLRUNOPS(aTHX);
	if (SvTRUE(*PL_stack_sp)) {
	  ST(0) = ST(index);
	  POPBLOCK(cx,PL_curpm);
	  CATCH_SET(oldcatch);
	  XSRETURN(1);
	}
    }
    POPBLOCK(cx,PL_curpm);
    CATCH_SET(oldcatch);
    XSRETURN_UNDEF;
}

void
shuffle(...)
PROTOTYPE: @
CODE:
{
    dVAR;
    int index;
    struct op dmy_op;
    struct op *old_op = PL_op;

    /* We call pp_rand here so that Drand01 get initialized if rand()
       or srand() has not already been called
    */
    memzero((char*)(&dmy_op), sizeof(struct op));
    /* we let pp_rand() borrow the TARG allocated for this XS sub */
    dmy_op.op_targ = PL_op->op_targ;
    PL_op = &dmy_op;
    (void)*(PL_ppaddr[OP_RAND])(aTHX);
    PL_op = old_op;
    for (index = items ; index > 1 ; ) {
	int swap = (int)(Drand01() * (double)(index--));
	SV *tmp = ST(swap);
	ST(swap) = ST(index);
	ST(index) = tmp;
    }
    XSRETURN(items);
}


MODULE=List::Util	PACKAGE=Scalar::Util

void
dualvar(num,str)
    SV *	num
    SV *	str
PROTOTYPE: $$
CODE:
{
    STRLEN len;
    char *ptr = SvPV(str,len);
    ST(0) = sv_newmortal();
    (void)SvUPGRADE(ST(0),SVt_PVNV);
    sv_setpvn(ST(0),ptr,len);
    if(SvNOK(num) || SvPOK(num) || SvMAGICAL(num)) {
	SvNV_set(ST(0), SvNV(num));
	SvNOK_on(ST(0));
    }
#ifdef SVf_IVisUV
    else if (SvUOK(num)) {
	SvUV_set(ST(0), SvUV(num));
	SvIOK_on(ST(0));
	SvIsUV_on(ST(0));
    }
#endif
    else {
	SvIV_set(ST(0), SvIV(num));
	SvIOK_on(ST(0));
    }
    if(PL_tainting && (SvTAINTED(num) || SvTAINTED(str)))
	SvTAINTED_on(ST(0));
    XSRETURN(1);
}

char *
blessed(sv)
    SV * sv
PROTOTYPE: $
CODE:
{
    if (SvMAGICAL(sv))
	mg_get(sv);
    if(!sv_isobject(sv)) {
	XSRETURN_UNDEF;
    }
    RETVAL = sv_reftype(SvRV(sv),TRUE);
}
OUTPUT:
    RETVAL

char *
reftype(sv)
    SV * sv
PROTOTYPE: $
CODE:
{
    if (SvMAGICAL(sv))
	mg_get(sv);
    if(!SvROK(sv)) {
	XSRETURN_UNDEF;
    }
    RETVAL = sv_reftype(SvRV(sv),FALSE);
}
OUTPUT:
    RETVAL

UV
refaddr(sv)
    SV * sv
PROTOTYPE: $
CODE:
{
    if (SvMAGICAL(sv))
	mg_get(sv);
    if(!SvROK(sv)) {
	XSRETURN_UNDEF;
    }
    RETVAL = PTR2UV(SvRV(sv));
}
OUTPUT:
    RETVAL

void
weaken(sv)
	SV *sv
PROTOTYPE: $
CODE:
#ifdef SvWEAKREF
	sv_rvweaken(sv);
#else
	croak("weak references are not implemented in this release of perl");
#endif

void
isweak(sv)
	SV *sv
PROTOTYPE: $
CODE:
#ifdef SvWEAKREF
	ST(0) = boolSV(SvROK(sv) && SvWEAKREF(sv));
	XSRETURN(1);
#else
	croak("weak references are not implemented in this release of perl");
#endif

int
readonly(sv)
	SV *sv
PROTOTYPE: $
CODE:
  RETVAL = SvREADONLY(sv);
OUTPUT:
  RETVAL

int
tainted(sv)
	SV *sv
PROTOTYPE: $
CODE:
  RETVAL = SvTAINTED(sv);
OUTPUT:
  RETVAL

void
isvstring(sv)
       SV *sv
PROTOTYPE: $
CODE:
#ifdef SvVOK
  ST(0) = boolSV(SvVOK(sv));
  XSRETURN(1);
#else
	croak("vstrings are not implemented in this release of perl");
#endif

int
looks_like_number(sv)
	SV *sv
PROTOTYPE: $
CODE:
  RETVAL = looks_like_number(sv);
OUTPUT:
  RETVAL

void
set_prototype(subref, proto)
    SV *subref
    SV *proto
PROTOTYPE: &$
CODE:
{
    if (SvROK(subref)) {
	SV *sv = SvRV(subref);
	if (SvTYPE(sv) != SVt_PVCV) {
	    /* not a subroutine reference */
	    croak("set_prototype: not a subroutine reference");
	}
	if (SvPOK(proto)) {
	    /* set the prototype */
	    STRLEN len;
	    char *ptr = SvPV(proto, len);
	    sv_setpvn(sv, ptr, len);
	}
	else {
	    /* delete the prototype */
	    SvPOK_off(sv);
	}
    }
    else {
	croak("set_prototype: not a reference");
    }
    XSRETURN(1);
}

BOOT:
{
#if !defined(SvWEAKREF) || !defined(SvVOK)
    HV *stash = gv_stashpvn("Scalar::Util", 12, TRUE);
    GV *vargv = *(GV**)hv_fetch(stash, "EXPORT_FAIL", 11, TRUE);
    AV *varav;
    if (SvTYPE(vargv) != SVt_PVGV)
	gv_init(vargv, stash, "Scalar::Util", 12, TRUE);
    varav = GvAVn(vargv);
#endif
#ifndef SvWEAKREF
    av_push(varav, newSVpv("weaken",6));
    av_push(varav, newSVpv("isweak",6));
#endif
#ifndef SvVOK
    av_push(varav, newSVpv("isvstring",9));
#endif
}
Commit	Line	Data
f4a2945e	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.
	4	*/
	5
	6	#include <EXTERN.h>
	7	#include <perl.h>
	8	#include <XSUB.h>
f4a2945e	9
92731555	10	#ifndef PERL_VERSION
97605c51	11	# include <patchlevel.h>
	12	# if !(defined(PERL_VERSION) \|\| (SUBVERSION > 0 && defined(PATCHLEVEL)))
	13	# include <could_not_find_Perl_patchlevel.h>
	14	# endif
92731555	15	# define PERL_REVISION 5
	16	# define PERL_VERSION PATCHLEVEL
	17	# define PERL_SUBVERSION SUBVERSION
	18	#endif
	19
1bfb5477	20	#ifndef aTHX
1bfb5477	21	# define aTHX
9c3c560b	22	# define pTHX
	23	#endif
	24
	25	/* Some platforms have strict exports. And before 5.7.3 cxinc (or Perl_cxinc)
	26	was not exported. Therefore platforms like win32, VMS etc have problems
	27	so we redefine it here -- GMB
	28	*/
	29	#if PERL_VERSION < 7
	30	/* Not in 5.6.1. */
	31	# define SvUOK(sv) SvIOK_UV(sv)
	32	# ifdef cxinc
	33	# undef cxinc
	34	# endif
	35	# define cxinc() my_cxinc(aTHX)
	36	static I32
	37	my_cxinc(pTHX)
	38	{
	39	cxstack_max = cxstack_max * 3 / 2;
	40	Renew(cxstack, cxstack_max + 1, struct context); /* XXX should fix CXINC macro */
	41	return cxstack_ix + 1;
	42	}
1bfb5477	43	#endif
	44
	45	#if PERL_VERSION < 6
	46	# define NV double
	47	#endif
	48
60f3865b	49	#ifdef SVf_IVisUV
b9ae0a2d	50	# define slu_sv_value(sv) (SvIOK(sv)) ? (SvIOK_UV(sv)) ? (NV)(SvUVX(sv)) : (NV)(SvIVX(sv)) : (SvNV(sv))
60f3865b	51	#else
aaaf1885	52	# define slu_sv_value(sv) (SvIOK(sv)) ? (NV)(SvIVX(sv)) : (SvNV(sv))
60f3865b	53	#endif
60f3865b	54
1bfb5477	55	#ifndef Drand01
	56	# define Drand01() ((rand() & 0x7FFF) / (double) ((unsigned long)1 << 15))
	57	#endif
	58
92731555	59	#if PERL_VERSION < 5
f4a2945e	60	# ifndef gv_stashpvn
	61	# define gv_stashpvn(n,l,c) gv_stashpv(n,c)
	62	# endif
	63	# ifndef SvTAINTED
	64
	65	static bool
	66	sv_tainted(SV *sv)
	67	{
	68	if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
	69	MAGIC *mg = mg_find(sv, 't');
	70	if (mg && ((mg->mg_len & 1) \|\| (mg->mg_len & 2) && mg->mg_obj == sv))
	71	return TRUE;
	72	}
	73	return FALSE;
	74	}
	75
	76	# define SvTAINTED_on(sv) sv_magic((sv), Nullsv, 't', Nullch, 0)
	77	# define SvTAINTED(sv) (SvMAGICAL(sv) && sv_tainted(sv))
	78	# endif
	79	# define PL_defgv defgv
	80	# define PL_op op
	81	# define PL_curpad curpad
	82	# define CALLRUNOPS runops
	83	# define PL_curpm curpm
	84	# define PL_sv_undef sv_undef
	85	# define PERL_CONTEXT struct context
	86	#endif
92731555	87	#if (PERL_VERSION < 5) \|\| (PERL_VERSION == 5 && PERL_SUBVERSION <50)
f4a2945e	88	# ifndef PL_tainting
	89	# define PL_tainting tainting
	90	# endif
	91	# ifndef PL_stack_base
	92	# define PL_stack_base stack_base
	93	# endif
	94	# ifndef PL_stack_sp
	95	# define PL_stack_sp stack_sp
	96	# endif
	97	# ifndef PL_ppaddr
	98	# define PL_ppaddr ppaddr
	99	# endif
	100	#endif
	101
9e7deb6c	102	#ifndef PTR2UV
9e7deb6c	103	# define PTR2UV(ptr) (UV)(ptr)
60f3865b	104	#endif
60f3865b	105
cf083cf9	106	#ifndef SvUV_set
	107	# define SvUV_set(sv, val) (((XPVUV*)SvANY(sv))->xuv_uv = (val))
	108	#endif
	109
27da23d5	110	#ifdef HASATTRIBUTE
	111	# if (defined(__GNUC__) && defined(__cplusplus)) \|\| defined(__INTEL_COMPILER)
	112	# define PERL_UNUSED_DECL
	113	# else
	114	# define PERL_UNUSED_DECL __attribute__((unused))
	115	# endif
	116	#else
	117	# define PERL_UNUSED_DECL
	118	#endif
	119
	120	#ifndef dNOOP
	121	#define dNOOP extern int Perl___notused PERL_UNUSED_DECL
	122	#endif
	123
	124	#ifndef dVAR
	125	#define dVAR dNOOP
	126	#endif
	127
f4a2945e	128	MODULE=List::Util PACKAGE=List::Util
	129
	130	void
	131	min(...)
	132	PROTOTYPE: @
	133	ALIAS:
	134	min = 0
	135	max = 1
	136	CODE:
	137	{
	138	int index;
	139	NV retval;
	140	SV *retsv;
	141	if(!items) {
	142	XSRETURN_UNDEF;
	143	}
	144	retsv = ST(0);
60f3865b	145	retval = slu_sv_value(retsv);
f4a2945e	146	for(index = 1 ; index < items ; index++) {
f4a2945e	147	SV *stacksv = ST(index);
60f3865b	148	NV val = slu_sv_value(stacksv);
f4a2945e	149	if(val < retval ? !ix : ix) {
	150	retsv = stacksv;
	151	retval = val;
	152	}
	153	}
	154	ST(0) = retsv;
	155	XSRETURN(1);
	156	}
	157
	158
	159
	160	NV
	161	sum(...)
	162	PROTOTYPE: @
	163	CODE:
	164	{
60f3865b	165	SV *sv;
f4a2945e	166	int index;
f4a2945e	167	if(!items) {
	168	XSRETURN_UNDEF;
	169	}
60f3865b	170	sv = ST(0);
60f3865b	171	RETVAL = slu_sv_value(sv);
f4a2945e	172	for(index = 1 ; index < items ; index++) {
60f3865b	173	sv = ST(index);
60f3865b	174	RETVAL += slu_sv_value(sv);
f4a2945e	175	}
	176	}
	177	OUTPUT:
	178	RETVAL
	179
	180
	181	void
	182	minstr(...)
	183	PROTOTYPE: @
	184	ALIAS:
	185	minstr = 2
	186	maxstr = 0
	187	CODE:
	188	{
	189	SV *left;
	190	int index;
	191	if(!items) {
	192	XSRETURN_UNDEF;
	193	}
	194	/*
	195	sv_cmp & sv_cmp_locale return 1,0,-1 for gt,eq,lt
	196	so we set ix to the value we are looking for
	197	xsubpp does not allow -ve values, so we start with 0,2 and subtract 1
	198	*/
	199	ix -= 1;
	200	left = ST(0);
	201	#ifdef OPpLOCALE
	202	if(MAXARG & OPpLOCALE) {
	203	for(index = 1 ; index < items ; index++) {
	204	SV *right = ST(index);
	205	if(sv_cmp_locale(left, right) == ix)
	206	left = right;
	207	}
	208	}
	209	else {
	210	#endif
	211	for(index = 1 ; index < items ; index++) {
	212	SV *right = ST(index);
	213	if(sv_cmp(left, right) == ix)
	214	left = right;
	215	}
	216	#ifdef OPpLOCALE
	217	}
	218	#endif
	219	ST(0) = left;
	220	XSRETURN(1);
	221	}
	222
	223
	224
	225	void
	226	reduce(block,...)
	227	SV * block
	228	PROTOTYPE: &@
	229	CODE:
	230	{
27da23d5	231	dVAR;
09c2a9b8	232	SV *ret = sv_newmortal();
f4a2945e	233	int index;
f4a2945e	234	GV agv,bgv,*gv;
	235	HV *stash;
	236	CV *cv;
	237	OP *reducecop;
1bfb5477	238	PERL_CONTEXT *cx;
	239	SV** newsp;
	240	I32 gimme = G_SCALAR;
c5661c80	241	U8 hasargs = 0;
1bfb5477	242	bool oldcatch = CATCH_GET;
1bfb5477	243
f4a2945e	244	if(items <= 1) {
	245	XSRETURN_UNDEF;
	246	}
	247	agv = gv_fetchpv("a", TRUE, SVt_PV);
	248	bgv = gv_fetchpv("b", TRUE, SVt_PV);
	249	SAVESPTR(GvSV(agv));
	250	SAVESPTR(GvSV(bgv));
09c2a9b8	251	GvSV(agv) = ret;
f4a2945e	252	cv = sv_2cv(block, &stash, &gv, 0);
	253	reducecop = CvSTART(cv);
	254	SAVESPTR(CvROOT(cv)->op_ppaddr);
	255	CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
f3548bdc	256	#ifdef PAD_SET_CUR
	257	PAD_SET_CUR(CvPADLIST(cv),1);
	258	#else
f4a2945e	259	SAVESPTR(PL_curpad);
f4a2945e	260	PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
f3548bdc	261	#endif
f4a2945e	262	SAVETMPS;
f4a2945e	263	SAVESPTR(PL_op);
09c2a9b8	264	SvSetSV(ret, ST(1));
1bfb5477	265	CATCH_SET(TRUE);
60f3865b	266	PUSHBLOCK(cx, CXt_SUB, SP);
60f3865b	267	PUSHSUB(cx);
f4a2945e	268	for(index = 2 ; index < items ; index++) {
f4a2945e	269	GvSV(bgv) = ST(index);
f4a2945e	270	PL_op = reducecop;
da53b6b0	271	CALLRUNOPS(aTHX);
09c2a9b8	272	SvSetSV(ret, *PL_stack_sp);
f4a2945e	273	}
09c2a9b8	274	ST(0) = ret;
1bfb5477	275	POPBLOCK(cx,PL_curpm);
1bfb5477	276	CATCH_SET(oldcatch);
f4a2945e	277	XSRETURN(1);
	278	}
	279
	280	void
	281	first(block,...)
	282	SV * block
	283	PROTOTYPE: &@
	284	CODE:
	285	{
27da23d5	286	dVAR;
f4a2945e	287	int index;
f4a2945e	288	GV *gv;
	289	HV *stash;
	290	CV *cv;
	291	OP *reducecop;
1bfb5477	292	PERL_CONTEXT *cx;
	293	SV** newsp;
	294	I32 gimme = G_SCALAR;
c5661c80	295	U8 hasargs = 0;
1bfb5477	296	bool oldcatch = CATCH_GET;
1bfb5477	297
f4a2945e	298	if(items <= 1) {
	299	XSRETURN_UNDEF;
	300	}
	301	SAVESPTR(GvSV(PL_defgv));
	302	cv = sv_2cv(block, &stash, &gv, 0);
	303	reducecop = CvSTART(cv);
	304	SAVESPTR(CvROOT(cv)->op_ppaddr);
	305	CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
f3548bdc	306	#ifdef PAD_SET_CUR
	307	PAD_SET_CUR(CvPADLIST(cv),1);
	308	#else
f4a2945e	309	SAVESPTR(PL_curpad);
f4a2945e	310	PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
f3548bdc	311	#endif
f4a2945e	312	SAVETMPS;
f4a2945e	313	SAVESPTR(PL_op);
1bfb5477	314	CATCH_SET(TRUE);
60f3865b	315	PUSHBLOCK(cx, CXt_SUB, SP);
60f3865b	316	PUSHSUB(cx);
60f3865b	317
f4a2945e	318	for(index = 1 ; index < items ; index++) {
	319	GvSV(PL_defgv) = ST(index);
	320	PL_op = reducecop;
da53b6b0	321	CALLRUNOPS(aTHX);
f4a2945e	322	if (SvTRUE(*PL_stack_sp)) {
f4a2945e	323	ST(0) = ST(index);
1bfb5477	324	POPBLOCK(cx,PL_curpm);
1bfb5477	325	CATCH_SET(oldcatch);
f4a2945e	326	XSRETURN(1);
	327	}
	328	}
1bfb5477	329	POPBLOCK(cx,PL_curpm);
1bfb5477	330	CATCH_SET(oldcatch);
f4a2945e	331	XSRETURN_UNDEF;
	332	}
	333
1bfb5477	334	void
	335	shuffle(...)
	336	PROTOTYPE: @
	337	CODE:
	338	{
27da23d5	339	dVAR;
1bfb5477	340	int index;
	341	struct op dmy_op;
	342	struct op *old_op = PL_op;
1bfb5477	343
c29e891d	344	/* We call pp_rand here so that Drand01 get initialized if rand()
	345	or srand() has not already been called
	346	*/
1bfb5477	347	memzero((char*)(&dmy_op), sizeof(struct op));
f3548bdc	348	/* we let pp_rand() borrow the TARG allocated for this XS sub */
f3548bdc	349	dmy_op.op_targ = PL_op->op_targ;
1bfb5477	350	PL_op = &dmy_op;
20d72259	351	(void)*(PL_ppaddr[OP_RAND])(aTHX);
1bfb5477	352	PL_op = old_op;
1bfb5477	353	for (index = items ; index > 1 ; ) {
	354	int swap = (int)(Drand01() * (double)(index--));
	355	SV *tmp = ST(swap);
	356	ST(swap) = ST(index);
	357	ST(index) = tmp;
	358	}
	359	XSRETURN(items);
	360	}
	361
	362
f4a2945e	363	MODULE=List::Util PACKAGE=Scalar::Util
	364
	365	void
	366	dualvar(num,str)
	367	SV * num
	368	SV * str
	369	PROTOTYPE: $$
	370	CODE:
	371	{
	372	STRLEN len;
	373	char *ptr = SvPV(str,len);
	374	ST(0) = sv_newmortal();
9c5ffd7c	375	(void)SvUPGRADE(ST(0),SVt_PVNV);
f4a2945e	376	sv_setpvn(ST(0),ptr,len);
1bfb5477	377	if(SvNOK(num) \|\| SvPOK(num) \|\| SvMAGICAL(num)) {
9d6ce603	378	SvNV_set(ST(0), SvNV(num));
f4a2945e	379	SvNOK_on(ST(0));
f4a2945e	380	}
1bfb5477	381	#ifdef SVf_IVisUV
1bfb5477	382	else if (SvUOK(num)) {
607fa7f2	383	SvUV_set(ST(0), SvUV(num));
1bfb5477	384	SvIOK_on(ST(0));
	385	SvIsUV_on(ST(0));
	386	}
	387	#endif
f4a2945e	388	else {
45977657	389	SvIV_set(ST(0), SvIV(num));
f4a2945e	390	SvIOK_on(ST(0));
	391	}
	392	if(PL_tainting && (SvTAINTED(num) \|\| SvTAINTED(str)))
	393	SvTAINTED_on(ST(0));
	394	XSRETURN(1);
	395	}
	396
	397	char *
	398	blessed(sv)
	399	SV * sv
	400	PROTOTYPE: $
	401	CODE:
	402	{
	403	if (SvMAGICAL(sv))
	404	mg_get(sv);
	405	if(!sv_isobject(sv)) {
	406	XSRETURN_UNDEF;
	407	}
	408	RETVAL = sv_reftype(SvRV(sv),TRUE);
	409	}
	410	OUTPUT:
	411	RETVAL
	412
	413	char *
	414	reftype(sv)
	415	SV * sv
	416	PROTOTYPE: $
	417	CODE:
	418	{
	419	if (SvMAGICAL(sv))
	420	mg_get(sv);
	421	if(!SvROK(sv)) {
	422	XSRETURN_UNDEF;
	423	}
	424	RETVAL = sv_reftype(SvRV(sv),FALSE);
	425	}
	426	OUTPUT:
	427	RETVAL
	428
bd1e762a	429	UV
60f3865b	430	refaddr(sv)
	431	SV * sv
	432	PROTOTYPE: $
	433	CODE:
	434	{
4579700c	435	if (SvMAGICAL(sv))
4579700c	436	mg_get(sv);
60f3865b	437	if(!SvROK(sv)) {
	438	XSRETURN_UNDEF;
	439	}
bd1e762a	440	RETVAL = PTR2UV(SvRV(sv));
60f3865b	441	}
	442	OUTPUT:
	443	RETVAL
	444
f4a2945e	445	void
	446	weaken(sv)
	447	SV *sv
	448	PROTOTYPE: $
	449	CODE:
	450	#ifdef SvWEAKREF
	451	sv_rvweaken(sv);
	452	#else
	453	croak("weak references are not implemented in this release of perl");
	454	#endif
	455
c6c619a9	456	void
f4a2945e	457	isweak(sv)
	458	SV *sv
	459	PROTOTYPE: $
	460	CODE:
	461	#ifdef SvWEAKREF
	462	ST(0) = boolSV(SvROK(sv) && SvWEAKREF(sv));
	463	XSRETURN(1);
	464	#else
	465	croak("weak references are not implemented in this release of perl");
	466	#endif
	467
	468	int
	469	readonly(sv)
	470	SV *sv
	471	PROTOTYPE: $
	472	CODE:
	473	RETVAL = SvREADONLY(sv);
	474	OUTPUT:
	475	RETVAL
	476
	477	int
	478	tainted(sv)
	479	SV *sv
	480	PROTOTYPE: $
	481	CODE:
	482	RETVAL = SvTAINTED(sv);
	483	OUTPUT:
	484	RETVAL
	485
60f3865b	486	void
	487	isvstring(sv)
	488	SV *sv
	489	PROTOTYPE: $
	490	CODE:
	491	#ifdef SvVOK
	492	ST(0) = boolSV(SvVOK(sv));
	493	XSRETURN(1);
	494	#else
	495	croak("vstrings are not implemented in this release of perl");
	496	#endif
	497
9e7deb6c	498	int
	499	looks_like_number(sv)
	500	SV *sv
	501	PROTOTYPE: $
	502	CODE:
	503	RETVAL = looks_like_number(sv);
	504	OUTPUT:
	505	RETVAL
	506
c5661c80	507	void
97605c51	508	set_prototype(subref, proto)
	509	SV *subref
	510	SV *proto
	511	PROTOTYPE: &$
	512	CODE:
	513	{
	514	if (SvROK(subref)) {
	515	SV *sv = SvRV(subref);
	516	if (SvTYPE(sv) != SVt_PVCV) {
	517	/* not a subroutine reference */
	518	croak("set_prototype: not a subroutine reference");
	519	}
	520	if (SvPOK(proto)) {
	521	/* set the prototype */
	522	STRLEN len;
	523	char *ptr = SvPV(proto, len);
	524	sv_setpvn(sv, ptr, len);
	525	}
	526	else {
	527	/* delete the prototype */
	528	SvPOK_off(sv);
	529	}
	530	}
	531	else {
	532	croak("set_prototype: not a reference");
	533	}
	534	XSRETURN(1);
	535	}
60f3865b	536
f4a2945e	537	BOOT:
f4a2945e	538	{
60f3865b	539	#if !defined(SvWEAKREF) \|\| !defined(SvVOK)
f4a2945e	540	HV *stash = gv_stashpvn("Scalar::Util", 12, TRUE);
	541	GV vargv = (GV**)hv_fetch(stash, "EXPORT_FAIL", 11, TRUE);
	542	AV *varav;
	543	if (SvTYPE(vargv) != SVt_PVGV)
	544	gv_init(vargv, stash, "Scalar::Util", 12, TRUE);
	545	varav = GvAVn(vargv);
60f3865b	546	#endif
60f3865b	547	#ifndef SvWEAKREF
f4a2945e	548	av_push(varav, newSVpv("weaken",6));
	549	av_push(varav, newSVpv("isweak",6));
	550	#endif
60f3865b	551	#ifndef SvVOK
	552	av_push(varav, newSVpv("isvstring",9));
	553	#endif
f4a2945e	554	}