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 he_root = (HE*)safemalloc(1008);
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 = ENV_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')) {
178 keysv = sv_2mortal(newSVsv(keysv));
179 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
180 if (!HeKEY_hek(&mh)) {
182 New(54, k, HEK_BASESIZE + sizeof(SV*), char);
183 HeKEY_hek(&mh) = (HEK*)k;
185 HeSVKEY_set(&mh, keysv);
189 #ifdef ENV_IS_CASELESS
190 else if (mg_find((SV*)hv,'E')) {
192 key = SvPV(keysv, klen);
193 for (i = 0; i < klen; ++i)
194 if (isLOWER(key[i])) {
195 SV *nkeysv = sv_2mortal(newSVpv(key,klen));
196 (void)strupr(SvPVX(nkeysv));
197 entry = hv_fetch_ent(hv, nkeysv, 0, 0);
199 entry = hv_store_ent(hv, keysv, NEWSV(61,0), hash);
206 xhv = (XPVHV*)SvANY(hv);
207 if (!xhv->xhv_array) {
209 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
210 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
213 Newz(503,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
218 key = SvPV(keysv, klen);
221 PERL_HASH(hash, key, klen);
223 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
224 for (; entry; entry = HeNEXT(entry)) {
225 if (HeHASH(entry) != hash) /* strings can't be equal */
227 if (HeKLEN(entry) != klen)
229 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
233 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
234 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
237 if ((gotenv = ENV_getenv(key)) != Nullch) {
238 sv = newSVpv(gotenv,strlen(gotenv));
240 return hv_store_ent(hv,keysv,sv,hash);
244 if (lval) { /* gonna assign to this, so it better be there */
246 return hv_store_ent(hv,keysv,sv,hash);
252 hv_magic_check (HV *hv, bool *needs_copy, bool *needs_store)
254 MAGIC *mg = SvMAGIC(hv);
258 if (isUPPER(mg->mg_type)) {
260 switch (mg->mg_type) {
263 *needs_store = FALSE;
266 mg = mg->mg_moremagic;
271 hv_store(HV *hv, char *key, U32 klen, SV *val, register U32 hash)
276 register HE **oentry;
281 xhv = (XPVHV*)SvANY(hv);
285 hv_magic_check (hv, &needs_copy, &needs_store);
287 mg_copy((SV*)hv, val, key, klen);
288 if (!xhv->xhv_array && !needs_store)
290 #ifdef ENV_IS_CASELESS
291 else if (mg_find((SV*)hv,'E')) {
292 SV *sv = sv_2mortal(newSVpv(key,klen));
293 key = strupr(SvPVX(sv));
300 PERL_HASH(hash, key, klen);
303 Newz(505, xhv->xhv_array, sizeof(HE**) * (xhv->xhv_max + 1), char);
305 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
308 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
309 if (HeHASH(entry) != hash) /* strings can't be equal */
311 if (HeKLEN(entry) != klen)
313 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
315 SvREFCNT_dec(HeVAL(entry));
317 return &HeVAL(entry);
322 HeKEY_hek(entry) = share_hek(key, klen, hash);
323 else /* gotta do the real thing */
324 HeKEY_hek(entry) = save_hek(key, klen, hash);
326 HeNEXT(entry) = *oentry;
330 if (i) { /* initial entry? */
332 if (xhv->xhv_keys > xhv->xhv_max)
336 return &HeVAL(entry);
340 hv_store_ent(HV *hv, SV *keysv, SV *val, register U32 hash)
347 register HE **oentry;
352 xhv = (XPVHV*)SvANY(hv);
357 hv_magic_check (hv, &needs_copy, &needs_store);
359 bool save_taint = tainted;
361 tainted = SvTAINTED(keysv);
362 keysv = sv_2mortal(newSVsv(keysv));
363 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
364 TAINT_IF(save_taint);
365 if (!xhv->xhv_array && !needs_store)
367 #ifdef ENV_IS_CASELESS
368 else if (mg_find((SV*)hv,'E')) {
369 key = SvPV(keysv, klen);
370 keysv = sv_2mortal(newSVpv(key,klen));
371 (void)strupr(SvPVX(keysv));
378 key = SvPV(keysv, klen);
381 PERL_HASH(hash, key, klen);
384 Newz(505, xhv->xhv_array, sizeof(HE**) * (xhv->xhv_max + 1), char);
386 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
389 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
390 if (HeHASH(entry) != hash) /* strings can't be equal */
392 if (HeKLEN(entry) != klen)
394 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
396 SvREFCNT_dec(HeVAL(entry));
403 HeKEY_hek(entry) = share_hek(key, klen, hash);
404 else /* gotta do the real thing */
405 HeKEY_hek(entry) = save_hek(key, klen, hash);
407 HeNEXT(entry) = *oentry;
411 if (i) { /* initial entry? */
413 if (xhv->xhv_keys > xhv->xhv_max)
421 hv_delete(HV *hv, char *key, U32 klen, I32 flags)
427 register HE **oentry;
433 if (SvRMAGICAL(hv)) {
436 hv_magic_check (hv, &needs_copy, &needs_store);
438 if (needs_copy && (svp = hv_fetch(hv, key, klen, TRUE))) {
442 if (mg_find(sv, 'p')) {
443 sv_unmagic(sv, 'p'); /* No longer an element */
446 return Nullsv; /* element cannot be deleted */
448 #ifdef ENV_IS_CASELESS
449 else if (mg_find((SV*)hv,'E')) {
450 sv = sv_2mortal(newSVpv(key,klen));
451 key = strupr(SvPVX(sv));
456 xhv = (XPVHV*)SvANY(hv);
460 PERL_HASH(hash, key, klen);
462 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
465 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
466 if (HeHASH(entry) != hash) /* strings can't be equal */
468 if (HeKLEN(entry) != klen)
470 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
472 *oentry = HeNEXT(entry);
475 if (flags & G_DISCARD)
478 sv = sv_mortalcopy(HeVAL(entry));
479 if (entry == xhv->xhv_eiter)
482 hv_free_ent(hv, entry);
490 hv_delete_ent(HV *hv, SV *keysv, I32 flags, U32 hash)
497 register HE **oentry;
502 if (SvRMAGICAL(hv)) {
505 hv_magic_check (hv, &needs_copy, &needs_store);
507 if (needs_copy && (entry = hv_fetch_ent(hv, keysv, TRUE, hash))) {
511 if (mg_find(sv, 'p')) {
512 sv_unmagic(sv, 'p'); /* No longer an element */
515 return Nullsv; /* element cannot be deleted */
517 #ifdef ENV_IS_CASELESS
518 else if (mg_find((SV*)hv,'E')) {
519 key = SvPV(keysv, klen);
520 keysv = sv_2mortal(newSVpv(key,klen));
521 (void)strupr(SvPVX(keysv));
527 xhv = (XPVHV*)SvANY(hv);
531 key = SvPV(keysv, klen);
534 PERL_HASH(hash, key, klen);
536 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
539 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
540 if (HeHASH(entry) != hash) /* strings can't be equal */
542 if (HeKLEN(entry) != klen)
544 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
546 *oentry = HeNEXT(entry);
549 if (flags & G_DISCARD)
552 sv = sv_mortalcopy(HeVAL(entry));
553 if (entry == xhv->xhv_eiter)
556 hv_free_ent(hv, entry);
564 hv_exists(HV *hv, char *key, U32 klen)
574 if (SvRMAGICAL(hv)) {
575 if (mg_find((SV*)hv,'P')) {
578 mg_copy((SV*)hv, sv, key, klen);
579 magic_existspack(sv, mg_find(sv, 'p'));
582 #ifdef ENV_IS_CASELESS
583 else if (mg_find((SV*)hv,'E')) {
584 sv = sv_2mortal(newSVpv(key,klen));
585 key = strupr(SvPVX(sv));
590 xhv = (XPVHV*)SvANY(hv);
594 PERL_HASH(hash, key, klen);
596 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
597 for (; entry; entry = HeNEXT(entry)) {
598 if (HeHASH(entry) != hash) /* strings can't be equal */
600 if (HeKLEN(entry) != klen)
602 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
611 hv_exists_ent(HV *hv, SV *keysv, U32 hash)
622 if (SvRMAGICAL(hv)) {
623 if (mg_find((SV*)hv,'P')) {
624 dTHR; /* just for SvTRUE */
626 keysv = sv_2mortal(newSVsv(keysv));
627 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
628 magic_existspack(sv, mg_find(sv, 'p'));
631 #ifdef ENV_IS_CASELESS
632 else if (mg_find((SV*)hv,'E')) {
633 key = SvPV(keysv, klen);
634 keysv = sv_2mortal(newSVpv(key,klen));
635 (void)strupr(SvPVX(keysv));
641 xhv = (XPVHV*)SvANY(hv);
645 key = SvPV(keysv, klen);
647 PERL_HASH(hash, key, klen);
649 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
650 for (; entry; entry = HeNEXT(entry)) {
651 if (HeHASH(entry) != hash) /* strings can't be equal */
653 if (HeKLEN(entry) != klen)
655 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
665 register XPVHV* xhv = (XPVHV*)SvANY(hv);
666 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
667 register I32 newsize = oldsize * 2;
672 register HE **oentry;
673 #ifndef STRANGE_MALLOC
677 a = (HE**)xhv->xhv_array;
679 #ifdef STRANGE_MALLOC
680 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);
691 Copy(xhv->xhv_array, a, oldsize, HE*);
693 offer_nice_chunk(xhv->xhv_array,
694 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
697 Safefree(xhv->xhv_array);
701 Zero(&a[oldsize], oldsize, HE*); /* zero 2nd half*/
702 xhv->xhv_max = --newsize;
703 xhv->xhv_array = (char*)a;
705 for (i=0; i<oldsize; i++,a++) {
706 if (!*a) /* non-existent */
709 for (oentry = a, entry = *a; entry; entry = *oentry) {
710 if ((HeHASH(entry) & newsize) != i) {
711 *oentry = HeNEXT(entry);
719 oentry = &HeNEXT(entry);
721 if (!*a) /* everything moved */
727 hv_ksplit(HV *hv, IV newmax)
729 register XPVHV* xhv = (XPVHV*)SvANY(hv);
730 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
731 register I32 newsize;
736 register HE **oentry;
738 newsize = (I32) newmax; /* possible truncation here */
739 if (newsize != newmax || newmax <= oldsize)
741 while ((newsize & (1 + ~newsize)) != newsize) {
742 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
744 if (newsize < newmax)
746 if (newsize < newmax)
747 return; /* overflow detection */
749 a = (HE**)xhv->xhv_array;
752 #ifdef STRANGE_MALLOC
753 Renew(a, newsize, HE*);
755 i = newsize * sizeof(HE*);
757 while (j - MALLOC_OVERHEAD < i)
759 j -= MALLOC_OVERHEAD;
761 assert(j >= newsize);
763 Copy(xhv->xhv_array, a, oldsize, HE*);
765 offer_nice_chunk(xhv->xhv_array,
766 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
769 Safefree(xhv->xhv_array);
772 Zero(&a[oldsize], newsize-oldsize, HE*); /* zero 2nd half*/
775 Newz(0, a, newsize, HE*);
777 xhv->xhv_max = --newsize;
778 xhv->xhv_array = (char*)a;
779 if (!xhv->xhv_fill) /* skip rest if no entries */
782 for (i=0; i<oldsize; i++,a++) {
783 if (!*a) /* non-existent */
785 for (oentry = a, entry = *a; entry; entry = *oentry) {
786 if ((j = (HeHASH(entry) & newsize)) != i) {
788 *oentry = HeNEXT(entry);
789 if (!(HeNEXT(entry) = a[j]))
795 oentry = &HeNEXT(entry);
797 if (!*a) /* everything moved */
808 hv = (HV*)NEWSV(502,0);
809 sv_upgrade((SV *)hv, SVt_PVHV);
810 xhv = (XPVHV*)SvANY(hv);
813 #ifndef NODEFAULT_SHAREKEYS
814 HvSHAREKEYS_on(hv); /* key-sharing on by default */
816 xhv->xhv_max = 7; /* start with 8 buckets */
819 (void)hv_iterinit(hv); /* so each() will start off right */
824 hv_free_ent(HV *hv, register HE *entry)
828 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
829 sub_generation++; /* may be deletion of method from stash */
830 SvREFCNT_dec(HeVAL(entry));
831 if (HeKLEN(entry) == HEf_SVKEY) {
832 SvREFCNT_dec(HeKEY_sv(entry));
833 Safefree(HeKEY_hek(entry));
835 else if (HvSHAREKEYS(hv))
836 unshare_hek(HeKEY_hek(entry));
838 Safefree(HeKEY_hek(entry));
843 hv_delayfree_ent(HV *hv, register HE *entry)
847 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
848 sub_generation++; /* may be deletion of method from stash */
849 sv_2mortal(HeVAL(entry)); /* free between statements */
850 if (HeKLEN(entry) == HEf_SVKEY) {
851 sv_2mortal(HeKEY_sv(entry));
852 Safefree(HeKEY_hek(entry));
854 else if (HvSHAREKEYS(hv))
855 unshare_hek(HeKEY_hek(entry));
857 Safefree(HeKEY_hek(entry));
867 xhv = (XPVHV*)SvANY(hv);
872 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
883 register HE *oentry = Null(HE*);
899 entry = HeNEXT(entry);
900 hv_free_ent(hv, oentry);
905 entry = array[riter];
908 (void)hv_iterinit(hv);
917 xhv = (XPVHV*)SvANY(hv);
919 Safefree(xhv->xhv_array);
921 Safefree(HvNAME(hv));
925 xhv->xhv_max = 7; /* it's a normal hash */
941 xhv = (XPVHV*)SvANY(hv);
942 entry = xhv->xhv_eiter;
943 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
944 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
947 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
949 hv_free_ent(hv, entry);
952 xhv->xhv_eiter = Null(HE*);
953 return xhv->xhv_fill; /* should be xhv->xhv_keys? May change later */
966 xhv = (XPVHV*)SvANY(hv);
967 oldentry = entry = xhv->xhv_eiter;
969 if (SvRMAGICAL(hv) && (mg = mg_find((SV*)hv,'P'))) {
970 SV *key = sv_newmortal();
972 sv_setsv(key, HeSVKEY_force(entry));
973 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
979 xhv->xhv_eiter = entry = new_he(); /* one HE per MAGICAL hash */
981 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
983 HeKEY_hek(entry) = hek;
984 HeKLEN(entry) = HEf_SVKEY;
986 magic_nextpack((SV*) hv,mg,key);
988 /* force key to stay around until next time */
989 HeSVKEY_set(entry, SvREFCNT_inc(key));
990 return entry; /* beware, hent_val is not set */
993 SvREFCNT_dec(HeVAL(entry));
994 Safefree(HeKEY_hek(entry));
996 xhv->xhv_eiter = Null(HE*);
1000 if (!xhv->xhv_array)
1001 Newz(506,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
1003 entry = HeNEXT(entry);
1006 if (xhv->xhv_riter > xhv->xhv_max) {
1007 xhv->xhv_riter = -1;
1010 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
1013 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1015 hv_free_ent(hv, oldentry);
1018 xhv->xhv_eiter = entry;
1023 hv_iterkey(register HE *entry, I32 *retlen)
1025 if (HeKLEN(entry) == HEf_SVKEY) {
1027 char *p = SvPV(HeKEY_sv(entry), len);
1032 *retlen = HeKLEN(entry);
1033 return HeKEY(entry);
1037 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1039 hv_iterkeysv(register HE *entry)
1041 if (HeKLEN(entry) == HEf_SVKEY)
1042 return sv_mortalcopy(HeKEY_sv(entry));
1044 return sv_2mortal(newSVpv((HeKLEN(entry) ? HeKEY(entry) : ""),
1049 hv_iterval(HV *hv, register HE *entry)
1051 if (SvRMAGICAL(hv)) {
1052 if (mg_find((SV*)hv,'P')) {
1053 SV* sv = sv_newmortal();
1054 if (HeKLEN(entry) == HEf_SVKEY)
1055 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1056 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1060 return HeVAL(entry);
1064 hv_iternextsv(HV *hv, char **key, I32 *retlen)
1067 if ( (he = hv_iternext(hv)) == NULL)
1069 *key = hv_iterkey(he, retlen);
1070 return hv_iterval(hv, he);
1074 hv_magic(HV *hv, GV *gv, int how)
1076 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1080 sharepvn(char *sv, I32 len, U32 hash)
1082 return HEK_KEY(share_hek(sv, len, hash));
1085 /* possibly free a shared string if no one has access to it
1086 * len and hash must both be valid for str.
1089 unsharepvn(char *str, I32 len, U32 hash)
1091 register XPVHV* xhv;
1093 register HE **oentry;
1097 /* what follows is the moral equivalent of:
1098 if ((Svp = hv_fetch(strtab, tmpsv, FALSE, hash))) {
1099 if (--*Svp == Nullsv)
1100 hv_delete(strtab, str, len, G_DISCARD, hash);
1102 xhv = (XPVHV*)SvANY(strtab);
1103 /* assert(xhv_array != 0) */
1104 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1105 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1106 if (HeHASH(entry) != hash) /* strings can't be equal */
1108 if (HeKLEN(entry) != len)
1110 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1113 if (--HeVAL(entry) == Nullsv) {
1114 *oentry = HeNEXT(entry);
1117 Safefree(HeKEY_hek(entry));
1125 warn("Attempt to free non-existent shared string");
1128 /* get a (constant) string ptr from the global string table
1129 * string will get added if it is not already there.
1130 * len and hash must both be valid for str.
1133 share_hek(char *str, I32 len, register U32 hash)
1135 register XPVHV* xhv;
1137 register HE **oentry;
1141 /* what follows is the moral equivalent of:
1143 if (!(Svp = hv_fetch(strtab, str, len, FALSE)))
1144 hv_store(strtab, str, len, Nullsv, hash);
1146 xhv = (XPVHV*)SvANY(strtab);
1147 /* assert(xhv_array != 0) */
1148 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1149 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
1150 if (HeHASH(entry) != hash) /* strings can't be equal */
1152 if (HeKLEN(entry) != len)
1154 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1161 HeKEY_hek(entry) = save_hek(str, len, hash);
1162 HeVAL(entry) = Nullsv;
1163 HeNEXT(entry) = *oentry;
1166 if (i) { /* initial entry? */
1168 if (xhv->xhv_keys > xhv->xhv_max)
1173 ++HeVAL(entry); /* use value slot as REFCNT */
1174 return HeKEY_hek(entry);