[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>
#    ifndef PERL_VERSION
#        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) (NV)(SvIOK(sv) ? SvIOK_UV(sv) ? SvUVX(sv) : SvIVX(sv) : SvNV(sv))
#else
#  define slu_sv_value(sv) (NV)(SvIOK(sv) ? 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 PTR2IV
#  define PTR2IV(ptr) (IV)(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;
    int index;
    GV *agv,*bgv,*gv;
    HV *stash;
    CV *cv;
    OP *reducecop;
    PERL_CONTEXT *cx;
    SV** newsp;
    I32 gimme = G_SCALAR;
    I32 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));
    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);
    ret = ST(1);
    CATCH_SET(TRUE);
    PUSHBLOCK(cx, CXt_SUB, SP);
    PUSHSUB(cx);
    if (!CvDEPTH(cv))
        (void)SvREFCNT_inc(cv);
    for(index = 2 ; index < items ; index++) {
	GvSV(agv) = ret;
	GvSV(bgv) = ST(index);
	PL_op = reducecop;
	CALLRUNOPS(aTHX);
	ret = *PL_stack_sp;
    }
    ST(0) = sv_mortalcopy(ret);
    POPBLOCK(cx,PL_curpm);
    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;
    I32 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);
    if (!CvDEPTH(cv))
        (void)SvREFCNT_inc(cv);

    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:
{
    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)) {
	SvNVX(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 {
	SvIVX(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(!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


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
069d7f71	11	# include <patchlevel.h>
	12	# ifndef PERL_VERSION
	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
	50	# define slu_sv_value(sv) (NV)(SvIOK(sv) ? SvIOK_UV(sv) ? SvUVX(sv) : SvIVX(sv) : SvNV(sv))
	51	#else
	52	# define slu_sv_value(sv) (NV)(SvIOK(sv) ? SvIVX(sv) : SvNV(sv))
	53	#endif
	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
60f3865b	102	#ifndef PTR2IV
	103	# define PTR2IV(ptr) (IV)(ptr)
	104	#endif
	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	{
	209	SV *ret;
	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;
60f3865b	218	I32 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));
	228	cv = sv_2cv(block, &stash, &gv, 0);
	229	reducecop = CvSTART(cv);
	230	SAVESPTR(CvROOT(cv)->op_ppaddr);
	231	CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
f3548bdc	232	#ifdef PAD_SET_CUR
	233	PAD_SET_CUR(CvPADLIST(cv),1);
	234	#else
f4a2945e	235	SAVESPTR(PL_curpad);
f4a2945e	236	PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
f3548bdc	237	#endif
f4a2945e	238	SAVETMPS;
	239	SAVESPTR(PL_op);
	240	ret = ST(1);
1bfb5477	241	CATCH_SET(TRUE);
60f3865b	242	PUSHBLOCK(cx, CXt_SUB, SP);
	243	PUSHSUB(cx);
	244	if (!CvDEPTH(cv))
	245	(void)SvREFCNT_inc(cv);
f4a2945e	246	for(index = 2 ; index < items ; index++) {
	247	GvSV(agv) = ret;
	248	GvSV(bgv) = ST(index);
	249	PL_op = reducecop;
da53b6b0	250	CALLRUNOPS(aTHX);
f4a2945e	251	ret = *PL_stack_sp;
f4a2945e	252	}
1bfb5477	253	ST(0) = sv_mortalcopy(ret);
	254	POPBLOCK(cx,PL_curpm);
	255	CATCH_SET(oldcatch);
f4a2945e	256	XSRETURN(1);
	257	}
	258
	259	void
	260	first(block,...)
	261	SV * block
	262	PROTOTYPE: &@
	263	CODE:
	264	{
f4a2945e	265	int index;
f4a2945e	266	GV *gv;
	267	HV *stash;
	268	CV *cv;
	269	OP *reducecop;
1bfb5477	270	PERL_CONTEXT *cx;
	271	SV** newsp;
	272	I32 gimme = G_SCALAR;
60f3865b	273	I32 hasargs = 0;
1bfb5477	274	bool oldcatch = CATCH_GET;
1bfb5477	275
f4a2945e	276	if(items <= 1) {
	277	XSRETURN_UNDEF;
	278	}
	279	SAVESPTR(GvSV(PL_defgv));
	280	cv = sv_2cv(block, &stash, &gv, 0);
	281	reducecop = CvSTART(cv);
	282	SAVESPTR(CvROOT(cv)->op_ppaddr);
	283	CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
f3548bdc	284	#ifdef PAD_SET_CUR
	285	PAD_SET_CUR(CvPADLIST(cv),1);
	286	#else
f4a2945e	287	SAVESPTR(PL_curpad);
f4a2945e	288	PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
f3548bdc	289	#endif
f4a2945e	290	SAVETMPS;
f4a2945e	291	SAVESPTR(PL_op);
1bfb5477	292	CATCH_SET(TRUE);
60f3865b	293	PUSHBLOCK(cx, CXt_SUB, SP);
	294	PUSHSUB(cx);
	295	if (!CvDEPTH(cv))
	296	(void)SvREFCNT_inc(cv);
	297
f4a2945e	298	for(index = 1 ; index < items ; index++) {
	299	GvSV(PL_defgv) = ST(index);
	300	PL_op = reducecop;
da53b6b0	301	CALLRUNOPS(aTHX);
f4a2945e	302	if (SvTRUE(*PL_stack_sp)) {
f4a2945e	303	ST(0) = ST(index);
1bfb5477	304	POPBLOCK(cx,PL_curpm);
1bfb5477	305	CATCH_SET(oldcatch);
f4a2945e	306	XSRETURN(1);
	307	}
	308	}
1bfb5477	309	POPBLOCK(cx,PL_curpm);
1bfb5477	310	CATCH_SET(oldcatch);
f4a2945e	311	XSRETURN_UNDEF;
	312	}
	313
1bfb5477	314	void
	315	shuffle(...)
	316	PROTOTYPE: @
	317	CODE:
	318	{
	319	int index;
	320	struct op dmy_op;
	321	struct op *old_op = PL_op;
1bfb5477	322
c29e891d	323	/* We call pp_rand here so that Drand01 get initialized if rand()
	324	or srand() has not already been called
	325	*/
1bfb5477	326	memzero((char*)(&dmy_op), sizeof(struct op));
f3548bdc	327	/* we let pp_rand() borrow the TARG allocated for this XS sub */
f3548bdc	328	dmy_op.op_targ = PL_op->op_targ;
1bfb5477	329	PL_op = &dmy_op;
20d72259	330	(void)*(PL_ppaddr[OP_RAND])(aTHX);
1bfb5477	331	PL_op = old_op;
1bfb5477	332	for (index = items ; index > 1 ; ) {
	333	int swap = (int)(Drand01() * (double)(index--));
	334	SV *tmp = ST(swap);
	335	ST(swap) = ST(index);
	336	ST(index) = tmp;
	337	}
	338	XSRETURN(items);
	339	}
	340
	341
f4a2945e	342	MODULE=List::Util PACKAGE=Scalar::Util
	343
	344	void
	345	dualvar(num,str)
	346	SV * num
	347	SV * str
	348	PROTOTYPE: $$
	349	CODE:
	350	{
	351	STRLEN len;
	352	char *ptr = SvPV(str,len);
	353	ST(0) = sv_newmortal();
9c5ffd7c	354	(void)SvUPGRADE(ST(0),SVt_PVNV);
f4a2945e	355	sv_setpvn(ST(0),ptr,len);
1bfb5477	356	if(SvNOK(num) \|\| SvPOK(num) \|\| SvMAGICAL(num)) {
f4a2945e	357	SvNVX(ST(0)) = SvNV(num);
	358	SvNOK_on(ST(0));
	359	}
1bfb5477	360	#ifdef SVf_IVisUV
	361	else if (SvUOK(num)) {
	362	SvUVX(ST(0)) = SvUV(num);
	363	SvIOK_on(ST(0));
	364	SvIsUV_on(ST(0));
	365	}
	366	#endif
f4a2945e	367	else {
	368	SvIVX(ST(0)) = SvIV(num);
	369	SvIOK_on(ST(0));
	370	}
	371	if(PL_tainting && (SvTAINTED(num) \|\| SvTAINTED(str)))
	372	SvTAINTED_on(ST(0));
	373	XSRETURN(1);
	374	}
	375
	376	char *
	377	blessed(sv)
	378	SV * sv
	379	PROTOTYPE: $
	380	CODE:
	381	{
	382	if (SvMAGICAL(sv))
	383	mg_get(sv);
	384	if(!sv_isobject(sv)) {
	385	XSRETURN_UNDEF;
	386	}
	387	RETVAL = sv_reftype(SvRV(sv),TRUE);
	388	}
	389	OUTPUT:
	390	RETVAL
	391
	392	char *
	393	reftype(sv)
	394	SV * sv
	395	PROTOTYPE: $
	396	CODE:
	397	{
	398	if (SvMAGICAL(sv))
	399	mg_get(sv);
	400	if(!SvROK(sv)) {
	401	XSRETURN_UNDEF;
	402	}
	403	RETVAL = sv_reftype(SvRV(sv),FALSE);
	404	}
	405	OUTPUT:
	406	RETVAL
	407
bd1e762a	408	UV
60f3865b	409	refaddr(sv)
	410	SV * sv
	411	PROTOTYPE: $
	412	CODE:
	413	{
	414	if(!SvROK(sv)) {
	415	XSRETURN_UNDEF;
	416	}
bd1e762a	417	RETVAL = PTR2UV(SvRV(sv));
60f3865b	418	}
	419	OUTPUT:
	420	RETVAL
	421
f4a2945e	422	void
	423	weaken(sv)
	424	SV *sv
	425	PROTOTYPE: $
	426	CODE:
	427	#ifdef SvWEAKREF
	428	sv_rvweaken(sv);
	429	#else
	430	croak("weak references are not implemented in this release of perl");
	431	#endif
	432
c6c619a9	433	void
f4a2945e	434	isweak(sv)
	435	SV *sv
	436	PROTOTYPE: $
	437	CODE:
	438	#ifdef SvWEAKREF
	439	ST(0) = boolSV(SvROK(sv) && SvWEAKREF(sv));
	440	XSRETURN(1);
	441	#else
	442	croak("weak references are not implemented in this release of perl");
	443	#endif
	444
	445	int
	446	readonly(sv)
	447	SV *sv
	448	PROTOTYPE: $
	449	CODE:
	450	RETVAL = SvREADONLY(sv);
	451	OUTPUT:
	452	RETVAL
	453
	454	int
	455	tainted(sv)
	456	SV *sv
	457	PROTOTYPE: $
	458	CODE:
	459	RETVAL = SvTAINTED(sv);
	460	OUTPUT:
	461	RETVAL
	462
60f3865b	463	void
	464	isvstring(sv)
	465	SV *sv
	466	PROTOTYPE: $
	467	CODE:
	468	#ifdef SvVOK
	469	ST(0) = boolSV(SvVOK(sv));
	470	XSRETURN(1);
	471	#else
	472	croak("vstrings are not implemented in this release of perl");
	473	#endif
	474
	475
f4a2945e	476	BOOT:
f4a2945e	477	{
60f3865b	478	#if !defined(SvWEAKREF) \|\| !defined(SvVOK)
f4a2945e	479	HV *stash = gv_stashpvn("Scalar::Util", 12, TRUE);
	480	GV vargv = (GV**)hv_fetch(stash, "EXPORT_FAIL", 11, TRUE);
	481	AV *varav;
	482	if (SvTYPE(vargv) != SVt_PVGV)
	483	gv_init(vargv, stash, "Scalar::Util", 12, TRUE);
	484	varav = GvAVn(vargv);
60f3865b	485	#endif
60f3865b	486	#ifndef SvWEAKREF
f4a2945e	487	av_push(varav, newSVpv("weaken",6));
	488	av_push(varav, newSVpv("isweak",6));
	489	#endif
60f3865b	490	#ifndef SvVOK
	491	av_push(varav, newSVpv("isvstring",9));
	492	#endif
f4a2945e	493	}