3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "I sit beside the fire and think of all that I have seen." --Bilbo
26 PL_he_root = HeNEXT(he);
35 HeNEXT(p) = (HE*)PL_he_root;
46 New(54, ptr, 1008/sizeof(XPV), XPV);
47 ptr->xpv_pv = (char*)PL_he_arenaroot;
48 PL_he_arenaroot = ptr;
51 heend = &he[1008 / sizeof(HE) - 1];
54 HeNEXT(he) = (HE*)(he + 1);
62 #define new_HE() (HE*)safemalloc(sizeof(HE))
63 #define del_HE(p) safefree((char*)p)
67 #define new_HE() new_he()
68 #define del_HE(p) del_he(p)
73 S_save_hek(pTHX_ const char *str, I32 len, U32 hash)
78 New(54, k, HEK_BASESIZE + len + 1, char);
80 Copy(str, HEK_KEY(hek), len, char);
81 *(HEK_KEY(hek) + len) = '\0';
88 Perl_unshare_hek(pTHX_ HEK *hek)
90 unsharepvn(HEK_KEY(hek),HEK_LEN(hek),HEK_HASH(hek));
93 #if defined(USE_ITHREADS)
95 Perl_he_dup(pTHX_ HE *e, bool shared)
101 /* look for it in the table first */
102 ret = (HE*)ptr_table_fetch(PL_ptr_table, e);
106 /* create anew and remember what it is */
108 ptr_table_store(PL_ptr_table, e, ret);
110 HeNEXT(ret) = he_dup(HeNEXT(e),shared);
111 if (HeKLEN(e) == HEf_SVKEY)
112 HeKEY_sv(ret) = SvREFCNT_inc(sv_dup(HeKEY_sv(e)));
114 HeKEY_hek(ret) = share_hek(HeKEY(e), HeKLEN(e), HeHASH(e));
116 HeKEY_hek(ret) = save_hek(HeKEY(e), HeKLEN(e), HeHASH(e));
117 HeVAL(ret) = SvREFCNT_inc(sv_dup(HeVAL(e)));
120 #endif /* USE_ITHREADS */
122 /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot
128 Returns the SV which corresponds to the specified key in the hash. The
129 C<klen> is the length of the key. If C<lval> is set then the fetch will be
130 part of a store. Check that the return value is non-null before
131 dereferencing it to a C<SV*>.
133 See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more
134 information on how to use this function on tied hashes.
140 Perl_hv_fetch(pTHX_ HV *hv, const char *key, U32 klen, I32 lval)
150 if (SvRMAGICAL(hv)) {
151 if (mg_find((SV*)hv,'P')) {
153 mg_copy((SV*)hv, sv, key, klen);
155 return &PL_hv_fetch_sv;
157 #ifdef ENV_IS_CASELESS
158 else if (mg_find((SV*)hv,'E')) {
160 for (i = 0; i < klen; ++i)
161 if (isLOWER(key[i])) {
162 char *nkey = strupr(SvPVX(sv_2mortal(newSVpvn(key,klen))));
163 SV **ret = hv_fetch(hv, nkey, klen, 0);
165 ret = hv_store(hv, key, klen, NEWSV(61,0), 0);
172 xhv = (XPVHV*)SvANY(hv);
173 if (!xhv->xhv_array) {
175 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
176 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
179 Newz(503, xhv->xhv_array,
180 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
185 PERL_HASH(hash, key, klen);
187 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
188 for (; entry; entry = HeNEXT(entry)) {
189 if (HeHASH(entry) != hash) /* strings can't be equal */
191 if (HeKLEN(entry) != klen)
193 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
195 return &HeVAL(entry);
197 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
198 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
200 char *env = PerlEnv_ENVgetenv_len(key,&len);
202 sv = newSVpvn(env,len);
204 return hv_store(hv,key,klen,sv,hash);
208 if (lval) { /* gonna assign to this, so it better be there */
210 return hv_store(hv,key,klen,sv,hash);
215 /* returns a HE * structure with the all fields set */
216 /* note that hent_val will be a mortal sv for MAGICAL hashes */
218 =for apidoc hv_fetch_ent
220 Returns the hash entry which corresponds to the specified key in the hash.
221 C<hash> must be a valid precomputed hash number for the given C<key>, or 0
222 if you want the function to compute it. IF C<lval> is set then the fetch
223 will be part of a store. Make sure the return value is non-null before
224 accessing it. The return value when C<tb> is a tied hash is a pointer to a
225 static location, so be sure to make a copy of the structure if you need to
228 See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more
229 information on how to use this function on tied hashes.
235 Perl_hv_fetch_ent(pTHX_ HV *hv, SV *keysv, I32 lval, register U32 hash)
246 if (SvRMAGICAL(hv)) {
247 if (mg_find((SV*)hv,'P')) {
249 keysv = sv_2mortal(newSVsv(keysv));
250 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
251 if (!HeKEY_hek(&PL_hv_fetch_ent_mh)) {
253 New(54, k, HEK_BASESIZE + sizeof(SV*), char);
254 HeKEY_hek(&PL_hv_fetch_ent_mh) = (HEK*)k;
256 HeSVKEY_set(&PL_hv_fetch_ent_mh, keysv);
257 HeVAL(&PL_hv_fetch_ent_mh) = sv;
258 return &PL_hv_fetch_ent_mh;
260 #ifdef ENV_IS_CASELESS
261 else if (mg_find((SV*)hv,'E')) {
263 key = SvPV(keysv, klen);
264 for (i = 0; i < klen; ++i)
265 if (isLOWER(key[i])) {
266 SV *nkeysv = sv_2mortal(newSVpvn(key,klen));
267 (void)strupr(SvPVX(nkeysv));
268 entry = hv_fetch_ent(hv, nkeysv, 0, 0);
270 entry = hv_store_ent(hv, keysv, NEWSV(61,0), hash);
277 xhv = (XPVHV*)SvANY(hv);
278 if (!xhv->xhv_array) {
280 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
281 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
284 Newz(503, xhv->xhv_array,
285 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
290 key = SvPV(keysv, klen);
293 PERL_HASH(hash, key, klen);
295 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
296 for (; entry; entry = HeNEXT(entry)) {
297 if (HeHASH(entry) != hash) /* strings can't be equal */
299 if (HeKLEN(entry) != klen)
301 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
305 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
306 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
308 char *env = PerlEnv_ENVgetenv_len(key,&len);
310 sv = newSVpvn(env,len);
312 return hv_store_ent(hv,keysv,sv,hash);
316 if (lval) { /* gonna assign to this, so it better be there */
318 return hv_store_ent(hv,keysv,sv,hash);
324 S_hv_magic_check(pTHX_ HV *hv, bool *needs_copy, bool *needs_store)
326 MAGIC *mg = SvMAGIC(hv);
330 if (isUPPER(mg->mg_type)) {
332 switch (mg->mg_type) {
335 *needs_store = FALSE;
338 mg = mg->mg_moremagic;
345 Stores an SV in a hash. The hash key is specified as C<key> and C<klen> is
346 the length of the key. The C<hash> parameter is the precomputed hash
347 value; if it is zero then Perl will compute it. The return value will be
348 NULL if the operation failed or if the value did not need to be actually
349 stored within the hash (as in the case of tied hashes). Otherwise it can
350 be dereferenced to get the original C<SV*>. Note that the caller is
351 responsible for suitably incrementing the reference count of C<val> before
352 the call, and decrementing it if the function returned NULL.
354 See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more
355 information on how to use this function on tied hashes.
361 Perl_hv_store(pTHX_ HV *hv, const char *key, U32 klen, SV *val, register U32 hash)
366 register HE **oentry;
371 xhv = (XPVHV*)SvANY(hv);
375 hv_magic_check (hv, &needs_copy, &needs_store);
377 mg_copy((SV*)hv, val, key, klen);
378 if (!xhv->xhv_array && !needs_store)
380 #ifdef ENV_IS_CASELESS
381 else if (mg_find((SV*)hv,'E')) {
382 SV *sv = sv_2mortal(newSVpvn(key,klen));
383 key = strupr(SvPVX(sv));
390 PERL_HASH(hash, key, klen);
393 Newz(505, xhv->xhv_array,
394 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
396 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
399 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
400 if (HeHASH(entry) != hash) /* strings can't be equal */
402 if (HeKLEN(entry) != klen)
404 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
406 SvREFCNT_dec(HeVAL(entry));
408 return &HeVAL(entry);
413 HeKEY_hek(entry) = share_hek(key, klen, hash);
414 else /* gotta do the real thing */
415 HeKEY_hek(entry) = save_hek(key, klen, hash);
417 HeNEXT(entry) = *oentry;
421 if (i) { /* initial entry? */
423 if (xhv->xhv_keys > xhv->xhv_max)
427 return &HeVAL(entry);
431 =for apidoc hv_store_ent
433 Stores C<val> in a hash. The hash key is specified as C<key>. The C<hash>
434 parameter is the precomputed hash value; if it is zero then Perl will
435 compute it. The return value is the new hash entry so created. It will be
436 NULL if the operation failed or if the value did not need to be actually
437 stored within the hash (as in the case of tied hashes). Otherwise the
438 contents of the return value can be accessed using the C<He???> macros
439 described here. Note that the caller is responsible for suitably
440 incrementing the reference count of C<val> before the call, and
441 decrementing it if the function returned NULL.
443 See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more
444 information on how to use this function on tied hashes.
450 Perl_hv_store_ent(pTHX_ HV *hv, SV *keysv, SV *val, register U32 hash)
457 register HE **oentry;
462 xhv = (XPVHV*)SvANY(hv);
466 hv_magic_check (hv, &needs_copy, &needs_store);
468 bool save_taint = PL_tainted;
470 PL_tainted = SvTAINTED(keysv);
471 keysv = sv_2mortal(newSVsv(keysv));
472 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
473 TAINT_IF(save_taint);
474 if (!xhv->xhv_array && !needs_store)
476 #ifdef ENV_IS_CASELESS
477 else if (mg_find((SV*)hv,'E')) {
478 key = SvPV(keysv, klen);
479 keysv = sv_2mortal(newSVpvn(key,klen));
480 (void)strupr(SvPVX(keysv));
487 key = SvPV(keysv, klen);
490 PERL_HASH(hash, key, klen);
493 Newz(505, xhv->xhv_array,
494 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
496 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
499 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
500 if (HeHASH(entry) != hash) /* strings can't be equal */
502 if (HeKLEN(entry) != klen)
504 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
506 SvREFCNT_dec(HeVAL(entry));
513 HeKEY_hek(entry) = share_hek(key, klen, hash);
514 else /* gotta do the real thing */
515 HeKEY_hek(entry) = save_hek(key, klen, hash);
517 HeNEXT(entry) = *oentry;
521 if (i) { /* initial entry? */
523 if (xhv->xhv_keys > xhv->xhv_max)
531 =for apidoc hv_delete
533 Deletes a key/value pair in the hash. The value SV is removed from the
534 hash and returned to the caller. The C<klen> is the length of the key.
535 The C<flags> value will normally be zero; if set to G_DISCARD then NULL
542 Perl_hv_delete(pTHX_ HV *hv, const char *key, U32 klen, I32 flags)
548 register HE **oentry;
554 if (SvRMAGICAL(hv)) {
557 hv_magic_check (hv, &needs_copy, &needs_store);
559 if (needs_copy && (svp = hv_fetch(hv, key, klen, TRUE))) {
563 if (mg_find(sv, 'p')) {
564 sv_unmagic(sv, 'p'); /* No longer an element */
567 return Nullsv; /* element cannot be deleted */
569 #ifdef ENV_IS_CASELESS
570 else if (mg_find((SV*)hv,'E')) {
571 sv = sv_2mortal(newSVpvn(key,klen));
572 key = strupr(SvPVX(sv));
577 xhv = (XPVHV*)SvANY(hv);
581 PERL_HASH(hash, key, klen);
583 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
586 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
587 if (HeHASH(entry) != hash) /* strings can't be equal */
589 if (HeKLEN(entry) != klen)
591 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
593 *oentry = HeNEXT(entry);
596 if (flags & G_DISCARD)
599 sv = sv_2mortal(HeVAL(entry));
600 HeVAL(entry) = &PL_sv_undef;
602 if (entry == xhv->xhv_eiter)
605 hv_free_ent(hv, entry);
613 =for apidoc hv_delete_ent
615 Deletes a key/value pair in the hash. The value SV is removed from the
616 hash and returned to the caller. The C<flags> value will normally be zero;
617 if set to G_DISCARD then NULL will be returned. C<hash> can be a valid
618 precomputed hash value, or 0 to ask for it to be computed.
624 Perl_hv_delete_ent(pTHX_ HV *hv, SV *keysv, I32 flags, U32 hash)
631 register HE **oentry;
636 if (SvRMAGICAL(hv)) {
639 hv_magic_check (hv, &needs_copy, &needs_store);
641 if (needs_copy && (entry = hv_fetch_ent(hv, keysv, TRUE, hash))) {
645 if (mg_find(sv, 'p')) {
646 sv_unmagic(sv, 'p'); /* No longer an element */
649 return Nullsv; /* element cannot be deleted */
651 #ifdef ENV_IS_CASELESS
652 else if (mg_find((SV*)hv,'E')) {
653 key = SvPV(keysv, klen);
654 keysv = sv_2mortal(newSVpvn(key,klen));
655 (void)strupr(SvPVX(keysv));
661 xhv = (XPVHV*)SvANY(hv);
665 key = SvPV(keysv, klen);
668 PERL_HASH(hash, key, klen);
670 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
673 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
674 if (HeHASH(entry) != hash) /* strings can't be equal */
676 if (HeKLEN(entry) != klen)
678 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
680 *oentry = HeNEXT(entry);
683 if (flags & G_DISCARD)
686 sv = sv_2mortal(HeVAL(entry));
687 HeVAL(entry) = &PL_sv_undef;
689 if (entry == xhv->xhv_eiter)
692 hv_free_ent(hv, entry);
700 =for apidoc hv_exists
702 Returns a boolean indicating whether the specified hash key exists. The
703 C<klen> is the length of the key.
709 Perl_hv_exists(pTHX_ HV *hv, const char *key, U32 klen)
719 if (SvRMAGICAL(hv)) {
720 if (mg_find((SV*)hv,'P')) {
722 mg_copy((SV*)hv, sv, key, klen);
723 magic_existspack(sv, mg_find(sv, 'p'));
726 #ifdef ENV_IS_CASELESS
727 else if (mg_find((SV*)hv,'E')) {
728 sv = sv_2mortal(newSVpvn(key,klen));
729 key = strupr(SvPVX(sv));
734 xhv = (XPVHV*)SvANY(hv);
735 #ifndef DYNAMIC_ENV_FETCH
740 PERL_HASH(hash, key, klen);
742 #ifdef DYNAMIC_ENV_FETCH
743 if (!xhv->xhv_array) entry = Null(HE*);
746 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
747 for (; entry; entry = HeNEXT(entry)) {
748 if (HeHASH(entry) != hash) /* strings can't be equal */
750 if (HeKLEN(entry) != klen)
752 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
756 #ifdef DYNAMIC_ENV_FETCH /* is it out there? */
757 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME)) {
759 char *env = PerlEnv_ENVgetenv_len(key,&len);
761 sv = newSVpvn(env,len);
763 (void)hv_store(hv,key,klen,sv,hash);
773 =for apidoc hv_exists_ent
775 Returns a boolean indicating whether the specified hash key exists. C<hash>
776 can be a valid precomputed hash value, or 0 to ask for it to be
783 Perl_hv_exists_ent(pTHX_ HV *hv, SV *keysv, U32 hash)
794 if (SvRMAGICAL(hv)) {
795 if (mg_find((SV*)hv,'P')) {
797 keysv = sv_2mortal(newSVsv(keysv));
798 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
799 magic_existspack(sv, mg_find(sv, 'p'));
802 #ifdef ENV_IS_CASELESS
803 else if (mg_find((SV*)hv,'E')) {
804 key = SvPV(keysv, klen);
805 keysv = sv_2mortal(newSVpvn(key,klen));
806 (void)strupr(SvPVX(keysv));
812 xhv = (XPVHV*)SvANY(hv);
813 #ifndef DYNAMIC_ENV_FETCH
818 key = SvPV(keysv, klen);
820 PERL_HASH(hash, key, klen);
822 #ifdef DYNAMIC_ENV_FETCH
823 if (!xhv->xhv_array) entry = Null(HE*);
826 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
827 for (; entry; entry = HeNEXT(entry)) {
828 if (HeHASH(entry) != hash) /* strings can't be equal */
830 if (HeKLEN(entry) != klen)
832 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
836 #ifdef DYNAMIC_ENV_FETCH /* is it out there? */
837 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME)) {
839 char *env = PerlEnv_ENVgetenv_len(key,&len);
841 sv = newSVpvn(env,len);
843 (void)hv_store_ent(hv,keysv,sv,hash);
852 S_hsplit(pTHX_ HV *hv)
854 register XPVHV* xhv = (XPVHV*)SvANY(hv);
855 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
856 register I32 newsize = oldsize * 2;
858 register char *a = xhv->xhv_array;
862 register HE **oentry;
865 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
866 Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
872 #define MALLOC_OVERHEAD 16
873 New(2, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
878 Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char);
880 offer_nice_chunk(xhv->xhv_array, PERL_HV_ARRAY_ALLOC_BYTES(oldsize));
883 Safefree(xhv->xhv_array);
887 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
888 xhv->xhv_max = --newsize;
892 for (i=0; i<oldsize; i++,aep++) {
893 if (!*aep) /* non-existent */
896 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
897 if ((HeHASH(entry) & newsize) != i) {
898 *oentry = HeNEXT(entry);
899 HeNEXT(entry) = *bep;
906 oentry = &HeNEXT(entry);
908 if (!*aep) /* everything moved */
914 Perl_hv_ksplit(pTHX_ HV *hv, IV newmax)
916 register XPVHV* xhv = (XPVHV*)SvANY(hv);
917 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
918 register I32 newsize;
924 register HE **oentry;
926 newsize = (I32) newmax; /* possible truncation here */
927 if (newsize != newmax || newmax <= oldsize)
929 while ((newsize & (1 + ~newsize)) != newsize) {
930 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
932 if (newsize < newmax)
934 if (newsize < newmax)
935 return; /* overflow detection */
940 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
941 Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
947 New(2, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
952 Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char);
954 offer_nice_chunk(xhv->xhv_array, PERL_HV_ARRAY_ALLOC_BYTES(oldsize));
957 Safefree(xhv->xhv_array);
960 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
963 Newz(0, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
965 xhv->xhv_max = --newsize;
967 if (!xhv->xhv_fill) /* skip rest if no entries */
971 for (i=0; i<oldsize; i++,aep++) {
972 if (!*aep) /* non-existent */
974 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
975 if ((j = (HeHASH(entry) & newsize)) != i) {
977 *oentry = HeNEXT(entry);
978 if (!(HeNEXT(entry) = aep[j]))
984 oentry = &HeNEXT(entry);
986 if (!*aep) /* everything moved */
994 Creates a new HV. The reference count is set to 1.
1003 register XPVHV* xhv;
1005 hv = (HV*)NEWSV(502,0);
1006 sv_upgrade((SV *)hv, SVt_PVHV);
1007 xhv = (XPVHV*)SvANY(hv);
1010 #ifndef NODEFAULT_SHAREKEYS
1011 HvSHAREKEYS_on(hv); /* key-sharing on by default */
1013 xhv->xhv_max = 7; /* start with 8 buckets */
1015 xhv->xhv_pmroot = 0;
1016 (void)hv_iterinit(hv); /* so each() will start off right */
1021 Perl_newHVhv(pTHX_ HV *ohv)
1024 STRLEN hv_max = ohv ? HvMAX(ohv) : 0;
1025 STRLEN hv_fill = ohv ? HvFILL(ohv) : 0;
1028 while (hv_max && hv_max + 1 >= hv_fill * 2)
1029 hv_max = hv_max / 2; /* Is always 2^n-1 */
1035 if (! SvTIED_mg((SV*)ohv, 'P')) {
1042 I32 hv_riter = HvRITER(ohv); /* current root of iterator */
1043 HE *hv_eiter = HvEITER(ohv); /* current entry of iterator */
1047 while ((entry = hv_iternext(ohv))) {
1048 hv_store(hv, HeKEY(entry), HeKLEN(entry),
1049 newSVsv(HeVAL(entry)), HeHASH(entry));
1051 HvRITER(ohv) = hv_riter;
1052 HvEITER(ohv) = hv_eiter;
1059 Perl_hv_free_ent(pTHX_ HV *hv, register HE *entry)
1066 if (val && isGV(val) && GvCVu(val) && HvNAME(hv))
1067 PL_sub_generation++; /* may be deletion of method from stash */
1069 if (HeKLEN(entry) == HEf_SVKEY) {
1070 SvREFCNT_dec(HeKEY_sv(entry));
1071 Safefree(HeKEY_hek(entry));
1073 else if (HvSHAREKEYS(hv))
1074 unshare_hek(HeKEY_hek(entry));
1076 Safefree(HeKEY_hek(entry));
1081 Perl_hv_delayfree_ent(pTHX_ HV *hv, register HE *entry)
1085 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
1086 PL_sub_generation++; /* may be deletion of method from stash */
1087 sv_2mortal(HeVAL(entry)); /* free between statements */
1088 if (HeKLEN(entry) == HEf_SVKEY) {
1089 sv_2mortal(HeKEY_sv(entry));
1090 Safefree(HeKEY_hek(entry));
1092 else if (HvSHAREKEYS(hv))
1093 unshare_hek(HeKEY_hek(entry));
1095 Safefree(HeKEY_hek(entry));
1100 =for apidoc hv_clear
1102 Clears a hash, making it empty.
1108 Perl_hv_clear(pTHX_ HV *hv)
1110 register XPVHV* xhv;
1113 xhv = (XPVHV*)SvANY(hv);
1118 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
1125 S_hfreeentries(pTHX_ HV *hv)
1127 register HE **array;
1129 register HE *oentry = Null(HE*);
1140 array = HvARRAY(hv);
1145 entry = HeNEXT(entry);
1146 hv_free_ent(hv, oentry);
1151 entry = array[riter];
1154 (void)hv_iterinit(hv);
1158 =for apidoc hv_undef
1166 Perl_hv_undef(pTHX_ HV *hv)
1168 register XPVHV* xhv;
1171 xhv = (XPVHV*)SvANY(hv);
1173 Safefree(xhv->xhv_array);
1175 Safefree(HvNAME(hv));
1179 xhv->xhv_max = 7; /* it's a normal hash */
1188 =for apidoc hv_iterinit
1190 Prepares a starting point to traverse a hash table. Returns the number of
1191 keys in the hash (i.e. the same as C<HvKEYS(tb)>). The return value is
1192 currently only meaningful for hashes without tie magic.
1194 NOTE: Before version 5.004_65, C<hv_iterinit> used to return the number of
1195 hash buckets that happen to be in use. If you still need that esoteric
1196 value, you can get it through the macro C<HvFILL(tb)>.
1202 Perl_hv_iterinit(pTHX_ HV *hv)
1204 register XPVHV* xhv;
1208 Perl_croak(aTHX_ "Bad hash");
1209 xhv = (XPVHV*)SvANY(hv);
1210 entry = xhv->xhv_eiter;
1211 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1213 hv_free_ent(hv, entry);
1215 xhv->xhv_riter = -1;
1216 xhv->xhv_eiter = Null(HE*);
1217 return xhv->xhv_keys; /* used to be xhv->xhv_fill before 5.004_65 */
1221 =for apidoc hv_iternext
1223 Returns entries from a hash iterator. See C<hv_iterinit>.
1229 Perl_hv_iternext(pTHX_ HV *hv)
1231 register XPVHV* xhv;
1237 Perl_croak(aTHX_ "Bad hash");
1238 xhv = (XPVHV*)SvANY(hv);
1239 oldentry = entry = xhv->xhv_eiter;
1241 if ((mg = SvTIED_mg((SV*)hv, 'P'))) {
1242 SV *key = sv_newmortal();
1244 sv_setsv(key, HeSVKEY_force(entry));
1245 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
1251 xhv->xhv_eiter = entry = new_HE(); /* one HE per MAGICAL hash */
1253 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
1255 HeKEY_hek(entry) = hek;
1256 HeKLEN(entry) = HEf_SVKEY;
1258 magic_nextpack((SV*) hv,mg,key);
1260 /* force key to stay around until next time */
1261 HeSVKEY_set(entry, SvREFCNT_inc(key));
1262 return entry; /* beware, hent_val is not set */
1265 SvREFCNT_dec(HeVAL(entry));
1266 Safefree(HeKEY_hek(entry));
1268 xhv->xhv_eiter = Null(HE*);
1271 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
1272 if (!entry && HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
1276 if (!xhv->xhv_array)
1277 Newz(506, xhv->xhv_array,
1278 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
1280 entry = HeNEXT(entry);
1283 if (xhv->xhv_riter > xhv->xhv_max) {
1284 xhv->xhv_riter = -1;
1287 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
1290 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1292 hv_free_ent(hv, oldentry);
1295 xhv->xhv_eiter = entry;
1300 =for apidoc hv_iterkey
1302 Returns the key from the current position of the hash iterator. See
1309 Perl_hv_iterkey(pTHX_ register HE *entry, I32 *retlen)
1311 if (HeKLEN(entry) == HEf_SVKEY) {
1313 char *p = SvPV(HeKEY_sv(entry), len);
1318 *retlen = HeKLEN(entry);
1319 return HeKEY(entry);
1323 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1325 =for apidoc hv_iterkeysv
1327 Returns the key as an C<SV*> from the current position of the hash
1328 iterator. The return value will always be a mortal copy of the key. Also
1335 Perl_hv_iterkeysv(pTHX_ register HE *entry)
1337 if (HeKLEN(entry) == HEf_SVKEY)
1338 return sv_mortalcopy(HeKEY_sv(entry));
1340 return sv_2mortal(newSVpvn((HeKLEN(entry) ? HeKEY(entry) : ""),
1345 =for apidoc hv_iterval
1347 Returns the value from the current position of the hash iterator. See
1354 Perl_hv_iterval(pTHX_ HV *hv, register HE *entry)
1356 if (SvRMAGICAL(hv)) {
1357 if (mg_find((SV*)hv,'P')) {
1358 SV* sv = sv_newmortal();
1359 if (HeKLEN(entry) == HEf_SVKEY)
1360 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1361 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1365 return HeVAL(entry);
1369 =for apidoc hv_iternextsv
1371 Performs an C<hv_iternext>, C<hv_iterkey>, and C<hv_iterval> in one
1378 Perl_hv_iternextsv(pTHX_ HV *hv, char **key, I32 *retlen)
1381 if ( (he = hv_iternext(hv)) == NULL)
1383 *key = hv_iterkey(he, retlen);
1384 return hv_iterval(hv, he);
1388 =for apidoc hv_magic
1390 Adds magic to a hash. See C<sv_magic>.
1396 Perl_hv_magic(pTHX_ HV *hv, GV *gv, int how)
1398 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1402 Perl_sharepvn(pTHX_ const char *sv, I32 len, U32 hash)
1404 return HEK_KEY(share_hek(sv, len, hash));
1407 /* possibly free a shared string if no one has access to it
1408 * len and hash must both be valid for str.
1411 Perl_unsharepvn(pTHX_ const char *str, I32 len, U32 hash)
1413 register XPVHV* xhv;
1415 register HE **oentry;
1419 /* what follows is the moral equivalent of:
1420 if ((Svp = hv_fetch(PL_strtab, tmpsv, FALSE, hash))) {
1421 if (--*Svp == Nullsv)
1422 hv_delete(PL_strtab, str, len, G_DISCARD, hash);
1424 xhv = (XPVHV*)SvANY(PL_strtab);
1425 /* assert(xhv_array != 0) */
1427 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1428 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1429 if (HeHASH(entry) != hash) /* strings can't be equal */
1431 if (HeKLEN(entry) != len)
1433 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1436 if (--HeVAL(entry) == Nullsv) {
1437 *oentry = HeNEXT(entry);
1440 Safefree(HeKEY_hek(entry));
1446 UNLOCK_STRTAB_MUTEX;
1447 if (!found && ckWARN_d(WARN_INTERNAL))
1448 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free non-existent shared string");
1451 /* get a (constant) string ptr from the global string table
1452 * string will get added if it is not already there.
1453 * len and hash must both be valid for str.
1456 Perl_share_hek(pTHX_ const char *str, I32 len, register U32 hash)
1458 register XPVHV* xhv;
1460 register HE **oentry;
1464 /* what follows is the moral equivalent of:
1466 if (!(Svp = hv_fetch(PL_strtab, str, len, FALSE)))
1467 hv_store(PL_strtab, str, len, Nullsv, hash);
1469 xhv = (XPVHV*)SvANY(PL_strtab);
1470 /* assert(xhv_array != 0) */
1472 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1473 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
1474 if (HeHASH(entry) != hash) /* strings can't be equal */
1476 if (HeKLEN(entry) != len)
1478 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1485 HeKEY_hek(entry) = save_hek(str, len, hash);
1486 HeVAL(entry) = Nullsv;
1487 HeNEXT(entry) = *oentry;
1490 if (i) { /* initial entry? */
1492 if (xhv->xhv_keys > xhv->xhv_max)
1497 ++HeVAL(entry); /* use value slot as REFCNT */
1498 UNLOCK_STRTAB_MUTEX;
1499 return HeKEY_hek(entry);