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 void more_he _((void));
24 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
25 # define ARRAY_ALLOC_BYTES(size) ( (size)*sizeof(HE*) )
27 # define MALLOC_OVERHEAD 16
28 # define ARRAY_ALLOC_BYTES(size) ( (size)*sizeof(HE*)*2 - MALLOC_OVERHEAD )
39 PL_he_root = HeNEXT(he);
48 HeNEXT(p) = (HE*)PL_he_root;
58 New(54, PL_he_root, 1008/sizeof(HE), HE);
60 heend = &he[1008 / sizeof(HE) - 1];
62 HeNEXT(he) = (HE*)(he + 1);
69 save_hek(char *str, I32 len, U32 hash)
74 New(54, k, HEK_BASESIZE + len + 1, char);
76 Copy(str, HEK_KEY(hek), len, char);
77 *(HEK_KEY(hek) + len) = '\0';
86 unsharepvn(HEK_KEY(hek),HEK_LEN(hek),HEK_HASH(hek));
89 /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot
93 hv_fetch(HV *hv, char *key, U32 klen, I32 lval)
103 if (SvRMAGICAL(hv)) {
104 if (mg_find((SV*)hv,'P')) {
107 mg_copy((SV*)hv, sv, key, klen);
109 return &PL_hv_fetch_sv;
111 #ifdef ENV_IS_CASELESS
112 else if (mg_find((SV*)hv,'E')) {
114 for (i = 0; i < klen; ++i)
115 if (isLOWER(key[i])) {
116 char *nkey = strupr(SvPVX(sv_2mortal(newSVpv(key,klen))));
117 SV **ret = hv_fetch(hv, nkey, klen, 0);
119 ret = hv_store(hv, key, klen, NEWSV(61,0), 0);
126 xhv = (XPVHV*)SvANY(hv);
127 if (!xhv->xhv_array) {
129 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
130 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
133 Newz(503,xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
138 PERL_HASH(hash, key, klen);
140 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
141 for (; entry; entry = HeNEXT(entry)) {
142 if (HeHASH(entry) != hash) /* strings can't be equal */
144 if (HeKLEN(entry) != klen)
146 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
148 return &HeVAL(entry);
150 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
151 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
154 if ((gotenv = PerlEnv_getenv(key)) != Nullch) {
155 sv = newSVpv(gotenv,strlen(gotenv));
157 return hv_store(hv,key,klen,sv,hash);
161 if (lval) { /* gonna assign to this, so it better be there */
163 return hv_store(hv,key,klen,sv,hash);
168 /* returns a HE * structure with the all fields set */
169 /* note that hent_val will be a mortal sv for MAGICAL hashes */
171 hv_fetch_ent(HV *hv, SV *keysv, I32 lval, register U32 hash)
182 if (SvRMAGICAL(hv)) {
183 if (mg_find((SV*)hv,'P')) {
186 keysv = sv_2mortal(newSVsv(keysv));
187 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
188 if (!HeKEY_hek(&PL_hv_fetch_ent_mh)) {
190 New(54, k, HEK_BASESIZE + sizeof(SV*), char);
191 HeKEY_hek(&PL_hv_fetch_ent_mh) = (HEK*)k;
193 HeSVKEY_set(&PL_hv_fetch_ent_mh, keysv);
194 HeVAL(&PL_hv_fetch_ent_mh) = sv;
195 return &PL_hv_fetch_ent_mh;
197 #ifdef ENV_IS_CASELESS
198 else if (mg_find((SV*)hv,'E')) {
200 key = SvPV(keysv, klen);
201 for (i = 0; i < klen; ++i)
202 if (isLOWER(key[i])) {
203 SV *nkeysv = sv_2mortal(newSVpv(key,klen));
204 (void)strupr(SvPVX(nkeysv));
205 entry = hv_fetch_ent(hv, nkeysv, 0, 0);
207 entry = hv_store_ent(hv, keysv, NEWSV(61,0), hash);
214 xhv = (XPVHV*)SvANY(hv);
215 if (!xhv->xhv_array) {
217 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
218 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
221 Newz(503,xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
226 key = SvPV(keysv, klen);
229 PERL_HASH(hash, key, klen);
231 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
232 for (; entry; entry = HeNEXT(entry)) {
233 if (HeHASH(entry) != hash) /* strings can't be equal */
235 if (HeKLEN(entry) != klen)
237 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
241 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
242 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
245 if ((gotenv = PerlEnv_getenv(key)) != Nullch) {
246 sv = newSVpv(gotenv,strlen(gotenv));
248 return hv_store_ent(hv,keysv,sv,hash);
252 if (lval) { /* gonna assign to this, so it better be there */
254 return hv_store_ent(hv,keysv,sv,hash);
260 hv_magic_check (HV *hv, bool *needs_copy, bool *needs_store)
262 MAGIC *mg = SvMAGIC(hv);
266 if (isUPPER(mg->mg_type)) {
268 switch (mg->mg_type) {
271 *needs_store = FALSE;
274 mg = mg->mg_moremagic;
279 hv_store(HV *hv, char *key, U32 klen, SV *val, register U32 hash)
284 register HE **oentry;
289 xhv = (XPVHV*)SvANY(hv);
293 hv_magic_check (hv, &needs_copy, &needs_store);
295 mg_copy((SV*)hv, val, key, klen);
296 if (!xhv->xhv_array && !needs_store)
298 #ifdef ENV_IS_CASELESS
299 else if (mg_find((SV*)hv,'E')) {
300 SV *sv = sv_2mortal(newSVpv(key,klen));
301 key = strupr(SvPVX(sv));
308 PERL_HASH(hash, key, klen);
311 Newz(505, xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
313 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
316 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
317 if (HeHASH(entry) != hash) /* strings can't be equal */
319 if (HeKLEN(entry) != klen)
321 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
323 SvREFCNT_dec(HeVAL(entry));
325 return &HeVAL(entry);
330 HeKEY_hek(entry) = share_hek(key, klen, hash);
331 else /* gotta do the real thing */
332 HeKEY_hek(entry) = save_hek(key, klen, hash);
334 HeNEXT(entry) = *oentry;
338 if (i) { /* initial entry? */
340 if (xhv->xhv_keys > xhv->xhv_max)
344 return &HeVAL(entry);
348 hv_store_ent(HV *hv, SV *keysv, SV *val, register U32 hash)
355 register HE **oentry;
360 xhv = (XPVHV*)SvANY(hv);
365 hv_magic_check (hv, &needs_copy, &needs_store);
367 bool save_taint = PL_tainted;
369 PL_tainted = SvTAINTED(keysv);
370 keysv = sv_2mortal(newSVsv(keysv));
371 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
372 TAINT_IF(save_taint);
373 if (!xhv->xhv_array && !needs_store)
375 #ifdef ENV_IS_CASELESS
376 else if (mg_find((SV*)hv,'E')) {
377 key = SvPV(keysv, klen);
378 keysv = sv_2mortal(newSVpv(key,klen));
379 (void)strupr(SvPVX(keysv));
386 key = SvPV(keysv, klen);
389 PERL_HASH(hash, key, klen);
392 Newz(505, xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
394 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
397 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
398 if (HeHASH(entry) != hash) /* strings can't be equal */
400 if (HeKLEN(entry) != klen)
402 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
404 SvREFCNT_dec(HeVAL(entry));
411 HeKEY_hek(entry) = share_hek(key, klen, hash);
412 else /* gotta do the real thing */
413 HeKEY_hek(entry) = save_hek(key, klen, hash);
415 HeNEXT(entry) = *oentry;
419 if (i) { /* initial entry? */
421 if (xhv->xhv_keys > xhv->xhv_max)
429 hv_delete(HV *hv, char *key, U32 klen, I32 flags)
435 register HE **oentry;
441 if (SvRMAGICAL(hv)) {
444 hv_magic_check (hv, &needs_copy, &needs_store);
446 if (needs_copy && (svp = hv_fetch(hv, key, klen, TRUE))) {
450 if (mg_find(sv, 'p')) {
451 sv_unmagic(sv, 'p'); /* No longer an element */
454 return Nullsv; /* element cannot be deleted */
456 #ifdef ENV_IS_CASELESS
457 else if (mg_find((SV*)hv,'E')) {
458 sv = sv_2mortal(newSVpv(key,klen));
459 key = strupr(SvPVX(sv));
464 xhv = (XPVHV*)SvANY(hv);
468 PERL_HASH(hash, key, klen);
470 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
473 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
474 if (HeHASH(entry) != hash) /* strings can't be equal */
476 if (HeKLEN(entry) != klen)
478 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
480 *oentry = HeNEXT(entry);
483 if (flags & G_DISCARD)
486 sv = sv_mortalcopy(HeVAL(entry));
487 if (entry == xhv->xhv_eiter)
490 hv_free_ent(hv, entry);
498 hv_delete_ent(HV *hv, SV *keysv, I32 flags, U32 hash)
505 register HE **oentry;
510 if (SvRMAGICAL(hv)) {
513 hv_magic_check (hv, &needs_copy, &needs_store);
515 if (needs_copy && (entry = hv_fetch_ent(hv, keysv, TRUE, hash))) {
519 if (mg_find(sv, 'p')) {
520 sv_unmagic(sv, 'p'); /* No longer an element */
523 return Nullsv; /* element cannot be deleted */
525 #ifdef ENV_IS_CASELESS
526 else if (mg_find((SV*)hv,'E')) {
527 key = SvPV(keysv, klen);
528 keysv = sv_2mortal(newSVpv(key,klen));
529 (void)strupr(SvPVX(keysv));
535 xhv = (XPVHV*)SvANY(hv);
539 key = SvPV(keysv, klen);
542 PERL_HASH(hash, key, klen);
544 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
547 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
548 if (HeHASH(entry) != hash) /* strings can't be equal */
550 if (HeKLEN(entry) != klen)
552 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
554 *oentry = HeNEXT(entry);
557 if (flags & G_DISCARD)
560 sv = sv_mortalcopy(HeVAL(entry));
561 if (entry == xhv->xhv_eiter)
564 hv_free_ent(hv, entry);
572 hv_exists(HV *hv, char *key, U32 klen)
582 if (SvRMAGICAL(hv)) {
583 if (mg_find((SV*)hv,'P')) {
586 mg_copy((SV*)hv, sv, key, klen);
587 magic_existspack(sv, mg_find(sv, 'p'));
590 #ifdef ENV_IS_CASELESS
591 else if (mg_find((SV*)hv,'E')) {
592 sv = sv_2mortal(newSVpv(key,klen));
593 key = strupr(SvPVX(sv));
598 xhv = (XPVHV*)SvANY(hv);
602 PERL_HASH(hash, key, klen);
604 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
605 for (; entry; entry = HeNEXT(entry)) {
606 if (HeHASH(entry) != hash) /* strings can't be equal */
608 if (HeKLEN(entry) != klen)
610 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
619 hv_exists_ent(HV *hv, SV *keysv, U32 hash)
630 if (SvRMAGICAL(hv)) {
631 if (mg_find((SV*)hv,'P')) {
632 dTHR; /* just for SvTRUE */
634 keysv = sv_2mortal(newSVsv(keysv));
635 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
636 magic_existspack(sv, mg_find(sv, 'p'));
639 #ifdef ENV_IS_CASELESS
640 else if (mg_find((SV*)hv,'E')) {
641 key = SvPV(keysv, klen);
642 keysv = sv_2mortal(newSVpv(key,klen));
643 (void)strupr(SvPVX(keysv));
649 xhv = (XPVHV*)SvANY(hv);
653 key = SvPV(keysv, klen);
655 PERL_HASH(hash, key, klen);
657 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
658 for (; entry; entry = HeNEXT(entry)) {
659 if (HeHASH(entry) != hash) /* strings can't be equal */
661 if (HeKLEN(entry) != klen)
663 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
673 register XPVHV* xhv = (XPVHV*)SvANY(hv);
674 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
675 register I32 newsize = oldsize * 2;
677 register char *a = xhv->xhv_array;
681 register HE **oentry;
684 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
685 Renew(a, ARRAY_ALLOC_BYTES(newsize), char);
691 #define MALLOC_OVERHEAD 16
692 New(2, a, ARRAY_ALLOC_BYTES(newsize), char);
697 Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char);
699 offer_nice_chunk(xhv->xhv_array, ARRAY_ALLOC_BYTES(oldsize));
702 Safefree(xhv->xhv_array);
706 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
707 xhv->xhv_max = --newsize;
711 for (i=0; i<oldsize; i++,aep++) {
712 if (!*aep) /* non-existent */
715 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
716 if ((HeHASH(entry) & newsize) != i) {
717 *oentry = HeNEXT(entry);
718 HeNEXT(entry) = *bep;
725 oentry = &HeNEXT(entry);
727 if (!*aep) /* everything moved */
733 hv_ksplit(HV *hv, IV newmax)
735 register XPVHV* xhv = (XPVHV*)SvANY(hv);
736 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
737 register I32 newsize;
743 register HE **oentry;
745 newsize = (I32) newmax; /* possible truncation here */
746 if (newsize != newmax || newmax <= oldsize)
748 while ((newsize & (1 + ~newsize)) != newsize) {
749 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
751 if (newsize < newmax)
753 if (newsize < newmax)
754 return; /* overflow detection */
759 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
760 Renew(a, ARRAY_ALLOC_BYTES(newsize), char);
766 New(2, a, ARRAY_ALLOC_BYTES(newsize), char);
771 Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char);
773 offer_nice_chunk(xhv->xhv_array, ARRAY_ALLOC_BYTES(oldsize));
776 Safefree(xhv->xhv_array);
779 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
782 Newz(0, a, ARRAY_ALLOC_BYTES(newsize), char);
784 xhv->xhv_max = --newsize;
786 if (!xhv->xhv_fill) /* skip rest if no entries */
790 for (i=0; i<oldsize; i++,aep++) {
791 if (!*aep) /* non-existent */
793 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
794 if ((j = (HeHASH(entry) & newsize)) != i) {
796 *oentry = HeNEXT(entry);
797 if (!(HeNEXT(entry) = aep[j]))
803 oentry = &HeNEXT(entry);
805 if (!*aep) /* everything moved */
816 hv = (HV*)NEWSV(502,0);
817 sv_upgrade((SV *)hv, SVt_PVHV);
818 xhv = (XPVHV*)SvANY(hv);
821 #ifndef NODEFAULT_SHAREKEYS
822 HvSHAREKEYS_on(hv); /* key-sharing on by default */
824 xhv->xhv_max = 7; /* start with 8 buckets */
827 (void)hv_iterinit(hv); /* so each() will start off right */
835 STRLEN hv_max = ohv ? HvMAX(ohv) : 0;
836 STRLEN hv_fill = ohv ? HvFILL(ohv) : 0;
839 while (hv_max && hv_max + 1 >= hv_fill * 2)
840 hv_max = hv_max / 2; /* Is always 2^n-1 */
846 if (! SvTIED_mg((SV*)ohv, 'P')) {
853 I32 hv_riter = HvRITER(ohv); /* current root of iterator */
854 HE *hv_eiter = HvEITER(ohv); /* current entry of iterator */
858 while (entry = hv_iternext(ohv)) {
859 hv_store(hv, HeKEY(entry), HeKLEN(entry),
860 SvREFCNT_inc(HeVAL(entry)), HeHASH(entry));
862 HvRITER(ohv) = hv_riter;
863 HvEITER(ohv) = hv_eiter;
870 hv_free_ent(HV *hv, register HE *entry)
877 if (val && isGV(val) && GvCVu(val) && HvNAME(hv))
878 PL_sub_generation++; /* may be deletion of method from stash */
880 if (HeKLEN(entry) == HEf_SVKEY) {
881 SvREFCNT_dec(HeKEY_sv(entry));
882 Safefree(HeKEY_hek(entry));
884 else if (HvSHAREKEYS(hv))
885 unshare_hek(HeKEY_hek(entry));
887 Safefree(HeKEY_hek(entry));
892 hv_delayfree_ent(HV *hv, register HE *entry)
896 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
897 PL_sub_generation++; /* may be deletion of method from stash */
898 sv_2mortal(HeVAL(entry)); /* free between statements */
899 if (HeKLEN(entry) == HEf_SVKEY) {
900 sv_2mortal(HeKEY_sv(entry));
901 Safefree(HeKEY_hek(entry));
903 else if (HvSHAREKEYS(hv))
904 unshare_hek(HeKEY_hek(entry));
906 Safefree(HeKEY_hek(entry));
916 xhv = (XPVHV*)SvANY(hv);
921 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
932 register HE *oentry = Null(HE*);
948 entry = HeNEXT(entry);
949 hv_free_ent(hv, oentry);
954 entry = array[riter];
957 (void)hv_iterinit(hv);
966 xhv = (XPVHV*)SvANY(hv);
968 Safefree(xhv->xhv_array);
970 Safefree(HvNAME(hv));
974 xhv->xhv_max = 7; /* it's a normal hash */
990 xhv = (XPVHV*)SvANY(hv);
991 entry = xhv->xhv_eiter;
992 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
993 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
996 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
998 hv_free_ent(hv, entry);
1000 xhv->xhv_riter = -1;
1001 xhv->xhv_eiter = Null(HE*);
1002 return xhv->xhv_keys; /* used to be xhv->xhv_fill before 5.004_65 */
1008 register XPVHV* xhv;
1015 xhv = (XPVHV*)SvANY(hv);
1016 oldentry = entry = xhv->xhv_eiter;
1018 if (mg = SvTIED_mg((SV*)hv, 'P')) {
1019 SV *key = sv_newmortal();
1021 sv_setsv(key, HeSVKEY_force(entry));
1022 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
1028 xhv->xhv_eiter = entry = new_he(); /* one HE per MAGICAL hash */
1030 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
1032 HeKEY_hek(entry) = hek;
1033 HeKLEN(entry) = HEf_SVKEY;
1035 magic_nextpack((SV*) hv,mg,key);
1037 /* force key to stay around until next time */
1038 HeSVKEY_set(entry, SvREFCNT_inc(key));
1039 return entry; /* beware, hent_val is not set */
1042 SvREFCNT_dec(HeVAL(entry));
1043 Safefree(HeKEY_hek(entry));
1045 xhv->xhv_eiter = Null(HE*);
1049 if (!xhv->xhv_array)
1050 Newz(506,xhv->xhv_array, ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
1052 entry = HeNEXT(entry);
1055 if (xhv->xhv_riter > xhv->xhv_max) {
1056 xhv->xhv_riter = -1;
1059 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
1062 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1064 hv_free_ent(hv, oldentry);
1067 xhv->xhv_eiter = entry;
1072 hv_iterkey(register HE *entry, I32 *retlen)
1074 if (HeKLEN(entry) == HEf_SVKEY) {
1076 char *p = SvPV(HeKEY_sv(entry), len);
1081 *retlen = HeKLEN(entry);
1082 return HeKEY(entry);
1086 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1088 hv_iterkeysv(register HE *entry)
1090 if (HeKLEN(entry) == HEf_SVKEY)
1091 return sv_mortalcopy(HeKEY_sv(entry));
1093 return sv_2mortal(newSVpv((HeKLEN(entry) ? HeKEY(entry) : ""),
1098 hv_iterval(HV *hv, register HE *entry)
1100 if (SvRMAGICAL(hv)) {
1101 if (mg_find((SV*)hv,'P')) {
1102 SV* sv = sv_newmortal();
1103 if (HeKLEN(entry) == HEf_SVKEY)
1104 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1105 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1109 return HeVAL(entry);
1113 hv_iternextsv(HV *hv, char **key, I32 *retlen)
1116 if ( (he = hv_iternext(hv)) == NULL)
1118 *key = hv_iterkey(he, retlen);
1119 return hv_iterval(hv, he);
1123 hv_magic(HV *hv, GV *gv, int how)
1125 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1129 sharepvn(char *sv, I32 len, U32 hash)
1131 return HEK_KEY(share_hek(sv, len, hash));
1134 /* possibly free a shared string if no one has access to it
1135 * len and hash must both be valid for str.
1138 unsharepvn(char *str, I32 len, U32 hash)
1140 register XPVHV* xhv;
1142 register HE **oentry;
1146 /* what follows is the moral equivalent of:
1147 if ((Svp = hv_fetch(PL_strtab, tmpsv, FALSE, hash))) {
1148 if (--*Svp == Nullsv)
1149 hv_delete(PL_strtab, str, len, G_DISCARD, hash);
1151 xhv = (XPVHV*)SvANY(PL_strtab);
1152 /* assert(xhv_array != 0) */
1154 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1155 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1156 if (HeHASH(entry) != hash) /* strings can't be equal */
1158 if (HeKLEN(entry) != len)
1160 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1163 if (--HeVAL(entry) == Nullsv) {
1164 *oentry = HeNEXT(entry);
1167 Safefree(HeKEY_hek(entry));
1173 UNLOCK_STRTAB_MUTEX;
1176 warn("Attempt to free non-existent shared string");
1179 /* get a (constant) string ptr from the global string table
1180 * string will get added if it is not already there.
1181 * len and hash must both be valid for str.
1184 share_hek(char *str, I32 len, register U32 hash)
1186 register XPVHV* xhv;
1188 register HE **oentry;
1192 /* what follows is the moral equivalent of:
1194 if (!(Svp = hv_fetch(PL_strtab, str, len, FALSE)))
1195 hv_store(PL_strtab, str, len, Nullsv, hash);
1197 xhv = (XPVHV*)SvANY(PL_strtab);
1198 /* assert(xhv_array != 0) */
1200 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1201 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
1202 if (HeHASH(entry) != hash) /* strings can't be equal */
1204 if (HeKLEN(entry) != len)
1206 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1213 HeKEY_hek(entry) = save_hek(str, len, hash);
1214 HeVAL(entry) = Nullsv;
1215 HeNEXT(entry) = *oentry;
1218 if (i) { /* initial entry? */
1220 if (xhv->xhv_keys > xhv->xhv_max)
1225 ++HeVAL(entry); /* use value slot as REFCNT */
1226 UNLOCK_STRTAB_MUTEX;
1227 return HeKEY_hek(entry);