3 * Copyright (c) 1991-1999, 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
17 static void hv_magic_check _((HV *hv, bool *needs_copy, bool *needs_store));
19 static void hsplit _((HV *hv));
20 static void hfreeentries _((HV *hv));
21 static void more_he _((void));
22 static HEK *save_hek _((const char *str, I32 len, U32 hash));
25 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
26 # define ARRAY_ALLOC_BYTES(size) ( (size)*sizeof(HE*) )
28 # define MALLOC_OVERHEAD 16
29 # define ARRAY_ALLOC_BYTES(size) ( ((size) < 64) \
30 ? (size)*sizeof(HE*) \
31 : (size)*sizeof(HE*)*2 - MALLOC_OVERHEAD )
42 PL_he_root = HeNEXT(he);
51 HeNEXT(p) = (HE*)PL_he_root;
61 New(54, PL_he_root, 1008/sizeof(HE), HE);
63 heend = &he[1008 / sizeof(HE) - 1];
65 HeNEXT(he) = (HE*)(he + 1);
72 save_hek(const char *str, I32 len, U32 hash)
77 New(54, k, HEK_BASESIZE + len + 1, char);
79 Copy(str, HEK_KEY(hek), len, char);
80 *(HEK_KEY(hek) + len) = '\0';
89 unsharepvn(HEK_KEY(hek),HEK_LEN(hek),HEK_HASH(hek));
92 /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot
96 hv_fetch(HV *hv, const char *key, U32 klen, I32 lval)
106 if (SvRMAGICAL(hv)) {
107 if (mg_find((SV*)hv,'P')) {
110 mg_copy((SV*)hv, sv, key, klen);
112 return &PL_hv_fetch_sv;
114 #ifdef ENV_IS_CASELESS
115 else if (mg_find((SV*)hv,'E')) {
117 for (i = 0; i < klen; ++i)
118 if (isLOWER(key[i])) {
119 char *nkey = strupr(SvPVX(sv_2mortal(newSVpvn(key,klen))));
120 SV **ret = hv_fetch(hv, nkey, klen, 0);
122 ret = hv_store(hv, key, klen, NEWSV(61,0), 0);
129 xhv = (XPVHV*)SvANY(hv);
130 if (!xhv->xhv_array) {
132 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
133 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
136 Newz(503,xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
141 PERL_HASH(hash, key, klen);
143 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
144 for (; entry; entry = HeNEXT(entry)) {
145 if (HeHASH(entry) != hash) /* strings can't be equal */
147 if (HeKLEN(entry) != klen)
149 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
151 return &HeVAL(entry);
153 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
154 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
156 char *env = PerlEnv_ENVgetenv_len(key,&len);
158 sv = newSVpvn(env,len);
160 return hv_store(hv,key,klen,sv,hash);
164 if (lval) { /* gonna assign to this, so it better be there */
166 return hv_store(hv,key,klen,sv,hash);
171 /* returns a HE * structure with the all fields set */
172 /* note that hent_val will be a mortal sv for MAGICAL hashes */
174 hv_fetch_ent(HV *hv, SV *keysv, I32 lval, register U32 hash)
185 if (SvRMAGICAL(hv)) {
186 if (mg_find((SV*)hv,'P')) {
189 keysv = sv_2mortal(newSVsv(keysv));
190 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
191 if (!HeKEY_hek(&PL_hv_fetch_ent_mh)) {
193 New(54, k, HEK_BASESIZE + sizeof(SV*), char);
194 HeKEY_hek(&PL_hv_fetch_ent_mh) = (HEK*)k;
196 HeSVKEY_set(&PL_hv_fetch_ent_mh, keysv);
197 HeVAL(&PL_hv_fetch_ent_mh) = sv;
198 return &PL_hv_fetch_ent_mh;
200 #ifdef ENV_IS_CASELESS
201 else if (mg_find((SV*)hv,'E')) {
203 key = SvPV(keysv, klen);
204 for (i = 0; i < klen; ++i)
205 if (isLOWER(key[i])) {
206 SV *nkeysv = sv_2mortal(newSVpvn(key,klen));
207 (void)strupr(SvPVX(nkeysv));
208 entry = hv_fetch_ent(hv, nkeysv, 0, 0);
210 entry = hv_store_ent(hv, keysv, NEWSV(61,0), hash);
217 xhv = (XPVHV*)SvANY(hv);
218 if (!xhv->xhv_array) {
220 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
221 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
224 Newz(503,xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
229 key = SvPV(keysv, klen);
232 PERL_HASH(hash, key, klen);
234 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
235 for (; entry; entry = HeNEXT(entry)) {
236 if (HeHASH(entry) != hash) /* strings can't be equal */
238 if (HeKLEN(entry) != klen)
240 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
244 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
245 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
247 char *env = PerlEnv_ENVgetenv_len(key,&len);
249 sv = newSVpvn(env,len);
251 return hv_store_ent(hv,keysv,sv,hash);
255 if (lval) { /* gonna assign to this, so it better be there */
257 return hv_store_ent(hv,keysv,sv,hash);
263 hv_magic_check (HV *hv, bool *needs_copy, bool *needs_store)
265 MAGIC *mg = SvMAGIC(hv);
269 if (isUPPER(mg->mg_type)) {
271 switch (mg->mg_type) {
274 *needs_store = FALSE;
277 mg = mg->mg_moremagic;
282 hv_store(HV *hv, const char *key, U32 klen, SV *val, register U32 hash)
287 register HE **oentry;
292 xhv = (XPVHV*)SvANY(hv);
296 hv_magic_check (hv, &needs_copy, &needs_store);
298 mg_copy((SV*)hv, val, key, klen);
299 if (!xhv->xhv_array && !needs_store)
301 #ifdef ENV_IS_CASELESS
302 else if (mg_find((SV*)hv,'E')) {
303 SV *sv = sv_2mortal(newSVpvn(key,klen));
304 key = strupr(SvPVX(sv));
311 PERL_HASH(hash, key, klen);
314 Newz(505, xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
316 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
319 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
320 if (HeHASH(entry) != hash) /* strings can't be equal */
322 if (HeKLEN(entry) != klen)
324 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
326 SvREFCNT_dec(HeVAL(entry));
328 return &HeVAL(entry);
333 HeKEY_hek(entry) = share_hek(key, klen, hash);
334 else /* gotta do the real thing */
335 HeKEY_hek(entry) = save_hek(key, klen, hash);
337 HeNEXT(entry) = *oentry;
341 if (i) { /* initial entry? */
343 if (xhv->xhv_keys > xhv->xhv_max)
347 return &HeVAL(entry);
351 hv_store_ent(HV *hv, SV *keysv, SV *val, register U32 hash)
358 register HE **oentry;
363 xhv = (XPVHV*)SvANY(hv);
368 hv_magic_check (hv, &needs_copy, &needs_store);
370 bool save_taint = PL_tainted;
372 PL_tainted = SvTAINTED(keysv);
373 keysv = sv_2mortal(newSVsv(keysv));
374 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
375 TAINT_IF(save_taint);
376 if (!xhv->xhv_array && !needs_store)
378 #ifdef ENV_IS_CASELESS
379 else if (mg_find((SV*)hv,'E')) {
380 key = SvPV(keysv, klen);
381 keysv = sv_2mortal(newSVpvn(key,klen));
382 (void)strupr(SvPVX(keysv));
389 key = SvPV(keysv, klen);
392 PERL_HASH(hash, key, klen);
395 Newz(505, xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
397 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
400 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
401 if (HeHASH(entry) != hash) /* strings can't be equal */
403 if (HeKLEN(entry) != klen)
405 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
407 SvREFCNT_dec(HeVAL(entry));
414 HeKEY_hek(entry) = share_hek(key, klen, hash);
415 else /* gotta do the real thing */
416 HeKEY_hek(entry) = save_hek(key, klen, hash);
418 HeNEXT(entry) = *oentry;
422 if (i) { /* initial entry? */
424 if (xhv->xhv_keys > xhv->xhv_max)
432 hv_delete(HV *hv, const char *key, U32 klen, I32 flags)
438 register HE **oentry;
444 if (SvRMAGICAL(hv)) {
447 hv_magic_check (hv, &needs_copy, &needs_store);
449 if (needs_copy && (svp = hv_fetch(hv, key, klen, TRUE))) {
453 if (mg_find(sv, 'p')) {
454 sv_unmagic(sv, 'p'); /* No longer an element */
457 return Nullsv; /* element cannot be deleted */
459 #ifdef ENV_IS_CASELESS
460 else if (mg_find((SV*)hv,'E')) {
461 sv = sv_2mortal(newSVpvn(key,klen));
462 key = strupr(SvPVX(sv));
467 xhv = (XPVHV*)SvANY(hv);
471 PERL_HASH(hash, key, klen);
473 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
476 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
477 if (HeHASH(entry) != hash) /* strings can't be equal */
479 if (HeKLEN(entry) != klen)
481 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
483 *oentry = HeNEXT(entry);
486 if (flags & G_DISCARD)
489 sv = sv_mortalcopy(HeVAL(entry));
490 if (entry == xhv->xhv_eiter)
493 hv_free_ent(hv, entry);
501 hv_delete_ent(HV *hv, SV *keysv, I32 flags, U32 hash)
508 register HE **oentry;
513 if (SvRMAGICAL(hv)) {
516 hv_magic_check (hv, &needs_copy, &needs_store);
518 if (needs_copy && (entry = hv_fetch_ent(hv, keysv, TRUE, hash))) {
522 if (mg_find(sv, 'p')) {
523 sv_unmagic(sv, 'p'); /* No longer an element */
526 return Nullsv; /* element cannot be deleted */
528 #ifdef ENV_IS_CASELESS
529 else if (mg_find((SV*)hv,'E')) {
530 key = SvPV(keysv, klen);
531 keysv = sv_2mortal(newSVpvn(key,klen));
532 (void)strupr(SvPVX(keysv));
538 xhv = (XPVHV*)SvANY(hv);
542 key = SvPV(keysv, klen);
545 PERL_HASH(hash, key, klen);
547 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
550 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
551 if (HeHASH(entry) != hash) /* strings can't be equal */
553 if (HeKLEN(entry) != klen)
555 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
557 *oentry = HeNEXT(entry);
560 if (flags & G_DISCARD)
563 sv = sv_mortalcopy(HeVAL(entry));
564 if (entry == xhv->xhv_eiter)
567 hv_free_ent(hv, entry);
575 hv_exists(HV *hv, const char *key, U32 klen)
585 if (SvRMAGICAL(hv)) {
586 if (mg_find((SV*)hv,'P')) {
589 mg_copy((SV*)hv, sv, key, klen);
590 magic_existspack(sv, mg_find(sv, 'p'));
593 #ifdef ENV_IS_CASELESS
594 else if (mg_find((SV*)hv,'E')) {
595 sv = sv_2mortal(newSVpvn(key,klen));
596 key = strupr(SvPVX(sv));
601 xhv = (XPVHV*)SvANY(hv);
602 #ifndef DYNAMIC_ENV_FETCH
607 PERL_HASH(hash, key, klen);
609 #ifdef DYNAMIC_ENV_FETCH
610 if (!xhv->xhv_array) entry = Null(HE*);
613 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
614 for (; entry; entry = HeNEXT(entry)) {
615 if (HeHASH(entry) != hash) /* strings can't be equal */
617 if (HeKLEN(entry) != klen)
619 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
623 #ifdef DYNAMIC_ENV_FETCH /* is it out there? */
624 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME)) {
626 char *env = PerlEnv_ENVgetenv_len(key,&len);
628 sv = newSVpvn(env,len);
630 (void)hv_store(hv,key,klen,sv,hash);
640 hv_exists_ent(HV *hv, SV *keysv, U32 hash)
651 if (SvRMAGICAL(hv)) {
652 if (mg_find((SV*)hv,'P')) {
653 dTHR; /* just for SvTRUE */
655 keysv = sv_2mortal(newSVsv(keysv));
656 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
657 magic_existspack(sv, mg_find(sv, 'p'));
660 #ifdef ENV_IS_CASELESS
661 else if (mg_find((SV*)hv,'E')) {
662 key = SvPV(keysv, klen);
663 keysv = sv_2mortal(newSVpvn(key,klen));
664 (void)strupr(SvPVX(keysv));
670 xhv = (XPVHV*)SvANY(hv);
671 #ifndef DYNAMIC_ENV_FETCH
676 key = SvPV(keysv, klen);
678 PERL_HASH(hash, key, klen);
680 #ifdef DYNAMIC_ENV_FETCH
681 if (!xhv->xhv_array) entry = Null(HE*);
684 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
685 for (; entry; entry = HeNEXT(entry)) {
686 if (HeHASH(entry) != hash) /* strings can't be equal */
688 if (HeKLEN(entry) != klen)
690 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
694 #ifdef DYNAMIC_ENV_FETCH /* is it out there? */
695 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME)) {
697 char *env = PerlEnv_ENVgetenv_len(key,&len);
699 sv = newSVpvn(env,len);
701 (void)hv_store_ent(hv,keysv,sv,hash);
712 register XPVHV* xhv = (XPVHV*)SvANY(hv);
713 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
714 register I32 newsize = oldsize * 2;
716 register char *a = xhv->xhv_array;
720 register HE **oentry;
723 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
724 Renew(a, ARRAY_ALLOC_BYTES(newsize), char);
730 #define MALLOC_OVERHEAD 16
731 New(2, a, ARRAY_ALLOC_BYTES(newsize), char);
736 Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char);
738 offer_nice_chunk(xhv->xhv_array, ARRAY_ALLOC_BYTES(oldsize));
741 Safefree(xhv->xhv_array);
745 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
746 xhv->xhv_max = --newsize;
750 for (i=0; i<oldsize; i++,aep++) {
751 if (!*aep) /* non-existent */
754 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
755 if ((HeHASH(entry) & newsize) != i) {
756 *oentry = HeNEXT(entry);
757 HeNEXT(entry) = *bep;
764 oentry = &HeNEXT(entry);
766 if (!*aep) /* everything moved */
772 hv_ksplit(HV *hv, IV newmax)
774 register XPVHV* xhv = (XPVHV*)SvANY(hv);
775 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
776 register I32 newsize;
782 register HE **oentry;
784 newsize = (I32) newmax; /* possible truncation here */
785 if (newsize != newmax || newmax <= oldsize)
787 while ((newsize & (1 + ~newsize)) != newsize) {
788 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
790 if (newsize < newmax)
792 if (newsize < newmax)
793 return; /* overflow detection */
798 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
799 Renew(a, ARRAY_ALLOC_BYTES(newsize), char);
805 New(2, a, ARRAY_ALLOC_BYTES(newsize), char);
810 Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char);
812 offer_nice_chunk(xhv->xhv_array, ARRAY_ALLOC_BYTES(oldsize));
815 Safefree(xhv->xhv_array);
818 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
821 Newz(0, a, ARRAY_ALLOC_BYTES(newsize), char);
823 xhv->xhv_max = --newsize;
825 if (!xhv->xhv_fill) /* skip rest if no entries */
829 for (i=0; i<oldsize; i++,aep++) {
830 if (!*aep) /* non-existent */
832 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
833 if ((j = (HeHASH(entry) & newsize)) != i) {
835 *oentry = HeNEXT(entry);
836 if (!(HeNEXT(entry) = aep[j]))
842 oentry = &HeNEXT(entry);
844 if (!*aep) /* everything moved */
855 hv = (HV*)NEWSV(502,0);
856 sv_upgrade((SV *)hv, SVt_PVHV);
857 xhv = (XPVHV*)SvANY(hv);
860 #ifndef NODEFAULT_SHAREKEYS
861 HvSHAREKEYS_on(hv); /* key-sharing on by default */
863 xhv->xhv_max = 7; /* start with 8 buckets */
866 (void)hv_iterinit(hv); /* so each() will start off right */
874 STRLEN hv_max = ohv ? HvMAX(ohv) : 0;
875 STRLEN hv_fill = ohv ? HvFILL(ohv) : 0;
878 while (hv_max && hv_max + 1 >= hv_fill * 2)
879 hv_max = hv_max / 2; /* Is always 2^n-1 */
885 if (! SvTIED_mg((SV*)ohv, 'P')) {
892 I32 hv_riter = HvRITER(ohv); /* current root of iterator */
893 HE *hv_eiter = HvEITER(ohv); /* current entry of iterator */
897 while (entry = hv_iternext(ohv)) {
898 hv_store(hv, HeKEY(entry), HeKLEN(entry),
899 SvREFCNT_inc(HeVAL(entry)), HeHASH(entry));
901 HvRITER(ohv) = hv_riter;
902 HvEITER(ohv) = hv_eiter;
909 hv_free_ent(HV *hv, register HE *entry)
916 if (val && isGV(val) && GvCVu(val) && HvNAME(hv))
917 PL_sub_generation++; /* may be deletion of method from stash */
919 if (HeKLEN(entry) == HEf_SVKEY) {
920 SvREFCNT_dec(HeKEY_sv(entry));
921 Safefree(HeKEY_hek(entry));
923 else if (HvSHAREKEYS(hv))
924 unshare_hek(HeKEY_hek(entry));
926 Safefree(HeKEY_hek(entry));
931 hv_delayfree_ent(HV *hv, register HE *entry)
935 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
936 PL_sub_generation++; /* may be deletion of method from stash */
937 sv_2mortal(HeVAL(entry)); /* free between statements */
938 if (HeKLEN(entry) == HEf_SVKEY) {
939 sv_2mortal(HeKEY_sv(entry));
940 Safefree(HeKEY_hek(entry));
942 else if (HvSHAREKEYS(hv))
943 unshare_hek(HeKEY_hek(entry));
945 Safefree(HeKEY_hek(entry));
955 xhv = (XPVHV*)SvANY(hv);
960 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
971 register HE *oentry = Null(HE*);
987 entry = HeNEXT(entry);
988 hv_free_ent(hv, oentry);
993 entry = array[riter];
996 (void)hv_iterinit(hv);
1002 register XPVHV* xhv;
1005 xhv = (XPVHV*)SvANY(hv);
1007 Safefree(xhv->xhv_array);
1009 Safefree(HvNAME(hv));
1013 xhv->xhv_max = 7; /* it's a normal hash */
1024 register XPVHV* xhv;
1029 xhv = (XPVHV*)SvANY(hv);
1030 entry = xhv->xhv_eiter;
1031 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1033 hv_free_ent(hv, entry);
1035 xhv->xhv_riter = -1;
1036 xhv->xhv_eiter = Null(HE*);
1037 return xhv->xhv_keys; /* used to be xhv->xhv_fill before 5.004_65 */
1043 register XPVHV* xhv;
1050 xhv = (XPVHV*)SvANY(hv);
1051 oldentry = entry = xhv->xhv_eiter;
1053 if (mg = SvTIED_mg((SV*)hv, 'P')) {
1054 SV *key = sv_newmortal();
1056 sv_setsv(key, HeSVKEY_force(entry));
1057 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
1063 xhv->xhv_eiter = entry = new_he(); /* one HE per MAGICAL hash */
1065 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
1067 HeKEY_hek(entry) = hek;
1068 HeKLEN(entry) = HEf_SVKEY;
1070 magic_nextpack((SV*) hv,mg,key);
1072 /* force key to stay around until next time */
1073 HeSVKEY_set(entry, SvREFCNT_inc(key));
1074 return entry; /* beware, hent_val is not set */
1077 SvREFCNT_dec(HeVAL(entry));
1078 Safefree(HeKEY_hek(entry));
1080 xhv->xhv_eiter = Null(HE*);
1083 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
1084 if (!entry && HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
1088 if (!xhv->xhv_array)
1089 Newz(506,xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
1091 entry = HeNEXT(entry);
1094 if (xhv->xhv_riter > xhv->xhv_max) {
1095 xhv->xhv_riter = -1;
1098 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
1101 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1103 hv_free_ent(hv, oldentry);
1106 xhv->xhv_eiter = entry;
1111 hv_iterkey(register HE *entry, I32 *retlen)
1113 if (HeKLEN(entry) == HEf_SVKEY) {
1115 char *p = SvPV(HeKEY_sv(entry), len);
1120 *retlen = HeKLEN(entry);
1121 return HeKEY(entry);
1125 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1127 hv_iterkeysv(register HE *entry)
1129 if (HeKLEN(entry) == HEf_SVKEY)
1130 return sv_mortalcopy(HeKEY_sv(entry));
1132 return sv_2mortal(newSVpvn((HeKLEN(entry) ? HeKEY(entry) : ""),
1137 hv_iterval(HV *hv, register HE *entry)
1139 if (SvRMAGICAL(hv)) {
1140 if (mg_find((SV*)hv,'P')) {
1141 SV* sv = sv_newmortal();
1142 if (HeKLEN(entry) == HEf_SVKEY)
1143 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1144 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1148 return HeVAL(entry);
1152 hv_iternextsv(HV *hv, char **key, I32 *retlen)
1155 if ( (he = hv_iternext(hv)) == NULL)
1157 *key = hv_iterkey(he, retlen);
1158 return hv_iterval(hv, he);
1162 hv_magic(HV *hv, GV *gv, int how)
1164 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1168 sharepvn(const char *sv, I32 len, U32 hash)
1170 return HEK_KEY(share_hek(sv, len, hash));
1173 /* possibly free a shared string if no one has access to it
1174 * len and hash must both be valid for str.
1177 unsharepvn(const char *str, I32 len, U32 hash)
1179 register XPVHV* xhv;
1181 register HE **oentry;
1185 /* what follows is the moral equivalent of:
1186 if ((Svp = hv_fetch(PL_strtab, tmpsv, FALSE, hash))) {
1187 if (--*Svp == Nullsv)
1188 hv_delete(PL_strtab, str, len, G_DISCARD, hash);
1190 xhv = (XPVHV*)SvANY(PL_strtab);
1191 /* assert(xhv_array != 0) */
1193 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1194 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1195 if (HeHASH(entry) != hash) /* strings can't be equal */
1197 if (HeKLEN(entry) != len)
1199 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1202 if (--HeVAL(entry) == Nullsv) {
1203 *oentry = HeNEXT(entry);
1206 Safefree(HeKEY_hek(entry));
1212 UNLOCK_STRTAB_MUTEX;
1215 warn("Attempt to free non-existent shared string");
1218 /* get a (constant) string ptr from the global string table
1219 * string will get added if it is not already there.
1220 * len and hash must both be valid for str.
1223 share_hek(const char *str, I32 len, register U32 hash)
1225 register XPVHV* xhv;
1227 register HE **oentry;
1231 /* what follows is the moral equivalent of:
1233 if (!(Svp = hv_fetch(PL_strtab, str, len, FALSE)))
1234 hv_store(PL_strtab, str, len, Nullsv, hash);
1236 xhv = (XPVHV*)SvANY(PL_strtab);
1237 /* assert(xhv_array != 0) */
1239 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1240 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
1241 if (HeHASH(entry) != hash) /* strings can't be equal */
1243 if (HeKLEN(entry) != len)
1245 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1252 HeKEY_hek(entry) = save_hek(str, len, hash);
1253 HeVAL(entry) = Nullsv;
1254 HeNEXT(entry) = *oentry;
1257 if (i) { /* initial entry? */
1259 if (xhv->xhv_keys > xhv->xhv_max)
1264 ++HeVAL(entry); /* use value slot as REFCNT */
1265 UNLOCK_STRTAB_MUTEX;
1266 return HeKEY_hek(entry);