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 1155936809 : dfs_lookup_base (tree binfo, void *data_)
77 : {
78 1155936809 : struct lookup_base_data_s *data = (struct lookup_base_data_s *) data_;
79 :
80 1155936809 : if (data->offset != -1)
81 : {
82 : /* We're looking for the type at a particular offset. */
83 10504288 : int comp = compare_tree_int (BINFO_OFFSET (binfo), data->offset);
84 10504288 : 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 10361072 : else if (comp != 0
90 10367483 : && 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 1155793590 : if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->base))
97 : {
98 490071888 : const bool via_virtual
99 490071888 : = binfo_via_virtual (binfo, data->t) != NULL_TREE;
100 :
101 490071888 : 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 490071212 : if (!data->binfo)
107 : {
108 490069587 : data->binfo = binfo;
109 490069587 : data->via_virtual = via_virtual;
110 :
111 490069587 : if (!data->repeated_base)
112 : /* If there are no repeated bases, we can stop now. */
113 : return binfo;
114 :
115 12379 : 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 73470003 : accessible_base_p (tree t, tree base, bool consider_local_p)
198 : {
199 73470003 : 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 73470003 : 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 16555947 : decl = TYPE_FIELDS (base);
213 888958699 : while (!DECL_SELF_REFERENCE_P (decl))
214 872402752 : decl = DECL_CHAIN (decl);
215 16555947 : while (ANON_AGGR_TYPE_P (t))
216 0 : t = TYPE_CONTEXT (t);
217 16555947 : 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 1015878671 : 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 1015878671 : tree binfo;
235 1015878671 : tree t_binfo;
236 1015878671 : base_kind bk;
237 :
238 : /* "Nothing" is definitely not derived from Base. */
239 1015878671 : if (t == NULL_TREE)
240 : {
241 11147 : if (kind_ptr)
242 0 : *kind_ptr = bk_not_base;
243 11147 : return NULL_TREE;
244 : }
245 :
246 1015867524 : 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 1015867524 : gcc_assert (TYPE_P (base));
253 :
254 1015867524 : if (!TYPE_P (t))
255 : {
256 6866197 : t_binfo = t;
257 6866197 : t = BINFO_TYPE (t);
258 : }
259 : else
260 : {
261 1009001327 : t = complete_type (TYPE_MAIN_VARIANT (t));
262 1009001327 : if (dependent_type_p (t))
263 174111930 : if (tree open = currently_open_class (t))
264 1009001327 : t = open;
265 1009001327 : t_binfo = TYPE_BINFO (t);
266 : }
267 :
268 1015867524 : 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 1015867524 : if (t_binfo && CLASS_TYPE_P (base) && COMPLETE_OR_OPEN_TYPE_P (base))
273 : {
274 999459311 : struct lookup_base_data_s data;
275 :
276 999459311 : data.t = t;
277 999459311 : data.base = base;
278 999459311 : data.binfo = NULL_TREE;
279 999459311 : data.ambiguous = data.via_virtual = false;
280 999459311 : data.repeated_base = (offset == -1) && CLASSTYPE_REPEATED_BASE_P (t);
281 999459311 : data.want_any = access == ba_any;
282 999459311 : data.offset = offset;
283 999459311 : data.require_virtual = (access & ba_require_virtual);
284 :
285 999459311 : dfs_walk_once (t_binfo, dfs_lookup_base, NULL, &data);
286 999459311 : binfo = data.binfo;
287 :
288 999459311 : if (!binfo)
289 509391253 : bk = data.ambiguous ? bk_ambig : bk_not_base;
290 490068058 : else if (binfo == t_binfo)
291 : bk = bk_same_type;
292 83629435 : else if (data.via_virtual)
293 : bk = bk_via_virtual;
294 : else
295 82862676 : 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 1015867524 : if (access != ba_any)
305 26858089 : 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 26830390 : default:
317 26830390 : 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 6975517 : && COMPLETE_TYPE_P (base)
325 33805901 : && !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 1015867524 : if (kind_ptr)
336 4783499 : *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 43942 : dfs_dcast_hint_pre (tree binfo, void *data_)
358 : {
359 43942 : struct dcast_data_s *data = (struct dcast_data_s *) data_;
360 :
361 43942 : if (BINFO_VIRTUAL_P (binfo))
362 300 : data->virt_depth++;
363 :
364 43942 : if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->subtype))
365 : {
366 21287 : if (data->virt_depth)
367 : {
368 239 : data->offset = ssize_int (-1);
369 239 : return data->offset;
370 : }
371 21048 : if (data->offset)
372 12 : data->offset = ssize_int (-3);
373 : else
374 21036 : data->offset = BINFO_OFFSET (binfo);
375 :
376 21048 : 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 21644 : dcast_base_hint (tree subtype, tree target)
408 : {
409 21644 : struct dcast_data_s data;
410 :
411 21644 : data.subtype = subtype;
412 21644 : data.virt_depth = 0;
413 21644 : data.offset = NULL_TREE;
414 21644 : data.repeated_base = CLASSTYPE_REPEATED_BASE_P (target);
415 :
416 21644 : dfs_walk_once_accessible (TYPE_BINFO (target), /*friends=*/false,
417 : dfs_dcast_hint_pre, dfs_dcast_hint_post, &data);
418 21644 : 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 2883371072 : 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 871422491 : if (current_function_decl && current_class_type
449 3486039289 : && ((DECL_FUNCTION_MEMBER_P (current_function_decl)
450 588474069 : && same_type_p (DECL_CONTEXT (current_function_decl),
451 : current_class_type))
452 48173325 : || (DECL_FRIEND_CONTEXT (current_function_decl)
453 19338354 : && same_type_p (DECL_FRIEND_CONTEXT (current_function_decl),
454 : current_class_type))))
455 587899951 : return current_function_decl;
456 :
457 2295471121 : if (current_class_type)
458 : return current_class_type;
459 :
460 1135617981 : if (current_function_decl)
461 : return current_function_decl;
462 :
463 866863707 : 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 529830939 : at_function_scope_p (void)
472 : {
473 529830939 : 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 529830939 : return (cs && TREE_CODE (cs) == FUNCTION_DECL
478 708184240 : && cfun && cfun->decl == current_function_decl);
479 : }
480 :
481 : /* Returns true if the innermost active scope is a class scope. */
482 :
483 : bool
484 850476754 : at_class_scope_p (void)
485 : {
486 850476754 : tree cs = current_scope ();
487 850476754 : return cs && TYPE_P (cs);
488 : }
489 :
490 : /* Returns true if the innermost active scope is a namespace scope. */
491 :
492 : bool
493 596640002 : at_namespace_scope_p (void)
494 : {
495 596640002 : tree cs = current_scope ();
496 596640002 : 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 6735306869 : 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 6735306869 : tree context = DECL_CONTEXT (decl);
511 :
512 12975446271 : while (context && TYPE_P (context)
513 9963814975 : && (ANON_AGGR_TYPE_P (context) || UNSCOPED_ENUM_P (context)))
514 54634689 : context = TYPE_CONTEXT (context);
515 6735306869 : if (!context)
516 549802156 : context = global_namespace;
517 :
518 6735306869 : 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 2507023 : type_context_for_name_lookup (tree decl)
526 : {
527 2507023 : tree context = DECL_P (decl) ? DECL_CONTEXT (decl) : decl;
528 2507023 : gcc_checking_assert (CLASS_TYPE_P (context));
529 :
530 2525216 : while (context && TYPE_P (context) && ANON_AGGR_TYPE_P (context))
531 : {
532 18205 : tree next = TYPE_CONTEXT (context);
533 18205 : if (!TYPE_P (next))
534 : break;
535 : context = next;
536 : }
537 2507023 : return context;
538 : }
539 :
540 : /* Returns true iff DECL is declared in TYPE. */
541 :
542 : static bool
543 685063477 : member_declared_in_type (tree decl, tree type)
544 : {
545 : /* A normal declaration obviously counts. */
546 685063477 : if (context_for_name_lookup (decl) == type)
547 : return true;
548 : /* So does a using or access declaration. */
549 205320614 : if (DECL_LANG_SPECIFIC (decl) && !DECL_DISCRIMINATOR_P (decl)
550 205320614 : && 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 631957477 : dfs_access_in_type_pre (tree binfo, void *data)
562 : {
563 631957477 : tree decl = (tree) data;
564 631957477 : tree type = BINFO_TYPE (binfo);
565 631957477 : if (member_declared_in_type (decl, type))
566 531817573 : 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 631957477 : dfs_access_in_type (tree binfo, void *data)
584 : {
585 631957477 : tree decl = (tree) data;
586 631957477 : tree type = BINFO_TYPE (binfo);
587 631957477 : access_kind access = ak_none;
588 :
589 631957477 : 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 531146723 : if (TREE_PRIVATE (decl))
594 : access = ak_private;
595 494080014 : else if (TREE_PROTECTED (decl))
596 : access = ak_protected;
597 : else
598 577829847 : access = ak_public;
599 : }
600 : else
601 : {
602 : /* First, check for an access-declaration that gives us more
603 : access to the DECL. */
604 100810754 : if (DECL_LANG_SPECIFIC (decl) && !DECL_DISCRIMINATOR_P (decl))
605 : {
606 155071152 : tree decl_access = purpose_member (type, DECL_ACCESS (decl));
607 :
608 95559489 : if (decl_access)
609 : {
610 670850 : decl_access = TREE_VALUE (decl_access);
611 :
612 670850 : if (decl_access == access_public_node)
613 : access = ak_public;
614 247527 : else if (decl_access == access_protected_node)
615 : access = ak_protected;
616 42548 : 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 100139904 : int i;
626 100139904 : tree base_binfo;
627 100139904 : vec<tree, va_gc> *accesses;
628 :
629 : /* Otherwise, scan our baseclasses, and pick the most favorable
630 : access. */
631 100139904 : accesses = BINFO_BASE_ACCESSES (binfo);
632 107201505 : for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
633 : {
634 99549826 : tree base_access = (*accesses)[i];
635 99549826 : access_kind base_access_now = BINFO_ACCESS (base_binfo);
636 :
637 99549826 : 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 97072582 : 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 96517139 : 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 95239539 : if (base_access_now != ak_none
654 97072582 : && (access == ak_none || base_access_now < access))
655 : {
656 97072173 : access = base_access_now;
657 :
658 : /* If the new access is public, we can't do better. */
659 97072173 : if (access == ak_public)
660 : break;
661 : }
662 : }
663 : }
664 : }
665 :
666 : /* Note the access to DECL in TYPE. */
667 631957477 : SET_BINFO_ACCESS (binfo, access);
668 :
669 631957477 : return NULL_TREE;
670 : }
671 :
672 : /* Return the access to DECL in TYPE. */
673 :
674 : static access_kind
675 531817140 : access_in_type (tree type, tree decl)
676 : {
677 531817140 : 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 531817140 : dfs_walk_once (binfo, dfs_access_in_type_pre, dfs_access_in_type, decl);
691 :
692 531817140 : 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 9541705 : 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 9541705 : if (!DERIVED_FROM_P (type, derived))
712 : return 0;
713 :
714 : /* DECL_NONSTATIC_MEMBER_P won't work for USING_DECLs. */
715 9366244 : decl = strip_using_decl (decl);
716 : /* We don't expect or support dependent decls. */
717 9366244 : 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 15213186 : if (DECL_NONSTATIC_MEMBER_P (decl)
731 13744535 : && !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 16793980 : 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 16793980 : tree befriending_classes;
753 16793980 : tree t;
754 :
755 16793980 : if (!scope)
756 : return 0;
757 :
758 16793980 : if (is_global_friend (scope))
759 : return 1;
760 :
761 : /* Is SCOPE itself a suitable P? */
762 16793980 : if (TYPE_P (scope) && protected_accessible_p (decl, scope, type, otype))
763 : return 1;
764 :
765 7502607 : if (DECL_DECLARES_FUNCTION_P (scope))
766 7349093 : befriending_classes = DECL_BEFRIENDING_CLASSES (scope);
767 153514 : else if (TYPE_P (scope))
768 151599 : befriending_classes = CLASSTYPE_BEFRIENDING_CLASSES (scope);
769 : else
770 : return 0;
771 :
772 7524787 : for (t = befriending_classes; t; t = TREE_CHAIN (t))
773 98733 : 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 7426054 : if (TYPE_P (scope))
779 77501 : if (friend_accessible_p (TYPE_CONTEXT (scope), decl, type, otype))
780 : return 1;
781 :
782 7349339 : if (DECL_DECLARES_FUNCTION_P (scope))
783 : {
784 : /* Perhaps this SCOPE is a member of a class which is a
785 : friend. */
786 14697106 : if (DECL_CLASS_SCOPE_P (scope)
787 14696747 : && 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 1241 : if (tree tinfo = get_template_info (scope))
798 : {
799 985 : tree tmpl = TI_TEMPLATE (tinfo);
800 985 : if (DECL_CLASS_TEMPLATE_P (tmpl))
801 725 : tmpl = TREE_TYPE (tmpl);
802 : else
803 260 : tmpl = DECL_TEMPLATE_RESULT (tmpl);
804 985 : if (tmpl != scope)
805 : {
806 : /* Increment processing_template_decl to make sure that
807 : dependent_type_p works correctly. */
808 841 : ++processing_template_decl;
809 841 : int ret = friend_accessible_p (tmpl, decl, type, otype);
810 841 : --processing_template_decl;
811 841 : 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 53106000 : dfs_accessible_pre (tree binfo, void *data)
832 : {
833 53106000 : dfs_accessible_data *d = (dfs_accessible_data *)data;
834 53106000 : tree type = BINFO_TYPE (binfo);
835 53106000 : if (member_declared_in_type (d->decl, type))
836 47929239 : 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 48440200 : dfs_accessible_post (tree binfo, void *data)
844 : {
845 : /* access_in_type already set BINFO_ACCESS for us. */
846 48440200 : access_kind access = BINFO_ACCESS (binfo);
847 48440200 : tree N = BINFO_TYPE (binfo);
848 48440200 : dfs_accessible_data *d = (dfs_accessible_data *)data;
849 48440200 : tree decl = d->decl;
850 48440200 : tree scope = current_nonlambda_scope ();
851 :
852 : /* A member m is accessible at the point R when named in class N if */
853 48440200 : 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 37109324 : case ak_private:
863 37109324 : {
864 : /* m as a member of N is private, and R occurs in a member or friend of
865 : class N, or */
866 37109324 : if (scope && TREE_CODE (scope) != NAMESPACE_DECL
867 74217364 : && is_friend (N, scope))
868 : return binfo;
869 : return NULL_TREE;
870 : }
871 :
872 9367441 : case ak_protected:
873 9367441 : {
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 9367441 : 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 4242512 : accessible_in_template_p (tree type, tree decl)
892 : {
893 4242512 : int save_ptd = processing_template_decl;
894 4242512 : processing_template_decl = 0;
895 4242512 : int val = accessible_p (type, decl, false);
896 4242512 : processing_template_decl = save_ptd;
897 4242512 : 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 531816915 : accessible_p (tree type, tree decl, bool consider_local_p)
910 : {
911 531816915 : tree binfo;
912 531816915 : access_kind access;
913 :
914 : /* If this declaration is in a block or namespace scope, there's no
915 : access control. */
916 531816915 : 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 531816862 : if (current_function_decl && DECL_THUNK_P (current_function_decl))
921 : return 1;
922 :
923 531816862 : tree otype = NULL_TREE;
924 531816862 : 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 1041009992 : for (tree b = type; b; b = BINFO_INHERITANCE_CHAIN (b))
930 530023195 : otype = BINFO_TYPE (b);
931 510986797 : type = BINFO_TYPE (type);
932 : }
933 : else
934 : otype = type;
935 :
936 : /* Anonymous unions don't have their own access. */
937 531816862 : 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 531816862 : binfo = TYPE_BINFO (type);
962 :
963 : /* Compute the accessibility of DECL in the class hierarchy
964 : dominated by type. */
965 531816862 : access = access_in_type (type, decl);
966 531816862 : 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 47931263 : if (!consider_local_p)
972 : return 0;
973 :
974 47930462 : dfs_accessible_data d = { decl, otype };
975 :
976 : /* Walk the hierarchy again, looking for a base class that allows
977 : access. */
978 47930462 : return dfs_walk_once_accessible (binfo, /*friends=*/true,
979 : dfs_accessible_pre,
980 : dfs_accessible_post, &d)
981 47930462 : != 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 44667827 : shared_member_p (tree t)
1012 : {
1013 44667827 : if (VAR_P (t) || TREE_CODE (t) == TYPE_DECL
1014 42844580 : || TREE_CODE (t) == CONST_DECL)
1015 : return true;
1016 42841050 : if (is_overloaded_fn (t))
1017 : {
1018 69446292 : for (ovl_iterator iter (get_fns (t)); iter; ++iter)
1019 : {
1020 46621422 : tree decl = strip_using_decl (*iter);
1021 46621422 : if (TREE_CODE (decl) == USING_DECL)
1022 : /* Conservatively assume a dependent using-declaration
1023 : might resolve to a non-static member. */
1024 28123283 : return false;
1025 46621419 : if (DECL_OBJECT_MEMBER_FUNCTION_P (decl))
1026 : return false;
1027 : }
1028 14717343 : 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 4479652 : is_subobject_of_p (tree parent, tree binfo)
1039 : {
1040 4479652 : tree probe;
1041 :
1042 10236224 : for (probe = parent; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
1043 : {
1044 7411268 : if (probe == binfo)
1045 : return 1;
1046 7372031 : if (BINFO_VIRTUAL_P (probe))
1047 1615459 : return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (binfo))
1048 1615459 : != 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 6956881474 : lookup_field_r (tree binfo, void *data)
1060 : {
1061 6956881474 : struct lookup_field_info *lfi = (struct lookup_field_info *) data;
1062 6956881474 : tree type = BINFO_TYPE (binfo);
1063 6956881474 : tree nval = NULL_TREE;
1064 :
1065 : /* If this is a dependent base, don't look in it. */
1066 6956881474 : 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 77034075 : if (lfi->rval_binfo && BINFO_INHERITANCE_CHAIN (binfo) == lfi->rval_binfo
1072 5762548076 : && !BINFO_VIRTUAL_P (binfo))
1073 : return dfs_skip_bases;
1074 :
1075 5627331782 : 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 5627331782 : if (!nval)
1080 4810712560 : 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 816619222 : if (lfi->rval_binfo
1085 816619222 : && !is_subobject_of_p (lfi->rval_binfo, binfo))
1086 :
1087 : {
1088 2220294 : if (nval == lfi->rval && shared_member_p (nval))
1089 : /* The two things are really the same. */
1090 : ;
1091 2220084 : 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 648779 : 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 512191 : lfi->ambiguous = tree_cons (NULL_TREE, lfi->rval, NULL_TREE);
1104 512191 : TREE_TYPE (lfi->ambiguous) = error_mark_node;
1105 : }
1106 :
1107 : /* Add the new value. */
1108 648779 : if (TREE_CODE (nval) == TREE_LIST)
1109 7 : lfi->ambiguous = chainon (nval, lfi->ambiguous);
1110 : else
1111 : {
1112 648772 : lfi->ambiguous = tree_cons (NULL_TREE, nval, lfi->ambiguous);
1113 648772 : TREE_TYPE (lfi->ambiguous) = error_mark_node;
1114 : }
1115 : }
1116 : }
1117 : else
1118 : {
1119 814398928 : 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 814398829 : lfi->rval = nval;
1126 814398928 : lfi->rval_binfo = binfo;
1127 : }
1128 :
1129 5627331782 : done:
1130 : /* Don't look for constructors or destructors in base classes. */
1131 5627331782 : 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 250167737 : build_baselink (tree binfo, tree access_binfo, tree functions, tree optype)
1142 : {
1143 250167737 : tree baselink;
1144 :
1145 250167737 : gcc_assert (OVL_P (functions) || TREE_CODE (functions) == TEMPLATE_ID_EXPR);
1146 250167737 : gcc_assert (!optype || TYPE_P (optype));
1147 250167737 : gcc_assert (TREE_TYPE (functions));
1148 :
1149 250167737 : baselink = make_node (BASELINK);
1150 250167737 : TREE_TYPE (baselink) = TREE_TYPE (functions);
1151 250167737 : BASELINK_BINFO (baselink) = binfo;
1152 250167737 : BASELINK_ACCESS_BINFO (baselink) = access_binfo;
1153 250167737 : BASELINK_FUNCTIONS (baselink) = functions;
1154 250167737 : BASELINK_OPTYPE (baselink) = optype;
1155 :
1156 250167737 : if (binfo == access_binfo
1157 488953367 : && TYPE_BEING_DEFINED (BINFO_TYPE (access_binfo)))
1158 6232302 : BASELINK_FUNCTIONS_MAYBE_INCOMPLETE_P (baselink) = true;
1159 :
1160 250167737 : 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 4951940751 : lookup_member (tree xbasetype, tree name, int protect, bool want_type,
1179 : tsubst_flags_t complain, access_failure_info *afi /* = NULL */)
1180 : {
1181 4951940751 : tree rval, rval_binfo = NULL_TREE;
1182 4951940751 : tree type = NULL_TREE, basetype_path = NULL_TREE;
1183 4951940751 : 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 4951940751 : if (name == error_mark_node
1193 4951940751 : || xbasetype == NULL_TREE
1194 4951940745 : || xbasetype == error_mark_node)
1195 : return NULL_TREE;
1196 :
1197 4951940745 : gcc_assert (identifier_p (name));
1198 :
1199 4951940745 : if (TREE_CODE (xbasetype) == TREE_BINFO)
1200 : {
1201 126799040 : type = BINFO_TYPE (xbasetype);
1202 126799040 : basetype_path = xbasetype;
1203 : }
1204 : else
1205 : {
1206 4825141705 : if (!RECORD_OR_UNION_CODE_P (TREE_CODE (xbasetype)))
1207 : return NULL_TREE;
1208 : type = xbasetype;
1209 4951940709 : xbasetype = NULL_TREE;
1210 : }
1211 :
1212 4951940709 : 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 4951940655 : if (dependent_type_p (type))
1217 3034578334 : if (tree t = currently_open_class (type))
1218 4951940655 : type = t;
1219 :
1220 4951940655 : if (!basetype_path)
1221 4825141615 : basetype_path = TYPE_BINFO (type);
1222 :
1223 4825141615 : if (!basetype_path)
1224 : return NULL_TREE;
1225 :
1226 4873713268 : memset (&lfi, 0, sizeof (lfi));
1227 4873713268 : lfi.type = type;
1228 4873713268 : lfi.name = name;
1229 4873713268 : lfi.want_type = want_type;
1230 4873713268 : dfs_walk_all (basetype_path, &lookup_field_r, NULL, &lfi);
1231 4873713268 : rval = lfi.rval;
1232 4873713268 : rval_binfo = lfi.rval_binfo;
1233 4873713268 : if (rval_binfo)
1234 814359654 : type = BINFO_TYPE (rval_binfo);
1235 :
1236 4873713268 : if (lfi.ambiguous)
1237 : {
1238 512290 : if (protect == 0)
1239 : return NULL_TREE;
1240 512290 : 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 512207 : else if (protect == 2)
1251 : return lfi.ambiguous;
1252 : }
1253 :
1254 4873200978 : 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 813847364 : if (protect == 1 && !really_overloaded_fn (rval))
1277 : {
1278 121564917 : tree decl = is_overloaded_fn (rval) ? get_first_fn (rval) : rval;
1279 121564917 : decl = strip_using_decl (decl);
1280 : /* A dependent USING_DECL will be checked after tsubsting. */
1281 121564917 : if (TREE_CODE (decl) != USING_DECL
1282 116267521 : && !DECL_IOBJ_MEMBER_FUNCTION_P (decl)
1283 171835285 : && !perform_or_defer_access_check (basetype_path, decl, decl,
1284 : complain, afi))
1285 72 : return error_mark_node;
1286 : }
1287 :
1288 813847292 : 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 813847292 : && !dguide_name_p (name))
1292 233175957 : rval = build_baselink (rval_binfo, basetype_path, rval,
1293 233175957 : (IDENTIFIER_CONV_OP_P (name)
1294 450332 : ? TREE_TYPE (name) : NULL_TREE));
1295 : return rval;
1296 : }
1297 :
1298 : /* Helper class for lookup_member_fuzzy. */
1299 :
1300 744 : class lookup_field_fuzzy_info
1301 : {
1302 : public:
1303 744 : lookup_field_fuzzy_info (bool want_type_p) :
1304 744 : 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 839 : lookup_field_fuzzy_info::fuzzy_lookup_field (tree type)
1318 : {
1319 839 : if (!CLASS_TYPE_P (type))
1320 : return;
1321 :
1322 4252 : for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
1323 : {
1324 3419 : if (m_want_type_p && !DECL_DECLARES_TYPE_P (field))
1325 146 : continue;
1326 :
1327 3273 : if (!DECL_NAME (field))
1328 72 : continue;
1329 :
1330 3201 : 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 3165 : if (TREE_CODE (DECL_NAME (field)) == IDENTIFIER_NODE)
1336 3165 : if (unsigned int len = IDENTIFIER_LENGTH (DECL_NAME (field)))
1337 3165 : if (IDENTIFIER_POINTER (DECL_NAME (field))[len - 1] == ' ')
1338 1412 : continue;
1339 :
1340 1753 : 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 839 : lookup_field_fuzzy_r (tree binfo, void *data)
1352 : {
1353 839 : lookup_field_fuzzy_info *lffi = (lookup_field_fuzzy_info *) data;
1354 839 : tree type = BINFO_TYPE (binfo);
1355 :
1356 839 : lffi->fuzzy_lookup_field (type);
1357 :
1358 839 : 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 744 : lookup_member_fuzzy (tree xbasetype, tree name, bool want_type_p)
1367 : {
1368 744 : tree type = NULL_TREE, basetype_path = NULL_TREE;
1369 744 : 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 744 : if (name == error_mark_node
1379 744 : || xbasetype == NULL_TREE
1380 744 : || xbasetype == error_mark_node)
1381 : return NULL_TREE;
1382 :
1383 744 : gcc_assert (identifier_p (name));
1384 :
1385 744 : if (TREE_CODE (xbasetype) == TREE_BINFO)
1386 : {
1387 6 : type = BINFO_TYPE (xbasetype);
1388 6 : basetype_path = xbasetype;
1389 : }
1390 : else
1391 : {
1392 738 : if (!RECORD_OR_UNION_CODE_P (TREE_CODE (xbasetype)))
1393 : return NULL_TREE;
1394 : type = xbasetype;
1395 744 : xbasetype = NULL_TREE;
1396 : }
1397 :
1398 744 : 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 744 : if (flag_concepts && dependent_type_p (type))
1403 131 : type = currently_open_class (type);
1404 :
1405 744 : if (!basetype_path)
1406 738 : basetype_path = TYPE_BINFO (type);
1407 :
1408 738 : if (!basetype_path)
1409 : return NULL_TREE;
1410 :
1411 : /* Populate lffi.m_candidates. */
1412 738 : dfs_walk_all (basetype_path, &lookup_field_fuzzy_r, NULL, &lffi);
1413 :
1414 738 : return find_closest_identifier (name, &lffi.m_candidates);
1415 744 : }
1416 :
1417 : /* Like lookup_member, except that if we find a function member we
1418 : return NULL_TREE. */
1419 :
1420 : tree
1421 33469761 : lookup_field (tree xbasetype, tree name, int protect, bool want_type)
1422 : {
1423 33469761 : tree rval = lookup_member (xbasetype, name, protect, want_type,
1424 : tf_warning_or_error);
1425 :
1426 : /* Ignore functions, but propagate the ambiguity list. */
1427 33469761 : if (!error_operand_p (rval)
1428 33469761 : && (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 172460114 : lookup_fnfields (tree xbasetype, tree name, int protect,
1439 : tsubst_flags_t complain)
1440 : {
1441 172460114 : tree rval = lookup_member (xbasetype, name, protect, /*want_type=*/false,
1442 : complain);
1443 :
1444 : /* Ignore non-functions, but propagate the ambiguity list. */
1445 172460114 : if (!error_operand_p (rval)
1446 172460114 : && (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 183901742 : adjust_result_of_qualified_name_lookup (tree decl,
1465 : tree qualifying_scope,
1466 : tree context_class)
1467 : {
1468 183901742 : if (!BASELINK_P (decl))
1469 : return decl;
1470 :
1471 15809556 : const bool qualified_p = qualifying_scope != NULL_TREE;
1472 15809556 : if (!qualified_p)
1473 151 : qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (decl));
1474 :
1475 15809556 : if (context_class
1476 11683359 : && context_class != error_mark_node
1477 11683350 : && CLASS_TYPE_P (context_class)
1478 11683344 : && CLASS_TYPE_P (qualifying_scope)
1479 27492900 : && DERIVED_FROM_P (qualifying_scope, context_class))
1480 : {
1481 : /* Look for the QUALIFYING_SCOPE as a base of the CONTEXT_CLASS.
1482 : Because we do not yet know which function will be chosen by
1483 : overload resolution, we cannot yet check either accessibility
1484 : or ambiguity -- in either case, the choice of a static member
1485 : function might make the usage valid. */
1486 6661902 : tree base = lookup_base (context_class, qualifying_scope,
1487 : ba_unique, NULL, tf_none);
1488 6661902 : if (base && base != error_mark_node)
1489 : {
1490 6661896 : BASELINK_ACCESS_BINFO (decl) = base;
1491 6661896 : tree decl_binfo
1492 6661896 : = lookup_base (base, BINFO_TYPE (BASELINK_BINFO (decl)),
1493 : ba_unique, NULL, tf_none);
1494 6661896 : if (decl_binfo && decl_binfo != error_mark_node)
1495 6661890 : BASELINK_BINFO (decl) = decl_binfo;
1496 : }
1497 : }
1498 :
1499 15809556 : BASELINK_QUALIFIED_P (decl) = qualified_p;
1500 :
1501 15809556 : return decl;
1502 : }
1503 :
1504 :
1505 : /* Walk the class hierarchy within BINFO, in a depth-first traversal.
1506 : PRE_FN is called in preorder, while POST_FN is called in postorder.
1507 : If PRE_FN returns DFS_SKIP_BASES, child binfos will not be
1508 : walked. If PRE_FN or POST_FN returns a different non-NULL value,
1509 : that value is immediately returned and the walk is terminated. One
1510 : of PRE_FN and POST_FN can be NULL. At each node, PRE_FN and
1511 : POST_FN are passed the binfo to examine and the caller's DATA
1512 : value. All paths are walked, thus virtual and morally virtual
1513 : binfos can be multiply walked. */
1514 :
1515 : tree
1516 8853108442 : dfs_walk_all (tree binfo, tree (*pre_fn) (tree, void *),
1517 : tree (*post_fn) (tree, void *), void *data)
1518 : {
1519 8853108442 : tree rval;
1520 8853108442 : unsigned ix;
1521 8853108442 : tree base_binfo;
1522 :
1523 : /* Call the pre-order walking function. */
1524 8853108442 : if (pre_fn)
1525 : {
1526 8848369414 : rval = pre_fn (binfo, data);
1527 8848369414 : if (rval)
1528 : {
1529 1356412669 : if (rval == dfs_skip_bases)
1530 866852014 : goto skip_bases;
1531 : return rval;
1532 : }
1533 : }
1534 :
1535 : /* Find the next child binfo to walk. */
1536 9778769559 : for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1537 : {
1538 2373427624 : rval = dfs_walk_all (base_binfo, pre_fn, post_fn, data);
1539 2373427624 : if (rval)
1540 : return rval;
1541 : }
1542 :
1543 8272193949 : skip_bases:
1544 : /* Call the post-order walking function. */
1545 8272193949 : if (post_fn)
1546 : {
1547 665912269 : rval = post_fn (binfo, data);
1548 665912269 : gcc_assert (rval != dfs_skip_bases);
1549 : return rval;
1550 : }
1551 :
1552 : return NULL_TREE;
1553 : }
1554 :
1555 : /* Worker for dfs_walk_once. This behaves as dfs_walk_all, except
1556 : that binfos are walked at most once. */
1557 :
1558 : static tree
1559 3564405 : dfs_walk_once_r (tree binfo, tree (*pre_fn) (tree, void *),
1560 : tree (*post_fn) (tree, void *), hash_set<tree> *pset,
1561 : void *data)
1562 : {
1563 3564405 : tree rval;
1564 3564405 : unsigned ix;
1565 3564405 : tree base_binfo;
1566 :
1567 : /* Call the pre-order walking function. */
1568 3564405 : if (pre_fn)
1569 : {
1570 3236245 : rval = pre_fn (binfo, data);
1571 3236245 : if (rval)
1572 : {
1573 707277 : if (rval == dfs_skip_bases)
1574 204077 : goto skip_bases;
1575 :
1576 : return rval;
1577 : }
1578 : }
1579 :
1580 : /* Find the next child binfo to walk. */
1581 5359739 : for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1582 : {
1583 3239444 : if (BINFO_VIRTUAL_P (base_binfo))
1584 1567523 : if (pset->add (base_binfo))
1585 588641 : continue;
1586 :
1587 2650803 : rval = dfs_walk_once_r (base_binfo, pre_fn, post_fn, pset, data);
1588 2650803 : if (rval)
1589 : return rval;
1590 : }
1591 :
1592 2324372 : skip_bases:
1593 : /* Call the post-order walking function. */
1594 2324372 : if (post_fn)
1595 : {
1596 937390 : rval = post_fn (binfo, data);
1597 937390 : gcc_assert (rval != dfs_skip_bases);
1598 : return rval;
1599 : }
1600 :
1601 : return NULL_TREE;
1602 : }
1603 :
1604 : /* Like dfs_walk_all, except that binfos are not multiply walked. For
1605 : non-diamond shaped hierarchies this is the same as dfs_walk_all.
1606 : For diamond shaped hierarchies we must mark the virtual bases, to
1607 : avoid multiple walks. */
1608 :
1609 : tree
1610 1597028269 : dfs_walk_once (tree binfo, tree (*pre_fn) (tree, void *),
1611 : tree (*post_fn) (tree, void *), void *data)
1612 : {
1613 1597028269 : static int active = 0; /* We must not be called recursively. */
1614 1597028269 : tree rval;
1615 :
1616 1597028269 : gcc_assert (pre_fn || post_fn);
1617 1597028269 : gcc_assert (!active);
1618 1597028269 : active++;
1619 :
1620 1597028269 : if (!CLASSTYPE_DIAMOND_SHAPED_P (BINFO_TYPE (binfo)))
1621 : /* We are not diamond shaped, and therefore cannot encounter the
1622 : same binfo twice. */
1623 1596114667 : rval = dfs_walk_all (binfo, pre_fn, post_fn, data);
1624 : else
1625 : {
1626 913602 : hash_set<tree> pset;
1627 913602 : rval = dfs_walk_once_r (binfo, pre_fn, post_fn, &pset, data);
1628 913602 : }
1629 :
1630 1597028269 : active--;
1631 :
1632 1597028269 : return rval;
1633 : }
1634 :
1635 : /* Worker function for dfs_walk_once_accessible. Behaves like
1636 : dfs_walk_once_r, except (a) FRIENDS_P is true if special
1637 : access given by the current context should be considered, (b) ONCE
1638 : indicates whether bases should be marked during traversal. */
1639 :
1640 : static tree
1641 53150396 : dfs_walk_once_accessible_r (tree binfo, bool friends_p, hash_set<tree> *pset,
1642 : tree (*pre_fn) (tree, void *),
1643 : tree (*post_fn) (tree, void *), void *data)
1644 : {
1645 53150396 : tree rval = NULL_TREE;
1646 53150396 : unsigned ix;
1647 53150396 : tree base_binfo;
1648 :
1649 : /* Call the pre-order walking function. */
1650 53150396 : if (pre_fn)
1651 : {
1652 53150396 : rval = pre_fn (binfo, data);
1653 53150396 : if (rval)
1654 : {
1655 47950687 : if (rval == dfs_skip_bases)
1656 47929356 : goto skip_bases;
1657 :
1658 : return rval;
1659 : }
1660 : }
1661 :
1662 : /* Find the next child binfo to walk. */
1663 5719593 : for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1664 : {
1665 5207363 : bool mark = pset && BINFO_VIRTUAL_P (base_binfo);
1666 :
1667 8446 : if (mark && pset->contains (base_binfo))
1668 58 : continue;
1669 :
1670 : /* If the base is inherited via private or protected
1671 : inheritance, then we can't see it, unless we are a friend of
1672 : the current binfo. */
1673 5207305 : if (BINFO_BASE_ACCESS (binfo, ix) != access_public_node)
1674 : {
1675 1970379 : tree scope;
1676 1970379 : if (!friends_p)
1677 395 : continue;
1678 1969984 : scope = current_scope ();
1679 1979016 : if (!scope
1680 1969984 : || TREE_CODE (scope) == NAMESPACE_DECL
1681 3939325 : || !is_friend (BINFO_TYPE (binfo), scope))
1682 9032 : continue;
1683 : }
1684 :
1685 5197878 : if (mark)
1686 706 : pset->add (base_binfo);
1687 :
1688 5197878 : rval = dfs_walk_once_accessible_r (base_binfo, friends_p, pset,
1689 : pre_fn, post_fn, data);
1690 5197878 : if (rval)
1691 : return rval;
1692 : }
1693 :
1694 48441586 : skip_bases:
1695 : /* Call the post-order walking function. */
1696 48441586 : if (post_fn)
1697 : {
1698 48441314 : rval = post_fn (binfo, data);
1699 48441314 : gcc_assert (rval != dfs_skip_bases);
1700 : return rval;
1701 : }
1702 :
1703 : return NULL_TREE;
1704 : }
1705 :
1706 : /* Like dfs_walk_once except that only accessible bases are walked.
1707 : FRIENDS_P indicates whether friendship of the local context
1708 : should be considered when determining accessibility. */
1709 :
1710 : static tree
1711 47952518 : dfs_walk_once_accessible (tree binfo, bool friends_p,
1712 : tree (*pre_fn) (tree, void *),
1713 : tree (*post_fn) (tree, void *), void *data)
1714 : {
1715 47952518 : hash_set<tree> *pset = NULL;
1716 47952518 : if (CLASSTYPE_DIAMOND_SHAPED_P (BINFO_TYPE (binfo)))
1717 1443 : pset = new hash_set<tree>;
1718 47952518 : tree rval = dfs_walk_once_accessible_r (binfo, friends_p, pset,
1719 : pre_fn, post_fn, data);
1720 :
1721 47952518 : if (pset)
1722 1443 : delete pset;
1723 47952518 : return rval;
1724 : }
1725 :
1726 : /* Return true iff the code of T is CODE, and it has compatible
1727 : type with TYPE. */
1728 :
1729 : static bool
1730 448 : matches_code_and_type_p (tree t, enum tree_code code, tree type)
1731 : {
1732 448 : if (TREE_CODE (t) != code)
1733 : return false;
1734 434 : if (!cxx_types_compatible_p (TREE_TYPE (t), type))
1735 : return false;
1736 : return true;
1737 : }
1738 :
1739 : /* Subroutine of direct_accessor_p and reference_accessor_p.
1740 : Determine if COMPONENT_REF is a simple field lookup of this->FIELD_DECL.
1741 : We expect a tree of the form:
1742 : <component_ref:
1743 : <indirect_ref:S>
1744 : <nop_expr:P*
1745 : <parm_decl (this)>
1746 : <field_decl (FIELD_DECL)>>>. */
1747 :
1748 : static bool
1749 203 : field_access_p (tree component_ref, tree field_decl, tree field_type)
1750 : {
1751 203 : if (!matches_code_and_type_p (component_ref, COMPONENT_REF, field_type))
1752 : return false;
1753 :
1754 189 : tree indirect_ref = TREE_OPERAND (component_ref, 0);
1755 189 : if (!INDIRECT_REF_P (indirect_ref))
1756 : return false;
1757 :
1758 189 : tree ptr = STRIP_NOPS (TREE_OPERAND (indirect_ref, 0));
1759 189 : if (!is_object_parameter (ptr))
1760 : return false;
1761 :
1762 : /* Must access the correct field. */
1763 189 : if (TREE_OPERAND (component_ref, 1) != field_decl)
1764 : return false;
1765 : return true;
1766 : }
1767 :
1768 : /* Subroutine of field_accessor_p.
1769 :
1770 : Assuming that INIT_EXPR has already had its code and type checked,
1771 : determine if it is a simple accessor for FIELD_DECL
1772 : (of type FIELD_TYPE).
1773 :
1774 : Specifically, a simple accessor within struct S of the form:
1775 : T get_field () { return m_field; }
1776 : should have a constexpr_fn_retval (saved_tree) of the form:
1777 : <init_expr:T
1778 : <result_decl:T
1779 : <nop_expr:T
1780 : <component_ref:
1781 : <indirect_ref:S>
1782 : <nop_expr:P*
1783 : <parm_decl (this)>
1784 : <field_decl (FIELD_DECL)>>>>>. */
1785 :
1786 : static bool
1787 161 : direct_accessor_p (tree init_expr, tree field_decl, tree field_type)
1788 : {
1789 161 : tree result_decl = TREE_OPERAND (init_expr, 0);
1790 161 : if (!matches_code_and_type_p (result_decl, RESULT_DECL, field_type))
1791 : return false;
1792 :
1793 161 : tree component_ref = STRIP_NOPS (TREE_OPERAND (init_expr, 1));
1794 161 : if (!field_access_p (component_ref, field_decl, field_type))
1795 : return false;
1796 :
1797 : return true;
1798 : }
1799 :
1800 : /* Subroutine of field_accessor_p.
1801 :
1802 : Assuming that INIT_EXPR has already had its code and type checked,
1803 : determine if it is a "reference" accessor for FIELD_DECL
1804 : (of type FIELD_REFERENCE_TYPE).
1805 :
1806 : Specifically, a simple accessor within struct S of the form:
1807 : T& get_field () { return m_field; }
1808 : should have a constexpr_fn_retval (saved_tree) of the form:
1809 : <init_expr:T&
1810 : <result_decl:T&
1811 : <nop_expr: T&
1812 : <addr_expr: T*
1813 : <component_ref:T
1814 : <indirect_ref:S
1815 : <nop_expr
1816 : <parm_decl (this)>>
1817 : <field (FIELD_DECL)>>>>>>. */
1818 : static bool
1819 42 : reference_accessor_p (tree init_expr, tree field_decl, tree field_type,
1820 : tree field_reference_type)
1821 : {
1822 42 : tree result_decl = TREE_OPERAND (init_expr, 0);
1823 42 : if (!matches_code_and_type_p (result_decl, RESULT_DECL, field_reference_type))
1824 : return false;
1825 :
1826 42 : tree field_pointer_type = build_pointer_type (field_type);
1827 42 : tree addr_expr = STRIP_NOPS (TREE_OPERAND (init_expr, 1));
1828 42 : if (!matches_code_and_type_p (addr_expr, ADDR_EXPR, field_pointer_type))
1829 : return false;
1830 :
1831 42 : tree component_ref = STRIP_NOPS (TREE_OPERAND (addr_expr, 0));
1832 :
1833 42 : if (!field_access_p (component_ref, field_decl, field_type))
1834 : return false;
1835 :
1836 : return true;
1837 : }
1838 :
1839 : /* Return the class of the `this' or explicit object parameter of FN. */
1840 :
1841 : static tree
1842 61 : class_of_object_parm (const_tree fn)
1843 : {
1844 61 : tree fntype = TREE_TYPE (fn);
1845 61 : if (DECL_XOBJ_MEMBER_FUNCTION_P (fn))
1846 0 : return non_reference (TREE_VALUE (TYPE_ARG_TYPES (fntype)));
1847 61 : return class_of_this_parm (fntype);
1848 : }
1849 :
1850 : /* Return true if FN is an accessor method for FIELD_DECL.
1851 : i.e. a method of the form { return FIELD; }, with no
1852 : conversions.
1853 :
1854 : If CONST_P, then additionally require that FN be a const
1855 : method. */
1856 :
1857 : static bool
1858 2417 : field_accessor_p (tree fn, tree field_decl, bool const_p)
1859 : {
1860 2417 : if (TREE_CODE (fn) != FUNCTION_DECL)
1861 : return false;
1862 :
1863 : /* We don't yet support looking up static data, just fields. */
1864 648 : if (TREE_CODE (field_decl) != FIELD_DECL)
1865 : return false;
1866 :
1867 639 : if (!DECL_OBJECT_MEMBER_FUNCTION_P (fn))
1868 : return false;
1869 :
1870 : /* If the field is accessed via a const "this" argument, verify
1871 : that the "this" parameter is const. */
1872 639 : if (const_p)
1873 : {
1874 61 : tree this_class = class_of_object_parm (fn);
1875 61 : if (!TYPE_READONLY (this_class))
1876 : return false;
1877 : }
1878 :
1879 601 : tree saved_tree = DECL_SAVED_TREE (fn);
1880 :
1881 601 : if (saved_tree == NULL_TREE)
1882 : return false;
1883 :
1884 : /* Attempt to extract a single return value from the function,
1885 : if it has one. */
1886 235 : tree retval = constexpr_fn_retval (saved_tree);
1887 235 : if (retval == NULL_TREE || retval == error_mark_node)
1888 : return false;
1889 : /* Require an INIT_EXPR. */
1890 209 : if (TREE_CODE (retval) != INIT_EXPR)
1891 : return false;
1892 209 : tree init_expr = retval;
1893 :
1894 : /* Determine if this is a simple accessor within struct S of the form:
1895 : T get_field () { return m_field; }. */
1896 209 : tree field_type = TREE_TYPE (field_decl);
1897 209 : if (cxx_types_compatible_p (TREE_TYPE (init_expr), field_type))
1898 161 : return direct_accessor_p (init_expr, field_decl, field_type);
1899 :
1900 : /* Failing that, determine if it is an accessor of the form:
1901 : T& get_field () { return m_field; }. */
1902 48 : tree field_reference_type = cp_build_reference_type (field_type, false);
1903 48 : if (cxx_types_compatible_p (TREE_TYPE (init_expr), field_reference_type))
1904 42 : return reference_accessor_p (init_expr, field_decl, field_type,
1905 42 : field_reference_type);
1906 :
1907 : return false;
1908 : }
1909 :
1910 : /* Callback data for dfs_locate_field_accessor_pre. */
1911 :
1912 : class locate_field_data
1913 : {
1914 : public:
1915 412 : locate_field_data (tree field_decl_, bool const_p_)
1916 412 : : field_decl (field_decl_), const_p (const_p_) {}
1917 :
1918 : tree field_decl;
1919 : bool const_p;
1920 : };
1921 :
1922 : /* Return a FUNCTION_DECL that is an "accessor" method for DATA, a FIELD_DECL,
1923 : callable via binfo, if one exists, otherwise return NULL_TREE.
1924 :
1925 : Callback for dfs_walk_once_accessible for use within
1926 : locate_field_accessor. */
1927 :
1928 : static tree
1929 454 : dfs_locate_field_accessor_pre (tree binfo, void *data)
1930 : {
1931 454 : locate_field_data *lfd = (locate_field_data *)data;
1932 454 : tree type = BINFO_TYPE (binfo);
1933 :
1934 454 : vec<tree, va_gc> *member_vec;
1935 454 : tree fn;
1936 454 : size_t i;
1937 :
1938 454 : if (!CLASS_TYPE_P (type))
1939 : return NULL_TREE;
1940 :
1941 454 : member_vec = CLASSTYPE_MEMBER_VEC (type);
1942 454 : if (!member_vec)
1943 : return NULL_TREE;
1944 :
1945 2594 : for (i = 0; vec_safe_iterate (member_vec, i, &fn); ++i)
1946 2417 : if (fn)
1947 2417 : if (field_accessor_p (fn, lfd->field_decl, lfd->const_p))
1948 : return fn;
1949 :
1950 : return NULL_TREE;
1951 : }
1952 :
1953 : /* Return a FUNCTION_DECL that is an "accessor" method for FIELD_DECL,
1954 : callable via BASETYPE_PATH, if one exists, otherwise return NULL_TREE. */
1955 :
1956 : tree
1957 412 : locate_field_accessor (tree basetype_path, tree field_decl, bool const_p)
1958 : {
1959 412 : if (TREE_CODE (basetype_path) != TREE_BINFO)
1960 : return NULL_TREE;
1961 :
1962 : /* Walk the hierarchy, looking for a method of some base class that allows
1963 : access to the field. */
1964 412 : locate_field_data lfd (field_decl, const_p);
1965 412 : return dfs_walk_once_accessible (basetype_path, /*friends=*/true,
1966 : dfs_locate_field_accessor_pre,
1967 412 : NULL, &lfd);
1968 : }
1969 :
1970 : /* Check throw specifier of OVERRIDER is at least as strict as
1971 : the one of BASEFN. This is due to [except.spec]: "If a virtual function
1972 : has a non-throwing exception specification, all declarations, including
1973 : the definition, of any function that overrides that virtual function in
1974 : any derived class shall have a non-throwing exception specification,
1975 : unless the overriding function is defined as deleted." */
1976 :
1977 : bool
1978 3595014 : maybe_check_overriding_exception_spec (tree overrider, tree basefn)
1979 : {
1980 3595014 : maybe_instantiate_noexcept (basefn);
1981 3595014 : maybe_instantiate_noexcept (overrider);
1982 3595014 : tree base_throw = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (basefn));
1983 3595014 : tree over_throw = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (overrider));
1984 :
1985 3595014 : if (DECL_INVALID_OVERRIDER_P (overrider)
1986 : /* CWG 1351 added the "unless the overriding function is defined as
1987 : deleted" wording. */
1988 3595014 : || DECL_DELETED_FN (overrider))
1989 : return true;
1990 :
1991 : /* Can't check this yet. Pretend this is fine and let
1992 : noexcept_override_late_checks check this later. */
1993 2228186 : if (UNPARSED_NOEXCEPT_SPEC_P (base_throw)
1994 8051474 : || UNPARSED_NOEXCEPT_SPEC_P (over_throw))
1995 : return true;
1996 :
1997 : /* We also have to defer checking when we're in a template and couldn't
1998 : instantiate & evaluate the noexcept to true/false. */
1999 3594999 : if (processing_template_decl)
2000 6 : if ((base_throw
2001 3 : && base_throw != noexcept_true_spec
2002 0 : && base_throw != noexcept_false_spec)
2003 6 : || (over_throw
2004 6 : && over_throw != noexcept_true_spec
2005 6 : && over_throw != noexcept_false_spec))
2006 : return true;
2007 :
2008 3594993 : if (!comp_except_specs (base_throw, over_throw, ce_derived))
2009 : {
2010 41 : auto_diagnostic_group d;
2011 41 : error ("looser exception specification on overriding virtual function "
2012 : "%q+#F", overrider);
2013 41 : inform (DECL_SOURCE_LOCATION (basefn),
2014 : "overridden function is %q#F", basefn);
2015 41 : DECL_INVALID_OVERRIDER_P (overrider) = 1;
2016 41 : return false;
2017 41 : }
2018 : return true;
2019 : }
2020 :
2021 : /* Check that virtual overrider OVERRIDER is acceptable for base function
2022 : BASEFN. Issue diagnostic, and return zero, if unacceptable. */
2023 :
2024 : static int
2025 3595059 : check_final_overrider (tree overrider, tree basefn)
2026 : {
2027 3595059 : tree over_type = TREE_TYPE (overrider);
2028 3595059 : tree base_type = TREE_TYPE (basefn);
2029 3595059 : tree over_return = fndecl_declared_return_type (overrider);
2030 3595059 : tree base_return = fndecl_declared_return_type (basefn);
2031 :
2032 3595059 : int fail = 0;
2033 :
2034 3595059 : if (DECL_INVALID_OVERRIDER_P (overrider))
2035 : return 0;
2036 :
2037 3595053 : if (same_type_p (base_return, over_return))
2038 : /* OK */;
2039 0 : else if ((CLASS_TYPE_P (over_return) && CLASS_TYPE_P (base_return))
2040 301 : || (TREE_CODE (base_return) == TREE_CODE (over_return)
2041 286 : && INDIRECT_TYPE_P (base_return)))
2042 : {
2043 : /* Potentially covariant. */
2044 286 : unsigned base_quals, over_quals;
2045 :
2046 286 : fail = !INDIRECT_TYPE_P (base_return);
2047 286 : if (!fail)
2048 : {
2049 286 : if (cp_type_quals (base_return) != cp_type_quals (over_return))
2050 0 : fail = 1;
2051 :
2052 286 : if (TYPE_REF_P (base_return)
2053 286 : && (TYPE_REF_IS_RVALUE (base_return)
2054 60 : != TYPE_REF_IS_RVALUE (over_return)))
2055 : fail = 1;
2056 :
2057 286 : base_return = TREE_TYPE (base_return);
2058 286 : over_return = TREE_TYPE (over_return);
2059 : }
2060 286 : base_quals = cp_type_quals (base_return);
2061 286 : over_quals = cp_type_quals (over_return);
2062 :
2063 286 : if ((base_quals & over_quals) != over_quals)
2064 3 : fail = 1;
2065 :
2066 286 : if (CLASS_TYPE_P (base_return) && CLASS_TYPE_P (over_return))
2067 : {
2068 : /* Strictly speaking, the standard requires the return type to be
2069 : complete even if it only differs in cv-quals, but that seems
2070 : like a bug in the wording. */
2071 277 : if (!same_type_ignoring_top_level_qualifiers_p (base_return,
2072 : over_return))
2073 : {
2074 267 : tree binfo = lookup_base (over_return, base_return,
2075 : ba_check, NULL, tf_none);
2076 :
2077 267 : if (!binfo || binfo == error_mark_node)
2078 : fail = 1;
2079 : }
2080 : }
2081 9 : else if (can_convert_standard (TREE_TYPE (base_type),
2082 9 : TREE_TYPE (over_type),
2083 : tf_warning_or_error))
2084 : /* GNU extension, allow trivial pointer conversions such as
2085 : converting to void *, or qualification conversion. */
2086 : {
2087 0 : auto_diagnostic_group d;
2088 0 : if (pedwarn (DECL_SOURCE_LOCATION (overrider), 0,
2089 : "invalid covariant return type for %q#D", overrider))
2090 0 : inform (DECL_SOURCE_LOCATION (basefn),
2091 : "overridden function is %q#D", basefn);
2092 0 : }
2093 : else
2094 : fail = 2;
2095 : }
2096 : else
2097 : fail = 2;
2098 262 : if (!fail)
2099 : /* OK */;
2100 : else
2101 : {
2102 45 : auto_diagnostic_group d;
2103 45 : if (fail == 1)
2104 21 : error ("invalid covariant return type for %q+#D", overrider);
2105 : else
2106 24 : error ("conflicting return type specified for %q+#D", overrider);
2107 45 : inform (DECL_SOURCE_LOCATION (basefn),
2108 : "overridden function is %q#D", basefn);
2109 45 : DECL_INVALID_OVERRIDER_P (overrider) = 1;
2110 45 : return 0;
2111 45 : }
2112 :
2113 3595008 : if (!maybe_check_overriding_exception_spec (overrider, basefn))
2114 : return 0;
2115 :
2116 : /* Check for conflicting type attributes. But leave transaction_safe for
2117 : set_one_vmethod_tm_attributes. */
2118 3594967 : if (!comp_type_attributes (over_type, base_type)
2119 63 : && !tx_safe_fn_type_p (base_type)
2120 3594974 : && !tx_safe_fn_type_p (over_type))
2121 : {
2122 0 : auto_diagnostic_group d;
2123 0 : error ("conflicting type attributes specified for %q+#D", overrider);
2124 0 : inform (DECL_SOURCE_LOCATION (basefn),
2125 : "overridden function is %q#D", basefn);
2126 0 : DECL_INVALID_OVERRIDER_P (overrider) = 1;
2127 0 : return 0;
2128 0 : }
2129 :
2130 : /* A class with a consteval virtual function that overrides a virtual
2131 : function that is not consteval shall have consteval-only type (CWG 3117).
2132 : A consteval virtual function shall not be overridden by a virtual
2133 : function that is not consteval. */
2134 7189934 : if ((DECL_IMMEDIATE_FUNCTION_P (basefn)
2135 70 : && !DECL_IMMEDIATE_FUNCTION_P (overrider))
2136 3594997 : || (!DECL_IMMEDIATE_FUNCTION_P (basefn)
2137 7189864 : && DECL_IMMEDIATE_FUNCTION_P (overrider)
2138 355 : && !consteval_only_p (overrider)))
2139 : {
2140 9 : auto_diagnostic_group d;
2141 18 : if (DECL_IMMEDIATE_FUNCTION_P (overrider))
2142 4 : error ("%<consteval%> function %q+D overriding non-%<consteval%> "
2143 : "function", overrider);
2144 : else
2145 5 : error ("non-%<consteval%> function %q+D overriding %<consteval%> "
2146 : "function", overrider);
2147 9 : inform (DECL_SOURCE_LOCATION (basefn),
2148 : "overridden function is %qD", basefn);
2149 9 : DECL_INVALID_OVERRIDER_P (overrider) = 1;
2150 9 : return 0;
2151 9 : }
2152 :
2153 : /* A function declared transaction_safe_dynamic that overrides a function
2154 : declared transaction_safe (but not transaction_safe_dynamic) is
2155 : ill-formed. */
2156 3594958 : if (tx_safe_fn_type_p (base_type)
2157 72 : && lookup_attribute ("transaction_safe_dynamic",
2158 72 : DECL_ATTRIBUTES (overrider))
2159 3594971 : && !lookup_attribute ("transaction_safe_dynamic",
2160 13 : DECL_ATTRIBUTES (basefn)))
2161 : {
2162 1 : auto_diagnostic_group d;
2163 1 : error_at (DECL_SOURCE_LOCATION (overrider),
2164 : "%qD declared %<transaction_safe_dynamic%>", overrider);
2165 1 : inform (DECL_SOURCE_LOCATION (basefn),
2166 : "overriding %qD declared %<transaction_safe%>", basefn);
2167 1 : }
2168 :
2169 3594958 : if (DECL_DELETED_FN (basefn) != DECL_DELETED_FN (overrider))
2170 : {
2171 15 : if (DECL_DELETED_FN (overrider))
2172 : {
2173 12 : auto_diagnostic_group d;
2174 12 : error ("deleted function %q+D overriding non-deleted function",
2175 : overrider);
2176 12 : inform (DECL_SOURCE_LOCATION (basefn),
2177 : "overridden function is %qD", basefn);
2178 12 : maybe_explain_implicit_delete (overrider);
2179 12 : }
2180 : else
2181 : {
2182 3 : auto_diagnostic_group d;
2183 3 : error ("non-deleted function %q+D overriding deleted function",
2184 : overrider);
2185 3 : inform (DECL_SOURCE_LOCATION (basefn),
2186 : "overridden function is %qD", basefn);
2187 3 : }
2188 15 : return 0;
2189 : }
2190 :
2191 3594943 : if (DECL_FINAL_P (basefn))
2192 : {
2193 6 : auto_diagnostic_group d;
2194 6 : error ("virtual function %q+D overriding final function", overrider);
2195 6 : inform (DECL_SOURCE_LOCATION (basefn),
2196 : "overridden function is %qD", basefn);
2197 6 : return 0;
2198 6 : }
2199 : return 1;
2200 : }
2201 :
2202 : /* Given a class TYPE, and a function decl FNDECL, look for
2203 : virtual functions in TYPE's hierarchy which FNDECL overrides.
2204 : We do not look in TYPE itself, only its bases.
2205 :
2206 : Returns nonzero, if we find any. Set FNDECL's DECL_VIRTUAL_P, if we
2207 : find that it overrides anything.
2208 :
2209 : We check that every function which is overridden, is correctly
2210 : overridden. */
2211 :
2212 : int
2213 19170931 : look_for_overrides (tree type, tree fndecl)
2214 : {
2215 19170931 : tree binfo = TYPE_BINFO (type);
2216 19170931 : tree base_binfo;
2217 19170931 : int ix;
2218 19170931 : int found = 0;
2219 :
2220 : /* A constructor for a class T does not override a function T
2221 : in a base class. */
2222 38341862 : if (DECL_CONSTRUCTOR_P (fndecl))
2223 : return 0;
2224 :
2225 28091560 : for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
2226 : {
2227 8920629 : tree basetype = BINFO_TYPE (base_binfo);
2228 :
2229 8920629 : if (TYPE_POLYMORPHIC_P (basetype))
2230 5418092 : found += look_for_overrides_r (basetype, fndecl);
2231 : }
2232 : return found;
2233 : }
2234 :
2235 : /* Look in TYPE for virtual functions with the same signature as
2236 : FNDECL. */
2237 :
2238 : tree
2239 25657610 : look_for_overrides_here (tree type, tree fndecl)
2240 : {
2241 25657610 : tree ovl = get_class_binding (type, DECL_NAME (fndecl));
2242 :
2243 26555628 : for (ovl_iterator iter (ovl); iter; ++iter)
2244 : {
2245 19827048 : tree fn = *iter;
2246 :
2247 19827048 : if (!DECL_VIRTUAL_P (fn))
2248 : /* Not a virtual. */;
2249 19655445 : else if (DECL_CONTEXT (fn) != type)
2250 : /* Introduced with a using declaration. */;
2251 19655285 : else if (DECL_STATIC_FUNCTION_P (fndecl)
2252 19655285 : || DECL_XOBJ_MEMBER_FUNCTION_P (fndecl))
2253 : {
2254 28 : tree btypes = TYPE_ARG_TYPES (TREE_TYPE (fn));
2255 28 : tree dtypes = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2256 28 : dtypes = DECL_XOBJ_MEMBER_FUNCTION_P (fndecl) ? TREE_CHAIN (dtypes)
2257 : : dtypes;
2258 28 : if (compparms (TREE_CHAIN (btypes), dtypes))
2259 19291528 : return fn;
2260 : }
2261 19655257 : else if (same_signature_p (fndecl, fn))
2262 : return fn;
2263 : }
2264 :
2265 6366082 : return NULL_TREE;
2266 : }
2267 :
2268 : /* Look in TYPE for virtual functions overridden by FNDECL. Check both
2269 : TYPE itself and its bases. */
2270 :
2271 : static int
2272 5418092 : look_for_overrides_r (tree type, tree fndecl)
2273 : {
2274 5418092 : tree fn = look_for_overrides_here (type, fndecl);
2275 5418092 : if (fn)
2276 : {
2277 3595081 : if (DECL_STATIC_FUNCTION_P (fndecl))
2278 : {
2279 : /* A static member function cannot match an inherited
2280 : virtual member function. */
2281 6 : auto_diagnostic_group d;
2282 6 : error ("%q+#D cannot be declared", fndecl);
2283 6 : error (" since %q+#D declared in base class", fn);
2284 6 : }
2285 3595075 : else if (DECL_XOBJ_MEMBER_FUNCTION_P (fndecl))
2286 : {
2287 16 : auto_diagnostic_group d;
2288 16 : error_at (DECL_SOURCE_LOCATION (fndecl),
2289 : "explicit object member function "
2290 : "overrides virtual function");
2291 16 : inform (DECL_SOURCE_LOCATION (fn),
2292 : "virtual function declared here");
2293 16 : }
2294 : else
2295 : {
2296 : /* It's definitely virtual, even if not explicitly set. */
2297 3595059 : DECL_VIRTUAL_P (fndecl) = 1;
2298 3595059 : check_final_overrider (fndecl, fn);
2299 : }
2300 3595081 : return 1;
2301 : }
2302 :
2303 : /* We failed to find one declared in this class. Look in its bases. */
2304 1823011 : return look_for_overrides (type, fndecl);
2305 : }
2306 :
2307 : /* Called via dfs_walk from dfs_get_pure_virtuals. */
2308 :
2309 : static tree
2310 5067188 : dfs_get_pure_virtuals (tree binfo, void *data)
2311 : {
2312 5067188 : tree type = (tree) data;
2313 :
2314 : /* We're not interested in primary base classes; the derived class
2315 : of which they are a primary base will contain the information we
2316 : need. */
2317 5067188 : if (!BINFO_PRIMARY_P (binfo))
2318 : {
2319 2430642 : tree virtuals;
2320 :
2321 2430642 : for (virtuals = BINFO_VIRTUALS (binfo);
2322 12042506 : virtuals;
2323 9611864 : virtuals = TREE_CHAIN (virtuals))
2324 9611864 : if (DECL_PURE_VIRTUAL_P (BV_FN (virtuals)))
2325 622595 : vec_safe_push (CLASSTYPE_PURE_VIRTUALS (type), BV_FN (virtuals));
2326 : }
2327 :
2328 5067188 : return NULL_TREE;
2329 : }
2330 :
2331 : /* Set CLASSTYPE_PURE_VIRTUALS for TYPE. */
2332 :
2333 : void
2334 1593825 : get_pure_virtuals (tree type)
2335 : {
2336 : /* Clear the CLASSTYPE_PURE_VIRTUALS list; whatever is already there
2337 : is going to be overridden. */
2338 1593825 : CLASSTYPE_PURE_VIRTUALS (type) = NULL;
2339 : /* Now, run through all the bases which are not primary bases, and
2340 : collect the pure virtual functions. We look at the vtable in
2341 : each class to determine what pure virtual functions are present.
2342 : (A primary base is not interesting because the derived class of
2343 : which it is a primary base will contain vtable entries for the
2344 : pure virtuals in the base class. */
2345 1593825 : dfs_walk_once (TYPE_BINFO (type), NULL, dfs_get_pure_virtuals, type);
2346 1593825 : }
2347 :
2348 : /* Debug info for C++ classes can get very large; try to avoid
2349 : emitting it everywhere.
2350 :
2351 : Note that this optimization wins even when the target supports
2352 : BINCL (if only slightly), and reduces the amount of work for the
2353 : linker. */
2354 :
2355 : void
2356 55502083 : maybe_suppress_debug_info (tree t)
2357 : {
2358 55502083 : if (write_symbols == NO_DEBUG)
2359 : return;
2360 :
2361 : /* We might have set this earlier in cp_finish_decl. */
2362 52749475 : TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 0;
2363 :
2364 : /* Always emit the information for each class every time. */
2365 52749475 : if (flag_emit_class_debug_always)
2366 : return;
2367 :
2368 : /* If we already know how we're handling this class, handle debug info
2369 : the same way. */
2370 52749475 : if (CLASSTYPE_INTERFACE_KNOWN (t))
2371 : {
2372 1 : if (CLASSTYPE_INTERFACE_ONLY (t))
2373 1 : TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
2374 : /* else don't set it. */
2375 : }
2376 : /* If the class has a vtable, write out the debug info along with
2377 : the vtable. */
2378 52749474 : else if (TYPE_CONTAINS_VPTR_P (t))
2379 1710897 : TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
2380 :
2381 : /* Otherwise, just emit the debug info normally. */
2382 : }
2383 :
2384 : /* Note that we want debugging information for a base class of a class
2385 : whose vtable is being emitted. Normally, this would happen because
2386 : calling the constructor for a derived class implies calling the
2387 : constructors for all bases, which involve initializing the
2388 : appropriate vptr with the vtable for the base class; but in the
2389 : presence of optimization, this initialization may be optimized
2390 : away, so we tell finish_vtable_vardecl that we want the debugging
2391 : information anyway. */
2392 :
2393 : static tree
2394 940263 : dfs_debug_mark (tree binfo, void * /*data*/)
2395 : {
2396 940263 : tree t = BINFO_TYPE (binfo);
2397 :
2398 940263 : if (CLASSTYPE_DEBUG_REQUESTED (t))
2399 : return dfs_skip_bases;
2400 :
2401 568156 : CLASSTYPE_DEBUG_REQUESTED (t) = 1;
2402 :
2403 568156 : return NULL_TREE;
2404 : }
2405 :
2406 : /* Write out the debugging information for TYPE, whose vtable is being
2407 : emitted. Also walk through our bases and note that we want to
2408 : write out information for them. This avoids the problem of not
2409 : writing any debug info for intermediate basetypes whose
2410 : constructors, and thus the references to their vtables, and thus
2411 : the vtables themselves, were optimized away. */
2412 :
2413 : void
2414 440066 : note_debug_info_needed (tree type)
2415 : {
2416 440066 : if (TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type)))
2417 : {
2418 396232 : TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type)) = 0;
2419 396232 : rest_of_type_compilation (type, namespace_bindings_p ());
2420 : }
2421 :
2422 440066 : dfs_walk_all (TYPE_BINFO (type), dfs_debug_mark, NULL, 0);
2423 440066 : }
2424 :
2425 : /* Helper for lookup_conversions_r. TO_TYPE is the type converted to
2426 : by a conversion op in base BINFO. VIRTUAL_DEPTH is nonzero if
2427 : BINFO is morally virtual, and VIRTUALNESS is nonzero if virtual
2428 : bases have been encountered already in the tree walk. PARENT_CONVS
2429 : is the list of lists of conversion functions that could hide CONV
2430 : and OTHER_CONVS is the list of lists of conversion functions that
2431 : could hide or be hidden by CONV, should virtualness be involved in
2432 : the hierarchy. Merely checking the conversion op's name is not
2433 : enough because two conversion operators to the same type can have
2434 : different names. Return nonzero if we are visible. */
2435 :
2436 : static int
2437 41408076 : check_hidden_convs (tree binfo, int virtual_depth, int virtualness,
2438 : tree to_type, tree parent_convs, tree other_convs)
2439 : {
2440 41408076 : tree level, probe;
2441 :
2442 : /* See if we are hidden by a parent conversion. */
2443 41410178 : for (level = parent_convs; level; level = TREE_CHAIN (level))
2444 34419 : for (probe = TREE_VALUE (level); probe; probe = TREE_CHAIN (probe))
2445 32317 : if (same_type_p (to_type, TREE_TYPE (probe)))
2446 : return 0;
2447 :
2448 41388019 : if (virtual_depth || virtualness)
2449 : {
2450 : /* In a virtual hierarchy, we could be hidden, or could hide a
2451 : conversion function on the other_convs list. */
2452 81471 : for (level = other_convs; level; level = TREE_CHAIN (level))
2453 : {
2454 1877 : int we_hide_them;
2455 1877 : int they_hide_us;
2456 1877 : tree *prev, other;
2457 :
2458 1877 : if (!(virtual_depth || TREE_STATIC (level)))
2459 : /* Neither is morally virtual, so cannot hide each other. */
2460 0 : continue;
2461 :
2462 1877 : if (!TREE_VALUE (level))
2463 : /* They evaporated away already. */
2464 0 : continue;
2465 :
2466 3754 : they_hide_us = (virtual_depth
2467 1877 : && original_binfo (binfo, TREE_PURPOSE (level)));
2468 6 : we_hide_them = (!they_hide_us && TREE_STATIC (level)
2469 6 : && original_binfo (TREE_PURPOSE (level), binfo));
2470 :
2471 1871 : if (!(we_hide_them || they_hide_us))
2472 : /* Neither is within the other, so no hiding can occur. */
2473 0 : continue;
2474 :
2475 1883 : for (prev = &TREE_VALUE (level), other = *prev; other;)
2476 : {
2477 1877 : if (same_type_p (to_type, TREE_TYPE (other)))
2478 : {
2479 1877 : if (they_hide_us)
2480 : /* We are hidden. */
2481 : return 0;
2482 :
2483 6 : if (we_hide_them)
2484 : {
2485 : /* We hide the other one. */
2486 6 : other = TREE_CHAIN (other);
2487 6 : *prev = other;
2488 6 : continue;
2489 : }
2490 : }
2491 0 : prev = &TREE_CHAIN (other);
2492 0 : other = *prev;
2493 : }
2494 : }
2495 : }
2496 : return 1;
2497 : }
2498 :
2499 : /* Helper for lookup_conversions_r. PARENT_CONVS is a list of lists
2500 : of conversion functions, the first slot will be for the current
2501 : binfo, if MY_CONVS is non-NULL. CHILD_CONVS is the list of lists
2502 : of conversion functions from children of the current binfo,
2503 : concatenated with conversions from elsewhere in the hierarchy --
2504 : that list begins with OTHER_CONVS. Return a single list of lists
2505 : containing only conversions from the current binfo and its
2506 : children. */
2507 :
2508 : static tree
2509 35448606 : split_conversions (tree my_convs, tree parent_convs,
2510 : tree child_convs, tree other_convs)
2511 : {
2512 35448606 : tree t;
2513 35448606 : tree prev;
2514 :
2515 : /* Remove the original other_convs portion from child_convs. */
2516 35448606 : for (prev = NULL, t = child_convs;
2517 36370472 : t != other_convs; prev = t, t = TREE_CHAIN (t))
2518 921866 : continue;
2519 :
2520 35448606 : if (prev)
2521 921773 : TREE_CHAIN (prev) = NULL_TREE;
2522 : else
2523 : child_convs = NULL_TREE;
2524 :
2525 : /* Attach the child convs to any we had at this level. */
2526 35448606 : if (my_convs)
2527 : {
2528 34506384 : my_convs = parent_convs;
2529 34506384 : TREE_CHAIN (my_convs) = child_convs;
2530 : }
2531 : else
2532 : my_convs = child_convs;
2533 :
2534 35448606 : return my_convs;
2535 921866 : }
2536 :
2537 : /* Worker for lookup_conversions. Lookup conversion functions in
2538 : BINFO and its children. VIRTUAL_DEPTH is nonzero, if BINFO is in a
2539 : morally virtual base, and VIRTUALNESS is nonzero, if we've
2540 : encountered virtual bases already in the tree walk. PARENT_CONVS
2541 : is a list of conversions within parent binfos. OTHER_CONVS are
2542 : conversions found elsewhere in the tree. Return the conversions
2543 : found within this portion of the graph in CONVS. Return nonzero if
2544 : we encountered virtualness. We keep template and non-template
2545 : conversions separate, to avoid unnecessary type comparisons.
2546 :
2547 : The located conversion functions are held in lists of lists. The
2548 : TREE_VALUE of the outer list is the list of conversion functions
2549 : found in a particular binfo. The TREE_PURPOSE of both the outer
2550 : and inner lists is the binfo at which those conversions were
2551 : found. TREE_STATIC is set for those lists within of morally
2552 : virtual binfos. The TREE_VALUE of the inner list is the conversion
2553 : function or overload itself. The TREE_TYPE of each inner list node
2554 : is the converted-to type. */
2555 :
2556 : static int
2557 105461431 : lookup_conversions_r (tree binfo, int virtual_depth, int virtualness,
2558 : tree parent_convs, tree other_convs, tree *convs)
2559 : {
2560 105461431 : int my_virtualness = 0;
2561 105461431 : tree my_convs = NULL_TREE;
2562 105461431 : tree child_convs = NULL_TREE;
2563 :
2564 : /* If we have no conversion operators, then don't look. */
2565 105461431 : if (!TYPE_HAS_CONVERSION (BINFO_TYPE (binfo)))
2566 : {
2567 70012825 : *convs = NULL_TREE;
2568 :
2569 70012825 : return 0;
2570 : }
2571 :
2572 35448606 : if (BINFO_VIRTUAL_P (binfo))
2573 81471 : virtual_depth++;
2574 :
2575 : /* First, locate the unhidden ones at this level. */
2576 35448606 : if (tree conv = get_class_binding (BINFO_TYPE (binfo), conv_op_identifier))
2577 86060403 : for (ovl_iterator iter (conv); iter; ++iter)
2578 : {
2579 41408076 : tree fn = *iter;
2580 41408076 : tree type = DECL_CONV_FN_TYPE (fn);
2581 :
2582 41408076 : if (TREE_CODE (fn) != TEMPLATE_DECL && type_uses_auto (type))
2583 : {
2584 3 : mark_used (fn);
2585 3 : type = DECL_CONV_FN_TYPE (fn);
2586 : }
2587 :
2588 41408076 : if (check_hidden_convs (binfo, virtual_depth, virtualness,
2589 : type, parent_convs, other_convs))
2590 : {
2591 41386148 : my_convs = tree_cons (binfo, fn, my_convs);
2592 41386148 : TREE_TYPE (my_convs) = type;
2593 41386148 : if (virtual_depth)
2594 : {
2595 79588 : TREE_STATIC (my_convs) = 1;
2596 79588 : my_virtualness = 1;
2597 : }
2598 : }
2599 : }
2600 :
2601 34526096 : if (my_convs)
2602 : {
2603 34506384 : parent_convs = tree_cons (binfo, my_convs, parent_convs);
2604 34506384 : if (virtual_depth)
2605 79588 : TREE_STATIC (parent_convs) = 1;
2606 : }
2607 :
2608 35448606 : child_convs = other_convs;
2609 :
2610 : /* Now iterate over each base, looking for more conversions. */
2611 35448606 : unsigned i;
2612 35448606 : tree base_binfo;
2613 37222254 : for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
2614 : {
2615 1773648 : tree base_convs;
2616 1773648 : unsigned base_virtualness;
2617 :
2618 1773648 : base_virtualness = lookup_conversions_r (base_binfo,
2619 : virtual_depth, virtualness,
2620 : parent_convs, child_convs,
2621 : &base_convs);
2622 1773648 : if (base_virtualness)
2623 95225 : my_virtualness = virtualness = 1;
2624 1773648 : child_convs = chainon (base_convs, child_convs);
2625 : }
2626 :
2627 35448606 : *convs = split_conversions (my_convs, parent_convs,
2628 : child_convs, other_convs);
2629 :
2630 35448606 : return my_virtualness;
2631 : }
2632 :
2633 : /* Return a TREE_LIST containing all the non-hidden user-defined
2634 : conversion functions for TYPE (and its base-classes). The
2635 : TREE_VALUE of each node is the FUNCTION_DECL of the conversion
2636 : function. The TREE_PURPOSE is the BINFO from which the conversion
2637 : functions in this node were selected. This function is effectively
2638 : performing a set of member lookups as lookup_fnfield does, but
2639 : using the type being converted to as the unique key, rather than the
2640 : field name. */
2641 :
2642 : tree
2643 103688068 : lookup_conversions (tree type)
2644 : {
2645 103688068 : tree convs;
2646 :
2647 103688068 : complete_type (type);
2648 103688068 : if (!CLASS_TYPE_P (type) || !TYPE_BINFO (type))
2649 : return NULL_TREE;
2650 :
2651 103687783 : lookup_conversions_r (TYPE_BINFO (type), 0, 0, NULL_TREE, NULL_TREE, &convs);
2652 :
2653 103687783 : tree list = NULL_TREE;
2654 :
2655 : /* Flatten the list-of-lists */
2656 138194167 : for (; convs; convs = TREE_CHAIN (convs))
2657 : {
2658 34506384 : tree probe, next;
2659 :
2660 75892526 : for (probe = TREE_VALUE (convs); probe; probe = next)
2661 : {
2662 41386142 : next = TREE_CHAIN (probe);
2663 :
2664 41386142 : TREE_CHAIN (probe) = list;
2665 41386142 : list = probe;
2666 : }
2667 : }
2668 :
2669 : return list;
2670 : }
2671 :
2672 : /* Returns the binfo of the first direct or indirect virtual base derived
2673 : from BINFO, or NULL if binfo is not via virtual. */
2674 :
2675 : tree
2676 78 : binfo_from_vbase (tree binfo)
2677 : {
2678 123 : for (; binfo; binfo = BINFO_INHERITANCE_CHAIN (binfo))
2679 : {
2680 123 : if (BINFO_VIRTUAL_P (binfo))
2681 : return binfo;
2682 : }
2683 : return NULL_TREE;
2684 : }
2685 :
2686 : /* Returns the binfo of the first direct or indirect virtual base derived
2687 : from BINFO up to the TREE_TYPE, LIMIT, or NULL if binfo is not
2688 : via virtual. */
2689 :
2690 : tree
2691 491333394 : binfo_via_virtual (tree binfo, tree limit)
2692 : {
2693 491333394 : if (limit && !CLASSTYPE_VBASECLASSES (limit))
2694 : /* LIMIT has no virtual bases, so BINFO cannot be via one. */
2695 : return NULL_TREE;
2696 :
2697 12786645 : for (; binfo && !SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), limit);
2698 1793942 : binfo = BINFO_INHERITANCE_CHAIN (binfo))
2699 : {
2700 3823254 : if (BINFO_VIRTUAL_P (binfo))
2701 : return binfo;
2702 : }
2703 : return NULL_TREE;
2704 : }
2705 :
2706 : /* BINFO is for a base class in some hierarchy. Return true iff it is a
2707 : direct base. */
2708 :
2709 : bool
2710 117632 : binfo_direct_p (tree binfo)
2711 : {
2712 117632 : tree d_binfo = BINFO_INHERITANCE_CHAIN (binfo);
2713 117632 : if (BINFO_INHERITANCE_CHAIN (d_binfo))
2714 : /* A second inheritance chain means indirect. */
2715 : return false;
2716 117626 : if (!BINFO_VIRTUAL_P (binfo))
2717 : /* Non-virtual, so only one inheritance chain means direct. */
2718 : return true;
2719 : /* A virtual base looks like a direct base, so we need to look through the
2720 : direct bases to see if it's there. */
2721 : tree b_binfo;
2722 27 : for (int i = 0; BINFO_BASE_ITERATE (d_binfo, i, b_binfo); ++i)
2723 24 : if (b_binfo == binfo)
2724 : return true;
2725 : return false;
2726 : }
2727 :
2728 : /* BINFO is a base binfo in the complete type BINFO_TYPE (HERE).
2729 : Find the equivalent binfo within whatever graph HERE is located.
2730 : This is the inverse of original_binfo. */
2731 :
2732 : tree
2733 28531635 : copied_binfo (tree binfo, tree here)
2734 : {
2735 28531635 : tree result = NULL_TREE;
2736 :
2737 28531635 : if (BINFO_VIRTUAL_P (binfo))
2738 : {
2739 : tree t;
2740 :
2741 6505119 : for (t = here; BINFO_INHERITANCE_CHAIN (t);
2742 3378148 : t = BINFO_INHERITANCE_CHAIN (t))
2743 3378148 : continue;
2744 :
2745 3126971 : result = binfo_for_vbase (BINFO_TYPE (binfo), BINFO_TYPE (t));
2746 3378148 : }
2747 25404664 : else if (BINFO_INHERITANCE_CHAIN (binfo))
2748 : {
2749 12702332 : tree cbinfo;
2750 12702332 : tree base_binfo;
2751 12702332 : int ix;
2752 :
2753 12702332 : cbinfo = copied_binfo (BINFO_INHERITANCE_CHAIN (binfo), here);
2754 25430539 : for (ix = 0; BINFO_BASE_ITERATE (cbinfo, ix, base_binfo); ix++)
2755 12728207 : if (SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo), BINFO_TYPE (binfo)))
2756 : {
2757 : result = base_binfo;
2758 : break;
2759 : }
2760 : }
2761 : else
2762 : {
2763 12702332 : gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (here), BINFO_TYPE (binfo)));
2764 : result = here;
2765 : }
2766 :
2767 28531635 : gcc_assert (result);
2768 28531635 : return result;
2769 : }
2770 :
2771 : tree
2772 6331979 : binfo_for_vbase (tree base, tree t)
2773 : {
2774 6331979 : unsigned ix;
2775 6331979 : tree binfo;
2776 6331979 : vec<tree, va_gc> *vbases;
2777 :
2778 67599464 : for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0;
2779 67599464 : vec_safe_iterate (vbases, ix, &binfo); ix++)
2780 66099004 : if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), base))
2781 : return binfo;
2782 : return NULL;
2783 : }
2784 :
2785 : /* BINFO is some base binfo of HERE, within some other
2786 : hierarchy. Return the equivalent binfo, but in the hierarchy
2787 : dominated by HERE. This is the inverse of copied_binfo. If BINFO
2788 : is not a base binfo of HERE, returns NULL_TREE. */
2789 :
2790 : tree
2791 1877 : original_binfo (tree binfo, tree here)
2792 : {
2793 1877 : tree result = NULL;
2794 :
2795 1877 : if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (here)))
2796 : result = here;
2797 12 : else if (BINFO_VIRTUAL_P (binfo))
2798 12 : result = (CLASSTYPE_VBASECLASSES (BINFO_TYPE (here))
2799 12 : ? binfo_for_vbase (BINFO_TYPE (binfo), BINFO_TYPE (here))
2800 : : NULL_TREE);
2801 0 : else if (BINFO_INHERITANCE_CHAIN (binfo))
2802 : {
2803 0 : tree base_binfos;
2804 :
2805 0 : base_binfos = original_binfo (BINFO_INHERITANCE_CHAIN (binfo), here);
2806 0 : if (base_binfos)
2807 : {
2808 : int ix;
2809 : tree base_binfo;
2810 :
2811 0 : for (ix = 0; (base_binfo = BINFO_BASE_BINFO (base_binfos, ix)); ix++)
2812 0 : if (SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo),
2813 : BINFO_TYPE (binfo)))
2814 : {
2815 : result = base_binfo;
2816 : break;
2817 : }
2818 : }
2819 : }
2820 :
2821 1877 : return result;
2822 : }
2823 :
2824 : /* True iff TYPE has any dependent bases (and therefore we can't say
2825 : definitively that another class is not a base of an instantiation of
2826 : TYPE). */
2827 :
2828 : bool
2829 169724644 : any_dependent_bases_p (tree type /* = current_nonlambda_class_type () */)
2830 : {
2831 169724644 : if (!type || !CLASS_TYPE_P (type) || !uses_template_parms (type))
2832 123786373 : return false;
2833 :
2834 : /* If we haven't set TYPE_BINFO yet, we don't know anything about the bases.
2835 : Return false because in this situation we aren't actually looking up names
2836 : in the scope of the class, so it doesn't matter whether it has dependent
2837 : bases. */
2838 45938271 : if (!TYPE_BINFO (type))
2839 : return false;
2840 :
2841 : unsigned i;
2842 : tree base_binfo;
2843 48023249 : FOR_EACH_VEC_SAFE_ELT (BINFO_BASE_BINFOS (TYPE_BINFO (type)), i, base_binfo)
2844 31479435 : if (BINFO_DEPENDENT_BASE_P (base_binfo)
2845 : /* Recurse to also consider possibly dependent bases of a base that
2846 : is part of the current instantiation. */
2847 31479435 : || any_dependent_bases_p (BINFO_TYPE (base_binfo)))
2848 29394448 : return true;
2849 :
2850 : return false;
2851 : }
|
