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