Commit | Line | Data |
---|---|---|
a0d0e21e | 1 | /* av.c |
79072805 | 2 | * |
1129b882 NC |
3 | * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
4 | * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others | |
79072805 LW |
5 | * |
6 | * You may distribute under the terms of either the GNU General Public | |
7 | * License or the Artistic License, as specified in the README file. | |
8 | * | |
a0d0e21e LW |
9 | */ |
10 | ||
11 | /* | |
4ac71550 TC |
12 | * '...for the Entwives desired order, and plenty, and peace (by which they |
13 | * meant that things should remain where they had set them).' --Treebeard | |
14 | * | |
15 | * [p.476 of _The Lord of the Rings_, III/iv: "Treebeard"] | |
79072805 LW |
16 | */ |
17 | ||
ccfc67b7 JH |
18 | /* |
19 | =head1 Array Manipulation Functions | |
20 | */ | |
21 | ||
79072805 | 22 | #include "EXTERN.h" |
864dbfa3 | 23 | #define PERL_IN_AV_C |
79072805 LW |
24 | #include "perl.h" |
25 | ||
fb73857a | 26 | void |
864dbfa3 | 27 | Perl_av_reify(pTHX_ AV *av) |
a0d0e21e | 28 | { |
97aff369 | 29 | dVAR; |
a0d0e21e | 30 | I32 key; |
fb73857a | 31 | |
7918f24d | 32 | PERL_ARGS_ASSERT_AV_REIFY; |
2fed2a1b | 33 | assert(SvTYPE(av) == SVt_PVAV); |
ba5d1d60 | 34 | |
3c78fafa GS |
35 | if (AvREAL(av)) |
36 | return; | |
93965878 | 37 | #ifdef DEBUGGING |
9b387841 NC |
38 | if (SvTIED_mg((const SV *)av, PERL_MAGIC_tied)) |
39 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEBUGGING), "av_reify called on tied array"); | |
93965878 | 40 | #endif |
a0d0e21e | 41 | key = AvMAX(av) + 1; |
93965878 | 42 | while (key > AvFILLp(av) + 1) |
3280af22 | 43 | AvARRAY(av)[--key] = &PL_sv_undef; |
a0d0e21e | 44 | while (key) { |
4373e329 | 45 | SV * const sv = AvARRAY(av)[--key]; |
a0d0e21e | 46 | assert(sv); |
411caa50 | 47 | if (sv != &PL_sv_undef) |
e2d306cb | 48 | SvREFCNT_inc_simple_void_NN(sv); |
a0d0e21e | 49 | } |
29de640a CS |
50 | key = AvARRAY(av) - AvALLOC(av); |
51 | while (key) | |
3280af22 | 52 | AvALLOC(av)[--key] = &PL_sv_undef; |
62b1ebc2 | 53 | AvREIFY_off(av); |
a0d0e21e LW |
54 | AvREAL_on(av); |
55 | } | |
56 | ||
cb50131a CB |
57 | /* |
58 | =for apidoc av_extend | |
59 | ||
60 | Pre-extend an array. The C<key> is the index to which the array should be | |
61 | extended. | |
62 | ||
63 | =cut | |
64 | */ | |
65 | ||
a0d0e21e | 66 | void |
864dbfa3 | 67 | Perl_av_extend(pTHX_ AV *av, I32 key) |
a0d0e21e | 68 | { |
97aff369 | 69 | dVAR; |
7a5b473e AL |
70 | MAGIC *mg; |
71 | ||
7918f24d | 72 | PERL_ARGS_ASSERT_AV_EXTEND; |
2fed2a1b | 73 | assert(SvTYPE(av) == SVt_PVAV); |
ba5d1d60 | 74 | |
ad64d0ec | 75 | mg = SvTIED_mg((const SV *)av, PERL_MAGIC_tied); |
823a54a3 | 76 | if (mg) { |
efaf3674 DM |
77 | SV *arg1 = sv_newmortal(); |
78 | sv_setiv(arg1, (IV)(key + 1)); | |
046b0c7d NC |
79 | Perl_magic_methcall(aTHX_ MUTABLE_SV(av), mg, "EXTEND", G_DISCARD, 1, |
80 | arg1); | |
93965878 NIS |
81 | return; |
82 | } | |
7261499d FC |
83 | av_extend_guts(av,key,&AvMAX(av),&AvALLOC(av),&AvARRAY(av)); |
84 | } | |
85 | ||
86 | /* The guts of av_extend. *Not* for general use! */ | |
87 | void | |
88 | Perl_av_extend_guts(pTHX_ AV *av, I32 key, SSize_t *maxp, SV ***allocp, | |
89 | SV ***arrayp) | |
90 | { | |
91 | dVAR; | |
92 | ||
93 | PERL_ARGS_ASSERT_AV_EXTEND_GUTS; | |
94 | ||
95 | if (key > *maxp) { | |
a0d0e21e LW |
96 | SV** ary; |
97 | I32 tmp; | |
98 | I32 newmax; | |
99 | ||
7261499d FC |
100 | if (av && *allocp != *arrayp) { |
101 | ary = *allocp + AvFILLp(av) + 1; | |
102 | tmp = *arrayp - *allocp; | |
103 | Move(*arrayp, *allocp, AvFILLp(av)+1, SV*); | |
104 | *maxp += tmp; | |
105 | *arrayp = *allocp; | |
a0d0e21e LW |
106 | if (AvREAL(av)) { |
107 | while (tmp) | |
3280af22 | 108 | ary[--tmp] = &PL_sv_undef; |
a0d0e21e | 109 | } |
7261499d FC |
110 | if (key > *maxp - 10) { |
111 | newmax = key + *maxp; | |
a0d0e21e LW |
112 | goto resize; |
113 | } | |
114 | } | |
115 | else { | |
2b573ace JH |
116 | #ifdef PERL_MALLOC_WRAP |
117 | static const char oom_array_extend[] = | |
118 | "Out of memory during array extend"; /* Duplicated in pp_hot.c */ | |
119 | #endif | |
120 | ||
7261499d | 121 | if (*allocp) { |
516a5887 | 122 | #if !defined(STRANGE_MALLOC) && !defined(MYMALLOC) |
c1f7b11a SB |
123 | MEM_SIZE bytes; |
124 | IV itmp; | |
c07a80fd | 125 | #endif |
4633a7c4 | 126 | |
ca7c1a29 | 127 | #ifdef Perl_safesysmalloc_size |
e050cc0e NC |
128 | /* Whilst it would be quite possible to move this logic around |
129 | (as I did in the SV code), so as to set AvMAX(av) early, | |
130 | based on calling Perl_safesysmalloc_size() immediately after | |
131 | allocation, I'm not convinced that it is a great idea here. | |
132 | In an array we have to loop round setting everything to | |
133 | &PL_sv_undef, which means writing to memory, potentially lots | |
134 | of it, whereas for the SV buffer case we don't touch the | |
135 | "bonus" memory. So there there is no cost in telling the | |
136 | world about it, whereas here we have to do work before we can | |
137 | tell the world about it, and that work involves writing to | |
138 | memory that might never be read. So, I feel, better to keep | |
139 | the current lazy system of only writing to it if our caller | |
140 | has a need for more space. NWC */ | |
7261499d | 141 | newmax = Perl_safesysmalloc_size((void*)*allocp) / |
260890ed | 142 | sizeof(const SV *) - 1; |
8d6dde3e IZ |
143 | |
144 | if (key <= newmax) | |
145 | goto resized; | |
146 | #endif | |
7261499d | 147 | newmax = key + *maxp / 5; |
a0d0e21e | 148 | resize: |
2b573ace | 149 | MEM_WRAP_CHECK_1(newmax+1, SV*, oom_array_extend); |
8d6dde3e | 150 | #if defined(STRANGE_MALLOC) || defined(MYMALLOC) |
7261499d | 151 | Renew(*allocp,newmax+1, SV*); |
4633a7c4 | 152 | #else |
260890ed | 153 | bytes = (newmax + 1) * sizeof(const SV *); |
4633a7c4 | 154 | #define MALLOC_OVERHEAD 16 |
c1f7b11a | 155 | itmp = MALLOC_OVERHEAD; |
eb160463 | 156 | while ((MEM_SIZE)(itmp - MALLOC_OVERHEAD) < bytes) |
c1f7b11a SB |
157 | itmp += itmp; |
158 | itmp -= MALLOC_OVERHEAD; | |
260890ed | 159 | itmp /= sizeof(const SV *); |
c1f7b11a SB |
160 | assert(itmp > newmax); |
161 | newmax = itmp - 1; | |
7261499d | 162 | assert(newmax >= *maxp); |
a02a5408 | 163 | Newx(ary, newmax+1, SV*); |
7261499d FC |
164 | Copy(*allocp, ary, *maxp+1, SV*); |
165 | Safefree(*allocp); | |
166 | *allocp = ary; | |
4633a7c4 | 167 | #endif |
ca7c1a29 | 168 | #ifdef Perl_safesysmalloc_size |
8d6dde3e | 169 | resized: |
9c5ffd7c | 170 | #endif |
7261499d FC |
171 | ary = *allocp + *maxp + 1; |
172 | tmp = newmax - *maxp; | |
3280af22 | 173 | if (av == PL_curstack) { /* Oops, grew stack (via av_store()?) */ |
7261499d FC |
174 | PL_stack_sp = *allocp + (PL_stack_sp - PL_stack_base); |
175 | PL_stack_base = *allocp; | |
3280af22 | 176 | PL_stack_max = PL_stack_base + newmax; |
a0d0e21e LW |
177 | } |
178 | } | |
179 | else { | |
8d6dde3e | 180 | newmax = key < 3 ? 3 : key; |
2b573ace | 181 | MEM_WRAP_CHECK_1(newmax+1, SV*, oom_array_extend); |
7261499d FC |
182 | Newx(*allocp, newmax+1, SV*); |
183 | ary = *allocp + 1; | |
a0d0e21e | 184 | tmp = newmax; |
7261499d | 185 | *allocp[0] = &PL_sv_undef; /* For the stacks */ |
a0d0e21e | 186 | } |
7261499d | 187 | if (av && AvREAL(av)) { |
a0d0e21e | 188 | while (tmp) |
3280af22 | 189 | ary[--tmp] = &PL_sv_undef; |
a0d0e21e LW |
190 | } |
191 | ||
7261499d FC |
192 | *arrayp = *allocp; |
193 | *maxp = newmax; | |
a0d0e21e LW |
194 | } |
195 | } | |
196 | } | |
197 | ||
cb50131a CB |
198 | /* |
199 | =for apidoc av_fetch | |
200 | ||
201 | Returns the SV at the specified index in the array. The C<key> is the | |
1a328862 SF |
202 | index. If lval is true, you are guaranteed to get a real SV back (in case |
203 | it wasn't real before), which you can then modify. Check that the return | |
204 | value is non-null before dereferencing it to a C<SV*>. | |
cb50131a CB |
205 | |
206 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for | |
207 | more information on how to use this function on tied arrays. | |
208 | ||
1a328862 | 209 | The rough perl equivalent is C<$myarray[$idx]>. |
3347919d | 210 | |
cb50131a CB |
211 | =cut |
212 | */ | |
213 | ||
ac9f75b5 FC |
214 | static bool |
215 | S_adjust_index(pTHX_ AV *av, const MAGIC *mg, I32 *keyp) | |
216 | { | |
217 | bool adjust_index = 1; | |
218 | if (mg) { | |
219 | /* Handle negative array indices 20020222 MJD */ | |
220 | SV * const ref = SvTIED_obj(MUTABLE_SV(av), mg); | |
221 | SvGETMAGIC(ref); | |
222 | if (SvROK(ref) && SvOBJECT(SvRV(ref))) { | |
223 | SV * const * const negative_indices_glob = | |
224 | hv_fetchs(SvSTASH(SvRV(ref)), NEGATIVE_INDICES_VAR, 0); | |
225 | ||
226 | if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob))) | |
227 | adjust_index = 0; | |
228 | } | |
229 | } | |
230 | ||
231 | if (adjust_index) { | |
232 | *keyp += AvFILL(av) + 1; | |
233 | if (*keyp < 0) | |
234 | return FALSE; | |
235 | } | |
236 | return TRUE; | |
237 | } | |
238 | ||
79072805 | 239 | SV** |
5aaab254 | 240 | Perl_av_fetch(pTHX_ AV *av, I32 key, I32 lval) |
79072805 | 241 | { |
97aff369 | 242 | dVAR; |
79072805 | 243 | |
7918f24d | 244 | PERL_ARGS_ASSERT_AV_FETCH; |
2fed2a1b | 245 | assert(SvTYPE(av) == SVt_PVAV); |
a0d0e21e | 246 | |
6f12eb6d | 247 | if (SvRMAGICAL(av)) { |
ad64d0ec NC |
248 | const MAGIC * const tied_magic |
249 | = mg_find((const SV *)av, PERL_MAGIC_tied); | |
250 | if (tied_magic || mg_find((const SV *)av, PERL_MAGIC_regdata)) { | |
e2d306cb AL |
251 | SV *sv; |
252 | if (key < 0) { | |
ac9f75b5 | 253 | if (!S_adjust_index(aTHX_ av, tied_magic, &key)) |
e2d306cb | 254 | return NULL; |
e2d306cb | 255 | } |
6f12eb6d MJD |
256 | |
257 | sv = sv_newmortal(); | |
dd28f7bb | 258 | sv_upgrade(sv, SVt_PVLV); |
ad64d0ec | 259 | mg_copy(MUTABLE_SV(av), sv, 0, key); |
2d961f6d DM |
260 | if (!tied_magic) /* for regdata, force leavesub to make copies */ |
261 | SvTEMP_off(sv); | |
dd28f7bb DM |
262 | LvTYPE(sv) = 't'; |
263 | LvTARG(sv) = sv; /* fake (SV**) */ | |
264 | return &(LvTARG(sv)); | |
6f12eb6d MJD |
265 | } |
266 | } | |
267 | ||
93965878 NIS |
268 | if (key < 0) { |
269 | key += AvFILL(av) + 1; | |
270 | if (key < 0) | |
e2d306cb | 271 | return NULL; |
93965878 NIS |
272 | } |
273 | ||
55d3f3e5 DM |
274 | if (key > AvFILLp(av) || AvARRAY(av)[key] == &PL_sv_undef) { |
275 | emptyness: | |
276 | return lval ? av_store(av,key,newSV(0)) : NULL; | |
79072805 | 277 | } |
55d3f3e5 DM |
278 | |
279 | if (AvREIFY(av) | |
4dbf4341 | 280 | && (!AvARRAY(av)[key] /* eg. @_ could have freed elts */ |
0565a181 | 281 | || SvIS_FREED(AvARRAY(av)[key]))) { |
3280af22 | 282 | AvARRAY(av)[key] = &PL_sv_undef; /* 1/2 reify */ |
4dbf4341 | 283 | goto emptyness; |
284 | } | |
463ee0b2 | 285 | return &AvARRAY(av)[key]; |
79072805 LW |
286 | } |
287 | ||
cb50131a CB |
288 | /* |
289 | =for apidoc av_store | |
290 | ||
291 | Stores an SV in an array. The array index is specified as C<key>. The | |
292 | return value will be NULL if the operation failed or if the value did not | |
293 | need to be actually stored within the array (as in the case of tied | |
4f540dd3 FC |
294 | arrays). Otherwise, it can be dereferenced |
295 | to get the C<SV*> that was stored | |
f0b90de1 SF |
296 | there (= C<val>)). |
297 | ||
298 | Note that the caller is responsible for suitably incrementing the reference | |
cb50131a CB |
299 | count of C<val> before the call, and decrementing it if the function |
300 | returned NULL. | |
301 | ||
f0b90de1 SF |
302 | Approximate Perl equivalent: C<$myarray[$key] = $val;>. |
303 | ||
cb50131a CB |
304 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for |
305 | more information on how to use this function on tied arrays. | |
306 | ||
307 | =cut | |
308 | */ | |
309 | ||
79072805 | 310 | SV** |
5aaab254 | 311 | Perl_av_store(pTHX_ AV *av, I32 key, SV *val) |
79072805 | 312 | { |
97aff369 | 313 | dVAR; |
79072805 LW |
314 | SV** ary; |
315 | ||
7918f24d | 316 | PERL_ARGS_ASSERT_AV_STORE; |
2fed2a1b | 317 | assert(SvTYPE(av) == SVt_PVAV); |
ba5d1d60 | 318 | |
725ac12f NC |
319 | /* S_regclass relies on being able to pass in a NULL sv |
320 | (unicode_alternate may be NULL). | |
321 | */ | |
322 | ||
43fcc5d2 | 323 | if (!val) |
3280af22 | 324 | val = &PL_sv_undef; |
463ee0b2 | 325 | |
6f12eb6d | 326 | if (SvRMAGICAL(av)) { |
ad64d0ec | 327 | const MAGIC * const tied_magic = mg_find((const SV *)av, PERL_MAGIC_tied); |
6f12eb6d | 328 | if (tied_magic) { |
6f12eb6d | 329 | if (key < 0) { |
ac9f75b5 | 330 | if (!S_adjust_index(aTHX_ av, tied_magic, &key)) |
6f12eb6d | 331 | return 0; |
6f12eb6d MJD |
332 | } |
333 | if (val != &PL_sv_undef) { | |
ad64d0ec | 334 | mg_copy(MUTABLE_SV(av), val, 0, key); |
6f12eb6d | 335 | } |
e2d306cb | 336 | return NULL; |
6f12eb6d MJD |
337 | } |
338 | } | |
339 | ||
340 | ||
a0d0e21e LW |
341 | if (key < 0) { |
342 | key += AvFILL(av) + 1; | |
343 | if (key < 0) | |
e2d306cb | 344 | return NULL; |
79072805 | 345 | } |
93965878 | 346 | |
43fcc5d2 | 347 | if (SvREADONLY(av) && key >= AvFILL(av)) |
cb077ed2 | 348 | Perl_croak_no_modify(); |
93965878 | 349 | |
49beac48 | 350 | if (!AvREAL(av) && AvREIFY(av)) |
a0d0e21e | 351 | av_reify(av); |
a0d0e21e LW |
352 | if (key > AvMAX(av)) |
353 | av_extend(av,key); | |
463ee0b2 | 354 | ary = AvARRAY(av); |
93965878 | 355 | if (AvFILLp(av) < key) { |
a0d0e21e | 356 | if (!AvREAL(av)) { |
3280af22 NIS |
357 | if (av == PL_curstack && key > PL_stack_sp - PL_stack_base) |
358 | PL_stack_sp = PL_stack_base + key; /* XPUSH in disguise */ | |
e2d306cb | 359 | do { |
3280af22 | 360 | ary[++AvFILLp(av)] = &PL_sv_undef; |
e2d306cb | 361 | } while (AvFILLp(av) < key); |
79072805 | 362 | } |
93965878 | 363 | AvFILLp(av) = key; |
79072805 | 364 | } |
a0d0e21e LW |
365 | else if (AvREAL(av)) |
366 | SvREFCNT_dec(ary[key]); | |
79072805 | 367 | ary[key] = val; |
8990e307 | 368 | if (SvSMAGICAL(av)) { |
70ce9249 FC |
369 | const MAGIC *mg = SvMAGIC(av); |
370 | bool set = TRUE; | |
371 | for (; mg; mg = mg->mg_moremagic) { | |
4806b7eb | 372 | if (!isUPPER(mg->mg_type)) continue; |
70ce9249 | 373 | if (val != &PL_sv_undef) { |
ad64d0ec | 374 | sv_magic(val, MUTABLE_SV(av), toLOWER(mg->mg_type), 0, key); |
70ce9249 FC |
375 | } |
376 | if (PL_delaymagic && mg->mg_type == PERL_MAGIC_isa) { | |
354b0578 | 377 | PL_delaymagic |= DM_ARRAY_ISA; |
70ce9249 FC |
378 | set = FALSE; |
379 | } | |
380 | } | |
381 | if (set) | |
ad64d0ec | 382 | mg_set(MUTABLE_SV(av)); |
463ee0b2 | 383 | } |
79072805 LW |
384 | return &ary[key]; |
385 | } | |
386 | ||
cb50131a | 387 | /* |
cb50131a CB |
388 | =for apidoc av_make |
389 | ||
390 | Creates a new AV and populates it with a list of SVs. The SVs are copied | |
391 | into the array, so they may be freed after the call to av_make. The new AV | |
392 | will have a reference count of 1. | |
393 | ||
775f1d61 SF |
394 | Perl equivalent: C<my @new_array = ($scalar1, $scalar2, $scalar3...);> |
395 | ||
cb50131a CB |
396 | =cut |
397 | */ | |
398 | ||
79072805 | 399 | AV * |
5aaab254 | 400 | Perl_av_make(pTHX_ I32 size, SV **strp) |
79072805 | 401 | { |
eb578fdb | 402 | AV * const av = MUTABLE_AV(newSV_type(SVt_PVAV)); |
a7f5e44d | 403 | /* sv_upgrade does AvREAL_only() */ |
7918f24d | 404 | PERL_ARGS_ASSERT_AV_MAKE; |
2fed2a1b NC |
405 | assert(SvTYPE(av) == SVt_PVAV); |
406 | ||
a0288114 | 407 | if (size) { /* "defined" was returning undef for size==0 anyway. */ |
eb578fdb KW |
408 | SV** ary; |
409 | I32 i; | |
a02a5408 | 410 | Newx(ary,size,SV*); |
573fa4ea | 411 | AvALLOC(av) = ary; |
9c6bc640 | 412 | AvARRAY(av) = ary; |
3ed356df FC |
413 | AvMAX(av) = size - 1; |
414 | AvFILLp(av) = -1; | |
415 | ENTER; | |
416 | SAVEFREESV(av); | |
573fa4ea TB |
417 | for (i = 0; i < size; i++) { |
418 | assert (*strp); | |
2b676593 BB |
419 | |
420 | /* Don't let sv_setsv swipe, since our source array might | |
421 | have multiple references to the same temp scalar (e.g. | |
422 | from a list slice) */ | |
423 | ||
3ed356df FC |
424 | SvGETMAGIC(*strp); /* before newSV, in case it dies */ |
425 | AvFILLp(av)++; | |
561b68a9 | 426 | ary[i] = newSV(0); |
2b676593 | 427 | sv_setsv_flags(ary[i], *strp, |
3ed356df | 428 | SV_DO_COW_SVSETSV|SV_NOSTEAL); |
573fa4ea TB |
429 | strp++; |
430 | } | |
3ed356df FC |
431 | SvREFCNT_inc_simple_void_NN(av); |
432 | LEAVE; | |
79072805 | 433 | } |
463ee0b2 | 434 | return av; |
79072805 LW |
435 | } |
436 | ||
cb50131a CB |
437 | /* |
438 | =for apidoc av_clear | |
439 | ||
8b9a1153 FC |
440 | Clears an array, making it empty. Does not free the memory the av uses to |
441 | store its list of scalars. If any destructors are triggered as a result, | |
442 | the av itself may be freed when this function returns. | |
443 | ||
444 | Perl equivalent: C<@myarray = ();>. | |
cb50131a CB |
445 | |
446 | =cut | |
447 | */ | |
448 | ||
79072805 | 449 | void |
5aaab254 | 450 | Perl_av_clear(pTHX_ AV *av) |
79072805 | 451 | { |
97aff369 | 452 | dVAR; |
e2d306cb | 453 | I32 extra; |
60edcf09 | 454 | bool real; |
79072805 | 455 | |
7918f24d | 456 | PERL_ARGS_ASSERT_AV_CLEAR; |
2fed2a1b NC |
457 | assert(SvTYPE(av) == SVt_PVAV); |
458 | ||
7d55f622 | 459 | #ifdef DEBUGGING |
9b387841 NC |
460 | if (SvREFCNT(av) == 0) { |
461 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEBUGGING), "Attempt to clear deleted array"); | |
7d55f622 | 462 | } |
463 | #endif | |
a0d0e21e | 464 | |
39caa665 | 465 | if (SvREADONLY(av)) |
cb077ed2 | 466 | Perl_croak_no_modify(); |
39caa665 | 467 | |
93965878 | 468 | /* Give any tie a chance to cleanup first */ |
89c14e2e BB |
469 | if (SvRMAGICAL(av)) { |
470 | const MAGIC* const mg = SvMAGIC(av); | |
b63c7c55 | 471 | if (PL_delaymagic && mg && mg->mg_type == PERL_MAGIC_isa) |
354b0578 | 472 | PL_delaymagic |= DM_ARRAY_ISA; |
89c14e2e | 473 | else |
ad64d0ec | 474 | mg_clear(MUTABLE_SV(av)); |
89c14e2e | 475 | } |
93965878 | 476 | |
a60c0954 NIS |
477 | if (AvMAX(av) < 0) |
478 | return; | |
479 | ||
60edcf09 | 480 | if ((real = !!AvREAL(av))) { |
823a54a3 | 481 | SV** const ary = AvARRAY(av); |
e2d306cb | 482 | I32 index = AvFILLp(av) + 1; |
60edcf09 FC |
483 | ENTER; |
484 | SAVEFREESV(SvREFCNT_inc_simple_NN(av)); | |
e2d306cb AL |
485 | while (index) { |
486 | SV * const sv = ary[--index]; | |
6b42d12b | 487 | /* undef the slot before freeing the value, because a |
e2d306cb AL |
488 | * destructor might try to modify this array */ |
489 | ary[index] = &PL_sv_undef; | |
6b42d12b | 490 | SvREFCNT_dec(sv); |
a0d0e21e LW |
491 | } |
492 | } | |
e2d306cb AL |
493 | extra = AvARRAY(av) - AvALLOC(av); |
494 | if (extra) { | |
495 | AvMAX(av) += extra; | |
9c6bc640 | 496 | AvARRAY(av) = AvALLOC(av); |
79072805 | 497 | } |
93965878 | 498 | AvFILLp(av) = -1; |
60edcf09 | 499 | if (real) LEAVE; |
79072805 LW |
500 | } |
501 | ||
cb50131a CB |
502 | /* |
503 | =for apidoc av_undef | |
504 | ||
8b9a1153 FC |
505 | Undefines the array. Frees the memory used by the av to store its list of |
506 | scalars. If any destructors are triggered as a result, the av itself may | |
507 | be freed. | |
cb50131a CB |
508 | |
509 | =cut | |
510 | */ | |
511 | ||
79072805 | 512 | void |
5aaab254 | 513 | Perl_av_undef(pTHX_ AV *av) |
79072805 | 514 | { |
60edcf09 FC |
515 | bool real; |
516 | ||
7918f24d | 517 | PERL_ARGS_ASSERT_AV_UNDEF; |
2fed2a1b | 518 | assert(SvTYPE(av) == SVt_PVAV); |
93965878 NIS |
519 | |
520 | /* Give any tie a chance to cleanup first */ | |
ad64d0ec | 521 | if (SvTIED_mg((const SV *)av, PERL_MAGIC_tied)) |
22717f83 | 522 | av_fill(av, -1); |
93965878 | 523 | |
60edcf09 | 524 | if ((real = !!AvREAL(av))) { |
eb578fdb | 525 | I32 key = AvFILLp(av) + 1; |
60edcf09 FC |
526 | ENTER; |
527 | SAVEFREESV(SvREFCNT_inc_simple_NN(av)); | |
a0d0e21e LW |
528 | while (key) |
529 | SvREFCNT_dec(AvARRAY(av)[--key]); | |
530 | } | |
22717f83 | 531 | |
463ee0b2 | 532 | Safefree(AvALLOC(av)); |
35da51f7 | 533 | AvALLOC(av) = NULL; |
9c6bc640 | 534 | AvARRAY(av) = NULL; |
93965878 | 535 | AvMAX(av) = AvFILLp(av) = -1; |
22717f83 | 536 | |
ad64d0ec | 537 | if(SvRMAGICAL(av)) mg_clear(MUTABLE_SV(av)); |
60edcf09 | 538 | if(real) LEAVE; |
79072805 LW |
539 | } |
540 | ||
cb50131a | 541 | /* |
29a861e7 NC |
542 | |
543 | =for apidoc av_create_and_push | |
544 | ||
545 | Push an SV onto the end of the array, creating the array if necessary. | |
546 | A small internal helper function to remove a commonly duplicated idiom. | |
547 | ||
548 | =cut | |
549 | */ | |
550 | ||
551 | void | |
552 | Perl_av_create_and_push(pTHX_ AV **const avp, SV *const val) | |
553 | { | |
7918f24d | 554 | PERL_ARGS_ASSERT_AV_CREATE_AND_PUSH; |
2fed2a1b | 555 | |
29a861e7 NC |
556 | if (!*avp) |
557 | *avp = newAV(); | |
558 | av_push(*avp, val); | |
559 | } | |
560 | ||
561 | /* | |
cb50131a CB |
562 | =for apidoc av_push |
563 | ||
564 | Pushes an SV onto the end of the array. The array will grow automatically | |
4f540dd3 | 565 | to accommodate the addition. This takes ownership of one reference count. |
cb50131a | 566 | |
f0b90de1 SF |
567 | Perl equivalent: C<push @myarray, $elem;>. |
568 | ||
cb50131a CB |
569 | =cut |
570 | */ | |
571 | ||
a0d0e21e | 572 | void |
5aaab254 | 573 | Perl_av_push(pTHX_ AV *av, SV *val) |
93965878 | 574 | { |
27da23d5 | 575 | dVAR; |
93965878 | 576 | MAGIC *mg; |
7918f24d NC |
577 | |
578 | PERL_ARGS_ASSERT_AV_PUSH; | |
2fed2a1b | 579 | assert(SvTYPE(av) == SVt_PVAV); |
ba5d1d60 | 580 | |
93965878 | 581 | if (SvREADONLY(av)) |
cb077ed2 | 582 | Perl_croak_no_modify(); |
93965878 | 583 | |
ad64d0ec | 584 | if ((mg = SvTIED_mg((const SV *)av, PERL_MAGIC_tied))) { |
046b0c7d NC |
585 | Perl_magic_methcall(aTHX_ MUTABLE_SV(av), mg, "PUSH", G_DISCARD, 1, |
586 | val); | |
93965878 NIS |
587 | return; |
588 | } | |
589 | av_store(av,AvFILLp(av)+1,val); | |
79072805 LW |
590 | } |
591 | ||
cb50131a CB |
592 | /* |
593 | =for apidoc av_pop | |
594 | ||
f5d13a25 KW |
595 | Removes one SV from the end of the array, reducing its size by one and |
596 | returning the SV (transferring control of one reference count) to the | |
597 | caller. Returns C<&PL_sv_undef> if the array is empty. | |
cb50131a | 598 | |
f0b90de1 SF |
599 | Perl equivalent: C<pop(@myarray);> |
600 | ||
cb50131a CB |
601 | =cut |
602 | */ | |
603 | ||
79072805 | 604 | SV * |
5aaab254 | 605 | Perl_av_pop(pTHX_ AV *av) |
79072805 | 606 | { |
27da23d5 | 607 | dVAR; |
79072805 | 608 | SV *retval; |
93965878 | 609 | MAGIC* mg; |
79072805 | 610 | |
7918f24d | 611 | PERL_ARGS_ASSERT_AV_POP; |
2fed2a1b | 612 | assert(SvTYPE(av) == SVt_PVAV); |
ba5d1d60 | 613 | |
43fcc5d2 | 614 | if (SvREADONLY(av)) |
cb077ed2 | 615 | Perl_croak_no_modify(); |
ad64d0ec | 616 | if ((mg = SvTIED_mg((const SV *)av, PERL_MAGIC_tied))) { |
046b0c7d | 617 | retval = Perl_magic_methcall(aTHX_ MUTABLE_SV(av), mg, "POP", 0, 0); |
efaf3674 DM |
618 | if (retval) |
619 | retval = newSVsv(retval); | |
93965878 NIS |
620 | return retval; |
621 | } | |
d19c0e07 MJD |
622 | if (AvFILL(av) < 0) |
623 | return &PL_sv_undef; | |
93965878 | 624 | retval = AvARRAY(av)[AvFILLp(av)]; |
3280af22 | 625 | AvARRAY(av)[AvFILLp(av)--] = &PL_sv_undef; |
8990e307 | 626 | if (SvSMAGICAL(av)) |
ad64d0ec | 627 | mg_set(MUTABLE_SV(av)); |
79072805 LW |
628 | return retval; |
629 | } | |
630 | ||
cb50131a | 631 | /* |
29a861e7 NC |
632 | |
633 | =for apidoc av_create_and_unshift_one | |
634 | ||
635 | Unshifts an SV onto the beginning of the array, creating the array if | |
636 | necessary. | |
637 | A small internal helper function to remove a commonly duplicated idiom. | |
638 | ||
639 | =cut | |
640 | */ | |
641 | ||
642 | SV ** | |
643 | Perl_av_create_and_unshift_one(pTHX_ AV **const avp, SV *const val) | |
644 | { | |
7918f24d | 645 | PERL_ARGS_ASSERT_AV_CREATE_AND_UNSHIFT_ONE; |
2fed2a1b | 646 | |
29a861e7 NC |
647 | if (!*avp) |
648 | *avp = newAV(); | |
649 | av_unshift(*avp, 1); | |
650 | return av_store(*avp, 0, val); | |
651 | } | |
652 | ||
653 | /* | |
cb50131a CB |
654 | =for apidoc av_unshift |
655 | ||
656 | Unshift the given number of C<undef> values onto the beginning of the | |
657 | array. The array will grow automatically to accommodate the addition. You | |
658 | must then use C<av_store> to assign values to these new elements. | |
659 | ||
f0b90de1 | 660 | Perl equivalent: C<unshift @myarray, ( (undef) x $n );> |
f703fc96 | 661 | |
cb50131a CB |
662 | =cut |
663 | */ | |
664 | ||
79072805 | 665 | void |
5aaab254 | 666 | Perl_av_unshift(pTHX_ AV *av, I32 num) |
79072805 | 667 | { |
27da23d5 | 668 | dVAR; |
eb578fdb | 669 | I32 i; |
93965878 | 670 | MAGIC* mg; |
79072805 | 671 | |
7918f24d | 672 | PERL_ARGS_ASSERT_AV_UNSHIFT; |
2fed2a1b | 673 | assert(SvTYPE(av) == SVt_PVAV); |
ba5d1d60 | 674 | |
43fcc5d2 | 675 | if (SvREADONLY(av)) |
cb077ed2 | 676 | Perl_croak_no_modify(); |
93965878 | 677 | |
ad64d0ec | 678 | if ((mg = SvTIED_mg((const SV *)av, PERL_MAGIC_tied))) { |
046b0c7d NC |
679 | Perl_magic_methcall(aTHX_ MUTABLE_SV(av), mg, "UNSHIFT", |
680 | G_DISCARD | G_UNDEF_FILL, num); | |
93965878 NIS |
681 | return; |
682 | } | |
683 | ||
d19c0e07 MJD |
684 | if (num <= 0) |
685 | return; | |
49beac48 CS |
686 | if (!AvREAL(av) && AvREIFY(av)) |
687 | av_reify(av); | |
a0d0e21e LW |
688 | i = AvARRAY(av) - AvALLOC(av); |
689 | if (i) { | |
690 | if (i > num) | |
691 | i = num; | |
692 | num -= i; | |
693 | ||
694 | AvMAX(av) += i; | |
93965878 | 695 | AvFILLp(av) += i; |
9c6bc640 | 696 | AvARRAY(av) = AvARRAY(av) - i; |
a0d0e21e | 697 | } |
d2719217 | 698 | if (num) { |
eb578fdb | 699 | SV **ary; |
c86f7df5 | 700 | const I32 i = AvFILLp(av); |
e2b534e7 | 701 | /* Create extra elements */ |
c86f7df5 | 702 | const I32 slide = i > 0 ? i : 0; |
e2b534e7 | 703 | num += slide; |
67a38de0 | 704 | av_extend(av, i + num); |
93965878 | 705 | AvFILLp(av) += num; |
67a38de0 NIS |
706 | ary = AvARRAY(av); |
707 | Move(ary, ary + num, i + 1, SV*); | |
708 | do { | |
3280af22 | 709 | ary[--num] = &PL_sv_undef; |
67a38de0 | 710 | } while (num); |
e2b534e7 BT |
711 | /* Make extra elements into a buffer */ |
712 | AvMAX(av) -= slide; | |
713 | AvFILLp(av) -= slide; | |
9c6bc640 | 714 | AvARRAY(av) = AvARRAY(av) + slide; |
79072805 LW |
715 | } |
716 | } | |
717 | ||
cb50131a CB |
718 | /* |
719 | =for apidoc av_shift | |
720 | ||
4f540dd3 FC |
721 | Shifts an SV off the beginning of the |
722 | array. Returns C<&PL_sv_undef> if the | |
6ae70e43 | 723 | array is empty. |
cb50131a | 724 | |
f0b90de1 SF |
725 | Perl equivalent: C<shift(@myarray);> |
726 | ||
cb50131a CB |
727 | =cut |
728 | */ | |
729 | ||
79072805 | 730 | SV * |
5aaab254 | 731 | Perl_av_shift(pTHX_ AV *av) |
79072805 | 732 | { |
27da23d5 | 733 | dVAR; |
79072805 | 734 | SV *retval; |
93965878 | 735 | MAGIC* mg; |
79072805 | 736 | |
7918f24d | 737 | PERL_ARGS_ASSERT_AV_SHIFT; |
2fed2a1b | 738 | assert(SvTYPE(av) == SVt_PVAV); |
ba5d1d60 | 739 | |
43fcc5d2 | 740 | if (SvREADONLY(av)) |
cb077ed2 | 741 | Perl_croak_no_modify(); |
ad64d0ec | 742 | if ((mg = SvTIED_mg((const SV *)av, PERL_MAGIC_tied))) { |
046b0c7d | 743 | retval = Perl_magic_methcall(aTHX_ MUTABLE_SV(av), mg, "SHIFT", 0, 0); |
efaf3674 DM |
744 | if (retval) |
745 | retval = newSVsv(retval); | |
93965878 NIS |
746 | return retval; |
747 | } | |
d19c0e07 MJD |
748 | if (AvFILL(av) < 0) |
749 | return &PL_sv_undef; | |
463ee0b2 | 750 | retval = *AvARRAY(av); |
a0d0e21e | 751 | if (AvREAL(av)) |
3280af22 | 752 | *AvARRAY(av) = &PL_sv_undef; |
9c6bc640 | 753 | AvARRAY(av) = AvARRAY(av) + 1; |
463ee0b2 | 754 | AvMAX(av)--; |
93965878 | 755 | AvFILLp(av)--; |
8990e307 | 756 | if (SvSMAGICAL(av)) |
ad64d0ec | 757 | mg_set(MUTABLE_SV(av)); |
79072805 LW |
758 | return retval; |
759 | } | |
760 | ||
cb50131a | 761 | /* |
36baafc9 | 762 | =for apidoc av_top |
cb50131a | 763 | |
977a499b | 764 | Returns the highest index in the array. The number of elements in the |
36baafc9 | 765 | array is C<av_top(av) + 1>. Returns -1 if the array is empty. |
cb50131a | 766 | |
a8676f70 SF |
767 | The Perl equivalent for this is C<$#myarray>. |
768 | ||
36baafc9 KW |
769 | =for apidoc av_len |
770 | ||
771 | Same as L</av_top>. Returns the highest index in the array. Note that the | |
772 | return value is +1 what its name implies it returns; and hence differs in | |
773 | meaning from what the similarly named L</sv_len> returns. | |
774 | ||
cb50131a CB |
775 | =cut |
776 | */ | |
777 | ||
79072805 | 778 | I32 |
bb5dd93d | 779 | Perl_av_len(pTHX_ AV *av) |
79072805 | 780 | { |
36baafc9 KW |
781 | /* If change this, must change identical Perl_av_top() just below */ |
782 | ||
7918f24d | 783 | PERL_ARGS_ASSERT_AV_LEN; |
2fed2a1b NC |
784 | assert(SvTYPE(av) == SVt_PVAV); |
785 | ||
463ee0b2 | 786 | return AvFILL(av); |
79072805 LW |
787 | } |
788 | ||
36baafc9 KW |
789 | I32 |
790 | Perl_av_top(pTHX_ AV *av) | |
791 | { | |
792 | /* So short, that it is just a duplicate of Perl_av_len(). Must keep them | |
793 | * in sync */ | |
794 | ||
795 | PERL_ARGS_ASSERT_AV_TOP; | |
796 | assert(SvTYPE(av) == SVt_PVAV); | |
797 | ||
798 | return AvFILL(av); | |
799 | } | |
800 | ||
f3b76584 SC |
801 | /* |
802 | =for apidoc av_fill | |
803 | ||
977a499b | 804 | Set the highest index in the array to the given number, equivalent to |
f3b76584 SC |
805 | Perl's C<$#array = $fill;>. |
806 | ||
977a499b | 807 | The number of elements in the an array will be C<fill + 1> after |
1a3362a5 | 808 | av_fill() returns. If the array was previously shorter, then the |
977a499b GA |
809 | additional elements appended are set to C<PL_sv_undef>. If the array |
810 | was longer, then the excess elements are freed. C<av_fill(av, -1)> is | |
811 | the same as C<av_clear(av)>. | |
812 | ||
f3b76584 SC |
813 | =cut |
814 | */ | |
79072805 | 815 | void |
5aaab254 | 816 | Perl_av_fill(pTHX_ AV *av, I32 fill) |
79072805 | 817 | { |
27da23d5 | 818 | dVAR; |
93965878 | 819 | MAGIC *mg; |
ba5d1d60 | 820 | |
7918f24d | 821 | PERL_ARGS_ASSERT_AV_FILL; |
2fed2a1b | 822 | assert(SvTYPE(av) == SVt_PVAV); |
ba5d1d60 | 823 | |
79072805 LW |
824 | if (fill < 0) |
825 | fill = -1; | |
ad64d0ec | 826 | if ((mg = SvTIED_mg((const SV *)av, PERL_MAGIC_tied))) { |
efaf3674 DM |
827 | SV *arg1 = sv_newmortal(); |
828 | sv_setiv(arg1, (IV)(fill + 1)); | |
046b0c7d NC |
829 | Perl_magic_methcall(aTHX_ MUTABLE_SV(av), mg, "STORESIZE", G_DISCARD, |
830 | 1, arg1); | |
93965878 NIS |
831 | return; |
832 | } | |
463ee0b2 | 833 | if (fill <= AvMAX(av)) { |
93965878 | 834 | I32 key = AvFILLp(av); |
fabdb6c0 | 835 | SV** const ary = AvARRAY(av); |
a0d0e21e LW |
836 | |
837 | if (AvREAL(av)) { | |
838 | while (key > fill) { | |
839 | SvREFCNT_dec(ary[key]); | |
3280af22 | 840 | ary[key--] = &PL_sv_undef; |
a0d0e21e LW |
841 | } |
842 | } | |
843 | else { | |
844 | while (key < fill) | |
3280af22 | 845 | ary[++key] = &PL_sv_undef; |
a0d0e21e LW |
846 | } |
847 | ||
93965878 | 848 | AvFILLp(av) = fill; |
8990e307 | 849 | if (SvSMAGICAL(av)) |
ad64d0ec | 850 | mg_set(MUTABLE_SV(av)); |
463ee0b2 | 851 | } |
a0d0e21e | 852 | else |
3280af22 | 853 | (void)av_store(av,fill,&PL_sv_undef); |
79072805 | 854 | } |
c750a3ec | 855 | |
f3b76584 SC |
856 | /* |
857 | =for apidoc av_delete | |
858 | ||
3025a2e4 CS |
859 | Deletes the element indexed by C<key> from the array, makes the element mortal, |
860 | and returns it. If C<flags> equals C<G_DISCARD>, the element is freed and null | |
861 | is returned. Perl equivalent: C<my $elem = delete($myarray[$idx]);> for the | |
862 | non-C<G_DISCARD> version and a void-context C<delete($myarray[$idx]);> for the | |
863 | C<G_DISCARD> version. | |
f3b76584 SC |
864 | |
865 | =cut | |
866 | */ | |
146174a9 CB |
867 | SV * |
868 | Perl_av_delete(pTHX_ AV *av, I32 key, I32 flags) | |
869 | { | |
97aff369 | 870 | dVAR; |
146174a9 CB |
871 | SV *sv; |
872 | ||
7918f24d | 873 | PERL_ARGS_ASSERT_AV_DELETE; |
2fed2a1b | 874 | assert(SvTYPE(av) == SVt_PVAV); |
ba5d1d60 | 875 | |
146174a9 | 876 | if (SvREADONLY(av)) |
cb077ed2 | 877 | Perl_croak_no_modify(); |
6f12eb6d MJD |
878 | |
879 | if (SvRMAGICAL(av)) { | |
ad64d0ec NC |
880 | const MAGIC * const tied_magic |
881 | = mg_find((const SV *)av, PERL_MAGIC_tied); | |
882 | if ((tied_magic || mg_find((const SV *)av, PERL_MAGIC_regdata))) { | |
35a4481c | 883 | SV **svp; |
6f12eb6d | 884 | if (key < 0) { |
ac9f75b5 | 885 | if (!S_adjust_index(aTHX_ av, tied_magic, &key)) |
fabdb6c0 | 886 | return NULL; |
6f12eb6d MJD |
887 | } |
888 | svp = av_fetch(av, key, TRUE); | |
889 | if (svp) { | |
890 | sv = *svp; | |
891 | mg_clear(sv); | |
892 | if (mg_find(sv, PERL_MAGIC_tiedelem)) { | |
893 | sv_unmagic(sv, PERL_MAGIC_tiedelem); /* No longer an element */ | |
894 | return sv; | |
895 | } | |
fabdb6c0 | 896 | return NULL; |
6f12eb6d MJD |
897 | } |
898 | } | |
899 | } | |
900 | ||
146174a9 CB |
901 | if (key < 0) { |
902 | key += AvFILL(av) + 1; | |
903 | if (key < 0) | |
fabdb6c0 | 904 | return NULL; |
146174a9 | 905 | } |
6f12eb6d | 906 | |
146174a9 | 907 | if (key > AvFILLp(av)) |
fabdb6c0 | 908 | return NULL; |
146174a9 | 909 | else { |
a6214072 DM |
910 | if (!AvREAL(av) && AvREIFY(av)) |
911 | av_reify(av); | |
146174a9 CB |
912 | sv = AvARRAY(av)[key]; |
913 | if (key == AvFILLp(av)) { | |
d9c63288 | 914 | AvARRAY(av)[key] = &PL_sv_undef; |
146174a9 CB |
915 | do { |
916 | AvFILLp(av)--; | |
917 | } while (--key >= 0 && AvARRAY(av)[key] == &PL_sv_undef); | |
918 | } | |
919 | else | |
920 | AvARRAY(av)[key] = &PL_sv_undef; | |
921 | if (SvSMAGICAL(av)) | |
ad64d0ec | 922 | mg_set(MUTABLE_SV(av)); |
146174a9 CB |
923 | } |
924 | if (flags & G_DISCARD) { | |
925 | SvREFCNT_dec(sv); | |
fabdb6c0 | 926 | sv = NULL; |
146174a9 | 927 | } |
fdb3bdd0 | 928 | else if (AvREAL(av)) |
2c8ddff3 | 929 | sv = sv_2mortal(sv); |
146174a9 CB |
930 | return sv; |
931 | } | |
932 | ||
933 | /* | |
f3b76584 SC |
934 | =for apidoc av_exists |
935 | ||
936 | Returns true if the element indexed by C<key> has been initialized. | |
146174a9 | 937 | |
f3b76584 SC |
938 | This relies on the fact that uninitialized array elements are set to |
939 | C<&PL_sv_undef>. | |
940 | ||
b7ff7ff2 SF |
941 | Perl equivalent: C<exists($myarray[$key])>. |
942 | ||
f3b76584 SC |
943 | =cut |
944 | */ | |
146174a9 CB |
945 | bool |
946 | Perl_av_exists(pTHX_ AV *av, I32 key) | |
947 | { | |
97aff369 | 948 | dVAR; |
7918f24d | 949 | PERL_ARGS_ASSERT_AV_EXISTS; |
2fed2a1b | 950 | assert(SvTYPE(av) == SVt_PVAV); |
6f12eb6d MJD |
951 | |
952 | if (SvRMAGICAL(av)) { | |
ad64d0ec NC |
953 | const MAGIC * const tied_magic |
954 | = mg_find((const SV *)av, PERL_MAGIC_tied); | |
54a4274e PM |
955 | const MAGIC * const regdata_magic |
956 | = mg_find((const SV *)av, PERL_MAGIC_regdata); | |
957 | if (tied_magic || regdata_magic) { | |
6f12eb6d MJD |
958 | MAGIC *mg; |
959 | /* Handle negative array indices 20020222 MJD */ | |
960 | if (key < 0) { | |
ac9f75b5 | 961 | if (!S_adjust_index(aTHX_ av, tied_magic, &key)) |
6f12eb6d | 962 | return FALSE; |
6f12eb6d MJD |
963 | } |
964 | ||
54a4274e PM |
965 | if(key >= 0 && regdata_magic) { |
966 | if (key <= AvFILL(av)) | |
967 | return TRUE; | |
968 | else | |
969 | return FALSE; | |
970 | } | |
716ae3b0 DD |
971 | { |
972 | SV * const sv = sv_newmortal(); | |
973 | mg_copy(MUTABLE_SV(av), sv, 0, key); | |
974 | mg = mg_find(sv, PERL_MAGIC_tiedelem); | |
975 | if (mg) { | |
976 | magic_existspack(sv, mg); | |
977 | { | |
978 | I32 retbool = SvTRUE_nomg_NN(sv); | |
979 | return cBOOL(retbool); | |
980 | } | |
981 | } | |
982 | } | |
6f12eb6d MJD |
983 | } |
984 | } | |
985 | ||
146174a9 CB |
986 | if (key < 0) { |
987 | key += AvFILL(av) + 1; | |
988 | if (key < 0) | |
989 | return FALSE; | |
990 | } | |
6f12eb6d | 991 | |
146174a9 CB |
992 | if (key <= AvFILLp(av) && AvARRAY(av)[key] != &PL_sv_undef |
993 | && AvARRAY(av)[key]) | |
994 | { | |
995 | return TRUE; | |
996 | } | |
997 | else | |
998 | return FALSE; | |
999 | } | |
66610fdd | 1000 | |
c33269f7 | 1001 | static MAGIC * |
878d132a | 1002 | S_get_aux_mg(pTHX_ AV *av) { |
a3874608 | 1003 | dVAR; |
ba5d1d60 GA |
1004 | MAGIC *mg; |
1005 | ||
7918f24d | 1006 | PERL_ARGS_ASSERT_GET_AUX_MG; |
2fed2a1b | 1007 | assert(SvTYPE(av) == SVt_PVAV); |
ba5d1d60 | 1008 | |
ad64d0ec | 1009 | mg = mg_find((const SV *)av, PERL_MAGIC_arylen_p); |
a3874608 NC |
1010 | |
1011 | if (!mg) { | |
ad64d0ec NC |
1012 | mg = sv_magicext(MUTABLE_SV(av), 0, PERL_MAGIC_arylen_p, |
1013 | &PL_vtbl_arylen_p, 0, 0); | |
c82c7adc | 1014 | assert(mg); |
a3874608 NC |
1015 | /* sv_magicext won't set this for us because we pass in a NULL obj */ |
1016 | mg->mg_flags |= MGf_REFCOUNTED; | |
1017 | } | |
878d132a NC |
1018 | return mg; |
1019 | } | |
1020 | ||
1021 | SV ** | |
1022 | Perl_av_arylen_p(pTHX_ AV *av) { | |
1023 | MAGIC *const mg = get_aux_mg(av); | |
7918f24d NC |
1024 | |
1025 | PERL_ARGS_ASSERT_AV_ARYLEN_P; | |
2fed2a1b | 1026 | assert(SvTYPE(av) == SVt_PVAV); |
7918f24d | 1027 | |
a3874608 NC |
1028 | return &(mg->mg_obj); |
1029 | } | |
1030 | ||
453d94a9 | 1031 | IV * |
878d132a NC |
1032 | Perl_av_iter_p(pTHX_ AV *av) { |
1033 | MAGIC *const mg = get_aux_mg(av); | |
7918f24d NC |
1034 | |
1035 | PERL_ARGS_ASSERT_AV_ITER_P; | |
2fed2a1b | 1036 | assert(SvTYPE(av) == SVt_PVAV); |
7918f24d | 1037 | |
453d94a9 | 1038 | #if IVSIZE == I32SIZE |
20bff64c | 1039 | return (IV *)&(mg->mg_len); |
453d94a9 NC |
1040 | #else |
1041 | if (!mg->mg_ptr) { | |
156d2b43 | 1042 | IV *temp; |
453d94a9 | 1043 | mg->mg_len = IVSIZE; |
156d2b43 NC |
1044 | Newxz(temp, 1, IV); |
1045 | mg->mg_ptr = (char *) temp; | |
453d94a9 NC |
1046 | } |
1047 | return (IV *)mg->mg_ptr; | |
1048 | #endif | |
878d132a NC |
1049 | } |
1050 | ||
66610fdd RGS |
1051 | /* |
1052 | * Local variables: | |
1053 | * c-indentation-style: bsd | |
1054 | * c-basic-offset: 4 | |
14d04a33 | 1055 | * indent-tabs-mode: nil |
66610fdd RGS |
1056 | * End: |
1057 | * | |
14d04a33 | 1058 | * ex: set ts=8 sts=4 sw=4 et: |
37442d52 | 1059 | */ |