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 if (SvRMAGICAL(av) && mg_find((SV*)av,'P'))
28 warn("av_reify called on tied array");
31 while (key > AvFILLp(av) + 1)
32 AvARRAY(av)[--key] = &sv_undef;
34 sv = AvARRAY(av)[--key];
36 if (sv != &sv_undef) {
38 (void)SvREFCNT_inc(sv);
41 key = AvARRAY(av) - AvALLOC(av);
43 AvALLOC(av)[--key] = &sv_undef;
48 av_extend(AV *av, I32 key)
50 dTHR; /* only necessary if we have to extend stack */
52 if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
59 PUSHs(sv_2mortal(newSViv(key)));
61 perl_call_method("EXTEND", G_SCALAR|G_DISCARD);
66 if (key > AvMAX(av)) {
71 if (AvALLOC(av) != AvARRAY(av)) {
72 ary = AvALLOC(av) + AvFILLp(av) + 1;
73 tmp = AvARRAY(av) - AvALLOC(av);
74 Move(AvARRAY(av), AvALLOC(av), AvFILLp(av)+1, SV*);
76 SvPVX(av) = (char*)AvALLOC(av);
79 ary[--tmp] = &sv_undef;
82 if (key > AvMAX(av) - 10) {
83 newmax = key + AvMAX(av);
89 #ifndef STRANGE_MALLOC
93 newmax = key + AvMAX(av) / 5;
96 Renew(AvALLOC(av),newmax+1, SV*);
98 bytes = (newmax + 1) * sizeof(SV*);
99 #define MALLOC_OVERHEAD 16
100 tmp = MALLOC_OVERHEAD;
101 while (tmp - MALLOC_OVERHEAD < bytes)
103 tmp -= MALLOC_OVERHEAD;
105 assert(tmp > newmax);
107 New(2,ary, newmax+1, SV*);
108 Copy(AvALLOC(av), ary, AvMAX(av)+1, SV*);
110 offer_nice_chunk(AvALLOC(av), (AvMAX(av)+1) * sizeof(SV*));
112 Safefree(AvALLOC(av));
115 ary = AvALLOC(av) + AvMAX(av) + 1;
116 tmp = newmax - AvMAX(av);
117 if (av == curstack) { /* Oops, grew stack (via av_store()?) */
118 stack_sp = AvALLOC(av) + (stack_sp - stack_base);
119 stack_base = AvALLOC(av);
120 stack_max = stack_base + newmax;
124 newmax = key < 4 ? 4 : key;
125 New(2,AvALLOC(av), newmax+1, SV*);
126 ary = AvALLOC(av) + 1;
128 AvALLOC(av)[0] = &sv_undef; /* For the stacks */
132 ary[--tmp] = &sv_undef;
135 SvPVX(av) = (char*)AvALLOC(av);
142 av_fetch(register AV *av, I32 key, I32 lval)
150 key += AvFILL(av) + 1;
155 if (SvRMAGICAL(av)) {
156 if (mg_find((SV*)av,'P')) {
159 mg_copy((SV*)av, sv, 0, key);
165 if (key > AvFILLp(av)) {
172 return av_store(av,key,sv);
174 if (AvARRAY(av)[key] == &sv_undef) {
178 return av_store(av,key,sv);
183 && (!AvARRAY(av)[key] /* eg. @_ could have freed elts */
184 || SvTYPE(AvARRAY(av)[key]) == SVTYPEMASK)) {
185 AvARRAY(av)[key] = &sv_undef; /* 1/2 reify */
188 return &AvARRAY(av)[key];
192 av_store(register AV *av, I32 key, SV *val)
204 key += AvFILL(av) + 1;
209 if (SvREADONLY(av) && key >= AvFILL(av))
212 if (SvRMAGICAL(av)) {
213 if (mg_find((SV*)av,'P')) {
214 if (val != &sv_undef) {
215 mg_copy((SV*)av, val, 0, key);
221 if (!AvREAL(av) && AvREIFY(av))
226 if (AvFILLp(av) < key) {
229 if (av == curstack && key > stack_sp - stack_base)
230 stack_sp = stack_base + key; /* XPUSH in disguise */
232 ary[++AvFILLp(av)] = &sv_undef;
233 while (AvFILLp(av) < key);
238 SvREFCNT_dec(ary[key]);
240 if (SvSMAGICAL(av)) {
241 if (val != &sv_undef) {
242 MAGIC* mg = SvMAGIC(av);
243 sv_magic(val, (SV*)av, toLOWER(mg->mg_type), 0, key);
255 av = (AV*)NEWSV(3,0);
256 sv_upgrade((SV *)av, SVt_PVAV);
260 AvMAX(av) = AvFILLp(av) = -1;
265 av_make(register I32 size, register SV **strp)
271 av = (AV*)NEWSV(8,0);
272 sv_upgrade((SV *) av,SVt_PVAV);
273 AvFLAGS(av) = AVf_REAL;
274 if (size) { /* `defined' was returning undef for size==0 anyway. */
277 SvPVX(av) = (char*)ary;
278 AvFILLp(av) = size - 1;
279 AvMAX(av) = size - 1;
280 for (i = 0; i < size; i++) {
283 sv_setsv(ary[i], *strp);
291 av_fake(register I32 size, register SV **strp)
296 av = (AV*)NEWSV(9,0);
297 sv_upgrade((SV *)av, SVt_PVAV);
298 New(4,ary,size+1,SV*);
300 Copy(strp,ary,size,SV*);
301 AvFLAGS(av) = AVf_REIFY;
302 SvPVX(av) = (char*)ary;
303 AvFILLp(av) = size - 1;
304 AvMAX(av) = size - 1;
314 av_clear(register AV *av)
320 if (SvREFCNT(av) <= 0) {
321 warn("Attempt to clear deleted array");
324 if (!av || AvMAX(av) < 0)
328 /* Give any tie a chance to cleanup first */
334 key = AvFILLp(av) + 1;
336 SvREFCNT_dec(ary[--key]);
337 ary[key] = &sv_undef;
340 if (key = AvARRAY(av) - AvALLOC(av)) {
342 SvPVX(av) = (char*)AvALLOC(av);
349 av_undef(register AV *av)
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() ? */
362 key = AvFILLp(av) + 1;
364 SvREFCNT_dec(AvARRAY(av)[--key]);
366 Safefree(AvALLOC(av));
369 AvMAX(av) = AvFILLp(av) = -1;
371 SvREFCNT_dec(AvARYLEN(av));
377 av_push(register AV *av, SV *val)
385 if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
392 perl_call_method("PUSH", G_SCALAR|G_DISCARD);
395 av_store(av,AvFILLp(av)+1,val);
399 av_pop(register AV *av)
404 if (!av || AvFILL(av) < 0)
408 if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
413 if (perl_call_method("POP", G_SCALAR)) {
414 retval = newSVsv(*stack_sp--);
420 retval = AvARRAY(av)[AvFILLp(av)];
421 AvARRAY(av)[AvFILLp(av)--] = &sv_undef;
428 av_unshift(register AV *av, register I32 num)
431 register SV **sstr,**dstr;
439 if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
448 perl_call_method("UNSHIFT", G_SCALAR|G_DISCARD);
452 if (!AvREAL(av) && AvREIFY(av))
454 i = AvARRAY(av) - AvALLOC(av);
462 SvPVX(av) = (char*)(AvARRAY(av) - i);
465 av_extend(av,AvFILLp(av)+num);
467 dstr = AvARRAY(av) + AvFILLp(av);
470 # pragma loop_opt(off) /* don't loop-optimize the following code */
471 #endif /* BUGGY_MSC5 */
472 for (i = AvFILLp(av) - num; i >= 0; --i) {
475 # pragma loop_opt() /* loop-optimization back to command-line setting */
476 #endif /* BUGGY_MSC5 */
479 AvARRAY(av)[--num] = &sv_undef;
484 av_shift(register AV *av)
489 if (!av || AvFILL(av) < 0)
493 if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
498 if (perl_call_method("SHIFT", G_SCALAR)) {
499 retval = newSVsv(*stack_sp--);
505 retval = *AvARRAY(av);
507 *AvARRAY(av) = &sv_undef;
508 SvPVX(av) = (char*)(AvARRAY(av) + 1);
517 av_len(register AV *av)
523 av_fill(register AV *av, I32 fill)
527 croak("panic: null array");
530 if (SvRMAGICAL(av) && (mg = mg_find((SV*)av,'P'))) {
537 PUSHs(sv_2mortal(newSViv(fill)));
539 perl_call_method("STORESIZE", G_SCALAR|G_DISCARD);
544 if (fill <= AvMAX(av)) {
545 I32 key = AvFILLp(av);
546 SV** ary = AvARRAY(av);
550 SvREFCNT_dec(ary[key]);
551 ary[key--] = &sv_undef;
556 ary[++key] = &sv_undef;
564 (void)av_store(av,fill,&sv_undef);
574 keysp = av_fetch(av, 0, FALSE);
581 if (SvTYPE(sv) == SVt_PVHV)
586 croak("Can't coerce array into hash");
591 avhv_fetch(AV *av, char *key, U32 klen, I32 lval)
594 HV *keys = avhv_keys(av);
597 indsvp = hv_fetch(keys, key, klen, FALSE);
601 croak("Bad index while coercing array into hash");
606 ind = AvFILL(av) + 1;
607 hv_store(keys, key, klen, newSViv(ind), 0);
609 return av_fetch(av, ind, lval);
613 avhv_fetch_ent(AV *av, SV *keysv, I32 lval, U32 hash)
616 HV *keys = avhv_keys(av);
620 he = hv_fetch_ent(keys, keysv, FALSE, hash);
622 ind = SvIV(HeVAL(he));
624 croak("Bad index while coercing array into hash");
629 ind = AvFILL(av) + 1;
630 hv_store_ent(keys, keysv, newSViv(ind), 0);
632 return av_fetch(av, ind, lval);
636 avhv_store(AV *av, char *key, U32 klen, SV *val, U32 hash)
639 HV *keys = avhv_keys(av);
642 indsvp = hv_fetch(keys, key, klen, FALSE);
646 croak("Bad index while coercing array into hash");
648 ind = AvFILL(av) + 1;
649 hv_store(keys, key, klen, newSViv(ind), hash);
651 return av_store(av, ind, val);
655 avhv_store_ent(AV *av, SV *keysv, SV *val, U32 hash)
657 HV *keys = avhv_keys(av);
661 he = hv_fetch_ent(keys, keysv, FALSE, hash);
663 ind = SvIV(HeVAL(he));
665 croak("Bad index while coercing array into hash");
667 ind = AvFILL(av) + 1;
668 hv_store_ent(keys, keysv, newSViv(ind), hash);
670 return av_store(av, ind, val);
674 avhv_exists_ent(AV *av, SV *keysv, U32 hash)
676 HV *keys = avhv_keys(av);
677 return hv_exists_ent(keys, keysv, hash);
681 avhv_exists(AV *av, char *key, U32 klen)
683 HV *keys = avhv_keys(av);
684 return hv_exists(keys, key, klen);
687 /* avhv_delete leaks. Caller can re-index and compress if so desired. */
689 avhv_delete(AV *av, char *key, U32 klen, I32 flags)
691 HV *keys = avhv_keys(av);
696 sv = hv_delete(keys, key, klen, 0);
701 croak("Bad index while coercing array into hash");
702 svp = av_fetch(av, ind, FALSE);
705 if (flags & G_DISCARD) {
709 sv = sv_2mortal(*svp);
715 /* avhv_delete_ent leaks. Caller can re-index and compress if so desired. */
717 avhv_delete_ent(AV *av, SV *keysv, I32 flags, U32 hash)
719 HV *keys = avhv_keys(av);
724 sv = hv_delete_ent(keys, keysv, 0, hash);
729 croak("Bad index while coercing array into hash");
730 svp = av_fetch(av, ind, FALSE);
733 if (flags & G_DISCARD) {
737 sv = sv_2mortal(*svp);
744 avhv_iterinit(AV *av)
746 HV *keys = avhv_keys(av);
747 return hv_iterinit(keys);
751 avhv_iternext(AV *av)
753 HV *keys = avhv_keys(av);
754 return hv_iternext(keys);
758 avhv_iterval(AV *av, register HE *entry)
760 HV *keys = avhv_keys(av);
764 sv = hv_iterval(keys, entry);
767 croak("Bad index while coercing array into hash");
768 return *av_fetch(av, ind, TRUE);
772 avhv_iternextsv(AV *av, char **key, I32 *retlen)
774 HV *keys = avhv_keys(av);
779 he = hv_iternext(keys);
782 *key = hv_iterkey(he, retlen);
783 sv = hv_iterval(keys, he);
786 croak("Bad index while coercing array into hash");
787 return *av_fetch(av, ind, TRUE);