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 hsplit _((HV *hv));
18 static void hfreeentries _((HV *hv));
19 static void hv_magic_check _((HV *hv, bool *needs_copy, bool *needs_store));
20 static HE* more_he _((void));
37 HeNEXT(p) = (HE*)he_root;
46 New(54, he_root, 1008/sizeof(HE), HE);
48 heend = &he[1008 / sizeof(HE) - 1];
50 HeNEXT(he) = (HE*)(he + 1);
58 save_hek(char *str, I32 len, U32 hash)
63 New(54, k, HEK_BASESIZE + len + 1, char);
65 Copy(str, HEK_KEY(hek), len, char);
66 *(HEK_KEY(hek) + len) = '\0';
75 unsharepvn(HEK_KEY(hek),HEK_LEN(hek),HEK_HASH(hek));
78 /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot
82 hv_fetch(HV *hv, char *key, U32 klen, I32 lval)
93 if (mg_find((SV*)hv,'P')) {
96 mg_copy((SV*)hv, sv, key, klen);
100 #ifdef ENV_IS_CASELESS
101 else if (mg_find((SV*)hv,'E')) {
103 for (i = 0; i < klen; ++i)
104 if (isLOWER(key[i])) {
105 char *nkey = strupr(SvPVX(sv_2mortal(newSVpv(key,klen))));
106 SV **ret = hv_fetch(hv, nkey, klen, 0);
108 ret = hv_store(hv, key, klen, NEWSV(61,0), 0);
115 xhv = (XPVHV*)SvANY(hv);
116 if (!xhv->xhv_array) {
118 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
119 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
122 Newz(503,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
127 PERL_HASH(hash, key, klen);
129 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
130 for (; entry; entry = HeNEXT(entry)) {
131 if (HeHASH(entry) != hash) /* strings can't be equal */
133 if (HeKLEN(entry) != klen)
135 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
137 return &HeVAL(entry);
139 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
140 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
143 if ((gotenv = ENV_getenv(key)) != Nullch) {
144 sv = newSVpv(gotenv,strlen(gotenv));
146 return hv_store(hv,key,klen,sv,hash);
150 if (lval) { /* gonna assign to this, so it better be there */
152 return hv_store(hv,key,klen,sv,hash);
157 /* returns a HE * structure with the all fields set */
158 /* note that hent_val will be a mortal sv for MAGICAL hashes */
160 hv_fetch_ent(HV *hv, SV *keysv, I32 lval, register U32 hash)
171 if (SvRMAGICAL(hv)) {
172 if (mg_find((SV*)hv,'P')) {
174 keysv = sv_2mortal(newSVsv(keysv));
175 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
176 if (!HeKEY_hek(&hv_fetch_ent_mh)) {
178 New(54, k, HEK_BASESIZE + sizeof(SV*), char);
179 HeKEY_hek(&hv_fetch_ent_mh) = (HEK*)k;
181 HeSVKEY_set(&hv_fetch_ent_mh, keysv);
182 HeVAL(&hv_fetch_ent_mh) = sv;
183 return &hv_fetch_ent_mh;
185 #ifdef ENV_IS_CASELESS
186 else if (mg_find((SV*)hv,'E')) {
188 key = SvPV(keysv, klen);
189 for (i = 0; i < klen; ++i)
190 if (isLOWER(key[i])) {
191 SV *nkeysv = sv_2mortal(newSVpv(key,klen));
192 (void)strupr(SvPVX(nkeysv));
193 entry = hv_fetch_ent(hv, nkeysv, 0, 0);
195 entry = hv_store_ent(hv, keysv, NEWSV(61,0), hash);
202 xhv = (XPVHV*)SvANY(hv);
203 if (!xhv->xhv_array) {
205 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
206 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
209 Newz(503,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
214 key = SvPV(keysv, klen);
217 PERL_HASH(hash, key, klen);
219 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
220 for (; entry; entry = HeNEXT(entry)) {
221 if (HeHASH(entry) != hash) /* strings can't be equal */
223 if (HeKLEN(entry) != klen)
225 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
229 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
230 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
233 if ((gotenv = ENV_getenv(key)) != Nullch) {
234 sv = newSVpv(gotenv,strlen(gotenv));
236 return hv_store_ent(hv,keysv,sv,hash);
240 if (lval) { /* gonna assign to this, so it better be there */
242 return hv_store_ent(hv,keysv,sv,hash);
248 hv_magic_check (HV *hv, bool *needs_copy, bool *needs_store)
250 MAGIC *mg = SvMAGIC(hv);
254 if (isUPPER(mg->mg_type)) {
256 switch (mg->mg_type) {
259 *needs_store = FALSE;
262 mg = mg->mg_moremagic;
267 hv_store(HV *hv, char *key, U32 klen, SV *val, register U32 hash)
272 register HE **oentry;
277 xhv = (XPVHV*)SvANY(hv);
281 hv_magic_check (hv, &needs_copy, &needs_store);
283 mg_copy((SV*)hv, val, key, klen);
284 if (!xhv->xhv_array && !needs_store)
286 #ifdef ENV_IS_CASELESS
287 else if (mg_find((SV*)hv,'E')) {
288 SV *sv = sv_2mortal(newSVpv(key,klen));
289 key = strupr(SvPVX(sv));
296 PERL_HASH(hash, key, klen);
299 Newz(505, xhv->xhv_array, sizeof(HE**) * (xhv->xhv_max + 1), char);
301 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
304 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
305 if (HeHASH(entry) != hash) /* strings can't be equal */
307 if (HeKLEN(entry) != klen)
309 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
311 SvREFCNT_dec(HeVAL(entry));
313 return &HeVAL(entry);
318 HeKEY_hek(entry) = share_hek(key, klen, hash);
319 else /* gotta do the real thing */
320 HeKEY_hek(entry) = save_hek(key, klen, hash);
322 HeNEXT(entry) = *oentry;
326 if (i) { /* initial entry? */
328 if (xhv->xhv_keys > xhv->xhv_max)
332 return &HeVAL(entry);
336 hv_store_ent(HV *hv, SV *keysv, SV *val, register U32 hash)
343 register HE **oentry;
348 xhv = (XPVHV*)SvANY(hv);
353 hv_magic_check (hv, &needs_copy, &needs_store);
355 bool save_taint = tainted;
357 tainted = SvTAINTED(keysv);
358 keysv = sv_2mortal(newSVsv(keysv));
359 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
360 TAINT_IF(save_taint);
361 if (!xhv->xhv_array && !needs_store)
363 #ifdef ENV_IS_CASELESS
364 else if (mg_find((SV*)hv,'E')) {
365 key = SvPV(keysv, klen);
366 keysv = sv_2mortal(newSVpv(key,klen));
367 (void)strupr(SvPVX(keysv));
374 key = SvPV(keysv, klen);
377 PERL_HASH(hash, key, klen);
380 Newz(505, xhv->xhv_array, sizeof(HE**) * (xhv->xhv_max + 1), char);
382 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
385 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
386 if (HeHASH(entry) != hash) /* strings can't be equal */
388 if (HeKLEN(entry) != klen)
390 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
392 SvREFCNT_dec(HeVAL(entry));
399 HeKEY_hek(entry) = share_hek(key, klen, hash);
400 else /* gotta do the real thing */
401 HeKEY_hek(entry) = save_hek(key, klen, hash);
403 HeNEXT(entry) = *oentry;
407 if (i) { /* initial entry? */
409 if (xhv->xhv_keys > xhv->xhv_max)
417 hv_delete(HV *hv, char *key, U32 klen, I32 flags)
423 register HE **oentry;
429 if (SvRMAGICAL(hv)) {
432 hv_magic_check (hv, &needs_copy, &needs_store);
434 if (needs_copy && (svp = hv_fetch(hv, key, klen, TRUE))) {
438 if (mg_find(sv, 'p')) {
439 sv_unmagic(sv, 'p'); /* No longer an element */
442 return Nullsv; /* element cannot be deleted */
444 #ifdef ENV_IS_CASELESS
445 else if (mg_find((SV*)hv,'E')) {
446 sv = sv_2mortal(newSVpv(key,klen));
447 key = strupr(SvPVX(sv));
452 xhv = (XPVHV*)SvANY(hv);
456 PERL_HASH(hash, key, klen);
458 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
461 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
462 if (HeHASH(entry) != hash) /* strings can't be equal */
464 if (HeKLEN(entry) != klen)
466 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
468 *oentry = HeNEXT(entry);
471 if (flags & G_DISCARD)
474 sv = sv_mortalcopy(HeVAL(entry));
475 if (entry == xhv->xhv_eiter)
478 hv_free_ent(hv, entry);
486 hv_delete_ent(HV *hv, SV *keysv, I32 flags, U32 hash)
493 register HE **oentry;
498 if (SvRMAGICAL(hv)) {
501 hv_magic_check (hv, &needs_copy, &needs_store);
503 if (needs_copy && (entry = hv_fetch_ent(hv, keysv, TRUE, hash))) {
507 if (mg_find(sv, 'p')) {
508 sv_unmagic(sv, 'p'); /* No longer an element */
511 return Nullsv; /* element cannot be deleted */
513 #ifdef ENV_IS_CASELESS
514 else if (mg_find((SV*)hv,'E')) {
515 key = SvPV(keysv, klen);
516 keysv = sv_2mortal(newSVpv(key,klen));
517 (void)strupr(SvPVX(keysv));
523 xhv = (XPVHV*)SvANY(hv);
527 key = SvPV(keysv, klen);
530 PERL_HASH(hash, key, klen);
532 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
535 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
536 if (HeHASH(entry) != hash) /* strings can't be equal */
538 if (HeKLEN(entry) != klen)
540 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
542 *oentry = HeNEXT(entry);
545 if (flags & G_DISCARD)
548 sv = sv_mortalcopy(HeVAL(entry));
549 if (entry == xhv->xhv_eiter)
552 hv_free_ent(hv, entry);
560 hv_exists(HV *hv, char *key, U32 klen)
570 if (SvRMAGICAL(hv)) {
571 if (mg_find((SV*)hv,'P')) {
574 mg_copy((SV*)hv, sv, key, klen);
575 magic_existspack(sv, mg_find(sv, 'p'));
578 #ifdef ENV_IS_CASELESS
579 else if (mg_find((SV*)hv,'E')) {
580 sv = sv_2mortal(newSVpv(key,klen));
581 key = strupr(SvPVX(sv));
586 xhv = (XPVHV*)SvANY(hv);
590 PERL_HASH(hash, key, klen);
592 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
593 for (; entry; entry = HeNEXT(entry)) {
594 if (HeHASH(entry) != hash) /* strings can't be equal */
596 if (HeKLEN(entry) != klen)
598 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
607 hv_exists_ent(HV *hv, SV *keysv, U32 hash)
618 if (SvRMAGICAL(hv)) {
619 if (mg_find((SV*)hv,'P')) {
620 dTHR; /* just for SvTRUE */
622 keysv = sv_2mortal(newSVsv(keysv));
623 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
624 magic_existspack(sv, mg_find(sv, 'p'));
627 #ifdef ENV_IS_CASELESS
628 else if (mg_find((SV*)hv,'E')) {
629 key = SvPV(keysv, klen);
630 keysv = sv_2mortal(newSVpv(key,klen));
631 (void)strupr(SvPVX(keysv));
637 xhv = (XPVHV*)SvANY(hv);
641 key = SvPV(keysv, klen);
643 PERL_HASH(hash, key, klen);
645 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
646 for (; entry; entry = HeNEXT(entry)) {
647 if (HeHASH(entry) != hash) /* strings can't be equal */
649 if (HeKLEN(entry) != klen)
651 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
661 register XPVHV* xhv = (XPVHV*)SvANY(hv);
662 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
663 register I32 newsize = oldsize * 2;
668 register HE **oentry;
669 #ifndef STRANGE_MALLOC
673 a = (HE**)xhv->xhv_array;
675 #ifdef STRANGE_MALLOC
676 Renew(a, newsize, HE*);
682 i = newsize * sizeof(HE*);
683 #define MALLOC_OVERHEAD 16
684 tmp = MALLOC_OVERHEAD;
685 while (tmp - MALLOC_OVERHEAD < i)
687 tmp -= MALLOC_OVERHEAD;
689 assert(tmp >= newsize);
695 Copy(xhv->xhv_array, a, oldsize, HE*);
697 offer_nice_chunk(xhv->xhv_array,
698 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
701 Safefree(xhv->xhv_array);
705 Zero(&a[oldsize], oldsize, HE*); /* zero 2nd half*/
706 xhv->xhv_max = --newsize;
707 xhv->xhv_array = (char*)a;
709 for (i=0; i<oldsize; i++,a++) {
710 if (!*a) /* non-existent */
713 for (oentry = a, entry = *a; entry; entry = *oentry) {
714 if ((HeHASH(entry) & newsize) != i) {
715 *oentry = HeNEXT(entry);
723 oentry = &HeNEXT(entry);
725 if (!*a) /* everything moved */
731 hv_ksplit(HV *hv, IV newmax)
733 register XPVHV* xhv = (XPVHV*)SvANY(hv);
734 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
735 register I32 newsize;
740 register HE **oentry;
742 newsize = (I32) newmax; /* possible truncation here */
743 if (newsize != newmax || newmax <= oldsize)
745 while ((newsize & (1 + ~newsize)) != newsize) {
746 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
748 if (newsize < newmax)
750 if (newsize < newmax)
751 return; /* overflow detection */
753 a = (HE**)xhv->xhv_array;
756 #ifdef STRANGE_MALLOC
757 Renew(a, newsize, HE*);
763 i = newsize * sizeof(HE*);
765 while (j - MALLOC_OVERHEAD < i)
767 j -= MALLOC_OVERHEAD;
769 assert(j >= newsize);
775 Copy(xhv->xhv_array, a, oldsize, HE*);
777 offer_nice_chunk(xhv->xhv_array,
778 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
781 Safefree(xhv->xhv_array);
784 Zero(&a[oldsize], newsize-oldsize, HE*); /* zero 2nd half*/
787 Newz(0, a, newsize, HE*);
789 xhv->xhv_max = --newsize;
790 xhv->xhv_array = (char*)a;
791 if (!xhv->xhv_fill) /* skip rest if no entries */
794 for (i=0; i<oldsize; i++,a++) {
795 if (!*a) /* non-existent */
797 for (oentry = a, entry = *a; entry; entry = *oentry) {
798 if ((j = (HeHASH(entry) & newsize)) != i) {
800 *oentry = HeNEXT(entry);
801 if (!(HeNEXT(entry) = a[j]))
807 oentry = &HeNEXT(entry);
809 if (!*a) /* everything moved */
820 hv = (HV*)NEWSV(502,0);
821 sv_upgrade((SV *)hv, SVt_PVHV);
822 xhv = (XPVHV*)SvANY(hv);
825 #ifndef NODEFAULT_SHAREKEYS
826 HvSHAREKEYS_on(hv); /* key-sharing on by default */
828 xhv->xhv_max = 7; /* start with 8 buckets */
831 (void)hv_iterinit(hv); /* so each() will start off right */
836 hv_free_ent(HV *hv, register HE *entry)
840 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
841 sub_generation++; /* may be deletion of method from stash */
842 SvREFCNT_dec(HeVAL(entry));
843 if (HeKLEN(entry) == HEf_SVKEY) {
844 SvREFCNT_dec(HeKEY_sv(entry));
845 Safefree(HeKEY_hek(entry));
847 else if (HvSHAREKEYS(hv))
848 unshare_hek(HeKEY_hek(entry));
850 Safefree(HeKEY_hek(entry));
855 hv_delayfree_ent(HV *hv, register HE *entry)
859 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
860 sub_generation++; /* may be deletion of method from stash */
861 sv_2mortal(HeVAL(entry)); /* free between statements */
862 if (HeKLEN(entry) == HEf_SVKEY) {
863 sv_2mortal(HeKEY_sv(entry));
864 Safefree(HeKEY_hek(entry));
866 else if (HvSHAREKEYS(hv))
867 unshare_hek(HeKEY_hek(entry));
869 Safefree(HeKEY_hek(entry));
879 xhv = (XPVHV*)SvANY(hv);
884 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
895 register HE *oentry = Null(HE*);
911 entry = HeNEXT(entry);
912 hv_free_ent(hv, oentry);
917 entry = array[riter];
920 (void)hv_iterinit(hv);
929 xhv = (XPVHV*)SvANY(hv);
931 Safefree(xhv->xhv_array);
933 Safefree(HvNAME(hv));
937 xhv->xhv_max = 7; /* it's a normal hash */
953 xhv = (XPVHV*)SvANY(hv);
954 entry = xhv->xhv_eiter;
955 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
956 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
959 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
961 hv_free_ent(hv, entry);
964 xhv->xhv_eiter = Null(HE*);
965 return xhv->xhv_fill; /* should be xhv->xhv_keys? May change later */
978 xhv = (XPVHV*)SvANY(hv);
979 oldentry = entry = xhv->xhv_eiter;
981 if (SvRMAGICAL(hv) && (mg = mg_find((SV*)hv,'P'))) {
982 SV *key = sv_newmortal();
984 sv_setsv(key, HeSVKEY_force(entry));
985 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
991 xhv->xhv_eiter = entry = new_he(); /* one HE per MAGICAL hash */
993 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
995 HeKEY_hek(entry) = hek;
996 HeKLEN(entry) = HEf_SVKEY;
998 magic_nextpack((SV*) hv,mg,key);
1000 /* force key to stay around until next time */
1001 HeSVKEY_set(entry, SvREFCNT_inc(key));
1002 return entry; /* beware, hent_val is not set */
1005 SvREFCNT_dec(HeVAL(entry));
1006 Safefree(HeKEY_hek(entry));
1008 xhv->xhv_eiter = Null(HE*);
1012 if (!xhv->xhv_array)
1013 Newz(506,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
1015 entry = HeNEXT(entry);
1018 if (xhv->xhv_riter > xhv->xhv_max) {
1019 xhv->xhv_riter = -1;
1022 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
1025 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1027 hv_free_ent(hv, oldentry);
1030 xhv->xhv_eiter = entry;
1035 hv_iterkey(register HE *entry, I32 *retlen)
1037 if (HeKLEN(entry) == HEf_SVKEY) {
1039 char *p = SvPV(HeKEY_sv(entry), len);
1044 *retlen = HeKLEN(entry);
1045 return HeKEY(entry);
1049 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1051 hv_iterkeysv(register HE *entry)
1053 if (HeKLEN(entry) == HEf_SVKEY)
1054 return sv_mortalcopy(HeKEY_sv(entry));
1056 return sv_2mortal(newSVpv((HeKLEN(entry) ? HeKEY(entry) : ""),
1061 hv_iterval(HV *hv, register HE *entry)
1063 if (SvRMAGICAL(hv)) {
1064 if (mg_find((SV*)hv,'P')) {
1065 SV* sv = sv_newmortal();
1066 if (HeKLEN(entry) == HEf_SVKEY)
1067 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1068 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1072 return HeVAL(entry);
1076 hv_iternextsv(HV *hv, char **key, I32 *retlen)
1079 if ( (he = hv_iternext(hv)) == NULL)
1081 *key = hv_iterkey(he, retlen);
1082 return hv_iterval(hv, he);
1086 hv_magic(HV *hv, GV *gv, int how)
1088 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1092 sharepvn(char *sv, I32 len, U32 hash)
1094 return HEK_KEY(share_hek(sv, len, hash));
1097 /* possibly free a shared string if no one has access to it
1098 * len and hash must both be valid for str.
1101 unsharepvn(char *str, I32 len, U32 hash)
1103 register XPVHV* xhv;
1105 register HE **oentry;
1109 /* what follows is the moral equivalent of:
1110 if ((Svp = hv_fetch(strtab, tmpsv, FALSE, hash))) {
1111 if (--*Svp == Nullsv)
1112 hv_delete(strtab, str, len, G_DISCARD, hash);
1114 xhv = (XPVHV*)SvANY(strtab);
1115 /* assert(xhv_array != 0) */
1116 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1117 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1118 if (HeHASH(entry) != hash) /* strings can't be equal */
1120 if (HeKLEN(entry) != len)
1122 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1125 if (--HeVAL(entry) == Nullsv) {
1126 *oentry = HeNEXT(entry);
1129 Safefree(HeKEY_hek(entry));
1137 warn("Attempt to free non-existent shared string");
1140 /* get a (constant) string ptr from the global string table
1141 * string will get added if it is not already there.
1142 * len and hash must both be valid for str.
1145 share_hek(char *str, I32 len, register U32 hash)
1147 register XPVHV* xhv;
1149 register HE **oentry;
1153 /* what follows is the moral equivalent of:
1155 if (!(Svp = hv_fetch(strtab, str, len, FALSE)))
1156 hv_store(strtab, str, len, Nullsv, 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, entry = HeNEXT(entry)) {
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? */
1173 HeKEY_hek(entry) = save_hek(str, len, hash);
1174 HeVAL(entry) = Nullsv;
1175 HeNEXT(entry) = *oentry;
1178 if (i) { /* initial entry? */
1180 if (xhv->xhv_keys > xhv->xhv_max)
1185 ++HeVAL(entry); /* use value slot as REFCNT */
1186 return HeKEY_hek(entry);