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)*sizeof(HE*)*2 - MALLOC_OVERHEAD )
40 PL_he_root = HeNEXT(he);
49 HeNEXT(p) = (HE*)PL_he_root;
59 New(54, PL_he_root, 1008/sizeof(HE), HE);
61 heend = &he[1008 / sizeof(HE) - 1];
63 HeNEXT(he) = (HE*)(he + 1);
70 save_hek(const char *str, I32 len, U32 hash)
75 New(54, k, HEK_BASESIZE + len + 1, char);
77 Copy(str, HEK_KEY(hek), len, char);
78 *(HEK_KEY(hek) + len) = '\0';
87 unsharepvn(HEK_KEY(hek),HEK_LEN(hek),HEK_HASH(hek));
90 /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot
94 hv_fetch(HV *hv, const char *key, U32 klen, I32 lval)
104 if (SvRMAGICAL(hv)) {
105 if (mg_find((SV*)hv,'P')) {
108 mg_copy((SV*)hv, sv, key, klen);
110 return &PL_hv_fetch_sv;
112 #ifdef ENV_IS_CASELESS
113 else if (mg_find((SV*)hv,'E')) {
115 for (i = 0; i < klen; ++i)
116 if (isLOWER(key[i])) {
117 char *nkey = strupr(SvPVX(sv_2mortal(newSVpvn(key,klen))));
118 SV **ret = hv_fetch(hv, nkey, klen, 0);
120 ret = hv_store(hv, key, klen, NEWSV(61,0), 0);
127 xhv = (XPVHV*)SvANY(hv);
128 if (!xhv->xhv_array) {
130 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
131 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
134 Newz(503,xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
139 PERL_HASH(hash, key, klen);
141 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
142 for (; entry; entry = HeNEXT(entry)) {
143 if (HeHASH(entry) != hash) /* strings can't be equal */
145 if (HeKLEN(entry) != klen)
147 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
149 return &HeVAL(entry);
151 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
152 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
155 if ((gotenv = PerlEnv_getenv(key)) != Nullch) {
156 sv = newSVpvn(gotenv,strlen(gotenv));
158 return hv_store(hv,key,klen,sv,hash);
162 if (lval) { /* gonna assign to this, so it better be there */
164 return hv_store(hv,key,klen,sv,hash);
169 /* returns a HE * structure with the all fields set */
170 /* note that hent_val will be a mortal sv for MAGICAL hashes */
172 hv_fetch_ent(HV *hv, SV *keysv, I32 lval, register U32 hash)
183 if (SvRMAGICAL(hv)) {
184 if (mg_find((SV*)hv,'P')) {
187 keysv = sv_2mortal(newSVsv(keysv));
188 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
189 if (!HeKEY_hek(&PL_hv_fetch_ent_mh)) {
191 New(54, k, HEK_BASESIZE + sizeof(SV*), char);
192 HeKEY_hek(&PL_hv_fetch_ent_mh) = (HEK*)k;
194 HeSVKEY_set(&PL_hv_fetch_ent_mh, keysv);
195 HeVAL(&PL_hv_fetch_ent_mh) = sv;
196 return &PL_hv_fetch_ent_mh;
198 #ifdef ENV_IS_CASELESS
199 else if (mg_find((SV*)hv,'E')) {
201 key = SvPV(keysv, klen);
202 for (i = 0; i < klen; ++i)
203 if (isLOWER(key[i])) {
204 SV *nkeysv = sv_2mortal(newSVpvn(key,klen));
205 (void)strupr(SvPVX(nkeysv));
206 entry = hv_fetch_ent(hv, nkeysv, 0, 0);
208 entry = hv_store_ent(hv, keysv, NEWSV(61,0), hash);
215 xhv = (XPVHV*)SvANY(hv);
216 if (!xhv->xhv_array) {
218 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
219 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
222 Newz(503,xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
227 key = SvPV(keysv, klen);
230 PERL_HASH(hash, key, klen);
232 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
233 for (; entry; entry = HeNEXT(entry)) {
234 if (HeHASH(entry) != hash) /* strings can't be equal */
236 if (HeKLEN(entry) != klen)
238 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
242 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
243 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
246 if ((gotenv = PerlEnv_getenv(key)) != Nullch) {
247 sv = newSVpvn(gotenv,strlen(gotenv));
249 return hv_store_ent(hv,keysv,sv,hash);
253 if (lval) { /* gonna assign to this, so it better be there */
255 return hv_store_ent(hv,keysv,sv,hash);
261 hv_magic_check (HV *hv, bool *needs_copy, bool *needs_store)
263 MAGIC *mg = SvMAGIC(hv);
267 if (isUPPER(mg->mg_type)) {
269 switch (mg->mg_type) {
272 *needs_store = FALSE;
275 mg = mg->mg_moremagic;
280 hv_store(HV *hv, const char *key, U32 klen, SV *val, register U32 hash)
285 register HE **oentry;
290 xhv = (XPVHV*)SvANY(hv);
294 hv_magic_check (hv, &needs_copy, &needs_store);
296 mg_copy((SV*)hv, val, key, klen);
297 if (!xhv->xhv_array && !needs_store)
299 #ifdef ENV_IS_CASELESS
300 else if (mg_find((SV*)hv,'E')) {
301 SV *sv = sv_2mortal(newSVpvn(key,klen));
302 key = strupr(SvPVX(sv));
309 PERL_HASH(hash, key, klen);
312 Newz(505, xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
314 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
317 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
318 if (HeHASH(entry) != hash) /* strings can't be equal */
320 if (HeKLEN(entry) != klen)
322 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
324 SvREFCNT_dec(HeVAL(entry));
326 return &HeVAL(entry);
331 HeKEY_hek(entry) = share_hek(key, klen, hash);
332 else /* gotta do the real thing */
333 HeKEY_hek(entry) = save_hek(key, klen, hash);
335 HeNEXT(entry) = *oentry;
339 if (i) { /* initial entry? */
341 if (xhv->xhv_keys > xhv->xhv_max)
345 return &HeVAL(entry);
349 hv_store_ent(HV *hv, SV *keysv, SV *val, register U32 hash)
356 register HE **oentry;
361 xhv = (XPVHV*)SvANY(hv);
366 hv_magic_check (hv, &needs_copy, &needs_store);
368 bool save_taint = PL_tainted;
370 PL_tainted = SvTAINTED(keysv);
371 keysv = sv_2mortal(newSVsv(keysv));
372 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
373 TAINT_IF(save_taint);
374 if (!xhv->xhv_array && !needs_store)
376 #ifdef ENV_IS_CASELESS
377 else if (mg_find((SV*)hv,'E')) {
378 key = SvPV(keysv, klen);
379 keysv = sv_2mortal(newSVpvn(key,klen));
380 (void)strupr(SvPVX(keysv));
387 key = SvPV(keysv, klen);
390 PERL_HASH(hash, key, klen);
393 Newz(505, xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
395 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
398 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
399 if (HeHASH(entry) != hash) /* strings can't be equal */
401 if (HeKLEN(entry) != klen)
403 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
405 SvREFCNT_dec(HeVAL(entry));
412 HeKEY_hek(entry) = share_hek(key, klen, hash);
413 else /* gotta do the real thing */
414 HeKEY_hek(entry) = save_hek(key, klen, hash);
416 HeNEXT(entry) = *oentry;
420 if (i) { /* initial entry? */
422 if (xhv->xhv_keys > xhv->xhv_max)
430 hv_delete(HV *hv, const char *key, U32 klen, I32 flags)
436 register HE **oentry;
442 if (SvRMAGICAL(hv)) {
445 hv_magic_check (hv, &needs_copy, &needs_store);
447 if (needs_copy && (svp = hv_fetch(hv, key, klen, TRUE))) {
451 if (mg_find(sv, 'p')) {
452 sv_unmagic(sv, 'p'); /* No longer an element */
455 return Nullsv; /* element cannot be deleted */
457 #ifdef ENV_IS_CASELESS
458 else if (mg_find((SV*)hv,'E')) {
459 sv = sv_2mortal(newSVpvn(key,klen));
460 key = strupr(SvPVX(sv));
465 xhv = (XPVHV*)SvANY(hv);
469 PERL_HASH(hash, key, klen);
471 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
474 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
475 if (HeHASH(entry) != hash) /* strings can't be equal */
477 if (HeKLEN(entry) != klen)
479 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
481 *oentry = HeNEXT(entry);
484 if (flags & G_DISCARD)
487 sv = sv_mortalcopy(HeVAL(entry));
488 if (entry == xhv->xhv_eiter)
491 hv_free_ent(hv, entry);
499 hv_delete_ent(HV *hv, SV *keysv, I32 flags, U32 hash)
506 register HE **oentry;
511 if (SvRMAGICAL(hv)) {
514 hv_magic_check (hv, &needs_copy, &needs_store);
516 if (needs_copy && (entry = hv_fetch_ent(hv, keysv, TRUE, hash))) {
520 if (mg_find(sv, 'p')) {
521 sv_unmagic(sv, 'p'); /* No longer an element */
524 return Nullsv; /* element cannot be deleted */
526 #ifdef ENV_IS_CASELESS
527 else if (mg_find((SV*)hv,'E')) {
528 key = SvPV(keysv, klen);
529 keysv = sv_2mortal(newSVpvn(key,klen));
530 (void)strupr(SvPVX(keysv));
536 xhv = (XPVHV*)SvANY(hv);
540 key = SvPV(keysv, klen);
543 PERL_HASH(hash, key, klen);
545 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
548 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
549 if (HeHASH(entry) != hash) /* strings can't be equal */
551 if (HeKLEN(entry) != klen)
553 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
555 *oentry = HeNEXT(entry);
558 if (flags & G_DISCARD)
561 sv = sv_mortalcopy(HeVAL(entry));
562 if (entry == xhv->xhv_eiter)
565 hv_free_ent(hv, entry);
573 hv_exists(HV *hv, const char *key, U32 klen)
583 if (SvRMAGICAL(hv)) {
584 if (mg_find((SV*)hv,'P')) {
587 mg_copy((SV*)hv, sv, key, klen);
588 magic_existspack(sv, mg_find(sv, 'p'));
591 #ifdef ENV_IS_CASELESS
592 else if (mg_find((SV*)hv,'E')) {
593 sv = sv_2mortal(newSVpvn(key,klen));
594 key = strupr(SvPVX(sv));
599 xhv = (XPVHV*)SvANY(hv);
603 PERL_HASH(hash, key, klen);
605 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
606 for (; entry; entry = HeNEXT(entry)) {
607 if (HeHASH(entry) != hash) /* strings can't be equal */
609 if (HeKLEN(entry) != klen)
611 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
620 hv_exists_ent(HV *hv, SV *keysv, U32 hash)
631 if (SvRMAGICAL(hv)) {
632 if (mg_find((SV*)hv,'P')) {
633 dTHR; /* just for SvTRUE */
635 keysv = sv_2mortal(newSVsv(keysv));
636 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
637 magic_existspack(sv, mg_find(sv, 'p'));
640 #ifdef ENV_IS_CASELESS
641 else if (mg_find((SV*)hv,'E')) {
642 key = SvPV(keysv, klen);
643 keysv = sv_2mortal(newSVpvn(key,klen));
644 (void)strupr(SvPVX(keysv));
650 xhv = (XPVHV*)SvANY(hv);
654 key = SvPV(keysv, klen);
656 PERL_HASH(hash, key, klen);
658 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
659 for (; entry; entry = HeNEXT(entry)) {
660 if (HeHASH(entry) != hash) /* strings can't be equal */
662 if (HeKLEN(entry) != klen)
664 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
674 register XPVHV* xhv = (XPVHV*)SvANY(hv);
675 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
676 register I32 newsize = oldsize * 2;
678 register char *a = xhv->xhv_array;
682 register HE **oentry;
685 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
686 Renew(a, ARRAY_ALLOC_BYTES(newsize), char);
692 #define MALLOC_OVERHEAD 16
693 New(2, a, ARRAY_ALLOC_BYTES(newsize), char);
698 Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char);
700 offer_nice_chunk(xhv->xhv_array, ARRAY_ALLOC_BYTES(oldsize));
703 Safefree(xhv->xhv_array);
707 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
708 xhv->xhv_max = --newsize;
712 for (i=0; i<oldsize; i++,aep++) {
713 if (!*aep) /* non-existent */
716 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
717 if ((HeHASH(entry) & newsize) != i) {
718 *oentry = HeNEXT(entry);
719 HeNEXT(entry) = *bep;
726 oentry = &HeNEXT(entry);
728 if (!*aep) /* everything moved */
734 hv_ksplit(HV *hv, IV newmax)
736 register XPVHV* xhv = (XPVHV*)SvANY(hv);
737 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
738 register I32 newsize;
744 register HE **oentry;
746 newsize = (I32) newmax; /* possible truncation here */
747 if (newsize != newmax || newmax <= oldsize)
749 while ((newsize & (1 + ~newsize)) != newsize) {
750 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
752 if (newsize < newmax)
754 if (newsize < newmax)
755 return; /* overflow detection */
760 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
761 Renew(a, ARRAY_ALLOC_BYTES(newsize), char);
767 New(2, a, ARRAY_ALLOC_BYTES(newsize), char);
772 Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char);
774 offer_nice_chunk(xhv->xhv_array, ARRAY_ALLOC_BYTES(oldsize));
777 Safefree(xhv->xhv_array);
780 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
783 Newz(0, a, ARRAY_ALLOC_BYTES(newsize), char);
785 xhv->xhv_max = --newsize;
787 if (!xhv->xhv_fill) /* skip rest if no entries */
791 for (i=0; i<oldsize; i++,aep++) {
792 if (!*aep) /* non-existent */
794 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
795 if ((j = (HeHASH(entry) & newsize)) != i) {
797 *oentry = HeNEXT(entry);
798 if (!(HeNEXT(entry) = aep[j]))
804 oentry = &HeNEXT(entry);
806 if (!*aep) /* everything moved */
817 hv = (HV*)NEWSV(502,0);
818 sv_upgrade((SV *)hv, SVt_PVHV);
819 xhv = (XPVHV*)SvANY(hv);
822 #ifndef NODEFAULT_SHAREKEYS
823 HvSHAREKEYS_on(hv); /* key-sharing on by default */
825 xhv->xhv_max = 7; /* start with 8 buckets */
828 (void)hv_iterinit(hv); /* so each() will start off right */
836 STRLEN hv_max = ohv ? HvMAX(ohv) : 0;
837 STRLEN hv_fill = ohv ? HvFILL(ohv) : 0;
840 while (hv_max && hv_max + 1 >= hv_fill * 2)
841 hv_max = hv_max / 2; /* Is always 2^n-1 */
847 if (! SvTIED_mg((SV*)ohv, 'P')) {
854 I32 hv_riter = HvRITER(ohv); /* current root of iterator */
855 HE *hv_eiter = HvEITER(ohv); /* current entry of iterator */
859 while (entry = hv_iternext(ohv)) {
860 hv_store(hv, HeKEY(entry), HeKLEN(entry),
861 SvREFCNT_inc(HeVAL(entry)), HeHASH(entry));
863 HvRITER(ohv) = hv_riter;
864 HvEITER(ohv) = hv_eiter;
871 hv_free_ent(HV *hv, register HE *entry)
878 if (val && isGV(val) && GvCVu(val) && HvNAME(hv))
879 PL_sub_generation++; /* may be deletion of method from stash */
881 if (HeKLEN(entry) == HEf_SVKEY) {
882 SvREFCNT_dec(HeKEY_sv(entry));
883 Safefree(HeKEY_hek(entry));
885 else if (HvSHAREKEYS(hv))
886 unshare_hek(HeKEY_hek(entry));
888 Safefree(HeKEY_hek(entry));
893 hv_delayfree_ent(HV *hv, register HE *entry)
897 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
898 PL_sub_generation++; /* may be deletion of method from stash */
899 sv_2mortal(HeVAL(entry)); /* free between statements */
900 if (HeKLEN(entry) == HEf_SVKEY) {
901 sv_2mortal(HeKEY_sv(entry));
902 Safefree(HeKEY_hek(entry));
904 else if (HvSHAREKEYS(hv))
905 unshare_hek(HeKEY_hek(entry));
907 Safefree(HeKEY_hek(entry));
917 xhv = (XPVHV*)SvANY(hv);
922 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
933 register HE *oentry = Null(HE*);
949 entry = HeNEXT(entry);
950 hv_free_ent(hv, oentry);
955 entry = array[riter];
958 (void)hv_iterinit(hv);
967 xhv = (XPVHV*)SvANY(hv);
969 Safefree(xhv->xhv_array);
971 Safefree(HvNAME(hv));
975 xhv->xhv_max = 7; /* it's a normal hash */
991 xhv = (XPVHV*)SvANY(hv);
992 entry = xhv->xhv_eiter;
993 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
994 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
997 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
999 hv_free_ent(hv, entry);
1001 xhv->xhv_riter = -1;
1002 xhv->xhv_eiter = Null(HE*);
1003 return xhv->xhv_keys; /* used to be xhv->xhv_fill before 5.004_65 */
1009 register XPVHV* xhv;
1016 xhv = (XPVHV*)SvANY(hv);
1017 oldentry = entry = xhv->xhv_eiter;
1019 if (mg = SvTIED_mg((SV*)hv, 'P')) {
1020 SV *key = sv_newmortal();
1022 sv_setsv(key, HeSVKEY_force(entry));
1023 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
1029 xhv->xhv_eiter = entry = new_he(); /* one HE per MAGICAL hash */
1031 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
1033 HeKEY_hek(entry) = hek;
1034 HeKLEN(entry) = HEf_SVKEY;
1036 magic_nextpack((SV*) hv,mg,key);
1038 /* force key to stay around until next time */
1039 HeSVKEY_set(entry, SvREFCNT_inc(key));
1040 return entry; /* beware, hent_val is not set */
1043 SvREFCNT_dec(HeVAL(entry));
1044 Safefree(HeKEY_hek(entry));
1046 xhv->xhv_eiter = Null(HE*);
1050 if (!xhv->xhv_array)
1051 Newz(506,xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
1053 entry = HeNEXT(entry);
1056 if (xhv->xhv_riter > xhv->xhv_max) {
1057 xhv->xhv_riter = -1;
1060 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
1063 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1065 hv_free_ent(hv, oldentry);
1068 xhv->xhv_eiter = entry;
1073 hv_iterkey(register HE *entry, I32 *retlen)
1075 if (HeKLEN(entry) == HEf_SVKEY) {
1077 char *p = SvPV(HeKEY_sv(entry), len);
1082 *retlen = HeKLEN(entry);
1083 return HeKEY(entry);
1087 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1089 hv_iterkeysv(register HE *entry)
1091 if (HeKLEN(entry) == HEf_SVKEY)
1092 return sv_mortalcopy(HeKEY_sv(entry));
1094 return sv_2mortal(newSVpvn((HeKLEN(entry) ? HeKEY(entry) : ""),
1099 hv_iterval(HV *hv, register HE *entry)
1101 if (SvRMAGICAL(hv)) {
1102 if (mg_find((SV*)hv,'P')) {
1103 SV* sv = sv_newmortal();
1104 if (HeKLEN(entry) == HEf_SVKEY)
1105 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1106 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1110 return HeVAL(entry);
1114 hv_iternextsv(HV *hv, char **key, I32 *retlen)
1117 if ( (he = hv_iternext(hv)) == NULL)
1119 *key = hv_iterkey(he, retlen);
1120 return hv_iterval(hv, he);
1124 hv_magic(HV *hv, GV *gv, int how)
1126 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1130 sharepvn(const char *sv, I32 len, U32 hash)
1132 return HEK_KEY(share_hek(sv, len, hash));
1135 /* possibly free a shared string if no one has access to it
1136 * len and hash must both be valid for str.
1139 unsharepvn(const char *str, I32 len, U32 hash)
1141 register XPVHV* xhv;
1143 register HE **oentry;
1147 /* what follows is the moral equivalent of:
1148 if ((Svp = hv_fetch(PL_strtab, tmpsv, FALSE, hash))) {
1149 if (--*Svp == Nullsv)
1150 hv_delete(PL_strtab, str, len, G_DISCARD, hash);
1152 xhv = (XPVHV*)SvANY(PL_strtab);
1153 /* assert(xhv_array != 0) */
1155 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1156 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1157 if (HeHASH(entry) != hash) /* strings can't be equal */
1159 if (HeKLEN(entry) != len)
1161 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1164 if (--HeVAL(entry) == Nullsv) {
1165 *oentry = HeNEXT(entry);
1168 Safefree(HeKEY_hek(entry));
1174 UNLOCK_STRTAB_MUTEX;
1177 warn("Attempt to free non-existent shared string");
1180 /* get a (constant) string ptr from the global string table
1181 * string will get added if it is not already there.
1182 * len and hash must both be valid for str.
1185 share_hek(const char *str, I32 len, register U32 hash)
1187 register XPVHV* xhv;
1189 register HE **oentry;
1193 /* what follows is the moral equivalent of:
1195 if (!(Svp = hv_fetch(PL_strtab, str, len, FALSE)))
1196 hv_store(PL_strtab, str, len, Nullsv, hash);
1198 xhv = (XPVHV*)SvANY(PL_strtab);
1199 /* assert(xhv_array != 0) */
1201 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1202 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
1203 if (HeHASH(entry) != hash) /* strings can't be equal */
1205 if (HeKLEN(entry) != len)
1207 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1214 HeKEY_hek(entry) = save_hek(str, len, hash);
1215 HeVAL(entry) = Nullsv;
1216 HeNEXT(entry) = *oentry;
1219 if (i) { /* initial entry? */
1221 if (xhv->xhv_keys > xhv->xhv_max)
1226 ++HeVAL(entry); /* use value slot as REFCNT */
1227 UNLOCK_STRTAB_MUTEX;
1228 return HeKEY_hek(entry);