[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

#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

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 = SvNV(retsv);
    for(index = 1 ; index < items ; index++) {
	SV *stacksv = ST(index);
	NV val = SvNV(stacksv);
	if(val < retval ? !ix : ix) {
	    retsv = stacksv;
	    retval = val;
	}
    }
    ST(0) = retsv;
    XSRETURN(1);
}


NV
sum(...)
PROTOTYPE: @
CODE:
{
    int index;
    if(!items) {
	XSRETURN_UNDEF;
    }
    RETVAL = SvNV(ST(0));
    for(index = 1 ; index < items ; index++) {
	RETVAL += SvNV(ST(index));
    }
}
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;
    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];
    SAVESPTR(PL_curpad);
    PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
    SAVETMPS;
    SAVESPTR(PL_op);
    ret = ST(1);
    CATCH_SET(TRUE);
    PUSHBLOCK(cx, CXt_NULL, SP);
    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;
    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];
    SAVESPTR(PL_curpad);
    PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
    SAVETMPS;
    SAVESPTR(PL_op);
    CATCH_SET(TRUE);
    PUSHBLOCK(cx, CXt_NULL, SP);
    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;
    SV *my_pad[2];
    SV **old_curpad = PL_curpad;

    /* We call pp_rand here so that Drand01 get initialized if rand()
       or srand() has not already been called
    */
    my_pad[1] = sv_newmortal();
    memzero((char*)(&dmy_op), sizeof(struct op));
    dmy_op.op_targ = 1;
    PL_op = &dmy_op;
    PL_curpad = (SV **)&my_pad;
    (void)*(PL_ppaddr[OP_RAND])(aTHX);
    PL_op = old_op;
    PL_curpad = old_curpad;
    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

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

BOOT:
{
#ifndef SvWEAKREF
    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);
    av_push(varav, newSVpv("weaken",6));
    av_push(varav, newSVpv("isweak",6));
#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
	11	# include "patchlevel.h"
	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
	46	#ifndef Drand01
	47	# define Drand01() ((rand() & 0x7FFF) / (double) ((unsigned long)1 << 15))
	48	#endif
	49
92731555	50	#if PERL_VERSION < 5
f4a2945e	51	# ifndef gv_stashpvn
	52	# define gv_stashpvn(n,l,c) gv_stashpv(n,c)
	53	# endif
	54	# ifndef SvTAINTED
	55
	56	static bool
	57	sv_tainted(SV *sv)
	58	{
	59	if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
	60	MAGIC *mg = mg_find(sv, 't');
	61	if (mg && ((mg->mg_len & 1) \|\| (mg->mg_len & 2) && mg->mg_obj == sv))
	62	return TRUE;
	63	}
	64	return FALSE;
	65	}
	66
	67	# define SvTAINTED_on(sv) sv_magic((sv), Nullsv, 't', Nullch, 0)
	68	# define SvTAINTED(sv) (SvMAGICAL(sv) && sv_tainted(sv))
	69	# endif
	70	# define PL_defgv defgv
	71	# define PL_op op
	72	# define PL_curpad curpad
	73	# define CALLRUNOPS runops
	74	# define PL_curpm curpm
	75	# define PL_sv_undef sv_undef
	76	# define PERL_CONTEXT struct context
	77	#endif
92731555	78	#if (PERL_VERSION < 5) \|\| (PERL_VERSION == 5 && PERL_SUBVERSION <50)
f4a2945e	79	# ifndef PL_tainting
	80	# define PL_tainting tainting
	81	# endif
	82	# ifndef PL_stack_base
	83	# define PL_stack_base stack_base
	84	# endif
	85	# ifndef PL_stack_sp
	86	# define PL_stack_sp stack_sp
	87	# endif
	88	# ifndef PL_ppaddr
	89	# define PL_ppaddr ppaddr
	90	# endif
	91	#endif
	92
	93	MODULE=List::Util PACKAGE=List::Util
	94
	95	void
	96	min(...)
	97	PROTOTYPE: @
	98	ALIAS:
	99	min = 0
	100	max = 1
	101	CODE:
	102	{
	103	int index;
	104	NV retval;
	105	SV *retsv;
	106	if(!items) {
	107	XSRETURN_UNDEF;
	108	}
	109	retsv = ST(0);
	110	retval = SvNV(retsv);
	111	for(index = 1 ; index < items ; index++) {
	112	SV *stacksv = ST(index);
	113	NV val = SvNV(stacksv);
	114	if(val < retval ? !ix : ix) {
	115	retsv = stacksv;
	116	retval = val;
	117	}
	118	}
	119	ST(0) = retsv;
	120	XSRETURN(1);
	121	}
	122
	123
	124
	125	NV
	126	sum(...)
	127	PROTOTYPE: @
	128	CODE:
	129	{
	130	int index;
f4a2945e	131	if(!items) {
	132	XSRETURN_UNDEF;
	133	}
	134	RETVAL = SvNV(ST(0));
	135	for(index = 1 ; index < items ; index++) {
	136	RETVAL += SvNV(ST(index));
	137	}
	138	}
	139	OUTPUT:
	140	RETVAL
	141
	142
	143	void
	144	minstr(...)
	145	PROTOTYPE: @
	146	ALIAS:
	147	minstr = 2
	148	maxstr = 0
	149	CODE:
	150	{
	151	SV *left;
	152	int index;
	153	if(!items) {
	154	XSRETURN_UNDEF;
	155	}
	156	/*
	157	sv_cmp & sv_cmp_locale return 1,0,-1 for gt,eq,lt
	158	so we set ix to the value we are looking for
	159	xsubpp does not allow -ve values, so we start with 0,2 and subtract 1
	160	*/
	161	ix -= 1;
	162	left = ST(0);
	163	#ifdef OPpLOCALE
	164	if(MAXARG & OPpLOCALE) {
	165	for(index = 1 ; index < items ; index++) {
	166	SV *right = ST(index);
	167	if(sv_cmp_locale(left, right) == ix)
	168	left = right;
	169	}
	170	}
	171	else {
	172	#endif
	173	for(index = 1 ; index < items ; index++) {
	174	SV *right = ST(index);
	175	if(sv_cmp(left, right) == ix)
	176	left = right;
	177	}
	178	#ifdef OPpLOCALE
	179	}
	180	#endif
	181	ST(0) = left;
	182	XSRETURN(1);
	183	}
	184
	185
	186
	187	void
	188	reduce(block,...)
	189	SV * block
	190	PROTOTYPE: &@
	191	CODE:
	192	{
	193	SV *ret;
	194	int index;
f4a2945e	195	GV agv,bgv,*gv;
	196	HV *stash;
	197	CV *cv;
	198	OP *reducecop;
1bfb5477	199	PERL_CONTEXT *cx;
	200	SV** newsp;
	201	I32 gimme = G_SCALAR;
	202	bool oldcatch = CATCH_GET;
	203
f4a2945e	204	if(items <= 1) {
	205	XSRETURN_UNDEF;
	206	}
	207	agv = gv_fetchpv("a", TRUE, SVt_PV);
	208	bgv = gv_fetchpv("b", TRUE, SVt_PV);
	209	SAVESPTR(GvSV(agv));
	210	SAVESPTR(GvSV(bgv));
	211	cv = sv_2cv(block, &stash, &gv, 0);
	212	reducecop = CvSTART(cv);
	213	SAVESPTR(CvROOT(cv)->op_ppaddr);
	214	CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
	215	SAVESPTR(PL_curpad);
	216	PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
	217	SAVETMPS;
	218	SAVESPTR(PL_op);
	219	ret = ST(1);
1bfb5477	220	CATCH_SET(TRUE);
690cde84	221	PUSHBLOCK(cx, CXt_NULL, SP);
f4a2945e	222	for(index = 2 ; index < items ; index++) {
	223	GvSV(agv) = ret;
	224	GvSV(bgv) = ST(index);
	225	PL_op = reducecop;
da53b6b0	226	CALLRUNOPS(aTHX);
f4a2945e	227	ret = *PL_stack_sp;
f4a2945e	228	}
1bfb5477	229	ST(0) = sv_mortalcopy(ret);
	230	POPBLOCK(cx,PL_curpm);
	231	CATCH_SET(oldcatch);
f4a2945e	232	XSRETURN(1);
	233	}
	234
	235	void
	236	first(block,...)
	237	SV * block
	238	PROTOTYPE: &@
	239	CODE:
	240	{
f4a2945e	241	int index;
f4a2945e	242	GV *gv;
	243	HV *stash;
	244	CV *cv;
	245	OP *reducecop;
1bfb5477	246	PERL_CONTEXT *cx;
	247	SV** newsp;
	248	I32 gimme = G_SCALAR;
	249	bool oldcatch = CATCH_GET;
	250
f4a2945e	251	if(items <= 1) {
	252	XSRETURN_UNDEF;
	253	}
	254	SAVESPTR(GvSV(PL_defgv));
	255	cv = sv_2cv(block, &stash, &gv, 0);
	256	reducecop = CvSTART(cv);
	257	SAVESPTR(CvROOT(cv)->op_ppaddr);
	258	CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
	259	SAVESPTR(PL_curpad);
	260	PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
	261	SAVETMPS;
	262	SAVESPTR(PL_op);
1bfb5477	263	CATCH_SET(TRUE);
690cde84	264	PUSHBLOCK(cx, CXt_NULL, SP);
f4a2945e	265	for(index = 1 ; index < items ; index++) {
	266	GvSV(PL_defgv) = ST(index);
	267	PL_op = reducecop;
da53b6b0	268	CALLRUNOPS(aTHX);
f4a2945e	269	if (SvTRUE(*PL_stack_sp)) {
f4a2945e	270	ST(0) = ST(index);
1bfb5477	271	POPBLOCK(cx,PL_curpm);
1bfb5477	272	CATCH_SET(oldcatch);
f4a2945e	273	XSRETURN(1);
	274	}
	275	}
1bfb5477	276	POPBLOCK(cx,PL_curpm);
1bfb5477	277	CATCH_SET(oldcatch);
f4a2945e	278	XSRETURN_UNDEF;
	279	}
	280
1bfb5477	281	void
	282	shuffle(...)
	283	PROTOTYPE: @
	284	CODE:
	285	{
	286	int index;
	287	struct op dmy_op;
	288	struct op *old_op = PL_op;
	289	SV *my_pad[2];
	290	SV **old_curpad = PL_curpad;
	291
c29e891d	292	/* We call pp_rand here so that Drand01 get initialized if rand()
	293	or srand() has not already been called
	294	*/
1bfb5477	295	my_pad[1] = sv_newmortal();
	296	memzero((char*)(&dmy_op), sizeof(struct op));
	297	dmy_op.op_targ = 1;
	298	PL_op = &dmy_op;
	299	PL_curpad = (SV **)&my_pad;
20d72259	300	(void)*(PL_ppaddr[OP_RAND])(aTHX);
1bfb5477	301	PL_op = old_op;
	302	PL_curpad = old_curpad;
	303	for (index = items ; index > 1 ; ) {
	304	int swap = (int)(Drand01() * (double)(index--));
	305	SV *tmp = ST(swap);
	306	ST(swap) = ST(index);
	307	ST(index) = tmp;
	308	}
	309	XSRETURN(items);
	310	}
	311
	312
f4a2945e	313	MODULE=List::Util PACKAGE=Scalar::Util
	314
	315	void
	316	dualvar(num,str)
	317	SV * num
	318	SV * str
	319	PROTOTYPE: $$
	320	CODE:
	321	{
	322	STRLEN len;
	323	char *ptr = SvPV(str,len);
	324	ST(0) = sv_newmortal();
9c5ffd7c	325	(void)SvUPGRADE(ST(0),SVt_PVNV);
f4a2945e	326	sv_setpvn(ST(0),ptr,len);
1bfb5477	327	if(SvNOK(num) \|\| SvPOK(num) \|\| SvMAGICAL(num)) {
f4a2945e	328	SvNVX(ST(0)) = SvNV(num);
	329	SvNOK_on(ST(0));
	330	}
1bfb5477	331	#ifdef SVf_IVisUV
	332	else if (SvUOK(num)) {
	333	SvUVX(ST(0)) = SvUV(num);
	334	SvIOK_on(ST(0));
	335	SvIsUV_on(ST(0));
	336	}
	337	#endif
f4a2945e	338	else {
	339	SvIVX(ST(0)) = SvIV(num);
	340	SvIOK_on(ST(0));
	341	}
	342	if(PL_tainting && (SvTAINTED(num) \|\| SvTAINTED(str)))
	343	SvTAINTED_on(ST(0));
	344	XSRETURN(1);
	345	}
	346
	347	char *
	348	blessed(sv)
	349	SV * sv
	350	PROTOTYPE: $
	351	CODE:
	352	{
	353	if (SvMAGICAL(sv))
	354	mg_get(sv);
	355	if(!sv_isobject(sv)) {
	356	XSRETURN_UNDEF;
	357	}
	358	RETVAL = sv_reftype(SvRV(sv),TRUE);
	359	}
	360	OUTPUT:
	361	RETVAL
	362
	363	char *
	364	reftype(sv)
	365	SV * sv
	366	PROTOTYPE: $
	367	CODE:
	368	{
	369	if (SvMAGICAL(sv))
	370	mg_get(sv);
	371	if(!SvROK(sv)) {
	372	XSRETURN_UNDEF;
	373	}
	374	RETVAL = sv_reftype(SvRV(sv),FALSE);
	375	}
	376	OUTPUT:
	377	RETVAL
	378
	379	void
	380	weaken(sv)
	381	SV *sv
	382	PROTOTYPE: $
	383	CODE:
	384	#ifdef SvWEAKREF
	385	sv_rvweaken(sv);
	386	#else
	387	croak("weak references are not implemented in this release of perl");
	388	#endif
	389
c6c619a9	390	void
f4a2945e	391	isweak(sv)
	392	SV *sv
	393	PROTOTYPE: $
	394	CODE:
	395	#ifdef SvWEAKREF
	396	ST(0) = boolSV(SvROK(sv) && SvWEAKREF(sv));
	397	XSRETURN(1);
	398	#else
	399	croak("weak references are not implemented in this release of perl");
	400	#endif
	401
	402	int
	403	readonly(sv)
	404	SV *sv
	405	PROTOTYPE: $
	406	CODE:
	407	RETVAL = SvREADONLY(sv);
	408	OUTPUT:
	409	RETVAL
	410
	411	int
	412	tainted(sv)
	413	SV *sv
	414	PROTOTYPE: $
	415	CODE:
	416	RETVAL = SvTAINTED(sv);
	417	OUTPUT:
	418	RETVAL
	419
	420	BOOT:
	421	{
	422	#ifndef SvWEAKREF
	423	HV *stash = gv_stashpvn("Scalar::Util", 12, TRUE);
	424	GV vargv = (GV**)hv_fetch(stash, "EXPORT_FAIL", 11, TRUE);
	425	AV *varav;
	426	if (SvTYPE(vargv) != SVt_PVGV)
	427	gv_init(vargv, stash, "Scalar::Util", 12, TRUE);
	428	varav = GvAVn(vargv);
	429	av_push(varav, newSVpv("weaken",6));
	430	av_push(varav, newSVpv("isweak",6));
	431	#endif
	432	}