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 he_root = (HE*)safemalloc(1008);
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')) {
176 keysv = sv_2mortal(newSVsv(keysv));
177 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
178 if (!HeKEY_hek(&mh)) {
180 New(54, k, HEK_BASESIZE + sizeof(SV*), char);
181 HeKEY_hek(&mh) = (HEK*)k;
183 HeSVKEY_set(&mh, keysv);
187 #ifdef ENV_IS_CASELESS
188 else if (mg_find((SV*)hv,'E')) {
190 key = SvPV(keysv, klen);
191 for (i = 0; i < klen; ++i)
192 if (isLOWER(key[i])) {
193 SV *nkeysv = sv_2mortal(newSVpv(key,klen));
194 (void)strupr(SvPVX(nkeysv));
195 entry = hv_fetch_ent(hv, nkeysv, 0, 0);
197 entry = hv_store_ent(hv, keysv, NEWSV(61,0), hash);
204 xhv = (XPVHV*)SvANY(hv);
205 if (!xhv->xhv_array) {
207 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
208 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
211 Newz(503,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
216 key = SvPV(keysv, klen);
219 PERL_HASH(hash, key, klen);
221 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
222 for (; entry; entry = HeNEXT(entry)) {
223 if (HeHASH(entry) != hash) /* strings can't be equal */
225 if (HeKLEN(entry) != klen)
227 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
231 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
232 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
235 if ((gotenv = ENV_getenv(key)) != Nullch) {
236 sv = newSVpv(gotenv,strlen(gotenv));
238 return hv_store_ent(hv,keysv,sv,hash);
242 if (lval) { /* gonna assign to this, so it better be there */
244 return hv_store_ent(hv,keysv,sv,hash);
250 hv_magic_check (HV *hv, bool *needs_copy, bool *needs_store)
252 MAGIC *mg = SvMAGIC(hv);
256 if (isUPPER(mg->mg_type)) {
258 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;
431 if (SvRMAGICAL(hv)) {
432 sv = *hv_fetch(hv, key, klen, TRUE);
434 if (mg_find(sv, 's')) {
435 return Nullsv; /* %SIG elements cannot be deleted */
437 else if (mg_find(sv, 'p')) {
438 sv_unmagic(sv, 'p'); /* No longer an element */
441 #ifdef ENV_IS_CASELESS
442 else if (mg_find((SV*)hv,'E')) {
443 sv = sv_2mortal(newSVpv(key,klen));
444 key = strupr(SvPVX(sv));
448 xhv = (XPVHV*)SvANY(hv);
452 PERL_HASH(hash, key, klen);
454 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
457 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
458 if (HeHASH(entry) != hash) /* strings can't be equal */
460 if (HeKLEN(entry) != klen)
462 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
464 *oentry = HeNEXT(entry);
467 if (flags & G_DISCARD)
470 sv = sv_mortalcopy(HeVAL(entry));
471 if (entry == xhv->xhv_eiter)
474 hv_free_ent(hv, entry);
482 hv_delete_ent(HV *hv, SV *keysv, I32 flags, U32 hash)
489 register HE **oentry;
494 if (SvRMAGICAL(hv)) {
495 entry = hv_fetch_ent(hv, keysv, TRUE, hash);
498 if (mg_find(sv, 'p')) {
499 sv_unmagic(sv, 'p'); /* No longer an element */
502 #ifdef ENV_IS_CASELESS
503 else if (mg_find((SV*)hv,'E')) {
504 key = SvPV(keysv, klen);
505 keysv = sv_2mortal(newSVpv(key,klen));
506 (void)strupr(SvPVX(keysv));
511 xhv = (XPVHV*)SvANY(hv);
515 key = SvPV(keysv, klen);
518 PERL_HASH(hash, key, klen);
520 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
523 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
524 if (HeHASH(entry) != hash) /* strings can't be equal */
526 if (HeKLEN(entry) != klen)
528 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
530 *oentry = HeNEXT(entry);
533 if (flags & G_DISCARD)
536 sv = sv_mortalcopy(HeVAL(entry));
537 if (entry == xhv->xhv_eiter)
540 hv_free_ent(hv, entry);
548 hv_exists(HV *hv, char *key, U32 klen)
558 if (SvRMAGICAL(hv)) {
559 if (mg_find((SV*)hv,'P')) {
562 mg_copy((SV*)hv, sv, key, klen);
563 magic_existspack(sv, mg_find(sv, 'p'));
566 #ifdef ENV_IS_CASELESS
567 else if (mg_find((SV*)hv,'E')) {
568 sv = sv_2mortal(newSVpv(key,klen));
569 key = strupr(SvPVX(sv));
574 xhv = (XPVHV*)SvANY(hv);
578 PERL_HASH(hash, key, klen);
580 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
581 for (; entry; entry = HeNEXT(entry)) {
582 if (HeHASH(entry) != hash) /* strings can't be equal */
584 if (HeKLEN(entry) != klen)
586 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
595 hv_exists_ent(HV *hv, SV *keysv, U32 hash)
606 if (SvRMAGICAL(hv)) {
607 if (mg_find((SV*)hv,'P')) {
608 dTHR; /* just for SvTRUE */
610 keysv = sv_2mortal(newSVsv(keysv));
611 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
612 magic_existspack(sv, mg_find(sv, 'p'));
615 #ifdef ENV_IS_CASELESS
616 else if (mg_find((SV*)hv,'E')) {
617 key = SvPV(keysv, klen);
618 keysv = sv_2mortal(newSVpv(key,klen));
619 (void)strupr(SvPVX(keysv));
625 xhv = (XPVHV*)SvANY(hv);
629 key = SvPV(keysv, klen);
631 PERL_HASH(hash, key, klen);
633 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
634 for (; entry; entry = HeNEXT(entry)) {
635 if (HeHASH(entry) != hash) /* strings can't be equal */
637 if (HeKLEN(entry) != klen)
639 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
649 register XPVHV* xhv = (XPVHV*)SvANY(hv);
650 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
651 register I32 newsize = oldsize * 2;
656 register HE **oentry;
657 #ifndef STRANGE_MALLOC
661 a = (HE**)xhv->xhv_array;
663 #ifdef STRANGE_MALLOC
664 Renew(a, newsize, HE*);
666 i = newsize * sizeof(HE*);
667 #define MALLOC_OVERHEAD 16
668 tmp = MALLOC_OVERHEAD;
669 while (tmp - MALLOC_OVERHEAD < i)
671 tmp -= MALLOC_OVERHEAD;
673 assert(tmp >= newsize);
675 Copy(xhv->xhv_array, a, oldsize, HE*);
677 offer_nice_chunk(xhv->xhv_array,
678 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
681 Safefree(xhv->xhv_array);
685 Zero(&a[oldsize], oldsize, HE*); /* zero 2nd half*/
686 xhv->xhv_max = --newsize;
687 xhv->xhv_array = (char*)a;
689 for (i=0; i<oldsize; i++,a++) {
690 if (!*a) /* non-existent */
693 for (oentry = a, entry = *a; entry; entry = *oentry) {
694 if ((HeHASH(entry) & newsize) != i) {
695 *oentry = HeNEXT(entry);
703 oentry = &HeNEXT(entry);
705 if (!*a) /* everything moved */
711 hv_ksplit(HV *hv, IV newmax)
713 register XPVHV* xhv = (XPVHV*)SvANY(hv);
714 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
715 register I32 newsize;
720 register HE **oentry;
722 newsize = (I32) newmax; /* possible truncation here */
723 if (newsize != newmax || newmax <= oldsize)
725 while ((newsize & (1 + ~newsize)) != newsize) {
726 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
728 if (newsize < newmax)
730 if (newsize < newmax)
731 return; /* overflow detection */
733 a = (HE**)xhv->xhv_array;
736 #ifdef STRANGE_MALLOC
737 Renew(a, newsize, HE*);
739 i = newsize * sizeof(HE*);
741 while (j - MALLOC_OVERHEAD < i)
743 j -= MALLOC_OVERHEAD;
745 assert(j >= newsize);
747 Copy(xhv->xhv_array, a, oldsize, HE*);
749 offer_nice_chunk(xhv->xhv_array,
750 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
753 Safefree(xhv->xhv_array);
756 Zero(&a[oldsize], newsize-oldsize, HE*); /* zero 2nd half*/
759 Newz(0, a, newsize, HE*);
761 xhv->xhv_max = --newsize;
762 xhv->xhv_array = (char*)a;
763 if (!xhv->xhv_fill) /* skip rest if no entries */
766 for (i=0; i<oldsize; i++,a++) {
767 if (!*a) /* non-existent */
769 for (oentry = a, entry = *a; entry; entry = *oentry) {
770 if ((j = (HeHASH(entry) & newsize)) != i) {
772 *oentry = HeNEXT(entry);
773 if (!(HeNEXT(entry) = a[j]))
779 oentry = &HeNEXT(entry);
781 if (!*a) /* everything moved */
792 hv = (HV*)NEWSV(502,0);
793 sv_upgrade((SV *)hv, SVt_PVHV);
794 xhv = (XPVHV*)SvANY(hv);
797 #ifndef NODEFAULT_SHAREKEYS
798 HvSHAREKEYS_on(hv); /* key-sharing on by default */
800 xhv->xhv_max = 7; /* start with 8 buckets */
803 (void)hv_iterinit(hv); /* so each() will start off right */
808 hv_free_ent(HV *hv, register HE *entry)
812 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
813 sub_generation++; /* may be deletion of method from stash */
814 SvREFCNT_dec(HeVAL(entry));
815 if (HeKLEN(entry) == HEf_SVKEY) {
816 SvREFCNT_dec(HeKEY_sv(entry));
817 Safefree(HeKEY_hek(entry));
819 else if (HvSHAREKEYS(hv))
820 unshare_hek(HeKEY_hek(entry));
822 Safefree(HeKEY_hek(entry));
827 hv_delayfree_ent(HV *hv, register HE *entry)
831 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
832 sub_generation++; /* may be deletion of method from stash */
833 sv_2mortal(HeVAL(entry)); /* free between statements */
834 if (HeKLEN(entry) == HEf_SVKEY) {
835 sv_2mortal(HeKEY_sv(entry));
836 Safefree(HeKEY_hek(entry));
838 else if (HvSHAREKEYS(hv))
839 unshare_hek(HeKEY_hek(entry));
841 Safefree(HeKEY_hek(entry));
851 xhv = (XPVHV*)SvANY(hv);
856 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
867 register HE *oentry = Null(HE*);
883 entry = HeNEXT(entry);
884 hv_free_ent(hv, oentry);
889 entry = array[riter];
892 (void)hv_iterinit(hv);
901 xhv = (XPVHV*)SvANY(hv);
903 Safefree(xhv->xhv_array);
905 Safefree(HvNAME(hv));
909 xhv->xhv_max = 7; /* it's a normal hash */
925 xhv = (XPVHV*)SvANY(hv);
926 entry = xhv->xhv_eiter;
927 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
928 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
931 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
933 hv_free_ent(hv, entry);
936 xhv->xhv_eiter = Null(HE*);
937 return xhv->xhv_fill; /* should be xhv->xhv_keys? May change later */
950 xhv = (XPVHV*)SvANY(hv);
951 oldentry = entry = xhv->xhv_eiter;
953 if (SvRMAGICAL(hv) && (mg = mg_find((SV*)hv,'P'))) {
954 SV *key = sv_newmortal();
956 sv_setsv(key, HeSVKEY_force(entry));
957 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
963 xhv->xhv_eiter = entry = new_he(); /* one HE per MAGICAL hash */
965 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
967 HeKEY_hek(entry) = hek;
968 HeKLEN(entry) = HEf_SVKEY;
970 magic_nextpack((SV*) hv,mg,key);
972 /* force key to stay around until next time */
973 HeSVKEY_set(entry, SvREFCNT_inc(key));
974 return entry; /* beware, hent_val is not set */
977 SvREFCNT_dec(HeVAL(entry));
978 Safefree(HeKEY_hek(entry));
980 xhv->xhv_eiter = Null(HE*);
985 Newz(506,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
987 entry = HeNEXT(entry);
990 if (xhv->xhv_riter > xhv->xhv_max) {
994 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
997 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
999 hv_free_ent(hv, oldentry);
1002 xhv->xhv_eiter = entry;
1007 hv_iterkey(register HE *entry, I32 *retlen)
1009 if (HeKLEN(entry) == HEf_SVKEY) {
1011 char *p = SvPV(HeKEY_sv(entry), len);
1016 *retlen = HeKLEN(entry);
1017 return HeKEY(entry);
1021 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1023 hv_iterkeysv(register HE *entry)
1025 if (HeKLEN(entry) == HEf_SVKEY)
1026 return sv_mortalcopy(HeKEY_sv(entry));
1028 return sv_2mortal(newSVpv((HeKLEN(entry) ? HeKEY(entry) : ""),
1033 hv_iterval(HV *hv, register HE *entry)
1035 if (SvRMAGICAL(hv)) {
1036 if (mg_find((SV*)hv,'P')) {
1037 SV* sv = sv_newmortal();
1038 if (HeKLEN(entry) == HEf_SVKEY)
1039 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1040 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1044 return HeVAL(entry);
1048 hv_iternextsv(HV *hv, char **key, I32 *retlen)
1051 if ( (he = hv_iternext(hv)) == NULL)
1053 *key = hv_iterkey(he, retlen);
1054 return hv_iterval(hv, he);
1058 hv_magic(HV *hv, GV *gv, int how)
1060 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1064 sharepvn(char *sv, I32 len, U32 hash)
1066 return HEK_KEY(share_hek(sv, len, hash));
1069 /* possibly free a shared string if no one has access to it
1070 * len and hash must both be valid for str.
1073 unsharepvn(char *str, I32 len, U32 hash)
1075 register XPVHV* xhv;
1077 register HE **oentry;
1081 /* what follows is the moral equivalent of:
1082 if ((Svp = hv_fetch(strtab, tmpsv, FALSE, hash))) {
1083 if (--*Svp == Nullsv)
1084 hv_delete(strtab, str, len, G_DISCARD, hash);
1086 xhv = (XPVHV*)SvANY(strtab);
1087 /* assert(xhv_array != 0) */
1088 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1089 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1090 if (HeHASH(entry) != hash) /* strings can't be equal */
1092 if (HeKLEN(entry) != len)
1094 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1097 if (--HeVAL(entry) == Nullsv) {
1098 *oentry = HeNEXT(entry);
1101 Safefree(HeKEY_hek(entry));
1109 warn("Attempt to free non-existent shared string");
1112 /* get a (constant) string ptr from the global string table
1113 * string will get added if it is not already there.
1114 * len and hash must both be valid for str.
1117 share_hek(char *str, I32 len, register U32 hash)
1119 register XPVHV* xhv;
1121 register HE **oentry;
1125 /* what follows is the moral equivalent of:
1127 if (!(Svp = hv_fetch(strtab, str, len, FALSE)))
1128 hv_store(strtab, str, len, Nullsv, hash);
1130 xhv = (XPVHV*)SvANY(strtab);
1131 /* assert(xhv_array != 0) */
1132 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1133 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
1134 if (HeHASH(entry) != hash) /* strings can't be equal */
1136 if (HeKLEN(entry) != len)
1138 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1145 HeKEY_hek(entry) = save_hek(str, len, hash);
1146 HeVAL(entry) = Nullsv;
1147 HeNEXT(entry) = *oentry;
1150 if (i) { /* initial entry? */
1152 if (xhv->xhv_keys > xhv->xhv_max)
1157 ++HeVAL(entry); /* use value slot as REFCNT */
1158 return HeKEY_hek(entry);