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')) {
175 keysv = sv_2mortal(newSVsv(keysv));
176 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
177 if (!HeKEY_hek(&hv_fetch_ent_mh)) {
179 New(54, k, HEK_BASESIZE + sizeof(SV*), char);
180 HeKEY_hek(&hv_fetch_ent_mh) = (HEK*)k;
182 HeSVKEY_set(&hv_fetch_ent_mh, keysv);
183 HeVAL(&hv_fetch_ent_mh) = sv;
184 return &hv_fetch_ent_mh;
186 #ifdef ENV_IS_CASELESS
187 else if (mg_find((SV*)hv,'E')) {
189 key = SvPV(keysv, klen);
190 for (i = 0; i < klen; ++i)
191 if (isLOWER(key[i])) {
192 SV *nkeysv = sv_2mortal(newSVpv(key,klen));
193 (void)strupr(SvPVX(nkeysv));
194 entry = hv_fetch_ent(hv, nkeysv, 0, 0);
196 entry = hv_store_ent(hv, keysv, NEWSV(61,0), hash);
203 xhv = (XPVHV*)SvANY(hv);
204 if (!xhv->xhv_array) {
206 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
207 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
210 Newz(503,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
215 key = SvPV(keysv, klen);
218 PERL_HASH(hash, key, klen);
220 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
221 for (; entry; entry = HeNEXT(entry)) {
222 if (HeHASH(entry) != hash) /* strings can't be equal */
224 if (HeKLEN(entry) != klen)
226 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
230 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
231 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
234 if ((gotenv = ENV_getenv(key)) != Nullch) {
235 sv = newSVpv(gotenv,strlen(gotenv));
237 return hv_store_ent(hv,keysv,sv,hash);
241 if (lval) { /* gonna assign to this, so it better be there */
243 return hv_store_ent(hv,keysv,sv,hash);
249 hv_magic_check (HV *hv, bool *needs_copy, bool *needs_store)
251 MAGIC *mg = SvMAGIC(hv);
255 if (isUPPER(mg->mg_type)) {
257 switch (mg->mg_type) {
260 *needs_store = FALSE;
263 mg = mg->mg_moremagic;
268 hv_store(HV *hv, char *key, U32 klen, SV *val, register U32 hash)
273 register HE **oentry;
278 xhv = (XPVHV*)SvANY(hv);
282 hv_magic_check (hv, &needs_copy, &needs_store);
284 mg_copy((SV*)hv, val, key, klen);
285 if (!xhv->xhv_array && !needs_store)
287 #ifdef ENV_IS_CASELESS
288 else if (mg_find((SV*)hv,'E')) {
289 SV *sv = sv_2mortal(newSVpv(key,klen));
290 key = strupr(SvPVX(sv));
297 PERL_HASH(hash, key, klen);
300 Newz(505, xhv->xhv_array, sizeof(HE**) * (xhv->xhv_max + 1), char);
302 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
305 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
306 if (HeHASH(entry) != hash) /* strings can't be equal */
308 if (HeKLEN(entry) != klen)
310 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
312 SvREFCNT_dec(HeVAL(entry));
314 return &HeVAL(entry);
319 HeKEY_hek(entry) = share_hek(key, klen, hash);
320 else /* gotta do the real thing */
321 HeKEY_hek(entry) = save_hek(key, klen, hash);
323 HeNEXT(entry) = *oentry;
327 if (i) { /* initial entry? */
329 if (xhv->xhv_keys > xhv->xhv_max)
333 return &HeVAL(entry);
337 hv_store_ent(HV *hv, SV *keysv, SV *val, register U32 hash)
344 register HE **oentry;
349 xhv = (XPVHV*)SvANY(hv);
354 hv_magic_check (hv, &needs_copy, &needs_store);
356 bool save_taint = tainted;
358 tainted = SvTAINTED(keysv);
359 keysv = sv_2mortal(newSVsv(keysv));
360 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
361 TAINT_IF(save_taint);
362 if (!xhv->xhv_array && !needs_store)
364 #ifdef ENV_IS_CASELESS
365 else if (mg_find((SV*)hv,'E')) {
366 key = SvPV(keysv, klen);
367 keysv = sv_2mortal(newSVpv(key,klen));
368 (void)strupr(SvPVX(keysv));
375 key = SvPV(keysv, klen);
378 PERL_HASH(hash, key, klen);
381 Newz(505, xhv->xhv_array, sizeof(HE**) * (xhv->xhv_max + 1), char);
383 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
386 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
387 if (HeHASH(entry) != hash) /* strings can't be equal */
389 if (HeKLEN(entry) != klen)
391 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
393 SvREFCNT_dec(HeVAL(entry));
400 HeKEY_hek(entry) = share_hek(key, klen, hash);
401 else /* gotta do the real thing */
402 HeKEY_hek(entry) = save_hek(key, klen, hash);
404 HeNEXT(entry) = *oentry;
408 if (i) { /* initial entry? */
410 if (xhv->xhv_keys > xhv->xhv_max)
418 hv_delete(HV *hv, char *key, U32 klen, I32 flags)
424 register HE **oentry;
430 if (SvRMAGICAL(hv)) {
433 hv_magic_check (hv, &needs_copy, &needs_store);
435 if (needs_copy && (svp = hv_fetch(hv, key, klen, TRUE))) {
439 if (mg_find(sv, 'p')) {
440 sv_unmagic(sv, 'p'); /* No longer an element */
443 return Nullsv; /* element cannot be deleted */
445 #ifdef ENV_IS_CASELESS
446 else if (mg_find((SV*)hv,'E')) {
447 sv = sv_2mortal(newSVpv(key,klen));
448 key = strupr(SvPVX(sv));
453 xhv = (XPVHV*)SvANY(hv);
457 PERL_HASH(hash, key, klen);
459 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
462 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
463 if (HeHASH(entry) != hash) /* strings can't be equal */
465 if (HeKLEN(entry) != klen)
467 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
469 *oentry = HeNEXT(entry);
472 if (flags & G_DISCARD)
475 sv = sv_mortalcopy(HeVAL(entry));
476 if (entry == xhv->xhv_eiter)
479 hv_free_ent(hv, entry);
487 hv_delete_ent(HV *hv, SV *keysv, I32 flags, U32 hash)
494 register HE **oentry;
499 if (SvRMAGICAL(hv)) {
502 hv_magic_check (hv, &needs_copy, &needs_store);
504 if (needs_copy && (entry = hv_fetch_ent(hv, keysv, TRUE, hash))) {
508 if (mg_find(sv, 'p')) {
509 sv_unmagic(sv, 'p'); /* No longer an element */
512 return Nullsv; /* element cannot be deleted */
514 #ifdef ENV_IS_CASELESS
515 else if (mg_find((SV*)hv,'E')) {
516 key = SvPV(keysv, klen);
517 keysv = sv_2mortal(newSVpv(key,klen));
518 (void)strupr(SvPVX(keysv));
524 xhv = (XPVHV*)SvANY(hv);
528 key = SvPV(keysv, klen);
531 PERL_HASH(hash, key, klen);
533 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
536 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
537 if (HeHASH(entry) != hash) /* strings can't be equal */
539 if (HeKLEN(entry) != klen)
541 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
543 *oentry = HeNEXT(entry);
546 if (flags & G_DISCARD)
549 sv = sv_mortalcopy(HeVAL(entry));
550 if (entry == xhv->xhv_eiter)
553 hv_free_ent(hv, entry);
561 hv_exists(HV *hv, char *key, U32 klen)
571 if (SvRMAGICAL(hv)) {
572 if (mg_find((SV*)hv,'P')) {
575 mg_copy((SV*)hv, sv, key, klen);
576 magic_existspack(sv, mg_find(sv, 'p'));
579 #ifdef ENV_IS_CASELESS
580 else if (mg_find((SV*)hv,'E')) {
581 sv = sv_2mortal(newSVpv(key,klen));
582 key = strupr(SvPVX(sv));
587 xhv = (XPVHV*)SvANY(hv);
591 PERL_HASH(hash, key, klen);
593 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
594 for (; entry; entry = HeNEXT(entry)) {
595 if (HeHASH(entry) != hash) /* strings can't be equal */
597 if (HeKLEN(entry) != klen)
599 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
608 hv_exists_ent(HV *hv, SV *keysv, U32 hash)
619 if (SvRMAGICAL(hv)) {
620 if (mg_find((SV*)hv,'P')) {
621 dTHR; /* just for SvTRUE */
623 keysv = sv_2mortal(newSVsv(keysv));
624 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
625 magic_existspack(sv, mg_find(sv, 'p'));
628 #ifdef ENV_IS_CASELESS
629 else if (mg_find((SV*)hv,'E')) {
630 key = SvPV(keysv, klen);
631 keysv = sv_2mortal(newSVpv(key,klen));
632 (void)strupr(SvPVX(keysv));
638 xhv = (XPVHV*)SvANY(hv);
642 key = SvPV(keysv, klen);
644 PERL_HASH(hash, key, klen);
646 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
647 for (; entry; entry = HeNEXT(entry)) {
648 if (HeHASH(entry) != hash) /* strings can't be equal */
650 if (HeKLEN(entry) != klen)
652 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
662 register XPVHV* xhv = (XPVHV*)SvANY(hv);
663 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
664 register I32 newsize = oldsize * 2;
669 register HE **oentry;
670 #ifndef STRANGE_MALLOC
674 a = (HE**)xhv->xhv_array;
676 #ifdef STRANGE_MALLOC
677 Renew(a, newsize, HE*);
683 i = newsize * sizeof(HE*);
684 #define MALLOC_OVERHEAD 16
685 tmp = MALLOC_OVERHEAD;
686 while (tmp - MALLOC_OVERHEAD < i)
688 tmp -= MALLOC_OVERHEAD;
690 assert(tmp >= newsize);
696 Copy(xhv->xhv_array, a, oldsize, HE*);
698 offer_nice_chunk(xhv->xhv_array,
699 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
702 Safefree(xhv->xhv_array);
706 Zero(&a[oldsize], oldsize, HE*); /* zero 2nd half*/
707 xhv->xhv_max = --newsize;
708 xhv->xhv_array = (char*)a;
710 for (i=0; i<oldsize; i++,a++) {
711 if (!*a) /* non-existent */
714 for (oentry = a, entry = *a; entry; entry = *oentry) {
715 if ((HeHASH(entry) & newsize) != i) {
716 *oentry = HeNEXT(entry);
724 oentry = &HeNEXT(entry);
726 if (!*a) /* everything moved */
732 hv_ksplit(HV *hv, IV newmax)
734 register XPVHV* xhv = (XPVHV*)SvANY(hv);
735 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
736 register I32 newsize;
741 register HE **oentry;
743 newsize = (I32) newmax; /* possible truncation here */
744 if (newsize != newmax || newmax <= oldsize)
746 while ((newsize & (1 + ~newsize)) != newsize) {
747 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
749 if (newsize < newmax)
751 if (newsize < newmax)
752 return; /* overflow detection */
754 a = (HE**)xhv->xhv_array;
757 #ifdef STRANGE_MALLOC
758 Renew(a, newsize, HE*);
764 i = newsize * sizeof(HE*);
766 while (j - MALLOC_OVERHEAD < i)
768 j -= MALLOC_OVERHEAD;
770 assert(j >= newsize);
776 Copy(xhv->xhv_array, a, oldsize, HE*);
778 offer_nice_chunk(xhv->xhv_array,
779 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
782 Safefree(xhv->xhv_array);
785 Zero(&a[oldsize], newsize-oldsize, HE*); /* zero 2nd half*/
788 Newz(0, a, newsize, HE*);
790 xhv->xhv_max = --newsize;
791 xhv->xhv_array = (char*)a;
792 if (!xhv->xhv_fill) /* skip rest if no entries */
795 for (i=0; i<oldsize; i++,a++) {
796 if (!*a) /* non-existent */
798 for (oentry = a, entry = *a; entry; entry = *oentry) {
799 if ((j = (HeHASH(entry) & newsize)) != i) {
801 *oentry = HeNEXT(entry);
802 if (!(HeNEXT(entry) = a[j]))
808 oentry = &HeNEXT(entry);
810 if (!*a) /* everything moved */
821 hv = (HV*)NEWSV(502,0);
822 sv_upgrade((SV *)hv, SVt_PVHV);
823 xhv = (XPVHV*)SvANY(hv);
826 #ifndef NODEFAULT_SHAREKEYS
827 HvSHAREKEYS_on(hv); /* key-sharing on by default */
829 xhv->xhv_max = 7; /* start with 8 buckets */
832 (void)hv_iterinit(hv); /* so each() will start off right */
837 hv_free_ent(HV *hv, register HE *entry)
841 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
842 sub_generation++; /* may be deletion of method from stash */
843 SvREFCNT_dec(HeVAL(entry));
844 if (HeKLEN(entry) == HEf_SVKEY) {
845 SvREFCNT_dec(HeKEY_sv(entry));
846 Safefree(HeKEY_hek(entry));
848 else if (HvSHAREKEYS(hv))
849 unshare_hek(HeKEY_hek(entry));
851 Safefree(HeKEY_hek(entry));
856 hv_delayfree_ent(HV *hv, register HE *entry)
860 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
861 sub_generation++; /* may be deletion of method from stash */
862 sv_2mortal(HeVAL(entry)); /* free between statements */
863 if (HeKLEN(entry) == HEf_SVKEY) {
864 sv_2mortal(HeKEY_sv(entry));
865 Safefree(HeKEY_hek(entry));
867 else if (HvSHAREKEYS(hv))
868 unshare_hek(HeKEY_hek(entry));
870 Safefree(HeKEY_hek(entry));
880 xhv = (XPVHV*)SvANY(hv);
885 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
896 register HE *oentry = Null(HE*);
912 entry = HeNEXT(entry);
913 hv_free_ent(hv, oentry);
918 entry = array[riter];
921 (void)hv_iterinit(hv);
930 xhv = (XPVHV*)SvANY(hv);
932 Safefree(xhv->xhv_array);
934 Safefree(HvNAME(hv));
938 xhv->xhv_max = 7; /* it's a normal hash */
954 xhv = (XPVHV*)SvANY(hv);
955 entry = xhv->xhv_eiter;
956 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
957 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
960 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
962 hv_free_ent(hv, entry);
965 xhv->xhv_eiter = Null(HE*);
966 return xhv->xhv_fill; /* should be xhv->xhv_keys? May change later */
979 xhv = (XPVHV*)SvANY(hv);
980 oldentry = entry = xhv->xhv_eiter;
982 if (SvRMAGICAL(hv) && (mg = mg_find((SV*)hv,'P'))) {
983 SV *key = sv_newmortal();
985 sv_setsv(key, HeSVKEY_force(entry));
986 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
992 xhv->xhv_eiter = entry = new_he(); /* one HE per MAGICAL hash */
994 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
996 HeKEY_hek(entry) = hek;
997 HeKLEN(entry) = HEf_SVKEY;
999 magic_nextpack((SV*) hv,mg,key);
1001 /* force key to stay around until next time */
1002 HeSVKEY_set(entry, SvREFCNT_inc(key));
1003 return entry; /* beware, hent_val is not set */
1006 SvREFCNT_dec(HeVAL(entry));
1007 Safefree(HeKEY_hek(entry));
1009 xhv->xhv_eiter = Null(HE*);
1013 if (!xhv->xhv_array)
1014 Newz(506,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
1016 entry = HeNEXT(entry);
1019 if (xhv->xhv_riter > xhv->xhv_max) {
1020 xhv->xhv_riter = -1;
1023 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
1026 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1028 hv_free_ent(hv, oldentry);
1031 xhv->xhv_eiter = entry;
1036 hv_iterkey(register HE *entry, I32 *retlen)
1038 if (HeKLEN(entry) == HEf_SVKEY) {
1040 char *p = SvPV(HeKEY_sv(entry), len);
1045 *retlen = HeKLEN(entry);
1046 return HeKEY(entry);
1050 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1052 hv_iterkeysv(register HE *entry)
1054 if (HeKLEN(entry) == HEf_SVKEY)
1055 return sv_mortalcopy(HeKEY_sv(entry));
1057 return sv_2mortal(newSVpv((HeKLEN(entry) ? HeKEY(entry) : ""),
1062 hv_iterval(HV *hv, register HE *entry)
1064 if (SvRMAGICAL(hv)) {
1065 if (mg_find((SV*)hv,'P')) {
1066 SV* sv = sv_newmortal();
1067 if (HeKLEN(entry) == HEf_SVKEY)
1068 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1069 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1073 return HeVAL(entry);
1077 hv_iternextsv(HV *hv, char **key, I32 *retlen)
1080 if ( (he = hv_iternext(hv)) == NULL)
1082 *key = hv_iterkey(he, retlen);
1083 return hv_iterval(hv, he);
1087 hv_magic(HV *hv, GV *gv, int how)
1089 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1093 sharepvn(char *sv, I32 len, U32 hash)
1095 return HEK_KEY(share_hek(sv, len, hash));
1098 /* possibly free a shared string if no one has access to it
1099 * len and hash must both be valid for str.
1102 unsharepvn(char *str, I32 len, U32 hash)
1104 register XPVHV* xhv;
1106 register HE **oentry;
1110 /* what follows is the moral equivalent of:
1111 if ((Svp = hv_fetch(strtab, tmpsv, FALSE, hash))) {
1112 if (--*Svp == Nullsv)
1113 hv_delete(strtab, str, len, G_DISCARD, hash);
1115 xhv = (XPVHV*)SvANY(strtab);
1116 /* assert(xhv_array != 0) */
1117 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1118 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1119 if (HeHASH(entry) != hash) /* strings can't be equal */
1121 if (HeKLEN(entry) != len)
1123 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1126 if (--HeVAL(entry) == Nullsv) {
1127 *oentry = HeNEXT(entry);
1130 Safefree(HeKEY_hek(entry));
1138 warn("Attempt to free non-existent shared string");
1141 /* get a (constant) string ptr from the global string table
1142 * string will get added if it is not already there.
1143 * len and hash must both be valid for str.
1146 share_hek(char *str, I32 len, register U32 hash)
1148 register XPVHV* xhv;
1150 register HE **oentry;
1154 /* what follows is the moral equivalent of:
1156 if (!(Svp = hv_fetch(strtab, str, len, FALSE)))
1157 hv_store(strtab, str, len, Nullsv, hash);
1159 xhv = (XPVHV*)SvANY(strtab);
1160 /* assert(xhv_array != 0) */
1161 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1162 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
1163 if (HeHASH(entry) != hash) /* strings can't be equal */
1165 if (HeKLEN(entry) != len)
1167 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1174 HeKEY_hek(entry) = save_hek(str, len, hash);
1175 HeVAL(entry) = Nullsv;
1176 HeNEXT(entry) = *oentry;
1179 if (i) { /* initial entry? */
1181 if (xhv->xhv_keys > xhv->xhv_max)
1186 ++HeVAL(entry); /* use value slot as REFCNT */
1187 return HeKEY_hek(entry);