[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"
#    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 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;
    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

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


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