]>
Commit | Line | Data |
---|---|---|
8d08fdba MS |
1 | /* Breadth-first and depth-first routines for |
2 | searching multiple-inheritance lattice for GNU C++. | |
83ffe9cd | 3 | Copyright (C) 1987-2023 Free Software Foundation, Inc. |
8d08fdba MS |
4 | Contributed by Michael Tiemann (tiemann@cygnus.com) |
5 | ||
f5adbb8d | 6 | This file is part of GCC. |
8d08fdba | 7 | |
f5adbb8d | 8 | GCC is free software; you can redistribute it and/or modify |
8d08fdba | 9 | it under the terms of the GNU General Public License as published by |
e77f031d | 10 | the Free Software Foundation; either version 3, or (at your option) |
8d08fdba MS |
11 | any later version. |
12 | ||
f5adbb8d | 13 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
e77f031d NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
8d08fdba | 21 | |
e92cc029 | 22 | /* High-level class interface. */ |
8d08fdba MS |
23 | |
24 | #include "config.h" | |
8d052bc7 | 25 | #include "system.h" |
4977bab6 | 26 | #include "coretypes.h" |
8d08fdba | 27 | #include "cp-tree.h" |
f25a2b52 | 28 | #include "intl.h" |
54f92bfb | 29 | #include "toplev.h" |
6a3f203c | 30 | #include "spellcheck-tree.h" |
314e6352 ML |
31 | #include "stringpool.h" |
32 | #include "attribs.h" | |
2efb237f | 33 | #include "tree-inline.h" |
8d08fdba | 34 | |
f8ad2d21 | 35 | static int is_subobject_of_p (tree, tree); |
2c2e8978 | 36 | static tree dfs_lookup_base (tree, void *); |
6936e493 NS |
37 | static tree dfs_dcast_hint_pre (tree, void *); |
38 | static tree dfs_dcast_hint_post (tree, void *); | |
86ac0575 | 39 | static tree dfs_debug_mark (tree, void *); |
8f2a734f NS |
40 | static int check_hidden_convs (tree, int, int, tree, tree, tree); |
41 | static tree split_conversions (tree, tree, tree, tree); | |
2e12a855 | 42 | static int lookup_conversions_r (tree, int, int, tree, tree, tree *); |
86ac0575 | 43 | static int look_for_overrides_r (tree, tree); |
86ac0575 | 44 | static tree lookup_field_r (tree, void *); |
6936e493 | 45 | static tree dfs_accessible_post (tree, void *); |
6936e493 NS |
46 | static tree dfs_walk_once_accessible (tree, bool, |
47 | tree (*pre_fn) (tree, void *), | |
48 | tree (*post_fn) (tree, void *), | |
49 | void *data); | |
86ac0575 NS |
50 | static tree dfs_access_in_type (tree, void *); |
51 | static access_kind access_in_type (tree, tree); | |
86ac0575 | 52 | static tree dfs_get_pure_virtuals (tree, void *); |
8d08fdba | 53 | |
8d08fdba | 54 | \f |
2c2e8978 NS |
55 | /* Data for lookup_base and its workers. */ |
56 | ||
57 | struct lookup_base_data_s | |
338d90b8 | 58 | { |
03fd3f84 | 59 | tree t; /* type being searched. */ |
0cbd7506 MS |
60 | tree base; /* The base type we're looking for. */ |
61 | tree binfo; /* Found binfo. */ | |
62 | bool via_virtual; /* Found via a virtual path. */ | |
2c2e8978 | 63 | bool ambiguous; /* Found multiply ambiguous */ |
0cbd7506 | 64 | bool repeated_base; /* Whether there are repeated bases in the |
2c2e8978 | 65 | hierarchy. */ |
0cbd7506 | 66 | bool want_any; /* Whether we want any matching binfo. */ |
2c2e8978 NS |
67 | }; |
68 | ||
69 | /* Worker function for lookup_base. See if we've found the desired | |
f0ec2b9a | 70 | base and update DATA_ (a pointer to LOOKUP_BASE_DATA_S). */ |
338d90b8 | 71 | |
2c2e8978 NS |
72 | static tree |
73 | dfs_lookup_base (tree binfo, void *data_) | |
74 | { | |
67f5655f | 75 | struct lookup_base_data_s *data = (struct lookup_base_data_s *) data_; |
338d90b8 | 76 | |
2c2e8978 NS |
77 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->base)) |
78 | { | |
79 | if (!data->binfo) | |
338d90b8 | 80 | { |
2c2e8978 NS |
81 | data->binfo = binfo; |
82 | data->via_virtual | |
83 | = binfo_via_virtual (data->binfo, data->t) != NULL_TREE; | |
c8094d83 | 84 | |
2c2e8978 NS |
85 | if (!data->repeated_base) |
86 | /* If there are no repeated bases, we can stop now. */ | |
87 | return binfo; | |
c8094d83 | 88 | |
2c2e8978 NS |
89 | if (data->want_any && !data->via_virtual) |
90 | /* If this is a non-virtual base, then we can't do | |
91 | better. */ | |
92 | return binfo; | |
c8094d83 | 93 | |
2c2e8978 NS |
94 | return dfs_skip_bases; |
95 | } | |
96 | else | |
97 | { | |
98 | gcc_assert (binfo != data->binfo); | |
c8094d83 | 99 | |
2c2e8978 NS |
100 | /* We've found more than one matching binfo. */ |
101 | if (!data->want_any) | |
102 | { | |
103 | /* This is immediately ambiguous. */ | |
104 | data->binfo = NULL_TREE; | |
105 | data->ambiguous = true; | |
106 | return error_mark_node; | |
107 | } | |
108 | ||
109 | /* Prefer one via a non-virtual path. */ | |
110 | if (!binfo_via_virtual (binfo, data->t)) | |
111 | { | |
112 | data->binfo = binfo; | |
113 | data->via_virtual = false; | |
114 | return binfo; | |
115 | } | |
127b8136 | 116 | |
2c2e8978 NS |
117 | /* There must be repeated bases, otherwise we'd have stopped |
118 | on the first base we found. */ | |
119 | return dfs_skip_bases; | |
338d90b8 NS |
120 | } |
121 | } | |
c8094d83 | 122 | |
2c2e8978 | 123 | return NULL_TREE; |
338d90b8 NS |
124 | } |
125 | ||
7e0f147a AS |
126 | /* This deals with bug PR17314. |
127 | ||
128 | DECL is a declaration and BINFO represents a class that has attempted (but | |
129 | failed) to access DECL. | |
130 | ||
131 | Examine the parent binfos of BINFO and determine whether any of them had | |
132 | private access to DECL. If they did, return the parent binfo. This helps | |
133 | in figuring out the correct error message to show (if the parents had | |
134 | access, it's their fault for not giving sufficient access to BINFO). | |
135 | ||
136 | If no parents had access, return NULL_TREE. */ | |
137 | ||
138 | tree | |
139 | get_parent_with_private_access (tree decl, tree binfo) | |
140 | { | |
141 | /* Only BINFOs should come through here. */ | |
142 | gcc_assert (TREE_CODE (binfo) == TREE_BINFO); | |
143 | ||
144 | tree base_binfo = NULL_TREE; | |
145 | ||
146 | /* Iterate through immediate parent classes. */ | |
147 | for (int i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
148 | { | |
149 | /* This parent had private access. Therefore that's why BINFO can't | |
150 | access DECL. */ | |
151 | if (access_in_type (BINFO_TYPE (base_binfo), decl) == ak_private) | |
152 | return base_binfo; | |
153 | } | |
154 | ||
155 | /* None of the parents had access. Note: it's impossible for one of the | |
156 | parents to have had public or protected access to DECL, since then | |
157 | BINFO would have been able to access DECL too. */ | |
158 | return NULL_TREE; | |
159 | } | |
160 | ||
bd16cb25 | 161 | /* Returns true if type BASE is accessible in T. (BASE is known to be |
18e4be85 NS |
162 | a (possibly non-proper) base class of T.) If CONSIDER_LOCAL_P is |
163 | true, consider any special access of the current scope, or access | |
164 | bestowed by friendship. */ | |
bd16cb25 MM |
165 | |
166 | bool | |
18e4be85 | 167 | accessible_base_p (tree t, tree base, bool consider_local_p) |
bd16cb25 MM |
168 | { |
169 | tree decl; | |
170 | ||
171 | /* [class.access.base] | |
172 | ||
173 | A base class is said to be accessible if an invented public | |
c8094d83 | 174 | member of the base class is accessible. |
26bcf8fc MM |
175 | |
176 | If BASE is a non-proper base, this condition is trivially | |
177 | true. */ | |
178 | if (same_type_p (t, base)) | |
179 | return true; | |
bd16cb25 MM |
180 | /* Rather than inventing a public member, we use the implicit |
181 | public typedef created in the scope of every class. */ | |
182 | decl = TYPE_FIELDS (base); | |
183 | while (!DECL_SELF_REFERENCE_P (decl)) | |
910ad8de | 184 | decl = DECL_CHAIN (decl); |
bd16cb25 MM |
185 | while (ANON_AGGR_TYPE_P (t)) |
186 | t = TYPE_CONTEXT (t); | |
18e4be85 | 187 | return accessible_p (t, decl, consider_local_p); |
bd16cb25 MM |
188 | } |
189 | ||
338d90b8 | 190 | /* Lookup BASE in the hierarchy dominated by T. Do access checking as |
dbbf88d1 NS |
191 | ACCESS specifies. Return the binfo we discover. If KIND_PTR is |
192 | non-NULL, fill with information about what kind of base we | |
193 | discovered. | |
338d90b8 | 194 | |
22854930 PC |
195 | If the base is inaccessible, or ambiguous, then error_mark_node is |
196 | returned. If the tf_error bit of COMPLAIN is not set, no error | |
197 | is issued. */ | |
338d90b8 NS |
198 | |
199 | tree | |
22854930 PC |
200 | lookup_base (tree t, tree base, base_access access, |
201 | base_kind *kind_ptr, tsubst_flags_t complain) | |
338d90b8 | 202 | { |
2c2e8978 NS |
203 | tree binfo; |
204 | tree t_binfo; | |
338d90b8 | 205 | base_kind bk; |
c8094d83 | 206 | |
ca2e264d JM |
207 | /* "Nothing" is definitely not derived from Base. */ |
208 | if (t == NULL_TREE) | |
209 | { | |
210 | if (kind_ptr) | |
211 | *kind_ptr = bk_not_base; | |
212 | return NULL_TREE; | |
213 | } | |
214 | ||
338d90b8 NS |
215 | if (t == error_mark_node || base == error_mark_node) |
216 | { | |
217 | if (kind_ptr) | |
218 | *kind_ptr = bk_not_base; | |
219 | return error_mark_node; | |
220 | } | |
50bc768d | 221 | gcc_assert (TYPE_P (base)); |
c8094d83 | 222 | |
4ba126e4 MM |
223 | if (!TYPE_P (t)) |
224 | { | |
225 | t_binfo = t; | |
226 | t = BINFO_TYPE (t); | |
227 | } | |
2c2e8978 | 228 | else |
cad7e87b NS |
229 | { |
230 | t = complete_type (TYPE_MAIN_VARIANT (t)); | |
d9338471 JM |
231 | if (dependent_type_p (t)) |
232 | if (tree open = currently_open_class (t)) | |
233 | t = open; | |
cad7e87b NS |
234 | t_binfo = TYPE_BINFO (t); |
235 | } | |
c8094d83 | 236 | |
f4ecc8fd | 237 | base = TYPE_MAIN_VARIANT (base); |
cad7e87b | 238 | |
f4ecc8fd JM |
239 | /* If BASE is incomplete, it can't be a base of T--and instantiating it |
240 | might cause an error. */ | |
01628e54 | 241 | if (t_binfo && CLASS_TYPE_P (base) && COMPLETE_OR_OPEN_TYPE_P (base)) |
2c2e8978 NS |
242 | { |
243 | struct lookup_base_data_s data; | |
244 | ||
245 | data.t = t; | |
246 | data.base = base; | |
247 | data.binfo = NULL_TREE; | |
248 | data.ambiguous = data.via_virtual = false; | |
249 | data.repeated_base = CLASSTYPE_REPEATED_BASE_P (t); | |
250 | data.want_any = access == ba_any; | |
251 | ||
252 | dfs_walk_once (t_binfo, dfs_lookup_base, NULL, &data); | |
253 | binfo = data.binfo; | |
c8094d83 | 254 | |
2c2e8978 NS |
255 | if (!binfo) |
256 | bk = data.ambiguous ? bk_ambig : bk_not_base; | |
257 | else if (binfo == t_binfo) | |
258 | bk = bk_same_type; | |
259 | else if (data.via_virtual) | |
260 | bk = bk_via_virtual; | |
261 | else | |
262 | bk = bk_proper_base; | |
263 | } | |
cad7e87b | 264 | else |
2c2e8978 NS |
265 | { |
266 | binfo = NULL_TREE; | |
267 | bk = bk_not_base; | |
268 | } | |
338d90b8 | 269 | |
e80706c4 MM |
270 | /* Check that the base is unambiguous and accessible. */ |
271 | if (access != ba_any) | |
272 | switch (bk) | |
273 | { | |
274 | case bk_not_base: | |
275 | break; | |
276 | ||
277 | case bk_ambig: | |
22854930 PC |
278 | if (complain & tf_error) |
279 | error ("%qT is an ambiguous base of %qT", base, t); | |
280 | binfo = error_mark_node; | |
e80706c4 MM |
281 | break; |
282 | ||
283 | default: | |
18e4be85 | 284 | if ((access & ba_check_bit) |
e80706c4 MM |
285 | /* If BASE is incomplete, then BASE and TYPE are probably |
286 | the same, in which case BASE is accessible. If they | |
287 | are not the same, then TYPE is invalid. In that case, | |
288 | there's no need to issue another error here, and | |
289 | there's no implicit typedef to use in the code that | |
290 | follows, so we skip the check. */ | |
bd16cb25 | 291 | && COMPLETE_TYPE_P (base) |
18e4be85 | 292 | && !accessible_base_p (t, base, !(access & ba_ignore_scope))) |
e80706c4 | 293 | { |
22854930 PC |
294 | if (complain & tf_error) |
295 | error ("%qT is an inaccessible base of %qT", base, t); | |
296 | binfo = error_mark_node; | |
bd16cb25 | 297 | bk = bk_inaccessible; |
e80706c4 MM |
298 | } |
299 | break; | |
300 | } | |
301 | ||
338d90b8 NS |
302 | if (kind_ptr) |
303 | *kind_ptr = bk; | |
c8094d83 | 304 | |
338d90b8 NS |
305 | return binfo; |
306 | } | |
307 | ||
6936e493 | 308 | /* Data for dcast_base_hint walker. */ |
4a9e5c67 | 309 | |
6936e493 | 310 | struct dcast_data_s |
4a9e5c67 | 311 | { |
6936e493 NS |
312 | tree subtype; /* The base type we're looking for. */ |
313 | int virt_depth; /* Number of virtual bases encountered from most | |
314 | derived. */ | |
315 | tree offset; /* Best hint offset discovered so far. */ | |
316 | bool repeated_base; /* Whether there are repeated bases in the | |
d740dbe7 | 317 | hierarchy. */ |
6936e493 NS |
318 | }; |
319 | ||
320 | /* Worker for dcast_base_hint. Search for the base type being cast | |
321 | from. */ | |
322 | ||
323 | static tree | |
324 | dfs_dcast_hint_pre (tree binfo, void *data_) | |
325 | { | |
67f5655f | 326 | struct dcast_data_s *data = (struct dcast_data_s *) data_; |
6936e493 NS |
327 | |
328 | if (BINFO_VIRTUAL_P (binfo)) | |
329 | data->virt_depth++; | |
c8094d83 | 330 | |
6936e493 | 331 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->subtype)) |
4a9e5c67 | 332 | { |
6936e493 NS |
333 | if (data->virt_depth) |
334 | { | |
335 | data->offset = ssize_int (-1); | |
336 | return data->offset; | |
337 | } | |
338 | if (data->offset) | |
339 | data->offset = ssize_int (-3); | |
4a9e5c67 | 340 | else |
6936e493 NS |
341 | data->offset = BINFO_OFFSET (binfo); |
342 | ||
343 | return data->repeated_base ? dfs_skip_bases : data->offset; | |
4a9e5c67 | 344 | } |
6936e493 NS |
345 | |
346 | return NULL_TREE; | |
347 | } | |
348 | ||
349 | /* Worker for dcast_base_hint. Track the virtual depth. */ | |
350 | ||
351 | static tree | |
352 | dfs_dcast_hint_post (tree binfo, void *data_) | |
353 | { | |
67f5655f | 354 | struct dcast_data_s *data = (struct dcast_data_s *) data_; |
6936e493 NS |
355 | |
356 | if (BINFO_VIRTUAL_P (binfo)) | |
357 | data->virt_depth--; | |
358 | ||
359 | return NULL_TREE; | |
4a9e5c67 NS |
360 | } |
361 | ||
f08dda39 NS |
362 | /* The dynamic cast runtime needs a hint about how the static SUBTYPE type |
363 | started from is related to the required TARGET type, in order to optimize | |
306ef644 | 364 | the inheritance graph search. This information is independent of the |
4a9e5c67 NS |
365 | current context, and ignores private paths, hence get_base_distance is |
366 | inappropriate. Return a TREE specifying the base offset, BOFF. | |
367 | BOFF >= 0, there is only one public non-virtual SUBTYPE base at offset BOFF, | |
368 | and there are no public virtual SUBTYPE bases. | |
f08dda39 NS |
369 | BOFF == -1, SUBTYPE occurs as multiple public virtual or non-virtual bases. |
370 | BOFF == -2, SUBTYPE is not a public base. | |
371 | BOFF == -3, SUBTYPE occurs as multiple public non-virtual bases. */ | |
4a9e5c67 NS |
372 | |
373 | tree | |
6936e493 | 374 | dcast_base_hint (tree subtype, tree target) |
4a9e5c67 | 375 | { |
6936e493 NS |
376 | struct dcast_data_s data; |
377 | ||
378 | data.subtype = subtype; | |
379 | data.virt_depth = 0; | |
380 | data.offset = NULL_TREE; | |
381 | data.repeated_base = CLASSTYPE_REPEATED_BASE_P (target); | |
c8094d83 | 382 | |
6936e493 NS |
383 | dfs_walk_once_accessible (TYPE_BINFO (target), /*friends=*/false, |
384 | dfs_dcast_hint_pre, dfs_dcast_hint_post, &data); | |
385 | return data.offset ? data.offset : ssize_int (-2); | |
4a9e5c67 NS |
386 | } |
387 | ||
c717c5af MM |
388 | /* Search for a member with name NAME in a multiple inheritance |
389 | lattice specified by TYPE. If it does not exist, return NULL_TREE. | |
8d08fdba | 390 | If the member is ambiguously referenced, return `error_mark_node'. |
c717c5af MM |
391 | Otherwise, return a DECL with the indicated name. If WANT_TYPE is |
392 | true, type declarations are preferred. */ | |
8d08fdba | 393 | |
a5201a91 | 394 | /* Return the FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, or |
c8094d83 | 395 | NAMESPACE_DECL corresponding to the innermost non-block scope. */ |
a5201a91 MM |
396 | |
397 | tree | |
6ac1920d | 398 | current_scope (void) |
a5201a91 MM |
399 | { |
400 | /* There are a number of cases we need to be aware of here: | |
7177d104 | 401 | current_class_type current_function_decl |
e92cc029 MS |
402 | global NULL NULL |
403 | fn-local NULL SET | |
404 | class-local SET NULL | |
405 | class->fn SET SET | |
406 | fn->class SET SET | |
7177d104 | 407 | |
a5201a91 MM |
408 | Those last two make life interesting. If we're in a function which is |
409 | itself inside a class, we need decls to go into the fn's decls (our | |
410 | second case below). But if we're in a class and the class itself is | |
411 | inside a function, we need decls to go into the decls for the class. To | |
412 | achieve this last goal, we must see if, when both current_class_ptr and | |
413 | current_function_decl are set, the class was declared inside that | |
414 | function. If so, we know to put the decls into the class's scope. */ | |
415 | if (current_function_decl && current_class_type | |
416 | && ((DECL_FUNCTION_MEMBER_P (current_function_decl) | |
417 | && same_type_p (DECL_CONTEXT (current_function_decl), | |
418 | current_class_type)) | |
419 | || (DECL_FRIEND_CONTEXT (current_function_decl) | |
420 | && same_type_p (DECL_FRIEND_CONTEXT (current_function_decl), | |
421 | current_class_type)))) | |
8d08fdba | 422 | return current_function_decl; |
e9888922 | 423 | |
a5201a91 MM |
424 | if (current_class_type) |
425 | return current_class_type; | |
e9888922 | 426 | |
a5201a91 | 427 | if (current_function_decl) |
8d08fdba | 428 | return current_function_decl; |
e9888922 | 429 | |
a5201a91 | 430 | return current_namespace; |
8d08fdba MS |
431 | } |
432 | ||
838dfd8a | 433 | /* Returns nonzero if we are currently in a function scope. Note |
9188c363 MM |
434 | that this function returns zero if we are within a local class, but |
435 | not within a member function body of the local class. */ | |
436 | ||
437 | int | |
edaf3e03 | 438 | at_function_scope_p (void) |
9188c363 MM |
439 | { |
440 | tree cs = current_scope (); | |
ef2361a9 JM |
441 | /* Also check cfun to make sure that we're really compiling |
442 | this function (as opposed to having set current_function_decl | |
443 | for access checking or some such). */ | |
444 | return (cs && TREE_CODE (cs) == FUNCTION_DECL | |
445 | && cfun && cfun->decl == current_function_decl); | |
9188c363 MM |
446 | } |
447 | ||
5f261ba9 MM |
448 | /* Returns true if the innermost active scope is a class scope. */ |
449 | ||
450 | bool | |
edaf3e03 | 451 | at_class_scope_p (void) |
5f261ba9 MM |
452 | { |
453 | tree cs = current_scope (); | |
454 | return cs && TYPE_P (cs); | |
455 | } | |
456 | ||
afb0918a MM |
457 | /* Returns true if the innermost active scope is a namespace scope. */ |
458 | ||
459 | bool | |
460 | at_namespace_scope_p (void) | |
461 | { | |
a5201a91 MM |
462 | tree cs = current_scope (); |
463 | return cs && TREE_CODE (cs) == NAMESPACE_DECL; | |
afb0918a MM |
464 | } |
465 | ||
d6479fe7 | 466 | /* Return the scope of DECL, as appropriate when doing name-lookup. */ |
8d08fdba | 467 | |
55de1b66 | 468 | tree |
86ac0575 | 469 | context_for_name_lookup (tree decl) |
d6479fe7 MM |
470 | { |
471 | /* [class.union] | |
c8094d83 | 472 | |
d6479fe7 MM |
473 | For the purposes of name lookup, after the anonymous union |
474 | definition, the members of the anonymous union are considered to | |
834c6dff | 475 | have been defined in the scope in which the anonymous union is |
c8094d83 | 476 | declared. */ |
55de1b66 | 477 | tree context = DECL_CONTEXT (decl); |
d6479fe7 | 478 | |
8d0d1915 JM |
479 | while (context && TYPE_P (context) |
480 | && (ANON_AGGR_TYPE_P (context) || UNSCOPED_ENUM_P (context))) | |
d6479fe7 MM |
481 | context = TYPE_CONTEXT (context); |
482 | if (!context) | |
483 | context = global_namespace; | |
8d08fdba | 484 | |
d6479fe7 MM |
485 | return context; |
486 | } | |
8d08fdba | 487 | |
7ac2c0bd JM |
488 | /* Returns true iff DECL is declared in TYPE. */ |
489 | ||
490 | static bool | |
491 | member_declared_in_type (tree decl, tree type) | |
492 | { | |
493 | /* A normal declaration obviously counts. */ | |
494 | if (context_for_name_lookup (decl) == type) | |
495 | return true; | |
496 | /* So does a using or access declaration. */ | |
497 | if (DECL_LANG_SPECIFIC (decl) && !DECL_DISCRIMINATOR_P (decl) | |
498 | && purpose_member (type, DECL_ACCESS (decl))) | |
499 | return true; | |
500 | return false; | |
501 | } | |
502 | ||
c35cce41 | 503 | /* The accessibility routines use BINFO_ACCESS for scratch space |
cd0be382 | 504 | during the computation of the accessibility of some declaration. */ |
c35cce41 | 505 | |
7ac2c0bd JM |
506 | /* Avoid walking up past a declaration of the member. */ |
507 | ||
508 | static tree | |
509 | dfs_access_in_type_pre (tree binfo, void *data) | |
510 | { | |
511 | tree decl = (tree) data; | |
512 | tree type = BINFO_TYPE (binfo); | |
513 | if (member_declared_in_type (decl, type)) | |
514 | return dfs_skip_bases; | |
515 | return NULL_TREE; | |
516 | } | |
517 | ||
c35cce41 | 518 | #define BINFO_ACCESS(NODE) \ |
dbbf88d1 | 519 | ((access_kind) ((TREE_PUBLIC (NODE) << 1) | TREE_PRIVATE (NODE))) |
c35cce41 MM |
520 | |
521 | /* Set the access associated with NODE to ACCESS. */ | |
522 | ||
523 | #define SET_BINFO_ACCESS(NODE, ACCESS) \ | |
dbbf88d1 NS |
524 | ((TREE_PUBLIC (NODE) = ((ACCESS) & 2) != 0), \ |
525 | (TREE_PRIVATE (NODE) = ((ACCESS) & 1) != 0)) | |
c35cce41 | 526 | |
d6479fe7 MM |
527 | /* Called from access_in_type via dfs_walk. Calculate the access to |
528 | DATA (which is really a DECL) in BINFO. */ | |
eae89e04 | 529 | |
d6479fe7 | 530 | static tree |
86ac0575 | 531 | dfs_access_in_type (tree binfo, void *data) |
d6479fe7 MM |
532 | { |
533 | tree decl = (tree) data; | |
534 | tree type = BINFO_TYPE (binfo); | |
c35cce41 | 535 | access_kind access = ak_none; |
8d08fdba | 536 | |
d6479fe7 | 537 | if (context_for_name_lookup (decl) == type) |
8d08fdba | 538 | { |
a653d067 | 539 | /* If we have descended to the scope of DECL, just note the |
d6479fe7 MM |
540 | appropriate access. */ |
541 | if (TREE_PRIVATE (decl)) | |
c35cce41 | 542 | access = ak_private; |
d6479fe7 | 543 | else if (TREE_PROTECTED (decl)) |
c35cce41 | 544 | access = ak_protected; |
d6479fe7 | 545 | else |
c35cce41 | 546 | access = ak_public; |
8d08fdba | 547 | } |
c8094d83 | 548 | else |
d6479fe7 MM |
549 | { |
550 | /* First, check for an access-declaration that gives us more | |
8d0d1915 | 551 | access to the DECL. */ |
8e4ce833 | 552 | if (DECL_LANG_SPECIFIC (decl) && !DECL_DISCRIMINATOR_P (decl)) |
d6479fe7 | 553 | { |
c35cce41 | 554 | tree decl_access = purpose_member (type, DECL_ACCESS (decl)); |
c8094d83 | 555 | |
c35cce41 | 556 | if (decl_access) |
dbbf88d1 NS |
557 | { |
558 | decl_access = TREE_VALUE (decl_access); | |
c8094d83 | 559 | |
dbbf88d1 NS |
560 | if (decl_access == access_public_node) |
561 | access = ak_public; | |
562 | else if (decl_access == access_protected_node) | |
563 | access = ak_protected; | |
564 | else if (decl_access == access_private_node) | |
565 | access = ak_private; | |
566 | else | |
50bc768d | 567 | gcc_unreachable (); |
dbbf88d1 | 568 | } |
d6479fe7 MM |
569 | } |
570 | ||
571 | if (!access) | |
572 | { | |
573 | int i; | |
63d1c7b3 | 574 | tree base_binfo; |
9771b263 | 575 | vec<tree, va_gc> *accesses; |
c8094d83 | 576 | |
d6479fe7 MM |
577 | /* Otherwise, scan our baseclasses, and pick the most favorable |
578 | access. */ | |
604a3205 | 579 | accesses = BINFO_BASE_ACCESSES (binfo); |
fa743e8c | 580 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) |
d6479fe7 | 581 | { |
9771b263 | 582 | tree base_access = (*accesses)[i]; |
dbbf88d1 | 583 | access_kind base_access_now = BINFO_ACCESS (base_binfo); |
d6479fe7 | 584 | |
dbbf88d1 | 585 | if (base_access_now == ak_none || base_access_now == ak_private) |
d6479fe7 MM |
586 | /* If it was not accessible in the base, or only |
587 | accessible as a private member, we can't access it | |
588 | all. */ | |
dbbf88d1 NS |
589 | base_access_now = ak_none; |
590 | else if (base_access == access_protected_node) | |
591 | /* Public and protected members in the base become | |
d6479fe7 | 592 | protected here. */ |
dbbf88d1 NS |
593 | base_access_now = ak_protected; |
594 | else if (base_access == access_private_node) | |
595 | /* Public and protected members in the base become | |
d6479fe7 | 596 | private here. */ |
dbbf88d1 | 597 | base_access_now = ak_private; |
d6479fe7 MM |
598 | |
599 | /* See if the new access, via this base, gives more | |
600 | access than our previous best access. */ | |
dbbf88d1 NS |
601 | if (base_access_now != ak_none |
602 | && (access == ak_none || base_access_now < access)) | |
d6479fe7 | 603 | { |
dbbf88d1 | 604 | access = base_access_now; |
8d08fdba | 605 | |
d6479fe7 | 606 | /* If the new access is public, we can't do better. */ |
c35cce41 | 607 | if (access == ak_public) |
d6479fe7 MM |
608 | break; |
609 | } | |
610 | } | |
611 | } | |
612 | } | |
faae18ab | 613 | |
d6479fe7 | 614 | /* Note the access to DECL in TYPE. */ |
c35cce41 | 615 | SET_BINFO_ACCESS (binfo, access); |
02020185 | 616 | |
d6479fe7 MM |
617 | return NULL_TREE; |
618 | } | |
8d08fdba | 619 | |
d6479fe7 | 620 | /* Return the access to DECL in TYPE. */ |
8d08fdba | 621 | |
c35cce41 | 622 | static access_kind |
86ac0575 | 623 | access_in_type (tree type, tree decl) |
d6479fe7 MM |
624 | { |
625 | tree binfo = TYPE_BINFO (type); | |
8d08fdba | 626 | |
d6479fe7 | 627 | /* We must take into account |
8d08fdba | 628 | |
d6479fe7 | 629 | [class.paths] |
8d08fdba | 630 | |
d6479fe7 MM |
631 | If a name can be reached by several paths through a multiple |
632 | inheritance graph, the access is that of the path that gives | |
c8094d83 | 633 | most access. |
8d08fdba | 634 | |
d6479fe7 MM |
635 | The algorithm we use is to make a post-order depth-first traversal |
636 | of the base-class hierarchy. As we come up the tree, we annotate | |
637 | each node with the most lenient access. */ | |
7ac2c0bd | 638 | dfs_walk_once (binfo, dfs_access_in_type_pre, dfs_access_in_type, decl); |
8d08fdba | 639 | |
c35cce41 | 640 | return BINFO_ACCESS (binfo); |
d6479fe7 MM |
641 | } |
642 | ||
7ac2c0bd JM |
643 | /* Returns nonzero if it is OK to access DECL named in TYPE through an object |
644 | of OTYPE in the context of DERIVED. */ | |
6a629cac MM |
645 | |
646 | static int | |
7ac2c0bd | 647 | protected_accessible_p (tree decl, tree derived, tree type, tree otype) |
6a629cac | 648 | { |
6a629cac MM |
649 | /* We're checking this clause from [class.access.base] |
650 | ||
651 | m as a member of N is protected, and the reference occurs in a | |
652 | member or friend of class N, or in a member or friend of a | |
1ceb2263 JM |
653 | class P derived from N, where m as a member of P is public, private |
654 | or protected. | |
6a629cac | 655 | |
7ac2c0bd | 656 | Here DERIVED is a possible P, DECL is m and TYPE is N. */ |
d7cca31e | 657 | |
1ceb2263 | 658 | /* If DERIVED isn't derived from N, then it can't be a P. */ |
7ac2c0bd | 659 | if (!DERIVED_FROM_P (type, derived)) |
6a629cac | 660 | return 0; |
c8094d83 | 661 | |
10839133 AO |
662 | /* DECL_NONSTATIC_MEMBER_P won't work for USING_DECLs. */ |
663 | decl = strip_using_decl (decl); | |
664 | /* We don't expect or support dependent decls. */ | |
665 | gcc_assert (TREE_CODE (decl) != USING_DECL); | |
666 | ||
6a629cac MM |
667 | /* [class.protected] |
668 | ||
669 | When a friend or a member function of a derived class references | |
d20b7173 | 670 | a protected non-static member of a base class, an access check |
6a629cac | 671 | applies in addition to those described earlier in clause |
d7cca31e | 672 | _class.access_) Except when forming a pointer to member |
6a629cac MM |
673 | (_expr.unary.op_), the access must be through a pointer to, |
674 | reference to, or object of the derived class itself (or any class | |
675 | derived from that class) (_expr.ref_). If the access is to form | |
676 | a pointer to member, the nested-name-specifier shall name the | |
677 | derived class (or any class derived from that class). */ | |
7ac2c0bd JM |
678 | if (DECL_NONSTATIC_MEMBER_P (decl) |
679 | && !DERIVED_FROM_P (derived, otype)) | |
680 | return 0; | |
6a629cac MM |
681 | |
682 | return 1; | |
683 | } | |
684 | ||
7ac2c0bd JM |
685 | /* Returns nonzero if SCOPE is a type or a friend of a type which would be able |
686 | to access DECL through TYPE. OTYPE is the type of the object. */ | |
6a629cac MM |
687 | |
688 | static int | |
7ac2c0bd | 689 | friend_accessible_p (tree scope, tree decl, tree type, tree otype) |
6a629cac | 690 | { |
7ac2c0bd JM |
691 | /* We're checking this clause from [class.access.base] |
692 | ||
693 | m as a member of N is protected, and the reference occurs in a | |
694 | member or friend of class N, or in a member or friend of a | |
695 | class P derived from N, where m as a member of P is public, private | |
696 | or protected. | |
697 | ||
698 | Here DECL is m and TYPE is N. SCOPE is the current context, | |
699 | and we check all its possible Ps. */ | |
6a629cac MM |
700 | tree befriending_classes; |
701 | tree t; | |
702 | ||
703 | if (!scope) | |
704 | return 0; | |
705 | ||
8db29d88 AO |
706 | if (is_global_friend (scope)) |
707 | return 1; | |
708 | ||
7ac2c0bd JM |
709 | /* Is SCOPE itself a suitable P? */ |
710 | if (TYPE_P (scope) && protected_accessible_p (decl, scope, type, otype)) | |
711 | return 1; | |
712 | ||
9ededfc5 | 713 | if (DECL_DECLARES_FUNCTION_P (scope)) |
6a629cac MM |
714 | befriending_classes = DECL_BEFRIENDING_CLASSES (scope); |
715 | else if (TYPE_P (scope)) | |
716 | befriending_classes = CLASSTYPE_BEFRIENDING_CLASSES (scope); | |
717 | else | |
718 | return 0; | |
719 | ||
720 | for (t = befriending_classes; t; t = TREE_CHAIN (t)) | |
7ac2c0bd | 721 | if (protected_accessible_p (decl, TREE_VALUE (t), type, otype)) |
6a629cac MM |
722 | return 1; |
723 | ||
03b1c206 | 724 | /* Nested classes have the same access as their enclosing types, as |
7ac2c0bd | 725 | per DR 45 (this is a change from C++98). */ |
445ab443 | 726 | if (TYPE_P (scope)) |
7ac2c0bd JM |
727 | if (friend_accessible_p (TYPE_CONTEXT (scope), decl, type, otype)) |
728 | return 1; | |
445ab443 | 729 | |
9ededfc5 | 730 | if (DECL_DECLARES_FUNCTION_P (scope)) |
6a629cac | 731 | { |
c8094d83 MS |
732 | /* Perhaps this SCOPE is a member of a class which is a |
733 | friend. */ | |
18e4be85 | 734 | if (DECL_CLASS_SCOPE_P (scope) |
7ac2c0bd | 735 | && friend_accessible_p (DECL_CONTEXT (scope), decl, type, otype)) |
6a629cac | 736 | return 1; |
29853c65 | 737 | /* Perhaps SCOPE is a friend function defined inside a class from which |
4df735e0 | 738 | DECL is accessible. */ |
29853c65 | 739 | if (tree fctx = DECL_FRIEND_CONTEXT (scope)) |
4df735e0 | 740 | if (friend_accessible_p (fctx, decl, type, otype)) |
29853c65 | 741 | return 1; |
7ac2c0bd | 742 | } |
6a629cac | 743 | |
7ac2c0bd JM |
744 | /* Maybe scope's template is a friend. */ |
745 | if (tree tinfo = get_template_info (scope)) | |
746 | { | |
747 | tree tmpl = TI_TEMPLATE (tinfo); | |
748 | if (DECL_CLASS_TEMPLATE_P (tmpl)) | |
749 | tmpl = TREE_TYPE (tmpl); | |
750 | else | |
751 | tmpl = DECL_TEMPLATE_RESULT (tmpl); | |
752 | if (tmpl != scope) | |
e59f7322 | 753 | { |
e59f7322 KL |
754 | /* Increment processing_template_decl to make sure that |
755 | dependent_type_p works correctly. */ | |
756 | ++processing_template_decl; | |
7ac2c0bd | 757 | int ret = friend_accessible_p (tmpl, decl, type, otype); |
e59f7322 | 758 | --processing_template_decl; |
7ac2c0bd JM |
759 | if (ret) |
760 | return 1; | |
e59f7322 | 761 | } |
6a629cac | 762 | } |
6a629cac | 763 | |
7ac2c0bd JM |
764 | /* If is_friend is true, we should have found a befriending class. */ |
765 | gcc_checking_assert (!is_friend (type, scope)); | |
766 | ||
6a629cac | 767 | return 0; |
70adf8a9 JM |
768 | } |
769 | ||
7ac2c0bd JM |
770 | struct dfs_accessible_data |
771 | { | |
772 | tree decl; | |
773 | tree object_type; | |
774 | }; | |
775 | ||
776 | /* Avoid walking up past a declaration of the member. */ | |
777 | ||
778 | static tree | |
779 | dfs_accessible_pre (tree binfo, void *data) | |
780 | { | |
781 | dfs_accessible_data *d = (dfs_accessible_data *)data; | |
782 | tree type = BINFO_TYPE (binfo); | |
783 | if (member_declared_in_type (d->decl, type)) | |
784 | return dfs_skip_bases; | |
785 | return NULL_TREE; | |
786 | } | |
787 | ||
6936e493 NS |
788 | /* Called via dfs_walk_once_accessible from accessible_p */ |
789 | ||
5d5a519f | 790 | static tree |
7ac2c0bd | 791 | dfs_accessible_post (tree binfo, void *data) |
5d5a519f | 792 | { |
7ac2c0bd JM |
793 | /* access_in_type already set BINFO_ACCESS for us. */ |
794 | access_kind access = BINFO_ACCESS (binfo); | |
795 | tree N = BINFO_TYPE (binfo); | |
796 | dfs_accessible_data *d = (dfs_accessible_data *)data; | |
797 | tree decl = d->decl; | |
798 | tree scope = current_nonlambda_scope (); | |
799 | ||
800 | /* A member m is accessible at the point R when named in class N if */ | |
801 | switch (access) | |
a5201a91 | 802 | { |
7ac2c0bd JM |
803 | case ak_none: |
804 | return NULL_TREE; | |
c8094d83 | 805 | |
7ac2c0bd JM |
806 | case ak_public: |
807 | /* m as a member of N is public, or */ | |
808 | return binfo; | |
809 | ||
810 | case ak_private: | |
811 | { | |
812 | /* m as a member of N is private, and R occurs in a member or friend of | |
813 | class N, or */ | |
814 | if (scope && TREE_CODE (scope) != NAMESPACE_DECL | |
815 | && is_friend (N, scope)) | |
816 | return binfo; | |
817 | return NULL_TREE; | |
818 | } | |
819 | ||
820 | case ak_protected: | |
821 | { | |
822 | /* m as a member of N is protected, and R occurs in a member or friend | |
823 | of class N, or in a member or friend of a class P derived from N, | |
824 | where m as a member of P is public, private, or protected */ | |
825 | if (friend_accessible_p (scope, decl, N, d->object_type)) | |
826 | return binfo; | |
827 | return NULL_TREE; | |
828 | } | |
829 | ||
830 | default: | |
831 | gcc_unreachable (); | |
832 | } | |
5d5a519f NS |
833 | } |
834 | ||
cf3c30d3 JM |
835 | /* Like accessible_p below, but within a template returns true iff DECL is |
836 | accessible in TYPE to all possible instantiations of the template. */ | |
837 | ||
838 | int | |
839 | accessible_in_template_p (tree type, tree decl) | |
840 | { | |
841 | int save_ptd = processing_template_decl; | |
842 | processing_template_decl = 0; | |
843 | int val = accessible_p (type, decl, false); | |
844 | processing_template_decl = save_ptd; | |
845 | return val; | |
846 | } | |
847 | ||
d6479fe7 | 848 | /* DECL is a declaration from a base class of TYPE, which was the |
838dfd8a | 849 | class used to name DECL. Return nonzero if, in the current |
d6479fe7 | 850 | context, DECL is accessible. If TYPE is actually a BINFO node, |
8084bf81 | 851 | then we can tell in what context the access is occurring by looking |
18e4be85 NS |
852 | at the most derived class along the path indicated by BINFO. If |
853 | CONSIDER_LOCAL is true, do consider special access the current | |
03fd3f84 | 854 | scope or friendship thereof we might have. */ |
d6479fe7 | 855 | |
c8094d83 | 856 | int |
18e4be85 | 857 | accessible_p (tree type, tree decl, bool consider_local_p) |
d6479fe7 | 858 | { |
d6479fe7 | 859 | tree binfo; |
a653d067 | 860 | access_kind access; |
d6479fe7 | 861 | |
d6479fe7 MM |
862 | /* If this declaration is in a block or namespace scope, there's no |
863 | access control. */ | |
864 | if (!TYPE_P (context_for_name_lookup (decl))) | |
865 | return 1; | |
866 | ||
0e8c9b28 | 867 | /* There is no need to perform access checks inside a thunk. */ |
7ac2c0bd | 868 | if (current_function_decl && DECL_THUNK_P (current_function_decl)) |
0e8c9b28 MM |
869 | return 1; |
870 | ||
b850dd2f | 871 | tree otype = NULL_TREE; |
d6479fe7 MM |
872 | if (!TYPE_P (type)) |
873 | { | |
7ac2c0bd JM |
874 | /* When accessing a non-static member, the most derived type in the |
875 | binfo chain is the type of the object; remember that type for | |
876 | protected_accessible_p. */ | |
877 | for (tree b = type; b; b = BINFO_INHERITANCE_CHAIN (b)) | |
878 | otype = BINFO_TYPE (b); | |
d6479fe7 | 879 | type = BINFO_TYPE (type); |
8d08fdba | 880 | } |
d6479fe7 | 881 | else |
7ac2c0bd | 882 | otype = type; |
d6479fe7 MM |
883 | |
884 | /* [class.access.base] | |
885 | ||
886 | A member m is accessible when named in class N if | |
887 | ||
888 | --m as a member of N is public, or | |
8d08fdba | 889 | |
d6479fe7 MM |
890 | --m as a member of N is private, and the reference occurs in a |
891 | member or friend of class N, or | |
8d08fdba | 892 | |
d6479fe7 MM |
893 | --m as a member of N is protected, and the reference occurs in a |
894 | member or friend of class N, or in a member or friend of a | |
7ac2c0bd | 895 | class P derived from N, where m as a member of P is public, private or |
d6479fe7 MM |
896 | protected, or |
897 | ||
898 | --there exists a base class B of N that is accessible at the point | |
c8094d83 | 899 | of reference, and m is accessible when named in class B. |
d6479fe7 MM |
900 | |
901 | We walk the base class hierarchy, checking these conditions. */ | |
902 | ||
7ac2c0bd JM |
903 | /* We walk using TYPE_BINFO (type) because access_in_type will set |
904 | BINFO_ACCESS on it and its bases. */ | |
d6479fe7 MM |
905 | binfo = TYPE_BINFO (type); |
906 | ||
907 | /* Compute the accessibility of DECL in the class hierarchy | |
908 | dominated by type. */ | |
a653d067 | 909 | access = access_in_type (type, decl); |
7ac2c0bd | 910 | if (access == ak_public) |
a653d067 | 911 | return 1; |
c8094d83 | 912 | |
7ac2c0bd JM |
913 | /* If we aren't considering the point of reference, only the first bullet |
914 | applies. */ | |
18e4be85 NS |
915 | if (!consider_local_p) |
916 | return 0; | |
c8094d83 | 917 | |
7ac2c0bd JM |
918 | dfs_accessible_data d = { decl, otype }; |
919 | ||
18e4be85 NS |
920 | /* Walk the hierarchy again, looking for a base class that allows |
921 | access. */ | |
922 | return dfs_walk_once_accessible (binfo, /*friends=*/true, | |
7ac2c0bd JM |
923 | dfs_accessible_pre, |
924 | dfs_accessible_post, &d) | |
18e4be85 | 925 | != NULL_TREE; |
8d08fdba MS |
926 | } |
927 | ||
7d4bdeed | 928 | struct lookup_field_info { |
d6479fe7 MM |
929 | /* The type in which we're looking. */ |
930 | tree type; | |
7d4bdeed MM |
931 | /* The name of the field for which we're looking. */ |
932 | tree name; | |
933 | /* If non-NULL, the current result of the lookup. */ | |
934 | tree rval; | |
935 | /* The path to RVAL. */ | |
936 | tree rval_binfo; | |
d6479fe7 MM |
937 | /* If non-NULL, the lookup was ambiguous, and this is a list of the |
938 | candidates. */ | |
7d4bdeed | 939 | tree ambiguous; |
838dfd8a | 940 | /* If nonzero, we are looking for types, not data members. */ |
7d4bdeed | 941 | int want_type; |
7d4bdeed MM |
942 | }; |
943 | ||
a8cef3cb | 944 | /* True for a class member means that it is shared between all objects |
bd0d5d4a JM |
945 | of that class. |
946 | ||
947 | [class.member.lookup]:If the resulting set of declarations are not all | |
d20b7173 | 948 | from sub-objects of the same type, or the set has a non-static member |
bd0d5d4a JM |
949 | and includes members from distinct sub-objects, there is an ambiguity |
950 | and the program is ill-formed. | |
951 | ||
d20b7173 | 952 | This function checks that T contains no non-static members. */ |
bd0d5d4a | 953 | |
a8cef3cb | 954 | bool |
86ac0575 | 955 | shared_member_p (tree t) |
bd0d5d4a | 956 | { |
a8cef3cb | 957 | if (VAR_P (t) || TREE_CODE (t) == TYPE_DECL |
bd0d5d4a | 958 | || TREE_CODE (t) == CONST_DECL) |
a8cef3cb | 959 | return true; |
bd0d5d4a JM |
960 | if (is_overloaded_fn (t)) |
961 | { | |
19b476fb | 962 | for (ovl_iterator iter (get_fns (t)); iter; ++iter) |
10839133 AO |
963 | { |
964 | tree decl = strip_using_decl (*iter); | |
a8cef3cb PP |
965 | if (TREE_CODE (decl) == USING_DECL) |
966 | /* Conservatively assume a dependent using-declaration | |
967 | might resolve to a non-static member. */ | |
968 | return false; | |
10839133 | 969 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) |
a8cef3cb | 970 | return false; |
10839133 | 971 | } |
a8cef3cb | 972 | return true; |
bd0d5d4a | 973 | } |
a8cef3cb | 974 | return false; |
bd0d5d4a JM |
975 | } |
976 | ||
f8ad2d21 NS |
977 | /* Routine to see if the sub-object denoted by the binfo PARENT can be |
978 | found as a base class and sub-object of the object denoted by | |
979 | BINFO. */ | |
980 | ||
981 | static int | |
982 | is_subobject_of_p (tree parent, tree binfo) | |
983 | { | |
984 | tree probe; | |
c8094d83 | 985 | |
f8ad2d21 NS |
986 | for (probe = parent; probe; probe = BINFO_INHERITANCE_CHAIN (probe)) |
987 | { | |
988 | if (probe == binfo) | |
989 | return 1; | |
990 | if (BINFO_VIRTUAL_P (probe)) | |
991 | return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (binfo)) | |
992 | != NULL_TREE); | |
993 | } | |
994 | return 0; | |
995 | } | |
996 | ||
7d4bdeed MM |
997 | /* DATA is really a struct lookup_field_info. Look for a field with |
998 | the name indicated there in BINFO. If this function returns a | |
999 | non-NULL value it is the result of the lookup. Called from | |
1000 | lookup_field via breadth_first_search. */ | |
1001 | ||
1002 | static tree | |
86ac0575 | 1003 | lookup_field_r (tree binfo, void *data) |
7d4bdeed MM |
1004 | { |
1005 | struct lookup_field_info *lfi = (struct lookup_field_info *) data; | |
1006 | tree type = BINFO_TYPE (binfo); | |
4bb0968f | 1007 | tree nval = NULL_TREE; |
7d4bdeed | 1008 | |
5d5a519f NS |
1009 | /* If this is a dependent base, don't look in it. */ |
1010 | if (BINFO_DEPENDENT_BASE_P (binfo)) | |
1011 | return NULL_TREE; | |
c8094d83 | 1012 | |
5d5a519f NS |
1013 | /* If this base class is hidden by the best-known value so far, we |
1014 | don't need to look. */ | |
1015 | if (lfi->rval_binfo && BINFO_INHERITANCE_CHAIN (binfo) == lfi->rval_binfo | |
1016 | && !BINFO_VIRTUAL_P (binfo)) | |
1017 | return dfs_skip_bases; | |
1018 | ||
b991151b | 1019 | nval = get_class_binding (type, lfi->name, lfi->want_type); |
d6479fe7 | 1020 | |
3d9850f4 NS |
1021 | /* If there is no declaration with the indicated name in this type, |
1022 | then there's nothing to do. */ | |
1023 | if (!nval) | |
1024 | goto done; | |
1025 | ||
7d4bdeed MM |
1026 | /* If the lookup already found a match, and the new value doesn't |
1027 | hide the old one, we might have an ambiguity. */ | |
f8ad2d21 NS |
1028 | if (lfi->rval_binfo |
1029 | && !is_subobject_of_p (lfi->rval_binfo, binfo)) | |
c8094d83 | 1030 | |
7d4bdeed | 1031 | { |
bd0d5d4a | 1032 | if (nval == lfi->rval && shared_member_p (nval)) |
7d4bdeed MM |
1033 | /* The two things are really the same. */ |
1034 | ; | |
f8ad2d21 | 1035 | else if (is_subobject_of_p (binfo, lfi->rval_binfo)) |
7d4bdeed MM |
1036 | /* The previous value hides the new one. */ |
1037 | ; | |
1038 | else | |
1039 | { | |
1040 | /* We have a real ambiguity. We keep a chain of all the | |
1041 | candidates. */ | |
1042 | if (!lfi->ambiguous && lfi->rval) | |
aa65d1a2 MM |
1043 | { |
1044 | /* This is the first time we noticed an ambiguity. Add | |
1045 | what we previously thought was a reasonable candidate | |
1046 | to the list. */ | |
e1b3e07d | 1047 | lfi->ambiguous = tree_cons (NULL_TREE, lfi->rval, NULL_TREE); |
aa65d1a2 MM |
1048 | TREE_TYPE (lfi->ambiguous) = error_mark_node; |
1049 | } | |
1050 | ||
7d4bdeed | 1051 | /* Add the new value. */ |
e1b3e07d | 1052 | lfi->ambiguous = tree_cons (NULL_TREE, nval, lfi->ambiguous); |
aa65d1a2 | 1053 | TREE_TYPE (lfi->ambiguous) = error_mark_node; |
7d4bdeed MM |
1054 | } |
1055 | } | |
1056 | else | |
1057 | { | |
d6479fe7 | 1058 | lfi->rval = nval; |
7d4bdeed MM |
1059 | lfi->rval_binfo = binfo; |
1060 | } | |
1061 | ||
5d5a519f NS |
1062 | done: |
1063 | /* Don't look for constructors or destructors in base classes. */ | |
84c0088f | 1064 | if (IDENTIFIER_CDTOR_P (lfi->name)) |
5d5a519f | 1065 | return dfs_skip_bases; |
d6479fe7 | 1066 | return NULL_TREE; |
7d4bdeed MM |
1067 | } |
1068 | ||
c2a124b2 | 1069 | /* Return a "baselink" with BASELINK_BINFO, BASELINK_ACCESS_BINFO, |
4ba126e4 MM |
1070 | BASELINK_FUNCTIONS, and BASELINK_OPTYPE set to BINFO, ACCESS_BINFO, |
1071 | FUNCTIONS, and OPTYPE respectively. */ | |
1072 | ||
1073 | tree | |
1074 | build_baselink (tree binfo, tree access_binfo, tree functions, tree optype) | |
1075 | { | |
1076 | tree baselink; | |
1077 | ||
d509bb8c | 1078 | gcc_assert (OVL_P (functions) || TREE_CODE (functions) == TEMPLATE_ID_EXPR); |
50bc768d NS |
1079 | gcc_assert (!optype || TYPE_P (optype)); |
1080 | gcc_assert (TREE_TYPE (functions)); | |
4ba126e4 | 1081 | |
5dae1114 MM |
1082 | baselink = make_node (BASELINK); |
1083 | TREE_TYPE (baselink) = TREE_TYPE (functions); | |
4ba126e4 MM |
1084 | BASELINK_BINFO (baselink) = binfo; |
1085 | BASELINK_ACCESS_BINFO (baselink) = access_binfo; | |
1086 | BASELINK_FUNCTIONS (baselink) = functions; | |
1087 | BASELINK_OPTYPE (baselink) = optype; | |
1088 | ||
ab85331c PP |
1089 | if (binfo == access_binfo |
1090 | && TYPE_BEING_DEFINED (BINFO_TYPE (access_binfo))) | |
1091 | BASELINK_FUNCTIONS_MAYBE_INCOMPLETE_P (baselink) = true; | |
1092 | ||
4ba126e4 MM |
1093 | return baselink; |
1094 | } | |
1095 | ||
1a03d967 | 1096 | /* Look for a member named NAME in an inheritance lattice dominated by |
171d2f50 NS |
1097 | XBASETYPE. If PROTECT is 0 or two, we do not check access. If it |
1098 | is 1, we enforce accessibility. If PROTECT is zero, then, for an | |
1099 | ambiguous lookup, we return NULL. If PROTECT is 1, we issue error | |
1100 | messages about inaccessible or ambiguous lookup. If PROTECT is 2, | |
1101 | we return a TREE_LIST whose TREE_TYPE is error_mark_node and whose | |
1102 | TREE_VALUEs are the list of ambiguous candidates. | |
1103 | ||
1104 | WANT_TYPE is 1 when we should only return TYPE_DECLs. | |
1105 | ||
10791753 DM |
1106 | If nothing can be found return NULL_TREE and do not issue an error. |
1107 | ||
1108 | If non-NULL, failure information is written back to AFI. */ | |
e92cc029 | 1109 | |
8d08fdba | 1110 | tree |
db422ace | 1111 | lookup_member (tree xbasetype, tree name, int protect, bool want_type, |
10791753 | 1112 | tsubst_flags_t complain, access_failure_info *afi) |
8d08fdba | 1113 | { |
7d4bdeed MM |
1114 | tree rval, rval_binfo = NULL_TREE; |
1115 | tree type = NULL_TREE, basetype_path = NULL_TREE; | |
1116 | struct lookup_field_info lfi; | |
8d08fdba MS |
1117 | |
1118 | /* rval_binfo is the binfo associated with the found member, note, | |
1119 | this can be set with useful information, even when rval is not | |
1120 | set, because it must deal with ALL members, not just non-function | |
1121 | members. It is used for ambiguity checking and the hidden | |
1122 | checks. Whereas rval is only set if a proper (not hidden) | |
1123 | non-function member is found. */ | |
1124 | ||
7063212f DS |
1125 | if (name == error_mark_node |
1126 | || xbasetype == NULL_TREE | |
1127 | || xbasetype == error_mark_node) | |
5973c743 PC |
1128 | return NULL_TREE; |
1129 | ||
9dc6f476 | 1130 | gcc_assert (identifier_p (name)); |
de22184b | 1131 | |
95b4aca6 | 1132 | if (TREE_CODE (xbasetype) == TREE_BINFO) |
8d08fdba | 1133 | { |
8d08fdba | 1134 | type = BINFO_TYPE (xbasetype); |
39211cd5 | 1135 | basetype_path = xbasetype; |
8d08fdba | 1136 | } |
6df5158a | 1137 | else |
39211cd5 | 1138 | { |
9e1e64ec | 1139 | if (!RECORD_OR_UNION_CODE_P (TREE_CODE (xbasetype))) |
a82f93ac | 1140 | return NULL_TREE; |
238109cd | 1141 | type = xbasetype; |
cad7e87b | 1142 | xbasetype = NULL_TREE; |
6df5158a NS |
1143 | } |
1144 | ||
cad7e87b | 1145 | type = complete_type (type); |
971e17ff AS |
1146 | |
1147 | /* Make sure we're looking for a member of the current instantiation in the | |
1148 | right partial specialization. */ | |
d9338471 | 1149 | if (dependent_type_p (type)) |
aabdb831 JM |
1150 | if (tree t = currently_open_class (type)) |
1151 | type = t; | |
971e17ff | 1152 | |
cad7e87b NS |
1153 | if (!basetype_path) |
1154 | basetype_path = TYPE_BINFO (type); | |
1155 | ||
1156 | if (!basetype_path) | |
1157 | return NULL_TREE; | |
8d08fdba | 1158 | |
fad205ff | 1159 | memset (&lfi, 0, sizeof (lfi)); |
d6479fe7 | 1160 | lfi.type = type; |
7d4bdeed | 1161 | lfi.name = name; |
7d4bdeed | 1162 | lfi.want_type = want_type; |
5d5a519f | 1163 | dfs_walk_all (basetype_path, &lookup_field_r, NULL, &lfi); |
7d4bdeed MM |
1164 | rval = lfi.rval; |
1165 | rval_binfo = lfi.rval_binfo; | |
1166 | if (rval_binfo) | |
1167 | type = BINFO_TYPE (rval_binfo); | |
7d4bdeed | 1168 | |
5809bb4f | 1169 | if (lfi.ambiguous) |
ffe9c0a0 | 1170 | { |
5809bb4f PP |
1171 | if (protect == 0) |
1172 | return NULL_TREE; | |
1173 | else if (protect == 1) | |
ffe9c0a0 | 1174 | { |
5809bb4f PP |
1175 | if (complain & tf_error) |
1176 | { | |
1177 | error ("request for member %qD is ambiguous", name); | |
1178 | print_candidates (lfi.ambiguous); | |
1179 | } | |
1180 | return error_mark_node; | |
ffe9c0a0 | 1181 | } |
5809bb4f PP |
1182 | else if (protect == 2) |
1183 | return lfi.ambiguous; | |
ffe9c0a0 PP |
1184 | } |
1185 | ||
1186 | if (!rval) | |
1187 | return NULL_TREE; | |
1188 | ||
d6479fe7 MM |
1189 | /* [class.access] |
1190 | ||
1191 | In the case of overloaded function names, access control is | |
eff3a276 MM |
1192 | applied to the function selected by overloaded resolution. |
1193 | ||
1194 | We cannot check here, even if RVAL is only a single non-static | |
1195 | member function, since we do not know what the "this" pointer | |
1196 | will be. For: | |
1197 | ||
1198 | class A { protected: void f(); }; | |
1199 | class B : public A { | |
1200 | void g(A *p) { | |
1201 | f(); // OK | |
1202 | p->f(); // Not OK. | |
1203 | } | |
1204 | }; | |
1205 | ||
1206 | only the first call to "f" is valid. However, if the function is | |
1207 | static, we can check. */ | |
5809bb4f | 1208 | if (protect == 1 && !really_overloaded_fn (rval)) |
57910f3a JM |
1209 | { |
1210 | tree decl = is_overloaded_fn (rval) ? get_first_fn (rval) : rval; | |
10839133 AO |
1211 | decl = strip_using_decl (decl); |
1212 | /* A dependent USING_DECL will be checked after tsubsting. */ | |
1213 | if (TREE_CODE (decl) != USING_DECL | |
1214 | && !DECL_NONSTATIC_MEMBER_FUNCTION_P (decl) | |
0e69fdf0 | 1215 | && !perform_or_defer_access_check (basetype_path, decl, decl, |
10791753 | 1216 | complain, afi)) |
ffe9c0a0 | 1217 | return error_mark_node; |
8d08fdba | 1218 | } |
b3709d9b | 1219 | |
ffe9c0a0 | 1220 | if (is_overloaded_fn (rval) |
8d75b883 PP |
1221 | /* Don't use a BASELINK for class-scope deduction guides since |
1222 | they're not actually member functions. */ | |
1223 | && !dguide_name_p (name)) | |
4ba126e4 | 1224 | rval = build_baselink (rval_binfo, basetype_path, rval, |
84c0088f | 1225 | (IDENTIFIER_CONV_OP_P (name) |
4ba126e4 | 1226 | ? TREE_TYPE (name): NULL_TREE)); |
d6479fe7 MM |
1227 | return rval; |
1228 | } | |
1229 | ||
8ece8dfb DM |
1230 | /* Helper class for lookup_member_fuzzy. */ |
1231 | ||
1232 | class lookup_field_fuzzy_info | |
1233 | { | |
1234 | public: | |
1235 | lookup_field_fuzzy_info (bool want_type_p) : | |
1236 | m_want_type_p (want_type_p), m_candidates () {} | |
1237 | ||
8ece8dfb DM |
1238 | void fuzzy_lookup_field (tree type); |
1239 | ||
1240 | /* If true, we are looking for types, not data members. */ | |
1241 | bool m_want_type_p; | |
1242 | /* The result: a vec of identifiers. */ | |
1243 | auto_vec<tree> m_candidates; | |
1244 | }; | |
1245 | ||
8ece8dfb DM |
1246 | /* Locate all fields within TYPE, append them to m_candidates. */ |
1247 | ||
1248 | void | |
1249 | lookup_field_fuzzy_info::fuzzy_lookup_field (tree type) | |
1250 | { | |
52ed68f7 | 1251 | if (!CLASS_TYPE_P (type)) |
8ece8dfb DM |
1252 | return; |
1253 | ||
1254 | for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) | |
1255 | { | |
66bd3086 DM |
1256 | if (m_want_type_p && !DECL_DECLARES_TYPE_P (field)) |
1257 | continue; | |
1258 | ||
1259 | if (!DECL_NAME (field)) | |
1260 | continue; | |
1261 | ||
1262 | if (is_lambda_ignored_entity (field)) | |
1263 | continue; | |
1264 | ||
e480c3c0 JJ |
1265 | /* Ignore special identifiers with space at the end like cdtor or |
1266 | conversion op identifiers. */ | |
1267 | if (TREE_CODE (DECL_NAME (field)) == IDENTIFIER_NODE) | |
1268 | if (unsigned int len = IDENTIFIER_LENGTH (DECL_NAME (field))) | |
1269 | if (IDENTIFIER_POINTER (DECL_NAME (field))[len - 1] == ' ') | |
1270 | continue; | |
1271 | ||
66bd3086 | 1272 | m_candidates.safe_push (DECL_NAME (field)); |
8ece8dfb DM |
1273 | } |
1274 | } | |
1275 | ||
1276 | ||
1277 | /* Helper function for lookup_member_fuzzy, called via dfs_walk_all | |
1278 | DATA is really a lookup_field_fuzzy_info. Look for a field with | |
1279 | the name indicated there in BINFO. Gathers pertinent identifiers into | |
1280 | m_candidates. */ | |
1281 | ||
1282 | static tree | |
1283 | lookup_field_fuzzy_r (tree binfo, void *data) | |
1284 | { | |
1285 | lookup_field_fuzzy_info *lffi = (lookup_field_fuzzy_info *) data; | |
1286 | tree type = BINFO_TYPE (binfo); | |
1287 | ||
8ece8dfb DM |
1288 | lffi->fuzzy_lookup_field (type); |
1289 | ||
1290 | return NULL_TREE; | |
1291 | } | |
1292 | ||
1293 | /* Like lookup_member, but try to find the closest match for NAME, | |
1294 | rather than an exact match, and return an identifier (or NULL_TREE). | |
1295 | Do not complain. */ | |
1296 | ||
1297 | tree | |
1298 | lookup_member_fuzzy (tree xbasetype, tree name, bool want_type_p) | |
1299 | { | |
1300 | tree type = NULL_TREE, basetype_path = NULL_TREE; | |
99b1c316 | 1301 | class lookup_field_fuzzy_info lffi (want_type_p); |
8ece8dfb DM |
1302 | |
1303 | /* rval_binfo is the binfo associated with the found member, note, | |
1304 | this can be set with useful information, even when rval is not | |
1305 | set, because it must deal with ALL members, not just non-function | |
1306 | members. It is used for ambiguity checking and the hidden | |
1307 | checks. Whereas rval is only set if a proper (not hidden) | |
1308 | non-function member is found. */ | |
1309 | ||
1310 | if (name == error_mark_node | |
1311 | || xbasetype == NULL_TREE | |
1312 | || xbasetype == error_mark_node) | |
1313 | return NULL_TREE; | |
1314 | ||
1315 | gcc_assert (identifier_p (name)); | |
1316 | ||
1317 | if (TREE_CODE (xbasetype) == TREE_BINFO) | |
1318 | { | |
1319 | type = BINFO_TYPE (xbasetype); | |
1320 | basetype_path = xbasetype; | |
1321 | } | |
1322 | else | |
1323 | { | |
1324 | if (!RECORD_OR_UNION_CODE_P (TREE_CODE (xbasetype))) | |
1325 | return NULL_TREE; | |
1326 | type = xbasetype; | |
1327 | xbasetype = NULL_TREE; | |
1328 | } | |
1329 | ||
1330 | type = complete_type (type); | |
1331 | ||
1332 | /* Make sure we're looking for a member of the current instantiation in the | |
1333 | right partial specialization. */ | |
1334 | if (flag_concepts && dependent_type_p (type)) | |
1335 | type = currently_open_class (type); | |
1336 | ||
1337 | if (!basetype_path) | |
1338 | basetype_path = TYPE_BINFO (type); | |
1339 | ||
1340 | if (!basetype_path) | |
1341 | return NULL_TREE; | |
1342 | ||
1343 | /* Populate lffi.m_candidates. */ | |
1344 | dfs_walk_all (basetype_path, &lookup_field_fuzzy_r, NULL, &lffi); | |
1345 | ||
1346 | return find_closest_identifier (name, &lffi.m_candidates); | |
1347 | } | |
1348 | ||
d6479fe7 MM |
1349 | /* Like lookup_member, except that if we find a function member we |
1350 | return NULL_TREE. */ | |
1351 | ||
1352 | tree | |
86ac0575 | 1353 | lookup_field (tree xbasetype, tree name, int protect, bool want_type) |
d6479fe7 | 1354 | { |
db422ace PC |
1355 | tree rval = lookup_member (xbasetype, name, protect, want_type, |
1356 | tf_warning_or_error); | |
c8094d83 | 1357 | |
c566721f GB |
1358 | /* Ignore functions, but propagate the ambiguity list. */ |
1359 | if (!error_operand_p (rval) | |
1360 | && (rval && BASELINK_P (rval))) | |
d6479fe7 MM |
1361 | return NULL_TREE; |
1362 | ||
1363 | return rval; | |
1364 | } | |
1365 | ||
1366 | /* Like lookup_member, except that if we find a non-function member we | |
1367 | return NULL_TREE. */ | |
1368 | ||
1369 | tree | |
098cf31a PP |
1370 | lookup_fnfields (tree xbasetype, tree name, int protect, |
1371 | tsubst_flags_t complain) | |
d6479fe7 | 1372 | { |
db422ace | 1373 | tree rval = lookup_member (xbasetype, name, protect, /*want_type=*/false, |
098cf31a | 1374 | complain); |
d6479fe7 | 1375 | |
c566721f GB |
1376 | /* Ignore non-functions, but propagate the ambiguity list. */ |
1377 | if (!error_operand_p (rval) | |
1378 | && (rval && !BASELINK_P (rval))) | |
d6479fe7 MM |
1379 | return NULL_TREE; |
1380 | ||
8d08fdba MS |
1381 | return rval; |
1382 | } | |
1383 | ||
a723baf1 MM |
1384 | /* DECL is the result of a qualified name lookup. QUALIFYING_SCOPE is |
1385 | the class or namespace used to qualify the name. CONTEXT_CLASS is | |
1386 | the class corresponding to the object in which DECL will be used. | |
1387 | Return a possibly modified version of DECL that takes into account | |
1388 | the CONTEXT_CLASS. | |
9e259dd1 MM |
1389 | |
1390 | In particular, consider an expression like `B::m' in the context of | |
1391 | a derived class `D'. If `B::m' has been resolved to a BASELINK, | |
1392 | then the most derived class indicated by the BASELINK_BINFO will be | |
1393 | `B', not `D'. This function makes that adjustment. */ | |
1394 | ||
1395 | tree | |
c8094d83 | 1396 | adjust_result_of_qualified_name_lookup (tree decl, |
a723baf1 | 1397 | tree qualifying_scope, |
9e259dd1 MM |
1398 | tree context_class) |
1399 | { | |
0616700c | 1400 | if (context_class && context_class != error_mark_node |
9c23e505 | 1401 | && CLASS_TYPE_P (context_class) |
0616700c | 1402 | && CLASS_TYPE_P (qualifying_scope) |
a723baf1 MM |
1403 | && DERIVED_FROM_P (qualifying_scope, context_class) |
1404 | && BASELINK_P (decl)) | |
9e259dd1 MM |
1405 | { |
1406 | tree base; | |
1407 | ||
127b8136 MM |
1408 | /* Look for the QUALIFYING_SCOPE as a base of the CONTEXT_CLASS. |
1409 | Because we do not yet know which function will be chosen by | |
1410 | overload resolution, we cannot yet check either accessibility | |
1411 | or ambiguity -- in either case, the choice of a static member | |
1412 | function might make the usage valid. */ | |
a723baf1 | 1413 | base = lookup_base (context_class, qualifying_scope, |
22854930 PC |
1414 | ba_unique, NULL, tf_none); |
1415 | if (base && base != error_mark_node) | |
9e259dd1 MM |
1416 | { |
1417 | BASELINK_ACCESS_BINFO (decl) = base; | |
91914f0a | 1418 | tree decl_binfo |
9e259dd1 | 1419 | = lookup_base (base, BINFO_TYPE (BASELINK_BINFO (decl)), |
22854930 | 1420 | ba_unique, NULL, tf_none); |
91914f0a PP |
1421 | if (decl_binfo && decl_binfo != error_mark_node) |
1422 | BASELINK_BINFO (decl) = decl_binfo; | |
9e259dd1 MM |
1423 | } |
1424 | } | |
1425 | ||
4643a68e JM |
1426 | if (BASELINK_P (decl)) |
1427 | BASELINK_QUALIFIED_P (decl) = true; | |
1428 | ||
9e259dd1 MM |
1429 | return decl; |
1430 | } | |
1431 | ||
8d08fdba | 1432 | \f |
5cf447db | 1433 | /* Walk the class hierarchy within BINFO, in a depth-first traversal. |
5d5a519f NS |
1434 | PRE_FN is called in preorder, while POST_FN is called in postorder. |
1435 | If PRE_FN returns DFS_SKIP_BASES, child binfos will not be | |
1436 | walked. If PRE_FN or POST_FN returns a different non-NULL value, | |
1437 | that value is immediately returned and the walk is terminated. One | |
1438 | of PRE_FN and POST_FN can be NULL. At each node, PRE_FN and | |
1439 | POST_FN are passed the binfo to examine and the caller's DATA | |
1440 | value. All paths are walked, thus virtual and morally virtual | |
1441 | binfos can be multiply walked. */ | |
d6479fe7 | 1442 | |
bbd15aac | 1443 | tree |
5d5a519f NS |
1444 | dfs_walk_all (tree binfo, tree (*pre_fn) (tree, void *), |
1445 | tree (*post_fn) (tree, void *), void *data) | |
d6479fe7 | 1446 | { |
5d5a519f NS |
1447 | tree rval; |
1448 | unsigned ix; | |
fa743e8c | 1449 | tree base_binfo; |
c8094d83 | 1450 | |
d6479fe7 | 1451 | /* Call the pre-order walking function. */ |
5d5a519f | 1452 | if (pre_fn) |
7d4bdeed | 1453 | { |
5d5a519f NS |
1454 | rval = pre_fn (binfo, data); |
1455 | if (rval) | |
1456 | { | |
1457 | if (rval == dfs_skip_bases) | |
1458 | goto skip_bases; | |
1459 | return rval; | |
1460 | } | |
1461 | } | |
1462 | ||
1463 | /* Find the next child binfo to walk. */ | |
1464 | for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++) | |
1465 | { | |
1466 | rval = dfs_walk_all (base_binfo, pre_fn, post_fn, data); | |
d6479fe7 MM |
1467 | if (rval) |
1468 | return rval; | |
8d08fdba | 1469 | } |
8d08fdba | 1470 | |
5d5a519f NS |
1471 | skip_bases: |
1472 | /* Call the post-order walking function. */ | |
1473 | if (post_fn) | |
5b94d9dd NS |
1474 | { |
1475 | rval = post_fn (binfo, data); | |
1476 | gcc_assert (rval != dfs_skip_bases); | |
1477 | return rval; | |
1478 | } | |
c8094d83 | 1479 | |
5d5a519f NS |
1480 | return NULL_TREE; |
1481 | } | |
1482 | ||
1483 | /* Worker for dfs_walk_once. This behaves as dfs_walk_all, except | |
1484 | that binfos are walked at most once. */ | |
1485 | ||
1486 | static tree | |
1487 | dfs_walk_once_r (tree binfo, tree (*pre_fn) (tree, void *), | |
e448880c JM |
1488 | tree (*post_fn) (tree, void *), hash_set<tree> *pset, |
1489 | void *data) | |
5d5a519f NS |
1490 | { |
1491 | tree rval; | |
1492 | unsigned ix; | |
1493 | tree base_binfo; | |
c8094d83 | 1494 | |
5d5a519f NS |
1495 | /* Call the pre-order walking function. */ |
1496 | if (pre_fn) | |
d6479fe7 | 1497 | { |
5d5a519f NS |
1498 | rval = pre_fn (binfo, data); |
1499 | if (rval) | |
d6479fe7 | 1500 | { |
5d5a519f NS |
1501 | if (rval == dfs_skip_bases) |
1502 | goto skip_bases; | |
c8094d83 | 1503 | |
5d5a519f NS |
1504 | return rval; |
1505 | } | |
1506 | } | |
1507 | ||
1508 | /* Find the next child binfo to walk. */ | |
1509 | for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++) | |
1510 | { | |
1511 | if (BINFO_VIRTUAL_P (base_binfo)) | |
e448880c JM |
1512 | if (pset->add (base_binfo)) |
1513 | continue; | |
c8094d83 | 1514 | |
e448880c | 1515 | rval = dfs_walk_once_r (base_binfo, pre_fn, post_fn, pset, data); |
fa743e8c NS |
1516 | if (rval) |
1517 | return rval; | |
d6479fe7 | 1518 | } |
c8094d83 | 1519 | |
5d5a519f | 1520 | skip_bases: |
d6479fe7 | 1521 | /* Call the post-order walking function. */ |
5d5a519f | 1522 | if (post_fn) |
5b94d9dd NS |
1523 | { |
1524 | rval = post_fn (binfo, data); | |
1525 | gcc_assert (rval != dfs_skip_bases); | |
1526 | return rval; | |
1527 | } | |
c8094d83 | 1528 | |
5d5a519f NS |
1529 | return NULL_TREE; |
1530 | } | |
1531 | ||
5d5a519f NS |
1532 | /* Like dfs_walk_all, except that binfos are not multiply walked. For |
1533 | non-diamond shaped hierarchies this is the same as dfs_walk_all. | |
1534 | For diamond shaped hierarchies we must mark the virtual bases, to | |
1535 | avoid multiple walks. */ | |
d6479fe7 MM |
1536 | |
1537 | tree | |
5d5a519f NS |
1538 | dfs_walk_once (tree binfo, tree (*pre_fn) (tree, void *), |
1539 | tree (*post_fn) (tree, void *), void *data) | |
d6479fe7 | 1540 | { |
12a669d1 | 1541 | static int active = 0; /* We must not be called recursively. */ |
5d5a519f NS |
1542 | tree rval; |
1543 | ||
1544 | gcc_assert (pre_fn || post_fn); | |
12a669d1 NS |
1545 | gcc_assert (!active); |
1546 | active++; | |
c8094d83 | 1547 | |
5d5a519f NS |
1548 | if (!CLASSTYPE_DIAMOND_SHAPED_P (BINFO_TYPE (binfo))) |
1549 | /* We are not diamond shaped, and therefore cannot encounter the | |
1550 | same binfo twice. */ | |
1551 | rval = dfs_walk_all (binfo, pre_fn, post_fn, data); | |
1552 | else | |
1553 | { | |
e448880c JM |
1554 | hash_set<tree> pset; |
1555 | rval = dfs_walk_once_r (binfo, pre_fn, post_fn, &pset, data); | |
5d5a519f | 1556 | } |
12a669d1 NS |
1557 | |
1558 | active--; | |
c8094d83 | 1559 | |
5d5a519f | 1560 | return rval; |
d6479fe7 MM |
1561 | } |
1562 | ||
6936e493 NS |
1563 | /* Worker function for dfs_walk_once_accessible. Behaves like |
1564 | dfs_walk_once_r, except (a) FRIENDS_P is true if special | |
1565 | access given by the current context should be considered, (b) ONCE | |
1566 | indicates whether bases should be marked during traversal. */ | |
1567 | ||
1568 | static tree | |
e448880c | 1569 | dfs_walk_once_accessible_r (tree binfo, bool friends_p, hash_set<tree> *pset, |
6936e493 NS |
1570 | tree (*pre_fn) (tree, void *), |
1571 | tree (*post_fn) (tree, void *), void *data) | |
1572 | { | |
1573 | tree rval = NULL_TREE; | |
1574 | unsigned ix; | |
1575 | tree base_binfo; | |
1576 | ||
1577 | /* Call the pre-order walking function. */ | |
1578 | if (pre_fn) | |
1579 | { | |
1580 | rval = pre_fn (binfo, data); | |
1581 | if (rval) | |
1582 | { | |
1583 | if (rval == dfs_skip_bases) | |
1584 | goto skip_bases; | |
c8094d83 | 1585 | |
6936e493 NS |
1586 | return rval; |
1587 | } | |
1588 | } | |
1589 | ||
1590 | /* Find the next child binfo to walk. */ | |
1591 | for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++) | |
1592 | { | |
e448880c | 1593 | bool mark = pset && BINFO_VIRTUAL_P (base_binfo); |
6936e493 | 1594 | |
e448880c | 1595 | if (mark && pset->contains (base_binfo)) |
6936e493 | 1596 | continue; |
c8094d83 | 1597 | |
6936e493 | 1598 | /* If the base is inherited via private or protected |
0cbd7506 MS |
1599 | inheritance, then we can't see it, unless we are a friend of |
1600 | the current binfo. */ | |
a5201a91 MM |
1601 | if (BINFO_BASE_ACCESS (binfo, ix) != access_public_node) |
1602 | { | |
1603 | tree scope; | |
1604 | if (!friends_p) | |
1605 | continue; | |
1606 | scope = current_scope (); | |
c8094d83 | 1607 | if (!scope |
a5201a91 MM |
1608 | || TREE_CODE (scope) == NAMESPACE_DECL |
1609 | || !is_friend (BINFO_TYPE (binfo), scope)) | |
1610 | continue; | |
1611 | } | |
6936e493 NS |
1612 | |
1613 | if (mark) | |
e448880c | 1614 | pset->add (base_binfo); |
6936e493 | 1615 | |
e448880c | 1616 | rval = dfs_walk_once_accessible_r (base_binfo, friends_p, pset, |
6936e493 NS |
1617 | pre_fn, post_fn, data); |
1618 | if (rval) | |
1619 | return rval; | |
1620 | } | |
c8094d83 | 1621 | |
6936e493 NS |
1622 | skip_bases: |
1623 | /* Call the post-order walking function. */ | |
1624 | if (post_fn) | |
5b94d9dd NS |
1625 | { |
1626 | rval = post_fn (binfo, data); | |
1627 | gcc_assert (rval != dfs_skip_bases); | |
1628 | return rval; | |
1629 | } | |
c8094d83 | 1630 | |
6936e493 NS |
1631 | return NULL_TREE; |
1632 | } | |
1633 | ||
1634 | /* Like dfs_walk_once except that only accessible bases are walked. | |
1635 | FRIENDS_P indicates whether friendship of the local context | |
1636 | should be considered when determining accessibility. */ | |
1637 | ||
1638 | static tree | |
1639 | dfs_walk_once_accessible (tree binfo, bool friends_p, | |
1640 | tree (*pre_fn) (tree, void *), | |
1641 | tree (*post_fn) (tree, void *), void *data) | |
1642 | { | |
e448880c JM |
1643 | hash_set<tree> *pset = NULL; |
1644 | if (CLASSTYPE_DIAMOND_SHAPED_P (BINFO_TYPE (binfo))) | |
1645 | pset = new hash_set<tree>; | |
1646 | tree rval = dfs_walk_once_accessible_r (binfo, friends_p, pset, | |
6936e493 | 1647 | pre_fn, post_fn, data); |
c8094d83 | 1648 | |
e448880c JM |
1649 | if (pset) |
1650 | delete pset; | |
6936e493 NS |
1651 | return rval; |
1652 | } | |
1653 | ||
10791753 DM |
1654 | /* Return true iff the code of T is CODE, and it has compatible |
1655 | type with TYPE. */ | |
1656 | ||
1657 | static bool | |
1658 | matches_code_and_type_p (tree t, enum tree_code code, tree type) | |
1659 | { | |
1660 | if (TREE_CODE (t) != code) | |
1661 | return false; | |
1662 | if (!cxx_types_compatible_p (TREE_TYPE (t), type)) | |
1663 | return false; | |
1664 | return true; | |
1665 | } | |
1666 | ||
1667 | /* Subroutine of direct_accessor_p and reference_accessor_p. | |
1668 | Determine if COMPONENT_REF is a simple field lookup of this->FIELD_DECL. | |
1669 | We expect a tree of the form: | |
1670 | <component_ref: | |
1671 | <indirect_ref:S> | |
1672 | <nop_expr:P* | |
1673 | <parm_decl (this)> | |
1674 | <field_decl (FIELD_DECL)>>>. */ | |
1675 | ||
1676 | static bool | |
1677 | field_access_p (tree component_ref, tree field_decl, tree field_type) | |
1678 | { | |
1679 | if (!matches_code_and_type_p (component_ref, COMPONENT_REF, field_type)) | |
1680 | return false; | |
1681 | ||
1682 | tree indirect_ref = TREE_OPERAND (component_ref, 0); | |
a7f8415c | 1683 | if (!INDIRECT_REF_P (indirect_ref)) |
10791753 DM |
1684 | return false; |
1685 | ||
1686 | tree ptr = STRIP_NOPS (TREE_OPERAND (indirect_ref, 0)); | |
1687 | if (!is_this_parameter (ptr)) | |
1688 | return false; | |
1689 | ||
1690 | /* Must access the correct field. */ | |
1691 | if (TREE_OPERAND (component_ref, 1) != field_decl) | |
1692 | return false; | |
1693 | return true; | |
1694 | } | |
1695 | ||
1696 | /* Subroutine of field_accessor_p. | |
1697 | ||
1698 | Assuming that INIT_EXPR has already had its code and type checked, | |
1699 | determine if it is a simple accessor for FIELD_DECL | |
1700 | (of type FIELD_TYPE). | |
1701 | ||
1702 | Specifically, a simple accessor within struct S of the form: | |
1703 | T get_field () { return m_field; } | |
5afef8b1 | 1704 | should have a constexpr_fn_retval (saved_tree) of the form: |
10791753 DM |
1705 | <init_expr:T |
1706 | <result_decl:T | |
1707 | <nop_expr:T | |
1708 | <component_ref: | |
1709 | <indirect_ref:S> | |
1710 | <nop_expr:P* | |
1711 | <parm_decl (this)> | |
5afef8b1 | 1712 | <field_decl (FIELD_DECL)>>>>>. */ |
10791753 DM |
1713 | |
1714 | static bool | |
1715 | direct_accessor_p (tree init_expr, tree field_decl, tree field_type) | |
1716 | { | |
1717 | tree result_decl = TREE_OPERAND (init_expr, 0); | |
1718 | if (!matches_code_and_type_p (result_decl, RESULT_DECL, field_type)) | |
1719 | return false; | |
1720 | ||
1721 | tree component_ref = STRIP_NOPS (TREE_OPERAND (init_expr, 1)); | |
1722 | if (!field_access_p (component_ref, field_decl, field_type)) | |
1723 | return false; | |
1724 | ||
1725 | return true; | |
1726 | } | |
1727 | ||
1728 | /* Subroutine of field_accessor_p. | |
1729 | ||
1730 | Assuming that INIT_EXPR has already had its code and type checked, | |
1731 | determine if it is a "reference" accessor for FIELD_DECL | |
1732 | (of type FIELD_REFERENCE_TYPE). | |
1733 | ||
1734 | Specifically, a simple accessor within struct S of the form: | |
1735 | T& get_field () { return m_field; } | |
5afef8b1 | 1736 | should have a constexpr_fn_retval (saved_tree) of the form: |
10791753 DM |
1737 | <init_expr:T& |
1738 | <result_decl:T& | |
1739 | <nop_expr: T& | |
1740 | <addr_expr: T* | |
1741 | <component_ref:T | |
1742 | <indirect_ref:S | |
1743 | <nop_expr | |
1744 | <parm_decl (this)>> | |
1745 | <field (FIELD_DECL)>>>>>>. */ | |
1746 | static bool | |
1747 | reference_accessor_p (tree init_expr, tree field_decl, tree field_type, | |
1748 | tree field_reference_type) | |
1749 | { | |
1750 | tree result_decl = TREE_OPERAND (init_expr, 0); | |
1751 | if (!matches_code_and_type_p (result_decl, RESULT_DECL, field_reference_type)) | |
1752 | return false; | |
1753 | ||
1754 | tree field_pointer_type = build_pointer_type (field_type); | |
1755 | tree addr_expr = STRIP_NOPS (TREE_OPERAND (init_expr, 1)); | |
1756 | if (!matches_code_and_type_p (addr_expr, ADDR_EXPR, field_pointer_type)) | |
1757 | return false; | |
1758 | ||
1759 | tree component_ref = STRIP_NOPS (TREE_OPERAND (addr_expr, 0)); | |
1760 | ||
1761 | if (!field_access_p (component_ref, field_decl, field_type)) | |
1762 | return false; | |
1763 | ||
1764 | return true; | |
1765 | } | |
1766 | ||
1767 | /* Return true if FN is an accessor method for FIELD_DECL. | |
1768 | i.e. a method of the form { return FIELD; }, with no | |
1769 | conversions. | |
1770 | ||
1771 | If CONST_P, then additionally require that FN be a const | |
1772 | method. */ | |
1773 | ||
1774 | static bool | |
1775 | field_accessor_p (tree fn, tree field_decl, bool const_p) | |
1776 | { | |
1777 | if (TREE_CODE (fn) != FUNCTION_DECL) | |
1778 | return false; | |
1779 | ||
1780 | /* We don't yet support looking up static data, just fields. */ | |
1781 | if (TREE_CODE (field_decl) != FIELD_DECL) | |
1782 | return false; | |
1783 | ||
1784 | tree fntype = TREE_TYPE (fn); | |
1785 | if (TREE_CODE (fntype) != METHOD_TYPE) | |
1786 | return false; | |
1787 | ||
1788 | /* If the field is accessed via a const "this" argument, verify | |
1789 | that the "this" parameter is const. */ | |
1790 | if (const_p) | |
1791 | { | |
2a80d3ae DM |
1792 | tree this_class = class_of_this_parm (fntype); |
1793 | if (!TYPE_READONLY (this_class)) | |
10791753 DM |
1794 | return false; |
1795 | } | |
1796 | ||
1797 | tree saved_tree = DECL_SAVED_TREE (fn); | |
1798 | ||
1799 | if (saved_tree == NULL_TREE) | |
1800 | return false; | |
1801 | ||
5afef8b1 DM |
1802 | /* Attempt to extract a single return value from the function, |
1803 | if it has one. */ | |
1804 | tree retval = constexpr_fn_retval (saved_tree); | |
1805 | if (retval == NULL_TREE || retval == error_mark_node) | |
10791753 | 1806 | return false; |
5afef8b1 DM |
1807 | /* Require an INIT_EXPR. */ |
1808 | if (TREE_CODE (retval) != INIT_EXPR) | |
10791753 | 1809 | return false; |
5afef8b1 | 1810 | tree init_expr = retval; |
10791753 DM |
1811 | |
1812 | /* Determine if this is a simple accessor within struct S of the form: | |
1813 | T get_field () { return m_field; }. */ | |
5afef8b1 | 1814 | tree field_type = TREE_TYPE (field_decl); |
10791753 DM |
1815 | if (cxx_types_compatible_p (TREE_TYPE (init_expr), field_type)) |
1816 | return direct_accessor_p (init_expr, field_decl, field_type); | |
1817 | ||
1818 | /* Failing that, determine if it is an accessor of the form: | |
1819 | T& get_field () { return m_field; }. */ | |
1820 | tree field_reference_type = cp_build_reference_type (field_type, false); | |
1821 | if (cxx_types_compatible_p (TREE_TYPE (init_expr), field_reference_type)) | |
1822 | return reference_accessor_p (init_expr, field_decl, field_type, | |
1823 | field_reference_type); | |
1824 | ||
1825 | return false; | |
1826 | } | |
1827 | ||
1828 | /* Callback data for dfs_locate_field_accessor_pre. */ | |
1829 | ||
6c1dae73 | 1830 | class locate_field_data |
10791753 | 1831 | { |
6c1dae73 | 1832 | public: |
10791753 DM |
1833 | locate_field_data (tree field_decl_, bool const_p_) |
1834 | : field_decl (field_decl_), const_p (const_p_) {} | |
1835 | ||
1836 | tree field_decl; | |
1837 | bool const_p; | |
1838 | }; | |
1839 | ||
1840 | /* Return a FUNCTION_DECL that is an "accessor" method for DATA, a FIELD_DECL, | |
1841 | callable via binfo, if one exists, otherwise return NULL_TREE. | |
1842 | ||
1843 | Callback for dfs_walk_once_accessible for use within | |
1844 | locate_field_accessor. */ | |
1845 | ||
1846 | static tree | |
1847 | dfs_locate_field_accessor_pre (tree binfo, void *data) | |
1848 | { | |
1849 | locate_field_data *lfd = (locate_field_data *)data; | |
1850 | tree type = BINFO_TYPE (binfo); | |
1851 | ||
783dc739 | 1852 | vec<tree, va_gc> *member_vec; |
10791753 DM |
1853 | tree fn; |
1854 | size_t i; | |
1855 | ||
1856 | if (!CLASS_TYPE_P (type)) | |
1857 | return NULL_TREE; | |
1858 | ||
783dc739 NS |
1859 | member_vec = CLASSTYPE_MEMBER_VEC (type); |
1860 | if (!member_vec) | |
10791753 DM |
1861 | return NULL_TREE; |
1862 | ||
783dc739 | 1863 | for (i = 0; vec_safe_iterate (member_vec, i, &fn); ++i) |
10791753 DM |
1864 | if (fn) |
1865 | if (field_accessor_p (fn, lfd->field_decl, lfd->const_p)) | |
1866 | return fn; | |
1867 | ||
1868 | return NULL_TREE; | |
1869 | } | |
1870 | ||
1871 | /* Return a FUNCTION_DECL that is an "accessor" method for FIELD_DECL, | |
1872 | callable via BASETYPE_PATH, if one exists, otherwise return NULL_TREE. */ | |
1873 | ||
1874 | tree | |
1875 | locate_field_accessor (tree basetype_path, tree field_decl, bool const_p) | |
1876 | { | |
1877 | if (TREE_CODE (basetype_path) != TREE_BINFO) | |
1878 | return NULL_TREE; | |
1879 | ||
1880 | /* Walk the hierarchy, looking for a method of some base class that allows | |
1881 | access to the field. */ | |
1882 | locate_field_data lfd (field_decl, const_p); | |
1883 | return dfs_walk_once_accessible (basetype_path, /*friends=*/true, | |
1884 | dfs_locate_field_accessor_pre, | |
1885 | NULL, &lfd); | |
1886 | } | |
1887 | ||
78f7607d MP |
1888 | /* Check throw specifier of OVERRIDER is at least as strict as |
1889 | the one of BASEFN. */ | |
1890 | ||
1891 | bool | |
1892 | maybe_check_overriding_exception_spec (tree overrider, tree basefn) | |
1893 | { | |
1894 | maybe_instantiate_noexcept (basefn); | |
1895 | maybe_instantiate_noexcept (overrider); | |
1896 | tree base_throw = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (basefn)); | |
1897 | tree over_throw = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (overrider)); | |
1898 | ||
1899 | if (DECL_INVALID_OVERRIDER_P (overrider)) | |
1900 | return true; | |
1901 | ||
1902 | /* Can't check this yet. Pretend this is fine and let | |
1903 | noexcept_override_late_checks check this later. */ | |
1904 | if (UNPARSED_NOEXCEPT_SPEC_P (base_throw) | |
1905 | || UNPARSED_NOEXCEPT_SPEC_P (over_throw)) | |
1906 | return true; | |
1907 | ||
1908 | if (!comp_except_specs (base_throw, over_throw, ce_derived)) | |
1909 | { | |
1910 | auto_diagnostic_group d; | |
1911 | error ("looser exception specification on overriding virtual function " | |
1912 | "%q+#F", overrider); | |
1913 | inform (DECL_SOURCE_LOCATION (basefn), | |
1914 | "overridden function is %q#F", basefn); | |
1915 | DECL_INVALID_OVERRIDER_P (overrider) = 1; | |
1916 | return false; | |
1917 | } | |
1918 | return true; | |
1919 | } | |
1920 | ||
4cc1d462 NS |
1921 | /* Check that virtual overrider OVERRIDER is acceptable for base function |
1922 | BASEFN. Issue diagnostic, and return zero, if unacceptable. */ | |
1923 | ||
af746697 | 1924 | static int |
86ac0575 | 1925 | check_final_overrider (tree overrider, tree basefn) |
4cc1d462 NS |
1926 | { |
1927 | tree over_type = TREE_TYPE (overrider); | |
1928 | tree base_type = TREE_TYPE (basefn); | |
79d8a272 JM |
1929 | tree over_return = fndecl_declared_return_type (overrider); |
1930 | tree base_return = fndecl_declared_return_type (basefn); | |
10261728 | 1931 | |
4977bab6 | 1932 | int fail = 0; |
58ec3cc5 MM |
1933 | |
1934 | if (DECL_INVALID_OVERRIDER_P (overrider)) | |
1935 | return 0; | |
1936 | ||
4cc1d462 NS |
1937 | if (same_type_p (base_return, over_return)) |
1938 | /* OK */; | |
4977bab6 ZW |
1939 | else if ((CLASS_TYPE_P (over_return) && CLASS_TYPE_P (base_return)) |
1940 | || (TREE_CODE (base_return) == TREE_CODE (over_return) | |
71a93b08 | 1941 | && INDIRECT_TYPE_P (base_return))) |
4cc1d462 | 1942 | { |
9bcb9aae | 1943 | /* Potentially covariant. */ |
4977bab6 | 1944 | unsigned base_quals, over_quals; |
c8094d83 | 1945 | |
71a93b08 | 1946 | fail = !INDIRECT_TYPE_P (base_return); |
4977bab6 ZW |
1947 | if (!fail) |
1948 | { | |
d04b0c75 PP |
1949 | if (cp_type_quals (base_return) != cp_type_quals (over_return)) |
1950 | fail = 1; | |
1951 | ||
1952 | if (TYPE_REF_P (base_return) | |
1953 | && (TYPE_REF_IS_RVALUE (base_return) | |
1954 | != TYPE_REF_IS_RVALUE (over_return))) | |
1955 | fail = 1; | |
c8094d83 | 1956 | |
4977bab6 ZW |
1957 | base_return = TREE_TYPE (base_return); |
1958 | over_return = TREE_TYPE (over_return); | |
1959 | } | |
1960 | base_quals = cp_type_quals (base_return); | |
1961 | over_quals = cp_type_quals (over_return); | |
1962 | ||
1963 | if ((base_quals & over_quals) != over_quals) | |
1964 | fail = 1; | |
c8094d83 | 1965 | |
4977bab6 ZW |
1966 | if (CLASS_TYPE_P (base_return) && CLASS_TYPE_P (over_return)) |
1967 | { | |
38ffa828 JM |
1968 | /* Strictly speaking, the standard requires the return type to be |
1969 | complete even if it only differs in cv-quals, but that seems | |
1970 | like a bug in the wording. */ | |
22854930 PC |
1971 | if (!same_type_ignoring_top_level_qualifiers_p (base_return, |
1972 | over_return)) | |
38ffa828 JM |
1973 | { |
1974 | tree binfo = lookup_base (over_return, base_return, | |
22854930 | 1975 | ba_check, NULL, tf_none); |
4cc1d462 | 1976 | |
22854930 | 1977 | if (!binfo || binfo == error_mark_node) |
38ffa828 JM |
1978 | fail = 1; |
1979 | } | |
4977bab6 | 1980 | } |
53db1bc0 JM |
1981 | else if (can_convert_standard (TREE_TYPE (base_type), |
1982 | TREE_TYPE (over_type), | |
1983 | tf_warning_or_error)) | |
4977bab6 ZW |
1984 | /* GNU extension, allow trivial pointer conversions such as |
1985 | converting to void *, or qualification conversion. */ | |
4cc1d462 | 1986 | { |
097f82ec | 1987 | auto_diagnostic_group d; |
53db1bc0 JM |
1988 | if (pedwarn (DECL_SOURCE_LOCATION (overrider), 0, |
1989 | "invalid covariant return type for %q#D", overrider)) | |
1990 | inform (DECL_SOURCE_LOCATION (basefn), | |
d555040f | 1991 | "overridden function is %q#D", basefn); |
4cc1d462 | 1992 | } |
4977bab6 ZW |
1993 | else |
1994 | fail = 2; | |
4cc1d462 | 1995 | } |
4977bab6 ZW |
1996 | else |
1997 | fail = 2; | |
1998 | if (!fail) | |
1999 | /* OK */; | |
4977bab6 | 2000 | else |
4cc1d462 | 2001 | { |
e6321c45 | 2002 | auto_diagnostic_group d; |
4977bab6 | 2003 | if (fail == 1) |
e6321c45 | 2004 | error ("invalid covariant return type for %q+#D", overrider); |
4977bab6 | 2005 | else |
e6321c45 JM |
2006 | error ("conflicting return type specified for %q+#D", overrider); |
2007 | inform (DECL_SOURCE_LOCATION (basefn), | |
2008 | "overridden function is %q#D", basefn); | |
58ec3cc5 | 2009 | DECL_INVALID_OVERRIDER_P (overrider) = 1; |
4cc1d462 NS |
2010 | return 0; |
2011 | } | |
c8094d83 | 2012 | |
78f7607d MP |
2013 | if (!maybe_check_overriding_exception_spec (overrider, basefn)) |
2014 | return 0; | |
c8094d83 | 2015 | |
b8fd7909 JM |
2016 | /* Check for conflicting type attributes. But leave transaction_safe for |
2017 | set_one_vmethod_tm_attributes. */ | |
2018 | if (!comp_type_attributes (over_type, base_type) | |
2019 | && !tx_safe_fn_type_p (base_type) | |
2020 | && !tx_safe_fn_type_p (over_type)) | |
18ff3013 | 2021 | { |
097f82ec | 2022 | auto_diagnostic_group d; |
18ff3013 | 2023 | error ("conflicting type attributes specified for %q+#D", overrider); |
d555040f VR |
2024 | inform (DECL_SOURCE_LOCATION (basefn), |
2025 | "overridden function is %q#D", basefn); | |
18ff3013 DS |
2026 | DECL_INVALID_OVERRIDER_P (overrider) = 1; |
2027 | return 0; | |
2028 | } | |
2029 | ||
e6321c45 JM |
2030 | /* A consteval virtual function shall not override a virtual function that is |
2031 | not consteval. A consteval virtual function shall not be overridden by a | |
2032 | virtual function that is not consteval. */ | |
2033 | if (DECL_IMMEDIATE_FUNCTION_P (overrider) | |
2034 | != DECL_IMMEDIATE_FUNCTION_P (basefn)) | |
2035 | { | |
2036 | auto_diagnostic_group d; | |
2037 | if (DECL_IMMEDIATE_FUNCTION_P (overrider)) | |
2038 | error ("%<consteval%> function %q+D overriding non-%<consteval%> " | |
2039 | "function", overrider); | |
2040 | else | |
2041 | error ("non-%<consteval%> function %q+D overriding %<consteval%> " | |
2042 | "function", overrider); | |
2043 | inform (DECL_SOURCE_LOCATION (basefn), | |
2044 | "overridden function is %qD", basefn); | |
2045 | DECL_INVALID_OVERRIDER_P (overrider) = 1; | |
2046 | return 0; | |
2047 | } | |
2048 | ||
b8fd7909 JM |
2049 | /* A function declared transaction_safe_dynamic that overrides a function |
2050 | declared transaction_safe (but not transaction_safe_dynamic) is | |
2051 | ill-formed. */ | |
2052 | if (tx_safe_fn_type_p (base_type) | |
2053 | && lookup_attribute ("transaction_safe_dynamic", | |
2054 | DECL_ATTRIBUTES (overrider)) | |
2055 | && !lookup_attribute ("transaction_safe_dynamic", | |
2056 | DECL_ATTRIBUTES (basefn))) | |
2057 | { | |
097f82ec | 2058 | auto_diagnostic_group d; |
b8fd7909 JM |
2059 | error_at (DECL_SOURCE_LOCATION (overrider), |
2060 | "%qD declared %<transaction_safe_dynamic%>", overrider); | |
2061 | inform (DECL_SOURCE_LOCATION (basefn), | |
2062 | "overriding %qD declared %<transaction_safe%>", basefn); | |
2063 | } | |
2064 | ||
b87d79e6 JM |
2065 | if (DECL_DELETED_FN (basefn) != DECL_DELETED_FN (overrider)) |
2066 | { | |
2067 | if (DECL_DELETED_FN (overrider)) | |
2068 | { | |
097f82ec | 2069 | auto_diagnostic_group d; |
d555040f VR |
2070 | error ("deleted function %q+D overriding non-deleted function", |
2071 | overrider); | |
2072 | inform (DECL_SOURCE_LOCATION (basefn), | |
2073 | "overridden function is %qD", basefn); | |
ac177431 | 2074 | maybe_explain_implicit_delete (overrider); |
b87d79e6 JM |
2075 | } |
2076 | else | |
2077 | { | |
097f82ec | 2078 | auto_diagnostic_group d; |
d555040f VR |
2079 | error ("non-deleted function %q+D overriding deleted function", |
2080 | overrider); | |
2081 | inform (DECL_SOURCE_LOCATION (basefn), | |
2082 | "overridden function is %qD", basefn); | |
b87d79e6 JM |
2083 | } |
2084 | return 0; | |
2085 | } | |
2efb237f JCI |
2086 | |
2087 | if (!DECL_HAS_CONTRACTS_P (basefn) && DECL_HAS_CONTRACTS_P (overrider)) | |
2088 | { | |
2089 | auto_diagnostic_group d; | |
2090 | error ("function with contracts %q+D overriding contractless function", | |
2091 | overrider); | |
2092 | inform (DECL_SOURCE_LOCATION (basefn), | |
2093 | "overridden function is %qD", basefn); | |
2094 | return 0; | |
2095 | } | |
2096 | else if (DECL_HAS_CONTRACTS_P (basefn) && !DECL_HAS_CONTRACTS_P (overrider)) | |
2097 | { | |
2098 | /* We're inheriting basefn's contracts; create a copy of them but | |
2099 | replace references to their parms to our parms. */ | |
2100 | inherit_base_contracts (overrider, basefn); | |
2101 | } | |
2102 | else if (DECL_HAS_CONTRACTS_P (basefn) && DECL_HAS_CONTRACTS_P (overrider)) | |
2103 | { | |
2104 | /* We're in the process of completing the overrider's class, which means | |
2105 | our conditions definitely are not parsed so simply chain on the | |
2106 | basefn for later checking. | |
2107 | ||
2108 | Note that OVERRIDER's contracts will have been fully parsed at the | |
2109 | point the deferred match is run. */ | |
2110 | defer_guarded_contract_match (overrider, basefn, DECL_CONTRACTS (basefn)); | |
2111 | } | |
2112 | ||
b5da71d4 VV |
2113 | if (DECL_FINAL_P (basefn)) |
2114 | { | |
097f82ec | 2115 | auto_diagnostic_group d; |
d555040f VR |
2116 | error ("virtual function %q+D overriding final function", overrider); |
2117 | inform (DECL_SOURCE_LOCATION (basefn), | |
2118 | "overridden function is %qD", basefn); | |
b5da71d4 VV |
2119 | return 0; |
2120 | } | |
4cc1d462 NS |
2121 | return 1; |
2122 | } | |
2123 | ||
cbb40945 NS |
2124 | /* Given a class TYPE, and a function decl FNDECL, look for |
2125 | virtual functions in TYPE's hierarchy which FNDECL overrides. | |
2126 | We do not look in TYPE itself, only its bases. | |
c8094d83 | 2127 | |
838dfd8a | 2128 | Returns nonzero, if we find any. Set FNDECL's DECL_VIRTUAL_P, if we |
cbb40945 | 2129 | find that it overrides anything. |
c8094d83 | 2130 | |
cbb40945 NS |
2131 | We check that every function which is overridden, is correctly |
2132 | overridden. */ | |
e92cc029 | 2133 | |
cbb40945 | 2134 | int |
86ac0575 | 2135 | look_for_overrides (tree type, tree fndecl) |
8d08fdba | 2136 | { |
cbb40945 | 2137 | tree binfo = TYPE_BINFO (type); |
fa743e8c | 2138 | tree base_binfo; |
cbb40945 NS |
2139 | int ix; |
2140 | int found = 0; | |
8d08fdba | 2141 | |
e52a5db6 JM |
2142 | /* A constructor for a class T does not override a function T |
2143 | in a base class. */ | |
2144 | if (DECL_CONSTRUCTOR_P (fndecl)) | |
2145 | return 0; | |
2146 | ||
fa743e8c | 2147 | for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++) |
cbb40945 | 2148 | { |
fa743e8c | 2149 | tree basetype = BINFO_TYPE (base_binfo); |
c8094d83 | 2150 | |
cbb40945 | 2151 | if (TYPE_POLYMORPHIC_P (basetype)) |
0cbd7506 | 2152 | found += look_for_overrides_r (basetype, fndecl); |
cbb40945 NS |
2153 | } |
2154 | return found; | |
2155 | } | |
5e795528 | 2156 | |
548502d3 MM |
2157 | /* Look in TYPE for virtual functions with the same signature as |
2158 | FNDECL. */ | |
5e795528 | 2159 | |
d0cd8b44 | 2160 | tree |
86ac0575 | 2161 | look_for_overrides_here (tree type, tree fndecl) |
cbb40945 | 2162 | { |
527b7b19 | 2163 | tree ovl = get_class_binding (type, DECL_NAME (fndecl)); |
d0cd8b44 | 2164 | |
2401ffc3 NS |
2165 | for (ovl_iterator iter (ovl); iter; ++iter) |
2166 | { | |
2167 | tree fn = *iter; | |
c8094d83 | 2168 | |
2401ffc3 NS |
2169 | if (!DECL_VIRTUAL_P (fn)) |
2170 | /* Not a virtual. */; | |
2171 | else if (DECL_CONTEXT (fn) != type) | |
2172 | /* Introduced with a using declaration. */; | |
2173 | else if (DECL_STATIC_FUNCTION_P (fndecl)) | |
2174 | { | |
2175 | tree btypes = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
2176 | tree dtypes = TYPE_ARG_TYPES (TREE_TYPE (fndecl)); | |
2177 | if (compparms (TREE_CHAIN (btypes), dtypes)) | |
2178 | return fn; | |
2179 | } | |
2180 | else if (same_signature_p (fndecl, fn)) | |
2181 | return fn; | |
2182 | } | |
d0cd8b44 | 2183 | |
d0cd8b44 JM |
2184 | return NULL_TREE; |
2185 | } | |
e0fff4b3 | 2186 | |
d0cd8b44 | 2187 | /* Look in TYPE for virtual functions overridden by FNDECL. Check both |
c6002625 | 2188 | TYPE itself and its bases. */ |
d0cd8b44 JM |
2189 | |
2190 | static int | |
86ac0575 | 2191 | look_for_overrides_r (tree type, tree fndecl) |
d0cd8b44 JM |
2192 | { |
2193 | tree fn = look_for_overrides_here (type, fndecl); | |
2194 | if (fn) | |
2195 | { | |
2196 | if (DECL_STATIC_FUNCTION_P (fndecl)) | |
2197 | { | |
2198 | /* A static member function cannot match an inherited | |
2199 | virtual member function. */ | |
097f82ec | 2200 | auto_diagnostic_group d; |
dee15844 JM |
2201 | error ("%q+#D cannot be declared", fndecl); |
2202 | error (" since %q+#D declared in base class", fn); | |
d0cd8b44 JM |
2203 | } |
2204 | else | |
2205 | { | |
2206 | /* It's definitely virtual, even if not explicitly set. */ | |
2207 | DECL_VIRTUAL_P (fndecl) = 1; | |
2208 | check_final_overrider (fndecl, fn); | |
8d08fdba | 2209 | } |
d0cd8b44 | 2210 | return 1; |
8d08fdba | 2211 | } |
d0cd8b44 | 2212 | |
cbb40945 NS |
2213 | /* We failed to find one declared in this class. Look in its bases. */ |
2214 | return look_for_overrides (type, fndecl); | |
8d08fdba MS |
2215 | } |
2216 | ||
99a6c6f4 MM |
2217 | /* Called via dfs_walk from dfs_get_pure_virtuals. */ |
2218 | ||
2219 | static tree | |
86ac0575 | 2220 | dfs_get_pure_virtuals (tree binfo, void *data) |
99a6c6f4 | 2221 | { |
174eceea MM |
2222 | tree type = (tree) data; |
2223 | ||
99a6c6f4 MM |
2224 | /* We're not interested in primary base classes; the derived class |
2225 | of which they are a primary base will contain the information we | |
2226 | need. */ | |
9965d119 | 2227 | if (!BINFO_PRIMARY_P (binfo)) |
8926095f | 2228 | { |
07b7a812 | 2229 | tree virtuals; |
c8094d83 | 2230 | |
da3d4dfa | 2231 | for (virtuals = BINFO_VIRTUALS (binfo); |
99a6c6f4 MM |
2232 | virtuals; |
2233 | virtuals = TREE_CHAIN (virtuals)) | |
31f8e4f3 | 2234 | if (DECL_PURE_VIRTUAL_P (BV_FN (virtuals))) |
9771b263 | 2235 | vec_safe_push (CLASSTYPE_PURE_VIRTUALS (type), BV_FN (virtuals)); |
99a6c6f4 | 2236 | } |
8d08fdba | 2237 | |
99a6c6f4 | 2238 | return NULL_TREE; |
8926095f MS |
2239 | } |
2240 | ||
fee7654e | 2241 | /* Set CLASSTYPE_PURE_VIRTUALS for TYPE. */ |
e92cc029 | 2242 | |
fee7654e | 2243 | void |
86ac0575 | 2244 | get_pure_virtuals (tree type) |
8926095f | 2245 | { |
99a6c6f4 MM |
2246 | /* Clear the CLASSTYPE_PURE_VIRTUALS list; whatever is already there |
2247 | is going to be overridden. */ | |
585b44d3 | 2248 | CLASSTYPE_PURE_VIRTUALS (type) = NULL; |
99a6c6f4 MM |
2249 | /* Now, run through all the bases which are not primary bases, and |
2250 | collect the pure virtual functions. We look at the vtable in | |
2251 | each class to determine what pure virtual functions are present. | |
2252 | (A primary base is not interesting because the derived class of | |
2253 | which it is a primary base will contain vtable entries for the | |
2254 | pure virtuals in the base class. */ | |
5d5a519f | 2255 | dfs_walk_once (TYPE_BINFO (type), NULL, dfs_get_pure_virtuals, type); |
8d08fdba | 2256 | } |
8d08fdba | 2257 | \f |
ae673f14 JM |
2258 | /* Debug info for C++ classes can get very large; try to avoid |
2259 | emitting it everywhere. | |
2260 | ||
50e159f6 JM |
2261 | Note that this optimization wins even when the target supports |
2262 | BINCL (if only slightly), and reduces the amount of work for the | |
2263 | linker. */ | |
ae673f14 JM |
2264 | |
2265 | void | |
86ac0575 | 2266 | maybe_suppress_debug_info (tree t) |
ae673f14 | 2267 | { |
f8ca7e49 | 2268 | if (write_symbols == NO_DEBUG) |
ae673f14 JM |
2269 | return; |
2270 | ||
50e159f6 JM |
2271 | /* We might have set this earlier in cp_finish_decl. */ |
2272 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 0; | |
2273 | ||
e713adf6 CD |
2274 | /* Always emit the information for each class every time. */ |
2275 | if (flag_emit_class_debug_always) | |
2276 | return; | |
2277 | ||
ae673f14 JM |
2278 | /* If we already know how we're handling this class, handle debug info |
2279 | the same way. */ | |
3ae18eaf JM |
2280 | if (CLASSTYPE_INTERFACE_KNOWN (t)) |
2281 | { | |
2282 | if (CLASSTYPE_INTERFACE_ONLY (t)) | |
2283 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1; | |
2284 | /* else don't set it. */ | |
2285 | } | |
bbd15aac MM |
2286 | /* If the class has a vtable, write out the debug info along with |
2287 | the vtable. */ | |
2288 | else if (TYPE_CONTAINS_VPTR_P (t)) | |
ae673f14 JM |
2289 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1; |
2290 | ||
2291 | /* Otherwise, just emit the debug info normally. */ | |
2292 | } | |
2293 | ||
6db20143 JM |
2294 | /* Note that we want debugging information for a base class of a class |
2295 | whose vtable is being emitted. Normally, this would happen because | |
2296 | calling the constructor for a derived class implies calling the | |
2297 | constructors for all bases, which involve initializing the | |
2298 | appropriate vptr with the vtable for the base class; but in the | |
2299 | presence of optimization, this initialization may be optimized | |
2300 | away, so we tell finish_vtable_vardecl that we want the debugging | |
2301 | information anyway. */ | |
2302 | ||
2303 | static tree | |
12308bc6 | 2304 | dfs_debug_mark (tree binfo, void * /*data*/) |
6db20143 JM |
2305 | { |
2306 | tree t = BINFO_TYPE (binfo); | |
2307 | ||
5d5a519f NS |
2308 | if (CLASSTYPE_DEBUG_REQUESTED (t)) |
2309 | return dfs_skip_bases; | |
2310 | ||
6db20143 JM |
2311 | CLASSTYPE_DEBUG_REQUESTED (t) = 1; |
2312 | ||
2313 | return NULL_TREE; | |
2314 | } | |
2315 | ||
6db20143 JM |
2316 | /* Write out the debugging information for TYPE, whose vtable is being |
2317 | emitted. Also walk through our bases and note that we want to | |
2318 | write out information for them. This avoids the problem of not | |
2319 | writing any debug info for intermediate basetypes whose | |
2320 | constructors, and thus the references to their vtables, and thus | |
2321 | the vtables themselves, were optimized away. */ | |
8d08fdba MS |
2322 | |
2323 | void | |
86ac0575 | 2324 | note_debug_info_needed (tree type) |
8d08fdba | 2325 | { |
15f1a795 JM |
2326 | if (TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type))) |
2327 | { | |
2328 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type)) = 0; | |
056a17ee | 2329 | rest_of_type_compilation (type, namespace_bindings_p ()); |
15f1a795 | 2330 | } |
d2e5ee5c | 2331 | |
5d5a519f | 2332 | dfs_walk_all (TYPE_BINFO (type), dfs_debug_mark, NULL, 0); |
8d08fdba MS |
2333 | } |
2334 | \f | |
8f2a734f | 2335 | /* Helper for lookup_conversions_r. TO_TYPE is the type converted to |
9c763d19 KH |
2336 | by a conversion op in base BINFO. VIRTUAL_DEPTH is nonzero if |
2337 | BINFO is morally virtual, and VIRTUALNESS is nonzero if virtual | |
8f2a734f NS |
2338 | bases have been encountered already in the tree walk. PARENT_CONVS |
2339 | is the list of lists of conversion functions that could hide CONV | |
2340 | and OTHER_CONVS is the list of lists of conversion functions that | |
2341 | could hide or be hidden by CONV, should virtualness be involved in | |
2342 | the hierarchy. Merely checking the conversion op's name is not | |
2343 | enough because two conversion operators to the same type can have | |
9c763d19 | 2344 | different names. Return nonzero if we are visible. */ |
8f2a734f NS |
2345 | |
2346 | static int | |
2347 | check_hidden_convs (tree binfo, int virtual_depth, int virtualness, | |
2348 | tree to_type, tree parent_convs, tree other_convs) | |
2349 | { | |
2350 | tree level, probe; | |
2351 | ||
2352 | /* See if we are hidden by a parent conversion. */ | |
2353 | for (level = parent_convs; level; level = TREE_CHAIN (level)) | |
2354 | for (probe = TREE_VALUE (level); probe; probe = TREE_CHAIN (probe)) | |
2355 | if (same_type_p (to_type, TREE_TYPE (probe))) | |
2356 | return 0; | |
2357 | ||
2358 | if (virtual_depth || virtualness) | |
2359 | { | |
2360 | /* In a virtual hierarchy, we could be hidden, or could hide a | |
0cbd7506 | 2361 | conversion function on the other_convs list. */ |
8f2a734f NS |
2362 | for (level = other_convs; level; level = TREE_CHAIN (level)) |
2363 | { | |
2364 | int we_hide_them; | |
2365 | int they_hide_us; | |
2366 | tree *prev, other; | |
c8094d83 | 2367 | |
8f2a734f | 2368 | if (!(virtual_depth || TREE_STATIC (level))) |
03fd3f84 | 2369 | /* Neither is morally virtual, so cannot hide each other. */ |
8f2a734f | 2370 | continue; |
c8094d83 | 2371 | |
8f2a734f NS |
2372 | if (!TREE_VALUE (level)) |
2373 | /* They evaporated away already. */ | |
2374 | continue; | |
2375 | ||
2376 | they_hide_us = (virtual_depth | |
2377 | && original_binfo (binfo, TREE_PURPOSE (level))); | |
2378 | we_hide_them = (!they_hide_us && TREE_STATIC (level) | |
2379 | && original_binfo (TREE_PURPOSE (level), binfo)); | |
2380 | ||
2381 | if (!(we_hide_them || they_hide_us)) | |
2382 | /* Neither is within the other, so no hiding can occur. */ | |
2383 | continue; | |
c8094d83 | 2384 | |
8f2a734f NS |
2385 | for (prev = &TREE_VALUE (level), other = *prev; other;) |
2386 | { | |
2387 | if (same_type_p (to_type, TREE_TYPE (other))) | |
2388 | { | |
2389 | if (they_hide_us) | |
03fd3f84 | 2390 | /* We are hidden. */ |
8f2a734f NS |
2391 | return 0; |
2392 | ||
2393 | if (we_hide_them) | |
2394 | { | |
2395 | /* We hide the other one. */ | |
2396 | other = TREE_CHAIN (other); | |
2397 | *prev = other; | |
2398 | continue; | |
2399 | } | |
2400 | } | |
2401 | prev = &TREE_CHAIN (other); | |
2402 | other = *prev; | |
2403 | } | |
2404 | } | |
2405 | } | |
2406 | return 1; | |
2407 | } | |
2408 | ||
2409 | /* Helper for lookup_conversions_r. PARENT_CONVS is a list of lists | |
2410 | of conversion functions, the first slot will be for the current | |
2411 | binfo, if MY_CONVS is non-NULL. CHILD_CONVS is the list of lists | |
77880ae4 KH |
2412 | of conversion functions from children of the current binfo, |
2413 | concatenated with conversions from elsewhere in the hierarchy -- | |
8f2a734f NS |
2414 | that list begins with OTHER_CONVS. Return a single list of lists |
2415 | containing only conversions from the current binfo and its | |
2416 | children. */ | |
2417 | ||
72c4a2a6 | 2418 | static tree |
8f2a734f NS |
2419 | split_conversions (tree my_convs, tree parent_convs, |
2420 | tree child_convs, tree other_convs) | |
e1cd6e56 | 2421 | { |
8f2a734f NS |
2422 | tree t; |
2423 | tree prev; | |
c8094d83 | 2424 | |
8f2a734f NS |
2425 | /* Remove the original other_convs portion from child_convs. */ |
2426 | for (prev = NULL, t = child_convs; | |
2427 | t != other_convs; prev = t, t = TREE_CHAIN (t)) | |
2428 | continue; | |
c8094d83 | 2429 | |
8f2a734f NS |
2430 | if (prev) |
2431 | TREE_CHAIN (prev) = NULL_TREE; | |
2432 | else | |
2433 | child_convs = NULL_TREE; | |
72b7eeff | 2434 | |
8f2a734f NS |
2435 | /* Attach the child convs to any we had at this level. */ |
2436 | if (my_convs) | |
2437 | { | |
2438 | my_convs = parent_convs; | |
2439 | TREE_CHAIN (my_convs) = child_convs; | |
2440 | } | |
2441 | else | |
2442 | my_convs = child_convs; | |
c8094d83 | 2443 | |
8f2a734f NS |
2444 | return my_convs; |
2445 | } | |
2446 | ||
2447 | /* Worker for lookup_conversions. Lookup conversion functions in | |
2e12a855 NS |
2448 | BINFO and its children. VIRTUAL_DEPTH is nonzero, if BINFO is in a |
2449 | morally virtual base, and VIRTUALNESS is nonzero, if we've | |
2450 | encountered virtual bases already in the tree walk. PARENT_CONVS | |
2451 | is a list of conversions within parent binfos. OTHER_CONVS are | |
2452 | conversions found elsewhere in the tree. Return the conversions | |
2453 | found within this portion of the graph in CONVS. Return nonzero if | |
2454 | we encountered virtualness. We keep template and non-template | |
8f2a734f NS |
2455 | conversions separate, to avoid unnecessary type comparisons. |
2456 | ||
2457 | The located conversion functions are held in lists of lists. The | |
2458 | TREE_VALUE of the outer list is the list of conversion functions | |
2459 | found in a particular binfo. The TREE_PURPOSE of both the outer | |
2460 | and inner lists is the binfo at which those conversions were | |
2461 | found. TREE_STATIC is set for those lists within of morally | |
2462 | virtual binfos. The TREE_VALUE of the inner list is the conversion | |
2463 | function or overload itself. The TREE_TYPE of each inner list node | |
2464 | is the converted-to type. */ | |
2465 | ||
2466 | static int | |
2e12a855 NS |
2467 | lookup_conversions_r (tree binfo, int virtual_depth, int virtualness, |
2468 | tree parent_convs, tree other_convs, tree *convs) | |
8f2a734f NS |
2469 | { |
2470 | int my_virtualness = 0; | |
2471 | tree my_convs = NULL_TREE; | |
8f2a734f | 2472 | tree child_convs = NULL_TREE; |
a7a64a77 | 2473 | |
8f2a734f NS |
2474 | /* If we have no conversion operators, then don't look. */ |
2475 | if (!TYPE_HAS_CONVERSION (BINFO_TYPE (binfo))) | |
2476 | { | |
2e12a855 | 2477 | *convs = NULL_TREE; |
c8094d83 | 2478 | |
8f2a734f NS |
2479 | return 0; |
2480 | } | |
c8094d83 | 2481 | |
8f2a734f NS |
2482 | if (BINFO_VIRTUAL_P (binfo)) |
2483 | virtual_depth++; | |
c8094d83 | 2484 | |
8f2a734f | 2485 | /* First, locate the unhidden ones at this level. */ |
527b7b19 | 2486 | if (tree conv = get_class_binding (BINFO_TYPE (binfo), conv_op_identifier)) |
2e12a855 NS |
2487 | for (ovl_iterator iter (conv); iter; ++iter) |
2488 | { | |
2489 | tree fn = *iter; | |
2490 | tree type = DECL_CONV_FN_TYPE (fn); | |
72c4a2a6 | 2491 | |
2e12a855 | 2492 | if (TREE_CODE (fn) != TEMPLATE_DECL && type_uses_auto (type)) |
8f2a734f | 2493 | { |
2e12a855 NS |
2494 | mark_used (fn); |
2495 | type = DECL_CONV_FN_TYPE (fn); | |
2496 | } | |
8f2a734f | 2497 | |
2e12a855 NS |
2498 | if (check_hidden_convs (binfo, virtual_depth, virtualness, |
2499 | type, parent_convs, other_convs)) | |
2500 | { | |
2501 | my_convs = tree_cons (binfo, fn, my_convs); | |
2502 | TREE_TYPE (my_convs) = type; | |
2503 | if (virtual_depth) | |
20d65560 | 2504 | { |
2e12a855 NS |
2505 | TREE_STATIC (my_convs) = 1; |
2506 | my_virtualness = 1; | |
20d65560 | 2507 | } |
72c4a2a6 | 2508 | } |
72b7eeff | 2509 | } |
8f2a734f NS |
2510 | |
2511 | if (my_convs) | |
2512 | { | |
2513 | parent_convs = tree_cons (binfo, my_convs, parent_convs); | |
2514 | if (virtual_depth) | |
2515 | TREE_STATIC (parent_convs) = 1; | |
2516 | } | |
c8094d83 | 2517 | |
8f2a734f | 2518 | child_convs = other_convs; |
c8094d83 | 2519 | |
8f2a734f | 2520 | /* Now iterate over each base, looking for more conversions. */ |
2e12a855 NS |
2521 | unsigned i; |
2522 | tree base_binfo; | |
8f2a734f NS |
2523 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) |
2524 | { | |
2e12a855 | 2525 | tree base_convs; |
8f2a734f NS |
2526 | unsigned base_virtualness; |
2527 | ||
2528 | base_virtualness = lookup_conversions_r (base_binfo, | |
2529 | virtual_depth, virtualness, | |
2e12a855 NS |
2530 | parent_convs, child_convs, |
2531 | &base_convs); | |
8f2a734f NS |
2532 | if (base_virtualness) |
2533 | my_virtualness = virtualness = 1; | |
2534 | child_convs = chainon (base_convs, child_convs); | |
8f2a734f NS |
2535 | } |
2536 | ||
8f2a734f NS |
2537 | *convs = split_conversions (my_convs, parent_convs, |
2538 | child_convs, other_convs); | |
c8094d83 | 2539 | |
8f2a734f | 2540 | return my_virtualness; |
e1cd6e56 MS |
2541 | } |
2542 | ||
27b8d0cd MM |
2543 | /* Return a TREE_LIST containing all the non-hidden user-defined |
2544 | conversion functions for TYPE (and its base-classes). The | |
8f2a734f NS |
2545 | TREE_VALUE of each node is the FUNCTION_DECL of the conversion |
2546 | function. The TREE_PURPOSE is the BINFO from which the conversion | |
2547 | functions in this node were selected. This function is effectively | |
2548 | performing a set of member lookups as lookup_fnfield does, but | |
2549 | using the type being converted to as the unique key, rather than the | |
9c7d5cae | 2550 | field name. */ |
27b8d0cd | 2551 | |
e1cd6e56 | 2552 | tree |
9c7d5cae | 2553 | lookup_conversions (tree type) |
e1cd6e56 | 2554 | { |
2e12a855 | 2555 | tree convs; |
c8094d83 | 2556 | |
0171b21c | 2557 | complete_type (type); |
ae8310ec | 2558 | if (!CLASS_TYPE_P (type) || !TYPE_BINFO (type)) |
8f2a734f | 2559 | return NULL_TREE; |
c8094d83 | 2560 | |
2e12a855 | 2561 | lookup_conversions_r (TYPE_BINFO (type), 0, 0, NULL_TREE, NULL_TREE, &convs); |
c8094d83 | 2562 | |
2e12a855 NS |
2563 | tree list = NULL_TREE; |
2564 | ||
8f2a734f NS |
2565 | /* Flatten the list-of-lists */ |
2566 | for (; convs; convs = TREE_CHAIN (convs)) | |
2567 | { | |
2568 | tree probe, next; | |
2569 | ||
2570 | for (probe = TREE_VALUE (convs); probe; probe = next) | |
2571 | { | |
2572 | next = TREE_CHAIN (probe); | |
2573 | ||
2574 | TREE_CHAIN (probe) = list; | |
2575 | list = probe; | |
2576 | } | |
2577 | } | |
c8094d83 | 2578 | |
8f2a734f | 2579 | return list; |
e1cd6e56 | 2580 | } |
6467930b | 2581 | |
9965d119 NS |
2582 | /* Returns the binfo of the first direct or indirect virtual base derived |
2583 | from BINFO, or NULL if binfo is not via virtual. */ | |
6ad07332 | 2584 | |
f9825168 | 2585 | tree |
86ac0575 | 2586 | binfo_from_vbase (tree binfo) |
6ad07332 JM |
2587 | { |
2588 | for (; binfo; binfo = BINFO_INHERITANCE_CHAIN (binfo)) | |
2589 | { | |
809e3e7f | 2590 | if (BINFO_VIRTUAL_P (binfo)) |
f9825168 | 2591 | return binfo; |
6ad07332 | 2592 | } |
f9825168 | 2593 | return NULL_TREE; |
6ad07332 | 2594 | } |
a55583e9 | 2595 | |
9965d119 NS |
2596 | /* Returns the binfo of the first direct or indirect virtual base derived |
2597 | from BINFO up to the TREE_TYPE, LIMIT, or NULL if binfo is not | |
2598 | via virtual. */ | |
2599 | ||
2600 | tree | |
86ac0575 | 2601 | binfo_via_virtual (tree binfo, tree limit) |
9965d119 | 2602 | { |
2c2e8978 NS |
2603 | if (limit && !CLASSTYPE_VBASECLASSES (limit)) |
2604 | /* LIMIT has no virtual bases, so BINFO cannot be via one. */ | |
2605 | return NULL_TREE; | |
c8094d83 | 2606 | |
539ed333 | 2607 | for (; binfo && !SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), limit); |
9965d119 NS |
2608 | binfo = BINFO_INHERITANCE_CHAIN (binfo)) |
2609 | { | |
809e3e7f | 2610 | if (BINFO_VIRTUAL_P (binfo)) |
9965d119 NS |
2611 | return binfo; |
2612 | } | |
2613 | return NULL_TREE; | |
2614 | } | |
2615 | ||
84eb0f1a JM |
2616 | /* BINFO is for a base class in some hierarchy. Return true iff it is a |
2617 | direct base. */ | |
2618 | ||
2619 | bool | |
2620 | binfo_direct_p (tree binfo) | |
2621 | { | |
2622 | tree d_binfo = BINFO_INHERITANCE_CHAIN (binfo); | |
2623 | if (BINFO_INHERITANCE_CHAIN (d_binfo)) | |
2624 | /* A second inheritance chain means indirect. */ | |
2625 | return false; | |
2626 | if (!BINFO_VIRTUAL_P (binfo)) | |
2627 | /* Non-virtual, so only one inheritance chain means direct. */ | |
2628 | return true; | |
2629 | /* A virtual base looks like a direct base, so we need to look through the | |
2630 | direct bases to see if it's there. */ | |
2631 | tree b_binfo; | |
2632 | for (int i = 0; BINFO_BASE_ITERATE (d_binfo, i, b_binfo); ++i) | |
2633 | if (b_binfo == binfo) | |
2634 | return true; | |
2635 | return false; | |
2636 | } | |
2637 | ||
dbbf88d1 NS |
2638 | /* BINFO is a base binfo in the complete type BINFO_TYPE (HERE). |
2639 | Find the equivalent binfo within whatever graph HERE is located. | |
9bcb9aae | 2640 | This is the inverse of original_binfo. */ |
a55583e9 MM |
2641 | |
2642 | tree | |
dbbf88d1 | 2643 | copied_binfo (tree binfo, tree here) |
a55583e9 | 2644 | { |
dbbf88d1 | 2645 | tree result = NULL_TREE; |
c8094d83 | 2646 | |
809e3e7f | 2647 | if (BINFO_VIRTUAL_P (binfo)) |
dbbf88d1 NS |
2648 | { |
2649 | tree t; | |
a55583e9 | 2650 | |
dbbf88d1 NS |
2651 | for (t = here; BINFO_INHERITANCE_CHAIN (t); |
2652 | t = BINFO_INHERITANCE_CHAIN (t)) | |
2653 | continue; | |
58c42dc2 NS |
2654 | |
2655 | result = binfo_for_vbase (BINFO_TYPE (binfo), BINFO_TYPE (t)); | |
dbbf88d1 NS |
2656 | } |
2657 | else if (BINFO_INHERITANCE_CHAIN (binfo)) | |
2658 | { | |
fa743e8c NS |
2659 | tree cbinfo; |
2660 | tree base_binfo; | |
2661 | int ix; | |
c8094d83 | 2662 | |
fa743e8c NS |
2663 | cbinfo = copied_binfo (BINFO_INHERITANCE_CHAIN (binfo), here); |
2664 | for (ix = 0; BINFO_BASE_ITERATE (cbinfo, ix, base_binfo); ix++) | |
539ed333 | 2665 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo), BINFO_TYPE (binfo))) |
fa743e8c NS |
2666 | { |
2667 | result = base_binfo; | |
2668 | break; | |
2669 | } | |
dbbf88d1 NS |
2670 | } |
2671 | else | |
2672 | { | |
539ed333 | 2673 | gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (here), BINFO_TYPE (binfo))); |
dbbf88d1 NS |
2674 | result = here; |
2675 | } | |
2676 | ||
50bc768d | 2677 | gcc_assert (result); |
dbbf88d1 | 2678 | return result; |
a55583e9 | 2679 | } |
dbbf88d1 | 2680 | |
58c42dc2 NS |
2681 | tree |
2682 | binfo_for_vbase (tree base, tree t) | |
2683 | { | |
2684 | unsigned ix; | |
2685 | tree binfo; | |
9771b263 | 2686 | vec<tree, va_gc> *vbases; |
c8094d83 | 2687 | |
9ba5ff0f | 2688 | for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0; |
9771b263 | 2689 | vec_safe_iterate (vbases, ix, &binfo); ix++) |
539ed333 | 2690 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), base)) |
58c42dc2 NS |
2691 | return binfo; |
2692 | return NULL; | |
2693 | } | |
2694 | ||
dbbf88d1 | 2695 | /* BINFO is some base binfo of HERE, within some other |
34cd5ae7 | 2696 | hierarchy. Return the equivalent binfo, but in the hierarchy |
dbbf88d1 | 2697 | dominated by HERE. This is the inverse of copied_binfo. If BINFO |
9bcb9aae | 2698 | is not a base binfo of HERE, returns NULL_TREE. */ |
dbbf88d1 NS |
2699 | |
2700 | tree | |
2701 | original_binfo (tree binfo, tree here) | |
2702 | { | |
2703 | tree result = NULL; | |
c8094d83 | 2704 | |
539ed333 | 2705 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (here))) |
dbbf88d1 | 2706 | result = here; |
809e3e7f | 2707 | else if (BINFO_VIRTUAL_P (binfo)) |
58c42dc2 NS |
2708 | result = (CLASSTYPE_VBASECLASSES (BINFO_TYPE (here)) |
2709 | ? binfo_for_vbase (BINFO_TYPE (binfo), BINFO_TYPE (here)) | |
2710 | : NULL_TREE); | |
dbbf88d1 NS |
2711 | else if (BINFO_INHERITANCE_CHAIN (binfo)) |
2712 | { | |
2713 | tree base_binfos; | |
c8094d83 | 2714 | |
dbbf88d1 NS |
2715 | base_binfos = original_binfo (BINFO_INHERITANCE_CHAIN (binfo), here); |
2716 | if (base_binfos) | |
2717 | { | |
fa743e8c NS |
2718 | int ix; |
2719 | tree base_binfo; | |
c8094d83 | 2720 | |
fa743e8c | 2721 | for (ix = 0; (base_binfo = BINFO_BASE_BINFO (base_binfos, ix)); ix++) |
539ed333 NS |
2722 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo), |
2723 | BINFO_TYPE (binfo))) | |
fa743e8c NS |
2724 | { |
2725 | result = base_binfo; | |
2726 | break; | |
2727 | } | |
dbbf88d1 NS |
2728 | } |
2729 | } | |
c8094d83 | 2730 | |
dbbf88d1 NS |
2731 | return result; |
2732 | } | |
2733 | ||
23cb7266 JM |
2734 | /* True iff TYPE has any dependent bases (and therefore we can't say |
2735 | definitively that another class is not a base of an instantiation of | |
2736 | TYPE). */ | |
2737 | ||
2738 | bool | |
2739 | any_dependent_bases_p (tree type) | |
2740 | { | |
e597f682 | 2741 | if (!type || !CLASS_TYPE_P (type) || !uses_template_parms (type)) |
23cb7266 JM |
2742 | return false; |
2743 | ||
b4cda6a6 JM |
2744 | /* If we haven't set TYPE_BINFO yet, we don't know anything about the bases. |
2745 | Return false because in this situation we aren't actually looking up names | |
2746 | in the scope of the class, so it doesn't matter whether it has dependent | |
2747 | bases. */ | |
2748 | if (!TYPE_BINFO (type)) | |
2749 | return false; | |
2750 | ||
23cb7266 JM |
2751 | unsigned i; |
2752 | tree base_binfo; | |
2753 | FOR_EACH_VEC_SAFE_ELT (BINFO_BASE_BINFOS (TYPE_BINFO (type)), i, base_binfo) | |
2754 | if (BINFO_DEPENDENT_BASE_P (base_binfo)) | |
2755 | return true; | |
2756 | ||
2757 | return false; | |
2758 | } |