[p5sagit/p5-mst-13.2.git] / ext / List-Util / ListUtil.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

#if PERL_VERSION >= 6
#  include "multicall.h"
#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;
    int magic;
    if(!items) {
	XSRETURN_UNDEF;
    }
    retsv = ST(0);
    magic = SvAMAGIC(retsv);
    if (!magic) {
      retval = slu_sv_value(retsv);
    }
    for(index = 1 ; index < items ; index++) {
	SV *stacksv = ST(index);
        SV *tmpsv;
        if ((magic || SvAMAGIC(stacksv)) && (tmpsv = amagic_call(retsv, stacksv, gt_amg, 0))) {
             if (SvTRUE(tmpsv) ? !ix : ix) {
                  retsv = stacksv;
                  magic = SvAMAGIC(retsv);
                  if (!magic) {
                      retval = slu_sv_value(retsv);
                  }
             }
        }
        else {
            NV val = slu_sv_value(stacksv);
            if (magic) {
                retval = slu_sv_value(retsv);
                magic = 0;
            }
            if(val < retval ? !ix : ix) {
                retsv = stacksv;
                retval = val;
            }
        }
    }
    ST(0) = retsv;
    XSRETURN(1);
}


void
sum(...)
PROTOTYPE: @
CODE:
{
    SV *sv;
    SV *retsv = NULL;
    int index;
    int magic;
    NV retval = 0;
    if(!items) {
	XSRETURN_UNDEF;
    }
    sv = ST(0);
    if (SvAMAGIC(sv)) {
        retsv = sv_newmortal();
        sv_setsv(retsv, sv);
    }
    else {
        retval = slu_sv_value(sv);
    }
    for(index = 1 ; index < items ; index++) {
	sv = ST(index);
        if (retsv || SvAMAGIC(sv)) {
            if (!retsv) {
                retsv = sv_newmortal();
                sv_setnv(retsv,retval);
            }
            if (!amagic_call(retsv, sv, add_amg, AMGf_assign)) {
                sv_setnv(retsv, SvNV(retsv) + SvNV(sv));
            }
        }
        else {
          retval += slu_sv_value(sv);
        }
    }
    if (!retsv) {
        retsv = sv_newmortal();
        sv_setnv(retsv,retval);
    }
    ST(0) = retsv;
    XSRETURN(1);
}


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);
}


#ifdef dMULTICALL

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];
    CV *cv;

    if(items <= 1) {
	XSRETURN_UNDEF;
    }
    cv = sv_2cv(block, &stash, &gv, 0);
    if (cv == Nullcv) {
       croak("Not a subroutine reference");
    }
    PUSH_MULTICALL(cv);
    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];
    CV *cv;

    if(items <= 1) {
	XSRETURN_UNDEF;
    }
    cv = sv_2cv(block, &stash, &gv, 0);
    PUSH_MULTICALL(cv);
    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;
}

#endif

void
shuffle(...)
PROTOTYPE: @
CODE:
{
    dVAR;
    int index;
#if (PERL_VERSION < 9)
    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;
#else
    /* Initialize Drand01 if rand() or srand() has
       not already been called
    */
    if (!PL_srand_called) {
        (void)seedDrand01((Rand_seed_t)Perl_seed(aTHX));
        PL_srand_called = TRUE;
    }
#endif

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