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