Commit | Line | Data |
---|---|---|
8b371338 | 1 | /* mro_core.c |
e1a479c5 BB |
2 | * |
3 | * Copyright (c) 2007 Brandon L Black | |
2eee27d7 | 4 | * Copyright (c) 2007, 2008, 2009, 2010, 2011 Larry Wall and others |
e1a479c5 BB |
5 | * |
6 | * You may distribute under the terms of either the GNU General Public | |
7 | * License or the Artistic License, as specified in the README file. | |
8 | * | |
8b371338 KW |
9 | * This was 'mro.c', but changed because there is another mro.c in /ext, and |
10 | * the os390 loader can't cope with this situation (which involves the two | |
11 | * files calling functions defined in the other) | |
e1a479c5 BB |
12 | */ |
13 | ||
14 | /* | |
4ac71550 TC |
15 | * 'Which order shall we go in?' said Frodo. 'Eldest first, or quickest first? |
16 | * You'll be last either way, Master Peregrin.' | |
17 | * | |
18 | * [p.101 of _The Lord of the Rings_, I/iii: "A Conspiracy Unmasked"] | |
cac98860 RGS |
19 | */ |
20 | ||
21 | /* | |
51b56f5c | 22 | =head1 MRO |
e1a479c5 | 23 | These functions are related to the method resolution order of perl classes |
6a6f8717 | 24 | Also see L<perlmroapi>. |
e1a479c5 BB |
25 | |
26 | =cut | |
27 | */ | |
28 | ||
29 | #include "EXTERN.h" | |
4befac30 | 30 | #define PERL_IN_MRO_C |
e1a479c5 BB |
31 | #include "perl.h" |
32 | ||
a3e6e81e NC |
33 | static const struct mro_alg dfs_alg = |
34 | {S_mro_get_linear_isa_dfs, "dfs", 3, 0, 0}; | |
3d76853f | 35 | |
fa60396f NC |
36 | SV * |
37 | Perl_mro_get_private_data(pTHX_ struct mro_meta *const smeta, | |
1604cfb0 | 38 | const struct mro_alg *const which) |
fa60396f NC |
39 | { |
40 | SV **data; | |
41 | PERL_ARGS_ASSERT_MRO_GET_PRIVATE_DATA; | |
42 | ||
5844ac76 | 43 | data = (SV **)Perl_hv_common(aTHX_ smeta->mro_linear_all, NULL, |
1604cfb0 MS |
44 | which->name, which->length, which->kflags, |
45 | HV_FETCH_JUST_SV, NULL, which->hash); | |
fa60396f | 46 | if (!data) |
1604cfb0 | 47 | return NULL; |
fa60396f NC |
48 | |
49 | /* If we've been asked to look up the private data for the current MRO, then | |
50 | cache it. */ | |
51 | if (smeta->mro_which == which) | |
1604cfb0 | 52 | smeta->mro_linear_current = *data; |
fa60396f NC |
53 | |
54 | return *data; | |
55 | } | |
56 | ||
57 | SV * | |
58 | Perl_mro_set_private_data(pTHX_ struct mro_meta *const smeta, | |
1604cfb0 | 59 | const struct mro_alg *const which, SV *const data) |
fa60396f NC |
60 | { |
61 | PERL_ARGS_ASSERT_MRO_SET_PRIVATE_DATA; | |
62 | ||
9953ff72 | 63 | if (!smeta->mro_linear_all) { |
1604cfb0 MS |
64 | if (smeta->mro_which == which) { |
65 | /* If all we need to store is the current MRO's data, then don't use | |
66 | memory on a hash with 1 element - store it direct, and signal | |
67 | this by leaving the would-be-hash NULL. */ | |
68 | smeta->mro_linear_current = data; | |
69 | return data; | |
70 | } else { | |
71 | HV *const hv = newHV(); | |
72 | /* Start with 2 buckets. It's unlikely we'll need more. */ | |
73 | HvMAX(hv) = 1; | |
74 | smeta->mro_linear_all = hv; | |
75 | ||
76 | if (smeta->mro_linear_current) { | |
77 | /* If we were storing something directly, put it in the hash | |
78 | before we lose it. */ | |
79 | Perl_mro_set_private_data(aTHX_ smeta, smeta->mro_which, | |
80 | smeta->mro_linear_current); | |
81 | } | |
82 | } | |
553e831a NC |
83 | } |
84 | ||
85 | /* We get here if we're storing more than one linearisation for this stash, | |
86 | or the linearisation we are storing is not that if its current MRO. */ | |
87 | ||
88 | if (smeta->mro_which == which) { | |
1604cfb0 MS |
89 | /* If we've been asked to store the private data for the current MRO, |
90 | then cache it. */ | |
91 | smeta->mro_linear_current = data; | |
fa60396f NC |
92 | } |
93 | ||
9953ff72 | 94 | if (!Perl_hv_common(aTHX_ smeta->mro_linear_all, NULL, |
1604cfb0 MS |
95 | which->name, which->length, which->kflags, |
96 | HV_FETCH_ISSTORE, data, which->hash)) { | |
97 | Perl_croak(aTHX_ "panic: hv_store() failed in set_mro_private_data() " | |
98 | "for '%.*s' %d", (int) which->length, which->name, | |
99 | which->kflags); | |
fa60396f NC |
100 | } |
101 | ||
102 | return data; | |
103 | } | |
104 | ||
a3e6e81e NC |
105 | const struct mro_alg * |
106 | Perl_mro_get_from_name(pTHX_ SV *name) { | |
107 | SV **data; | |
108 | ||
109 | PERL_ARGS_ASSERT_MRO_GET_FROM_NAME; | |
110 | ||
5844ac76 | 111 | data = (SV **)Perl_hv_common(aTHX_ PL_registered_mros, name, NULL, 0, 0, |
1604cfb0 | 112 | HV_FETCH_JUST_SV, NULL, 0); |
a3e6e81e | 113 | if (!data) |
1604cfb0 | 114 | return NULL; |
a3e6e81e NC |
115 | assert(SvTYPE(*data) == SVt_IV); |
116 | assert(SvIOK(*data)); | |
117 | return INT2PTR(const struct mro_alg *, SvUVX(*data)); | |
118 | } | |
119 | ||
c145ee24 FC |
120 | /* |
121 | =for apidoc mro_register | |
6a6f8717 KW |
122 | Registers a custom mro plugin. See L<perlmroapi> for details on this and other |
123 | mro functions. | |
164df45a FC |
124 | |
125 | =cut | |
c145ee24 FC |
126 | */ |
127 | ||
a3e6e81e NC |
128 | void |
129 | Perl_mro_register(pTHX_ const struct mro_alg *mro) { | |
130 | SV *wrapper = newSVuv(PTR2UV(mro)); | |
131 | ||
132 | PERL_ARGS_ASSERT_MRO_REGISTER; | |
133 | ||
8b371338 | 134 | |
a3e6e81e | 135 | if (!Perl_hv_common(aTHX_ PL_registered_mros, NULL, |
1604cfb0 MS |
136 | mro->name, mro->length, mro->kflags, |
137 | HV_FETCH_ISSTORE, wrapper, mro->hash)) { | |
138 | SvREFCNT_dec_NN(wrapper); | |
139 | Perl_croak(aTHX_ "panic: hv_store() failed in mro_register() " | |
140 | "for '%.*s' %d", (int) mro->length, mro->name, mro->kflags); | |
3d76853f | 141 | } |
3d76853f NC |
142 | } |
143 | ||
e1a479c5 BB |
144 | struct mro_meta* |
145 | Perl_mro_meta_init(pTHX_ HV* stash) | |
146 | { | |
9fe4aecf | 147 | struct mro_meta* newmeta; |
e1a479c5 | 148 | |
7918f24d | 149 | PERL_ARGS_ASSERT_MRO_META_INIT; |
dc3bf405 | 150 | PERL_UNUSED_CONTEXT; |
e1a479c5 BB |
151 | assert(HvAUX(stash)); |
152 | assert(!(HvAUX(stash)->xhv_mro_meta)); | |
183086be | 153 | Newxz(newmeta, 1, struct mro_meta); |
9fe4aecf | 154 | HvAUX(stash)->xhv_mro_meta = newmeta; |
dd69841b | 155 | newmeta->cache_gen = 1; |
70cd14a1 | 156 | newmeta->pkg_gen = 1; |
a3e6e81e | 157 | newmeta->mro_which = &dfs_alg; |
e1a479c5 BB |
158 | |
159 | return newmeta; | |
160 | } | |
161 | ||
162 | #if defined(USE_ITHREADS) | |
163 | ||
164 | /* for sv_dup on new threads */ | |
165 | struct mro_meta* | |
166 | Perl_mro_meta_dup(pTHX_ struct mro_meta* smeta, CLONE_PARAMS* param) | |
167 | { | |
e1a479c5 BB |
168 | struct mro_meta* newmeta; |
169 | ||
7918f24d | 170 | PERL_ARGS_ASSERT_MRO_META_DUP; |
e1a479c5 | 171 | |
33e12d9d NC |
172 | Newx(newmeta, 1, struct mro_meta); |
173 | Copy(smeta, newmeta, 1, struct mro_meta); | |
174 | ||
9953ff72 | 175 | if (newmeta->mro_linear_all) { |
1604cfb0 MS |
176 | newmeta->mro_linear_all |
177 | = MUTABLE_HV(sv_dup_inc((const SV *)newmeta->mro_linear_all, param)); | |
178 | /* This is just acting as a shortcut pointer, and will be automatically | |
179 | updated on the first get. */ | |
180 | newmeta->mro_linear_current = NULL; | |
3a6fa573 | 181 | } else if (newmeta->mro_linear_current) { |
1604cfb0 MS |
182 | /* Only the current MRO is stored, so this owns the data. */ |
183 | newmeta->mro_linear_current | |
184 | = sv_dup_inc((const SV *)newmeta->mro_linear_current, param); | |
553e831a NC |
185 | } |
186 | ||
33e12d9d | 187 | if (newmeta->mro_nextmethod) |
1604cfb0 MS |
188 | newmeta->mro_nextmethod |
189 | = MUTABLE_HV(sv_dup_inc((const SV *)newmeta->mro_nextmethod, param)); | |
a49ba3fc | 190 | if (newmeta->isa) |
1604cfb0 MS |
191 | newmeta->isa |
192 | = MUTABLE_HV(sv_dup_inc((const SV *)newmeta->isa, param)); | |
e1a479c5 | 193 | |
1a33a059 FC |
194 | newmeta->super = NULL; |
195 | ||
ac3b837b TC |
196 | /* clear the destructor cache */ |
197 | newmeta->destroy = NULL; | |
198 | newmeta->destroy_gen = 0; | |
199 | ||
e1a479c5 BB |
200 | return newmeta; |
201 | } | |
202 | ||
203 | #endif /* USE_ITHREADS */ | |
204 | ||
205 | /* | |
206 | =for apidoc mro_get_linear_isa_dfs | |
207 | ||
796b6530 | 208 | Returns the Depth-First Search linearization of C<@ISA> |
e1a479c5 BB |
209 | the given stash. The return value is a read-only AV*. |
210 | C<level> should be 0 (it is used internally in this | |
211 | function's recursion). | |
212 | ||
1c908217 RGS |
213 | You are responsible for C<SvREFCNT_inc()> on the |
214 | return value if you plan to store it anywhere | |
215 | semi-permanently (otherwise it might be deleted | |
216 | out from under you the next time the cache is | |
217 | invalidated). | |
218 | ||
e1a479c5 BB |
219 | =cut |
220 | */ | |
4befac30 | 221 | static AV* |
94d1e706 | 222 | S_mro_get_linear_isa_dfs(pTHX_ HV *stash, U32 level) |
e1a479c5 BB |
223 | { |
224 | AV* retval; | |
225 | GV** gvp; | |
226 | GV* gv; | |
227 | AV* av; | |
190d0b22 | 228 | const HEK* stashhek; |
e1a479c5 | 229 | struct mro_meta* meta; |
a49ba3fc | 230 | SV *our_name; |
73519bd0 | 231 | HV *stored = NULL; |
e1a479c5 | 232 | |
7918f24d | 233 | PERL_ARGS_ASSERT_MRO_GET_LINEAR_ISA_DFS; |
e1a479c5 BB |
234 | assert(HvAUX(stash)); |
235 | ||
00169e2c | 236 | stashhek |
15d9236d | 237 | = HvAUX(stash)->xhv_name_u.xhvnameu_name && HvENAME_HEK_NN(stash) |
00169e2c FC |
238 | ? HvENAME_HEK_NN(stash) |
239 | : HvNAME_HEK(stash); | |
240 | ||
190d0b22 | 241 | if (!stashhek) |
1e05feb3 | 242 | Perl_croak(aTHX_ "Can't linearize anonymous symbol table"); |
e1a479c5 BB |
243 | |
244 | if (level > 100) | |
d0c0e7dd | 245 | Perl_croak(aTHX_ |
1604cfb0 MS |
246 | "Recursive inheritance detected in package '%" HEKf "'", |
247 | HEKfARG(stashhek)); | |
e1a479c5 BB |
248 | |
249 | meta = HvMROMETA(stash); | |
1c908217 RGS |
250 | |
251 | /* return cache if valid */ | |
a3e6e81e | 252 | if((retval = MUTABLE_AV(MRO_GET_PRIVATE_DATA(meta, &dfs_alg)))) { |
e1a479c5 BB |
253 | return retval; |
254 | } | |
255 | ||
256 | /* not in cache, make a new one */ | |
1c908217 | 257 | |
ad64d0ec | 258 | retval = MUTABLE_AV(sv_2mortal(MUTABLE_SV(newAV()))); |
a49ba3fc NC |
259 | /* We use this later in this function, but don't need a reference to it |
260 | beyond the end of this function, so reference count is fine. */ | |
261 | our_name = newSVhek(stashhek); | |
262 | av_push(retval, our_name); /* add ourselves at the top */ | |
e1a479c5 | 263 | |
1c908217 | 264 | /* fetch our @ISA */ |
e1a479c5 BB |
265 | gvp = (GV**)hv_fetchs(stash, "ISA", FALSE); |
266 | av = (gvp && (gv = *gvp) && isGV_with_GP(gv)) ? GvAV(gv) : NULL; | |
267 | ||
a49ba3fc NC |
268 | /* "stored" is used to keep track of all of the classnames we have added to |
269 | the MRO so far, so we can do a quick exists check and avoid adding | |
270 | duplicate classnames to the MRO as we go. | |
271 | It's then retained to be re-used as a fast lookup for ->isa(), by adding | |
272 | our own name and "UNIVERSAL" to it. */ | |
273 | ||
a49ba3fc | 274 | if(av && AvFILLp(av) >= 0) { |
1c908217 | 275 | |
ffd8da72 NC |
276 | SV **svp = AvARRAY(av); |
277 | I32 items = AvFILLp(av) + 1; | |
1c908217 RGS |
278 | |
279 | /* foreach(@ISA) */ | |
e1a479c5 | 280 | while (items--) { |
3df5c4b5 | 281 | SV* const sv = *svp ? *svp : &PL_sv_undef; |
e1a479c5 | 282 | HV* const basestash = gv_stashsv(sv, 0); |
1604cfb0 MS |
283 | SV *const *subrv_p; |
284 | I32 subrv_items; | |
285 | svp++; | |
e1a479c5 BB |
286 | |
287 | if (!basestash) { | |
1c908217 RGS |
288 | /* if no stash exists for this @ISA member, |
289 | simply add it to the MRO and move on */ | |
1604cfb0 MS |
290 | subrv_p = &sv; |
291 | subrv_items = 1; | |
e1a479c5 BB |
292 | } |
293 | else { | |
1c908217 | 294 | /* otherwise, recurse into ourselves for the MRO |
b1d0c68a | 295 | of this @ISA member, and append their MRO to ours. |
1604cfb0 MS |
296 | The recursive call could throw an exception, which |
297 | has memory management implications here, hence the use of | |
298 | the mortal. */ | |
299 | const AV *const subrv | |
300 | = mro_get_linear_isa_dfs(basestash, level + 1); | |
301 | ||
302 | subrv_p = AvARRAY(subrv); | |
303 | subrv_items = AvFILLp(subrv) + 1; | |
304 | } | |
305 | if (stored) { | |
306 | while(subrv_items--) { | |
307 | SV *const subsv = *subrv_p++; | |
308 | /* LVALUE fetch will create a new undefined SV if necessary | |
309 | */ | |
310 | HE *const he = hv_fetch_ent(stored, subsv, 1, 0); | |
311 | assert(he); | |
312 | if(HeVAL(he) != &PL_sv_undef) { | |
313 | /* It was newly created. Steal it for our new SV, and | |
314 | replace it in the hash with the "real" thing. */ | |
315 | SV *const val = HeVAL(he); | |
316 | HEK *const key = HeKEY_hek(he); | |
317 | ||
318 | HeVAL(he) = &PL_sv_undef; | |
319 | sv_sethek(val, key); | |
320 | av_push(retval, val); | |
321 | } | |
322 | } | |
73519bd0 | 323 | } else { |
1604cfb0 MS |
324 | /* We are the first (or only) parent. We can short cut the |
325 | complexity above, because our @ISA is simply us prepended | |
326 | to our parent's @ISA, and our ->isa cache is simply our | |
327 | parent's, with our name added. */ | |
328 | /* newSVsv() is slow. This code is only faster if we can avoid | |
329 | it by ensuring that SVs in the arrays are shared hash key | |
330 | scalar SVs, because we can "copy" them very efficiently. | |
331 | Although to be fair, we can't *ensure* this, as a reference | |
332 | to the internal array is returned by mro::get_linear_isa(), | |
333 | so we'll have to be defensive just in case someone faffed | |
334 | with it. */ | |
335 | if (basestash) { | |
336 | SV **svp; | |
337 | stored = MUTABLE_HV(sv_2mortal((SV*)newHVhv(HvMROMETA(basestash)->isa))); | |
338 | av_extend(retval, subrv_items); | |
339 | AvFILLp(retval) = subrv_items; | |
340 | svp = AvARRAY(retval); | |
341 | while(subrv_items--) { | |
342 | SV *const val = *subrv_p++; | |
343 | *++svp = SvIsCOW_shared_hash(val) | |
344 | ? newSVhek(SvSHARED_HEK_FROM_PV(SvPVX(val))) | |
345 | : newSVsv(val); | |
346 | } | |
347 | } else { | |
348 | /* They have no stash. So create ourselves an ->isa cache | |
349 | as if we'd copied it from what theirs should be. */ | |
350 | stored = MUTABLE_HV(sv_2mortal(MUTABLE_SV(newHV()))); | |
351 | (void) hv_stores(stored, "UNIVERSAL", &PL_sv_undef); | |
352 | av_push(retval, | |
353 | newSVhek(HeKEY_hek(hv_store_ent(stored, sv, | |
354 | &PL_sv_undef, 0)))); | |
355 | } | |
356 | } | |
e1a479c5 | 357 | } |
73519bd0 | 358 | } else { |
1604cfb0 MS |
359 | /* We have no parents. */ |
360 | stored = MUTABLE_HV(sv_2mortal(MUTABLE_SV(newHV()))); | |
361 | (void) hv_stores(stored, "UNIVERSAL", &PL_sv_undef); | |
e1a479c5 BB |
362 | } |
363 | ||
ed09b296 | 364 | (void) hv_store_ent(stored, our_name, &PL_sv_undef, 0); |
ed09b296 NC |
365 | |
366 | SvREFCNT_inc_simple_void_NN(stored); | |
367 | SvTEMP_off(stored); | |
368 | SvREADONLY_on(stored); | |
369 | ||
370 | meta->isa = stored; | |
371 | ||
0fd7ece8 NC |
372 | /* now that we're past the exception dangers, grab our own reference to |
373 | the AV we're about to use for the result. The reference owned by the | |
374 | mortals' stack will be released soon, so everything will balance. */ | |
375 | SvREFCNT_inc_simple_void_NN(retval); | |
376 | SvTEMP_off(retval); | |
fdef73f9 | 377 | |
1c908217 RGS |
378 | /* we don't want anyone modifying the cache entry but us, |
379 | and we do so by replacing it completely */ | |
e1a479c5 | 380 | SvREADONLY_on(retval); |
1c908217 | 381 | |
a3e6e81e | 382 | return MUTABLE_AV(Perl_mro_set_private_data(aTHX_ meta, &dfs_alg, |
1604cfb0 | 383 | MUTABLE_SV(retval))); |
e1a479c5 BB |
384 | } |
385 | ||
386 | /* | |
e1a479c5 BB |
387 | =for apidoc mro_get_linear_isa |
388 | ||
0b31f535 | 389 | Returns the mro linearisation for the given stash. By default, this |
006d9e7b FC |
390 | will be whatever C<mro_get_linear_isa_dfs> returns unless some |
391 | other MRO is in effect for the stash. The return value is a | |
e1a479c5 BB |
392 | read-only AV*. |
393 | ||
1c908217 RGS |
394 | You are responsible for C<SvREFCNT_inc()> on the |
395 | return value if you plan to store it anywhere | |
396 | semi-permanently (otherwise it might be deleted | |
397 | out from under you the next time the cache is | |
398 | invalidated). | |
399 | ||
e1a479c5 BB |
400 | =cut |
401 | */ | |
402 | AV* | |
403 | Perl_mro_get_linear_isa(pTHX_ HV *stash) | |
404 | { | |
405 | struct mro_meta* meta; | |
7311f41d | 406 | AV *isa; |
2c7f4b87 | 407 | |
7918f24d | 408 | PERL_ARGS_ASSERT_MRO_GET_LINEAR_ISA; |
2c7f4b87 BB |
409 | if(!SvOOK(stash)) |
410 | Perl_croak(aTHX_ "Can't linearize anonymous symbol table"); | |
e1a479c5 BB |
411 | |
412 | meta = HvMROMETA(stash); | |
3d76853f | 413 | if (!meta->mro_which) |
14f97ce6 | 414 | Perl_croak(aTHX_ "panic: invalid MRO!"); |
7311f41d FC |
415 | isa = meta->mro_which->resolve(aTHX_ stash, 0); |
416 | ||
02cab674 | 417 | if (meta->mro_which != &dfs_alg) { /* skip for dfs, for speed */ |
1604cfb0 MS |
418 | SV * const namesv = |
419 | (HvENAME(stash)||HvNAME(stash)) | |
420 | ? newSVhek(HvENAME_HEK(stash) | |
421 | ? HvENAME_HEK(stash) | |
422 | : HvNAME_HEK(stash)) | |
423 | : NULL; | |
424 | ||
425 | if(namesv && (AvFILLp(isa) == -1 || !sv_eq(*AvARRAY(isa), namesv))) | |
426 | { | |
427 | AV * const old = isa; | |
428 | SV **svp; | |
429 | SV **ovp = AvARRAY(old); | |
430 | SV * const * const oend = ovp + AvFILLp(old) + 1; | |
431 | isa = (AV *)sv_2mortal((SV *)newAV()); | |
432 | av_extend(isa, AvFILLp(isa) = AvFILLp(old)+1); | |
433 | *AvARRAY(isa) = namesv; | |
434 | svp = AvARRAY(isa)+1; | |
435 | while (ovp < oend) *svp++ = SvREFCNT_inc(*ovp++); | |
436 | } | |
437 | else SvREFCNT_dec(namesv); | |
02cab674 FC |
438 | } |
439 | ||
7311f41d | 440 | if (!meta->isa) { |
1604cfb0 MS |
441 | HV *const isa_hash = newHV(); |
442 | /* Linearisation didn't build it for us, so do it here. */ | |
009b864d | 443 | I32 count = AvFILLp(isa) + 1; |
1604cfb0 | 444 | SV *const *svp = AvARRAY(isa); |
009b864d | 445 | SV *const *const svp_end = svp + count; |
1604cfb0 MS |
446 | const HEK *canon_name = HvENAME_HEK(stash); |
447 | if (!canon_name) canon_name = HvNAME_HEK(stash); | |
448 | ||
009b864d NC |
449 | if (count > PERL_HASH_DEFAULT_HvMAX) { |
450 | hv_ksplit(isa_hash, count); | |
451 | } | |
452 | ||
1604cfb0 MS |
453 | while (svp < svp_end) { |
454 | (void) hv_store_ent(isa_hash, *svp++, &PL_sv_undef, 0); | |
455 | } | |
456 | ||
457 | (void) hv_common(isa_hash, NULL, HEK_KEY(canon_name), | |
458 | HEK_LEN(canon_name), HEK_FLAGS(canon_name), | |
459 | HV_FETCH_ISSTORE, &PL_sv_undef, | |
460 | HEK_HASH(canon_name)); | |
461 | (void) hv_stores(isa_hash, "UNIVERSAL", &PL_sv_undef); | |
462 | ||
463 | SvREADONLY_on(isa_hash); | |
464 | ||
465 | meta->isa = isa_hash; | |
7311f41d FC |
466 | } |
467 | ||
468 | return isa; | |
e1a479c5 BB |
469 | } |
470 | ||
471 | /* | |
472 | =for apidoc mro_isa_changed_in | |
473 | ||
1c908217 | 474 | Takes the necessary steps (cache invalidations, mostly) |
796b6530 | 475 | when the C<@ISA> of the given package has changed. Invoked |
e1a479c5 BB |
476 | by the C<setisa> magic, should not need to invoke directly. |
477 | ||
478 | =cut | |
479 | */ | |
f7afb547 | 480 | |
beeda143 | 481 | /* Macro to avoid repeating the code five times. */ |
f7afb547 FC |
482 | #define CLEAR_LINEAR(mEta) \ |
483 | if (mEta->mro_linear_all) { \ | |
1604cfb0 MS |
484 | SvREFCNT_dec(MUTABLE_SV(mEta->mro_linear_all)); \ |
485 | mEta->mro_linear_all = NULL; \ | |
486 | /* This is just acting as a shortcut pointer. */ \ | |
487 | mEta->mro_linear_current = NULL; \ | |
f7afb547 | 488 | } else if (mEta->mro_linear_current) { \ |
1604cfb0 MS |
489 | /* Only the current MRO is stored, so this owns the data. */ \ |
490 | SvREFCNT_dec(mEta->mro_linear_current); \ | |
491 | mEta->mro_linear_current = NULL; \ | |
f7afb547 FC |
492 | } |
493 | ||
e1a479c5 | 494 | void |
4df35a07 | 495 | Perl_mro_isa_changed_in(pTHX_ HV* stash) |
e1a479c5 | 496 | { |
e1a479c5 BB |
497 | HV* isarev; |
498 | AV* linear_mro; | |
499 | HE* iter; | |
500 | SV** svp; | |
501 | I32 items; | |
1e05feb3 | 502 | bool is_universal; |
4df35a07 | 503 | struct mro_meta * meta; |
80ebaca2 | 504 | HV *isa = NULL; |
e1a479c5 | 505 | |
3386c920 | 506 | const HEK * const stashhek = HvENAME_HEK(stash); |
4df35a07 FC |
507 | const char * const stashname = HvENAME_get(stash); |
508 | const STRLEN stashname_len = HvENAMELEN_get(stash); | |
509 | ||
510 | PERL_ARGS_ASSERT_MRO_ISA_CHANGED_IN; | |
7918f24d | 511 | |
2c7f4b87 BB |
512 | if(!stashname) |
513 | Perl_croak(aTHX_ "Can't call mro_isa_changed_in() on anonymous symbol table"); | |
514 | ||
4df35a07 FC |
515 | |
516 | /* wipe out the cached linearizations for this stash */ | |
517 | meta = HvMROMETA(stash); | |
f7afb547 | 518 | CLEAR_LINEAR(meta); |
4df35a07 | 519 | if (meta->isa) { |
1604cfb0 MS |
520 | /* Steal it for our own purposes. */ |
521 | isa = (HV *)sv_2mortal((SV *)meta->isa); | |
522 | meta->isa = NULL; | |
6f86b615 | 523 | } |
70cd14a1 | 524 | |
4df35a07 FC |
525 | /* Inc the package generation, since our @ISA changed */ |
526 | meta->pkg_gen++; | |
527 | ||
e1a479c5 BB |
528 | /* Wipe the global method cache if this package |
529 | is UNIVERSAL or one of its parents */ | |
dd69841b | 530 | |
3386c920 | 531 | svp = hv_fetchhek(PL_isarev, stashhek, 0); |
85fbaab2 | 532 | isarev = svp ? MUTABLE_HV(*svp) : NULL; |
dd69841b | 533 | |
4d00dfae YO |
534 | if((memEQs(stashname, stashname_len, "UNIVERSAL")) |
535 | || (isarev && hv_existss(isarev, "UNIVERSAL"))) { | |
e1a479c5 | 536 | PL_sub_generation++; |
dd69841b BB |
537 | is_universal = TRUE; |
538 | } | |
1e05feb3 | 539 | else { /* Wipe the local method cache otherwise */ |
4df35a07 | 540 | meta->cache_gen++; |
1604cfb0 | 541 | is_universal = FALSE; |
1e05feb3 | 542 | } |
e1a479c5 BB |
543 | |
544 | /* wipe next::method cache too */ | |
4df35a07 | 545 | if(meta->mro_nextmethod) hv_clear(meta->mro_nextmethod); |
1e05feb3 | 546 | |
9cbd5ca3 FC |
547 | /* Changes to @ISA might turn overloading on */ |
548 | HvAMAGIC_on(stash); | |
3d147ac2 DM |
549 | /* pessimise derefs for now. Will get recalculated by Gv_AMupdate() */ |
550 | HvAUX(stash)->xhv_aux_flags &= ~HvAUXf_NO_DEREF; | |
9cbd5ca3 | 551 | |
ac3b837b TC |
552 | /* DESTROY can be cached in meta. */ |
553 | meta->destroy_gen = 0; | |
8c34e50d | 554 | |
e1a479c5 | 555 | /* Iterate the isarev (classes that are our children), |
80ebaca2 FC |
556 | wiping out their linearization, method and isa caches |
557 | and upating PL_isarev. */ | |
dd69841b | 558 | if(isarev) { |
80ebaca2 FC |
559 | HV *isa_hashes = NULL; |
560 | ||
561 | /* We have to iterate through isarev twice to avoid a chicken and | |
562 | * egg problem: if A inherits from B and both are in isarev, A might | |
e1fa07e3 | 563 | * be processed before B and use B's previous linearisation. |
80ebaca2 FC |
564 | */ |
565 | ||
566 | /* First iteration: Wipe everything, but stash away the isa hashes | |
567 | * since we still need them for updating PL_isarev. | |
568 | */ | |
569 | ||
570 | if(hv_iterinit(isarev)) { | |
571 | /* Only create the hash if we need it; i.e., if isarev has | |
572 | any elements. */ | |
573 | isa_hashes = (HV *)sv_2mortal((SV *)newHV()); | |
574 | } | |
e1a479c5 | 575 | while((iter = hv_iternext(isarev))) { |
204e6232 | 576 | HV* revstash = gv_stashsv(hv_iterkeysv(iter), 0); |
bc2cbbac BB |
577 | struct mro_meta* revmeta; |
578 | ||
579 | if(!revstash) continue; | |
580 | revmeta = HvMROMETA(revstash); | |
1604cfb0 | 581 | CLEAR_LINEAR(revmeta); |
dd69841b BB |
582 | if(!is_universal) |
583 | revmeta->cache_gen++; | |
e1a479c5 BB |
584 | if(revmeta->mro_nextmethod) |
585 | hv_clear(revmeta->mro_nextmethod); | |
1604cfb0 MS |
586 | if (!SvOBJECT(revstash)) SvSTASH(revstash) = NULL; |
587 | ||
588 | (void) | |
589 | hv_store( | |
590 | isa_hashes, (const char*)&revstash, sizeof(HV *), | |
591 | revmeta->isa ? (SV *)revmeta->isa : &PL_sv_undef, 0 | |
592 | ); | |
593 | revmeta->isa = NULL; | |
80ebaca2 FC |
594 | } |
595 | ||
596 | /* Second pass: Update PL_isarev. We can just use isa_hashes to | |
597 | * avoid another round of stash lookups. */ | |
598 | ||
599 | /* isarev might be deleted from PL_isarev during this loop, so hang | |
600 | * on to it. */ | |
601 | SvREFCNT_inc_simple_void_NN(sv_2mortal((SV *)isarev)); | |
602 | ||
603 | if(isa_hashes) { | |
604 | hv_iterinit(isa_hashes); | |
605 | while((iter = hv_iternext(isa_hashes))) { | |
606 | HV* const revstash = *(HV **)HEK_KEY(HeKEY_hek(iter)); | |
607 | HV * const isa = (HV *)HeVAL(iter); | |
608 | const HEK *namehek; | |
609 | ||
80ebaca2 FC |
610 | /* We're starting at the 2nd element, skipping revstash */ |
611 | linear_mro = mro_get_linear_isa(revstash); | |
612 | svp = AvARRAY(linear_mro) + 1; | |
613 | items = AvFILLp(linear_mro); | |
614 | ||
615 | namehek = HvENAME_HEK(revstash); | |
616 | if (!namehek) namehek = HvNAME_HEK(revstash); | |
617 | ||
618 | while (items--) { | |
619 | SV* const sv = *svp++; | |
620 | HV* mroisarev; | |
621 | ||
622 | HE *he = hv_fetch_ent(PL_isarev, sv, TRUE, 0); | |
623 | ||
624 | /* That fetch should not fail. But if it had to create | |
625 | a new SV for us, then will need to upgrade it to an | |
626 | HV (which sv_upgrade() can now do for us). */ | |
627 | ||
628 | mroisarev = MUTABLE_HV(HeVAL(he)); | |
629 | ||
630 | SvUPGRADE(MUTABLE_SV(mroisarev), SVt_PVHV); | |
631 | ||
632 | /* This hash only ever contains PL_sv_yes. Storing it | |
633 | over itself is almost as cheap as calling hv_exists, | |
634 | so on aggregate we expect to save time by not making | |
635 | two calls to the common HV code for the case where | |
636 | it doesn't exist. */ | |
8b371338 | 637 | |
80ebaca2 | 638 | (void) |
3386c920 | 639 | hv_storehek(mroisarev, namehek, &PL_sv_yes); |
80ebaca2 FC |
640 | } |
641 | ||
e5a468d3 | 642 | if ((SV *)isa != &PL_sv_undef && HvTOTALKEYS(isa)) { |
316ebaf2 | 643 | assert(namehek); |
80ebaca2 FC |
644 | mro_clean_isarev( |
645 | isa, HEK_KEY(namehek), HEK_LEN(namehek), | |
3386c920 FC |
646 | HvMROMETA(revstash)->isa, HEK_HASH(namehek), |
647 | HEK_UTF8(namehek) | |
80ebaca2 | 648 | ); |
316ebaf2 | 649 | } |
80ebaca2 | 650 | } |
e1a479c5 BB |
651 | } |
652 | } | |
653 | ||
c9143745 FC |
654 | /* Now iterate our MRO (parents), adding ourselves and everything from |
655 | our isarev to their isarev. | |
1c908217 RGS |
656 | */ |
657 | ||
658 | /* We're starting at the 2nd element, skipping ourselves here */ | |
e1a479c5 BB |
659 | linear_mro = mro_get_linear_isa(stash); |
660 | svp = AvARRAY(linear_mro) + 1; | |
661 | items = AvFILLp(linear_mro); | |
1c908217 | 662 | |
e1a479c5 BB |
663 | while (items--) { |
664 | SV* const sv = *svp++; | |
e1a479c5 BB |
665 | HV* mroisarev; |
666 | ||
117b69ca NC |
667 | HE *he = hv_fetch_ent(PL_isarev, sv, TRUE, 0); |
668 | ||
1604cfb0 MS |
669 | /* That fetch should not fail. But if it had to create a new SV for |
670 | us, then will need to upgrade it to an HV (which sv_upgrade() can | |
671 | now do for us. */ | |
117b69ca | 672 | |
85fbaab2 | 673 | mroisarev = MUTABLE_HV(HeVAL(he)); |
e1a479c5 | 674 | |
1604cfb0 | 675 | SvUPGRADE(MUTABLE_SV(mroisarev), SVt_PVHV); |
117b69ca | 676 | |
1604cfb0 MS |
677 | /* This hash only ever contains PL_sv_yes. Storing it over itself is |
678 | almost as cheap as calling hv_exists, so on aggregate we expect to | |
679 | save time by not making two calls to the common HV code for the | |
680 | case where it doesn't exist. */ | |
8b371338 | 681 | |
1604cfb0 | 682 | (void)hv_storehek(mroisarev, stashhek, &PL_sv_yes); |
80ebaca2 FC |
683 | } |
684 | ||
e1fa07e3 | 685 | /* Delete our name from our former parents' isarevs. */ |
e5a468d3 | 686 | if(isa && HvTOTALKEYS(isa)) |
204e6232 | 687 | mro_clean_isarev(isa, stashname, stashname_len, meta->isa, |
3386c920 | 688 | HEK_HASH(stashhek), HEK_UTF8(stashhek)); |
80ebaca2 FC |
689 | } |
690 | ||
e5a468d3 NC |
691 | /* Deletes name from all the isarev entries listed in isa. |
692 | Don't call this if isa is already empty. */ | |
80ebaca2 FC |
693 | STATIC void |
694 | S_mro_clean_isarev(pTHX_ HV * const isa, const char * const name, | |
3386c920 FC |
695 | const STRLEN len, HV * const exceptions, U32 hash, |
696 | U32 flags) | |
80ebaca2 FC |
697 | { |
698 | HE* iter; | |
e1a479c5 | 699 | |
80ebaca2 FC |
700 | PERL_ARGS_ASSERT_MRO_CLEAN_ISAREV; |
701 | ||
e5a468d3 | 702 | assert(HvTOTALKEYS(isa)); |
e1fa07e3 | 703 | /* Delete our name from our former parents' isarevs. */ |
e5a468d3 NC |
704 | |
705 | hv_iterinit(isa); | |
706 | while((iter = hv_iternext(isa))) { | |
80ebaca2 | 707 | SV **svp; |
e5a468d3 NC |
708 | HEK *key = HeKEY_hek(iter); |
709 | if(exceptions && hv_existshek(exceptions, key)) | |
710 | continue; | |
711 | svp = hv_fetchhek(PL_isarev, key, 0); | |
712 | if(svp) { | |
713 | HV * const isarev = (HV *)*svp; | |
714 | (void)hv_common(isarev, NULL, name, len, flags, | |
715 | G_DISCARD|HV_DELETE, NULL, hash); | |
716 | if(!HvTOTALKEYS(isarev)) | |
717 | (void)hv_deletehek(PL_isarev, key, G_DISCARD); | |
e1a479c5 BB |
718 | } |
719 | } | |
720 | } | |
721 | ||
722 | /* | |
c8bbf675 FC |
723 | =for apidoc mro_package_moved |
724 | ||
d056e33c | 725 | Call this function to signal to a stash that it has been assigned to |
61daec80 | 726 | another spot in the stash hierarchy. C<stash> is the stash that has been |
154e47c8 | 727 | assigned. C<oldstash> is the stash it replaces, if any. C<gv> is the glob |
afdbe55d | 728 | that is actually being assigned to. |
d056e33c | 729 | |
35759254 | 730 | This can also be called with a null first argument to |
d056e33c FC |
731 | indicate that C<oldstash> has been deleted. |
732 | ||
733 | This function invalidates isa caches on the old stash, on all subpackages | |
734 | nested inside it, and on the subclasses of all those, including | |
735 | non-existent packages that have corresponding entries in C<stash>. | |
c8bbf675 | 736 | |
80ebaca2 FC |
737 | It also sets the effective names (C<HvENAME>) on all the stashes as |
738 | appropriate. | |
739 | ||
0290c710 | 740 | If the C<gv> is present and is not in the symbol table, then this function |
61daec80 | 741 | simply returns. This checked will be skipped if C<flags & 1>. |
0290c710 | 742 | |
c8bbf675 FC |
743 | =cut |
744 | */ | |
745 | void | |
35759254 | 746 | Perl_mro_package_moved(pTHX_ HV * const stash, HV * const oldstash, |
afdbe55d | 747 | const GV * const gv, U32 flags) |
c8bbf675 | 748 | { |
d7879cf0 FC |
749 | SV *namesv; |
750 | HEK **namep; | |
751 | I32 name_count; | |
80ebaca2 FC |
752 | HV *stashes; |
753 | HE* iter; | |
62c1e33f | 754 | |
afdbe55d | 755 | PERL_ARGS_ASSERT_MRO_PACKAGE_MOVED; |
35759254 | 756 | assert(stash || oldstash); |
35759254 | 757 | |
d7879cf0 | 758 | /* Determine the name(s) of the location that stash was assigned to |
35759254 FC |
759 | * or from which oldstash was removed. |
760 | * | |
928eb066 | 761 | * We cannot reliably use the name in oldstash, because it may have |
35759254 FC |
762 | * been deleted from the location in the symbol table that its name |
763 | * suggests, as in this case: | |
764 | * | |
765 | * $globref = \*foo::bar::; | |
766 | * Symbol::delete_package("foo"); | |
767 | * *$globref = \%baz::; | |
768 | * *$globref = *frelp::; | |
769 | * # calls mro_package_moved(%frelp::, %baz::, *$globref, NULL, 0) | |
770 | * | |
d7879cf0 FC |
771 | * So we get it from the gv. But, since the gv may no longer be in the |
772 | * symbol table, we check that first. The only reliable way to tell is | |
773 | * to see whether its stash has an effective name and whether the gv | |
774 | * resides in that stash under its name. That effective name may be | |
775 | * different from what gv_fullname4 would use. | |
776 | * If flags & 1, the caller has asked us to skip the check. | |
35759254 | 777 | */ |
d7879cf0 | 778 | if(!(flags & 1)) { |
1604cfb0 MS |
779 | SV **svp; |
780 | if( | |
781 | !GvSTASH(gv) || !HvENAME(GvSTASH(gv)) || | |
782 | !(svp = hv_fetchhek(GvSTASH(gv), GvNAME_HEK(gv), 0)) || | |
783 | *svp != (SV *)gv | |
784 | ) return; | |
d7879cf0 FC |
785 | } |
786 | assert(SvOOK(GvSTASH(gv))); | |
1f656fcf | 787 | assert(GvNAMELEN(gv)); |
d7879cf0 | 788 | assert(GvNAME(gv)[GvNAMELEN(gv) - 1] == ':'); |
1f656fcf | 789 | assert(GvNAMELEN(gv) == 1 || GvNAME(gv)[GvNAMELEN(gv) - 2] == ':'); |
d7879cf0 FC |
790 | name_count = HvAUX(GvSTASH(gv))->xhv_name_count; |
791 | if (!name_count) { | |
1604cfb0 MS |
792 | name_count = 1; |
793 | namep = &HvAUX(GvSTASH(gv))->xhv_name_u.xhvnameu_name; | |
d7879cf0 FC |
794 | } |
795 | else { | |
1604cfb0 MS |
796 | namep = HvAUX(GvSTASH(gv))->xhv_name_u.xhvnameu_names; |
797 | if (name_count < 0) ++namep, name_count = -name_count - 1; | |
d7879cf0 FC |
798 | } |
799 | if (name_count == 1) { | |
1604cfb0 MS |
800 | if (memEQs(HEK_KEY(*namep), HEK_LEN(*namep), "main")) { |
801 | namesv = GvNAMELEN(gv) == 1 | |
802 | ? newSVpvs_flags(":", SVs_TEMP) | |
803 | : newSVpvs_flags("", SVs_TEMP); | |
804 | } | |
805 | else { | |
806 | namesv = sv_2mortal(newSVhek(*namep)); | |
807 | if (GvNAMELEN(gv) == 1) sv_catpvs(namesv, ":"); | |
808 | else sv_catpvs(namesv, "::"); | |
809 | } | |
810 | if (GvNAMELEN(gv) != 1) { | |
811 | sv_catpvn_flags( | |
812 | namesv, GvNAME(gv), GvNAMELEN(gv) - 2, | |
813 | /* skip trailing :: */ | |
814 | GvNAMEUTF8(gv) ? SV_CATUTF8 : SV_CATBYTES | |
815 | ); | |
204e6232 | 816 | } |
d7879cf0 FC |
817 | } |
818 | else { | |
1604cfb0 MS |
819 | SV *aname; |
820 | namesv = sv_2mortal((SV *)newAV()); | |
821 | while (name_count--) { | |
822 | if(memEQs(HEK_KEY(*namep), HEK_LEN(*namep), "main")){ | |
823 | aname = GvNAMELEN(gv) == 1 | |
824 | ? newSVpvs(":") | |
825 | : newSVpvs(""); | |
826 | namep++; | |
204e6232 | 827 | } |
1604cfb0 MS |
828 | else { |
829 | aname = newSVhek(*namep++); | |
830 | if (GvNAMELEN(gv) == 1) sv_catpvs(aname, ":"); | |
831 | else sv_catpvs(aname, "::"); | |
832 | } | |
833 | if (GvNAMELEN(gv) != 1) { | |
834 | sv_catpvn_flags( | |
835 | aname, GvNAME(gv), GvNAMELEN(gv) - 2, | |
836 | /* skip trailing :: */ | |
837 | GvNAMEUTF8(gv) ? SV_CATUTF8 : SV_CATBYTES | |
838 | ); | |
839 | } | |
840 | av_push((AV *)namesv, aname); | |
841 | } | |
d7879cf0 | 842 | } |
c8bbf675 | 843 | |
80ebaca2 FC |
844 | /* Get a list of all the affected classes. */ |
845 | /* We cannot simply pass them all to mro_isa_changed_in to avoid | |
846 | the list, as that function assumes that only one package has | |
847 | changed. It does not work with: | |
848 | ||
849 | @foo::ISA = qw( B B::B ); | |
850 | *B:: = delete $::{"A::"}; | |
851 | ||
852 | as neither B nor B::B can be updated before the other, since they | |
853 | will reset caches on foo, which will see either B or B::B with the | |
854 | wrong name. The names must be set on *all* affected stashes before | |
beeda143 | 855 | we do anything else. (And linearisations must be cleared, too.) |
80ebaca2 FC |
856 | */ |
857 | stashes = (HV *) sv_2mortal((SV *)newHV()); | |
b89cdb22 FC |
858 | mro_gather_and_rename( |
859 | stashes, (HV *) sv_2mortal((SV *)newHV()), | |
d7879cf0 | 860 | stash, oldstash, namesv |
b89cdb22 | 861 | ); |
80ebaca2 | 862 | |
80ebaca2 FC |
863 | /* Once the caches have been wiped on all the classes, call |
864 | mro_isa_changed_in on each. */ | |
865 | hv_iterinit(stashes); | |
866 | while((iter = hv_iternext(stashes))) { | |
1604cfb0 MS |
867 | HV * const this_stash = *(HV **)HEK_KEY(HeKEY_hek(iter)); |
868 | if(HvENAME(this_stash)) { | |
869 | /* We have to restore the original meta->isa (that | |
870 | mro_gather_and_rename set aside for us) this way, in case | |
871 | one class in this list is a superclass of a another class | |
872 | that we have already encountered. In such a case, meta->isa | |
873 | will have been overwritten without old entries being deleted | |
874 | from PL_isarev. */ | |
875 | struct mro_meta * const meta = HvMROMETA(this_stash); | |
876 | if(meta->isa != (HV *)HeVAL(iter)){ | |
877 | SvREFCNT_dec(meta->isa); | |
878 | meta->isa | |
879 | = HeVAL(iter) == &PL_sv_yes | |
880 | ? NULL | |
881 | : (HV *)HeVAL(iter); | |
882 | HeVAL(iter) = NULL; /* We donated our reference count. */ | |
883 | } | |
884 | mro_isa_changed_in(this_stash); | |
885 | } | |
80ebaca2 FC |
886 | } |
887 | } | |
888 | ||
aeba7c97 | 889 | STATIC void |
b89cdb22 | 890 | S_mro_gather_and_rename(pTHX_ HV * const stashes, HV * const seen_stashes, |
d7879cf0 | 891 | HV *stash, HV *oldstash, SV *namesv) |
80ebaca2 | 892 | { |
eb578fdb KW |
893 | XPVHV* xhv; |
894 | HE *entry; | |
80ebaca2 | 895 | I32 riter = -1; |
4c916935 | 896 | I32 items = 0; |
80ebaca2 | 897 | const bool stash_had_name = stash && HvENAME(stash); |
d7879cf0 | 898 | bool fetched_isarev = FALSE; |
80ebaca2 FC |
899 | HV *seen = NULL; |
900 | HV *isarev = NULL; | |
d7879cf0 | 901 | SV **svp = NULL; |
80ebaca2 FC |
902 | |
903 | PERL_ARGS_ASSERT_MRO_GATHER_AND_RENAME; | |
904 | ||
b89cdb22 FC |
905 | /* We use the seen_stashes hash to keep track of which packages have |
906 | been encountered so far. This must be separate from the main list of | |
907 | stashes, as we need to distinguish between stashes being assigned | |
908 | and stashes being replaced/deleted. (A nested stash can be on both | |
909 | sides of an assignment. We cannot simply skip iterating through a | |
910 | stash on the right if we have seen it on the left, as it will not | |
911 | get its ename assigned to it.) | |
912 | ||
913 | To avoid allocating extra SVs, instead of a bitfield we can make | |
914 | bizarre use of immortals: | |
915 | ||
916 | &PL_sv_undef: seen on the left (oldstash) | |
917 | &PL_sv_no : seen on the right (stash) | |
918 | &PL_sv_yes : seen on both sides | |
919 | ||
920 | */ | |
921 | ||
80ebaca2 | 922 | if(oldstash) { |
1604cfb0 MS |
923 | /* Add to the big list. */ |
924 | struct mro_meta * meta; | |
925 | HE * const entry | |
926 | = (HE *) | |
927 | hv_common( | |
928 | seen_stashes, NULL, (const char *)&oldstash, sizeof(HV *), 0, | |
929 | HV_FETCH_LVALUE|HV_FETCH_EMPTY_HE, NULL, 0 | |
930 | ); | |
931 | if(HeVAL(entry) == &PL_sv_undef || HeVAL(entry) == &PL_sv_yes) { | |
932 | oldstash = NULL; | |
933 | goto check_stash; | |
934 | } | |
935 | HeVAL(entry) | |
936 | = HeVAL(entry) == &PL_sv_no ? &PL_sv_yes : &PL_sv_undef; | |
937 | meta = HvMROMETA(oldstash); | |
938 | (void) | |
939 | hv_store( | |
940 | stashes, (const char *)&oldstash, sizeof(HV *), | |
941 | meta->isa | |
942 | ? SvREFCNT_inc_simple_NN((SV *)meta->isa) | |
943 | : &PL_sv_yes, | |
944 | 0 | |
945 | ); | |
946 | CLEAR_LINEAR(meta); | |
947 | ||
948 | /* Update the effective name. */ | |
949 | if(HvENAME_get(oldstash)) { | |
950 | const HEK * const enamehek = HvENAME_HEK(oldstash); | |
951 | if(SvTYPE(namesv) == SVt_PVAV) { | |
952 | items = AvFILLp((AV *)namesv) + 1; | |
953 | svp = AvARRAY((AV *)namesv); | |
954 | } | |
955 | else { | |
956 | items = 1; | |
957 | svp = &namesv; | |
958 | } | |
959 | while (items--) { | |
204e6232 | 960 | const U32 name_utf8 = SvUTF8(*svp); |
1604cfb0 MS |
961 | STRLEN len; |
962 | const char *name = SvPVx_const(*svp, len); | |
963 | if(PL_stashcache) { | |
147e3846 | 964 | DEBUG_o(Perl_deb(aTHX_ "mro_gather_and_rename clearing PL_stashcache for '%" SVf "'\n", |
c1f6cd39 | 965 | SVfARG(*svp))); |
bffed14d | 966 | (void)hv_delete_ent(PL_stashcache, *svp, G_DISCARD, 0); |
103f5a36 | 967 | } |
1604cfb0 MS |
968 | hv_ename_delete(oldstash, name, len, name_utf8); |
969 | ||
970 | if (!fetched_isarev) { | |
971 | /* If the name deletion caused a name change, then we | |
972 | * are not going to call mro_isa_changed_in with this | |
973 | * name (and not at all if it has become anonymous) so | |
974 | * we need to delete old isarev entries here, both | |
975 | * those in the superclasses and this class's own list | |
976 | * of subclasses. We simply delete the latter from | |
977 | * PL_isarev, since we still need it. hv_delete morti- | |
978 | * fies it for us, so sv_2mortal is not necessary. */ | |
979 | if(HvENAME_HEK(oldstash) != enamehek) { | |
e5a468d3 | 980 | if(meta->isa && HvTOTALKEYS(meta->isa)) |
1604cfb0 MS |
981 | mro_clean_isarev(meta->isa, name, len, 0, 0, |
982 | name_utf8 ? HVhek_UTF8 : 0); | |
bffed14d | 983 | isarev = (HV *)hv_delete_ent(PL_isarev, *svp, 0, 0); |
1604cfb0 MS |
984 | fetched_isarev=TRUE; |
985 | } | |
986 | } | |
bffed14d NC |
987 | |
988 | ++svp; | |
1604cfb0 MS |
989 | } |
990 | } | |
d7fbb1de | 991 | } |
80ebaca2 | 992 | check_stash: |
8b9e80a3 | 993 | if(stash) { |
1604cfb0 MS |
994 | if(SvTYPE(namesv) == SVt_PVAV) { |
995 | items = AvFILLp((AV *)namesv) + 1; | |
996 | svp = AvARRAY((AV *)namesv); | |
997 | } | |
998 | else { | |
999 | items = 1; | |
1000 | svp = &namesv; | |
1001 | } | |
1002 | while (items--) { | |
204e6232 | 1003 | const U32 name_utf8 = SvUTF8(*svp); |
1604cfb0 MS |
1004 | STRLEN len; |
1005 | const char *name = SvPVx_const(*svp++, len); | |
1006 | hv_ename_add(stash, name, len, name_utf8); | |
1007 | } | |
80ebaca2 | 1008 | |
b89cdb22 | 1009 | /* Add it to the big list if it needs |
1604cfb0 MS |
1010 | * mro_isa_changed_in called on it. That happens if it was |
1011 | * detached from the symbol table (so it had no HvENAME) before | |
1012 | * being assigned to the spot named by the 'name' variable, because | |
1013 | * its cached isa linearisation is now stale (the effective name | |
1014 | * having changed), and subclasses will then use that cache when | |
1015 | * mro_package_moved calls mro_isa_changed_in. (See | |
1016 | * [perl #77358].) | |
1017 | * | |
1018 | * If it did have a name, then its previous name is still | |
1019 | * used in isa caches, and there is no need for | |
1020 | * mro_package_moved to call mro_isa_changed_in. | |
1021 | */ | |
1022 | ||
1023 | entry | |
1024 | = (HE *) | |
1025 | hv_common( | |
1026 | seen_stashes, NULL, (const char *)&stash, sizeof(HV *), 0, | |
1027 | HV_FETCH_LVALUE|HV_FETCH_EMPTY_HE, NULL, 0 | |
1028 | ); | |
1029 | if(HeVAL(entry) == &PL_sv_yes || HeVAL(entry) == &PL_sv_no) | |
1030 | stash = NULL; | |
1031 | else { | |
1032 | HeVAL(entry) | |
1033 | = HeVAL(entry) == &PL_sv_undef ? &PL_sv_yes : &PL_sv_no; | |
1034 | if(!stash_had_name) | |
1035 | { | |
1036 | struct mro_meta * const meta = HvMROMETA(stash); | |
1037 | (void) | |
1038 | hv_store( | |
1039 | stashes, (const char *)&stash, sizeof(HV *), | |
1040 | meta->isa | |
1041 | ? SvREFCNT_inc_simple_NN((SV *)meta->isa) | |
1042 | : &PL_sv_yes, | |
1043 | 0 | |
1044 | ); | |
1045 | CLEAR_LINEAR(meta); | |
1046 | } | |
1047 | } | |
8b9e80a3 | 1048 | } |
d7fbb1de | 1049 | |
80ebaca2 | 1050 | if(!stash && !oldstash) |
1604cfb0 MS |
1051 | /* Both stashes have been encountered already. */ |
1052 | return; | |
80ebaca2 FC |
1053 | |
1054 | /* Add all the subclasses to the big list. */ | |
d7879cf0 | 1055 | if(!fetched_isarev) { |
1604cfb0 MS |
1056 | /* If oldstash is not null, then we can use its HvENAME to look up |
1057 | the isarev hash, since all its subclasses will be listed there. | |
1058 | It will always have an HvENAME. It the HvENAME was removed | |
1059 | above, then fetch_isarev will be true, and this code will not be | |
1060 | reached. | |
1061 | ||
1062 | If oldstash is null, then this is an empty spot with no stash in | |
1063 | it, so subclasses could be listed in isarev hashes belonging to | |
1064 | any of the names, so we have to check all of them. | |
1065 | */ | |
1066 | assert(!oldstash || HvENAME(oldstash)); | |
1067 | if (oldstash) { | |
1068 | /* Extra variable to avoid a compiler warning */ | |
1069 | const HEK * const hvename = HvENAME_HEK(oldstash); | |
1070 | fetched_isarev = TRUE; | |
1071 | svp = hv_fetchhek(PL_isarev, hvename, 0); | |
1072 | if (svp) isarev = MUTABLE_HV(*svp); | |
1073 | } | |
1074 | else if(SvTYPE(namesv) == SVt_PVAV) { | |
1075 | items = AvFILLp((AV *)namesv) + 1; | |
1076 | svp = AvARRAY((AV *)namesv); | |
1077 | } | |
1078 | else { | |
1079 | items = 1; | |
1080 | svp = &namesv; | |
1081 | } | |
d7879cf0 | 1082 | } |
80ebaca2 | 1083 | if( |
d7879cf0 | 1084 | isarev || !fetched_isarev |
80ebaca2 | 1085 | ) { |
d7879cf0 | 1086 | while (fetched_isarev || items--) { |
1604cfb0 MS |
1087 | HE *iter; |
1088 | ||
1089 | if (!fetched_isarev) { | |
1090 | HE * const he = hv_fetch_ent(PL_isarev, *svp++, 0, 0); | |
1091 | if (!he || !(isarev = MUTABLE_HV(HeVAL(he)))) continue; | |
80ebaca2 | 1092 | } |
d7879cf0 | 1093 | |
1604cfb0 MS |
1094 | hv_iterinit(isarev); |
1095 | while((iter = hv_iternext(isarev))) { | |
1096 | HV* revstash = gv_stashsv(hv_iterkeysv(iter), 0); | |
1097 | struct mro_meta * meta; | |
1098 | ||
1099 | if(!revstash) continue; | |
1100 | meta = HvMROMETA(revstash); | |
1101 | (void) | |
1102 | hv_store( | |
1103 | stashes, (const char *)&revstash, sizeof(HV *), | |
1104 | meta->isa | |
1105 | ? SvREFCNT_inc_simple_NN((SV *)meta->isa) | |
1106 | : &PL_sv_yes, | |
1107 | 0 | |
1108 | ); | |
1109 | CLEAR_LINEAR(meta); | |
1110 | } | |
1111 | ||
1112 | if (fetched_isarev) break; | |
d7879cf0 | 1113 | } |
80ebaca2 | 1114 | } |
d056e33c | 1115 | |
c8bbf675 FC |
1116 | /* This is partly based on code in hv_iternext_flags. We are not call- |
1117 | ing that here, as we want to avoid resetting the hash iterator. */ | |
1118 | ||
d056e33c | 1119 | /* Skip the entire loop if the hash is empty. */ |
f1c1602a | 1120 | if(oldstash && HvTOTALKEYS(oldstash)) { |
1604cfb0 MS |
1121 | xhv = (XPVHV*)SvANY(oldstash); |
1122 | seen = (HV *) sv_2mortal((SV *)newHV()); | |
1123 | ||
1124 | /* Iterate through entries in the oldstash, adding them to the | |
1125 | list, meanwhile doing the equivalent of $seen{$key} = 1. | |
1126 | */ | |
1127 | ||
1128 | while (++riter <= (I32)xhv->xhv_max) { | |
1129 | entry = (HvARRAY(oldstash))[riter]; | |
1130 | ||
1131 | /* Iterate through the entries in this list */ | |
1132 | for(; entry; entry = HeNEXT(entry)) { | |
1133 | const char* key; | |
1134 | I32 len; | |
1135 | ||
1136 | /* If this entry is not a glob, ignore it. | |
1137 | Try the next. */ | |
1138 | if (!isGV(HeVAL(entry))) continue; | |
1139 | ||
1140 | key = hv_iterkey(entry, &len); | |
1141 | if ((len > 1 && key[len-2] == ':' && key[len-1] == ':') | |
1142 | || (len == 1 && key[0] == ':')) { | |
1143 | HV * const oldsubstash = GvHV(HeVAL(entry)); | |
f1c1602a | 1144 | SV **stashentry; |
1604cfb0 MS |
1145 | HV *substash = NULL; |
1146 | ||
1147 | /* Avoid main::main::main::... */ | |
1148 | if(oldsubstash == oldstash) continue; | |
1149 | ||
f1c1602a NC |
1150 | stashentry = stash ? hv_fetchhek(stash, HeKEY_hek(entry), 0) : NULL; |
1151 | ||
1604cfb0 MS |
1152 | if( |
1153 | ( | |
1154 | stashentry && *stashentry && isGV(*stashentry) | |
1155 | && (substash = GvHV(*stashentry)) | |
1156 | ) | |
1157 | || (oldsubstash && HvENAME_get(oldsubstash)) | |
1158 | ) | |
1159 | { | |
1160 | /* Add :: and the key (minus the trailing ::) | |
1161 | to each name. */ | |
1162 | SV *subname; | |
1163 | if(SvTYPE(namesv) == SVt_PVAV) { | |
1164 | SV *aname; | |
1165 | items = AvFILLp((AV *)namesv) + 1; | |
1166 | svp = AvARRAY((AV *)namesv); | |
1167 | subname = sv_2mortal((SV *)newAV()); | |
1168 | while (items--) { | |
1169 | aname = newSVsv(*svp++); | |
1170 | if (len == 1) | |
1171 | sv_catpvs(aname, ":"); | |
1172 | else { | |
1173 | sv_catpvs(aname, "::"); | |
1174 | sv_catpvn_flags( | |
1175 | aname, key, len-2, | |
1176 | HeUTF8(entry) | |
1177 | ? SV_CATUTF8 : SV_CATBYTES | |
1178 | ); | |
1179 | } | |
1180 | av_push((AV *)subname, aname); | |
1181 | } | |
1182 | } | |
1183 | else { | |
1184 | subname = sv_2mortal(newSVsv(namesv)); | |
1185 | if (len == 1) sv_catpvs(subname, ":"); | |
1186 | else { | |
1187 | sv_catpvs(subname, "::"); | |
1188 | sv_catpvn_flags( | |
1189 | subname, key, len-2, | |
1190 | HeUTF8(entry) ? SV_CATUTF8 : SV_CATBYTES | |
1191 | ); | |
1192 | } | |
1193 | } | |
1194 | mro_gather_and_rename( | |
1195 | stashes, seen_stashes, | |
1196 | substash, oldsubstash, subname | |
1197 | ); | |
1198 | } | |
1199 | ||
5ebe3ee8 | 1200 | (void)hv_storehek(seen, HeKEY_hek(entry), &PL_sv_yes); |
1604cfb0 MS |
1201 | } |
1202 | } | |
1203 | } | |
d056e33c | 1204 | } |
c8bbf675 FC |
1205 | |
1206 | /* Skip the entire loop if the hash is empty. */ | |
f1c1602a | 1207 | if (stash && HvTOTALKEYS(stash)) { |
1604cfb0 MS |
1208 | xhv = (XPVHV*)SvANY(stash); |
1209 | riter = -1; | |
1210 | ||
1211 | /* Iterate through the new stash, skipping $seen{$key} items, | |
1212 | calling mro_gather_and_rename(stashes,seen,entry,NULL, ...). */ | |
1213 | while (++riter <= (I32)xhv->xhv_max) { | |
1214 | entry = (HvARRAY(stash))[riter]; | |
1215 | ||
1216 | /* Iterate through the entries in this list */ | |
1217 | for(; entry; entry = HeNEXT(entry)) { | |
1218 | const char* key; | |
1219 | I32 len; | |
1220 | ||
1221 | /* If this entry is not a glob, ignore it. | |
1222 | Try the next. */ | |
1223 | if (!isGV(HeVAL(entry))) continue; | |
1224 | ||
1225 | key = hv_iterkey(entry, &len); | |
1226 | if ((len > 1 && key[len-2] == ':' && key[len-1] == ':') | |
1227 | || (len == 1 && key[0] == ':')) { | |
1228 | HV *substash; | |
1229 | ||
1230 | /* If this entry was seen when we iterated through the | |
1231 | oldstash, skip it. */ | |
5ebe3ee8 | 1232 | if(seen && hv_existshek(seen, HeKEY_hek(entry))) continue; |
1604cfb0 MS |
1233 | |
1234 | /* We get here only if this stash has no corresponding | |
1235 | entry in the stash being replaced. */ | |
1236 | ||
1237 | substash = GvHV(HeVAL(entry)); | |
1238 | if(substash) { | |
1239 | SV *subname; | |
1240 | ||
1241 | /* Avoid checking main::main::main::... */ | |
1242 | if(substash == stash) continue; | |
1243 | ||
1244 | /* Add :: and the key (minus the trailing ::) | |
1245 | to each name. */ | |
1246 | if(SvTYPE(namesv) == SVt_PVAV) { | |
1247 | SV *aname; | |
1248 | items = AvFILLp((AV *)namesv) + 1; | |
1249 | svp = AvARRAY((AV *)namesv); | |
1250 | subname = sv_2mortal((SV *)newAV()); | |
1251 | while (items--) { | |
1252 | aname = newSVsv(*svp++); | |
1253 | if (len == 1) | |
1254 | sv_catpvs(aname, ":"); | |
1255 | else { | |
1256 | sv_catpvs(aname, "::"); | |
1257 | sv_catpvn_flags( | |
1258 | aname, key, len-2, | |
1259 | HeUTF8(entry) | |
1260 | ? SV_CATUTF8 : SV_CATBYTES | |
1261 | ); | |
1262 | } | |
1263 | av_push((AV *)subname, aname); | |
1264 | } | |
1265 | } | |
1266 | else { | |
1267 | subname = sv_2mortal(newSVsv(namesv)); | |
1268 | if (len == 1) sv_catpvs(subname, ":"); | |
1269 | else { | |
1270 | sv_catpvs(subname, "::"); | |
1271 | sv_catpvn_flags( | |
1272 | subname, key, len-2, | |
1273 | HeUTF8(entry) ? SV_CATUTF8 : SV_CATBYTES | |
1274 | ); | |
1275 | } | |
1276 | } | |
1277 | mro_gather_and_rename( | |
1278 | stashes, seen_stashes, | |
1279 | substash, NULL, subname | |
1280 | ); | |
1281 | } | |
1282 | } | |
1283 | } | |
1284 | } | |
c8bbf675 FC |
1285 | } |
1286 | } | |
1287 | ||
1288 | /* | |
e1a479c5 BB |
1289 | =for apidoc mro_method_changed_in |
1290 | ||
47c9dd14 BB |
1291 | Invalidates method caching on any child classes |
1292 | of the given stash, so that they might notice | |
1293 | the changes in this one. | |
e1a479c5 BB |
1294 | |
1295 | Ideally, all instances of C<PL_sub_generation++> in | |
25d585df | 1296 | perl source outside of F<mro.c> should be |
dd69841b BB |
1297 | replaced by calls to this. |
1298 | ||
1299 | Perl automatically handles most of the common | |
1300 | ways a method might be redefined. However, there | |
1301 | are a few ways you could change a method in a stash | |
1302 | without the cache code noticing, in which case you | |
1303 | need to call this method afterwards: | |
e1a479c5 | 1304 | |
dd69841b BB |
1305 | 1) Directly manipulating the stash HV entries from |
1306 | XS code. | |
e1a479c5 | 1307 | |
dd69841b BB |
1308 | 2) Assigning a reference to a readonly scalar |
1309 | constant into a stash entry in order to create | |
75af9d73 | 1310 | a constant subroutine (like F<constant.pm> |
dd69841b BB |
1311 | does). |
1312 | ||
1313 | This same method is available from pure perl | |
1314 | via, C<mro::method_changed_in(classname)>. | |
e1a479c5 BB |
1315 | |
1316 | =cut | |
1317 | */ | |
1318 | void | |
1319 | Perl_mro_method_changed_in(pTHX_ HV *stash) | |
1320 | { | |
00169e2c FC |
1321 | const char * const stashname = HvENAME_get(stash); |
1322 | const STRLEN stashname_len = HvENAMELEN_get(stash); | |
dd69841b | 1323 | |
3386c920 | 1324 | SV ** const svp = hv_fetchhek(PL_isarev, HvENAME_HEK(stash), 0); |
85fbaab2 | 1325 | HV * const isarev = svp ? MUTABLE_HV(*svp) : NULL; |
e1a479c5 | 1326 | |
7918f24d NC |
1327 | PERL_ARGS_ASSERT_MRO_METHOD_CHANGED_IN; |
1328 | ||
2c7f4b87 BB |
1329 | if(!stashname) |
1330 | Perl_croak(aTHX_ "Can't call mro_method_changed_in() on anonymous symbol table"); | |
1331 | ||
70cd14a1 CB |
1332 | /* Inc the package generation, since a local method changed */ |
1333 | HvMROMETA(stash)->pkg_gen++; | |
1334 | ||
ac3b837b TC |
1335 | /* DESTROY can be cached in meta */ |
1336 | HvMROMETA(stash)->destroy_gen = 0; | |
8c34e50d | 1337 | |
e1a479c5 BB |
1338 | /* If stash is UNIVERSAL, or one of UNIVERSAL's parents, |
1339 | invalidate all method caches globally */ | |
4d00dfae YO |
1340 | if((memEQs(stashname, stashname_len, "UNIVERSAL")) |
1341 | || (isarev && hv_existss(isarev, "UNIVERSAL"))) { | |
e1a479c5 BB |
1342 | PL_sub_generation++; |
1343 | return; | |
1344 | } | |
1345 | ||
1346 | /* else, invalidate the method caches of all child classes, | |
1347 | but not itself */ | |
dd69841b | 1348 | if(isarev) { |
1604cfb0 | 1349 | HE* iter; |
1e05feb3 | 1350 | |
e1a479c5 BB |
1351 | hv_iterinit(isarev); |
1352 | while((iter = hv_iternext(isarev))) { | |
204e6232 | 1353 | HV* const revstash = gv_stashsv(hv_iterkeysv(iter), 0); |
bc2cbbac BB |
1354 | struct mro_meta* mrometa; |
1355 | ||
1356 | if(!revstash) continue; | |
1357 | mrometa = HvMROMETA(revstash); | |
dd69841b | 1358 | mrometa->cache_gen++; |
e1a479c5 BB |
1359 | if(mrometa->mro_nextmethod) |
1360 | hv_clear(mrometa->mro_nextmethod); | |
ac3b837b | 1361 | mrometa->destroy_gen = 0; |
e1a479c5 BB |
1362 | } |
1363 | } | |
234df27b FC |
1364 | |
1365 | /* The method change may be due to *{$package . "::()"} = \&nil; in | |
1366 | overload.pm. */ | |
1367 | HvAMAGIC_on(stash); | |
3d147ac2 DM |
1368 | /* pessimise derefs for now. Will get recalculated by Gv_AMupdate() */ |
1369 | HvAUX(stash)->xhv_aux_flags &= ~HvAUXf_NO_DEREF; | |
e1a479c5 BB |
1370 | } |
1371 | ||
31b9005d NC |
1372 | void |
1373 | Perl_mro_set_mro(pTHX_ struct mro_meta *const meta, SV *const name) | |
1374 | { | |
1375 | const struct mro_alg *const which = Perl_mro_get_from_name(aTHX_ name); | |
8b371338 | 1376 | |
31b9005d NC |
1377 | PERL_ARGS_ASSERT_MRO_SET_MRO; |
1378 | ||
1379 | if (!which) | |
147e3846 | 1380 | Perl_croak(aTHX_ "Invalid mro name: '%" SVf "'", name); |
31b9005d NC |
1381 | |
1382 | if(meta->mro_which != which) { | |
1604cfb0 MS |
1383 | if (meta->mro_linear_current && !meta->mro_linear_all) { |
1384 | /* If we were storing something directly, put it in the hash before | |
1385 | we lose it. */ | |
1386 | Perl_mro_set_private_data(aTHX_ meta, meta->mro_which, | |
1387 | MUTABLE_SV(meta->mro_linear_current)); | |
1388 | } | |
1389 | meta->mro_which = which; | |
1390 | /* Scrub our cached pointer to the private data. */ | |
1391 | meta->mro_linear_current = NULL; | |
31b9005d NC |
1392 | /* Only affects local method cache, not |
1393 | even child classes */ | |
1394 | meta->cache_gen++; | |
1395 | if(meta->mro_nextmethod) | |
1396 | hv_clear(meta->mro_nextmethod); | |
1397 | } | |
1398 | } | |
1399 | ||
e1a479c5 BB |
1400 | #include "XSUB.h" |
1401 | ||
e1a479c5 | 1402 | XS(XS_mro_method_changed_in); |
e1a479c5 BB |
1403 | |
1404 | void | |
1405 | Perl_boot_core_mro(pTHX) | |
1406 | { | |
e1a479c5 BB |
1407 | static const char file[] = __FILE__; |
1408 | ||
a3e6e81e | 1409 | Perl_mro_register(aTHX_ &dfs_alg); |
a3e6e81e | 1410 | |
e1a479c5 | 1411 | newXSproto("mro::method_changed_in", XS_mro_method_changed_in, file, "$"); |
e1a479c5 BB |
1412 | } |
1413 | ||
e1a479c5 BB |
1414 | XS(XS_mro_method_changed_in) |
1415 | { | |
e1a479c5 BB |
1416 | dXSARGS; |
1417 | SV* classname; | |
1418 | HV* class_stash; | |
1419 | ||
e1a479c5 | 1420 | if(items != 1) |
1604cfb0 | 1421 | croak_xs_usage(cv, "classname"); |
8b371338 | 1422 | |
e1a479c5 BB |
1423 | classname = ST(0); |
1424 | ||
1425 | class_stash = gv_stashsv(classname, 0); | |
147e3846 | 1426 | if(!class_stash) Perl_croak(aTHX_ "No such class: '%" SVf "'!", SVfARG(classname)); |
e1a479c5 BB |
1427 | |
1428 | mro_method_changed_in(class_stash); | |
1429 | ||
1430 | XSRETURN_EMPTY; | |
1431 | } | |
1432 | ||
e1a479c5 | 1433 | /* |
14d04a33 | 1434 | * ex: set ts=8 sts=4 sw=4 et: |
e1a479c5 | 1435 | */ |