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 1043275469 : dfs_lookup_base (tree binfo, void *data_)
77 : {
78 1043275469 : struct lookup_base_data_s *data = (struct lookup_base_data_s *) data_;
79 :
80 1043275469 : if (data->offset != -1)
81 : {
82 : /* We're looking for the type at a particular offset. */
83 10346657 : int comp = compare_tree_int (BINFO_OFFSET (binfo), data->offset);
84 10346657 : 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 10059764 : else if (comp != 0
90 10072371 : && 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 1042988555 : if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->base))
97 : {
98 474176603 : const bool via_virtual
99 474176603 : = binfo_via_virtual (binfo, data->t) != NULL_TREE;
100 :
101 474176603 : 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 474175875 : if (!data->binfo)
107 : {
108 474174193 : data->binfo = binfo;
109 474174193 : data->via_virtual = via_virtual;
110 :
111 474174193 : if (!data->repeated_base)
112 : /* If there are no repeated bases, we can stop now. */
113 : return binfo;
114 :
115 12788 : 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 7565 : return dfs_skip_bases;
121 : }
122 : else
123 : {
124 1682 : gcc_assert (binfo != data->binfo);
125 :
126 : /* We've found more than one matching binfo. */
127 1682 : if (!data->want_any)
128 : {
129 : /* This is immediately ambiguous. */
130 1562 : data->binfo = NULL_TREE;
131 1562 : data->ambiguous = true;
132 1562 : return error_mark_node;
133 : }
134 :
135 : /* Prefer one via a non-virtual path. */
136 120 : if (!via_virtual)
137 : {
138 45 : data->binfo = binfo;
139 45 : data->via_virtual = false;
140 45 : 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 1159 : get_parent_with_private_access (tree decl, tree binfo)
166 : {
167 : /* Only BINFOs should come through here. */
168 1159 : gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
169 :
170 1258 : 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 1258 : 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 53296803 : accessible_base_p (tree t, tree base, bool consider_local_p)
198 : {
199 53296803 : 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 53296803 : 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 13360244 : decl = TYPE_FIELDS (base);
213 809613665 : while (!DECL_SELF_REFERENCE_P (decl))
214 796253421 : decl = DECL_CHAIN (decl);
215 13360244 : while (ANON_AGGR_TYPE_P (t))
216 0 : t = TYPE_CONTEXT (t);
217 13360244 : 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 904027624 : 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 904027624 : tree binfo;
235 904027624 : tree t_binfo;
236 904027624 : base_kind bk;
237 :
238 : /* "Nothing" is definitely not derived from Base. */
239 904027624 : if (t == NULL_TREE)
240 : {
241 15283 : if (kind_ptr)
242 0 : *kind_ptr = bk_not_base;
243 : return NULL_TREE;
244 : }
245 :
246 904012341 : if (t == error_mark_node || base == error_mark_node)
247 : {
248 0 : if (kind_ptr)
249 0 : *kind_ptr = bk_not_base;
250 : return error_mark_node;
251 : }
252 904012341 : gcc_assert (TYPE_P (base));
253 :
254 904012341 : if (!TYPE_P (t))
255 : {
256 4000824 : t_binfo = t;
257 4000824 : t = BINFO_TYPE (t);
258 : }
259 : else
260 : {
261 900011517 : t = complete_type (TYPE_MAIN_VARIANT (t));
262 900011517 : if (dependent_type_p (t))
263 188323085 : if (tree open = currently_open_class (t))
264 900011517 : t = open;
265 900011517 : t_binfo = TYPE_BINFO (t);
266 : }
267 :
268 904012341 : 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 904012341 : if (t_binfo && CLASS_TYPE_P (base) && COMPLETE_OR_OPEN_TYPE_P (base))
273 : {
274 886604031 : struct lookup_base_data_s data;
275 :
276 886604031 : data.t = t;
277 886604031 : data.base = base;
278 886604031 : data.binfo = NULL_TREE;
279 886604031 : data.ambiguous = data.via_virtual = false;
280 886604031 : data.repeated_base = (offset == -1) && CLASSTYPE_REPEATED_BASE_P (t);
281 886604031 : data.want_any = access == ba_any;
282 886604031 : data.offset = offset;
283 886604031 : data.require_virtual = (access & ba_require_virtual);
284 :
285 886604031 : dfs_walk_once (t_binfo, dfs_lookup_base, NULL, &data);
286 886604031 : binfo = data.binfo;
287 :
288 886604031 : if (!binfo)
289 412431400 : bk = data.ambiguous ? bk_ambig : bk_not_base;
290 474172631 : else if (binfo == t_binfo)
291 : bk = bk_same_type;
292 83599324 : else if (data.via_virtual)
293 : bk = bk_via_virtual;
294 : else
295 82776858 : 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 904012341 : if (access != ba_any)
305 19333011 : switch (bk)
306 : {
307 : case bk_not_base:
308 : break;
309 :
310 1562 : case bk_ambig:
311 1562 : if (complain & tf_error)
312 113 : error ("%qT is an ambiguous base of %qT", base, t);
313 1562 : binfo = error_mark_node;
314 1562 : break;
315 :
316 19320345 : default:
317 19320345 : 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 6026343 : && COMPLETE_TYPE_P (base)
325 25346682 : && !accessible_base_p (t, base, !(access & ba_ignore_scope)))
326 : {
327 1151 : if (complain & tf_error)
328 54 : error ("%qT is an inaccessible base of %qT", base, t);
329 1151 : binfo = error_mark_node;
330 1151 : bk = bk_inaccessible;
331 : }
332 : break;
333 : }
334 :
335 904012341 : if (kind_ptr)
336 4373530 : *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 13081 : dfs_dcast_hint_pre (tree binfo, void *data_)
358 : {
359 13081 : struct dcast_data_s *data = (struct dcast_data_s *) data_;
360 :
361 13081 : if (BINFO_VIRTUAL_P (binfo))
362 474 : data->virt_depth++;
363 :
364 13081 : if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->subtype))
365 : {
366 5760 : if (data->virt_depth)
367 : {
368 367 : data->offset = ssize_int (-1);
369 367 : return data->offset;
370 : }
371 5393 : if (data->offset)
372 15 : data->offset = ssize_int (-3);
373 : else
374 5378 : data->offset = BINFO_OFFSET (binfo);
375 :
376 5393 : 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 1288 : dfs_dcast_hint_post (tree binfo, void *data_)
386 : {
387 1288 : struct dcast_data_s *data = (struct dcast_data_s *) data_;
388 :
389 1288 : if (BINFO_VIRTUAL_P (binfo))
390 47 : data->virt_depth--;
391 :
392 1288 : 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 6236 : dcast_base_hint (tree subtype, tree target)
408 : {
409 6236 : struct dcast_data_s data;
410 :
411 6236 : data.subtype = subtype;
412 6236 : data.virt_depth = 0;
413 6236 : data.offset = NULL_TREE;
414 6236 : data.repeated_base = CLASSTYPE_REPEATED_BASE_P (target);
415 :
416 6236 : dfs_walk_once_accessible (TYPE_BINFO (target), /*friends=*/false,
417 : dfs_dcast_hint_pre, dfs_dcast_hint_post, &data);
418 6236 : 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 2884640789 : 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 817607807 : if (current_function_decl && current_class_type
449 3441329460 : && ((DECL_FUNCTION_MEMBER_P (current_function_decl)
450 543412547 : && same_type_p (DECL_CONTEXT (current_function_decl),
451 : current_class_type))
452 45292558 : || (DECL_FRIEND_CONTEXT (current_function_decl)
453 18550790 : && same_type_p (DECL_FRIEND_CONTEXT (current_function_decl),
454 : current_class_type))))
455 543019665 : return current_function_decl;
456 :
457 2341621124 : if (current_class_type)
458 : return current_class_type;
459 :
460 1173554727 : if (current_function_decl)
461 : return current_function_decl;
462 :
463 912635591 : 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 489197082 : at_function_scope_p (void)
472 : {
473 489197082 : 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 489197082 : return (cs && TREE_CODE (cs) == FUNCTION_DECL
478 654034268 : && cfun && cfun->decl == current_function_decl);
479 : }
480 :
481 : /* Returns true if the innermost active scope is a class scope. */
482 :
483 : bool
484 916706954 : at_class_scope_p (void)
485 : {
486 916706954 : tree cs = current_scope ();
487 916706954 : return cs && TYPE_P (cs);
488 : }
489 :
490 : /* Returns true if the innermost active scope is a namespace scope. */
491 :
492 : bool
493 629587873 : at_namespace_scope_p (void)
494 : {
495 629587873 : tree cs = current_scope ();
496 629587873 : 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 6759051361 : 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 6759051361 : tree context = DECL_CONTEXT (decl);
511 :
512 12974838921 : while (context && TYPE_P (context)
513 9715501497 : && (ANON_AGGR_TYPE_P (context) || UNSCOPED_ENUM_P (context)))
514 55159505 : context = TYPE_CONTEXT (context);
515 6759051361 : if (!context)
516 598423306 : context = global_namespace;
517 :
518 6759051361 : 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 1589197 : type_context_for_name_lookup (tree decl)
526 : {
527 1589197 : tree context = DECL_P (decl) ? DECL_CONTEXT (decl) : decl;
528 1589197 : gcc_checking_assert (CLASS_TYPE_P (context));
529 :
530 1589540 : while (context && TYPE_P (context) && ANON_AGGR_TYPE_P (context))
531 : {
532 355 : tree next = TYPE_CONTEXT (context);
533 355 : if (!TYPE_P (next))
534 : break;
535 : context = next;
536 : }
537 1589197 : return context;
538 : }
539 :
540 : /* Returns true iff DECL is declared in TYPE. */
541 :
542 : static bool
543 583705862 : member_declared_in_type (tree decl, tree type)
544 : {
545 : /* A normal declaration obviously counts. */
546 583705862 : if (context_for_name_lookup (decl) == type)
547 : return true;
548 : /* So does a using or access declaration. */
549 177594977 : if (DECL_LANG_SPECIFIC (decl) && !DECL_DISCRIMINATOR_P (decl)
550 177594977 : && purpose_member (type, DECL_ACCESS (decl)))
551 940788 : 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 531951410 : dfs_access_in_type_pre (tree binfo, void *data)
562 : {
563 531951410 : tree decl = (tree) data;
564 531951410 : tree type = BINFO_TYPE (binfo);
565 531951410 : if (member_declared_in_type (decl, type))
566 445477114 : 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 531951410 : dfs_access_in_type (tree binfo, void *data)
584 : {
585 531951410 : tree decl = (tree) data;
586 531951410 : tree type = BINFO_TYPE (binfo);
587 531951410 : access_kind access = ak_none;
588 :
589 531951410 : 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 444791727 : if (TREE_PRIVATE (decl))
594 : access = ak_private;
595 408765434 : else if (TREE_PROTECTED (decl))
596 : access = ak_protected;
597 : else
598 531951410 : access = ak_public;
599 : }
600 : else
601 : {
602 : /* First, check for an access-declaration that gives us more
603 : access to the DECL. */
604 87159683 : if (DECL_LANG_SPECIFIC (decl) && !DECL_DISCRIMINATOR_P (decl))
605 : {
606 130154132 : tree decl_access = purpose_member (type, DECL_ACCESS (decl));
607 :
608 82261028 : if (decl_access)
609 : {
610 685387 : decl_access = TREE_VALUE (decl_access);
611 :
612 685387 : if (decl_access == access_public_node)
613 : access = ak_public;
614 255406 : else if (decl_access == access_protected_node)
615 : access = ak_protected;
616 47982 : 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 86474296 : int i;
626 86474296 : tree base_binfo;
627 86474296 : vec<tree, va_gc> *accesses;
628 :
629 : /* Otherwise, scan our baseclasses, and pick the most favorable
630 : access. */
631 86474296 : accesses = BINFO_BASE_ACCESSES (binfo);
632 93284575 : for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
633 : {
634 85832497 : tree base_access = (*accesses)[i];
635 85832497 : access_kind base_access_now = BINFO_ACCESS (base_binfo);
636 :
637 85832497 : 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 83201720 : 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 82533527 : 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 81326913 : if (base_access_now != ak_none
654 83201720 : && (access == ak_none || base_access_now < access))
655 : {
656 83201195 : access = base_access_now;
657 :
658 : /* If the new access is public, we can't do better. */
659 83201195 : if (access == ak_public)
660 : break;
661 : }
662 : }
663 : }
664 : }
665 :
666 : /* Note the access to DECL in TYPE. */
667 531951410 : SET_BINFO_ACCESS (binfo, access);
668 :
669 531951410 : return NULL_TREE;
670 : }
671 :
672 : /* Return the access to DECL in TYPE. */
673 :
674 : static access_kind
675 445476679 : access_in_type (tree type, tree decl)
676 : {
677 445476679 : 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 445476679 : dfs_walk_once (binfo, dfs_access_in_type_pre, dfs_access_in_type, decl);
691 :
692 445476679 : 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 9544384 : 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 9544384 : if (!DERIVED_FROM_P (type, derived))
712 : return 0;
713 :
714 : /* DECL_NONSTATIC_MEMBER_P won't work for USING_DECLs. */
715 9409420 : decl = strip_using_decl (decl);
716 : /* We don't expect or support dependent decls. */
717 9409420 : 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 15612606 : if (DECL_NONSTATIC_MEMBER_P (decl)
731 14064249 : && !DERIVED_FROM_P (derived, otype))
732 391 : 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 16777756 : 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 16777756 : tree befriending_classes;
753 16777756 : tree t;
754 :
755 16777756 : if (!scope)
756 : return 0;
757 :
758 16777756 : if (is_global_friend (scope))
759 : return 1;
760 :
761 : /* Is SCOPE itself a suitable P? */
762 16777756 : if (TYPE_P (scope) && protected_accessible_p (decl, scope, type, otype))
763 : return 1;
764 :
765 7380346 : if (DECL_DECLARES_FUNCTION_P (scope))
766 7290258 : befriending_classes = DECL_BEFRIENDING_CLASSES (scope);
767 90088 : else if (TYPE_P (scope))
768 87635 : befriending_classes = CLASSTYPE_BEFRIENDING_CLASSES (scope);
769 : else
770 : return 0;
771 :
772 7425613 : for (t = befriending_classes; t; t = TREE_CHAIN (t))
773 59339 : 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 7366274 : if (TYPE_P (scope))
779 76609 : if (friend_accessible_p (TYPE_CONTEXT (scope), decl, type, otype))
780 : return 1;
781 :
782 7290765 : if (DECL_DECLARES_FUNCTION_P (scope))
783 : {
784 : /* Perhaps this SCOPE is a member of a class which is a
785 : friend. */
786 14579330 : if (DECL_CLASS_SCOPE_P (scope)
787 14578946 : && 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 966 : 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 1580 : if (tree tinfo = get_template_info (scope))
798 : {
799 1309 : tree tmpl = TI_TEMPLATE (tinfo);
800 1309 : if (DECL_CLASS_TEMPLATE_P (tmpl))
801 1035 : tmpl = TREE_TYPE (tmpl);
802 : else
803 274 : tmpl = DECL_TEMPLATE_RESULT (tmpl);
804 1309 : if (tmpl != scope)
805 : {
806 : /* Increment processing_template_decl to make sure that
807 : dependent_type_p works correctly. */
808 1162 : ++processing_template_decl;
809 1162 : int ret = friend_accessible_p (tmpl, decl, type, otype);
810 1162 : --processing_template_decl;
811 1162 : if (ret)
812 : return 1;
813 : }
814 : }
815 :
816 : /* If is_friend is true, we should have found a befriending class. */
817 451 : 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 51754452 : dfs_accessible_pre (tree binfo, void *data)
832 : {
833 51754452 : dfs_accessible_data *d = (dfs_accessible_data *)data;
834 51754452 : tree type = BINFO_TYPE (binfo);
835 51754452 : if (member_declared_in_type (d->decl, type))
836 46944371 : 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 47487750 : dfs_accessible_post (tree binfo, void *data)
844 : {
845 : /* access_in_type already set BINFO_ACCESS for us. */
846 47487750 : access_kind access = BINFO_ACCESS (binfo);
847 47487750 : tree N = BINFO_TYPE (binfo);
848 47487750 : dfs_accessible_data *d = (dfs_accessible_data *)data;
849 47487750 : tree decl = d->decl;
850 47487750 : tree scope = current_nonlambda_scope ();
851 :
852 : /* A member m is accessible at the point R when named in class N if */
853 47487750 : 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 36074499 : case ak_private:
863 36074499 : {
864 : /* m as a member of N is private, and R occurs in a member or friend of
865 : class N, or */
866 36074499 : if (scope && TREE_CODE (scope) != NAMESPACE_DECL
867 72147404 : && is_friend (N, scope))
868 : return binfo;
869 : return NULL_TREE;
870 : }
871 :
872 9410701 : case ak_protected:
873 9410701 : {
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 9410701 : if (friend_accessible_p (scope, decl, N, d->object_type))
878 : return binfo;
879 : return NULL_TREE;
880 : }
881 :
882 0 : default:
883 0 : 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 4395306 : accessible_in_template_p (tree type, tree decl)
892 : {
893 4395306 : int save_ptd = processing_template_decl;
894 4395306 : processing_template_decl = 0;
895 4395306 : int val = accessible_p (type, decl, false);
896 4395306 : processing_template_decl = save_ptd;
897 4395306 : 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 445476457 : accessible_p (tree type, tree decl, bool consider_local_p)
910 : {
911 445476457 : tree binfo;
912 445476457 : access_kind access;
913 :
914 : /* If this declaration is in a block or namespace scope, there's no
915 : access control. */
916 445476457 : 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 445476401 : if (current_function_decl && DECL_THUNK_P (current_function_decl))
921 : return 1;
922 :
923 445476401 : tree otype = NULL_TREE;
924 445476401 : 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 874332772 : for (tree b = type; b; b = BINFO_INHERITANCE_CHAIN (b))
930 446675473 : otype = BINFO_TYPE (b);
931 427657299 : type = BINFO_TYPE (type);
932 : }
933 : else
934 : otype = type;
935 :
936 : /* Anonymous unions don't have their own access. */
937 445476401 : if (ANON_AGGR_TYPE_P (type))
938 150 : type = type_context_for_name_lookup (type);
939 445476401 : if (ANON_AGGR_TYPE_P (otype))
940 150 : otype = type_context_for_name_lookup (otype);
941 :
942 : /* [class.access.base]
943 :
944 : A member m is accessible when named in class N if
945 :
946 : --m as a member of N is public, or
947 :
948 : --m as a member of N is private, and the reference occurs in a
949 : member or friend of class N, or
950 :
951 : --m as a member of N is protected, and the reference occurs in a
952 : member or friend of class N, or in a member or friend of a
953 : class P derived from N, where m as a member of P is public, private or
954 : protected, or
955 :
956 : --there exists a base class B of N that is accessible at the point
957 : of reference, and m is accessible when named in class B.
958 :
959 : We walk the base class hierarchy, checking these conditions. */
960 :
961 : /* We walk using TYPE_BINFO (type) because access_in_type will set
962 : BINFO_ACCESS on it and its bases. */
963 445476401 : binfo = TYPE_BINFO (type);
964 :
965 : /* Compute the accessibility of DECL in the class hierarchy
966 : dominated by type. */
967 445476401 : access = access_in_type (type, decl);
968 445476401 : if (access == ak_public)
969 : return 1;
970 :
971 : /* If we aren't considering the point of reference, only the first bullet
972 : applies. */
973 46946798 : if (!consider_local_p)
974 : return 0;
975 :
976 46945797 : dfs_accessible_data d = { decl, otype };
977 :
978 : /* Walk the hierarchy again, looking for a base class that allows
979 : access. */
980 46945797 : return dfs_walk_once_accessible (binfo, /*friends=*/true,
981 : dfs_accessible_pre,
982 : dfs_accessible_post, &d)
983 46945797 : != NULL_TREE;
984 : }
985 :
986 : struct lookup_field_info {
987 : /* The type in which we're looking. */
988 : tree type;
989 : /* The name of the field for which we're looking. */
990 : tree name;
991 : /* If non-NULL, the current result of the lookup. */
992 : tree rval;
993 : /* The path to RVAL. */
994 : tree rval_binfo;
995 : /* If non-NULL, the lookup was ambiguous, and this is a list of the
996 : candidates. */
997 : tree ambiguous;
998 : /* If nonzero, we are looking for types, not data members. */
999 : int want_type;
1000 : };
1001 :
1002 : /* True for a class member means that it is shared between all objects
1003 : of that class.
1004 :
1005 : [class.member.lookup]:If the resulting set of declarations are not all
1006 : from sub-objects of the same type, or the set has a non-static member
1007 : and includes members from distinct sub-objects, there is an ambiguity
1008 : and the program is ill-formed.
1009 :
1010 : This function checks that T contains no non-static members. */
1011 :
1012 : bool
1013 48068634 : shared_member_p (tree t)
1014 : {
1015 48068634 : if (VAR_P (t) || TREE_CODE (t) == TYPE_DECL
1016 46172491 : || TREE_CODE (t) == CONST_DECL)
1017 : return true;
1018 46168861 : if (is_overloaded_fn (t))
1019 : {
1020 74429523 : for (ovl_iterator iter (get_fns (t)); iter; ++iter)
1021 : {
1022 50192120 : tree decl = strip_using_decl (*iter);
1023 50192120 : if (TREE_CODE (decl) == USING_DECL)
1024 : /* Conservatively assume a dependent using-declaration
1025 : might resolve to a non-static member. */
1026 30781850 : return false;
1027 50192117 : if (DECL_OBJECT_MEMBER_FUNCTION_P (decl))
1028 : return false;
1029 : }
1030 15386557 : return true;
1031 : }
1032 : return false;
1033 : }
1034 :
1035 : /* Routine to see if the sub-object denoted by the binfo PARENT can be
1036 : found as a base class and sub-object of the object denoted by
1037 : BINFO. */
1038 :
1039 : static int
1040 4751153 : is_subobject_of_p (tree parent, tree binfo)
1041 : {
1042 4751153 : tree probe;
1043 :
1044 10863639 : for (probe = parent; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
1045 : {
1046 7863846 : if (probe == binfo)
1047 : return 1;
1048 7821665 : if (BINFO_VIRTUAL_P (probe))
1049 1709179 : return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (binfo))
1050 1709179 : != NULL_TREE);
1051 : }
1052 : return 0;
1053 : }
1054 :
1055 : /* DATA is really a struct lookup_field_info. Look for a field with
1056 : the name indicated there in BINFO. If this function returns a
1057 : non-NULL value it is the result of the lookup. Called from
1058 : lookup_field via breadth_first_search. */
1059 :
1060 : static tree
1061 7308318242 : lookup_field_r (tree binfo, void *data)
1062 : {
1063 7308318242 : struct lookup_field_info *lfi = (struct lookup_field_info *) data;
1064 7308318242 : tree type = BINFO_TYPE (binfo);
1065 7308318242 : tree nval = NULL_TREE;
1066 :
1067 : /* If this is a dependent base, don't look in it. */
1068 7308318242 : if (BINFO_DEPENDENT_BASE_P (binfo))
1069 : return NULL_TREE;
1070 :
1071 : /* If this base class is hidden by the best-known value so far, we
1072 : don't need to look. */
1073 74767810 : if (lfi->rval_binfo && BINFO_INHERITANCE_CHAIN (binfo) == lfi->rval_binfo
1074 5999565243 : && !BINFO_VIRTUAL_P (binfo))
1075 : return dfs_skip_bases;
1076 :
1077 5870099245 : nval = get_class_binding (type, lfi->name, lfi->want_type);
1078 :
1079 : /* If there is no declaration with the indicated name in this type,
1080 : then there's nothing to do. */
1081 5870099245 : if (!nval)
1082 5123891234 : goto done;
1083 :
1084 : /* If the lookup already found a match, and the new value doesn't
1085 : hide the old one, we might have an ambiguity. */
1086 746208011 : if (lfi->rval_binfo
1087 746208011 : && !is_subobject_of_p (lfi->rval_binfo, binfo))
1088 :
1089 : {
1090 2354571 : if (nval == lfi->rval && shared_member_p (nval))
1091 : /* The two things are really the same. */
1092 : ;
1093 2354361 : else if (is_subobject_of_p (binfo, lfi->rval_binfo))
1094 : /* The previous value hides the new one. */
1095 : ;
1096 : else
1097 : {
1098 : /* We have a real ambiguity. We keep a chain of all the
1099 : candidates. */
1100 689339 : if (!lfi->ambiguous && lfi->rval)
1101 : {
1102 : /* This is the first time we noticed an ambiguity. Add
1103 : what we previously thought was a reasonable candidate
1104 : to the list. */
1105 545762 : lfi->ambiguous = tree_cons (NULL_TREE, lfi->rval, NULL_TREE);
1106 545762 : TREE_TYPE (lfi->ambiguous) = error_mark_node;
1107 : }
1108 :
1109 : /* Add the new value. */
1110 689339 : if (TREE_CODE (nval) == TREE_LIST)
1111 8 : lfi->ambiguous = chainon (nval, lfi->ambiguous);
1112 : else
1113 : {
1114 689331 : lfi->ambiguous = tree_cons (NULL_TREE, nval, lfi->ambiguous);
1115 689331 : TREE_TYPE (lfi->ambiguous) = error_mark_node;
1116 : }
1117 : }
1118 : }
1119 : else
1120 : {
1121 743853440 : if (TREE_CODE (nval) == TREE_LIST)
1122 : {
1123 101 : lfi->ambiguous = chainon (nval, lfi->ambiguous);
1124 101 : lfi->rval = TREE_VALUE (nval);
1125 : }
1126 : else
1127 743853339 : lfi->rval = nval;
1128 743853440 : lfi->rval_binfo = binfo;
1129 : }
1130 :
1131 5870099245 : done:
1132 : /* Don't look for constructors or destructors in base classes. */
1133 5870099245 : if (IDENTIFIER_CDTOR_P (lfi->name))
1134 199597660 : return dfs_skip_bases;
1135 : return NULL_TREE;
1136 : }
1137 :
1138 : /* Return a "baselink" with BASELINK_BINFO, BASELINK_ACCESS_BINFO,
1139 : BASELINK_FUNCTIONS, and BASELINK_OPTYPE set to BINFO, ACCESS_BINFO,
1140 : FUNCTIONS, and OPTYPE respectively. */
1141 :
1142 : tree
1143 232379275 : build_baselink (tree binfo, tree access_binfo, tree functions, tree optype)
1144 : {
1145 232379275 : tree baselink;
1146 :
1147 232379275 : gcc_checking_assert (binfo && access_binfo);
1148 232379275 : gcc_assert (OVL_P (functions) || TREE_CODE (functions) == TEMPLATE_ID_EXPR);
1149 232379275 : gcc_assert (!optype || TYPE_P (optype));
1150 232379275 : gcc_assert (TREE_TYPE (functions));
1151 :
1152 232379275 : baselink = make_node (BASELINK);
1153 232379275 : TREE_TYPE (baselink) = TREE_TYPE (functions);
1154 232379275 : BASELINK_BINFO (baselink) = binfo;
1155 232379275 : BASELINK_ACCESS_BINFO (baselink) = access_binfo;
1156 232379275 : BASELINK_FUNCTIONS (baselink) = functions;
1157 232379275 : BASELINK_OPTYPE (baselink) = optype;
1158 :
1159 232379275 : if (binfo == access_binfo
1160 453452807 : && TYPE_BEING_DEFINED (BINFO_TYPE (access_binfo)))
1161 6789432 : BASELINK_FUNCTIONS_MAYBE_INCOMPLETE_P (baselink) = true;
1162 :
1163 232379275 : return baselink;
1164 : }
1165 :
1166 : /* Look for a member named NAME in an inheritance lattice dominated by
1167 : XBASETYPE. If PROTECT is 0 or two, we do not check access. If it
1168 : is 1, we enforce accessibility. If PROTECT is zero, then, for an
1169 : ambiguous lookup, we return NULL. If PROTECT is 1, we issue error
1170 : messages about inaccessible or ambiguous lookup. If PROTECT is 2,
1171 : we return a TREE_LIST whose TREE_TYPE is error_mark_node and whose
1172 : TREE_VALUEs are the list of ambiguous candidates.
1173 :
1174 : WANT_TYPE is 1 when we should only return TYPE_DECLs.
1175 :
1176 : If nothing can be found return NULL_TREE and do not issue an error.
1177 :
1178 : If non-NULL, failure information is written back to AFI. */
1179 :
1180 : tree
1181 5187664009 : lookup_member (tree xbasetype, tree name, int protect, bool want_type,
1182 : tsubst_flags_t complain, access_failure_info *afi /* = NULL */)
1183 : {
1184 5187664009 : tree rval, rval_binfo = NULL_TREE;
1185 5187664009 : tree type = NULL_TREE, basetype_path = NULL_TREE;
1186 5187664009 : struct lookup_field_info lfi;
1187 :
1188 : /* rval_binfo is the binfo associated with the found member, note,
1189 : this can be set with useful information, even when rval is not
1190 : set, because it must deal with ALL members, not just non-function
1191 : members. It is used for ambiguity checking and the hidden
1192 : checks. Whereas rval is only set if a proper (not hidden)
1193 : non-function member is found. */
1194 :
1195 5187664009 : if (name == error_mark_node
1196 5187664009 : || xbasetype == NULL_TREE
1197 5187664003 : || xbasetype == error_mark_node)
1198 : return NULL_TREE;
1199 :
1200 5187664003 : gcc_assert (identifier_p (name));
1201 :
1202 5187664003 : if (TREE_CODE (xbasetype) == TREE_BINFO)
1203 : {
1204 113071657 : type = BINFO_TYPE (xbasetype);
1205 113071657 : basetype_path = xbasetype;
1206 : }
1207 : else
1208 : {
1209 5074592346 : if (!RECORD_OR_UNION_CODE_P (TREE_CODE (xbasetype)))
1210 : return NULL_TREE;
1211 : type = xbasetype;
1212 5187663967 : xbasetype = NULL_TREE;
1213 : }
1214 :
1215 5187663967 : type = complete_type (type);
1216 :
1217 : /* Make sure we're looking for a member of the current instantiation in the
1218 : right partial specialization. */
1219 5187663913 : if (dependent_type_p (type))
1220 3314477418 : if (tree t = currently_open_class (type))
1221 5187663913 : type = t;
1222 :
1223 5187663913 : if (!basetype_path)
1224 5074592256 : basetype_path = TYPE_BINFO (type);
1225 :
1226 5074592256 : if (!basetype_path)
1227 : return NULL_TREE;
1228 :
1229 5102596401 : memset (&lfi, 0, sizeof (lfi));
1230 5102596401 : lfi.type = type;
1231 5102596401 : lfi.name = name;
1232 5102596401 : lfi.want_type = want_type;
1233 5102596401 : dfs_walk_all (basetype_path, &lookup_field_r, NULL, &lfi);
1234 5102596401 : rval = lfi.rval;
1235 5102596401 : rval_binfo = lfi.rval_binfo;
1236 5102596401 : if (rval_binfo)
1237 743811219 : type = BINFO_TYPE (rval_binfo);
1238 :
1239 5102596401 : if (lfi.ambiguous)
1240 : {
1241 545863 : if (protect == 0)
1242 : return NULL_TREE;
1243 545863 : else if (protect == 1)
1244 : {
1245 84 : if (complain & tf_error)
1246 : {
1247 71 : auto_diagnostic_group d;
1248 71 : error ("request for member %qD is ambiguous", name);
1249 71 : print_candidates (input_location, lfi.ambiguous);
1250 71 : }
1251 84 : return error_mark_node;
1252 : }
1253 545779 : else if (protect == 2)
1254 : return lfi.ambiguous;
1255 : }
1256 :
1257 5102050538 : if (!rval)
1258 : return NULL_TREE;
1259 :
1260 : /* [class.access]
1261 :
1262 : In the case of overloaded function names, access control is
1263 : applied to the function selected by overloaded resolution.
1264 :
1265 : We cannot check here, even if RVAL is only a single non-static
1266 : member function, since we do not know what the "this" pointer
1267 : will be. For:
1268 :
1269 : class A { protected: void f(); };
1270 : class B : public A {
1271 : void g(A *p) {
1272 : f(); // OK
1273 : p->f(); // Not OK.
1274 : }
1275 : };
1276 :
1277 : only the first call to "f" is valid. However, if the function is
1278 : static, we can check. */
1279 743265356 : if (protect == 1 && !really_overloaded_fn (rval))
1280 : {
1281 110422802 : tree decl = is_overloaded_fn (rval) ? get_first_fn (rval) : rval;
1282 110422802 : decl = strip_using_decl (decl);
1283 : /* A dependent declaration will be checked after tsubsting. */
1284 110422802 : if (!dependent_scope_p (DECL_CONTEXT (decl))
1285 109848528 : && !(DECL_DECLARES_FUNCTION_P (decl)
1286 60369079 : && DECL_IOBJ_MEMBER_FUNCTION_P (decl))
1287 163364355 : && !perform_or_defer_access_check (basetype_path, decl, decl,
1288 : complain, afi))
1289 72 : return error_mark_node;
1290 : }
1291 :
1292 743265284 : if (is_overloaded_fn (rval)
1293 : /* Don't use a BASELINK for class-scope deduction guides since
1294 : they're not actually member functions. */
1295 743265284 : && !dguide_name_p (name))
1296 214852129 : rval = build_baselink (rval_binfo, basetype_path, rval,
1297 214852129 : (IDENTIFIER_CONV_OP_P (name)
1298 484353 : ? TREE_TYPE (name) : NULL_TREE));
1299 : return rval;
1300 : }
1301 :
1302 : /* Helper class for lookup_member_fuzzy. */
1303 :
1304 781 : class lookup_field_fuzzy_info
1305 : {
1306 : public:
1307 781 : lookup_field_fuzzy_info (bool want_type_p) :
1308 781 : m_want_type_p (want_type_p), m_candidates () {}
1309 :
1310 : void fuzzy_lookup_field (tree type);
1311 :
1312 : /* If true, we are looking for types, not data members. */
1313 : bool m_want_type_p;
1314 : /* The result: a vec of identifiers. */
1315 : auto_vec<tree> m_candidates;
1316 : };
1317 :
1318 : /* Locate all fields within TYPE, append them to m_candidates. */
1319 :
1320 : void
1321 876 : lookup_field_fuzzy_info::fuzzy_lookup_field (tree type)
1322 : {
1323 876 : if (!CLASS_TYPE_P (type))
1324 : return;
1325 :
1326 4423 : for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
1327 : {
1328 3553 : if (m_want_type_p && !DECL_DECLARES_TYPE_P (field))
1329 146 : continue;
1330 :
1331 3407 : if (!DECL_NAME (field))
1332 72 : continue;
1333 :
1334 3335 : if (is_lambda_ignored_entity (field))
1335 36 : continue;
1336 :
1337 : /* Ignore special identifiers with space at the end like cdtor or
1338 : conversion op identifiers. */
1339 3299 : if (TREE_CODE (DECL_NAME (field)) == IDENTIFIER_NODE)
1340 3299 : if (unsigned int len = IDENTIFIER_LENGTH (DECL_NAME (field)))
1341 3299 : if (IDENTIFIER_POINTER (DECL_NAME (field))[len - 1] == ' ')
1342 1457 : continue;
1343 :
1344 1842 : m_candidates.safe_push (DECL_NAME (field));
1345 : }
1346 : }
1347 :
1348 :
1349 : /* Helper function for lookup_member_fuzzy, called via dfs_walk_all
1350 : DATA is really a lookup_field_fuzzy_info. Look for a field with
1351 : the name indicated there in BINFO. Gathers pertinent identifiers into
1352 : m_candidates. */
1353 :
1354 : static tree
1355 876 : lookup_field_fuzzy_r (tree binfo, void *data)
1356 : {
1357 876 : lookup_field_fuzzy_info *lffi = (lookup_field_fuzzy_info *) data;
1358 876 : tree type = BINFO_TYPE (binfo);
1359 :
1360 876 : lffi->fuzzy_lookup_field (type);
1361 :
1362 876 : return NULL_TREE;
1363 : }
1364 :
1365 : /* Like lookup_member, but try to find the closest match for NAME,
1366 : rather than an exact match, and return an identifier (or NULL_TREE).
1367 : Do not complain. */
1368 :
1369 : tree
1370 781 : lookup_member_fuzzy (tree xbasetype, tree name, bool want_type_p)
1371 : {
1372 781 : tree type = NULL_TREE, basetype_path = NULL_TREE;
1373 781 : class lookup_field_fuzzy_info lffi (want_type_p);
1374 :
1375 : /* rval_binfo is the binfo associated with the found member, note,
1376 : this can be set with useful information, even when rval is not
1377 : set, because it must deal with ALL members, not just non-function
1378 : members. It is used for ambiguity checking and the hidden
1379 : checks. Whereas rval is only set if a proper (not hidden)
1380 : non-function member is found. */
1381 :
1382 781 : if (name == error_mark_node
1383 781 : || xbasetype == NULL_TREE
1384 781 : || xbasetype == error_mark_node)
1385 : return NULL_TREE;
1386 :
1387 781 : gcc_assert (identifier_p (name));
1388 :
1389 781 : if (TREE_CODE (xbasetype) == TREE_BINFO)
1390 : {
1391 6 : type = BINFO_TYPE (xbasetype);
1392 6 : basetype_path = xbasetype;
1393 : }
1394 : else
1395 : {
1396 775 : if (!RECORD_OR_UNION_CODE_P (TREE_CODE (xbasetype)))
1397 : return NULL_TREE;
1398 : type = xbasetype;
1399 781 : xbasetype = NULL_TREE;
1400 : }
1401 :
1402 781 : type = complete_type (type);
1403 :
1404 : /* Make sure we're looking for a member of the current instantiation in the
1405 : right partial specialization. */
1406 781 : if (flag_concepts && dependent_type_p (type))
1407 137 : type = currently_open_class (type);
1408 :
1409 781 : if (!basetype_path)
1410 775 : basetype_path = TYPE_BINFO (type);
1411 :
1412 775 : if (!basetype_path)
1413 : return NULL_TREE;
1414 :
1415 : /* Populate lffi.m_candidates. */
1416 775 : dfs_walk_all (basetype_path, &lookup_field_fuzzy_r, NULL, &lffi);
1417 :
1418 775 : return find_closest_identifier (name, &lffi.m_candidates);
1419 781 : }
1420 :
1421 : /* Like lookup_member, except that if we find a function member we
1422 : return NULL_TREE. */
1423 :
1424 : tree
1425 27936782 : lookup_field (tree xbasetype, tree name, int protect, bool want_type)
1426 : {
1427 27936782 : tree rval = lookup_member (xbasetype, name, protect, want_type,
1428 : tf_warning_or_error);
1429 :
1430 : /* Ignore functions, but propagate the ambiguity list. */
1431 27936782 : if (!error_operand_p (rval)
1432 27936782 : && (rval && BASELINK_P (rval)))
1433 0 : return NULL_TREE;
1434 :
1435 : return rval;
1436 : }
1437 :
1438 : /* Like lookup_member, except that if we find a non-function member we
1439 : return NULL_TREE. */
1440 :
1441 : tree
1442 148011891 : lookup_fnfields (tree xbasetype, tree name, int protect,
1443 : tsubst_flags_t complain)
1444 : {
1445 148011891 : tree rval = lookup_member (xbasetype, name, protect, /*want_type=*/false,
1446 : complain);
1447 :
1448 : /* Ignore non-functions, but propagate the ambiguity list. */
1449 148011891 : if (!error_operand_p (rval)
1450 148011891 : && (rval && !BASELINK_P (rval)))
1451 0 : return NULL_TREE;
1452 :
1453 : return rval;
1454 : }
1455 :
1456 : /* DECL is the result of a qualified name lookup. QUALIFYING_SCOPE is
1457 : the class or namespace used to qualify the name. CONTEXT_CLASS is
1458 : the class corresponding to the object in which DECL will be used.
1459 : Return a possibly modified version of DECL that takes into account
1460 : the CONTEXT_CLASS.
1461 :
1462 : In particular, consider an expression like `B::m' in the context of
1463 : a derived class `D'. If `B::m' has been resolved to a BASELINK,
1464 : then the most derived class indicated by the BASELINK_BINFO will be
1465 : `B', not `D'. This function makes that adjustment. */
1466 :
1467 : tree
1468 178196116 : adjust_result_of_qualified_name_lookup (tree decl,
1469 : tree qualifying_scope,
1470 : tree context_class)
1471 : {
1472 178196116 : if (!BASELINK_P (decl))
1473 : return decl;
1474 :
1475 12718499 : const bool qualified_p = qualifying_scope != NULL_TREE;
1476 12718499 : if (!qualified_p)
1477 1756 : qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (decl));
1478 :
1479 12718499 : if (context_class
1480 8874494 : && context_class != error_mark_node
1481 8874485 : && CLASS_TYPE_P (context_class)
1482 8874479 : && CLASS_TYPE_P (qualifying_scope)
1483 21592978 : && DERIVED_FROM_P (qualifying_scope, context_class))
1484 : {
1485 : /* Look for the QUALIFYING_SCOPE as a base of the CONTEXT_CLASS.
1486 : Because we do not yet know which function will be chosen by
1487 : overload resolution, we cannot yet check either accessibility
1488 : or ambiguity -- in either case, the choice of a static member
1489 : function might make the usage valid. */
1490 3814350 : tree base = lookup_base (context_class, qualifying_scope,
1491 : ba_unique, NULL, tf_none);
1492 3814350 : if (base && base != error_mark_node)
1493 : {
1494 3814342 : BASELINK_ACCESS_BINFO (decl) = base;
1495 3814342 : tree decl_binfo
1496 3814342 : = lookup_base (base, BINFO_TYPE (BASELINK_BINFO (decl)),
1497 : ba_unique, NULL, tf_none);
1498 3814342 : if (decl_binfo && decl_binfo != error_mark_node)
1499 3814336 : BASELINK_BINFO (decl) = decl_binfo;
1500 : }
1501 : }
1502 :
1503 12718499 : BASELINK_QUALIFIED_P (decl) = qualified_p;
1504 :
1505 12718499 : return decl;
1506 : }
1507 :
1508 :
1509 : /* Walk the class hierarchy within BINFO, in a depth-first traversal.
1510 : PRE_FN is called in preorder, while POST_FN is called in postorder.
1511 : If PRE_FN returns DFS_SKIP_BASES, child binfos will not be
1512 : walked. If PRE_FN or POST_FN returns a different non-NULL value,
1513 : that value is immediately returned and the walk is terminated. One
1514 : of PRE_FN and POST_FN can be NULL. At each node, PRE_FN and
1515 : POST_FN are passed the binfo to examine and the caller's DATA
1516 : value. All paths are walked, thus virtual and morally virtual
1517 : binfos can be multiply walked. */
1518 :
1519 : tree
1520 8991292714 : dfs_walk_all (tree binfo, tree (*pre_fn) (tree, void *),
1521 : tree (*post_fn) (tree, void *), void *data)
1522 : {
1523 8991292714 : tree rval;
1524 8991292714 : unsigned ix;
1525 8991292714 : tree base_binfo;
1526 :
1527 : /* Call the pre-order walking function. */
1528 8991292714 : if (pre_fn)
1529 : {
1530 8986409259 : rval = pre_fn (binfo, data);
1531 8986409259 : if (rval)
1532 : {
1533 1244050388 : if (rval == dfs_skip_bases)
1534 770410008 : goto skip_bases;
1535 : return rval;
1536 : }
1537 : }
1538 :
1539 : /* Find the next child binfo to walk. */
1540 10141206894 : for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1541 : {
1542 2483883837 : rval = dfs_walk_all (base_binfo, pre_fn, post_fn, data);
1543 2483883837 : if (rval)
1544 : return rval;
1545 : }
1546 :
1547 8427733065 : skip_bases:
1548 : /* Call the post-order walking function. */
1549 8427733065 : if (post_fn)
1550 : {
1551 567354982 : rval = post_fn (binfo, data);
1552 567354982 : gcc_assert (rval != dfs_skip_bases);
1553 : return rval;
1554 : }
1555 :
1556 : return NULL_TREE;
1557 : }
1558 :
1559 : /* Worker for dfs_walk_once. This behaves as dfs_walk_all, except
1560 : that binfos are walked at most once. */
1561 :
1562 : static tree
1563 3709796 : dfs_walk_once_r (tree binfo, tree (*pre_fn) (tree, void *),
1564 : tree (*post_fn) (tree, void *), hash_set<tree> *pset,
1565 : void *data)
1566 : {
1567 3709796 : tree rval;
1568 3709796 : unsigned ix;
1569 3709796 : tree base_binfo;
1570 :
1571 : /* Call the pre-order walking function. */
1572 3709796 : if (pre_fn)
1573 : {
1574 3361772 : rval = pre_fn (binfo, data);
1575 3361772 : if (rval)
1576 : {
1577 739709 : if (rval == dfs_skip_bases)
1578 211791 : goto skip_bases;
1579 :
1580 : return rval;
1581 : }
1582 : }
1583 :
1584 : /* Find the next child binfo to walk. */
1585 5563894 : for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1586 : {
1587 3358966 : if (BINFO_VIRTUAL_P (base_binfo))
1588 1614600 : if (pset->add (base_binfo))
1589 608798 : continue;
1590 :
1591 2750168 : rval = dfs_walk_once_r (base_binfo, pre_fn, post_fn, pset, data);
1592 2750168 : if (rval)
1593 : return rval;
1594 : }
1595 :
1596 2416719 : skip_bases:
1597 : /* Call the post-order walking function. */
1598 2416719 : if (post_fn)
1599 : {
1600 980644 : rval = post_fn (binfo, data);
1601 980644 : gcc_assert (rval != dfs_skip_bases);
1602 : return rval;
1603 : }
1604 :
1605 : return NULL_TREE;
1606 : }
1607 :
1608 : /* Like dfs_walk_all, except that binfos are not multiply walked. For
1609 : non-diamond shaped hierarchies this is the same as dfs_walk_all.
1610 : For diamond shaped hierarchies we must mark the virtual bases, to
1611 : avoid multiple walks. */
1612 :
1613 : tree
1614 1395625421 : dfs_walk_once (tree binfo, tree (*pre_fn) (tree, void *),
1615 : tree (*post_fn) (tree, void *), void *data)
1616 : {
1617 1395625421 : static int active = 0; /* We must not be called recursively. */
1618 1395625421 : tree rval;
1619 :
1620 1395625421 : gcc_assert (pre_fn || post_fn);
1621 1395625421 : gcc_assert (!active);
1622 1395625421 : active++;
1623 :
1624 1395625421 : if (!CLASSTYPE_DIAMOND_SHAPED_P (BINFO_TYPE (binfo)))
1625 : /* We are not diamond shaped, and therefore cannot encounter the
1626 : same binfo twice. */
1627 1394665793 : rval = dfs_walk_all (binfo, pre_fn, post_fn, data);
1628 : else
1629 : {
1630 959628 : hash_set<tree> pset;
1631 959628 : rval = dfs_walk_once_r (binfo, pre_fn, post_fn, &pset, data);
1632 959628 : }
1633 :
1634 1395625421 : active--;
1635 :
1636 1395625421 : return rval;
1637 : }
1638 :
1639 : /* Worker function for dfs_walk_once_accessible. Behaves like
1640 : dfs_walk_once_r, except (a) FRIENDS_P is true if special
1641 : access given by the current context should be considered, (b) ONCE
1642 : indicates whether bases should be marked during traversal. */
1643 :
1644 : static tree
1645 51767987 : dfs_walk_once_accessible_r (tree binfo, bool friends_p, hash_set<tree> *pset,
1646 : tree (*pre_fn) (tree, void *),
1647 : tree (*post_fn) (tree, void *), void *data)
1648 : {
1649 51767987 : tree rval = NULL_TREE;
1650 51767987 : unsigned ix;
1651 51767987 : tree base_binfo;
1652 :
1653 : /* Call the pre-order walking function. */
1654 51767987 : if (pre_fn)
1655 : {
1656 51767987 : rval = pre_fn (binfo, data);
1657 51767987 : if (rval)
1658 : {
1659 46950292 : if (rval == dfs_skip_bases)
1660 46944494 : goto skip_bases;
1661 :
1662 : return rval;
1663 : }
1664 : }
1665 :
1666 : /* Find the next child binfo to walk. */
1667 5370384 : for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1668 : {
1669 4825568 : bool mark = pset && BINFO_VIRTUAL_P (base_binfo);
1670 :
1671 9176 : if (mark && pset->contains (base_binfo))
1672 106 : continue;
1673 :
1674 : /* If the base is inherited via private or protected
1675 : inheritance, then we can't see it, unless we are a friend of
1676 : the current binfo. */
1677 4825462 : if (BINFO_BASE_ACCESS (binfo, ix) != access_public_node)
1678 : {
1679 2020016 : tree scope;
1680 2020016 : if (!friends_p)
1681 574 : continue;
1682 2019442 : scope = current_scope ();
1683 2028788 : if (!scope
1684 2019442 : || TREE_CODE (scope) == NAMESPACE_DECL
1685 4037899 : || !is_friend (BINFO_TYPE (binfo), scope))
1686 9346 : continue;
1687 : }
1688 :
1689 4815542 : if (mark)
1690 1059 : pset->add (base_binfo);
1691 :
1692 4815542 : rval = dfs_walk_once_accessible_r (base_binfo, friends_p, pset,
1693 : pre_fn, post_fn, data);
1694 4815542 : if (rval)
1695 : return rval;
1696 : }
1697 :
1698 47489310 : skip_bases:
1699 : /* Call the post-order walking function. */
1700 47489310 : if (post_fn)
1701 : {
1702 47489038 : rval = post_fn (binfo, data);
1703 47489038 : gcc_assert (rval != dfs_skip_bases);
1704 : return rval;
1705 : }
1706 :
1707 : return NULL_TREE;
1708 : }
1709 :
1710 : /* Like dfs_walk_once except that only accessible bases are walked.
1711 : FRIENDS_P indicates whether friendship of the local context
1712 : should be considered when determining accessibility. */
1713 :
1714 : static tree
1715 46952445 : dfs_walk_once_accessible (tree binfo, bool friends_p,
1716 : tree (*pre_fn) (tree, void *),
1717 : tree (*post_fn) (tree, void *), void *data)
1718 : {
1719 46952445 : hash_set<tree> *pset = NULL;
1720 46952445 : if (CLASSTYPE_DIAMOND_SHAPED_P (BINFO_TYPE (binfo)))
1721 1782 : pset = new hash_set<tree>;
1722 46952445 : tree rval = dfs_walk_once_accessible_r (binfo, friends_p, pset,
1723 : pre_fn, post_fn, data);
1724 :
1725 46952445 : if (pset)
1726 1782 : delete pset;
1727 46952445 : return rval;
1728 : }
1729 :
1730 : /* Return true iff the code of T is CODE, and it has compatible
1731 : type with TYPE. */
1732 :
1733 : static bool
1734 448 : matches_code_and_type_p (tree t, enum tree_code code, tree type)
1735 : {
1736 448 : if (TREE_CODE (t) != code)
1737 : return false;
1738 434 : if (!cxx_types_compatible_p (TREE_TYPE (t), type))
1739 0 : return false;
1740 : return true;
1741 : }
1742 :
1743 : /* Subroutine of direct_accessor_p and reference_accessor_p.
1744 : Determine if COMPONENT_REF is a simple field lookup of this->FIELD_DECL.
1745 : We expect a tree of the form:
1746 : <component_ref:
1747 : <indirect_ref:S>
1748 : <nop_expr:P*
1749 : <parm_decl (this)>
1750 : <field_decl (FIELD_DECL)>>>. */
1751 :
1752 : static bool
1753 203 : field_access_p (tree component_ref, tree field_decl, tree field_type)
1754 : {
1755 203 : if (!matches_code_and_type_p (component_ref, COMPONENT_REF, field_type))
1756 : return false;
1757 :
1758 189 : tree indirect_ref = TREE_OPERAND (component_ref, 0);
1759 189 : if (!INDIRECT_REF_P (indirect_ref))
1760 : return false;
1761 :
1762 189 : tree ptr = STRIP_NOPS (TREE_OPERAND (indirect_ref, 0));
1763 189 : if (!is_object_parameter (ptr))
1764 : return false;
1765 :
1766 : /* Must access the correct field. */
1767 189 : if (TREE_OPERAND (component_ref, 1) != field_decl)
1768 28 : return false;
1769 : return true;
1770 : }
1771 :
1772 : /* Subroutine of field_accessor_p.
1773 :
1774 : Assuming that INIT_EXPR has already had its code and type checked,
1775 : determine if it is a simple accessor for FIELD_DECL
1776 : (of type FIELD_TYPE).
1777 :
1778 : Specifically, a simple accessor within struct S of the form:
1779 : T get_field () { return m_field; }
1780 : should have a constexpr_fn_retval (saved_tree) of the form:
1781 : <init_expr:T
1782 : <result_decl:T
1783 : <nop_expr:T
1784 : <component_ref:
1785 : <indirect_ref:S>
1786 : <nop_expr:P*
1787 : <parm_decl (this)>
1788 : <field_decl (FIELD_DECL)>>>>>. */
1789 :
1790 : static bool
1791 161 : direct_accessor_p (tree init_expr, tree field_decl, tree field_type)
1792 : {
1793 161 : tree result_decl = TREE_OPERAND (init_expr, 0);
1794 161 : if (!matches_code_and_type_p (result_decl, RESULT_DECL, field_type))
1795 : return false;
1796 :
1797 161 : tree component_ref = STRIP_NOPS (TREE_OPERAND (init_expr, 1));
1798 161 : if (!field_access_p (component_ref, field_decl, field_type))
1799 : return false;
1800 :
1801 : return true;
1802 : }
1803 :
1804 : /* Subroutine of field_accessor_p.
1805 :
1806 : Assuming that INIT_EXPR has already had its code and type checked,
1807 : determine if it is a "reference" accessor for FIELD_DECL
1808 : (of type FIELD_REFERENCE_TYPE).
1809 :
1810 : Specifically, a simple accessor within struct S of the form:
1811 : T& get_field () { return m_field; }
1812 : should have a constexpr_fn_retval (saved_tree) of the form:
1813 : <init_expr:T&
1814 : <result_decl:T&
1815 : <nop_expr: T&
1816 : <addr_expr: T*
1817 : <component_ref:T
1818 : <indirect_ref:S
1819 : <nop_expr
1820 : <parm_decl (this)>>
1821 : <field (FIELD_DECL)>>>>>>. */
1822 : static bool
1823 42 : reference_accessor_p (tree init_expr, tree field_decl, tree field_type,
1824 : tree field_reference_type)
1825 : {
1826 42 : tree result_decl = TREE_OPERAND (init_expr, 0);
1827 42 : if (!matches_code_and_type_p (result_decl, RESULT_DECL, field_reference_type))
1828 : return false;
1829 :
1830 42 : tree field_pointer_type = build_pointer_type (field_type);
1831 42 : tree addr_expr = STRIP_NOPS (TREE_OPERAND (init_expr, 1));
1832 42 : if (!matches_code_and_type_p (addr_expr, ADDR_EXPR, field_pointer_type))
1833 : return false;
1834 :
1835 42 : tree component_ref = STRIP_NOPS (TREE_OPERAND (addr_expr, 0));
1836 :
1837 42 : if (!field_access_p (component_ref, field_decl, field_type))
1838 : return false;
1839 :
1840 : return true;
1841 : }
1842 :
1843 : /* Return the class of the `this' or explicit object parameter of FN. */
1844 :
1845 : static tree
1846 61 : class_of_object_parm (const_tree fn)
1847 : {
1848 61 : tree fntype = TREE_TYPE (fn);
1849 61 : if (DECL_XOBJ_MEMBER_FUNCTION_P (fn))
1850 0 : return non_reference (TREE_VALUE (TYPE_ARG_TYPES (fntype)));
1851 61 : return class_of_this_parm (fntype);
1852 : }
1853 :
1854 : /* Return true if FN is an accessor method for FIELD_DECL.
1855 : i.e. a method of the form { return FIELD; }, with no
1856 : conversions.
1857 :
1858 : If CONST_P, then additionally require that FN be a const
1859 : method. */
1860 :
1861 : static bool
1862 2417 : field_accessor_p (tree fn, tree field_decl, bool const_p)
1863 : {
1864 2417 : if (TREE_CODE (fn) != FUNCTION_DECL)
1865 : return false;
1866 :
1867 : /* We don't yet support looking up static data, just fields. */
1868 648 : if (TREE_CODE (field_decl) != FIELD_DECL)
1869 : return false;
1870 :
1871 639 : if (!DECL_OBJECT_MEMBER_FUNCTION_P (fn))
1872 : return false;
1873 :
1874 : /* If the field is accessed via a const "this" argument, verify
1875 : that the "this" parameter is const. */
1876 639 : if (const_p)
1877 : {
1878 61 : tree this_class = class_of_object_parm (fn);
1879 61 : if (!TYPE_READONLY (this_class))
1880 : return false;
1881 : }
1882 :
1883 601 : tree saved_tree = DECL_SAVED_TREE (fn);
1884 :
1885 601 : if (saved_tree == NULL_TREE)
1886 : return false;
1887 :
1888 : /* Attempt to extract a single return value from the function,
1889 : if it has one. */
1890 235 : tree retval = constexpr_fn_retval (saved_tree);
1891 235 : if (retval == NULL_TREE || retval == error_mark_node)
1892 : return false;
1893 : /* Require an INIT_EXPR. */
1894 209 : if (TREE_CODE (retval) != INIT_EXPR)
1895 : return false;
1896 209 : tree init_expr = retval;
1897 :
1898 : /* Determine if this is a simple accessor within struct S of the form:
1899 : T get_field () { return m_field; }. */
1900 209 : tree field_type = TREE_TYPE (field_decl);
1901 209 : if (cxx_types_compatible_p (TREE_TYPE (init_expr), field_type))
1902 161 : return direct_accessor_p (init_expr, field_decl, field_type);
1903 :
1904 : /* Failing that, determine if it is an accessor of the form:
1905 : T& get_field () { return m_field; }. */
1906 48 : tree field_reference_type = cp_build_reference_type (field_type, false);
1907 48 : if (cxx_types_compatible_p (TREE_TYPE (init_expr), field_reference_type))
1908 42 : return reference_accessor_p (init_expr, field_decl, field_type,
1909 42 : field_reference_type);
1910 :
1911 : return false;
1912 : }
1913 :
1914 : /* Callback data for dfs_locate_field_accessor_pre. */
1915 :
1916 : class locate_field_data
1917 : {
1918 : public:
1919 412 : locate_field_data (tree field_decl_, bool const_p_)
1920 412 : : field_decl (field_decl_), const_p (const_p_) {}
1921 :
1922 : tree field_decl;
1923 : bool const_p;
1924 : };
1925 :
1926 : /* Return a FUNCTION_DECL that is an "accessor" method for DATA, a FIELD_DECL,
1927 : callable via binfo, if one exists, otherwise return NULL_TREE.
1928 :
1929 : Callback for dfs_walk_once_accessible for use within
1930 : locate_field_accessor. */
1931 :
1932 : static tree
1933 454 : dfs_locate_field_accessor_pre (tree binfo, void *data)
1934 : {
1935 454 : locate_field_data *lfd = (locate_field_data *)data;
1936 454 : tree type = BINFO_TYPE (binfo);
1937 :
1938 454 : vec<tree, va_gc> *member_vec;
1939 454 : tree fn;
1940 454 : size_t i;
1941 :
1942 454 : if (!CLASS_TYPE_P (type))
1943 : return NULL_TREE;
1944 :
1945 454 : member_vec = CLASSTYPE_MEMBER_VEC (type);
1946 454 : if (!member_vec)
1947 : return NULL_TREE;
1948 :
1949 2594 : for (i = 0; vec_safe_iterate (member_vec, i, &fn); ++i)
1950 2417 : if (fn)
1951 2417 : if (field_accessor_p (fn, lfd->field_decl, lfd->const_p))
1952 : return fn;
1953 :
1954 : return NULL_TREE;
1955 : }
1956 :
1957 : /* Return a FUNCTION_DECL that is an "accessor" method for FIELD_DECL,
1958 : callable via BASETYPE_PATH, if one exists, otherwise return NULL_TREE. */
1959 :
1960 : tree
1961 412 : locate_field_accessor (tree basetype_path, tree field_decl, bool const_p)
1962 : {
1963 412 : if (TREE_CODE (basetype_path) != TREE_BINFO)
1964 : return NULL_TREE;
1965 :
1966 : /* Walk the hierarchy, looking for a method of some base class that allows
1967 : access to the field. */
1968 412 : locate_field_data lfd (field_decl, const_p);
1969 412 : return dfs_walk_once_accessible (basetype_path, /*friends=*/true,
1970 : dfs_locate_field_accessor_pre,
1971 412 : NULL, &lfd);
1972 : }
1973 :
1974 : /* Check throw specifier of OVERRIDER is at least as strict as
1975 : the one of BASEFN. This is due to [except.spec]: "If a virtual function
1976 : has a non-throwing exception specification, all declarations, including
1977 : the definition, of any function that overrides that virtual function in
1978 : any derived class shall have a non-throwing exception specification,
1979 : unless the overriding function is defined as deleted." */
1980 :
1981 : bool
1982 3688539 : maybe_check_overriding_exception_spec (tree overrider, tree basefn)
1983 : {
1984 3688539 : maybe_instantiate_noexcept (basefn);
1985 3688539 : maybe_instantiate_noexcept (overrider);
1986 3688539 : tree base_throw = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (basefn));
1987 3688539 : tree over_throw = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (overrider));
1988 :
1989 3688539 : if (DECL_INVALID_OVERRIDER_P (overrider)
1990 : /* CWG 1351 added the "unless the overriding function is defined as
1991 : deleted" wording. */
1992 3688539 : || DECL_DELETED_FN (overrider))
1993 : return true;
1994 :
1995 : /* Can't check this yet. Pretend this is fine and let
1996 : noexcept_override_late_checks check this later. */
1997 2358793 : if (UNPARSED_NOEXCEPT_SPEC_P (base_throw)
1998 8406214 : || UNPARSED_NOEXCEPT_SPEC_P (over_throw))
1999 : return true;
2000 :
2001 : /* We also have to defer checking when we're in a template and couldn't
2002 : instantiate & evaluate the noexcept to true/false. */
2003 3688524 : if (processing_template_decl)
2004 6 : if ((base_throw
2005 3 : && base_throw != noexcept_true_spec
2006 0 : && base_throw != noexcept_false_spec)
2007 6 : || (over_throw
2008 6 : && over_throw != noexcept_true_spec
2009 6 : && over_throw != noexcept_false_spec))
2010 : return true;
2011 :
2012 3688518 : if (!comp_except_specs (base_throw, over_throw, ce_derived))
2013 : {
2014 41 : auto_diagnostic_group d;
2015 41 : error ("looser exception specification on overriding virtual function "
2016 : "%q+#F", overrider);
2017 41 : inform (DECL_SOURCE_LOCATION (basefn),
2018 : "overridden function is %q#F", basefn);
2019 41 : DECL_INVALID_OVERRIDER_P (overrider) = 1;
2020 41 : return false;
2021 41 : }
2022 : return true;
2023 : }
2024 :
2025 : /* Check that virtual overrider OVERRIDER is acceptable for base function
2026 : BASEFN. Issue diagnostic, and return zero, if unacceptable. */
2027 :
2028 : static int
2029 3688584 : check_final_overrider (tree overrider, tree basefn)
2030 : {
2031 3688584 : tree over_type = TREE_TYPE (overrider);
2032 3688584 : tree base_type = TREE_TYPE (basefn);
2033 3688584 : tree over_return = fndecl_declared_return_type (overrider);
2034 3688584 : tree base_return = fndecl_declared_return_type (basefn);
2035 :
2036 3688584 : int fail = 0;
2037 :
2038 3688584 : if (DECL_INVALID_OVERRIDER_P (overrider))
2039 : return 0;
2040 :
2041 3688578 : if (same_type_p (base_return, over_return))
2042 : /* OK */;
2043 0 : else if ((CLASS_TYPE_P (over_return) && CLASS_TYPE_P (base_return))
2044 307 : || (TREE_CODE (base_return) == TREE_CODE (over_return)
2045 292 : && INDIRECT_TYPE_P (base_return)))
2046 : {
2047 : /* Potentially covariant. */
2048 292 : unsigned base_quals, over_quals;
2049 :
2050 292 : fail = !INDIRECT_TYPE_P (base_return);
2051 292 : if (!fail)
2052 : {
2053 292 : if (cp_type_quals (base_return) != cp_type_quals (over_return))
2054 0 : fail = 1;
2055 :
2056 292 : if (TYPE_REF_P (base_return)
2057 292 : && (TYPE_REF_IS_RVALUE (base_return)
2058 60 : != TYPE_REF_IS_RVALUE (over_return)))
2059 : fail = 1;
2060 :
2061 292 : base_return = TREE_TYPE (base_return);
2062 292 : over_return = TREE_TYPE (over_return);
2063 : }
2064 292 : base_quals = cp_type_quals (base_return);
2065 292 : over_quals = cp_type_quals (over_return);
2066 :
2067 292 : if ((base_quals & over_quals) != over_quals)
2068 3 : fail = 1;
2069 :
2070 292 : if (CLASS_TYPE_P (base_return) && CLASS_TYPE_P (over_return))
2071 : {
2072 : /* Strictly speaking, the standard requires the return type to be
2073 : complete even if it only differs in cv-quals, but that seems
2074 : like a bug in the wording. */
2075 283 : if (!same_type_ignoring_top_level_qualifiers_p (base_return,
2076 : over_return))
2077 : {
2078 273 : tree binfo = lookup_base (over_return, base_return,
2079 : ba_check, NULL, tf_none);
2080 :
2081 273 : if (!binfo || binfo == error_mark_node)
2082 : fail = 1;
2083 : }
2084 : }
2085 9 : else if (can_convert_standard (TREE_TYPE (base_type),
2086 9 : TREE_TYPE (over_type),
2087 : tf_warning_or_error))
2088 : /* GNU extension, allow trivial pointer conversions such as
2089 : converting to void *, or qualification conversion. */
2090 : {
2091 0 : auto_diagnostic_group d;
2092 0 : if (pedwarn (DECL_SOURCE_LOCATION (overrider), 0,
2093 : "invalid covariant return type for %q#D", overrider))
2094 0 : inform (DECL_SOURCE_LOCATION (basefn),
2095 : "overridden function is %q#D", basefn);
2096 0 : }
2097 : else
2098 : fail = 2;
2099 : }
2100 : else
2101 : fail = 2;
2102 268 : if (!fail)
2103 : /* OK */;
2104 : else
2105 : {
2106 45 : auto_diagnostic_group d;
2107 45 : if (fail == 1)
2108 21 : error ("invalid covariant return type for %q+#D", overrider);
2109 : else
2110 24 : error ("conflicting return type specified for %q+#D", overrider);
2111 45 : inform (DECL_SOURCE_LOCATION (basefn),
2112 : "overridden function is %q#D", basefn);
2113 45 : DECL_INVALID_OVERRIDER_P (overrider) = 1;
2114 45 : return 0;
2115 45 : }
2116 :
2117 3688533 : if (!maybe_check_overriding_exception_spec (overrider, basefn))
2118 : return 0;
2119 :
2120 : /* Check for conflicting type attributes. But leave transaction_safe for
2121 : set_one_vmethod_tm_attributes. */
2122 3688492 : if (!comp_type_attributes (over_type, base_type)
2123 63 : && !tx_safe_fn_type_p (base_type)
2124 3688499 : && !tx_safe_fn_type_p (over_type))
2125 : {
2126 0 : auto_diagnostic_group d;
2127 0 : error ("conflicting type attributes specified for %q+#D", overrider);
2128 0 : inform (DECL_SOURCE_LOCATION (basefn),
2129 : "overridden function is %q#D", basefn);
2130 0 : DECL_INVALID_OVERRIDER_P (overrider) = 1;
2131 0 : return 0;
2132 0 : }
2133 :
2134 : /* [class.virtual]/18: A non-immediate virtual function shall not be
2135 : overridden by an immediate virtual function. An immediate virtual
2136 : function shall not be overridden by a non-immediate virtual function. */
2137 7376984 : if ((DECL_IMMEDIATE_FUNCTION_P (basefn)
2138 80 : && !DECL_IMMEDIATE_FUNCTION_P (overrider))
2139 3688525 : || (!DECL_IMMEDIATE_FUNCTION_P (basefn)
2140 7376904 : && DECL_IMMEDIATE_FUNCTION_P (overrider)))
2141 : {
2142 14 : auto_diagnostic_group d;
2143 28 : if (DECL_IMMEDIATE_FUNCTION_P (overrider))
2144 7 : error ("%<consteval%> function %q+D overriding non-%<consteval%> "
2145 : "function", overrider);
2146 : else
2147 7 : error ("non-%<consteval%> function %q+D overriding %<consteval%> "
2148 : "function", overrider);
2149 14 : inform (DECL_SOURCE_LOCATION (basefn),
2150 : "overridden function is %qD", basefn);
2151 14 : DECL_INVALID_OVERRIDER_P (overrider) = 1;
2152 14 : return 0;
2153 14 : }
2154 :
2155 : /* A function declared transaction_safe_dynamic that overrides a function
2156 : declared transaction_safe (but not transaction_safe_dynamic) is
2157 : ill-formed. */
2158 3688478 : if (tx_safe_fn_type_p (base_type)
2159 72 : && lookup_attribute ("transaction_safe_dynamic",
2160 72 : DECL_ATTRIBUTES (overrider))
2161 3688491 : && !lookup_attribute ("transaction_safe_dynamic",
2162 13 : DECL_ATTRIBUTES (basefn)))
2163 : {
2164 1 : auto_diagnostic_group d;
2165 1 : error_at (DECL_SOURCE_LOCATION (overrider),
2166 : "%qD declared %<transaction_safe_dynamic%>", overrider);
2167 1 : inform (DECL_SOURCE_LOCATION (basefn),
2168 : "overriding %qD declared %<transaction_safe%>", basefn);
2169 1 : }
2170 :
2171 3688478 : if (DECL_DELETED_FN (basefn) != DECL_DELETED_FN (overrider))
2172 : {
2173 15 : if (DECL_DELETED_FN (overrider))
2174 : {
2175 12 : auto_diagnostic_group d;
2176 12 : error ("deleted function %q+D overriding non-deleted function",
2177 : overrider);
2178 12 : inform (DECL_SOURCE_LOCATION (basefn),
2179 : "overridden function is %qD", basefn);
2180 12 : maybe_explain_implicit_delete (overrider);
2181 12 : }
2182 : else
2183 : {
2184 3 : auto_diagnostic_group d;
2185 3 : error ("non-deleted function %q+D overriding deleted function",
2186 : overrider);
2187 3 : inform (DECL_SOURCE_LOCATION (basefn),
2188 : "overridden function is %qD", basefn);
2189 3 : }
2190 : return 0;
2191 : }
2192 :
2193 3688463 : if (DECL_FINAL_P (basefn))
2194 : {
2195 6 : auto_diagnostic_group d;
2196 6 : error ("virtual function %q+D overriding final function", overrider);
2197 6 : inform (DECL_SOURCE_LOCATION (basefn),
2198 : "overridden function is %qD", basefn);
2199 6 : return 0;
2200 6 : }
2201 : return 1;
2202 : }
2203 :
2204 : /* Given a class TYPE, and a function decl FNDECL, look for
2205 : virtual functions in TYPE's hierarchy which FNDECL overrides.
2206 : We do not look in TYPE itself, only its bases.
2207 :
2208 : Returns nonzero, if we find any. Set FNDECL's DECL_VIRTUAL_P, if we
2209 : find that it overrides anything.
2210 :
2211 : We check that every function which is overridden, is correctly
2212 : overridden. */
2213 :
2214 : int
2215 18737569 : look_for_overrides (tree type, tree fndecl)
2216 : {
2217 18737569 : tree binfo = TYPE_BINFO (type);
2218 18737569 : tree base_binfo;
2219 18737569 : int ix;
2220 18737569 : int found = 0;
2221 :
2222 : /* A constructor for a class T does not override a function T
2223 : in a base class. */
2224 37475138 : if (DECL_CONSTRUCTOR_P (fndecl))
2225 : return 0;
2226 :
2227 27860523 : for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
2228 : {
2229 9122954 : tree basetype = BINFO_TYPE (base_binfo);
2230 :
2231 9122954 : if (TYPE_POLYMORPHIC_P (basetype))
2232 5515566 : found += look_for_overrides_r (basetype, fndecl);
2233 : }
2234 : return found;
2235 : }
2236 :
2237 : /* Look in TYPE for virtual functions with the same signature as
2238 : FNDECL. */
2239 :
2240 : tree
2241 26554605 : look_for_overrides_here (tree type, tree fndecl)
2242 : {
2243 26554605 : tree ovl = get_class_binding (type, DECL_NAME (fndecl));
2244 :
2245 27434932 : for (ovl_iterator iter (ovl); iter; ++iter)
2246 : {
2247 20481718 : tree fn = *iter;
2248 :
2249 20481718 : if (!DECL_VIRTUAL_P (fn))
2250 : /* Not a virtual. */;
2251 20384470 : else if (DECL_CONTEXT (fn) != type)
2252 : /* Introduced with a using declaration. */;
2253 20384310 : else if (DECL_STATIC_FUNCTION_P (fndecl)
2254 20384310 : || DECL_XOBJ_MEMBER_FUNCTION_P (fndecl))
2255 : {
2256 36 : tree btypes = TYPE_ARG_TYPES (TREE_TYPE (fn));
2257 36 : tree dtypes = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2258 36 : dtypes = DECL_XOBJ_MEMBER_FUNCTION_P (fndecl) ? TREE_CHAIN (dtypes)
2259 : : dtypes;
2260 36 : if (compparms (TREE_CHAIN (btypes), dtypes))
2261 19992004 : return fn;
2262 : }
2263 20384274 : else if (same_signature_p (fndecl, fn))
2264 : return fn;
2265 : }
2266 :
2267 6562601 : return NULL_TREE;
2268 : }
2269 :
2270 : /* Look in TYPE for virtual functions overridden by FNDECL. Check both
2271 : TYPE itself and its bases. */
2272 :
2273 : static int
2274 5515566 : look_for_overrides_r (tree type, tree fndecl)
2275 : {
2276 5515566 : tree fn = look_for_overrides_here (type, fndecl);
2277 5515566 : if (fn)
2278 : {
2279 3688614 : if (DECL_STATIC_FUNCTION_P (fndecl))
2280 : {
2281 : /* A static member function cannot match an inherited
2282 : virtual member function. */
2283 6 : auto_diagnostic_group d;
2284 6 : error ("%q+#D cannot be declared", fndecl);
2285 6 : error (" since %q+#D declared in base class", fn);
2286 6 : }
2287 3688608 : else if (DECL_XOBJ_MEMBER_FUNCTION_P (fndecl))
2288 : {
2289 24 : auto_diagnostic_group d;
2290 24 : error_at (DECL_SOURCE_LOCATION (fndecl),
2291 : "explicit object member function "
2292 : "overrides virtual function");
2293 24 : inform (DECL_SOURCE_LOCATION (fn),
2294 : "virtual function declared here");
2295 24 : }
2296 : else
2297 : {
2298 : /* It's definitely virtual, even if not explicitly set. */
2299 3688584 : DECL_VIRTUAL_P (fndecl) = 1;
2300 3688584 : check_final_overrider (fndecl, fn);
2301 : }
2302 : return 1;
2303 : }
2304 :
2305 : /* We failed to find one declared in this class. Look in its bases. */
2306 1826952 : return look_for_overrides (type, fndecl);
2307 : }
2308 :
2309 : /* Called via dfs_walk from dfs_get_pure_virtuals. */
2310 :
2311 : static tree
2312 5231479 : dfs_get_pure_virtuals (tree binfo, void *data)
2313 : {
2314 5231479 : tree type = (tree) data;
2315 :
2316 : /* We're not interested in primary base classes; the derived class
2317 : of which they are a primary base will contain the information we
2318 : need. */
2319 5231479 : if (!BINFO_PRIMARY_P (binfo))
2320 : {
2321 2521872 : tree virtuals;
2322 :
2323 2521872 : for (virtuals = BINFO_VIRTUALS (binfo);
2324 12559210 : virtuals;
2325 10037338 : virtuals = TREE_CHAIN (virtuals))
2326 10037338 : if (DECL_PURE_VIRTUAL_P (BV_FN (virtuals)))
2327 663518 : vec_safe_push (CLASSTYPE_PURE_VIRTUALS (type), BV_FN (virtuals));
2328 : }
2329 :
2330 5231479 : return NULL_TREE;
2331 : }
2332 :
2333 : /* Set CLASSTYPE_PURE_VIRTUALS for TYPE. */
2334 :
2335 : void
2336 1633736 : get_pure_virtuals (tree type)
2337 : {
2338 : /* Clear the CLASSTYPE_PURE_VIRTUALS list; whatever is already there
2339 : is going to be overridden. */
2340 1633736 : CLASSTYPE_PURE_VIRTUALS (type) = NULL;
2341 : /* Now, run through all the bases which are not primary bases, and
2342 : collect the pure virtual functions. We look at the vtable in
2343 : each class to determine what pure virtual functions are present.
2344 : (A primary base is not interesting because the derived class of
2345 : which it is a primary base will contain vtable entries for the
2346 : pure virtuals in the base class. */
2347 1633736 : dfs_walk_once (TYPE_BINFO (type), NULL, dfs_get_pure_virtuals, type);
2348 1633736 : }
2349 :
2350 : /* Debug info for C++ classes can get very large; try to avoid
2351 : emitting it everywhere.
2352 :
2353 : Note that this optimization wins even when the target supports
2354 : BINCL (if only slightly), and reduces the amount of work for the
2355 : linker. */
2356 :
2357 : void
2358 53609360 : maybe_suppress_debug_info (tree t)
2359 : {
2360 53609360 : if (write_symbols == NO_DEBUG)
2361 : return;
2362 :
2363 : /* We might have set this earlier in cp_finish_decl. */
2364 49731046 : TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 0;
2365 :
2366 : /* Always emit the information for each class every time. */
2367 49731046 : if (flag_emit_class_debug_always)
2368 : return;
2369 :
2370 : /* If we already know how we're handling this class, handle debug info
2371 : the same way. */
2372 49731046 : if (CLASSTYPE_INTERFACE_KNOWN (t))
2373 : {
2374 1 : if (CLASSTYPE_INTERFACE_ONLY (t))
2375 1 : TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
2376 : /* else don't set it. */
2377 : }
2378 : /* If the class has a vtable, write out the debug info along with
2379 : the vtable. */
2380 49731045 : else if (TYPE_CONTAINS_VPTR_P (t))
2381 1732515 : TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
2382 :
2383 : /* Otherwise, just emit the debug info normally. */
2384 : }
2385 :
2386 : /* Note that we want debugging information for a base class of a class
2387 : whose vtable is being emitted. Normally, this would happen because
2388 : calling the constructor for a derived class implies calling the
2389 : constructors for all bases, which involve initializing the
2390 : appropriate vptr with the vtable for the base class; but in the
2391 : presence of optimization, this initialization may be optimized
2392 : away, so we tell finish_vtable_vardecl that we want the debugging
2393 : information anyway. */
2394 :
2395 : static tree
2396 879109 : dfs_debug_mark (tree binfo, void * /*data*/)
2397 : {
2398 879109 : tree t = BINFO_TYPE (binfo);
2399 :
2400 879109 : if (CLASSTYPE_DEBUG_REQUESTED (t))
2401 : return dfs_skip_bases;
2402 :
2403 534977 : CLASSTYPE_DEBUG_REQUESTED (t) = 1;
2404 :
2405 534977 : return NULL_TREE;
2406 : }
2407 :
2408 : /* Write out the debugging information for TYPE, whose vtable is being
2409 : emitted. Also walk through our bases and note that we want to
2410 : write out information for them. This avoids the problem of not
2411 : writing any debug info for intermediate basetypes whose
2412 : constructors, and thus the references to their vtables, and thus
2413 : the vtables themselves, were optimized away. */
2414 :
2415 : void
2416 398813 : note_debug_info_needed (tree type)
2417 : {
2418 398813 : if (TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type)))
2419 : {
2420 351117 : TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type)) = 0;
2421 351117 : rest_of_type_compilation (type, namespace_bindings_p ());
2422 : }
2423 :
2424 398813 : dfs_walk_all (TYPE_BINFO (type), dfs_debug_mark, NULL, 0);
2425 398813 : }
2426 :
2427 : /* Helper for lookup_conversions_r. TO_TYPE is the type converted to
2428 : by a conversion op in base BINFO. VIRTUAL_DEPTH is nonzero if
2429 : BINFO is morally virtual, and VIRTUALNESS is nonzero if virtual
2430 : bases have been encountered already in the tree walk. PARENT_CONVS
2431 : is the list of lists of conversion functions that could hide CONV
2432 : and OTHER_CONVS is the list of lists of conversion functions that
2433 : could hide or be hidden by CONV, should virtualness be involved in
2434 : the hierarchy. Merely checking the conversion op's name is not
2435 : enough because two conversion operators to the same type can have
2436 : different names. Return nonzero if we are visible. */
2437 :
2438 : static int
2439 42335707 : check_hidden_convs (tree binfo, int virtual_depth, int virtualness,
2440 : tree to_type, tree parent_convs, tree other_convs)
2441 : {
2442 42335707 : tree level, probe;
2443 :
2444 : /* See if we are hidden by a parent conversion. */
2445 42339473 : for (level = parent_convs; level; level = TREE_CHAIN (level))
2446 108132 : for (probe = TREE_VALUE (level); probe; probe = TREE_CHAIN (probe))
2447 104366 : if (same_type_p (to_type, TREE_TYPE (probe)))
2448 : return 0;
2449 :
2450 42275737 : if (virtual_depth || virtualness)
2451 : {
2452 : /* In a virtual hierarchy, we could be hidden, or could hide a
2453 : conversion function on the other_convs list. */
2454 131385 : for (level = other_convs; level; level = TREE_CHAIN (level))
2455 : {
2456 1747 : int we_hide_them;
2457 1747 : int they_hide_us;
2458 1747 : tree *prev, other;
2459 :
2460 1747 : if (!(virtual_depth || TREE_STATIC (level)))
2461 : /* Neither is morally virtual, so cannot hide each other. */
2462 0 : continue;
2463 :
2464 1747 : if (!TREE_VALUE (level))
2465 : /* They evaporated away already. */
2466 0 : continue;
2467 :
2468 3494 : they_hide_us = (virtual_depth
2469 1747 : && original_binfo (binfo, TREE_PURPOSE (level)));
2470 6 : we_hide_them = (!they_hide_us && TREE_STATIC (level)
2471 6 : && original_binfo (TREE_PURPOSE (level), binfo));
2472 :
2473 1741 : if (!(we_hide_them || they_hide_us))
2474 : /* Neither is within the other, so no hiding can occur. */
2475 0 : continue;
2476 :
2477 1753 : for (prev = &TREE_VALUE (level), other = *prev; other;)
2478 : {
2479 1747 : if (same_type_p (to_type, TREE_TYPE (other)))
2480 : {
2481 1747 : if (they_hide_us)
2482 : /* We are hidden. */
2483 : return 0;
2484 :
2485 6 : if (we_hide_them)
2486 : {
2487 : /* We hide the other one. */
2488 6 : other = TREE_CHAIN (other);
2489 6 : *prev = other;
2490 6 : continue;
2491 : }
2492 : }
2493 0 : prev = &TREE_CHAIN (other);
2494 0 : other = *prev;
2495 : }
2496 : }
2497 : }
2498 : return 1;
2499 : }
2500 :
2501 : /* Helper for lookup_conversions_r. PARENT_CONVS is a list of lists
2502 : of conversion functions, the first slot will be for the current
2503 : binfo, if MY_CONVS is non-NULL. CHILD_CONVS is the list of lists
2504 : of conversion functions from children of the current binfo,
2505 : concatenated with conversions from elsewhere in the hierarchy --
2506 : that list begins with OTHER_CONVS. Return a single list of lists
2507 : containing only conversions from the current binfo and its
2508 : children. */
2509 :
2510 : static tree
2511 36240224 : split_conversions (tree my_convs, tree parent_convs,
2512 : tree child_convs, tree other_convs)
2513 : {
2514 36240224 : tree t;
2515 36240224 : tree prev;
2516 :
2517 : /* Remove the original other_convs portion from child_convs. */
2518 36240224 : for (prev = NULL, t = child_convs;
2519 37283539 : t != other_convs; prev = t, t = TREE_CHAIN (t))
2520 1043315 : continue;
2521 :
2522 36240224 : if (prev)
2523 1043222 : TREE_CHAIN (prev) = NULL_TREE;
2524 : else
2525 : child_convs = NULL_TREE;
2526 :
2527 : /* Attach the child convs to any we had at this level. */
2528 36240224 : if (my_convs)
2529 : {
2530 35138552 : my_convs = parent_convs;
2531 35138552 : TREE_CHAIN (my_convs) = child_convs;
2532 : }
2533 : else
2534 : my_convs = child_convs;
2535 :
2536 36240224 : return my_convs;
2537 1043315 : }
2538 :
2539 : /* Worker for lookup_conversions. Lookup conversion functions in
2540 : BINFO and its children. VIRTUAL_DEPTH is nonzero, if BINFO is in a
2541 : morally virtual base, and VIRTUALNESS is nonzero, if we've
2542 : encountered virtual bases already in the tree walk. PARENT_CONVS
2543 : is a list of conversions within parent binfos. OTHER_CONVS are
2544 : conversions found elsewhere in the tree. Return the conversions
2545 : found within this portion of the graph in CONVS. Return nonzero if
2546 : we encountered virtualness. We keep template and non-template
2547 : conversions separate, to avoid unnecessary type comparisons.
2548 :
2549 : The located conversion functions are held in lists of lists. The
2550 : TREE_VALUE of the outer list is the list of conversion functions
2551 : found in a particular binfo. The TREE_PURPOSE of both the outer
2552 : and inner lists is the binfo at which those conversions were
2553 : found. TREE_STATIC is set for those lists within of morally
2554 : virtual binfos. The TREE_VALUE of the inner list is the conversion
2555 : function or overload itself. The TREE_TYPE of each inner list node
2556 : is the converted-to type. */
2557 :
2558 : static int
2559 83839397 : lookup_conversions_r (tree binfo, int virtual_depth, int virtualness,
2560 : tree parent_convs, tree other_convs, tree *convs)
2561 : {
2562 83839397 : int my_virtualness = 0;
2563 83839397 : tree my_convs = NULL_TREE;
2564 83839397 : tree child_convs = NULL_TREE;
2565 :
2566 : /* If we have no conversion operators, then don't look. */
2567 83839397 : if (!TYPE_HAS_CONVERSION (BINFO_TYPE (binfo)))
2568 : {
2569 47599173 : *convs = NULL_TREE;
2570 :
2571 47599173 : return 0;
2572 : }
2573 :
2574 36240224 : if (BINFO_VIRTUAL_P (binfo))
2575 131385 : virtual_depth++;
2576 :
2577 : /* First, locate the unhidden ones at this level. */
2578 36240224 : if (tree conv = get_class_binding (BINFO_TYPE (binfo), conv_op_identifier))
2579 88301155 : for (ovl_iterator iter (conv); iter; ++iter)
2580 : {
2581 42335707 : tree fn = *iter;
2582 42335707 : tree type = DECL_CONV_FN_TYPE (fn);
2583 :
2584 42335707 : if (TREE_CODE (fn) != TEMPLATE_DECL && type_uses_auto (type))
2585 : {
2586 3 : mark_used (fn);
2587 3 : type = DECL_CONV_FN_TYPE (fn);
2588 : }
2589 :
2590 42335707 : if (check_hidden_convs (binfo, virtual_depth, virtualness,
2591 : type, parent_convs, other_convs))
2592 : {
2593 42273996 : my_convs = tree_cons (binfo, fn, my_convs);
2594 42273996 : TREE_TYPE (my_convs) = type;
2595 42273996 : if (virtual_depth)
2596 : {
2597 129632 : TREE_STATIC (my_convs) = 1;
2598 129632 : my_virtualness = 1;
2599 : }
2600 : }
2601 : }
2602 :
2603 35198047 : if (my_convs)
2604 : {
2605 35138552 : parent_convs = tree_cons (binfo, my_convs, parent_convs);
2606 35138552 : if (virtual_depth)
2607 129632 : TREE_STATIC (parent_convs) = 1;
2608 : }
2609 :
2610 36240224 : child_convs = other_convs;
2611 :
2612 : /* Now iterate over each base, looking for more conversions. */
2613 36240224 : unsigned i;
2614 36240224 : tree base_binfo;
2615 38415163 : for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
2616 : {
2617 2174939 : tree base_convs;
2618 2174939 : unsigned base_virtualness;
2619 :
2620 2174939 : base_virtualness = lookup_conversions_r (base_binfo,
2621 : virtual_depth, virtualness,
2622 : parent_convs, child_convs,
2623 : &base_convs);
2624 2174939 : if (base_virtualness)
2625 147835 : my_virtualness = virtualness = 1;
2626 2174939 : child_convs = chainon (base_convs, child_convs);
2627 : }
2628 :
2629 36240224 : *convs = split_conversions (my_convs, parent_convs,
2630 : child_convs, other_convs);
2631 :
2632 36240224 : return my_virtualness;
2633 : }
2634 :
2635 : /* Return a TREE_LIST containing all the non-hidden user-defined
2636 : conversion functions for TYPE (and its base-classes). The
2637 : TREE_VALUE of each node is the FUNCTION_DECL of the conversion
2638 : function. The TREE_PURPOSE is the BINFO from which the conversion
2639 : functions in this node were selected. This function is effectively
2640 : performing a set of member lookups as lookup_fnfield does, but
2641 : using the type being converted to as the unique key, rather than the
2642 : field name. */
2643 :
2644 : tree
2645 81664868 : lookup_conversions (tree type)
2646 : {
2647 81664868 : tree convs;
2648 :
2649 81664868 : complete_type (type);
2650 81664868 : if (!CLASS_TYPE_P (type) || !TYPE_BINFO (type))
2651 : return NULL_TREE;
2652 :
2653 81664458 : lookup_conversions_r (TYPE_BINFO (type), 0, 0, NULL_TREE, NULL_TREE, &convs);
2654 :
2655 81664458 : tree list = NULL_TREE;
2656 :
2657 : /* Flatten the list-of-lists */
2658 198467468 : for (; convs; convs = TREE_CHAIN (convs))
2659 : {
2660 35138552 : tree probe, next;
2661 :
2662 77412542 : for (probe = TREE_VALUE (convs); probe; probe = next)
2663 : {
2664 42273990 : next = TREE_CHAIN (probe);
2665 :
2666 42273990 : TREE_CHAIN (probe) = list;
2667 42273990 : list = probe;
2668 : }
2669 : }
2670 :
2671 : return list;
2672 : }
2673 :
2674 : /* Returns the binfo of the first direct or indirect virtual base derived
2675 : from BINFO, or NULL if binfo is not via virtual. */
2676 :
2677 : tree
2678 78 : binfo_from_vbase (tree binfo)
2679 : {
2680 123 : for (; binfo; binfo = BINFO_INHERITANCE_CHAIN (binfo))
2681 : {
2682 123 : if (BINFO_VIRTUAL_P (binfo))
2683 : return binfo;
2684 : }
2685 : return NULL_TREE;
2686 : }
2687 :
2688 : /* Returns the binfo of the first direct or indirect virtual base derived
2689 : from BINFO up to the TREE_TYPE, LIMIT, or NULL if binfo is not
2690 : via virtual. */
2691 :
2692 : tree
2693 475512553 : binfo_via_virtual (tree binfo, tree limit)
2694 : {
2695 475512553 : if (limit && !CLASSTYPE_VBASECLASSES (limit))
2696 : /* LIMIT has no virtual bases, so BINFO cannot be via one. */
2697 : return NULL_TREE;
2698 :
2699 13843779 : for (; binfo && !SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), limit);
2700 1915541 : binfo = BINFO_INHERITANCE_CHAIN (binfo))
2701 : {
2702 4075023 : if (BINFO_VIRTUAL_P (binfo))
2703 : return binfo;
2704 : }
2705 : return NULL_TREE;
2706 : }
2707 :
2708 : /* BINFO is for a base class in some hierarchy. Return true iff it is a
2709 : direct base. */
2710 :
2711 : bool
2712 120089 : binfo_direct_p (tree binfo)
2713 : {
2714 120089 : tree d_binfo = BINFO_INHERITANCE_CHAIN (binfo);
2715 120089 : if (BINFO_INHERITANCE_CHAIN (d_binfo))
2716 : /* A second inheritance chain means indirect. */
2717 : return false;
2718 120083 : if (!BINFO_VIRTUAL_P (binfo))
2719 : /* Non-virtual, so only one inheritance chain means direct. */
2720 : return true;
2721 : /* A virtual base looks like a direct base, so we need to look through the
2722 : direct bases to see if it's there. */
2723 : tree b_binfo;
2724 27 : for (int i = 0; BINFO_BASE_ITERATE (d_binfo, i, b_binfo); ++i)
2725 24 : if (b_binfo == binfo)
2726 : return true;
2727 : return false;
2728 : }
2729 :
2730 : /* BINFO is a base binfo in the complete type BINFO_TYPE (HERE).
2731 : Find the equivalent binfo within whatever graph HERE is located.
2732 : This is the inverse of original_binfo. */
2733 :
2734 : tree
2735 29455610 : copied_binfo (tree binfo, tree here)
2736 : {
2737 29455610 : tree result = NULL_TREE;
2738 :
2739 29455610 : if (BINFO_VIRTUAL_P (binfo))
2740 : {
2741 : tree t;
2742 :
2743 6626922 : for (t = here; BINFO_INHERITANCE_CHAIN (t);
2744 3442512 : t = BINFO_INHERITANCE_CHAIN (t))
2745 3442512 : continue;
2746 :
2747 3184410 : result = binfo_for_vbase (BINFO_TYPE (binfo), BINFO_TYPE (t));
2748 3442512 : }
2749 26271200 : else if (BINFO_INHERITANCE_CHAIN (binfo))
2750 : {
2751 13135600 : tree cbinfo;
2752 13135600 : tree base_binfo;
2753 13135600 : int ix;
2754 :
2755 13135600 : cbinfo = copied_binfo (BINFO_INHERITANCE_CHAIN (binfo), here);
2756 26298358 : for (ix = 0; BINFO_BASE_ITERATE (cbinfo, ix, base_binfo); ix++)
2757 13162758 : if (SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo), BINFO_TYPE (binfo)))
2758 : {
2759 : result = base_binfo;
2760 : break;
2761 : }
2762 : }
2763 : else
2764 : {
2765 13135600 : gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (here), BINFO_TYPE (binfo)));
2766 : result = here;
2767 : }
2768 :
2769 29455610 : gcc_assert (result);
2770 29455610 : return result;
2771 : }
2772 :
2773 : tree
2774 6533894 : binfo_for_vbase (tree base, tree t)
2775 : {
2776 6533894 : unsigned ix;
2777 6533894 : tree binfo;
2778 6533894 : vec<tree, va_gc> *vbases;
2779 :
2780 6533894 : for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0;
2781 67805167 : vec_safe_iterate (vbases, ix, &binfo); ix++)
2782 66257744 : if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), base))
2783 : return binfo;
2784 : return NULL;
2785 : }
2786 :
2787 : /* BINFO is some base binfo of HERE, within some other
2788 : hierarchy. Return the equivalent binfo, but in the hierarchy
2789 : dominated by HERE. This is the inverse of copied_binfo. If BINFO
2790 : is not a base binfo of HERE, returns NULL_TREE. */
2791 :
2792 : tree
2793 1747 : original_binfo (tree binfo, tree here)
2794 : {
2795 1747 : tree result = NULL;
2796 :
2797 1747 : if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (here)))
2798 : result = here;
2799 12 : else if (BINFO_VIRTUAL_P (binfo))
2800 12 : result = (CLASSTYPE_VBASECLASSES (BINFO_TYPE (here))
2801 12 : ? binfo_for_vbase (BINFO_TYPE (binfo), BINFO_TYPE (here))
2802 : : NULL_TREE);
2803 0 : else if (BINFO_INHERITANCE_CHAIN (binfo))
2804 : {
2805 0 : tree base_binfos;
2806 :
2807 0 : base_binfos = original_binfo (BINFO_INHERITANCE_CHAIN (binfo), here);
2808 0 : if (base_binfos)
2809 : {
2810 : int ix;
2811 : tree base_binfo;
2812 :
2813 0 : for (ix = 0; (base_binfo = BINFO_BASE_BINFO (base_binfos, ix)); ix++)
2814 0 : if (SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo),
2815 : BINFO_TYPE (binfo)))
2816 : {
2817 : result = base_binfo;
2818 : break;
2819 : }
2820 : }
2821 : }
2822 :
2823 1747 : return result;
2824 : }
2825 :
2826 : /* True iff TYPE has any dependent bases (and therefore we can't say
2827 : definitively that another class is not a base of an instantiation of
2828 : TYPE). */
2829 :
2830 : bool
2831 170994966 : any_dependent_bases_p (tree type /* = current_nonlambda_class_type () */)
2832 : {
2833 170994966 : if (!type || !CLASS_TYPE_P (type) || !uses_template_parms (type))
2834 : return false;
2835 :
2836 : /* If we haven't set TYPE_BINFO yet, we don't know anything about the bases.
2837 : Return false because in this situation we aren't actually looking up names
2838 : in the scope of the class, so it doesn't matter whether it has dependent
2839 : bases. */
2840 49886828 : if (!TYPE_BINFO (type))
2841 : return false;
2842 :
2843 : unsigned i;
2844 : tree base_binfo;
2845 52143660 : FOR_EACH_VEC_SAFE_ELT (BINFO_BASE_BINFOS (TYPE_BINFO (type)), i, base_binfo)
2846 33984499 : if (BINFO_DEPENDENT_BASE_P (base_binfo)
2847 : /* Recurse to also consider possibly dependent bases of a base that
2848 : is part of the current instantiation. */
2849 33984499 : || any_dependent_bases_p (BINFO_TYPE (base_binfo)))
2850 : return true;
2851 :
2852 : return false;
2853 : }
|
