[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>

#include "multicall.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

#ifndef PERL_UNUSED_DECL
#  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
#endif

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

#ifndef dVAR
#define dVAR dNOOP
#endif

#ifndef GvSVn
#  define GvSVn GvSV
#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; dMULTICALL;
    SV *ret = sv_newmortal();
    int index;
    GV *agv,*bgv,*gv;
    HV *stash;
    I32 gimme = G_SCALAR;
    SV **args = &PL_stack_base[ax];

    if(items <= 1) {
	XSRETURN_UNDEF;
    }
    cv = sv_2cv(block, &stash, &gv, 0);
    PUSH_MULTICALL;
    agv = gv_fetchpv("a", TRUE, SVt_PV);
    bgv = gv_fetchpv("b", TRUE, SVt_PV);
    SAVESPTR(GvSV(agv));
    SAVESPTR(GvSV(bgv));
    GvSV(agv) = ret;
    SvSetSV(ret, args[1]);
    for(index = 2 ; index < items ; index++) {
	GvSV(bgv) = args[index];
	MULTICALL;
	SvSetSV(ret, *PL_stack_sp);
    }
    POP_MULTICALL;
    ST(0) = ret;
    XSRETURN(1);
}

void
first(block,...)
    SV * block
PROTOTYPE: &@
CODE:
{
    dVAR; dMULTICALL;
    int index;
    GV *gv;
    HV *stash;
    I32 gimme = G_SCALAR;
    SV **args = &PL_stack_base[ax];

    if(items <= 1) {
	XSRETURN_UNDEF;
    }
    cv = sv_2cv(block, &stash, &gv, 0);
    PUSH_MULTICALL;
    SAVESPTR(GvSV(PL_defgv));

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