[perl5.git] / ext / XS / APItest / APItest.xs

#define PERL_IN_XS_APITEST
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"


/* for my_cxt tests */

#define MY_CXT_KEY "XS::APItest::_guts" XS_VERSION

typedef struct {
    int i;
    SV *sv;
} my_cxt_t;

START_MY_CXT

/* indirect functions to test the [pa]MY_CXT macros */

int
my_cxt_getint_p(pMY_CXT)
{
    return MY_CXT.i;
}

void
my_cxt_setint_p(pMY_CXT_ int i)
{
    MY_CXT.i = i;
}

SV*
my_cxt_getsv_interp()
{
#ifdef PERL_IMPLICIT_CONTEXT
    dTHX;
    dMY_CXT_INTERP(my_perl);
#else
    dMY_CXT;
#endif
    return MY_CXT.sv;
}

void
my_cxt_setsv_p(SV* sv _pMY_CXT)
{
    MY_CXT.sv = sv;
}


/* from exception.c */
int exception(int);

/* A routine to test hv_delayfree_ent
   (which itself is tested by testing on hv_free_ent  */

typedef void (freeent_function)(pTHX_ HV *, register HE *);

void
test_freeent(freeent_function *f) {
    dTHX;
    dSP;
    HV *test_hash = newHV();
    HE *victim;
    SV *test_scalar;
    U32 results[4];
    int i;

#ifdef PURIFY
    victim = (HE*)safemalloc(sizeof(HE));
#else
    /* Storing then deleting something should ensure that a hash entry is
       available.  */
    hv_store(test_hash, "", 0, &PL_sv_yes, 0);
    hv_delete(test_hash, "", 0, 0);

    /* We need to "inline" new_he here as it's static, and the functions we
       test expect to be able to call del_HE on the HE  */
    if (!PL_body_roots[HE_SVSLOT])
	croak("PL_he_root is 0");
    victim = PL_body_roots[HE_SVSLOT];
    PL_body_roots[HE_SVSLOT] = HeNEXT(victim);
#endif

    victim->hent_hek = Perl_share_hek(aTHX_ "", 0, 0);

    test_scalar = newSV(0);
    SvREFCNT_inc(test_scalar);
    HeVAL(victim) = test_scalar;

    /* Need this little game else we free the temps on the return stack.  */
    results[0] = SvREFCNT(test_scalar);
    SAVETMPS;
    results[1] = SvREFCNT(test_scalar);
    f(aTHX_ test_hash, victim);
    results[2] = SvREFCNT(test_scalar);
    FREETMPS;
    results[3] = SvREFCNT(test_scalar);

    i = 0;
    do {
	mPUSHu(results[i]);
    } while (++i < sizeof(results)/sizeof(results[0]));

    /* Goodbye to our extra reference.  */
    SvREFCNT_dec(test_scalar);
}

MODULE = XS::APItest:Hash		PACKAGE = XS::APItest::Hash

#define UTF8KLEN(sv, len)   (SvUTF8(sv) ? -(I32)len : (I32)len)

bool
exists(hash, key_sv)
	PREINIT:
	STRLEN len;
	const char *key;
	INPUT:
	HV *hash
	SV *key_sv
	CODE:
	key = SvPV(key_sv, len);
	RETVAL = hv_exists(hash, key, UTF8KLEN(key_sv, len));
        OUTPUT:
        RETVAL

SV *
delete(hash, key_sv)
	PREINIT:
	STRLEN len;
	const char *key;
	INPUT:
	HV *hash
	SV *key_sv
	CODE:
	key = SvPV(key_sv, len);
	/* It's already mortal, so need to increase reference count.  */
	RETVAL = SvREFCNT_inc(hv_delete(hash, key, UTF8KLEN(key_sv, len), 0));
        OUTPUT:
        RETVAL

SV *
store_ent(hash, key, value)
	PREINIT:
	SV *copy;
	HE *result;
	INPUT:
	HV *hash
	SV *key
	SV *value
	CODE:
	copy = newSV(0);
	result = hv_store_ent(hash, key, copy, 0);
	SvSetMagicSV(copy, value);
	if (!result) {
	    SvREFCNT_dec(copy);
	    XSRETURN_EMPTY;
	}
	/* It's about to become mortal, so need to increase reference count.
	 */
	RETVAL = SvREFCNT_inc(HeVAL(result));
        OUTPUT:
        RETVAL


SV *
store(hash, key_sv, value)
	PREINIT:
	STRLEN len;
	const char *key;
	SV *copy;
	SV **result;
	INPUT:
	HV *hash
	SV *key_sv
	SV *value
	CODE:
	key = SvPV(key_sv, len);
	copy = newSV(0);
	result = hv_store(hash, key, UTF8KLEN(key_sv, len), copy, 0);
	SvSetMagicSV(copy, value);
	if (!result) {
	    SvREFCNT_dec(copy);
	    XSRETURN_EMPTY;
	}
	/* It's about to become mortal, so need to increase reference count.
	 */
	RETVAL = SvREFCNT_inc(*result);
        OUTPUT:
        RETVAL


SV *
fetch(hash, key_sv)
	PREINIT:
	STRLEN len;
	const char *key;
	SV **result;
	INPUT:
	HV *hash
	SV *key_sv
	CODE:
	key = SvPV(key_sv, len);
	result = hv_fetch(hash, key, UTF8KLEN(key_sv, len), 0);
	if (!result) {
	    XSRETURN_EMPTY;
	}
	/* Force mg_get  */
	RETVAL = newSVsv(*result);
        OUTPUT:
        RETVAL

void
test_hv_free_ent()
	PPCODE:
	test_freeent(&Perl_hv_free_ent);
	XSRETURN(4);

void
test_hv_delayfree_ent()
	PPCODE:
	test_freeent(&Perl_hv_delayfree_ent);
	XSRETURN(4);
	    
=pod

sub TIEHASH  { bless {}, $_[0] }
sub STORE    { $_[0]->{$_[1]} = $_[2] }
sub FETCH    { $_[0]->{$_[1]} }
sub FIRSTKEY { my $a = scalar keys %{$_[0]}; each %{$_[0]} }
sub NEXTKEY  { each %{$_[0]} }
sub EXISTS   { exists $_[0]->{$_[1]} }
sub DELETE   { delete $_[0]->{$_[1]} }
sub CLEAR    { %{$_[0]} = () }

=cut

MODULE = XS::APItest		PACKAGE = XS::APItest

PROTOTYPES: DISABLE

BOOT:
{
    MY_CXT_INIT;
    MY_CXT.i  = 99;
    MY_CXT.sv = newSVpv("initial",0);
}                              

void
CLONE(...)
    CODE:
    MY_CXT_CLONE;
    MY_CXT.sv = newSVpv("initial_clone",0);

void
print_double(val)
        double val
        CODE:
        printf("%5.3f\n",val);

int
have_long_double()
        CODE:
#ifdef HAS_LONG_DOUBLE
        RETVAL = 1;
#else
        RETVAL = 0;
#endif
        OUTPUT:
        RETVAL

void
print_long_double()
        CODE:
#ifdef HAS_LONG_DOUBLE
#   if defined(PERL_PRIfldbl) && (LONG_DOUBLESIZE > DOUBLESIZE)
        long double val = 7.0;
        printf("%5.3" PERL_PRIfldbl "\n",val);
#   else
        double val = 7.0;
        printf("%5.3f\n",val);
#   endif
#endif

void
print_int(val)
        int val
        CODE:
        printf("%d\n",val);

void
print_long(val)
        long val
        CODE:
        printf("%ld\n",val);

void
print_float(val)
        float val
        CODE:
        printf("%5.3f\n",val);
	
void
print_flush()
    	CODE:
	fflush(stdout);

void
mpushp()
	PPCODE:
	EXTEND(SP, 3);
	mPUSHp("one", 3);
	mPUSHp("two", 3);
	mPUSHp("three", 5);
	XSRETURN(3);

void
mpushn()
	PPCODE:
	EXTEND(SP, 3);
	mPUSHn(0.5);
	mPUSHn(-0.25);
	mPUSHn(0.125);
	XSRETURN(3);

void
mpushi()
	PPCODE:
	EXTEND(SP, 3);
	mPUSHi(-1);
	mPUSHi(2);
	mPUSHi(-3);
	XSRETURN(3);

void
mpushu()
	PPCODE:
	EXTEND(SP, 3);
	mPUSHu(1);
	mPUSHu(2);
	mPUSHu(3);
	XSRETURN(3);

void
mxpushp()
	PPCODE:
	mXPUSHp("one", 3);
	mXPUSHp("two", 3);
	mXPUSHp("three", 5);
	XSRETURN(3);

void
mxpushn()
	PPCODE:
	mXPUSHn(0.5);
	mXPUSHn(-0.25);
	mXPUSHn(0.125);
	XSRETURN(3);

void
mxpushi()
	PPCODE:
	mXPUSHi(-1);
	mXPUSHi(2);
	mXPUSHi(-3);
	XSRETURN(3);

void
mxpushu()
	PPCODE:
	mXPUSHu(1);
	mXPUSHu(2);
	mXPUSHu(3);
	XSRETURN(3);


void
call_sv(sv, flags, ...)
    SV* sv
    I32 flags
    PREINIT:
	I32 i;
    PPCODE:
	for (i=0; i<items-2; i++)
	    ST(i) = ST(i+2); /* pop first two args */
	PUSHMARK(SP);
	SP += items - 2;
	PUTBACK;
	i = call_sv(sv, flags);
	SPAGAIN;
	EXTEND(SP, 1);
	PUSHs(sv_2mortal(newSViv(i)));

void
call_pv(subname, flags, ...)
    char* subname
    I32 flags
    PREINIT:
	I32 i;
    PPCODE:
	for (i=0; i<items-2; i++)
	    ST(i) = ST(i+2); /* pop first two args */
	PUSHMARK(SP);
	SP += items - 2;
	PUTBACK;
	i = call_pv(subname, flags);
	SPAGAIN;
	EXTEND(SP, 1);
	PUSHs(sv_2mortal(newSViv(i)));

void
call_method(methname, flags, ...)
    char* methname
    I32 flags
    PREINIT:
	I32 i;
    PPCODE:
	for (i=0; i<items-2; i++)
	    ST(i) = ST(i+2); /* pop first two args */
	PUSHMARK(SP);
	SP += items - 2;
	PUTBACK;
	i = call_method(methname, flags);
	SPAGAIN;
	EXTEND(SP, 1);
	PUSHs(sv_2mortal(newSViv(i)));

void
eval_sv(sv, flags)
    SV* sv
    I32 flags
    PREINIT:
    	I32 i;
    PPCODE:
	PUTBACK;
	i = eval_sv(sv, flags);
	SPAGAIN;
	EXTEND(SP, 1);
	PUSHs(sv_2mortal(newSViv(i)));

void
eval_pv(p, croak_on_error)
    const char* p
    I32 croak_on_error
    PPCODE:
	PUTBACK;
	EXTEND(SP, 1);
	PUSHs(eval_pv(p, croak_on_error));

void
require_pv(pv)
    const char* pv
    PPCODE:
	PUTBACK;
	require_pv(pv);

int
exception(throw_e)
    int throw_e
    OUTPUT:
        RETVAL

void
mycroak(pv)
    const char* pv
    CODE:
    Perl_croak(aTHX_ "%s", pv);

SV*
strtab()
   CODE:
   RETVAL = newRV_inc((SV*)PL_strtab);
   OUTPUT:
   RETVAL

int
my_cxt_getint()
    CODE:
	dMY_CXT;
	RETVAL = my_cxt_getint_p(aMY_CXT);
    OUTPUT:
        RETVAL

void
my_cxt_setint(i)
    int i;
    CODE:
	dMY_CXT;
	my_cxt_setint_p(aMY_CXT_ i);

void
my_cxt_getsv()
    PPCODE:
	EXTEND(SP, 1);
	ST(0) = my_cxt_getsv_interp();
	XSRETURN(1);

void
my_cxt_setsv(sv)
    SV *sv;
    CODE:
	dMY_CXT;
	SvREFCNT_dec(MY_CXT.sv);
	my_cxt_setsv_p(sv _aMY_CXT);
	SvREFCNT_inc(sv);
Commit	Line	Data
6a93a7e5	1	#define PERL_IN_XS_APITEST
3e61d65a JH	2	#include "EXTERN.h"
	3	#include "perl.h"
	4	#include "XSUB.h"
	5
85ce96a1 DM	6
	7	/* for my_cxt tests */
	8
	9	#define MY_CXT_KEY "XS::APItest::_guts" XS_VERSION
	10
	11	typedef struct {
	12	int i;
	13	SV *sv;
	14	} my_cxt_t;
	15
	16	START_MY_CXT
	17
	18	/* indirect functions to test the [pa]MY_CXT macros */
f16dd614	19
85ce96a1 DM	20	int
	21	my_cxt_getint_p(pMY_CXT)
	22	{
	23	return MY_CXT.i;
	24	}
f16dd614	25
85ce96a1 DM	26	void
	27	my_cxt_setint_p(pMY_CXT_ int i)
	28	{
	29	MY_CXT.i = i;
	30	}
f16dd614 DM	31
	32	SV*
	33	my_cxt_getsv_interp()
	34	{
	35	#ifdef PERL_IMPLICIT_CONTEXT
	36	dTHX;
	37	dMY_CXT_INTERP(my_perl);
	38	#else
	39	dMY_CXT;
	40	#endif
	41	return MY_CXT.sv;
	42	}
	43
85ce96a1 DM	44	void
	45	my_cxt_setsv_p(SV* sv _pMY_CXT)
	46	{
	47	MY_CXT.sv = sv;
	48	}
	49
	50
9b5c3821 MHM	51	/* from exception.c */
9b5c3821 MHM	52	int exception(int);
0314122a	53
2dc92170 NC	54	/* A routine to test hv_delayfree_ent
	55	(which itself is tested by testing on hv_free_ent */
	56
	57	typedef void (freeent_function)(pTHX_ HV , register HE );
	58
	59	void
	60	test_freeent(freeent_function *f) {
	61	dTHX;
	62	dSP;
	63	HV *test_hash = newHV();
	64	HE *victim;
	65	SV *test_scalar;
	66	U32 results[4];
	67	int i;
	68
8afd2d2e NC	69	#ifdef PURIFY
	70	victim = (HE*)safemalloc(sizeof(HE));
	71	#else
2dc92170 NC	72	/* Storing then deleting something should ensure that a hash entry is
	73	available. */
	74	hv_store(test_hash, "", 0, &PL_sv_yes, 0);
	75	hv_delete(test_hash, "", 0, 0);
	76
	77	/* We need to "inline" new_he here as it's static, and the functions we
	78	test expect to be able to call del_HE on the HE */
6a93a7e5	79	if (!PL_body_roots[HE_SVSLOT])
2dc92170	80	croak("PL_he_root is 0");
6a93a7e5 NC	81	victim = PL_body_roots[HE_SVSLOT];
6a93a7e5 NC	82	PL_body_roots[HE_SVSLOT] = HeNEXT(victim);
8afd2d2e	83	#endif
2dc92170 NC	84
	85	victim->hent_hek = Perl_share_hek(aTHX_ "", 0, 0);
	86
	87	test_scalar = newSV(0);
	88	SvREFCNT_inc(test_scalar);
de616631	89	HeVAL(victim) = test_scalar;
2dc92170 NC	90
	91	/* Need this little game else we free the temps on the return stack. */
	92	results[0] = SvREFCNT(test_scalar);
	93	SAVETMPS;
	94	results[1] = SvREFCNT(test_scalar);
	95	f(aTHX_ test_hash, victim);
	96	results[2] = SvREFCNT(test_scalar);
	97	FREETMPS;
	98	results[3] = SvREFCNT(test_scalar);
	99
	100	i = 0;
	101	do {
	102	mPUSHu(results[i]);
	103	} while (++i < sizeof(results)/sizeof(results[0]));
	104
	105	/* Goodbye to our extra reference. */
	106	SvREFCNT_dec(test_scalar);
	107	}
	108
0314122a NC	109	MODULE = XS::APItest:Hash PACKAGE = XS::APItest::Hash
0314122a NC	110
028f8eaa MHM	111	#define UTF8KLEN(sv, len) (SvUTF8(sv) ? -(I32)len : (I32)len)
028f8eaa MHM	112
0314122a NC	113	bool
	114	exists(hash, key_sv)
	115	PREINIT:
	116	STRLEN len;
	117	const char *key;
	118	INPUT:
	119	HV *hash
	120	SV *key_sv
	121	CODE:
	122	key = SvPV(key_sv, len);
028f8eaa	123	RETVAL = hv_exists(hash, key, UTF8KLEN(key_sv, len));
0314122a NC	124	OUTPUT:
	125	RETVAL
	126
b60cf05a NC	127	SV *
	128	delete(hash, key_sv)
	129	PREINIT:
	130	STRLEN len;
	131	const char *key;
	132	INPUT:
	133	HV *hash
	134	SV *key_sv
	135	CODE:
	136	key = SvPV(key_sv, len);
	137	/* It's already mortal, so need to increase reference count. */
028f8eaa	138	RETVAL = SvREFCNT_inc(hv_delete(hash, key, UTF8KLEN(key_sv, len), 0));
b60cf05a NC	139	OUTPUT:
	140	RETVAL
	141
	142	SV *
858117f8 NC	143	store_ent(hash, key, value)
	144	PREINIT:
	145	SV *copy;
	146	HE *result;
	147	INPUT:
	148	HV *hash
	149	SV *key
	150	SV *value
	151	CODE:
	152	copy = newSV(0);
	153	result = hv_store_ent(hash, key, copy, 0);
	154	SvSetMagicSV(copy, value);
	155	if (!result) {
	156	SvREFCNT_dec(copy);
	157	XSRETURN_EMPTY;
	158	}
	159	/* It's about to become mortal, so need to increase reference count.
	160	*/
	161	RETVAL = SvREFCNT_inc(HeVAL(result));
	162	OUTPUT:
	163	RETVAL
	164
	165
	166	SV *
b60cf05a NC	167	store(hash, key_sv, value)
	168	PREINIT:
	169	STRLEN len;
	170	const char *key;
	171	SV *copy;
	172	SV **result;
	173	INPUT:
	174	HV *hash
	175	SV *key_sv
	176	SV *value
	177	CODE:
	178	key = SvPV(key_sv, len);
	179	copy = newSV(0);
028f8eaa	180	result = hv_store(hash, key, UTF8KLEN(key_sv, len), copy, 0);
858117f8	181	SvSetMagicSV(copy, value);
b60cf05a NC	182	if (!result) {
	183	SvREFCNT_dec(copy);
	184	XSRETURN_EMPTY;
	185	}
	186	/* It's about to become mortal, so need to increase reference count.
	187	*/
	188	RETVAL = SvREFCNT_inc(*result);
	189	OUTPUT:
	190	RETVAL
	191
	192
	193	SV *
	194	fetch(hash, key_sv)
	195	PREINIT:
	196	STRLEN len;
	197	const char *key;
	198	SV **result;
	199	INPUT:
	200	HV *hash
	201	SV *key_sv
	202	CODE:
	203	key = SvPV(key_sv, len);
028f8eaa	204	result = hv_fetch(hash, key, UTF8KLEN(key_sv, len), 0);
b60cf05a NC	205	if (!result) {
	206	XSRETURN_EMPTY;
	207	}
	208	/* Force mg_get */
	209	RETVAL = newSVsv(*result);
	210	OUTPUT:
	211	RETVAL
2dc92170	212
439efdfe	213	void
2dc92170 NC	214	test_hv_free_ent()
	215	PPCODE:
	216	test_freeent(&Perl_hv_free_ent);
	217	XSRETURN(4);
	218
439efdfe	219	void
2dc92170 NC	220	test_hv_delayfree_ent()
	221	PPCODE:
	222	test_freeent(&Perl_hv_delayfree_ent);
	223	XSRETURN(4);
	224
0314122a NC	225	=pod
	226
	227	sub TIEHASH { bless {}, $_[0] }
	228	sub STORE { $_[0]->{$_[1]} = $_[2] }
	229	sub FETCH { $_[0]->{$_[1]} }
	230	sub FIRSTKEY { my $a = scalar keys %{$_[0]}; each %{$_[0]} }
	231	sub NEXTKEY { each %{$_[0]} }
	232	sub EXISTS { exists $_[0]->{$_[1]} }
	233	sub DELETE { delete $_[0]->{$_[1]} }
	234	sub CLEAR { %{$_[0]} = () }
	235
	236	=cut
	237
3e61d65a JH	238	MODULE = XS::APItest PACKAGE = XS::APItest
	239
	240	PROTOTYPES: DISABLE
	241
85ce96a1 DM	242	BOOT:
	243	{
	244	MY_CXT_INIT;
	245	MY_CXT.i = 99;
	246	MY_CXT.sv = newSVpv("initial",0);
	247	}
	248
	249	void
	250	CLONE(...)
	251	CODE:
	252	MY_CXT_CLONE;
	253	MY_CXT.sv = newSVpv("initial_clone",0);
	254
3e61d65a JH	255	void
	256	print_double(val)
	257	double val
	258	CODE:
	259	printf("%5.3f\n",val);
	260
	261	int
	262	have_long_double()
	263	CODE:
	264	#ifdef HAS_LONG_DOUBLE
	265	RETVAL = 1;
	266	#else
	267	RETVAL = 0;
	268	#endif
cabb36f0 CN	269	OUTPUT:
cabb36f0 CN	270	RETVAL
3e61d65a JH	271
	272	void
	273	print_long_double()
	274	CODE:
	275	#ifdef HAS_LONG_DOUBLE
fc0bf671	276	# if defined(PERL_PRIfldbl) && (LONG_DOUBLESIZE > DOUBLESIZE)
3e61d65a JH	277	long double val = 7.0;
	278	printf("%5.3" PERL_PRIfldbl "\n",val);
	279	# else
	280	double val = 7.0;
	281	printf("%5.3f\n",val);
	282	# endif
	283	#endif
	284
	285	void
3e61d65a JH	286	print_int(val)
	287	int val
	288	CODE:
	289	printf("%d\n",val);
	290
	291	void
	292	print_long(val)
	293	long val
	294	CODE:
	295	printf("%ld\n",val);
	296
	297	void
	298	print_float(val)
	299	float val
	300	CODE:
	301	printf("%5.3f\n",val);
9d911683 NIS	302
	303	void
	304	print_flush()
	305	CODE:
	306	fflush(stdout);
d4b90eee SH	307
	308	void
	309	mpushp()
	310	PPCODE:
	311	EXTEND(SP, 3);
	312	mPUSHp("one", 3);
	313	mPUSHp("two", 3);
	314	mPUSHp("three", 5);
	315	XSRETURN(3);
	316
	317	void
	318	mpushn()
	319	PPCODE:
	320	EXTEND(SP, 3);
	321	mPUSHn(0.5);
	322	mPUSHn(-0.25);
	323	mPUSHn(0.125);
	324	XSRETURN(3);
	325
	326	void
	327	mpushi()
	328	PPCODE:
	329	EXTEND(SP, 3);
d75b63cf MHM	330	mPUSHi(-1);
	331	mPUSHi(2);
	332	mPUSHi(-3);
d4b90eee SH	333	XSRETURN(3);
	334
	335	void
	336	mpushu()
	337	PPCODE:
	338	EXTEND(SP, 3);
d75b63cf MHM	339	mPUSHu(1);
	340	mPUSHu(2);
	341	mPUSHu(3);
d4b90eee SH	342	XSRETURN(3);
	343
	344	void
	345	mxpushp()
	346	PPCODE:
	347	mXPUSHp("one", 3);
	348	mXPUSHp("two", 3);
	349	mXPUSHp("three", 5);
	350	XSRETURN(3);
	351
	352	void
	353	mxpushn()
	354	PPCODE:
	355	mXPUSHn(0.5);
	356	mXPUSHn(-0.25);
	357	mXPUSHn(0.125);
	358	XSRETURN(3);
	359
	360	void
	361	mxpushi()
	362	PPCODE:
d75b63cf MHM	363	mXPUSHi(-1);
	364	mXPUSHi(2);
	365	mXPUSHi(-3);
d4b90eee SH	366	XSRETURN(3);
	367
	368	void
	369	mxpushu()
	370	PPCODE:
d75b63cf MHM	371	mXPUSHu(1);
	372	mXPUSHu(2);
	373	mXPUSHu(3);
d4b90eee	374	XSRETURN(3);
d1f347d7 DM	375
	376
	377	void
	378	call_sv(sv, flags, ...)
	379	SV* sv
	380	I32 flags
	381	PREINIT:
	382	I32 i;
	383	PPCODE:
	384	for (i=0; i<items-2; i++)
	385	ST(i) = ST(i+2); /* pop first two args */
	386	PUSHMARK(SP);
	387	SP += items - 2;
	388	PUTBACK;
	389	i = call_sv(sv, flags);
	390	SPAGAIN;
	391	EXTEND(SP, 1);
	392	PUSHs(sv_2mortal(newSViv(i)));
	393
	394	void
	395	call_pv(subname, flags, ...)
	396	char* subname
	397	I32 flags
	398	PREINIT:
	399	I32 i;
	400	PPCODE:
	401	for (i=0; i<items-2; i++)
	402	ST(i) = ST(i+2); /* pop first two args */
	403	PUSHMARK(SP);
	404	SP += items - 2;
	405	PUTBACK;
	406	i = call_pv(subname, flags);
	407	SPAGAIN;
	408	EXTEND(SP, 1);
	409	PUSHs(sv_2mortal(newSViv(i)));
	410
	411	void
	412	call_method(methname, flags, ...)
	413	char* methname
	414	I32 flags
	415	PREINIT:
	416	I32 i;
	417	PPCODE:
	418	for (i=0; i<items-2; i++)
	419	ST(i) = ST(i+2); /* pop first two args */
	420	PUSHMARK(SP);
	421	SP += items - 2;
	422	PUTBACK;
	423	i = call_method(methname, flags);
	424	SPAGAIN;
	425	EXTEND(SP, 1);
	426	PUSHs(sv_2mortal(newSViv(i)));
	427
	428	void
	429	eval_sv(sv, flags)
	430	SV* sv
	431	I32 flags
	432	PREINIT:
	433	I32 i;
	434	PPCODE:
	435	PUTBACK;
	436	i = eval_sv(sv, flags);
	437	SPAGAIN;
	438	EXTEND(SP, 1);
439	PUSHs(sv_2mortal(newSViv(i)));
440
b8e65a9b	441	void
d1f347d7 DM	442	eval_pv(p, croak_on_error)
	443	const char* p
	444	I32 croak_on_error
d1f347d7 DM	445	PPCODE:
	446	PUTBACK;
	447	EXTEND(SP, 1);
	448	PUSHs(eval_pv(p, croak_on_error));
	449
	450	void
	451	require_pv(pv)
	452	const char* pv
d1f347d7 DM	453	PPCODE:
	454	PUTBACK;
	455	require_pv(pv);
	456
0ca3a874 MHM	457	int
	458	exception(throw_e)
	459	int throw_e
	460	OUTPUT:
	461	RETVAL
d1f347d7	462
ef469b03 DM	463	void
	464	mycroak(pv)
	465	const char* pv
	466	CODE:
	467	Perl_croak(aTHX_ "%s", pv);
5d2b1485 NC	468
	469	SV*
	470	strtab()
	471	CODE:
	472	RETVAL = newRV_inc((SV*)PL_strtab);
	473	OUTPUT:
	474	RETVAL
85ce96a1 DM	475
	476	int
	477	my_cxt_getint()
	478	CODE:
	479	dMY_CXT;
	480	RETVAL = my_cxt_getint_p(aMY_CXT);
	481	OUTPUT:
	482	RETVAL
	483
	484	void
	485	my_cxt_setint(i)
	486	int i;
	487	CODE:
	488	dMY_CXT;
	489	my_cxt_setint_p(aMY_CXT_ i);
	490
	491	void
	492	my_cxt_getsv()
	493	PPCODE:
85ce96a1	494	EXTEND(SP, 1);
f16dd614	495	ST(0) = my_cxt_getsv_interp();
85ce96a1 DM	496	XSRETURN(1);
	497
	498	void
	499	my_cxt_setsv(sv)
	500	SV *sv;
	501	CODE:
	502	dMY_CXT;
	503	SvREFCNT_dec(MY_CXT.sv);
	504	my_cxt_setsv_p(sv _aMY_CXT);
	505	SvREFCNT_inc(sv);