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