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)
94 if (mg_find((SV*)hv,'P')) {
97 mg_copy((SV*)hv, sv, key, klen);
101 #ifdef ENV_IS_CASELESS
102 else if (mg_find((SV*)hv,'E')) {
103 sv = sv_2mortal(newSVpv(key,klen));
104 key = strupr(SvPVX(sv));
109 xhv = (XPVHV*)SvANY(hv);
110 if (!xhv->xhv_array) {
112 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
113 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
116 Newz(503,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
121 PERL_HASH(hash, key, klen);
123 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
124 for (; entry; entry = HeNEXT(entry)) {
125 if (HeHASH(entry) != hash) /* strings can't be equal */
127 if (HeKLEN(entry) != klen)
129 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
131 return &HeVAL(entry);
133 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
134 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
137 if ((gotenv = ENV_getenv(key)) != Nullch) {
138 sv = newSVpv(gotenv,strlen(gotenv));
140 return hv_store(hv,origkey,klen,sv,hash);
144 if (lval) { /* gonna assign to this, so it better be there */
146 return hv_store(hv,origkey,klen,sv,hash);
151 /* returns a HE * structure with the all fields set */
152 /* note that hent_val will be a mortal sv for MAGICAL hashes */
154 hv_fetch_ent(HV *hv, SV *keysv, I32 lval, register U32 hash)
160 SV *origkeysv = keysv;
166 if (SvRMAGICAL(hv)) {
167 if (mg_find((SV*)hv,'P')) {
171 keysv = sv_2mortal(newSVsv(keysv));
172 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
173 if (!HeKEY_hek(&mh)) {
175 New(54, k, HEK_BASESIZE + sizeof(SV*), char);
176 HeKEY_hek(&mh) = (HEK*)k;
178 HeSVKEY_set(&mh, keysv);
182 #ifdef ENV_IS_CASELESS
183 else if (mg_find((SV*)hv,'E')) {
184 key = SvPV(keysv, klen);
185 keysv = sv_2mortal(newSVpv(key,klen));
186 (void)strupr(SvPVX(keysv));
192 xhv = (XPVHV*)SvANY(hv);
193 if (!xhv->xhv_array) {
195 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
196 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
199 Newz(503,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
204 key = SvPV(keysv, klen);
207 PERL_HASH(hash, key, klen);
209 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
210 for (; entry; entry = HeNEXT(entry)) {
211 if (HeHASH(entry) != hash) /* strings can't be equal */
213 if (HeKLEN(entry) != klen)
215 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
219 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
220 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
223 if ((gotenv = ENV_getenv(key)) != Nullch) {
224 sv = newSVpv(gotenv,strlen(gotenv));
226 return hv_store_ent(hv,origkeysv,sv,hash);
230 if (lval) { /* gonna assign to this, so it better be there */
232 return hv_store_ent(hv,origkeysv,sv,hash);
238 hv_magic_check (HV *hv, bool *needs_copy, bool *needs_store)
240 MAGIC *mg = SvMAGIC(hv);
244 if (isUPPER(mg->mg_type)) {
246 switch (mg->mg_type) {
250 *needs_store = FALSE;
253 mg = mg->mg_moremagic;
258 hv_store(HV *hv, char *key, U32 klen, SV *val, register U32 hash)
263 register HE **oentry;
268 xhv = (XPVHV*)SvANY(hv);
272 hv_magic_check (hv, &needs_copy, &needs_store);
274 mg_copy((SV*)hv, val, key, klen);
275 if (!xhv->xhv_array && !needs_store)
277 #ifdef ENV_IS_CASELESS
278 else if (mg_find((SV*)hv,'E')) {
279 SV *sv = sv_2mortal(newSVpv(key,klen));
280 key = strupr(SvPVX(sv));
287 PERL_HASH(hash, key, klen);
290 Newz(505, xhv->xhv_array, sizeof(HE**) * (xhv->xhv_max + 1), char);
292 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
295 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
296 if (HeHASH(entry) != hash) /* strings can't be equal */
298 if (HeKLEN(entry) != klen)
300 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
302 SvREFCNT_dec(HeVAL(entry));
304 return &HeVAL(entry);
309 HeKEY_hek(entry) = share_hek(key, klen, hash);
310 else /* gotta do the real thing */
311 HeKEY_hek(entry) = save_hek(key, klen, hash);
313 HeNEXT(entry) = *oentry;
317 if (i) { /* initial entry? */
319 if (xhv->xhv_keys > xhv->xhv_max)
323 return &HeVAL(entry);
327 hv_store_ent(HV *hv, SV *keysv, SV *val, register U32 hash)
334 register HE **oentry;
339 xhv = (XPVHV*)SvANY(hv);
344 hv_magic_check (hv, &needs_copy, &needs_store);
346 bool save_taint = tainted;
348 tainted = SvTAINTED(keysv);
349 keysv = sv_2mortal(newSVsv(keysv));
350 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
351 TAINT_IF(save_taint);
352 if (!xhv->xhv_array && !needs_store)
354 #ifdef ENV_IS_CASELESS
355 else if (mg_find((SV*)hv,'E')) {
356 key = SvPV(keysv, klen);
357 keysv = sv_2mortal(newSVpv(key,klen));
358 (void)strupr(SvPVX(keysv));
365 key = SvPV(keysv, klen);
368 PERL_HASH(hash, key, klen);
371 Newz(505, xhv->xhv_array, sizeof(HE**) * (xhv->xhv_max + 1), char);
373 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
376 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
377 if (HeHASH(entry) != hash) /* strings can't be equal */
379 if (HeKLEN(entry) != klen)
381 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
383 SvREFCNT_dec(HeVAL(entry));
390 HeKEY_hek(entry) = share_hek(key, klen, hash);
391 else /* gotta do the real thing */
392 HeKEY_hek(entry) = save_hek(key, klen, hash);
394 HeNEXT(entry) = *oentry;
398 if (i) { /* initial entry? */
400 if (xhv->xhv_keys > xhv->xhv_max)
408 hv_delete(HV *hv, char *key, U32 klen, I32 flags)
414 register HE **oentry;
419 if (SvRMAGICAL(hv)) {
420 sv = *hv_fetch(hv, key, klen, TRUE);
422 if (mg_find(sv, 's')) {
423 return Nullsv; /* %SIG elements cannot be deleted */
425 else if (mg_find(sv, 'p')) {
426 sv_unmagic(sv, 'p'); /* No longer an element */
429 #ifdef ENV_IS_CASELESS
430 else if (mg_find((SV*)hv,'E')) {
431 sv = sv_2mortal(newSVpv(key,klen));
432 key = strupr(SvPVX(sv));
436 xhv = (XPVHV*)SvANY(hv);
440 PERL_HASH(hash, key, klen);
442 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
445 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
446 if (HeHASH(entry) != hash) /* strings can't be equal */
448 if (HeKLEN(entry) != klen)
450 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
452 *oentry = HeNEXT(entry);
455 if (flags & G_DISCARD)
458 sv = sv_mortalcopy(HeVAL(entry));
459 if (entry == xhv->xhv_eiter)
462 hv_free_ent(hv, entry);
470 hv_delete_ent(HV *hv, SV *keysv, I32 flags, U32 hash)
477 register HE **oentry;
482 if (SvRMAGICAL(hv)) {
483 entry = hv_fetch_ent(hv, keysv, TRUE, hash);
486 if (mg_find(sv, 'p')) {
487 sv_unmagic(sv, 'p'); /* No longer an element */
490 #ifdef ENV_IS_CASELESS
491 else if (mg_find((SV*)hv,'E')) {
492 key = SvPV(keysv, klen);
493 keysv = sv_2mortal(newSVpv(key,klen));
494 (void)strupr(SvPVX(keysv));
499 xhv = (XPVHV*)SvANY(hv);
503 key = SvPV(keysv, klen);
506 PERL_HASH(hash, key, klen);
508 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
511 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
512 if (HeHASH(entry) != hash) /* strings can't be equal */
514 if (HeKLEN(entry) != klen)
516 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
518 *oentry = HeNEXT(entry);
521 if (flags & G_DISCARD)
524 sv = sv_mortalcopy(HeVAL(entry));
525 if (entry == xhv->xhv_eiter)
528 hv_free_ent(hv, entry);
536 hv_exists(HV *hv, char *key, U32 klen)
546 if (SvRMAGICAL(hv)) {
547 if (mg_find((SV*)hv,'P')) {
550 mg_copy((SV*)hv, sv, key, klen);
551 magic_existspack(sv, mg_find(sv, 'p'));
554 #ifdef ENV_IS_CASELESS
555 else if (mg_find((SV*)hv,'E')) {
556 sv = sv_2mortal(newSVpv(key,klen));
557 key = strupr(SvPVX(sv));
562 xhv = (XPVHV*)SvANY(hv);
566 PERL_HASH(hash, key, klen);
568 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
569 for (; entry; entry = HeNEXT(entry)) {
570 if (HeHASH(entry) != hash) /* strings can't be equal */
572 if (HeKLEN(entry) != klen)
574 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
583 hv_exists_ent(HV *hv, SV *keysv, U32 hash)
594 if (SvRMAGICAL(hv)) {
595 if (mg_find((SV*)hv,'P')) {
596 dTHR; /* just for SvTRUE */
598 keysv = sv_2mortal(newSVsv(keysv));
599 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
600 magic_existspack(sv, mg_find(sv, 'p'));
603 #ifdef ENV_IS_CASELESS
604 else if (mg_find((SV*)hv,'E')) {
605 key = SvPV(keysv, klen);
606 keysv = sv_2mortal(newSVpv(key,klen));
607 (void)strupr(SvPVX(keysv));
613 xhv = (XPVHV*)SvANY(hv);
617 key = SvPV(keysv, klen);
619 PERL_HASH(hash, key, klen);
621 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
622 for (; entry; entry = HeNEXT(entry)) {
623 if (HeHASH(entry) != hash) /* strings can't be equal */
625 if (HeKLEN(entry) != klen)
627 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
637 register XPVHV* xhv = (XPVHV*)SvANY(hv);
638 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
639 register I32 newsize = oldsize * 2;
644 register HE **oentry;
645 #ifndef STRANGE_MALLOC
649 a = (HE**)xhv->xhv_array;
651 #ifdef STRANGE_MALLOC
652 Renew(a, newsize, HE*);
654 i = newsize * sizeof(HE*);
655 #define MALLOC_OVERHEAD 16
656 tmp = MALLOC_OVERHEAD;
657 while (tmp - MALLOC_OVERHEAD < i)
659 tmp -= MALLOC_OVERHEAD;
661 assert(tmp >= newsize);
663 Copy(xhv->xhv_array, a, oldsize, HE*);
665 offer_nice_chunk(xhv->xhv_array,
666 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
669 Safefree(xhv->xhv_array);
673 Zero(&a[oldsize], oldsize, HE*); /* zero 2nd half*/
674 xhv->xhv_max = --newsize;
675 xhv->xhv_array = (char*)a;
677 for (i=0; i<oldsize; i++,a++) {
678 if (!*a) /* non-existent */
681 for (oentry = a, entry = *a; entry; entry = *oentry) {
682 if ((HeHASH(entry) & newsize) != i) {
683 *oentry = HeNEXT(entry);
691 oentry = &HeNEXT(entry);
693 if (!*a) /* everything moved */
699 hv_ksplit(HV *hv, IV newmax)
701 register XPVHV* xhv = (XPVHV*)SvANY(hv);
702 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
703 register I32 newsize;
708 register HE **oentry;
710 newsize = (I32) newmax; /* possible truncation here */
711 if (newsize != newmax || newmax <= oldsize)
713 while ((newsize & (1 + ~newsize)) != newsize) {
714 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
716 if (newsize < newmax)
718 if (newsize < newmax)
719 return; /* overflow detection */
721 a = (HE**)xhv->xhv_array;
724 #ifdef STRANGE_MALLOC
725 Renew(a, newsize, HE*);
727 i = newsize * sizeof(HE*);
729 while (j - MALLOC_OVERHEAD < i)
731 j -= MALLOC_OVERHEAD;
733 assert(j >= newsize);
735 Copy(xhv->xhv_array, a, oldsize, HE*);
737 offer_nice_chunk(xhv->xhv_array,
738 oldsize * sizeof(HE*) * 2 - MALLOC_OVERHEAD);
741 Safefree(xhv->xhv_array);
744 Zero(&a[oldsize], newsize-oldsize, HE*); /* zero 2nd half*/
747 Newz(0, a, newsize, HE*);
749 xhv->xhv_max = --newsize;
750 xhv->xhv_array = (char*)a;
751 if (!xhv->xhv_fill) /* skip rest if no entries */
754 for (i=0; i<oldsize; i++,a++) {
755 if (!*a) /* non-existent */
757 for (oentry = a, entry = *a; entry; entry = *oentry) {
758 if ((j = (HeHASH(entry) & newsize)) != i) {
760 *oentry = HeNEXT(entry);
761 if (!(HeNEXT(entry) = a[j]))
767 oentry = &HeNEXT(entry);
769 if (!*a) /* everything moved */
780 hv = (HV*)NEWSV(502,0);
781 sv_upgrade((SV *)hv, SVt_PVHV);
782 xhv = (XPVHV*)SvANY(hv);
785 #ifndef NODEFAULT_SHAREKEYS
786 HvSHAREKEYS_on(hv); /* key-sharing on by default */
788 xhv->xhv_max = 7; /* start with 8 buckets */
791 (void)hv_iterinit(hv); /* so each() will start off right */
796 hv_free_ent(HV *hv, register HE *entry)
800 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
801 sub_generation++; /* may be deletion of method from stash */
802 SvREFCNT_dec(HeVAL(entry));
803 if (HeKLEN(entry) == HEf_SVKEY) {
804 SvREFCNT_dec(HeKEY_sv(entry));
805 Safefree(HeKEY_hek(entry));
807 else if (HvSHAREKEYS(hv))
808 unshare_hek(HeKEY_hek(entry));
810 Safefree(HeKEY_hek(entry));
815 hv_delayfree_ent(HV *hv, register HE *entry)
819 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
820 sub_generation++; /* may be deletion of method from stash */
821 sv_2mortal(HeVAL(entry)); /* free between statements */
822 if (HeKLEN(entry) == HEf_SVKEY) {
823 sv_2mortal(HeKEY_sv(entry));
824 Safefree(HeKEY_hek(entry));
826 else if (HvSHAREKEYS(hv))
827 unshare_hek(HeKEY_hek(entry));
829 Safefree(HeKEY_hek(entry));
839 xhv = (XPVHV*)SvANY(hv);
844 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
855 register HE *oentry = Null(HE*);
871 entry = HeNEXT(entry);
872 hv_free_ent(hv, oentry);
877 entry = array[riter];
880 (void)hv_iterinit(hv);
889 xhv = (XPVHV*)SvANY(hv);
891 Safefree(xhv->xhv_array);
893 Safefree(HvNAME(hv));
897 xhv->xhv_max = 7; /* it's a normal hash */
913 xhv = (XPVHV*)SvANY(hv);
914 entry = xhv->xhv_eiter;
915 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
916 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
919 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
921 hv_free_ent(hv, entry);
924 xhv->xhv_eiter = Null(HE*);
925 return xhv->xhv_fill; /* should be xhv->xhv_keys? May change later */
938 xhv = (XPVHV*)SvANY(hv);
939 oldentry = entry = xhv->xhv_eiter;
941 if (SvRMAGICAL(hv) && (mg = mg_find((SV*)hv,'P'))) {
942 SV *key = sv_newmortal();
944 sv_setsv(key, HeSVKEY_force(entry));
945 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
951 xhv->xhv_eiter = entry = new_he(); /* one HE per MAGICAL hash */
953 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
955 HeKEY_hek(entry) = hek;
956 HeKLEN(entry) = HEf_SVKEY;
958 magic_nextpack((SV*) hv,mg,key);
960 /* force key to stay around until next time */
961 HeSVKEY_set(entry, SvREFCNT_inc(key));
962 return entry; /* beware, hent_val is not set */
965 SvREFCNT_dec(HeVAL(entry));
966 Safefree(HeKEY_hek(entry));
968 xhv->xhv_eiter = Null(HE*);
973 Newz(506,xhv->xhv_array, sizeof(HE*) * (xhv->xhv_max + 1), char);
975 entry = HeNEXT(entry);
978 if (xhv->xhv_riter > xhv->xhv_max) {
982 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
985 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
987 hv_free_ent(hv, oldentry);
990 xhv->xhv_eiter = entry;
995 hv_iterkey(register HE *entry, I32 *retlen)
997 if (HeKLEN(entry) == HEf_SVKEY) {
999 char *p = SvPV(HeKEY_sv(entry), len);
1004 *retlen = HeKLEN(entry);
1005 return HeKEY(entry);
1009 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1011 hv_iterkeysv(register HE *entry)
1013 if (HeKLEN(entry) == HEf_SVKEY)
1014 return sv_mortalcopy(HeKEY_sv(entry));
1016 return sv_2mortal(newSVpv((HeKLEN(entry) ? HeKEY(entry) : ""),
1021 hv_iterval(HV *hv, register HE *entry)
1023 if (SvRMAGICAL(hv)) {
1024 if (mg_find((SV*)hv,'P')) {
1025 SV* sv = sv_newmortal();
1026 if (HeKLEN(entry) == HEf_SVKEY)
1027 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1028 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1032 return HeVAL(entry);
1036 hv_iternextsv(HV *hv, char **key, I32 *retlen)
1039 if ( (he = hv_iternext(hv)) == NULL)
1041 *key = hv_iterkey(he, retlen);
1042 return hv_iterval(hv, he);
1046 hv_magic(HV *hv, GV *gv, int how)
1048 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1052 sharepvn(char *sv, I32 len, U32 hash)
1054 return HEK_KEY(share_hek(sv, len, hash));
1057 /* possibly free a shared string if no one has access to it
1058 * len and hash must both be valid for str.
1061 unsharepvn(char *str, I32 len, U32 hash)
1063 register XPVHV* xhv;
1065 register HE **oentry;
1069 /* what follows is the moral equivalent of:
1070 if ((Svp = hv_fetch(strtab, tmpsv, FALSE, hash))) {
1071 if (--*Svp == Nullsv)
1072 hv_delete(strtab, str, len, G_DISCARD, hash);
1074 xhv = (XPVHV*)SvANY(strtab);
1075 /* assert(xhv_array != 0) */
1076 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1077 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1078 if (HeHASH(entry) != hash) /* strings can't be equal */
1080 if (HeKLEN(entry) != len)
1082 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1085 if (--HeVAL(entry) == Nullsv) {
1086 *oentry = HeNEXT(entry);
1089 Safefree(HeKEY_hek(entry));
1097 warn("Attempt to free non-existent shared string");
1100 /* get a (constant) string ptr from the global string table
1101 * string will get added if it is not already there.
1102 * len and hash must both be valid for str.
1105 share_hek(char *str, I32 len, register U32 hash)
1107 register XPVHV* xhv;
1109 register HE **oentry;
1113 /* what follows is the moral equivalent of:
1115 if (!(Svp = hv_fetch(strtab, str, len, FALSE)))
1116 hv_store(strtab, str, len, Nullsv, hash);
1118 xhv = (XPVHV*)SvANY(strtab);
1119 /* assert(xhv_array != 0) */
1120 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1121 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
1122 if (HeHASH(entry) != hash) /* strings can't be equal */
1124 if (HeKLEN(entry) != len)
1126 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1133 HeKEY_hek(entry) = save_hek(str, len, hash);
1134 HeVAL(entry) = Nullsv;
1135 HeNEXT(entry) = *oentry;
1138 if (i) { /* initial entry? */
1140 if (xhv->xhv_keys > xhv->xhv_max)
1145 ++HeVAL(entry); /* use value slot as REFCNT */
1146 return HeKEY_hek(entry);