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) {
264 *needs_store = FALSE;
267 mg = mg->mg_moremagic;
272 hv_store(HV *hv, char *key, U32 klen, SV *val, register U32 hash)
277 register HE **oentry;
282 xhv = (XPVHV*)SvANY(hv);
286 hv_magic_check (hv, &needs_copy, &needs_store);
288 mg_copy((SV*)hv, val, key, klen);
289 if (!xhv->xhv_array && !needs_store)
291 #ifdef ENV_IS_CASELESS
292 else if (mg_find((SV*)hv,'E')) {
293 SV *sv = sv_2mortal(newSVpv(key,klen));
294 key = strupr(SvPVX(sv));
301 PERL_HASH(hash, key, klen);
304 Newz(505, xhv->xhv_array, sizeof(HE**) * (xhv->xhv_max + 1), char);
306 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
309 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
310 if (HeHASH(entry) != hash) /* strings can't be equal */
312 if (HeKLEN(entry) != klen)
314 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
316 SvREFCNT_dec(HeVAL(entry));
318 return &HeVAL(entry);
323 HeKEY_hek(entry) = share_hek(key, klen, hash);
324 else /* gotta do the real thing */
325 HeKEY_hek(entry) = save_hek(key, klen, hash);
327 HeNEXT(entry) = *oentry;
331 if (i) { /* initial entry? */
333 if (xhv->xhv_keys > xhv->xhv_max)
337 return &HeVAL(entry);
341 hv_store_ent(HV *hv, SV *keysv, SV *val, register U32 hash)
348 register HE **oentry;
353 xhv = (XPVHV*)SvANY(hv);
358 hv_magic_check (hv, &needs_copy, &needs_store);
360 bool save_taint = tainted;
362 tainted = SvTAINTED(keysv);
363 keysv = sv_2mortal(newSVsv(keysv));
364 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
365 TAINT_IF(save_taint);
366 if (!xhv->xhv_array && !needs_store)
368 #ifdef ENV_IS_CASELESS
369 else if (mg_find((SV*)hv,'E')) {
370 key = SvPV(keysv, klen);
371 keysv = sv_2mortal(newSVpv(key,klen));
372 (void)strupr(SvPVX(keysv));
379 key = SvPV(keysv, klen);
382 PERL_HASH(hash, key, klen);
385 Newz(505, xhv->xhv_array, sizeof(HE**) * (xhv->xhv_max + 1), char);
387 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
390 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
391 if (HeHASH(entry) != hash) /* strings can't be equal */
393 if (HeKLEN(entry) != klen)
395 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
397 SvREFCNT_dec(HeVAL(entry));
404 HeKEY_hek(entry) = share_hek(key, klen, hash);
405 else /* gotta do the real thing */
406 HeKEY_hek(entry) = save_hek(key, klen, hash);
408 HeNEXT(entry) = *oentry;
412 if (i) { /* initial entry? */
414 if (xhv->xhv_keys > xhv->xhv_max)
422 hv_delete(HV *hv, char *key, U32 klen, I32 flags)
428 register HE **oentry;
433 if (SvRMAGICAL(hv)) {
434 sv = *hv_fetch(hv, key, klen, TRUE);
436 if (mg_find(sv, 's')) {
437 return Nullsv; /* %SIG elements cannot be deleted */
439 else if (mg_find(sv, 'p')) {
440 sv_unmagic(sv, 'p'); /* No longer an element */
443 #ifdef ENV_IS_CASELESS
444 else if (mg_find((SV*)hv,'E')) {
445 sv = sv_2mortal(newSVpv(key,klen));
446 key = strupr(SvPVX(sv));
450 xhv = (XPVHV*)SvANY(hv);
454 PERL_HASH(hash, key, klen);
456 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
459 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
460 if (HeHASH(entry) != hash) /* strings can't be equal */
462 if (HeKLEN(entry) != klen)
464 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
466 *oentry = HeNEXT(entry);
469 if (flags & G_DISCARD)
472 sv = sv_mortalcopy(HeVAL(entry));
473 if (entry == xhv->xhv_eiter)
476 hv_free_ent(hv, entry);
484 hv_delete_ent(HV *hv, SV *keysv, I32 flags, U32 hash)
491 register HE **oentry;
496 if (SvRMAGICAL(hv)) {
497 entry = hv_fetch_ent(hv, keysv, TRUE, hash);
500 if (mg_find(sv, 'p')) {
501 sv_unmagic(sv, 'p'); /* No longer an element */
504 #ifdef ENV_IS_CASELESS
505 else if (mg_find((SV*)hv,'E')) {
506 key = SvPV(keysv, klen);
507 keysv = sv_2mortal(newSVpv(key,klen));
508 (void)strupr(SvPVX(keysv));
513 xhv = (XPVHV*)SvANY(hv);
517 key = SvPV(keysv, klen);
520 PERL_HASH(hash, key, klen);
522 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
525 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
526 if (HeHASH(entry) != hash) /* strings can't be equal */
528 if (HeKLEN(entry) != klen)
530 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
532 *oentry = HeNEXT(entry);
535 if (flags & G_DISCARD)
538 sv = sv_mortalcopy(HeVAL(entry));
539 if (entry == xhv->xhv_eiter)
542 hv_free_ent(hv, entry);
550 hv_exists(HV *hv, char *key, U32 klen)
560 if (SvRMAGICAL(hv)) {
561 if (mg_find((SV*)hv,'P')) {
564 mg_copy((SV*)hv, sv, key, klen);
565 magic_existspack(sv, mg_find(sv, 'p'));
568 #ifdef ENV_IS_CASELESS
569 else if (mg_find((SV*)hv,'E')) {
570 sv = sv_2mortal(newSVpv(key,klen));
571 key = strupr(SvPVX(sv));
576 xhv = (XPVHV*)SvANY(hv);
580 PERL_HASH(hash, key, klen);
582 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
583 for (; entry; entry = HeNEXT(entry)) {
584 if (HeHASH(entry) != hash) /* strings can't be equal */
586 if (HeKLEN(entry) != klen)
588 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
597 hv_exists_ent(HV *hv, SV *keysv, U32 hash)
608 if (SvRMAGICAL(hv)) {
609 if (mg_find((SV*)hv,'P')) {
610 dTHR; /* just for SvTRUE */
612 keysv = sv_2mortal(newSVsv(keysv));
613 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
614 magic_existspack(sv, mg_find(sv, 'p'));
617 #ifdef ENV_IS_CASELESS
618 else if (mg_find((SV*)hv,'E')) {
619 key = SvPV(keysv, klen);
620 keysv = sv_2mortal(newSVpv(key,klen));
621 (void)strupr(SvPVX(keysv));
627 xhv = (XPVHV*)SvANY(hv);
631 key = SvPV(keysv, klen);
633 PERL_HASH(hash, key, klen);
635 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
636 for (; entry; entry = HeNEXT(entry)) {
637 if (HeHASH(entry) != hash) /* strings can't be equal */
639 if (HeKLEN(entry) != klen)
641 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
651 register XPVHV* xhv = (XPVHV*)SvANY(hv);
652 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
653 register I32 newsize = oldsize * 2;
658 register HE **oentry;
659 #ifndef STRANGE_MALLOC
663 a = (HE**)xhv->xhv_array;
665 #ifdef STRANGE_MALLOC
666 Renew(a, newsize, HE*);
668 i = newsize * sizeof(HE*);
669 #define MALLOC_OVERHEAD 16
670 tmp = MALLOC_OVERHEAD;
671 while (tmp - MALLOC_OVERHEAD < i)
673 tmp -= MALLOC_OVERHEAD;
675 assert(tmp >= newsize);
677 Copy(xhv->xhv_array, a, oldsize, HE*);
679 offer_nice_chunk(xhv->xhv_array,
680 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
683 Safefree(xhv->xhv_array);
687 Zero(&a[oldsize], oldsize, HE*); /* zero 2nd half*/
688 xhv->xhv_max = --newsize;
689 xhv->xhv_array = (char*)a;
691 for (i=0; i<oldsize; i++,a++) {
692 if (!*a) /* non-existent */
695 for (oentry = a, entry = *a; entry; entry = *oentry) {
696 if ((HeHASH(entry) & newsize) != i) {
697 *oentry = HeNEXT(entry);
705 oentry = &HeNEXT(entry);
707 if (!*a) /* everything moved */
713 hv_ksplit(HV *hv, IV newmax)
715 register XPVHV* xhv = (XPVHV*)SvANY(hv);
716 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
717 register I32 newsize;
722 register HE **oentry;
724 newsize = (I32) newmax; /* possible truncation here */
725 if (newsize != newmax || newmax <= oldsize)
727 while ((newsize & (1 + ~newsize)) != newsize) {
728 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
730 if (newsize < newmax)
732 if (newsize < newmax)
733 return; /* overflow detection */
735 a = (HE**)xhv->xhv_array;
738 #ifdef STRANGE_MALLOC
739 Renew(a, newsize, HE*);
741 i = newsize * sizeof(HE*);
743 while (j - MALLOC_OVERHEAD < i)
745 j -= MALLOC_OVERHEAD;
747 assert(j >= newsize);
749 Copy(xhv->xhv_array, a, oldsize, HE*);
751 offer_nice_chunk(xhv->xhv_array,
752 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
755 Safefree(xhv->xhv_array);
758 Zero(&a[oldsize], newsize-oldsize, HE*); /* zero 2nd half*/
761 Newz(0, a, newsize, HE*);
763 xhv->xhv_max = --newsize;
764 xhv->xhv_array = (char*)a;
765 if (!xhv->xhv_fill) /* skip rest if no entries */
768 for (i=0; i<oldsize; i++,a++) {
769 if (!*a) /* non-existent */
771 for (oentry = a, entry = *a; entry; entry = *oentry) {
772 if ((j = (HeHASH(entry) & newsize)) != i) {
774 *oentry = HeNEXT(entry);
775 if (!(HeNEXT(entry) = a[j]))
781 oentry = &HeNEXT(entry);
783 if (!*a) /* everything moved */
794 hv = (HV*)NEWSV(502,0);
795 sv_upgrade((SV *)hv, SVt_PVHV);
796 xhv = (XPVHV*)SvANY(hv);
799 #ifndef NODEFAULT_SHAREKEYS
800 HvSHAREKEYS_on(hv); /* key-sharing on by default */
802 xhv->xhv_max = 7; /* start with 8 buckets */
805 (void)hv_iterinit(hv); /* so each() will start off right */
810 hv_free_ent(HV *hv, register HE *entry)
814 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
815 sub_generation++; /* may be deletion of method from stash */
816 SvREFCNT_dec(HeVAL(entry));
817 if (HeKLEN(entry) == HEf_SVKEY) {
818 SvREFCNT_dec(HeKEY_sv(entry));
819 Safefree(HeKEY_hek(entry));
821 else if (HvSHAREKEYS(hv))
822 unshare_hek(HeKEY_hek(entry));
824 Safefree(HeKEY_hek(entry));
829 hv_delayfree_ent(HV *hv, register HE *entry)
833 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
834 sub_generation++; /* may be deletion of method from stash */
835 sv_2mortal(HeVAL(entry)); /* free between statements */
836 if (HeKLEN(entry) == HEf_SVKEY) {
837 sv_2mortal(HeKEY_sv(entry));
838 Safefree(HeKEY_hek(entry));
840 else if (HvSHAREKEYS(hv))
841 unshare_hek(HeKEY_hek(entry));
843 Safefree(HeKEY_hek(entry));
853 xhv = (XPVHV*)SvANY(hv);
858 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
869 register HE *oentry = Null(HE*);
885 entry = HeNEXT(entry);
886 hv_free_ent(hv, oentry);
891 entry = array[riter];
894 (void)hv_iterinit(hv);
903 xhv = (XPVHV*)SvANY(hv);
905 Safefree(xhv->xhv_array);
907 Safefree(HvNAME(hv));
911 xhv->xhv_max = 7; /* it's a normal hash */
927 xhv = (XPVHV*)SvANY(hv);
928 entry = xhv->xhv_eiter;
929 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
930 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
933 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
935 hv_free_ent(hv, entry);
938 xhv->xhv_eiter = Null(HE*);
939 return xhv->xhv_fill; /* should be xhv->xhv_keys? May change later */
952 xhv = (XPVHV*)SvANY(hv);
953 oldentry = entry = xhv->xhv_eiter;
955 if (SvRMAGICAL(hv) && (mg = mg_find((SV*)hv,'P'))) {
956 SV *key = sv_newmortal();
958 sv_setsv(key, HeSVKEY_force(entry));
959 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
965 xhv->xhv_eiter = entry = new_he(); /* one HE per MAGICAL hash */
967 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
969 HeKEY_hek(entry) = hek;
970 HeKLEN(entry) = HEf_SVKEY;
972 magic_nextpack((SV*) hv,mg,key);
974 /* force key to stay around until next time */
975 HeSVKEY_set(entry, SvREFCNT_inc(key));
976 return entry; /* beware, hent_val is not set */
979 SvREFCNT_dec(HeVAL(entry));
980 Safefree(HeKEY_hek(entry));
982 xhv->xhv_eiter = Null(HE*);
987 Newz(506,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
989 entry = HeNEXT(entry);
992 if (xhv->xhv_riter > xhv->xhv_max) {
996 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
999 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1001 hv_free_ent(hv, oldentry);
1004 xhv->xhv_eiter = entry;
1009 hv_iterkey(register HE *entry, I32 *retlen)
1011 if (HeKLEN(entry) == HEf_SVKEY) {
1013 char *p = SvPV(HeKEY_sv(entry), len);
1018 *retlen = HeKLEN(entry);
1019 return HeKEY(entry);
1023 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1025 hv_iterkeysv(register HE *entry)
1027 if (HeKLEN(entry) == HEf_SVKEY)
1028 return sv_mortalcopy(HeKEY_sv(entry));
1030 return sv_2mortal(newSVpv((HeKLEN(entry) ? HeKEY(entry) : ""),
1035 hv_iterval(HV *hv, register HE *entry)
1037 if (SvRMAGICAL(hv)) {
1038 if (mg_find((SV*)hv,'P')) {
1039 SV* sv = sv_newmortal();
1040 if (HeKLEN(entry) == HEf_SVKEY)
1041 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1042 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1046 return HeVAL(entry);
1050 hv_iternextsv(HV *hv, char **key, I32 *retlen)
1053 if ( (he = hv_iternext(hv)) == NULL)
1055 *key = hv_iterkey(he, retlen);
1056 return hv_iterval(hv, he);
1060 hv_magic(HV *hv, GV *gv, int how)
1062 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1066 sharepvn(char *sv, I32 len, U32 hash)
1068 return HEK_KEY(share_hek(sv, len, hash));
1071 /* possibly free a shared string if no one has access to it
1072 * len and hash must both be valid for str.
1075 unsharepvn(char *str, I32 len, U32 hash)
1077 register XPVHV* xhv;
1079 register HE **oentry;
1083 /* what follows is the moral equivalent of:
1084 if ((Svp = hv_fetch(strtab, tmpsv, FALSE, hash))) {
1085 if (--*Svp == Nullsv)
1086 hv_delete(strtab, str, len, G_DISCARD, hash);
1088 xhv = (XPVHV*)SvANY(strtab);
1089 /* assert(xhv_array != 0) */
1090 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1091 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1092 if (HeHASH(entry) != hash) /* strings can't be equal */
1094 if (HeKLEN(entry) != len)
1096 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1099 if (--HeVAL(entry) == Nullsv) {
1100 *oentry = HeNEXT(entry);
1103 Safefree(HeKEY_hek(entry));
1111 warn("Attempt to free non-existent shared string");
1114 /* get a (constant) string ptr from the global string table
1115 * string will get added if it is not already there.
1116 * len and hash must both be valid for str.
1119 share_hek(char *str, I32 len, register U32 hash)
1121 register XPVHV* xhv;
1123 register HE **oentry;
1127 /* what follows is the moral equivalent of:
1129 if (!(Svp = hv_fetch(strtab, str, len, FALSE)))
1130 hv_store(strtab, str, len, Nullsv, hash);
1132 xhv = (XPVHV*)SvANY(strtab);
1133 /* assert(xhv_array != 0) */
1134 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1135 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
1136 if (HeHASH(entry) != hash) /* strings can't be equal */
1138 if (HeKLEN(entry) != len)
1140 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1147 HeKEY_hek(entry) = save_hek(str, len, hash);
1148 HeVAL(entry) = Nullsv;
1149 HeNEXT(entry) = *oentry;
1152 if (i) { /* initial entry? */
1154 if (xhv->xhv_keys > xhv->xhv_max)
1159 ++HeVAL(entry); /* use value slot as REFCNT */
1160 return HeKEY_hek(entry);