Commit | Line | Data |
---|---|---|
a0d0e21e | 1 | /* hv.c |
79072805 | 2 | * |
e6906430 | 3 | * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, |
f27f8384 | 4 | * 2000, 2001, 2002, 2003, 2004, 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 | /* | |
12 | * "I sit beside the fire and think of all that I have seen." --Bilbo | |
79072805 LW |
13 | */ |
14 | ||
d5afce77 RB |
15 | /* |
16 | =head1 Hash Manipulation Functions | |
17 | */ | |
18 | ||
79072805 | 19 | #include "EXTERN.h" |
864dbfa3 | 20 | #define PERL_IN_HV_C |
7f047bfa | 21 | #define PERL_HASH_INTERNAL_ACCESS |
79072805 LW |
22 | #include "perl.h" |
23 | ||
d9730517 | 24 | #define HV_MAX_LENGTH_BEFORE_SPLIT 14 |
9c87fafe | 25 | |
76e3520e | 26 | STATIC HE* |
cea2e8a9 | 27 | S_new_he(pTHX) |
4633a7c4 LW |
28 | { |
29 | HE* he; | |
333f433b DG |
30 | LOCK_SV_MUTEX; |
31 | if (!PL_he_root) | |
8aacddc1 | 32 | more_he(); |
333f433b DG |
33 | he = PL_he_root; |
34 | PL_he_root = HeNEXT(he); | |
35 | UNLOCK_SV_MUTEX; | |
36 | return he; | |
4633a7c4 LW |
37 | } |
38 | ||
76e3520e | 39 | STATIC void |
cea2e8a9 | 40 | S_del_he(pTHX_ HE *p) |
4633a7c4 | 41 | { |
333f433b | 42 | LOCK_SV_MUTEX; |
3280af22 NIS |
43 | HeNEXT(p) = (HE*)PL_he_root; |
44 | PL_he_root = p; | |
333f433b | 45 | UNLOCK_SV_MUTEX; |
4633a7c4 LW |
46 | } |
47 | ||
333f433b | 48 | STATIC void |
cea2e8a9 | 49 | S_more_he(pTHX) |
4633a7c4 LW |
50 | { |
51 | register HE* he; | |
52 | register HE* heend; | |
612f20c3 GS |
53 | XPV *ptr; |
54 | New(54, ptr, 1008/sizeof(XPV), XPV); | |
55 | ptr->xpv_pv = (char*)PL_he_arenaroot; | |
56 | PL_he_arenaroot = ptr; | |
57 | ||
58 | he = (HE*)ptr; | |
4633a7c4 | 59 | heend = &he[1008 / sizeof(HE) - 1]; |
612f20c3 | 60 | PL_he_root = ++he; |
4633a7c4 | 61 | while (he < heend) { |
8aacddc1 NIS |
62 | HeNEXT(he) = (HE*)(he + 1); |
63 | he++; | |
4633a7c4 | 64 | } |
fde52b5c | 65 | HeNEXT(he) = 0; |
4633a7c4 LW |
66 | } |
67 | ||
d33b2eba GS |
68 | #ifdef PURIFY |
69 | ||
70 | #define new_HE() (HE*)safemalloc(sizeof(HE)) | |
71 | #define del_HE(p) safefree((char*)p) | |
72 | ||
73 | #else | |
74 | ||
75 | #define new_HE() new_he() | |
76 | #define del_HE(p) del_he(p) | |
77 | ||
78 | #endif | |
79 | ||
76e3520e | 80 | STATIC HEK * |
19692e8d | 81 | S_save_hek_flags(pTHX_ const char *str, I32 len, U32 hash, int flags) |
bbce6d69 | 82 | { |
ec15619a | 83 | int flags_masked = flags & HVhek_MASK; |
bbce6d69 | 84 | char *k; |
85 | register HEK *hek; | |
1c846c1f | 86 | |
e05949c7 | 87 | New(54, k, HEK_BASESIZE + len + 2, char); |
bbce6d69 | 88 | hek = (HEK*)k; |
ff68c719 | 89 | Copy(str, HEK_KEY(hek), len, char); |
e05949c7 | 90 | HEK_KEY(hek)[len] = 0; |
ff68c719 | 91 | HEK_LEN(hek) = len; |
92 | HEK_HASH(hek) = hash; | |
ec15619a AE |
93 | HEK_FLAGS(hek) = (unsigned char)flags_masked; |
94 | ||
95 | if (flags & HVhek_FREEKEY) | |
96 | Safefree(str); | |
bbce6d69 | 97 | return hek; |
98 | } | |
99 | ||
73c86719 JH |
100 | /* free the pool of temporary HE/HEK pairs retunrned by hv_fetch_ent |
101 | * for tied hashes */ | |
102 | ||
103 | void | |
104 | Perl_free_tied_hv_pool(pTHX) | |
105 | { | |
106 | HE *ohe; | |
107 | HE *he = PL_hv_fetch_ent_mh; | |
108 | while (he) { | |
109 | Safefree(HeKEY_hek(he)); | |
110 | ohe = he; | |
111 | he = HeNEXT(he); | |
112 | del_HE(ohe); | |
113 | } | |
d5aea225 | 114 | PL_hv_fetch_ent_mh = Nullhe; |
73c86719 JH |
115 | } |
116 | ||
d18c6117 GS |
117 | #if defined(USE_ITHREADS) |
118 | HE * | |
a8fc9800 | 119 | Perl_he_dup(pTHX_ HE *e, bool shared, CLONE_PARAMS* param) |
d18c6117 GS |
120 | { |
121 | HE *ret; | |
122 | ||
123 | if (!e) | |
124 | return Nullhe; | |
7766f137 GS |
125 | /* look for it in the table first */ |
126 | ret = (HE*)ptr_table_fetch(PL_ptr_table, e); | |
127 | if (ret) | |
128 | return ret; | |
129 | ||
130 | /* create anew and remember what it is */ | |
d33b2eba | 131 | ret = new_HE(); |
7766f137 GS |
132 | ptr_table_store(PL_ptr_table, e, ret); |
133 | ||
d2d73c3e | 134 | HeNEXT(ret) = he_dup(HeNEXT(e),shared, param); |
73c86719 JH |
135 | if (HeKLEN(e) == HEf_SVKEY) { |
136 | char *k; | |
137 | New(54, k, HEK_BASESIZE + sizeof(SV*), char); | |
138 | HeKEY_hek(ret) = (HEK*)k; | |
d2d73c3e | 139 | HeKEY_sv(ret) = SvREFCNT_inc(sv_dup(HeKEY_sv(e), param)); |
73c86719 | 140 | } |
d18c6117 | 141 | else if (shared) |
19692e8d NC |
142 | HeKEY_hek(ret) = share_hek_flags(HeKEY(e), HeKLEN(e), HeHASH(e), |
143 | HeKFLAGS(e)); | |
d18c6117 | 144 | else |
19692e8d NC |
145 | HeKEY_hek(ret) = save_hek_flags(HeKEY(e), HeKLEN(e), HeHASH(e), |
146 | HeKFLAGS(e)); | |
d2d73c3e | 147 | HeVAL(ret) = SvREFCNT_inc(sv_dup(HeVAL(e), param)); |
d18c6117 GS |
148 | return ret; |
149 | } | |
150 | #endif /* USE_ITHREADS */ | |
151 | ||
1b1f1335 | 152 | static void |
2393f1b9 JH |
153 | S_hv_notallowed(pTHX_ int flags, const char *key, I32 klen, |
154 | const char *msg) | |
1b1f1335 | 155 | { |
2393f1b9 | 156 | SV *sv = sv_newmortal(), *esv = sv_newmortal(); |
19692e8d | 157 | if (!(flags & HVhek_FREEKEY)) { |
1b1f1335 NIS |
158 | sv_setpvn(sv, key, klen); |
159 | } | |
160 | else { | |
161 | /* Need to free saved eventually assign to mortal SV */ | |
007ab0d8 | 162 | /* XXX is this line an error ???: SV *sv = sv_newmortal(); */ |
1b1f1335 NIS |
163 | sv_usepvn(sv, (char *) key, klen); |
164 | } | |
19692e8d | 165 | if (flags & HVhek_UTF8) { |
1b1f1335 NIS |
166 | SvUTF8_on(sv); |
167 | } | |
2393f1b9 JH |
168 | Perl_sv_setpvf(aTHX_ esv, "Attempt to %s a restricted hash", msg); |
169 | Perl_croak(aTHX_ SvPVX(esv), sv); | |
1b1f1335 NIS |
170 | } |
171 | ||
fde52b5c | 172 | /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot |
173 | * contains an SV* */ | |
174 | ||
a2613b60 NC |
175 | #define HV_FETCH_ISSTORE 0x01 |
176 | #define HV_FETCH_ISEXISTS 0x02 | |
177 | #define HV_FETCH_LVALUE 0x04 | |
178 | #define HV_FETCH_JUST_SV 0x08 | |
d0066dc7 | 179 | |
954c1994 GS |
180 | /* |
181 | =for apidoc hv_store | |
182 | ||
183 | Stores an SV in a hash. The hash key is specified as C<key> and C<klen> is | |
184 | the length of the key. The C<hash> parameter is the precomputed hash | |
185 | value; if it is zero then Perl will compute it. The return value will be | |
186 | NULL if the operation failed or if the value did not need to be actually | |
187 | stored within the hash (as in the case of tied hashes). Otherwise it can | |
188 | be dereferenced to get the original C<SV*>. Note that the caller is | |
189 | responsible for suitably incrementing the reference count of C<val> before | |
b2b6dc3c NC |
190 | the call, and decrementing it if the function returned NULL. Effectively |
191 | a successful hv_store takes ownership of one reference to C<val>. This is | |
192 | usually what you want; a newly created SV has a reference count of one, so | |
193 | if all your code does is create SVs then store them in a hash, hv_store | |
194 | will own the only reference to the new SV, and your code doesn't need to do | |
195 | anything further to tidy up. hv_store is not implemented as a call to | |
196 | hv_store_ent, and does not create a temporary SV for the key, so if your | |
197 | key data is not already in SV form then use hv_store in preference to | |
198 | hv_store_ent. | |
954c1994 | 199 | |
96f1132b | 200 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more |
954c1994 GS |
201 | information on how to use this function on tied hashes. |
202 | ||
203 | =cut | |
204 | */ | |
205 | ||
a2613b60 NC |
206 | SV** |
207 | Perl_hv_store(pTHX_ HV *hv, const char *key, I32 klen_i32, SV *val, U32 hash) | |
208 | { | |
209 | HE *hek; | |
210 | STRLEN klen; | |
211 | int flags; | |
212 | ||
213 | if (klen_i32 < 0) { | |
214 | klen = -klen_i32; | |
215 | flags = HVhek_UTF8; | |
216 | } else { | |
217 | klen = klen_i32; | |
218 | flags = 0; | |
79072805 | 219 | } |
a2613b60 NC |
220 | hek = hv_fetch_common (hv, NULL, key, klen, flags, |
221 | (HV_FETCH_ISSTORE|HV_FETCH_JUST_SV), val, 0); | |
222 | return hek ? &HeVAL(hek) : NULL; | |
223 | } | |
79072805 | 224 | |
a2613b60 NC |
225 | SV** |
226 | Perl_hv_store_flags(pTHX_ HV *hv, const char *key, I32 klen, SV *val, | |
227 | register U32 hash, int flags) | |
228 | { | |
229 | HE *hek = hv_fetch_common (hv, NULL, key, klen, flags, | |
230 | (HV_FETCH_ISSTORE|HV_FETCH_JUST_SV), val, hash); | |
231 | return hek ? &HeVAL(hek) : NULL; | |
fde52b5c | 232 | } |
233 | ||
954c1994 GS |
234 | /* |
235 | =for apidoc hv_store_ent | |
236 | ||
237 | Stores C<val> in a hash. The hash key is specified as C<key>. The C<hash> | |
238 | parameter is the precomputed hash value; if it is zero then Perl will | |
239 | compute it. The return value is the new hash entry so created. It will be | |
240 | NULL if the operation failed or if the value did not need to be actually | |
241 | stored within the hash (as in the case of tied hashes). Otherwise the | |
87324b0f | 242 | contents of the return value can be accessed using the C<He?> macros |
954c1994 GS |
243 | described here. Note that the caller is responsible for suitably |
244 | incrementing the reference count of C<val> before the call, and | |
b2b6dc3c NC |
245 | decrementing it if the function returned NULL. Effectively a successful |
246 | hv_store_ent takes ownership of one reference to C<val>. This is | |
247 | usually what you want; a newly created SV has a reference count of one, so | |
248 | if all your code does is create SVs then store them in a hash, hv_store | |
249 | will own the only reference to the new SV, and your code doesn't need to do | |
250 | anything further to tidy up. Note that hv_store_ent only reads the C<key>; | |
251 | unlike C<val> it does not take ownership of it, so maintaining the correct | |
252 | reference count on C<key> is entirely the caller's responsibility. hv_store | |
253 | is not implemented as a call to hv_store_ent, and does not create a temporary | |
254 | SV for the key, so if your key data is not already in SV form then use | |
255 | hv_store in preference to hv_store_ent. | |
954c1994 | 256 | |
96f1132b | 257 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more |
954c1994 GS |
258 | information on how to use this function on tied hashes. |
259 | ||
260 | =cut | |
261 | */ | |
262 | ||
fde52b5c | 263 | HE * |
19692e8d | 264 | Perl_hv_store_ent(pTHX_ HV *hv, SV *keysv, SV *val, U32 hash) |
fde52b5c | 265 | { |
a2613b60 NC |
266 | return hv_fetch_common(hv, keysv, NULL, 0, 0, HV_FETCH_ISSTORE, val, hash); |
267 | } | |
268 | ||
269 | /* | |
270 | =for apidoc hv_exists | |
271 | ||
272 | Returns a boolean indicating whether the specified hash key exists. The | |
273 | C<klen> is the length of the key. | |
274 | ||
275 | =cut | |
276 | */ | |
277 | ||
278 | bool | |
279 | Perl_hv_exists(pTHX_ HV *hv, const char *key, I32 klen_i32) | |
280 | { | |
281 | STRLEN klen; | |
282 | int flags; | |
283 | ||
284 | if (klen_i32 < 0) { | |
285 | klen = -klen_i32; | |
286 | flags = HVhek_UTF8; | |
287 | } else { | |
288 | klen = klen_i32; | |
289 | flags = 0; | |
290 | } | |
291 | return hv_fetch_common(hv, NULL, key, klen, flags, HV_FETCH_ISEXISTS, 0, 0) | |
292 | ? TRUE : FALSE; | |
293 | } | |
294 | ||
295 | /* | |
296 | =for apidoc hv_fetch | |
297 | ||
298 | Returns the SV which corresponds to the specified key in the hash. The | |
299 | C<klen> is the length of the key. If C<lval> is set then the fetch will be | |
300 | part of a store. Check that the return value is non-null before | |
301 | dereferencing it to an C<SV*>. | |
302 | ||
303 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more | |
304 | information on how to use this function on tied hashes. | |
305 | ||
306 | =cut | |
307 | */ | |
308 | ||
309 | SV** | |
310 | Perl_hv_fetch(pTHX_ HV *hv, const char *key, I32 klen_i32, I32 lval) | |
311 | { | |
312 | HE *hek; | |
fde52b5c | 313 | STRLEN klen; |
a2613b60 NC |
314 | int flags; |
315 | ||
316 | if (klen_i32 < 0) { | |
317 | klen = -klen_i32; | |
318 | flags = HVhek_UTF8; | |
319 | } else { | |
320 | klen = klen_i32; | |
321 | flags = 0; | |
322 | } | |
323 | hek = hv_fetch_common (hv, NULL, key, klen, flags, | |
324 | HV_FETCH_JUST_SV | (lval ? HV_FETCH_LVALUE : 0), | |
325 | Nullsv, 0); | |
326 | return hek ? &HeVAL(hek) : NULL; | |
327 | } | |
328 | ||
329 | /* | |
330 | =for apidoc hv_exists_ent | |
331 | ||
332 | Returns a boolean indicating whether the specified hash key exists. C<hash> | |
333 | can be a valid precomputed hash value, or 0 to ask for it to be | |
334 | computed. | |
335 | ||
336 | =cut | |
337 | */ | |
338 | ||
339 | bool | |
340 | Perl_hv_exists_ent(pTHX_ HV *hv, SV *keysv, U32 hash) | |
341 | { | |
342 | return hv_fetch_common(hv, keysv, NULL, 0, 0, HV_FETCH_ISEXISTS, 0, hash) | |
343 | ? TRUE : FALSE; | |
344 | } | |
345 | ||
346 | /* returns an HE * structure with the all fields set */ | |
347 | /* note that hent_val will be a mortal sv for MAGICAL hashes */ | |
348 | /* | |
349 | =for apidoc hv_fetch_ent | |
350 | ||
351 | Returns the hash entry which corresponds to the specified key in the hash. | |
352 | C<hash> must be a valid precomputed hash number for the given C<key>, or 0 | |
353 | if you want the function to compute it. IF C<lval> is set then the fetch | |
354 | will be part of a store. Make sure the return value is non-null before | |
355 | accessing it. The return value when C<tb> is a tied hash is a pointer to a | |
356 | static location, so be sure to make a copy of the structure if you need to | |
357 | store it somewhere. | |
358 | ||
359 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more | |
360 | information on how to use this function on tied hashes. | |
361 | ||
362 | =cut | |
363 | */ | |
364 | ||
365 | HE * | |
366 | Perl_hv_fetch_ent(pTHX_ HV *hv, SV *keysv, I32 lval, register U32 hash) | |
367 | { | |
368 | return hv_fetch_common(hv, keysv, NULL, 0, 0, | |
369 | (lval ? HV_FETCH_LVALUE : 0), Nullsv, hash); | |
370 | } | |
371 | ||
c17baaa1 | 372 | STATIC HE * |
a2613b60 NC |
373 | S_hv_fetch_common(pTHX_ HV *hv, SV *keysv, const char *key, STRLEN klen, |
374 | int flags, int action, SV *val, register U32 hash) | |
375 | { | |
376 | XPVHV* xhv; | |
9c87fafe | 377 | U32 n_links; |
19692e8d NC |
378 | HE *entry; |
379 | HE **oentry; | |
a2613b60 | 380 | SV *sv; |
da58a35d | 381 | bool is_utf8; |
a2613b60 | 382 | int masked_flags; |
fde52b5c | 383 | |
384 | if (!hv) | |
385 | return 0; | |
386 | ||
a2613b60 | 387 | if (keysv) { |
ec15619a AE |
388 | if (flags & HVhek_FREEKEY) |
389 | Safefree(key); | |
a2613b60 NC |
390 | key = SvPV(keysv, klen); |
391 | flags = 0; | |
392 | is_utf8 = (SvUTF8(keysv) != 0); | |
393 | } else { | |
394 | is_utf8 = ((flags & HVhek_UTF8) ? TRUE : FALSE); | |
395 | } | |
396 | ||
cbec9347 | 397 | xhv = (XPVHV*)SvANY(hv); |
fde52b5c | 398 | if (SvMAGICAL(hv)) { |
a2613b60 NC |
399 | if (SvRMAGICAL(hv) && !(action & (HV_FETCH_ISSTORE|HV_FETCH_ISEXISTS))) |
400 | { | |
401 | if (mg_find((SV*)hv, PERL_MAGIC_tied) || SvGMAGICAL((SV*)hv)) { | |
402 | sv = sv_newmortal(); | |
403 | ||
404 | /* XXX should be able to skimp on the HE/HEK here when | |
405 | HV_FETCH_JUST_SV is true. */ | |
406 | ||
407 | if (!keysv) { | |
408 | keysv = newSVpvn(key, klen); | |
409 | if (is_utf8) { | |
410 | SvUTF8_on(keysv); | |
411 | } | |
412 | } else { | |
413 | keysv = newSVsv(keysv); | |
414 | } | |
415 | mg_copy((SV*)hv, sv, (char *)keysv, HEf_SVKEY); | |
416 | ||
417 | /* grab a fake HE/HEK pair from the pool or make a new one */ | |
418 | entry = PL_hv_fetch_ent_mh; | |
419 | if (entry) | |
420 | PL_hv_fetch_ent_mh = HeNEXT(entry); | |
421 | else { | |
422 | char *k; | |
423 | entry = new_HE(); | |
424 | New(54, k, HEK_BASESIZE + sizeof(SV*), char); | |
425 | HeKEY_hek(entry) = (HEK*)k; | |
426 | } | |
427 | HeNEXT(entry) = Nullhe; | |
428 | HeSVKEY_set(entry, keysv); | |
429 | HeVAL(entry) = sv; | |
430 | sv_upgrade(sv, SVt_PVLV); | |
431 | LvTYPE(sv) = 'T'; | |
432 | /* so we can free entry when freeing sv */ | |
433 | LvTARG(sv) = (SV*)entry; | |
434 | ||
435 | /* XXX remove at some point? */ | |
436 | if (flags & HVhek_FREEKEY) | |
437 | Safefree(key); | |
438 | ||
439 | return entry; | |
440 | } | |
902173a3 | 441 | #ifdef ENV_IS_CASELESS |
14befaf4 | 442 | else if (mg_find((SV*)hv, PERL_MAGIC_env)) { |
a2613b60 NC |
443 | U32 i; |
444 | for (i = 0; i < klen; ++i) | |
445 | if (isLOWER(key[i])) { | |
ec15619a AE |
446 | /* Would be nice if we had a routine to do the |
447 | copy and upercase in a single pass through. */ | |
448 | char *nkey = strupr(savepvn(key,klen)); | |
449 | /* Note that this fetch is for nkey (the uppercased | |
450 | key) whereas the store is for key (the original) */ | |
451 | entry = hv_fetch_common(hv, Nullsv, nkey, klen, | |
452 | HVhek_FREEKEY, /* free nkey */ | |
453 | 0 /* non-LVAL fetch */, | |
454 | Nullsv /* no value */, | |
455 | 0 /* compute hash */); | |
456 | if (!entry && (action & HV_FETCH_LVALUE)) { | |
457 | /* This call will free key if necessary. | |
458 | Do it this way to encourage compiler to tail | |
459 | call optimise. */ | |
460 | entry = hv_fetch_common(hv, keysv, key, klen, | |
461 | flags, HV_FETCH_ISSTORE, | |
462 | NEWSV(61,0), hash); | |
463 | } else { | |
464 | if (flags & HVhek_FREEKEY) | |
465 | Safefree(key); | |
466 | } | |
467 | return entry; | |
a2613b60 NC |
468 | } |
469 | } | |
470 | #endif | |
471 | } /* ISFETCH */ | |
472 | else if (SvRMAGICAL(hv) && (action & HV_FETCH_ISEXISTS)) { | |
473 | if (mg_find((SV*)hv, PERL_MAGIC_tied) || SvGMAGICAL((SV*)hv)) { | |
474 | SV* svret; | |
475 | /* I don't understand why hv_exists_ent has svret and sv, | |
476 | whereas hv_exists only had one. */ | |
477 | svret = sv_newmortal(); | |
478 | sv = sv_newmortal(); | |
479 | ||
480 | if (keysv || is_utf8) { | |
481 | if (!keysv) { | |
482 | keysv = newSVpvn(key, klen); | |
483 | SvUTF8_on(keysv); | |
484 | } else { | |
485 | keysv = newSVsv(keysv); | |
486 | } | |
487 | mg_copy((SV*)hv, sv, (char *)sv_2mortal(keysv), HEf_SVKEY); | |
488 | } else { | |
489 | mg_copy((SV*)hv, sv, key, klen); | |
490 | } | |
491 | if (flags & HVhek_FREEKEY) | |
492 | Safefree(key); | |
493 | magic_existspack(svret, mg_find(sv, PERL_MAGIC_tiedelem)); | |
494 | /* This cast somewhat evil, but I'm merely using NULL/ | |
495 | not NULL to return the boolean exists. | |
496 | And I know hv is not NULL. */ | |
497 | return SvTRUE(svret) ? (HE *)hv : NULL; | |
498 | } | |
499 | #ifdef ENV_IS_CASELESS | |
500 | else if (mg_find((SV*)hv, PERL_MAGIC_env)) { | |
501 | /* XXX This code isn't UTF8 clean. */ | |
502 | const char *keysave = key; | |
503 | /* Will need to free this, so set FREEKEY flag. */ | |
504 | key = savepvn(key,klen); | |
505 | key = (const char*)strupr((char*)key); | |
506 | is_utf8 = 0; | |
902173a3 | 507 | hash = 0; |
a2613b60 NC |
508 | |
509 | if (flags & HVhek_FREEKEY) { | |
510 | Safefree(keysave); | |
511 | } | |
512 | flags |= HVhek_FREEKEY; | |
902173a3 GS |
513 | } |
514 | #endif | |
a2613b60 NC |
515 | } /* ISEXISTS */ |
516 | else if (action & HV_FETCH_ISSTORE) { | |
517 | bool needs_copy; | |
518 | bool needs_store; | |
519 | hv_magic_check (hv, &needs_copy, &needs_store); | |
520 | if (needs_copy) { | |
521 | bool save_taint = PL_tainted; | |
522 | if (keysv || is_utf8) { | |
523 | if (!keysv) { | |
524 | keysv = newSVpvn(key, klen); | |
525 | SvUTF8_on(keysv); | |
526 | } | |
527 | if (PL_tainting) | |
528 | PL_tainted = SvTAINTED(keysv); | |
529 | keysv = sv_2mortal(newSVsv(keysv)); | |
530 | mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY); | |
531 | } else { | |
532 | mg_copy((SV*)hv, val, key, klen); | |
533 | } | |
534 | ||
535 | TAINT_IF(save_taint); | |
536 | if (!xhv->xhv_array /* !HvARRAY(hv) */ && !needs_store) { | |
537 | if (flags & HVhek_FREEKEY) | |
538 | Safefree(key); | |
539 | return Nullhe; | |
540 | } | |
541 | #ifdef ENV_IS_CASELESS | |
542 | else if (mg_find((SV*)hv, PERL_MAGIC_env)) { | |
543 | /* XXX This code isn't UTF8 clean. */ | |
544 | const char *keysave = key; | |
545 | /* Will need to free this, so set FREEKEY flag. */ | |
546 | key = savepvn(key,klen); | |
547 | key = (const char*)strupr((char*)key); | |
548 | is_utf8 = 0; | |
549 | hash = 0; | |
550 | ||
551 | if (flags & HVhek_FREEKEY) { | |
552 | Safefree(keysave); | |
553 | } | |
554 | flags |= HVhek_FREEKEY; | |
555 | } | |
556 | #endif | |
557 | } | |
558 | } /* ISSTORE */ | |
559 | } /* SvMAGICAL */ | |
560 | ||
561 | if (!xhv->xhv_array /* !HvARRAY(hv) */) { | |
562 | if ((action & (HV_FETCH_LVALUE | HV_FETCH_ISSTORE)) | |
563 | #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */ | |
564 | || (SvRMAGICAL((SV*)hv) && mg_find((SV*)hv, PERL_MAGIC_env)) | |
565 | #endif | |
566 | ) | |
567 | Newz(503, xhv->xhv_array /* HvARRAY(hv) */, | |
568 | PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max+1 /* HvMAX(hv)+1 */), | |
569 | char); | |
570 | #ifdef DYNAMIC_ENV_FETCH | |
571 | else if (action & HV_FETCH_ISEXISTS) { | |
572 | /* for an %ENV exists, if we do an insert it's by a recursive | |
573 | store call, so avoid creating HvARRAY(hv) right now. */ | |
902173a3 | 574 | } |
a2613b60 NC |
575 | #endif |
576 | else { | |
577 | /* XXX remove at some point? */ | |
578 | if (flags & HVhek_FREEKEY) | |
579 | Safefree(key); | |
fde52b5c | 580 | |
a2613b60 NC |
581 | return 0; |
582 | } | |
583 | } | |
902173a3 | 584 | |
574c8022 | 585 | if (is_utf8) { |
a2613b60 | 586 | const char *keysave = key; |
f9a63242 | 587 | key = (char*)bytes_from_utf8((U8*)key, &klen, &is_utf8); |
19692e8d | 588 | if (is_utf8) |
a2613b60 NC |
589 | flags |= HVhek_UTF8; |
590 | else | |
591 | flags &= ~HVhek_UTF8; | |
592 | if (key != keysave) { | |
593 | if (flags & HVhek_FREEKEY) | |
594 | Safefree(keysave); | |
19692e8d | 595 | flags |= HVhek_WASUTF8 | HVhek_FREEKEY; |
a2613b60 | 596 | } |
574c8022 | 597 | } |
f9a63242 | 598 | |
ff38041c | 599 | if (HvREHASH(hv)) { |
a2613b60 | 600 | PERL_HASH_INTERNAL(hash, key, klen); |
ff38041c NC |
601 | /* We don't have a pointer to the hv, so we have to replicate the |
602 | flag into every HEK, so that hv_iterkeysv can see it. */ | |
a2613b60 NC |
603 | /* And yes, you do need this even though you are not "storing" because |
604 | you can flip the flags below if doing an lval lookup. (And that | |
605 | was put in to give the semantics Andreas was expecting.) */ | |
ff38041c | 606 | flags |= HVhek_REHASH; |
ff38041c | 607 | } else if (!hash) { |
baf09282 NC |
608 | /* Not enough shared hash key scalars around to make this worthwhile |
609 | (about 4% slowdown in perlbench with this in) | |
a2613b60 NC |
610 | if (keysv && (SvIsCOW_shared_hash(keysv))) { |
611 | hash = SvUVX(keysv); | |
baf09282 NC |
612 | } else |
613 | */ | |
614 | { | |
a2613b60 NC |
615 | PERL_HASH(hash, key, klen); |
616 | } | |
ff38041c | 617 | } |
fde52b5c | 618 | |
a2613b60 | 619 | masked_flags = (flags & HVhek_MASK); |
9c87fafe | 620 | n_links = 0; |
a2613b60 NC |
621 | |
622 | #ifdef DYNAMIC_ENV_FETCH | |
623 | if (!xhv->xhv_array /* !HvARRAY(hv) */) entry = Null(HE*); | |
624 | else | |
625 | #endif | |
626 | { | |
627 | /* entry = (HvARRAY(hv))[hash & (I32) HvMAX(hv)]; */ | |
628 | entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; | |
629 | } | |
9c87fafe | 630 | for (; entry; ++n_links, entry = HeNEXT(entry)) { |
fde52b5c | 631 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
79072805 | 632 | continue; |
eb160463 | 633 | if (HeKLEN(entry) != (I32)klen) |
79072805 | 634 | continue; |
1c846c1f | 635 | if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */ |
79072805 | 636 | continue; |
a2613b60 | 637 | if ((HeKFLAGS(entry) ^ masked_flags) & HVhek_UTF8) |
c3654f1a | 638 | continue; |
a2613b60 NC |
639 | |
640 | if (action & (HV_FETCH_LVALUE|HV_FETCH_ISSTORE)) { | |
641 | if (HeKFLAGS(entry) != masked_flags) { | |
642 | /* We match if HVhek_UTF8 bit in our flags and hash key's | |
643 | match. But if entry was set previously with HVhek_WASUTF8 | |
644 | and key now doesn't (or vice versa) then we should change | |
645 | the key's flag, as this is assignment. */ | |
646 | if (HvSHAREKEYS(hv)) { | |
647 | /* Need to swap the key we have for a key with the flags we | |
648 | need. As keys are shared we can't just write to the | |
649 | flag, so we share the new one, unshare the old one. */ | |
650 | HEK *new_hek = share_hek_flags(key, klen, hash, | |
651 | masked_flags); | |
652 | unshare_hek (HeKEY_hek(entry)); | |
653 | HeKEY_hek(entry) = new_hek; | |
654 | } | |
655 | else | |
656 | HeKFLAGS(entry) = masked_flags; | |
657 | if (masked_flags & HVhek_ENABLEHVKFLAGS) | |
658 | HvHASKFLAGS_on(hv); | |
659 | } | |
660 | if (HeVAL(entry) == &PL_sv_placeholder) { | |
661 | /* yes, can store into placeholder slot */ | |
662 | if (action & HV_FETCH_LVALUE) { | |
663 | if (SvMAGICAL(hv)) { | |
664 | /* This preserves behaviour with the old hv_fetch | |
665 | implementation which at this point would bail out | |
666 | with a break; (at "if we find a placeholder, we | |
667 | pretend we haven't found anything") | |
668 | ||
669 | That break mean that if a placeholder were found, it | |
670 | caused a call into hv_store, which in turn would | |
671 | check magic, and if there is no magic end up pretty | |
672 | much back at this point (in hv_store's code). */ | |
673 | break; | |
674 | } | |
675 | /* LVAL fetch which actaully needs a store. */ | |
676 | val = NEWSV(61,0); | |
677 | xhv->xhv_placeholders--; | |
678 | } else { | |
679 | /* store */ | |
680 | if (val != &PL_sv_placeholder) | |
681 | xhv->xhv_placeholders--; | |
682 | } | |
683 | HeVAL(entry) = val; | |
684 | } else if (action & HV_FETCH_ISSTORE) { | |
685 | SvREFCNT_dec(HeVAL(entry)); | |
686 | HeVAL(entry) = val; | |
687 | } | |
688 | } else if (HeVAL(entry) == &PL_sv_placeholder) { | |
689 | /* if we find a placeholder, we pretend we haven't found | |
690 | anything */ | |
691 | break; | |
692 | } | |
693 | if (flags & HVhek_FREEKEY) | |
f9a63242 | 694 | Safefree(key); |
fde52b5c | 695 | return entry; |
79072805 | 696 | } |
a2613b60 NC |
697 | #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */ |
698 | if (!(action & HV_FETCH_ISSTORE) | |
699 | && SvRMAGICAL((SV*)hv) && mg_find((SV*)hv, PERL_MAGIC_env)) { | |
700 | unsigned long len; | |
701 | char *env = PerlEnv_ENVgetenv_len(key,&len); | |
702 | if (env) { | |
703 | sv = newSVpvn(env,len); | |
704 | SvTAINTED_on(sv); | |
705 | return hv_fetch_common(hv,keysv,key,klen,flags,HV_FETCH_ISSTORE,sv, | |
706 | hash); | |
707 | } | |
708 | } | |
709 | #endif | |
79072805 | 710 | |
a2613b60 | 711 | if (!entry && SvREADONLY(hv) && !(action & HV_FETCH_ISEXISTS)) { |
2393f1b9 | 712 | S_hv_notallowed(aTHX_ flags, key, klen, |
a2613b60 | 713 | "access disallowed key '%"SVf"' in" |
2393f1b9 | 714 | ); |
1b1f1335 | 715 | } |
a2613b60 NC |
716 | if (!(action & (HV_FETCH_LVALUE|HV_FETCH_ISSTORE))) { |
717 | /* Not doing some form of store, so return failure. */ | |
718 | if (flags & HVhek_FREEKEY) | |
719 | Safefree(key); | |
720 | return 0; | |
721 | } | |
722 | if (action & HV_FETCH_LVALUE) { | |
723 | val = NEWSV(61,0); | |
724 | if (SvMAGICAL(hv)) { | |
725 | /* At this point the old hv_fetch code would call to hv_store, | |
726 | which in turn might do some tied magic. So we need to make that | |
727 | magic check happen. */ | |
728 | /* gonna assign to this, so it better be there */ | |
729 | return hv_fetch_common(hv, keysv, key, klen, flags, | |
730 | HV_FETCH_ISSTORE, val, hash); | |
731 | /* XXX Surely that could leak if the fetch-was-store fails? | |
732 | Just like the hv_fetch. */ | |
733 | } | |
734 | } | |
735 | ||
736 | /* Welcome to hv_store... */ | |
737 | ||
738 | if (!xhv->xhv_array) { | |
739 | /* Not sure if we can get here. I think the only case of oentry being | |
740 | NULL is for %ENV with dynamic env fetch. But that should disappear | |
741 | with magic in the previous code. */ | |
742 | Newz(503, xhv->xhv_array /* HvARRAY(hv) */, | |
743 | PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max+1 /* HvMAX(hv)+1 */), | |
744 | char); | |
745 | } | |
746 | ||
747 | oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; | |
1b1f1335 | 748 | |
d33b2eba | 749 | entry = new_HE(); |
19692e8d NC |
750 | /* share_hek_flags will do the free for us. This might be considered |
751 | bad API design. */ | |
fde52b5c | 752 | if (HvSHAREKEYS(hv)) |
19692e8d | 753 | HeKEY_hek(entry) = share_hek_flags(key, klen, hash, flags); |
fde52b5c | 754 | else /* gotta do the real thing */ |
19692e8d | 755 | HeKEY_hek(entry) = save_hek_flags(key, klen, hash, flags); |
fde52b5c | 756 | HeVAL(entry) = val; |
fde52b5c | 757 | HeNEXT(entry) = *oentry; |
79072805 LW |
758 | *oentry = entry; |
759 | ||
a2613b60 NC |
760 | if (val == &PL_sv_placeholder) |
761 | xhv->xhv_placeholders++; | |
762 | if (masked_flags & HVhek_ENABLEHVKFLAGS) | |
763 | HvHASKFLAGS_on(hv); | |
764 | ||
cbec9347 | 765 | xhv->xhv_keys++; /* HvKEYS(hv)++ */ |
9c87fafe | 766 | if (!n_links) { /* initial entry? */ |
cbec9347 | 767 | xhv->xhv_fill++; /* HvFILL(hv)++ */ |
9c87fafe NC |
768 | } else if ((xhv->xhv_keys > (IV)xhv->xhv_max) |
769 | || ((n_links > HV_MAX_LENGTH_BEFORE_SPLIT) && !HvREHASH(hv))) { | |
770 | /* Use only the old HvKEYS(hv) > HvMAX(hv) condition to limit bucket | |
771 | splits on a rehashed hash, as we're not going to split it again, | |
772 | and if someone is lucky (evil) enough to get all the keys in one | |
773 | list they could exhaust our memory as we repeatedly double the | |
774 | number of buckets on every entry. Linear search feels a less worse | |
775 | thing to do. */ | |
776 | hsplit(hv); | |
79072805 | 777 | } |
79072805 | 778 | |
fde52b5c | 779 | return entry; |
79072805 LW |
780 | } |
781 | ||
a2613b60 NC |
782 | STATIC void |
783 | S_hv_magic_check(pTHX_ HV *hv, bool *needs_copy, bool *needs_store) | |
79072805 | 784 | { |
a2613b60 NC |
785 | MAGIC *mg = SvMAGIC(hv); |
786 | *needs_copy = FALSE; | |
787 | *needs_store = TRUE; | |
788 | while (mg) { | |
789 | if (isUPPER(mg->mg_type)) { | |
790 | *needs_copy = TRUE; | |
791 | switch (mg->mg_type) { | |
792 | case PERL_MAGIC_tied: | |
793 | case PERL_MAGIC_sig: | |
794 | *needs_store = FALSE; | |
2fd1c6b8 | 795 | } |
8aacddc1 | 796 | } |
a2613b60 | 797 | mg = mg->mg_moremagic; |
463ee0b2 | 798 | } |
a2613b60 | 799 | } |
fde52b5c | 800 | |
a2613b60 | 801 | /* |
59679316 TP |
802 | =for apidoc hv_scalar |
803 | ||
804 | Evaluates the hash in scalar context and returns the result. Handles magic when the hash is tied. | |
805 | ||
806 | =cut | |
807 | */ | |
808 | ||
809 | SV * | |
810 | Perl_hv_scalar(pTHX_ HV *hv) | |
811 | { | |
812 | MAGIC *mg; | |
813 | SV *sv; | |
814 | ||
815 | if ((SvRMAGICAL(hv) && (mg = mg_find((SV*)hv, PERL_MAGIC_tied)))) { | |
816 | sv = magic_scalarpack(hv, mg); | |
817 | return sv; | |
818 | } | |
819 | ||
820 | sv = sv_newmortal(); | |
821 | if (HvFILL((HV*)hv)) | |
822 | Perl_sv_setpvf(aTHX_ sv, "%ld/%ld", | |
823 | (long)HvFILL(hv), (long)HvMAX(hv) + 1); | |
824 | else | |
825 | sv_setiv(sv, 0); | |
826 | ||
827 | return sv; | |
828 | } | |
829 | ||
830 | /* | |
a2613b60 | 831 | =for apidoc hv_delete |
f9a63242 | 832 | |
a2613b60 NC |
833 | Deletes a key/value pair in the hash. The value SV is removed from the |
834 | hash and returned to the caller. The C<klen> is the length of the key. | |
835 | The C<flags> value will normally be zero; if set to G_DISCARD then NULL | |
836 | will be returned. | |
79072805 | 837 | |
a2613b60 NC |
838 | =cut |
839 | */ | |
8aacddc1 | 840 | |
a2613b60 NC |
841 | SV * |
842 | Perl_hv_delete(pTHX_ HV *hv, const char *key, I32 klen_i32, I32 flags) | |
843 | { | |
844 | STRLEN klen; | |
845 | int k_flags = 0; | |
8aacddc1 | 846 | |
a2613b60 NC |
847 | if (klen_i32 < 0) { |
848 | klen = -klen_i32; | |
849 | k_flags |= HVhek_UTF8; | |
850 | } else { | |
851 | klen = klen_i32; | |
8aacddc1 | 852 | } |
a2613b60 | 853 | return hv_delete_common(hv, NULL, key, klen, k_flags, flags, 0); |
fde52b5c | 854 | } |
855 | ||
954c1994 GS |
856 | /* |
857 | =for apidoc hv_delete_ent | |
858 | ||
859 | Deletes a key/value pair in the hash. The value SV is removed from the | |
860 | hash and returned to the caller. The C<flags> value will normally be zero; | |
861 | if set to G_DISCARD then NULL will be returned. C<hash> can be a valid | |
862 | precomputed hash value, or 0 to ask for it to be computed. | |
863 | ||
864 | =cut | |
865 | */ | |
866 | ||
fde52b5c | 867 | SV * |
864dbfa3 | 868 | Perl_hv_delete_ent(pTHX_ HV *hv, SV *keysv, I32 flags, U32 hash) |
fde52b5c | 869 | { |
a2613b60 NC |
870 | return hv_delete_common(hv, keysv, NULL, 0, 0, flags, hash); |
871 | } | |
872 | ||
c17baaa1 | 873 | STATIC SV * |
a2613b60 NC |
874 | S_hv_delete_common(pTHX_ HV *hv, SV *keysv, const char *key, STRLEN klen, |
875 | int k_flags, I32 d_flags, U32 hash) | |
876 | { | |
cbec9347 | 877 | register XPVHV* xhv; |
fde52b5c | 878 | register I32 i; |
fde52b5c | 879 | register HE *entry; |
880 | register HE **oentry; | |
881 | SV *sv; | |
da58a35d | 882 | bool is_utf8; |
a2613b60 | 883 | int masked_flags; |
1c846c1f | 884 | |
fde52b5c | 885 | if (!hv) |
886 | return Nullsv; | |
a2613b60 NC |
887 | |
888 | if (keysv) { | |
ec15619a AE |
889 | if (k_flags & HVhek_FREEKEY) |
890 | Safefree(key); | |
a2613b60 NC |
891 | key = SvPV(keysv, klen); |
892 | k_flags = 0; | |
893 | is_utf8 = (SvUTF8(keysv) != 0); | |
894 | } else { | |
895 | is_utf8 = ((k_flags & HVhek_UTF8) ? TRUE : FALSE); | |
896 | } | |
897 | ||
fde52b5c | 898 | if (SvRMAGICAL(hv)) { |
0a0bb7c7 OT |
899 | bool needs_copy; |
900 | bool needs_store; | |
901 | hv_magic_check (hv, &needs_copy, &needs_store); | |
902 | ||
a2613b60 NC |
903 | if (needs_copy) { |
904 | entry = hv_fetch_common(hv, keysv, key, klen, | |
905 | k_flags & ~HVhek_FREEKEY, HV_FETCH_LVALUE, | |
906 | Nullsv, hash); | |
907 | sv = entry ? HeVAL(entry) : NULL; | |
908 | if (sv) { | |
909 | if (SvMAGICAL(sv)) { | |
910 | mg_clear(sv); | |
911 | } | |
912 | if (!needs_store) { | |
913 | if (mg_find(sv, PERL_MAGIC_tiedelem)) { | |
914 | /* No longer an element */ | |
915 | sv_unmagic(sv, PERL_MAGIC_tiedelem); | |
916 | return sv; | |
917 | } | |
918 | return Nullsv; /* element cannot be deleted */ | |
919 | } | |
902173a3 | 920 | #ifdef ENV_IS_CASELESS |
ec15619a AE |
921 | else if (mg_find((SV*)hv, PERL_MAGIC_env)) { |
922 | /* XXX This code isn't UTF8 clean. */ | |
923 | keysv = sv_2mortal(newSVpvn(key,klen)); | |
924 | if (k_flags & HVhek_FREEKEY) { | |
925 | Safefree(key); | |
926 | } | |
927 | key = strupr(SvPVX(keysv)); | |
928 | is_utf8 = 0; | |
929 | k_flags = 0; | |
930 | hash = 0; | |
a2613b60 | 931 | } |
4db40f21 | 932 | #endif |
2fd1c6b8 | 933 | } |
2fd1c6b8 | 934 | } |
fde52b5c | 935 | } |
cbec9347 JH |
936 | xhv = (XPVHV*)SvANY(hv); |
937 | if (!xhv->xhv_array /* !HvARRAY(hv) */) | |
fde52b5c | 938 | return Nullsv; |
939 | ||
19692e8d | 940 | if (is_utf8) { |
a2613b60 NC |
941 | const char *keysave = key; |
942 | key = (char*)bytes_from_utf8((U8*)key, &klen, &is_utf8); | |
943 | ||
19692e8d | 944 | if (is_utf8) |
a2613b60 NC |
945 | k_flags |= HVhek_UTF8; |
946 | else | |
947 | k_flags &= ~HVhek_UTF8; | |
948 | if (key != keysave) { | |
949 | if (k_flags & HVhek_FREEKEY) { | |
950 | /* This shouldn't happen if our caller does what we expect, | |
951 | but strictly the API allows it. */ | |
952 | Safefree(keysave); | |
953 | } | |
954 | k_flags |= HVhek_WASUTF8 | HVhek_FREEKEY; | |
955 | } | |
956 | HvHASKFLAGS_on((SV*)hv); | |
19692e8d | 957 | } |
f9a63242 | 958 | |
ff38041c NC |
959 | if (HvREHASH(hv)) { |
960 | PERL_HASH_INTERNAL(hash, key, klen); | |
961 | } else if (!hash) { | |
baf09282 NC |
962 | /* Not enough shared hash key scalars around to make this worthwhile |
963 | (about 4% slowdown in perlbench with this in) | |
a2613b60 NC |
964 | if (keysv && (SvIsCOW_shared_hash(keysv))) { |
965 | hash = SvUVX(keysv); | |
baf09282 NC |
966 | } else |
967 | */ | |
968 | { | |
a2613b60 NC |
969 | PERL_HASH(hash, key, klen); |
970 | } | |
ff38041c | 971 | } |
fde52b5c | 972 | |
a2613b60 NC |
973 | masked_flags = (k_flags & HVhek_MASK); |
974 | ||
cbec9347 JH |
975 | /* oentry = &(HvARRAY(hv))[hash & (I32) HvMAX(hv)]; */ |
976 | oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; | |
fde52b5c | 977 | entry = *oentry; |
978 | i = 1; | |
979 | for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) { | |
980 | if (HeHASH(entry) != hash) /* strings can't be equal */ | |
981 | continue; | |
eb160463 | 982 | if (HeKLEN(entry) != (I32)klen) |
fde52b5c | 983 | continue; |
1c846c1f | 984 | if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */ |
fde52b5c | 985 | continue; |
a2613b60 | 986 | if ((HeKFLAGS(entry) ^ masked_flags) & HVhek_UTF8) |
c3654f1a | 987 | continue; |
8aacddc1 NIS |
988 | |
989 | /* if placeholder is here, it's already been deleted.... */ | |
42272d83 | 990 | if (HeVAL(entry) == &PL_sv_placeholder) |
8aacddc1 | 991 | { |
59e7bac0 HS |
992 | if (k_flags & HVhek_FREEKEY) |
993 | Safefree(key); | |
994 | return Nullsv; | |
8aacddc1 NIS |
995 | } |
996 | else if (SvREADONLY(hv) && HeVAL(entry) && SvREADONLY(HeVAL(entry))) { | |
2393f1b9 JH |
997 | S_hv_notallowed(aTHX_ k_flags, key, klen, |
998 | "delete readonly key '%"SVf"' from" | |
999 | ); | |
8aacddc1 | 1000 | } |
59e7bac0 HS |
1001 | if (k_flags & HVhek_FREEKEY) |
1002 | Safefree(key); | |
8aacddc1 | 1003 | |
a2613b60 | 1004 | if (d_flags & G_DISCARD) |
fde52b5c | 1005 | sv = Nullsv; |
94f7643d | 1006 | else { |
79d01fbf | 1007 | sv = sv_2mortal(HeVAL(entry)); |
42272d83 | 1008 | HeVAL(entry) = &PL_sv_placeholder; |
94f7643d | 1009 | } |
8aacddc1 NIS |
1010 | |
1011 | /* | |
1012 | * If a restricted hash, rather than really deleting the entry, put | |
1013 | * a placeholder there. This marks the key as being "approved", so | |
1014 | * we can still access via not-really-existing key without raising | |
1015 | * an error. | |
1016 | */ | |
1017 | if (SvREADONLY(hv)) { | |
e266888e | 1018 | SvREFCNT_dec(HeVAL(entry)); |
42272d83 | 1019 | HeVAL(entry) = &PL_sv_placeholder; |
8aacddc1 NIS |
1020 | /* We'll be saving this slot, so the number of allocated keys |
1021 | * doesn't go down, but the number placeholders goes up */ | |
1022 | xhv->xhv_placeholders++; /* HvPLACEHOLDERS(hv)++ */ | |
1023 | } else { | |
a26e96df NIS |
1024 | *oentry = HeNEXT(entry); |
1025 | if (i && !*oentry) | |
1026 | xhv->xhv_fill--; /* HvFILL(hv)-- */ | |
8aacddc1 NIS |
1027 | if (entry == xhv->xhv_eiter /* HvEITER(hv) */) |
1028 | HvLAZYDEL_on(hv); | |
1029 | else | |
1030 | hv_free_ent(hv, entry); | |
1031 | xhv->xhv_keys--; /* HvKEYS(hv)-- */ | |
574c8022 | 1032 | if (xhv->xhv_keys == 0) |
19692e8d | 1033 | HvHASKFLAGS_off(hv); |
8aacddc1 | 1034 | } |
79072805 LW |
1035 | return sv; |
1036 | } | |
8aacddc1 | 1037 | if (SvREADONLY(hv)) { |
2393f1b9 JH |
1038 | S_hv_notallowed(aTHX_ k_flags, key, klen, |
1039 | "delete disallowed key '%"SVf"' from" | |
1040 | ); | |
8aacddc1 NIS |
1041 | } |
1042 | ||
19692e8d | 1043 | if (k_flags & HVhek_FREEKEY) |
f9a63242 | 1044 | Safefree(key); |
79072805 | 1045 | return Nullsv; |
79072805 LW |
1046 | } |
1047 | ||
76e3520e | 1048 | STATIC void |
cea2e8a9 | 1049 | S_hsplit(pTHX_ HV *hv) |
79072805 | 1050 | { |
cbec9347 JH |
1051 | register XPVHV* xhv = (XPVHV*)SvANY(hv); |
1052 | I32 oldsize = (I32) xhv->xhv_max+1; /* HvMAX(hv)+1 (sick) */ | |
79072805 LW |
1053 | register I32 newsize = oldsize * 2; |
1054 | register I32 i; | |
cbec9347 | 1055 | register char *a = xhv->xhv_array; /* HvARRAY(hv) */ |
72311751 GS |
1056 | register HE **aep; |
1057 | register HE **bep; | |
79072805 LW |
1058 | register HE *entry; |
1059 | register HE **oentry; | |
ff38041c NC |
1060 | int longest_chain = 0; |
1061 | int was_shared; | |
79072805 | 1062 | |
e266888e NC |
1063 | /*PerlIO_printf(PerlIO_stderr(), "hsplit called for %p which had %d\n", |
1064 | hv, (int) oldsize);*/ | |
1065 | ||
1066 | if (HvPLACEHOLDERS(hv) && !SvREADONLY(hv)) { | |
1067 | /* Can make this clear any placeholders first for non-restricted hashes, | |
1068 | even though Storable rebuilds restricted hashes by putting in all the | |
1069 | placeholders (first) before turning on the readonly flag, because | |
1070 | Storable always pre-splits the hash. */ | |
1071 | hv_clear_placeholders(hv); | |
1072 | } | |
1073 | ||
3280af22 | 1074 | PL_nomemok = TRUE; |
8d6dde3e | 1075 | #if defined(STRANGE_MALLOC) || defined(MYMALLOC) |
d18c6117 | 1076 | Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char); |
422a93e5 | 1077 | if (!a) { |
4a33f861 | 1078 | PL_nomemok = FALSE; |
422a93e5 GA |
1079 | return; |
1080 | } | |
4633a7c4 | 1081 | #else |
d18c6117 | 1082 | New(2, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char); |
422a93e5 | 1083 | if (!a) { |
3280af22 | 1084 | PL_nomemok = FALSE; |
422a93e5 GA |
1085 | return; |
1086 | } | |
cbec9347 | 1087 | Copy(xhv->xhv_array /* HvARRAY(hv) */, a, oldsize * sizeof(HE*), char); |
fba3b22e | 1088 | if (oldsize >= 64) { |
cbec9347 JH |
1089 | offer_nice_chunk(xhv->xhv_array /* HvARRAY(hv) */, |
1090 | PERL_HV_ARRAY_ALLOC_BYTES(oldsize)); | |
4633a7c4 LW |
1091 | } |
1092 | else | |
cbec9347 | 1093 | Safefree(xhv->xhv_array /* HvARRAY(hv) */); |
4633a7c4 LW |
1094 | #endif |
1095 | ||
3280af22 | 1096 | PL_nomemok = FALSE; |
72311751 | 1097 | Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/ |
cbec9347 JH |
1098 | xhv->xhv_max = --newsize; /* HvMAX(hv) = --newsize */ |
1099 | xhv->xhv_array = a; /* HvARRAY(hv) = a */ | |
72311751 | 1100 | aep = (HE**)a; |
79072805 | 1101 | |
72311751 | 1102 | for (i=0; i<oldsize; i++,aep++) { |
ff38041c NC |
1103 | int left_length = 0; |
1104 | int right_length = 0; | |
1105 | ||
72311751 | 1106 | if (!*aep) /* non-existent */ |
79072805 | 1107 | continue; |
72311751 GS |
1108 | bep = aep+oldsize; |
1109 | for (oentry = aep, entry = *aep; entry; entry = *oentry) { | |
eb160463 | 1110 | if ((HeHASH(entry) & newsize) != (U32)i) { |
fde52b5c | 1111 | *oentry = HeNEXT(entry); |
72311751 GS |
1112 | HeNEXT(entry) = *bep; |
1113 | if (!*bep) | |
cbec9347 | 1114 | xhv->xhv_fill++; /* HvFILL(hv)++ */ |
72311751 | 1115 | *bep = entry; |
ff38041c | 1116 | right_length++; |
79072805 LW |
1117 | continue; |
1118 | } | |
ff38041c | 1119 | else { |
fde52b5c | 1120 | oentry = &HeNEXT(entry); |
ff38041c NC |
1121 | left_length++; |
1122 | } | |
79072805 | 1123 | } |
72311751 | 1124 | if (!*aep) /* everything moved */ |
cbec9347 | 1125 | xhv->xhv_fill--; /* HvFILL(hv)-- */ |
ff38041c NC |
1126 | /* I think we don't actually need to keep track of the longest length, |
1127 | merely flag if anything is too long. But for the moment while | |
1128 | developing this code I'll track it. */ | |
1129 | if (left_length > longest_chain) | |
1130 | longest_chain = left_length; | |
1131 | if (right_length > longest_chain) | |
1132 | longest_chain = right_length; | |
79072805 | 1133 | } |
ff38041c NC |
1134 | |
1135 | ||
1136 | /* Pick your policy for "hashing isn't working" here: */ | |
9c87fafe | 1137 | if (longest_chain <= HV_MAX_LENGTH_BEFORE_SPLIT /* split worked? */ |
ff38041c NC |
1138 | || HvREHASH(hv)) { |
1139 | return; | |
1140 | } | |
1141 | ||
1142 | if (hv == PL_strtab) { | |
1143 | /* Urg. Someone is doing something nasty to the string table. | |
1144 | Can't win. */ | |
1145 | return; | |
1146 | } | |
1147 | ||
1148 | /* Awooga. Awooga. Pathological data. */ | |
9c87fafe | 1149 | /*PerlIO_printf(PerlIO_stderr(), "%p %d of %d with %d/%d buckets\n", hv, |
ff38041c NC |
1150 | longest_chain, HvTOTALKEYS(hv), HvFILL(hv), 1+HvMAX(hv));*/ |
1151 | ||
1152 | ++newsize; | |
1153 | Newz(2, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char); | |
1154 | was_shared = HvSHAREKEYS(hv); | |
1155 | ||
1156 | xhv->xhv_fill = 0; | |
1157 | HvSHAREKEYS_off(hv); | |
1158 | HvREHASH_on(hv); | |
ff38041c NC |
1159 | |
1160 | aep = (HE **) xhv->xhv_array; | |
1161 | ||
1162 | for (i=0; i<newsize; i++,aep++) { | |
1163 | entry = *aep; | |
1164 | while (entry) { | |
1165 | /* We're going to trash this HE's next pointer when we chain it | |
1166 | into the new hash below, so store where we go next. */ | |
1167 | HE *next = HeNEXT(entry); | |
1168 | UV hash; | |
1169 | ||
1170 | /* Rehash it */ | |
1171 | PERL_HASH_INTERNAL(hash, HeKEY(entry), HeKLEN(entry)); | |
1172 | ||
1173 | if (was_shared) { | |
1174 | /* Unshare it. */ | |
1175 | HEK *new_hek | |
1176 | = save_hek_flags(HeKEY(entry), HeKLEN(entry), | |
1177 | hash, HeKFLAGS(entry)); | |
1178 | unshare_hek (HeKEY_hek(entry)); | |
1179 | HeKEY_hek(entry) = new_hek; | |
1180 | } else { | |
1181 | /* Not shared, so simply write the new hash in. */ | |
1182 | HeHASH(entry) = hash; | |
1183 | } | |
1184 | /*PerlIO_printf(PerlIO_stderr(), "%d ", HeKFLAGS(entry));*/ | |
1185 | HEK_REHASH_on(HeKEY_hek(entry)); | |
1186 | /*PerlIO_printf(PerlIO_stderr(), "%d\n", HeKFLAGS(entry));*/ | |
1187 | ||
1188 | /* Copy oentry to the correct new chain. */ | |
1189 | bep = ((HE**)a) + (hash & (I32) xhv->xhv_max); | |
1190 | if (!*bep) | |
1191 | xhv->xhv_fill++; /* HvFILL(hv)++ */ | |
1192 | HeNEXT(entry) = *bep; | |
1193 | *bep = entry; | |
1194 | ||
1195 | entry = next; | |
1196 | } | |
1197 | } | |
1198 | Safefree (xhv->xhv_array); | |
1199 | xhv->xhv_array = a; /* HvARRAY(hv) = a */ | |
79072805 LW |
1200 | } |
1201 | ||
72940dca | 1202 | void |
864dbfa3 | 1203 | Perl_hv_ksplit(pTHX_ HV *hv, IV newmax) |
72940dca | 1204 | { |
cbec9347 JH |
1205 | register XPVHV* xhv = (XPVHV*)SvANY(hv); |
1206 | I32 oldsize = (I32) xhv->xhv_max+1; /* HvMAX(hv)+1 (sick) */ | |
72940dca | 1207 | register I32 newsize; |
1208 | register I32 i; | |
1209 | register I32 j; | |
72311751 GS |
1210 | register char *a; |
1211 | register HE **aep; | |
72940dca | 1212 | register HE *entry; |
1213 | register HE **oentry; | |
1214 | ||
1215 | newsize = (I32) newmax; /* possible truncation here */ | |
1216 | if (newsize != newmax || newmax <= oldsize) | |
1217 | return; | |
1218 | while ((newsize & (1 + ~newsize)) != newsize) { | |
1219 | newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */ | |
1220 | } | |
1221 | if (newsize < newmax) | |
1222 | newsize *= 2; | |
1223 | if (newsize < newmax) | |
1224 | return; /* overflow detection */ | |
1225 | ||
cbec9347 | 1226 | a = xhv->xhv_array; /* HvARRAY(hv) */ |
72940dca | 1227 | if (a) { |
3280af22 | 1228 | PL_nomemok = TRUE; |
8d6dde3e | 1229 | #if defined(STRANGE_MALLOC) || defined(MYMALLOC) |
d18c6117 | 1230 | Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char); |
8aacddc1 | 1231 | if (!a) { |
4a33f861 | 1232 | PL_nomemok = FALSE; |
422a93e5 GA |
1233 | return; |
1234 | } | |
72940dca | 1235 | #else |
d18c6117 | 1236 | New(2, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char); |
8aacddc1 | 1237 | if (!a) { |
3280af22 | 1238 | PL_nomemok = FALSE; |
422a93e5 GA |
1239 | return; |
1240 | } | |
cbec9347 | 1241 | Copy(xhv->xhv_array /* HvARRAY(hv) */, a, oldsize * sizeof(HE*), char); |
fba3b22e | 1242 | if (oldsize >= 64) { |
cbec9347 JH |
1243 | offer_nice_chunk(xhv->xhv_array /* HvARRAY(hv) */, |
1244 | PERL_HV_ARRAY_ALLOC_BYTES(oldsize)); | |
72940dca | 1245 | } |
1246 | else | |
cbec9347 | 1247 | Safefree(xhv->xhv_array /* HvARRAY(hv) */); |
72940dca | 1248 | #endif |
3280af22 | 1249 | PL_nomemok = FALSE; |
72311751 | 1250 | Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/ |
72940dca | 1251 | } |
1252 | else { | |
d18c6117 | 1253 | Newz(0, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char); |
72940dca | 1254 | } |
cbec9347 JH |
1255 | xhv->xhv_max = --newsize; /* HvMAX(hv) = --newsize */ |
1256 | xhv->xhv_array = a; /* HvARRAY(hv) = a */ | |
1257 | if (!xhv->xhv_fill /* !HvFILL(hv) */) /* skip rest if no entries */ | |
72940dca | 1258 | return; |
1259 | ||
72311751 GS |
1260 | aep = (HE**)a; |
1261 | for (i=0; i<oldsize; i++,aep++) { | |
1262 | if (!*aep) /* non-existent */ | |
72940dca | 1263 | continue; |
72311751 | 1264 | for (oentry = aep, entry = *aep; entry; entry = *oentry) { |
72940dca | 1265 | if ((j = (HeHASH(entry) & newsize)) != i) { |
1266 | j -= i; | |
1267 | *oentry = HeNEXT(entry); | |
72311751 | 1268 | if (!(HeNEXT(entry) = aep[j])) |
cbec9347 | 1269 | xhv->xhv_fill++; /* HvFILL(hv)++ */ |
72311751 | 1270 | aep[j] = entry; |
72940dca | 1271 | continue; |
1272 | } | |
1273 | else | |
1274 | oentry = &HeNEXT(entry); | |
1275 | } | |
72311751 | 1276 | if (!*aep) /* everything moved */ |
cbec9347 | 1277 | xhv->xhv_fill--; /* HvFILL(hv)-- */ |
72940dca | 1278 | } |
1279 | } | |
1280 | ||
954c1994 GS |
1281 | /* |
1282 | =for apidoc newHV | |
1283 | ||
1284 | Creates a new HV. The reference count is set to 1. | |
1285 | ||
1286 | =cut | |
1287 | */ | |
1288 | ||
79072805 | 1289 | HV * |
864dbfa3 | 1290 | Perl_newHV(pTHX) |
79072805 LW |
1291 | { |
1292 | register HV *hv; | |
cbec9347 | 1293 | register XPVHV* xhv; |
79072805 | 1294 | |
a0d0e21e LW |
1295 | hv = (HV*)NEWSV(502,0); |
1296 | sv_upgrade((SV *)hv, SVt_PVHV); | |
cbec9347 | 1297 | xhv = (XPVHV*)SvANY(hv); |
79072805 LW |
1298 | SvPOK_off(hv); |
1299 | SvNOK_off(hv); | |
1c846c1f | 1300 | #ifndef NODEFAULT_SHAREKEYS |
fde52b5c | 1301 | HvSHAREKEYS_on(hv); /* key-sharing on by default */ |
1c846c1f | 1302 | #endif |
ff38041c | 1303 | |
cbec9347 JH |
1304 | xhv->xhv_max = 7; /* HvMAX(hv) = 7 (start with 8 buckets) */ |
1305 | xhv->xhv_fill = 0; /* HvFILL(hv) = 0 */ | |
1306 | xhv->xhv_pmroot = 0; /* HvPMROOT(hv) = 0 */ | |
79072805 LW |
1307 | (void)hv_iterinit(hv); /* so each() will start off right */ |
1308 | return hv; | |
1309 | } | |
1310 | ||
b3ac6de7 | 1311 | HV * |
864dbfa3 | 1312 | Perl_newHVhv(pTHX_ HV *ohv) |
b3ac6de7 | 1313 | { |
b56ba0bf | 1314 | HV *hv = newHV(); |
4beac62f | 1315 | STRLEN hv_max, hv_fill; |
4beac62f AMS |
1316 | |
1317 | if (!ohv || (hv_fill = HvFILL(ohv)) == 0) | |
1318 | return hv; | |
4beac62f | 1319 | hv_max = HvMAX(ohv); |
b3ac6de7 | 1320 | |
b56ba0bf AMS |
1321 | if (!SvMAGICAL((SV *)ohv)) { |
1322 | /* It's an ordinary hash, so copy it fast. AMS 20010804 */ | |
eb160463 GS |
1323 | STRLEN i; |
1324 | bool shared = !!HvSHAREKEYS(ohv); | |
b56ba0bf | 1325 | HE **ents, **oents = (HE **)HvARRAY(ohv); |
ff875642 JH |
1326 | char *a; |
1327 | New(0, a, PERL_HV_ARRAY_ALLOC_BYTES(hv_max+1), char); | |
1328 | ents = (HE**)a; | |
b56ba0bf AMS |
1329 | |
1330 | /* In each bucket... */ | |
1331 | for (i = 0; i <= hv_max; i++) { | |
1332 | HE *prev = NULL, *ent = NULL, *oent = oents[i]; | |
1333 | ||
1334 | if (!oent) { | |
1335 | ents[i] = NULL; | |
1336 | continue; | |
1337 | } | |
1338 | ||
1339 | /* Copy the linked list of entries. */ | |
1340 | for (oent = oents[i]; oent; oent = HeNEXT(oent)) { | |
1341 | U32 hash = HeHASH(oent); | |
1342 | char *key = HeKEY(oent); | |
19692e8d NC |
1343 | STRLEN len = HeKLEN(oent); |
1344 | int flags = HeKFLAGS(oent); | |
b56ba0bf AMS |
1345 | |
1346 | ent = new_HE(); | |
45dea987 | 1347 | HeVAL(ent) = newSVsv(HeVAL(oent)); |
19692e8d NC |
1348 | HeKEY_hek(ent) |
1349 | = shared ? share_hek_flags(key, len, hash, flags) | |
1350 | : save_hek_flags(key, len, hash, flags); | |
b56ba0bf AMS |
1351 | if (prev) |
1352 | HeNEXT(prev) = ent; | |
1353 | else | |
1354 | ents[i] = ent; | |
1355 | prev = ent; | |
1356 | HeNEXT(ent) = NULL; | |
1357 | } | |
1358 | } | |
1359 | ||
1360 | HvMAX(hv) = hv_max; | |
1361 | HvFILL(hv) = hv_fill; | |
8aacddc1 | 1362 | HvTOTALKEYS(hv) = HvTOTALKEYS(ohv); |
b56ba0bf | 1363 | HvARRAY(hv) = ents; |
1c846c1f | 1364 | } |
b56ba0bf AMS |
1365 | else { |
1366 | /* Iterate over ohv, copying keys and values one at a time. */ | |
b3ac6de7 | 1367 | HE *entry; |
b56ba0bf AMS |
1368 | I32 riter = HvRITER(ohv); |
1369 | HE *eiter = HvEITER(ohv); | |
1370 | ||
1371 | /* Can we use fewer buckets? (hv_max is always 2^n-1) */ | |
1372 | while (hv_max && hv_max + 1 >= hv_fill * 2) | |
1373 | hv_max = hv_max / 2; | |
1374 | HvMAX(hv) = hv_max; | |
1375 | ||
4a76a316 | 1376 | hv_iterinit(ohv); |
e16e2ff8 | 1377 | while ((entry = hv_iternext_flags(ohv, 0))) { |
19692e8d NC |
1378 | hv_store_flags(hv, HeKEY(entry), HeKLEN(entry), |
1379 | newSVsv(HeVAL(entry)), HeHASH(entry), | |
1380 | HeKFLAGS(entry)); | |
b3ac6de7 | 1381 | } |
b56ba0bf AMS |
1382 | HvRITER(ohv) = riter; |
1383 | HvEITER(ohv) = eiter; | |
b3ac6de7 | 1384 | } |
1c846c1f | 1385 | |
b3ac6de7 IZ |
1386 | return hv; |
1387 | } | |
1388 | ||
79072805 | 1389 | void |
864dbfa3 | 1390 | Perl_hv_free_ent(pTHX_ HV *hv, register HE *entry) |
79072805 | 1391 | { |
16bdeea2 GS |
1392 | SV *val; |
1393 | ||
68dc0745 | 1394 | if (!entry) |
79072805 | 1395 | return; |
16bdeea2 | 1396 | val = HeVAL(entry); |
257c9e5b | 1397 | if (val && isGV(val) && GvCVu(val) && HvNAME(hv)) |
3280af22 | 1398 | PL_sub_generation++; /* may be deletion of method from stash */ |
16bdeea2 | 1399 | SvREFCNT_dec(val); |
68dc0745 | 1400 | if (HeKLEN(entry) == HEf_SVKEY) { |
1401 | SvREFCNT_dec(HeKEY_sv(entry)); | |
8aacddc1 | 1402 | Safefree(HeKEY_hek(entry)); |
44a8e56a | 1403 | } |
1404 | else if (HvSHAREKEYS(hv)) | |
68dc0745 | 1405 | unshare_hek(HeKEY_hek(entry)); |
fde52b5c | 1406 | else |
68dc0745 | 1407 | Safefree(HeKEY_hek(entry)); |
d33b2eba | 1408 | del_HE(entry); |
79072805 LW |
1409 | } |
1410 | ||
1411 | void | |
864dbfa3 | 1412 | Perl_hv_delayfree_ent(pTHX_ HV *hv, register HE *entry) |
79072805 | 1413 | { |
68dc0745 | 1414 | if (!entry) |
79072805 | 1415 | return; |
68dc0745 | 1416 | if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv)) |
3280af22 | 1417 | PL_sub_generation++; /* may be deletion of method from stash */ |
68dc0745 | 1418 | sv_2mortal(HeVAL(entry)); /* free between statements */ |
1419 | if (HeKLEN(entry) == HEf_SVKEY) { | |
1420 | sv_2mortal(HeKEY_sv(entry)); | |
1421 | Safefree(HeKEY_hek(entry)); | |
44a8e56a | 1422 | } |
1423 | else if (HvSHAREKEYS(hv)) | |
68dc0745 | 1424 | unshare_hek(HeKEY_hek(entry)); |
fde52b5c | 1425 | else |
68dc0745 | 1426 | Safefree(HeKEY_hek(entry)); |
d33b2eba | 1427 | del_HE(entry); |
79072805 LW |
1428 | } |
1429 | ||
954c1994 GS |
1430 | /* |
1431 | =for apidoc hv_clear | |
1432 | ||
1433 | Clears a hash, making it empty. | |
1434 | ||
1435 | =cut | |
1436 | */ | |
1437 | ||
79072805 | 1438 | void |
864dbfa3 | 1439 | Perl_hv_clear(pTHX_ HV *hv) |
79072805 | 1440 | { |
cbec9347 | 1441 | register XPVHV* xhv; |
79072805 LW |
1442 | if (!hv) |
1443 | return; | |
49293501 | 1444 | |
007ab0d8 JH |
1445 | xhv = (XPVHV*)SvANY(hv); |
1446 | ||
4d847313 | 1447 | if (SvREADONLY(hv) && xhv->xhv_array != NULL) { |
007ab0d8 JH |
1448 | /* restricted hash: convert all keys to placeholders */ |
1449 | I32 i; | |
1450 | HE* entry; | |
1aa6899f | 1451 | for (i = 0; i <= (I32) xhv->xhv_max; i++) { |
007ab0d8 JH |
1452 | entry = ((HE**)xhv->xhv_array)[i]; |
1453 | for (; entry; entry = HeNEXT(entry)) { | |
1454 | /* not already placeholder */ | |
42272d83 | 1455 | if (HeVAL(entry) != &PL_sv_placeholder) { |
007ab0d8 JH |
1456 | if (HeVAL(entry) && SvREADONLY(HeVAL(entry))) { |
1457 | SV* keysv = hv_iterkeysv(entry); | |
1458 | Perl_croak(aTHX_ | |
f7288ffb JH |
1459 | "Attempt to delete readonly key '%"SVf"' from a restricted hash", |
1460 | keysv); | |
007ab0d8 JH |
1461 | } |
1462 | SvREFCNT_dec(HeVAL(entry)); | |
42272d83 | 1463 | HeVAL(entry) = &PL_sv_placeholder; |
007ab0d8 JH |
1464 | xhv->xhv_placeholders++; /* HvPLACEHOLDERS(hv)++ */ |
1465 | } | |
1466 | } | |
1467 | } | |
59679316 | 1468 | goto reset; |
49293501 MS |
1469 | } |
1470 | ||
463ee0b2 | 1471 | hfreeentries(hv); |
8aacddc1 | 1472 | xhv->xhv_placeholders = 0; /* HvPLACEHOLDERS(hv) = 0 */ |
cbec9347 JH |
1473 | if (xhv->xhv_array /* HvARRAY(hv) */) |
1474 | (void)memzero(xhv->xhv_array /* HvARRAY(hv) */, | |
1475 | (xhv->xhv_max+1 /* HvMAX(hv)+1 */) * sizeof(HE*)); | |
a0d0e21e LW |
1476 | |
1477 | if (SvRMAGICAL(hv)) | |
1c846c1f | 1478 | mg_clear((SV*)hv); |
574c8022 | 1479 | |
19692e8d | 1480 | HvHASKFLAGS_off(hv); |
ff38041c | 1481 | HvREHASH_off(hv); |
59679316 TP |
1482 | reset: |
1483 | HvEITER(hv) = NULL; | |
79072805 LW |
1484 | } |
1485 | ||
704547c4 AB |
1486 | /* |
1487 | =for apidoc hv_clear_placeholders | |
1488 | ||
1489 | Clears any placeholders from a hash. If a restricted hash has any of its keys | |
1490 | marked as readonly and the key is subsequently deleted, the key is not actually | |
1491 | deleted but is marked by assigning it a value of &PL_sv_placeholder. This tags | |
1492 | it so it will be ignored by future operations such as iterating over the hash, | |
1493 | but will still allow the hash to have a value reaasigned to the key at some | |
1494 | future point. This function clears any such placeholder keys from the hash. | |
1495 | See Hash::Util::lock_keys() for an example of its use. | |
1496 | ||
1497 | =cut | |
1498 | */ | |
1499 | ||
1500 | void | |
1501 | Perl_hv_clear_placeholders(pTHX_ HV *hv) | |
1502 | { | |
e266888e NC |
1503 | I32 items = (I32)HvPLACEHOLDERS(hv); |
1504 | I32 i = HvMAX(hv); | |
1505 | ||
1506 | if (items == 0) | |
1507 | return; | |
1508 | ||
1509 | do { | |
1510 | /* Loop down the linked list heads */ | |
1511 | int first = 1; | |
1512 | HE **oentry = &(HvARRAY(hv))[i]; | |
1513 | HE *entry = *oentry; | |
1514 | ||
1515 | if (!entry) | |
1516 | continue; | |
1517 | ||
1518 | for (; entry; entry = *oentry) { | |
1519 | if (HeVAL(entry) == &PL_sv_placeholder) { | |
1520 | *oentry = HeNEXT(entry); | |
1521 | if (first && !*oentry) | |
1522 | HvFILL(hv)--; /* This linked list is now empty. */ | |
1523 | if (HvEITER(hv)) | |
1524 | HvLAZYDEL_on(hv); | |
1525 | else | |
1526 | hv_free_ent(hv, entry); | |
1527 | ||
1528 | if (--items == 0) { | |
1529 | /* Finished. */ | |
1530 | HvTOTALKEYS(hv) -= HvPLACEHOLDERS(hv); | |
1531 | if (HvKEYS(hv) == 0) | |
1532 | HvHASKFLAGS_off(hv); | |
1533 | HvPLACEHOLDERS(hv) = 0; | |
1534 | return; | |
1535 | } | |
1536 | } else { | |
1537 | oentry = &HeNEXT(entry); | |
1538 | first = 0; | |
1539 | } | |
1540 | } | |
1541 | } while (--i >= 0); | |
1542 | /* You can't get here, hence assertion should always fail. */ | |
1543 | assert (items == 0); | |
1544 | assert (0); | |
704547c4 AB |
1545 | } |
1546 | ||
76e3520e | 1547 | STATIC void |
cea2e8a9 | 1548 | S_hfreeentries(pTHX_ HV *hv) |
79072805 | 1549 | { |
a0d0e21e | 1550 | register HE **array; |
68dc0745 | 1551 | register HE *entry; |
1552 | register HE *oentry = Null(HE*); | |
a0d0e21e LW |
1553 | I32 riter; |
1554 | I32 max; | |
79072805 LW |
1555 | |
1556 | if (!hv) | |
1557 | return; | |
a0d0e21e | 1558 | if (!HvARRAY(hv)) |
79072805 | 1559 | return; |
a0d0e21e LW |
1560 | |
1561 | riter = 0; | |
1562 | max = HvMAX(hv); | |
1563 | array = HvARRAY(hv); | |
f3479639 JH |
1564 | /* make everyone else think the array is empty, so that the destructors |
1565 | * called for freed entries can't recusively mess with us */ | |
1566 | HvARRAY(hv) = Null(HE**); | |
1567 | HvFILL(hv) = 0; | |
1568 | ((XPVHV*) SvANY(hv))->xhv_keys = 0; | |
1569 | ||
68dc0745 | 1570 | entry = array[0]; |
a0d0e21e | 1571 | for (;;) { |
68dc0745 | 1572 | if (entry) { |
1573 | oentry = entry; | |
1574 | entry = HeNEXT(entry); | |
1575 | hv_free_ent(hv, oentry); | |
a0d0e21e | 1576 | } |
68dc0745 | 1577 | if (!entry) { |
a0d0e21e LW |
1578 | if (++riter > max) |
1579 | break; | |
68dc0745 | 1580 | entry = array[riter]; |
1c846c1f | 1581 | } |
79072805 | 1582 | } |
f3479639 | 1583 | HvARRAY(hv) = array; |
a0d0e21e | 1584 | (void)hv_iterinit(hv); |
79072805 LW |
1585 | } |
1586 | ||
954c1994 GS |
1587 | /* |
1588 | =for apidoc hv_undef | |
1589 | ||
1590 | Undefines the hash. | |
1591 | ||
1592 | =cut | |
1593 | */ | |
1594 | ||
79072805 | 1595 | void |
864dbfa3 | 1596 | Perl_hv_undef(pTHX_ HV *hv) |
79072805 | 1597 | { |
cbec9347 | 1598 | register XPVHV* xhv; |
79072805 LW |
1599 | if (!hv) |
1600 | return; | |
cbec9347 | 1601 | xhv = (XPVHV*)SvANY(hv); |
463ee0b2 | 1602 | hfreeentries(hv); |
cbec9347 | 1603 | Safefree(xhv->xhv_array /* HvARRAY(hv) */); |
85e6fe83 | 1604 | if (HvNAME(hv)) { |
efb84706 JH |
1605 | if(PL_stashcache) |
1606 | hv_delete(PL_stashcache, HvNAME(hv), strlen(HvNAME(hv)), G_DISCARD); | |
85e6fe83 LW |
1607 | Safefree(HvNAME(hv)); |
1608 | HvNAME(hv) = 0; | |
1609 | } | |
cbec9347 JH |
1610 | xhv->xhv_max = 7; /* HvMAX(hv) = 7 (it's a normal hash) */ |
1611 | xhv->xhv_array = 0; /* HvARRAY(hv) = 0 */ | |
8aacddc1 | 1612 | xhv->xhv_placeholders = 0; /* HvPLACEHOLDERS(hv) = 0 */ |
a0d0e21e LW |
1613 | |
1614 | if (SvRMAGICAL(hv)) | |
1c846c1f | 1615 | mg_clear((SV*)hv); |
79072805 LW |
1616 | } |
1617 | ||
954c1994 GS |
1618 | /* |
1619 | =for apidoc hv_iterinit | |
1620 | ||
1621 | Prepares a starting point to traverse a hash table. Returns the number of | |
1622 | keys in the hash (i.e. the same as C<HvKEYS(tb)>). The return value is | |
1c846c1f | 1623 | currently only meaningful for hashes without tie magic. |
954c1994 GS |
1624 | |
1625 | NOTE: Before version 5.004_65, C<hv_iterinit> used to return the number of | |
1626 | hash buckets that happen to be in use. If you still need that esoteric | |
1627 | value, you can get it through the macro C<HvFILL(tb)>. | |
1628 | ||
e16e2ff8 | 1629 | |
954c1994 GS |
1630 | =cut |
1631 | */ | |
1632 | ||
79072805 | 1633 | I32 |
864dbfa3 | 1634 | Perl_hv_iterinit(pTHX_ HV *hv) |
79072805 | 1635 | { |
cbec9347 | 1636 | register XPVHV* xhv; |
aa689395 | 1637 | HE *entry; |
1638 | ||
1639 | if (!hv) | |
cea2e8a9 | 1640 | Perl_croak(aTHX_ "Bad hash"); |
cbec9347 JH |
1641 | xhv = (XPVHV*)SvANY(hv); |
1642 | entry = xhv->xhv_eiter; /* HvEITER(hv) */ | |
72940dca | 1643 | if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */ |
1644 | HvLAZYDEL_off(hv); | |
68dc0745 | 1645 | hv_free_ent(hv, entry); |
72940dca | 1646 | } |
cbec9347 JH |
1647 | xhv->xhv_riter = -1; /* HvRITER(hv) = -1 */ |
1648 | xhv->xhv_eiter = Null(HE*); /* HvEITER(hv) = Null(HE*) */ | |
1649 | /* used to be xhv->xhv_fill before 5.004_65 */ | |
8aacddc1 | 1650 | return XHvTOTALKEYS(xhv); |
79072805 | 1651 | } |
954c1994 GS |
1652 | /* |
1653 | =for apidoc hv_iternext | |
1654 | ||
1655 | Returns entries from a hash iterator. See C<hv_iterinit>. | |
1656 | ||
fe7bca90 NC |
1657 | You may call C<hv_delete> or C<hv_delete_ent> on the hash entry that the |
1658 | iterator currently points to, without losing your place or invalidating your | |
1659 | iterator. Note that in this case the current entry is deleted from the hash | |
1660 | with your iterator holding the last reference to it. Your iterator is flagged | |
1661 | to free the entry on the next call to C<hv_iternext>, so you must not discard | |
1662 | your iterator immediately else the entry will leak - call C<hv_iternext> to | |
1663 | trigger the resource deallocation. | |
1664 | ||
954c1994 GS |
1665 | =cut |
1666 | */ | |
1667 | ||
79072805 | 1668 | HE * |
864dbfa3 | 1669 | Perl_hv_iternext(pTHX_ HV *hv) |
79072805 | 1670 | { |
e16e2ff8 NC |
1671 | return hv_iternext_flags(hv, 0); |
1672 | } | |
1673 | ||
1674 | /* | |
fe7bca90 NC |
1675 | =for apidoc hv_iternext_flags |
1676 | ||
1677 | Returns entries from a hash iterator. See C<hv_iterinit> and C<hv_iternext>. | |
1678 | The C<flags> value will normally be zero; if HV_ITERNEXT_WANTPLACEHOLDERS is | |
1679 | set the placeholders keys (for restricted hashes) will be returned in addition | |
1680 | to normal keys. By default placeholders are automatically skipped over. | |
42272d83 JH |
1681 | Currently a placeholder is implemented with a value that is |
1682 | C<&Perl_sv_placeholder>. Note that the implementation of placeholders and | |
fe7bca90 NC |
1683 | restricted hashes may change, and the implementation currently is |
1684 | insufficiently abstracted for any change to be tidy. | |
e16e2ff8 | 1685 | |
fe7bca90 | 1686 | =cut |
e16e2ff8 NC |
1687 | */ |
1688 | ||
1689 | HE * | |
1690 | Perl_hv_iternext_flags(pTHX_ HV *hv, I32 flags) | |
1691 | { | |
cbec9347 | 1692 | register XPVHV* xhv; |
79072805 | 1693 | register HE *entry; |
a0d0e21e | 1694 | HE *oldentry; |
463ee0b2 | 1695 | MAGIC* mg; |
79072805 LW |
1696 | |
1697 | if (!hv) | |
cea2e8a9 | 1698 | Perl_croak(aTHX_ "Bad hash"); |
cbec9347 JH |
1699 | xhv = (XPVHV*)SvANY(hv); |
1700 | oldentry = entry = xhv->xhv_eiter; /* HvEITER(hv) */ | |
463ee0b2 | 1701 | |
14befaf4 | 1702 | if ((mg = SvTIED_mg((SV*)hv, PERL_MAGIC_tied))) { |
8990e307 | 1703 | SV *key = sv_newmortal(); |
cd1469e6 | 1704 | if (entry) { |
fde52b5c | 1705 | sv_setsv(key, HeSVKEY_force(entry)); |
cd1469e6 | 1706 | SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */ |
1707 | } | |
a0d0e21e | 1708 | else { |
ff68c719 | 1709 | char *k; |
bbce6d69 | 1710 | HEK *hek; |
ff68c719 | 1711 | |
cbec9347 JH |
1712 | /* one HE per MAGICAL hash */ |
1713 | xhv->xhv_eiter = entry = new_HE(); /* HvEITER(hv) = new_HE() */ | |
4633a7c4 | 1714 | Zero(entry, 1, HE); |
ff68c719 | 1715 | Newz(54, k, HEK_BASESIZE + sizeof(SV*), char); |
1716 | hek = (HEK*)k; | |
1717 | HeKEY_hek(entry) = hek; | |
fde52b5c | 1718 | HeKLEN(entry) = HEf_SVKEY; |
a0d0e21e LW |
1719 | } |
1720 | magic_nextpack((SV*) hv,mg,key); | |
8aacddc1 | 1721 | if (SvOK(key)) { |
cd1469e6 | 1722 | /* force key to stay around until next time */ |
bbce6d69 | 1723 | HeSVKEY_set(entry, SvREFCNT_inc(key)); |
1724 | return entry; /* beware, hent_val is not set */ | |
8aacddc1 | 1725 | } |
fde52b5c | 1726 | if (HeVAL(entry)) |
1727 | SvREFCNT_dec(HeVAL(entry)); | |
ff68c719 | 1728 | Safefree(HeKEY_hek(entry)); |
d33b2eba | 1729 | del_HE(entry); |
cbec9347 | 1730 | xhv->xhv_eiter = Null(HE*); /* HvEITER(hv) = Null(HE*) */ |
463ee0b2 | 1731 | return Null(HE*); |
79072805 | 1732 | } |
f675dbe5 | 1733 | #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */ |
cbec9347 | 1734 | if (!entry && SvRMAGICAL((SV*)hv) && mg_find((SV*)hv, PERL_MAGIC_env)) |
f675dbe5 CB |
1735 | prime_env_iter(); |
1736 | #endif | |
463ee0b2 | 1737 | |
cbec9347 JH |
1738 | if (!xhv->xhv_array /* !HvARRAY(hv) */) |
1739 | Newz(506, xhv->xhv_array /* HvARRAY(hv) */, | |
1740 | PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max+1 /* HvMAX(hv)+1 */), | |
1741 | char); | |
bda19f49 | 1742 | /* At start of hash, entry is NULL. */ |
fde52b5c | 1743 | if (entry) |
8aacddc1 | 1744 | { |
fde52b5c | 1745 | entry = HeNEXT(entry); |
e16e2ff8 NC |
1746 | if (!(flags & HV_ITERNEXT_WANTPLACEHOLDERS)) { |
1747 | /* | |
1748 | * Skip past any placeholders -- don't want to include them in | |
1749 | * any iteration. | |
1750 | */ | |
42272d83 | 1751 | while (entry && HeVAL(entry) == &PL_sv_placeholder) { |
e16e2ff8 NC |
1752 | entry = HeNEXT(entry); |
1753 | } | |
8aacddc1 NIS |
1754 | } |
1755 | } | |
fde52b5c | 1756 | while (!entry) { |
bda19f49 JH |
1757 | /* OK. Come to the end of the current list. Grab the next one. */ |
1758 | ||
cbec9347 | 1759 | xhv->xhv_riter++; /* HvRITER(hv)++ */ |
eb160463 | 1760 | if (xhv->xhv_riter > (I32)xhv->xhv_max /* HvRITER(hv) > HvMAX(hv) */) { |
bda19f49 | 1761 | /* There is no next one. End of the hash. */ |
cbec9347 | 1762 | xhv->xhv_riter = -1; /* HvRITER(hv) = -1 */ |
fde52b5c | 1763 | break; |
79072805 | 1764 | } |
cbec9347 JH |
1765 | /* entry = (HvARRAY(hv))[HvRITER(hv)]; */ |
1766 | entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter]; | |
8aacddc1 | 1767 | |
e16e2ff8 | 1768 | if (!(flags & HV_ITERNEXT_WANTPLACEHOLDERS)) { |
bda19f49 JH |
1769 | /* If we have an entry, but it's a placeholder, don't count it. |
1770 | Try the next. */ | |
42272d83 | 1771 | while (entry && HeVAL(entry) == &PL_sv_placeholder) |
bda19f49 JH |
1772 | entry = HeNEXT(entry); |
1773 | } | |
1774 | /* Will loop again if this linked list starts NULL | |
1775 | (for HV_ITERNEXT_WANTPLACEHOLDERS) | |
1776 | or if we run through it and find only placeholders. */ | |
fde52b5c | 1777 | } |
79072805 | 1778 | |
72940dca | 1779 | if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */ |
1780 | HvLAZYDEL_off(hv); | |
68dc0745 | 1781 | hv_free_ent(hv, oldentry); |
72940dca | 1782 | } |
a0d0e21e | 1783 | |
9c87fafe NC |
1784 | /*if (HvREHASH(hv) && entry && !HeKREHASH(entry)) |
1785 | PerlIO_printf(PerlIO_stderr(), "Awooga %p %p\n", hv, entry);*/ | |
1786 | ||
cbec9347 | 1787 | xhv->xhv_eiter = entry; /* HvEITER(hv) = entry */ |
79072805 LW |
1788 | return entry; |
1789 | } | |
1790 | ||
954c1994 GS |
1791 | /* |
1792 | =for apidoc hv_iterkey | |
1793 | ||
1794 | Returns the key from the current position of the hash iterator. See | |
1795 | C<hv_iterinit>. | |
1796 | ||
1797 | =cut | |
1798 | */ | |
1799 | ||
79072805 | 1800 | char * |
864dbfa3 | 1801 | Perl_hv_iterkey(pTHX_ register HE *entry, I32 *retlen) |
79072805 | 1802 | { |
fde52b5c | 1803 | if (HeKLEN(entry) == HEf_SVKEY) { |
fb73857a | 1804 | STRLEN len; |
1805 | char *p = SvPV(HeKEY_sv(entry), len); | |
1806 | *retlen = len; | |
1807 | return p; | |
fde52b5c | 1808 | } |
1809 | else { | |
1810 | *retlen = HeKLEN(entry); | |
1811 | return HeKEY(entry); | |
1812 | } | |
1813 | } | |
1814 | ||
1815 | /* unlike hv_iterval(), this always returns a mortal copy of the key */ | |
954c1994 GS |
1816 | /* |
1817 | =for apidoc hv_iterkeysv | |
1818 | ||
1819 | Returns the key as an C<SV*> from the current position of the hash | |
1820 | iterator. The return value will always be a mortal copy of the key. Also | |
1821 | see C<hv_iterinit>. | |
1822 | ||
1823 | =cut | |
1824 | */ | |
1825 | ||
fde52b5c | 1826 | SV * |
864dbfa3 | 1827 | Perl_hv_iterkeysv(pTHX_ register HE *entry) |
fde52b5c | 1828 | { |
19692e8d NC |
1829 | if (HeKLEN(entry) != HEf_SVKEY) { |
1830 | HEK *hek = HeKEY_hek(entry); | |
1831 | int flags = HEK_FLAGS(hek); | |
1832 | SV *sv; | |
1833 | ||
1834 | if (flags & HVhek_WASUTF8) { | |
1835 | /* Trouble :-) | |
1836 | Andreas would like keys he put in as utf8 to come back as utf8 | |
1837 | */ | |
1838 | STRLEN utf8_len = HEK_LEN(hek); | |
2e5dfef7 | 1839 | U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len); |
19692e8d | 1840 | |
2e5dfef7 | 1841 | sv = newSVpvn ((char*)as_utf8, utf8_len); |
19692e8d | 1842 | SvUTF8_on (sv); |
c193270f | 1843 | Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */ |
ff38041c NC |
1844 | } else if (flags & HVhek_REHASH) { |
1845 | /* We don't have a pointer to the hv, so we have to replicate the | |
1846 | flag into every HEK. This hv is using custom a hasing | |
1847 | algorithm. Hence we can't return a shared string scalar, as | |
1848 | that would contain the (wrong) hash value, and might get passed | |
1849 | into an hv routine with a regular hash */ | |
1850 | ||
1851 | sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek)); | |
1852 | if (HEK_UTF8(hek)) | |
1853 | SvUTF8_on (sv); | |
1854 | } else { | |
19692e8d NC |
1855 | sv = newSVpvn_share(HEK_KEY(hek), |
1856 | (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)), | |
1857 | HEK_HASH(hek)); | |
1858 | } | |
1859 | return sv_2mortal(sv); | |
1860 | } | |
1861 | return sv_mortalcopy(HeKEY_sv(entry)); | |
79072805 LW |
1862 | } |
1863 | ||
954c1994 GS |
1864 | /* |
1865 | =for apidoc hv_iterval | |
1866 | ||
1867 | Returns the value from the current position of the hash iterator. See | |
1868 | C<hv_iterkey>. | |
1869 | ||
1870 | =cut | |
1871 | */ | |
1872 | ||
79072805 | 1873 | SV * |
864dbfa3 | 1874 | Perl_hv_iterval(pTHX_ HV *hv, register HE *entry) |
79072805 | 1875 | { |
8990e307 | 1876 | if (SvRMAGICAL(hv)) { |
14befaf4 | 1877 | if (mg_find((SV*)hv, PERL_MAGIC_tied)) { |
8990e307 | 1878 | SV* sv = sv_newmortal(); |
bbce6d69 | 1879 | if (HeKLEN(entry) == HEf_SVKEY) |
1880 | mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY); | |
1881 | else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry)); | |
463ee0b2 LW |
1882 | return sv; |
1883 | } | |
79072805 | 1884 | } |
fde52b5c | 1885 | return HeVAL(entry); |
79072805 LW |
1886 | } |
1887 | ||
954c1994 GS |
1888 | /* |
1889 | =for apidoc hv_iternextsv | |
1890 | ||
1891 | Performs an C<hv_iternext>, C<hv_iterkey>, and C<hv_iterval> in one | |
1892 | operation. | |
1893 | ||
1894 | =cut | |
1895 | */ | |
1896 | ||
a0d0e21e | 1897 | SV * |
864dbfa3 | 1898 | Perl_hv_iternextsv(pTHX_ HV *hv, char **key, I32 *retlen) |
a0d0e21e LW |
1899 | { |
1900 | HE *he; | |
e16e2ff8 | 1901 | if ( (he = hv_iternext_flags(hv, 0)) == NULL) |
a0d0e21e LW |
1902 | return NULL; |
1903 | *key = hv_iterkey(he, retlen); | |
1904 | return hv_iterval(hv, he); | |
1905 | } | |
1906 | ||
954c1994 GS |
1907 | /* |
1908 | =for apidoc hv_magic | |
1909 | ||
1910 | Adds magic to a hash. See C<sv_magic>. | |
1911 | ||
1912 | =cut | |
1913 | */ | |
1914 | ||
79072805 | 1915 | void |
864dbfa3 | 1916 | Perl_hv_magic(pTHX_ HV *hv, GV *gv, int how) |
79072805 | 1917 | { |
a0d0e21e | 1918 | sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0); |
79072805 | 1919 | } |
fde52b5c | 1920 | |
37d85e3a JH |
1921 | #if 0 /* use the macro from hv.h instead */ |
1922 | ||
bbce6d69 | 1923 | char* |
864dbfa3 | 1924 | Perl_sharepvn(pTHX_ const char *sv, I32 len, U32 hash) |
bbce6d69 | 1925 | { |
ff68c719 | 1926 | return HEK_KEY(share_hek(sv, len, hash)); |
bbce6d69 | 1927 | } |
1928 | ||
37d85e3a JH |
1929 | #endif |
1930 | ||
bbce6d69 | 1931 | /* possibly free a shared string if no one has access to it |
fde52b5c | 1932 | * len and hash must both be valid for str. |
1933 | */ | |
bbce6d69 | 1934 | void |
864dbfa3 | 1935 | Perl_unsharepvn(pTHX_ const char *str, I32 len, U32 hash) |
fde52b5c | 1936 | { |
19692e8d NC |
1937 | unshare_hek_or_pvn (NULL, str, len, hash); |
1938 | } | |
1939 | ||
1940 | ||
1941 | void | |
1942 | Perl_unshare_hek(pTHX_ HEK *hek) | |
1943 | { | |
1944 | unshare_hek_or_pvn(hek, NULL, 0, 0); | |
1945 | } | |
1946 | ||
1947 | /* possibly free a shared string if no one has access to it | |
1948 | hek if non-NULL takes priority over the other 3, else str, len and hash | |
1949 | are used. If so, len and hash must both be valid for str. | |
1950 | */ | |
df132699 | 1951 | STATIC void |
19692e8d NC |
1952 | S_unshare_hek_or_pvn(pTHX_ HEK *hek, const char *str, I32 len, U32 hash) |
1953 | { | |
cbec9347 | 1954 | register XPVHV* xhv; |
fde52b5c | 1955 | register HE *entry; |
1956 | register HE **oentry; | |
1957 | register I32 i = 1; | |
1958 | I32 found = 0; | |
c3654f1a | 1959 | bool is_utf8 = FALSE; |
19692e8d | 1960 | int k_flags = 0; |
f9a63242 | 1961 | const char *save = str; |
c3654f1a | 1962 | |
19692e8d NC |
1963 | if (hek) { |
1964 | hash = HEK_HASH(hek); | |
1965 | } else if (len < 0) { | |
1966 | STRLEN tmplen = -len; | |
1967 | is_utf8 = TRUE; | |
1968 | /* See the note in hv_fetch(). --jhi */ | |
1969 | str = (char*)bytes_from_utf8((U8*)str, &tmplen, &is_utf8); | |
1970 | len = tmplen; | |
1971 | if (is_utf8) | |
1972 | k_flags = HVhek_UTF8; | |
1973 | if (str != save) | |
1974 | k_flags |= HVhek_WASUTF8 | HVhek_FREEKEY; | |
c3654f1a | 1975 | } |
1c846c1f | 1976 | |
fde52b5c | 1977 | /* what follows is the moral equivalent of: |
6b88bc9c | 1978 | if ((Svp = hv_fetch(PL_strtab, tmpsv, FALSE, hash))) { |
bbce6d69 | 1979 | if (--*Svp == Nullsv) |
6b88bc9c | 1980 | hv_delete(PL_strtab, str, len, G_DISCARD, hash); |
bbce6d69 | 1981 | } */ |
cbec9347 | 1982 | xhv = (XPVHV*)SvANY(PL_strtab); |
fde52b5c | 1983 | /* assert(xhv_array != 0) */ |
5f08fbcd | 1984 | LOCK_STRTAB_MUTEX; |
cbec9347 JH |
1985 | /* oentry = &(HvARRAY(hv))[hash & (I32) HvMAX(hv)]; */ |
1986 | oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; | |
19692e8d NC |
1987 | if (hek) { |
1988 | for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) { | |
1989 | if (HeKEY_hek(entry) != hek) | |
1990 | continue; | |
1991 | found = 1; | |
1992 | break; | |
1993 | } | |
1994 | } else { | |
1995 | int flags_masked = k_flags & HVhek_MASK; | |
1996 | for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) { | |
1997 | if (HeHASH(entry) != hash) /* strings can't be equal */ | |
1998 | continue; | |
1999 | if (HeKLEN(entry) != len) | |
2000 | continue; | |
2001 | if (HeKEY(entry) != str && memNE(HeKEY(entry),str,len)) /* is this it? */ | |
2002 | continue; | |
2003 | if (HeKFLAGS(entry) != flags_masked) | |
2004 | continue; | |
2005 | found = 1; | |
2006 | break; | |
2007 | } | |
2008 | } | |
2009 | ||
2010 | if (found) { | |
2011 | if (--HeVAL(entry) == Nullsv) { | |
2012 | *oentry = HeNEXT(entry); | |
2013 | if (i && !*oentry) | |
2014 | xhv->xhv_fill--; /* HvFILL(hv)-- */ | |
2015 | Safefree(HeKEY_hek(entry)); | |
2016 | del_HE(entry); | |
2017 | xhv->xhv_keys--; /* HvKEYS(hv)-- */ | |
2018 | } | |
fde52b5c | 2019 | } |
19692e8d | 2020 | |
333f433b | 2021 | UNLOCK_STRTAB_MUTEX; |
411caa50 | 2022 | if (!found && ckWARN_d(WARN_INTERNAL)) |
19692e8d | 2023 | Perl_warner(aTHX_ packWARN(WARN_INTERNAL), |
b035a42e NC |
2024 | "Attempt to free non-existent shared string '%s'%s" |
2025 | pTHX__FORMAT, | |
19692e8d | 2026 | hek ? HEK_KEY(hek) : str, |
b035a42e | 2027 | ((k_flags & HVhek_UTF8) ? " (utf8)" : "") pTHX__VALUE); |
19692e8d NC |
2028 | if (k_flags & HVhek_FREEKEY) |
2029 | Safefree(str); | |
fde52b5c | 2030 | } |
2031 | ||
bbce6d69 | 2032 | /* get a (constant) string ptr from the global string table |
2033 | * string will get added if it is not already there. | |
fde52b5c | 2034 | * len and hash must both be valid for str. |
2035 | */ | |
bbce6d69 | 2036 | HEK * |
864dbfa3 | 2037 | Perl_share_hek(pTHX_ const char *str, I32 len, register U32 hash) |
fde52b5c | 2038 | { |
da58a35d | 2039 | bool is_utf8 = FALSE; |
19692e8d | 2040 | int flags = 0; |
f9a63242 | 2041 | const char *save = str; |
da58a35d JH |
2042 | |
2043 | if (len < 0) { | |
77caf834 | 2044 | STRLEN tmplen = -len; |
da58a35d | 2045 | is_utf8 = TRUE; |
77caf834 JH |
2046 | /* See the note in hv_fetch(). --jhi */ |
2047 | str = (char*)bytes_from_utf8((U8*)str, &tmplen, &is_utf8); | |
2048 | len = tmplen; | |
19692e8d NC |
2049 | /* If we were able to downgrade here, then than means that we were passed |
2050 | in a key which only had chars 0-255, but was utf8 encoded. */ | |
2051 | if (is_utf8) | |
2052 | flags = HVhek_UTF8; | |
2053 | /* If we found we were able to downgrade the string to bytes, then | |
2054 | we should flag that it needs upgrading on keys or each. Also flag | |
2055 | that we need share_hek_flags to free the string. */ | |
2056 | if (str != save) | |
2057 | flags |= HVhek_WASUTF8 | HVhek_FREEKEY; | |
2058 | } | |
2059 | ||
2060 | return share_hek_flags (str, len, hash, flags); | |
2061 | } | |
2062 | ||
df132699 | 2063 | STATIC HEK * |
19692e8d NC |
2064 | S_share_hek_flags(pTHX_ const char *str, I32 len, register U32 hash, int flags) |
2065 | { | |
2066 | register XPVHV* xhv; | |
2067 | register HE *entry; | |
2068 | register HE **oentry; | |
2069 | register I32 i = 1; | |
2070 | I32 found = 0; | |
2071 | int flags_masked = flags & HVhek_MASK; | |
bbce6d69 | 2072 | |
fde52b5c | 2073 | /* what follows is the moral equivalent of: |
1c846c1f | 2074 | |
6b88bc9c | 2075 | if (!(Svp = hv_fetch(PL_strtab, str, len, FALSE))) |
8aacddc1 | 2076 | hv_store(PL_strtab, str, len, Nullsv, hash); |
9c87fafe NC |
2077 | |
2078 | Can't rehash the shared string table, so not sure if it's worth | |
2079 | counting the number of entries in the linked list | |
bbce6d69 | 2080 | */ |
cbec9347 | 2081 | xhv = (XPVHV*)SvANY(PL_strtab); |
fde52b5c | 2082 | /* assert(xhv_array != 0) */ |
5f08fbcd | 2083 | LOCK_STRTAB_MUTEX; |
cbec9347 JH |
2084 | /* oentry = &(HvARRAY(hv))[hash & (I32) HvMAX(hv)]; */ |
2085 | oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; | |
bbce6d69 | 2086 | for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) { |
fde52b5c | 2087 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
2088 | continue; | |
2089 | if (HeKLEN(entry) != len) | |
2090 | continue; | |
1c846c1f | 2091 | if (HeKEY(entry) != str && memNE(HeKEY(entry),str,len)) /* is this it? */ |
fde52b5c | 2092 | continue; |
19692e8d | 2093 | if (HeKFLAGS(entry) != flags_masked) |
c3654f1a | 2094 | continue; |
fde52b5c | 2095 | found = 1; |
fde52b5c | 2096 | break; |
2097 | } | |
bbce6d69 | 2098 | if (!found) { |
d33b2eba | 2099 | entry = new_HE(); |
ec15619a | 2100 | HeKEY_hek(entry) = save_hek_flags(str, len, hash, flags_masked); |
bbce6d69 | 2101 | HeVAL(entry) = Nullsv; |
2102 | HeNEXT(entry) = *oentry; | |
2103 | *oentry = entry; | |
cbec9347 | 2104 | xhv->xhv_keys++; /* HvKEYS(hv)++ */ |
bbce6d69 | 2105 | if (i) { /* initial entry? */ |
cbec9347 | 2106 | xhv->xhv_fill++; /* HvFILL(hv)++ */ |
ff38041c | 2107 | } else if (xhv->xhv_keys > (IV)xhv->xhv_max /* HvKEYS(hv) > HvMAX(hv) */) { |
cbec9347 | 2108 | hsplit(PL_strtab); |
bbce6d69 | 2109 | } |
2110 | } | |
2111 | ||
2112 | ++HeVAL(entry); /* use value slot as REFCNT */ | |
5f08fbcd | 2113 | UNLOCK_STRTAB_MUTEX; |
19692e8d NC |
2114 | |
2115 | if (flags & HVhek_FREEKEY) | |
f9a63242 | 2116 | Safefree(str); |
19692e8d | 2117 | |
ff68c719 | 2118 | return HeKEY_hek(entry); |
fde52b5c | 2119 | } |