Commit | Line | Data |
a0d0e21e |
1 | /* hv.c |
79072805 |
2 | * |
4bb101f2 |
3 | * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, |
7272f7c1 |
4 | * 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, by Larry Wall and others |
79072805 |
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 |
9 | */ |
10 | |
11 | /* |
12 | * "I sit beside the fire and think of all that I have seen." --Bilbo |
79072805 |
13 | */ |
14 | |
d5afce77 |
15 | /* |
16 | =head1 Hash Manipulation Functions |
166f8a29 |
17 | |
18 | A HV structure represents a Perl hash. It consists mainly of an array |
19 | of pointers, each of which points to a linked list of HE structures. The |
20 | array is indexed by the hash function of the key, so each linked list |
21 | represents all the hash entries with the same hash value. Each HE contains |
22 | a pointer to the actual value, plus a pointer to a HEK structure which |
23 | holds the key and hash value. |
24 | |
25 | =cut |
26 | |
d5afce77 |
27 | */ |
28 | |
79072805 |
29 | #include "EXTERN.h" |
864dbfa3 |
30 | #define PERL_IN_HV_C |
3d78eb94 |
31 | #define PERL_HASH_INTERNAL_ACCESS |
79072805 |
32 | #include "perl.h" |
33 | |
d8012aaf |
34 | #define HV_MAX_LENGTH_BEFORE_SPLIT 14 |
fdcd69b6 |
35 | |
d75ce684 |
36 | static const char S_strtab_error[] |
5d2b1485 |
37 | = "Cannot modify shared string table in hv_%s"; |
38 | |
cac9b346 |
39 | STATIC void |
40 | S_more_he(pTHX) |
41 | { |
97aff369 |
42 | dVAR; |
1e05feb3 |
43 | HE* he = (HE*) Perl_get_arena(aTHX_ PERL_ARENA_SIZE, HE_SVSLOT); |
44 | HE * const heend = &he[PERL_ARENA_SIZE / sizeof(HE) - 1]; |
cac9b346 |
45 | |
d2a0f284 |
46 | PL_body_roots[HE_SVSLOT] = he; |
cac9b346 |
47 | while (he < heend) { |
48 | HeNEXT(he) = (HE*)(he + 1); |
49 | he++; |
50 | } |
51 | HeNEXT(he) = 0; |
52 | } |
53 | |
c941fb51 |
54 | #ifdef PURIFY |
55 | |
56 | #define new_HE() (HE*)safemalloc(sizeof(HE)) |
57 | #define del_HE(p) safefree((char*)p) |
58 | |
59 | #else |
60 | |
76e3520e |
61 | STATIC HE* |
cea2e8a9 |
62 | S_new_he(pTHX) |
4633a7c4 |
63 | { |
97aff369 |
64 | dVAR; |
4633a7c4 |
65 | HE* he; |
0bd48802 |
66 | void ** const root = &PL_body_roots[HE_SVSLOT]; |
6a93a7e5 |
67 | |
6a93a7e5 |
68 | if (!*root) |
cac9b346 |
69 | S_more_he(aTHX); |
10edeb5d |
70 | he = (HE*) *root; |
ce3e5c45 |
71 | assert(he); |
6a93a7e5 |
72 | *root = HeNEXT(he); |
333f433b |
73 | return he; |
4633a7c4 |
74 | } |
75 | |
c941fb51 |
76 | #define new_HE() new_he() |
77 | #define del_HE(p) \ |
78 | STMT_START { \ |
6a93a7e5 |
79 | HeNEXT(p) = (HE*)(PL_body_roots[HE_SVSLOT]); \ |
80 | PL_body_roots[HE_SVSLOT] = p; \ |
c941fb51 |
81 | } STMT_END |
d33b2eba |
82 | |
d33b2eba |
83 | |
d33b2eba |
84 | |
85 | #endif |
86 | |
76e3520e |
87 | STATIC HEK * |
5f66b61c |
88 | S_save_hek_flags(const char *str, I32 len, U32 hash, int flags) |
bbce6d69 |
89 | { |
35a4481c |
90 | const int flags_masked = flags & HVhek_MASK; |
bbce6d69 |
91 | char *k; |
92 | register HEK *hek; |
1c846c1f |
93 | |
a02a5408 |
94 | Newx(k, HEK_BASESIZE + len + 2, char); |
bbce6d69 |
95 | hek = (HEK*)k; |
ff68c719 |
96 | Copy(str, HEK_KEY(hek), len, char); |
e05949c7 |
97 | HEK_KEY(hek)[len] = 0; |
ff68c719 |
98 | HEK_LEN(hek) = len; |
99 | HEK_HASH(hek) = hash; |
45e34800 |
100 | HEK_FLAGS(hek) = (unsigned char)flags_masked | HVhek_UNSHARED; |
dcf933a4 |
101 | |
102 | if (flags & HVhek_FREEKEY) |
103 | Safefree(str); |
bbce6d69 |
104 | return hek; |
105 | } |
106 | |
4a31713e |
107 | /* free the pool of temporary HE/HEK pairs returned by hv_fetch_ent |
dd28f7bb |
108 | * for tied hashes */ |
109 | |
110 | void |
111 | Perl_free_tied_hv_pool(pTHX) |
112 | { |
97aff369 |
113 | dVAR; |
dd28f7bb |
114 | HE *he = PL_hv_fetch_ent_mh; |
115 | while (he) { |
9d4ba2ae |
116 | HE * const ohe = he; |
dd28f7bb |
117 | Safefree(HeKEY_hek(he)); |
dd28f7bb |
118 | he = HeNEXT(he); |
119 | del_HE(ohe); |
120 | } |
4608196e |
121 | PL_hv_fetch_ent_mh = NULL; |
dd28f7bb |
122 | } |
123 | |
d18c6117 |
124 | #if defined(USE_ITHREADS) |
0bff533c |
125 | HEK * |
126 | Perl_hek_dup(pTHX_ HEK *source, CLONE_PARAMS* param) |
127 | { |
658b4a4a |
128 | HEK *shared = (HEK*)ptr_table_fetch(PL_ptr_table, source); |
9d4ba2ae |
129 | |
130 | PERL_UNUSED_ARG(param); |
0bff533c |
131 | |
132 | if (shared) { |
133 | /* We already shared this hash key. */ |
454f1e26 |
134 | (void)share_hek_hek(shared); |
0bff533c |
135 | } |
136 | else { |
658b4a4a |
137 | shared |
6e838c70 |
138 | = share_hek_flags(HEK_KEY(source), HEK_LEN(source), |
139 | HEK_HASH(source), HEK_FLAGS(source)); |
658b4a4a |
140 | ptr_table_store(PL_ptr_table, source, shared); |
0bff533c |
141 | } |
658b4a4a |
142 | return shared; |
0bff533c |
143 | } |
144 | |
d18c6117 |
145 | HE * |
5c4138a0 |
146 | Perl_he_dup(pTHX_ const HE *e, bool shared, CLONE_PARAMS* param) |
d18c6117 |
147 | { |
148 | HE *ret; |
149 | |
150 | if (!e) |
4608196e |
151 | return NULL; |
7766f137 |
152 | /* look for it in the table first */ |
153 | ret = (HE*)ptr_table_fetch(PL_ptr_table, e); |
154 | if (ret) |
155 | return ret; |
156 | |
157 | /* create anew and remember what it is */ |
d33b2eba |
158 | ret = new_HE(); |
7766f137 |
159 | ptr_table_store(PL_ptr_table, e, ret); |
160 | |
d2d73c3e |
161 | HeNEXT(ret) = he_dup(HeNEXT(e),shared, param); |
dd28f7bb |
162 | if (HeKLEN(e) == HEf_SVKEY) { |
163 | char *k; |
a02a5408 |
164 | Newx(k, HEK_BASESIZE + sizeof(SV*), char); |
dd28f7bb |
165 | HeKEY_hek(ret) = (HEK*)k; |
d2d73c3e |
166 | HeKEY_sv(ret) = SvREFCNT_inc(sv_dup(HeKEY_sv(e), param)); |
dd28f7bb |
167 | } |
c21d1a0f |
168 | else if (shared) { |
0bff533c |
169 | /* This is hek_dup inlined, which seems to be important for speed |
170 | reasons. */ |
1b6737cc |
171 | HEK * const source = HeKEY_hek(e); |
658b4a4a |
172 | HEK *shared = (HEK*)ptr_table_fetch(PL_ptr_table, source); |
c21d1a0f |
173 | |
174 | if (shared) { |
175 | /* We already shared this hash key. */ |
454f1e26 |
176 | (void)share_hek_hek(shared); |
c21d1a0f |
177 | } |
178 | else { |
658b4a4a |
179 | shared |
6e838c70 |
180 | = share_hek_flags(HEK_KEY(source), HEK_LEN(source), |
181 | HEK_HASH(source), HEK_FLAGS(source)); |
658b4a4a |
182 | ptr_table_store(PL_ptr_table, source, shared); |
c21d1a0f |
183 | } |
658b4a4a |
184 | HeKEY_hek(ret) = shared; |
c21d1a0f |
185 | } |
d18c6117 |
186 | else |
19692e8d |
187 | HeKEY_hek(ret) = save_hek_flags(HeKEY(e), HeKLEN(e), HeHASH(e), |
188 | HeKFLAGS(e)); |
d2d73c3e |
189 | HeVAL(ret) = SvREFCNT_inc(sv_dup(HeVAL(e), param)); |
d18c6117 |
190 | return ret; |
191 | } |
192 | #endif /* USE_ITHREADS */ |
193 | |
1b1f1335 |
194 | static void |
2393f1b9 |
195 | S_hv_notallowed(pTHX_ int flags, const char *key, I32 klen, |
196 | const char *msg) |
1b1f1335 |
197 | { |
1b6737cc |
198 | SV * const sv = sv_newmortal(); |
19692e8d |
199 | if (!(flags & HVhek_FREEKEY)) { |
1b1f1335 |
200 | sv_setpvn(sv, key, klen); |
201 | } |
202 | else { |
203 | /* Need to free saved eventually assign to mortal SV */ |
34c3c4e3 |
204 | /* XXX is this line an error ???: SV *sv = sv_newmortal(); */ |
1b1f1335 |
205 | sv_usepvn(sv, (char *) key, klen); |
206 | } |
19692e8d |
207 | if (flags & HVhek_UTF8) { |
1b1f1335 |
208 | SvUTF8_on(sv); |
209 | } |
be2597df |
210 | Perl_croak(aTHX_ msg, SVfARG(sv)); |
1b1f1335 |
211 | } |
212 | |
fde52b5c |
213 | /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot |
214 | * contains an SV* */ |
215 | |
34a6f7b4 |
216 | /* |
217 | =for apidoc hv_store |
218 | |
219 | Stores an SV in a hash. The hash key is specified as C<key> and C<klen> is |
220 | the length of the key. The C<hash> parameter is the precomputed hash |
221 | value; if it is zero then Perl will compute it. The return value will be |
222 | NULL if the operation failed or if the value did not need to be actually |
223 | stored within the hash (as in the case of tied hashes). Otherwise it can |
224 | be dereferenced to get the original C<SV*>. Note that the caller is |
225 | responsible for suitably incrementing the reference count of C<val> before |
226 | the call, and decrementing it if the function returned NULL. Effectively |
227 | a successful hv_store takes ownership of one reference to C<val>. This is |
228 | usually what you want; a newly created SV has a reference count of one, so |
229 | if all your code does is create SVs then store them in a hash, hv_store |
230 | will own the only reference to the new SV, and your code doesn't need to do |
231 | anything further to tidy up. hv_store is not implemented as a call to |
232 | hv_store_ent, and does not create a temporary SV for the key, so if your |
233 | key data is not already in SV form then use hv_store in preference to |
234 | hv_store_ent. |
235 | |
236 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more |
237 | information on how to use this function on tied hashes. |
238 | |
34a6f7b4 |
239 | =for apidoc hv_store_ent |
240 | |
241 | Stores C<val> in a hash. The hash key is specified as C<key>. The C<hash> |
242 | parameter is the precomputed hash value; if it is zero then Perl will |
243 | compute it. The return value is the new hash entry so created. It will be |
244 | NULL if the operation failed or if the value did not need to be actually |
245 | stored within the hash (as in the case of tied hashes). Otherwise the |
246 | contents of the return value can be accessed using the C<He?> macros |
247 | described here. Note that the caller is responsible for suitably |
248 | incrementing the reference count of C<val> before the call, and |
249 | decrementing it if the function returned NULL. Effectively a successful |
250 | hv_store_ent takes ownership of one reference to C<val>. This is |
251 | usually what you want; a newly created SV has a reference count of one, so |
252 | if all your code does is create SVs then store them in a hash, hv_store |
253 | will own the only reference to the new SV, and your code doesn't need to do |
254 | anything further to tidy up. Note that hv_store_ent only reads the C<key>; |
255 | unlike C<val> it does not take ownership of it, so maintaining the correct |
256 | reference count on C<key> is entirely the caller's responsibility. hv_store |
257 | is not implemented as a call to hv_store_ent, and does not create a temporary |
258 | SV for the key, so if your key data is not already in SV form then use |
259 | hv_store in preference to hv_store_ent. |
260 | |
261 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more |
262 | information on how to use this function on tied hashes. |
263 | |
34a6f7b4 |
264 | =for apidoc hv_exists |
265 | |
266 | Returns a boolean indicating whether the specified hash key exists. The |
267 | C<klen> is the length of the key. |
268 | |
954c1994 |
269 | =for apidoc hv_fetch |
270 | |
271 | Returns the SV which corresponds to the specified key in the hash. The |
272 | C<klen> is the length of the key. If C<lval> is set then the fetch will be |
273 | part of a store. Check that the return value is non-null before |
d1be9408 |
274 | dereferencing it to an C<SV*>. |
954c1994 |
275 | |
96f1132b |
276 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more |
954c1994 |
277 | information on how to use this function on tied hashes. |
278 | |
34a6f7b4 |
279 | =for apidoc hv_exists_ent |
280 | |
281 | Returns a boolean indicating whether the specified hash key exists. C<hash> |
282 | can be a valid precomputed hash value, or 0 to ask for it to be |
283 | computed. |
284 | |
285 | =cut |
286 | */ |
287 | |
d1be9408 |
288 | /* returns an HE * structure with the all fields set */ |
fde52b5c |
289 | /* note that hent_val will be a mortal sv for MAGICAL hashes */ |
954c1994 |
290 | /* |
291 | =for apidoc hv_fetch_ent |
292 | |
293 | Returns the hash entry which corresponds to the specified key in the hash. |
294 | C<hash> must be a valid precomputed hash number for the given C<key>, or 0 |
295 | if you want the function to compute it. IF C<lval> is set then the fetch |
296 | will be part of a store. Make sure the return value is non-null before |
297 | accessing it. The return value when C<tb> is a tied hash is a pointer to a |
298 | static location, so be sure to make a copy of the structure if you need to |
1c846c1f |
299 | store it somewhere. |
954c1994 |
300 | |
96f1132b |
301 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more |
954c1994 |
302 | information on how to use this function on tied hashes. |
303 | |
304 | =cut |
305 | */ |
306 | |
a038e571 |
307 | /* Common code for hv_delete()/hv_exists()/hv_fetch()/hv_store() */ |
308 | void * |
309 | Perl_hv_common_key_len(pTHX_ HV *hv, const char *key, I32 klen_i32, |
310 | const int action, SV *val, const U32 hash) |
311 | { |
312 | STRLEN klen; |
313 | int flags; |
314 | |
315 | if (klen_i32 < 0) { |
316 | klen = -klen_i32; |
317 | flags = HVhek_UTF8; |
318 | } else { |
319 | klen = klen_i32; |
320 | flags = 0; |
321 | } |
322 | return hv_common(hv, NULL, key, klen, flags, action, val, hash); |
323 | } |
324 | |
63c89345 |
325 | void * |
d3ba3f5c |
326 | Perl_hv_common(pTHX_ HV *hv, SV *keysv, const char *key, STRLEN klen, |
327 | int flags, int action, SV *val, register U32 hash) |
113738bb |
328 | { |
27da23d5 |
329 | dVAR; |
b2c64049 |
330 | XPVHV* xhv; |
b2c64049 |
331 | HE *entry; |
332 | HE **oentry; |
fde52b5c |
333 | SV *sv; |
da58a35d |
334 | bool is_utf8; |
113738bb |
335 | int masked_flags; |
3c84c864 |
336 | const int return_svp = action & HV_FETCH_JUST_SV; |
fde52b5c |
337 | |
338 | if (!hv) |
a4fc7abc |
339 | return NULL; |
8265e3d1 |
340 | if (SvTYPE(hv) == SVTYPEMASK) |
341 | return NULL; |
342 | |
343 | assert(SvTYPE(hv) == SVt_PVHV); |
fde52b5c |
344 | |
bdee33e4 |
345 | if (SvSMAGICAL(hv) && SvGMAGICAL(hv) && !(action & HV_DISABLE_UVAR_XKEY)) { |
fda2d18a |
346 | MAGIC* mg; |
347 | if ((mg = mg_find((SV*)hv, PERL_MAGIC_uvar))) { |
348 | struct ufuncs * const uf = (struct ufuncs *)mg->mg_ptr; |
349 | if (uf->uf_set == NULL) { |
350 | SV* obj = mg->mg_obj; |
351 | |
352 | if (!keysv) { |
353 | keysv = sv_2mortal(newSVpvn(key, klen)); |
354 | if (flags & HVhek_UTF8) |
355 | SvUTF8_on(keysv); |
356 | } |
357 | |
358 | mg->mg_obj = keysv; /* pass key */ |
359 | uf->uf_index = action; /* pass action */ |
360 | magic_getuvar((SV*)hv, mg); |
361 | keysv = mg->mg_obj; /* may have changed */ |
362 | mg->mg_obj = obj; |
363 | |
364 | /* If the key may have changed, then we need to invalidate |
365 | any passed-in computed hash value. */ |
366 | hash = 0; |
367 | } |
368 | } |
bdee33e4 |
369 | } |
113738bb |
370 | if (keysv) { |
e593d2fe |
371 | if (flags & HVhek_FREEKEY) |
372 | Safefree(key); |
5c144d81 |
373 | key = SvPV_const(keysv, klen); |
c1fe5510 |
374 | flags = 0; |
113738bb |
375 | is_utf8 = (SvUTF8(keysv) != 0); |
376 | } else { |
c1fe5510 |
377 | is_utf8 = ((flags & HVhek_UTF8) ? TRUE : FALSE); |
113738bb |
378 | } |
113738bb |
379 | |
9dbc5603 |
380 | if (action & HV_DELETE) { |
3c84c864 |
381 | return (void *) hv_delete_common(hv, keysv, key, klen, |
382 | flags | (is_utf8 ? HVhek_UTF8 : 0), |
383 | action, hash); |
9dbc5603 |
384 | } |
385 | |
b2c64049 |
386 | xhv = (XPVHV*)SvANY(hv); |
7f66fda2 |
387 | if (SvMAGICAL(hv)) { |
6136c704 |
388 | if (SvRMAGICAL(hv) && !(action & (HV_FETCH_ISSTORE|HV_FETCH_ISEXISTS))) { |
44a2ac75 |
389 | if ( mg_find((SV*)hv, PERL_MAGIC_tied) || SvGMAGICAL((SV*)hv)) |
e62cc96a |
390 | { |
3c84c864 |
391 | /* FIXME should be able to skimp on the HE/HEK here when |
7f66fda2 |
392 | HV_FETCH_JUST_SV is true. */ |
7f66fda2 |
393 | if (!keysv) { |
394 | keysv = newSVpvn(key, klen); |
395 | if (is_utf8) { |
396 | SvUTF8_on(keysv); |
397 | } |
398 | } else { |
399 | keysv = newSVsv(keysv); |
113738bb |
400 | } |
44a2ac75 |
401 | sv = sv_newmortal(); |
402 | mg_copy((SV*)hv, sv, (char *)keysv, HEf_SVKEY); |
7f66fda2 |
403 | |
404 | /* grab a fake HE/HEK pair from the pool or make a new one */ |
405 | entry = PL_hv_fetch_ent_mh; |
406 | if (entry) |
407 | PL_hv_fetch_ent_mh = HeNEXT(entry); |
408 | else { |
409 | char *k; |
410 | entry = new_HE(); |
a02a5408 |
411 | Newx(k, HEK_BASESIZE + sizeof(SV*), char); |
7f66fda2 |
412 | HeKEY_hek(entry) = (HEK*)k; |
413 | } |
4608196e |
414 | HeNEXT(entry) = NULL; |
7f66fda2 |
415 | HeSVKEY_set(entry, keysv); |
416 | HeVAL(entry) = sv; |
417 | sv_upgrade(sv, SVt_PVLV); |
418 | LvTYPE(sv) = 'T'; |
419 | /* so we can free entry when freeing sv */ |
420 | LvTARG(sv) = (SV*)entry; |
421 | |
422 | /* XXX remove at some point? */ |
423 | if (flags & HVhek_FREEKEY) |
424 | Safefree(key); |
425 | |
3c84c864 |
426 | if (return_svp) { |
427 | return entry ? (void *) &HeVAL(entry) : NULL; |
428 | } |
429 | return (void *) entry; |
113738bb |
430 | } |
7f66fda2 |
431 | #ifdef ENV_IS_CASELESS |
432 | else if (mg_find((SV*)hv, PERL_MAGIC_env)) { |
433 | U32 i; |
434 | for (i = 0; i < klen; ++i) |
435 | if (isLOWER(key[i])) { |
086cb327 |
436 | /* Would be nice if we had a routine to do the |
437 | copy and upercase in a single pass through. */ |
0bd48802 |
438 | const char * const nkey = strupr(savepvn(key,klen)); |
086cb327 |
439 | /* Note that this fetch is for nkey (the uppercased |
440 | key) whereas the store is for key (the original) */ |
63c89345 |
441 | void *result = hv_common(hv, NULL, nkey, klen, |
442 | HVhek_FREEKEY, /* free nkey */ |
443 | 0 /* non-LVAL fetch */ |
3c84c864 |
444 | | HV_DISABLE_UVAR_XKEY |
445 | | return_svp, |
63c89345 |
446 | NULL /* no value */, |
447 | 0 /* compute hash */); |
26488bcf |
448 | if (!result && (action & HV_FETCH_LVALUE)) { |
086cb327 |
449 | /* This call will free key if necessary. |
450 | Do it this way to encourage compiler to tail |
451 | call optimise. */ |
63c89345 |
452 | result = hv_common(hv, keysv, key, klen, flags, |
453 | HV_FETCH_ISSTORE |
3c84c864 |
454 | | HV_DISABLE_UVAR_XKEY |
455 | | return_svp, |
63c89345 |
456 | newSV(0), hash); |
086cb327 |
457 | } else { |
458 | if (flags & HVhek_FREEKEY) |
459 | Safefree(key); |
460 | } |
63c89345 |
461 | return result; |
7f66fda2 |
462 | } |
902173a3 |
463 | } |
7f66fda2 |
464 | #endif |
465 | } /* ISFETCH */ |
466 | else if (SvRMAGICAL(hv) && (action & HV_FETCH_ISEXISTS)) { |
467 | if (mg_find((SV*)hv, PERL_MAGIC_tied) || SvGMAGICAL((SV*)hv)) { |
b2c64049 |
468 | /* I don't understand why hv_exists_ent has svret and sv, |
469 | whereas hv_exists only had one. */ |
9d4ba2ae |
470 | SV * const svret = sv_newmortal(); |
b2c64049 |
471 | sv = sv_newmortal(); |
7f66fda2 |
472 | |
473 | if (keysv || is_utf8) { |
474 | if (!keysv) { |
475 | keysv = newSVpvn(key, klen); |
476 | SvUTF8_on(keysv); |
477 | } else { |
478 | keysv = newSVsv(keysv); |
479 | } |
b2c64049 |
480 | mg_copy((SV*)hv, sv, (char *)sv_2mortal(keysv), HEf_SVKEY); |
481 | } else { |
482 | mg_copy((SV*)hv, sv, key, klen); |
7f66fda2 |
483 | } |
b2c64049 |
484 | if (flags & HVhek_FREEKEY) |
485 | Safefree(key); |
7f66fda2 |
486 | magic_existspack(svret, mg_find(sv, PERL_MAGIC_tiedelem)); |
487 | /* This cast somewhat evil, but I'm merely using NULL/ |
488 | not NULL to return the boolean exists. |
489 | And I know hv is not NULL. */ |
3c84c864 |
490 | return SvTRUE(svret) ? (void *)hv : NULL; |
e7152ba2 |
491 | } |
7f66fda2 |
492 | #ifdef ENV_IS_CASELESS |
493 | else if (mg_find((SV*)hv, PERL_MAGIC_env)) { |
494 | /* XXX This code isn't UTF8 clean. */ |
a15d23f8 |
495 | char * const keysave = (char * const)key; |
b2c64049 |
496 | /* Will need to free this, so set FREEKEY flag. */ |
497 | key = savepvn(key,klen); |
498 | key = (const char*)strupr((char*)key); |
6136c704 |
499 | is_utf8 = FALSE; |
7f66fda2 |
500 | hash = 0; |
8b4f7dd5 |
501 | keysv = 0; |
b2c64049 |
502 | |
503 | if (flags & HVhek_FREEKEY) { |
504 | Safefree(keysave); |
505 | } |
506 | flags |= HVhek_FREEKEY; |
7f66fda2 |
507 | } |
902173a3 |
508 | #endif |
7f66fda2 |
509 | } /* ISEXISTS */ |
b2c64049 |
510 | else if (action & HV_FETCH_ISSTORE) { |
511 | bool needs_copy; |
512 | bool needs_store; |
513 | hv_magic_check (hv, &needs_copy, &needs_store); |
514 | if (needs_copy) { |
a3b680e6 |
515 | const bool save_taint = PL_tainted; |
b2c64049 |
516 | if (keysv || is_utf8) { |
517 | if (!keysv) { |
518 | keysv = newSVpvn(key, klen); |
519 | SvUTF8_on(keysv); |
520 | } |
521 | if (PL_tainting) |
522 | PL_tainted = SvTAINTED(keysv); |
523 | keysv = sv_2mortal(newSVsv(keysv)); |
524 | mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY); |
525 | } else { |
526 | mg_copy((SV*)hv, val, key, klen); |
527 | } |
528 | |
529 | TAINT_IF(save_taint); |
1baaf5d7 |
530 | if (!needs_store) { |
b2c64049 |
531 | if (flags & HVhek_FREEKEY) |
532 | Safefree(key); |
4608196e |
533 | return NULL; |
b2c64049 |
534 | } |
535 | #ifdef ENV_IS_CASELESS |
536 | else if (mg_find((SV*)hv, PERL_MAGIC_env)) { |
537 | /* XXX This code isn't UTF8 clean. */ |
538 | const char *keysave = key; |
539 | /* Will need to free this, so set FREEKEY flag. */ |
540 | key = savepvn(key,klen); |
541 | key = (const char*)strupr((char*)key); |
6136c704 |
542 | is_utf8 = FALSE; |
b2c64049 |
543 | hash = 0; |
8b4f7dd5 |
544 | keysv = 0; |
b2c64049 |
545 | |
546 | if (flags & HVhek_FREEKEY) { |
547 | Safefree(keysave); |
548 | } |
549 | flags |= HVhek_FREEKEY; |
550 | } |
551 | #endif |
552 | } |
553 | } /* ISSTORE */ |
7f66fda2 |
554 | } /* SvMAGICAL */ |
fde52b5c |
555 | |
7b2c381c |
556 | if (!HvARRAY(hv)) { |
b2c64049 |
557 | if ((action & (HV_FETCH_LVALUE | HV_FETCH_ISSTORE)) |
fde52b5c |
558 | #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */ |
8aacddc1 |
559 | || (SvRMAGICAL((SV*)hv) && mg_find((SV*)hv, PERL_MAGIC_env)) |
fde52b5c |
560 | #endif |
d58e6666 |
561 | ) { |
562 | char *array; |
a02a5408 |
563 | Newxz(array, |
cbec9347 |
564 | PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max+1 /* HvMAX(hv)+1 */), |
d58e6666 |
565 | char); |
566 | HvARRAY(hv) = (HE**)array; |
567 | } |
7f66fda2 |
568 | #ifdef DYNAMIC_ENV_FETCH |
569 | else if (action & HV_FETCH_ISEXISTS) { |
570 | /* for an %ENV exists, if we do an insert it's by a recursive |
571 | store call, so avoid creating HvARRAY(hv) right now. */ |
572 | } |
573 | #endif |
113738bb |
574 | else { |
575 | /* XXX remove at some point? */ |
576 | if (flags & HVhek_FREEKEY) |
577 | Safefree(key); |
578 | |
3c84c864 |
579 | return NULL; |
113738bb |
580 | } |
fde52b5c |
581 | } |
582 | |
19692e8d |
583 | if (is_utf8) { |
41d88b63 |
584 | char * const keysave = (char *)key; |
f9a63242 |
585 | key = (char*)bytes_from_utf8((U8*)key, &klen, &is_utf8); |
19692e8d |
586 | if (is_utf8) |
c1fe5510 |
587 | flags |= HVhek_UTF8; |
588 | else |
589 | flags &= ~HVhek_UTF8; |
7f66fda2 |
590 | if (key != keysave) { |
591 | if (flags & HVhek_FREEKEY) |
592 | Safefree(keysave); |
19692e8d |
593 | flags |= HVhek_WASUTF8 | HVhek_FREEKEY; |
7f66fda2 |
594 | } |
19692e8d |
595 | } |
f9a63242 |
596 | |
4b5190b5 |
597 | if (HvREHASH(hv)) { |
598 | PERL_HASH_INTERNAL(hash, key, klen); |
b2c64049 |
599 | /* We don't have a pointer to the hv, so we have to replicate the |
600 | flag into every HEK, so that hv_iterkeysv can see it. */ |
601 | /* And yes, you do need this even though you are not "storing" because |
fdcd69b6 |
602 | you can flip the flags below if doing an lval lookup. (And that |
603 | was put in to give the semantics Andreas was expecting.) */ |
604 | flags |= HVhek_REHASH; |
4b5190b5 |
605 | } else if (!hash) { |
113738bb |
606 | if (keysv && (SvIsCOW_shared_hash(keysv))) { |
c158a4fd |
607 | hash = SvSHARED_HASH(keysv); |
46187eeb |
608 | } else { |
609 | PERL_HASH(hash, key, klen); |
610 | } |
611 | } |
effa1e2d |
612 | |
113738bb |
613 | masked_flags = (flags & HVhek_MASK); |
614 | |
7f66fda2 |
615 | #ifdef DYNAMIC_ENV_FETCH |
4608196e |
616 | if (!HvARRAY(hv)) entry = NULL; |
7f66fda2 |
617 | else |
618 | #endif |
b2c64049 |
619 | { |
7b2c381c |
620 | entry = (HvARRAY(hv))[hash & (I32) HvMAX(hv)]; |
b2c64049 |
621 | } |
0298d7b9 |
622 | for (; entry; entry = HeNEXT(entry)) { |
fde52b5c |
623 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
624 | continue; |
eb160463 |
625 | if (HeKLEN(entry) != (I32)klen) |
fde52b5c |
626 | continue; |
1c846c1f |
627 | if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */ |
fde52b5c |
628 | continue; |
113738bb |
629 | if ((HeKFLAGS(entry) ^ masked_flags) & HVhek_UTF8) |
c3654f1a |
630 | continue; |
b2c64049 |
631 | |
632 | if (action & (HV_FETCH_LVALUE|HV_FETCH_ISSTORE)) { |
633 | if (HeKFLAGS(entry) != masked_flags) { |
634 | /* We match if HVhek_UTF8 bit in our flags and hash key's |
635 | match. But if entry was set previously with HVhek_WASUTF8 |
636 | and key now doesn't (or vice versa) then we should change |
637 | the key's flag, as this is assignment. */ |
638 | if (HvSHAREKEYS(hv)) { |
639 | /* Need to swap the key we have for a key with the flags we |
640 | need. As keys are shared we can't just write to the |
641 | flag, so we share the new one, unshare the old one. */ |
6136c704 |
642 | HEK * const new_hek = share_hek_flags(key, klen, hash, |
6e838c70 |
643 | masked_flags); |
b2c64049 |
644 | unshare_hek (HeKEY_hek(entry)); |
645 | HeKEY_hek(entry) = new_hek; |
646 | } |
5d2b1485 |
647 | else if (hv == PL_strtab) { |
648 | /* PL_strtab is usually the only hash without HvSHAREKEYS, |
649 | so putting this test here is cheap */ |
650 | if (flags & HVhek_FREEKEY) |
651 | Safefree(key); |
652 | Perl_croak(aTHX_ S_strtab_error, |
653 | action & HV_FETCH_LVALUE ? "fetch" : "store"); |
654 | } |
b2c64049 |
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. */ |
561b68a9 |
676 | val = newSV(0); |
ca732855 |
677 | HvPLACEHOLDERS(hv)--; |
b2c64049 |
678 | } else { |
679 | /* store */ |
680 | if (val != &PL_sv_placeholder) |
ca732855 |
681 | HvPLACEHOLDERS(hv)--; |
b2c64049 |
682 | } |
683 | HeVAL(entry) = val; |
684 | } else if (action & HV_FETCH_ISSTORE) { |
685 | SvREFCNT_dec(HeVAL(entry)); |
686 | HeVAL(entry) = val; |
687 | } |
27bcc0a7 |
688 | } else if (HeVAL(entry) == &PL_sv_placeholder) { |
b2c64049 |
689 | /* if we find a placeholder, we pretend we haven't found |
690 | anything */ |
8aacddc1 |
691 | break; |
b2c64049 |
692 | } |
113738bb |
693 | if (flags & HVhek_FREEKEY) |
694 | Safefree(key); |
3c84c864 |
695 | if (return_svp) { |
696 | return entry ? (void *) &HeVAL(entry) : NULL; |
697 | } |
fde52b5c |
698 | return entry; |
699 | } |
700 | #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */ |
0ed29950 |
701 | if (!(action & HV_FETCH_ISSTORE) |
702 | && SvRMAGICAL((SV*)hv) && mg_find((SV*)hv, PERL_MAGIC_env)) { |
a6c40364 |
703 | unsigned long len; |
9d4ba2ae |
704 | const char * const env = PerlEnv_ENVgetenv_len(key,&len); |
a6c40364 |
705 | if (env) { |
706 | sv = newSVpvn(env,len); |
707 | SvTAINTED_on(sv); |
d3ba3f5c |
708 | return hv_common(hv, keysv, key, klen, flags, |
3c84c864 |
709 | HV_FETCH_ISSTORE|HV_DISABLE_UVAR_XKEY|return_svp, |
710 | sv, hash); |
a6c40364 |
711 | } |
fde52b5c |
712 | } |
713 | #endif |
7f66fda2 |
714 | |
715 | if (!entry && SvREADONLY(hv) && !(action & HV_FETCH_ISEXISTS)) { |
c445ea15 |
716 | hv_notallowed(flags, key, klen, |
c8cd6465 |
717 | "Attempt to access disallowed key '%"SVf"' in" |
718 | " a restricted hash"); |
1b1f1335 |
719 | } |
b2c64049 |
720 | if (!(action & (HV_FETCH_LVALUE|HV_FETCH_ISSTORE))) { |
721 | /* Not doing some form of store, so return failure. */ |
722 | if (flags & HVhek_FREEKEY) |
723 | Safefree(key); |
3c84c864 |
724 | return NULL; |
b2c64049 |
725 | } |
113738bb |
726 | if (action & HV_FETCH_LVALUE) { |
561b68a9 |
727 | val = newSV(0); |
b2c64049 |
728 | if (SvMAGICAL(hv)) { |
729 | /* At this point the old hv_fetch code would call to hv_store, |
730 | which in turn might do some tied magic. So we need to make that |
731 | magic check happen. */ |
732 | /* gonna assign to this, so it better be there */ |
fda2d18a |
733 | /* If a fetch-as-store fails on the fetch, then the action is to |
734 | recurse once into "hv_store". If we didn't do this, then that |
735 | recursive call would call the key conversion routine again. |
736 | However, as we replace the original key with the converted |
737 | key, this would result in a double conversion, which would show |
738 | up as a bug if the conversion routine is not idempotent. */ |
d3ba3f5c |
739 | return hv_common(hv, keysv, key, klen, flags, |
3c84c864 |
740 | HV_FETCH_ISSTORE|HV_DISABLE_UVAR_XKEY|return_svp, |
741 | val, hash); |
b2c64049 |
742 | /* XXX Surely that could leak if the fetch-was-store fails? |
743 | Just like the hv_fetch. */ |
113738bb |
744 | } |
745 | } |
746 | |
b2c64049 |
747 | /* Welcome to hv_store... */ |
748 | |
7b2c381c |
749 | if (!HvARRAY(hv)) { |
b2c64049 |
750 | /* Not sure if we can get here. I think the only case of oentry being |
751 | NULL is for %ENV with dynamic env fetch. But that should disappear |
752 | with magic in the previous code. */ |
d58e6666 |
753 | char *array; |
a02a5408 |
754 | Newxz(array, |
b2c64049 |
755 | PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max+1 /* HvMAX(hv)+1 */), |
d58e6666 |
756 | char); |
757 | HvARRAY(hv) = (HE**)array; |
b2c64049 |
758 | } |
759 | |
7b2c381c |
760 | oentry = &(HvARRAY(hv))[hash & (I32) xhv->xhv_max]; |
ab4af705 |
761 | |
b2c64049 |
762 | entry = new_HE(); |
763 | /* share_hek_flags will do the free for us. This might be considered |
764 | bad API design. */ |
765 | if (HvSHAREKEYS(hv)) |
6e838c70 |
766 | HeKEY_hek(entry) = share_hek_flags(key, klen, hash, flags); |
5d2b1485 |
767 | else if (hv == PL_strtab) { |
768 | /* PL_strtab is usually the only hash without HvSHAREKEYS, so putting |
769 | this test here is cheap */ |
770 | if (flags & HVhek_FREEKEY) |
771 | Safefree(key); |
772 | Perl_croak(aTHX_ S_strtab_error, |
773 | action & HV_FETCH_LVALUE ? "fetch" : "store"); |
774 | } |
b2c64049 |
775 | else /* gotta do the real thing */ |
776 | HeKEY_hek(entry) = save_hek_flags(key, klen, hash, flags); |
777 | HeVAL(entry) = val; |
778 | HeNEXT(entry) = *oentry; |
779 | *oentry = entry; |
780 | |
781 | if (val == &PL_sv_placeholder) |
ca732855 |
782 | HvPLACEHOLDERS(hv)++; |
b2c64049 |
783 | if (masked_flags & HVhek_ENABLEHVKFLAGS) |
784 | HvHASKFLAGS_on(hv); |
785 | |
0298d7b9 |
786 | { |
787 | const HE *counter = HeNEXT(entry); |
788 | |
4c7185a0 |
789 | xhv->xhv_keys++; /* HvTOTALKEYS(hv)++ */ |
0298d7b9 |
790 | if (!counter) { /* initial entry? */ |
791 | xhv->xhv_fill++; /* HvFILL(hv)++ */ |
792 | } else if (xhv->xhv_keys > (IV)xhv->xhv_max) { |
793 | hsplit(hv); |
794 | } else if(!HvREHASH(hv)) { |
795 | U32 n_links = 1; |
796 | |
797 | while ((counter = HeNEXT(counter))) |
798 | n_links++; |
799 | |
800 | if (n_links > HV_MAX_LENGTH_BEFORE_SPLIT) { |
801 | /* Use only the old HvKEYS(hv) > HvMAX(hv) condition to limit |
802 | bucket splits on a rehashed hash, as we're not going to |
803 | split it again, and if someone is lucky (evil) enough to |
804 | get all the keys in one list they could exhaust our memory |
805 | as we repeatedly double the number of buckets on every |
806 | entry. Linear search feels a less worse thing to do. */ |
807 | hsplit(hv); |
808 | } |
809 | } |
fde52b5c |
810 | } |
b2c64049 |
811 | |
3c84c864 |
812 | if (return_svp) { |
813 | return entry ? (void *) &HeVAL(entry) : NULL; |
814 | } |
815 | return (void *) entry; |
fde52b5c |
816 | } |
817 | |
864dbfa3 |
818 | STATIC void |
b0e6ae5b |
819 | S_hv_magic_check(HV *hv, bool *needs_copy, bool *needs_store) |
d0066dc7 |
820 | { |
a3b680e6 |
821 | const MAGIC *mg = SvMAGIC(hv); |
d0066dc7 |
822 | *needs_copy = FALSE; |
823 | *needs_store = TRUE; |
824 | while (mg) { |
825 | if (isUPPER(mg->mg_type)) { |
826 | *needs_copy = TRUE; |
d60c5a05 |
827 | if (mg->mg_type == PERL_MAGIC_tied) { |
d0066dc7 |
828 | *needs_store = FALSE; |
4ab2a30b |
829 | return; /* We've set all there is to set. */ |
d0066dc7 |
830 | } |
831 | } |
832 | mg = mg->mg_moremagic; |
833 | } |
834 | } |
835 | |
954c1994 |
836 | /* |
a3bcc51e |
837 | =for apidoc hv_scalar |
838 | |
839 | Evaluates the hash in scalar context and returns the result. Handles magic when the hash is tied. |
840 | |
841 | =cut |
842 | */ |
843 | |
844 | SV * |
845 | Perl_hv_scalar(pTHX_ HV *hv) |
846 | { |
a3bcc51e |
847 | SV *sv; |
823a54a3 |
848 | |
849 | if (SvRMAGICAL(hv)) { |
850 | MAGIC * const mg = mg_find((SV*)hv, PERL_MAGIC_tied); |
851 | if (mg) |
852 | return magic_scalarpack(hv, mg); |
853 | } |
a3bcc51e |
854 | |
855 | sv = sv_newmortal(); |
856 | if (HvFILL((HV*)hv)) |
857 | Perl_sv_setpvf(aTHX_ sv, "%ld/%ld", |
858 | (long)HvFILL(hv), (long)HvMAX(hv) + 1); |
859 | else |
860 | sv_setiv(sv, 0); |
861 | |
862 | return sv; |
863 | } |
864 | |
865 | /* |
954c1994 |
866 | =for apidoc hv_delete |
867 | |
868 | Deletes a key/value pair in the hash. The value SV is removed from the |
1c846c1f |
869 | hash and returned to the caller. The C<klen> is the length of the key. |
954c1994 |
870 | The C<flags> value will normally be zero; if set to G_DISCARD then NULL |
871 | will be returned. |
872 | |
954c1994 |
873 | =for apidoc hv_delete_ent |
874 | |
875 | Deletes a key/value pair in the hash. The value SV is removed from the |
876 | hash and returned to the caller. The C<flags> value will normally be zero; |
877 | if set to G_DISCARD then NULL will be returned. C<hash> can be a valid |
878 | precomputed hash value, or 0 to ask for it to be computed. |
879 | |
880 | =cut |
881 | */ |
882 | |
8f8d40ab |
883 | STATIC SV * |
cd6d36ac |
884 | S_hv_delete_common(pTHX_ HV *hv, SV *keysv, const char *key, STRLEN klen, |
885 | int k_flags, I32 d_flags, U32 hash) |
f1317c8d |
886 | { |
27da23d5 |
887 | dVAR; |
cbec9347 |
888 | register XPVHV* xhv; |
fde52b5c |
889 | register HE *entry; |
890 | register HE **oentry; |
9e720f71 |
891 | HE *const *first_entry; |
9dbc5603 |
892 | bool is_utf8 = (k_flags & HVhek_UTF8) ? TRUE : FALSE; |
7a9669ca |
893 | int masked_flags; |
1c846c1f |
894 | |
fde52b5c |
895 | if (SvRMAGICAL(hv)) { |
0a0bb7c7 |
896 | bool needs_copy; |
897 | bool needs_store; |
898 | hv_magic_check (hv, &needs_copy, &needs_store); |
899 | |
f1317c8d |
900 | if (needs_copy) { |
6136c704 |
901 | SV *sv; |
63c89345 |
902 | entry = (HE *) hv_common(hv, keysv, key, klen, |
903 | k_flags & ~HVhek_FREEKEY, |
904 | HV_FETCH_LVALUE|HV_DISABLE_UVAR_XKEY, |
905 | NULL, hash); |
7a9669ca |
906 | sv = entry ? HeVAL(entry) : NULL; |
f1317c8d |
907 | if (sv) { |
908 | if (SvMAGICAL(sv)) { |
909 | mg_clear(sv); |
910 | } |
911 | if (!needs_store) { |
912 | if (mg_find(sv, PERL_MAGIC_tiedelem)) { |
913 | /* No longer an element */ |
914 | sv_unmagic(sv, PERL_MAGIC_tiedelem); |
915 | return sv; |
916 | } |
a0714e2c |
917 | return NULL; /* element cannot be deleted */ |
f1317c8d |
918 | } |
902173a3 |
919 | #ifdef ENV_IS_CASELESS |
8167a60a |
920 | else if (mg_find((SV*)hv, PERL_MAGIC_env)) { |
921 | /* XXX This code isn't UTF8 clean. */ |
922 | keysv = sv_2mortal(newSVpvn(key,klen)); |
923 | if (k_flags & HVhek_FREEKEY) { |
924 | Safefree(key); |
925 | } |
926 | key = strupr(SvPVX(keysv)); |
927 | is_utf8 = 0; |
928 | k_flags = 0; |
929 | hash = 0; |
7f66fda2 |
930 | } |
510ac311 |
931 | #endif |
2fd1c6b8 |
932 | } |
2fd1c6b8 |
933 | } |
fde52b5c |
934 | } |
cbec9347 |
935 | xhv = (XPVHV*)SvANY(hv); |
7b2c381c |
936 | if (!HvARRAY(hv)) |
a0714e2c |
937 | return NULL; |
fde52b5c |
938 | |
19692e8d |
939 | if (is_utf8) { |
c445ea15 |
940 | const char * const keysave = key; |
b464bac0 |
941 | key = (char*)bytes_from_utf8((U8*)key, &klen, &is_utf8); |
cd6d36ac |
942 | |
19692e8d |
943 | if (is_utf8) |
cd6d36ac |
944 | k_flags |= HVhek_UTF8; |
945 | else |
946 | k_flags &= ~HVhek_UTF8; |
7f66fda2 |
947 | if (key != keysave) { |
948 | if (k_flags & HVhek_FREEKEY) { |
949 | /* This shouldn't happen if our caller does what we expect, |
950 | but strictly the API allows it. */ |
951 | Safefree(keysave); |
952 | } |
953 | k_flags |= HVhek_WASUTF8 | HVhek_FREEKEY; |
954 | } |
cd6d36ac |
955 | HvHASKFLAGS_on((SV*)hv); |
19692e8d |
956 | } |
f9a63242 |
957 | |
4b5190b5 |
958 | if (HvREHASH(hv)) { |
959 | PERL_HASH_INTERNAL(hash, key, klen); |
960 | } else if (!hash) { |
7a9669ca |
961 | if (keysv && (SvIsCOW_shared_hash(keysv))) { |
c158a4fd |
962 | hash = SvSHARED_HASH(keysv); |
7a9669ca |
963 | } else { |
964 | PERL_HASH(hash, key, klen); |
965 | } |
4b5190b5 |
966 | } |
fde52b5c |
967 | |
7a9669ca |
968 | masked_flags = (k_flags & HVhek_MASK); |
969 | |
9e720f71 |
970 | first_entry = oentry = &(HvARRAY(hv))[hash & (I32) HvMAX(hv)]; |
fde52b5c |
971 | entry = *oentry; |
9e720f71 |
972 | for (; entry; oentry = &HeNEXT(entry), entry = *oentry) { |
6136c704 |
973 | SV *sv; |
fde52b5c |
974 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
975 | continue; |
eb160463 |
976 | if (HeKLEN(entry) != (I32)klen) |
fde52b5c |
977 | continue; |
1c846c1f |
978 | if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */ |
fde52b5c |
979 | continue; |
7a9669ca |
980 | if ((HeKFLAGS(entry) ^ masked_flags) & HVhek_UTF8) |
c3654f1a |
981 | continue; |
8aacddc1 |
982 | |
5d2b1485 |
983 | if (hv == PL_strtab) { |
984 | if (k_flags & HVhek_FREEKEY) |
985 | Safefree(key); |
986 | Perl_croak(aTHX_ S_strtab_error, "delete"); |
987 | } |
988 | |
8aacddc1 |
989 | /* if placeholder is here, it's already been deleted.... */ |
6136c704 |
990 | if (HeVAL(entry) == &PL_sv_placeholder) { |
991 | if (k_flags & HVhek_FREEKEY) |
992 | Safefree(key); |
993 | return NULL; |
8aacddc1 |
994 | } |
6136c704 |
995 | if (SvREADONLY(hv) && HeVAL(entry) && SvREADONLY(HeVAL(entry))) { |
d4c19fe8 |
996 | hv_notallowed(k_flags, key, klen, |
c8cd6465 |
997 | "Attempt to delete readonly key '%"SVf"' from" |
998 | " a restricted hash"); |
8aacddc1 |
999 | } |
b84d0860 |
1000 | if (k_flags & HVhek_FREEKEY) |
1001 | Safefree(key); |
8aacddc1 |
1002 | |
cd6d36ac |
1003 | if (d_flags & G_DISCARD) |
a0714e2c |
1004 | sv = NULL; |
94f7643d |
1005 | else { |
79d01fbf |
1006 | sv = sv_2mortal(HeVAL(entry)); |
7996736c |
1007 | HeVAL(entry) = &PL_sv_placeholder; |
94f7643d |
1008 | } |
8aacddc1 |
1009 | |
1010 | /* |
1011 | * If a restricted hash, rather than really deleting the entry, put |
1012 | * a placeholder there. This marks the key as being "approved", so |
1013 | * we can still access via not-really-existing key without raising |
1014 | * an error. |
1015 | */ |
1016 | if (SvREADONLY(hv)) { |
754604c4 |
1017 | SvREFCNT_dec(HeVAL(entry)); |
7996736c |
1018 | HeVAL(entry) = &PL_sv_placeholder; |
8aacddc1 |
1019 | /* We'll be saving this slot, so the number of allocated keys |
1020 | * doesn't go down, but the number placeholders goes up */ |
ca732855 |
1021 | HvPLACEHOLDERS(hv)++; |
8aacddc1 |
1022 | } else { |
a26e96df |
1023 | *oentry = HeNEXT(entry); |
9e720f71 |
1024 | if(!*first_entry) { |
a26e96df |
1025 | xhv->xhv_fill--; /* HvFILL(hv)-- */ |
9e720f71 |
1026 | } |
b79f7545 |
1027 | if (SvOOK(hv) && entry == HvAUX(hv)->xhv_eiter /* HvEITER(hv) */) |
8aacddc1 |
1028 | HvLAZYDEL_on(hv); |
1029 | else |
1030 | hv_free_ent(hv, entry); |
4c7185a0 |
1031 | xhv->xhv_keys--; /* HvTOTALKEYS(hv)-- */ |
574c8022 |
1032 | if (xhv->xhv_keys == 0) |
19692e8d |
1033 | HvHASKFLAGS_off(hv); |
8aacddc1 |
1034 | } |
79072805 |
1035 | return sv; |
1036 | } |
8aacddc1 |
1037 | if (SvREADONLY(hv)) { |
d4c19fe8 |
1038 | hv_notallowed(k_flags, key, klen, |
c8cd6465 |
1039 | "Attempt to delete disallowed key '%"SVf"' from" |
1040 | " a restricted hash"); |
8aacddc1 |
1041 | } |
1042 | |
19692e8d |
1043 | if (k_flags & HVhek_FREEKEY) |
f9a63242 |
1044 | Safefree(key); |
a0714e2c |
1045 | return NULL; |
79072805 |
1046 | } |
1047 | |
76e3520e |
1048 | STATIC void |
cea2e8a9 |
1049 | S_hsplit(pTHX_ HV *hv) |
79072805 |
1050 | { |
97aff369 |
1051 | dVAR; |
1e05feb3 |
1052 | register XPVHV* const xhv = (XPVHV*)SvANY(hv); |
a3b680e6 |
1053 | const I32 oldsize = (I32) xhv->xhv_max+1; /* HvMAX(hv)+1 (sick) */ |
79072805 |
1054 | register I32 newsize = oldsize * 2; |
1055 | register I32 i; |
7b2c381c |
1056 | char *a = (char*) HvARRAY(hv); |
72311751 |
1057 | register HE **aep; |
79072805 |
1058 | register HE **oentry; |
4b5190b5 |
1059 | int longest_chain = 0; |
1060 | int was_shared; |
79072805 |
1061 | |
18026298 |
1062 | /*PerlIO_printf(PerlIO_stderr(), "hsplit called for %p which had %d\n", |
6c9570dc |
1063 | (void*)hv, (int) oldsize);*/ |
18026298 |
1064 | |
5d88ecd7 |
1065 | if (HvPLACEHOLDERS_get(hv) && !SvREADONLY(hv)) { |
18026298 |
1066 | /* Can make this clear any placeholders first for non-restricted hashes, |
1067 | even though Storable rebuilds restricted hashes by putting in all the |
1068 | placeholders (first) before turning on the readonly flag, because |
1069 | Storable always pre-splits the hash. */ |
1070 | hv_clear_placeholders(hv); |
1071 | } |
1072 | |
3280af22 |
1073 | PL_nomemok = TRUE; |
8d6dde3e |
1074 | #if defined(STRANGE_MALLOC) || defined(MYMALLOC) |
b79f7545 |
1075 | Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize) |
1076 | + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0), char); |
422a93e5 |
1077 | if (!a) { |
4a33f861 |
1078 | PL_nomemok = FALSE; |
422a93e5 |
1079 | return; |
1080 | } |
b79f7545 |
1081 | if (SvOOK(hv)) { |
7a9b70e9 |
1082 | Copy(&a[oldsize * sizeof(HE*)], &a[newsize * sizeof(HE*)], 1, struct xpvhv_aux); |
b79f7545 |
1083 | } |
4633a7c4 |
1084 | #else |
a02a5408 |
1085 | Newx(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize) |
b79f7545 |
1086 | + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0), char); |
422a93e5 |
1087 | if (!a) { |
3280af22 |
1088 | PL_nomemok = FALSE; |
422a93e5 |
1089 | return; |
1090 | } |
7b2c381c |
1091 | Copy(HvARRAY(hv), a, oldsize * sizeof(HE*), char); |
b79f7545 |
1092 | if (SvOOK(hv)) { |
1093 | Copy(HvAUX(hv), &a[newsize * sizeof(HE*)], 1, struct xpvhv_aux); |
1094 | } |
fba3b22e |
1095 | if (oldsize >= 64) { |
7b2c381c |
1096 | offer_nice_chunk(HvARRAY(hv), |
b79f7545 |
1097 | PERL_HV_ARRAY_ALLOC_BYTES(oldsize) |
1098 | + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0)); |
4633a7c4 |
1099 | } |
1100 | else |
7b2c381c |
1101 | Safefree(HvARRAY(hv)); |
4633a7c4 |
1102 | #endif |
1103 | |
3280af22 |
1104 | PL_nomemok = FALSE; |
72311751 |
1105 | Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/ |
cbec9347 |
1106 | xhv->xhv_max = --newsize; /* HvMAX(hv) = --newsize */ |
7b2c381c |
1107 | HvARRAY(hv) = (HE**) a; |
72311751 |
1108 | aep = (HE**)a; |
79072805 |
1109 | |
72311751 |
1110 | for (i=0; i<oldsize; i++,aep++) { |
4b5190b5 |
1111 | int left_length = 0; |
1112 | int right_length = 0; |
a3b680e6 |
1113 | register HE *entry; |
1114 | register HE **bep; |
4b5190b5 |
1115 | |
72311751 |
1116 | if (!*aep) /* non-existent */ |
79072805 |
1117 | continue; |
72311751 |
1118 | bep = aep+oldsize; |
1119 | for (oentry = aep, entry = *aep; entry; entry = *oentry) { |
eb160463 |
1120 | if ((HeHASH(entry) & newsize) != (U32)i) { |
fde52b5c |
1121 | *oentry = HeNEXT(entry); |
72311751 |
1122 | HeNEXT(entry) = *bep; |
1123 | if (!*bep) |
cbec9347 |
1124 | xhv->xhv_fill++; /* HvFILL(hv)++ */ |
72311751 |
1125 | *bep = entry; |
4b5190b5 |
1126 | right_length++; |
79072805 |
1127 | continue; |
1128 | } |
4b5190b5 |
1129 | else { |
fde52b5c |
1130 | oentry = &HeNEXT(entry); |
4b5190b5 |
1131 | left_length++; |
1132 | } |
79072805 |
1133 | } |
72311751 |
1134 | if (!*aep) /* everything moved */ |
cbec9347 |
1135 | xhv->xhv_fill--; /* HvFILL(hv)-- */ |
4b5190b5 |
1136 | /* I think we don't actually need to keep track of the longest length, |
1137 | merely flag if anything is too long. But for the moment while |
1138 | developing this code I'll track it. */ |
1139 | if (left_length > longest_chain) |
1140 | longest_chain = left_length; |
1141 | if (right_length > longest_chain) |
1142 | longest_chain = right_length; |
1143 | } |
1144 | |
1145 | |
1146 | /* Pick your policy for "hashing isn't working" here: */ |
fdcd69b6 |
1147 | if (longest_chain <= HV_MAX_LENGTH_BEFORE_SPLIT /* split worked? */ |
4b5190b5 |
1148 | || HvREHASH(hv)) { |
1149 | return; |
79072805 |
1150 | } |
4b5190b5 |
1151 | |
1152 | if (hv == PL_strtab) { |
1153 | /* Urg. Someone is doing something nasty to the string table. |
1154 | Can't win. */ |
1155 | return; |
1156 | } |
1157 | |
1158 | /* Awooga. Awooga. Pathological data. */ |
6c9570dc |
1159 | /*PerlIO_printf(PerlIO_stderr(), "%p %d of %d with %d/%d buckets\n", (void*)hv, |
4b5190b5 |
1160 | longest_chain, HvTOTALKEYS(hv), HvFILL(hv), 1+HvMAX(hv));*/ |
1161 | |
1162 | ++newsize; |
a02a5408 |
1163 | Newxz(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize) |
b79f7545 |
1164 | + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0), char); |
1165 | if (SvOOK(hv)) { |
1166 | Copy(HvAUX(hv), &a[newsize * sizeof(HE*)], 1, struct xpvhv_aux); |
1167 | } |
1168 | |
4b5190b5 |
1169 | was_shared = HvSHAREKEYS(hv); |
1170 | |
1171 | xhv->xhv_fill = 0; |
1172 | HvSHAREKEYS_off(hv); |
1173 | HvREHASH_on(hv); |
1174 | |
7b2c381c |
1175 | aep = HvARRAY(hv); |
4b5190b5 |
1176 | |
1177 | for (i=0; i<newsize; i++,aep++) { |
a3b680e6 |
1178 | register HE *entry = *aep; |
4b5190b5 |
1179 | while (entry) { |
1180 | /* We're going to trash this HE's next pointer when we chain it |
1181 | into the new hash below, so store where we go next. */ |
9d4ba2ae |
1182 | HE * const next = HeNEXT(entry); |
4b5190b5 |
1183 | UV hash; |
a3b680e6 |
1184 | HE **bep; |
4b5190b5 |
1185 | |
1186 | /* Rehash it */ |
1187 | PERL_HASH_INTERNAL(hash, HeKEY(entry), HeKLEN(entry)); |
1188 | |
1189 | if (was_shared) { |
1190 | /* Unshare it. */ |
aec46f14 |
1191 | HEK * const new_hek |
4b5190b5 |
1192 | = save_hek_flags(HeKEY(entry), HeKLEN(entry), |
1193 | hash, HeKFLAGS(entry)); |
1194 | unshare_hek (HeKEY_hek(entry)); |
1195 | HeKEY_hek(entry) = new_hek; |
1196 | } else { |
1197 | /* Not shared, so simply write the new hash in. */ |
1198 | HeHASH(entry) = hash; |
1199 | } |
1200 | /*PerlIO_printf(PerlIO_stderr(), "%d ", HeKFLAGS(entry));*/ |
1201 | HEK_REHASH_on(HeKEY_hek(entry)); |
1202 | /*PerlIO_printf(PerlIO_stderr(), "%d\n", HeKFLAGS(entry));*/ |
1203 | |
1204 | /* Copy oentry to the correct new chain. */ |
1205 | bep = ((HE**)a) + (hash & (I32) xhv->xhv_max); |
1206 | if (!*bep) |
1207 | xhv->xhv_fill++; /* HvFILL(hv)++ */ |
1208 | HeNEXT(entry) = *bep; |
1209 | *bep = entry; |
1210 | |
1211 | entry = next; |
1212 | } |
1213 | } |
7b2c381c |
1214 | Safefree (HvARRAY(hv)); |
1215 | HvARRAY(hv) = (HE **)a; |
79072805 |
1216 | } |
1217 | |
72940dca |
1218 | void |
864dbfa3 |
1219 | Perl_hv_ksplit(pTHX_ HV *hv, IV newmax) |
72940dca |
1220 | { |
97aff369 |
1221 | dVAR; |
cbec9347 |
1222 | register XPVHV* xhv = (XPVHV*)SvANY(hv); |
a3b680e6 |
1223 | const I32 oldsize = (I32) xhv->xhv_max+1; /* HvMAX(hv)+1 (sick) */ |
72940dca |
1224 | register I32 newsize; |
1225 | register I32 i; |
72311751 |
1226 | register char *a; |
1227 | register HE **aep; |
72940dca |
1228 | register HE *entry; |
1229 | register HE **oentry; |
1230 | |
1231 | newsize = (I32) newmax; /* possible truncation here */ |
1232 | if (newsize != newmax || newmax <= oldsize) |
1233 | return; |
1234 | while ((newsize & (1 + ~newsize)) != newsize) { |
1235 | newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */ |
1236 | } |
1237 | if (newsize < newmax) |
1238 | newsize *= 2; |
1239 | if (newsize < newmax) |
1240 | return; /* overflow detection */ |
1241 | |
7b2c381c |
1242 | a = (char *) HvARRAY(hv); |
72940dca |
1243 | if (a) { |
3280af22 |
1244 | PL_nomemok = TRUE; |
8d6dde3e |
1245 | #if defined(STRANGE_MALLOC) || defined(MYMALLOC) |
b79f7545 |
1246 | Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize) |
1247 | + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0), char); |
8aacddc1 |
1248 | if (!a) { |
4a33f861 |
1249 | PL_nomemok = FALSE; |
422a93e5 |
1250 | return; |
1251 | } |
b79f7545 |
1252 | if (SvOOK(hv)) { |
7a9b70e9 |
1253 | Copy(&a[oldsize * sizeof(HE*)], &a[newsize * sizeof(HE*)], 1, struct xpvhv_aux); |
b79f7545 |
1254 | } |
72940dca |
1255 | #else |
a02a5408 |
1256 | Newx(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize) |
b79f7545 |
1257 | + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0), char); |
8aacddc1 |
1258 | if (!a) { |
3280af22 |
1259 | PL_nomemok = FALSE; |
422a93e5 |
1260 | return; |
1261 | } |
7b2c381c |
1262 | Copy(HvARRAY(hv), a, oldsize * sizeof(HE*), char); |
b79f7545 |
1263 | if (SvOOK(hv)) { |
1264 | Copy(HvAUX(hv), &a[newsize * sizeof(HE*)], 1, struct xpvhv_aux); |
1265 | } |
fba3b22e |
1266 | if (oldsize >= 64) { |
7b2c381c |
1267 | offer_nice_chunk(HvARRAY(hv), |
b79f7545 |
1268 | PERL_HV_ARRAY_ALLOC_BYTES(oldsize) |
1269 | + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0)); |
72940dca |
1270 | } |
1271 | else |
7b2c381c |
1272 | Safefree(HvARRAY(hv)); |
72940dca |
1273 | #endif |
3280af22 |
1274 | PL_nomemok = FALSE; |
72311751 |
1275 | Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/ |
72940dca |
1276 | } |
1277 | else { |
a02a5408 |
1278 | Newxz(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char); |
72940dca |
1279 | } |
cbec9347 |
1280 | xhv->xhv_max = --newsize; /* HvMAX(hv) = --newsize */ |
7b2c381c |
1281 | HvARRAY(hv) = (HE **) a; |
cbec9347 |
1282 | if (!xhv->xhv_fill /* !HvFILL(hv) */) /* skip rest if no entries */ |
72940dca |
1283 | return; |
1284 | |
72311751 |
1285 | aep = (HE**)a; |
1286 | for (i=0; i<oldsize; i++,aep++) { |
1287 | if (!*aep) /* non-existent */ |
72940dca |
1288 | continue; |
72311751 |
1289 | for (oentry = aep, entry = *aep; entry; entry = *oentry) { |
6136c704 |
1290 | register I32 j = (HeHASH(entry) & newsize); |
1291 | |
1292 | if (j != i) { |
72940dca |
1293 | j -= i; |
1294 | *oentry = HeNEXT(entry); |
72311751 |
1295 | if (!(HeNEXT(entry) = aep[j])) |
cbec9347 |
1296 | xhv->xhv_fill++; /* HvFILL(hv)++ */ |
72311751 |
1297 | aep[j] = entry; |
72940dca |
1298 | continue; |
1299 | } |
1300 | else |
1301 | oentry = &HeNEXT(entry); |
1302 | } |
72311751 |
1303 | if (!*aep) /* everything moved */ |
cbec9347 |
1304 | xhv->xhv_fill--; /* HvFILL(hv)-- */ |
72940dca |
1305 | } |
1306 | } |
1307 | |
b3ac6de7 |
1308 | HV * |
864dbfa3 |
1309 | Perl_newHVhv(pTHX_ HV *ohv) |
b3ac6de7 |
1310 | { |
9d4ba2ae |
1311 | HV * const hv = newHV(); |
4beac62f |
1312 | STRLEN hv_max, hv_fill; |
4beac62f |
1313 | |
1314 | if (!ohv || (hv_fill = HvFILL(ohv)) == 0) |
1315 | return hv; |
4beac62f |
1316 | hv_max = HvMAX(ohv); |
b3ac6de7 |
1317 | |
b56ba0bf |
1318 | if (!SvMAGICAL((SV *)ohv)) { |
1319 | /* It's an ordinary hash, so copy it fast. AMS 20010804 */ |
eb160463 |
1320 | STRLEN i; |
a3b680e6 |
1321 | const bool shared = !!HvSHAREKEYS(ohv); |
aec46f14 |
1322 | HE **ents, ** const oents = (HE **)HvARRAY(ohv); |
ff875642 |
1323 | char *a; |
a02a5408 |
1324 | Newx(a, PERL_HV_ARRAY_ALLOC_BYTES(hv_max+1), char); |
ff875642 |
1325 | ents = (HE**)a; |
b56ba0bf |
1326 | |
1327 | /* In each bucket... */ |
1328 | for (i = 0; i <= hv_max; i++) { |
6136c704 |
1329 | HE *prev = NULL; |
aec46f14 |
1330 | HE *oent = oents[i]; |
b56ba0bf |
1331 | |
1332 | if (!oent) { |
1333 | ents[i] = NULL; |
1334 | continue; |
1335 | } |
1336 | |
1337 | /* Copy the linked list of entries. */ |
aec46f14 |
1338 | for (; oent; oent = HeNEXT(oent)) { |
a3b680e6 |
1339 | const U32 hash = HeHASH(oent); |
1340 | const char * const key = HeKEY(oent); |
1341 | const STRLEN len = HeKLEN(oent); |
1342 | const int flags = HeKFLAGS(oent); |
6136c704 |
1343 | HE * const ent = new_HE(); |
b56ba0bf |
1344 | |
45dea987 |
1345 | HeVAL(ent) = newSVsv(HeVAL(oent)); |
19692e8d |
1346 | HeKEY_hek(ent) |
6e838c70 |
1347 | = shared ? share_hek_flags(key, len, hash, flags) |
19692e8d |
1348 | : save_hek_flags(key, len, hash, flags); |
b56ba0bf |
1349 | if (prev) |
1350 | HeNEXT(prev) = ent; |
1351 | else |
1352 | ents[i] = ent; |
1353 | prev = ent; |
1354 | HeNEXT(ent) = NULL; |
1355 | } |
1356 | } |
1357 | |
1358 | HvMAX(hv) = hv_max; |
1359 | HvFILL(hv) = hv_fill; |
8aacddc1 |
1360 | HvTOTALKEYS(hv) = HvTOTALKEYS(ohv); |
b56ba0bf |
1361 | HvARRAY(hv) = ents; |
aec46f14 |
1362 | } /* not magical */ |
b56ba0bf |
1363 | else { |
1364 | /* Iterate over ohv, copying keys and values one at a time. */ |
b3ac6de7 |
1365 | HE *entry; |
bfcb3514 |
1366 | const I32 riter = HvRITER_get(ohv); |
1367 | HE * const eiter = HvEITER_get(ohv); |
b56ba0bf |
1368 | |
1369 | /* Can we use fewer buckets? (hv_max is always 2^n-1) */ |
1370 | while (hv_max && hv_max + 1 >= hv_fill * 2) |
1371 | hv_max = hv_max / 2; |
1372 | HvMAX(hv) = hv_max; |
1373 | |
4a76a316 |
1374 | hv_iterinit(ohv); |
e16e2ff8 |
1375 | while ((entry = hv_iternext_flags(ohv, 0))) { |
04fe65b0 |
1376 | (void)hv_store_flags(hv, HeKEY(entry), HeKLEN(entry), |
1377 | newSVsv(HeVAL(entry)), HeHASH(entry), |
1378 | HeKFLAGS(entry)); |
b3ac6de7 |
1379 | } |
bfcb3514 |
1380 | HvRITER_set(ohv, riter); |
1381 | HvEITER_set(ohv, eiter); |
b3ac6de7 |
1382 | } |
1c846c1f |
1383 | |
b3ac6de7 |
1384 | return hv; |
1385 | } |
1386 | |
5b9c0671 |
1387 | /* A rather specialised version of newHVhv for copying %^H, ensuring all the |
1388 | magic stays on it. */ |
1389 | HV * |
1390 | Perl_hv_copy_hints_hv(pTHX_ HV *const ohv) |
1391 | { |
1392 | HV * const hv = newHV(); |
1393 | STRLEN hv_fill; |
1394 | |
1395 | if (ohv && (hv_fill = HvFILL(ohv))) { |
1396 | STRLEN hv_max = HvMAX(ohv); |
1397 | HE *entry; |
1398 | const I32 riter = HvRITER_get(ohv); |
1399 | HE * const eiter = HvEITER_get(ohv); |
1400 | |
1401 | while (hv_max && hv_max + 1 >= hv_fill * 2) |
1402 | hv_max = hv_max / 2; |
1403 | HvMAX(hv) = hv_max; |
1404 | |
1405 | hv_iterinit(ohv); |
1406 | while ((entry = hv_iternext_flags(ohv, 0))) { |
1407 | SV *const sv = newSVsv(HeVAL(entry)); |
1408 | sv_magic(sv, NULL, PERL_MAGIC_hintselem, |
1409 | (char *)newSVhek (HeKEY_hek(entry)), HEf_SVKEY); |
04fe65b0 |
1410 | (void)hv_store_flags(hv, HeKEY(entry), HeKLEN(entry), |
1411 | sv, HeHASH(entry), HeKFLAGS(entry)); |
5b9c0671 |
1412 | } |
1413 | HvRITER_set(ohv, riter); |
1414 | HvEITER_set(ohv, eiter); |
1415 | } |
1416 | hv_magic(hv, NULL, PERL_MAGIC_hints); |
1417 | return hv; |
1418 | } |
1419 | |
79072805 |
1420 | void |
864dbfa3 |
1421 | Perl_hv_free_ent(pTHX_ HV *hv, register HE *entry) |
79072805 |
1422 | { |
97aff369 |
1423 | dVAR; |
16bdeea2 |
1424 | SV *val; |
1425 | |
68dc0745 |
1426 | if (!entry) |
79072805 |
1427 | return; |
16bdeea2 |
1428 | val = HeVAL(entry); |
a5a709ec |
1429 | if (val && isGV(val) && isGV_with_GP(val) && GvCVu(val) && HvNAME_get(hv)) |
0fa56319 |
1430 | mro_method_changed_in(hv); /* deletion of method from stash */ |
16bdeea2 |
1431 | SvREFCNT_dec(val); |
68dc0745 |
1432 | if (HeKLEN(entry) == HEf_SVKEY) { |
1433 | SvREFCNT_dec(HeKEY_sv(entry)); |
8aacddc1 |
1434 | Safefree(HeKEY_hek(entry)); |
44a8e56a |
1435 | } |
1436 | else if (HvSHAREKEYS(hv)) |
68dc0745 |
1437 | unshare_hek(HeKEY_hek(entry)); |
fde52b5c |
1438 | else |
68dc0745 |
1439 | Safefree(HeKEY_hek(entry)); |
d33b2eba |
1440 | del_HE(entry); |
79072805 |
1441 | } |
1442 | |
1443 | void |
864dbfa3 |
1444 | Perl_hv_delayfree_ent(pTHX_ HV *hv, register HE *entry) |
79072805 |
1445 | { |
97aff369 |
1446 | dVAR; |
68dc0745 |
1447 | if (!entry) |
79072805 |
1448 | return; |
bc4947fc |
1449 | /* SvREFCNT_inc to counter the SvREFCNT_dec in hv_free_ent */ |
1450 | sv_2mortal(SvREFCNT_inc(HeVAL(entry))); /* free between statements */ |
68dc0745 |
1451 | if (HeKLEN(entry) == HEf_SVKEY) { |
bc4947fc |
1452 | sv_2mortal(SvREFCNT_inc(HeKEY_sv(entry))); |
44a8e56a |
1453 | } |
bc4947fc |
1454 | hv_free_ent(hv, entry); |
79072805 |
1455 | } |
1456 | |
954c1994 |
1457 | /* |
1458 | =for apidoc hv_clear |
1459 | |
1460 | Clears a hash, making it empty. |
1461 | |
1462 | =cut |
1463 | */ |
1464 | |
79072805 |
1465 | void |
864dbfa3 |
1466 | Perl_hv_clear(pTHX_ HV *hv) |
79072805 |
1467 | { |
27da23d5 |
1468 | dVAR; |
cbec9347 |
1469 | register XPVHV* xhv; |
79072805 |
1470 | if (!hv) |
1471 | return; |
49293501 |
1472 | |
ecae49c0 |
1473 | DEBUG_A(Perl_hv_assert(aTHX_ hv)); |
1474 | |
34c3c4e3 |
1475 | xhv = (XPVHV*)SvANY(hv); |
1476 | |
7b2c381c |
1477 | if (SvREADONLY(hv) && HvARRAY(hv) != NULL) { |
34c3c4e3 |
1478 | /* restricted hash: convert all keys to placeholders */ |
b464bac0 |
1479 | STRLEN i; |
1480 | for (i = 0; i <= xhv->xhv_max; i++) { |
7b2c381c |
1481 | HE *entry = (HvARRAY(hv))[i]; |
3a676441 |
1482 | for (; entry; entry = HeNEXT(entry)) { |
1483 | /* not already placeholder */ |
7996736c |
1484 | if (HeVAL(entry) != &PL_sv_placeholder) { |
3a676441 |
1485 | if (HeVAL(entry) && SvREADONLY(HeVAL(entry))) { |
6136c704 |
1486 | SV* const keysv = hv_iterkeysv(entry); |
3a676441 |
1487 | Perl_croak(aTHX_ |
95b63a38 |
1488 | "Attempt to delete readonly key '%"SVf"' from a restricted hash", |
1489 | (void*)keysv); |
3a676441 |
1490 | } |
1491 | SvREFCNT_dec(HeVAL(entry)); |
7996736c |
1492 | HeVAL(entry) = &PL_sv_placeholder; |
ca732855 |
1493 | HvPLACEHOLDERS(hv)++; |
3a676441 |
1494 | } |
34c3c4e3 |
1495 | } |
1496 | } |
df8c6964 |
1497 | goto reset; |
49293501 |
1498 | } |
1499 | |
463ee0b2 |
1500 | hfreeentries(hv); |
ca732855 |
1501 | HvPLACEHOLDERS_set(hv, 0); |
7b2c381c |
1502 | if (HvARRAY(hv)) |
41f62432 |
1503 | Zero(HvARRAY(hv), xhv->xhv_max+1 /* HvMAX(hv)+1 */, HE*); |
a0d0e21e |
1504 | |
1505 | if (SvRMAGICAL(hv)) |
1c846c1f |
1506 | mg_clear((SV*)hv); |
574c8022 |
1507 | |
19692e8d |
1508 | HvHASKFLAGS_off(hv); |
bb443f97 |
1509 | HvREHASH_off(hv); |
df8c6964 |
1510 | reset: |
b79f7545 |
1511 | if (SvOOK(hv)) { |
dd69841b |
1512 | if(HvNAME_get(hv)) |
1513 | mro_isa_changed_in(hv); |
bfcb3514 |
1514 | HvEITER_set(hv, NULL); |
1515 | } |
79072805 |
1516 | } |
1517 | |
3540d4ce |
1518 | /* |
1519 | =for apidoc hv_clear_placeholders |
1520 | |
1521 | Clears any placeholders from a hash. If a restricted hash has any of its keys |
1522 | marked as readonly and the key is subsequently deleted, the key is not actually |
1523 | deleted but is marked by assigning it a value of &PL_sv_placeholder. This tags |
1524 | it so it will be ignored by future operations such as iterating over the hash, |
4cdaeff7 |
1525 | but will still allow the hash to have a value reassigned to the key at some |
3540d4ce |
1526 | future point. This function clears any such placeholder keys from the hash. |
1527 | See Hash::Util::lock_keys() for an example of its use. |
1528 | |
1529 | =cut |
1530 | */ |
1531 | |
1532 | void |
1533 | Perl_hv_clear_placeholders(pTHX_ HV *hv) |
1534 | { |
27da23d5 |
1535 | dVAR; |
b3ca2e83 |
1536 | const U32 items = (U32)HvPLACEHOLDERS_get(hv); |
1537 | |
1538 | if (items) |
1539 | clear_placeholders(hv, items); |
1540 | } |
1541 | |
1542 | static void |
1543 | S_clear_placeholders(pTHX_ HV *hv, U32 items) |
1544 | { |
1545 | dVAR; |
b464bac0 |
1546 | I32 i; |
d3677389 |
1547 | |
1548 | if (items == 0) |
1549 | return; |
1550 | |
b464bac0 |
1551 | i = HvMAX(hv); |
d3677389 |
1552 | do { |
1553 | /* Loop down the linked list heads */ |
6136c704 |
1554 | bool first = TRUE; |
d3677389 |
1555 | HE **oentry = &(HvARRAY(hv))[i]; |
cf6db12b |
1556 | HE *entry; |
d3677389 |
1557 | |
cf6db12b |
1558 | while ((entry = *oentry)) { |
d3677389 |
1559 | if (HeVAL(entry) == &PL_sv_placeholder) { |
1560 | *oentry = HeNEXT(entry); |
1561 | if (first && !*oentry) |
1562 | HvFILL(hv)--; /* This linked list is now empty. */ |
2e58978b |
1563 | if (entry == HvEITER_get(hv)) |
d3677389 |
1564 | HvLAZYDEL_on(hv); |
1565 | else |
1566 | hv_free_ent(hv, entry); |
1567 | |
1568 | if (--items == 0) { |
1569 | /* Finished. */ |
5d88ecd7 |
1570 | HvTOTALKEYS(hv) -= (IV)HvPLACEHOLDERS_get(hv); |
d3677389 |
1571 | if (HvKEYS(hv) == 0) |
1572 | HvHASKFLAGS_off(hv); |
5d88ecd7 |
1573 | HvPLACEHOLDERS_set(hv, 0); |
d3677389 |
1574 | return; |
1575 | } |
213ce8b3 |
1576 | } else { |
1577 | oentry = &HeNEXT(entry); |
6136c704 |
1578 | first = FALSE; |
d3677389 |
1579 | } |
1580 | } |
1581 | } while (--i >= 0); |
1582 | /* You can't get here, hence assertion should always fail. */ |
1583 | assert (items == 0); |
1584 | assert (0); |
3540d4ce |
1585 | } |
1586 | |
76e3520e |
1587 | STATIC void |
cea2e8a9 |
1588 | S_hfreeentries(pTHX_ HV *hv) |
79072805 |
1589 | { |
23976bdd |
1590 | /* This is the array that we're going to restore */ |
fd7de8a8 |
1591 | HE **const orig_array = HvARRAY(hv); |
23976bdd |
1592 | HEK *name; |
1593 | int attempts = 100; |
3abe233e |
1594 | |
fd7de8a8 |
1595 | if (!orig_array) |
79072805 |
1596 | return; |
a0d0e21e |
1597 | |
23976bdd |
1598 | if (SvOOK(hv)) { |
1599 | /* If the hash is actually a symbol table with a name, look after the |
1600 | name. */ |
1601 | struct xpvhv_aux *iter = HvAUX(hv); |
1602 | |
1603 | name = iter->xhv_name; |
1604 | iter->xhv_name = NULL; |
1605 | } else { |
1606 | name = NULL; |
1607 | } |
1608 | |
23976bdd |
1609 | /* orig_array remains unchanged throughout the loop. If after freeing all |
1610 | the entries it turns out that one of the little blighters has triggered |
1611 | an action that has caused HvARRAY to be re-allocated, then we set |
1612 | array to the new HvARRAY, and try again. */ |
1613 | |
1614 | while (1) { |
1615 | /* This is the one we're going to try to empty. First time round |
1616 | it's the original array. (Hopefully there will only be 1 time |
1617 | round) */ |
6136c704 |
1618 | HE ** const array = HvARRAY(hv); |
7440661e |
1619 | I32 i = HvMAX(hv); |
23976bdd |
1620 | |
1621 | /* Because we have taken xhv_name out, the only allocated pointer |
1622 | in the aux structure that might exist is the backreference array. |
1623 | */ |
1624 | |
1625 | if (SvOOK(hv)) { |
7440661e |
1626 | HE *entry; |
e1a479c5 |
1627 | struct mro_meta *meta; |
23976bdd |
1628 | struct xpvhv_aux *iter = HvAUX(hv); |
1629 | /* If there are weak references to this HV, we need to avoid |
1630 | freeing them up here. In particular we need to keep the AV |
1631 | visible as what we're deleting might well have weak references |
1632 | back to this HV, so the for loop below may well trigger |
1633 | the removal of backreferences from this array. */ |
1634 | |
1635 | if (iter->xhv_backreferences) { |
1636 | /* So donate them to regular backref magic to keep them safe. |
1637 | The sv_magic will increase the reference count of the AV, |
1638 | so we need to drop it first. */ |
5b285ea4 |
1639 | SvREFCNT_dec(iter->xhv_backreferences); |
23976bdd |
1640 | if (AvFILLp(iter->xhv_backreferences) == -1) { |
1641 | /* Turns out that the array is empty. Just free it. */ |
1642 | SvREFCNT_dec(iter->xhv_backreferences); |
1b8791d1 |
1643 | |
23976bdd |
1644 | } else { |
1645 | sv_magic((SV*)hv, (SV*)iter->xhv_backreferences, |
1646 | PERL_MAGIC_backref, NULL, 0); |
1647 | } |
1648 | iter->xhv_backreferences = NULL; |
5b285ea4 |
1649 | } |
86f55936 |
1650 | |
23976bdd |
1651 | entry = iter->xhv_eiter; /* HvEITER(hv) */ |
1652 | if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */ |
1653 | HvLAZYDEL_off(hv); |
1654 | hv_free_ent(hv, entry); |
1655 | } |
1656 | iter->xhv_riter = -1; /* HvRITER(hv) = -1 */ |
4608196e |
1657 | iter->xhv_eiter = NULL; /* HvEITER(hv) = NULL */ |
b79f7545 |
1658 | |
e1a479c5 |
1659 | if((meta = iter->xhv_mro_meta)) { |
1660 | if(meta->mro_linear_dfs) SvREFCNT_dec(meta->mro_linear_dfs); |
1661 | if(meta->mro_linear_c3) SvREFCNT_dec(meta->mro_linear_c3); |
e1a479c5 |
1662 | if(meta->mro_nextmethod) SvREFCNT_dec(meta->mro_nextmethod); |
1663 | Safefree(meta); |
1664 | iter->xhv_mro_meta = NULL; |
1665 | } |
1666 | |
23976bdd |
1667 | /* There are now no allocated pointers in the aux structure. */ |
2f86008e |
1668 | |
23976bdd |
1669 | SvFLAGS(hv) &= ~SVf_OOK; /* Goodbye, aux structure. */ |
1670 | /* What aux structure? */ |
a0d0e21e |
1671 | } |
bfcb3514 |
1672 | |
23976bdd |
1673 | /* make everyone else think the array is empty, so that the destructors |
1674 | * called for freed entries can't recusively mess with us */ |
1675 | HvARRAY(hv) = NULL; |
1676 | HvFILL(hv) = 0; |
1677 | ((XPVHV*) SvANY(hv))->xhv_keys = 0; |
1678 | |
7440661e |
1679 | |
1680 | do { |
1681 | /* Loop down the linked list heads */ |
1682 | HE *entry = array[i]; |
1683 | |
1684 | while (entry) { |
23976bdd |
1685 | register HE * const oentry = entry; |
1686 | entry = HeNEXT(entry); |
1687 | hv_free_ent(hv, oentry); |
1688 | } |
7440661e |
1689 | } while (--i >= 0); |
b79f7545 |
1690 | |
23976bdd |
1691 | /* As there are no allocated pointers in the aux structure, it's now |
1692 | safe to free the array we just cleaned up, if it's not the one we're |
1693 | going to put back. */ |
1694 | if (array != orig_array) { |
1695 | Safefree(array); |
1696 | } |
b79f7545 |
1697 | |
23976bdd |
1698 | if (!HvARRAY(hv)) { |
1699 | /* Good. No-one added anything this time round. */ |
1700 | break; |
bfcb3514 |
1701 | } |
b79f7545 |
1702 | |
23976bdd |
1703 | if (SvOOK(hv)) { |
1704 | /* Someone attempted to iterate or set the hash name while we had |
1705 | the array set to 0. We'll catch backferences on the next time |
1706 | round the while loop. */ |
1707 | assert(HvARRAY(hv)); |
1b8791d1 |
1708 | |
23976bdd |
1709 | if (HvAUX(hv)->xhv_name) { |
1710 | unshare_hek_or_pvn(HvAUX(hv)->xhv_name, 0, 0, 0); |
1711 | } |
1712 | } |
1713 | |
1714 | if (--attempts == 0) { |
1715 | Perl_die(aTHX_ "panic: hfreeentries failed to free hash - something is repeatedly re-creating entries"); |
1716 | } |
6136c704 |
1717 | } |
23976bdd |
1718 | |
1719 | HvARRAY(hv) = orig_array; |
1720 | |
1721 | /* If the hash was actually a symbol table, put the name back. */ |
1722 | if (name) { |
1723 | /* We have restored the original array. If name is non-NULL, then |
1724 | the original array had an aux structure at the end. So this is |
1725 | valid: */ |
1726 | SvFLAGS(hv) |= SVf_OOK; |
1727 | HvAUX(hv)->xhv_name = name; |
1b8791d1 |
1728 | } |
79072805 |
1729 | } |
1730 | |
954c1994 |
1731 | /* |
1732 | =for apidoc hv_undef |
1733 | |
1734 | Undefines the hash. |
1735 | |
1736 | =cut |
1737 | */ |
1738 | |
79072805 |
1739 | void |
864dbfa3 |
1740 | Perl_hv_undef(pTHX_ HV *hv) |
79072805 |
1741 | { |
97aff369 |
1742 | dVAR; |
cbec9347 |
1743 | register XPVHV* xhv; |
bfcb3514 |
1744 | const char *name; |
86f55936 |
1745 | |
79072805 |
1746 | if (!hv) |
1747 | return; |
ecae49c0 |
1748 | DEBUG_A(Perl_hv_assert(aTHX_ hv)); |
cbec9347 |
1749 | xhv = (XPVHV*)SvANY(hv); |
dd69841b |
1750 | |
0fa56319 |
1751 | if ((name = HvNAME_get(hv)) && !PL_dirty) |
dd69841b |
1752 | mro_isa_changed_in(hv); |
1753 | |
463ee0b2 |
1754 | hfreeentries(hv); |
dd69841b |
1755 | if (name) { |
04fe65b0 |
1756 | if (PL_stashcache) |
1757 | (void)hv_delete(PL_stashcache, name, HvNAMELEN_get(hv), G_DISCARD); |
bd61b366 |
1758 | hv_name_set(hv, NULL, 0, 0); |
85e6fe83 |
1759 | } |
b79f7545 |
1760 | SvFLAGS(hv) &= ~SVf_OOK; |
1761 | Safefree(HvARRAY(hv)); |
cbec9347 |
1762 | xhv->xhv_max = 7; /* HvMAX(hv) = 7 (it's a normal hash) */ |
7b2c381c |
1763 | HvARRAY(hv) = 0; |
ca732855 |
1764 | HvPLACEHOLDERS_set(hv, 0); |
a0d0e21e |
1765 | |
1766 | if (SvRMAGICAL(hv)) |
1c846c1f |
1767 | mg_clear((SV*)hv); |
79072805 |
1768 | } |
1769 | |
b464bac0 |
1770 | static struct xpvhv_aux* |
5f66b61c |
1771 | S_hv_auxinit(HV *hv) { |
bfcb3514 |
1772 | struct xpvhv_aux *iter; |
b79f7545 |
1773 | char *array; |
bfcb3514 |
1774 | |
b79f7545 |
1775 | if (!HvARRAY(hv)) { |
a02a5408 |
1776 | Newxz(array, PERL_HV_ARRAY_ALLOC_BYTES(HvMAX(hv) + 1) |
b79f7545 |
1777 | + sizeof(struct xpvhv_aux), char); |
1778 | } else { |
1779 | array = (char *) HvARRAY(hv); |
1780 | Renew(array, PERL_HV_ARRAY_ALLOC_BYTES(HvMAX(hv) + 1) |
1781 | + sizeof(struct xpvhv_aux), char); |
1782 | } |
1783 | HvARRAY(hv) = (HE**) array; |
1784 | /* SvOOK_on(hv) attacks the IV flags. */ |
1785 | SvFLAGS(hv) |= SVf_OOK; |
1786 | iter = HvAUX(hv); |
bfcb3514 |
1787 | |
1788 | iter->xhv_riter = -1; /* HvRITER(hv) = -1 */ |
4608196e |
1789 | iter->xhv_eiter = NULL; /* HvEITER(hv) = NULL */ |
bfcb3514 |
1790 | iter->xhv_name = 0; |
86f55936 |
1791 | iter->xhv_backreferences = 0; |
e1a479c5 |
1792 | iter->xhv_mro_meta = NULL; |
bfcb3514 |
1793 | return iter; |
1794 | } |
1795 | |
954c1994 |
1796 | /* |
1797 | =for apidoc hv_iterinit |
1798 | |
1799 | Prepares a starting point to traverse a hash table. Returns the number of |
1800 | keys in the hash (i.e. the same as C<HvKEYS(tb)>). The return value is |
1c846c1f |
1801 | currently only meaningful for hashes without tie magic. |
954c1994 |
1802 | |
1803 | NOTE: Before version 5.004_65, C<hv_iterinit> used to return the number of |
1804 | hash buckets that happen to be in use. If you still need that esoteric |
1805 | value, you can get it through the macro C<HvFILL(tb)>. |
1806 | |
e16e2ff8 |
1807 | |
954c1994 |
1808 | =cut |
1809 | */ |
1810 | |
79072805 |
1811 | I32 |
864dbfa3 |
1812 | Perl_hv_iterinit(pTHX_ HV *hv) |
79072805 |
1813 | { |
aa689395 |
1814 | if (!hv) |
cea2e8a9 |
1815 | Perl_croak(aTHX_ "Bad hash"); |
bfcb3514 |
1816 | |
b79f7545 |
1817 | if (SvOOK(hv)) { |
6136c704 |
1818 | struct xpvhv_aux * const iter = HvAUX(hv); |
0bd48802 |
1819 | HE * const entry = iter->xhv_eiter; /* HvEITER(hv) */ |
bfcb3514 |
1820 | if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */ |
1821 | HvLAZYDEL_off(hv); |
1822 | hv_free_ent(hv, entry); |
1823 | } |
1824 | iter->xhv_riter = -1; /* HvRITER(hv) = -1 */ |
4608196e |
1825 | iter->xhv_eiter = NULL; /* HvEITER(hv) = NULL */ |
bfcb3514 |
1826 | } else { |
6136c704 |
1827 | hv_auxinit(hv); |
72940dca |
1828 | } |
44a2ac75 |
1829 | |
cbec9347 |
1830 | /* used to be xhv->xhv_fill before 5.004_65 */ |
5d88ecd7 |
1831 | return HvTOTALKEYS(hv); |
79072805 |
1832 | } |
bfcb3514 |
1833 | |
1834 | I32 * |
1835 | Perl_hv_riter_p(pTHX_ HV *hv) { |
1836 | struct xpvhv_aux *iter; |
1837 | |
1838 | if (!hv) |
1839 | Perl_croak(aTHX_ "Bad hash"); |
1840 | |
6136c704 |
1841 | iter = SvOOK(hv) ? HvAUX(hv) : hv_auxinit(hv); |
bfcb3514 |
1842 | return &(iter->xhv_riter); |
1843 | } |
1844 | |
1845 | HE ** |
1846 | Perl_hv_eiter_p(pTHX_ HV *hv) { |
1847 | struct xpvhv_aux *iter; |
1848 | |
1849 | if (!hv) |
1850 | Perl_croak(aTHX_ "Bad hash"); |
1851 | |
6136c704 |
1852 | iter = SvOOK(hv) ? HvAUX(hv) : hv_auxinit(hv); |
bfcb3514 |
1853 | return &(iter->xhv_eiter); |
1854 | } |
1855 | |
1856 | void |
1857 | Perl_hv_riter_set(pTHX_ HV *hv, I32 riter) { |
1858 | struct xpvhv_aux *iter; |
1859 | |
1860 | if (!hv) |
1861 | Perl_croak(aTHX_ "Bad hash"); |
1862 | |
b79f7545 |
1863 | if (SvOOK(hv)) { |
1864 | iter = HvAUX(hv); |
1865 | } else { |
bfcb3514 |
1866 | if (riter == -1) |
1867 | return; |
1868 | |
6136c704 |
1869 | iter = hv_auxinit(hv); |
bfcb3514 |
1870 | } |
1871 | iter->xhv_riter = riter; |
1872 | } |
1873 | |
1874 | void |
1875 | Perl_hv_eiter_set(pTHX_ HV *hv, HE *eiter) { |
1876 | struct xpvhv_aux *iter; |
1877 | |
1878 | if (!hv) |
1879 | Perl_croak(aTHX_ "Bad hash"); |
1880 | |
b79f7545 |
1881 | if (SvOOK(hv)) { |
1882 | iter = HvAUX(hv); |
1883 | } else { |
bfcb3514 |
1884 | /* 0 is the default so don't go malloc()ing a new structure just to |
1885 | hold 0. */ |
1886 | if (!eiter) |
1887 | return; |
1888 | |
6136c704 |
1889 | iter = hv_auxinit(hv); |
bfcb3514 |
1890 | } |
1891 | iter->xhv_eiter = eiter; |
1892 | } |
1893 | |
bfcb3514 |
1894 | void |
4164be69 |
1895 | Perl_hv_name_set(pTHX_ HV *hv, const char *name, U32 len, U32 flags) |
bfcb3514 |
1896 | { |
97aff369 |
1897 | dVAR; |
b79f7545 |
1898 | struct xpvhv_aux *iter; |
7423f6db |
1899 | U32 hash; |
46c461b5 |
1900 | |
1901 | PERL_UNUSED_ARG(flags); |
bfcb3514 |
1902 | |
4164be69 |
1903 | if (len > I32_MAX) |
1904 | Perl_croak(aTHX_ "panic: hv name too long (%"UVuf")", (UV) len); |
1905 | |
b79f7545 |
1906 | if (SvOOK(hv)) { |
1907 | iter = HvAUX(hv); |
7423f6db |
1908 | if (iter->xhv_name) { |
1909 | unshare_hek_or_pvn(iter->xhv_name, 0, 0, 0); |
1910 | } |
16580ff5 |
1911 | } else { |
bfcb3514 |
1912 | if (name == 0) |
1913 | return; |
1914 | |
6136c704 |
1915 | iter = hv_auxinit(hv); |
bfcb3514 |
1916 | } |
7423f6db |
1917 | PERL_HASH(hash, name, len); |
adf4e37a |
1918 | iter->xhv_name = name ? share_hek(name, len, hash) : NULL; |
bfcb3514 |
1919 | } |
1920 | |
86f55936 |
1921 | AV ** |
1922 | Perl_hv_backreferences_p(pTHX_ HV *hv) { |
6136c704 |
1923 | struct xpvhv_aux * const iter = SvOOK(hv) ? HvAUX(hv) : hv_auxinit(hv); |
96a5add6 |
1924 | PERL_UNUSED_CONTEXT; |
86f55936 |
1925 | return &(iter->xhv_backreferences); |
1926 | } |
1927 | |
1928 | void |
1929 | Perl_hv_kill_backrefs(pTHX_ HV *hv) { |
1930 | AV *av; |
1931 | |
1932 | if (!SvOOK(hv)) |
1933 | return; |
1934 | |
1935 | av = HvAUX(hv)->xhv_backreferences; |
1936 | |
1937 | if (av) { |
1938 | HvAUX(hv)->xhv_backreferences = 0; |
1939 | Perl_sv_kill_backrefs(aTHX_ (SV*) hv, av); |
1940 | } |
1941 | } |
1942 | |
954c1994 |
1943 | /* |
7a7b9979 |
1944 | hv_iternext is implemented as a macro in hv.h |
1945 | |
954c1994 |
1946 | =for apidoc hv_iternext |
1947 | |
1948 | Returns entries from a hash iterator. See C<hv_iterinit>. |
1949 | |
fe7bca90 |
1950 | You may call C<hv_delete> or C<hv_delete_ent> on the hash entry that the |
1951 | iterator currently points to, without losing your place or invalidating your |
1952 | iterator. Note that in this case the current entry is deleted from the hash |
1953 | with your iterator holding the last reference to it. Your iterator is flagged |
1954 | to free the entry on the next call to C<hv_iternext>, so you must not discard |
1955 | your iterator immediately else the entry will leak - call C<hv_iternext> to |
1956 | trigger the resource deallocation. |
1957 | |
fe7bca90 |
1958 | =for apidoc hv_iternext_flags |
1959 | |
1960 | Returns entries from a hash iterator. See C<hv_iterinit> and C<hv_iternext>. |
1961 | The C<flags> value will normally be zero; if HV_ITERNEXT_WANTPLACEHOLDERS is |
1962 | set the placeholders keys (for restricted hashes) will be returned in addition |
1963 | to normal keys. By default placeholders are automatically skipped over. |
7996736c |
1964 | Currently a placeholder is implemented with a value that is |
1965 | C<&Perl_sv_placeholder>. Note that the implementation of placeholders and |
fe7bca90 |
1966 | restricted hashes may change, and the implementation currently is |
1967 | insufficiently abstracted for any change to be tidy. |
e16e2ff8 |
1968 | |
fe7bca90 |
1969 | =cut |
e16e2ff8 |
1970 | */ |
1971 | |
1972 | HE * |
1973 | Perl_hv_iternext_flags(pTHX_ HV *hv, I32 flags) |
1974 | { |
27da23d5 |
1975 | dVAR; |
cbec9347 |
1976 | register XPVHV* xhv; |
79072805 |
1977 | register HE *entry; |
a0d0e21e |
1978 | HE *oldentry; |
463ee0b2 |
1979 | MAGIC* mg; |
bfcb3514 |
1980 | struct xpvhv_aux *iter; |
79072805 |
1981 | |
1982 | if (!hv) |
cea2e8a9 |
1983 | Perl_croak(aTHX_ "Bad hash"); |
81714fb9 |
1984 | |
cbec9347 |
1985 | xhv = (XPVHV*)SvANY(hv); |
bfcb3514 |
1986 | |
b79f7545 |
1987 | if (!SvOOK(hv)) { |
bfcb3514 |
1988 | /* Too many things (well, pp_each at least) merrily assume that you can |
1989 | call iv_iternext without calling hv_iterinit, so we'll have to deal |
1990 | with it. */ |
1991 | hv_iterinit(hv); |
bfcb3514 |
1992 | } |
b79f7545 |
1993 | iter = HvAUX(hv); |
bfcb3514 |
1994 | |
1995 | oldentry = entry = iter->xhv_eiter; /* HvEITER(hv) */ |
e62cc96a |
1996 | if (SvMAGICAL(hv) && SvRMAGICAL(hv)) { |
44a2ac75 |
1997 | if ( ( mg = mg_find((SV*)hv, PERL_MAGIC_tied) ) ) { |
e62cc96a |
1998 | SV * const key = sv_newmortal(); |
1999 | if (entry) { |
2000 | sv_setsv(key, HeSVKEY_force(entry)); |
2001 | SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */ |
2002 | } |
2003 | else { |
2004 | char *k; |
2005 | HEK *hek; |
2006 | |
2007 | /* one HE per MAGICAL hash */ |
2008 | iter->xhv_eiter = entry = new_HE(); /* HvEITER(hv) = new_HE() */ |
2009 | Zero(entry, 1, HE); |
2010 | Newxz(k, HEK_BASESIZE + sizeof(SV*), char); |
2011 | hek = (HEK*)k; |
2012 | HeKEY_hek(entry) = hek; |
2013 | HeKLEN(entry) = HEf_SVKEY; |
2014 | } |
2015 | magic_nextpack((SV*) hv,mg,key); |
2016 | if (SvOK(key)) { |
2017 | /* force key to stay around until next time */ |
2018 | HeSVKEY_set(entry, SvREFCNT_inc_simple_NN(key)); |
2019 | return entry; /* beware, hent_val is not set */ |
2020 | } |
2021 | if (HeVAL(entry)) |
2022 | SvREFCNT_dec(HeVAL(entry)); |
2023 | Safefree(HeKEY_hek(entry)); |
2024 | del_HE(entry); |
2025 | iter->xhv_eiter = NULL; /* HvEITER(hv) = NULL */ |
2026 | return NULL; |
81714fb9 |
2027 | } |
79072805 |
2028 | } |
7ee146b1 |
2029 | #if defined(DYNAMIC_ENV_FETCH) && !defined(__riscos__) /* set up %ENV for iteration */ |
03026e68 |
2030 | if (!entry && SvRMAGICAL((SV*)hv) && mg_find((SV*)hv, PERL_MAGIC_env)) { |
f675dbe5 |
2031 | prime_env_iter(); |
03026e68 |
2032 | #ifdef VMS |
2033 | /* The prime_env_iter() on VMS just loaded up new hash values |
2034 | * so the iteration count needs to be reset back to the beginning |
2035 | */ |
2036 | hv_iterinit(hv); |
2037 | iter = HvAUX(hv); |
2038 | oldentry = entry = iter->xhv_eiter; /* HvEITER(hv) */ |
2039 | #endif |
2040 | } |
f675dbe5 |
2041 | #endif |
463ee0b2 |
2042 | |
b79f7545 |
2043 | /* hv_iterint now ensures this. */ |
2044 | assert (HvARRAY(hv)); |
2045 | |
015a5f36 |
2046 | /* At start of hash, entry is NULL. */ |
fde52b5c |
2047 | if (entry) |
8aacddc1 |
2048 | { |
fde52b5c |
2049 | entry = HeNEXT(entry); |
e16e2ff8 |
2050 | if (!(flags & HV_ITERNEXT_WANTPLACEHOLDERS)) { |
2051 | /* |
2052 | * Skip past any placeholders -- don't want to include them in |
2053 | * any iteration. |
2054 | */ |
7996736c |
2055 | while (entry && HeVAL(entry) == &PL_sv_placeholder) { |
e16e2ff8 |
2056 | entry = HeNEXT(entry); |
2057 | } |
8aacddc1 |
2058 | } |
2059 | } |
fde52b5c |
2060 | while (!entry) { |
015a5f36 |
2061 | /* OK. Come to the end of the current list. Grab the next one. */ |
2062 | |
bfcb3514 |
2063 | iter->xhv_riter++; /* HvRITER(hv)++ */ |
2064 | if (iter->xhv_riter > (I32)xhv->xhv_max /* HvRITER(hv) > HvMAX(hv) */) { |
015a5f36 |
2065 | /* There is no next one. End of the hash. */ |
bfcb3514 |
2066 | iter->xhv_riter = -1; /* HvRITER(hv) = -1 */ |
fde52b5c |
2067 | break; |
79072805 |
2068 | } |
7b2c381c |
2069 | entry = (HvARRAY(hv))[iter->xhv_riter]; |
8aacddc1 |
2070 | |
e16e2ff8 |
2071 | if (!(flags & HV_ITERNEXT_WANTPLACEHOLDERS)) { |
015a5f36 |
2072 | /* If we have an entry, but it's a placeholder, don't count it. |
2073 | Try the next. */ |
7996736c |
2074 | while (entry && HeVAL(entry) == &PL_sv_placeholder) |
015a5f36 |
2075 | entry = HeNEXT(entry); |
2076 | } |
2077 | /* Will loop again if this linked list starts NULL |
2078 | (for HV_ITERNEXT_WANTPLACEHOLDERS) |
2079 | or if we run through it and find only placeholders. */ |
fde52b5c |
2080 | } |
79072805 |
2081 | |
72940dca |
2082 | if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */ |
2083 | HvLAZYDEL_off(hv); |
68dc0745 |
2084 | hv_free_ent(hv, oldentry); |
72940dca |
2085 | } |
a0d0e21e |
2086 | |
fdcd69b6 |
2087 | /*if (HvREHASH(hv) && entry && !HeKREHASH(entry)) |
6c9570dc |
2088 | PerlIO_printf(PerlIO_stderr(), "Awooga %p %p\n", (void*)hv, (void*)entry);*/ |
fdcd69b6 |
2089 | |
bfcb3514 |
2090 | iter->xhv_eiter = entry; /* HvEITER(hv) = entry */ |
79072805 |
2091 | return entry; |
2092 | } |
2093 | |
954c1994 |
2094 | /* |
2095 | =for apidoc hv_iterkey |
2096 | |
2097 | Returns the key from the current position of the hash iterator. See |
2098 | C<hv_iterinit>. |
2099 | |
2100 | =cut |
2101 | */ |
2102 | |
79072805 |
2103 | char * |
864dbfa3 |
2104 | Perl_hv_iterkey(pTHX_ register HE *entry, I32 *retlen) |
79072805 |
2105 | { |
fde52b5c |
2106 | if (HeKLEN(entry) == HEf_SVKEY) { |
fb73857a |
2107 | STRLEN len; |
0bd48802 |
2108 | char * const p = SvPV(HeKEY_sv(entry), len); |
fb73857a |
2109 | *retlen = len; |
2110 | return p; |
fde52b5c |
2111 | } |
2112 | else { |
2113 | *retlen = HeKLEN(entry); |
2114 | return HeKEY(entry); |
2115 | } |
2116 | } |
2117 | |
2118 | /* unlike hv_iterval(), this always returns a mortal copy of the key */ |
954c1994 |
2119 | /* |
2120 | =for apidoc hv_iterkeysv |
2121 | |
2122 | Returns the key as an C<SV*> from the current position of the hash |
2123 | iterator. The return value will always be a mortal copy of the key. Also |
2124 | see C<hv_iterinit>. |
2125 | |
2126 | =cut |
2127 | */ |
2128 | |
fde52b5c |
2129 | SV * |
864dbfa3 |
2130 | Perl_hv_iterkeysv(pTHX_ register HE *entry) |
fde52b5c |
2131 | { |
c1b02ed8 |
2132 | return sv_2mortal(newSVhek(HeKEY_hek(entry))); |
79072805 |
2133 | } |
2134 | |
954c1994 |
2135 | /* |
2136 | =for apidoc hv_iterval |
2137 | |
2138 | Returns the value from the current position of the hash iterator. See |
2139 | C<hv_iterkey>. |
2140 | |
2141 | =cut |
2142 | */ |
2143 | |
79072805 |
2144 | SV * |
864dbfa3 |
2145 | Perl_hv_iterval(pTHX_ HV *hv, register HE *entry) |
79072805 |
2146 | { |
8990e307 |
2147 | if (SvRMAGICAL(hv)) { |
14befaf4 |
2148 | if (mg_find((SV*)hv, PERL_MAGIC_tied)) { |
c4420975 |
2149 | SV* const sv = sv_newmortal(); |
bbce6d69 |
2150 | if (HeKLEN(entry) == HEf_SVKEY) |
2151 | mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY); |
a3b680e6 |
2152 | else |
2153 | mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry)); |
463ee0b2 |
2154 | return sv; |
2155 | } |
79072805 |
2156 | } |
fde52b5c |
2157 | return HeVAL(entry); |
79072805 |
2158 | } |
2159 | |
954c1994 |
2160 | /* |
2161 | =for apidoc hv_iternextsv |
2162 | |
2163 | Performs an C<hv_iternext>, C<hv_iterkey>, and C<hv_iterval> in one |
2164 | operation. |
2165 | |
2166 | =cut |
2167 | */ |
2168 | |
a0d0e21e |
2169 | SV * |
864dbfa3 |
2170 | Perl_hv_iternextsv(pTHX_ HV *hv, char **key, I32 *retlen) |
a0d0e21e |
2171 | { |
0bd48802 |
2172 | HE * const he = hv_iternext_flags(hv, 0); |
2173 | |
2174 | if (!he) |
a0d0e21e |
2175 | return NULL; |
2176 | *key = hv_iterkey(he, retlen); |
2177 | return hv_iterval(hv, he); |
2178 | } |
2179 | |
954c1994 |
2180 | /* |
bc5cdc23 |
2181 | |
2182 | Now a macro in hv.h |
2183 | |
954c1994 |
2184 | =for apidoc hv_magic |
2185 | |
2186 | Adds magic to a hash. See C<sv_magic>. |
2187 | |
2188 | =cut |
2189 | */ |
2190 | |
bbce6d69 |
2191 | /* possibly free a shared string if no one has access to it |
fde52b5c |
2192 | * len and hash must both be valid for str. |
2193 | */ |
bbce6d69 |
2194 | void |
864dbfa3 |
2195 | Perl_unsharepvn(pTHX_ const char *str, I32 len, U32 hash) |
fde52b5c |
2196 | { |
19692e8d |
2197 | unshare_hek_or_pvn (NULL, str, len, hash); |
2198 | } |
2199 | |
2200 | |
2201 | void |
2202 | Perl_unshare_hek(pTHX_ HEK *hek) |
2203 | { |
bf11fd37 |
2204 | assert(hek); |
19692e8d |
2205 | unshare_hek_or_pvn(hek, NULL, 0, 0); |
2206 | } |
2207 | |
2208 | /* possibly free a shared string if no one has access to it |
2209 | hek if non-NULL takes priority over the other 3, else str, len and hash |
2210 | are used. If so, len and hash must both be valid for str. |
2211 | */ |
df132699 |
2212 | STATIC void |
97ddebaf |
2213 | S_unshare_hek_or_pvn(pTHX_ const HEK *hek, const char *str, I32 len, U32 hash) |
19692e8d |
2214 | { |
97aff369 |
2215 | dVAR; |
cbec9347 |
2216 | register XPVHV* xhv; |
20454177 |
2217 | HE *entry; |
fde52b5c |
2218 | register HE **oentry; |
45d1cc86 |
2219 | HE **first; |
c3654f1a |
2220 | bool is_utf8 = FALSE; |
19692e8d |
2221 | int k_flags = 0; |
aec46f14 |
2222 | const char * const save = str; |
cbbf8932 |
2223 | struct shared_he *he = NULL; |
c3654f1a |
2224 | |
19692e8d |
2225 | if (hek) { |
cbae3960 |
2226 | /* Find the shared he which is just before us in memory. */ |
2227 | he = (struct shared_he *)(((char *)hek) |
2228 | - STRUCT_OFFSET(struct shared_he, |
2229 | shared_he_hek)); |
2230 | |
2231 | /* Assert that the caller passed us a genuine (or at least consistent) |
2232 | shared hek */ |
2233 | assert (he->shared_he_he.hent_hek == hek); |
29404ae0 |
2234 | |
2235 | LOCK_STRTAB_MUTEX; |
de616631 |
2236 | if (he->shared_he_he.he_valu.hent_refcount - 1) { |
2237 | --he->shared_he_he.he_valu.hent_refcount; |
29404ae0 |
2238 | UNLOCK_STRTAB_MUTEX; |
2239 | return; |
2240 | } |
2241 | UNLOCK_STRTAB_MUTEX; |
2242 | |
19692e8d |
2243 | hash = HEK_HASH(hek); |
2244 | } else if (len < 0) { |
2245 | STRLEN tmplen = -len; |
2246 | is_utf8 = TRUE; |
2247 | /* See the note in hv_fetch(). --jhi */ |
2248 | str = (char*)bytes_from_utf8((U8*)str, &tmplen, &is_utf8); |
2249 | len = tmplen; |
2250 | if (is_utf8) |
2251 | k_flags = HVhek_UTF8; |
2252 | if (str != save) |
2253 | k_flags |= HVhek_WASUTF8 | HVhek_FREEKEY; |
c3654f1a |
2254 | } |
1c846c1f |
2255 | |
de616631 |
2256 | /* what follows was the moral equivalent of: |
6b88bc9c |
2257 | if ((Svp = hv_fetch(PL_strtab, tmpsv, FALSE, hash))) { |
a0714e2c |
2258 | if (--*Svp == NULL) |
6b88bc9c |
2259 | hv_delete(PL_strtab, str, len, G_DISCARD, hash); |
bbce6d69 |
2260 | } */ |
cbec9347 |
2261 | xhv = (XPVHV*)SvANY(PL_strtab); |
fde52b5c |
2262 | /* assert(xhv_array != 0) */ |
5f08fbcd |
2263 | LOCK_STRTAB_MUTEX; |
45d1cc86 |
2264 | first = oentry = &(HvARRAY(PL_strtab))[hash & (I32) HvMAX(PL_strtab)]; |
6c1b96a1 |
2265 | if (he) { |
2266 | const HE *const he_he = &(he->shared_he_he); |
45d1cc86 |
2267 | for (entry = *oentry; entry; oentry = &HeNEXT(entry), entry = *oentry) { |
35ab5632 |
2268 | if (entry == he_he) |
2269 | break; |
19692e8d |
2270 | } |
2271 | } else { |
35a4481c |
2272 | const int flags_masked = k_flags & HVhek_MASK; |
45d1cc86 |
2273 | for (entry = *oentry; entry; oentry = &HeNEXT(entry), entry = *oentry) { |
19692e8d |
2274 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
2275 | continue; |
2276 | if (HeKLEN(entry) != len) |
2277 | continue; |
2278 | if (HeKEY(entry) != str && memNE(HeKEY(entry),str,len)) /* is this it? */ |
2279 | continue; |
2280 | if (HeKFLAGS(entry) != flags_masked) |
2281 | continue; |
19692e8d |
2282 | break; |
2283 | } |
2284 | } |
2285 | |
35ab5632 |
2286 | if (entry) { |
2287 | if (--entry->he_valu.hent_refcount == 0) { |
19692e8d |
2288 | *oentry = HeNEXT(entry); |
45d1cc86 |
2289 | if (!*first) { |
2290 | /* There are now no entries in our slot. */ |
19692e8d |
2291 | xhv->xhv_fill--; /* HvFILL(hv)-- */ |
45d1cc86 |
2292 | } |
cbae3960 |
2293 | Safefree(entry); |
4c7185a0 |
2294 | xhv->xhv_keys--; /* HvTOTALKEYS(hv)-- */ |
19692e8d |
2295 | } |
fde52b5c |
2296 | } |
19692e8d |
2297 | |
333f433b |
2298 | UNLOCK_STRTAB_MUTEX; |
35ab5632 |
2299 | if (!entry && ckWARN_d(WARN_INTERNAL)) |
19692e8d |
2300 | Perl_warner(aTHX_ packWARN(WARN_INTERNAL), |
472d47bc |
2301 | "Attempt to free non-existent shared string '%s'%s" |
2302 | pTHX__FORMAT, |
19692e8d |
2303 | hek ? HEK_KEY(hek) : str, |
472d47bc |
2304 | ((k_flags & HVhek_UTF8) ? " (utf8)" : "") pTHX__VALUE); |
19692e8d |
2305 | if (k_flags & HVhek_FREEKEY) |
2306 | Safefree(str); |
fde52b5c |
2307 | } |
2308 | |
bbce6d69 |
2309 | /* get a (constant) string ptr from the global string table |
2310 | * string will get added if it is not already there. |
fde52b5c |
2311 | * len and hash must both be valid for str. |
2312 | */ |
bbce6d69 |
2313 | HEK * |
864dbfa3 |
2314 | Perl_share_hek(pTHX_ const char *str, I32 len, register U32 hash) |
fde52b5c |
2315 | { |
da58a35d |
2316 | bool is_utf8 = FALSE; |
19692e8d |
2317 | int flags = 0; |
aec46f14 |
2318 | const char * const save = str; |
da58a35d |
2319 | |
2320 | if (len < 0) { |
77caf834 |
2321 | STRLEN tmplen = -len; |
da58a35d |
2322 | is_utf8 = TRUE; |
77caf834 |
2323 | /* See the note in hv_fetch(). --jhi */ |
2324 | str = (char*)bytes_from_utf8((U8*)str, &tmplen, &is_utf8); |
2325 | len = tmplen; |
19692e8d |
2326 | /* If we were able to downgrade here, then than means that we were passed |
2327 | in a key which only had chars 0-255, but was utf8 encoded. */ |
2328 | if (is_utf8) |
2329 | flags = HVhek_UTF8; |
2330 | /* If we found we were able to downgrade the string to bytes, then |
2331 | we should flag that it needs upgrading on keys or each. Also flag |
2332 | that we need share_hek_flags to free the string. */ |
2333 | if (str != save) |
2334 | flags |= HVhek_WASUTF8 | HVhek_FREEKEY; |
2335 | } |
2336 | |
6e838c70 |
2337 | return share_hek_flags (str, len, hash, flags); |
19692e8d |
2338 | } |
2339 | |
6e838c70 |
2340 | STATIC HEK * |
19692e8d |
2341 | S_share_hek_flags(pTHX_ const char *str, I32 len, register U32 hash, int flags) |
2342 | { |
97aff369 |
2343 | dVAR; |
19692e8d |
2344 | register HE *entry; |
35a4481c |
2345 | const int flags_masked = flags & HVhek_MASK; |
263cb4a6 |
2346 | const U32 hindex = hash & (I32) HvMAX(PL_strtab); |
bbce6d69 |
2347 | |
fde52b5c |
2348 | /* what follows is the moral equivalent of: |
1c846c1f |
2349 | |
6b88bc9c |
2350 | if (!(Svp = hv_fetch(PL_strtab, str, len, FALSE))) |
a0714e2c |
2351 | hv_store(PL_strtab, str, len, NULL, hash); |
fdcd69b6 |
2352 | |
2353 | Can't rehash the shared string table, so not sure if it's worth |
2354 | counting the number of entries in the linked list |
bbce6d69 |
2355 | */ |
1b6737cc |
2356 | register XPVHV * const xhv = (XPVHV*)SvANY(PL_strtab); |
fde52b5c |
2357 | /* assert(xhv_array != 0) */ |
5f08fbcd |
2358 | LOCK_STRTAB_MUTEX; |
263cb4a6 |
2359 | entry = (HvARRAY(PL_strtab))[hindex]; |
2360 | for (;entry; entry = HeNEXT(entry)) { |
fde52b5c |
2361 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
2362 | continue; |
2363 | if (HeKLEN(entry) != len) |
2364 | continue; |
1c846c1f |
2365 | if (HeKEY(entry) != str && memNE(HeKEY(entry),str,len)) /* is this it? */ |
fde52b5c |
2366 | continue; |
19692e8d |
2367 | if (HeKFLAGS(entry) != flags_masked) |
c3654f1a |
2368 | continue; |
fde52b5c |
2369 | break; |
2370 | } |
263cb4a6 |
2371 | |
2372 | if (!entry) { |
45d1cc86 |
2373 | /* What used to be head of the list. |
2374 | If this is NULL, then we're the first entry for this slot, which |
2375 | means we need to increate fill. */ |
cbae3960 |
2376 | struct shared_he *new_entry; |
2377 | HEK *hek; |
2378 | char *k; |
263cb4a6 |
2379 | HE **const head = &HvARRAY(PL_strtab)[hindex]; |
2380 | HE *const next = *head; |
cbae3960 |
2381 | |
2382 | /* We don't actually store a HE from the arena and a regular HEK. |
2383 | Instead we allocate one chunk of memory big enough for both, |
2384 | and put the HEK straight after the HE. This way we can find the |
2385 | HEK directly from the HE. |
2386 | */ |
2387 | |
a02a5408 |
2388 | Newx(k, STRUCT_OFFSET(struct shared_he, |
cbae3960 |
2389 | shared_he_hek.hek_key[0]) + len + 2, char); |
2390 | new_entry = (struct shared_he *)k; |
2391 | entry = &(new_entry->shared_he_he); |
2392 | hek = &(new_entry->shared_he_hek); |
2393 | |
2394 | Copy(str, HEK_KEY(hek), len, char); |
2395 | HEK_KEY(hek)[len] = 0; |
2396 | HEK_LEN(hek) = len; |
2397 | HEK_HASH(hek) = hash; |
2398 | HEK_FLAGS(hek) = (unsigned char)flags_masked; |
2399 | |
2400 | /* Still "point" to the HEK, so that other code need not know what |
2401 | we're up to. */ |
2402 | HeKEY_hek(entry) = hek; |
de616631 |
2403 | entry->he_valu.hent_refcount = 0; |
263cb4a6 |
2404 | HeNEXT(entry) = next; |
2405 | *head = entry; |
cbae3960 |
2406 | |
4c7185a0 |
2407 | xhv->xhv_keys++; /* HvTOTALKEYS(hv)++ */ |
263cb4a6 |
2408 | if (!next) { /* initial entry? */ |
cbec9347 |
2409 | xhv->xhv_fill++; /* HvFILL(hv)++ */ |
4c9cc595 |
2410 | } else if (xhv->xhv_keys > (IV)xhv->xhv_max /* HvKEYS(hv) > HvMAX(hv) */) { |
cbec9347 |
2411 | hsplit(PL_strtab); |
bbce6d69 |
2412 | } |
2413 | } |
2414 | |
de616631 |
2415 | ++entry->he_valu.hent_refcount; |
5f08fbcd |
2416 | UNLOCK_STRTAB_MUTEX; |
19692e8d |
2417 | |
2418 | if (flags & HVhek_FREEKEY) |
f9a63242 |
2419 | Safefree(str); |
19692e8d |
2420 | |
6e838c70 |
2421 | return HeKEY_hek(entry); |
fde52b5c |
2422 | } |
ecae49c0 |
2423 | |
ca732855 |
2424 | I32 * |
2425 | Perl_hv_placeholders_p(pTHX_ HV *hv) |
2426 | { |
2427 | dVAR; |
2428 | MAGIC *mg = mg_find((SV*)hv, PERL_MAGIC_rhash); |
2429 | |
2430 | if (!mg) { |
2431 | mg = sv_magicext((SV*)hv, 0, PERL_MAGIC_rhash, 0, 0, 0); |
2432 | |
2433 | if (!mg) { |
2434 | Perl_die(aTHX_ "panic: hv_placeholders_p"); |
2435 | } |
2436 | } |
2437 | return &(mg->mg_len); |
2438 | } |
2439 | |
2440 | |
2441 | I32 |
2442 | Perl_hv_placeholders_get(pTHX_ HV *hv) |
2443 | { |
2444 | dVAR; |
b464bac0 |
2445 | MAGIC * const mg = mg_find((SV*)hv, PERL_MAGIC_rhash); |
ca732855 |
2446 | |
2447 | return mg ? mg->mg_len : 0; |
2448 | } |
2449 | |
2450 | void |
ac1e784a |
2451 | Perl_hv_placeholders_set(pTHX_ HV *hv, I32 ph) |
ca732855 |
2452 | { |
2453 | dVAR; |
b464bac0 |
2454 | MAGIC * const mg = mg_find((SV*)hv, PERL_MAGIC_rhash); |
ca732855 |
2455 | |
2456 | if (mg) { |
2457 | mg->mg_len = ph; |
2458 | } else if (ph) { |
2459 | if (!sv_magicext((SV*)hv, 0, PERL_MAGIC_rhash, 0, 0, ph)) |
2460 | Perl_die(aTHX_ "panic: hv_placeholders_set"); |
2461 | } |
2462 | /* else we don't need to add magic to record 0 placeholders. */ |
2463 | } |
ecae49c0 |
2464 | |
2a49f0f5 |
2465 | STATIC SV * |
7b0bddfa |
2466 | S_refcounted_he_value(pTHX_ const struct refcounted_he *he) |
2467 | { |
0b2d3faa |
2468 | dVAR; |
7b0bddfa |
2469 | SV *value; |
2470 | switch(he->refcounted_he_data[0] & HVrhek_typemask) { |
2471 | case HVrhek_undef: |
2472 | value = newSV(0); |
2473 | break; |
2474 | case HVrhek_delete: |
2475 | value = &PL_sv_placeholder; |
2476 | break; |
2477 | case HVrhek_IV: |
44ebaf21 |
2478 | value = newSViv(he->refcounted_he_val.refcounted_he_u_iv); |
2479 | break; |
2480 | case HVrhek_UV: |
2481 | value = newSVuv(he->refcounted_he_val.refcounted_he_u_uv); |
7b0bddfa |
2482 | break; |
2483 | case HVrhek_PV: |
44ebaf21 |
2484 | case HVrhek_PV_UTF8: |
7b0bddfa |
2485 | /* Create a string SV that directly points to the bytes in our |
2486 | structure. */ |
b9f83d2f |
2487 | value = newSV_type(SVt_PV); |
7b0bddfa |
2488 | SvPV_set(value, (char *) he->refcounted_he_data + 1); |
2489 | SvCUR_set(value, he->refcounted_he_val.refcounted_he_u_len); |
2490 | /* This stops anything trying to free it */ |
2491 | SvLEN_set(value, 0); |
2492 | SvPOK_on(value); |
2493 | SvREADONLY_on(value); |
44ebaf21 |
2494 | if ((he->refcounted_he_data[0] & HVrhek_typemask) == HVrhek_PV_UTF8) |
7b0bddfa |
2495 | SvUTF8_on(value); |
2496 | break; |
2497 | default: |
2498 | Perl_croak(aTHX_ "panic: refcounted_he_value bad flags %x", |
2499 | he->refcounted_he_data[0]); |
2500 | } |
2501 | return value; |
2502 | } |
2503 | |
ecae49c0 |
2504 | /* |
b3ca2e83 |
2505 | =for apidoc refcounted_he_chain_2hv |
2506 | |
abc25d8c |
2507 | Generates and returns a C<HV *> by walking up the tree starting at the passed |
b3ca2e83 |
2508 | in C<struct refcounted_he *>. |
2509 | |
2510 | =cut |
2511 | */ |
2512 | HV * |
2513 | Perl_refcounted_he_chain_2hv(pTHX_ const struct refcounted_he *chain) |
2514 | { |
7a89be66 |
2515 | dVAR; |
b3ca2e83 |
2516 | HV *hv = newHV(); |
2517 | U32 placeholders = 0; |
2518 | /* We could chase the chain once to get an idea of the number of keys, |
2519 | and call ksplit. But for now we'll make a potentially inefficient |
2520 | hash with only 8 entries in its array. */ |
2521 | const U32 max = HvMAX(hv); |
2522 | |
2523 | if (!HvARRAY(hv)) { |
2524 | char *array; |
2525 | Newxz(array, PERL_HV_ARRAY_ALLOC_BYTES(max + 1), char); |
2526 | HvARRAY(hv) = (HE**)array; |
2527 | } |
2528 | |
2529 | while (chain) { |
cbb1fbea |
2530 | #ifdef USE_ITHREADS |
b6bbf3fa |
2531 | U32 hash = chain->refcounted_he_hash; |
cbb1fbea |
2532 | #else |
2533 | U32 hash = HEK_HASH(chain->refcounted_he_hek); |
2534 | #endif |
b3ca2e83 |
2535 | HE **oentry = &((HvARRAY(hv))[hash & max]); |
2536 | HE *entry = *oentry; |
b6bbf3fa |
2537 | SV *value; |
cbb1fbea |
2538 | |
b3ca2e83 |
2539 | for (; entry; entry = HeNEXT(entry)) { |
2540 | if (HeHASH(entry) == hash) { |
9f769845 |
2541 | /* We might have a duplicate key here. If so, entry is older |
2542 | than the key we've already put in the hash, so if they are |
2543 | the same, skip adding entry. */ |
2544 | #ifdef USE_ITHREADS |
2545 | const STRLEN klen = HeKLEN(entry); |
2546 | const char *const key = HeKEY(entry); |
2547 | if (klen == chain->refcounted_he_keylen |
2548 | && (!!HeKUTF8(entry) |
2549 | == !!(chain->refcounted_he_data[0] & HVhek_UTF8)) |
2550 | && memEQ(key, REF_HE_KEY(chain), klen)) |
2551 | goto next_please; |
2552 | #else |
2553 | if (HeKEY_hek(entry) == chain->refcounted_he_hek) |
2554 | goto next_please; |
2555 | if (HeKLEN(entry) == HEK_LEN(chain->refcounted_he_hek) |
2556 | && HeKUTF8(entry) == HEK_UTF8(chain->refcounted_he_hek) |
2557 | && memEQ(HeKEY(entry), HEK_KEY(chain->refcounted_he_hek), |
2558 | HeKLEN(entry))) |
2559 | goto next_please; |
2560 | #endif |
b3ca2e83 |
2561 | } |
2562 | } |
2563 | assert (!entry); |
2564 | entry = new_HE(); |
2565 | |
cbb1fbea |
2566 | #ifdef USE_ITHREADS |
2567 | HeKEY_hek(entry) |
7b0bddfa |
2568 | = share_hek_flags(REF_HE_KEY(chain), |
b6bbf3fa |
2569 | chain->refcounted_he_keylen, |
2570 | chain->refcounted_he_hash, |
2571 | (chain->refcounted_he_data[0] |
2572 | & (HVhek_UTF8|HVhek_WASUTF8))); |
cbb1fbea |
2573 | #else |
71ad1b0c |
2574 | HeKEY_hek(entry) = share_hek_hek(chain->refcounted_he_hek); |
cbb1fbea |
2575 | #endif |
7b0bddfa |
2576 | value = refcounted_he_value(chain); |
2577 | if (value == &PL_sv_placeholder) |
b3ca2e83 |
2578 | placeholders++; |
b6bbf3fa |
2579 | HeVAL(entry) = value; |
b3ca2e83 |
2580 | |
2581 | /* Link it into the chain. */ |
2582 | HeNEXT(entry) = *oentry; |
2583 | if (!HeNEXT(entry)) { |
2584 | /* initial entry. */ |
2585 | HvFILL(hv)++; |
2586 | } |
2587 | *oentry = entry; |
2588 | |
2589 | HvTOTALKEYS(hv)++; |
2590 | |
2591 | next_please: |
71ad1b0c |
2592 | chain = chain->refcounted_he_next; |
b3ca2e83 |
2593 | } |
2594 | |
2595 | if (placeholders) { |
2596 | clear_placeholders(hv, placeholders); |
2597 | HvTOTALKEYS(hv) -= placeholders; |
2598 | } |
2599 | |
2600 | /* We could check in the loop to see if we encounter any keys with key |
2601 | flags, but it's probably not worth it, as this per-hash flag is only |
2602 | really meant as an optimisation for things like Storable. */ |
2603 | HvHASKFLAGS_on(hv); |
def9038f |
2604 | DEBUG_A(Perl_hv_assert(aTHX_ hv)); |
b3ca2e83 |
2605 | |
2606 | return hv; |
2607 | } |
2608 | |
7b0bddfa |
2609 | SV * |
2610 | Perl_refcounted_he_fetch(pTHX_ const struct refcounted_he *chain, SV *keysv, |
2611 | const char *key, STRLEN klen, int flags, U32 hash) |
2612 | { |
0b2d3faa |
2613 | dVAR; |
7b0bddfa |
2614 | /* Just to be awkward, if you're using this interface the UTF-8-or-not-ness |
2615 | of your key has to exactly match that which is stored. */ |
2616 | SV *value = &PL_sv_placeholder; |
d8c5b3c5 |
2617 | bool is_utf8; |
7b0bddfa |
2618 | |
2619 | if (keysv) { |
2620 | if (flags & HVhek_FREEKEY) |
2621 | Safefree(key); |
2622 | key = SvPV_const(keysv, klen); |
2623 | flags = 0; |
d8c5b3c5 |
2624 | is_utf8 = (SvUTF8(keysv) != 0); |
2625 | } else { |
2626 | is_utf8 = ((flags & HVhek_UTF8) ? TRUE : FALSE); |
7b0bddfa |
2627 | } |
2628 | |
2629 | if (!hash) { |
2630 | if (keysv && (SvIsCOW_shared_hash(keysv))) { |
2631 | hash = SvSHARED_HASH(keysv); |
2632 | } else { |
2633 | PERL_HASH(hash, key, klen); |
2634 | } |
2635 | } |
2636 | |
2637 | for (; chain; chain = chain->refcounted_he_next) { |
2638 | #ifdef USE_ITHREADS |
2639 | if (hash != chain->refcounted_he_hash) |
2640 | continue; |
2641 | if (klen != chain->refcounted_he_keylen) |
2642 | continue; |
2643 | if (memNE(REF_HE_KEY(chain),key,klen)) |
2644 | continue; |
d8c5b3c5 |
2645 | if (!!is_utf8 != !!(chain->refcounted_he_data[0] & HVhek_UTF8)) |
2646 | continue; |
7b0bddfa |
2647 | #else |
2648 | if (hash != HEK_HASH(chain->refcounted_he_hek)) |
2649 | continue; |
670f1322 |
2650 | if (klen != (STRLEN)HEK_LEN(chain->refcounted_he_hek)) |
7b0bddfa |
2651 | continue; |
2652 | if (memNE(HEK_KEY(chain->refcounted_he_hek),key,klen)) |
2653 | continue; |
d8c5b3c5 |
2654 | if (!!is_utf8 != !!HEK_UTF8(chain->refcounted_he_hek)) |
2655 | continue; |
7b0bddfa |
2656 | #endif |
2657 | |
2658 | value = sv_2mortal(refcounted_he_value(chain)); |
2659 | break; |
2660 | } |
2661 | |
2662 | if (flags & HVhek_FREEKEY) |
2663 | Safefree(key); |
2664 | |
2665 | return value; |
2666 | } |
2667 | |
b3ca2e83 |
2668 | /* |
2669 | =for apidoc refcounted_he_new |
2670 | |
ec2a1de7 |
2671 | Creates a new C<struct refcounted_he>. As S<key> is copied, and value is |
2672 | stored in a compact form, all references remain the property of the caller. |
2673 | The C<struct refcounted_he> is returned with a reference count of 1. |
b3ca2e83 |
2674 | |
2675 | =cut |
2676 | */ |
2677 | |
2678 | struct refcounted_he * |
2679 | Perl_refcounted_he_new(pTHX_ struct refcounted_he *const parent, |
2680 | SV *const key, SV *const value) { |
7a89be66 |
2681 | dVAR; |
b3ca2e83 |
2682 | struct refcounted_he *he; |
b6bbf3fa |
2683 | STRLEN key_len; |
2684 | const char *key_p = SvPV_const(key, key_len); |
2685 | STRLEN value_len = 0; |
95b63a38 |
2686 | const char *value_p = NULL; |
b6bbf3fa |
2687 | char value_type; |
2688 | char flags; |
2689 | STRLEN key_offset; |
b3ca2e83 |
2690 | U32 hash; |
d8c5b3c5 |
2691 | bool is_utf8 = SvUTF8(key) ? TRUE : FALSE; |
b6bbf3fa |
2692 | |
2693 | if (SvPOK(value)) { |
2694 | value_type = HVrhek_PV; |
2695 | } else if (SvIOK(value)) { |
2696 | value_type = HVrhek_IV; |
2697 | } else if (value == &PL_sv_placeholder) { |
2698 | value_type = HVrhek_delete; |
2699 | } else if (!SvOK(value)) { |
2700 | value_type = HVrhek_undef; |
2701 | } else { |
2702 | value_type = HVrhek_PV; |
2703 | } |
b3ca2e83 |
2704 | |
b6bbf3fa |
2705 | if (value_type == HVrhek_PV) { |
2706 | value_p = SvPV_const(value, value_len); |
2707 | key_offset = value_len + 2; |
2708 | } else { |
2709 | value_len = 0; |
2710 | key_offset = 1; |
2711 | } |
b6bbf3fa |
2712 | |
b6bbf3fa |
2713 | #ifdef USE_ITHREADS |
10edeb5d |
2714 | he = (struct refcounted_he*) |
2715 | PerlMemShared_malloc(sizeof(struct refcounted_he) - 1 |
2716 | + key_len |
2717 | + key_offset); |
6cef672b |
2718 | #else |
10edeb5d |
2719 | he = (struct refcounted_he*) |
2720 | PerlMemShared_malloc(sizeof(struct refcounted_he) - 1 |
2721 | + key_offset); |
6cef672b |
2722 | #endif |
b3ca2e83 |
2723 | |
b3ca2e83 |
2724 | |
71ad1b0c |
2725 | he->refcounted_he_next = parent; |
b6bbf3fa |
2726 | |
2727 | if (value_type == HVrhek_PV) { |
2728 | Copy(value_p, he->refcounted_he_data + 1, value_len + 1, char); |
2729 | he->refcounted_he_val.refcounted_he_u_len = value_len; |
44ebaf21 |
2730 | /* Do it this way so that the SvUTF8() test is after the SvPV, in case |
2731 | the value is overloaded, and doesn't yet have the UTF-8flag set. */ |
2732 | if (SvUTF8(value)) |
2733 | value_type = HVrhek_PV_UTF8; |
b6bbf3fa |
2734 | } else if (value_type == HVrhek_IV) { |
2735 | if (SvUOK(value)) { |
2736 | he->refcounted_he_val.refcounted_he_u_uv = SvUVX(value); |
44ebaf21 |
2737 | value_type = HVrhek_UV; |
b6bbf3fa |
2738 | } else { |
2739 | he->refcounted_he_val.refcounted_he_u_iv = SvIVX(value); |
2740 | } |
2741 | } |
44ebaf21 |
2742 | flags = value_type; |
b6bbf3fa |
2743 | |
2744 | if (is_utf8) { |
2745 | /* Hash keys are always stored normalised to (yes) ISO-8859-1. |
2746 | As we're going to be building hash keys from this value in future, |
2747 | normalise it now. */ |
2748 | key_p = (char*)bytes_from_utf8((const U8*)key_p, &key_len, &is_utf8); |
2749 | flags |= is_utf8 ? HVhek_UTF8 : HVhek_WASUTF8; |
2750 | } |
2751 | PERL_HASH(hash, key_p, key_len); |
2752 | |
cbb1fbea |
2753 | #ifdef USE_ITHREADS |
b6bbf3fa |
2754 | he->refcounted_he_hash = hash; |
2755 | he->refcounted_he_keylen = key_len; |
2756 | Copy(key_p, he->refcounted_he_data + key_offset, key_len, char); |
cbb1fbea |
2757 | #else |
b6bbf3fa |
2758 | he->refcounted_he_hek = share_hek_flags(key_p, key_len, hash, flags); |
cbb1fbea |
2759 | #endif |
b6bbf3fa |
2760 | |
2761 | if (flags & HVhek_WASUTF8) { |
2762 | /* If it was downgraded from UTF-8, then the pointer returned from |
2763 | bytes_from_utf8 is an allocated pointer that we must free. */ |
2764 | Safefree(key_p); |
2765 | } |
2766 | |
2767 | he->refcounted_he_data[0] = flags; |
b3ca2e83 |
2768 | he->refcounted_he_refcnt = 1; |
2769 | |
2770 | return he; |
2771 | } |
2772 | |
2773 | /* |
2774 | =for apidoc refcounted_he_free |
2775 | |
2776 | Decrements the reference count of the passed in C<struct refcounted_he *> |
2777 | by one. If the reference count reaches zero the structure's memory is freed, |
2778 | and C<refcounted_he_free> iterates onto the parent node. |
2779 | |
2780 | =cut |
2781 | */ |
2782 | |
2783 | void |
2784 | Perl_refcounted_he_free(pTHX_ struct refcounted_he *he) { |
53d44271 |
2785 | dVAR; |
57ca3b03 |
2786 | PERL_UNUSED_CONTEXT; |
2787 | |
b3ca2e83 |
2788 | while (he) { |
2789 | struct refcounted_he *copy; |
cbb1fbea |
2790 | U32 new_count; |
b3ca2e83 |
2791 | |
cbb1fbea |
2792 | HINTS_REFCNT_LOCK; |
2793 | new_count = --he->refcounted_he_refcnt; |
2794 | HINTS_REFCNT_UNLOCK; |
2795 | |
2796 | if (new_count) { |
b3ca2e83 |
2797 | return; |
cbb1fbea |
2798 | } |
b3ca2e83 |
2799 | |
b6bbf3fa |
2800 | #ifndef USE_ITHREADS |
71ad1b0c |
2801 | unshare_hek_or_pvn (he->refcounted_he_hek, 0, 0, 0); |
cbb1fbea |
2802 | #endif |
b3ca2e83 |
2803 | copy = he; |
71ad1b0c |
2804 | he = he->refcounted_he_next; |
b6bbf3fa |
2805 | PerlMemShared_free(copy); |
b3ca2e83 |
2806 | } |
2807 | } |
2808 | |
b3ca2e83 |
2809 | /* |
ecae49c0 |
2810 | =for apidoc hv_assert |
2811 | |
2812 | Check that a hash is in an internally consistent state. |
2813 | |
2814 | =cut |
2815 | */ |
2816 | |
943795c2 |
2817 | #ifdef DEBUGGING |
2818 | |
ecae49c0 |
2819 | void |
2820 | Perl_hv_assert(pTHX_ HV *hv) |
2821 | { |
57ca3b03 |
2822 | dVAR; |
2823 | HE* entry; |
2824 | int withflags = 0; |
2825 | int placeholders = 0; |
2826 | int real = 0; |
2827 | int bad = 0; |
2828 | const I32 riter = HvRITER_get(hv); |
2829 | HE *eiter = HvEITER_get(hv); |
2830 | |
2831 | (void)hv_iterinit(hv); |
2832 | |
2833 | while ((entry = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS))) { |
2834 | /* sanity check the values */ |
2835 | if (HeVAL(entry) == &PL_sv_placeholder) |
2836 | placeholders++; |
2837 | else |
2838 | real++; |
2839 | /* sanity check the keys */ |
2840 | if (HeSVKEY(entry)) { |
6f207bd3 |
2841 | NOOP; /* Don't know what to check on SV keys. */ |
57ca3b03 |
2842 | } else if (HeKUTF8(entry)) { |
2843 | withflags++; |
2844 | if (HeKWASUTF8(entry)) { |
2845 | PerlIO_printf(Perl_debug_log, |
d2a455e7 |
2846 | "hash key has both WASUTF8 and UTF8: '%.*s'\n", |
57ca3b03 |
2847 | (int) HeKLEN(entry), HeKEY(entry)); |
2848 | bad = 1; |
2849 | } |
2850 | } else if (HeKWASUTF8(entry)) |
2851 | withflags++; |
2852 | } |
2853 | if (!SvTIED_mg((SV*)hv, PERL_MAGIC_tied)) { |
2854 | static const char bad_count[] = "Count %d %s(s), but hash reports %d\n"; |
2855 | const int nhashkeys = HvUSEDKEYS(hv); |
2856 | const int nhashplaceholders = HvPLACEHOLDERS_get(hv); |
2857 | |
2858 | if (nhashkeys != real) { |
2859 | PerlIO_printf(Perl_debug_log, bad_count, real, "keys", nhashkeys ); |
2860 | bad = 1; |
2861 | } |
2862 | if (nhashplaceholders != placeholders) { |
2863 | PerlIO_printf(Perl_debug_log, bad_count, placeholders, "placeholder", nhashplaceholders ); |
2864 | bad = 1; |
2865 | } |
2866 | } |
2867 | if (withflags && ! HvHASKFLAGS(hv)) { |
2868 | PerlIO_printf(Perl_debug_log, |
2869 | "Hash has HASKFLAGS off but I count %d key(s) with flags\n", |
2870 | withflags); |
2871 | bad = 1; |
2872 | } |
2873 | if (bad) { |
2874 | sv_dump((SV *)hv); |
2875 | } |
2876 | HvRITER_set(hv, riter); /* Restore hash iterator state */ |
2877 | HvEITER_set(hv, eiter); |
ecae49c0 |
2878 | } |
af3babe4 |
2879 | |
943795c2 |
2880 | #endif |
2881 | |
af3babe4 |
2882 | /* |
2883 | * Local variables: |
2884 | * c-indentation-style: bsd |
2885 | * c-basic-offset: 4 |
2886 | * indent-tabs-mode: t |
2887 | * End: |
2888 | * |
37442d52 |
2889 | * ex: set ts=8 sts=4 sw=4 noet: |
2890 | */ |