3 * Copyright (c) 1991-1999, 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
26 PL_he_root = HeNEXT(he);
35 HeNEXT(p) = (HE*)PL_he_root;
45 New(54, PL_he_root, 1008/sizeof(HE), HE);
47 heend = &he[1008 / sizeof(HE) - 1];
49 HeNEXT(he) = (HE*)(he + 1);
56 S_save_hek(pTHX_ const char *str, I32 len, U32 hash)
61 New(54, k, HEK_BASESIZE + len + 1, char);
63 Copy(str, HEK_KEY(hek), len, char);
64 *(HEK_KEY(hek) + len) = '\0';
71 Perl_unshare_hek(pTHX_ HEK *hek)
73 unsharepvn(HEK_KEY(hek),HEK_LEN(hek),HEK_HASH(hek));
76 #if defined(USE_ITHREADS)
78 Perl_he_dup(pTHX_ HE *e, bool shared)
84 /* look for it in the table first */
85 ret = (HE*)ptr_table_fetch(PL_ptr_table, e);
89 /* create anew and remember what it is */
91 ptr_table_store(PL_ptr_table, e, ret);
93 HeNEXT(ret) = he_dup(HeNEXT(e),shared);
94 if (HeKLEN(e) == HEf_SVKEY)
95 HeKEY_sv(ret) = SvREFCNT_inc(sv_dup(HeKEY_sv(e)));
97 HeKEY_hek(ret) = share_hek(HeKEY(e), HeKLEN(e), HeHASH(e));
99 HeKEY_hek(ret) = save_hek(HeKEY(e), HeKLEN(e), HeHASH(e));
100 HeVAL(ret) = SvREFCNT_inc(sv_dup(HeVAL(e)));
103 #endif /* USE_ITHREADS */
105 /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot
109 Perl_hv_fetch(pTHX_ HV *hv, const char *key, U32 klen, I32 lval)
119 if (SvRMAGICAL(hv)) {
120 if (mg_find((SV*)hv,'P')) {
123 mg_copy((SV*)hv, sv, key, klen);
125 return &PL_hv_fetch_sv;
127 #ifdef ENV_IS_CASELESS
128 else if (mg_find((SV*)hv,'E')) {
130 for (i = 0; i < klen; ++i)
131 if (isLOWER(key[i])) {
132 char *nkey = strupr(SvPVX(sv_2mortal(newSVpvn(key,klen))));
133 SV **ret = hv_fetch(hv, nkey, klen, 0);
135 ret = hv_store(hv, key, klen, NEWSV(61,0), 0);
142 xhv = (XPVHV*)SvANY(hv);
143 if (!xhv->xhv_array) {
145 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
146 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
149 Newz(503, xhv->xhv_array,
150 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
155 PERL_HASH(hash, key, klen);
157 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
158 for (; entry; entry = HeNEXT(entry)) {
159 if (HeHASH(entry) != hash) /* strings can't be equal */
161 if (HeKLEN(entry) != klen)
163 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
165 return &HeVAL(entry);
167 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
168 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
170 char *env = PerlEnv_ENVgetenv_len(key,&len);
172 sv = newSVpvn(env,len);
174 return hv_store(hv,key,klen,sv,hash);
178 if (lval) { /* gonna assign to this, so it better be there */
180 return hv_store(hv,key,klen,sv,hash);
185 /* returns a HE * structure with the all fields set */
186 /* note that hent_val will be a mortal sv for MAGICAL hashes */
188 Perl_hv_fetch_ent(pTHX_ HV *hv, SV *keysv, I32 lval, register U32 hash)
199 if (SvRMAGICAL(hv)) {
200 if (mg_find((SV*)hv,'P')) {
203 keysv = sv_2mortal(newSVsv(keysv));
204 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
205 if (!HeKEY_hek(&PL_hv_fetch_ent_mh)) {
207 New(54, k, HEK_BASESIZE + sizeof(SV*), char);
208 HeKEY_hek(&PL_hv_fetch_ent_mh) = (HEK*)k;
210 HeSVKEY_set(&PL_hv_fetch_ent_mh, keysv);
211 HeVAL(&PL_hv_fetch_ent_mh) = sv;
212 return &PL_hv_fetch_ent_mh;
214 #ifdef ENV_IS_CASELESS
215 else if (mg_find((SV*)hv,'E')) {
217 key = SvPV(keysv, klen);
218 for (i = 0; i < klen; ++i)
219 if (isLOWER(key[i])) {
220 SV *nkeysv = sv_2mortal(newSVpvn(key,klen));
221 (void)strupr(SvPVX(nkeysv));
222 entry = hv_fetch_ent(hv, nkeysv, 0, 0);
224 entry = hv_store_ent(hv, keysv, NEWSV(61,0), hash);
231 xhv = (XPVHV*)SvANY(hv);
232 if (!xhv->xhv_array) {
234 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
235 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
238 Newz(503, xhv->xhv_array,
239 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
244 key = SvPV(keysv, klen);
247 PERL_HASH(hash, key, klen);
249 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
250 for (; entry; entry = HeNEXT(entry)) {
251 if (HeHASH(entry) != hash) /* strings can't be equal */
253 if (HeKLEN(entry) != klen)
255 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
259 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
260 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
262 char *env = PerlEnv_ENVgetenv_len(key,&len);
264 sv = newSVpvn(env,len);
266 return hv_store_ent(hv,keysv,sv,hash);
270 if (lval) { /* gonna assign to this, so it better be there */
272 return hv_store_ent(hv,keysv,sv,hash);
278 S_hv_magic_check(pTHX_ HV *hv, bool *needs_copy, bool *needs_store)
280 MAGIC *mg = SvMAGIC(hv);
284 if (isUPPER(mg->mg_type)) {
286 switch (mg->mg_type) {
289 *needs_store = FALSE;
292 mg = mg->mg_moremagic;
297 Perl_hv_store(pTHX_ HV *hv, const char *key, U32 klen, SV *val, register U32 hash)
302 register HE **oentry;
307 xhv = (XPVHV*)SvANY(hv);
311 hv_magic_check (hv, &needs_copy, &needs_store);
313 mg_copy((SV*)hv, val, key, klen);
314 if (!xhv->xhv_array && !needs_store)
316 #ifdef ENV_IS_CASELESS
317 else if (mg_find((SV*)hv,'E')) {
318 SV *sv = sv_2mortal(newSVpvn(key,klen));
319 key = strupr(SvPVX(sv));
326 PERL_HASH(hash, key, klen);
329 Newz(505, xhv->xhv_array,
330 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
332 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
335 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
336 if (HeHASH(entry) != hash) /* strings can't be equal */
338 if (HeKLEN(entry) != klen)
340 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
342 SvREFCNT_dec(HeVAL(entry));
344 return &HeVAL(entry);
349 HeKEY_hek(entry) = share_hek(key, klen, hash);
350 else /* gotta do the real thing */
351 HeKEY_hek(entry) = save_hek(key, klen, hash);
353 HeNEXT(entry) = *oentry;
357 if (i) { /* initial entry? */
359 if (xhv->xhv_keys > xhv->xhv_max)
363 return &HeVAL(entry);
367 Perl_hv_store_ent(pTHX_ HV *hv, SV *keysv, SV *val, register U32 hash)
374 register HE **oentry;
379 xhv = (XPVHV*)SvANY(hv);
384 hv_magic_check (hv, &needs_copy, &needs_store);
386 bool save_taint = PL_tainted;
388 PL_tainted = SvTAINTED(keysv);
389 keysv = sv_2mortal(newSVsv(keysv));
390 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
391 TAINT_IF(save_taint);
392 if (!xhv->xhv_array && !needs_store)
394 #ifdef ENV_IS_CASELESS
395 else if (mg_find((SV*)hv,'E')) {
396 key = SvPV(keysv, klen);
397 keysv = sv_2mortal(newSVpvn(key,klen));
398 (void)strupr(SvPVX(keysv));
405 key = SvPV(keysv, klen);
408 PERL_HASH(hash, key, klen);
411 Newz(505, xhv->xhv_array,
412 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
414 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
417 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
418 if (HeHASH(entry) != hash) /* strings can't be equal */
420 if (HeKLEN(entry) != klen)
422 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
424 SvREFCNT_dec(HeVAL(entry));
431 HeKEY_hek(entry) = share_hek(key, klen, hash);
432 else /* gotta do the real thing */
433 HeKEY_hek(entry) = save_hek(key, klen, hash);
435 HeNEXT(entry) = *oentry;
439 if (i) { /* initial entry? */
441 if (xhv->xhv_keys > xhv->xhv_max)
449 Perl_hv_delete(pTHX_ HV *hv, const char *key, U32 klen, I32 flags)
455 register HE **oentry;
461 if (SvRMAGICAL(hv)) {
464 hv_magic_check (hv, &needs_copy, &needs_store);
466 if (needs_copy && (svp = hv_fetch(hv, key, klen, TRUE))) {
470 if (mg_find(sv, 'p')) {
471 sv_unmagic(sv, 'p'); /* No longer an element */
474 return Nullsv; /* element cannot be deleted */
476 #ifdef ENV_IS_CASELESS
477 else if (mg_find((SV*)hv,'E')) {
478 sv = sv_2mortal(newSVpvn(key,klen));
479 key = strupr(SvPVX(sv));
484 xhv = (XPVHV*)SvANY(hv);
488 PERL_HASH(hash, key, klen);
490 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
493 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
494 if (HeHASH(entry) != hash) /* strings can't be equal */
496 if (HeKLEN(entry) != klen)
498 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
500 *oentry = HeNEXT(entry);
503 if (flags & G_DISCARD)
506 sv = sv_mortalcopy(HeVAL(entry));
507 if (entry == xhv->xhv_eiter)
510 hv_free_ent(hv, entry);
518 Perl_hv_delete_ent(pTHX_ HV *hv, SV *keysv, I32 flags, U32 hash)
525 register HE **oentry;
530 if (SvRMAGICAL(hv)) {
533 hv_magic_check (hv, &needs_copy, &needs_store);
535 if (needs_copy && (entry = hv_fetch_ent(hv, keysv, TRUE, hash))) {
539 if (mg_find(sv, 'p')) {
540 sv_unmagic(sv, 'p'); /* No longer an element */
543 return Nullsv; /* element cannot be deleted */
545 #ifdef ENV_IS_CASELESS
546 else if (mg_find((SV*)hv,'E')) {
547 key = SvPV(keysv, klen);
548 keysv = sv_2mortal(newSVpvn(key,klen));
549 (void)strupr(SvPVX(keysv));
555 xhv = (XPVHV*)SvANY(hv);
559 key = SvPV(keysv, klen);
562 PERL_HASH(hash, key, klen);
564 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
567 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
568 if (HeHASH(entry) != hash) /* strings can't be equal */
570 if (HeKLEN(entry) != klen)
572 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
574 *oentry = HeNEXT(entry);
577 if (flags & G_DISCARD)
580 sv = sv_mortalcopy(HeVAL(entry));
581 if (entry == xhv->xhv_eiter)
584 hv_free_ent(hv, entry);
592 Perl_hv_exists(pTHX_ HV *hv, const char *key, U32 klen)
602 if (SvRMAGICAL(hv)) {
603 if (mg_find((SV*)hv,'P')) {
606 mg_copy((SV*)hv, sv, key, klen);
607 magic_existspack(sv, mg_find(sv, 'p'));
610 #ifdef ENV_IS_CASELESS
611 else if (mg_find((SV*)hv,'E')) {
612 sv = sv_2mortal(newSVpvn(key,klen));
613 key = strupr(SvPVX(sv));
618 xhv = (XPVHV*)SvANY(hv);
619 #ifndef DYNAMIC_ENV_FETCH
624 PERL_HASH(hash, key, klen);
626 #ifdef DYNAMIC_ENV_FETCH
627 if (!xhv->xhv_array) entry = Null(HE*);
630 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
631 for (; entry; entry = HeNEXT(entry)) {
632 if (HeHASH(entry) != hash) /* strings can't be equal */
634 if (HeKLEN(entry) != klen)
636 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
640 #ifdef DYNAMIC_ENV_FETCH /* is it out there? */
641 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME)) {
643 char *env = PerlEnv_ENVgetenv_len(key,&len);
645 sv = newSVpvn(env,len);
647 (void)hv_store(hv,key,klen,sv,hash);
657 Perl_hv_exists_ent(pTHX_ HV *hv, SV *keysv, U32 hash)
668 if (SvRMAGICAL(hv)) {
669 if (mg_find((SV*)hv,'P')) {
670 dTHR; /* just for SvTRUE */
672 keysv = sv_2mortal(newSVsv(keysv));
673 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
674 magic_existspack(sv, mg_find(sv, 'p'));
677 #ifdef ENV_IS_CASELESS
678 else if (mg_find((SV*)hv,'E')) {
679 key = SvPV(keysv, klen);
680 keysv = sv_2mortal(newSVpvn(key,klen));
681 (void)strupr(SvPVX(keysv));
687 xhv = (XPVHV*)SvANY(hv);
688 #ifndef DYNAMIC_ENV_FETCH
693 key = SvPV(keysv, klen);
695 PERL_HASH(hash, key, klen);
697 #ifdef DYNAMIC_ENV_FETCH
698 if (!xhv->xhv_array) entry = Null(HE*);
701 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
702 for (; entry; entry = HeNEXT(entry)) {
703 if (HeHASH(entry) != hash) /* strings can't be equal */
705 if (HeKLEN(entry) != klen)
707 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
711 #ifdef DYNAMIC_ENV_FETCH /* is it out there? */
712 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME)) {
714 char *env = PerlEnv_ENVgetenv_len(key,&len);
716 sv = newSVpvn(env,len);
718 (void)hv_store_ent(hv,keysv,sv,hash);
727 S_hsplit(pTHX_ HV *hv)
729 register XPVHV* xhv = (XPVHV*)SvANY(hv);
730 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
731 register I32 newsize = oldsize * 2;
733 register char *a = xhv->xhv_array;
737 register HE **oentry;
740 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
741 Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
747 #define MALLOC_OVERHEAD 16
748 New(2, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
753 Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char);
755 offer_nice_chunk(xhv->xhv_array, PERL_HV_ARRAY_ALLOC_BYTES(oldsize));
758 Safefree(xhv->xhv_array);
762 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
763 xhv->xhv_max = --newsize;
767 for (i=0; i<oldsize; i++,aep++) {
768 if (!*aep) /* non-existent */
771 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
772 if ((HeHASH(entry) & newsize) != i) {
773 *oentry = HeNEXT(entry);
774 HeNEXT(entry) = *bep;
781 oentry = &HeNEXT(entry);
783 if (!*aep) /* everything moved */
789 Perl_hv_ksplit(pTHX_ HV *hv, IV newmax)
791 register XPVHV* xhv = (XPVHV*)SvANY(hv);
792 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
793 register I32 newsize;
799 register HE **oentry;
801 newsize = (I32) newmax; /* possible truncation here */
802 if (newsize != newmax || newmax <= oldsize)
804 while ((newsize & (1 + ~newsize)) != newsize) {
805 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
807 if (newsize < newmax)
809 if (newsize < newmax)
810 return; /* overflow detection */
815 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
816 Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
822 New(2, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
827 Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char);
829 offer_nice_chunk(xhv->xhv_array, PERL_HV_ARRAY_ALLOC_BYTES(oldsize));
832 Safefree(xhv->xhv_array);
835 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
838 Newz(0, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
840 xhv->xhv_max = --newsize;
842 if (!xhv->xhv_fill) /* skip rest if no entries */
846 for (i=0; i<oldsize; i++,aep++) {
847 if (!*aep) /* non-existent */
849 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
850 if ((j = (HeHASH(entry) & newsize)) != i) {
852 *oentry = HeNEXT(entry);
853 if (!(HeNEXT(entry) = aep[j]))
859 oentry = &HeNEXT(entry);
861 if (!*aep) /* everything moved */
872 hv = (HV*)NEWSV(502,0);
873 sv_upgrade((SV *)hv, SVt_PVHV);
874 xhv = (XPVHV*)SvANY(hv);
877 #ifndef NODEFAULT_SHAREKEYS
878 HvSHAREKEYS_on(hv); /* key-sharing on by default */
880 xhv->xhv_max = 7; /* start with 8 buckets */
883 (void)hv_iterinit(hv); /* so each() will start off right */
888 Perl_newHVhv(pTHX_ HV *ohv)
891 STRLEN hv_max = ohv ? HvMAX(ohv) : 0;
892 STRLEN hv_fill = ohv ? HvFILL(ohv) : 0;
895 while (hv_max && hv_max + 1 >= hv_fill * 2)
896 hv_max = hv_max / 2; /* Is always 2^n-1 */
902 if (! SvTIED_mg((SV*)ohv, 'P')) {
909 I32 hv_riter = HvRITER(ohv); /* current root of iterator */
910 HE *hv_eiter = HvEITER(ohv); /* current entry of iterator */
914 while (entry = hv_iternext(ohv)) {
915 hv_store(hv, HeKEY(entry), HeKLEN(entry),
916 SvREFCNT_inc(HeVAL(entry)), HeHASH(entry));
918 HvRITER(ohv) = hv_riter;
919 HvEITER(ohv) = hv_eiter;
926 Perl_hv_free_ent(pTHX_ HV *hv, register HE *entry)
933 if (val && isGV(val) && GvCVu(val) && HvNAME(hv))
934 PL_sub_generation++; /* may be deletion of method from stash */
936 if (HeKLEN(entry) == HEf_SVKEY) {
937 SvREFCNT_dec(HeKEY_sv(entry));
938 Safefree(HeKEY_hek(entry));
940 else if (HvSHAREKEYS(hv))
941 unshare_hek(HeKEY_hek(entry));
943 Safefree(HeKEY_hek(entry));
948 Perl_hv_delayfree_ent(pTHX_ HV *hv, register HE *entry)
952 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
953 PL_sub_generation++; /* may be deletion of method from stash */
954 sv_2mortal(HeVAL(entry)); /* free between statements */
955 if (HeKLEN(entry) == HEf_SVKEY) {
956 sv_2mortal(HeKEY_sv(entry));
957 Safefree(HeKEY_hek(entry));
959 else if (HvSHAREKEYS(hv))
960 unshare_hek(HeKEY_hek(entry));
962 Safefree(HeKEY_hek(entry));
967 Perl_hv_clear(pTHX_ HV *hv)
972 xhv = (XPVHV*)SvANY(hv);
977 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
984 S_hfreeentries(pTHX_ HV *hv)
988 register HE *oentry = Null(HE*);
1004 entry = HeNEXT(entry);
1005 hv_free_ent(hv, oentry);
1010 entry = array[riter];
1013 (void)hv_iterinit(hv);
1017 Perl_hv_undef(pTHX_ HV *hv)
1019 register XPVHV* xhv;
1022 xhv = (XPVHV*)SvANY(hv);
1024 Safefree(xhv->xhv_array);
1026 Safefree(HvNAME(hv));
1030 xhv->xhv_max = 7; /* it's a normal hash */
1039 Perl_hv_iterinit(pTHX_ HV *hv)
1041 register XPVHV* xhv;
1045 Perl_croak(aTHX_ "Bad hash");
1046 xhv = (XPVHV*)SvANY(hv);
1047 entry = xhv->xhv_eiter;
1048 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1050 hv_free_ent(hv, entry);
1052 xhv->xhv_riter = -1;
1053 xhv->xhv_eiter = Null(HE*);
1054 return xhv->xhv_keys; /* used to be xhv->xhv_fill before 5.004_65 */
1058 Perl_hv_iternext(pTHX_ HV *hv)
1060 register XPVHV* xhv;
1066 Perl_croak(aTHX_ "Bad hash");
1067 xhv = (XPVHV*)SvANY(hv);
1068 oldentry = entry = xhv->xhv_eiter;
1070 if (mg = SvTIED_mg((SV*)hv, 'P')) {
1071 SV *key = sv_newmortal();
1073 sv_setsv(key, HeSVKEY_force(entry));
1074 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
1080 xhv->xhv_eiter = entry = new_he(); /* one HE per MAGICAL hash */
1082 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
1084 HeKEY_hek(entry) = hek;
1085 HeKLEN(entry) = HEf_SVKEY;
1087 magic_nextpack((SV*) hv,mg,key);
1089 /* force key to stay around until next time */
1090 HeSVKEY_set(entry, SvREFCNT_inc(key));
1091 return entry; /* beware, hent_val is not set */
1094 SvREFCNT_dec(HeVAL(entry));
1095 Safefree(HeKEY_hek(entry));
1097 xhv->xhv_eiter = Null(HE*);
1100 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
1101 if (!entry && HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
1105 if (!xhv->xhv_array)
1106 Newz(506, xhv->xhv_array,
1107 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
1109 entry = HeNEXT(entry);
1112 if (xhv->xhv_riter > xhv->xhv_max) {
1113 xhv->xhv_riter = -1;
1116 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
1119 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1121 hv_free_ent(hv, oldentry);
1124 xhv->xhv_eiter = entry;
1129 Perl_hv_iterkey(pTHX_ register HE *entry, I32 *retlen)
1131 if (HeKLEN(entry) == HEf_SVKEY) {
1133 char *p = SvPV(HeKEY_sv(entry), len);
1138 *retlen = HeKLEN(entry);
1139 return HeKEY(entry);
1143 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1145 Perl_hv_iterkeysv(pTHX_ register HE *entry)
1147 if (HeKLEN(entry) == HEf_SVKEY)
1148 return sv_mortalcopy(HeKEY_sv(entry));
1150 return sv_2mortal(newSVpvn((HeKLEN(entry) ? HeKEY(entry) : ""),
1155 Perl_hv_iterval(pTHX_ HV *hv, register HE *entry)
1157 if (SvRMAGICAL(hv)) {
1158 if (mg_find((SV*)hv,'P')) {
1159 SV* sv = sv_newmortal();
1160 if (HeKLEN(entry) == HEf_SVKEY)
1161 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1162 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1166 return HeVAL(entry);
1170 Perl_hv_iternextsv(pTHX_ HV *hv, char **key, I32 *retlen)
1173 if ( (he = hv_iternext(hv)) == NULL)
1175 *key = hv_iterkey(he, retlen);
1176 return hv_iterval(hv, he);
1180 Perl_hv_magic(pTHX_ HV *hv, GV *gv, int how)
1182 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1186 Perl_sharepvn(pTHX_ const char *sv, I32 len, U32 hash)
1188 return HEK_KEY(share_hek(sv, len, hash));
1191 /* possibly free a shared string if no one has access to it
1192 * len and hash must both be valid for str.
1195 Perl_unsharepvn(pTHX_ const char *str, I32 len, U32 hash)
1197 register XPVHV* xhv;
1199 register HE **oentry;
1203 /* what follows is the moral equivalent of:
1204 if ((Svp = hv_fetch(PL_strtab, tmpsv, FALSE, hash))) {
1205 if (--*Svp == Nullsv)
1206 hv_delete(PL_strtab, str, len, G_DISCARD, hash);
1208 xhv = (XPVHV*)SvANY(PL_strtab);
1209 /* assert(xhv_array != 0) */
1211 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1212 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1213 if (HeHASH(entry) != hash) /* strings can't be equal */
1215 if (HeKLEN(entry) != len)
1217 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1220 if (--HeVAL(entry) == Nullsv) {
1221 *oentry = HeNEXT(entry);
1224 Safefree(HeKEY_hek(entry));
1230 UNLOCK_STRTAB_MUTEX;
1234 if (!found && ckWARN_d(WARN_INTERNAL))
1235 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free non-existent shared string");
1239 /* get a (constant) string ptr from the global string table
1240 * string will get added if it is not already there.
1241 * len and hash must both be valid for str.
1244 Perl_share_hek(pTHX_ const char *str, I32 len, register U32 hash)
1246 register XPVHV* xhv;
1248 register HE **oentry;
1252 /* what follows is the moral equivalent of:
1254 if (!(Svp = hv_fetch(PL_strtab, str, len, FALSE)))
1255 hv_store(PL_strtab, str, len, Nullsv, hash);
1257 xhv = (XPVHV*)SvANY(PL_strtab);
1258 /* assert(xhv_array != 0) */
1260 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1261 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
1262 if (HeHASH(entry) != hash) /* strings can't be equal */
1264 if (HeKLEN(entry) != len)
1266 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1273 HeKEY_hek(entry) = save_hek(str, len, hash);
1274 HeVAL(entry) = Nullsv;
1275 HeNEXT(entry) = *oentry;
1278 if (i) { /* initial entry? */
1280 if (xhv->xhv_keys > xhv->xhv_max)
1285 ++HeVAL(entry); /* use value slot as REFCNT */
1286 UNLOCK_STRTAB_MUTEX;
1287 return HeKEY_hek(entry);