3 * Copyright (c) 1991-1994, 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
18 static void av_reify _((AV* av));
28 while (key > AvFILL(av) + 1)
29 AvARRAY(av)[--key] = &sv_undef;
31 sv = AvARRAY(av)[--key];
34 (void)SvREFCNT_inc(sv);
44 if (key > AvMAX(av)) {
49 if (AvALLOC(av) != AvARRAY(av)) {
50 ary = AvALLOC(av) + AvFILL(av) + 1;
51 tmp = AvARRAY(av) - AvALLOC(av);
52 Move(AvARRAY(av), AvALLOC(av), AvFILL(av)+1, SV*);
54 SvPVX(av) = (char*)AvALLOC(av);
57 ary[--tmp] = &sv_undef;
60 if (key > AvMAX(av) - 10) {
61 newmax = key + AvMAX(av);
67 #ifndef STRANGE_MALLOC
71 newmax = key + AvMAX(av) / 5;
74 Renew(AvALLOC(av),newmax+1, SV*);
76 bytes = (newmax + 1) * sizeof(SV*);
77 #define MALLOC_OVERHEAD 16
78 tmp = MALLOC_OVERHEAD;
79 while (tmp - MALLOC_OVERHEAD < bytes)
81 tmp -= MALLOC_OVERHEAD;
85 New(2,ary, newmax+1, SV*);
86 Copy(AvALLOC(av), ary, AvMAX(av)+1, SV*);
87 if (AvMAX(av) > 64 && !nice_chunk) {
88 nice_chunk = (char*)AvALLOC(av);
89 nice_chunk_size = (AvMAX(av) + 1) * sizeof(SV*);
92 Safefree(AvALLOC(av));
95 ary = AvALLOC(av) + AvMAX(av) + 1;
96 tmp = newmax - AvMAX(av);
97 if (av == curstack) { /* Oops, grew stack (via av_store()?) */
98 stack_sp = AvALLOC(av) + (stack_sp - stack_base);
99 stack_base = AvALLOC(av);
100 stack_max = stack_base + newmax;
104 newmax = key < 4 ? 4 : key;
105 New(2,AvALLOC(av), newmax+1, SV*);
106 ary = AvALLOC(av) + 1;
108 AvALLOC(av)[0] = &sv_undef; /* For the stacks */
112 ary[--tmp] = &sv_undef;
115 SvPVX(av) = (char*)AvALLOC(av);
122 av_fetch(av,key,lval)
132 if (SvRMAGICAL(av)) {
133 if (mg_find((SV*)av,'P')) {
135 mg_copy((SV*)av, sv, 0, key);
142 key += AvFILL(av) + 1;
146 else if (key > AvFILL(av)) {
153 return av_store(av,key,sv);
155 if (AvARRAY(av)[key] == &sv_undef) {
159 return av_store(av,key,sv);
164 && (!AvARRAY(av)[key] /* eg. @_ could have freed elts */
165 || SvTYPE(AvARRAY(av)[key]) == SVTYPEMASK)) {
166 AvARRAY(av)[key] = &sv_undef; /* 1/2 reify */
169 return &AvARRAY(av)[key];
185 if (SvRMAGICAL(av)) {
186 if (mg_find((SV*)av,'P')) {
187 if (val != &sv_undef)
188 mg_copy((SV*)av, val, 0, key);
194 key += AvFILL(av) + 1;
198 if (SvREADONLY(av) && key >= AvFILL(av))
202 if (!AvREAL(av) && AvREIFY(av))
205 if (AvFILL(av) < key) {
207 if (av == curstack && key > stack_sp - stack_base)
208 stack_sp = stack_base + key; /* XPUSH in disguise */
210 ary[++AvFILL(av)] = &sv_undef;
211 while (AvFILL(av) < key);
216 SvREFCNT_dec(ary[key]);
218 if (SvSMAGICAL(av)) {
219 if (val != &sv_undef) {
220 MAGIC* mg = SvMAGIC(av);
221 sv_magic(val, (SV*)av, toLOWER(mg->mg_type), 0, key);
233 av = (AV*)NEWSV(3,0);
234 sv_upgrade((SV *)av, SVt_PVAV);
238 AvMAX(av) = AvFILL(av) = -1;
251 av = (AV*)NEWSV(8,0);
252 sv_upgrade((SV *) av,SVt_PVAV);
253 New(4,ary,size+1,SV*);
255 AvFLAGS(av) = AVf_REAL;
256 SvPVX(av) = (char*)ary;
257 AvFILL(av) = size - 1;
258 AvMAX(av) = size - 1;
259 for (i = 0; i < size; i++) {
262 sv_setsv(ary[i], *strp);
276 av = (AV*)NEWSV(9,0);
277 sv_upgrade((SV *)av, SVt_PVAV);
278 New(4,ary,size+1,SV*);
280 Copy(strp,ary,size,SV*);
281 AvFLAGS(av) = AVf_REIFY;
282 SvPVX(av) = (char*)ary;
283 AvFILL(av) = size - 1;
284 AvMAX(av) = size - 1;
301 if (SvREFCNT(av) <= 0) {
302 warn("Attempt to clear deleted array");
305 if (!av || AvMAX(av) < 0)
311 key = AvFILL(av) + 1;
313 SvREFCNT_dec(ary[--key]);
314 ary[key] = &sv_undef;
317 if (key = AvARRAY(av) - AvALLOC(av)) {
319 SvPVX(av) = (char*)AvALLOC(av);
334 key = AvFILL(av) + 1;
336 SvREFCNT_dec(AvARRAY(av)[--key]);
338 Safefree(AvALLOC(av));
341 AvMAX(av) = AvFILL(av) = -1;
343 SvREFCNT_dec(AvARYLEN(av));
355 av_store(av,AvFILL(av)+1,val);
364 if (!av || AvFILL(av) < 0)
368 retval = AvARRAY(av)[AvFILL(av)];
369 AvARRAY(av)[AvFILL(av)--] = &sv_undef;
381 register SV **sstr,**dstr;
387 if (!AvREAL(av) && AvREIFY(av))
389 i = AvARRAY(av) - AvALLOC(av);
397 SvPVX(av) = (char*)(AvARRAY(av) - i);
400 av_extend(av,AvFILL(av)+num);
402 dstr = AvARRAY(av) + AvFILL(av);
405 # pragma loop_opt(off) /* don't loop-optimize the following code */
406 #endif /* BUGGY_MSC5 */
407 for (i = AvFILL(av) - num; i >= 0; --i) {
410 # pragma loop_opt() /* loop-optimization back to command-line setting */
411 #endif /* BUGGY_MSC5 */
414 AvARRAY(av)[--num] = &sv_undef;
424 if (!av || AvFILL(av) < 0)
428 retval = *AvARRAY(av);
430 *AvARRAY(av) = &sv_undef;
431 SvPVX(av) = (char*)(AvARRAY(av) + 1);
452 croak("panic: null array");
455 if (fill <= AvMAX(av)) {
456 I32 key = AvFILL(av);
457 SV** ary = AvARRAY(av);
461 SvREFCNT_dec(ary[key]);
462 ary[key--] = &sv_undef;
467 ary[++key] = &sv_undef;
475 (void)av_store(av,fill,&sv_undef);