Commit | Line | Data |
a0d0e21e |
1 | /* hv.c |
79072805 |
2 | * |
bc89e66f |
3 | * Copyright (c) 1991-2001, Larry Wall |
79072805 |
4 | * |
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. |
7 | * |
a0d0e21e |
8 | */ |
9 | |
10 | /* |
11 | * "I sit beside the fire and think of all that I have seen." --Bilbo |
79072805 |
12 | */ |
13 | |
14 | #include "EXTERN.h" |
864dbfa3 |
15 | #define PERL_IN_HV_C |
79072805 |
16 | #include "perl.h" |
17 | |
1c846c1f |
18 | |
76e3520e |
19 | STATIC HE* |
cea2e8a9 |
20 | S_new_he(pTHX) |
4633a7c4 |
21 | { |
22 | HE* he; |
333f433b |
23 | LOCK_SV_MUTEX; |
24 | if (!PL_he_root) |
25 | more_he(); |
26 | he = PL_he_root; |
27 | PL_he_root = HeNEXT(he); |
28 | UNLOCK_SV_MUTEX; |
29 | return he; |
4633a7c4 |
30 | } |
31 | |
76e3520e |
32 | STATIC void |
cea2e8a9 |
33 | S_del_he(pTHX_ HE *p) |
4633a7c4 |
34 | { |
333f433b |
35 | LOCK_SV_MUTEX; |
3280af22 |
36 | HeNEXT(p) = (HE*)PL_he_root; |
37 | PL_he_root = p; |
333f433b |
38 | UNLOCK_SV_MUTEX; |
4633a7c4 |
39 | } |
40 | |
333f433b |
41 | STATIC void |
cea2e8a9 |
42 | S_more_he(pTHX) |
4633a7c4 |
43 | { |
44 | register HE* he; |
45 | register HE* heend; |
612f20c3 |
46 | XPV *ptr; |
47 | New(54, ptr, 1008/sizeof(XPV), XPV); |
48 | ptr->xpv_pv = (char*)PL_he_arenaroot; |
49 | PL_he_arenaroot = ptr; |
50 | |
51 | he = (HE*)ptr; |
4633a7c4 |
52 | heend = &he[1008 / sizeof(HE) - 1]; |
612f20c3 |
53 | PL_he_root = ++he; |
4633a7c4 |
54 | while (he < heend) { |
fde52b5c |
55 | HeNEXT(he) = (HE*)(he + 1); |
4633a7c4 |
56 | he++; |
57 | } |
fde52b5c |
58 | HeNEXT(he) = 0; |
4633a7c4 |
59 | } |
60 | |
d33b2eba |
61 | #ifdef PURIFY |
62 | |
63 | #define new_HE() (HE*)safemalloc(sizeof(HE)) |
64 | #define del_HE(p) safefree((char*)p) |
65 | |
66 | #else |
67 | |
68 | #define new_HE() new_he() |
69 | #define del_HE(p) del_he(p) |
70 | |
71 | #endif |
72 | |
76e3520e |
73 | STATIC HEK * |
cea2e8a9 |
74 | S_save_hek(pTHX_ const char *str, I32 len, U32 hash) |
bbce6d69 |
75 | { |
76 | char *k; |
77 | register HEK *hek; |
da58a35d |
78 | bool is_utf8 = FALSE; |
79 | |
80 | if (len < 0) { |
81 | len = -len; |
82 | is_utf8 = TRUE; |
83 | } |
1c846c1f |
84 | |
ff68c719 |
85 | New(54, k, HEK_BASESIZE + len + 1, char); |
bbce6d69 |
86 | hek = (HEK*)k; |
ff68c719 |
87 | Copy(str, HEK_KEY(hek), len, char); |
ff68c719 |
88 | HEK_LEN(hek) = len; |
89 | HEK_HASH(hek) = hash; |
da58a35d |
90 | HEK_UTF8(hek) = (char)is_utf8; |
bbce6d69 |
91 | return hek; |
92 | } |
93 | |
94 | void |
864dbfa3 |
95 | Perl_unshare_hek(pTHX_ HEK *hek) |
bbce6d69 |
96 | { |
c3654f1a |
97 | unsharepvn(HEK_KEY(hek),HEK_UTF8(hek)?-HEK_LEN(hek):HEK_LEN(hek), |
98 | HEK_HASH(hek)); |
bbce6d69 |
99 | } |
100 | |
d18c6117 |
101 | #if defined(USE_ITHREADS) |
102 | HE * |
103 | Perl_he_dup(pTHX_ HE *e, bool shared) |
104 | { |
105 | HE *ret; |
106 | |
107 | if (!e) |
108 | return Nullhe; |
7766f137 |
109 | /* look for it in the table first */ |
110 | ret = (HE*)ptr_table_fetch(PL_ptr_table, e); |
111 | if (ret) |
112 | return ret; |
113 | |
114 | /* create anew and remember what it is */ |
d33b2eba |
115 | ret = new_HE(); |
7766f137 |
116 | ptr_table_store(PL_ptr_table, e, ret); |
117 | |
118 | HeNEXT(ret) = he_dup(HeNEXT(e),shared); |
d18c6117 |
119 | if (HeKLEN(e) == HEf_SVKEY) |
120 | HeKEY_sv(ret) = SvREFCNT_inc(sv_dup(HeKEY_sv(e))); |
121 | else if (shared) |
c3654f1a |
122 | HeKEY_hek(ret) = share_hek(HeKEY(e), HeKLEN_UTF8(e), HeHASH(e)); |
d18c6117 |
123 | else |
c3654f1a |
124 | HeKEY_hek(ret) = save_hek(HeKEY(e), HeKLEN_UTF8(e), HeHASH(e)); |
d18c6117 |
125 | HeVAL(ret) = SvREFCNT_inc(sv_dup(HeVAL(e))); |
126 | return ret; |
127 | } |
128 | #endif /* USE_ITHREADS */ |
129 | |
fde52b5c |
130 | /* (klen == HEf_SVKEY) is special for MAGICAL hv entries, meaning key slot |
131 | * contains an SV* */ |
132 | |
954c1994 |
133 | /* |
134 | =for apidoc hv_fetch |
135 | |
136 | Returns the SV which corresponds to the specified key in the hash. The |
137 | C<klen> is the length of the key. If C<lval> is set then the fetch will be |
138 | part of a store. Check that the return value is non-null before |
1c846c1f |
139 | dereferencing it to a C<SV*>. |
954c1994 |
140 | |
96f1132b |
141 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more |
954c1994 |
142 | information on how to use this function on tied hashes. |
143 | |
144 | =cut |
145 | */ |
146 | |
79072805 |
147 | SV** |
da58a35d |
148 | Perl_hv_fetch(pTHX_ HV *hv, const char *key, I32 klen, I32 lval) |
79072805 |
149 | { |
150 | register XPVHV* xhv; |
fde52b5c |
151 | register U32 hash; |
79072805 |
152 | register HE *entry; |
79072805 |
153 | SV *sv; |
da58a35d |
154 | bool is_utf8 = FALSE; |
f9a63242 |
155 | const char *keysave = key; |
79072805 |
156 | |
157 | if (!hv) |
158 | return 0; |
463ee0b2 |
159 | |
da58a35d |
160 | if (klen < 0) { |
161 | klen = -klen; |
162 | is_utf8 = TRUE; |
163 | } |
164 | |
8990e307 |
165 | if (SvRMAGICAL(hv)) { |
463ee0b2 |
166 | if (mg_find((SV*)hv,'P')) { |
8990e307 |
167 | sv = sv_newmortal(); |
463ee0b2 |
168 | mg_copy((SV*)hv, sv, key, klen); |
3280af22 |
169 | PL_hv_fetch_sv = sv; |
170 | return &PL_hv_fetch_sv; |
463ee0b2 |
171 | } |
902173a3 |
172 | #ifdef ENV_IS_CASELESS |
173 | else if (mg_find((SV*)hv,'E')) { |
e7152ba2 |
174 | U32 i; |
175 | for (i = 0; i < klen; ++i) |
176 | if (isLOWER(key[i])) { |
79cb57f6 |
177 | char *nkey = strupr(SvPVX(sv_2mortal(newSVpvn(key,klen)))); |
e7152ba2 |
178 | SV **ret = hv_fetch(hv, nkey, klen, 0); |
179 | if (!ret && lval) |
180 | ret = hv_store(hv, key, klen, NEWSV(61,0), 0); |
181 | return ret; |
182 | } |
902173a3 |
183 | } |
184 | #endif |
463ee0b2 |
185 | } |
186 | |
79072805 |
187 | xhv = (XPVHV*)SvANY(hv); |
188 | if (!xhv->xhv_array) { |
1c846c1f |
189 | if (lval |
a0d0e21e |
190 | #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */ |
191 | || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) |
192 | #endif |
193 | ) |
d18c6117 |
194 | Newz(503, xhv->xhv_array, |
195 | PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char); |
79072805 |
196 | else |
197 | return 0; |
198 | } |
199 | |
75a54232 |
200 | if (is_utf8 && !(PL_hints & HINT_UTF8_DISTINCT)) { |
201 | STRLEN tmplen = klen; |
202 | /* Just casting the &klen to (STRLEN) won't work well |
203 | * if STRLEN and I32 are of different widths. --jhi */ |
204 | key = (char*)bytes_from_utf8((U8*)key, &tmplen, &is_utf8); |
205 | klen = tmplen; |
206 | } |
f9a63242 |
207 | |
fde52b5c |
208 | PERL_HASH(hash, key, klen); |
79072805 |
209 | |
a0d0e21e |
210 | entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; |
fde52b5c |
211 | for (; entry; entry = HeNEXT(entry)) { |
212 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
79072805 |
213 | continue; |
fde52b5c |
214 | if (HeKLEN(entry) != klen) |
79072805 |
215 | continue; |
1c846c1f |
216 | if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */ |
79072805 |
217 | continue; |
c3654f1a |
218 | if (HeKUTF8(entry) != (char)is_utf8) |
219 | continue; |
f9a63242 |
220 | if (key != keysave) |
221 | Safefree(key); |
fde52b5c |
222 | return &HeVAL(entry); |
79072805 |
223 | } |
a0d0e21e |
224 | #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */ |
225 | if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) { |
a6c40364 |
226 | unsigned long len; |
227 | char *env = PerlEnv_ENVgetenv_len(key,&len); |
228 | if (env) { |
229 | sv = newSVpvn(env,len); |
230 | SvTAINTED_on(sv); |
f9a63242 |
231 | if (key != keysave) |
232 | Safefree(key); |
a6c40364 |
233 | return hv_store(hv,key,klen,sv,hash); |
234 | } |
a0d0e21e |
235 | } |
236 | #endif |
79072805 |
237 | if (lval) { /* gonna assign to this, so it better be there */ |
238 | sv = NEWSV(61,0); |
f9a63242 |
239 | if (key != keysave) { /* must be is_utf8 == 0 */ |
240 | SV **ret = hv_store(hv,key,klen,sv,hash); |
241 | Safefree(key); |
242 | return ret; |
243 | } |
244 | else |
245 | return hv_store(hv,key,is_utf8?-klen:klen,sv,hash); |
79072805 |
246 | } |
f9a63242 |
247 | if (key != keysave) |
248 | Safefree(key); |
79072805 |
249 | return 0; |
250 | } |
251 | |
fde52b5c |
252 | /* returns a HE * structure with the all fields set */ |
253 | /* note that hent_val will be a mortal sv for MAGICAL hashes */ |
954c1994 |
254 | /* |
255 | =for apidoc hv_fetch_ent |
256 | |
257 | Returns the hash entry which corresponds to the specified key in the hash. |
258 | C<hash> must be a valid precomputed hash number for the given C<key>, or 0 |
259 | if you want the function to compute it. IF C<lval> is set then the fetch |
260 | will be part of a store. Make sure the return value is non-null before |
261 | accessing it. The return value when C<tb> is a tied hash is a pointer to a |
262 | static location, so be sure to make a copy of the structure if you need to |
1c846c1f |
263 | store it somewhere. |
954c1994 |
264 | |
96f1132b |
265 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more |
954c1994 |
266 | information on how to use this function on tied hashes. |
267 | |
268 | =cut |
269 | */ |
270 | |
fde52b5c |
271 | HE * |
864dbfa3 |
272 | Perl_hv_fetch_ent(pTHX_ HV *hv, SV *keysv, I32 lval, register U32 hash) |
fde52b5c |
273 | { |
274 | register XPVHV* xhv; |
275 | register char *key; |
276 | STRLEN klen; |
277 | register HE *entry; |
278 | SV *sv; |
da58a35d |
279 | bool is_utf8; |
f9a63242 |
280 | char *keysave; |
fde52b5c |
281 | |
282 | if (!hv) |
283 | return 0; |
284 | |
902173a3 |
285 | if (SvRMAGICAL(hv)) { |
286 | if (mg_find((SV*)hv,'P')) { |
902173a3 |
287 | sv = sv_newmortal(); |
288 | keysv = sv_2mortal(newSVsv(keysv)); |
289 | mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY); |
3280af22 |
290 | if (!HeKEY_hek(&PL_hv_fetch_ent_mh)) { |
902173a3 |
291 | char *k; |
292 | New(54, k, HEK_BASESIZE + sizeof(SV*), char); |
3280af22 |
293 | HeKEY_hek(&PL_hv_fetch_ent_mh) = (HEK*)k; |
902173a3 |
294 | } |
3280af22 |
295 | HeSVKEY_set(&PL_hv_fetch_ent_mh, keysv); |
296 | HeVAL(&PL_hv_fetch_ent_mh) = sv; |
297 | return &PL_hv_fetch_ent_mh; |
1cf368ac |
298 | } |
902173a3 |
299 | #ifdef ENV_IS_CASELESS |
300 | else if (mg_find((SV*)hv,'E')) { |
e7152ba2 |
301 | U32 i; |
902173a3 |
302 | key = SvPV(keysv, klen); |
e7152ba2 |
303 | for (i = 0; i < klen; ++i) |
304 | if (isLOWER(key[i])) { |
79cb57f6 |
305 | SV *nkeysv = sv_2mortal(newSVpvn(key,klen)); |
e7152ba2 |
306 | (void)strupr(SvPVX(nkeysv)); |
307 | entry = hv_fetch_ent(hv, nkeysv, 0, 0); |
308 | if (!entry && lval) |
309 | entry = hv_store_ent(hv, keysv, NEWSV(61,0), hash); |
310 | return entry; |
311 | } |
902173a3 |
312 | } |
313 | #endif |
fde52b5c |
314 | } |
315 | |
effa1e2d |
316 | xhv = (XPVHV*)SvANY(hv); |
fde52b5c |
317 | if (!xhv->xhv_array) { |
1c846c1f |
318 | if (lval |
fde52b5c |
319 | #ifdef DYNAMIC_ENV_FETCH /* if it's an %ENV lookup, we may get it on the fly */ |
320 | || (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) |
321 | #endif |
322 | ) |
d18c6117 |
323 | Newz(503, xhv->xhv_array, |
324 | PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char); |
fde52b5c |
325 | else |
326 | return 0; |
327 | } |
328 | |
f9a63242 |
329 | keysave = key = SvPV(keysv, klen); |
da58a35d |
330 | is_utf8 = (SvUTF8(keysv)!=0); |
1c846c1f |
331 | |
f9a63242 |
332 | if (is_utf8 && !(PL_hints & HINT_UTF8_DISTINCT)) |
333 | key = (char*)bytes_from_utf8((U8*)key, &klen, &is_utf8); |
334 | |
effa1e2d |
335 | if (!hash) |
336 | PERL_HASH(hash, key, klen); |
337 | |
fde52b5c |
338 | entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; |
339 | for (; entry; entry = HeNEXT(entry)) { |
340 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
341 | continue; |
342 | if (HeKLEN(entry) != klen) |
343 | continue; |
1c846c1f |
344 | if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */ |
fde52b5c |
345 | continue; |
c3654f1a |
346 | if (HeKUTF8(entry) != (char)is_utf8) |
347 | continue; |
f9a63242 |
348 | if (key != keysave) |
349 | Safefree(key); |
fde52b5c |
350 | return entry; |
351 | } |
352 | #ifdef DYNAMIC_ENV_FETCH /* %ENV lookup? If so, try to fetch the value now */ |
353 | if (HvNAME(hv) && strEQ(HvNAME(hv),ENV_HV_NAME)) { |
a6c40364 |
354 | unsigned long len; |
355 | char *env = PerlEnv_ENVgetenv_len(key,&len); |
356 | if (env) { |
357 | sv = newSVpvn(env,len); |
358 | SvTAINTED_on(sv); |
359 | return hv_store_ent(hv,keysv,sv,hash); |
360 | } |
fde52b5c |
361 | } |
362 | #endif |
f9a63242 |
363 | if (key != keysave) |
364 | Safefree(key); |
fde52b5c |
365 | if (lval) { /* gonna assign to this, so it better be there */ |
366 | sv = NEWSV(61,0); |
e7152ba2 |
367 | return hv_store_ent(hv,keysv,sv,hash); |
fde52b5c |
368 | } |
369 | return 0; |
370 | } |
371 | |
864dbfa3 |
372 | STATIC void |
cea2e8a9 |
373 | S_hv_magic_check(pTHX_ HV *hv, bool *needs_copy, bool *needs_store) |
d0066dc7 |
374 | { |
375 | MAGIC *mg = SvMAGIC(hv); |
376 | *needs_copy = FALSE; |
377 | *needs_store = TRUE; |
378 | while (mg) { |
379 | if (isUPPER(mg->mg_type)) { |
380 | *needs_copy = TRUE; |
381 | switch (mg->mg_type) { |
382 | case 'P': |
d0066dc7 |
383 | case 'S': |
384 | *needs_store = FALSE; |
d0066dc7 |
385 | } |
386 | } |
387 | mg = mg->mg_moremagic; |
388 | } |
389 | } |
390 | |
954c1994 |
391 | /* |
392 | =for apidoc hv_store |
393 | |
394 | Stores an SV in a hash. The hash key is specified as C<key> and C<klen> is |
395 | the length of the key. The C<hash> parameter is the precomputed hash |
396 | value; if it is zero then Perl will compute it. The return value will be |
397 | NULL if the operation failed or if the value did not need to be actually |
398 | stored within the hash (as in the case of tied hashes). Otherwise it can |
399 | be dereferenced to get the original C<SV*>. Note that the caller is |
400 | responsible for suitably incrementing the reference count of C<val> before |
1c846c1f |
401 | the call, and decrementing it if the function returned NULL. |
954c1994 |
402 | |
96f1132b |
403 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more |
954c1994 |
404 | information on how to use this function on tied hashes. |
405 | |
406 | =cut |
407 | */ |
408 | |
79072805 |
409 | SV** |
da58a35d |
410 | Perl_hv_store(pTHX_ HV *hv, const char *key, I32 klen, SV *val, register U32 hash) |
79072805 |
411 | { |
412 | register XPVHV* xhv; |
79072805 |
413 | register I32 i; |
414 | register HE *entry; |
415 | register HE **oentry; |
da58a35d |
416 | bool is_utf8 = FALSE; |
f9a63242 |
417 | const char *keysave = key; |
79072805 |
418 | |
419 | if (!hv) |
420 | return 0; |
421 | |
da58a35d |
422 | if (klen < 0) { |
423 | klen = -klen; |
424 | is_utf8 = TRUE; |
425 | } |
426 | |
79072805 |
427 | xhv = (XPVHV*)SvANY(hv); |
463ee0b2 |
428 | if (SvMAGICAL(hv)) { |
d0066dc7 |
429 | bool needs_copy; |
430 | bool needs_store; |
431 | hv_magic_check (hv, &needs_copy, &needs_store); |
432 | if (needs_copy) { |
433 | mg_copy((SV*)hv, val, key, klen); |
434 | if (!xhv->xhv_array && !needs_store) |
435 | return 0; |
902173a3 |
436 | #ifdef ENV_IS_CASELESS |
437 | else if (mg_find((SV*)hv,'E')) { |
d220deaf |
438 | key = savepvn(key,klen); |
439 | key = strupr(key); |
902173a3 |
440 | hash = 0; |
441 | } |
442 | #endif |
d0066dc7 |
443 | } |
463ee0b2 |
444 | } |
75a54232 |
445 | if (is_utf8 && !(PL_hints & HINT_UTF8_DISTINCT)) { |
446 | STRLEN tmplen = klen; |
447 | /* See the note in hv_fetch(). --jhi */ |
448 | key = (char*)bytes_from_utf8((U8*)key, &tmplen, &is_utf8); |
449 | klen = tmplen; |
450 | } |
f9a63242 |
451 | |
fde52b5c |
452 | if (!hash) |
453 | PERL_HASH(hash, key, klen); |
454 | |
455 | if (!xhv->xhv_array) |
d18c6117 |
456 | Newz(505, xhv->xhv_array, |
457 | PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char); |
fde52b5c |
458 | |
459 | oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; |
460 | i = 1; |
461 | |
462 | for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) { |
463 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
464 | continue; |
465 | if (HeKLEN(entry) != klen) |
466 | continue; |
1c846c1f |
467 | if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */ |
fde52b5c |
468 | continue; |
c3654f1a |
469 | if (HeKUTF8(entry) != (char)is_utf8) |
470 | continue; |
fde52b5c |
471 | SvREFCNT_dec(HeVAL(entry)); |
472 | HeVAL(entry) = val; |
f9a63242 |
473 | if (key != keysave) |
474 | Safefree(key); |
fde52b5c |
475 | return &HeVAL(entry); |
476 | } |
477 | |
d33b2eba |
478 | entry = new_HE(); |
fde52b5c |
479 | if (HvSHAREKEYS(hv)) |
c3654f1a |
480 | HeKEY_hek(entry) = share_hek(key, is_utf8?-klen:klen, hash); |
fde52b5c |
481 | else /* gotta do the real thing */ |
c3654f1a |
482 | HeKEY_hek(entry) = save_hek(key, is_utf8?-klen:klen, hash); |
f9a63242 |
483 | if (key != keysave) |
484 | Safefree(key); |
fde52b5c |
485 | HeVAL(entry) = val; |
fde52b5c |
486 | HeNEXT(entry) = *oentry; |
487 | *oentry = entry; |
488 | |
489 | xhv->xhv_keys++; |
490 | if (i) { /* initial entry? */ |
491 | ++xhv->xhv_fill; |
492 | if (xhv->xhv_keys > xhv->xhv_max) |
493 | hsplit(hv); |
79072805 |
494 | } |
495 | |
fde52b5c |
496 | return &HeVAL(entry); |
497 | } |
498 | |
954c1994 |
499 | /* |
500 | =for apidoc hv_store_ent |
501 | |
502 | Stores C<val> in a hash. The hash key is specified as C<key>. The C<hash> |
503 | parameter is the precomputed hash value; if it is zero then Perl will |
504 | compute it. The return value is the new hash entry so created. It will be |
505 | NULL if the operation failed or if the value did not need to be actually |
506 | stored within the hash (as in the case of tied hashes). Otherwise the |
507 | contents of the return value can be accessed using the C<He???> macros |
508 | described here. Note that the caller is responsible for suitably |
509 | incrementing the reference count of C<val> before the call, and |
1c846c1f |
510 | decrementing it if the function returned NULL. |
954c1994 |
511 | |
96f1132b |
512 | See L<perlguts/"Understanding the Magic of Tied Hashes and Arrays"> for more |
954c1994 |
513 | information on how to use this function on tied hashes. |
514 | |
515 | =cut |
516 | */ |
517 | |
fde52b5c |
518 | HE * |
864dbfa3 |
519 | Perl_hv_store_ent(pTHX_ HV *hv, SV *keysv, SV *val, register U32 hash) |
fde52b5c |
520 | { |
521 | register XPVHV* xhv; |
522 | register char *key; |
523 | STRLEN klen; |
524 | register I32 i; |
525 | register HE *entry; |
526 | register HE **oentry; |
da58a35d |
527 | bool is_utf8; |
f9a63242 |
528 | char *keysave; |
fde52b5c |
529 | |
530 | if (!hv) |
531 | return 0; |
532 | |
533 | xhv = (XPVHV*)SvANY(hv); |
534 | if (SvMAGICAL(hv)) { |
d0066dc7 |
535 | bool needs_copy; |
536 | bool needs_store; |
537 | hv_magic_check (hv, &needs_copy, &needs_store); |
538 | if (needs_copy) { |
3280af22 |
539 | bool save_taint = PL_tainted; |
540 | if (PL_tainting) |
541 | PL_tainted = SvTAINTED(keysv); |
d0066dc7 |
542 | keysv = sv_2mortal(newSVsv(keysv)); |
543 | mg_copy((SV*)hv, val, (char*)keysv, HEf_SVKEY); |
544 | TAINT_IF(save_taint); |
545 | if (!xhv->xhv_array && !needs_store) |
546 | return Nullhe; |
902173a3 |
547 | #ifdef ENV_IS_CASELESS |
548 | else if (mg_find((SV*)hv,'E')) { |
549 | key = SvPV(keysv, klen); |
79cb57f6 |
550 | keysv = sv_2mortal(newSVpvn(key,klen)); |
902173a3 |
551 | (void)strupr(SvPVX(keysv)); |
552 | hash = 0; |
553 | } |
554 | #endif |
555 | } |
fde52b5c |
556 | } |
557 | |
f9a63242 |
558 | keysave = key = SvPV(keysv, klen); |
da58a35d |
559 | is_utf8 = (SvUTF8(keysv) != 0); |
902173a3 |
560 | |
f9a63242 |
561 | if (is_utf8 && !(PL_hints & HINT_UTF8_DISTINCT)) |
562 | key = (char*)bytes_from_utf8((U8*)key, &klen, &is_utf8); |
563 | |
fde52b5c |
564 | if (!hash) |
565 | PERL_HASH(hash, key, klen); |
566 | |
79072805 |
567 | if (!xhv->xhv_array) |
d18c6117 |
568 | Newz(505, xhv->xhv_array, |
569 | PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char); |
79072805 |
570 | |
a0d0e21e |
571 | oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; |
79072805 |
572 | i = 1; |
573 | |
fde52b5c |
574 | for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) { |
575 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
79072805 |
576 | continue; |
fde52b5c |
577 | if (HeKLEN(entry) != klen) |
79072805 |
578 | continue; |
1c846c1f |
579 | if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */ |
79072805 |
580 | continue; |
c3654f1a |
581 | if (HeKUTF8(entry) != (char)is_utf8) |
582 | continue; |
fde52b5c |
583 | SvREFCNT_dec(HeVAL(entry)); |
584 | HeVAL(entry) = val; |
f9a63242 |
585 | if (key != keysave) |
586 | Safefree(key); |
fde52b5c |
587 | return entry; |
79072805 |
588 | } |
79072805 |
589 | |
d33b2eba |
590 | entry = new_HE(); |
fde52b5c |
591 | if (HvSHAREKEYS(hv)) |
c3654f1a |
592 | HeKEY_hek(entry) = share_hek(key, is_utf8?-klen:klen, hash); |
fde52b5c |
593 | else /* gotta do the real thing */ |
c3654f1a |
594 | HeKEY_hek(entry) = save_hek(key, is_utf8?-klen:klen, hash); |
f9a63242 |
595 | if (key != keysave) |
596 | Safefree(key); |
fde52b5c |
597 | HeVAL(entry) = val; |
fde52b5c |
598 | HeNEXT(entry) = *oentry; |
79072805 |
599 | *oentry = entry; |
600 | |
463ee0b2 |
601 | xhv->xhv_keys++; |
79072805 |
602 | if (i) { /* initial entry? */ |
463ee0b2 |
603 | ++xhv->xhv_fill; |
604 | if (xhv->xhv_keys > xhv->xhv_max) |
79072805 |
605 | hsplit(hv); |
606 | } |
79072805 |
607 | |
fde52b5c |
608 | return entry; |
79072805 |
609 | } |
610 | |
954c1994 |
611 | /* |
612 | =for apidoc hv_delete |
613 | |
614 | Deletes a key/value pair in the hash. The value SV is removed from the |
1c846c1f |
615 | hash and returned to the caller. The C<klen> is the length of the key. |
954c1994 |
616 | The C<flags> value will normally be zero; if set to G_DISCARD then NULL |
617 | will be returned. |
618 | |
619 | =cut |
620 | */ |
621 | |
79072805 |
622 | SV * |
da58a35d |
623 | Perl_hv_delete(pTHX_ HV *hv, const char *key, I32 klen, I32 flags) |
79072805 |
624 | { |
625 | register XPVHV* xhv; |
79072805 |
626 | register I32 i; |
fde52b5c |
627 | register U32 hash; |
79072805 |
628 | register HE *entry; |
629 | register HE **oentry; |
67a38de0 |
630 | SV **svp; |
79072805 |
631 | SV *sv; |
da58a35d |
632 | bool is_utf8 = FALSE; |
f9a63242 |
633 | const char *keysave = key; |
79072805 |
634 | |
635 | if (!hv) |
636 | return Nullsv; |
da58a35d |
637 | if (klen < 0) { |
638 | klen = -klen; |
639 | is_utf8 = TRUE; |
640 | } |
8990e307 |
641 | if (SvRMAGICAL(hv)) { |
0a0bb7c7 |
642 | bool needs_copy; |
643 | bool needs_store; |
644 | hv_magic_check (hv, &needs_copy, &needs_store); |
645 | |
67a38de0 |
646 | if (needs_copy && (svp = hv_fetch(hv, key, klen, TRUE))) { |
647 | sv = *svp; |
0a0bb7c7 |
648 | mg_clear(sv); |
649 | if (!needs_store) { |
650 | if (mg_find(sv, 'p')) { |
651 | sv_unmagic(sv, 'p'); /* No longer an element */ |
652 | return sv; |
653 | } |
654 | return Nullsv; /* element cannot be deleted */ |
655 | } |
902173a3 |
656 | #ifdef ENV_IS_CASELESS |
2fd1c6b8 |
657 | else if (mg_find((SV*)hv,'E')) { |
79cb57f6 |
658 | sv = sv_2mortal(newSVpvn(key,klen)); |
2fd1c6b8 |
659 | key = strupr(SvPVX(sv)); |
660 | } |
902173a3 |
661 | #endif |
2fd1c6b8 |
662 | } |
463ee0b2 |
663 | } |
79072805 |
664 | xhv = (XPVHV*)SvANY(hv); |
665 | if (!xhv->xhv_array) |
666 | return Nullsv; |
fde52b5c |
667 | |
75a54232 |
668 | if (is_utf8 && !(PL_hints & HINT_UTF8_DISTINCT)) { |
669 | STRLEN tmplen = klen; |
670 | /* See the note in hv_fetch(). --jhi */ |
671 | key = (char*)bytes_from_utf8((U8*)key, &tmplen, &is_utf8); |
672 | klen = tmplen; |
673 | } |
f9a63242 |
674 | |
fde52b5c |
675 | PERL_HASH(hash, key, klen); |
79072805 |
676 | |
a0d0e21e |
677 | oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; |
79072805 |
678 | entry = *oentry; |
679 | i = 1; |
fde52b5c |
680 | for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) { |
681 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
79072805 |
682 | continue; |
fde52b5c |
683 | if (HeKLEN(entry) != klen) |
79072805 |
684 | continue; |
1c846c1f |
685 | if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */ |
79072805 |
686 | continue; |
c3654f1a |
687 | if (HeKUTF8(entry) != (char)is_utf8) |
688 | continue; |
f9a63242 |
689 | if (key != keysave) |
690 | Safefree(key); |
fde52b5c |
691 | *oentry = HeNEXT(entry); |
79072805 |
692 | if (i && !*oentry) |
693 | xhv->xhv_fill--; |
748a9306 |
694 | if (flags & G_DISCARD) |
695 | sv = Nullsv; |
94f7643d |
696 | else { |
79d01fbf |
697 | sv = sv_2mortal(HeVAL(entry)); |
94f7643d |
698 | HeVAL(entry) = &PL_sv_undef; |
699 | } |
a0d0e21e |
700 | if (entry == xhv->xhv_eiter) |
72940dca |
701 | HvLAZYDEL_on(hv); |
a0d0e21e |
702 | else |
68dc0745 |
703 | hv_free_ent(hv, entry); |
fde52b5c |
704 | --xhv->xhv_keys; |
705 | return sv; |
706 | } |
f9a63242 |
707 | if (key != keysave) |
708 | Safefree(key); |
fde52b5c |
709 | return Nullsv; |
710 | } |
711 | |
954c1994 |
712 | /* |
713 | =for apidoc hv_delete_ent |
714 | |
715 | Deletes a key/value pair in the hash. The value SV is removed from the |
716 | hash and returned to the caller. The C<flags> value will normally be zero; |
717 | if set to G_DISCARD then NULL will be returned. C<hash> can be a valid |
718 | precomputed hash value, or 0 to ask for it to be computed. |
719 | |
720 | =cut |
721 | */ |
722 | |
fde52b5c |
723 | SV * |
864dbfa3 |
724 | Perl_hv_delete_ent(pTHX_ HV *hv, SV *keysv, I32 flags, U32 hash) |
fde52b5c |
725 | { |
726 | register XPVHV* xhv; |
727 | register I32 i; |
728 | register char *key; |
729 | STRLEN klen; |
730 | register HE *entry; |
731 | register HE **oentry; |
732 | SV *sv; |
da58a35d |
733 | bool is_utf8; |
f9a63242 |
734 | char *keysave; |
1c846c1f |
735 | |
fde52b5c |
736 | if (!hv) |
737 | return Nullsv; |
738 | if (SvRMAGICAL(hv)) { |
0a0bb7c7 |
739 | bool needs_copy; |
740 | bool needs_store; |
741 | hv_magic_check (hv, &needs_copy, &needs_store); |
742 | |
67a38de0 |
743 | if (needs_copy && (entry = hv_fetch_ent(hv, keysv, TRUE, hash))) { |
0a0bb7c7 |
744 | sv = HeVAL(entry); |
745 | mg_clear(sv); |
746 | if (!needs_store) { |
747 | if (mg_find(sv, 'p')) { |
748 | sv_unmagic(sv, 'p'); /* No longer an element */ |
749 | return sv; |
750 | } |
751 | return Nullsv; /* element cannot be deleted */ |
752 | } |
902173a3 |
753 | #ifdef ENV_IS_CASELESS |
2fd1c6b8 |
754 | else if (mg_find((SV*)hv,'E')) { |
755 | key = SvPV(keysv, klen); |
79cb57f6 |
756 | keysv = sv_2mortal(newSVpvn(key,klen)); |
2fd1c6b8 |
757 | (void)strupr(SvPVX(keysv)); |
1c846c1f |
758 | hash = 0; |
2fd1c6b8 |
759 | } |
902173a3 |
760 | #endif |
2fd1c6b8 |
761 | } |
fde52b5c |
762 | } |
763 | xhv = (XPVHV*)SvANY(hv); |
764 | if (!xhv->xhv_array) |
765 | return Nullsv; |
766 | |
f9a63242 |
767 | keysave = key = SvPV(keysv, klen); |
da58a35d |
768 | is_utf8 = (SvUTF8(keysv) != 0); |
1c846c1f |
769 | |
f9a63242 |
770 | if (is_utf8 && !(PL_hints & HINT_UTF8_DISTINCT)) |
771 | key = (char*)bytes_from_utf8((U8*)key, &klen, &is_utf8); |
772 | |
fde52b5c |
773 | if (!hash) |
774 | PERL_HASH(hash, key, klen); |
775 | |
776 | oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; |
777 | entry = *oentry; |
778 | i = 1; |
779 | for (; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) { |
780 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
781 | continue; |
782 | if (HeKLEN(entry) != klen) |
783 | continue; |
1c846c1f |
784 | if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */ |
fde52b5c |
785 | continue; |
c3654f1a |
786 | if (HeKUTF8(entry) != (char)is_utf8) |
787 | continue; |
f9a63242 |
788 | if (key != keysave) |
789 | Safefree(key); |
fde52b5c |
790 | *oentry = HeNEXT(entry); |
791 | if (i && !*oentry) |
792 | xhv->xhv_fill--; |
793 | if (flags & G_DISCARD) |
794 | sv = Nullsv; |
94f7643d |
795 | else { |
79d01fbf |
796 | sv = sv_2mortal(HeVAL(entry)); |
94f7643d |
797 | HeVAL(entry) = &PL_sv_undef; |
798 | } |
fde52b5c |
799 | if (entry == xhv->xhv_eiter) |
72940dca |
800 | HvLAZYDEL_on(hv); |
fde52b5c |
801 | else |
68dc0745 |
802 | hv_free_ent(hv, entry); |
463ee0b2 |
803 | --xhv->xhv_keys; |
79072805 |
804 | return sv; |
805 | } |
f9a63242 |
806 | if (key != keysave) |
807 | Safefree(key); |
79072805 |
808 | return Nullsv; |
79072805 |
809 | } |
810 | |
954c1994 |
811 | /* |
812 | =for apidoc hv_exists |
813 | |
814 | Returns a boolean indicating whether the specified hash key exists. The |
815 | C<klen> is the length of the key. |
816 | |
817 | =cut |
818 | */ |
819 | |
a0d0e21e |
820 | bool |
da58a35d |
821 | Perl_hv_exists(pTHX_ HV *hv, const char *key, I32 klen) |
a0d0e21e |
822 | { |
823 | register XPVHV* xhv; |
fde52b5c |
824 | register U32 hash; |
a0d0e21e |
825 | register HE *entry; |
826 | SV *sv; |
da58a35d |
827 | bool is_utf8 = FALSE; |
f9a63242 |
828 | const char *keysave = key; |
a0d0e21e |
829 | |
830 | if (!hv) |
831 | return 0; |
832 | |
da58a35d |
833 | if (klen < 0) { |
834 | klen = -klen; |
835 | is_utf8 = TRUE; |
836 | } |
837 | |
a0d0e21e |
838 | if (SvRMAGICAL(hv)) { |
839 | if (mg_find((SV*)hv,'P')) { |
840 | sv = sv_newmortal(); |
1c846c1f |
841 | mg_copy((SV*)hv, sv, key, klen); |
a0d0e21e |
842 | magic_existspack(sv, mg_find(sv, 'p')); |
843 | return SvTRUE(sv); |
844 | } |
902173a3 |
845 | #ifdef ENV_IS_CASELESS |
846 | else if (mg_find((SV*)hv,'E')) { |
79cb57f6 |
847 | sv = sv_2mortal(newSVpvn(key,klen)); |
902173a3 |
848 | key = strupr(SvPVX(sv)); |
849 | } |
850 | #endif |
a0d0e21e |
851 | } |
852 | |
853 | xhv = (XPVHV*)SvANY(hv); |
f675dbe5 |
854 | #ifndef DYNAMIC_ENV_FETCH |
a0d0e21e |
855 | if (!xhv->xhv_array) |
1c846c1f |
856 | return 0; |
f675dbe5 |
857 | #endif |
a0d0e21e |
858 | |
75a54232 |
859 | if (is_utf8 && !(PL_hints & HINT_UTF8_DISTINCT)) { |
860 | STRLEN tmplen = klen; |
861 | /* See the note in hv_fetch(). --jhi */ |
862 | key = (char*)bytes_from_utf8((U8*)key, &tmplen, &is_utf8); |
863 | klen = tmplen; |
864 | } |
f9a63242 |
865 | |
fde52b5c |
866 | PERL_HASH(hash, key, klen); |
a0d0e21e |
867 | |
f675dbe5 |
868 | #ifdef DYNAMIC_ENV_FETCH |
869 | if (!xhv->xhv_array) entry = Null(HE*); |
870 | else |
871 | #endif |
a0d0e21e |
872 | entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; |
fde52b5c |
873 | for (; entry; entry = HeNEXT(entry)) { |
874 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
a0d0e21e |
875 | continue; |
fde52b5c |
876 | if (HeKLEN(entry) != klen) |
a0d0e21e |
877 | continue; |
1c846c1f |
878 | if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */ |
fde52b5c |
879 | continue; |
c3654f1a |
880 | if (HeKUTF8(entry) != (char)is_utf8) |
881 | continue; |
f9a63242 |
882 | if (key != keysave) |
883 | Safefree(key); |
fde52b5c |
884 | return TRUE; |
885 | } |
f675dbe5 |
886 | #ifdef DYNAMIC_ENV_FETCH /* is it out there? */ |
a6c40364 |
887 | if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME)) { |
888 | unsigned long len; |
889 | char *env = PerlEnv_ENVgetenv_len(key,&len); |
890 | if (env) { |
891 | sv = newSVpvn(env,len); |
892 | SvTAINTED_on(sv); |
893 | (void)hv_store(hv,key,klen,sv,hash); |
894 | return TRUE; |
895 | } |
f675dbe5 |
896 | } |
897 | #endif |
f9a63242 |
898 | if (key != keysave) |
899 | Safefree(key); |
fde52b5c |
900 | return FALSE; |
901 | } |
902 | |
903 | |
954c1994 |
904 | /* |
905 | =for apidoc hv_exists_ent |
906 | |
907 | Returns a boolean indicating whether the specified hash key exists. C<hash> |
908 | can be a valid precomputed hash value, or 0 to ask for it to be |
909 | computed. |
910 | |
911 | =cut |
912 | */ |
913 | |
fde52b5c |
914 | bool |
864dbfa3 |
915 | Perl_hv_exists_ent(pTHX_ HV *hv, SV *keysv, U32 hash) |
fde52b5c |
916 | { |
917 | register XPVHV* xhv; |
918 | register char *key; |
919 | STRLEN klen; |
920 | register HE *entry; |
921 | SV *sv; |
c3654f1a |
922 | bool is_utf8; |
f9a63242 |
923 | char *keysave; |
fde52b5c |
924 | |
925 | if (!hv) |
926 | return 0; |
927 | |
928 | if (SvRMAGICAL(hv)) { |
929 | if (mg_find((SV*)hv,'P')) { |
62815d3c |
930 | SV* svret = sv_newmortal(); |
fde52b5c |
931 | sv = sv_newmortal(); |
effa1e2d |
932 | keysv = sv_2mortal(newSVsv(keysv)); |
1c846c1f |
933 | mg_copy((SV*)hv, sv, (char*)keysv, HEf_SVKEY); |
62815d3c |
934 | magic_existspack(svret, mg_find(sv, 'p')); |
935 | return SvTRUE(svret); |
fde52b5c |
936 | } |
902173a3 |
937 | #ifdef ENV_IS_CASELESS |
938 | else if (mg_find((SV*)hv,'E')) { |
939 | key = SvPV(keysv, klen); |
79cb57f6 |
940 | keysv = sv_2mortal(newSVpvn(key,klen)); |
902173a3 |
941 | (void)strupr(SvPVX(keysv)); |
1c846c1f |
942 | hash = 0; |
902173a3 |
943 | } |
944 | #endif |
fde52b5c |
945 | } |
946 | |
947 | xhv = (XPVHV*)SvANY(hv); |
f675dbe5 |
948 | #ifndef DYNAMIC_ENV_FETCH |
fde52b5c |
949 | if (!xhv->xhv_array) |
1c846c1f |
950 | return 0; |
f675dbe5 |
951 | #endif |
fde52b5c |
952 | |
f9a63242 |
953 | keysave = key = SvPV(keysv, klen); |
c3654f1a |
954 | is_utf8 = (SvUTF8(keysv) != 0); |
f9a63242 |
955 | if (is_utf8 && !(PL_hints & HINT_UTF8_DISTINCT)) |
956 | key = (char*)bytes_from_utf8((U8*)key, &klen, &is_utf8); |
fde52b5c |
957 | if (!hash) |
958 | PERL_HASH(hash, key, klen); |
959 | |
f675dbe5 |
960 | #ifdef DYNAMIC_ENV_FETCH |
961 | if (!xhv->xhv_array) entry = Null(HE*); |
962 | else |
963 | #endif |
fde52b5c |
964 | entry = ((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; |
965 | for (; entry; entry = HeNEXT(entry)) { |
966 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
967 | continue; |
968 | if (HeKLEN(entry) != klen) |
969 | continue; |
1c846c1f |
970 | if (HeKEY(entry) != key && memNE(HeKEY(entry),key,klen)) /* is this it? */ |
a0d0e21e |
971 | continue; |
c3654f1a |
972 | if (HeKUTF8(entry) != (char)is_utf8) |
973 | continue; |
f9a63242 |
974 | if (key != keysave) |
975 | Safefree(key); |
a0d0e21e |
976 | return TRUE; |
977 | } |
f675dbe5 |
978 | #ifdef DYNAMIC_ENV_FETCH /* is it out there? */ |
a6c40364 |
979 | if (HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME)) { |
980 | unsigned long len; |
981 | char *env = PerlEnv_ENVgetenv_len(key,&len); |
982 | if (env) { |
983 | sv = newSVpvn(env,len); |
984 | SvTAINTED_on(sv); |
985 | (void)hv_store_ent(hv,keysv,sv,hash); |
986 | return TRUE; |
987 | } |
f675dbe5 |
988 | } |
989 | #endif |
f9a63242 |
990 | if (key != keysave) |
991 | Safefree(key); |
a0d0e21e |
992 | return FALSE; |
993 | } |
994 | |
76e3520e |
995 | STATIC void |
cea2e8a9 |
996 | S_hsplit(pTHX_ HV *hv) |
79072805 |
997 | { |
998 | register XPVHV* xhv = (XPVHV*)SvANY(hv); |
a0d0e21e |
999 | I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */ |
79072805 |
1000 | register I32 newsize = oldsize * 2; |
1001 | register I32 i; |
72311751 |
1002 | register char *a = xhv->xhv_array; |
1003 | register HE **aep; |
1004 | register HE **bep; |
79072805 |
1005 | register HE *entry; |
1006 | register HE **oentry; |
1007 | |
3280af22 |
1008 | PL_nomemok = TRUE; |
8d6dde3e |
1009 | #if defined(STRANGE_MALLOC) || defined(MYMALLOC) |
d18c6117 |
1010 | Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char); |
422a93e5 |
1011 | if (!a) { |
4a33f861 |
1012 | PL_nomemok = FALSE; |
422a93e5 |
1013 | return; |
1014 | } |
4633a7c4 |
1015 | #else |
4633a7c4 |
1016 | #define MALLOC_OVERHEAD 16 |
d18c6117 |
1017 | New(2, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char); |
422a93e5 |
1018 | if (!a) { |
3280af22 |
1019 | PL_nomemok = FALSE; |
422a93e5 |
1020 | return; |
1021 | } |
72311751 |
1022 | Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char); |
fba3b22e |
1023 | if (oldsize >= 64) { |
d18c6117 |
1024 | offer_nice_chunk(xhv->xhv_array, PERL_HV_ARRAY_ALLOC_BYTES(oldsize)); |
4633a7c4 |
1025 | } |
1026 | else |
1027 | Safefree(xhv->xhv_array); |
1028 | #endif |
1029 | |
3280af22 |
1030 | PL_nomemok = FALSE; |
72311751 |
1031 | Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/ |
79072805 |
1032 | xhv->xhv_max = --newsize; |
72311751 |
1033 | xhv->xhv_array = a; |
1034 | aep = (HE**)a; |
79072805 |
1035 | |
72311751 |
1036 | for (i=0; i<oldsize; i++,aep++) { |
1037 | if (!*aep) /* non-existent */ |
79072805 |
1038 | continue; |
72311751 |
1039 | bep = aep+oldsize; |
1040 | for (oentry = aep, entry = *aep; entry; entry = *oentry) { |
fde52b5c |
1041 | if ((HeHASH(entry) & newsize) != i) { |
1042 | *oentry = HeNEXT(entry); |
72311751 |
1043 | HeNEXT(entry) = *bep; |
1044 | if (!*bep) |
79072805 |
1045 | xhv->xhv_fill++; |
72311751 |
1046 | *bep = entry; |
79072805 |
1047 | continue; |
1048 | } |
1049 | else |
fde52b5c |
1050 | oentry = &HeNEXT(entry); |
79072805 |
1051 | } |
72311751 |
1052 | if (!*aep) /* everything moved */ |
79072805 |
1053 | xhv->xhv_fill--; |
1054 | } |
1055 | } |
1056 | |
72940dca |
1057 | void |
864dbfa3 |
1058 | Perl_hv_ksplit(pTHX_ HV *hv, IV newmax) |
72940dca |
1059 | { |
1060 | register XPVHV* xhv = (XPVHV*)SvANY(hv); |
1061 | I32 oldsize = (I32) xhv->xhv_max + 1; /* sic(k) */ |
1062 | register I32 newsize; |
1063 | register I32 i; |
1064 | register I32 j; |
72311751 |
1065 | register char *a; |
1066 | register HE **aep; |
72940dca |
1067 | register HE *entry; |
1068 | register HE **oentry; |
1069 | |
1070 | newsize = (I32) newmax; /* possible truncation here */ |
1071 | if (newsize != newmax || newmax <= oldsize) |
1072 | return; |
1073 | while ((newsize & (1 + ~newsize)) != newsize) { |
1074 | newsize &= ~(newsize & (1 + ~newsize)); /* get proper power of 2 */ |
1075 | } |
1076 | if (newsize < newmax) |
1077 | newsize *= 2; |
1078 | if (newsize < newmax) |
1079 | return; /* overflow detection */ |
1080 | |
72311751 |
1081 | a = xhv->xhv_array; |
72940dca |
1082 | if (a) { |
3280af22 |
1083 | PL_nomemok = TRUE; |
8d6dde3e |
1084 | #if defined(STRANGE_MALLOC) || defined(MYMALLOC) |
d18c6117 |
1085 | Renew(a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char); |
422a93e5 |
1086 | if (!a) { |
4a33f861 |
1087 | PL_nomemok = FALSE; |
422a93e5 |
1088 | return; |
1089 | } |
72940dca |
1090 | #else |
d18c6117 |
1091 | New(2, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char); |
422a93e5 |
1092 | if (!a) { |
3280af22 |
1093 | PL_nomemok = FALSE; |
422a93e5 |
1094 | return; |
1095 | } |
72311751 |
1096 | Copy(xhv->xhv_array, a, oldsize * sizeof(HE*), char); |
fba3b22e |
1097 | if (oldsize >= 64) { |
d18c6117 |
1098 | offer_nice_chunk(xhv->xhv_array, PERL_HV_ARRAY_ALLOC_BYTES(oldsize)); |
72940dca |
1099 | } |
1100 | else |
1101 | Safefree(xhv->xhv_array); |
1102 | #endif |
3280af22 |
1103 | PL_nomemok = FALSE; |
72311751 |
1104 | Zero(&a[oldsize * sizeof(HE*)], (newsize-oldsize) * sizeof(HE*), char); /* zero 2nd half*/ |
72940dca |
1105 | } |
1106 | else { |
d18c6117 |
1107 | Newz(0, a, PERL_HV_ARRAY_ALLOC_BYTES(newsize), char); |
72940dca |
1108 | } |
1109 | xhv->xhv_max = --newsize; |
72311751 |
1110 | xhv->xhv_array = a; |
72940dca |
1111 | if (!xhv->xhv_fill) /* skip rest if no entries */ |
1112 | return; |
1113 | |
72311751 |
1114 | aep = (HE**)a; |
1115 | for (i=0; i<oldsize; i++,aep++) { |
1116 | if (!*aep) /* non-existent */ |
72940dca |
1117 | continue; |
72311751 |
1118 | for (oentry = aep, entry = *aep; entry; entry = *oentry) { |
72940dca |
1119 | if ((j = (HeHASH(entry) & newsize)) != i) { |
1120 | j -= i; |
1121 | *oentry = HeNEXT(entry); |
72311751 |
1122 | if (!(HeNEXT(entry) = aep[j])) |
72940dca |
1123 | xhv->xhv_fill++; |
72311751 |
1124 | aep[j] = entry; |
72940dca |
1125 | continue; |
1126 | } |
1127 | else |
1128 | oentry = &HeNEXT(entry); |
1129 | } |
72311751 |
1130 | if (!*aep) /* everything moved */ |
72940dca |
1131 | xhv->xhv_fill--; |
1132 | } |
1133 | } |
1134 | |
954c1994 |
1135 | /* |
1136 | =for apidoc newHV |
1137 | |
1138 | Creates a new HV. The reference count is set to 1. |
1139 | |
1140 | =cut |
1141 | */ |
1142 | |
79072805 |
1143 | HV * |
864dbfa3 |
1144 | Perl_newHV(pTHX) |
79072805 |
1145 | { |
1146 | register HV *hv; |
1147 | register XPVHV* xhv; |
1148 | |
a0d0e21e |
1149 | hv = (HV*)NEWSV(502,0); |
1150 | sv_upgrade((SV *)hv, SVt_PVHV); |
79072805 |
1151 | xhv = (XPVHV*)SvANY(hv); |
1152 | SvPOK_off(hv); |
1153 | SvNOK_off(hv); |
1c846c1f |
1154 | #ifndef NODEFAULT_SHAREKEYS |
fde52b5c |
1155 | HvSHAREKEYS_on(hv); /* key-sharing on by default */ |
1c846c1f |
1156 | #endif |
463ee0b2 |
1157 | xhv->xhv_max = 7; /* start with 8 buckets */ |
79072805 |
1158 | xhv->xhv_fill = 0; |
1159 | xhv->xhv_pmroot = 0; |
79072805 |
1160 | (void)hv_iterinit(hv); /* so each() will start off right */ |
1161 | return hv; |
1162 | } |
1163 | |
b3ac6de7 |
1164 | HV * |
864dbfa3 |
1165 | Perl_newHVhv(pTHX_ HV *ohv) |
b3ac6de7 |
1166 | { |
1167 | register HV *hv; |
b3ac6de7 |
1168 | STRLEN hv_max = ohv ? HvMAX(ohv) : 0; |
1169 | STRLEN hv_fill = ohv ? HvFILL(ohv) : 0; |
1170 | |
1171 | hv = newHV(); |
1172 | while (hv_max && hv_max + 1 >= hv_fill * 2) |
1173 | hv_max = hv_max / 2; /* Is always 2^n-1 */ |
4a76a316 |
1174 | HvMAX(hv) = hv_max; |
b3ac6de7 |
1175 | if (!hv_fill) |
1176 | return hv; |
1177 | |
1178 | #if 0 |
33c27489 |
1179 | if (! SvTIED_mg((SV*)ohv, 'P')) { |
b3ac6de7 |
1180 | /* Quick way ???*/ |
1c846c1f |
1181 | } |
1182 | else |
b3ac6de7 |
1183 | #endif |
1184 | { |
1185 | HE *entry; |
1186 | I32 hv_riter = HvRITER(ohv); /* current root of iterator */ |
1187 | HE *hv_eiter = HvEITER(ohv); /* current entry of iterator */ |
1188 | |
1189 | /* Slow way */ |
4a76a316 |
1190 | hv_iterinit(ohv); |
155aba94 |
1191 | while ((entry = hv_iternext(ohv))) { |
c3654f1a |
1192 | hv_store(hv, HeKEY(entry), HeKLEN_UTF8(entry), |
00122d59 |
1193 | newSVsv(HeVAL(entry)), HeHASH(entry)); |
b3ac6de7 |
1194 | } |
1195 | HvRITER(ohv) = hv_riter; |
1196 | HvEITER(ohv) = hv_eiter; |
1197 | } |
1c846c1f |
1198 | |
b3ac6de7 |
1199 | return hv; |
1200 | } |
1201 | |
79072805 |
1202 | void |
864dbfa3 |
1203 | Perl_hv_free_ent(pTHX_ HV *hv, register HE *entry) |
79072805 |
1204 | { |
16bdeea2 |
1205 | SV *val; |
1206 | |
68dc0745 |
1207 | if (!entry) |
79072805 |
1208 | return; |
16bdeea2 |
1209 | val = HeVAL(entry); |
257c9e5b |
1210 | if (val && isGV(val) && GvCVu(val) && HvNAME(hv)) |
3280af22 |
1211 | PL_sub_generation++; /* may be deletion of method from stash */ |
16bdeea2 |
1212 | SvREFCNT_dec(val); |
68dc0745 |
1213 | if (HeKLEN(entry) == HEf_SVKEY) { |
1214 | SvREFCNT_dec(HeKEY_sv(entry)); |
1215 | Safefree(HeKEY_hek(entry)); |
44a8e56a |
1216 | } |
1217 | else if (HvSHAREKEYS(hv)) |
68dc0745 |
1218 | unshare_hek(HeKEY_hek(entry)); |
fde52b5c |
1219 | else |
68dc0745 |
1220 | Safefree(HeKEY_hek(entry)); |
d33b2eba |
1221 | del_HE(entry); |
79072805 |
1222 | } |
1223 | |
1224 | void |
864dbfa3 |
1225 | Perl_hv_delayfree_ent(pTHX_ HV *hv, register HE *entry) |
79072805 |
1226 | { |
68dc0745 |
1227 | if (!entry) |
79072805 |
1228 | return; |
68dc0745 |
1229 | if (isGV(HeVAL(entry)) && GvCVu(HeVAL(entry)) && HvNAME(hv)) |
3280af22 |
1230 | PL_sub_generation++; /* may be deletion of method from stash */ |
68dc0745 |
1231 | sv_2mortal(HeVAL(entry)); /* free between statements */ |
1232 | if (HeKLEN(entry) == HEf_SVKEY) { |
1233 | sv_2mortal(HeKEY_sv(entry)); |
1234 | Safefree(HeKEY_hek(entry)); |
44a8e56a |
1235 | } |
1236 | else if (HvSHAREKEYS(hv)) |
68dc0745 |
1237 | unshare_hek(HeKEY_hek(entry)); |
fde52b5c |
1238 | else |
68dc0745 |
1239 | Safefree(HeKEY_hek(entry)); |
d33b2eba |
1240 | del_HE(entry); |
79072805 |
1241 | } |
1242 | |
954c1994 |
1243 | /* |
1244 | =for apidoc hv_clear |
1245 | |
1246 | Clears a hash, making it empty. |
1247 | |
1248 | =cut |
1249 | */ |
1250 | |
79072805 |
1251 | void |
864dbfa3 |
1252 | Perl_hv_clear(pTHX_ HV *hv) |
79072805 |
1253 | { |
1254 | register XPVHV* xhv; |
1255 | if (!hv) |
1256 | return; |
1257 | xhv = (XPVHV*)SvANY(hv); |
463ee0b2 |
1258 | hfreeentries(hv); |
79072805 |
1259 | xhv->xhv_fill = 0; |
a0d0e21e |
1260 | xhv->xhv_keys = 0; |
79072805 |
1261 | if (xhv->xhv_array) |
463ee0b2 |
1262 | (void)memzero(xhv->xhv_array, (xhv->xhv_max + 1) * sizeof(HE*)); |
a0d0e21e |
1263 | |
1264 | if (SvRMAGICAL(hv)) |
1c846c1f |
1265 | mg_clear((SV*)hv); |
79072805 |
1266 | } |
1267 | |
76e3520e |
1268 | STATIC void |
cea2e8a9 |
1269 | S_hfreeentries(pTHX_ HV *hv) |
79072805 |
1270 | { |
a0d0e21e |
1271 | register HE **array; |
68dc0745 |
1272 | register HE *entry; |
1273 | register HE *oentry = Null(HE*); |
a0d0e21e |
1274 | I32 riter; |
1275 | I32 max; |
79072805 |
1276 | |
1277 | if (!hv) |
1278 | return; |
a0d0e21e |
1279 | if (!HvARRAY(hv)) |
79072805 |
1280 | return; |
a0d0e21e |
1281 | |
1282 | riter = 0; |
1283 | max = HvMAX(hv); |
1284 | array = HvARRAY(hv); |
68dc0745 |
1285 | entry = array[0]; |
a0d0e21e |
1286 | for (;;) { |
68dc0745 |
1287 | if (entry) { |
1288 | oentry = entry; |
1289 | entry = HeNEXT(entry); |
1290 | hv_free_ent(hv, oentry); |
a0d0e21e |
1291 | } |
68dc0745 |
1292 | if (!entry) { |
a0d0e21e |
1293 | if (++riter > max) |
1294 | break; |
68dc0745 |
1295 | entry = array[riter]; |
1c846c1f |
1296 | } |
79072805 |
1297 | } |
a0d0e21e |
1298 | (void)hv_iterinit(hv); |
79072805 |
1299 | } |
1300 | |
954c1994 |
1301 | /* |
1302 | =for apidoc hv_undef |
1303 | |
1304 | Undefines the hash. |
1305 | |
1306 | =cut |
1307 | */ |
1308 | |
79072805 |
1309 | void |
864dbfa3 |
1310 | Perl_hv_undef(pTHX_ HV *hv) |
79072805 |
1311 | { |
1312 | register XPVHV* xhv; |
1313 | if (!hv) |
1314 | return; |
1315 | xhv = (XPVHV*)SvANY(hv); |
463ee0b2 |
1316 | hfreeentries(hv); |
9b3a60d0 |
1317 | Safefree(xhv->xhv_array); |
85e6fe83 |
1318 | if (HvNAME(hv)) { |
1319 | Safefree(HvNAME(hv)); |
1320 | HvNAME(hv) = 0; |
1321 | } |
79072805 |
1322 | xhv->xhv_array = 0; |
aa689395 |
1323 | xhv->xhv_max = 7; /* it's a normal hash */ |
79072805 |
1324 | xhv->xhv_fill = 0; |
a0d0e21e |
1325 | xhv->xhv_keys = 0; |
1326 | |
1327 | if (SvRMAGICAL(hv)) |
1c846c1f |
1328 | mg_clear((SV*)hv); |
79072805 |
1329 | } |
1330 | |
954c1994 |
1331 | /* |
1332 | =for apidoc hv_iterinit |
1333 | |
1334 | Prepares a starting point to traverse a hash table. Returns the number of |
1335 | keys in the hash (i.e. the same as C<HvKEYS(tb)>). The return value is |
1c846c1f |
1336 | currently only meaningful for hashes without tie magic. |
954c1994 |
1337 | |
1338 | NOTE: Before version 5.004_65, C<hv_iterinit> used to return the number of |
1339 | hash buckets that happen to be in use. If you still need that esoteric |
1340 | value, you can get it through the macro C<HvFILL(tb)>. |
1341 | |
1342 | =cut |
1343 | */ |
1344 | |
79072805 |
1345 | I32 |
864dbfa3 |
1346 | Perl_hv_iterinit(pTHX_ HV *hv) |
79072805 |
1347 | { |
aa689395 |
1348 | register XPVHV* xhv; |
1349 | HE *entry; |
1350 | |
1351 | if (!hv) |
cea2e8a9 |
1352 | Perl_croak(aTHX_ "Bad hash"); |
aa689395 |
1353 | xhv = (XPVHV*)SvANY(hv); |
1354 | entry = xhv->xhv_eiter; |
72940dca |
1355 | if (entry && HvLAZYDEL(hv)) { /* was deleted earlier? */ |
1356 | HvLAZYDEL_off(hv); |
68dc0745 |
1357 | hv_free_ent(hv, entry); |
72940dca |
1358 | } |
79072805 |
1359 | xhv->xhv_riter = -1; |
1360 | xhv->xhv_eiter = Null(HE*); |
c6601927 |
1361 | return xhv->xhv_keys; /* used to be xhv->xhv_fill before 5.004_65 */ |
79072805 |
1362 | } |
1363 | |
954c1994 |
1364 | /* |
1365 | =for apidoc hv_iternext |
1366 | |
1367 | Returns entries from a hash iterator. See C<hv_iterinit>. |
1368 | |
1369 | =cut |
1370 | */ |
1371 | |
79072805 |
1372 | HE * |
864dbfa3 |
1373 | Perl_hv_iternext(pTHX_ HV *hv) |
79072805 |
1374 | { |
1375 | register XPVHV* xhv; |
1376 | register HE *entry; |
a0d0e21e |
1377 | HE *oldentry; |
463ee0b2 |
1378 | MAGIC* mg; |
79072805 |
1379 | |
1380 | if (!hv) |
cea2e8a9 |
1381 | Perl_croak(aTHX_ "Bad hash"); |
79072805 |
1382 | xhv = (XPVHV*)SvANY(hv); |
a0d0e21e |
1383 | oldentry = entry = xhv->xhv_eiter; |
463ee0b2 |
1384 | |
155aba94 |
1385 | if ((mg = SvTIED_mg((SV*)hv, 'P'))) { |
8990e307 |
1386 | SV *key = sv_newmortal(); |
cd1469e6 |
1387 | if (entry) { |
fde52b5c |
1388 | sv_setsv(key, HeSVKEY_force(entry)); |
cd1469e6 |
1389 | SvREFCNT_dec(HeSVKEY(entry)); /* get rid of previous key */ |
1390 | } |
a0d0e21e |
1391 | else { |
ff68c719 |
1392 | char *k; |
bbce6d69 |
1393 | HEK *hek; |
ff68c719 |
1394 | |
d33b2eba |
1395 | xhv->xhv_eiter = entry = new_HE(); /* one HE per MAGICAL hash */ |
4633a7c4 |
1396 | Zero(entry, 1, HE); |
ff68c719 |
1397 | Newz(54, k, HEK_BASESIZE + sizeof(SV*), char); |
1398 | hek = (HEK*)k; |
1399 | HeKEY_hek(entry) = hek; |
fde52b5c |
1400 | HeKLEN(entry) = HEf_SVKEY; |
a0d0e21e |
1401 | } |
1402 | magic_nextpack((SV*) hv,mg,key); |
463ee0b2 |
1403 | if (SvOK(key)) { |
cd1469e6 |
1404 | /* force key to stay around until next time */ |
bbce6d69 |
1405 | HeSVKEY_set(entry, SvREFCNT_inc(key)); |
1406 | return entry; /* beware, hent_val is not set */ |
463ee0b2 |
1407 | } |
fde52b5c |
1408 | if (HeVAL(entry)) |
1409 | SvREFCNT_dec(HeVAL(entry)); |
ff68c719 |
1410 | Safefree(HeKEY_hek(entry)); |
d33b2eba |
1411 | del_HE(entry); |
463ee0b2 |
1412 | xhv->xhv_eiter = Null(HE*); |
1413 | return Null(HE*); |
79072805 |
1414 | } |
f675dbe5 |
1415 | #ifdef DYNAMIC_ENV_FETCH /* set up %ENV for iteration */ |
1416 | if (!entry && HvNAME(hv) && strEQ(HvNAME(hv), ENV_HV_NAME)) |
1417 | prime_env_iter(); |
1418 | #endif |
463ee0b2 |
1419 | |
79072805 |
1420 | if (!xhv->xhv_array) |
d18c6117 |
1421 | Newz(506, xhv->xhv_array, |
1422 | PERL_HV_ARRAY_ALLOC_BYTES(xhv->xhv_max + 1), char); |
fde52b5c |
1423 | if (entry) |
1424 | entry = HeNEXT(entry); |
1425 | while (!entry) { |
1426 | ++xhv->xhv_riter; |
1427 | if (xhv->xhv_riter > xhv->xhv_max) { |
1428 | xhv->xhv_riter = -1; |
1429 | break; |
79072805 |
1430 | } |
fde52b5c |
1431 | entry = ((HE**)xhv->xhv_array)[xhv->xhv_riter]; |
1432 | } |
79072805 |
1433 | |
72940dca |
1434 | if (oldentry && HvLAZYDEL(hv)) { /* was deleted earlier? */ |
1435 | HvLAZYDEL_off(hv); |
68dc0745 |
1436 | hv_free_ent(hv, oldentry); |
72940dca |
1437 | } |
a0d0e21e |
1438 | |
79072805 |
1439 | xhv->xhv_eiter = entry; |
1440 | return entry; |
1441 | } |
1442 | |
954c1994 |
1443 | /* |
1444 | =for apidoc hv_iterkey |
1445 | |
1446 | Returns the key from the current position of the hash iterator. See |
1447 | C<hv_iterinit>. |
1448 | |
1449 | =cut |
1450 | */ |
1451 | |
79072805 |
1452 | char * |
864dbfa3 |
1453 | Perl_hv_iterkey(pTHX_ register HE *entry, I32 *retlen) |
79072805 |
1454 | { |
fde52b5c |
1455 | if (HeKLEN(entry) == HEf_SVKEY) { |
fb73857a |
1456 | STRLEN len; |
1457 | char *p = SvPV(HeKEY_sv(entry), len); |
1458 | *retlen = len; |
1459 | return p; |
fde52b5c |
1460 | } |
1461 | else { |
1462 | *retlen = HeKLEN(entry); |
1463 | return HeKEY(entry); |
1464 | } |
1465 | } |
1466 | |
1467 | /* unlike hv_iterval(), this always returns a mortal copy of the key */ |
954c1994 |
1468 | /* |
1469 | =for apidoc hv_iterkeysv |
1470 | |
1471 | Returns the key as an C<SV*> from the current position of the hash |
1472 | iterator. The return value will always be a mortal copy of the key. Also |
1473 | see C<hv_iterinit>. |
1474 | |
1475 | =cut |
1476 | */ |
1477 | |
fde52b5c |
1478 | SV * |
864dbfa3 |
1479 | Perl_hv_iterkeysv(pTHX_ register HE *entry) |
fde52b5c |
1480 | { |
1481 | if (HeKLEN(entry) == HEf_SVKEY) |
bbce6d69 |
1482 | return sv_mortalcopy(HeKEY_sv(entry)); |
c3654f1a |
1483 | else |
1484 | return sv_2mortal(newSVpvn_share((HeKLEN(entry) ? HeKEY(entry) : ""), |
1485 | HeKLEN_UTF8(entry), HeHASH(entry))); |
79072805 |
1486 | } |
1487 | |
954c1994 |
1488 | /* |
1489 | =for apidoc hv_iterval |
1490 | |
1491 | Returns the value from the current position of the hash iterator. See |
1492 | C<hv_iterkey>. |
1493 | |
1494 | =cut |
1495 | */ |
1496 | |
79072805 |
1497 | SV * |
864dbfa3 |
1498 | Perl_hv_iterval(pTHX_ HV *hv, register HE *entry) |
79072805 |
1499 | { |
8990e307 |
1500 | if (SvRMAGICAL(hv)) { |
463ee0b2 |
1501 | if (mg_find((SV*)hv,'P')) { |
8990e307 |
1502 | SV* sv = sv_newmortal(); |
bbce6d69 |
1503 | if (HeKLEN(entry) == HEf_SVKEY) |
1504 | mg_copy((SV*)hv, sv, (char*)HeKEY_sv(entry), HEf_SVKEY); |
1505 | else mg_copy((SV*)hv, sv, HeKEY(entry), HeKLEN(entry)); |
463ee0b2 |
1506 | return sv; |
1507 | } |
79072805 |
1508 | } |
fde52b5c |
1509 | return HeVAL(entry); |
79072805 |
1510 | } |
1511 | |
954c1994 |
1512 | /* |
1513 | =for apidoc hv_iternextsv |
1514 | |
1515 | Performs an C<hv_iternext>, C<hv_iterkey>, and C<hv_iterval> in one |
1516 | operation. |
1517 | |
1518 | =cut |
1519 | */ |
1520 | |
a0d0e21e |
1521 | SV * |
864dbfa3 |
1522 | Perl_hv_iternextsv(pTHX_ HV *hv, char **key, I32 *retlen) |
a0d0e21e |
1523 | { |
1524 | HE *he; |
1525 | if ( (he = hv_iternext(hv)) == NULL) |
1526 | return NULL; |
1527 | *key = hv_iterkey(he, retlen); |
1528 | return hv_iterval(hv, he); |
1529 | } |
1530 | |
954c1994 |
1531 | /* |
1532 | =for apidoc hv_magic |
1533 | |
1534 | Adds magic to a hash. See C<sv_magic>. |
1535 | |
1536 | =cut |
1537 | */ |
1538 | |
79072805 |
1539 | void |
864dbfa3 |
1540 | Perl_hv_magic(pTHX_ HV *hv, GV *gv, int how) |
79072805 |
1541 | { |
a0d0e21e |
1542 | sv_magic((SV*)hv, (SV*)gv, how, Nullch, 0); |
79072805 |
1543 | } |
fde52b5c |
1544 | |
bbce6d69 |
1545 | char* |
864dbfa3 |
1546 | Perl_sharepvn(pTHX_ const char *sv, I32 len, U32 hash) |
bbce6d69 |
1547 | { |
ff68c719 |
1548 | return HEK_KEY(share_hek(sv, len, hash)); |
bbce6d69 |
1549 | } |
1550 | |
1551 | /* possibly free a shared string if no one has access to it |
fde52b5c |
1552 | * len and hash must both be valid for str. |
1553 | */ |
bbce6d69 |
1554 | void |
864dbfa3 |
1555 | Perl_unsharepvn(pTHX_ const char *str, I32 len, U32 hash) |
fde52b5c |
1556 | { |
1557 | register XPVHV* xhv; |
1558 | register HE *entry; |
1559 | register HE **oentry; |
1560 | register I32 i = 1; |
1561 | I32 found = 0; |
c3654f1a |
1562 | bool is_utf8 = FALSE; |
f9a63242 |
1563 | const char *save = str; |
c3654f1a |
1564 | |
1565 | if (len < 0) { |
1566 | len = -len; |
1567 | is_utf8 = TRUE; |
75a54232 |
1568 | if (!(PL_hints & HINT_UTF8_DISTINCT)) { |
1569 | STRLEN tmplen = len; |
1570 | /* See the note in hv_fetch(). --jhi */ |
1571 | str = (char*)bytes_from_utf8((U8*)str, &tmplen, &is_utf8); |
1572 | len = tmplen; |
1573 | } |
c3654f1a |
1574 | } |
1c846c1f |
1575 | |
fde52b5c |
1576 | /* what follows is the moral equivalent of: |
6b88bc9c |
1577 | if ((Svp = hv_fetch(PL_strtab, tmpsv, FALSE, hash))) { |
bbce6d69 |
1578 | if (--*Svp == Nullsv) |
6b88bc9c |
1579 | hv_delete(PL_strtab, str, len, G_DISCARD, hash); |
bbce6d69 |
1580 | } */ |
3280af22 |
1581 | xhv = (XPVHV*)SvANY(PL_strtab); |
fde52b5c |
1582 | /* assert(xhv_array != 0) */ |
5f08fbcd |
1583 | LOCK_STRTAB_MUTEX; |
fde52b5c |
1584 | oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; |
bbce6d69 |
1585 | for (entry = *oentry; entry; i=0, oentry = &HeNEXT(entry), entry = *oentry) { |
fde52b5c |
1586 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
1587 | continue; |
1588 | if (HeKLEN(entry) != len) |
1589 | continue; |
1c846c1f |
1590 | if (HeKEY(entry) != str && memNE(HeKEY(entry),str,len)) /* is this it? */ |
fde52b5c |
1591 | continue; |
c3654f1a |
1592 | if (HeKUTF8(entry) != (char)is_utf8) |
1593 | continue; |
fde52b5c |
1594 | found = 1; |
bbce6d69 |
1595 | if (--HeVAL(entry) == Nullsv) { |
1596 | *oentry = HeNEXT(entry); |
1597 | if (i && !*oentry) |
1598 | xhv->xhv_fill--; |
ff68c719 |
1599 | Safefree(HeKEY_hek(entry)); |
d33b2eba |
1600 | del_HE(entry); |
bbce6d69 |
1601 | --xhv->xhv_keys; |
fde52b5c |
1602 | } |
bbce6d69 |
1603 | break; |
fde52b5c |
1604 | } |
333f433b |
1605 | UNLOCK_STRTAB_MUTEX; |
f9a63242 |
1606 | if (str != save) |
1607 | Safefree(str); |
411caa50 |
1608 | if (!found && ckWARN_d(WARN_INTERNAL)) |
1609 | Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free non-existent shared string '%s'",str); |
fde52b5c |
1610 | } |
1611 | |
bbce6d69 |
1612 | /* get a (constant) string ptr from the global string table |
1613 | * string will get added if it is not already there. |
fde52b5c |
1614 | * len and hash must both be valid for str. |
1615 | */ |
bbce6d69 |
1616 | HEK * |
864dbfa3 |
1617 | Perl_share_hek(pTHX_ const char *str, I32 len, register U32 hash) |
fde52b5c |
1618 | { |
1619 | register XPVHV* xhv; |
1620 | register HE *entry; |
1621 | register HE **oentry; |
1622 | register I32 i = 1; |
1623 | I32 found = 0; |
da58a35d |
1624 | bool is_utf8 = FALSE; |
f9a63242 |
1625 | const char *save = str; |
da58a35d |
1626 | |
1627 | if (len < 0) { |
1628 | len = -len; |
1629 | is_utf8 = TRUE; |
75a54232 |
1630 | if (!(PL_hints & HINT_UTF8_DISTINCT)) { |
1631 | STRLEN tmplen = len; |
1632 | /* See the note in hv_fetch(). --jhi */ |
1633 | str = (char*)bytes_from_utf8((U8*)str, &tmplen, &is_utf8); |
1634 | len = tmplen; |
1635 | } |
da58a35d |
1636 | } |
bbce6d69 |
1637 | |
fde52b5c |
1638 | /* what follows is the moral equivalent of: |
1c846c1f |
1639 | |
6b88bc9c |
1640 | if (!(Svp = hv_fetch(PL_strtab, str, len, FALSE))) |
1641 | hv_store(PL_strtab, str, len, Nullsv, hash); |
bbce6d69 |
1642 | */ |
3280af22 |
1643 | xhv = (XPVHV*)SvANY(PL_strtab); |
fde52b5c |
1644 | /* assert(xhv_array != 0) */ |
5f08fbcd |
1645 | LOCK_STRTAB_MUTEX; |
fde52b5c |
1646 | oentry = &((HE**)xhv->xhv_array)[hash & (I32) xhv->xhv_max]; |
bbce6d69 |
1647 | for (entry = *oentry; entry; i=0, entry = HeNEXT(entry)) { |
fde52b5c |
1648 | if (HeHASH(entry) != hash) /* strings can't be equal */ |
1649 | continue; |
1650 | if (HeKLEN(entry) != len) |
1651 | continue; |
1c846c1f |
1652 | if (HeKEY(entry) != str && memNE(HeKEY(entry),str,len)) /* is this it? */ |
fde52b5c |
1653 | continue; |
c3654f1a |
1654 | if (HeKUTF8(entry) != (char)is_utf8) |
1655 | continue; |
fde52b5c |
1656 | found = 1; |
fde52b5c |
1657 | break; |
1658 | } |
bbce6d69 |
1659 | if (!found) { |
d33b2eba |
1660 | entry = new_HE(); |
c3654f1a |
1661 | HeKEY_hek(entry) = save_hek(str, is_utf8?-len:len, hash); |
bbce6d69 |
1662 | HeVAL(entry) = Nullsv; |
1663 | HeNEXT(entry) = *oentry; |
1664 | *oentry = entry; |
1665 | xhv->xhv_keys++; |
1666 | if (i) { /* initial entry? */ |
1667 | ++xhv->xhv_fill; |
1668 | if (xhv->xhv_keys > xhv->xhv_max) |
3280af22 |
1669 | hsplit(PL_strtab); |
bbce6d69 |
1670 | } |
1671 | } |
1672 | |
1673 | ++HeVAL(entry); /* use value slot as REFCNT */ |
5f08fbcd |
1674 | UNLOCK_STRTAB_MUTEX; |
f9a63242 |
1675 | if (str != save) |
1676 | Safefree(str); |
ff68c719 |
1677 | return HeKEY_hek(entry); |
fde52b5c |
1678 | } |