3 * Copyright (c) 1991-1997, 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 HE* more_he _((void));
39 HeNEXT(p) = (HE*)he_root;
48 New(54, he_root, 1008/sizeof(HE), HE);
50 heend = &he[1008 / sizeof(HE) - 1];
52 HeNEXT(he) = (HE*)(he + 1);
60 save_hek(char *str, I32 len, U32 hash)
65 New(54, k, HEK_BASESIZE + len + 1, char);
67 Copy(str, HEK_KEY(hek), len, char);
68 *(HEK_KEY(hek) + len) = '\0';
77 unsharepvn(HEK_KEY(hek),HEK_LEN(hek),HEK_HASH(hek));
80 /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot
84 hv_fetch(HV *hv, char *key, U32 klen, I32 lval)
95 if (mg_find((SV*)hv,'P')) {
98 mg_copy((SV*)hv, sv, key, klen);
102 #ifdef ENV_IS_CASELESS
103 else if (mg_find((SV*)hv,'E')) {
105 for (i = 0; i < klen; ++i)
106 if (isLOWER(key[i])) {
107 char *nkey = strupr(SvPVX(sv_2mortal(newSVpv(key,klen))));
108 SV **ret = hv_fetch(hv, nkey, klen, 0);
110 ret = hv_store(hv, key, klen, NEWSV(61,0), 0);
117 xhv = (XPVHV*)SvANY(hv);
118 if (!xhv->xhv_array) {
120 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
121 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
124 Newz(503,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
129 PERL_HASH(hash, key, klen);
131 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
132 for (; entry; entry = HeNEXT(entry)) {
133 if (HeHASH(entry) != hash) /* strings can't be equal */
135 if (HeKLEN(entry) != klen)
137 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
139 return &HeVAL(entry);
141 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
142 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
145 if ((gotenv = PerlEnv_getenv(key)) != Nullch) {
146 sv = newSVpv(gotenv,strlen(gotenv));
148 return hv_store(hv,key,klen,sv,hash);
152 if (lval) { /* gonna assign to this, so it better be there */
154 return hv_store(hv,key,klen,sv,hash);
159 /* returns a HE * structure with the all fields set */
160 /* note that hent_val will be a mortal sv for MAGICAL hashes */
162 hv_fetch_ent(HV *hv, SV *keysv, I32 lval, register U32 hash)
173 if (SvRMAGICAL(hv)) {
174 if (mg_find((SV*)hv,'P')) {
177 keysv = sv_2mortal(newSVsv(keysv));
178 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
179 if (!HeKEY_hek(&hv_fetch_ent_mh)) {
181 New(54, k, HEK_BASESIZE + sizeof(SV*), char);
182 HeKEY_hek(&hv_fetch_ent_mh) = (HEK*)k;
184 HeSVKEY_set(&hv_fetch_ent_mh, keysv);
185 HeVAL(&hv_fetch_ent_mh) = sv;
186 return &hv_fetch_ent_mh;
188 #ifdef ENV_IS_CASELESS
189 else if (mg_find((SV*)hv,'E')) {
191 key = SvPV(keysv, klen);
192 for (i = 0; i < klen; ++i)
193 if (isLOWER(key[i])) {
194 SV *nkeysv = sv_2mortal(newSVpv(key,klen));
195 (void)strupr(SvPVX(nkeysv));
196 entry = hv_fetch_ent(hv, nkeysv, 0, 0);
198 entry = hv_store_ent(hv, keysv, NEWSV(61,0), hash);
205 xhv = (XPVHV*)SvANY(hv);
206 if (!xhv->xhv_array) {
208 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
209 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
212 Newz(503,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
217 key = SvPV(keysv, klen);
220 PERL_HASH(hash, key, klen);
222 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
223 for (; entry; entry = HeNEXT(entry)) {
224 if (HeHASH(entry) != hash) /* strings can't be equal */
226 if (HeKLEN(entry) != klen)
228 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
232 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
233 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
236 if ((gotenv = PerlEnv_getenv(key)) != Nullch) {
237 sv = newSVpv(gotenv,strlen(gotenv));
239 return hv_store_ent(hv,keysv,sv,hash);
243 if (lval) { /* gonna assign to this, so it better be there */
245 return hv_store_ent(hv,keysv,sv,hash);
251 hv_magic_check (HV *hv, bool *needs_copy, bool *needs_store)
253 MAGIC *mg = SvMAGIC(hv);
257 if (isUPPER(mg->mg_type)) {
259 switch (mg->mg_type) {
262 *needs_store = FALSE;
265 mg = mg->mg_moremagic;
270 hv_store(HV *hv, char *key, U32 klen, SV *val, register U32 hash)
275 register HE **oentry;
280 xhv = (XPVHV*)SvANY(hv);
284 hv_magic_check (hv, &needs_copy, &needs_store);
286 mg_copy((SV*)hv, val, key, klen);
287 if (!xhv->xhv_array && !needs_store)
289 #ifdef ENV_IS_CASELESS
290 else if (mg_find((SV*)hv,'E')) {
291 SV *sv = sv_2mortal(newSVpv(key,klen));
292 key = strupr(SvPVX(sv));
299 PERL_HASH(hash, key, klen);
302 Newz(505, xhv->xhv_array, sizeof(HE**) * (xhv->xhv_max + 1), char);
304 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
307 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
308 if (HeHASH(entry) != hash) /* strings can't be equal */
310 if (HeKLEN(entry) != klen)
312 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
314 SvREFCNT_dec(HeVAL(entry));
316 return &HeVAL(entry);
321 HeKEY_hek(entry) = share_hek(key, klen, hash);
322 else /* gotta do the real thing */
323 HeKEY_hek(entry) = save_hek(key, klen, hash);
325 HeNEXT(entry) = *oentry;
329 if (i) { /* initial entry? */
331 if (xhv->xhv_keys > xhv->xhv_max)
335 return &HeVAL(entry);
339 hv_store_ent(HV *hv, SV *keysv, SV *val, register U32 hash)
346 register HE **oentry;
351 xhv = (XPVHV*)SvANY(hv);
356 hv_magic_check (hv, &needs_copy, &needs_store);
358 bool save_taint = tainted;
360 tainted = SvTAINTED(keysv);
361 keysv = sv_2mortal(newSVsv(keysv));
362 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
363 TAINT_IF(save_taint);
364 if (!xhv->xhv_array && !needs_store)
366 #ifdef ENV_IS_CASELESS
367 else if (mg_find((SV*)hv,'E')) {
368 key = SvPV(keysv, klen);
369 keysv = sv_2mortal(newSVpv(key,klen));
370 (void)strupr(SvPVX(keysv));
377 key = SvPV(keysv, klen);
380 PERL_HASH(hash, key, klen);
383 Newz(505, xhv->xhv_array, sizeof(HE**) * (xhv->xhv_max + 1), char);
385 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
388 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
389 if (HeHASH(entry) != hash) /* strings can't be equal */
391 if (HeKLEN(entry) != klen)
393 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
395 SvREFCNT_dec(HeVAL(entry));
402 HeKEY_hek(entry) = share_hek(key, klen, hash);
403 else /* gotta do the real thing */
404 HeKEY_hek(entry) = save_hek(key, klen, hash);
406 HeNEXT(entry) = *oentry;
410 if (i) { /* initial entry? */
412 if (xhv->xhv_keys > xhv->xhv_max)
420 hv_delete(HV *hv, char *key, U32 klen, I32 flags)
426 register HE **oentry;
432 if (SvRMAGICAL(hv)) {
435 hv_magic_check (hv, &needs_copy, &needs_store);
437 if (needs_copy && (svp = hv_fetch(hv, key, klen, TRUE))) {
441 if (mg_find(sv, 'p')) {
442 sv_unmagic(sv, 'p'); /* No longer an element */
445 return Nullsv; /* element cannot be deleted */
447 #ifdef ENV_IS_CASELESS
448 else if (mg_find((SV*)hv,'E')) {
449 sv = sv_2mortal(newSVpv(key,klen));
450 key = strupr(SvPVX(sv));
455 xhv = (XPVHV*)SvANY(hv);
459 PERL_HASH(hash, key, klen);
461 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
464 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
465 if (HeHASH(entry) != hash) /* strings can't be equal */
467 if (HeKLEN(entry) != klen)
469 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
471 *oentry = HeNEXT(entry);
474 if (flags & G_DISCARD)
477 sv = sv_mortalcopy(HeVAL(entry));
478 if (entry == xhv->xhv_eiter)
481 hv_free_ent(hv, entry);
489 hv_delete_ent(HV *hv, SV *keysv, I32 flags, U32 hash)
496 register HE **oentry;
501 if (SvRMAGICAL(hv)) {
504 hv_magic_check (hv, &needs_copy, &needs_store);
506 if (needs_copy && (entry = hv_fetch_ent(hv, keysv, TRUE, hash))) {
510 if (mg_find(sv, 'p')) {
511 sv_unmagic(sv, 'p'); /* No longer an element */
514 return Nullsv; /* element cannot be deleted */
516 #ifdef ENV_IS_CASELESS
517 else if (mg_find((SV*)hv,'E')) {
518 key = SvPV(keysv, klen);
519 keysv = sv_2mortal(newSVpv(key,klen));
520 (void)strupr(SvPVX(keysv));
526 xhv = (XPVHV*)SvANY(hv);
530 key = SvPV(keysv, klen);
533 PERL_HASH(hash, key, klen);
535 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
538 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
539 if (HeHASH(entry) != hash) /* strings can't be equal */
541 if (HeKLEN(entry) != klen)
543 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
545 *oentry = HeNEXT(entry);
548 if (flags & G_DISCARD)
551 sv = sv_mortalcopy(HeVAL(entry));
552 if (entry == xhv->xhv_eiter)
555 hv_free_ent(hv, entry);
563 hv_exists(HV *hv, char *key, U32 klen)
573 if (SvRMAGICAL(hv)) {
574 if (mg_find((SV*)hv,'P')) {
577 mg_copy((SV*)hv, sv, key, klen);
578 magic_existspack(sv, mg_find(sv, 'p'));
581 #ifdef ENV_IS_CASELESS
582 else if (mg_find((SV*)hv,'E')) {
583 sv = sv_2mortal(newSVpv(key,klen));
584 key = strupr(SvPVX(sv));
589 xhv = (XPVHV*)SvANY(hv);
593 PERL_HASH(hash, key, klen);
595 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
596 for (; entry; entry = HeNEXT(entry)) {
597 if (HeHASH(entry) != hash) /* strings can't be equal */
599 if (HeKLEN(entry) != klen)
601 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
610 hv_exists_ent(HV *hv, SV *keysv, U32 hash)
621 if (SvRMAGICAL(hv)) {
622 if (mg_find((SV*)hv,'P')) {
623 dTHR; /* just for SvTRUE */
625 keysv = sv_2mortal(newSVsv(keysv));
626 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
627 magic_existspack(sv, mg_find(sv, 'p'));
630 #ifdef ENV_IS_CASELESS
631 else if (mg_find((SV*)hv,'E')) {
632 key = SvPV(keysv, klen);
633 keysv = sv_2mortal(newSVpv(key,klen));
634 (void)strupr(SvPVX(keysv));
640 xhv = (XPVHV*)SvANY(hv);
644 key = SvPV(keysv, klen);
646 PERL_HASH(hash, key, klen);
648 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
649 for (; entry; entry = HeNEXT(entry)) {
650 if (HeHASH(entry) != hash) /* strings can't be equal */
652 if (HeKLEN(entry) != klen)
654 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
664 register XPVHV* xhv = (XPVHV*)SvANY(hv);
665 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
666 register I32 newsize = oldsize * 2;
668 register HE **a = (HE**)xhv->xhv_array;
671 register HE **oentry;
672 #ifndef STRANGE_MALLOC
677 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
678 Renew(a, newsize, HE*);
684 i = newsize * sizeof(HE*);
685 #define MALLOC_OVERHEAD 16
686 tmp = MALLOC_OVERHEAD;
687 while (tmp - MALLOC_OVERHEAD < i)
689 tmp -= MALLOC_OVERHEAD;
691 assert(tmp >= newsize);
697 Copy(xhv->xhv_array, a, oldsize, HE*);
699 offer_nice_chunk(xhv->xhv_array,
700 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
703 Safefree(xhv->xhv_array);
707 Zero(&a[oldsize], oldsize, HE*); /* zero 2nd half*/
708 xhv->xhv_max = --newsize;
709 xhv->xhv_array = (char*)a;
711 for (i=0; i<oldsize; i++,a++) {
712 if (!*a) /* non-existent */
715 for (oentry = a, entry = *a; entry; entry = *oentry) {
716 if ((HeHASH(entry) & newsize) != i) {
717 *oentry = HeNEXT(entry);
725 oentry = &HeNEXT(entry);
727 if (!*a) /* everything moved */
733 hv_ksplit(HV *hv, IV newmax)
735 register XPVHV* xhv = (XPVHV*)SvANY(hv);
736 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
737 register I32 newsize;
742 register HE **oentry;
744 newsize = (I32) newmax; /* possible truncation here */
745 if (newsize != newmax || newmax <= oldsize)
747 while ((newsize & (1 + ~newsize)) != newsize) {
748 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
750 if (newsize < newmax)
752 if (newsize < newmax)
753 return; /* overflow detection */
755 a = (HE**)xhv->xhv_array;
758 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
759 Renew(a, newsize, HE*);
765 i = newsize * sizeof(HE*);
767 while (j - MALLOC_OVERHEAD < i)
769 j -= MALLOC_OVERHEAD;
771 assert(j >= newsize);
777 Copy(xhv->xhv_array, a, oldsize, HE*);
779 offer_nice_chunk(xhv->xhv_array,
780 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
783 Safefree(xhv->xhv_array);
786 Zero(&a[oldsize], newsize-oldsize, HE*); /* zero 2nd half*/
789 Newz(0, a, newsize, HE*);
791 xhv->xhv_max = --newsize;
792 xhv->xhv_array = (char*)a;
793 if (!xhv->xhv_fill) /* skip rest if no entries */
796 for (i=0; i<oldsize; i++,a++) {
797 if (!*a) /* non-existent */
799 for (oentry = a, entry = *a; entry; entry = *oentry) {
800 if ((j = (HeHASH(entry) & newsize)) != i) {
802 *oentry = HeNEXT(entry);
803 if (!(HeNEXT(entry) = a[j]))
809 oentry = &HeNEXT(entry);
811 if (!*a) /* everything moved */
822 hv = (HV*)NEWSV(502,0);
823 sv_upgrade((SV *)hv, SVt_PVHV);
824 xhv = (XPVHV*)SvANY(hv);
827 #ifndef NODEFAULT_SHAREKEYS
828 HvSHAREKEYS_on(hv); /* key-sharing on by default */
830 xhv->xhv_max = 7; /* start with 8 buckets */
833 (void)hv_iterinit(hv); /* so each() will start off right */
842 STRLEN hv_max = ohv ? HvMAX(ohv) : 0;
843 STRLEN hv_fill = ohv ? HvFILL(ohv) : 0;
846 while (hv_max && hv_max + 1 >= hv_fill * 2)
847 hv_max = hv_max / 2; /* Is always 2^n-1 */
848 ((XPVHV*)SvANY(hv))->xhv_max = hv_max;
853 if (!SvRMAGICAL(ohv) || !mg_find((SV*)ohv,'P')) {
860 I32 hv_riter = HvRITER(ohv); /* current root of iterator */
861 HE *hv_eiter = HvEITER(ohv); /* current entry of iterator */
865 while (entry = hv_iternext(ohv)) {
866 hv_store(hv, HeKEY(entry), HeKLEN(entry),
867 SvREFCNT_inc(HeVAL(entry)), HeHASH(entry));
869 HvRITER(ohv) = hv_riter;
870 HvEITER(ohv) = hv_eiter;
877 hv_free_ent(HV *hv, register HE *entry)
884 if (val && isGV(val) && GvCVu(val) && HvNAME(hv))
885 sub_generation++; /* may be deletion of method from stash */
887 if (HeKLEN(entry) == HEf_SVKEY) {
888 SvREFCNT_dec(HeKEY_sv(entry));
889 Safefree(HeKEY_hek(entry));
891 else if (HvSHAREKEYS(hv))
892 unshare_hek(HeKEY_hek(entry));
894 Safefree(HeKEY_hek(entry));
899 hv_delayfree_ent(HV *hv, register HE *entry)
903 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
904 sub_generation++; /* may be deletion of method from stash */
905 sv_2mortal(HeVAL(entry)); /* free between statements */
906 if (HeKLEN(entry) == HEf_SVKEY) {
907 sv_2mortal(HeKEY_sv(entry));
908 Safefree(HeKEY_hek(entry));
910 else if (HvSHAREKEYS(hv))
911 unshare_hek(HeKEY_hek(entry));
913 Safefree(HeKEY_hek(entry));
923 xhv = (XPVHV*)SvANY(hv);
928 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
939 register HE *oentry = Null(HE*);
955 entry = HeNEXT(entry);
956 hv_free_ent(hv, oentry);
961 entry = array[riter];
964 (void)hv_iterinit(hv);
973 xhv = (XPVHV*)SvANY(hv);
975 Safefree(xhv->xhv_array);
977 Safefree(HvNAME(hv));
981 xhv->xhv_max = 7; /* it's a normal hash */
997 xhv = (XPVHV*)SvANY(hv);
998 entry = xhv->xhv_eiter;
999 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
1000 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
1003 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1005 hv_free_ent(hv, entry);
1007 xhv->xhv_riter = -1;
1008 xhv->xhv_eiter = Null(HE*);
1009 return xhv->xhv_keys; /* used to be xhv->xhv_fill before 5.004_65 */
1015 register XPVHV* xhv;
1022 xhv = (XPVHV*)SvANY(hv);
1023 oldentry = entry = xhv->xhv_eiter;
1025 if (SvRMAGICAL(hv) && (mg = mg_find((SV*)hv,'P'))) {
1026 SV *key = sv_newmortal();
1028 sv_setsv(key, HeSVKEY_force(entry));
1029 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
1035 xhv->xhv_eiter = entry = new_he(); /* one HE per MAGICAL hash */
1037 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
1039 HeKEY_hek(entry) = hek;
1040 HeKLEN(entry) = HEf_SVKEY;
1042 magic_nextpack((SV*) hv,mg,key);
1044 /* force key to stay around until next time */
1045 HeSVKEY_set(entry, SvREFCNT_inc(key));
1046 return entry; /* beware, hent_val is not set */
1049 SvREFCNT_dec(HeVAL(entry));
1050 Safefree(HeKEY_hek(entry));
1052 xhv->xhv_eiter = Null(HE*);
1056 if (!xhv->xhv_array)
1057 Newz(506,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
1059 entry = HeNEXT(entry);
1062 if (xhv->xhv_riter > xhv->xhv_max) {
1063 xhv->xhv_riter = -1;
1066 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
1069 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1071 hv_free_ent(hv, oldentry);
1074 xhv->xhv_eiter = entry;
1079 hv_iterkey(register HE *entry, I32 *retlen)
1081 if (HeKLEN(entry) == HEf_SVKEY) {
1083 char *p = SvPV(HeKEY_sv(entry), len);
1088 *retlen = HeKLEN(entry);
1089 return HeKEY(entry);
1093 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1095 hv_iterkeysv(register HE *entry)
1097 if (HeKLEN(entry) == HEf_SVKEY)
1098 return sv_mortalcopy(HeKEY_sv(entry));
1100 return sv_2mortal(newSVpv((HeKLEN(entry) ? HeKEY(entry) : ""),
1105 hv_iterval(HV *hv, register HE *entry)
1107 if (SvRMAGICAL(hv)) {
1108 if (mg_find((SV*)hv,'P')) {
1109 SV* sv = sv_newmortal();
1110 if (HeKLEN(entry) == HEf_SVKEY)
1111 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1112 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1116 return HeVAL(entry);
1120 hv_iternextsv(HV *hv, char **key, I32 *retlen)
1123 if ( (he = hv_iternext(hv)) == NULL)
1125 *key = hv_iterkey(he, retlen);
1126 return hv_iterval(hv, he);
1130 hv_magic(HV *hv, GV *gv, int how)
1132 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1136 sharepvn(char *sv, I32 len, U32 hash)
1138 return HEK_KEY(share_hek(sv, len, hash));
1141 /* possibly free a shared string if no one has access to it
1142 * len and hash must both be valid for str.
1145 unsharepvn(char *str, I32 len, U32 hash)
1147 register XPVHV* xhv;
1149 register HE **oentry;
1153 /* what follows is the moral equivalent of:
1154 if ((Svp = hv_fetch(strtab, tmpsv, FALSE, hash))) {
1155 if (--*Svp == Nullsv)
1156 hv_delete(strtab, str, len, G_DISCARD, hash);
1158 xhv = (XPVHV*)SvANY(strtab);
1159 /* assert(xhv_array != 0) */
1160 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1161 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1162 if (HeHASH(entry) != hash) /* strings can't be equal */
1164 if (HeKLEN(entry) != len)
1166 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1169 if (--HeVAL(entry) == Nullsv) {
1170 *oentry = HeNEXT(entry);
1173 Safefree(HeKEY_hek(entry));
1181 warn("Attempt to free non-existent shared string");
1184 /* get a (constant) string ptr from the global string table
1185 * string will get added if it is not already there.
1186 * len and hash must both be valid for str.
1189 share_hek(char *str, I32 len, register U32 hash)
1191 register XPVHV* xhv;
1193 register HE **oentry;
1197 /* what follows is the moral equivalent of:
1199 if (!(Svp = hv_fetch(strtab, str, len, FALSE)))
1200 hv_store(strtab, str, len, Nullsv, hash);
1202 xhv = (XPVHV*)SvANY(strtab);
1203 /* assert(xhv_array != 0) */
1204 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1205 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
1206 if (HeHASH(entry) != hash) /* strings can't be equal */
1208 if (HeKLEN(entry) != len)
1210 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1217 HeKEY_hek(entry) = save_hek(str, len, hash);
1218 HeVAL(entry) = Nullsv;
1219 HeNEXT(entry) = *oentry;
1222 if (i) { /* initial entry? */
1224 if (xhv->xhv_keys > xhv->xhv_max)
1229 ++HeVAL(entry); /* use value slot as REFCNT */
1230 return HeKEY_hek(entry);