3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, 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 of all that I have seen." --Bilbo
16 =head1 Hash Manipulation Functions
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.
31 #define PERL_HASH_INTERNAL_ACCESS
34 #define HV_MAX_LENGTH_BEFORE_SPLIT 14
36 static const char S_strtab_error[]
37 = "Cannot modify shared string table in hv_%s";
46 he = (HE*) Perl_get_arena(aTHX_ PERL_ARENA_SIZE);
48 heend = &he[PERL_ARENA_SIZE / sizeof(HE) - 1];
49 PL_body_roots[HE_SVSLOT] = he;
51 HeNEXT(he) = (HE*)(he + 1);
59 #define new_HE() (HE*)safemalloc(sizeof(HE))
60 #define del_HE(p) safefree((char*)p)
69 void ** const root = &PL_body_roots[HE_SVSLOT];
81 #define new_HE() new_he()
85 HeNEXT(p) = (HE*)(PL_body_roots[HE_SVSLOT]); \
86 PL_body_roots[HE_SVSLOT] = p; \
95 S_save_hek_flags(const char *str, I32 len, U32 hash, int flags)
97 const int flags_masked = flags & HVhek_MASK;
101 Newx(k, HEK_BASESIZE + len + 2, char);
103 Copy(str, HEK_KEY(hek), len, char);
104 HEK_KEY(hek)[len] = 0;
106 HEK_HASH(hek) = hash;
107 HEK_FLAGS(hek) = (unsigned char)flags_masked | HVhek_UNSHARED;
109 if (flags & HVhek_FREEKEY)
114 /* free the pool of temporary HE/HEK pairs returned by hv_fetch_ent
118 Perl_free_tied_hv_pool(pTHX)
121 HE *he = PL_hv_fetch_ent_mh;
124 Safefree(HeKEY_hek(he));
128 PL_hv_fetch_ent_mh = NULL;
131 #if defined(USE_ITHREADS)
133 Perl_hek_dup(pTHX_ HEK *source, CLONE_PARAMS* param)
135 HEK *shared = (HEK*)ptr_table_fetch(PL_ptr_table, source);
137 PERL_UNUSED_ARG(param);
140 /* We already shared this hash key. */
141 (void)share_hek_hek(shared);
145 = share_hek_flags(HEK_KEY(source), HEK_LEN(source),
146 HEK_HASH(source), HEK_FLAGS(source));
147 ptr_table_store(PL_ptr_table, source, shared);
153 Perl_he_dup(pTHX_ const HE *e, bool shared, CLONE_PARAMS* param)
159 /* look for it in the table first */
160 ret = (HE*)ptr_table_fetch(PL_ptr_table, e);
164 /* create anew and remember what it is */
166 ptr_table_store(PL_ptr_table, e, ret);
168 HeNEXT(ret) = he_dup(HeNEXT(e),shared, param);
169 if (HeKLEN(e) == HEf_SVKEY) {
171 Newx(k, HEK_BASESIZE + sizeof(SV*), char);
172 HeKEY_hek(ret) = (HEK*)k;
173 HeKEY_sv(ret) = SvREFCNT_inc(sv_dup(HeKEY_sv(e), param));
176 /* This is hek_dup inlined, which seems to be important for speed
178 HEK * const source = HeKEY_hek(e);
179 HEK *shared = (HEK*)ptr_table_fetch(PL_ptr_table, source);
182 /* We already shared this hash key. */
183 (void)share_hek_hek(shared);
187 = share_hek_flags(HEK_KEY(source), HEK_LEN(source),
188 HEK_HASH(source), HEK_FLAGS(source));
189 ptr_table_store(PL_ptr_table, source, shared);
191 HeKEY_hek(ret) = shared;
194 HeKEY_hek(ret) = save_hek_flags(HeKEY(e), HeKLEN(e), HeHASH(e),
196 HeVAL(ret) = SvREFCNT_inc(sv_dup(HeVAL(e), param));
199 #endif /* USE_ITHREADS */
202 S_hv_notallowed(pTHX_ int flags, const char *key, I32 klen,
205 SV * const sv = sv_newmortal();
206 if (!(flags & HVhek_FREEKEY)) {
207 sv_setpvn(sv, key, klen);
210 /* Need to free saved eventually assign to mortal SV */
211 /* XXX is this line an error ???: SV *sv = sv_newmortal(); */
212 sv_usepvn(sv, (char *) key, klen);
214 if (flags & HVhek_UTF8) {
217 Perl_croak(aTHX_ msg, sv);
220 /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot
223 #define HV_FETCH_ISSTORE 0x01
224 #define HV_FETCH_ISEXISTS 0x02
225 #define HV_FETCH_LVALUE 0x04
226 #define HV_FETCH_JUST_SV 0x08
231 Stores an SV in a hash. The hash key is specified as C<key> and C<klen> is
232 the length of the key. The C<hash> parameter is the precomputed hash
233 value; if it is zero then Perl will compute it. The return value will be
234 NULL if the operation failed or if the value did not need to be actually
235 stored within the hash (as in the case of tied hashes). Otherwise it can
236 be dereferenced to get the original C<SV*>. Note that the caller is
237 responsible for suitably incrementing the reference count of C<val> before
238 the call, and decrementing it if the function returned NULL. Effectively
239 a successful hv_store takes ownership of one reference to C<val>. This is
240 usually what you want; a newly created SV has a reference count of one, so
241 if all your code does is create SVs then store them in a hash, hv_store
242 will own the only reference to the new SV, and your code doesn't need to do
243 anything further to tidy up. hv_store is not implemented as a call to
244 hv_store_ent, and does not create a temporary SV for the key, so if your
245 key data is not already in SV form then use hv_store in preference to
248 See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more
249 information on how to use this function on tied hashes.
255 Perl_hv_store(pTHX_ HV *hv, const char *key, I32 klen_i32, SV *val, U32 hash)
268 hek = hv_fetch_common (hv, NULL, key, klen, flags,
269 (HV_FETCH_ISSTORE|HV_FETCH_JUST_SV), val, hash);
270 return hek ? &HeVAL(hek) : NULL;
273 /* XXX This looks like an ideal candidate to inline */
275 Perl_hv_store_flags(pTHX_ HV *hv, const char *key, I32 klen, SV *val,
276 register U32 hash, int flags)
278 HE * const hek = hv_fetch_common (hv, NULL, key, klen, flags,
279 (HV_FETCH_ISSTORE|HV_FETCH_JUST_SV), val, hash);
280 return hek ? &HeVAL(hek) : NULL;
284 =for apidoc hv_store_ent
286 Stores C<val> in a hash. The hash key is specified as C<key>. The C<hash>
287 parameter is the precomputed hash value; if it is zero then Perl will
288 compute it. The return value is the new hash entry so created. It will be
289 NULL if the operation failed or if the value did not need to be actually
290 stored within the hash (as in the case of tied hashes). Otherwise the
291 contents of the return value can be accessed using the C<He?> macros
292 described here. Note that the caller is responsible for suitably
293 incrementing the reference count of C<val> before the call, and
294 decrementing it if the function returned NULL. Effectively a successful
295 hv_store_ent takes ownership of one reference to C<val>. This is
296 usually what you want; a newly created SV has a reference count of one, so
297 if all your code does is create SVs then store them in a hash, hv_store
298 will own the only reference to the new SV, and your code doesn't need to do
299 anything further to tidy up. Note that hv_store_ent only reads the C<key>;
300 unlike C<val> it does not take ownership of it, so maintaining the correct
301 reference count on C<key> is entirely the caller's responsibility. hv_store
302 is not implemented as a call to hv_store_ent, and does not create a temporary
303 SV for the key, so if your key data is not already in SV form then use
304 hv_store in preference to hv_store_ent.
306 See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more
307 information on how to use this function on tied hashes.
312 /* XXX This looks like an ideal candidate to inline */
314 Perl_hv_store_ent(pTHX_ HV *hv, SV *keysv, SV *val, U32 hash)
316 return hv_fetch_common(hv, keysv, NULL, 0, 0, HV_FETCH_ISSTORE, val, hash);
320 =for apidoc hv_exists
322 Returns a boolean indicating whether the specified hash key exists. The
323 C<klen> is the length of the key.
329 Perl_hv_exists(pTHX_ HV *hv, const char *key, I32 klen_i32)
341 return hv_fetch_common(hv, NULL, key, klen, flags, HV_FETCH_ISEXISTS, 0, 0)
348 Returns the SV which corresponds to the specified key in the hash. The
349 C<klen> is the length of the key. If C<lval> is set then the fetch will be
350 part of a store. Check that the return value is non-null before
351 dereferencing it to an C<SV*>.
353 See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more
354 information on how to use this function on tied hashes.
360 Perl_hv_fetch(pTHX_ HV *hv, const char *key, I32 klen_i32, I32 lval)
373 hek = hv_fetch_common (hv, NULL, key, klen, flags,
374 lval ? (HV_FETCH_JUST_SV | HV_FETCH_LVALUE) : HV_FETCH_JUST_SV,
376 return hek ? &HeVAL(hek) : NULL;
380 =for apidoc hv_exists_ent
382 Returns a boolean indicating whether the specified hash key exists. C<hash>
383 can be a valid precomputed hash value, or 0 to ask for it to be
389 /* XXX This looks like an ideal candidate to inline */
391 Perl_hv_exists_ent(pTHX_ HV *hv, SV *keysv, U32 hash)
393 return hv_fetch_common(hv, keysv, NULL, 0, 0, HV_FETCH_ISEXISTS, 0, hash)
397 /* returns an HE * structure with the all fields set */
398 /* note that hent_val will be a mortal sv for MAGICAL hashes */
400 =for apidoc hv_fetch_ent
402 Returns the hash entry which corresponds to the specified key in the hash.
403 C<hash> must be a valid precomputed hash number for the given C<key>, or 0
404 if you want the function to compute it. IF C<lval> is set then the fetch
405 will be part of a store. Make sure the return value is non-null before
406 accessing it. The return value when C<tb> is a tied hash is a pointer to a
407 static location, so be sure to make a copy of the structure if you need to
410 See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more
411 information on how to use this function on tied hashes.
417 Perl_hv_fetch_ent(pTHX_ HV *hv, SV *keysv, I32 lval, register U32 hash)
419 return hv_fetch_common(hv, keysv, NULL, 0, 0,
420 (lval ? HV_FETCH_LVALUE : 0), NULL, hash);
424 S_hv_fetch_common(pTHX_ HV *hv, SV *keysv, const char *key, STRLEN klen,
425 int flags, int action, SV *val, register U32 hash)
439 if (flags & HVhek_FREEKEY)
441 key = SvPV_const(keysv, klen);
443 is_utf8 = (SvUTF8(keysv) != 0);
445 is_utf8 = ((flags & HVhek_UTF8) ? TRUE : FALSE);
448 xhv = (XPVHV*)SvANY(hv);
450 if (SvRMAGICAL(hv) && !(action & (HV_FETCH_ISSTORE|HV_FETCH_ISEXISTS))) {
451 if (mg_find((SV*)hv, PERL_MAGIC_tied) || SvGMAGICAL((SV*)hv)) {
454 /* XXX should be able to skimp on the HE/HEK here when
455 HV_FETCH_JUST_SV is true. */
458 keysv = newSVpvn(key, klen);
463 keysv = newSVsv(keysv);
465 mg_copy((SV*)hv, sv, (char *)keysv, HEf_SVKEY);
467 /* grab a fake HE/HEK pair from the pool or make a new one */
468 entry = PL_hv_fetch_ent_mh;
470 PL_hv_fetch_ent_mh = HeNEXT(entry);
474 Newx(k, HEK_BASESIZE + sizeof(SV*), char);
475 HeKEY_hek(entry) = (HEK*)k;
477 HeNEXT(entry) = NULL;
478 HeSVKEY_set(entry, keysv);
480 sv_upgrade(sv, SVt_PVLV);
482 /* so we can free entry when freeing sv */
483 LvTARG(sv) = (SV*)entry;
485 /* XXX remove at some point? */
486 if (flags & HVhek_FREEKEY)
491 #ifdef ENV_IS_CASELESS
492 else if (mg_find((SV*)hv, PERL_MAGIC_env)) {
494 for (i = 0; i < klen; ++i)
495 if (isLOWER(key[i])) {
496 /* Would be nice if we had a routine to do the
497 copy and upercase in a single pass through. */
498 const char * const nkey = strupr(savepvn(key,klen));
499 /* Note that this fetch is for nkey (the uppercased
500 key) whereas the store is for key (the original) */
501 entry = hv_fetch_common(hv, NULL, nkey, klen,
502 HVhek_FREEKEY, /* free nkey */
503 0 /* non-LVAL fetch */,
505 0 /* compute hash */);
506 if (!entry && (action & HV_FETCH_LVALUE)) {
507 /* This call will free key if necessary.
508 Do it this way to encourage compiler to tail
510 entry = hv_fetch_common(hv, keysv, key, klen,
511 flags, HV_FETCH_ISSTORE,
514 if (flags & HVhek_FREEKEY)
522 else if (SvRMAGICAL(hv) && (action & HV_FETCH_ISEXISTS)) {
523 if (mg_find((SV*)hv, PERL_MAGIC_tied) || SvGMAGICAL((SV*)hv)) {
524 /* I don't understand why hv_exists_ent has svret and sv,
525 whereas hv_exists only had one. */
526 SV * const svret = sv_newmortal();
529 if (keysv || is_utf8) {
531 keysv = newSVpvn(key, klen);
534 keysv = newSVsv(keysv);
536 mg_copy((SV*)hv, sv, (char *)sv_2mortal(keysv), HEf_SVKEY);
538 mg_copy((SV*)hv, sv, key, klen);
540 if (flags & HVhek_FREEKEY)
542 magic_existspack(svret, mg_find(sv, PERL_MAGIC_tiedelem));
543 /* This cast somewhat evil, but I'm merely using NULL/
544 not NULL to return the boolean exists.
545 And I know hv is not NULL. */
546 return SvTRUE(svret) ? (HE *)hv : NULL;
548 #ifdef ENV_IS_CASELESS
549 else if (mg_find((SV*)hv, PERL_MAGIC_env)) {
550 /* XXX This code isn't UTF8 clean. */
551 char * const keysave = (char * const)key;
552 /* Will need to free this, so set FREEKEY flag. */
553 key = savepvn(key,klen);
554 key = (const char*)strupr((char*)key);
559 if (flags & HVhek_FREEKEY) {
562 flags |= HVhek_FREEKEY;
566 else if (action & HV_FETCH_ISSTORE) {
569 hv_magic_check (hv, &needs_copy, &needs_store);
571 const bool save_taint = PL_tainted;
572 if (keysv || is_utf8) {
574 keysv = newSVpvn(key, klen);
578 PL_tainted = SvTAINTED(keysv);
579 keysv = sv_2mortal(newSVsv(keysv));
580 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
582 mg_copy((SV*)hv, val, key, klen);
585 TAINT_IF(save_taint);
587 if (flags & HVhek_FREEKEY)
591 #ifdef ENV_IS_CASELESS
592 else if (mg_find((SV*)hv, PERL_MAGIC_env)) {
593 /* XXX This code isn't UTF8 clean. */
594 const char *keysave = key;
595 /* Will need to free this, so set FREEKEY flag. */
596 key = savepvn(key,klen);
597 key = (const char*)strupr((char*)key);
602 if (flags & HVhek_FREEKEY) {
605 flags |= HVhek_FREEKEY;
613 if ((action & (HV_FETCH_LVALUE | HV_FETCH_ISSTORE))
614 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
615 || (SvRMAGICAL((SV*)hv) && mg_find((SV*)hv, PERL_MAGIC_env))
620 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max+1 /* HvMAX(hv)+1 */),
622 HvARRAY(hv) = (HE**)array;
624 #ifdef DYNAMIC_ENV_FETCH
625 else if (action & HV_FETCH_ISEXISTS) {
626 /* for an %ENV exists, if we do an insert it's by a recursive
627 store call, so avoid creating HvARRAY(hv) right now. */
631 /* XXX remove at some point? */
632 if (flags & HVhek_FREEKEY)
640 char * const keysave = (char *)key;
641 key = (char*)bytes_from_utf8((U8*)key, &klen, &is_utf8);
645 flags &= ~HVhek_UTF8;
646 if (key != keysave) {
647 if (flags & HVhek_FREEKEY)
649 flags |= HVhek_WASUTF8 | HVhek_FREEKEY;
654 PERL_HASH_INTERNAL(hash, key, klen);
655 /* We don't have a pointer to the hv, so we have to replicate the
656 flag into every HEK, so that hv_iterkeysv can see it. */
657 /* And yes, you do need this even though you are not "storing" because
658 you can flip the flags below if doing an lval lookup. (And that
659 was put in to give the semantics Andreas was expecting.) */
660 flags |= HVhek_REHASH;
662 if (keysv && (SvIsCOW_shared_hash(keysv))) {
663 hash = SvSHARED_HASH(keysv);
665 PERL_HASH(hash, key, klen);
669 masked_flags = (flags & HVhek_MASK);
671 #ifdef DYNAMIC_ENV_FETCH
672 if (!HvARRAY(hv)) entry = NULL;
676 entry = (HvARRAY(hv))[hash & (I32) HvMAX(hv)];
678 for (; entry; entry = HeNEXT(entry)) {
679 if (HeHASH(entry) != hash) /* strings can't be equal */
681 if (HeKLEN(entry) != (I32)klen)
683 if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */
685 if ((HeKFLAGS(entry) ^ masked_flags) & HVhek_UTF8)
688 if (action & (HV_FETCH_LVALUE|HV_FETCH_ISSTORE)) {
689 if (HeKFLAGS(entry) != masked_flags) {
690 /* We match if HVhek_UTF8 bit in our flags and hash key's
691 match. But if entry was set previously with HVhek_WASUTF8
692 and key now doesn't (or vice versa) then we should change
693 the key's flag, as this is assignment. */
694 if (HvSHAREKEYS(hv)) {
695 /* Need to swap the key we have for a key with the flags we
696 need. As keys are shared we can't just write to the
697 flag, so we share the new one, unshare the old one. */
698 HEK * const new_hek = share_hek_flags(key, klen, hash,
700 unshare_hek (HeKEY_hek(entry));
701 HeKEY_hek(entry) = new_hek;
703 else if (hv == PL_strtab) {
704 /* PL_strtab is usually the only hash without HvSHAREKEYS,
705 so putting this test here is cheap */
706 if (flags & HVhek_FREEKEY)
708 Perl_croak(aTHX_ S_strtab_error,
709 action & HV_FETCH_LVALUE ? "fetch" : "store");
712 HeKFLAGS(entry) = masked_flags;
713 if (masked_flags & HVhek_ENABLEHVKFLAGS)
716 if (HeVAL(entry) == &PL_sv_placeholder) {
717 /* yes, can store into placeholder slot */
718 if (action & HV_FETCH_LVALUE) {
720 /* This preserves behaviour with the old hv_fetch
721 implementation which at this point would bail out
722 with a break; (at "if we find a placeholder, we
723 pretend we haven't found anything")
725 That break mean that if a placeholder were found, it
726 caused a call into hv_store, which in turn would
727 check magic, and if there is no magic end up pretty
728 much back at this point (in hv_store's code). */
731 /* LVAL fetch which actaully needs a store. */
733 HvPLACEHOLDERS(hv)--;
736 if (val != &PL_sv_placeholder)
737 HvPLACEHOLDERS(hv)--;
740 } else if (action & HV_FETCH_ISSTORE) {
741 SvREFCNT_dec(HeVAL(entry));
744 } else if (HeVAL(entry) == &PL_sv_placeholder) {
745 /* if we find a placeholder, we pretend we haven't found
749 if (flags & HVhek_FREEKEY)
753 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
754 if (!(action & HV_FETCH_ISSTORE)
755 && SvRMAGICAL((SV*)hv) && mg_find((SV*)hv, PERL_MAGIC_env)) {
757 const char * const env = PerlEnv_ENVgetenv_len(key,&len);
759 sv = newSVpvn(env,len);
761 return hv_fetch_common(hv,keysv,key,klen,flags,HV_FETCH_ISSTORE,sv,
767 if (!entry && SvREADONLY(hv) && !(action & HV_FETCH_ISEXISTS)) {
768 hv_notallowed(flags, key, klen,
769 "Attempt to access disallowed key '%"SVf"' in"
770 " a restricted hash");
772 if (!(action & (HV_FETCH_LVALUE|HV_FETCH_ISSTORE))) {
773 /* Not doing some form of store, so return failure. */
774 if (flags & HVhek_FREEKEY)
778 if (action & HV_FETCH_LVALUE) {
781 /* At this point the old hv_fetch code would call to hv_store,
782 which in turn might do some tied magic. So we need to make that
783 magic check happen. */
784 /* gonna assign to this, so it better be there */
785 return hv_fetch_common(hv, keysv, key, klen, flags,
786 HV_FETCH_ISSTORE, val, hash);
787 /* XXX Surely that could leak if the fetch-was-store fails?
788 Just like the hv_fetch. */
792 /* Welcome to hv_store... */
795 /* Not sure if we can get here. I think the only case of oentry being
796 NULL is for %ENV with dynamic env fetch. But that should disappear
797 with magic in the previous code. */
800 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max+1 /* HvMAX(hv)+1 */),
802 HvARRAY(hv) = (HE**)array;
805 oentry = &(HvARRAY(hv))[hash & (I32) xhv->xhv_max];
808 /* share_hek_flags will do the free for us. This might be considered
811 HeKEY_hek(entry) = share_hek_flags(key, klen, hash, flags);
812 else if (hv == PL_strtab) {
813 /* PL_strtab is usually the only hash without HvSHAREKEYS, so putting
814 this test here is cheap */
815 if (flags & HVhek_FREEKEY)
817 Perl_croak(aTHX_ S_strtab_error,
818 action & HV_FETCH_LVALUE ? "fetch" : "store");
820 else /* gotta do the real thing */
821 HeKEY_hek(entry) = save_hek_flags(key, klen, hash, flags);
823 HeNEXT(entry) = *oentry;
826 if (val == &PL_sv_placeholder)
827 HvPLACEHOLDERS(hv)++;
828 if (masked_flags & HVhek_ENABLEHVKFLAGS)
832 const HE *counter = HeNEXT(entry);
834 xhv->xhv_keys++; /* HvTOTALKEYS(hv)++ */
835 if (!counter) { /* initial entry? */
836 xhv->xhv_fill++; /* HvFILL(hv)++ */
837 } else if (xhv->xhv_keys > (IV)xhv->xhv_max) {
839 } else if(!HvREHASH(hv)) {
842 while ((counter = HeNEXT(counter)))
845 if (n_links > HV_MAX_LENGTH_BEFORE_SPLIT) {
846 /* Use only the old HvKEYS(hv) > HvMAX(hv) condition to limit
847 bucket splits on a rehashed hash, as we're not going to
848 split it again, and if someone is lucky (evil) enough to
849 get all the keys in one list they could exhaust our memory
850 as we repeatedly double the number of buckets on every
851 entry. Linear search feels a less worse thing to do. */
861 S_hv_magic_check(HV *hv, bool *needs_copy, bool *needs_store)
863 const MAGIC *mg = SvMAGIC(hv);
867 if (isUPPER(mg->mg_type)) {
869 if (mg->mg_type == PERL_MAGIC_tied) {
870 *needs_store = FALSE;
871 return; /* We've set all there is to set. */
874 mg = mg->mg_moremagic;
879 =for apidoc hv_scalar
881 Evaluates the hash in scalar context and returns the result. Handles magic when the hash is tied.
887 Perl_hv_scalar(pTHX_ HV *hv)
891 if (SvRMAGICAL(hv)) {
892 MAGIC * const mg = mg_find((SV*)hv, PERL_MAGIC_tied);
894 return magic_scalarpack(hv, mg);
899 Perl_sv_setpvf(aTHX_ sv, "%ld/%ld",
900 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
908 =for apidoc hv_delete
910 Deletes a key/value pair in the hash. The value SV is removed from the
911 hash and returned to the caller. The C<klen> is the length of the key.
912 The C<flags> value will normally be zero; if set to G_DISCARD then NULL
919 Perl_hv_delete(pTHX_ HV *hv, const char *key, I32 klen_i32, I32 flags)
926 k_flags = HVhek_UTF8;
931 return hv_delete_common(hv, NULL, key, klen, k_flags, flags, 0);
935 =for apidoc hv_delete_ent
937 Deletes a key/value pair in the hash. The value SV is removed from the
938 hash and returned to the caller. The C<flags> value will normally be zero;
939 if set to G_DISCARD then NULL will be returned. C<hash> can be a valid
940 precomputed hash value, or 0 to ask for it to be computed.
945 /* XXX This looks like an ideal candidate to inline */
947 Perl_hv_delete_ent(pTHX_ HV *hv, SV *keysv, I32 flags, U32 hash)
949 return hv_delete_common(hv, keysv, NULL, 0, 0, flags, hash);
953 S_hv_delete_common(pTHX_ HV *hv, SV *keysv, const char *key, STRLEN klen,
954 int k_flags, I32 d_flags, U32 hash)
959 register HE **oentry;
960 HE *const *first_entry;
968 if (k_flags & HVhek_FREEKEY)
970 key = SvPV_const(keysv, klen);
972 is_utf8 = (SvUTF8(keysv) != 0);
974 is_utf8 = ((k_flags & HVhek_UTF8) ? TRUE : FALSE);
977 if (SvRMAGICAL(hv)) {
980 hv_magic_check (hv, &needs_copy, &needs_store);
984 entry = hv_fetch_common(hv, keysv, key, klen,
985 k_flags & ~HVhek_FREEKEY, HV_FETCH_LVALUE,
987 sv = entry ? HeVAL(entry) : NULL;
993 if (mg_find(sv, PERL_MAGIC_tiedelem)) {
994 /* No longer an element */
995 sv_unmagic(sv, PERL_MAGIC_tiedelem);
998 return NULL; /* element cannot be deleted */
1000 #ifdef ENV_IS_CASELESS
1001 else if (mg_find((SV*)hv, PERL_MAGIC_env)) {
1002 /* XXX This code isn't UTF8 clean. */
1003 keysv = sv_2mortal(newSVpvn(key,klen));
1004 if (k_flags & HVhek_FREEKEY) {
1007 key = strupr(SvPVX(keysv));
1016 xhv = (XPVHV*)SvANY(hv);
1021 const char * const keysave = key;
1022 key = (char*)bytes_from_utf8((U8*)key, &klen, &is_utf8);
1025 k_flags |= HVhek_UTF8;
1027 k_flags &= ~HVhek_UTF8;
1028 if (key != keysave) {
1029 if (k_flags & HVhek_FREEKEY) {
1030 /* This shouldn't happen if our caller does what we expect,
1031 but strictly the API allows it. */
1034 k_flags |= HVhek_WASUTF8 | HVhek_FREEKEY;
1036 HvHASKFLAGS_on((SV*)hv);
1040 PERL_HASH_INTERNAL(hash, key, klen);
1042 if (keysv && (SvIsCOW_shared_hash(keysv))) {
1043 hash = SvSHARED_HASH(keysv);
1045 PERL_HASH(hash, key, klen);
1049 masked_flags = (k_flags & HVhek_MASK);
1051 first_entry = oentry = &(HvARRAY(hv))[hash & (I32) HvMAX(hv)];
1053 for (; entry; oentry = &HeNEXT(entry), entry = *oentry) {
1055 if (HeHASH(entry) != hash) /* strings can't be equal */
1057 if (HeKLEN(entry) != (I32)klen)
1059 if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */
1061 if ((HeKFLAGS(entry) ^ masked_flags) & HVhek_UTF8)
1064 if (hv == PL_strtab) {
1065 if (k_flags & HVhek_FREEKEY)
1067 Perl_croak(aTHX_ S_strtab_error, "delete");
1070 /* if placeholder is here, it's already been deleted.... */
1071 if (HeVAL(entry) == &PL_sv_placeholder) {
1072 if (k_flags & HVhek_FREEKEY)
1076 if (SvREADONLY(hv) && HeVAL(entry) && SvREADONLY(HeVAL(entry))) {
1077 hv_notallowed(k_flags, key, klen,
1078 "Attempt to delete readonly key '%"SVf"' from"
1079 " a restricted hash");
1081 if (k_flags & HVhek_FREEKEY)
1084 if (d_flags & G_DISCARD)
1087 sv = sv_2mortal(HeVAL(entry));
1088 HeVAL(entry) = &PL_sv_placeholder;
1092 * If a restricted hash, rather than really deleting the entry, put
1093 * a placeholder there. This marks the key as being "approved", so
1094 * we can still access via not-really-existing key without raising
1097 if (SvREADONLY(hv)) {
1098 SvREFCNT_dec(HeVAL(entry));
1099 HeVAL(entry) = &PL_sv_placeholder;
1100 /* We'll be saving this slot, so the number of allocated keys
1101 * doesn't go down, but the number placeholders goes up */
1102 HvPLACEHOLDERS(hv)++;
1104 *oentry = HeNEXT(entry);
1106 xhv->xhv_fill--; /* HvFILL(hv)-- */
1108 if (SvOOK(hv) && entry == HvAUX(hv)->xhv_eiter /* HvEITER(hv) */)
1111 hv_free_ent(hv, entry);
1112 xhv->xhv_keys--; /* HvTOTALKEYS(hv)-- */
1113 if (xhv->xhv_keys == 0)
1114 HvHASKFLAGS_off(hv);
1118 if (SvREADONLY(hv)) {
1119 hv_notallowed(k_flags, key, klen,
1120 "Attempt to delete disallowed key '%"SVf"' from"
1121 " a restricted hash");
1124 if (k_flags & HVhek_FREEKEY)
1130 S_hsplit(pTHX_ HV *hv)
1133 register XPVHV* xhv = (XPVHV*)SvANY(hv);
1134 const I32 oldsize = (I32) xhv->xhv_max+1; /* HvMAX(hv)+1 (sick) */
1135 register I32 newsize = oldsize * 2;
1137 char *a = (char*) HvARRAY(hv);
1139 register HE **oentry;
1140 int longest_chain = 0;
1143 /*PerlIO_printf(PerlIO_stderr(), "hsplit called for %p which had %d\n",
1144 hv, (int) oldsize);*/
1146 if (HvPLACEHOLDERS_get(hv) && !SvREADONLY(hv)) {
1147 /* Can make this clear any placeholders first for non-restricted hashes,
1148 even though Storable rebuilds restricted hashes by putting in all the
1149 placeholders (first) before turning on the readonly flag, because
1150 Storable always pre-splits the hash. */
1151 hv_clear_placeholders(hv);
1155 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
1156 Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize)
1157 + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0), char);
1163 Copy(&a[oldsize * sizeof(HE*)], &a[newsize * sizeof(HE*)], 1, struct xpvhv_aux);
1166 Newx(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize)
1167 + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0), char);
1172 Copy(HvARRAY(hv), a, oldsize * sizeof(HE*), char);
1174 Copy(HvAUX(hv), &a[newsize * sizeof(HE*)], 1, struct xpvhv_aux);
1176 if (oldsize >= 64) {
1177 offer_nice_chunk(HvARRAY(hv),
1178 PERL_HV_ARRAY_ALLOC_BYTES(oldsize)
1179 + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0));
1182 Safefree(HvARRAY(hv));
1186 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
1187 xhv->xhv_max = --newsize; /* HvMAX(hv) = --newsize */
1188 HvARRAY(hv) = (HE**) a;
1191 for (i=0; i<oldsize; i++,aep++) {
1192 int left_length = 0;
1193 int right_length = 0;
1197 if (!*aep) /* non-existent */
1200 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
1201 if ((HeHASH(entry) & newsize) != (U32)i) {
1202 *oentry = HeNEXT(entry);
1203 HeNEXT(entry) = *bep;
1205 xhv->xhv_fill++; /* HvFILL(hv)++ */
1211 oentry = &HeNEXT(entry);
1215 if (!*aep) /* everything moved */
1216 xhv->xhv_fill--; /* HvFILL(hv)-- */
1217 /* I think we don't actually need to keep track of the longest length,
1218 merely flag if anything is too long. But for the moment while
1219 developing this code I'll track it. */
1220 if (left_length > longest_chain)
1221 longest_chain = left_length;
1222 if (right_length > longest_chain)
1223 longest_chain = right_length;
1227 /* Pick your policy for "hashing isn't working" here: */
1228 if (longest_chain <= HV_MAX_LENGTH_BEFORE_SPLIT /* split worked? */
1233 if (hv == PL_strtab) {
1234 /* Urg. Someone is doing something nasty to the string table.
1239 /* Awooga. Awooga. Pathological data. */
1240 /*PerlIO_printf(PerlIO_stderr(), "%p %d of %d with %d/%d buckets\n", hv,
1241 longest_chain, HvTOTALKEYS(hv), HvFILL(hv), 1+HvMAX(hv));*/
1244 Newxz(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize)
1245 + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0), char);
1247 Copy(HvAUX(hv), &a[newsize * sizeof(HE*)], 1, struct xpvhv_aux);
1250 was_shared = HvSHAREKEYS(hv);
1253 HvSHAREKEYS_off(hv);
1258 for (i=0; i<newsize; i++,aep++) {
1259 register HE *entry = *aep;
1261 /* We're going to trash this HE's next pointer when we chain it
1262 into the new hash below, so store where we go next. */
1263 HE * const next = HeNEXT(entry);
1268 PERL_HASH_INTERNAL(hash, HeKEY(entry), HeKLEN(entry));
1273 = save_hek_flags(HeKEY(entry), HeKLEN(entry),
1274 hash, HeKFLAGS(entry));
1275 unshare_hek (HeKEY_hek(entry));
1276 HeKEY_hek(entry) = new_hek;
1278 /* Not shared, so simply write the new hash in. */
1279 HeHASH(entry) = hash;
1281 /*PerlIO_printf(PerlIO_stderr(), "%d ", HeKFLAGS(entry));*/
1282 HEK_REHASH_on(HeKEY_hek(entry));
1283 /*PerlIO_printf(PerlIO_stderr(), "%d\n", HeKFLAGS(entry));*/
1285 /* Copy oentry to the correct new chain. */
1286 bep = ((HE**)a) + (hash & (I32) xhv->xhv_max);
1288 xhv->xhv_fill++; /* HvFILL(hv)++ */
1289 HeNEXT(entry) = *bep;
1295 Safefree (HvARRAY(hv));
1296 HvARRAY(hv) = (HE **)a;
1300 Perl_hv_ksplit(pTHX_ HV *hv, IV newmax)
1303 register XPVHV* xhv = (XPVHV*)SvANY(hv);
1304 const I32 oldsize = (I32) xhv->xhv_max+1; /* HvMAX(hv)+1 (sick) */
1305 register I32 newsize;
1310 register HE **oentry;
1312 newsize = (I32) newmax; /* possible truncation here */
1313 if (newsize != newmax || newmax <= oldsize)
1315 while ((newsize & (1 + ~newsize)) != newsize) {
1316 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
1318 if (newsize < newmax)
1320 if (newsize < newmax)
1321 return; /* overflow detection */
1323 a = (char *) HvARRAY(hv);
1326 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
1327 Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize)
1328 + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0), char);
1334 Copy(&a[oldsize * sizeof(HE*)], &a[newsize * sizeof(HE*)], 1, struct xpvhv_aux);
1337 Newx(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize)
1338 + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0), char);
1343 Copy(HvARRAY(hv), a, oldsize * sizeof(HE*), char);
1345 Copy(HvAUX(hv), &a[newsize * sizeof(HE*)], 1, struct xpvhv_aux);
1347 if (oldsize >= 64) {
1348 offer_nice_chunk(HvARRAY(hv),
1349 PERL_HV_ARRAY_ALLOC_BYTES(oldsize)
1350 + (SvOOK(hv) ? sizeof(struct xpvhv_aux) : 0));
1353 Safefree(HvARRAY(hv));
1356 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
1359 Newxz(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
1361 xhv->xhv_max = --newsize; /* HvMAX(hv) = --newsize */
1362 HvARRAY(hv) = (HE **) a;
1363 if (!xhv->xhv_fill /* !HvFILL(hv) */) /* skip rest if no entries */
1367 for (i=0; i<oldsize; i++,aep++) {
1368 if (!*aep) /* non-existent */
1370 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
1371 register I32 j = (HeHASH(entry) & newsize);
1375 *oentry = HeNEXT(entry);
1376 if (!(HeNEXT(entry) = aep[j]))
1377 xhv->xhv_fill++; /* HvFILL(hv)++ */
1382 oentry = &HeNEXT(entry);
1384 if (!*aep) /* everything moved */
1385 xhv->xhv_fill--; /* HvFILL(hv)-- */
1392 Creates a new HV. The reference count is set to 1.
1400 register XPVHV* xhv;
1401 HV * const hv = (HV*)newSV(0);
1403 sv_upgrade((SV *)hv, SVt_PVHV);
1404 xhv = (XPVHV*)SvANY(hv);
1407 #ifndef NODEFAULT_SHAREKEYS
1408 HvSHAREKEYS_on(hv); /* key-sharing on by default */
1411 xhv->xhv_max = 7; /* HvMAX(hv) = 7 (start with 8 buckets) */
1412 xhv->xhv_fill = 0; /* HvFILL(hv) = 0 */
1417 Perl_newHVhv(pTHX_ HV *ohv)
1419 HV * const hv = newHV();
1420 STRLEN hv_max, hv_fill;
1422 if (!ohv || (hv_fill = HvFILL(ohv)) == 0)
1424 hv_max = HvMAX(ohv);
1426 if (!SvMAGICAL((SV *)ohv)) {
1427 /* It's an ordinary hash, so copy it fast. AMS 20010804 */
1429 const bool shared = !!HvSHAREKEYS(ohv);
1430 HE **ents, ** const oents = (HE **)HvARRAY(ohv);
1432 Newx(a, PERL_HV_ARRAY_ALLOC_BYTES(hv_max+1), char);
1435 /* In each bucket... */
1436 for (i = 0; i <= hv_max; i++) {
1438 HE *oent = oents[i];
1445 /* Copy the linked list of entries. */
1446 for (; oent; oent = HeNEXT(oent)) {
1447 const U32 hash = HeHASH(oent);
1448 const char * const key = HeKEY(oent);
1449 const STRLEN len = HeKLEN(oent);
1450 const int flags = HeKFLAGS(oent);
1451 HE * const ent = new_HE();
1453 HeVAL(ent) = newSVsv(HeVAL(oent));
1455 = shared ? share_hek_flags(key, len, hash, flags)
1456 : save_hek_flags(key, len, hash, flags);
1467 HvFILL(hv) = hv_fill;
1468 HvTOTALKEYS(hv) = HvTOTALKEYS(ohv);
1472 /* Iterate over ohv, copying keys and values one at a time. */
1474 const I32 riter = HvRITER_get(ohv);
1475 HE * const eiter = HvEITER_get(ohv);
1477 /* Can we use fewer buckets? (hv_max is always 2^n-1) */
1478 while (hv_max && hv_max + 1 >= hv_fill * 2)
1479 hv_max = hv_max / 2;
1483 while ((entry = hv_iternext_flags(ohv, 0))) {
1484 hv_store_flags(hv, HeKEY(entry), HeKLEN(entry),
1485 newSVsv(HeVAL(entry)), HeHASH(entry),
1488 HvRITER_set(ohv, riter);
1489 HvEITER_set(ohv, eiter);
1495 /* A rather specialised version of newHVhv for copying %^H, ensuring all the
1496 magic stays on it. */
1498 Perl_hv_copy_hints_hv(pTHX_ HV *const ohv)
1500 HV * const hv = newHV();
1503 if (ohv && (hv_fill = HvFILL(ohv))) {
1504 STRLEN hv_max = HvMAX(ohv);
1506 const I32 riter = HvRITER_get(ohv);
1507 HE * const eiter = HvEITER_get(ohv);
1509 while (hv_max && hv_max + 1 >= hv_fill * 2)
1510 hv_max = hv_max / 2;
1514 while ((entry = hv_iternext_flags(ohv, 0))) {
1515 SV *const sv = newSVsv(HeVAL(entry));
1516 sv_magic(sv, NULL, PERL_MAGIC_hintselem,
1517 (char *)newSVhek (HeKEY_hek(entry)), HEf_SVKEY);
1518 hv_store_flags(hv, HeKEY(entry), HeKLEN(entry),
1519 sv, HeHASH(entry), HeKFLAGS(entry));
1521 HvRITER_set(ohv, riter);
1522 HvEITER_set(ohv, eiter);
1524 hv_magic(hv, NULL, PERL_MAGIC_hints);
1529 Perl_hv_free_ent(pTHX_ HV *hv, register HE *entry)
1537 if (val && isGV(val) && GvCVu(val) && HvNAME_get(hv))
1538 PL_sub_generation++; /* may be deletion of method from stash */
1540 if (HeKLEN(entry) == HEf_SVKEY) {
1541 SvREFCNT_dec(HeKEY_sv(entry));
1542 Safefree(HeKEY_hek(entry));
1544 else if (HvSHAREKEYS(hv))
1545 unshare_hek(HeKEY_hek(entry));
1547 Safefree(HeKEY_hek(entry));
1552 Perl_hv_delayfree_ent(pTHX_ HV *hv, register HE *entry)
1557 /* SvREFCNT_inc to counter the SvREFCNT_dec in hv_free_ent */
1558 sv_2mortal(SvREFCNT_inc(HeVAL(entry))); /* free between statements */
1559 if (HeKLEN(entry) == HEf_SVKEY) {
1560 sv_2mortal(SvREFCNT_inc(HeKEY_sv(entry)));
1562 hv_free_ent(hv, entry);
1566 =for apidoc hv_clear
1568 Clears a hash, making it empty.
1574 Perl_hv_clear(pTHX_ HV *hv)
1577 register XPVHV* xhv;
1581 DEBUG_A(Perl_hv_assert(aTHX_ hv));
1583 xhv = (XPVHV*)SvANY(hv);
1585 if (SvREADONLY(hv) && HvARRAY(hv) != NULL) {
1586 /* restricted hash: convert all keys to placeholders */
1588 for (i = 0; i <= xhv->xhv_max; i++) {
1589 HE *entry = (HvARRAY(hv))[i];
1590 for (; entry; entry = HeNEXT(entry)) {
1591 /* not already placeholder */
1592 if (HeVAL(entry) != &PL_sv_placeholder) {
1593 if (HeVAL(entry) && SvREADONLY(HeVAL(entry))) {
1594 SV* const keysv = hv_iterkeysv(entry);
1596 "Attempt to delete readonly key '%"SVf"' from a restricted hash",
1599 SvREFCNT_dec(HeVAL(entry));
1600 HeVAL(entry) = &PL_sv_placeholder;
1601 HvPLACEHOLDERS(hv)++;
1609 HvPLACEHOLDERS_set(hv, 0);
1611 Zero(HvARRAY(hv), xhv->xhv_max+1 /* HvMAX(hv)+1 */, HE*);
1616 HvHASKFLAGS_off(hv);
1620 HvEITER_set(hv, NULL);
1625 =for apidoc hv_clear_placeholders
1627 Clears any placeholders from a hash. If a restricted hash has any of its keys
1628 marked as readonly and the key is subsequently deleted, the key is not actually
1629 deleted but is marked by assigning it a value of &PL_sv_placeholder. This tags
1630 it so it will be ignored by future operations such as iterating over the hash,
1631 but will still allow the hash to have a value reassigned to the key at some
1632 future point. This function clears any such placeholder keys from the hash.
1633 See Hash::Util::lock_keys() for an example of its use.
1639 Perl_hv_clear_placeholders(pTHX_ HV *hv)
1642 const U32 items = (U32)HvPLACEHOLDERS_get(hv);
1645 clear_placeholders(hv, items);
1649 S_clear_placeholders(pTHX_ HV *hv, U32 items)
1659 /* Loop down the linked list heads */
1661 HE **oentry = &(HvARRAY(hv))[i];
1664 while ((entry = *oentry)) {
1665 if (HeVAL(entry) == &PL_sv_placeholder) {
1666 *oentry = HeNEXT(entry);
1667 if (first && !*oentry)
1668 HvFILL(hv)--; /* This linked list is now empty. */
1669 if (entry == HvEITER_get(hv))
1672 hv_free_ent(hv, entry);
1676 HvTOTALKEYS(hv) -= (IV)HvPLACEHOLDERS_get(hv);
1677 if (HvKEYS(hv) == 0)
1678 HvHASKFLAGS_off(hv);
1679 HvPLACEHOLDERS_set(hv, 0);
1683 oentry = &HeNEXT(entry);
1688 /* You can't get here, hence assertion should always fail. */
1689 assert (items == 0);
1694 S_hfreeentries(pTHX_ HV *hv)
1696 /* This is the array that we're going to restore */
1705 /* If the hash is actually a symbol table with a name, look after the
1707 struct xpvhv_aux *iter = HvAUX(hv);
1709 name = iter->xhv_name;
1710 iter->xhv_name = NULL;
1715 orig_array = HvARRAY(hv);
1716 /* orig_array remains unchanged throughout the loop. If after freeing all
1717 the entries it turns out that one of the little blighters has triggered
1718 an action that has caused HvARRAY to be re-allocated, then we set
1719 array to the new HvARRAY, and try again. */
1722 /* This is the one we're going to try to empty. First time round
1723 it's the original array. (Hopefully there will only be 1 time
1725 HE ** const array = HvARRAY(hv);
1728 /* Because we have taken xhv_name out, the only allocated pointer
1729 in the aux structure that might exist is the backreference array.
1734 struct xpvhv_aux *iter = HvAUX(hv);
1735 /* If there are weak references to this HV, we need to avoid
1736 freeing them up here. In particular we need to keep the AV
1737 visible as what we're deleting might well have weak references
1738 back to this HV, so the for loop below may well trigger
1739 the removal of backreferences from this array. */
1741 if (iter->xhv_backreferences) {
1742 /* So donate them to regular backref magic to keep them safe.
1743 The sv_magic will increase the reference count of the AV,
1744 so we need to drop it first. */
1745 SvREFCNT_dec(iter->xhv_backreferences);
1746 if (AvFILLp(iter->xhv_backreferences) == -1) {
1747 /* Turns out that the array is empty. Just free it. */
1748 SvREFCNT_dec(iter->xhv_backreferences);
1751 sv_magic((SV*)hv, (SV*)iter->xhv_backreferences,
1752 PERL_MAGIC_backref, NULL, 0);
1754 iter->xhv_backreferences = NULL;
1757 entry = iter->xhv_eiter; /* HvEITER(hv) */
1758 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1760 hv_free_ent(hv, entry);
1762 iter->xhv_riter = -1; /* HvRITER(hv) = -1 */
1763 iter->xhv_eiter = NULL; /* HvEITER(hv) = NULL */
1765 /* There are now no allocated pointers in the aux structure. */
1767 SvFLAGS(hv) &= ~SVf_OOK; /* Goodbye, aux structure. */
1768 /* What aux structure? */
1771 /* make everyone else think the array is empty, so that the destructors
1772 * called for freed entries can't recusively mess with us */
1775 ((XPVHV*) SvANY(hv))->xhv_keys = 0;
1779 /* Loop down the linked list heads */
1780 HE *entry = array[i];
1783 register HE * const oentry = entry;
1784 entry = HeNEXT(entry);
1785 hv_free_ent(hv, oentry);
1789 /* As there are no allocated pointers in the aux structure, it's now
1790 safe to free the array we just cleaned up, if it's not the one we're
1791 going to put back. */
1792 if (array != orig_array) {
1797 /* Good. No-one added anything this time round. */
1802 /* Someone attempted to iterate or set the hash name while we had
1803 the array set to 0. We'll catch backferences on the next time
1804 round the while loop. */
1805 assert(HvARRAY(hv));
1807 if (HvAUX(hv)->xhv_name) {
1808 unshare_hek_or_pvn(HvAUX(hv)->xhv_name, 0, 0, 0);
1812 if (--attempts == 0) {
1813 Perl_die(aTHX_ "panic: hfreeentries failed to free hash - something is repeatedly re-creating entries");
1817 HvARRAY(hv) = orig_array;
1819 /* If the hash was actually a symbol table, put the name back. */
1821 /* We have restored the original array. If name is non-NULL, then
1822 the original array had an aux structure at the end. So this is
1824 SvFLAGS(hv) |= SVf_OOK;
1825 HvAUX(hv)->xhv_name = name;
1830 =for apidoc hv_undef
1838 Perl_hv_undef(pTHX_ HV *hv)
1841 register XPVHV* xhv;
1846 DEBUG_A(Perl_hv_assert(aTHX_ hv));
1847 xhv = (XPVHV*)SvANY(hv);
1849 if ((name = HvNAME_get(hv))) {
1851 hv_delete(PL_stashcache, name, HvNAMELEN_get(hv), G_DISCARD);
1852 hv_name_set(hv, NULL, 0, 0);
1854 SvFLAGS(hv) &= ~SVf_OOK;
1855 Safefree(HvARRAY(hv));
1856 xhv->xhv_max = 7; /* HvMAX(hv) = 7 (it's a normal hash) */
1858 HvPLACEHOLDERS_set(hv, 0);
1864 static struct xpvhv_aux*
1865 S_hv_auxinit(HV *hv) {
1866 struct xpvhv_aux *iter;
1870 Newxz(array, PERL_HV_ARRAY_ALLOC_BYTES(HvMAX(hv) + 1)
1871 + sizeof(struct xpvhv_aux), char);
1873 array = (char *) HvARRAY(hv);
1874 Renew(array, PERL_HV_ARRAY_ALLOC_BYTES(HvMAX(hv) + 1)
1875 + sizeof(struct xpvhv_aux), char);
1877 HvARRAY(hv) = (HE**) array;
1878 /* SvOOK_on(hv) attacks the IV flags. */
1879 SvFLAGS(hv) |= SVf_OOK;
1882 iter->xhv_riter = -1; /* HvRITER(hv) = -1 */
1883 iter->xhv_eiter = NULL; /* HvEITER(hv) = NULL */
1885 iter->xhv_backreferences = 0;
1890 =for apidoc hv_iterinit
1892 Prepares a starting point to traverse a hash table. Returns the number of
1893 keys in the hash (i.e. the same as C<HvKEYS(tb)>). The return value is
1894 currently only meaningful for hashes without tie magic.
1896 NOTE: Before version 5.004_65, C<hv_iterinit> used to return the number of
1897 hash buckets that happen to be in use. If you still need that esoteric
1898 value, you can get it through the macro C<HvFILL(tb)>.
1905 Perl_hv_iterinit(pTHX_ HV *hv)
1908 Perl_croak(aTHX_ "Bad hash");
1911 struct xpvhv_aux * const iter = HvAUX(hv);
1912 HE * const entry = iter->xhv_eiter; /* HvEITER(hv) */
1913 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1915 hv_free_ent(hv, entry);
1917 iter->xhv_riter = -1; /* HvRITER(hv) = -1 */
1918 iter->xhv_eiter = NULL; /* HvEITER(hv) = NULL */
1923 /* used to be xhv->xhv_fill before 5.004_65 */
1924 return HvTOTALKEYS(hv);
1928 Perl_hv_riter_p(pTHX_ HV *hv) {
1929 struct xpvhv_aux *iter;
1932 Perl_croak(aTHX_ "Bad hash");
1934 iter = SvOOK(hv) ? HvAUX(hv) : hv_auxinit(hv);
1935 return &(iter->xhv_riter);
1939 Perl_hv_eiter_p(pTHX_ HV *hv) {
1940 struct xpvhv_aux *iter;
1943 Perl_croak(aTHX_ "Bad hash");
1945 iter = SvOOK(hv) ? HvAUX(hv) : hv_auxinit(hv);
1946 return &(iter->xhv_eiter);
1950 Perl_hv_riter_set(pTHX_ HV *hv, I32 riter) {
1951 struct xpvhv_aux *iter;
1954 Perl_croak(aTHX_ "Bad hash");
1962 iter = hv_auxinit(hv);
1964 iter->xhv_riter = riter;
1968 Perl_hv_eiter_set(pTHX_ HV *hv, HE *eiter) {
1969 struct xpvhv_aux *iter;
1972 Perl_croak(aTHX_ "Bad hash");
1977 /* 0 is the default so don't go malloc()ing a new structure just to
1982 iter = hv_auxinit(hv);
1984 iter->xhv_eiter = eiter;
1988 Perl_hv_name_set(pTHX_ HV *hv, const char *name, U32 len, U32 flags)
1991 struct xpvhv_aux *iter;
1994 PERL_UNUSED_ARG(flags);
1997 Perl_croak(aTHX_ "panic: hv name too long (%"UVuf")", (UV) len);
2001 if (iter->xhv_name) {
2002 unshare_hek_or_pvn(iter->xhv_name, 0, 0, 0);
2008 iter = hv_auxinit(hv);
2010 PERL_HASH(hash, name, len);
2011 iter->xhv_name = name ? share_hek(name, len, hash) : 0;
2015 Perl_hv_backreferences_p(pTHX_ HV *hv) {
2016 struct xpvhv_aux * const iter = SvOOK(hv) ? HvAUX(hv) : hv_auxinit(hv);
2017 PERL_UNUSED_CONTEXT;
2018 return &(iter->xhv_backreferences);
2022 Perl_hv_kill_backrefs(pTHX_ HV *hv) {
2028 av = HvAUX(hv)->xhv_backreferences;
2031 HvAUX(hv)->xhv_backreferences = 0;
2032 Perl_sv_kill_backrefs(aTHX_ (SV*) hv, av);
2037 hv_iternext is implemented as a macro in hv.h
2039 =for apidoc hv_iternext
2041 Returns entries from a hash iterator. See C<hv_iterinit>.
2043 You may call C<hv_delete> or C<hv_delete_ent> on the hash entry that the
2044 iterator currently points to, without losing your place or invalidating your
2045 iterator. Note that in this case the current entry is deleted from the hash
2046 with your iterator holding the last reference to it. Your iterator is flagged
2047 to free the entry on the next call to C<hv_iternext>, so you must not discard
2048 your iterator immediately else the entry will leak - call C<hv_iternext> to
2049 trigger the resource deallocation.
2051 =for apidoc hv_iternext_flags
2053 Returns entries from a hash iterator. See C<hv_iterinit> and C<hv_iternext>.
2054 The C<flags> value will normally be zero; if HV_ITERNEXT_WANTPLACEHOLDERS is
2055 set the placeholders keys (for restricted hashes) will be returned in addition
2056 to normal keys. By default placeholders are automatically skipped over.
2057 Currently a placeholder is implemented with a value that is
2058 C<&Perl_sv_placeholder>. Note that the implementation of placeholders and
2059 restricted hashes may change, and the implementation currently is
2060 insufficiently abstracted for any change to be tidy.
2066 Perl_hv_iternext_flags(pTHX_ HV *hv, I32 flags)
2069 register XPVHV* xhv;
2073 struct xpvhv_aux *iter;
2076 Perl_croak(aTHX_ "Bad hash");
2077 xhv = (XPVHV*)SvANY(hv);
2080 /* Too many things (well, pp_each at least) merrily assume that you can
2081 call iv_iternext without calling hv_iterinit, so we'll have to deal
2087 oldentry = entry = iter->xhv_eiter; /* HvEITER(hv) */
2089 if ((mg = SvTIED_mg((SV*)hv, PERL_MAGIC_tied))) {
2090 SV * const key = sv_newmortal();
2092 sv_setsv(key, HeSVKEY_force(entry));
2093 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
2099 /* one HE per MAGICAL hash */
2100 iter->xhv_eiter = entry = new_HE(); /* HvEITER(hv) = new_HE() */
2102 Newxz(k, HEK_BASESIZE + sizeof(SV*), char);
2104 HeKEY_hek(entry) = hek;
2105 HeKLEN(entry) = HEf_SVKEY;
2107 magic_nextpack((SV*) hv,mg,key);
2109 /* force key to stay around until next time */
2110 HeSVKEY_set(entry, SvREFCNT_inc_simple_NN(key));
2111 return entry; /* beware, hent_val is not set */
2114 SvREFCNT_dec(HeVAL(entry));
2115 Safefree(HeKEY_hek(entry));
2117 iter->xhv_eiter = NULL; /* HvEITER(hv) = NULL */
2120 #if defined(DYNAMIC_ENV_FETCH) && !defined(__riscos__) /* set up %ENV for iteration */
2121 if (!entry && SvRMAGICAL((SV*)hv) && mg_find((SV*)hv, PERL_MAGIC_env)) {
2124 /* The prime_env_iter() on VMS just loaded up new hash values
2125 * so the iteration count needs to be reset back to the beginning
2129 oldentry = entry = iter->xhv_eiter; /* HvEITER(hv) */
2134 /* hv_iterint now ensures this. */
2135 assert (HvARRAY(hv));
2137 /* At start of hash, entry is NULL. */
2140 entry = HeNEXT(entry);
2141 if (!(flags & HV_ITERNEXT_WANTPLACEHOLDERS)) {
2143 * Skip past any placeholders -- don't want to include them in
2146 while (entry && HeVAL(entry) == &PL_sv_placeholder) {
2147 entry = HeNEXT(entry);
2152 /* OK. Come to the end of the current list. Grab the next one. */
2154 iter->xhv_riter++; /* HvRITER(hv)++ */
2155 if (iter->xhv_riter > (I32)xhv->xhv_max /* HvRITER(hv) > HvMAX(hv) */) {
2156 /* There is no next one. End of the hash. */
2157 iter->xhv_riter = -1; /* HvRITER(hv) = -1 */
2160 entry = (HvARRAY(hv))[iter->xhv_riter];
2162 if (!(flags & HV_ITERNEXT_WANTPLACEHOLDERS)) {
2163 /* If we have an entry, but it's a placeholder, don't count it.
2165 while (entry && HeVAL(entry) == &PL_sv_placeholder)
2166 entry = HeNEXT(entry);
2168 /* Will loop again if this linked list starts NULL
2169 (for HV_ITERNEXT_WANTPLACEHOLDERS)
2170 or if we run through it and find only placeholders. */
2173 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
2175 hv_free_ent(hv, oldentry);
2178 /*if (HvREHASH(hv) && entry && !HeKREHASH(entry))
2179 PerlIO_printf(PerlIO_stderr(), "Awooga %p %p\n", hv, entry);*/
2181 iter->xhv_eiter = entry; /* HvEITER(hv) = entry */
2186 =for apidoc hv_iterkey
2188 Returns the key from the current position of the hash iterator. See
2195 Perl_hv_iterkey(pTHX_ register HE *entry, I32 *retlen)
2197 if (HeKLEN(entry) == HEf_SVKEY) {
2199 char * const p = SvPV(HeKEY_sv(entry), len);
2204 *retlen = HeKLEN(entry);
2205 return HeKEY(entry);
2209 /* unlike hv_iterval(), this always returns a mortal copy of the key */
2211 =for apidoc hv_iterkeysv
2213 Returns the key as an C<SV*> from the current position of the hash
2214 iterator. The return value will always be a mortal copy of the key. Also
2221 Perl_hv_iterkeysv(pTHX_ register HE *entry)
2223 return sv_2mortal(newSVhek(HeKEY_hek(entry)));
2227 =for apidoc hv_iterval
2229 Returns the value from the current position of the hash iterator. See
2236 Perl_hv_iterval(pTHX_ HV *hv, register HE *entry)
2238 if (SvRMAGICAL(hv)) {
2239 if (mg_find((SV*)hv, PERL_MAGIC_tied)) {
2240 SV* const sv = sv_newmortal();
2241 if (HeKLEN(entry) == HEf_SVKEY)
2242 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
2244 mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
2248 return HeVAL(entry);
2252 =for apidoc hv_iternextsv
2254 Performs an C<hv_iternext>, C<hv_iterkey>, and C<hv_iterval> in one
2261 Perl_hv_iternextsv(pTHX_ HV *hv, char **key, I32 *retlen)
2263 HE * const he = hv_iternext_flags(hv, 0);
2267 *key = hv_iterkey(he, retlen);
2268 return hv_iterval(hv, he);
2275 =for apidoc hv_magic
2277 Adds magic to a hash. See C<sv_magic>.
2282 /* possibly free a shared string if no one has access to it
2283 * len and hash must both be valid for str.
2286 Perl_unsharepvn(pTHX_ const char *str, I32 len, U32 hash)
2288 unshare_hek_or_pvn (NULL, str, len, hash);
2293 Perl_unshare_hek(pTHX_ HEK *hek)
2295 unshare_hek_or_pvn(hek, NULL, 0, 0);
2298 /* possibly free a shared string if no one has access to it
2299 hek if non-NULL takes priority over the other 3, else str, len and hash
2300 are used. If so, len and hash must both be valid for str.
2303 S_unshare_hek_or_pvn(pTHX_ const HEK *hek, const char *str, I32 len, U32 hash)
2306 register XPVHV* xhv;
2308 register HE **oentry;
2310 bool is_utf8 = FALSE;
2312 const char * const save = str;
2313 struct shared_he *he = NULL;
2316 /* Find the shared he which is just before us in memory. */
2317 he = (struct shared_he *)(((char *)hek)
2318 - STRUCT_OFFSET(struct shared_he,
2321 /* Assert that the caller passed us a genuine (or at least consistent)
2323 assert (he->shared_he_he.hent_hek == hek);
2326 if (he->shared_he_he.he_valu.hent_refcount - 1) {
2327 --he->shared_he_he.he_valu.hent_refcount;
2328 UNLOCK_STRTAB_MUTEX;
2331 UNLOCK_STRTAB_MUTEX;
2333 hash = HEK_HASH(hek);
2334 } else if (len < 0) {
2335 STRLEN tmplen = -len;
2337 /* See the note in hv_fetch(). --jhi */
2338 str = (char*)bytes_from_utf8((U8*)str, &tmplen, &is_utf8);
2341 k_flags = HVhek_UTF8;
2343 k_flags |= HVhek_WASUTF8 | HVhek_FREEKEY;
2346 /* what follows was the moral equivalent of:
2347 if ((Svp = hv_fetch(PL_strtab, tmpsv, FALSE, hash))) {
2349 hv_delete(PL_strtab, str, len, G_DISCARD, hash);
2351 xhv = (XPVHV*)SvANY(PL_strtab);
2352 /* assert(xhv_array != 0) */
2354 first = oentry = &(HvARRAY(PL_strtab))[hash & (I32) HvMAX(PL_strtab)];
2356 const HE *const he_he = &(he->shared_he_he);
2357 for (entry = *oentry; entry; oentry = &HeNEXT(entry), entry = *oentry) {
2362 const int flags_masked = k_flags & HVhek_MASK;
2363 for (entry = *oentry; entry; oentry = &HeNEXT(entry), entry = *oentry) {
2364 if (HeHASH(entry) != hash) /* strings can't be equal */
2366 if (HeKLEN(entry) != len)
2368 if (HeKEY(entry) != str && memNE(HeKEY(entry),str,len)) /* is this it? */
2370 if (HeKFLAGS(entry) != flags_masked)
2377 if (--entry->he_valu.hent_refcount == 0) {
2378 *oentry = HeNEXT(entry);
2380 /* There are now no entries in our slot. */
2381 xhv->xhv_fill--; /* HvFILL(hv)-- */
2384 xhv->xhv_keys--; /* HvTOTALKEYS(hv)-- */
2388 UNLOCK_STRTAB_MUTEX;
2389 if (!entry && ckWARN_d(WARN_INTERNAL))
2390 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
2391 "Attempt to free non-existent shared string '%s'%s"
2393 hek ? HEK_KEY(hek) : str,
2394 ((k_flags & HVhek_UTF8) ? " (utf8)" : "") pTHX__VALUE);
2395 if (k_flags & HVhek_FREEKEY)
2399 /* get a (constant) string ptr from the global string table
2400 * string will get added if it is not already there.
2401 * len and hash must both be valid for str.
2404 Perl_share_hek(pTHX_ const char *str, I32 len, register U32 hash)
2406 bool is_utf8 = FALSE;
2408 const char * const save = str;
2411 STRLEN tmplen = -len;
2413 /* See the note in hv_fetch(). --jhi */
2414 str = (char*)bytes_from_utf8((U8*)str, &tmplen, &is_utf8);
2416 /* If we were able to downgrade here, then than means that we were passed
2417 in a key which only had chars 0-255, but was utf8 encoded. */
2420 /* If we found we were able to downgrade the string to bytes, then
2421 we should flag that it needs upgrading on keys or each. Also flag
2422 that we need share_hek_flags to free the string. */
2424 flags |= HVhek_WASUTF8 | HVhek_FREEKEY;
2427 return share_hek_flags (str, len, hash, flags);
2431 S_share_hek_flags(pTHX_ const char *str, I32 len, register U32 hash, int flags)
2435 const int flags_masked = flags & HVhek_MASK;
2436 const U32 hindex = hash & (I32) HvMAX(PL_strtab);
2438 /* what follows is the moral equivalent of:
2440 if (!(Svp = hv_fetch(PL_strtab, str, len, FALSE)))
2441 hv_store(PL_strtab, str, len, NULL, hash);
2443 Can't rehash the shared string table, so not sure if it's worth
2444 counting the number of entries in the linked list
2446 register XPVHV * const xhv = (XPVHV*)SvANY(PL_strtab);
2447 /* assert(xhv_array != 0) */
2449 entry = (HvARRAY(PL_strtab))[hindex];
2450 for (;entry; entry = HeNEXT(entry)) {
2451 if (HeHASH(entry) != hash) /* strings can't be equal */
2453 if (HeKLEN(entry) != len)
2455 if (HeKEY(entry) != str && memNE(HeKEY(entry),str,len)) /* is this it? */
2457 if (HeKFLAGS(entry) != flags_masked)
2463 /* What used to be head of the list.
2464 If this is NULL, then we're the first entry for this slot, which
2465 means we need to increate fill. */
2466 struct shared_he *new_entry;
2469 HE **const head = &HvARRAY(PL_strtab)[hindex];
2470 HE *const next = *head;
2472 /* We don't actually store a HE from the arena and a regular HEK.
2473 Instead we allocate one chunk of memory big enough for both,
2474 and put the HEK straight after the HE. This way we can find the
2475 HEK directly from the HE.
2478 Newx(k, STRUCT_OFFSET(struct shared_he,
2479 shared_he_hek.hek_key[0]) + len + 2, char);
2480 new_entry = (struct shared_he *)k;
2481 entry = &(new_entry->shared_he_he);
2482 hek = &(new_entry->shared_he_hek);
2484 Copy(str, HEK_KEY(hek), len, char);
2485 HEK_KEY(hek)[len] = 0;
2487 HEK_HASH(hek) = hash;
2488 HEK_FLAGS(hek) = (unsigned char)flags_masked;
2490 /* Still "point" to the HEK, so that other code need not know what
2492 HeKEY_hek(entry) = hek;
2493 entry->he_valu.hent_refcount = 0;
2494 HeNEXT(entry) = next;
2497 xhv->xhv_keys++; /* HvTOTALKEYS(hv)++ */
2498 if (!next) { /* initial entry? */
2499 xhv->xhv_fill++; /* HvFILL(hv)++ */
2500 } else if (xhv->xhv_keys > (IV)xhv->xhv_max /* HvKEYS(hv) > HvMAX(hv) */) {
2505 ++entry->he_valu.hent_refcount;
2506 UNLOCK_STRTAB_MUTEX;
2508 if (flags & HVhek_FREEKEY)
2511 return HeKEY_hek(entry);
2515 Perl_hv_placeholders_p(pTHX_ HV *hv)
2518 MAGIC *mg = mg_find((SV*)hv, PERL_MAGIC_rhash);
2521 mg = sv_magicext((SV*)hv, 0, PERL_MAGIC_rhash, 0, 0, 0);
2524 Perl_die(aTHX_ "panic: hv_placeholders_p");
2527 return &(mg->mg_len);
2532 Perl_hv_placeholders_get(pTHX_ HV *hv)
2535 MAGIC * const mg = mg_find((SV*)hv, PERL_MAGIC_rhash);
2537 return mg ? mg->mg_len : 0;
2541 Perl_hv_placeholders_set(pTHX_ HV *hv, I32 ph)
2544 MAGIC * const mg = mg_find((SV*)hv, PERL_MAGIC_rhash);
2549 if (!sv_magicext((SV*)hv, 0, PERL_MAGIC_rhash, 0, 0, ph))
2550 Perl_die(aTHX_ "panic: hv_placeholders_set");
2552 /* else we don't need to add magic to record 0 placeholders. */
2556 =for apidoc refcounted_he_chain_2hv
2558 Generates an returns a C<HV *> by walking up the tree starting at the passed
2559 in C<struct refcounted_he *>.
2564 Perl_refcounted_he_chain_2hv(pTHX_ const struct refcounted_he *chain)
2568 U32 placeholders = 0;
2569 /* We could chase the chain once to get an idea of the number of keys,
2570 and call ksplit. But for now we'll make a potentially inefficient
2571 hash with only 8 entries in its array. */
2572 const U32 max = HvMAX(hv);
2576 Newxz(array, PERL_HV_ARRAY_ALLOC_BYTES(max + 1), char);
2577 HvARRAY(hv) = (HE**)array;
2582 U32 hash = chain->refcounted_he_hash;
2584 U32 hash = HEK_HASH(chain->refcounted_he_hek);
2586 HE **oentry = &((HvARRAY(hv))[hash & max]);
2587 HE *entry = *oentry;
2590 for (; entry; entry = HeNEXT(entry)) {
2591 if (HeHASH(entry) == hash) {
2600 = share_hek_flags(/* A big expression to find the key offset */
2601 (((chain->refcounted_he_data[0]
2602 & HVrhek_typemask) == HVrhek_PV)
2603 ? chain->refcounted_he_val.refcounted_he_u_len
2604 + 1 : 0) + 1 + chain->refcounted_he_data,
2605 chain->refcounted_he_keylen,
2606 chain->refcounted_he_hash,
2607 (chain->refcounted_he_data[0]
2608 & (HVhek_UTF8|HVhek_WASUTF8)));
2610 HeKEY_hek(entry) = share_hek_hek(chain->refcounted_he_hek);
2613 switch(chain->refcounted_he_data[0] & HVrhek_typemask) {
2618 value = &PL_sv_placeholder;
2622 value = (chain->refcounted_he_data[0] & HVrhek_UV)
2623 ? newSVuv(chain->refcounted_he_val.refcounted_he_u_iv)
2624 : newSViv(chain->refcounted_he_val.refcounted_he_u_uv);
2627 /* Create a string SV that directly points to the bytes in our
2630 sv_upgrade(value, SVt_PV);
2631 SvPV_set(value, (char *) chain->refcounted_he_data + 1);
2632 SvCUR_set(value, chain->refcounted_he_val.refcounted_he_u_len);
2633 /* This stops anything trying to free it */
2634 SvLEN_set(value, 0);
2636 SvREADONLY_on(value);
2637 if (chain->refcounted_he_data[0] & HVrhek_UTF8)
2641 Perl_croak(aTHX_ "panic: refcounted_he_chain_2hv bad flags %x",
2642 chain->refcounted_he_data[0]);
2644 HeVAL(entry) = value;
2646 /* Link it into the chain. */
2647 HeNEXT(entry) = *oentry;
2648 if (!HeNEXT(entry)) {
2649 /* initial entry. */
2657 chain = chain->refcounted_he_next;
2661 clear_placeholders(hv, placeholders);
2662 HvTOTALKEYS(hv) -= placeholders;
2665 /* We could check in the loop to see if we encounter any keys with key
2666 flags, but it's probably not worth it, as this per-hash flag is only
2667 really meant as an optimisation for things like Storable. */
2669 DEBUG_A(Perl_hv_assert(aTHX_ hv));
2675 =for apidoc refcounted_he_new
2677 Creates a new C<struct refcounted_he>. Assumes ownership of one reference
2678 to I<value>. As S<key> is copied into a shared hash key, all references remain
2679 the property of the caller. The C<struct refcounted_he> is returned with a
2680 reference count of 1.
2685 struct refcounted_he *
2686 Perl_refcounted_he_new(pTHX_ struct refcounted_he *const parent,
2687 SV *const key, SV *const value) {
2689 struct refcounted_he *he;
2691 const char *key_p = SvPV_const(key, key_len);
2692 STRLEN value_len = 0;
2693 const char *value_p = NULL;
2698 bool is_utf8 = SvUTF8(key);
2701 value_type = HVrhek_PV;
2702 } else if (SvIOK(value)) {
2703 value_type = HVrhek_IV;
2704 } else if (value == &PL_sv_placeholder) {
2705 value_type = HVrhek_delete;
2706 } else if (!SvOK(value)) {
2707 value_type = HVrhek_undef;
2709 value_type = HVrhek_PV;
2712 if (value_type == HVrhek_PV) {
2713 value_p = SvPV_const(value, value_len);
2714 key_offset = value_len + 2;
2722 he = PerlMemShared_malloc(sizeof(struct refcounted_he) - 1
2726 he = PerlMemShared_malloc(sizeof(struct refcounted_he) - 1
2731 he->refcounted_he_next = parent;
2733 if (value_type == HVrhek_PV) {
2734 Copy(value_p, he->refcounted_he_data + 1, value_len + 1, char);
2735 he->refcounted_he_val.refcounted_he_u_len = value_len;
2736 if (SvUTF8(value)) {
2737 flags |= HVrhek_UTF8;
2739 } else if (value_type == HVrhek_IV) {
2741 he->refcounted_he_val.refcounted_he_u_uv = SvUVX(value);
2744 he->refcounted_he_val.refcounted_he_u_iv = SvIVX(value);
2749 /* Hash keys are always stored normalised to (yes) ISO-8859-1.
2750 As we're going to be building hash keys from this value in future,
2751 normalise it now. */
2752 key_p = (char*)bytes_from_utf8((const U8*)key_p, &key_len, &is_utf8);
2753 flags |= is_utf8 ? HVhek_UTF8 : HVhek_WASUTF8;
2755 PERL_HASH(hash, key_p, key_len);
2758 he->refcounted_he_hash = hash;
2759 he->refcounted_he_keylen = key_len;
2760 Copy(key_p, he->refcounted_he_data + key_offset, key_len, char);
2762 he->refcounted_he_hek = share_hek_flags(key_p, key_len, hash, flags);
2765 if (flags & HVhek_WASUTF8) {
2766 /* If it was downgraded from UTF-8, then the pointer returned from
2767 bytes_from_utf8 is an allocated pointer that we must free. */
2771 he->refcounted_he_data[0] = flags;
2772 he->refcounted_he_refcnt = 1;
2778 =for apidoc refcounted_he_free
2780 Decrements the reference count of the passed in C<struct refcounted_he *>
2781 by one. If the reference count reaches zero the structure's memory is freed,
2782 and C<refcounted_he_free> iterates onto the parent node.
2788 Perl_refcounted_he_free(pTHX_ struct refcounted_he *he) {
2789 PERL_UNUSED_CONTEXT;
2792 struct refcounted_he *copy;
2796 new_count = --he->refcounted_he_refcnt;
2797 HINTS_REFCNT_UNLOCK;
2803 #ifndef USE_ITHREADS
2804 unshare_hek_or_pvn (he->refcounted_he_hek, 0, 0, 0);
2807 he = he->refcounted_he_next;
2808 PerlMemShared_free(copy);
2813 =for apidoc hv_assert
2815 Check that a hash is in an internally consistent state.
2823 Perl_hv_assert(pTHX_ HV *hv)
2828 int placeholders = 0;
2831 const I32 riter = HvRITER_get(hv);
2832 HE *eiter = HvEITER_get(hv);
2834 (void)hv_iterinit(hv);
2836 while ((entry = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS))) {
2837 /* sanity check the values */
2838 if (HeVAL(entry) == &PL_sv_placeholder)
2842 /* sanity check the keys */
2843 if (HeSVKEY(entry)) {
2844 NOOP; /* Don't know what to check on SV keys. */
2845 } else if (HeKUTF8(entry)) {
2847 if (HeKWASUTF8(entry)) {
2848 PerlIO_printf(Perl_debug_log,
2849 "hash key has both WASUFT8 and UTF8: '%.*s'\n",
2850 (int) HeKLEN(entry), HeKEY(entry));
2853 } else if (HeKWASUTF8(entry))
2856 if (!SvTIED_mg((SV*)hv, PERL_MAGIC_tied)) {
2857 static const char bad_count[] = "Count %d %s(s), but hash reports %d\n";
2858 const int nhashkeys = HvUSEDKEYS(hv);
2859 const int nhashplaceholders = HvPLACEHOLDERS_get(hv);
2861 if (nhashkeys != real) {
2862 PerlIO_printf(Perl_debug_log, bad_count, real, "keys", nhashkeys );
2865 if (nhashplaceholders != placeholders) {
2866 PerlIO_printf(Perl_debug_log, bad_count, placeholders, "placeholder", nhashplaceholders );
2870 if (withflags && ! HvHASKFLAGS(hv)) {
2871 PerlIO_printf(Perl_debug_log,
2872 "Hash has HASKFLAGS off but I count %d key(s) with flags\n",
2879 HvRITER_set(hv, riter); /* Restore hash iterator state */
2880 HvEITER_set(hv, eiter);
2887 * c-indentation-style: bsd
2889 * indent-tabs-mode: t
2892 * ex: set ts=8 sts=4 sw=4 noet: