X-Git-Url: https://perl5.git.perl.org/perl5.git/blobdiff_plain/ed6116ce9b9d13712ea252ee248b0400653db7f9..e77eedc24c0252a902559034f2aa207f216529cc:/av.c

diff --git a/av.c b/av.c
index dd54bd5..5a86460 100644
--- a/av.c
+++ b/av.c
@@ -1,162 +1,234 @@
-/* $RCSfile: array.c,v $$Revision: 4.1 $$Date: 92/08/07 17:18:22 $
+/*    av.c
  *
- *    Copyright (c) 1991, Larry Wall
+ *    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.
  *
- * $Log:	array.c,v $
- * Revision 4.1  92/08/07  17:18:22  lwall
- * Stage 6 Snapshot
- * 
- * Revision 4.0.1.3  92/06/08  11:45:05  lwall
- * patch20: Perl now distinguishes overlapped copies from non-overlapped
- * 
- * Revision 4.0.1.2  91/11/05  16:00:14  lwall
- * patch11: random cleanup
- * patch11: passing non-existend array elements to subrouting caused core dump
- * 
- * Revision 4.0.1.1  91/06/07  10:19:08  lwall
- * patch4: new copyright notice
- * 
- * Revision 4.0  91/03/20  01:03:32  lwall
- * 4.0 baseline.
- * 
+ */
+
+/*
+ * "...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;
+    key = AvMAX(av) + 1;
+    while (key > AvFILL(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 */
+    if (key > AvMAX(av)) {
+	SV** ary;
+	I32 tmp;
+	I32 newmax;
+
+	if (AvALLOC(av) != AvARRAY(av)) {
+	    ary = AvALLOC(av) + AvFILL(av) + 1;
+	    tmp = AvARRAY(av) - AvALLOC(av);
+	    Move(AvARRAY(av), AvALLOC(av), AvFILL(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(av,key,lval)
-register AV *av;
-I32 key;
-I32 lval;
+av_fetch(register AV *av, I32 key, I32 lval)
 {
     SV *sv;
 
-    if (SvMAGICAL(av)) {
+    if (!av)
+	return 0;
+
+    if (SvRMAGICAL(av)) {
 	if (mg_find((SV*)av,'P')) {
-	    if (key < 0)
-		return 0;
-	    sv = sv_2mortal(NEWSV(61,0));
+	    dTHR;
+	    sv = sv_newmortal();
 	    mg_copy((SV*)av, sv, 0, key);
-	    if (!lval) {
-		mg_get((SV*)sv);
-		sv_unmagic(sv,'p');
-	    }
 	    Sv = sv;
 	    return &Sv;
 	}
     }
 
-    if (key < 0 || key > AvFILL(av)) {
-	if (key < 0) {
-	    key += AvFILL(av) + 1;
-	    if (key < 0)
-		return 0;
-	}
-	else {
-	    if (!lval)
-		return 0;
-	    if (AvREAL(av))
-		sv = NEWSV(5,0);
-	    else
-		sv = sv_mortalcopy(&sv_undef);
-	    return av_store(av,key,sv);
-	}
+    if (key < 0) {
+	key += AvFILL(av) + 1;
+	if (key < 0)
+	    return 0;
     }
-    if (!AvARRAY(av)[key]) {
+    else if (key > AvFILL(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(av,key,val)
-register AV *av;
-I32 key;
-SV *val;
+av_store(register AV *av, I32 key, SV *val)
 {
-    I32 tmp;
     SV** ary;
 
-    if (key < 0) {
-	key += AvFILL(av) + 1;
-	if (key < 0)
-	    return 0;
-    }
+    if (!av)
+	return 0;
+    if (!val)
+	val = &sv_undef;
 
-    if (SvMAGICAL(av)) {
+    if (SvRMAGICAL(av)) {
 	if (mg_find((SV*)av,'P')) {
-	    mg_copy((SV*)av, val, 0, key);
+	    if (val != &sv_undef)
+		mg_copy((SV*)av, val, 0, key);
 	    return 0;
 	}
     }
 
-    if (key > AvMAX(av)) {
-	I32 newmax;
-
-	if (AvALLOC(av) != AvARRAY(av)) {
-	    tmp = AvARRAY(av) - AvALLOC(av);
-	    Move(AvARRAY(av), AvALLOC(av), AvMAX(av)+1, SV*);
-	    Zero(AvALLOC(av)+AvMAX(av)+1, tmp, SV*);
-	    AvMAX(av) += tmp;
-	    SvPVX(av) = (char*)(AvARRAY(av) - tmp);
-	    if (key > AvMAX(av) - 10) {
-		newmax = key + AvMAX(av);
-		goto resize;
-	    }
-	}
-	else {
-	    if (AvALLOC(av)) {
-		newmax = key + AvMAX(av) / 5;
-	      resize:
-		Renew(AvALLOC(av),newmax+1, SV*);
-		Zero(&AvALLOC(av)[AvMAX(av)+1], newmax - AvMAX(av), SV*);
-	    }
-	    else {
-		newmax = key < 4 ? 4 : key;
-		Newz(2,AvALLOC(av), newmax+1, SV*);
-	    }
-	    SvPVX(av) = (char*)AvALLOC(av);
-	    AvMAX(av) = newmax;
-	}
+    if (key < 0) {
+	key += AvFILL(av) + 1;
+	if (key < 0)
+	    return 0;
     }
+    if (SvREADONLY(av) && key >= AvFILL(av))
+	croak(no_modify);
+    if (!AvREAL(av) && AvREIFY(av))
+	av_reify(av);
+    if (key > AvMAX(av))
+	av_extend(av,key);
     ary = AvARRAY(av);
-    if (AvREAL(av)) {
-	if (AvFILL(av) < key) {
-	    while (++AvFILL(av) < key) {
-		if (ary[AvFILL(av)] != Nullsv) {
-		    sv_free(ary[AvFILL(av)]);
-		    ary[AvFILL(av)] = Nullsv;
-		}
-	    }
+    if (AvFILL(av) < key) {
+	if (!AvREAL(av)) {
+	    dTHR;
+	    if (av == curstack && key > stack_sp - stack_base)
+		stack_sp = stack_base + key;	/* XPUSH in disguise */
+	    do
+		ary[++AvFILL(av)] = &sv_undef;
+	    while (AvFILL(av) < key);
 	}
-	if (ary[key])
-	    sv_free(ary[key]);
+	AvFILL(av) = key;
     }
+    else if (AvREAL(av))
+	SvREFCNT_dec(ary[key]);
     ary[key] = val;
-    if (SvMAGICAL(av)) {
-	MAGIC* mg = SvMAGIC(av);
-	sv_magic(val, (SV*)av, tolower(mg->mg_type), 0, key);
+    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()
+newAV(void)
 {
     register AV *av;
 
-    Newz(1,av,1,AV);
-    SvREFCNT(av) = 1;
-    sv_upgrade(av,SVt_PVAV);
+    av = (AV*)NEWSV(3,0);
+    sv_upgrade((SV *)av, SVt_PVAV);
     AvREAL_on(av);
     AvALLOC(av) = 0;
     SvPVX(av) = 0;
@@ -165,219 +237,463 @@ newAV()
 }
 
 AV *
-av_make(size,strp)
-register I32 size;
-register SV **strp;
+av_make(register I32 size, register SV **strp)
 {
     register AV *av;
     register I32 i;
     register SV** ary;
 
-    Newz(3,av,1,AV);
-    sv_upgrade(av,SVt_PVAV);
-    New(4,ary,size+1,SV*);
-    AvALLOC(av) = ary;
-    Zero(ary,size,SV*);
-    AvREAL_on(av);
-    SvPVX(av) = (char*)ary;
-    AvFILL(av) = size - 1;
-    AvMAX(av) = size - 1;
-    for (i = 0; i < size; i++) {
-	if (*strp) {
+    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;
+	AvFILL(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++;
 	}
-	strp++;
     }
-    SvOK_on(av);
     return av;
 }
 
 AV *
-av_fake(size,strp)
-register I32 size;
-register SV **strp;
+av_fake(register I32 size, register SV **strp)
 {
     register AV *av;
     register SV** ary;
 
-    Newz(3,av,1,AV);
-    SvREFCNT(av) = 1;
-    sv_upgrade(av,SVt_PVAV);
+    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*);
-    AvREAL_off(av);
+    AvFLAGS(av) = AVf_REIFY;
     SvPVX(av) = (char*)ary;
     AvFILL(av) = size - 1;
     AvMAX(av) = size - 1;
     while (size--) {
-	if (*strp)
-	    SvTEMP_off(*strp);
+	assert (*strp);
+	SvTEMP_off(*strp);
 	strp++;
     }
-    SvOK_on(av);
     return av;
 }
 
 void
-av_clear(av)
-register AV *av;
+av_clear(register AV *av)
 {
     register I32 key;
+    SV** ary;
 
-    if (!av || !AvREAL(av) || AvMAX(av) < 0)
+#ifdef DEBUGGING
+    if (SvREFCNT(av) <= 0) {
+	warn("Attempt to clear deleted array");
+    }
+#endif
+    if (!av || AvMAX(av) < 0)
 	return;
     /*SUPPRESS 560*/
+
+    if (AvREAL(av)) {
+	ary = AvARRAY(av);
+	key = AvFILL(av) + 1;
+	while (key) {
+	    SvREFCNT_dec(ary[--key]);
+	    ary[key] = &sv_undef;
+	}
+    }
     if (key = AvARRAY(av) - AvALLOC(av)) {
 	AvMAX(av) += key;
-	SvPVX(av) = (char*)(AvARRAY(av) - key);
+	SvPVX(av) = (char*)AvALLOC(av);
     }
-    for (key = 0; key <= AvMAX(av); key++)
-	sv_free(AvARRAY(av)[key]);
     AvFILL(av) = -1;
-    Zero(AvARRAY(av), AvMAX(av)+1, SV*);
+
+    if (SvRMAGICAL(av))
+	mg_clear((SV*)av); 
 }
 
 void
-av_undef(av)
-register AV *av;
+av_undef(register AV *av)
 {
     register I32 key;
 
     if (!av)
 	return;
     /*SUPPRESS 560*/
-    if (key = AvARRAY(av) - AvALLOC(av)) {
-	AvMAX(av) += key;
-	SvPVX(av) = (char*)(AvARRAY(av) - key);
-    }
     if (AvREAL(av)) {
-	for (key = 0; key <= AvMAX(av); key++)
-	    sv_free(AvARRAY(av)[key]);
+	key = AvFILL(av) + 1;
+	while (key)
+	    SvREFCNT_dec(AvARRAY(av)[--key]);
     }
     Safefree(AvALLOC(av));
     AvALLOC(av) = 0;
     SvPVX(av) = 0;
     AvMAX(av) = AvFILL(av) = -1;
+    if (AvARYLEN(av)) {
+	SvREFCNT_dec(AvARYLEN(av));
+	AvARYLEN(av) = 0;
+    }
 }
 
 void
-av_free(av)
-AV *av;
-{
-    av_undef(av);
-    Safefree(av);
-}
-
-bool
-av_push(av,val)
-register AV *av;
-SV *val;
+av_push(register AV *av, SV *val)
 {
-    return av_store(av,++(AvFILL(av)),val) != 0;
+    if (!av)
+	return;
+    av_store(av,AvFILL(av)+1,val);
 }
 
 SV *
-av_pop(av)
-register AV *av;
+av_pop(register AV *av)
 {
     SV *retval;
 
-    if (AvFILL(av) < 0)
-	return Nullsv;
+    if (!av || AvFILL(av) < 0)
+	return &sv_undef;
+    if (SvREADONLY(av))
+	croak(no_modify);
     retval = AvARRAY(av)[AvFILL(av)];
-    AvARRAY(av)[AvFILL(av)--] = Nullsv;
-    if (SvMAGICAL(av))
+    AvARRAY(av)[AvFILL(av)--] = &sv_undef;
+    if (SvSMAGICAL(av))
 	mg_set((SV*)av);
     return retval;
 }
 
 void
-av_popnulls(av)
-register AV *av;
-{
-    register I32 fill = AvFILL(av);
-
-    while (fill >= 0 && !AvARRAY(av)[fill])
-	fill--;
-    AvFILL(av) = fill;
-}
-
-void
-av_unshift(av,num)
-register AV *av;
-register I32 num;
+av_unshift(register AV *av, register I32 num)
 {
     register I32 i;
     register SV **sstr,**dstr;
 
-    if (num <= 0)
+    if (!av || num <= 0)
 	return;
-    if (AvARRAY(av) - AvALLOC(av) >= num) {
-	AvMAX(av) += num;
-	AvFILL(av) += num;
-	while (num--) {
-	    SvPVX(av) = (char*)(AvARRAY(av) - 1);
-	    *AvARRAY(av) = Nullsv;
-	}
+    if (SvREADONLY(av))
+	croak(no_modify);
+    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;
+	AvFILL(av) += i;
+	SvPVX(av) = (char*)(AvARRAY(av) - i);
     }
-    else {
-	(void)av_store(av,AvFILL(av)+num,(SV*)0);	/* maybe extend array */
+    if (num) {
+	av_extend(av,AvFILL(av)+num);
+	AvFILL(av) += num;
 	dstr = AvARRAY(av) + AvFILL(av);
 	sstr = dstr - num;
 #ifdef BUGGY_MSC5
  # pragma loop_opt(off)	/* don't loop-optimize the following code */
 #endif /* BUGGY_MSC5 */
-	for (i = AvFILL(av) - num; i >= 0; i--) {
+	for (i = AvFILL(av) - num; i >= 0; --i) {
 	    *dstr-- = *sstr--;
 #ifdef BUGGY_MSC5
  # pragma loop_opt()	/* loop-optimization back to command-line setting */
 #endif /* BUGGY_MSC5 */
 	}
-	Zero(AvARRAY(av), num, SV*);
+	while (num)
+	    AvARRAY(av)[--num] = &sv_undef;
     }
 }
 
 SV *
-av_shift(av)
-register AV *av;
+av_shift(register AV *av)
 {
     SV *retval;
 
-    if (AvFILL(av) < 0)
-	return Nullsv;
+    if (!av || AvFILL(av) < 0)
+	return &sv_undef;
+    if (SvREADONLY(av))
+	croak(no_modify);
     retval = *AvARRAY(av);
-    *AvARRAY(av) = Nullsv;
+    if (AvREAL(av))
+	*AvARRAY(av) = &sv_undef;
     SvPVX(av) = (char*)(AvARRAY(av) + 1);
     AvMAX(av)--;
     AvFILL(av)--;
-    if (SvMAGICAL(av))
+    if (SvSMAGICAL(av))
 	mg_set((SV*)av);
     return retval;
 }
 
 I32
-av_len(av)
-register AV *av;
+av_len(register AV *av)
 {
     return AvFILL(av);
 }
 
 void
-av_fill(av, fill)
-register AV *av;
-I32 fill;
+av_fill(register AV *av, I32 fill)
 {
+    if (!av)
+	croak("panic: null array");
     if (fill < 0)
 	fill = -1;
     if (fill <= AvMAX(av)) {
+	I32 key = AvFILL(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;
+	}
+	    
 	AvFILL(av) = fill;
-	if (SvMAGICAL(av))
+	if (SvSMAGICAL(av))
 	    mg_set((SV*)av);
     }
-    else {
-	AvFILL(av) = fill - 1;		/* don't clobber in-between values */
-	(void)av_store(av,fill,Nullsv);
+    else
+	(void)av_store(av,fill,&sv_undef);
+}
+
+SV**
+avhv_fetch(AV *av, char *key, U32 klen, I32 lval)
+{
+    SV **keys, **indsvp;
+    I32 ind;
+    
+    keys = av_fetch(av, 0, FALSE);
+    if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
+	croak("Can't coerce array into hash");
+    indsvp = hv_fetch((HV*)SvRV(*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((HV*)SvRV(*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 **keys, **indsvp;
+    HE *he;
+    I32 ind;
+    
+    keys = av_fetch(av, 0, FALSE);
+    if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
+	croak("Can't coerce array into hash");
+    he = hv_fetch_ent((HV*)SvRV(*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((HV*)SvRV(*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 **keys, **indsvp;
+    I32 ind;
+    
+    keys = av_fetch(av, 0, FALSE);
+    if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
+	croak("Can't coerce array into hash");
+    indsvp = hv_fetch((HV*)SvRV(*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((HV*)SvRV(*keys), key, klen, newSViv(ind), hash);
+    }
+    return av_store(av, ind, val);
+}
+
+SV**
+avhv_store_ent(AV *av, SV *keysv, SV *val, U32 hash)
+{
+    SV **keys;
+    HE *he;
+    I32 ind;
+    
+    keys = av_fetch(av, 0, FALSE);
+    if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
+	croak("Can't coerce array into hash");
+    he = hv_fetch_ent((HV*)SvRV(*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((HV*)SvRV(*keys), keysv, newSViv(ind), hash);
+    }
+    return av_store(av, ind, val);
+}
+
+bool
+avhv_exists_ent(AV *av, SV *keysv, U32 hash)
+{
+    SV **keys;
+    
+    keys = av_fetch(av, 0, FALSE);
+    if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
+	croak("Can't coerce array into hash");
+    return hv_exists_ent((HV*)SvRV(*keys), keysv, hash);
+}
+
+bool
+avhv_exists(AV *av, char *key, U32 klen)
+{
+    SV **keys;
+    
+    keys = av_fetch(av, 0, FALSE);
+    if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
+	croak("Can't coerce array into hash");
+    return hv_exists((HV*)SvRV(*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)
+{
+    SV **keys;
+    SV *sv;
+    SV **svp;
+    I32 ind;
+    
+    keys = av_fetch(av, 0, FALSE);
+    if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
+	croak("Can't coerce array into hash");
+    sv = hv_delete((HV*)SvRV(*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)
+{
+    SV **keys;
+    SV *sv;
+    SV **svp;
+    I32 ind;
+    
+    keys = av_fetch(av, 0, FALSE);
+    if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
+	croak("Can't coerce array into hash");
+    sv = hv_delete_ent((HV*)SvRV(*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)
+{
+    SV **keys;
+    
+    keys = av_fetch(av, 0, FALSE);
+    if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
+	croak("Can't coerce array into hash");
+    return hv_iterinit((HV*)SvRV(*keys));
+}
+
+HE *
+avhv_iternext(AV *av)
+{
+    SV **keys;
+    
+    keys = av_fetch(av, 0, FALSE);
+    if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
+	croak("Can't coerce array into hash");
+    return hv_iternext((HV*)SvRV(*keys));
+}
+
+SV *
+avhv_iterval(AV *av, register HE *entry)
+{
+    SV **keys;
+    SV *sv;
+    I32 ind;
+    
+    keys = av_fetch(av, 0, FALSE);
+    if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
+	croak("Can't coerce array into hash");
+    sv = hv_iterval((HV*)SvRV(*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)
+{
+    SV **keys;
+    HE *he;
+    SV *sv;
+    I32 ind;
+    
+    keys = av_fetch(av, 0, FALSE);
+    if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
+	croak("Can't coerce array into hash");
+    if ( (he = hv_iternext((HV*)SvRV(*keys))) == NULL)
+        return NULL;
+    *key = hv_iterkey(he, retlen);
+    sv = hv_iterval((HV*)SvRV(*keys), he);
+    ind = SvIV(sv);
+    if (ind < 1)
+	croak("Bad index while coercing array into hash");
+    return *av_fetch(av, ind, TRUE);
 }