3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
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.
12 * I sit beside the fire and think
13 * of all that I have seen.
16 * [p.278 of _The Lord of the Rings_, II/iii: "The Ring Goes South"]
20 =head1 Hash Manipulation Functions
22 A HV structure represents a Perl hash. It consists mainly of an array
23 of pointers, each of which points to a linked list of HE structures. The
24 array is indexed by the hash function of the key, so each linked list
25 represents all the hash entries with the same hash value. Each HE contains
26 a pointer to the actual value, plus a pointer to a HEK structure which
27 holds the key and hash value.
35 #define PERL_HASH_INTERNAL_ACCESS
38 #define DO_HSPLIT(xhv) ((xhv)->xhv_keys > (xhv)->xhv_max) /* HvTOTALKEYS(hv) > HvMAX(hv) */
40 static const char S_strtab_error[]
41 = "Cannot modify shared string table in hv_%s";
45 #define new_HE() (HE*)safemalloc(sizeof(HE))
46 #define del_HE(p) safefree((char*)p)
55 void ** const root = &PL_body_roots[HE_SVSLOT];
58 Perl_more_bodies(aTHX_ HE_SVSLOT, sizeof(HE), PERL_ARENA_SIZE);
65 #define new_HE() new_he()
68 HeNEXT(p) = (HE*)(PL_body_roots[HE_SVSLOT]); \
69 PL_body_roots[HE_SVSLOT] = p; \
77 S_save_hek_flags(const char *str, I32 len, U32 hash, int flags)
79 const int flags_masked = flags & HVhek_MASK;
83 PERL_ARGS_ASSERT_SAVE_HEK_FLAGS;
85 Newx(k, HEK_BASESIZE + len + 2, char);
87 Copy(str, HEK_KEY(hek), len, char);
88 HEK_KEY(hek)[len] = 0;
91 HEK_FLAGS(hek) = (unsigned char)flags_masked | HVhek_UNSHARED;
93 if (flags & HVhek_FREEKEY)
98 /* free the pool of temporary HE/HEK pairs returned by hv_fetch_ent
102 Perl_free_tied_hv_pool(pTHX)
105 HE *he = PL_hv_fetch_ent_mh;
108 Safefree(HeKEY_hek(he));
112 PL_hv_fetch_ent_mh = NULL;
115 #if defined(USE_ITHREADS)
117 Perl_hek_dup(pTHX_ HEK *source, CLONE_PARAMS* param)
121 PERL_ARGS_ASSERT_HEK_DUP;
122 PERL_UNUSED_ARG(param);
127 shared = (HEK*)ptr_table_fetch(PL_ptr_table, source);
129 /* We already shared this hash key. */
130 (void)share_hek_hek(shared);
134 = share_hek_flags(HEK_KEY(source), HEK_LEN(source),
135 HEK_HASH(source), HEK_FLAGS(source));
136 ptr_table_store(PL_ptr_table, source, shared);
142 Perl_he_dup(pTHX_ const HE *e, bool shared, CLONE_PARAMS* param)
146 PERL_ARGS_ASSERT_HE_DUP;
150 /* look for it in the table first */
151 ret = (HE*)ptr_table_fetch(PL_ptr_table, e);
155 /* create anew and remember what it is */
157 ptr_table_store(PL_ptr_table, e, ret);
159 HeNEXT(ret) = he_dup(HeNEXT(e),shared, param);
160 if (HeKLEN(e) == HEf_SVKEY) {
162 Newx(k, HEK_BASESIZE + sizeof(const SV *), char);
163 HeKEY_hek(ret) = (HEK*)k;
164 HeKEY_sv(ret) = sv_dup_inc(HeKEY_sv(e), param);
167 /* This is hek_dup inlined, which seems to be important for speed
169 HEK * const source = HeKEY_hek(e);
170 HEK *shared = (HEK*)ptr_table_fetch(PL_ptr_table, source);
173 /* We already shared this hash key. */
174 (void)share_hek_hek(shared);
178 = share_hek_flags(HEK_KEY(source), HEK_LEN(source),
179 HEK_HASH(source), HEK_FLAGS(source));
180 ptr_table_store(PL_ptr_table, source, shared);
182 HeKEY_hek(ret) = shared;
185 HeKEY_hek(ret) = save_hek_flags(HeKEY(e), HeKLEN(e), HeHASH(e),
187 HeVAL(ret) = sv_dup_inc(HeVAL(e), param);
190 #endif /* USE_ITHREADS */
193 S_hv_notallowed(pTHX_ int flags, const char *key, I32 klen,
196 SV * const sv = sv_newmortal();
198 PERL_ARGS_ASSERT_HV_NOTALLOWED;
200 if (!(flags & HVhek_FREEKEY)) {
201 sv_setpvn(sv, key, klen);
204 /* Need to free saved eventually assign to mortal SV */
205 /* XXX is this line an error ???: SV *sv = sv_newmortal(); */
206 sv_usepvn(sv, (char *) key, klen);
208 if (flags & HVhek_UTF8) {
211 Perl_croak(aTHX_ msg, SVfARG(sv));
214 /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot
220 Stores an SV in a hash. The hash key is specified as C<key> and the
221 absolute value of C<klen> is the length of the key. If C<klen> is
222 negative the key is assumed to be in UTF-8-encoded Unicode. The
223 C<hash> parameter is the precomputed hash value; if it is zero then
224 Perl will compute it.
226 The return value will be
227 NULL if the operation failed or if the value did not need to be actually
228 stored within the hash (as in the case of tied hashes). Otherwise it can
229 be dereferenced to get the original C<SV*>. Note that the caller is
230 responsible for suitably incrementing the reference count of C<val> before
231 the call, and decrementing it if the function returned NULL. Effectively
232 a successful hv_store takes ownership of one reference to C<val>. This is
233 usually what you want; a newly created SV has a reference count of one, so
234 if all your code does is create SVs then store them in a hash, hv_store
235 will own the only reference to the new SV, and your code doesn't need to do
236 anything further to tidy up. hv_store is not implemented as a call to
237 hv_store_ent, and does not create a temporary SV for the key, so if your
238 key data is not already in SV form then use hv_store in preference to
241 See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more
242 information on how to use this function on tied hashes.
244 =for apidoc hv_store_ent
246 Stores C<val> in a hash. The hash key is specified as C<key>. The C<hash>
247 parameter is the precomputed hash value; if it is zero then Perl will
248 compute it. The return value is the new hash entry so created. It will be
249 NULL if the operation failed or if the value did not need to be actually
250 stored within the hash (as in the case of tied hashes). Otherwise the
251 contents of the return value can be accessed using the C<He?> macros
252 described here. Note that the caller is responsible for suitably
253 incrementing the reference count of C<val> before the call, and
254 decrementing it if the function returned NULL. Effectively a successful
255 hv_store_ent takes ownership of one reference to C<val>. This is
256 usually what you want; a newly created SV has a reference count of one, so
257 if all your code does is create SVs then store them in a hash, hv_store
258 will own the only reference to the new SV, and your code doesn't need to do
259 anything further to tidy up. Note that hv_store_ent only reads the C<key>;
260 unlike C<val> it does not take ownership of it, so maintaining the correct
261 reference count on C<key> is entirely the caller's responsibility. hv_store
262 is not implemented as a call to hv_store_ent, and does not create a temporary
263 SV for the key, so if your key data is not already in SV form then use
264 hv_store in preference to hv_store_ent.
266 See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more
267 information on how to use this function on tied hashes.
269 =for apidoc hv_exists
271 Returns a boolean indicating whether the specified hash key exists. The
272 absolute value of C<klen> is the length of the key. If C<klen> is
273 negative the key is assumed to be in UTF-8-encoded Unicode.
277 Returns the SV which corresponds to the specified key in the hash.
278 The absolute value of C<klen> is the length of the key. If C<klen> is
279 negative the key is assumed to be in UTF-8-encoded Unicode. If
280 C<lval> is set then the fetch will be part of a store. This means that if
281 there is no value in the hash associated with the given key, then one is
282 created and a pointer to it is returned. The C<SV*> it points to can be
283 assigned to. But always check that the
284 return value is non-null before dereferencing it to an C<SV*>.
286 See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more
287 information on how to use this function on tied hashes.
289 =for apidoc hv_exists_ent
291 Returns a boolean indicating whether
292 the specified hash key exists. C<hash>
293 can be a valid precomputed hash value, or 0 to ask for it to be
299 /* returns an HE * structure with the all fields set */
300 /* note that hent_val will be a mortal sv for MAGICAL hashes */
302 =for apidoc hv_fetch_ent
304 Returns the hash entry which corresponds to the specified key in the hash.
305 C<hash> must be a valid precomputed hash number for the given C<key>, or 0
306 if you want the function to compute it. IF C<lval> is set then the fetch
307 will be part of a store. Make sure the return value is non-null before
308 accessing it. The return value when C<hv> is a tied hash is a pointer to a
309 static location, so be sure to make a copy of the structure if you need to
312 See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more
313 information on how to use this function on tied hashes.
318 /* Common code for hv_delete()/hv_exists()/hv_fetch()/hv_store() */
320 Perl_hv_common_key_len(pTHX_ HV *hv, const char *key, I32 klen_i32,
321 const int action, SV *val, const U32 hash)
326 PERL_ARGS_ASSERT_HV_COMMON_KEY_LEN;
335 return hv_common(hv, NULL, key, klen, flags, action, val, hash);
339 Perl_hv_common(pTHX_ HV *hv, SV *keysv, const char *key, STRLEN klen,
340 int flags, int action, SV *val, U32 hash)
349 const int return_svp = action & HV_FETCH_JUST_SV;
353 if (SvTYPE(hv) == (svtype)SVTYPEMASK)
356 assert(SvTYPE(hv) == SVt_PVHV);
358 if (SvSMAGICAL(hv) && SvGMAGICAL(hv) && !(action & HV_DISABLE_UVAR_XKEY)) {
360 if ((mg = mg_find((const SV *)hv, PERL_MAGIC_uvar))) {
361 struct ufuncs * const uf = (struct ufuncs *)mg->mg_ptr;
362 if (uf->uf_set == NULL) {
363 SV* obj = mg->mg_obj;
366 keysv = newSVpvn_flags(key, klen, SVs_TEMP |
367 ((flags & HVhek_UTF8)
371 mg->mg_obj = keysv; /* pass key */
372 uf->uf_index = action; /* pass action */
373 magic_getuvar(MUTABLE_SV(hv), mg);
374 keysv = mg->mg_obj; /* may have changed */
377 /* If the key may have changed, then we need to invalidate
378 any passed-in computed hash value. */
384 if (flags & HVhek_FREEKEY)
386 key = SvPV_const(keysv, klen);
387 is_utf8 = (SvUTF8(keysv) != 0);
388 if (SvIsCOW_shared_hash(keysv)) {
389 flags = HVhek_KEYCANONICAL | (is_utf8 ? HVhek_UTF8 : 0);
391 flags = is_utf8 ? HVhek_UTF8 : 0;
394 is_utf8 = ((flags & HVhek_UTF8) ? TRUE : FALSE);
397 if (action & HV_DELETE) {
398 return (void *) hv_delete_common(hv, keysv, key, klen,
399 flags, action, hash);
402 xhv = (XPVHV*)SvANY(hv);
404 if (SvRMAGICAL(hv) && !(action & (HV_FETCH_ISSTORE|HV_FETCH_ISEXISTS))) {
405 if (mg_find((const SV *)hv, PERL_MAGIC_tied)
406 || SvGMAGICAL((const SV *)hv))
408 /* FIXME should be able to skimp on the HE/HEK here when
409 HV_FETCH_JUST_SV is true. */
411 keysv = newSVpvn_utf8(key, klen, is_utf8);
413 keysv = newSVsv(keysv);
416 mg_copy(MUTABLE_SV(hv), sv, (char *)keysv, HEf_SVKEY);
418 /* grab a fake HE/HEK pair from the pool or make a new one */
419 entry = PL_hv_fetch_ent_mh;
421 PL_hv_fetch_ent_mh = HeNEXT(entry);
425 Newx(k, HEK_BASESIZE + sizeof(const SV *), char);
426 HeKEY_hek(entry) = (HEK*)k;
428 HeNEXT(entry) = NULL;
429 HeSVKEY_set(entry, keysv);
431 sv_upgrade(sv, SVt_PVLV);
433 /* so we can free entry when freeing sv */
434 LvTARG(sv) = MUTABLE_SV(entry);
436 /* XXX remove at some point? */
437 if (flags & HVhek_FREEKEY)
441 return entry ? (void *) &HeVAL(entry) : NULL;
443 return (void *) entry;
445 #ifdef ENV_IS_CASELESS
446 else if (mg_find((const SV *)hv, PERL_MAGIC_env)) {
448 for (i = 0; i < klen; ++i)
449 if (isLOWER(key[i])) {
450 /* Would be nice if we had a routine to do the
451 copy and upercase in a single pass through. */
452 const char * const nkey = strupr(savepvn(key,klen));
453 /* Note that this fetch is for nkey (the uppercased
454 key) whereas the store is for key (the original) */
455 void *result = hv_common(hv, NULL, nkey, klen,
456 HVhek_FREEKEY, /* free nkey */
457 0 /* non-LVAL fetch */
458 | HV_DISABLE_UVAR_XKEY
461 0 /* compute hash */);
462 if (!result && (action & HV_FETCH_LVALUE)) {
463 /* This call will free key if necessary.
464 Do it this way to encourage compiler to tail
466 result = hv_common(hv, keysv, key, klen, flags,
468 | HV_DISABLE_UVAR_XKEY
472 if (flags & HVhek_FREEKEY)
480 else if (SvRMAGICAL(hv) && (action & HV_FETCH_ISEXISTS)) {
481 if (mg_find((const SV *)hv, PERL_MAGIC_tied)
482 || SvGMAGICAL((const SV *)hv)) {
483 /* I don't understand why hv_exists_ent has svret and sv,
484 whereas hv_exists only had one. */
485 SV * const svret = sv_newmortal();
488 if (keysv || is_utf8) {
490 keysv = newSVpvn_utf8(key, klen, TRUE);
492 keysv = newSVsv(keysv);
494 mg_copy(MUTABLE_SV(hv), sv, (char *)sv_2mortal(keysv), HEf_SVKEY);
496 mg_copy(MUTABLE_SV(hv), sv, key, klen);
498 if (flags & HVhek_FREEKEY)
500 magic_existspack(svret, mg_find(sv, PERL_MAGIC_tiedelem));
501 /* This cast somewhat evil, but I'm merely using NULL/
502 not NULL to return the boolean exists.
503 And I know hv is not NULL. */
504 return SvTRUE(svret) ? (void *)hv : NULL;
506 #ifdef ENV_IS_CASELESS
507 else if (mg_find((const SV *)hv, PERL_MAGIC_env)) {
508 /* XXX This code isn't UTF8 clean. */
509 char * const keysave = (char * const)key;
510 /* Will need to free this, so set FREEKEY flag. */
511 key = savepvn(key,klen);
512 key = (const char*)strupr((char*)key);
517 if (flags & HVhek_FREEKEY) {
520 flags |= HVhek_FREEKEY;
524 else if (action & HV_FETCH_ISSTORE) {
527 hv_magic_check (hv, &needs_copy, &needs_store);
529 const bool save_taint = TAINT_get;
530 if (keysv || is_utf8) {
532 keysv = newSVpvn_utf8(key, klen, TRUE);
535 TAINT_set(SvTAINTED(keysv));
536 keysv = sv_2mortal(newSVsv(keysv));
537 mg_copy(MUTABLE_SV(hv), val, (char*)keysv, HEf_SVKEY);
539 mg_copy(MUTABLE_SV(hv), val, key, klen);
542 TAINT_IF(save_taint);
543 #ifdef NO_TAINT_SUPPORT
544 PERL_UNUSED_VAR(save_taint);
547 if (flags & HVhek_FREEKEY)
551 #ifdef ENV_IS_CASELESS
552 else if (mg_find((const SV *)hv, PERL_MAGIC_env)) {
553 /* XXX This code isn't UTF8 clean. */
554 const char *keysave = key;
555 /* Will need to free this, so set FREEKEY flag. */
556 key = savepvn(key,klen);
557 key = (const char*)strupr((char*)key);
562 if (flags & HVhek_FREEKEY) {
565 flags |= HVhek_FREEKEY;
573 if ((action & (HV_FETCH_LVALUE | HV_FETCH_ISSTORE))
574 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
575 || (SvRMAGICAL((const SV *)hv)
576 && mg_find((const SV *)hv, PERL_MAGIC_env))
581 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max+1 /* HvMAX(hv)+1 */),
583 HvARRAY(hv) = (HE**)array;
585 #ifdef DYNAMIC_ENV_FETCH
586 else if (action & HV_FETCH_ISEXISTS) {
587 /* for an %ENV exists, if we do an insert it's by a recursive
588 store call, so avoid creating HvARRAY(hv) right now. */
592 /* XXX remove at some point? */
593 if (flags & HVhek_FREEKEY)
600 if (is_utf8 && !(flags & HVhek_KEYCANONICAL)) {
601 char * const keysave = (char *)key;
602 key = (char*)bytes_from_utf8((U8*)key, &klen, &is_utf8);
606 flags &= ~HVhek_UTF8;
607 if (key != keysave) {
608 if (flags & HVhek_FREEKEY)
610 flags |= HVhek_WASUTF8 | HVhek_FREEKEY;
611 /* If the caller calculated a hash, it was on the sequence of
612 octets that are the UTF-8 form. We've now changed the sequence
613 of octets stored to that of the equivalent byte representation,
614 so the hash we need is different. */
620 if (keysv && (SvIsCOW_shared_hash(keysv)))
621 hash = SvSHARED_HASH(keysv);
623 PERL_HASH(hash, key, klen);
626 masked_flags = (flags & HVhek_MASK);
628 #ifdef DYNAMIC_ENV_FETCH
629 if (!HvARRAY(hv)) entry = NULL;
633 entry = (HvARRAY(hv))[hash & (I32) HvMAX(hv)];
635 for (; entry; entry = HeNEXT(entry)) {
636 if (HeHASH(entry) != hash) /* strings can't be equal */
638 if (HeKLEN(entry) != (I32)klen)
640 if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */
642 if ((HeKFLAGS(entry) ^ masked_flags) & HVhek_UTF8)
645 if (action & (HV_FETCH_LVALUE|HV_FETCH_ISSTORE)) {
646 if (HeKFLAGS(entry) != masked_flags) {
647 /* We match if HVhek_UTF8 bit in our flags and hash key's
648 match. But if entry was set previously with HVhek_WASUTF8
649 and key now doesn't (or vice versa) then we should change
650 the key's flag, as this is assignment. */
651 if (HvSHAREKEYS(hv)) {
652 /* Need to swap the key we have for a key with the flags we
653 need. As keys are shared we can't just write to the
654 flag, so we share the new one, unshare the old one. */
655 HEK * const new_hek = share_hek_flags(key, klen, hash,
657 unshare_hek (HeKEY_hek(entry));
658 HeKEY_hek(entry) = new_hek;
660 else if (hv == PL_strtab) {
661 /* PL_strtab is usually the only hash without HvSHAREKEYS,
662 so putting this test here is cheap */
663 if (flags & HVhek_FREEKEY)
665 Perl_croak(aTHX_ S_strtab_error,
666 action & HV_FETCH_LVALUE ? "fetch" : "store");
669 HeKFLAGS(entry) = masked_flags;
670 if (masked_flags & HVhek_ENABLEHVKFLAGS)
673 if (HeVAL(entry) == &PL_sv_placeholder) {
674 /* yes, can store into placeholder slot */
675 if (action & HV_FETCH_LVALUE) {
677 /* This preserves behaviour with the old hv_fetch
678 implementation which at this point would bail out
679 with a break; (at "if we find a placeholder, we
680 pretend we haven't found anything")
682 That break mean that if a placeholder were found, it
683 caused a call into hv_store, which in turn would
684 check magic, and if there is no magic end up pretty
685 much back at this point (in hv_store's code). */
688 /* LVAL fetch which actually needs a store. */
690 HvPLACEHOLDERS(hv)--;
693 if (val != &PL_sv_placeholder)
694 HvPLACEHOLDERS(hv)--;
697 } else if (action & HV_FETCH_ISSTORE) {
698 SvREFCNT_dec(HeVAL(entry));
701 } else if (HeVAL(entry) == &PL_sv_placeholder) {
702 /* if we find a placeholder, we pretend we haven't found
706 if (flags & HVhek_FREEKEY)
709 return entry ? (void *) &HeVAL(entry) : NULL;
713 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
714 if (!(action & HV_FETCH_ISSTORE)
715 && SvRMAGICAL((const SV *)hv)
716 && mg_find((const SV *)hv, PERL_MAGIC_env)) {
718 const char * const env = PerlEnv_ENVgetenv_len(key,&len);
720 sv = newSVpvn(env,len);
722 return hv_common(hv, keysv, key, klen, flags,
723 HV_FETCH_ISSTORE|HV_DISABLE_UVAR_XKEY|return_svp,
729 if (!entry && SvREADONLY(hv) && !(action & HV_FETCH_ISEXISTS)) {
730 hv_notallowed(flags, key, klen,
731 "Attempt to access disallowed key '%"SVf"' in"
732 " a restricted hash");
734 if (!(action & (HV_FETCH_LVALUE|HV_FETCH_ISSTORE))) {
735 /* Not doing some form of store, so return failure. */
736 if (flags & HVhek_FREEKEY)
740 if (action & HV_FETCH_LVALUE) {
741 val = action & HV_FETCH_EMPTY_HE ? NULL : newSV(0);
743 /* At this point the old hv_fetch code would call to hv_store,
744 which in turn might do some tied magic. So we need to make that
745 magic check happen. */
746 /* gonna assign to this, so it better be there */
747 /* If a fetch-as-store fails on the fetch, then the action is to
748 recurse once into "hv_store". If we didn't do this, then that
749 recursive call would call the key conversion routine again.
750 However, as we replace the original key with the converted
751 key, this would result in a double conversion, which would show
752 up as a bug if the conversion routine is not idempotent. */
753 return hv_common(hv, keysv, key, klen, flags,
754 HV_FETCH_ISSTORE|HV_DISABLE_UVAR_XKEY|return_svp,
756 /* XXX Surely that could leak if the fetch-was-store fails?
757 Just like the hv_fetch. */
761 /* Welcome to hv_store... */
764 /* Not sure if we can get here. I think the only case of oentry being
765 NULL is for %ENV with dynamic env fetch. But that should disappear
766 with magic in the previous code. */
769 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max+1 /* HvMAX(hv)+1 */),
771 HvARRAY(hv) = (HE**)array;
774 oentry = &(HvARRAY(hv))[hash & (I32) xhv->xhv_max];
777 /* share_hek_flags will do the free for us. This might be considered
780 HeKEY_hek(entry) = share_hek_flags(key, klen, hash, flags);
781 else if (hv == PL_strtab) {
782 /* PL_strtab is usually the only hash without HvSHAREKEYS, so putting
783 this test here is cheap */
784 if (flags & HVhek_FREEKEY)
786 Perl_croak(aTHX_ S_strtab_error,
787 action & HV_FETCH_LVALUE ? "fetch" : "store");
789 else /* gotta do the real thing */
790 HeKEY_hek(entry) = save_hek_flags(key, klen, hash, flags);
793 #ifdef PERL_HASH_RANDOMIZE_KEYS
794 /* This logic semi-randomizes the insert order in a bucket.
795 * Either we insert into the top, or the slot below the top,
796 * making it harder to see if there is a collision. We also
797 * reset the iterator randomizer if there is one.
799 if ( *oentry && PL_HASH_RAND_BITS_ENABLED) {
801 PL_hash_rand_bits= ROTL_UV(PL_hash_rand_bits,1);
802 if ( PL_hash_rand_bits & 1 ) {
803 HeNEXT(entry) = HeNEXT(*oentry);
804 HeNEXT(*oentry) = entry;
806 HeNEXT(entry) = *oentry;
812 HeNEXT(entry) = *oentry;
815 #ifdef PERL_HASH_RANDOMIZE_KEYS
817 /* Currently this makes various tests warn in annoying ways.
818 * So Silenced for now. - Yves | bogus end of comment =>* /
819 if (HvAUX(hv)->xhv_riter != -1) {
820 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL),
821 "[TESTING] Inserting into a hash during each() traversal results in undefined behavior"
826 if (PL_HASH_RAND_BITS_ENABLED) {
827 if (PL_HASH_RAND_BITS_ENABLED == 1)
828 PL_hash_rand_bits += (PTRV)entry + 1; /* we don't bother to use ptr_hash here */
829 PL_hash_rand_bits= ROTL_UV(PL_hash_rand_bits,1);
831 HvAUX(hv)->xhv_rand= (U32)PL_hash_rand_bits;
835 if (val == &PL_sv_placeholder)
836 HvPLACEHOLDERS(hv)++;
837 if (masked_flags & HVhek_ENABLEHVKFLAGS)
840 xhv->xhv_keys++; /* HvTOTALKEYS(hv)++ */
841 if ( DO_HSPLIT(xhv) ) {
842 const STRLEN oldsize = xhv->xhv_max + 1;
843 const U32 items = (U32)HvPLACEHOLDERS_get(hv);
845 if (items /* hash has placeholders */
846 && !SvREADONLY(hv) /* but is not a restricted hash */) {
847 /* If this hash previously was a "restricted hash" and had
848 placeholders, but the "restricted" flag has been turned off,
849 then the placeholders no longer serve any useful purpose.
850 However, they have the downsides of taking up RAM, and adding
851 extra steps when finding used values. It's safe to clear them
852 at this point, even though Storable rebuilds restricted hashes by
853 putting in all the placeholders (first) before turning on the
854 readonly flag, because Storable always pre-splits the hash.
855 If we're lucky, then we may clear sufficient placeholders to
856 avoid needing to split the hash at all. */
857 clear_placeholders(hv, items);
859 hsplit(hv, oldsize, oldsize * 2);
861 hsplit(hv, oldsize, oldsize * 2);
865 return entry ? (void *) &HeVAL(entry) : NULL;
867 return (void *) entry;
871 S_hv_magic_check(HV *hv, bool *needs_copy, bool *needs_store)
873 const MAGIC *mg = SvMAGIC(hv);
875 PERL_ARGS_ASSERT_HV_MAGIC_CHECK;
880 if (isUPPER(mg->mg_type)) {
882 if (mg->mg_type == PERL_MAGIC_tied) {
883 *needs_store = FALSE;
884 return; /* We've set all there is to set. */
887 mg = mg->mg_moremagic;
892 =for apidoc hv_scalar
894 Evaluates the hash in scalar context and returns the result. Handles magic when the hash is tied.
900 Perl_hv_scalar(pTHX_ HV *hv)
904 PERL_ARGS_ASSERT_HV_SCALAR;
906 if (SvRMAGICAL(hv)) {
907 MAGIC * const mg = mg_find((const SV *)hv, PERL_MAGIC_tied);
909 return magic_scalarpack(hv, mg);
913 if (HvTOTALKEYS((const HV *)hv))
914 Perl_sv_setpvf(aTHX_ sv, "%ld/%ld",
915 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
923 =for apidoc hv_delete
925 Deletes a key/value pair in the hash. The value's SV is removed from
926 the hash, made mortal, and returned to the caller. The absolute
927 value of C<klen> is the length of the key. If C<klen> is negative the
928 key is assumed to be in UTF-8-encoded Unicode. The C<flags> value
929 will normally be zero; if set to G_DISCARD then NULL will be returned.
930 NULL will also be returned if the key is not found.
932 =for apidoc hv_delete_ent
934 Deletes a key/value pair in the hash. The value SV is removed from the hash,
935 made mortal, and returned to the caller. The C<flags> value will normally be
936 zero; if set to G_DISCARD then NULL will be returned. NULL will also be
937 returned if the key is not found. C<hash> can be a valid precomputed hash
938 value, or 0 to ask for it to be computed.
944 S_hv_delete_common(pTHX_ HV *hv, SV *keysv, const char *key, STRLEN klen,
945 int k_flags, I32 d_flags, U32 hash)
951 bool is_utf8 = (k_flags & HVhek_UTF8) ? TRUE : FALSE;
954 if (SvRMAGICAL(hv)) {
957 hv_magic_check (hv, &needs_copy, &needs_store);
961 entry = (HE *) hv_common(hv, keysv, key, klen,
962 k_flags & ~HVhek_FREEKEY,
963 HV_FETCH_LVALUE|HV_DISABLE_UVAR_XKEY,
965 sv = entry ? HeVAL(entry) : NULL;
971 if (mg_find(sv, PERL_MAGIC_tiedelem)) {
972 /* No longer an element */
973 sv_unmagic(sv, PERL_MAGIC_tiedelem);
976 return NULL; /* element cannot be deleted */
978 #ifdef ENV_IS_CASELESS
979 else if (mg_find((const SV *)hv, PERL_MAGIC_env)) {
980 /* XXX This code isn't UTF8 clean. */
981 keysv = newSVpvn_flags(key, klen, SVs_TEMP);
982 if (k_flags & HVhek_FREEKEY) {
985 key = strupr(SvPVX(keysv));
994 xhv = (XPVHV*)SvANY(hv);
998 if (is_utf8 && !(k_flags & HVhek_KEYCANONICAL)) {
999 const char * const keysave = key;
1000 key = (char*)bytes_from_utf8((U8*)key, &klen, &is_utf8);
1003 k_flags |= HVhek_UTF8;
1005 k_flags &= ~HVhek_UTF8;
1006 if (key != keysave) {
1007 if (k_flags & HVhek_FREEKEY) {
1008 /* This shouldn't happen if our caller does what we expect,
1009 but strictly the API allows it. */
1012 k_flags |= HVhek_WASUTF8 | HVhek_FREEKEY;
1014 HvHASKFLAGS_on(MUTABLE_SV(hv));
1018 if (keysv && (SvIsCOW_shared_hash(keysv)))
1019 hash = SvSHARED_HASH(keysv);
1021 PERL_HASH(hash, key, klen);
1024 masked_flags = (k_flags & HVhek_MASK);
1026 oentry = &(HvARRAY(hv))[hash & (I32) HvMAX(hv)];
1028 for (; entry; oentry = &HeNEXT(entry), entry = *oentry) {
1030 U8 mro_changes = 0; /* 1 = isa; 2 = package moved */
1034 if (HeHASH(entry) != hash) /* strings can't be equal */
1036 if (HeKLEN(entry) != (I32)klen)
1038 if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */
1040 if ((HeKFLAGS(entry) ^ masked_flags) & HVhek_UTF8)
1043 if (hv == PL_strtab) {
1044 if (k_flags & HVhek_FREEKEY)
1046 Perl_croak(aTHX_ S_strtab_error, "delete");
1049 /* if placeholder is here, it's already been deleted.... */
1050 if (HeVAL(entry) == &PL_sv_placeholder) {
1051 if (k_flags & HVhek_FREEKEY)
1055 if (SvREADONLY(hv) && HeVAL(entry) && SvREADONLY(HeVAL(entry))
1056 && !SvIsCOW(HeVAL(entry))) {
1057 hv_notallowed(k_flags, key, klen,
1058 "Attempt to delete readonly key '%"SVf"' from"
1059 " a restricted hash");
1061 if (k_flags & HVhek_FREEKEY)
1064 /* If this is a stash and the key ends with ::, then someone is
1065 * deleting a package.
1067 if (HeVAL(entry) && HvENAME_get(hv)) {
1068 gv = (GV *)HeVAL(entry);
1069 if (keysv) key = SvPV(keysv, klen);
1071 (klen > 1 && key[klen-2] == ':' && key[klen-1] == ':')
1073 (klen == 1 && key[0] == ':')
1075 && (klen != 6 || hv!=PL_defstash || memNE(key,"main::",6))
1076 && SvTYPE(gv) == SVt_PVGV && (stash = GvHV((GV *)gv))
1077 && HvENAME_get(stash)) {
1078 /* A previous version of this code checked that the
1079 * GV was still in the symbol table by fetching the
1080 * GV with its name. That is not necessary (and
1081 * sometimes incorrect), as HvENAME cannot be set
1082 * on hv if it is not in the symtab. */
1084 /* Hang on to it for a bit. */
1085 SvREFCNT_inc_simple_void_NN(
1086 sv_2mortal((SV *)gv)
1089 else if (klen == 3 && strnEQ(key, "ISA", 3))
1093 sv = d_flags & G_DISCARD ? HeVAL(entry) : sv_2mortal(HeVAL(entry));
1094 HeVAL(entry) = &PL_sv_placeholder;
1096 /* deletion of method from stash */
1097 if (isGV(sv) && isGV_with_GP(sv) && GvCVu(sv)
1099 mro_method_changed_in(hv);
1103 * If a restricted hash, rather than really deleting the entry, put
1104 * a placeholder there. This marks the key as being "approved", so
1105 * we can still access via not-really-existing key without raising
1109 /* We'll be saving this slot, so the number of allocated keys
1110 * doesn't go down, but the number placeholders goes up */
1111 HvPLACEHOLDERS(hv)++;
1113 *oentry = HeNEXT(entry);
1114 if (SvOOK(hv) && entry == HvAUX(hv)->xhv_eiter /* HvEITER(hv) */)
1117 if (SvOOK(hv) && HvLAZYDEL(hv) &&
1118 entry == HeNEXT(HvAUX(hv)->xhv_eiter))
1119 HeNEXT(HvAUX(hv)->xhv_eiter) = HeNEXT(entry);
1120 hv_free_ent(hv, entry);
1122 xhv->xhv_keys--; /* HvTOTALKEYS(hv)-- */
1123 if (xhv->xhv_keys == 0)
1124 HvHASKFLAGS_off(hv);
1127 if (d_flags & G_DISCARD) {
1132 if (mro_changes == 1) mro_isa_changed_in(hv);
1133 else if (mro_changes == 2)
1134 mro_package_moved(NULL, stash, gv, 1);
1138 if (SvREADONLY(hv)) {
1139 hv_notallowed(k_flags, key, klen,
1140 "Attempt to delete disallowed key '%"SVf"' from"
1141 " a restricted hash");
1144 if (k_flags & HVhek_FREEKEY)
1150 S_hsplit(pTHX_ HV *hv, STRLEN const oldsize, STRLEN newsize)
1154 char *a = (char*) HvARRAY(hv);
1157 PERL_ARGS_ASSERT_HSPLIT;
1159 /*PerlIO_printf(PerlIO_stderr(), "hsplit called for %p which had %d\n",
1160 (void*)hv, (int) oldsize);*/
1163 Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize)
1164 + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0), char);
1169 #ifdef PERL_HASH_RANDOMIZE_KEYS
1170 /* the idea of this is that we create a "random" value by hashing the address of
1171 * the array, we then use the low bit to decide if we insert at the top, or insert
1172 * second from top. After each such insert we rotate the hashed value. So we can
1173 * use the same hashed value over and over, and in normal build environments use
1174 * very few ops to do so. ROTL32() should produce a single machine operation. */
1175 if (PL_HASH_RAND_BITS_ENABLED) {
1176 if (PL_HASH_RAND_BITS_ENABLED == 1)
1177 PL_hash_rand_bits += ptr_hash((PTRV)a);
1178 PL_hash_rand_bits = ROTL_UV(PL_hash_rand_bits,1);
1183 struct xpvhv_aux *const dest
1184 = (struct xpvhv_aux*) &a[newsize * sizeof(HE*)];
1185 Move(&a[oldsize * sizeof(HE*)], dest, 1, struct xpvhv_aux);
1186 /* we reset the iterator's xhv_rand as well, so they get a totally new ordering */
1187 #ifdef PERL_HASH_RANDOMIZE_KEYS
1188 dest->xhv_rand = (U32)PL_hash_rand_bits;
1193 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
1194 HvMAX(hv) = --newsize;
1195 HvARRAY(hv) = (HE**) a;
1197 if (!HvTOTALKEYS(hv)) /* skip rest if no entries */
1202 HE **oentry = aep + i;
1205 if (!entry) /* non-existent */
1208 U32 j = (HeHASH(entry) & newsize);
1210 *oentry = HeNEXT(entry);
1211 #ifdef PERL_HASH_RANDOMIZE_KEYS
1212 /* if the target cell is empty or PL_HASH_RAND_BITS_ENABLED is false
1213 * insert to top, otherwise rotate the bucket rand 1 bit,
1214 * and use the new low bit to decide if we insert at top,
1215 * or next from top. IOW, we only rotate on a collision.*/
1216 if (aep[j] && PL_HASH_RAND_BITS_ENABLED) {
1217 PL_hash_rand_bits+= ROTL_UV(HeHASH(entry), 17);
1218 PL_hash_rand_bits= ROTL_UV(PL_hash_rand_bits,1);
1219 if (PL_hash_rand_bits & 1) {
1220 HeNEXT(entry)= HeNEXT(aep[j]);
1221 HeNEXT(aep[j])= entry;
1223 /* Note, this is structured in such a way as the optimizer
1224 * should eliminate the duplicated code here and below without
1225 * us needing to explicitly use a goto. */
1226 HeNEXT(entry) = aep[j];
1232 /* see comment above about duplicated code */
1233 HeNEXT(entry) = aep[j];
1238 oentry = &HeNEXT(entry);
1242 } while (i++ < oldsize);
1246 Perl_hv_ksplit(pTHX_ HV *hv, IV newmax)
1249 XPVHV* xhv = (XPVHV*)SvANY(hv);
1250 const I32 oldsize = (I32) xhv->xhv_max+1; /* HvMAX(hv)+1 (sick) */
1254 PERL_ARGS_ASSERT_HV_KSPLIT;
1256 newsize = (I32) newmax; /* possible truncation here */
1257 if (newsize != newmax || newmax <= oldsize)
1259 while ((newsize & (1 + ~newsize)) != newsize) {
1260 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
1262 if (newsize < newmax)
1264 if (newsize < newmax)
1265 return; /* overflow detection */
1267 a = (char *) HvARRAY(hv);
1269 hsplit(hv, oldsize, newsize);
1271 Newxz(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
1272 xhv->xhv_max = --newsize;
1273 HvARRAY(hv) = (HE **) a;
1277 /* IMO this should also handle cases where hv_max is smaller than hv_keys
1278 * as tied hashes could play silly buggers and mess us around. We will
1279 * do the right thing during hv_store() afterwards, but still - Yves */
1280 #define HV_SET_MAX_ADJUSTED_FOR_KEYS(hv,hv_max,hv_keys) STMT_START {\
1281 /* Can we use fewer buckets? (hv_max is always 2^n-1) */ \
1282 if (hv_max < PERL_HASH_DEFAULT_HvMAX) { \
1283 hv_max = PERL_HASH_DEFAULT_HvMAX; \
1285 while (hv_max > PERL_HASH_DEFAULT_HvMAX && hv_max + 1 >= hv_keys * 2) \
1286 hv_max = hv_max / 2; \
1288 HvMAX(hv) = hv_max; \
1293 Perl_newHVhv(pTHX_ HV *ohv)
1296 HV * const hv = newHV();
1299 if (!ohv || (!HvTOTALKEYS(ohv) && !SvMAGICAL((const SV *)ohv)))
1301 hv_max = HvMAX(ohv);
1303 if (!SvMAGICAL((const SV *)ohv)) {
1304 /* It's an ordinary hash, so copy it fast. AMS 20010804 */
1306 const bool shared = !!HvSHAREKEYS(ohv);
1307 HE **ents, ** const oents = (HE **)HvARRAY(ohv);
1309 Newx(a, PERL_HV_ARRAY_ALLOC_BYTES(hv_max+1), char);
1312 /* In each bucket... */
1313 for (i = 0; i <= hv_max; i++) {
1315 HE *oent = oents[i];
1322 /* Copy the linked list of entries. */
1323 for (; oent; oent = HeNEXT(oent)) {
1324 const U32 hash = HeHASH(oent);
1325 const char * const key = HeKEY(oent);
1326 const STRLEN len = HeKLEN(oent);
1327 const int flags = HeKFLAGS(oent);
1328 HE * const ent = new_HE();
1329 SV *const val = HeVAL(oent);
1331 HeVAL(ent) = SvIMMORTAL(val) ? val : newSVsv(val);
1333 = shared ? share_hek_flags(key, len, hash, flags)
1334 : save_hek_flags(key, len, hash, flags);
1345 HvTOTALKEYS(hv) = HvTOTALKEYS(ohv);
1349 /* Iterate over ohv, copying keys and values one at a time. */
1351 const I32 riter = HvRITER_get(ohv);
1352 HE * const eiter = HvEITER_get(ohv);
1353 STRLEN hv_keys = HvTOTALKEYS(ohv);
1355 HV_SET_MAX_ADJUSTED_FOR_KEYS(hv,hv_max,hv_keys);
1358 while ((entry = hv_iternext_flags(ohv, 0))) {
1359 SV *val = hv_iterval(ohv,entry);
1360 SV * const keysv = HeSVKEY(entry);
1361 val = SvIMMORTAL(val) ? val : newSVsv(val);
1363 (void)hv_store_ent(hv, keysv, val, 0);
1365 (void)hv_store_flags(hv, HeKEY(entry), HeKLEN(entry), val,
1366 HeHASH(entry), HeKFLAGS(entry));
1368 HvRITER_set(ohv, riter);
1369 HvEITER_set(ohv, eiter);
1376 =for apidoc Am|HV *|hv_copy_hints_hv|HV *ohv
1378 A specialised version of L</newHVhv> for copying C<%^H>. I<ohv> must be
1379 a pointer to a hash (which may have C<%^H> magic, but should be generally
1380 non-magical), or C<NULL> (interpreted as an empty hash). The content
1381 of I<ohv> is copied to a new hash, which has the C<%^H>-specific magic
1382 added to it. A pointer to the new hash is returned.
1388 Perl_hv_copy_hints_hv(pTHX_ HV *const ohv)
1390 HV * const hv = newHV();
1393 STRLEN hv_max = HvMAX(ohv);
1394 STRLEN hv_keys = HvTOTALKEYS(ohv);
1396 const I32 riter = HvRITER_get(ohv);
1397 HE * const eiter = HvEITER_get(ohv);
1402 HV_SET_MAX_ADJUSTED_FOR_KEYS(hv,hv_max,hv_keys);
1405 while ((entry = hv_iternext_flags(ohv, 0))) {
1406 SV *const sv = newSVsv(hv_iterval(ohv,entry));
1407 SV *heksv = HeSVKEY(entry);
1408 if (!heksv && sv) heksv = newSVhek(HeKEY_hek(entry));
1409 if (sv) sv_magic(sv, NULL, PERL_MAGIC_hintselem,
1410 (char *)heksv, HEf_SVKEY);
1411 if (heksv == HeSVKEY(entry))
1412 (void)hv_store_ent(hv, heksv, sv, 0);
1414 (void)hv_common(hv, heksv, HeKEY(entry), HeKLEN(entry),
1415 HeKFLAGS(entry), HV_FETCH_ISSTORE|HV_FETCH_JUST_SV, sv, HeHASH(entry));
1416 SvREFCNT_dec_NN(heksv);
1419 HvRITER_set(ohv, riter);
1420 HvEITER_set(ohv, eiter);
1422 SvREFCNT_inc_simple_void_NN(hv);
1425 hv_magic(hv, NULL, PERL_MAGIC_hints);
1428 #undef HV_SET_MAX_ADJUSTED_FOR_KEYS
1430 /* like hv_free_ent, but returns the SV rather than freeing it */
1432 S_hv_free_ent_ret(pTHX_ HV *hv, HE *entry)
1437 PERL_ARGS_ASSERT_HV_FREE_ENT_RET;
1440 if (HeKLEN(entry) == HEf_SVKEY) {
1441 SvREFCNT_dec(HeKEY_sv(entry));
1442 Safefree(HeKEY_hek(entry));
1444 else if (HvSHAREKEYS(hv))
1445 unshare_hek(HeKEY_hek(entry));
1447 Safefree(HeKEY_hek(entry));
1454 Perl_hv_free_ent(pTHX_ HV *hv, HE *entry)
1459 PERL_ARGS_ASSERT_HV_FREE_ENT;
1463 val = hv_free_ent_ret(hv, entry);
1469 Perl_hv_delayfree_ent(pTHX_ HV *hv, HE *entry)
1473 PERL_ARGS_ASSERT_HV_DELAYFREE_ENT;
1477 /* SvREFCNT_inc to counter the SvREFCNT_dec in hv_free_ent */
1478 sv_2mortal(SvREFCNT_inc(HeVAL(entry))); /* free between statements */
1479 if (HeKLEN(entry) == HEf_SVKEY) {
1480 sv_2mortal(SvREFCNT_inc(HeKEY_sv(entry)));
1482 hv_free_ent(hv, entry);
1486 =for apidoc hv_clear
1488 Frees the all the elements of a hash, leaving it empty.
1489 The XS equivalent of C<%hash = ()>. See also L</hv_undef>.
1491 If any destructors are triggered as a result, the hv itself may
1498 Perl_hv_clear(pTHX_ HV *hv)
1505 DEBUG_A(Perl_hv_assert(aTHX_ hv));
1507 xhv = (XPVHV*)SvANY(hv);
1510 SAVEFREESV(SvREFCNT_inc_simple_NN(hv));
1511 if (SvREADONLY(hv) && HvARRAY(hv) != NULL) {
1512 /* restricted hash: convert all keys to placeholders */
1514 for (i = 0; i <= xhv->xhv_max; i++) {
1515 HE *entry = (HvARRAY(hv))[i];
1516 for (; entry; entry = HeNEXT(entry)) {
1517 /* not already placeholder */
1518 if (HeVAL(entry) != &PL_sv_placeholder) {
1520 if (SvREADONLY(HeVAL(entry)) && !SvIsCOW(HeVAL(entry))) {
1521 SV* const keysv = hv_iterkeysv(entry);
1522 Perl_croak_nocontext(
1523 "Attempt to delete readonly key '%"SVf"' from a restricted hash",
1526 SvREFCNT_dec_NN(HeVAL(entry));
1528 HeVAL(entry) = &PL_sv_placeholder;
1529 HvPLACEHOLDERS(hv)++;
1536 HvPLACEHOLDERS_set(hv, 0);
1539 mg_clear(MUTABLE_SV(hv));
1541 HvHASKFLAGS_off(hv);
1545 mro_isa_changed_in(hv);
1546 HvEITER_set(hv, NULL);
1552 =for apidoc hv_clear_placeholders
1554 Clears any placeholders from a hash. If a restricted hash has any of its keys
1555 marked as readonly and the key is subsequently deleted, the key is not actually
1556 deleted but is marked by assigning it a value of &PL_sv_placeholder. This tags
1557 it so it will be ignored by future operations such as iterating over the hash,
1558 but will still allow the hash to have a value reassigned to the key at some
1559 future point. This function clears any such placeholder keys from the hash.
1560 See Hash::Util::lock_keys() for an example of its use.
1566 Perl_hv_clear_placeholders(pTHX_ HV *hv)
1569 const U32 items = (U32)HvPLACEHOLDERS_get(hv);
1571 PERL_ARGS_ASSERT_HV_CLEAR_PLACEHOLDERS;
1574 clear_placeholders(hv, items);
1578 S_clear_placeholders(pTHX_ HV *hv, U32 items)
1583 PERL_ARGS_ASSERT_CLEAR_PLACEHOLDERS;
1590 /* Loop down the linked list heads */
1591 HE **oentry = &(HvARRAY(hv))[i];
1594 while ((entry = *oentry)) {
1595 if (HeVAL(entry) == &PL_sv_placeholder) {
1596 *oentry = HeNEXT(entry);
1597 if (entry == HvEITER_get(hv))
1600 if (SvOOK(hv) && HvLAZYDEL(hv) &&
1601 entry == HeNEXT(HvAUX(hv)->xhv_eiter))
1602 HeNEXT(HvAUX(hv)->xhv_eiter) = HeNEXT(entry);
1603 hv_free_ent(hv, entry);
1608 HvTOTALKEYS(hv) -= (IV)HvPLACEHOLDERS_get(hv);
1609 if (HvUSEDKEYS(hv) == 0)
1610 HvHASKFLAGS_off(hv);
1611 HvPLACEHOLDERS_set(hv, 0);
1615 oentry = &HeNEXT(entry);
1619 /* You can't get here, hence assertion should always fail. */
1620 assert (items == 0);
1625 S_hfreeentries(pTHX_ HV *hv)
1628 XPVHV * const xhv = (XPVHV*)SvANY(hv);
1631 PERL_ARGS_ASSERT_HFREEENTRIES;
1633 while ((sv = Perl_hfree_next_entry(aTHX_ hv, &index))||xhv->xhv_keys) {
1639 /* hfree_next_entry()
1640 * For use only by S_hfreeentries() and sv_clear().
1641 * Delete the next available HE from hv and return the associated SV.
1642 * Returns null on empty hash. Nevertheless null is not a reliable
1643 * indicator that the hash is empty, as the deleted entry may have a
1645 * indexp is a pointer to the current index into HvARRAY. The index should
1646 * initially be set to 0. hfree_next_entry() may update it. */
1649 Perl_hfree_next_entry(pTHX_ HV *hv, STRLEN *indexp)
1651 struct xpvhv_aux *iter;
1655 STRLEN orig_index = *indexp;
1658 PERL_ARGS_ASSERT_HFREE_NEXT_ENTRY;
1660 if (SvOOK(hv) && ((iter = HvAUX(hv)))
1661 && ((entry = iter->xhv_eiter)) )
1663 /* the iterator may get resurrected after each
1664 * destructor call, so check each time */
1665 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1667 hv_free_ent(hv, entry);
1668 /* warning: at this point HvARRAY may have been
1669 * re-allocated, HvMAX changed etc */
1671 iter->xhv_riter = -1; /* HvRITER(hv) = -1 */
1672 iter->xhv_eiter = NULL; /* HvEITER(hv) = NULL */
1673 #ifdef PERL_HASH_RANDOMIZE_KEYS
1674 iter->xhv_last_rand = iter->xhv_rand;
1678 if (!((XPVHV*)SvANY(hv))->xhv_keys)
1681 array = HvARRAY(hv);
1683 while ( ! ((entry = array[*indexp])) ) {
1684 if ((*indexp)++ >= HvMAX(hv))
1686 assert(*indexp != orig_index);
1688 array[*indexp] = HeNEXT(entry);
1689 ((XPVHV*) SvANY(hv))->xhv_keys--;
1691 if ( PL_phase != PERL_PHASE_DESTRUCT && HvENAME(hv)
1692 && HeVAL(entry) && isGV(HeVAL(entry))
1693 && GvHV(HeVAL(entry)) && HvENAME(GvHV(HeVAL(entry)))
1696 const char * const key = HePV(entry,klen);
1697 if ((klen > 1 && key[klen-1]==':' && key[klen-2]==':')
1698 || (klen == 1 && key[0] == ':')) {
1700 NULL, GvHV(HeVAL(entry)),
1701 (GV *)HeVAL(entry), 0
1705 return hv_free_ent_ret(hv, entry);
1710 =for apidoc hv_undef
1712 Undefines the hash. The XS equivalent of C<undef(%hash)>.
1714 As well as freeing all the elements of the hash (like hv_clear()), this
1715 also frees any auxiliary data and storage associated with the hash.
1717 If any destructors are triggered as a result, the hv itself may
1720 See also L</hv_clear>.
1726 Perl_hv_undef_flags(pTHX_ HV *hv, U32 flags)
1731 const bool save = !!SvREFCNT(hv);
1735 DEBUG_A(Perl_hv_assert(aTHX_ hv));
1736 xhv = (XPVHV*)SvANY(hv);
1738 /* The name must be deleted before the call to hfreeeeentries so that
1739 CVs are anonymised properly. But the effective name must be pre-
1740 served until after that call (and only deleted afterwards if the
1741 call originated from sv_clear). For stashes with one name that is
1742 both the canonical name and the effective name, hv_name_set has to
1743 allocate an array for storing the effective name. We can skip that
1744 during global destruction, as it does not matter where the CVs point
1745 if they will be freed anyway. */
1746 /* note that the code following prior to hfreeentries is duplicated
1747 * in sv_clear(), and changes here should be done there too */
1748 if (PL_phase != PERL_PHASE_DESTRUCT && (name = HvNAME(hv))) {
1749 if (PL_stashcache) {
1750 DEBUG_o(Perl_deb(aTHX_ "hv_undef_flags clearing PL_stashcache for '%"
1751 HEKf"'\n", HvNAME_HEK(hv)));
1752 (void)hv_delete(PL_stashcache, name,
1753 HEK_UTF8(HvNAME_HEK(hv)) ? -HvNAMELEN_get(hv) : HvNAMELEN_get(hv),
1757 hv_name_set(hv, NULL, 0, 0);
1761 SAVEFREESV(SvREFCNT_inc_simple_NN(hv));
1765 struct xpvhv_aux * const aux = HvAUX(hv);
1766 struct mro_meta *meta;
1768 if ((name = HvENAME_get(hv))) {
1769 if (PL_phase != PERL_PHASE_DESTRUCT)
1770 mro_isa_changed_in(hv);
1771 if (PL_stashcache) {
1772 DEBUG_o(Perl_deb(aTHX_ "hv_undef_flags clearing PL_stashcache for effective name '%"
1773 HEKf"'\n", HvENAME_HEK(hv)));
1775 PL_stashcache, name,
1776 HEK_UTF8(HvENAME_HEK(hv)) ? -HvENAMELEN_get(hv) : HvENAMELEN_get(hv),
1782 /* If this call originated from sv_clear, then we must check for
1783 * effective names that need freeing, as well as the usual name. */
1785 if (flags & HV_NAME_SETALL ? !!aux->xhv_name_u.xhvnameu_name : !!name) {
1786 if (name && PL_stashcache) {
1787 DEBUG_o(Perl_deb(aTHX_ "hv_undef_flags clearing PL_stashcache for name '%"
1788 HEKf"'\n", HvNAME_HEK(hv)));
1789 (void)hv_delete(PL_stashcache, name, (HEK_UTF8(HvNAME_HEK(hv)) ? -HvNAMELEN_get(hv) : HvNAMELEN_get(hv)), G_DISCARD);
1791 hv_name_set(hv, NULL, 0, flags);
1793 if((meta = aux->xhv_mro_meta)) {
1794 if (meta->mro_linear_all) {
1795 SvREFCNT_dec_NN(meta->mro_linear_all);
1796 /* mro_linear_current is just acting as a shortcut pointer,
1800 /* Only the current MRO is stored, so this owns the data.
1802 SvREFCNT_dec(meta->mro_linear_current);
1803 SvREFCNT_dec(meta->mro_nextmethod);
1804 SvREFCNT_dec(meta->isa);
1806 aux->xhv_mro_meta = NULL;
1808 SvREFCNT_dec(aux->xhv_super);
1809 if (!aux->xhv_name_u.xhvnameu_name && ! aux->xhv_backreferences)
1810 SvFLAGS(hv) &= ~SVf_OOK;
1813 Safefree(HvARRAY(hv));
1814 xhv->xhv_max = PERL_HASH_DEFAULT_HvMAX; /* HvMAX(hv) = 7 (it's a normal hash) */
1817 /* if we're freeing the HV, the SvMAGIC field has been reused for
1818 * other purposes, and so there can't be any placeholder magic */
1820 HvPLACEHOLDERS_set(hv, 0);
1823 mg_clear(MUTABLE_SV(hv));
1830 Returns the number of hash buckets that happen to be in use. This function is
1831 wrapped by the macro C<HvFILL>.
1833 Previously this value was stored in the HV structure, rather than being
1834 calculated on demand.
1840 Perl_hv_fill(pTHX_ HV const *const hv)
1843 HE **ents = HvARRAY(hv);
1845 PERL_ARGS_ASSERT_HV_FILL;
1847 /* No keys implies no buckets used.
1848 One key can only possibly mean one bucket used. */
1849 if (HvTOTALKEYS(hv) < 2)
1850 return HvTOTALKEYS(hv);
1853 HE *const *const last = ents + HvMAX(hv);
1854 count = last + 1 - ents;
1859 } while (++ents <= last);
1864 /* hash a pointer to a U32 - Used in the hash traversal randomization
1865 * and bucket order randomization code
1867 * this code was derived from Sereal, which was derived from autobox.
1870 PERL_STATIC_INLINE U32 S_ptr_hash(PTRV u) {
1873 * This is one of Thomas Wang's hash functions for 64-bit integers from:
1874 * http://www.concentric.net/~Ttwang/tech/inthash.htm
1876 u = (~u) + (u << 18);
1884 * This is one of Bob Jenkins' hash functions for 32-bit integers
1885 * from: http://burtleburtle.net/bob/hash/integer.html
1887 u = (u + 0x7ed55d16) + (u << 12);
1888 u = (u ^ 0xc761c23c) ^ (u >> 19);
1889 u = (u + 0x165667b1) + (u << 5);
1890 u = (u + 0xd3a2646c) ^ (u << 9);
1891 u = (u + 0xfd7046c5) + (u << 3);
1892 u = (u ^ 0xb55a4f09) ^ (u >> 16);
1898 static struct xpvhv_aux*
1899 S_hv_auxinit(pTHX_ HV *hv) {
1900 struct xpvhv_aux *iter;
1903 PERL_ARGS_ASSERT_HV_AUXINIT;
1907 Newxz(array, PERL_HV_ARRAY_ALLOC_BYTES(HvMAX(hv) + 1)
1908 + sizeof(struct xpvhv_aux), char);
1910 array = (char *) HvARRAY(hv);
1911 Renew(array, PERL_HV_ARRAY_ALLOC_BYTES(HvMAX(hv) + 1)
1912 + sizeof(struct xpvhv_aux), char);
1914 HvARRAY(hv) = (HE**)array;
1917 #ifdef PERL_HASH_RANDOMIZE_KEYS
1918 if (PL_HASH_RAND_BITS_ENABLED) {
1919 /* mix in some new state to PL_hash_rand_bits to "randomize" the traversal order*/
1920 if (PL_HASH_RAND_BITS_ENABLED == 1)
1921 PL_hash_rand_bits += ptr_hash((PTRV)array);
1922 PL_hash_rand_bits = ROTL_UV(PL_hash_rand_bits,1);
1924 iter->xhv_rand = (U32)PL_hash_rand_bits;
1930 iter->xhv_riter = -1; /* HvRITER(hv) = -1 */
1931 iter->xhv_eiter = NULL; /* HvEITER(hv) = NULL */
1932 #ifdef PERL_HASH_RANDOMIZE_KEYS
1933 iter->xhv_last_rand = iter->xhv_rand;
1935 iter->xhv_name_u.xhvnameu_name = 0;
1936 iter->xhv_name_count = 0;
1937 iter->xhv_backreferences = 0;
1938 iter->xhv_mro_meta = NULL;
1939 iter->xhv_super = NULL;
1944 =for apidoc hv_iterinit
1946 Prepares a starting point to traverse a hash table. Returns the number of
1947 keys in the hash (i.e. the same as C<HvUSEDKEYS(hv)>). The return value is
1948 currently only meaningful for hashes without tie magic.
1950 NOTE: Before version 5.004_65, C<hv_iterinit> used to return the number of
1951 hash buckets that happen to be in use. If you still need that esoteric
1952 value, you can get it through the macro C<HvFILL(hv)>.
1959 Perl_hv_iterinit(pTHX_ HV *hv)
1961 PERL_ARGS_ASSERT_HV_ITERINIT;
1963 /* FIXME: Are we not NULL, or do we croak? Place bets now! */
1966 Perl_croak(aTHX_ "Bad hash");
1969 struct xpvhv_aux * const iter = HvAUX(hv);
1970 HE * const entry = iter->xhv_eiter; /* HvEITER(hv) */
1971 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1973 hv_free_ent(hv, entry);
1975 iter->xhv_riter = -1; /* HvRITER(hv) = -1 */
1976 iter->xhv_eiter = NULL; /* HvEITER(hv) = NULL */
1977 #ifdef PERL_HASH_RANDOMIZE_KEYS
1978 iter->xhv_last_rand = iter->xhv_rand;
1984 /* used to be xhv->xhv_fill before 5.004_65 */
1985 return HvTOTALKEYS(hv);
1989 Perl_hv_riter_p(pTHX_ HV *hv) {
1990 struct xpvhv_aux *iter;
1992 PERL_ARGS_ASSERT_HV_RITER_P;
1995 Perl_croak(aTHX_ "Bad hash");
1997 iter = SvOOK(hv) ? HvAUX(hv) : hv_auxinit(hv);
1998 return &(iter->xhv_riter);
2002 Perl_hv_eiter_p(pTHX_ HV *hv) {
2003 struct xpvhv_aux *iter;
2005 PERL_ARGS_ASSERT_HV_EITER_P;
2008 Perl_croak(aTHX_ "Bad hash");
2010 iter = SvOOK(hv) ? HvAUX(hv) : hv_auxinit(hv);
2011 return &(iter->xhv_eiter);
2015 Perl_hv_riter_set(pTHX_ HV *hv, I32 riter) {
2016 struct xpvhv_aux *iter;
2018 PERL_ARGS_ASSERT_HV_RITER_SET;
2021 Perl_croak(aTHX_ "Bad hash");
2029 iter = hv_auxinit(hv);
2031 iter->xhv_riter = riter;
2035 Perl_hv_rand_set(pTHX_ HV *hv, U32 new_xhv_rand) {
2036 struct xpvhv_aux *iter;
2038 PERL_ARGS_ASSERT_HV_RAND_SET;
2040 #ifdef PERL_HASH_RANDOMIZE_KEYS
2042 Perl_croak(aTHX_ "Bad hash");
2047 iter = hv_auxinit(hv);
2049 iter->xhv_rand = new_xhv_rand;
2051 Perl_croak(aTHX_ "This Perl has not been built with support for randomized hash key traversal but something called Perl_hv_rand_set().");
2056 Perl_hv_eiter_set(pTHX_ HV *hv, HE *eiter) {
2057 struct xpvhv_aux *iter;
2059 PERL_ARGS_ASSERT_HV_EITER_SET;
2062 Perl_croak(aTHX_ "Bad hash");
2067 /* 0 is the default so don't go malloc()ing a new structure just to
2072 iter = hv_auxinit(hv);
2074 iter->xhv_eiter = eiter;
2078 Perl_hv_name_set(pTHX_ HV *hv, const char *name, U32 len, U32 flags)
2081 struct xpvhv_aux *iter;
2085 PERL_ARGS_ASSERT_HV_NAME_SET;
2088 Perl_croak(aTHX_ "panic: hv name too long (%"UVuf")", (UV) len);
2092 if (iter->xhv_name_u.xhvnameu_name) {
2093 if(iter->xhv_name_count) {
2094 if(flags & HV_NAME_SETALL) {
2095 HEK ** const name = HvAUX(hv)->xhv_name_u.xhvnameu_names;
2096 HEK **hekp = name + (
2097 iter->xhv_name_count < 0
2098 ? -iter->xhv_name_count
2099 : iter->xhv_name_count
2101 while(hekp-- > name+1)
2102 unshare_hek_or_pvn(*hekp, 0, 0, 0);
2103 /* The first elem may be null. */
2104 if(*name) unshare_hek_or_pvn(*name, 0, 0, 0);
2106 spot = &iter->xhv_name_u.xhvnameu_name;
2107 iter->xhv_name_count = 0;
2110 if(iter->xhv_name_count > 0) {
2111 /* shift some things over */
2113 iter->xhv_name_u.xhvnameu_names, iter->xhv_name_count + 1, HEK *
2115 spot = iter->xhv_name_u.xhvnameu_names;
2116 spot[iter->xhv_name_count] = spot[1];
2118 iter->xhv_name_count = -(iter->xhv_name_count + 1);
2120 else if(*(spot = iter->xhv_name_u.xhvnameu_names)) {
2121 unshare_hek_or_pvn(*spot, 0, 0, 0);
2125 else if (flags & HV_NAME_SETALL) {
2126 unshare_hek_or_pvn(iter->xhv_name_u.xhvnameu_name, 0, 0, 0);
2127 spot = &iter->xhv_name_u.xhvnameu_name;
2130 HEK * const existing_name = iter->xhv_name_u.xhvnameu_name;
2131 Newx(iter->xhv_name_u.xhvnameu_names, 2, HEK *);
2132 iter->xhv_name_count = -2;
2133 spot = iter->xhv_name_u.xhvnameu_names;
2134 spot[1] = existing_name;
2137 else { spot = &iter->xhv_name_u.xhvnameu_name; iter->xhv_name_count = 0; }
2142 iter = hv_auxinit(hv);
2143 spot = &iter->xhv_name_u.xhvnameu_name;
2145 PERL_HASH(hash, name, len);
2146 *spot = name ? share_hek(name, flags & SVf_UTF8 ? -(I32)len : (I32)len, hash) : NULL;
2150 This is basically sv_eq_flags() in sv.c, but we avoid the magic
2155 hek_eq_pvn_flags(pTHX_ const HEK *hek, const char* pv, const I32 pvlen, const U32 flags) {
2156 if ( (HEK_UTF8(hek) ? 1 : 0) != (flags & SVf_UTF8 ? 1 : 0) ) {
2157 if (flags & SVf_UTF8)
2158 return (bytes_cmp_utf8(
2159 (const U8*)HEK_KEY(hek), HEK_LEN(hek),
2160 (const U8*)pv, pvlen) == 0);
2162 return (bytes_cmp_utf8(
2163 (const U8*)pv, pvlen,
2164 (const U8*)HEK_KEY(hek), HEK_LEN(hek)) == 0);
2167 return HEK_LEN(hek) == pvlen && ((HEK_KEY(hek) == pv)
2168 || memEQ(HEK_KEY(hek), pv, pvlen));
2172 =for apidoc hv_ename_add
2174 Adds a name to a stash's internal list of effective names. See
2177 This is called when a stash is assigned to a new location in the symbol
2184 Perl_hv_ename_add(pTHX_ HV *hv, const char *name, U32 len, U32 flags)
2187 struct xpvhv_aux *aux = SvOOK(hv) ? HvAUX(hv) : hv_auxinit(hv);
2190 PERL_ARGS_ASSERT_HV_ENAME_ADD;
2193 Perl_croak(aTHX_ "panic: hv name too long (%"UVuf")", (UV) len);
2195 PERL_HASH(hash, name, len);
2197 if (aux->xhv_name_count) {
2198 HEK ** const xhv_name = aux->xhv_name_u.xhvnameu_names;
2199 I32 count = aux->xhv_name_count;
2200 HEK **hekp = xhv_name + (count < 0 ? -count : count);
2201 while (hekp-- > xhv_name)
2203 (HEK_UTF8(*hekp) || (flags & SVf_UTF8))
2204 ? hek_eq_pvn_flags(aTHX_ *hekp, name, (I32)len, flags)
2205 : (HEK_LEN(*hekp) == (I32)len && memEQ(HEK_KEY(*hekp), name, len))
2207 if (hekp == xhv_name && count < 0)
2208 aux->xhv_name_count = -count;
2211 if (count < 0) aux->xhv_name_count--, count = -count;
2212 else aux->xhv_name_count++;
2213 Renew(aux->xhv_name_u.xhvnameu_names, count + 1, HEK *);
2214 (aux->xhv_name_u.xhvnameu_names)[count] = share_hek(name, (flags & SVf_UTF8 ? -(I32)len : (I32)len), hash);
2217 HEK *existing_name = aux->xhv_name_u.xhvnameu_name;
2220 (HEK_UTF8(existing_name) || (flags & SVf_UTF8))
2221 ? hek_eq_pvn_flags(aTHX_ existing_name, name, (I32)len, flags)
2222 : (HEK_LEN(existing_name) == (I32)len && memEQ(HEK_KEY(existing_name), name, len))
2225 Newx(aux->xhv_name_u.xhvnameu_names, 2, HEK *);
2226 aux->xhv_name_count = existing_name ? 2 : -2;
2227 *aux->xhv_name_u.xhvnameu_names = existing_name;
2228 (aux->xhv_name_u.xhvnameu_names)[1] = share_hek(name, (flags & SVf_UTF8 ? -(I32)len : (I32)len), hash);
2233 =for apidoc hv_ename_delete
2235 Removes a name from a stash's internal list of effective names. If this is
2236 the name returned by C<HvENAME>, then another name in the list will take
2237 its place (C<HvENAME> will use it).
2239 This is called when a stash is deleted from the symbol table.
2245 Perl_hv_ename_delete(pTHX_ HV *hv, const char *name, U32 len, U32 flags)
2248 struct xpvhv_aux *aux;
2250 PERL_ARGS_ASSERT_HV_ENAME_DELETE;
2253 Perl_croak(aTHX_ "panic: hv name too long (%"UVuf")", (UV) len);
2255 if (!SvOOK(hv)) return;
2258 if (!aux->xhv_name_u.xhvnameu_name) return;
2260 if (aux->xhv_name_count) {
2261 HEK ** const namep = aux->xhv_name_u.xhvnameu_names;
2262 I32 const count = aux->xhv_name_count;
2263 HEK **victim = namep + (count < 0 ? -count : count);
2264 while (victim-- > namep + 1)
2266 (HEK_UTF8(*victim) || (flags & SVf_UTF8))
2267 ? hek_eq_pvn_flags(aTHX_ *victim, name, (I32)len, flags)
2268 : (HEK_LEN(*victim) == (I32)len && memEQ(HEK_KEY(*victim), name, len))
2270 unshare_hek_or_pvn(*victim, 0, 0, 0);
2271 if (count < 0) ++aux->xhv_name_count;
2272 else --aux->xhv_name_count;
2274 (aux->xhv_name_count == 1 || aux->xhv_name_count == -1)
2276 ) { /* if there are none left */
2278 aux->xhv_name_u.xhvnameu_names = NULL;
2279 aux->xhv_name_count = 0;
2282 /* Move the last one back to fill the empty slot. It
2283 does not matter what order they are in. */
2284 *victim = *(namep + (count < 0 ? -count : count) - 1);
2289 count > 0 && (HEK_UTF8(*namep) || (flags & SVf_UTF8))
2290 ? hek_eq_pvn_flags(aTHX_ *namep, name, (I32)len, flags)
2291 : (HEK_LEN(*namep) == (I32)len && memEQ(HEK_KEY(*namep), name, len))
2293 aux->xhv_name_count = -count;
2297 (HEK_UTF8(aux->xhv_name_u.xhvnameu_name) || (flags & SVf_UTF8))
2298 ? hek_eq_pvn_flags(aTHX_ aux->xhv_name_u.xhvnameu_name, name, (I32)len, flags)
2299 : (HEK_LEN(aux->xhv_name_u.xhvnameu_name) == (I32)len &&
2300 memEQ(HEK_KEY(aux->xhv_name_u.xhvnameu_name), name, len))
2302 HEK * const namehek = aux->xhv_name_u.xhvnameu_name;
2303 Newx(aux->xhv_name_u.xhvnameu_names, 1, HEK *);
2304 *aux->xhv_name_u.xhvnameu_names = namehek;
2305 aux->xhv_name_count = -1;
2310 Perl_hv_backreferences_p(pTHX_ HV *hv) {
2311 struct xpvhv_aux * const iter = SvOOK(hv) ? HvAUX(hv) : hv_auxinit(hv);
2313 PERL_ARGS_ASSERT_HV_BACKREFERENCES_P;
2314 PERL_UNUSED_CONTEXT;
2316 return &(iter->xhv_backreferences);
2320 Perl_hv_kill_backrefs(pTHX_ HV *hv) {
2323 PERL_ARGS_ASSERT_HV_KILL_BACKREFS;
2328 av = HvAUX(hv)->xhv_backreferences;
2331 HvAUX(hv)->xhv_backreferences = 0;
2332 Perl_sv_kill_backrefs(aTHX_ MUTABLE_SV(hv), av);
2333 if (SvTYPE(av) == SVt_PVAV)
2334 SvREFCNT_dec_NN(av);
2339 hv_iternext is implemented as a macro in hv.h
2341 =for apidoc hv_iternext
2343 Returns entries from a hash iterator. See C<hv_iterinit>.
2345 You may call C<hv_delete> or C<hv_delete_ent> on the hash entry that the
2346 iterator currently points to, without losing your place or invalidating your
2347 iterator. Note that in this case the current entry is deleted from the hash
2348 with your iterator holding the last reference to it. Your iterator is flagged
2349 to free the entry on the next call to C<hv_iternext>, so you must not discard
2350 your iterator immediately else the entry will leak - call C<hv_iternext> to
2351 trigger the resource deallocation.
2353 =for apidoc hv_iternext_flags
2355 Returns entries from a hash iterator. See C<hv_iterinit> and C<hv_iternext>.
2356 The C<flags> value will normally be zero; if HV_ITERNEXT_WANTPLACEHOLDERS is
2357 set the placeholders keys (for restricted hashes) will be returned in addition
2358 to normal keys. By default placeholders are automatically skipped over.
2359 Currently a placeholder is implemented with a value that is
2360 C<&PL_sv_placeholder>. Note that the implementation of placeholders and
2361 restricted hashes may change, and the implementation currently is
2362 insufficiently abstracted for any change to be tidy.
2368 Perl_hv_iternext_flags(pTHX_ HV *hv, I32 flags)
2375 struct xpvhv_aux *iter;
2377 PERL_ARGS_ASSERT_HV_ITERNEXT_FLAGS;
2380 Perl_croak(aTHX_ "Bad hash");
2382 xhv = (XPVHV*)SvANY(hv);
2385 /* Too many things (well, pp_each at least) merrily assume that you can
2386 call hv_iternext without calling hv_iterinit, so we'll have to deal
2392 oldentry = entry = iter->xhv_eiter; /* HvEITER(hv) */
2393 if (SvMAGICAL(hv) && SvRMAGICAL(hv)) {
2394 if ( ( mg = mg_find((const SV *)hv, PERL_MAGIC_tied) ) ) {
2395 SV * const key = sv_newmortal();
2397 sv_setsv(key, HeSVKEY_force(entry));
2398 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
2399 HeSVKEY_set(entry, NULL);
2405 /* one HE per MAGICAL hash */
2406 iter->xhv_eiter = entry = new_HE(); /* HvEITER(hv) = new_HE() */
2407 HvLAZYDEL_on(hv); /* make sure entry gets freed */
2409 Newxz(k, HEK_BASESIZE + sizeof(const SV *), char);
2411 HeKEY_hek(entry) = hek;
2412 HeKLEN(entry) = HEf_SVKEY;
2414 magic_nextpack(MUTABLE_SV(hv),mg,key);
2416 /* force key to stay around until next time */
2417 HeSVKEY_set(entry, SvREFCNT_inc_simple_NN(key));
2418 return entry; /* beware, hent_val is not set */
2420 SvREFCNT_dec(HeVAL(entry));
2421 Safefree(HeKEY_hek(entry));
2423 iter->xhv_eiter = NULL; /* HvEITER(hv) = NULL */
2428 #if defined(DYNAMIC_ENV_FETCH) && !defined(__riscos__) /* set up %ENV for iteration */
2429 if (!entry && SvRMAGICAL((const SV *)hv)
2430 && mg_find((const SV *)hv, PERL_MAGIC_env)) {
2433 /* The prime_env_iter() on VMS just loaded up new hash values
2434 * so the iteration count needs to be reset back to the beginning
2438 oldentry = entry = iter->xhv_eiter; /* HvEITER(hv) */
2443 /* hv_iterinit now ensures this. */
2444 assert (HvARRAY(hv));
2446 /* At start of hash, entry is NULL. */
2449 entry = HeNEXT(entry);
2450 if (!(flags & HV_ITERNEXT_WANTPLACEHOLDERS)) {
2452 * Skip past any placeholders -- don't want to include them in
2455 while (entry && HeVAL(entry) == &PL_sv_placeholder) {
2456 entry = HeNEXT(entry);
2461 #ifdef PERL_HASH_RANDOMIZE_KEYS
2462 if (iter->xhv_last_rand != iter->xhv_rand) {
2463 if (iter->xhv_riter != -1) {
2464 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL),
2465 "Use of each() on hash after insertion without resetting hash iterator results in undefined behavior"
2469 iter->xhv_last_rand = iter->xhv_rand;
2473 /* Skip the entire loop if the hash is empty. */
2474 if ((flags & HV_ITERNEXT_WANTPLACEHOLDERS)
2475 ? HvTOTALKEYS(hv) : HvUSEDKEYS(hv)) {
2477 /* OK. Come to the end of the current list. Grab the next one. */
2479 iter->xhv_riter++; /* HvRITER(hv)++ */
2480 if (iter->xhv_riter > (I32)xhv->xhv_max /* HvRITER(hv) > HvMAX(hv) */) {
2481 /* There is no next one. End of the hash. */
2482 iter->xhv_riter = -1; /* HvRITER(hv) = -1 */
2483 #ifdef PERL_HASH_RANDOMIZE_KEYS
2484 iter->xhv_last_rand = iter->xhv_rand; /* reset xhv_last_rand so we can detect inserts during traversal */
2488 entry = (HvARRAY(hv))[ PERL_HASH_ITER_BUCKET(iter) & xhv->xhv_max ];
2490 if (!(flags & HV_ITERNEXT_WANTPLACEHOLDERS)) {
2491 /* If we have an entry, but it's a placeholder, don't count it.
2493 while (entry && HeVAL(entry) == &PL_sv_placeholder)
2494 entry = HeNEXT(entry);
2496 /* Will loop again if this linked list starts NULL
2497 (for HV_ITERNEXT_WANTPLACEHOLDERS)
2498 or if we run through it and find only placeholders. */
2502 iter->xhv_riter = -1;
2503 #ifdef PERL_HASH_RANDOMIZE_KEYS
2504 iter->xhv_last_rand = iter->xhv_rand;
2508 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
2510 hv_free_ent(hv, oldentry);
2513 iter->xhv_eiter = entry; /* HvEITER(hv) = entry */
2518 =for apidoc hv_iterkey
2520 Returns the key from the current position of the hash iterator. See
2527 Perl_hv_iterkey(pTHX_ HE *entry, I32 *retlen)
2529 PERL_ARGS_ASSERT_HV_ITERKEY;
2531 if (HeKLEN(entry) == HEf_SVKEY) {
2533 char * const p = SvPV(HeKEY_sv(entry), len);
2538 *retlen = HeKLEN(entry);
2539 return HeKEY(entry);
2543 /* unlike hv_iterval(), this always returns a mortal copy of the key */
2545 =for apidoc hv_iterkeysv
2547 Returns the key as an C<SV*> from the current position of the hash
2548 iterator. The return value will always be a mortal copy of the key. Also
2555 Perl_hv_iterkeysv(pTHX_ HE *entry)
2557 PERL_ARGS_ASSERT_HV_ITERKEYSV;
2559 return sv_2mortal(newSVhek(HeKEY_hek(entry)));
2563 =for apidoc hv_iterval
2565 Returns the value from the current position of the hash iterator. See
2572 Perl_hv_iterval(pTHX_ HV *hv, HE *entry)
2574 PERL_ARGS_ASSERT_HV_ITERVAL;
2576 if (SvRMAGICAL(hv)) {
2577 if (mg_find((const SV *)hv, PERL_MAGIC_tied)) {
2578 SV* const sv = sv_newmortal();
2579 if (HeKLEN(entry) == HEf_SVKEY)
2580 mg_copy(MUTABLE_SV(hv), sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
2582 mg_copy(MUTABLE_SV(hv), sv, HeKEY(entry), HeKLEN(entry));
2586 return HeVAL(entry);
2590 =for apidoc hv_iternextsv
2592 Performs an C<hv_iternext>, C<hv_iterkey>, and C<hv_iterval> in one
2599 Perl_hv_iternextsv(pTHX_ HV *hv, char **key, I32 *retlen)
2601 HE * const he = hv_iternext_flags(hv, 0);
2603 PERL_ARGS_ASSERT_HV_ITERNEXTSV;
2607 *key = hv_iterkey(he, retlen);
2608 return hv_iterval(hv, he);
2615 =for apidoc hv_magic
2617 Adds magic to a hash. See C<sv_magic>.
2622 /* possibly free a shared string if no one has access to it
2623 * len and hash must both be valid for str.
2626 Perl_unsharepvn(pTHX_ const char *str, I32 len, U32 hash)
2628 unshare_hek_or_pvn (NULL, str, len, hash);
2633 Perl_unshare_hek(pTHX_ HEK *hek)
2636 unshare_hek_or_pvn(hek, NULL, 0, 0);
2639 /* possibly free a shared string if no one has access to it
2640 hek if non-NULL takes priority over the other 3, else str, len and hash
2641 are used. If so, len and hash must both be valid for str.
2644 S_unshare_hek_or_pvn(pTHX_ const HEK *hek, const char *str, I32 len, U32 hash)
2650 bool is_utf8 = FALSE;
2652 const char * const save = str;
2653 struct shared_he *he = NULL;
2656 /* Find the shared he which is just before us in memory. */
2657 he = (struct shared_he *)(((char *)hek)
2658 - STRUCT_OFFSET(struct shared_he,
2661 /* Assert that the caller passed us a genuine (or at least consistent)
2663 assert (he->shared_he_he.hent_hek == hek);
2665 if (he->shared_he_he.he_valu.hent_refcount - 1) {
2666 --he->shared_he_he.he_valu.hent_refcount;
2670 hash = HEK_HASH(hek);
2671 } else if (len < 0) {
2672 STRLEN tmplen = -len;
2674 /* See the note in hv_fetch(). --jhi */
2675 str = (char*)bytes_from_utf8((U8*)str, &tmplen, &is_utf8);
2678 k_flags = HVhek_UTF8;
2680 k_flags |= HVhek_WASUTF8 | HVhek_FREEKEY;
2683 /* what follows was the moral equivalent of:
2684 if ((Svp = hv_fetch(PL_strtab, tmpsv, FALSE, hash))) {
2686 hv_delete(PL_strtab, str, len, G_DISCARD, hash);
2688 xhv = (XPVHV*)SvANY(PL_strtab);
2689 /* assert(xhv_array != 0) */
2690 oentry = &(HvARRAY(PL_strtab))[hash & (I32) HvMAX(PL_strtab)];
2692 const HE *const he_he = &(he->shared_he_he);
2693 for (entry = *oentry; entry; oentry = &HeNEXT(entry), entry = *oentry) {
2698 const int flags_masked = k_flags & HVhek_MASK;
2699 for (entry = *oentry; entry; oentry = &HeNEXT(entry), entry = *oentry) {
2700 if (HeHASH(entry) != hash) /* strings can't be equal */
2702 if (HeKLEN(entry) != len)
2704 if (HeKEY(entry) != str && memNE(HeKEY(entry),str,len)) /* is this it? */
2706 if (HeKFLAGS(entry) != flags_masked)
2713 if (--entry->he_valu.hent_refcount == 0) {
2714 *oentry = HeNEXT(entry);
2716 xhv->xhv_keys--; /* HvTOTALKEYS(hv)-- */
2721 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL),
2722 "Attempt to free nonexistent shared string '%s'%s"
2724 hek ? HEK_KEY(hek) : str,
2725 ((k_flags & HVhek_UTF8) ? " (utf8)" : "") pTHX__VALUE);
2726 if (k_flags & HVhek_FREEKEY)
2730 /* get a (constant) string ptr from the global string table
2731 * string will get added if it is not already there.
2732 * len and hash must both be valid for str.
2735 Perl_share_hek(pTHX_ const char *str, I32 len, U32 hash)
2737 bool is_utf8 = FALSE;
2739 const char * const save = str;
2741 PERL_ARGS_ASSERT_SHARE_HEK;
2744 STRLEN tmplen = -len;
2746 /* See the note in hv_fetch(). --jhi */
2747 str = (char*)bytes_from_utf8((U8*)str, &tmplen, &is_utf8);
2749 /* If we were able to downgrade here, then than means that we were passed
2750 in a key which only had chars 0-255, but was utf8 encoded. */
2753 /* If we found we were able to downgrade the string to bytes, then
2754 we should flag that it needs upgrading on keys or each. Also flag
2755 that we need share_hek_flags to free the string. */
2758 PERL_HASH(hash, str, len);
2759 flags |= HVhek_WASUTF8 | HVhek_FREEKEY;
2763 return share_hek_flags (str, len, hash, flags);
2767 S_share_hek_flags(pTHX_ const char *str, I32 len, U32 hash, int flags)
2771 const int flags_masked = flags & HVhek_MASK;
2772 const U32 hindex = hash & (I32) HvMAX(PL_strtab);
2773 XPVHV * const xhv = (XPVHV*)SvANY(PL_strtab);
2775 PERL_ARGS_ASSERT_SHARE_HEK_FLAGS;
2777 /* what follows is the moral equivalent of:
2779 if (!(Svp = hv_fetch(PL_strtab, str, len, FALSE)))
2780 hv_store(PL_strtab, str, len, NULL, hash);
2782 Can't rehash the shared string table, so not sure if it's worth
2783 counting the number of entries in the linked list
2786 /* assert(xhv_array != 0) */
2787 entry = (HvARRAY(PL_strtab))[hindex];
2788 for (;entry; entry = HeNEXT(entry)) {
2789 if (HeHASH(entry) != hash) /* strings can't be equal */
2791 if (HeKLEN(entry) != len)
2793 if (HeKEY(entry) != str && memNE(HeKEY(entry),str,len)) /* is this it? */
2795 if (HeKFLAGS(entry) != flags_masked)
2801 /* What used to be head of the list.
2802 If this is NULL, then we're the first entry for this slot, which
2803 means we need to increate fill. */
2804 struct shared_he *new_entry;
2807 HE **const head = &HvARRAY(PL_strtab)[hindex];
2808 HE *const next = *head;
2810 /* We don't actually store a HE from the arena and a regular HEK.
2811 Instead we allocate one chunk of memory big enough for both,
2812 and put the HEK straight after the HE. This way we can find the
2813 HE directly from the HEK.
2816 Newx(k, STRUCT_OFFSET(struct shared_he,
2817 shared_he_hek.hek_key[0]) + len + 2, char);
2818 new_entry = (struct shared_he *)k;
2819 entry = &(new_entry->shared_he_he);
2820 hek = &(new_entry->shared_he_hek);
2822 Copy(str, HEK_KEY(hek), len, char);
2823 HEK_KEY(hek)[len] = 0;
2825 HEK_HASH(hek) = hash;
2826 HEK_FLAGS(hek) = (unsigned char)flags_masked;
2828 /* Still "point" to the HEK, so that other code need not know what
2830 HeKEY_hek(entry) = hek;
2831 entry->he_valu.hent_refcount = 0;
2832 HeNEXT(entry) = next;
2835 xhv->xhv_keys++; /* HvTOTALKEYS(hv)++ */
2836 if (!next) { /* initial entry? */
2837 } else if ( DO_HSPLIT(xhv) ) {
2838 const STRLEN oldsize = xhv->xhv_max + 1;
2839 hsplit(PL_strtab, oldsize, oldsize * 2);
2843 ++entry->he_valu.hent_refcount;
2845 if (flags & HVhek_FREEKEY)
2848 return HeKEY_hek(entry);
2852 Perl_hv_placeholders_p(pTHX_ HV *hv)
2855 MAGIC *mg = mg_find((const SV *)hv, PERL_MAGIC_rhash);
2857 PERL_ARGS_ASSERT_HV_PLACEHOLDERS_P;
2860 mg = sv_magicext(MUTABLE_SV(hv), 0, PERL_MAGIC_rhash, 0, 0, 0);
2863 Perl_die(aTHX_ "panic: hv_placeholders_p");
2866 return &(mg->mg_len);
2871 Perl_hv_placeholders_get(pTHX_ const HV *hv)
2874 MAGIC * const mg = mg_find((const SV *)hv, PERL_MAGIC_rhash);
2876 PERL_ARGS_ASSERT_HV_PLACEHOLDERS_GET;
2878 return mg ? mg->mg_len : 0;
2882 Perl_hv_placeholders_set(pTHX_ HV *hv, I32 ph)
2885 MAGIC * const mg = mg_find((const SV *)hv, PERL_MAGIC_rhash);
2887 PERL_ARGS_ASSERT_HV_PLACEHOLDERS_SET;
2892 if (!sv_magicext(MUTABLE_SV(hv), 0, PERL_MAGIC_rhash, 0, 0, ph))
2893 Perl_die(aTHX_ "panic: hv_placeholders_set");
2895 /* else we don't need to add magic to record 0 placeholders. */
2899 S_refcounted_he_value(pTHX_ const struct refcounted_he *he)
2904 PERL_ARGS_ASSERT_REFCOUNTED_HE_VALUE;
2906 switch(he->refcounted_he_data[0] & HVrhek_typemask) {
2911 value = &PL_sv_placeholder;
2914 value = newSViv(he->refcounted_he_val.refcounted_he_u_iv);
2917 value = newSVuv(he->refcounted_he_val.refcounted_he_u_uv);
2920 case HVrhek_PV_UTF8:
2921 /* Create a string SV that directly points to the bytes in our
2923 value = newSV_type(SVt_PV);
2924 SvPV_set(value, (char *) he->refcounted_he_data + 1);
2925 SvCUR_set(value, he->refcounted_he_val.refcounted_he_u_len);
2926 /* This stops anything trying to free it */
2927 SvLEN_set(value, 0);
2929 SvREADONLY_on(value);
2930 if ((he->refcounted_he_data[0] & HVrhek_typemask) == HVrhek_PV_UTF8)
2934 Perl_croak(aTHX_ "panic: refcounted_he_value bad flags %"UVxf,
2935 (UV)he->refcounted_he_data[0]);
2941 =for apidoc m|HV *|refcounted_he_chain_2hv|const struct refcounted_he *c|U32 flags
2943 Generates and returns a C<HV *> representing the content of a
2944 C<refcounted_he> chain.
2945 I<flags> is currently unused and must be zero.
2950 Perl_refcounted_he_chain_2hv(pTHX_ const struct refcounted_he *chain, U32 flags)
2954 U32 placeholders, max;
2957 Perl_croak(aTHX_ "panic: refcounted_he_chain_2hv bad flags %"UVxf,
2960 /* We could chase the chain once to get an idea of the number of keys,
2961 and call ksplit. But for now we'll make a potentially inefficient
2962 hash with only 8 entries in its array. */
2967 Newxz(array, PERL_HV_ARRAY_ALLOC_BYTES(max + 1), char);
2968 HvARRAY(hv) = (HE**)array;
2974 U32 hash = chain->refcounted_he_hash;
2976 U32 hash = HEK_HASH(chain->refcounted_he_hek);
2978 HE **oentry = &((HvARRAY(hv))[hash & max]);
2979 HE *entry = *oentry;
2982 for (; entry; entry = HeNEXT(entry)) {
2983 if (HeHASH(entry) == hash) {
2984 /* We might have a duplicate key here. If so, entry is older
2985 than the key we've already put in the hash, so if they are
2986 the same, skip adding entry. */
2988 const STRLEN klen = HeKLEN(entry);
2989 const char *const key = HeKEY(entry);
2990 if (klen == chain->refcounted_he_keylen
2991 && (!!HeKUTF8(entry)
2992 == !!(chain->refcounted_he_data[0] & HVhek_UTF8))
2993 && memEQ(key, REF_HE_KEY(chain), klen))
2996 if (HeKEY_hek(entry) == chain->refcounted_he_hek)
2998 if (HeKLEN(entry) == HEK_LEN(chain->refcounted_he_hek)
2999 && HeKUTF8(entry) == HEK_UTF8(chain->refcounted_he_hek)
3000 && memEQ(HeKEY(entry), HEK_KEY(chain->refcounted_he_hek),
3011 = share_hek_flags(REF_HE_KEY(chain),
3012 chain->refcounted_he_keylen,
3013 chain->refcounted_he_hash,
3014 (chain->refcounted_he_data[0]
3015 & (HVhek_UTF8|HVhek_WASUTF8)));
3017 HeKEY_hek(entry) = share_hek_hek(chain->refcounted_he_hek);
3019 value = refcounted_he_value(chain);
3020 if (value == &PL_sv_placeholder)
3022 HeVAL(entry) = value;
3024 /* Link it into the chain. */
3025 HeNEXT(entry) = *oentry;
3031 chain = chain->refcounted_he_next;
3035 clear_placeholders(hv, placeholders);
3036 HvTOTALKEYS(hv) -= placeholders;
3039 /* We could check in the loop to see if we encounter any keys with key
3040 flags, but it's probably not worth it, as this per-hash flag is only
3041 really meant as an optimisation for things like Storable. */
3043 DEBUG_A(Perl_hv_assert(aTHX_ hv));
3049 =for apidoc m|SV *|refcounted_he_fetch_pvn|const struct refcounted_he *chain|const char *keypv|STRLEN keylen|U32 hash|U32 flags
3051 Search along a C<refcounted_he> chain for an entry with the key specified
3052 by I<keypv> and I<keylen>. If I<flags> has the C<REFCOUNTED_HE_KEY_UTF8>
3053 bit set, the key octets are interpreted as UTF-8, otherwise they
3054 are interpreted as Latin-1. I<hash> is a precomputed hash of the key
3055 string, or zero if it has not been precomputed. Returns a mortal scalar
3056 representing the value associated with the key, or C<&PL_sv_placeholder>
3057 if there is no value associated with the key.
3063 Perl_refcounted_he_fetch_pvn(pTHX_ const struct refcounted_he *chain,
3064 const char *keypv, STRLEN keylen, U32 hash, U32 flags)
3068 PERL_ARGS_ASSERT_REFCOUNTED_HE_FETCH_PVN;
3070 if (flags & ~(REFCOUNTED_HE_KEY_UTF8|REFCOUNTED_HE_EXISTS))
3071 Perl_croak(aTHX_ "panic: refcounted_he_fetch_pvn bad flags %"UVxf,
3074 return &PL_sv_placeholder;
3075 if (flags & REFCOUNTED_HE_KEY_UTF8) {
3076 /* For searching purposes, canonicalise to Latin-1 where possible. */
3077 const char *keyend = keypv + keylen, *p;
3078 STRLEN nonascii_count = 0;
3079 for (p = keypv; p != keyend; p++) {
3082 if (!((c & 0xfe) == 0xc2 && ++p != keyend &&
3083 (((U8)*p) & 0xc0) == 0x80))
3084 goto canonicalised_key;
3088 if (nonascii_count) {
3090 const char *p = keypv, *keyend = keypv + keylen;
3091 keylen -= nonascii_count;
3092 Newx(q, keylen, char);
3095 for (; p != keyend; p++, q++) {
3098 ((c & 0x80) ? ((c & 0x03) << 6) | (((U8)*++p) & 0x3f) : c);
3101 flags &= ~REFCOUNTED_HE_KEY_UTF8;
3102 canonicalised_key: ;
3104 utf8_flag = (flags & REFCOUNTED_HE_KEY_UTF8) ? HVhek_UTF8 : 0;
3106 PERL_HASH(hash, keypv, keylen);
3108 for (; chain; chain = chain->refcounted_he_next) {
3111 hash == chain->refcounted_he_hash &&
3112 keylen == chain->refcounted_he_keylen &&
3113 memEQ(REF_HE_KEY(chain), keypv, keylen) &&
3114 utf8_flag == (chain->refcounted_he_data[0] & HVhek_UTF8)
3116 hash == HEK_HASH(chain->refcounted_he_hek) &&
3117 keylen == (STRLEN)HEK_LEN(chain->refcounted_he_hek) &&
3118 memEQ(HEK_KEY(chain->refcounted_he_hek), keypv, keylen) &&
3119 utf8_flag == (HEK_FLAGS(chain->refcounted_he_hek) & HVhek_UTF8)
3122 if (flags & REFCOUNTED_HE_EXISTS)
3123 return (chain->refcounted_he_data[0] & HVrhek_typemask)
3125 ? NULL : &PL_sv_yes;
3126 return sv_2mortal(refcounted_he_value(chain));
3129 return flags & REFCOUNTED_HE_EXISTS ? NULL : &PL_sv_placeholder;
3133 =for apidoc m|SV *|refcounted_he_fetch_pv|const struct refcounted_he *chain|const char *key|U32 hash|U32 flags
3135 Like L</refcounted_he_fetch_pvn>, but takes a nul-terminated string
3136 instead of a string/length pair.
3142 Perl_refcounted_he_fetch_pv(pTHX_ const struct refcounted_he *chain,
3143 const char *key, U32 hash, U32 flags)
3145 PERL_ARGS_ASSERT_REFCOUNTED_HE_FETCH_PV;
3146 return refcounted_he_fetch_pvn(chain, key, strlen(key), hash, flags);
3150 =for apidoc m|SV *|refcounted_he_fetch_sv|const struct refcounted_he *chain|SV *key|U32 hash|U32 flags
3152 Like L</refcounted_he_fetch_pvn>, but takes a Perl scalar instead of a
3159 Perl_refcounted_he_fetch_sv(pTHX_ const struct refcounted_he *chain,
3160 SV *key, U32 hash, U32 flags)
3164 PERL_ARGS_ASSERT_REFCOUNTED_HE_FETCH_SV;
3165 if (flags & REFCOUNTED_HE_KEY_UTF8)
3166 Perl_croak(aTHX_ "panic: refcounted_he_fetch_sv bad flags %"UVxf,
3168 keypv = SvPV_const(key, keylen);
3170 flags |= REFCOUNTED_HE_KEY_UTF8;
3171 if (!hash && SvIsCOW_shared_hash(key))
3172 hash = SvSHARED_HASH(key);
3173 return refcounted_he_fetch_pvn(chain, keypv, keylen, hash, flags);
3177 =for apidoc m|struct refcounted_he *|refcounted_he_new_pvn|struct refcounted_he *parent|const char *keypv|STRLEN keylen|U32 hash|SV *value|U32 flags
3179 Creates a new C<refcounted_he>. This consists of a single key/value
3180 pair and a reference to an existing C<refcounted_he> chain (which may
3181 be empty), and thus forms a longer chain. When using the longer chain,
3182 the new key/value pair takes precedence over any entry for the same key
3183 further along the chain.
3185 The new key is specified by I<keypv> and I<keylen>. If I<flags> has
3186 the C<REFCOUNTED_HE_KEY_UTF8> bit set, the key octets are interpreted
3187 as UTF-8, otherwise they are interpreted as Latin-1. I<hash> is
3188 a precomputed hash of the key string, or zero if it has not been
3191 I<value> is the scalar value to store for this key. I<value> is copied
3192 by this function, which thus does not take ownership of any reference
3193 to it, and later changes to the scalar will not be reflected in the
3194 value visible in the C<refcounted_he>. Complex types of scalar will not
3195 be stored with referential integrity, but will be coerced to strings.
3196 I<value> may be either null or C<&PL_sv_placeholder> to indicate that no
3197 value is to be associated with the key; this, as with any non-null value,
3198 takes precedence over the existence of a value for the key further along
3201 I<parent> points to the rest of the C<refcounted_he> chain to be
3202 attached to the new C<refcounted_he>. This function takes ownership
3203 of one reference to I<parent>, and returns one reference to the new
3209 struct refcounted_he *
3210 Perl_refcounted_he_new_pvn(pTHX_ struct refcounted_he *parent,
3211 const char *keypv, STRLEN keylen, U32 hash, SV *value, U32 flags)
3214 STRLEN value_len = 0;
3215 const char *value_p = NULL;
3219 STRLEN key_offset = 1;
3220 struct refcounted_he *he;
3221 PERL_ARGS_ASSERT_REFCOUNTED_HE_NEW_PVN;
3223 if (!value || value == &PL_sv_placeholder) {
3224 value_type = HVrhek_delete;
3225 } else if (SvPOK(value)) {
3226 value_type = HVrhek_PV;
3227 } else if (SvIOK(value)) {
3228 value_type = SvUOK((const SV *)value) ? HVrhek_UV : HVrhek_IV;
3229 } else if (!SvOK(value)) {
3230 value_type = HVrhek_undef;
3232 value_type = HVrhek_PV;
3234 is_pv = value_type == HVrhek_PV;
3236 /* Do it this way so that the SvUTF8() test is after the SvPV, in case
3237 the value is overloaded, and doesn't yet have the UTF-8flag set. */
3238 value_p = SvPV_const(value, value_len);
3240 value_type = HVrhek_PV_UTF8;
3241 key_offset = value_len + 2;
3243 hekflags = value_type;
3245 if (flags & REFCOUNTED_HE_KEY_UTF8) {
3246 /* Canonicalise to Latin-1 where possible. */
3247 const char *keyend = keypv + keylen, *p;
3248 STRLEN nonascii_count = 0;
3249 for (p = keypv; p != keyend; p++) {
3252 if (!((c & 0xfe) == 0xc2 && ++p != keyend &&
3253 (((U8)*p) & 0xc0) == 0x80))
3254 goto canonicalised_key;
3258 if (nonascii_count) {
3260 const char *p = keypv, *keyend = keypv + keylen;
3261 keylen -= nonascii_count;
3262 Newx(q, keylen, char);
3265 for (; p != keyend; p++, q++) {
3268 ((c & 0x80) ? ((c & 0x03) << 6) | (((U8)*++p) & 0x3f) : c);
3271 flags &= ~REFCOUNTED_HE_KEY_UTF8;
3272 canonicalised_key: ;
3274 if (flags & REFCOUNTED_HE_KEY_UTF8)
3275 hekflags |= HVhek_UTF8;
3277 PERL_HASH(hash, keypv, keylen);
3280 he = (struct refcounted_he*)
3281 PerlMemShared_malloc(sizeof(struct refcounted_he) - 1
3285 he = (struct refcounted_he*)
3286 PerlMemShared_malloc(sizeof(struct refcounted_he) - 1
3290 he->refcounted_he_next = parent;
3293 Copy(value_p, he->refcounted_he_data + 1, value_len + 1, char);
3294 he->refcounted_he_val.refcounted_he_u_len = value_len;
3295 } else if (value_type == HVrhek_IV) {
3296 he->refcounted_he_val.refcounted_he_u_iv = SvIVX(value);
3297 } else if (value_type == HVrhek_UV) {
3298 he->refcounted_he_val.refcounted_he_u_uv = SvUVX(value);
3302 he->refcounted_he_hash = hash;
3303 he->refcounted_he_keylen = keylen;
3304 Copy(keypv, he->refcounted_he_data + key_offset, keylen, char);
3306 he->refcounted_he_hek = share_hek_flags(keypv, keylen, hash, hekflags);
3309 he->refcounted_he_data[0] = hekflags;
3310 he->refcounted_he_refcnt = 1;
3316 =for apidoc m|struct refcounted_he *|refcounted_he_new_pv|struct refcounted_he *parent|const char *key|U32 hash|SV *value|U32 flags
3318 Like L</refcounted_he_new_pvn>, but takes a nul-terminated string instead
3319 of a string/length pair.
3324 struct refcounted_he *
3325 Perl_refcounted_he_new_pv(pTHX_ struct refcounted_he *parent,
3326 const char *key, U32 hash, SV *value, U32 flags)
3328 PERL_ARGS_ASSERT_REFCOUNTED_HE_NEW_PV;
3329 return refcounted_he_new_pvn(parent, key, strlen(key), hash, value, flags);
3333 =for apidoc m|struct refcounted_he *|refcounted_he_new_sv|struct refcounted_he *parent|SV *key|U32 hash|SV *value|U32 flags
3335 Like L</refcounted_he_new_pvn>, but takes a Perl scalar instead of a
3341 struct refcounted_he *
3342 Perl_refcounted_he_new_sv(pTHX_ struct refcounted_he *parent,
3343 SV *key, U32 hash, SV *value, U32 flags)
3347 PERL_ARGS_ASSERT_REFCOUNTED_HE_NEW_SV;
3348 if (flags & REFCOUNTED_HE_KEY_UTF8)
3349 Perl_croak(aTHX_ "panic: refcounted_he_new_sv bad flags %"UVxf,
3351 keypv = SvPV_const(key, keylen);
3353 flags |= REFCOUNTED_HE_KEY_UTF8;
3354 if (!hash && SvIsCOW_shared_hash(key))
3355 hash = SvSHARED_HASH(key);
3356 return refcounted_he_new_pvn(parent, keypv, keylen, hash, value, flags);
3360 =for apidoc m|void|refcounted_he_free|struct refcounted_he *he
3362 Decrements the reference count of a C<refcounted_he> by one. If the
3363 reference count reaches zero the structure's memory is freed, which
3364 (recursively) causes a reduction of its parent C<refcounted_he>'s
3365 reference count. It is safe to pass a null pointer to this function:
3366 no action occurs in this case.
3372 Perl_refcounted_he_free(pTHX_ struct refcounted_he *he) {
3374 PERL_UNUSED_CONTEXT;
3377 struct refcounted_he *copy;
3381 new_count = --he->refcounted_he_refcnt;
3382 HINTS_REFCNT_UNLOCK;
3388 #ifndef USE_ITHREADS
3389 unshare_hek_or_pvn (he->refcounted_he_hek, 0, 0, 0);
3392 he = he->refcounted_he_next;
3393 PerlMemShared_free(copy);
3398 =for apidoc m|struct refcounted_he *|refcounted_he_inc|struct refcounted_he *he
3400 Increment the reference count of a C<refcounted_he>. The pointer to the
3401 C<refcounted_he> is also returned. It is safe to pass a null pointer
3402 to this function: no action occurs and a null pointer is returned.
3407 struct refcounted_he *
3408 Perl_refcounted_he_inc(pTHX_ struct refcounted_he *he)
3413 he->refcounted_he_refcnt++;
3414 HINTS_REFCNT_UNLOCK;
3420 =for apidoc cop_fetch_label
3422 Returns the label attached to a cop.
3423 The flags pointer may be set to C<SVf_UTF8> or 0.
3428 /* pp_entereval is aware that labels are stored with a key ':' at the top of
3431 Perl_cop_fetch_label(pTHX_ COP *const cop, STRLEN *len, U32 *flags) {
3432 struct refcounted_he *const chain = cop->cop_hints_hash;
3434 PERL_ARGS_ASSERT_COP_FETCH_LABEL;
3439 if (chain->refcounted_he_keylen != 1)
3441 if (*REF_HE_KEY(chain) != ':')
3444 if ((STRLEN)HEK_LEN(chain->refcounted_he_hek) != 1)
3446 if (*HEK_KEY(chain->refcounted_he_hek) != ':')
3449 /* Stop anyone trying to really mess us up by adding their own value for
3451 if ((chain->refcounted_he_data[0] & HVrhek_typemask) != HVrhek_PV
3452 && (chain->refcounted_he_data[0] & HVrhek_typemask) != HVrhek_PV_UTF8)
3456 *len = chain->refcounted_he_val.refcounted_he_u_len;
3458 *flags = ((chain->refcounted_he_data[0] & HVrhek_typemask)
3459 == HVrhek_PV_UTF8) ? SVf_UTF8 : 0;
3461 return chain->refcounted_he_data + 1;
3465 =for apidoc cop_store_label
3467 Save a label into a C<cop_hints_hash>. You need to set flags to C<SVf_UTF8>
3474 Perl_cop_store_label(pTHX_ COP *const cop, const char *label, STRLEN len,
3478 PERL_ARGS_ASSERT_COP_STORE_LABEL;
3480 if (flags & ~(SVf_UTF8))
3481 Perl_croak(aTHX_ "panic: cop_store_label illegal flag bits 0x%" UVxf,
3483 labelsv = newSVpvn_flags(label, len, SVs_TEMP);
3484 if (flags & SVf_UTF8)
3487 = refcounted_he_new_pvs(cop->cop_hints_hash, ":", labelsv, 0);
3491 =for apidoc hv_assert
3493 Check that a hash is in an internally consistent state.
3501 Perl_hv_assert(pTHX_ HV *hv)
3506 int placeholders = 0;
3509 const I32 riter = HvRITER_get(hv);
3510 HE *eiter = HvEITER_get(hv);
3512 PERL_ARGS_ASSERT_HV_ASSERT;
3514 (void)hv_iterinit(hv);
3516 while ((entry = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS))) {
3517 /* sanity check the values */
3518 if (HeVAL(entry) == &PL_sv_placeholder)
3522 /* sanity check the keys */
3523 if (HeSVKEY(entry)) {
3524 NOOP; /* Don't know what to check on SV keys. */
3525 } else if (HeKUTF8(entry)) {
3527 if (HeKWASUTF8(entry)) {
3528 PerlIO_printf(Perl_debug_log,
3529 "hash key has both WASUTF8 and UTF8: '%.*s'\n",
3530 (int) HeKLEN(entry), HeKEY(entry));
3533 } else if (HeKWASUTF8(entry))
3536 if (!SvTIED_mg((const SV *)hv, PERL_MAGIC_tied)) {
3537 static const char bad_count[] = "Count %d %s(s), but hash reports %d\n";
3538 const int nhashkeys = HvUSEDKEYS(hv);
3539 const int nhashplaceholders = HvPLACEHOLDERS_get(hv);
3541 if (nhashkeys != real) {
3542 PerlIO_printf(Perl_debug_log, bad_count, real, "keys", nhashkeys );
3545 if (nhashplaceholders != placeholders) {
3546 PerlIO_printf(Perl_debug_log, bad_count, placeholders, "placeholder", nhashplaceholders );
3550 if (withflags && ! HvHASKFLAGS(hv)) {
3551 PerlIO_printf(Perl_debug_log,
3552 "Hash has HASKFLAGS off but I count %d key(s) with flags\n",
3557 sv_dump(MUTABLE_SV(hv));
3559 HvRITER_set(hv, riter); /* Restore hash iterator state */
3560 HvEITER_set(hv, eiter);
3567 * c-indentation-style: bsd
3569 * indent-tabs-mode: nil
3572 * ex: set ts=8 sts=4 sw=4 et: