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