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)
85 HeNEXT(ret) = (HE*)NULL;
86 if (HeKLEN(e) == HEf_SVKEY)
87 HeKEY_sv(ret) = SvREFCNT_inc(sv_dup(HeKEY_sv(e)));
89 HeKEY_hek(ret) = share_hek(HeKEY(e), HeKLEN(e), HeHASH(e));
91 HeKEY_hek(ret) = save_hek(HeKEY(e), HeKLEN(e), HeHASH(e));
92 HeVAL(ret) = SvREFCNT_inc(sv_dup(HeVAL(e)));
95 #endif /* USE_ITHREADS */
97 /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot
101 Perl_hv_fetch(pTHX_ HV *hv, const char *key, U32 klen, I32 lval)
111 if (SvRMAGICAL(hv)) {
112 if (mg_find((SV*)hv,'P')) {
115 mg_copy((SV*)hv, sv, key, klen);
117 return &PL_hv_fetch_sv;
119 #ifdef ENV_IS_CASELESS
120 else if (mg_find((SV*)hv,'E')) {
122 for (i = 0; i < klen; ++i)
123 if (isLOWER(key[i])) {
124 char *nkey = strupr(SvPVX(sv_2mortal(newSVpvn(key,klen))));
125 SV **ret = hv_fetch(hv, nkey, klen, 0);
127 ret = hv_store(hv, key, klen, NEWSV(61,0), 0);
134 xhv = (XPVHV*)SvANY(hv);
135 if (!xhv->xhv_array) {
137 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
138 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
141 Newz(503, xhv->xhv_array,
142 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
147 PERL_HASH(hash, key, klen);
149 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
150 for (; entry; entry = HeNEXT(entry)) {
151 if (HeHASH(entry) != hash) /* strings can't be equal */
153 if (HeKLEN(entry) != klen)
155 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
157 return &HeVAL(entry);
159 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
160 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
162 char *env = PerlEnv_ENVgetenv_len(key,&len);
164 sv = newSVpvn(env,len);
166 return hv_store(hv,key,klen,sv,hash);
170 if (lval) { /* gonna assign to this, so it better be there */
172 return hv_store(hv,key,klen,sv,hash);
177 /* returns a HE * structure with the all fields set */
178 /* note that hent_val will be a mortal sv for MAGICAL hashes */
180 Perl_hv_fetch_ent(pTHX_ HV *hv, SV *keysv, I32 lval, register U32 hash)
191 if (SvRMAGICAL(hv)) {
192 if (mg_find((SV*)hv,'P')) {
195 keysv = sv_2mortal(newSVsv(keysv));
196 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
197 if (!HeKEY_hek(&PL_hv_fetch_ent_mh)) {
199 New(54, k, HEK_BASESIZE + sizeof(SV*), char);
200 HeKEY_hek(&PL_hv_fetch_ent_mh) = (HEK*)k;
202 HeSVKEY_set(&PL_hv_fetch_ent_mh, keysv);
203 HeVAL(&PL_hv_fetch_ent_mh) = sv;
204 return &PL_hv_fetch_ent_mh;
206 #ifdef ENV_IS_CASELESS
207 else if (mg_find((SV*)hv,'E')) {
209 key = SvPV(keysv, klen);
210 for (i = 0; i < klen; ++i)
211 if (isLOWER(key[i])) {
212 SV *nkeysv = sv_2mortal(newSVpvn(key,klen));
213 (void)strupr(SvPVX(nkeysv));
214 entry = hv_fetch_ent(hv, nkeysv, 0, 0);
216 entry = hv_store_ent(hv, keysv, NEWSV(61,0), hash);
223 xhv = (XPVHV*)SvANY(hv);
224 if (!xhv->xhv_array) {
226 #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */
227 || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME))
230 Newz(503, xhv->xhv_array,
231 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
236 key = SvPV(keysv, klen);
239 PERL_HASH(hash, key, klen);
241 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
242 for (; entry; entry = HeNEXT(entry)) {
243 if (HeHASH(entry) != hash) /* strings can't be equal */
245 if (HeKLEN(entry) != klen)
247 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
251 #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */
252 if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) {
254 char *env = PerlEnv_ENVgetenv_len(key,&len);
256 sv = newSVpvn(env,len);
258 return hv_store_ent(hv,keysv,sv,hash);
262 if (lval) { /* gonna assign to this, so it better be there */
264 return hv_store_ent(hv,keysv,sv,hash);
270 S_hv_magic_check(pTHX_ HV *hv, bool *needs_copy, bool *needs_store)
272 MAGIC *mg = SvMAGIC(hv);
276 if (isUPPER(mg->mg_type)) {
278 switch (mg->mg_type) {
281 *needs_store = FALSE;
284 mg = mg->mg_moremagic;
289 Perl_hv_store(pTHX_ HV *hv, const char *key, U32 klen, SV *val, register U32 hash)
294 register HE **oentry;
299 xhv = (XPVHV*)SvANY(hv);
303 hv_magic_check (hv, &needs_copy, &needs_store);
305 mg_copy((SV*)hv, val, key, klen);
306 if (!xhv->xhv_array && !needs_store)
308 #ifdef ENV_IS_CASELESS
309 else if (mg_find((SV*)hv,'E')) {
310 SV *sv = sv_2mortal(newSVpvn(key,klen));
311 key = strupr(SvPVX(sv));
318 PERL_HASH(hash, key, klen);
321 Newz(505, xhv->xhv_array,
322 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
324 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
327 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
328 if (HeHASH(entry) != hash) /* strings can't be equal */
330 if (HeKLEN(entry) != klen)
332 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
334 SvREFCNT_dec(HeVAL(entry));
336 return &HeVAL(entry);
341 HeKEY_hek(entry) = share_hek(key, klen, hash);
342 else /* gotta do the real thing */
343 HeKEY_hek(entry) = save_hek(key, klen, hash);
345 HeNEXT(entry) = *oentry;
349 if (i) { /* initial entry? */
351 if (xhv->xhv_keys > xhv->xhv_max)
355 return &HeVAL(entry);
359 Perl_hv_store_ent(pTHX_ HV *hv, SV *keysv, SV *val, register U32 hash)
366 register HE **oentry;
371 xhv = (XPVHV*)SvANY(hv);
376 hv_magic_check (hv, &needs_copy, &needs_store);
378 bool save_taint = PL_tainted;
380 PL_tainted = SvTAINTED(keysv);
381 keysv = sv_2mortal(newSVsv(keysv));
382 mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY);
383 TAINT_IF(save_taint);
384 if (!xhv->xhv_array && !needs_store)
386 #ifdef ENV_IS_CASELESS
387 else if (mg_find((SV*)hv,'E')) {
388 key = SvPV(keysv, klen);
389 keysv = sv_2mortal(newSVpvn(key,klen));
390 (void)strupr(SvPVX(keysv));
397 key = SvPV(keysv, klen);
400 PERL_HASH(hash, key, klen);
403 Newz(505, xhv->xhv_array,
404 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
406 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
409 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
410 if (HeHASH(entry) != hash) /* strings can't be equal */
412 if (HeKLEN(entry) != klen)
414 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
416 SvREFCNT_dec(HeVAL(entry));
423 HeKEY_hek(entry) = share_hek(key, klen, hash);
424 else /* gotta do the real thing */
425 HeKEY_hek(entry) = save_hek(key, klen, hash);
427 HeNEXT(entry) = *oentry;
431 if (i) { /* initial entry? */
433 if (xhv->xhv_keys > xhv->xhv_max)
441 Perl_hv_delete(pTHX_ HV *hv, const char *key, U32 klen, I32 flags)
447 register HE **oentry;
453 if (SvRMAGICAL(hv)) {
456 hv_magic_check (hv, &needs_copy, &needs_store);
458 if (needs_copy && (svp = hv_fetch(hv, key, klen, TRUE))) {
462 if (mg_find(sv, 'p')) {
463 sv_unmagic(sv, 'p'); /* No longer an element */
466 return Nullsv; /* element cannot be deleted */
468 #ifdef ENV_IS_CASELESS
469 else if (mg_find((SV*)hv,'E')) {
470 sv = sv_2mortal(newSVpvn(key,klen));
471 key = strupr(SvPVX(sv));
476 xhv = (XPVHV*)SvANY(hv);
480 PERL_HASH(hash, key, klen);
482 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
485 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
486 if (HeHASH(entry) != hash) /* strings can't be equal */
488 if (HeKLEN(entry) != klen)
490 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
492 *oentry = HeNEXT(entry);
495 if (flags & G_DISCARD)
498 sv = sv_mortalcopy(HeVAL(entry));
499 if (entry == xhv->xhv_eiter)
502 hv_free_ent(hv, entry);
510 Perl_hv_delete_ent(pTHX_ HV *hv, SV *keysv, I32 flags, U32 hash)
517 register HE **oentry;
522 if (SvRMAGICAL(hv)) {
525 hv_magic_check (hv, &needs_copy, &needs_store);
527 if (needs_copy && (entry = hv_fetch_ent(hv, keysv, TRUE, hash))) {
531 if (mg_find(sv, 'p')) {
532 sv_unmagic(sv, 'p'); /* No longer an element */
535 return Nullsv; /* element cannot be deleted */
537 #ifdef ENV_IS_CASELESS
538 else if (mg_find((SV*)hv,'E')) {
539 key = SvPV(keysv, klen);
540 keysv = sv_2mortal(newSVpvn(key,klen));
541 (void)strupr(SvPVX(keysv));
547 xhv = (XPVHV*)SvANY(hv);
551 key = SvPV(keysv, klen);
554 PERL_HASH(hash, key, klen);
556 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
559 for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
560 if (HeHASH(entry) != hash) /* strings can't be equal */
562 if (HeKLEN(entry) != klen)
564 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
566 *oentry = HeNEXT(entry);
569 if (flags & G_DISCARD)
572 sv = sv_mortalcopy(HeVAL(entry));
573 if (entry == xhv->xhv_eiter)
576 hv_free_ent(hv, entry);
584 Perl_hv_exists(pTHX_ HV *hv, const char *key, U32 klen)
594 if (SvRMAGICAL(hv)) {
595 if (mg_find((SV*)hv,'P')) {
598 mg_copy((SV*)hv, sv, key, klen);
599 magic_existspack(sv, mg_find(sv, 'p'));
602 #ifdef ENV_IS_CASELESS
603 else if (mg_find((SV*)hv,'E')) {
604 sv = sv_2mortal(newSVpvn(key,klen));
605 key = strupr(SvPVX(sv));
610 xhv = (XPVHV*)SvANY(hv);
611 #ifndef DYNAMIC_ENV_FETCH
616 PERL_HASH(hash, key, klen);
618 #ifdef DYNAMIC_ENV_FETCH
619 if (!xhv->xhv_array) entry = Null(HE*);
622 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
623 for (; entry; entry = HeNEXT(entry)) {
624 if (HeHASH(entry) != hash) /* strings can't be equal */
626 if (HeKLEN(entry) != klen)
628 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
632 #ifdef DYNAMIC_ENV_FETCH /* is it out there? */
633 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME)) {
635 char *env = PerlEnv_ENVgetenv_len(key,&len);
637 sv = newSVpvn(env,len);
639 (void)hv_store(hv,key,klen,sv,hash);
649 Perl_hv_exists_ent(pTHX_ HV *hv, SV *keysv, U32 hash)
660 if (SvRMAGICAL(hv)) {
661 if (mg_find((SV*)hv,'P')) {
662 dTHR; /* just for SvTRUE */
664 keysv = sv_2mortal(newSVsv(keysv));
665 mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY);
666 magic_existspack(sv, mg_find(sv, 'p'));
669 #ifdef ENV_IS_CASELESS
670 else if (mg_find((SV*)hv,'E')) {
671 key = SvPV(keysv, klen);
672 keysv = sv_2mortal(newSVpvn(key,klen));
673 (void)strupr(SvPVX(keysv));
679 xhv = (XPVHV*)SvANY(hv);
680 #ifndef DYNAMIC_ENV_FETCH
685 key = SvPV(keysv, klen);
687 PERL_HASH(hash, key, klen);
689 #ifdef DYNAMIC_ENV_FETCH
690 if (!xhv->xhv_array) entry = Null(HE*);
693 entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
694 for (; entry; entry = HeNEXT(entry)) {
695 if (HeHASH(entry) != hash) /* strings can't be equal */
697 if (HeKLEN(entry) != klen)
699 if (memNE(HeKEY(entry),key,klen)) /* is this it? */
703 #ifdef DYNAMIC_ENV_FETCH /* is it out there? */
704 if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME)) {
706 char *env = PerlEnv_ENVgetenv_len(key,&len);
708 sv = newSVpvn(env,len);
710 (void)hv_store_ent(hv,keysv,sv,hash);
719 S_hsplit(pTHX_ HV *hv)
721 register XPVHV* xhv = (XPVHV*)SvANY(hv);
722 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
723 register I32 newsize = oldsize * 2;
725 register char *a = xhv->xhv_array;
729 register HE **oentry;
732 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
733 Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
739 #define MALLOC_OVERHEAD 16
740 New(2, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
745 Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char);
747 offer_nice_chunk(xhv->xhv_array, PERL_HV_ARRAY_ALLOC_BYTES(oldsize));
750 Safefree(xhv->xhv_array);
754 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
755 xhv->xhv_max = --newsize;
759 for (i=0; i<oldsize; i++,aep++) {
760 if (!*aep) /* non-existent */
763 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
764 if ((HeHASH(entry) & newsize) != i) {
765 *oentry = HeNEXT(entry);
766 HeNEXT(entry) = *bep;
773 oentry = &HeNEXT(entry);
775 if (!*aep) /* everything moved */
781 Perl_hv_ksplit(pTHX_ HV *hv, IV newmax)
783 register XPVHV* xhv = (XPVHV*)SvANY(hv);
784 I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */
785 register I32 newsize;
791 register HE **oentry;
793 newsize = (I32) newmax; /* possible truncation here */
794 if (newsize != newmax || newmax <= oldsize)
796 while ((newsize & (1 + ~newsize)) != newsize) {
797 newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */
799 if (newsize < newmax)
801 if (newsize < newmax)
802 return; /* overflow detection */
807 #if defined(STRANGE_MALLOC) || defined(MYMALLOC)
808 Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
814 New(2, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
819 Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char);
821 offer_nice_chunk(xhv->xhv_array, PERL_HV_ARRAY_ALLOC_BYTES(oldsize));
824 Safefree(xhv->xhv_array);
827 Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/
830 Newz(0, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char);
832 xhv->xhv_max = --newsize;
834 if (!xhv->xhv_fill) /* skip rest if no entries */
838 for (i=0; i<oldsize; i++,aep++) {
839 if (!*aep) /* non-existent */
841 for (oentry = aep, entry = *aep; entry; entry = *oentry) {
842 if ((j = (HeHASH(entry) & newsize)) != i) {
844 *oentry = HeNEXT(entry);
845 if (!(HeNEXT(entry) = aep[j]))
851 oentry = &HeNEXT(entry);
853 if (!*aep) /* everything moved */
864 hv = (HV*)NEWSV(502,0);
865 sv_upgrade((SV *)hv, SVt_PVHV);
866 xhv = (XPVHV*)SvANY(hv);
869 #ifndef NODEFAULT_SHAREKEYS
870 HvSHAREKEYS_on(hv); /* key-sharing on by default */
872 xhv->xhv_max = 7; /* start with 8 buckets */
875 (void)hv_iterinit(hv); /* so each() will start off right */
880 Perl_newHVhv(pTHX_ HV *ohv)
883 STRLEN hv_max = ohv ? HvMAX(ohv) : 0;
884 STRLEN hv_fill = ohv ? HvFILL(ohv) : 0;
887 while (hv_max && hv_max + 1 >= hv_fill * 2)
888 hv_max = hv_max / 2; /* Is always 2^n-1 */
894 if (! SvTIED_mg((SV*)ohv, 'P')) {
901 I32 hv_riter = HvRITER(ohv); /* current root of iterator */
902 HE *hv_eiter = HvEITER(ohv); /* current entry of iterator */
906 while (entry = hv_iternext(ohv)) {
907 hv_store(hv, HeKEY(entry), HeKLEN(entry),
908 SvREFCNT_inc(HeVAL(entry)), HeHASH(entry));
910 HvRITER(ohv) = hv_riter;
911 HvEITER(ohv) = hv_eiter;
918 Perl_hv_free_ent(pTHX_ HV *hv, register HE *entry)
925 if (val && isGV(val) && GvCVu(val) && HvNAME(hv))
926 PL_sub_generation++; /* may be deletion of method from stash */
928 if (HeKLEN(entry) == HEf_SVKEY) {
929 SvREFCNT_dec(HeKEY_sv(entry));
930 Safefree(HeKEY_hek(entry));
932 else if (HvSHAREKEYS(hv))
933 unshare_hek(HeKEY_hek(entry));
935 Safefree(HeKEY_hek(entry));
940 Perl_hv_delayfree_ent(pTHX_ HV *hv, register HE *entry)
944 if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv))
945 PL_sub_generation++; /* may be deletion of method from stash */
946 sv_2mortal(HeVAL(entry)); /* free between statements */
947 if (HeKLEN(entry) == HEf_SVKEY) {
948 sv_2mortal(HeKEY_sv(entry));
949 Safefree(HeKEY_hek(entry));
951 else if (HvSHAREKEYS(hv))
952 unshare_hek(HeKEY_hek(entry));
954 Safefree(HeKEY_hek(entry));
959 Perl_hv_clear(pTHX_ HV *hv)
964 xhv = (XPVHV*)SvANY(hv);
969 (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*));
976 S_hfreeentries(pTHX_ HV *hv)
980 register HE *oentry = Null(HE*);
996 entry = HeNEXT(entry);
997 hv_free_ent(hv, oentry);
1002 entry = array[riter];
1005 (void)hv_iterinit(hv);
1009 Perl_hv_undef(pTHX_ HV *hv)
1011 register XPVHV* xhv;
1014 xhv = (XPVHV*)SvANY(hv);
1016 Safefree(xhv->xhv_array);
1018 Safefree(HvNAME(hv));
1022 xhv->xhv_max = 7; /* it's a normal hash */
1031 Perl_hv_iterinit(pTHX_ HV *hv)
1033 register XPVHV* xhv;
1037 Perl_croak(aTHX_ "Bad hash");
1038 xhv = (XPVHV*)SvANY(hv);
1039 entry = xhv->xhv_eiter;
1040 if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1042 hv_free_ent(hv, entry);
1044 xhv->xhv_riter = -1;
1045 xhv->xhv_eiter = Null(HE*);
1046 return xhv->xhv_keys; /* used to be xhv->xhv_fill before 5.004_65 */
1050 Perl_hv_iternext(pTHX_ HV *hv)
1052 register XPVHV* xhv;
1058 Perl_croak(aTHX_ "Bad hash");
1059 xhv = (XPVHV*)SvANY(hv);
1060 oldentry = entry = xhv->xhv_eiter;
1062 if (mg = SvTIED_mg((SV*)hv, 'P')) {
1063 SV *key = sv_newmortal();
1065 sv_setsv(key, HeSVKEY_force(entry));
1066 SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */
1072 xhv->xhv_eiter = entry = new_he(); /* one HE per MAGICAL hash */
1074 Newz(54, k, HEK_BASESIZE + sizeof(SV*), char);
1076 HeKEY_hek(entry) = hek;
1077 HeKLEN(entry) = HEf_SVKEY;
1079 magic_nextpack((SV*) hv,mg,key);
1081 /* force key to stay around until next time */
1082 HeSVKEY_set(entry, SvREFCNT_inc(key));
1083 return entry; /* beware, hent_val is not set */
1086 SvREFCNT_dec(HeVAL(entry));
1087 Safefree(HeKEY_hek(entry));
1089 xhv->xhv_eiter = Null(HE*);
1092 #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */
1093 if (!entry && HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME))
1097 if (!xhv->xhv_array)
1098 Newz(506, xhv->xhv_array,
1099 PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char);
1101 entry = HeNEXT(entry);
1104 if (xhv->xhv_riter > xhv->xhv_max) {
1105 xhv->xhv_riter = -1;
1108 entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter];
1111 if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */
1113 hv_free_ent(hv, oldentry);
1116 xhv->xhv_eiter = entry;
1121 Perl_hv_iterkey(pTHX_ register HE *entry, I32 *retlen)
1123 if (HeKLEN(entry) == HEf_SVKEY) {
1125 char *p = SvPV(HeKEY_sv(entry), len);
1130 *retlen = HeKLEN(entry);
1131 return HeKEY(entry);
1135 /* unlike hv_iterval(), this always returns a mortal copy of the key */
1137 Perl_hv_iterkeysv(pTHX_ register HE *entry)
1139 if (HeKLEN(entry) == HEf_SVKEY)
1140 return sv_mortalcopy(HeKEY_sv(entry));
1142 return sv_2mortal(newSVpvn((HeKLEN(entry) ? HeKEY(entry) : ""),
1147 Perl_hv_iterval(pTHX_ HV *hv, register HE *entry)
1149 if (SvRMAGICAL(hv)) {
1150 if (mg_find((SV*)hv,'P')) {
1151 SV* sv = sv_newmortal();
1152 if (HeKLEN(entry) == HEf_SVKEY)
1153 mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY);
1154 else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry));
1158 return HeVAL(entry);
1162 Perl_hv_iternextsv(pTHX_ HV *hv, char **key, I32 *retlen)
1165 if ( (he = hv_iternext(hv)) == NULL)
1167 *key = hv_iterkey(he, retlen);
1168 return hv_iterval(hv, he);
1172 Perl_hv_magic(pTHX_ HV *hv, GV *gv, int how)
1174 sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0);
1178 Perl_sharepvn(pTHX_ const char *sv, I32 len, U32 hash)
1180 return HEK_KEY(share_hek(sv, len, hash));
1183 /* possibly free a shared string if no one has access to it
1184 * len and hash must both be valid for str.
1187 Perl_unsharepvn(pTHX_ const char *str, I32 len, U32 hash)
1189 register XPVHV* xhv;
1191 register HE **oentry;
1195 /* what follows is the moral equivalent of:
1196 if ((Svp = hv_fetch(PL_strtab, tmpsv, FALSE, hash))) {
1197 if (--*Svp == Nullsv)
1198 hv_delete(PL_strtab, str, len, G_DISCARD, hash);
1200 xhv = (XPVHV*)SvANY(PL_strtab);
1201 /* assert(xhv_array != 0) */
1203 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1204 for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) {
1205 if (HeHASH(entry) != hash) /* strings can't be equal */
1207 if (HeKLEN(entry) != len)
1209 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1212 if (--HeVAL(entry) == Nullsv) {
1213 *oentry = HeNEXT(entry);
1216 Safefree(HeKEY_hek(entry));
1222 UNLOCK_STRTAB_MUTEX;
1226 if (!found && ckWARN_d(WARN_INTERNAL))
1227 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free non-existent shared string");
1231 /* get a (constant) string ptr from the global string table
1232 * string will get added if it is not already there.
1233 * len and hash must both be valid for str.
1236 Perl_share_hek(pTHX_ const char *str, I32 len, register U32 hash)
1238 register XPVHV* xhv;
1240 register HE **oentry;
1244 /* what follows is the moral equivalent of:
1246 if (!(Svp = hv_fetch(PL_strtab, str, len, FALSE)))
1247 hv_store(PL_strtab, str, len, Nullsv, hash);
1249 xhv = (XPVHV*)SvANY(PL_strtab);
1250 /* assert(xhv_array != 0) */
1252 oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max];
1253 for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) {
1254 if (HeHASH(entry) != hash) /* strings can't be equal */
1256 if (HeKLEN(entry) != len)
1258 if (memNE(HeKEY(entry),str,len)) /* is this it? */
1265 HeKEY_hek(entry) = save_hek(str, len, hash);
1266 HeVAL(entry) = Nullsv;
1267 HeNEXT(entry) = *oentry;
1270 if (i) { /* initial entry? */
1272 if (xhv->xhv_keys > xhv->xhv_max)
1277 ++HeVAL(entry); /* use value slot as REFCNT */
1278 UNLOCK_STRTAB_MUTEX;
1279 return HeKEY_hek(entry);