[p5sagit/p5-mst-13.2.git] / av.c

/*    av.c
 *
 *    Copyright (c) 1991-1997, Larry Wall
 *
 *    You may distribute under the terms of either the GNU General Public
 *    License or the Artistic License, as specified in the README file.
 *
 */

/*
 * "...for the Entwives desired order, and plenty, and peace (by which they
 * meant that things should remain where they had set them)." --Treebeard
 */

#include "EXTERN.h"
#include "perl.h"

void
av_reify(AV *av)
{
    I32 key;
    SV* sv;

    if (AvREAL(av))                           
	return;          
#ifdef DEBUGGING
    if (SvRMAGICAL(av) && mg_find((SV*)av,'P')) 
	warn("av_reify called on tied array");
#endif
    key = AvMAX(av) + 1;
    while (key > AvFILLp(av) + 1)
	AvARRAY(av)[--key] = &sv_undef;
    while (key) {
	sv = AvARRAY(av)[--key];
	assert(sv);
	if (sv != &sv_undef) {
	    dTHR;
	    (void)SvREFCNT_inc(sv);
	}
    }
    key = AvARRAY(av) - AvALLOC(av);
    while (key)
	AvALLOC(av)[--key] = &sv_undef;
    AvREAL_on(av);
}

void
av_extend(AV *av, I32 key)
{
    dTHR;			/* only necessary if we have to extend stack */
    MAGIC *mg;
    if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
	dSP;
	ENTER;
	SAVETMPS;
	PUSHMARK(sp);
	EXTEND(sp,2);
	PUSHs(mg->mg_obj);
	PUSHs(sv_2mortal(newSViv(key)));
        PUTBACK;
	perl_call_method("EXTEND", G_SCALAR|G_DISCARD);
	FREETMPS;
	LEAVE;
	return;
    }
    if (key > AvMAX(av)) {
	SV** ary;
	I32 tmp;
	I32 newmax;

	if (AvALLOC(av) != AvARRAY(av)) {
	    ary = AvALLOC(av) + AvFILLp(av) + 1;
	    tmp = AvARRAY(av) - AvALLOC(av);
	    Move(AvARRAY(av), AvALLOC(av), AvFILLp(av)+1, SV*);
	    AvMAX(av) += tmp;
	    SvPVX(av) = (char*)AvALLOC(av);
	    if (AvREAL(av)) {
		while (tmp)
		    ary[--tmp] = &sv_undef;
	    }
	    
	    if (key > AvMAX(av) - 10) {
		newmax = key + AvMAX(av);
		goto resize;
	    }
	}
	else {
	    if (AvALLOC(av)) {
#ifndef STRANGE_MALLOC
		U32 bytes;
#endif

		newmax = key + AvMAX(av) / 5;
	      resize:
#ifdef STRANGE_MALLOC
		Renew(AvALLOC(av),newmax+1, SV*);
#else
		bytes = (newmax + 1) * sizeof(SV*);
#define MALLOC_OVERHEAD 16
		tmp = MALLOC_OVERHEAD;
		while (tmp - MALLOC_OVERHEAD < bytes)
		    tmp += tmp;
		tmp -= MALLOC_OVERHEAD;
		tmp /= sizeof(SV*);
		assert(tmp > newmax);
		newmax = tmp - 1;
		New(2,ary, newmax+1, SV*);
		Copy(AvALLOC(av), ary, AvMAX(av)+1, SV*);
		if (AvMAX(av) > 64)
		    offer_nice_chunk(AvALLOC(av), (AvMAX(av)+1) * sizeof(SV*));
		else
		    Safefree(AvALLOC(av));
		AvALLOC(av) = ary;
#endif
		ary = AvALLOC(av) + AvMAX(av) + 1;
		tmp = newmax - AvMAX(av);
		if (av == curstack) {	/* Oops, grew stack (via av_store()?) */
		    stack_sp = AvALLOC(av) + (stack_sp - stack_base);
		    stack_base = AvALLOC(av);
		    stack_max = stack_base + newmax;
		}
	    }
	    else {
		newmax = key < 4 ? 4 : key;
		New(2,AvALLOC(av), newmax+1, SV*);
		ary = AvALLOC(av) + 1;
		tmp = newmax;
		AvALLOC(av)[0] = &sv_undef;	/* For the stacks */
	    }
	    if (AvREAL(av)) {
		while (tmp)
		    ary[--tmp] = &sv_undef;
	    }
	    
	    SvPVX(av) = (char*)AvALLOC(av);
	    AvMAX(av) = newmax;
	}
    }
}

SV**
av_fetch(register AV *av, I32 key, I32 lval)
{
    SV *sv;

    if (!av)
	return 0;

    if (key < 0) {
	key += AvFILL(av) + 1;
	if (key < 0)
	    return 0;
    }

    if (SvRMAGICAL(av)) {
	if (mg_find((SV*)av,'P')) {
	    dTHR;
	    sv = sv_newmortal();
	    mg_copy((SV*)av, sv, 0, key);
	    Sv = sv;
	    return &Sv;
	}
    }

    if (key > AvFILLp(av)) {
	if (!lval)
	    return 0;
	if (AvREALISH(av))
	    sv = NEWSV(5,0);
	else
	    sv = sv_newmortal();
	return av_store(av,key,sv);
    }
    if (AvARRAY(av)[key] == &sv_undef) {
    emptyness:
	if (lval) {
	    sv = NEWSV(6,0);
	    return av_store(av,key,sv);
	}
	return 0;
    }
    else if (AvREIFY(av)
	     && (!AvARRAY(av)[key]	/* eg. @_ could have freed elts */
		 || SvTYPE(AvARRAY(av)[key]) == SVTYPEMASK)) {
	AvARRAY(av)[key] = &sv_undef;	/* 1/2 reify */
	goto emptyness;
    }
    return &AvARRAY(av)[key];
}

SV**
av_store(register AV *av, I32 key, SV *val)
{
    SV** ary;
    U32  fill;


    if (!av)
	return 0;
    if (!val)
	val = &sv_undef;

    if (key < 0) {
	key += AvFILL(av) + 1;
	if (key < 0)
	    return 0;
    }

    if (SvREADONLY(av) && key >= AvFILL(av))
	croak(no_modify);

    if (SvRMAGICAL(av)) {
	if (mg_find((SV*)av,'P')) {
	    if (val != &sv_undef) {
		mg_copy((SV*)av, val, 0, key);
	    }
	    return 0;
	}
    }

    if (!AvREAL(av) && AvREIFY(av))
	av_reify(av);
    if (key > AvMAX(av))
	av_extend(av,key);
    ary = AvARRAY(av);
    if (AvFILLp(av) < key) {
	if (!AvREAL(av)) {
	    dTHR;
	    if (av == curstack && key > stack_sp - stack_base)
		stack_sp = stack_base + key;	/* XPUSH in disguise */
	    do
		ary[++AvFILLp(av)] = &sv_undef;
	    while (AvFILLp(av) < key);
	}
	AvFILLp(av) = key;
    }
    else if (AvREAL(av))
	SvREFCNT_dec(ary[key]);
    ary[key] = val;
    if (SvSMAGICAL(av)) {
	if (val != &sv_undef) {
	    MAGIC* mg = SvMAGIC(av);
	    sv_magic(val, (SV*)av, toLOWER(mg->mg_type), 0, key);
	}
	mg_set((SV*)av);
    }
    return &ary[key];
}

AV *
newAV(void)
{
    register AV *av;

    av = (AV*)NEWSV(3,0);
    sv_upgrade((SV *)av, SVt_PVAV);
    AvREAL_on(av);
    AvALLOC(av) = 0;
    SvPVX(av) = 0;
    AvMAX(av) = AvFILLp(av) = -1;
    return av;
}

AV *
av_make(register I32 size, register SV **strp)
{
    register AV *av;
    register I32 i;
    register SV** ary;

    av = (AV*)NEWSV(8,0);
    sv_upgrade((SV *) av,SVt_PVAV);
    AvFLAGS(av) = AVf_REAL;
    if (size) {		/* `defined' was returning undef for size==0 anyway. */
	New(4,ary,size,SV*);
	AvALLOC(av) = ary;
	SvPVX(av) = (char*)ary;
	AvFILLp(av) = size - 1;
	AvMAX(av) = size - 1;
	for (i = 0; i < size; i++) {
	    assert (*strp);
	    ary[i] = NEWSV(7,0);
	    sv_setsv(ary[i], *strp);
	    strp++;
	}
    }
    return av;
}

AV *
av_fake(register I32 size, register SV **strp)
{
    register AV *av;
    register SV** ary;

    av = (AV*)NEWSV(9,0);
    sv_upgrade((SV *)av, SVt_PVAV);
    New(4,ary,size+1,SV*);
    AvALLOC(av) = ary;
    Copy(strp,ary,size,SV*);
    AvFLAGS(av) = AVf_REIFY;
    SvPVX(av) = (char*)ary;
    AvFILLp(av) = size - 1;
    AvMAX(av) = size - 1;
    while (size--) {
	assert (*strp);
	SvTEMP_off(*strp);
	strp++;
    }
    return av;
}

void
av_clear(register AV *av)
{
    register I32 key;
    SV** ary;

#ifdef DEBUGGING
    if (SvREFCNT(av) <= 0) {
	warn("Attempt to clear deleted array");
    }
#endif
    if (!av || AvMAX(av) < 0)
	return;
    /*SUPPRESS 560*/

    /* Give any tie a chance to cleanup first */
    if (SvRMAGICAL(av))
	mg_clear((SV*)av); 

    if (AvREAL(av)) {
	ary = AvARRAY(av);
	key = AvFILLp(av) + 1;
	while (key) {
	    SvREFCNT_dec(ary[--key]);
	    ary[key] = &sv_undef;
	}
    }
    if (key = AvARRAY(av) - AvALLOC(av)) {
	AvMAX(av) += key;
	SvPVX(av) = (char*)AvALLOC(av);
    }
    AvFILLp(av) = -1;

}

void
av_undef(register AV *av)
{
    register I32 key;

    if (!av)
	return;
    /*SUPPRESS 560*/

    /* Give any tie a chance to cleanup first */
    if (SvRMAGICAL(av) && mg_find((SV*)av,'P')) 
	av_fill(av, -1);   /* mg_clear() ? */

    if (AvREAL(av)) {
	key = AvFILLp(av) + 1;
	while (key)
	    SvREFCNT_dec(AvARRAY(av)[--key]);
    }
    Safefree(AvALLOC(av));
    AvALLOC(av) = 0;
    SvPVX(av) = 0;
    AvMAX(av) = AvFILLp(av) = -1;
    if (AvARYLEN(av)) {
	SvREFCNT_dec(AvARYLEN(av));
	AvARYLEN(av) = 0;
    }
}

void
av_push(register AV *av, SV *val)
{             
    MAGIC *mg;
    if (!av)
	return;
    if (SvREADONLY(av))
	croak(no_modify);

    if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
	dSP;
	PUSHMARK(sp);
	EXTEND(sp,2);
	PUSHs(mg->mg_obj);
	PUSHs(val);
        PUTBACK;
	perl_call_method("PUSH", G_SCALAR|G_DISCARD);
	return;
    }
    av_store(av,AvFILLp(av)+1,val);
}

SV *
av_pop(register AV *av)
{
    SV *retval;
    MAGIC* mg;

    if (!av || AvFILL(av) < 0)
	return &sv_undef;
    if (SvREADONLY(av))
	croak(no_modify);
    if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
	dSP;    
	PUSHMARK(sp);
	XPUSHs(mg->mg_obj);
        PUTBACK;
	if (perl_call_method("POP", G_SCALAR)) {
	    retval = newSVsv(*stack_sp--);    
	} else {    
	    retval = &sv_undef;
	}
	return retval;
    }
    retval = AvARRAY(av)[AvFILLp(av)];
    AvARRAY(av)[AvFILLp(av)--] = &sv_undef;
    if (SvSMAGICAL(av))
	mg_set((SV*)av);
    return retval;
}

void
av_unshift(register AV *av, register I32 num)
{
    register I32 i;
    register SV **sstr,**dstr;
    MAGIC* mg;

    if (!av || num <= 0)
	return;
    if (SvREADONLY(av))
	croak(no_modify);

    if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
	dSP;
	PUSHMARK(sp);
	EXTEND(sp,1+num);
	PUSHs(mg->mg_obj);
	while (num-- > 0) {
	    PUSHs(&sv_undef);
	}
	PUTBACK;
	perl_call_method("UNSHIFT", G_SCALAR|G_DISCARD);
	return;
    }

    if (!AvREAL(av) && AvREIFY(av))
	av_reify(av);
    i = AvARRAY(av) - AvALLOC(av);
    if (i) {
	if (i > num)
	    i = num;
	num -= i;
    
	AvMAX(av) += i;
	AvFILLp(av) += i;
	SvPVX(av) = (char*)(AvARRAY(av) - i);
    }
    if (num) {
	av_extend(av,AvFILLp(av)+num);
	AvFILLp(av) += num;
	dstr = AvARRAY(av) + AvFILLp(av);
	sstr = dstr - num;
#ifdef BUGGY_MSC5
 # pragma loop_opt(off)	/* don't loop-optimize the following code */
#endif /* BUGGY_MSC5 */
	for (i = AvFILLp(av) - num; i >= 0; --i) {
	    *dstr-- = *sstr--;
#ifdef BUGGY_MSC5
 # pragma loop_opt()	/* loop-optimization back to command-line setting */
#endif /* BUGGY_MSC5 */
	}
	while (num)
	    AvARRAY(av)[--num] = &sv_undef;
    }
}

SV *
av_shift(register AV *av)
{
    SV *retval;
    MAGIC* mg;

    if (!av || AvFILL(av) < 0)
	return &sv_undef;
    if (SvREADONLY(av))
	croak(no_modify);
    if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
	dSP;
	PUSHMARK(sp);
	XPUSHs(mg->mg_obj);
        PUTBACK;
	if (perl_call_method("SHIFT", G_SCALAR)) {
	    retval = newSVsv(*stack_sp--);            
	} else {    
	    retval = &sv_undef;
	}
	return retval;
    }
    retval = *AvARRAY(av);
    if (AvREAL(av))
	*AvARRAY(av) = &sv_undef;
    SvPVX(av) = (char*)(AvARRAY(av) + 1);
    AvMAX(av)--;
    AvFILLp(av)--;
    if (SvSMAGICAL(av))
	mg_set((SV*)av);
    return retval;
}

I32
av_len(register AV *av)
{
    return AvFILL(av);
}

void
av_fill(register AV *av, I32 fill)
{
    MAGIC *mg;
    if (!av)
	croak("panic: null array");
    if (fill < 0)
	fill = -1;
    if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
	dSP;            
	ENTER;
	SAVETMPS;
	PUSHMARK(sp);
	EXTEND(sp,2);
	PUSHs(mg->mg_obj);
	PUSHs(sv_2mortal(newSViv(fill)));
	PUTBACK;
	perl_call_method("STORESIZE", G_SCALAR|G_DISCARD);
	FREETMPS;
	LEAVE;
	return;
    }
    if (fill <= AvMAX(av)) {
	I32 key = AvFILLp(av);
	SV** ary = AvARRAY(av);

	if (AvREAL(av)) {
	    while (key > fill) {
		SvREFCNT_dec(ary[key]);
		ary[key--] = &sv_undef;
	    }
	}
	else {
	    while (key < fill)
		ary[++key] = &sv_undef;
	}
	    
	AvFILLp(av) = fill;
	if (SvSMAGICAL(av))
	    mg_set((SV*)av);
    }
    else
	(void)av_store(av,fill,&sv_undef);
}

  
HV*
avhv_keys(AV *av)
{
    SV **keysp;
    HV *keys = Nullhv;

    keysp = av_fetch(av, 0, FALSE);
    if (keysp) {
	SV *sv = *keysp;
	if (SvGMAGICAL(sv))
	    mg_get(sv);
	if (SvROK(sv)) {
	    sv = SvRV(sv);
	    if (SvTYPE(sv) == SVt_PVHV)
		keys = (HV*)sv;
	}
    }
    if (!keys)
	croak("Can't coerce array into hash");
    return keys;
}

SV**
avhv_fetch(AV *av, char *key, U32 klen, I32 lval)
{
    SV **indsvp;
    HV *keys = avhv_keys(av);
    I32 ind;
    
    indsvp = hv_fetch(keys, key, klen, FALSE);
    if (indsvp) {
	ind = SvIV(*indsvp);
	if (ind < 1)
	    croak("Bad index while coercing array into hash");
    } else {
	if (!lval)
	    return 0;
	
	ind = AvFILL(av) + 1;
	hv_store(keys, key, klen, newSViv(ind), 0);
    }
    return av_fetch(av, ind, lval);
}

SV**
avhv_fetch_ent(AV *av, SV *keysv, I32 lval, U32 hash)
{
    SV **indsvp;
    HV *keys = avhv_keys(av);
    HE *he;
    I32 ind;
    
    he = hv_fetch_ent(keys, keysv, FALSE, hash);
    if (he) {
	ind = SvIV(HeVAL(he));
	if (ind < 1)
	    croak("Bad index while coercing array into hash");
    } else {
	if (!lval)
	    return 0;
	
	ind = AvFILL(av) + 1;
	hv_store_ent(keys, keysv, newSViv(ind), 0);
    }
    return av_fetch(av, ind, lval);
}

SV**
avhv_store(AV *av, char *key, U32 klen, SV *val, U32 hash)
{
    SV **indsvp;
    HV *keys = avhv_keys(av);
    I32 ind;
    
    indsvp = hv_fetch(keys, key, klen, FALSE);
    if (indsvp) {
	ind = SvIV(*indsvp);
	if (ind < 1)
	    croak("Bad index while coercing array into hash");
    } else {
	ind = AvFILL(av) + 1;
	hv_store(keys, key, klen, newSViv(ind), hash);
    }
    return av_store(av, ind, val);
}

SV**
avhv_store_ent(AV *av, SV *keysv, SV *val, U32 hash)
{
    HV *keys = avhv_keys(av);
    HE *he;
    I32 ind;
    
    he = hv_fetch_ent(keys, keysv, FALSE, hash);
    if (he) {
	ind = SvIV(HeVAL(he));
	if (ind < 1)
	    croak("Bad index while coercing array into hash");
    } else {
	ind = AvFILL(av) + 1;
	hv_store_ent(keys, keysv, newSViv(ind), hash);
    }
    return av_store(av, ind, val);
}

bool
avhv_exists_ent(AV *av, SV *keysv, U32 hash)
{
    HV *keys = avhv_keys(av);
    return hv_exists_ent(keys, keysv, hash);
}

bool
avhv_exists(AV *av, char *key, U32 klen)
{
    HV *keys = avhv_keys(av);
    return hv_exists(keys, key, klen);
}

/* avhv_delete leaks. Caller can re-index and compress if so desired. */
SV *
avhv_delete(AV *av, char *key, U32 klen, I32 flags)
{
    HV *keys = avhv_keys(av);
    SV *sv;
    SV **svp;
    I32 ind;
    
    sv = hv_delete(keys, key, klen, 0);
    if (!sv)
	return Nullsv;
    ind = SvIV(sv);
    if (ind < 1)
	croak("Bad index while coercing array into hash");
    svp = av_fetch(av, ind, FALSE);
    if (!svp)
	return Nullsv;
    if (flags & G_DISCARD) {
	sv = Nullsv;
	SvREFCNT_dec(*svp);
    } else {
	sv = sv_2mortal(*svp);
    }
    *svp = &sv_undef;
    return sv;
}

/* avhv_delete_ent leaks. Caller can re-index and compress if so desired. */
SV *
avhv_delete_ent(AV *av, SV *keysv, I32 flags, U32 hash)
{
    HV *keys = avhv_keys(av);
    SV *sv;
    SV **svp;
    I32 ind;
    
    sv = hv_delete_ent(keys, keysv, 0, hash);
    if (!sv)
	return Nullsv;
    ind = SvIV(sv);
    if (ind < 1)
	croak("Bad index while coercing array into hash");
    svp = av_fetch(av, ind, FALSE);
    if (!svp)
	return Nullsv;
    if (flags & G_DISCARD) {
	sv = Nullsv;
	SvREFCNT_dec(*svp);
    } else {
	sv = sv_2mortal(*svp);
    }
    *svp = &sv_undef;
    return sv;
}

I32
avhv_iterinit(AV *av)
{
    HV *keys = avhv_keys(av);
    return hv_iterinit(keys);
}

HE *
avhv_iternext(AV *av)
{
    HV *keys = avhv_keys(av);
    return hv_iternext(keys);
}

SV *
avhv_iterval(AV *av, register HE *entry)
{
    HV *keys = avhv_keys(av);
    SV *sv;
    I32 ind;
    
    sv = hv_iterval(keys, entry);
    ind = SvIV(sv);
    if (ind < 1)
	croak("Bad index while coercing array into hash");
    return *av_fetch(av, ind, TRUE);
}

SV *
avhv_iternextsv(AV *av, char **key, I32 *retlen)
{
    HV *keys = avhv_keys(av);
    HE *he;
    SV *sv;
    I32 ind;
    
    he = hv_iternext(keys);
    if (!he)
        return Nullsv;
    *key = hv_iterkey(he, retlen);
    sv = hv_iterval(keys, he);
    ind = SvIV(sv);
    if (ind < 1)
	croak("Bad index while coercing array into hash");
    return *av_fetch(av, ind, TRUE);
}
Commit	Line	Data
a0d0e21e	1	/* av.c
79072805	2	*
9607fc9c	3	* Copyright (c) 1991-1997, Larry Wall
79072805	4	*
	5	* You may distribute under the terms of either the GNU General Public
	6	* License or the Artistic License, as specified in the README file.
	7	*
a0d0e21e	8	*/
	9
	10	/*
	11	* "...for the Entwives desired order, and plenty, and peace (by which they
	12	* meant that things should remain where they had set them)." --Treebeard
79072805	13	*/
	14
	15	#include "EXTERN.h"
	16	#include "perl.h"
	17
fb73857a	18	void
8ac85365	19	av_reify(AV *av)
a0d0e21e	20	{
	21	I32 key;
	22	SV* sv;
fb73857a	23
93965878	24	if (AvREAL(av))
	25	return;
	26	#ifdef DEBUGGING
	27	if (SvRMAGICAL(av) && mg_find((SV*)av,'P'))
	28	warn("av_reify called on tied array");
	29	#endif
a0d0e21e	30	key = AvMAX(av) + 1;
93965878	31	while (key > AvFILLp(av) + 1)
a0d0e21e	32	AvARRAY(av)[--key] = &sv_undef;
	33	while (key) {
	34	sv = AvARRAY(av)[--key];
	35	assert(sv);
11343788	36	if (sv != &sv_undef) {
11343788	37	dTHR;
a0d0e21e	38	(void)SvREFCNT_inc(sv);
11343788	39	}
a0d0e21e	40	}
29de640a	41	key = AvARRAY(av) - AvALLOC(av);
	42	while (key)
	43	AvALLOC(av)[--key] = &sv_undef;
a0d0e21e	44	AvREAL_on(av);
	45	}
	46
	47	void
8ac85365	48	av_extend(AV *av, I32 key)
a0d0e21e	49	{
11343788	50	dTHR; /* only necessary if we have to extend stack */
93965878	51	MAGIC *mg;
	52	if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
	53	dSP;
	54	ENTER;
	55	SAVETMPS;
	56	PUSHMARK(sp);
	57	EXTEND(sp,2);
	58	PUSHs(mg->mg_obj);
	59	PUSHs(sv_2mortal(newSViv(key)));
	60	PUTBACK;
	61	perl_call_method("EXTEND", G_SCALAR\|G_DISCARD);
	62	FREETMPS;
	63	LEAVE;
	64	return;
	65	}
a0d0e21e	66	if (key > AvMAX(av)) {
	67	SV** ary;
	68	I32 tmp;
	69	I32 newmax;
	70
	71	if (AvALLOC(av) != AvARRAY(av)) {
93965878	72	ary = AvALLOC(av) + AvFILLp(av) + 1;
a0d0e21e	73	tmp = AvARRAY(av) - AvALLOC(av);
93965878	74	Move(AvARRAY(av), AvALLOC(av), AvFILLp(av)+1, SV*);
a0d0e21e	75	AvMAX(av) += tmp;
	76	SvPVX(av) = (char*)AvALLOC(av);
	77	if (AvREAL(av)) {
	78	while (tmp)
	79	ary[--tmp] = &sv_undef;
	80	}
	81
	82	if (key > AvMAX(av) - 10) {
	83	newmax = key + AvMAX(av);
	84	goto resize;
	85	}
	86	}
	87	else {
	88	if (AvALLOC(av)) {
c07a80fd	89	#ifndef STRANGE_MALLOC
4633a7c4	90	U32 bytes;
c07a80fd	91	#endif
4633a7c4	92
a0d0e21e	93	newmax = key + AvMAX(av) / 5;
a0d0e21e	94	resize:
4633a7c4	95	#ifdef STRANGE_MALLOC
a0d0e21e	96	Renew(AvALLOC(av),newmax+1, SV*);
4633a7c4	97	#else
	98	bytes = (newmax + 1) * sizeof(SV*);
	99	#define MALLOC_OVERHEAD 16
	100	tmp = MALLOC_OVERHEAD;
	101	while (tmp - MALLOC_OVERHEAD < bytes)
	102	tmp += tmp;
	103	tmp -= MALLOC_OVERHEAD;
	104	tmp /= sizeof(SV*);
	105	assert(tmp > newmax);
	106	newmax = tmp - 1;
	107	New(2,ary, newmax+1, SV*);
	108	Copy(AvALLOC(av), ary, AvMAX(av)+1, SV*);
fba3b22e	109	if (AvMAX(av) > 64)
fba3b22e	110	offer_nice_chunk(AvALLOC(av), (AvMAX(av)+1) * sizeof(SV*));
4633a7c4	111	else
	112	Safefree(AvALLOC(av));
	113	AvALLOC(av) = ary;
	114	#endif
a0d0e21e	115	ary = AvALLOC(av) + AvMAX(av) + 1;
a0d0e21e	116	tmp = newmax - AvMAX(av);
7d55f622	117	if (av == curstack) { /* Oops, grew stack (via av_store()?) */
a0d0e21e	118	stack_sp = AvALLOC(av) + (stack_sp - stack_base);
	119	stack_base = AvALLOC(av);
	120	stack_max = stack_base + newmax;
	121	}
	122	}
	123	else {
	124	newmax = key < 4 ? 4 : key;
	125	New(2,AvALLOC(av), newmax+1, SV*);
	126	ary = AvALLOC(av) + 1;
	127	tmp = newmax;
	128	AvALLOC(av)[0] = &sv_undef; /* For the stacks */
	129	}
	130	if (AvREAL(av)) {
	131	while (tmp)
	132	ary[--tmp] = &sv_undef;
	133	}
	134
	135	SvPVX(av) = (char*)AvALLOC(av);
	136	AvMAX(av) = newmax;
	137	}
	138	}
	139	}
	140
79072805	141	SV**
8ac85365	142	av_fetch(register AV *av, I32 key, I32 lval)
79072805	143	{
	144	SV *sv;
	145
a0d0e21e	146	if (!av)
	147	return 0;
	148
93965878	149	if (key < 0) {
	150	key += AvFILL(av) + 1;
	151	if (key < 0)
	152	return 0;
	153	}
	154
8990e307	155	if (SvRMAGICAL(av)) {
463ee0b2	156	if (mg_find((SV*)av,'P')) {
11343788	157	dTHR;
8990e307	158	sv = sv_newmortal();
463ee0b2	159	mg_copy((SV*)av, sv, 0, key);
463ee0b2	160	Sv = sv;
	161	return &Sv;
	162	}
	163	}
	164
93965878	165	if (key > AvFILLp(av)) {
a0d0e21e	166	if (!lval)
	167	return 0;
	168	if (AvREALISH(av))
	169	sv = NEWSV(5,0);
	170	else
	171	sv = sv_newmortal();
	172	return av_store(av,key,sv);
79072805	173	}
a0d0e21e	174	if (AvARRAY(av)[key] == &sv_undef) {
4dbf4341	175	emptyness:
79072805	176	if (lval) {
79072805	177	sv = NEWSV(6,0);
463ee0b2	178	return av_store(av,key,sv);
79072805	179	}
	180	return 0;
	181	}
4dbf4341	182	else if (AvREIFY(av)
	183	&& (!AvARRAY(av)[key] /* eg. @_ could have freed elts */
	184	\|\| SvTYPE(AvARRAY(av)[key]) == SVTYPEMASK)) {
	185	AvARRAY(av)[key] = &sv_undef; /* 1/2 reify */
	186	goto emptyness;
	187	}
463ee0b2	188	return &AvARRAY(av)[key];
79072805	189	}
	190
	191	SV**
8ac85365	192	av_store(register AV av, I32 key, SV val)
79072805	193	{
79072805	194	SV** ary;
93965878	195	U32 fill;
93965878	196
79072805	197
a0d0e21e	198	if (!av)
a0d0e21e	199	return 0;
43fcc5d2	200	if (!val)
43fcc5d2	201	val = &sv_undef;
463ee0b2	202
a0d0e21e	203	if (key < 0) {
	204	key += AvFILL(av) + 1;
	205	if (key < 0)
	206	return 0;
79072805	207	}
93965878	208
43fcc5d2	209	if (SvREADONLY(av) && key >= AvFILL(av))
43fcc5d2	210	croak(no_modify);
93965878	211
	212	if (SvRMAGICAL(av)) {
	213	if (mg_find((SV*)av,'P')) {
	214	if (val != &sv_undef) {
	215	mg_copy((SV*)av, val, 0, key);
	216	}
	217	return 0;
	218	}
	219	}
	220
49beac48	221	if (!AvREAL(av) && AvREIFY(av))
a0d0e21e	222	av_reify(av);
a0d0e21e	223	if (key > AvMAX(av))
a0d0e21e	224	av_extend(av,key);
463ee0b2	225	ary = AvARRAY(av);
93965878	226	if (AvFILLp(av) < key) {
a0d0e21e	227	if (!AvREAL(av)) {
11343788	228	dTHR;
7d55f622	229	if (av == curstack && key > stack_sp - stack_base)
a0d0e21e	230	stack_sp = stack_base + key; /* XPUSH in disguise */
a0d0e21e	231	do
93965878	232	ary[++AvFILLp(av)] = &sv_undef;
93965878	233	while (AvFILLp(av) < key);
79072805	234	}
93965878	235	AvFILLp(av) = key;
79072805	236	}
a0d0e21e	237	else if (AvREAL(av))
a0d0e21e	238	SvREFCNT_dec(ary[key]);
79072805	239	ary[key] = val;
8990e307	240	if (SvSMAGICAL(av)) {
a0d0e21e	241	if (val != &sv_undef) {
	242	MAGIC* mg = SvMAGIC(av);
	243	sv_magic(val, (SV*)av, toLOWER(mg->mg_type), 0, key);
	244	}
463ee0b2	245	mg_set((SV*)av);
463ee0b2	246	}
79072805	247	return &ary[key];
	248	}
	249
	250	AV *
8ac85365	251	newAV(void)
79072805	252	{
463ee0b2	253	register AV *av;
79072805	254
a0d0e21e	255	av = (AV*)NEWSV(3,0);
a0d0e21e	256	sv_upgrade((SV *)av, SVt_PVAV);
463ee0b2	257	AvREAL_on(av);
	258	AvALLOC(av) = 0;
	259	SvPVX(av) = 0;
93965878	260	AvMAX(av) = AvFILLp(av) = -1;
463ee0b2	261	return av;
79072805	262	}
	263
	264	AV *
8ac85365	265	av_make(register I32 size, register SV **strp)
79072805	266	{
463ee0b2	267	register AV *av;
79072805	268	register I32 i;
	269	register SV** ary;
	270
a0d0e21e	271	av = (AV*)NEWSV(8,0);
a0d0e21e	272	sv_upgrade((SV *) av,SVt_PVAV);
a0d0e21e	273	AvFLAGS(av) = AVf_REAL;
573fa4ea	274	if (size) { /* `defined' was returning undef for size==0 anyway. */
	275	New(4,ary,size,SV*);
	276	AvALLOC(av) = ary;
	277	SvPVX(av) = (char*)ary;
93965878	278	AvFILLp(av) = size - 1;
573fa4ea	279	AvMAX(av) = size - 1;
	280	for (i = 0; i < size; i++) {
	281	assert (*strp);
	282	ary[i] = NEWSV(7,0);
	283	sv_setsv(ary[i], *strp);
	284	strp++;
	285	}
79072805	286	}
463ee0b2	287	return av;
79072805	288	}
	289
	290	AV *
8ac85365	291	av_fake(register I32 size, register SV **strp)
79072805	292	{
463ee0b2	293	register AV *av;
79072805	294	register SV** ary;
79072805	295
a0d0e21e	296	av = (AV*)NEWSV(9,0);
a0d0e21e	297	sv_upgrade((SV *)av, SVt_PVAV);
79072805	298	New(4,ary,size+1,SV*);
463ee0b2	299	AvALLOC(av) = ary;
79072805	300	Copy(strp,ary,size,SV*);
a0d0e21e	301	AvFLAGS(av) = AVf_REIFY;
463ee0b2	302	SvPVX(av) = (char*)ary;
93965878	303	AvFILLp(av) = size - 1;
463ee0b2	304	AvMAX(av) = size - 1;
79072805	305	while (size--) {
a0d0e21e	306	assert (*strp);
a0d0e21e	307	SvTEMP_off(*strp);
79072805	308	strp++;
79072805	309	}
463ee0b2	310	return av;
79072805	311	}
	312
	313	void
8ac85365	314	av_clear(register AV *av)
79072805	315	{
79072805	316	register I32 key;
a0d0e21e	317	SV** ary;
79072805	318
7d55f622	319	#ifdef DEBUGGING
	320	if (SvREFCNT(av) <= 0) {
	321	warn("Attempt to clear deleted array");
	322	}
	323	#endif
a0d0e21e	324	if (!av \|\| AvMAX(av) < 0)
79072805	325	return;
79072805	326	/SUPPRESS 560/
a0d0e21e	327
93965878	328	/* Give any tie a chance to cleanup first */
	329	if (SvRMAGICAL(av))
	330	mg_clear((SV*)av);
	331
a0d0e21e	332	if (AvREAL(av)) {
a0d0e21e	333	ary = AvARRAY(av);
93965878	334	key = AvFILLp(av) + 1;
a0d0e21e	335	while (key) {
	336	SvREFCNT_dec(ary[--key]);
	337	ary[key] = &sv_undef;
	338	}
	339	}
463ee0b2	340	if (key = AvARRAY(av) - AvALLOC(av)) {
463ee0b2	341	AvMAX(av) += key;
a0d0e21e	342	SvPVX(av) = (char*)AvALLOC(av);
79072805	343	}
93965878	344	AvFILLp(av) = -1;
fb73857a	345
79072805	346	}
	347
	348	void
8ac85365	349	av_undef(register AV *av)
79072805	350	{
	351	register I32 key;
	352
463ee0b2	353	if (!av)
79072805	354	return;
79072805	355	/SUPPRESS 560/
93965878	356
	357	/* Give any tie a chance to cleanup first */
	358	if (SvRMAGICAL(av) && mg_find((SV*)av,'P'))
	359	av_fill(av, -1); /* mg_clear() ? */
	360
a0d0e21e	361	if (AvREAL(av)) {
93965878	362	key = AvFILLp(av) + 1;
a0d0e21e	363	while (key)
	364	SvREFCNT_dec(AvARRAY(av)[--key]);
	365	}
463ee0b2	366	Safefree(AvALLOC(av));
	367	AvALLOC(av) = 0;
	368	SvPVX(av) = 0;
93965878	369	AvMAX(av) = AvFILLp(av) = -1;
748a9306	370	if (AvARYLEN(av)) {
	371	SvREFCNT_dec(AvARYLEN(av));
	372	AvARYLEN(av) = 0;
	373	}
79072805	374	}
79072805	375
a0d0e21e	376	void
8ac85365	377	av_push(register AV av, SV val)
93965878	378	{
93965878	379	MAGIC *mg;
a0d0e21e	380	if (!av)
a0d0e21e	381	return;
93965878	382	if (SvREADONLY(av))
	383	croak(no_modify);
	384
	385	if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
	386	dSP;
	387	PUSHMARK(sp);
	388	EXTEND(sp,2);
	389	PUSHs(mg->mg_obj);
	390	PUSHs(val);
	391	PUTBACK;
	392	perl_call_method("PUSH", G_SCALAR\|G_DISCARD);
	393	return;
	394	}
	395	av_store(av,AvFILLp(av)+1,val);
79072805	396	}
	397
	398	SV *
8ac85365	399	av_pop(register AV *av)
79072805	400	{
79072805	401	SV *retval;
93965878	402	MAGIC* mg;
79072805	403
a0d0e21e	404	if (!av \|\| AvFILL(av) < 0)
a0d0e21e	405	return &sv_undef;
43fcc5d2	406	if (SvREADONLY(av))
43fcc5d2	407	croak(no_modify);
93965878	408	if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
	409	dSP;
	410	PUSHMARK(sp);
	411	XPUSHs(mg->mg_obj);
	412	PUTBACK;
	413	if (perl_call_method("POP", G_SCALAR)) {
	414	retval = newSVsv(*stack_sp--);
	415	} else {
	416	retval = &sv_undef;
	417	}
	418	return retval;
	419	}
	420	retval = AvARRAY(av)[AvFILLp(av)];
	421	AvARRAY(av)[AvFILLp(av)--] = &sv_undef;
8990e307	422	if (SvSMAGICAL(av))
463ee0b2	423	mg_set((SV*)av);
79072805	424	return retval;
	425	}
	426
	427	void
8ac85365	428	av_unshift(register AV *av, register I32 num)
79072805	429	{
	430	register I32 i;
	431	register SV sstr,dstr;
93965878	432	MAGIC* mg;
79072805	433
a0d0e21e	434	if (!av \|\| num <= 0)
79072805	435	return;
43fcc5d2	436	if (SvREADONLY(av))
43fcc5d2	437	croak(no_modify);
93965878	438
	439	if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
	440	dSP;
	441	PUSHMARK(sp);
	442	EXTEND(sp,1+num);
	443	PUSHs(mg->mg_obj);
	444	while (num-- > 0) {
	445	PUSHs(&sv_undef);
	446	}
	447	PUTBACK;
	448	perl_call_method("UNSHIFT", G_SCALAR\|G_DISCARD);
	449	return;
	450	}
	451
49beac48	452	if (!AvREAL(av) && AvREIFY(av))
49beac48	453	av_reify(av);
a0d0e21e	454	i = AvARRAY(av) - AvALLOC(av);
	455	if (i) {
	456	if (i > num)
	457	i = num;
	458	num -= i;
	459
	460	AvMAX(av) += i;
93965878	461	AvFILLp(av) += i;
a0d0e21e	462	SvPVX(av) = (char*)(AvARRAY(av) - i);
	463	}
	464	if (num) {
93965878	465	av_extend(av,AvFILLp(av)+num);
	466	AvFILLp(av) += num;
	467	dstr = AvARRAY(av) + AvFILLp(av);
79072805	468	sstr = dstr - num;
	469	#ifdef BUGGY_MSC5
	470	# pragma loop_opt(off) /* don't loop-optimize the following code */
	471	#endif /* BUGGY_MSC5 */
93965878	472	for (i = AvFILLp(av) - num; i >= 0; --i) {
79072805	473	dstr-- = sstr--;
	474	#ifdef BUGGY_MSC5
	475	# pragma loop_opt() /* loop-optimization back to command-line setting */
	476	#endif /* BUGGY_MSC5 */
	477	}
a0d0e21e	478	while (num)
a0d0e21e	479	AvARRAY(av)[--num] = &sv_undef;
79072805	480	}
	481	}
	482
	483	SV *
8ac85365	484	av_shift(register AV *av)
79072805	485	{
79072805	486	SV *retval;
93965878	487	MAGIC* mg;
79072805	488
a0d0e21e	489	if (!av \|\| AvFILL(av) < 0)
a0d0e21e	490	return &sv_undef;
43fcc5d2	491	if (SvREADONLY(av))
43fcc5d2	492	croak(no_modify);
93965878	493	if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
	494	dSP;
	495	PUSHMARK(sp);
	496	XPUSHs(mg->mg_obj);
	497	PUTBACK;
	498	if (perl_call_method("SHIFT", G_SCALAR)) {
	499	retval = newSVsv(*stack_sp--);
	500	} else {
	501	retval = &sv_undef;
	502	}
	503	return retval;
	504	}
463ee0b2	505	retval = *AvARRAY(av);
a0d0e21e	506	if (AvREAL(av))
a0d0e21e	507	*AvARRAY(av) = &sv_undef;
463ee0b2	508	SvPVX(av) = (char*)(AvARRAY(av) + 1);
463ee0b2	509	AvMAX(av)--;
93965878	510	AvFILLp(av)--;
8990e307	511	if (SvSMAGICAL(av))
463ee0b2	512	mg_set((SV*)av);
79072805	513	return retval;
	514	}
	515
	516	I32
8ac85365	517	av_len(register AV *av)
79072805	518	{
463ee0b2	519	return AvFILL(av);
79072805	520	}
	521
	522	void
8ac85365	523	av_fill(register AV *av, I32 fill)
79072805	524	{
93965878	525	MAGIC *mg;
a0d0e21e	526	if (!av)
a0d0e21e	527	croak("panic: null array");
79072805	528	if (fill < 0)
79072805	529	fill = -1;
93965878	530	if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
	531	dSP;
	532	ENTER;
	533	SAVETMPS;
	534	PUSHMARK(sp);
	535	EXTEND(sp,2);
	536	PUSHs(mg->mg_obj);
	537	PUSHs(sv_2mortal(newSViv(fill)));
	538	PUTBACK;
	539	perl_call_method("STORESIZE", G_SCALAR\|G_DISCARD);
	540	FREETMPS;
	541	LEAVE;
	542	return;
	543	}
463ee0b2	544	if (fill <= AvMAX(av)) {
93965878	545	I32 key = AvFILLp(av);
a0d0e21e	546	SV** ary = AvARRAY(av);
	547
	548	if (AvREAL(av)) {
	549	while (key > fill) {
	550	SvREFCNT_dec(ary[key]);
	551	ary[key--] = &sv_undef;
	552	}
	553	}
	554	else {
	555	while (key < fill)
	556	ary[++key] = &sv_undef;
	557	}
	558
93965878	559	AvFILLp(av) = fill;
8990e307	560	if (SvSMAGICAL(av))
463ee0b2	561	mg_set((SV*)av);
463ee0b2	562	}
a0d0e21e	563	else
a0d0e21e	564	(void)av_store(av,fill,&sv_undef);
79072805	565	}
c750a3ec	566
5d5aaa5e	567
	568	HV*
	569	avhv_keys(AV *av)
	570	{
	571	SV **keysp;
	572	HV *keys = Nullhv;
	573
	574	keysp = av_fetch(av, 0, FALSE);
	575	if (keysp) {
d627ae4e	576	SV sv = keysp;
	577	if (SvGMAGICAL(sv))
	578	mg_get(sv);
	579	if (SvROK(sv)) {
	580	sv = SvRV(sv);
	581	if (SvTYPE(sv) == SVt_PVHV)
	582	keys = (HV*)sv;
5d5aaa5e	583	}
	584	}
	585	if (!keys)
	586	croak("Can't coerce array into hash");
	587	return keys;
	588	}
	589
c750a3ec	590	SV**
8ac85365	591	avhv_fetch(AV av, char key, U32 klen, I32 lval)
c750a3ec	592	{
5d5aaa5e	593	SV **indsvp;
5d5aaa5e	594	HV *keys = avhv_keys(av);
c750a3ec	595	I32 ind;
c750a3ec	596
5d5aaa5e	597	indsvp = hv_fetch(keys, key, klen, FALSE);
c750a3ec	598	if (indsvp) {
	599	ind = SvIV(*indsvp);
	600	if (ind < 1)
	601	croak("Bad index while coercing array into hash");
	602	} else {
	603	if (!lval)
	604	return 0;
	605
	606	ind = AvFILL(av) + 1;
5d5aaa5e	607	hv_store(keys, key, klen, newSViv(ind), 0);
c750a3ec	608	}
	609	return av_fetch(av, ind, lval);
	610	}
	611
	612	SV**
8ac85365	613	avhv_fetch_ent(AV av, SV keysv, I32 lval, U32 hash)
97fcbf96	614	{
5d5aaa5e	615	SV **indsvp;
5d5aaa5e	616	HV *keys = avhv_keys(av);
97fcbf96	617	HE *he;
	618	I32 ind;
	619
5d5aaa5e	620	he = hv_fetch_ent(keys, keysv, FALSE, hash);
97fcbf96	621	if (he) {
	622	ind = SvIV(HeVAL(he));
	623	if (ind < 1)
	624	croak("Bad index while coercing array into hash");
	625	} else {
	626	if (!lval)
	627	return 0;
	628
	629	ind = AvFILL(av) + 1;
5d5aaa5e	630	hv_store_ent(keys, keysv, newSViv(ind), 0);
97fcbf96	631	}
	632	return av_fetch(av, ind, lval);
	633	}
	634
	635	SV**
8ac85365	636	avhv_store(AV av, char key, U32 klen, SV *val, U32 hash)
c750a3ec	637	{
5d5aaa5e	638	SV **indsvp;
5d5aaa5e	639	HV *keys = avhv_keys(av);
c750a3ec	640	I32 ind;
c750a3ec	641
5d5aaa5e	642	indsvp = hv_fetch(keys, key, klen, FALSE);
c750a3ec	643	if (indsvp) {
	644	ind = SvIV(*indsvp);
	645	if (ind < 1)
	646	croak("Bad index while coercing array into hash");
	647	} else {
	648	ind = AvFILL(av) + 1;
5d5aaa5e	649	hv_store(keys, key, klen, newSViv(ind), hash);
c750a3ec	650	}
	651	return av_store(av, ind, val);
	652	}
	653
5bc6513d	654	SV**
8ac85365	655	avhv_store_ent(AV av, SV keysv, SV *val, U32 hash)
5bc6513d	656	{
5d5aaa5e	657	HV *keys = avhv_keys(av);
5bc6513d	658	HE *he;
	659	I32 ind;
	660
5d5aaa5e	661	he = hv_fetch_ent(keys, keysv, FALSE, hash);
5bc6513d	662	if (he) {
	663	ind = SvIV(HeVAL(he));
	664	if (ind < 1)
	665	croak("Bad index while coercing array into hash");
	666	} else {
	667	ind = AvFILL(av) + 1;
5d5aaa5e	668	hv_store_ent(keys, keysv, newSViv(ind), hash);
5bc6513d	669	}
	670	return av_store(av, ind, val);
	671	}
	672
c750a3ec	673	bool
8ac85365	674	avhv_exists_ent(AV av, SV keysv, U32 hash)
97fcbf96	675	{
5d5aaa5e	676	HV *keys = avhv_keys(av);
5d5aaa5e	677	return hv_exists_ent(keys, keysv, hash);
97fcbf96	678	}
	679
	680	bool
8ac85365	681	avhv_exists(AV av, char key, U32 klen)
c750a3ec	682	{
5d5aaa5e	683	HV *keys = avhv_keys(av);
5d5aaa5e	684	return hv_exists(keys, key, klen);
c750a3ec	685	}
	686
	687	/* avhv_delete leaks. Caller can re-index and compress if so desired. */
	688	SV *
8ac85365	689	avhv_delete(AV av, char key, U32 klen, I32 flags)
c750a3ec	690	{
5d5aaa5e	691	HV *keys = avhv_keys(av);
c750a3ec	692	SV *sv;
	693	SV **svp;
	694	I32 ind;
	695
5d5aaa5e	696	sv = hv_delete(keys, key, klen, 0);
c750a3ec	697	if (!sv)
	698	return Nullsv;
	699	ind = SvIV(sv);
	700	if (ind < 1)
	701	croak("Bad index while coercing array into hash");
	702	svp = av_fetch(av, ind, FALSE);
	703	if (!svp)
	704	return Nullsv;
	705	if (flags & G_DISCARD) {
	706	sv = Nullsv;
	707	SvREFCNT_dec(*svp);
	708	} else {
	709	sv = sv_2mortal(*svp);
	710	}
	711	*svp = &sv_undef;
	712	return sv;
	713	}
	714
97fcbf96	715	/* avhv_delete_ent leaks. Caller can re-index and compress if so desired. */
97fcbf96	716	SV *
8ac85365	717	avhv_delete_ent(AV av, SV keysv, I32 flags, U32 hash)
97fcbf96	718	{
5d5aaa5e	719	HV *keys = avhv_keys(av);
97fcbf96	720	SV *sv;
	721	SV **svp;
	722	I32 ind;
	723
5d5aaa5e	724	sv = hv_delete_ent(keys, keysv, 0, hash);
97fcbf96	725	if (!sv)
	726	return Nullsv;
	727	ind = SvIV(sv);
	728	if (ind < 1)
	729	croak("Bad index while coercing array into hash");
	730	svp = av_fetch(av, ind, FALSE);
	731	if (!svp)
	732	return Nullsv;
	733	if (flags & G_DISCARD) {
	734	sv = Nullsv;
	735	SvREFCNT_dec(*svp);
	736	} else {
	737	sv = sv_2mortal(*svp);
	738	}
	739	*svp = &sv_undef;
	740	return sv;
	741	}
	742
c750a3ec	743	I32
8ac85365	744	avhv_iterinit(AV *av)
c750a3ec	745	{
5d5aaa5e	746	HV *keys = avhv_keys(av);
5d5aaa5e	747	return hv_iterinit(keys);
c750a3ec	748	}
	749
	750	HE *
8ac85365	751	avhv_iternext(AV *av)
c750a3ec	752	{
5d5aaa5e	753	HV *keys = avhv_keys(av);
5d5aaa5e	754	return hv_iternext(keys);
c750a3ec	755	}
	756
	757	SV *
8ac85365	758	avhv_iterval(AV av, register HE entry)
c750a3ec	759	{
5d5aaa5e	760	HV *keys = avhv_keys(av);
c750a3ec	761	SV *sv;
	762	I32 ind;
	763
5d5aaa5e	764	sv = hv_iterval(keys, entry);
c750a3ec	765	ind = SvIV(sv);
	766	if (ind < 1)
	767	croak("Bad index while coercing array into hash");
	768	return *av_fetch(av, ind, TRUE);
	769	}
	770
	771	SV *
8ac85365	772	avhv_iternextsv(AV av, char key, I32 retlen)
c750a3ec	773	{
5d5aaa5e	774	HV *keys = avhv_keys(av);
c750a3ec	775	HE *he;
	776	SV *sv;
	777	I32 ind;
	778
5d5aaa5e	779	he = hv_iternext(keys);
	780	if (!he)
	781	return Nullsv;
c750a3ec	782	*key = hv_iterkey(he, retlen);
5d5aaa5e	783	sv = hv_iterval(keys, he);
c750a3ec	784	ind = SvIV(sv);
	785	if (ind < 1)
	786	croak("Bad index while coercing array into hash");
	787	return *av_fetch(av, ind, TRUE);
	788	}