3 * Copyright (c) 1991-1997, Larry Wall
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.
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
27 while (key > AvFILL(av) + 1)
28 AvARRAY(av)[--key] = &sv_undef;
30 sv = AvARRAY(av)[--key];
32 if (sv != &sv_undef) {
34 (void)SvREFCNT_inc(sv);
37 key = AvARRAY(av) - AvALLOC(av);
39 AvALLOC(av)[--key] = &sv_undef;
44 av_extend(AV *av, I32 key)
46 dTHR; /* only necessary if we have to extend stack */
47 if (key > AvMAX(av)) {
52 if (AvALLOC(av) != AvARRAY(av)) {
53 ary = AvALLOC(av) + AvFILL(av) + 1;
54 tmp = AvARRAY(av) - AvALLOC(av);
55 Move(AvARRAY(av), AvALLOC(av), AvFILL(av)+1, SV*);
57 SvPVX(av) = (char*)AvALLOC(av);
60 ary[--tmp] = &sv_undef;
63 if (key > AvMAX(av) - 10) {
64 newmax = key + AvMAX(av);
70 #ifndef STRANGE_MALLOC
74 newmax = key + AvMAX(av) / 5;
77 Renew(AvALLOC(av),newmax+1, SV*);
79 bytes = (newmax + 1) * sizeof(SV*);
80 #define MALLOC_OVERHEAD 16
81 tmp = MALLOC_OVERHEAD;
82 while (tmp - MALLOC_OVERHEAD < bytes)
84 tmp -= MALLOC_OVERHEAD;
88 New(2,ary, newmax+1, SV*);
89 Copy(AvALLOC(av), ary, AvMAX(av)+1, SV*);
91 offer_nice_chunk(AvALLOC(av), (AvMAX(av)+1) * sizeof(SV*));
93 Safefree(AvALLOC(av));
96 ary = AvALLOC(av) + AvMAX(av) + 1;
97 tmp = newmax - AvMAX(av);
98 if (av == curstack) { /* Oops, grew stack (via av_store()?) */
99 stack_sp = AvALLOC(av) + (stack_sp - stack_base);
100 stack_base = AvALLOC(av);
101 stack_max = stack_base + newmax;
105 newmax = key < 4 ? 4 : key;
106 New(2,AvALLOC(av), newmax+1, SV*);
107 ary = AvALLOC(av) + 1;
109 AvALLOC(av)[0] = &sv_undef; /* For the stacks */
113 ary[--tmp] = &sv_undef;
116 SvPVX(av) = (char*)AvALLOC(av);
123 av_fetch(register AV *av, I32 key, I32 lval)
130 if (SvRMAGICAL(av)) {
131 if (mg_find((SV*)av,'P')) {
134 mg_copy((SV*)av, sv, 0, key);
141 key += AvFILL(av) + 1;
145 else if (key > AvFILL(av)) {
152 return av_store(av,key,sv);
154 if (AvARRAY(av)[key] == &sv_undef) {
158 return av_store(av,key,sv);
163 && (!AvARRAY(av)[key] /* eg. @_ could have freed elts */
164 || SvTYPE(AvARRAY(av)[key]) == SVTYPEMASK)) {
165 AvARRAY(av)[key] = &sv_undef; /* 1/2 reify */
168 return &AvARRAY(av)[key];
172 av_store(register AV *av, I32 key, SV *val)
181 if (SvRMAGICAL(av)) {
182 if (mg_find((SV*)av,'P')) {
183 if (val != &sv_undef)
184 mg_copy((SV*)av, val, 0, key);
190 key += AvFILL(av) + 1;
194 if (SvREADONLY(av) && key >= AvFILL(av))
196 if (!AvREAL(av) && AvREIFY(av))
201 if (AvFILL(av) < key) {
204 if (av == curstack && key > stack_sp - stack_base)
205 stack_sp = stack_base + key; /* XPUSH in disguise */
207 ary[++AvFILL(av)] = &sv_undef;
208 while (AvFILL(av) < key);
213 SvREFCNT_dec(ary[key]);
215 if (SvSMAGICAL(av)) {
216 if (val != &sv_undef) {
217 MAGIC* mg = SvMAGIC(av);
218 sv_magic(val, (SV*)av, toLOWER(mg->mg_type), 0, key);
230 av = (AV*)NEWSV(3,0);
231 sv_upgrade((SV *)av, SVt_PVAV);
235 AvMAX(av) = AvFILL(av) = -1;
240 av_make(register I32 size, register SV **strp)
246 av = (AV*)NEWSV(8,0);
247 sv_upgrade((SV *) av,SVt_PVAV);
248 AvFLAGS(av) = AVf_REAL;
249 if (size) { /* `defined' was returning undef for size==0 anyway. */
252 SvPVX(av) = (char*)ary;
253 AvFILL(av) = size - 1;
254 AvMAX(av) = size - 1;
255 for (i = 0; i < size; i++) {
258 sv_setsv(ary[i], *strp);
266 av_fake(register I32 size, register SV **strp)
271 av = (AV*)NEWSV(9,0);
272 sv_upgrade((SV *)av, SVt_PVAV);
273 New(4,ary,size+1,SV*);
275 Copy(strp,ary,size,SV*);
276 AvFLAGS(av) = AVf_REIFY;
277 SvPVX(av) = (char*)ary;
278 AvFILL(av) = size - 1;
279 AvMAX(av) = size - 1;
289 av_clear(register AV *av)
295 if (SvREFCNT(av) <= 0) {
296 warn("Attempt to clear deleted array");
299 if (!av || AvMAX(av) < 0)
305 key = AvFILL(av) + 1;
307 SvREFCNT_dec(ary[--key]);
308 ary[key] = &sv_undef;
311 if (key = AvARRAY(av) - AvALLOC(av)) {
313 SvPVX(av) = (char*)AvALLOC(av);
322 av_undef(register AV *av)
330 key = AvFILL(av) + 1;
332 SvREFCNT_dec(AvARRAY(av)[--key]);
334 Safefree(AvALLOC(av));
337 AvMAX(av) = AvFILL(av) = -1;
339 SvREFCNT_dec(AvARYLEN(av));
345 av_push(register AV *av, SV *val)
349 av_store(av,AvFILL(av)+1,val);
353 av_pop(register AV *av)
357 if (!av || AvFILL(av) < 0)
361 retval = AvARRAY(av)[AvFILL(av)];
362 AvARRAY(av)[AvFILL(av)--] = &sv_undef;
369 av_unshift(register AV *av, register I32 num)
372 register SV **sstr,**dstr;
378 if (!AvREAL(av) && AvREIFY(av))
380 i = AvARRAY(av) - AvALLOC(av);
388 SvPVX(av) = (char*)(AvARRAY(av) - i);
391 av_extend(av,AvFILL(av)+num);
393 dstr = AvARRAY(av) + AvFILL(av);
396 # pragma loop_opt(off) /* don't loop-optimize the following code */
397 #endif /* BUGGY_MSC5 */
398 for (i = AvFILL(av) - num; i >= 0; --i) {
401 # pragma loop_opt() /* loop-optimization back to command-line setting */
402 #endif /* BUGGY_MSC5 */
405 AvARRAY(av)[--num] = &sv_undef;
410 av_shift(register AV *av)
414 if (!av || AvFILL(av) < 0)
418 retval = *AvARRAY(av);
420 *AvARRAY(av) = &sv_undef;
421 SvPVX(av) = (char*)(AvARRAY(av) + 1);
430 av_len(register AV *av)
436 av_fill(register AV *av, I32 fill)
439 croak("panic: null array");
442 if (fill <= AvMAX(av)) {
443 I32 key = AvFILL(av);
444 SV** ary = AvARRAY(av);
448 SvREFCNT_dec(ary[key]);
449 ary[key--] = &sv_undef;
454 ary[++key] = &sv_undef;
462 (void)av_store(av,fill,&sv_undef);
466 avhv_fetch(AV *av, char *key, U32 klen, I32 lval)
471 keys = av_fetch(av, 0, FALSE);
472 if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
473 croak("Can't coerce array into hash");
474 indsvp = hv_fetch((HV*)SvRV(*keys), key, klen, FALSE);
478 croak("Bad index while coercing array into hash");
483 ind = AvFILL(av) + 1;
484 hv_store((HV*)SvRV(*keys), key, klen, newSViv(ind), 0);
486 return av_fetch(av, ind, lval);
490 avhv_fetch_ent(AV *av, SV *keysv, I32 lval, U32 hash)
496 keys = av_fetch(av, 0, FALSE);
497 if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
498 croak("Can't coerce array into hash");
499 he = hv_fetch_ent((HV*)SvRV(*keys), keysv, FALSE, hash);
501 ind = SvIV(HeVAL(he));
503 croak("Bad index while coercing array into hash");
508 ind = AvFILL(av) + 1;
509 hv_store_ent((HV*)SvRV(*keys), keysv, newSViv(ind), 0);
511 return av_fetch(av, ind, lval);
515 avhv_store(AV *av, char *key, U32 klen, SV *val, U32 hash)
520 keys = av_fetch(av, 0, FALSE);
521 if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
522 croak("Can't coerce array into hash");
523 indsvp = hv_fetch((HV*)SvRV(*keys), key, klen, FALSE);
527 croak("Bad index while coercing array into hash");
529 ind = AvFILL(av) + 1;
530 hv_store((HV*)SvRV(*keys), key, klen, newSViv(ind), hash);
532 return av_store(av, ind, val);
536 avhv_store_ent(AV *av, SV *keysv, SV *val, U32 hash)
542 keys = av_fetch(av, 0, FALSE);
543 if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
544 croak("Can't coerce array into hash");
545 he = hv_fetch_ent((HV*)SvRV(*keys), keysv, FALSE, hash);
547 ind = SvIV(HeVAL(he));
549 croak("Bad index while coercing array into hash");
551 ind = AvFILL(av) + 1;
552 hv_store_ent((HV*)SvRV(*keys), keysv, newSViv(ind), hash);
554 return av_store(av, ind, val);
558 avhv_exists_ent(AV *av, SV *keysv, U32 hash)
562 keys = av_fetch(av, 0, FALSE);
563 if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
564 croak("Can't coerce array into hash");
565 return hv_exists_ent((HV*)SvRV(*keys), keysv, hash);
569 avhv_exists(AV *av, char *key, U32 klen)
573 keys = av_fetch(av, 0, FALSE);
574 if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
575 croak("Can't coerce array into hash");
576 return hv_exists((HV*)SvRV(*keys), key, klen);
579 /* avhv_delete leaks. Caller can re-index and compress if so desired. */
581 avhv_delete(AV *av, char *key, U32 klen, I32 flags)
588 keys = av_fetch(av, 0, FALSE);
589 if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
590 croak("Can't coerce array into hash");
591 sv = hv_delete((HV*)SvRV(*keys), key, klen, 0);
596 croak("Bad index while coercing array into hash");
597 svp = av_fetch(av, ind, FALSE);
600 if (flags & G_DISCARD) {
604 sv = sv_2mortal(*svp);
610 /* avhv_delete_ent leaks. Caller can re-index and compress if so desired. */
612 avhv_delete_ent(AV *av, SV *keysv, I32 flags, U32 hash)
619 keys = av_fetch(av, 0, FALSE);
620 if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
621 croak("Can't coerce array into hash");
622 sv = hv_delete_ent((HV*)SvRV(*keys), keysv, 0, hash);
627 croak("Bad index while coercing array into hash");
628 svp = av_fetch(av, ind, FALSE);
631 if (flags & G_DISCARD) {
635 sv = sv_2mortal(*svp);
642 avhv_iterinit(AV *av)
646 keys = av_fetch(av, 0, FALSE);
647 if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
648 croak("Can't coerce array into hash");
649 return hv_iterinit((HV*)SvRV(*keys));
653 avhv_iternext(AV *av)
657 keys = av_fetch(av, 0, FALSE);
658 if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
659 croak("Can't coerce array into hash");
660 return hv_iternext((HV*)SvRV(*keys));
664 avhv_iterval(AV *av, register HE *entry)
670 keys = av_fetch(av, 0, FALSE);
671 if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
672 croak("Can't coerce array into hash");
673 sv = hv_iterval((HV*)SvRV(*keys), entry);
676 croak("Bad index while coercing array into hash");
677 return *av_fetch(av, ind, TRUE);
681 avhv_iternextsv(AV *av, char **key, I32 *retlen)
688 keys = av_fetch(av, 0, FALSE);
689 if (!keys || !SvROK(*keys) || SvTYPE(SvRV(*keys)) != SVt_PVHV)
690 croak("Can't coerce array into hash");
691 if ( (he = hv_iternext((HV*)SvRV(*keys))) == NULL)
693 *key = hv_iterkey(he, retlen);
694 sv = hv_iterval((HV*)SvRV(*keys), he);
697 croak("Bad index while coercing array into hash");
698 return *av_fetch(av, ind, TRUE);