[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

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:
{
    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);
    LEAVESUB(cv);
    CATCH_SET(oldcatch);
    XSRETURN(1);
}

void
first(block,...)
    SV * block
PROTOTYPE: &@
CODE:
{
    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);
	  LEAVESUB(cv);
	  CATCH_SET(oldcatch);
	  XSRETURN(1);
	}
    }
    POPBLOCK(cx,PL_curpm);
    LEAVESUB(cv);
    CATCH_SET(oldcatch);
    XSRETURN_UNDEF;
}

void
shuffle(...)
PROTOTYPE: @
CODE:
{
    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)) {
	SvUVX(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
f4a2945e	106	MODULE=List::Util PACKAGE=List::Util
	107
	108	void
	109	min(...)
	110	PROTOTYPE: @
	111	ALIAS:
	112	min = 0
	113	max = 1
	114	CODE:
	115	{
	116	int index;
	117	NV retval;
	118	SV *retsv;
	119	if(!items) {
	120	XSRETURN_UNDEF;
	121	}
	122	retsv = ST(0);
60f3865b	123	retval = slu_sv_value(retsv);
f4a2945e	124	for(index = 1 ; index < items ; index++) {
f4a2945e	125	SV *stacksv = ST(index);
60f3865b	126	NV val = slu_sv_value(stacksv);
f4a2945e	127	if(val < retval ? !ix : ix) {
	128	retsv = stacksv;
	129	retval = val;
	130	}
	131	}
	132	ST(0) = retsv;
	133	XSRETURN(1);
	134	}
	135
	136
	137
	138	NV
	139	sum(...)
	140	PROTOTYPE: @
	141	CODE:
	142	{
60f3865b	143	SV *sv;
f4a2945e	144	int index;
f4a2945e	145	if(!items) {
	146	XSRETURN_UNDEF;
	147	}
60f3865b	148	sv = ST(0);
60f3865b	149	RETVAL = slu_sv_value(sv);
f4a2945e	150	for(index = 1 ; index < items ; index++) {
60f3865b	151	sv = ST(index);
60f3865b	152	RETVAL += slu_sv_value(sv);
f4a2945e	153	}
	154	}
	155	OUTPUT:
	156	RETVAL
	157
	158
	159	void
	160	minstr(...)
	161	PROTOTYPE: @
	162	ALIAS:
	163	minstr = 2
	164	maxstr = 0
	165	CODE:
	166	{
	167	SV *left;
	168	int index;
	169	if(!items) {
	170	XSRETURN_UNDEF;
	171	}
	172	/*
	173	sv_cmp & sv_cmp_locale return 1,0,-1 for gt,eq,lt
	174	so we set ix to the value we are looking for
	175	xsubpp does not allow -ve values, so we start with 0,2 and subtract 1
	176	*/
	177	ix -= 1;
	178	left = ST(0);
	179	#ifdef OPpLOCALE
	180	if(MAXARG & OPpLOCALE) {
	181	for(index = 1 ; index < items ; index++) {
	182	SV *right = ST(index);
	183	if(sv_cmp_locale(left, right) == ix)
	184	left = right;
	185	}
	186	}
	187	else {
	188	#endif
	189	for(index = 1 ; index < items ; index++) {
	190	SV *right = ST(index);
	191	if(sv_cmp(left, right) == ix)
	192	left = right;
	193	}
	194	#ifdef OPpLOCALE
	195	}
	196	#endif
	197	ST(0) = left;
	198	XSRETURN(1);
	199	}
	200
	201
	202
	203	void
	204	reduce(block,...)
	205	SV * block
	206	PROTOTYPE: &@
	207	CODE:
	208	{
09c2a9b8	209	SV *ret = sv_newmortal();
f4a2945e	210	int index;
f4a2945e	211	GV agv,bgv,*gv;
	212	HV *stash;
	213	CV *cv;
	214	OP *reducecop;
1bfb5477	215	PERL_CONTEXT *cx;
	216	SV** newsp;
	217	I32 gimme = G_SCALAR;
c5661c80	218	U8 hasargs = 0;
1bfb5477	219	bool oldcatch = CATCH_GET;
1bfb5477	220
f4a2945e	221	if(items <= 1) {
	222	XSRETURN_UNDEF;
	223	}
	224	agv = gv_fetchpv("a", TRUE, SVt_PV);
	225	bgv = gv_fetchpv("b", TRUE, SVt_PV);
	226	SAVESPTR(GvSV(agv));
	227	SAVESPTR(GvSV(bgv));
09c2a9b8	228	GvSV(agv) = ret;
f4a2945e	229	cv = sv_2cv(block, &stash, &gv, 0);
	230	reducecop = CvSTART(cv);
	231	SAVESPTR(CvROOT(cv)->op_ppaddr);
	232	CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
f3548bdc	233	#ifdef PAD_SET_CUR
	234	PAD_SET_CUR(CvPADLIST(cv),1);
	235	#else
f4a2945e	236	SAVESPTR(PL_curpad);
f4a2945e	237	PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
f3548bdc	238	#endif
f4a2945e	239	SAVETMPS;
f4a2945e	240	SAVESPTR(PL_op);
09c2a9b8	241	SvSetSV(ret, ST(1));
1bfb5477	242	CATCH_SET(TRUE);
60f3865b	243	PUSHBLOCK(cx, CXt_SUB, SP);
60f3865b	244	PUSHSUB(cx);
f4a2945e	245	for(index = 2 ; index < items ; index++) {
f4a2945e	246	GvSV(bgv) = ST(index);
f4a2945e	247	PL_op = reducecop;
da53b6b0	248	CALLRUNOPS(aTHX);
09c2a9b8	249	SvSetSV(ret, *PL_stack_sp);
f4a2945e	250	}
09c2a9b8	251	ST(0) = ret;
1bfb5477	252	POPBLOCK(cx,PL_curpm);
49ce4d31	253	LEAVESUB(cv);
1bfb5477	254	CATCH_SET(oldcatch);
f4a2945e	255	XSRETURN(1);
	256	}
	257
	258	void
	259	first(block,...)
	260	SV * block
	261	PROTOTYPE: &@
	262	CODE:
	263	{
f4a2945e	264	int index;
f4a2945e	265	GV *gv;
	266	HV *stash;
	267	CV *cv;
	268	OP *reducecop;
1bfb5477	269	PERL_CONTEXT *cx;
	270	SV** newsp;
	271	I32 gimme = G_SCALAR;
c5661c80	272	U8 hasargs = 0;
1bfb5477	273	bool oldcatch = CATCH_GET;
1bfb5477	274
f4a2945e	275	if(items <= 1) {
	276	XSRETURN_UNDEF;
	277	}
	278	SAVESPTR(GvSV(PL_defgv));
	279	cv = sv_2cv(block, &stash, &gv, 0);
	280	reducecop = CvSTART(cv);
	281	SAVESPTR(CvROOT(cv)->op_ppaddr);
	282	CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
f3548bdc	283	#ifdef PAD_SET_CUR
	284	PAD_SET_CUR(CvPADLIST(cv),1);
	285	#else
f4a2945e	286	SAVESPTR(PL_curpad);
f4a2945e	287	PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
f3548bdc	288	#endif
f4a2945e	289	SAVETMPS;
f4a2945e	290	SAVESPTR(PL_op);
1bfb5477	291	CATCH_SET(TRUE);
60f3865b	292	PUSHBLOCK(cx, CXt_SUB, SP);
60f3865b	293	PUSHSUB(cx);
60f3865b	294
f4a2945e	295	for(index = 1 ; index < items ; index++) {
	296	GvSV(PL_defgv) = ST(index);
	297	PL_op = reducecop;
da53b6b0	298	CALLRUNOPS(aTHX);
f4a2945e	299	if (SvTRUE(*PL_stack_sp)) {
f4a2945e	300	ST(0) = ST(index);
1bfb5477	301	POPBLOCK(cx,PL_curpm);
49ce4d31	302	LEAVESUB(cv);
1bfb5477	303	CATCH_SET(oldcatch);
f4a2945e	304	XSRETURN(1);
	305	}
	306	}
1bfb5477	307	POPBLOCK(cx,PL_curpm);
49ce4d31	308	LEAVESUB(cv);
1bfb5477	309	CATCH_SET(oldcatch);
f4a2945e	310	XSRETURN_UNDEF;
	311	}
	312
1bfb5477	313	void
	314	shuffle(...)
	315	PROTOTYPE: @
	316	CODE:
	317	{
	318	int index;
	319	struct op dmy_op;
	320	struct op *old_op = PL_op;
1bfb5477	321
c29e891d	322	/* We call pp_rand here so that Drand01 get initialized if rand()
	323	or srand() has not already been called
	324	*/
1bfb5477	325	memzero((char*)(&dmy_op), sizeof(struct op));
f3548bdc	326	/* we let pp_rand() borrow the TARG allocated for this XS sub */
f3548bdc	327	dmy_op.op_targ = PL_op->op_targ;
1bfb5477	328	PL_op = &dmy_op;
20d72259	329	(void)*(PL_ppaddr[OP_RAND])(aTHX);
1bfb5477	330	PL_op = old_op;
1bfb5477	331	for (index = items ; index > 1 ; ) {
	332	int swap = (int)(Drand01() * (double)(index--));
	333	SV *tmp = ST(swap);
	334	ST(swap) = ST(index);
	335	ST(index) = tmp;
	336	}
	337	XSRETURN(items);
	338	}
	339
	340
f4a2945e	341	MODULE=List::Util PACKAGE=Scalar::Util
	342
	343	void
	344	dualvar(num,str)
	345	SV * num
	346	SV * str
	347	PROTOTYPE: $$
	348	CODE:
	349	{
	350	STRLEN len;
	351	char *ptr = SvPV(str,len);
	352	ST(0) = sv_newmortal();
9c5ffd7c	353	(void)SvUPGRADE(ST(0),SVt_PVNV);
f4a2945e	354	sv_setpvn(ST(0),ptr,len);
1bfb5477	355	if(SvNOK(num) \|\| SvPOK(num) \|\| SvMAGICAL(num)) {
9d6ce603	356	SvNV_set(ST(0), SvNV(num));
f4a2945e	357	SvNOK_on(ST(0));
f4a2945e	358	}
1bfb5477	359	#ifdef SVf_IVisUV
	360	else if (SvUOK(num)) {
	361	SvUVX(ST(0)) = SvUV(num);
	362	SvIOK_on(ST(0));
	363	SvIsUV_on(ST(0));
	364	}
	365	#endif
f4a2945e	366	else {
45977657	367	SvIV_set(ST(0), SvIV(num));
f4a2945e	368	SvIOK_on(ST(0));
	369	}
	370	if(PL_tainting && (SvTAINTED(num) \|\| SvTAINTED(str)))
	371	SvTAINTED_on(ST(0));
	372	XSRETURN(1);
	373	}
	374
	375	char *
	376	blessed(sv)
	377	SV * sv
	378	PROTOTYPE: $
	379	CODE:
	380	{
	381	if (SvMAGICAL(sv))
	382	mg_get(sv);
	383	if(!sv_isobject(sv)) {
	384	XSRETURN_UNDEF;
	385	}
	386	RETVAL = sv_reftype(SvRV(sv),TRUE);
	387	}
	388	OUTPUT:
	389	RETVAL
	390
	391	char *
	392	reftype(sv)
	393	SV * sv
	394	PROTOTYPE: $
	395	CODE:
	396	{
	397	if (SvMAGICAL(sv))
	398	mg_get(sv);
	399	if(!SvROK(sv)) {
	400	XSRETURN_UNDEF;
	401	}
	402	RETVAL = sv_reftype(SvRV(sv),FALSE);
	403	}
	404	OUTPUT:
	405	RETVAL
	406
bd1e762a	407	UV
60f3865b	408	refaddr(sv)
	409	SV * sv
	410	PROTOTYPE: $
	411	CODE:
	412	{
4579700c	413	if (SvMAGICAL(sv))
4579700c	414	mg_get(sv);
60f3865b	415	if(!SvROK(sv)) {
	416	XSRETURN_UNDEF;
	417	}
bd1e762a	418	RETVAL = PTR2UV(SvRV(sv));
60f3865b	419	}
	420	OUTPUT:
	421	RETVAL
	422
f4a2945e	423	void
	424	weaken(sv)
	425	SV *sv
	426	PROTOTYPE: $
	427	CODE:
	428	#ifdef SvWEAKREF
	429	sv_rvweaken(sv);
	430	#else
	431	croak("weak references are not implemented in this release of perl");
	432	#endif
	433
c6c619a9	434	void
f4a2945e	435	isweak(sv)
	436	SV *sv
	437	PROTOTYPE: $
	438	CODE:
	439	#ifdef SvWEAKREF
	440	ST(0) = boolSV(SvROK(sv) && SvWEAKREF(sv));
	441	XSRETURN(1);
	442	#else
	443	croak("weak references are not implemented in this release of perl");
	444	#endif
	445
	446	int
	447	readonly(sv)
	448	SV *sv
	449	PROTOTYPE: $
	450	CODE:
	451	RETVAL = SvREADONLY(sv);
	452	OUTPUT:
	453	RETVAL
	454
	455	int
	456	tainted(sv)
	457	SV *sv
	458	PROTOTYPE: $
	459	CODE:
	460	RETVAL = SvTAINTED(sv);
	461	OUTPUT:
	462	RETVAL
	463
60f3865b	464	void
	465	isvstring(sv)
	466	SV *sv
	467	PROTOTYPE: $
	468	CODE:
	469	#ifdef SvVOK
	470	ST(0) = boolSV(SvVOK(sv));
	471	XSRETURN(1);
	472	#else
	473	croak("vstrings are not implemented in this release of perl");
	474	#endif
	475
9e7deb6c	476	int
	477	looks_like_number(sv)
	478	SV *sv
	479	PROTOTYPE: $
	480	CODE:
	481	RETVAL = looks_like_number(sv);
	482	OUTPUT:
	483	RETVAL
	484
c5661c80	485	void
97605c51	486	set_prototype(subref, proto)
	487	SV *subref
	488	SV *proto
	489	PROTOTYPE: &$
	490	CODE:
	491	{
	492	if (SvROK(subref)) {
	493	SV *sv = SvRV(subref);
	494	if (SvTYPE(sv) != SVt_PVCV) {
	495	/* not a subroutine reference */
	496	croak("set_prototype: not a subroutine reference");
	497	}
	498	if (SvPOK(proto)) {
	499	/* set the prototype */
	500	STRLEN len;
	501	char *ptr = SvPV(proto, len);
	502	sv_setpvn(sv, ptr, len);
	503	}
	504	else {
	505	/* delete the prototype */
	506	SvPOK_off(sv);
	507	}
	508	}
	509	else {
	510	croak("set_prototype: not a reference");
	511	}
	512	XSRETURN(1);
	513	}
60f3865b	514
f4a2945e	515	BOOT:
f4a2945e	516	{
60f3865b	517	#if !defined(SvWEAKREF) \|\| !defined(SvVOK)
f4a2945e	518	HV *stash = gv_stashpvn("Scalar::Util", 12, TRUE);
	519	GV vargv = (GV**)hv_fetch(stash, "EXPORT_FAIL", 11, TRUE);
	520	AV *varav;
	521	if (SvTYPE(vargv) != SVt_PVGV)
	522	gv_init(vargv, stash, "Scalar::Util", 12, TRUE);
	523	varav = GvAVn(vargv);
60f3865b	524	#endif
60f3865b	525	#ifndef SvWEAKREF
f4a2945e	526	av_push(varav, newSVpv("weaken",6));
	527	av_push(varav, newSVpv("isweak",6));
	528	#endif
60f3865b	529	#ifndef SvVOK
	530	av_push(varav, newSVpv("isvstring",9));
	531	#endif
f4a2945e	532	}