Branch data Line data Source code
1 : : /* Build expressions with type checking for C++ compiler.
2 : : Copyright (C) 1987-2024 Free Software Foundation, Inc.
3 : : Hacked by Michael Tiemann (tiemann@cygnus.com)
4 : :
5 : : This file is part of GCC.
6 : :
7 : : GCC is free software; you can redistribute it and/or modify
8 : : it under the terms of the GNU General Public License as published by
9 : : the Free Software Foundation; either version 3, or (at your option)
10 : : any later version.
11 : :
12 : : GCC is distributed in the hope that it will be useful,
13 : : but WITHOUT ANY WARRANTY; without even the implied warranty of
14 : : MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 : : GNU General Public License for more details.
16 : :
17 : : You should have received a copy of the GNU General Public License
18 : : along with GCC; see the file COPYING3. If not see
19 : : <http://www.gnu.org/licenses/>. */
20 : :
21 : :
22 : : /* This file is part of the C++ front end.
23 : : It contains routines to build C++ expressions given their operands,
24 : : including computing the types of the result, C and C++ specific error
25 : : checks, and some optimization. */
26 : :
27 : : #include "config.h"
28 : : #include "system.h"
29 : : #include "coretypes.h"
30 : : #include "target.h"
31 : : #include "cp-tree.h"
32 : : #include "stor-layout.h"
33 : : #include "varasm.h"
34 : : #include "intl.h"
35 : : #include "convert.h"
36 : : #include "c-family/c-objc.h"
37 : : #include "c-family/c-ubsan.h"
38 : : #include "c-family/c-type-mismatch.h"
39 : : #include "stringpool.h"
40 : : #include "attribs.h"
41 : : #include "asan.h"
42 : : #include "gimplify.h"
43 : :
44 : : static tree cp_build_addr_expr_strict (tree, tsubst_flags_t);
45 : : static tree cp_build_function_call (tree, tree, tsubst_flags_t);
46 : : static tree pfn_from_ptrmemfunc (tree);
47 : : static tree delta_from_ptrmemfunc (tree);
48 : : static tree convert_for_assignment (tree, tree, impl_conv_rhs, tree, int,
49 : : tsubst_flags_t, int);
50 : : static tree cp_pointer_int_sum (location_t, enum tree_code, tree, tree,
51 : : tsubst_flags_t);
52 : : static tree rationalize_conditional_expr (enum tree_code, tree,
53 : : tsubst_flags_t);
54 : : static bool comp_ptr_ttypes_real (tree, tree, int);
55 : : static bool comp_except_types (tree, tree, bool);
56 : : static bool comp_array_types (const_tree, const_tree, compare_bounds_t, bool);
57 : : static tree pointer_diff (location_t, tree, tree, tree, tsubst_flags_t, tree *);
58 : : static tree get_delta_difference (tree, tree, bool, bool, tsubst_flags_t);
59 : : static void casts_away_constness_r (tree *, tree *, tsubst_flags_t);
60 : : static bool casts_away_constness (tree, tree, tsubst_flags_t);
61 : : static bool maybe_warn_about_returning_address_of_local (tree, location_t = UNKNOWN_LOCATION);
62 : : static void error_args_num (location_t, tree, bool);
63 : : static int convert_arguments (tree, vec<tree, va_gc> **, tree, int,
64 : : tsubst_flags_t);
65 : : static bool is_std_move_p (tree);
66 : : static bool is_std_forward_p (tree);
67 : :
68 : : /* Do `exp = require_complete_type (exp);' to make sure exp
69 : : does not have an incomplete type. (That includes void types.)
70 : : Returns error_mark_node if the VALUE does not have
71 : : complete type when this function returns. */
72 : :
73 : : tree
74 : 99990543 : require_complete_type (tree value,
75 : : tsubst_flags_t complain /* = tf_warning_or_error */)
76 : : {
77 : 99990543 : tree type;
78 : :
79 : 99990543 : if (processing_template_decl || value == error_mark_node)
80 : : return value;
81 : :
82 : 92360871 : if (TREE_CODE (value) == OVERLOAD)
83 : 0 : type = unknown_type_node;
84 : : else
85 : 92360871 : type = TREE_TYPE (value);
86 : :
87 : 92360871 : if (type == error_mark_node)
88 : : return error_mark_node;
89 : :
90 : : /* First, detect a valid value with a complete type. */
91 : 92360859 : if (COMPLETE_TYPE_P (type))
92 : : return value;
93 : :
94 : 99165 : if (complete_type_or_maybe_complain (type, value, complain))
95 : : return value;
96 : : else
97 : 88 : return error_mark_node;
98 : : }
99 : :
100 : : /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
101 : : a template instantiation, do the instantiation. Returns TYPE,
102 : : whether or not it could be completed, unless something goes
103 : : horribly wrong, in which case the error_mark_node is returned. */
104 : :
105 : : tree
106 : 11155313793 : complete_type (tree type)
107 : : {
108 : 11155313793 : if (type == NULL_TREE)
109 : : /* Rather than crash, we return something sure to cause an error
110 : : at some point. */
111 : 0 : return error_mark_node;
112 : :
113 : 11155313793 : if (type == error_mark_node || COMPLETE_TYPE_P (type))
114 : : ;
115 : 3764971350 : else if (TREE_CODE (type) == ARRAY_TYPE)
116 : : {
117 : 570699 : tree t = complete_type (TREE_TYPE (type));
118 : 570699 : unsigned int needs_constructing, has_nontrivial_dtor;
119 : 570699 : if (COMPLETE_TYPE_P (t) && !dependent_type_p (type))
120 : 570565 : layout_type (type);
121 : 570699 : needs_constructing
122 : 570699 : = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t));
123 : 570699 : has_nontrivial_dtor
124 : 570699 : = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t));
125 : 1800514 : for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
126 : : {
127 : 1229815 : TYPE_NEEDS_CONSTRUCTING (t) = needs_constructing;
128 : 1229815 : TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = has_nontrivial_dtor;
129 : : }
130 : : }
131 : 3764400651 : else if (CLASS_TYPE_P (type))
132 : : {
133 : 3690009947 : if (modules_p ())
134 : : /* TYPE could be a class member we've not loaded the definition of. */
135 : 20311912 : lazy_load_pendings (TYPE_NAME (TYPE_MAIN_VARIANT (type)));
136 : :
137 : 3690009947 : if (CLASSTYPE_TEMPLATE_INSTANTIATION (type))
138 : 705798136 : instantiate_class_template (TYPE_MAIN_VARIANT (type));
139 : : }
140 : :
141 : : return type;
142 : : }
143 : :
144 : : /* Like complete_type, but issue an error if the TYPE cannot be completed.
145 : : VALUE is used for informative diagnostics.
146 : : Returns NULL_TREE if the type cannot be made complete. */
147 : :
148 : : tree
149 : 1145091181 : complete_type_or_maybe_complain (tree type, tree value, tsubst_flags_t complain)
150 : : {
151 : 1145091181 : type = complete_type (type);
152 : 1145091178 : if (type == error_mark_node)
153 : : /* We already issued an error. */
154 : : return NULL_TREE;
155 : 1145091031 : else if (!COMPLETE_TYPE_P (type))
156 : : {
157 : 3683 : if (complain & tf_error)
158 : 493 : cxx_incomplete_type_diagnostic (value, type, DK_ERROR);
159 : 3683 : note_failed_type_completion_for_satisfaction (type);
160 : 3683 : return NULL_TREE;
161 : : }
162 : : else
163 : : return type;
164 : : }
165 : :
166 : : tree
167 : 130877517 : complete_type_or_else (tree type, tree value)
168 : : {
169 : 130877517 : return complete_type_or_maybe_complain (type, value, tf_warning_or_error);
170 : : }
171 : :
172 : :
173 : : /* Return the common type of two parameter lists.
174 : : We assume that comptypes has already been done and returned 1;
175 : : if that isn't so, this may crash.
176 : :
177 : : As an optimization, free the space we allocate if the parameter
178 : : lists are already common. */
179 : :
180 : : static tree
181 : 3871021 : commonparms (tree p1, tree p2)
182 : : {
183 : 3871021 : tree oldargs = p1, newargs, n;
184 : 3871021 : int i, len;
185 : 3871021 : int any_change = 0;
186 : :
187 : 3871021 : len = list_length (p1);
188 : 3871021 : newargs = tree_last (p1);
189 : :
190 : 3871021 : if (newargs == void_list_node)
191 : : i = 1;
192 : : else
193 : : {
194 : 37164 : i = 0;
195 : 37164 : newargs = 0;
196 : : }
197 : :
198 : 13039179 : for (; i < len; i++)
199 : 9168158 : newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
200 : :
201 : : n = newargs;
202 : :
203 : 16873036 : for (i = 0; p1;
204 : 13002015 : p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n), i++)
205 : : {
206 : 13002189 : if (TREE_PURPOSE (p1) && !TREE_PURPOSE (p2))
207 : : {
208 : 147 : TREE_PURPOSE (n) = TREE_PURPOSE (p1);
209 : 147 : any_change = 1;
210 : : }
211 : 13001868 : else if (! TREE_PURPOSE (p1))
212 : : {
213 : 13001841 : if (TREE_PURPOSE (p2))
214 : : {
215 : 402282 : TREE_PURPOSE (n) = TREE_PURPOSE (p2);
216 : 402282 : any_change = 1;
217 : : }
218 : : }
219 : : else
220 : : {
221 : 27 : if (simple_cst_equal (TREE_PURPOSE (p1), TREE_PURPOSE (p2)) != 1)
222 : 27 : any_change = 1;
223 : 27 : TREE_PURPOSE (n) = TREE_PURPOSE (p2);
224 : : }
225 : 13002015 : if (TREE_VALUE (p1) != TREE_VALUE (p2))
226 : : {
227 : 3597345 : any_change = 1;
228 : 3597345 : TREE_VALUE (n) = merge_types (TREE_VALUE (p1), TREE_VALUE (p2));
229 : : }
230 : : else
231 : 9404670 : TREE_VALUE (n) = TREE_VALUE (p1);
232 : : }
233 : 3871021 : if (! any_change)
234 : 1326564 : return oldargs;
235 : :
236 : : return newargs;
237 : : }
238 : :
239 : : /* Given a type, perhaps copied for a typedef,
240 : : find the "original" version of it. */
241 : : static tree
242 : 30975226 : original_type (tree t)
243 : : {
244 : 30975226 : int quals = cp_type_quals (t);
245 : 30975226 : while (t != error_mark_node
246 : 32036398 : && TYPE_NAME (t) != NULL_TREE)
247 : : {
248 : 10813840 : tree x = TYPE_NAME (t);
249 : 10813840 : if (TREE_CODE (x) != TYPE_DECL)
250 : : break;
251 : 10813840 : x = DECL_ORIGINAL_TYPE (x);
252 : 10813840 : if (x == NULL_TREE)
253 : : break;
254 : : t = x;
255 : : }
256 : 30975226 : return cp_build_qualified_type (t, quals);
257 : : }
258 : :
259 : : /* Merge the attributes of type OTHER_TYPE into the attributes of type TYPE
260 : : and return a variant of TYPE with the merged attributes. */
261 : :
262 : : static tree
263 : 49666 : merge_type_attributes_from (tree type, tree other_type)
264 : : {
265 : 49666 : tree attrs = targetm.merge_type_attributes (type, other_type);
266 : 49666 : attrs = restrict_type_identity_attributes_to (attrs, TYPE_ATTRIBUTES (type));
267 : 49666 : return cp_build_type_attribute_variant (type, attrs);
268 : : }
269 : :
270 : : /* Compare floating point conversion ranks and subranks of T1 and T2
271 : : types. If T1 and T2 have unordered conversion ranks, return 3.
272 : : If T1 has greater conversion rank than T2, return 2.
273 : : If T2 has greater conversion rank than T1, return -2.
274 : : If T1 has equal conversion rank as T2, return -1, 0 or 1 depending
275 : : on if T1 has smaller, equal or greater conversion subrank than
276 : : T2. */
277 : :
278 : : int
279 : 8501386 : cp_compare_floating_point_conversion_ranks (tree t1, tree t2)
280 : : {
281 : 8501386 : tree mv1 = TYPE_MAIN_VARIANT (t1);
282 : 8501386 : tree mv2 = TYPE_MAIN_VARIANT (t2);
283 : 8501386 : int extended1 = 0;
284 : 8501386 : int extended2 = 0;
285 : :
286 : 8501386 : if (mv1 == mv2)
287 : : return 0;
288 : :
289 : 68004368 : for (int i = 0; i < NUM_FLOATN_NX_TYPES; ++i)
290 : : {
291 : 59503822 : if (mv1 == FLOATN_NX_TYPE_NODE (i))
292 : 3818471 : extended1 = i + 1;
293 : 59503822 : if (mv2 == FLOATN_NX_TYPE_NODE (i))
294 : 3208506 : extended2 = i + 1;
295 : : }
296 : 8500546 : if (mv1 == bfloat16_type_node)
297 : 884209 : extended1 = true;
298 : 8500546 : if (mv2 == bfloat16_type_node)
299 : 728900 : extended2 = true;
300 : 8500546 : if (extended2 && !extended1)
301 : : {
302 : 3766504 : int ret = cp_compare_floating_point_conversion_ranks (t2, t1);
303 : 3766504 : return ret == 3 ? 3 : -ret;
304 : : }
305 : :
306 : 4734042 : const struct real_format *fmt1 = REAL_MODE_FORMAT (TYPE_MODE (t1));
307 : 4734042 : const struct real_format *fmt2 = REAL_MODE_FORMAT (TYPE_MODE (t2));
308 : 4734042 : gcc_assert (fmt1->b == 2 && fmt2->b == 2);
309 : : /* For {ibm,mips}_extended_format formats, the type has variable
310 : : precision up to ~2150 bits when the first double is around maximum
311 : : representable double and second double is subnormal minimum.
312 : : So, e.g. for __ibm128 vs. std::float128_t, they have unordered
313 : : ranks. */
314 : 37872336 : int p1 = (MODE_COMPOSITE_P (TYPE_MODE (t1))
315 : 9468084 : ? fmt1->emax - fmt1->emin + fmt1->p - 1 : fmt1->p);
316 : 37872336 : int p2 = (MODE_COMPOSITE_P (TYPE_MODE (t2))
317 : 9468084 : ? fmt2->emax - fmt2->emin + fmt2->p - 1 : fmt2->p);
318 : : /* The rank of a floating point type T is greater than the rank of
319 : : any floating-point type whose set of values is a proper subset
320 : : of the set of values of T. */
321 : 4734042 : if ((p1 > p2 && fmt1->emax >= fmt2->emax)
322 : 3569882 : || (p1 == p2 && fmt1->emax > fmt2->emax))
323 : : return 2;
324 : 3569882 : if ((p1 < p2 && fmt1->emax <= fmt2->emax)
325 : 1124761 : || (p1 == p2 && fmt1->emax < fmt2->emax))
326 : : return -2;
327 : 1124761 : if ((p1 > p2 && fmt1->emax < fmt2->emax)
328 : 1119126 : || (p1 < p2 && fmt1->emax > fmt2->emax))
329 : : return 3;
330 : 1113491 : if (!extended1 && !extended2)
331 : : {
332 : : /* The rank of long double is greater than the rank of double, which
333 : : is greater than the rank of float. */
334 : 0 : if (t1 == long_double_type_node)
335 : : return 2;
336 : 0 : else if (t2 == long_double_type_node)
337 : : return -2;
338 : 0 : if (t1 == double_type_node)
339 : : return 2;
340 : 0 : else if (t2 == double_type_node)
341 : : return -2;
342 : 0 : if (t1 == float_type_node)
343 : : return 2;
344 : 0 : else if (t2 == float_type_node)
345 : : return -2;
346 : : return 0;
347 : : }
348 : : /* Two extended floating-point types with the same set of values have equal
349 : : ranks. */
350 : 1113491 : if (extended1 && extended2)
351 : : {
352 : 4 : if ((extended1 <= NUM_FLOATN_TYPES) == (extended2 <= NUM_FLOATN_TYPES))
353 : : {
354 : : /* Prefer higher extendedN value. */
355 : 0 : if (extended1 > extended2)
356 : : return 1;
357 : 0 : else if (extended1 < extended2)
358 : : return -1;
359 : : else
360 : : return 0;
361 : : }
362 : 4 : else if (extended1 <= NUM_FLOATN_TYPES)
363 : : /* Prefer _FloatN type over _FloatMx type. */
364 : : return 1;
365 : 2 : else if (extended2 <= NUM_FLOATN_TYPES)
366 : : return -1;
367 : : else
368 : : return 0;
369 : : }
370 : :
371 : : /* gcc_assert (extended1 && !extended2); */
372 : : tree *p;
373 : : int cnt = 0;
374 : 4453948 : for (p = &float_type_node; p <= &long_double_type_node; ++p)
375 : : {
376 : 3340461 : const struct real_format *fmt3 = REAL_MODE_FORMAT (TYPE_MODE (*p));
377 : 3340461 : gcc_assert (fmt3->b == 2);
378 : 26723688 : int p3 = (MODE_COMPOSITE_P (TYPE_MODE (*p))
379 : 6680922 : ? fmt3->emax - fmt3->emin + fmt3->p - 1 : fmt3->p);
380 : 3340461 : if (p1 == p3 && fmt1->emax == fmt3->emax)
381 : 1073235 : ++cnt;
382 : : }
383 : : /* An extended floating-point type with the same set of values
384 : : as exactly one cv-unqualified standard floating-point type
385 : : has a rank equal to the rank of that standard floating-point
386 : : type.
387 : :
388 : : An extended floating-point type with the same set of values
389 : : as more than one cv-unqualified standard floating-point type
390 : : has a rank equal to the rank of double.
391 : :
392 : : Thus, if the latter is true and t2 is long double, t2
393 : : has higher rank. */
394 : 1113487 : if (cnt > 1 && mv2 == long_double_type_node)
395 : : return -2;
396 : : /* And similarly if t2 is float, t2 has lower rank. */
397 : 0 : if (cnt > 1 && mv2 == float_type_node)
398 : : return 2;
399 : : /* Otherwise, they have equal rank, but extended types
400 : : (other than std::bfloat16_t) have higher subrank.
401 : : std::bfloat16_t shouldn't have equal rank to any standard
402 : : floating point type. */
403 : : return 1;
404 : : }
405 : :
406 : : /* Return the common type for two arithmetic types T1 and T2 under the
407 : : usual arithmetic conversions. The default conversions have already
408 : : been applied, and enumerated types converted to their compatible
409 : : integer types. */
410 : :
411 : : static tree
412 : 90109408 : cp_common_type (tree t1, tree t2)
413 : : {
414 : 90109408 : enum tree_code code1 = TREE_CODE (t1);
415 : 90109408 : enum tree_code code2 = TREE_CODE (t2);
416 : 90109408 : tree attributes;
417 : 90109408 : int i;
418 : :
419 : :
420 : : /* In what follows, we slightly generalize the rules given in [expr] so
421 : : as to deal with `long long' and `complex'. First, merge the
422 : : attributes. */
423 : 90109408 : attributes = (*targetm.merge_type_attributes) (t1, t2);
424 : :
425 : 90109408 : if (SCOPED_ENUM_P (t1) || SCOPED_ENUM_P (t2))
426 : : {
427 : 847170 : if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
428 : 847170 : return build_type_attribute_variant (t1, attributes);
429 : : else
430 : : return NULL_TREE;
431 : : }
432 : :
433 : : /* FIXME: Attributes. */
434 : 89262238 : gcc_assert (ARITHMETIC_TYPE_P (t1)
435 : : || VECTOR_TYPE_P (t1)
436 : : || UNSCOPED_ENUM_P (t1));
437 : 89262238 : gcc_assert (ARITHMETIC_TYPE_P (t2)
438 : : || VECTOR_TYPE_P (t2)
439 : : || UNSCOPED_ENUM_P (t2));
440 : :
441 : : /* If one type is complex, form the common type of the non-complex
442 : : components, then make that complex. Use T1 or T2 if it is the
443 : : required type. */
444 : 89262238 : if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
445 : : {
446 : 222295 : tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
447 : 222295 : tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
448 : 222295 : tree subtype
449 : 222295 : = type_after_usual_arithmetic_conversions (subtype1, subtype2);
450 : :
451 : 222295 : if (subtype == error_mark_node)
452 : : return subtype;
453 : 222295 : if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
454 : 188963 : return build_type_attribute_variant (t1, attributes);
455 : 33332 : else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
456 : 33272 : return build_type_attribute_variant (t2, attributes);
457 : : else
458 : 60 : return build_type_attribute_variant (build_complex_type (subtype),
459 : 60 : attributes);
460 : : }
461 : :
462 : 89039943 : if (code1 == VECTOR_TYPE)
463 : : {
464 : : /* When we get here we should have two vectors of the same size.
465 : : Just prefer the unsigned one if present. */
466 : 49666 : if (TYPE_UNSIGNED (t1))
467 : 10913 : return merge_type_attributes_from (t1, t2);
468 : : else
469 : 38753 : return merge_type_attributes_from (t2, t1);
470 : : }
471 : :
472 : : /* If only one is real, use it as the result. */
473 : 88990277 : if (code1 == REAL_TYPE && code2 != REAL_TYPE)
474 : 1058397 : return build_type_attribute_variant (t1, attributes);
475 : 87931880 : if (code2 == REAL_TYPE && code1 != REAL_TYPE)
476 : 996710 : return build_type_attribute_variant (t2, attributes);
477 : :
478 : 86935170 : if (code1 == REAL_TYPE
479 : 86935170 : && (extended_float_type_p (t1) || extended_float_type_p (t2)))
480 : : {
481 : 162438 : tree mv1 = TYPE_MAIN_VARIANT (t1);
482 : 162438 : tree mv2 = TYPE_MAIN_VARIANT (t2);
483 : 162438 : if (mv1 == mv2)
484 : 159334 : return build_type_attribute_variant (t1, attributes);
485 : :
486 : 3104 : int cmpret = cp_compare_floating_point_conversion_ranks (mv1, mv2);
487 : 3104 : if (cmpret == 3)
488 : 0 : return error_mark_node;
489 : 3104 : else if (cmpret >= 0)
490 : 2842 : return build_type_attribute_variant (t1, attributes);
491 : : else
492 : 262 : return build_type_attribute_variant (t2, attributes);
493 : : }
494 : :
495 : : /* Both real or both integers; use the one with greater precision. */
496 : 86772732 : if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
497 : 12208347 : return build_type_attribute_variant (t1, attributes);
498 : 74564385 : else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
499 : 1427530 : return build_type_attribute_variant (t2, attributes);
500 : :
501 : : /* The types are the same; no need to do anything fancy. */
502 : 73136855 : if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
503 : 67387458 : return build_type_attribute_variant (t1, attributes);
504 : :
505 : 5749397 : if (code1 != REAL_TYPE)
506 : : {
507 : : /* If one is unsigned long long, then convert the other to unsigned
508 : : long long. */
509 : 5749394 : if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node)
510 : 5749394 : || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node))
511 : 127205 : return build_type_attribute_variant (long_long_unsigned_type_node,
512 : 127205 : attributes);
513 : : /* If one is a long long, and the other is an unsigned long, and
514 : : long long can represent all the values of an unsigned long, then
515 : : convert to a long long. Otherwise, convert to an unsigned long
516 : : long. Otherwise, if either operand is long long, convert the
517 : : other to long long.
518 : :
519 : : Since we're here, we know the TYPE_PRECISION is the same;
520 : : therefore converting to long long cannot represent all the values
521 : : of an unsigned long, so we choose unsigned long long in that
522 : : case. */
523 : 5622189 : if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node)
524 : 5622189 : || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node))
525 : : {
526 : 603 : tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
527 : 603 : ? long_long_unsigned_type_node
528 : 305 : : long_long_integer_type_node);
529 : 305 : return build_type_attribute_variant (t, attributes);
530 : : }
531 : :
532 : : /* Go through the same procedure, but for longs. */
533 : 5621884 : if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node)
534 : 5621884 : || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node))
535 : 723847 : return build_type_attribute_variant (long_unsigned_type_node,
536 : 723847 : attributes);
537 : 4898037 : if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node)
538 : 4898037 : || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node))
539 : : {
540 : 71221 : tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
541 : 71221 : ? long_unsigned_type_node : long_integer_type_node);
542 : 35940 : return build_type_attribute_variant (t, attributes);
543 : : }
544 : :
545 : : /* For __intN types, either the type is __int128 (and is lower
546 : : priority than the types checked above, but higher than other
547 : : 128-bit types) or it's known to not be the same size as other
548 : : types (enforced in toplev.cc). Prefer the unsigned type. */
549 : 9724152 : for (i = 0; i < NUM_INT_N_ENTS; i ++)
550 : : {
551 : 4862097 : if (int_n_enabled_p [i]
552 : 4862097 : && (same_type_p (TYPE_MAIN_VARIANT (t1), int_n_trees[i].signed_type)
553 : 4784785 : || same_type_p (TYPE_MAIN_VARIANT (t2), int_n_trees[i].signed_type)
554 : 4784773 : || same_type_p (TYPE_MAIN_VARIANT (t1), int_n_trees[i].unsigned_type)
555 : 4784773 : || same_type_p (TYPE_MAIN_VARIANT (t2), int_n_trees[i].unsigned_type)))
556 : : {
557 : 72 : tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
558 : 72 : ? int_n_trees[i].unsigned_type
559 : 42 : : int_n_trees[i].signed_type);
560 : 42 : return build_type_attribute_variant (t, attributes);
561 : : }
562 : : }
563 : :
564 : : /* Otherwise prefer the unsigned one. */
565 : 4862055 : if (TYPE_UNSIGNED (t1))
566 : 3880498 : return build_type_attribute_variant (t1, attributes);
567 : : else
568 : 981557 : return build_type_attribute_variant (t2, attributes);
569 : : }
570 : : else
571 : : {
572 : 3 : if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node)
573 : 3 : || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node))
574 : 0 : return build_type_attribute_variant (long_double_type_node,
575 : 0 : attributes);
576 : 3 : if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node)
577 : 3 : || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node))
578 : 3 : return build_type_attribute_variant (double_type_node,
579 : 3 : attributes);
580 : 0 : if (same_type_p (TYPE_MAIN_VARIANT (t1), float_type_node)
581 : 0 : || same_type_p (TYPE_MAIN_VARIANT (t2), float_type_node))
582 : 0 : return build_type_attribute_variant (float_type_node,
583 : 0 : attributes);
584 : :
585 : : /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
586 : : the standard C++ floating-point types. Logic earlier in this
587 : : function has already eliminated the possibility that
588 : : TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
589 : : compelling reason to choose one or the other. */
590 : 0 : return build_type_attribute_variant (t1, attributes);
591 : : }
592 : : }
593 : :
594 : : /* T1 and T2 are arithmetic or enumeration types. Return the type
595 : : that will result from the "usual arithmetic conversions" on T1 and
596 : : T2 as described in [expr]. */
597 : :
598 : : tree
599 : 898085 : type_after_usual_arithmetic_conversions (tree t1, tree t2)
600 : : {
601 : 898085 : gcc_assert (ARITHMETIC_TYPE_P (t1)
602 : : || VECTOR_TYPE_P (t1)
603 : : || UNSCOPED_ENUM_P (t1));
604 : 898085 : gcc_assert (ARITHMETIC_TYPE_P (t2)
605 : : || VECTOR_TYPE_P (t2)
606 : : || UNSCOPED_ENUM_P (t2));
607 : :
608 : : /* Perform the integral promotions. We do not promote real types here. */
609 : 898085 : if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1)
610 : 675390 : && INTEGRAL_OR_ENUMERATION_TYPE_P (t2))
611 : : {
612 : 675076 : t1 = type_promotes_to (t1);
613 : 675076 : t2 = type_promotes_to (t2);
614 : : }
615 : :
616 : 898085 : return cp_common_type (t1, t2);
617 : : }
618 : :
619 : : static void
620 : 42 : composite_pointer_error (const op_location_t &location,
621 : : diagnostic_t kind, tree t1, tree t2,
622 : : composite_pointer_operation operation)
623 : : {
624 : 42 : switch (operation)
625 : : {
626 : 33 : case CPO_COMPARISON:
627 : 33 : emit_diagnostic (kind, location, 0,
628 : : "comparison between "
629 : : "distinct pointer types %qT and %qT lacks a cast",
630 : : t1, t2);
631 : 33 : break;
632 : 0 : case CPO_CONVERSION:
633 : 0 : emit_diagnostic (kind, location, 0,
634 : : "conversion between "
635 : : "distinct pointer types %qT and %qT lacks a cast",
636 : : t1, t2);
637 : 0 : break;
638 : 9 : case CPO_CONDITIONAL_EXPR:
639 : 9 : emit_diagnostic (kind, location, 0,
640 : : "conditional expression between "
641 : : "distinct pointer types %qT and %qT lacks a cast",
642 : : t1, t2);
643 : 9 : break;
644 : 0 : default:
645 : 0 : gcc_unreachable ();
646 : : }
647 : 42 : }
648 : :
649 : : /* Subroutine of composite_pointer_type to implement the recursive
650 : : case. See that function for documentation of the parameters. And ADD_CONST
651 : : is used to track adding "const" where needed. */
652 : :
653 : : static tree
654 : 3327625 : composite_pointer_type_r (const op_location_t &location,
655 : : tree t1, tree t2, bool *add_const,
656 : : composite_pointer_operation operation,
657 : : tsubst_flags_t complain)
658 : : {
659 : 3327625 : tree pointee1;
660 : 3327625 : tree pointee2;
661 : 3327625 : tree result_type;
662 : 3327625 : tree attributes;
663 : :
664 : : /* Determine the types pointed to by T1 and T2. */
665 : 3327625 : if (TYPE_PTR_P (t1))
666 : : {
667 : 3327162 : pointee1 = TREE_TYPE (t1);
668 : 3327162 : pointee2 = TREE_TYPE (t2);
669 : : }
670 : : else
671 : : {
672 : 463 : pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1);
673 : 463 : pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2);
674 : : }
675 : :
676 : : /* [expr.type]
677 : :
678 : : If T1 and T2 are similar types, the result is the cv-combined type of
679 : : T1 and T2. */
680 : 3327625 : if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2))
681 : : result_type = pointee1;
682 : 33 : else if ((TYPE_PTR_P (pointee1) && TYPE_PTR_P (pointee2))
683 : 150 : || (TYPE_PTRMEM_P (pointee1) && TYPE_PTRMEM_P (pointee2)))
684 : : {
685 : 33 : result_type = composite_pointer_type_r (location, pointee1, pointee2,
686 : : add_const, operation, complain);
687 : 33 : if (result_type == error_mark_node)
688 : : return error_mark_node;
689 : : }
690 : : else
691 : : {
692 : 117 : if (complain & tf_error)
693 : 30 : composite_pointer_error (location, DK_PERMERROR,
694 : : t1, t2, operation);
695 : : else
696 : 87 : return error_mark_node;
697 : 30 : result_type = void_type_node;
698 : : }
699 : 3327532 : const int q1 = cp_type_quals (pointee1);
700 : 3327532 : const int q2 = cp_type_quals (pointee2);
701 : 3327532 : const int quals = q1 | q2;
702 : 3327532 : result_type = cp_build_qualified_type (result_type,
703 : 3327532 : (quals | (*add_const
704 : 3327532 : ? TYPE_QUAL_CONST
705 : : : TYPE_UNQUALIFIED)));
706 : : /* The cv-combined type can add "const" as per [conv.qual]/3.3 (except for
707 : : the TLQ). The reason is that both T1 and T2 can then be converted to the
708 : : cv-combined type of T1 and T2. */
709 : 3327532 : if (quals != q1 || quals != q2)
710 : 519194 : *add_const = true;
711 : : /* If the original types were pointers to members, so is the
712 : : result. */
713 : 3327532 : if (TYPE_PTRMEM_P (t1))
714 : : {
715 : 453 : if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
716 : : TYPE_PTRMEM_CLASS_TYPE (t2)))
717 : : {
718 : 0 : if (complain & tf_error)
719 : 0 : composite_pointer_error (location, DK_PERMERROR,
720 : : t1, t2, operation);
721 : : else
722 : 0 : return error_mark_node;
723 : : }
724 : 453 : result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
725 : : result_type);
726 : : }
727 : : else
728 : 3327079 : result_type = build_pointer_type (result_type);
729 : :
730 : : /* Merge the attributes. */
731 : 3327532 : attributes = (*targetm.merge_type_attributes) (t1, t2);
732 : 3327532 : return build_type_attribute_variant (result_type, attributes);
733 : : }
734 : :
735 : : /* Return the composite pointer type (see [expr.type]) for T1 and T2.
736 : : ARG1 and ARG2 are the values with those types. The OPERATION is to
737 : : describe the operation between the pointer types,
738 : : in case an error occurs.
739 : :
740 : : This routine also implements the computation of a common type for
741 : : pointers-to-members as per [expr.eq]. */
742 : :
743 : : tree
744 : 3501452 : composite_pointer_type (const op_location_t &location,
745 : : tree t1, tree t2, tree arg1, tree arg2,
746 : : composite_pointer_operation operation,
747 : : tsubst_flags_t complain)
748 : : {
749 : 3501452 : tree class1;
750 : 3501452 : tree class2;
751 : :
752 : : /* [expr.type]
753 : :
754 : : If one operand is a null pointer constant, the composite pointer
755 : : type is the type of the other operand. */
756 : 3501452 : if (null_ptr_cst_p (arg1))
757 : : return t2;
758 : 3501291 : if (null_ptr_cst_p (arg2))
759 : : return t1;
760 : :
761 : : /* We have:
762 : :
763 : : [expr.type]
764 : :
765 : : If one of the operands has type "pointer to cv1 void", then
766 : : the other has type "pointer to cv2 T", and the composite pointer
767 : : type is "pointer to cv12 void", where cv12 is the union of cv1
768 : : and cv2.
769 : :
770 : : If either type is a pointer to void, make sure it is T1. */
771 : 3488980 : if (TYPE_PTR_P (t2) && VOID_TYPE_P (TREE_TYPE (t2)))
772 : : std::swap (t1, t2);
773 : :
774 : : /* Now, if T1 is a pointer to void, merge the qualifiers. */
775 : 3488980 : if (TYPE_PTR_P (t1) && VOID_TYPE_P (TREE_TYPE (t1)))
776 : : {
777 : 161223 : tree attributes;
778 : 161223 : tree result_type;
779 : :
780 : 161223 : if (TYPE_PTRFN_P (t2))
781 : : {
782 : 10 : if (complain & tf_error)
783 : : {
784 : 9 : switch (operation)
785 : : {
786 : 9 : case CPO_COMPARISON:
787 : 9 : pedwarn (location, OPT_Wpedantic,
788 : : "ISO C++ forbids comparison between pointer "
789 : : "of type %<void *%> and pointer-to-function");
790 : 9 : break;
791 : 0 : case CPO_CONVERSION:
792 : 0 : pedwarn (location, OPT_Wpedantic,
793 : : "ISO C++ forbids conversion between pointer "
794 : : "of type %<void *%> and pointer-to-function");
795 : 0 : break;
796 : 0 : case CPO_CONDITIONAL_EXPR:
797 : 0 : pedwarn (location, OPT_Wpedantic,
798 : : "ISO C++ forbids conditional expression between "
799 : : "pointer of type %<void *%> and "
800 : : "pointer-to-function");
801 : 0 : break;
802 : 0 : default:
803 : 0 : gcc_unreachable ();
804 : : }
805 : : }
806 : : else
807 : 1 : return error_mark_node;
808 : : }
809 : 161222 : result_type
810 : 161222 : = cp_build_qualified_type (void_type_node,
811 : 161222 : (cp_type_quals (TREE_TYPE (t1))
812 : 161222 : | cp_type_quals (TREE_TYPE (t2))));
813 : 161222 : result_type = build_pointer_type (result_type);
814 : : /* Merge the attributes. */
815 : 161222 : attributes = (*targetm.merge_type_attributes) (t1, t2);
816 : 161222 : return build_type_attribute_variant (result_type, attributes);
817 : : }
818 : :
819 : 3327757 : if (c_dialect_objc () && TYPE_PTR_P (t1)
820 : 0 : && TYPE_PTR_P (t2))
821 : : {
822 : 0 : if (objc_have_common_type (t1, t2, -3, NULL_TREE))
823 : 0 : return objc_common_type (t1, t2);
824 : : }
825 : :
826 : : /* if T1 or T2 is "pointer to noexcept function" and the other type is
827 : : "pointer to function", where the function types are otherwise the same,
828 : : "pointer to function" */
829 : 3327757 : if (fnptr_conv_p (t1, t2))
830 : : return t1;
831 : 3327689 : if (fnptr_conv_p (t2, t1))
832 : : return t2;
833 : :
834 : : /* [expr.eq] permits the application of a pointer conversion to
835 : : bring the pointers to a common type. */
836 : 3327147 : if (TYPE_PTR_P (t1) && TYPE_PTR_P (t2)
837 : 3327147 : && CLASS_TYPE_P (TREE_TYPE (t1))
838 : 545499 : && CLASS_TYPE_P (TREE_TYPE (t2))
839 : 3873121 : && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1),
840 : 545496 : TREE_TYPE (t2)))
841 : : {
842 : 29987 : class1 = TREE_TYPE (t1);
843 : 29987 : class2 = TREE_TYPE (t2);
844 : :
845 : 29987 : if (DERIVED_FROM_P (class1, class2))
846 : 2916 : t2 = (build_pointer_type
847 : 1458 : (cp_build_qualified_type (class1, cp_type_quals (class2))));
848 : 28529 : else if (DERIVED_FROM_P (class2, class1))
849 : 57022 : t1 = (build_pointer_type
850 : 28511 : (cp_build_qualified_type (class2, cp_type_quals (class1))));
851 : : else
852 : : {
853 : 18 : if (complain & tf_error)
854 : 12 : composite_pointer_error (location, DK_ERROR, t1, t2, operation);
855 : 18 : return error_mark_node;
856 : : }
857 : : }
858 : : /* [expr.eq] permits the application of a pointer-to-member
859 : : conversion to change the class type of one of the types. */
860 : 3297252 : else if (TYPE_PTRMEM_P (t1)
861 : 3297730 : && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
862 : : TYPE_PTRMEM_CLASS_TYPE (t2)))
863 : : {
864 : 46 : class1 = TYPE_PTRMEM_CLASS_TYPE (t1);
865 : 46 : class2 = TYPE_PTRMEM_CLASS_TYPE (t2);
866 : :
867 : 46 : if (DERIVED_FROM_P (class1, class2))
868 : 21 : t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1));
869 : 25 : else if (DERIVED_FROM_P (class2, class1))
870 : 10 : t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2));
871 : : else
872 : : {
873 : 15 : if (complain & tf_error)
874 : 3 : switch (operation)
875 : : {
876 : 3 : case CPO_COMPARISON:
877 : 3 : error_at (location, "comparison between distinct "
878 : : "pointer-to-member types %qT and %qT lacks a cast",
879 : : t1, t2);
880 : 3 : break;
881 : 0 : case CPO_CONVERSION:
882 : 0 : error_at (location, "conversion between distinct "
883 : : "pointer-to-member types %qT and %qT lacks a cast",
884 : : t1, t2);
885 : 0 : break;
886 : 0 : case CPO_CONDITIONAL_EXPR:
887 : 0 : error_at (location, "conditional expression between distinct "
888 : : "pointer-to-member types %qT and %qT lacks a cast",
889 : : t1, t2);
890 : 0 : break;
891 : 0 : default:
892 : 0 : gcc_unreachable ();
893 : : }
894 : 15 : return error_mark_node;
895 : : }
896 : : }
897 : :
898 : 3327592 : bool add_const = false;
899 : 3327592 : return composite_pointer_type_r (location, t1, t2, &add_const, operation,
900 : 3327592 : complain);
901 : : }
902 : :
903 : : /* Return the merged type of two types.
904 : : We assume that comptypes has already been done and returned 1;
905 : : if that isn't so, this may crash.
906 : :
907 : : This just combines attributes and default arguments; any other
908 : : differences would cause the two types to compare unalike. */
909 : :
910 : : tree
911 : 27351314 : merge_types (tree t1, tree t2)
912 : : {
913 : 27351314 : enum tree_code code1;
914 : 27351314 : enum tree_code code2;
915 : 27351314 : tree attributes;
916 : :
917 : : /* Save time if the two types are the same. */
918 : 27351314 : if (t1 == t2)
919 : : return t1;
920 : 15487613 : if (original_type (t1) == original_type (t2))
921 : : return t1;
922 : :
923 : : /* If one type is nonsense, use the other. */
924 : 15429057 : if (t1 == error_mark_node)
925 : : return t2;
926 : 15429057 : if (t2 == error_mark_node)
927 : : return t1;
928 : :
929 : : /* Handle merging an auto redeclaration with a previous deduced
930 : : return type. */
931 : 15429057 : if (is_auto (t1))
932 : : return t2;
933 : :
934 : : /* Merge the attributes. */
935 : 15419663 : attributes = (*targetm.merge_type_attributes) (t1, t2);
936 : :
937 : 15419663 : if (TYPE_PTRMEMFUNC_P (t1))
938 : 15 : t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
939 : 15419663 : if (TYPE_PTRMEMFUNC_P (t2))
940 : 15 : t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
941 : :
942 : 15419663 : code1 = TREE_CODE (t1);
943 : 15419663 : code2 = TREE_CODE (t2);
944 : 15419663 : if (code1 != code2)
945 : : {
946 : 0 : gcc_assert (code1 == TYPENAME_TYPE || code2 == TYPENAME_TYPE);
947 : 0 : if (code1 == TYPENAME_TYPE)
948 : : {
949 : 0 : t1 = resolve_typename_type (t1, /*only_current_p=*/true);
950 : 0 : code1 = TREE_CODE (t1);
951 : : }
952 : : else
953 : : {
954 : 0 : t2 = resolve_typename_type (t2, /*only_current_p=*/true);
955 : 0 : code2 = TREE_CODE (t2);
956 : : }
957 : : }
958 : :
959 : 15419663 : switch (code1)
960 : : {
961 : 2621129 : case POINTER_TYPE:
962 : 2621129 : case REFERENCE_TYPE:
963 : : /* For two pointers, do this recursively on the target type. */
964 : 2621129 : {
965 : 2621129 : tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
966 : 2621129 : int quals = cp_type_quals (t1);
967 : :
968 : 2621129 : if (code1 == POINTER_TYPE)
969 : : {
970 : 691716 : t1 = build_pointer_type (target);
971 : 691716 : if (TREE_CODE (target) == METHOD_TYPE)
972 : 15 : t1 = build_ptrmemfunc_type (t1);
973 : : }
974 : : else
975 : 1929413 : t1 = cp_build_reference_type (target, TYPE_REF_IS_RVALUE (t1));
976 : 2621129 : t1 = build_type_attribute_variant (t1, attributes);
977 : 2621129 : t1 = cp_build_qualified_type (t1, quals);
978 : :
979 : 2621129 : return t1;
980 : : }
981 : :
982 : 12 : case OFFSET_TYPE:
983 : 12 : {
984 : 12 : int quals;
985 : 12 : tree pointee;
986 : 12 : quals = cp_type_quals (t1);
987 : 12 : pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1),
988 : 12 : TYPE_PTRMEM_POINTED_TO_TYPE (t2));
989 : 12 : t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
990 : : pointee);
991 : 12 : t1 = cp_build_qualified_type (t1, quals);
992 : 12 : break;
993 : : }
994 : :
995 : 10417 : case ARRAY_TYPE:
996 : 10417 : {
997 : 10417 : tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
998 : : /* Save space: see if the result is identical to one of the args. */
999 : 20834 : if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
1000 : 10395 : return build_type_attribute_variant (t1, attributes);
1001 : 38 : if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
1002 : 16 : return build_type_attribute_variant (t2, attributes);
1003 : : /* Merge the element types, and have a size if either arg has one. */
1004 : 6 : t1 = build_cplus_array_type
1005 : 6 : (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
1006 : 6 : break;
1007 : : }
1008 : :
1009 : 4011162 : case FUNCTION_TYPE:
1010 : : /* Function types: prefer the one that specified arg types.
1011 : : If both do, merge the arg types. Also merge the return types. */
1012 : 4011162 : {
1013 : 4011162 : tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
1014 : 4011162 : tree p1 = TYPE_ARG_TYPES (t1);
1015 : 4011162 : tree p2 = TYPE_ARG_TYPES (t2);
1016 : 4011162 : tree parms;
1017 : :
1018 : : /* Save space: see if the result is identical to one of the args. */
1019 : 4011162 : if (valtype == TREE_TYPE (t1) && ! p2)
1020 : 0 : return cp_build_type_attribute_variant (t1, attributes);
1021 : 4011162 : if (valtype == TREE_TYPE (t2) && ! p1)
1022 : 0 : return cp_build_type_attribute_variant (t2, attributes);
1023 : :
1024 : : /* Simple way if one arg fails to specify argument types. */
1025 : 8022324 : if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
1026 : : parms = p2;
1027 : 7742042 : else if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
1028 : : parms = p1;
1029 : : else
1030 : 3871021 : parms = commonparms (p1, p2);
1031 : :
1032 : 4011162 : cp_cv_quals quals = type_memfn_quals (t1);
1033 : 4011162 : cp_ref_qualifier rqual = type_memfn_rqual (t1);
1034 : 4011162 : gcc_assert (quals == type_memfn_quals (t2));
1035 : 4011162 : gcc_assert (rqual == type_memfn_rqual (t2));
1036 : :
1037 : 4011162 : tree rval = build_function_type (valtype, parms);
1038 : 4011162 : rval = apply_memfn_quals (rval, quals);
1039 : 4011162 : tree raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
1040 : 4011162 : TYPE_RAISES_EXCEPTIONS (t2));
1041 : 4011162 : bool late_return_type_p = TYPE_HAS_LATE_RETURN_TYPE (t1);
1042 : 4011162 : t1 = build_cp_fntype_variant (rval, rqual, raises, late_return_type_p);
1043 : 4011162 : break;
1044 : : }
1045 : :
1046 : 3786352 : case METHOD_TYPE:
1047 : 3786352 : {
1048 : : /* Get this value the long way, since TYPE_METHOD_BASETYPE
1049 : : is just the main variant of this. */
1050 : 3786352 : tree basetype = class_of_this_parm (t2);
1051 : 3786352 : tree raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
1052 : 3786352 : TYPE_RAISES_EXCEPTIONS (t2));
1053 : 3786352 : cp_ref_qualifier rqual = type_memfn_rqual (t1);
1054 : 3786352 : tree t3;
1055 : 3786352 : bool late_return_type_1_p = TYPE_HAS_LATE_RETURN_TYPE (t1);
1056 : :
1057 : : /* If this was a member function type, get back to the
1058 : : original type of type member function (i.e., without
1059 : : the class instance variable up front. */
1060 : 3786352 : t1 = build_function_type (TREE_TYPE (t1),
1061 : 3786352 : TREE_CHAIN (TYPE_ARG_TYPES (t1)));
1062 : 3786352 : t2 = build_function_type (TREE_TYPE (t2),
1063 : 3786352 : TREE_CHAIN (TYPE_ARG_TYPES (t2)));
1064 : 3786352 : t3 = merge_types (t1, t2);
1065 : 3786352 : t3 = build_method_type_directly (basetype, TREE_TYPE (t3),
1066 : 3786352 : TYPE_ARG_TYPES (t3));
1067 : 3786352 : t1 = build_cp_fntype_variant (t3, rqual, raises, late_return_type_1_p);
1068 : 3786352 : break;
1069 : : }
1070 : :
1071 : : case TYPENAME_TYPE:
1072 : : /* There is no need to merge attributes into a TYPENAME_TYPE.
1073 : : When the type is instantiated it will have whatever
1074 : : attributes result from the instantiation. */
1075 : : return t1;
1076 : :
1077 : 4981233 : default:;
1078 : 4981233 : if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
1079 : : return t1;
1080 : 12 : else if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
1081 : : return t2;
1082 : : break;
1083 : : }
1084 : :
1085 : 7797532 : return cp_build_type_attribute_variant (t1, attributes);
1086 : : }
1087 : :
1088 : : /* Return the ARRAY_TYPE type without its domain. */
1089 : :
1090 : : tree
1091 : 236 : strip_array_domain (tree type)
1092 : : {
1093 : 236 : tree t2;
1094 : 236 : gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1095 : 236 : if (TYPE_DOMAIN (type) == NULL_TREE)
1096 : : return type;
1097 : 209 : t2 = build_cplus_array_type (TREE_TYPE (type), NULL_TREE);
1098 : 209 : return cp_build_type_attribute_variant (t2, TYPE_ATTRIBUTES (type));
1099 : : }
1100 : :
1101 : : /* Wrapper around cp_common_type that is used by c-common.cc and other
1102 : : front end optimizations that remove promotions.
1103 : :
1104 : : Return the common type for two arithmetic types T1 and T2 under the
1105 : : usual arithmetic conversions. The default conversions have already
1106 : : been applied, and enumerated types converted to their compatible
1107 : : integer types. */
1108 : :
1109 : : tree
1110 : 387574 : common_type (tree t1, tree t2)
1111 : : {
1112 : : /* If one type is nonsense, use the other */
1113 : 387574 : if (t1 == error_mark_node)
1114 : : return t2;
1115 : 387574 : if (t2 == error_mark_node)
1116 : : return t1;
1117 : :
1118 : 387574 : return cp_common_type (t1, t2);
1119 : : }
1120 : :
1121 : : /* Return the common type of two pointer types T1 and T2. This is the
1122 : : type for the result of most arithmetic operations if the operands
1123 : : have the given two types.
1124 : :
1125 : : We assume that comp_target_types has already been done and returned
1126 : : nonzero; if that isn't so, this may crash. */
1127 : :
1128 : : tree
1129 : 1179091 : common_pointer_type (tree t1, tree t2)
1130 : : {
1131 : 1179091 : gcc_assert ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2))
1132 : : || (TYPE_PTRDATAMEM_P (t1) && TYPE_PTRDATAMEM_P (t2))
1133 : : || (TYPE_PTRMEMFUNC_P (t1) && TYPE_PTRMEMFUNC_P (t2)));
1134 : :
1135 : 1179091 : return composite_pointer_type (input_location, t1, t2,
1136 : : error_mark_node, error_mark_node,
1137 : 1179091 : CPO_CONVERSION, tf_warning_or_error);
1138 : : }
1139 : :
1140 : : /* Compare two exception specifier types for exactness or subsetness, if
1141 : : allowed. Returns false for mismatch, true for match (same, or
1142 : : derived and !exact).
1143 : :
1144 : : [except.spec] "If a class X ... objects of class X or any class publicly
1145 : : and unambiguously derived from X. Similarly, if a pointer type Y * ...
1146 : : exceptions of type Y * or that are pointers to any type publicly and
1147 : : unambiguously derived from Y. Otherwise a function only allows exceptions
1148 : : that have the same type ..."
1149 : : This does not mention cv qualifiers and is different to what throw
1150 : : [except.throw] and catch [except.catch] will do. They will ignore the
1151 : : top level cv qualifiers, and allow qualifiers in the pointer to class
1152 : : example.
1153 : :
1154 : : We implement the letter of the standard. */
1155 : :
1156 : : static bool
1157 : 1648 : comp_except_types (tree a, tree b, bool exact)
1158 : : {
1159 : 1648 : if (same_type_p (a, b))
1160 : : return true;
1161 : 508 : else if (!exact)
1162 : : {
1163 : 12 : if (cp_type_quals (a) || cp_type_quals (b))
1164 : 0 : return false;
1165 : :
1166 : 12 : if (TYPE_PTR_P (a) && TYPE_PTR_P (b))
1167 : : {
1168 : 7 : a = TREE_TYPE (a);
1169 : 7 : b = TREE_TYPE (b);
1170 : 7 : if (cp_type_quals (a) || cp_type_quals (b))
1171 : 1 : return false;
1172 : : }
1173 : :
1174 : 11 : if (TREE_CODE (a) != RECORD_TYPE
1175 : 11 : || TREE_CODE (b) != RECORD_TYPE)
1176 : : return false;
1177 : :
1178 : 10 : if (publicly_uniquely_derived_p (a, b))
1179 : : return true;
1180 : : }
1181 : : return false;
1182 : : }
1183 : :
1184 : : /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
1185 : : If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
1186 : : If EXACT is ce_type, the C++17 type compatibility rules apply.
1187 : : If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1188 : : If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1189 : : are unordered, but we've already filtered out duplicates. Most lists will
1190 : : be in order, we should try to make use of that. */
1191 : :
1192 : : bool
1193 : 1310310666 : comp_except_specs (const_tree t1, const_tree t2, int exact)
1194 : : {
1195 : 1310310666 : const_tree probe;
1196 : 1310310666 : const_tree base;
1197 : 1310310666 : int length = 0;
1198 : :
1199 : 1310310666 : if (t1 == t2)
1200 : : return true;
1201 : :
1202 : : /* First handle noexcept. */
1203 : 515097633 : if (exact < ce_exact)
1204 : : {
1205 : 7133780 : if (exact == ce_type
1206 : 14199209 : && (canonical_eh_spec (CONST_CAST_TREE (t1))
1207 : 7065429 : == canonical_eh_spec (CONST_CAST_TREE (t2))))
1208 : : return true;
1209 : :
1210 : : /* noexcept(false) is compatible with no exception-specification,
1211 : : and less strict than any spec. */
1212 : 7127407 : if (t1 == noexcept_false_spec)
1213 : 104 : return t2 == NULL_TREE || exact == ce_derived;
1214 : : /* Even a derived noexcept(false) is compatible with no
1215 : : exception-specification. */
1216 : 7127303 : if (t2 == noexcept_false_spec)
1217 : 1240 : return t1 == NULL_TREE;
1218 : :
1219 : : /* Otherwise, if we aren't looking for an exact match, noexcept is
1220 : : equivalent to throw(). */
1221 : 7126063 : if (t1 == noexcept_true_spec)
1222 : 637250 : t1 = empty_except_spec;
1223 : 7126063 : if (t2 == noexcept_true_spec)
1224 : 6223099 : t2 = empty_except_spec;
1225 : : }
1226 : :
1227 : : /* If any noexcept is left, it is only comparable to itself;
1228 : : either we're looking for an exact match or we're redeclaring a
1229 : : template with dependent noexcept. */
1230 : 494085659 : if ((t1 && TREE_PURPOSE (t1))
1231 : 538728711 : || (t2 && TREE_PURPOSE (t2)))
1232 : 506080140 : return (t1 && t2
1233 : 506080140 : && (exact == ce_exact
1234 : 56720170 : ? TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
1235 : 262824 : : cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))));
1236 : :
1237 : 9009776 : if (t1 == NULL_TREE) /* T1 is ... */
1238 : 6435418 : return t2 == NULL_TREE || exact == ce_derived;
1239 : 2574358 : if (!TREE_VALUE (t1)) /* t1 is EMPTY */
1240 : 2542081 : return t2 != NULL_TREE && !TREE_VALUE (t2);
1241 : 33583 : if (t2 == NULL_TREE) /* T2 is ... */
1242 : : return false;
1243 : 1526 : if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
1244 : 76 : return exact == ce_derived;
1245 : :
1246 : : /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1247 : : Count how many we find, to determine exactness. For exact matching and
1248 : : ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1249 : : O(nm). */
1250 : 2593 : for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
1251 : : {
1252 : 2046 : for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
1253 : : {
1254 : 1648 : tree a = TREE_VALUE (probe);
1255 : 1648 : tree b = TREE_VALUE (t2);
1256 : :
1257 : 1648 : if (comp_except_types (a, b, exact))
1258 : : {
1259 : 1143 : if (probe == base && exact > ce_derived)
1260 : 1108 : base = TREE_CHAIN (probe);
1261 : 1143 : length++;
1262 : 1143 : break;
1263 : : }
1264 : : }
1265 : 1143 : if (probe == NULL_TREE)
1266 : : return false;
1267 : : }
1268 : 1052 : return exact == ce_derived || base == NULL_TREE || length == list_length (t1);
1269 : : }
1270 : :
1271 : : /* Compare the array types T1 and T2. CB says how we should behave when
1272 : : comparing array bounds: bounds_none doesn't allow dimensionless arrays,
1273 : : bounds_either says than any array can be [], bounds_first means that
1274 : : onlt T1 can be an array with unknown bounds. STRICT is true if
1275 : : qualifiers must match when comparing the types of the array elements. */
1276 : :
1277 : : static bool
1278 : 1163991 : comp_array_types (const_tree t1, const_tree t2, compare_bounds_t cb,
1279 : : bool strict)
1280 : : {
1281 : 1163991 : tree d1;
1282 : 1163991 : tree d2;
1283 : 1163991 : tree max1, max2;
1284 : :
1285 : 1163991 : if (t1 == t2)
1286 : : return true;
1287 : :
1288 : : /* The type of the array elements must be the same. */
1289 : 1163927 : if (strict
1290 : 1166203 : ? !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1291 : 2276 : : !similar_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1292 : : return false;
1293 : :
1294 : 766147 : d1 = TYPE_DOMAIN (t1);
1295 : 766147 : d2 = TYPE_DOMAIN (t2);
1296 : :
1297 : 766147 : if (d1 == d2)
1298 : : return true;
1299 : :
1300 : : /* If one of the arrays is dimensionless, and the other has a
1301 : : dimension, they are of different types. However, it is valid to
1302 : : write:
1303 : :
1304 : : extern int a[];
1305 : : int a[3];
1306 : :
1307 : : by [basic.link]:
1308 : :
1309 : : declarations for an array object can specify
1310 : : array types that differ by the presence or absence of a major
1311 : : array bound (_dcl.array_). */
1312 : 565826 : if (!d1 && d2)
1313 : 1863 : return cb >= bounds_either;
1314 : 563963 : else if (d1 && !d2)
1315 : 5534 : return cb == bounds_either;
1316 : :
1317 : : /* Check that the dimensions are the same. */
1318 : :
1319 : 558429 : if (!cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)))
1320 : : return false;
1321 : 558408 : max1 = TYPE_MAX_VALUE (d1);
1322 : 558408 : max2 = TYPE_MAX_VALUE (d2);
1323 : :
1324 : 558408 : if (!cp_tree_equal (max1, max2))
1325 : : return false;
1326 : :
1327 : : return true;
1328 : : }
1329 : :
1330 : : /* Compare the relative position of T1 and T2 into their respective
1331 : : template parameter list.
1332 : : T1 and T2 must be template parameter types.
1333 : : Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1334 : :
1335 : : static bool
1336 : 1521408210 : comp_template_parms_position (tree t1, tree t2)
1337 : : {
1338 : 1521408210 : tree index1, index2;
1339 : 1521408210 : gcc_assert (t1 && t2
1340 : : && TREE_CODE (t1) == TREE_CODE (t2)
1341 : : && (TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM
1342 : : || TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM
1343 : : || TREE_CODE (t1) == TEMPLATE_TYPE_PARM));
1344 : :
1345 : 1521408210 : index1 = TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1));
1346 : 1521408210 : index2 = TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2));
1347 : :
1348 : : /* Then compare their relative position. */
1349 : 1521408210 : if (TEMPLATE_PARM_IDX (index1) != TEMPLATE_PARM_IDX (index2)
1350 : 893843854 : || TEMPLATE_PARM_LEVEL (index1) != TEMPLATE_PARM_LEVEL (index2)
1351 : 2147547213 : || (TEMPLATE_PARM_PARAMETER_PACK (index1)
1352 : 626139003 : != TEMPLATE_PARM_PARAMETER_PACK (index2)))
1353 : : return false;
1354 : :
1355 : : /* In C++14 we can end up comparing 'auto' to a normal template
1356 : : parameter. Don't confuse them. */
1357 : 552854809 : if (cxx_dialect >= cxx14 && (is_auto (t1) || is_auto (t2)))
1358 : 126612765 : return TYPE_IDENTIFIER (t1) == TYPE_IDENTIFIER (t2);
1359 : :
1360 : : return true;
1361 : : }
1362 : :
1363 : : /* Heuristic check if two parameter types can be considered ABI-equivalent. */
1364 : :
1365 : : static bool
1366 : 511 : cxx_safe_arg_type_equiv_p (tree t1, tree t2)
1367 : : {
1368 : 511 : t1 = TYPE_MAIN_VARIANT (t1);
1369 : 511 : t2 = TYPE_MAIN_VARIANT (t2);
1370 : :
1371 : 511 : if (TYPE_PTR_P (t1)
1372 : 141 : && TYPE_PTR_P (t2))
1373 : : return true;
1374 : :
1375 : : /* The signedness of the parameter matters only when an integral
1376 : : type smaller than int is promoted to int, otherwise only the
1377 : : precision of the parameter matters.
1378 : : This check should make sure that the callee does not see
1379 : : undefined values in argument registers. */
1380 : 376 : if (INTEGRAL_TYPE_P (t1)
1381 : 67 : && INTEGRAL_TYPE_P (t2)
1382 : 46 : && TYPE_PRECISION (t1) == TYPE_PRECISION (t2)
1383 : 419 : && (TYPE_UNSIGNED (t1) == TYPE_UNSIGNED (t2)
1384 : 0 : || !targetm.calls.promote_prototypes (NULL_TREE)
1385 : 0 : || TYPE_PRECISION (t1) >= TYPE_PRECISION (integer_type_node)))
1386 : 43 : return true;
1387 : :
1388 : 333 : return same_type_p (t1, t2);
1389 : : }
1390 : :
1391 : : /* Check if a type cast between two function types can be considered safe. */
1392 : :
1393 : : static bool
1394 : 5531 : cxx_safe_function_type_cast_p (tree t1, tree t2)
1395 : : {
1396 : 5531 : if (TREE_TYPE (t1) == void_type_node &&
1397 : 5469 : TYPE_ARG_TYPES (t1) == void_list_node)
1398 : : return true;
1399 : :
1400 : 4764 : if (TREE_TYPE (t2) == void_type_node &&
1401 : 4559 : TYPE_ARG_TYPES (t2) == void_list_node)
1402 : : return true;
1403 : :
1404 : 272 : if (!cxx_safe_arg_type_equiv_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1405 : : return false;
1406 : :
1407 : 111 : for (t1 = TYPE_ARG_TYPES (t1), t2 = TYPE_ARG_TYPES (t2);
1408 : 314 : t1 && t2;
1409 : 203 : t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1410 : 239 : if (!cxx_safe_arg_type_equiv_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1411 : : return false;
1412 : :
1413 : : return true;
1414 : : }
1415 : :
1416 : : /* Subroutine in comptypes. */
1417 : :
1418 : : static bool
1419 : 10183489690 : structural_comptypes (tree t1, tree t2, int strict)
1420 : : {
1421 : : /* Both should be types that are not obviously the same. */
1422 : 10183489690 : gcc_checking_assert (t1 != t2 && TYPE_P (t1) && TYPE_P (t2));
1423 : :
1424 : : /* Suppress typename resolution under spec_hasher::equal in place of calling
1425 : : push_to_top_level there. */
1426 : 10183489690 : if (!comparing_specializations)
1427 : : {
1428 : : /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1429 : : current instantiation. */
1430 : 8174676964 : if (TREE_CODE (t1) == TYPENAME_TYPE)
1431 : 74145527 : t1 = resolve_typename_type (t1, /*only_current_p=*/true);
1432 : :
1433 : 8174676964 : if (TREE_CODE (t2) == TYPENAME_TYPE)
1434 : 92158417 : t2 = resolve_typename_type (t2, /*only_current_p=*/true);
1435 : : }
1436 : :
1437 : 10183489690 : if (TYPE_PTRMEMFUNC_P (t1))
1438 : 29759131 : t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
1439 : 10183489690 : if (TYPE_PTRMEMFUNC_P (t2))
1440 : 32995101 : t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
1441 : :
1442 : : /* Different classes of types can't be compatible. */
1443 : 10183489690 : if (TREE_CODE (t1) != TREE_CODE (t2))
1444 : : return false;
1445 : :
1446 : : /* Qualifiers must match. For array types, we will check when we
1447 : : recur on the array element types. */
1448 : 6674715140 : if (TREE_CODE (t1) != ARRAY_TYPE
1449 : 6674715140 : && cp_type_quals (t1) != cp_type_quals (t2))
1450 : : return false;
1451 : 6294648123 : if (TREE_CODE (t1) == FUNCTION_TYPE
1452 : 6294648123 : && type_memfn_quals (t1) != type_memfn_quals (t2))
1453 : : return false;
1454 : : /* Need to check this before TYPE_MAIN_VARIANT.
1455 : : FIXME function qualifiers should really change the main variant. */
1456 : 6294580309 : if (FUNC_OR_METHOD_TYPE_P (t1))
1457 : : {
1458 : 35703017 : if (type_memfn_rqual (t1) != type_memfn_rqual (t2))
1459 : : return false;
1460 : 17987866 : if (flag_noexcept_type
1461 : 35879850 : && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (t1),
1462 : 17891984 : TYPE_RAISES_EXCEPTIONS (t2),
1463 : : ce_type))
1464 : : return false;
1465 : : }
1466 : :
1467 : : /* Allow for two different type nodes which have essentially the same
1468 : : definition. Note that we already checked for equality of the type
1469 : : qualifiers (just above). */
1470 : 6269970381 : if (TREE_CODE (t1) != ARRAY_TYPE
1471 : 6269970381 : && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1472 : 269574229 : goto check_alias;
1473 : :
1474 : : /* Compare the types. Return false on known not-same. Break on not
1475 : : known. Never return true from this switch -- you'll break
1476 : : specialization comparison. */
1477 : 6000396152 : switch (TREE_CODE (t1))
1478 : : {
1479 : : case VOID_TYPE:
1480 : : case BOOLEAN_TYPE:
1481 : : /* All void and bool types are the same. */
1482 : : break;
1483 : :
1484 : 438252057 : case OPAQUE_TYPE:
1485 : 438252057 : case INTEGER_TYPE:
1486 : 438252057 : case FIXED_POINT_TYPE:
1487 : 438252057 : case REAL_TYPE:
1488 : : /* With these nodes, we can't determine type equivalence by
1489 : : looking at what is stored in the nodes themselves, because
1490 : : two nodes might have different TYPE_MAIN_VARIANTs but still
1491 : : represent the same type. For example, wchar_t and int could
1492 : : have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1493 : : TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1494 : : and are distinct types. On the other hand, int and the
1495 : : following typedef
1496 : :
1497 : : typedef int INT __attribute((may_alias));
1498 : :
1499 : : have identical properties, different TYPE_MAIN_VARIANTs, but
1500 : : represent the same type. The canonical type system keeps
1501 : : track of equivalence in this case, so we fall back on it. */
1502 : 438252057 : if (TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1503 : : return false;
1504 : :
1505 : : /* We don't need or want the attribute comparison. */
1506 : 7648 : goto check_alias;
1507 : :
1508 : 1011165 : case TEMPLATE_TEMPLATE_PARM:
1509 : 1011165 : case BOUND_TEMPLATE_TEMPLATE_PARM:
1510 : 1011165 : if (!comp_template_parms_position (t1, t2))
1511 : : return false;
1512 : 781703 : if (!comp_template_parms
1513 : 1563406 : (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1514 : 2219290 : DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1515 : : return false;
1516 : 553732 : if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
1517 : : break;
1518 : : /* Don't check inheritance. */
1519 : : strict = COMPARE_STRICT;
1520 : : /* Fall through. */
1521 : :
1522 : 2787389547 : case RECORD_TYPE:
1523 : 2787389547 : case UNION_TYPE:
1524 : 4907605154 : if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1525 : 1729506180 : && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1526 : 1285945942 : || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1527 : 3230967465 : && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1528 : : break;
1529 : :
1530 : 2759082598 : if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1531 : : break;
1532 : 2759082569 : else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1533 : : break;
1534 : :
1535 : : return false;
1536 : :
1537 : 42943 : case OFFSET_TYPE:
1538 : 42943 : if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1539 : : strict & ~COMPARE_REDECLARATION))
1540 : : return false;
1541 : 41166 : if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1542 : : return false;
1543 : : break;
1544 : :
1545 : 604779268 : case REFERENCE_TYPE:
1546 : 604779268 : if (TYPE_REF_IS_RVALUE (t1) != TYPE_REF_IS_RVALUE (t2))
1547 : : return false;
1548 : : /* fall through to checks for pointer types */
1549 : 897697300 : gcc_fallthrough ();
1550 : :
1551 : 897697300 : case POINTER_TYPE:
1552 : 897697300 : if (TYPE_MODE (t1) != TYPE_MODE (t2)
1553 : 897697300 : || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1554 : 806025855 : return false;
1555 : : break;
1556 : :
1557 : 10800086 : case METHOD_TYPE:
1558 : 10800086 : case FUNCTION_TYPE:
1559 : : /* Exception specs and memfn_rquals were checked above. */
1560 : 10800086 : if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1561 : : return false;
1562 : 10199286 : if (!compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)))
1563 : : return false;
1564 : : break;
1565 : :
1566 : 1161651 : case ARRAY_TYPE:
1567 : : /* Target types must match incl. qualifiers. */
1568 : 1161651 : if (!comp_array_types (t1, t2, ((strict & COMPARE_REDECLARATION)
1569 : 1161651 : ? bounds_either : bounds_none),
1570 : : /*strict=*/true))
1571 : : return false;
1572 : : break;
1573 : :
1574 : 1520397045 : case TEMPLATE_TYPE_PARM:
1575 : : /* If T1 and T2 don't have the same relative position in their
1576 : : template parameters set, they can't be equal. */
1577 : 1520397045 : if (!comp_template_parms_position (t1, t2))
1578 : : return false;
1579 : : /* If T1 and T2 don't represent the same class template deduction,
1580 : : they aren't equal. */
1581 : 918765586 : if (!cp_tree_equal (CLASS_PLACEHOLDER_TEMPLATE (t1),
1582 : 459382793 : CLASS_PLACEHOLDER_TEMPLATE (t2)))
1583 : : return false;
1584 : : /* Constrained 'auto's are distinct from parms that don't have the same
1585 : : constraints. */
1586 : 446461858 : if (!equivalent_placeholder_constraints (t1, t2))
1587 : : return false;
1588 : : break;
1589 : :
1590 : 107893431 : case TYPENAME_TYPE:
1591 : 215786862 : if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1592 : 107893431 : TYPENAME_TYPE_FULLNAME (t2)))
1593 : : return false;
1594 : : /* Qualifiers don't matter on scopes. */
1595 : 93626123 : if (!same_type_ignoring_top_level_qualifiers_p (TYPE_CONTEXT (t1),
1596 : 93626123 : TYPE_CONTEXT (t2)))
1597 : : return false;
1598 : : break;
1599 : :
1600 : 6751 : case UNBOUND_CLASS_TEMPLATE:
1601 : 6751 : if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1602 : : return false;
1603 : 6751 : if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1604 : : return false;
1605 : : break;
1606 : :
1607 : 2829559 : case COMPLEX_TYPE:
1608 : 2829559 : if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1609 : : return false;
1610 : : break;
1611 : :
1612 : 8562118 : case VECTOR_TYPE:
1613 : 8562118 : if (gnu_vector_type_p (t1) != gnu_vector_type_p (t2)
1614 : 15702380 : || maybe_ne (TYPE_VECTOR_SUBPARTS (t1), TYPE_VECTOR_SUBPARTS (t2))
1615 : 15749486 : || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1616 : 1421856 : return false;
1617 : : break;
1618 : :
1619 : 6160818 : case TYPE_PACK_EXPANSION:
1620 : 6160818 : return (same_type_p (PACK_EXPANSION_PATTERN (t1),
1621 : : PACK_EXPANSION_PATTERN (t2))
1622 : 12180269 : && comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1),
1623 : 6019451 : PACK_EXPANSION_EXTRA_ARGS (t2)));
1624 : :
1625 : 14 : case PACK_INDEX_TYPE:
1626 : 14 : return (cp_tree_equal (PACK_INDEX_PACK (t1),
1627 : 14 : PACK_INDEX_PACK (t2))
1628 : 16 : && cp_tree_equal (PACK_INDEX_INDEX (t1),
1629 : 2 : PACK_INDEX_INDEX (t2)));
1630 : :
1631 : 11364772 : case DECLTYPE_TYPE:
1632 : 22729544 : if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1)
1633 : 11364772 : != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2))
1634 : : return false;
1635 : 11362179 : if (DECLTYPE_FOR_LAMBDA_CAPTURE (t1) != DECLTYPE_FOR_LAMBDA_CAPTURE (t2))
1636 : : return false;
1637 : 11362179 : if (DECLTYPE_FOR_LAMBDA_PROXY (t1) != DECLTYPE_FOR_LAMBDA_PROXY (t2))
1638 : : return false;
1639 : 11362179 : if (!cp_tree_equal (DECLTYPE_TYPE_EXPR (t1), DECLTYPE_TYPE_EXPR (t2)))
1640 : : return false;
1641 : : break;
1642 : :
1643 : 508393 : case TRAIT_TYPE:
1644 : 508393 : if (TRAIT_TYPE_KIND (t1) != TRAIT_TYPE_KIND (t2))
1645 : : return false;
1646 : 2828 : if (!cp_tree_equal (TRAIT_TYPE_TYPE1 (t1), TRAIT_TYPE_TYPE1 (t2))
1647 : 5656 : || !cp_tree_equal (TRAIT_TYPE_TYPE2 (t1), TRAIT_TYPE_TYPE2 (t2)))
1648 : 0 : return false;
1649 : : break;
1650 : :
1651 : 3 : case TYPEOF_TYPE:
1652 : 3 : if (!cp_tree_equal (TYPEOF_TYPE_EXPR (t1), TYPEOF_TYPE_EXPR (t2)))
1653 : : return false;
1654 : : break;
1655 : :
1656 : : default:
1657 : : return false;
1658 : : }
1659 : :
1660 : : /* If we get here, we know that from a target independent POV the
1661 : : types are the same. Make sure the target attributes are also
1662 : : the same. */
1663 : 583191247 : if (!comp_type_attributes (t1, t2))
1664 : : return false;
1665 : :
1666 : 583190107 : check_alias:
1667 : 852771984 : if (comparing_dependent_aliases
1668 : 852771984 : && (typedef_variant_p (t1) || typedef_variant_p (t2)))
1669 : : {
1670 : 2562101 : tree dep1 = dependent_opaque_alias_p (t1) ? t1 : NULL_TREE;
1671 : 2562101 : tree dep2 = dependent_opaque_alias_p (t2) ? t2 : NULL_TREE;
1672 : 2562101 : if ((dep1 || dep2)
1673 : 2562101 : && (!(dep1 && dep2)
1674 : 0 : || !comp_type_attributes (DECL_ATTRIBUTES (TYPE_NAME (dep1)),
1675 : 0 : DECL_ATTRIBUTES (TYPE_NAME (dep2)))))
1676 : 25 : return false;
1677 : :
1678 : : /* Don't treat an alias template specialization with dependent
1679 : : arguments as equivalent to its underlying type when used as a
1680 : : template argument; we need them to be distinct so that we
1681 : : substitute into the specialization arguments at instantiation
1682 : : time. And aliases can't be equivalent without being ==, so
1683 : : we don't need to look any deeper. */
1684 : 2562076 : ++processing_template_decl;
1685 : 2562076 : dep1 = dependent_alias_template_spec_p (t1, nt_transparent);
1686 : 2562076 : dep2 = dependent_alias_template_spec_p (t2, nt_transparent);
1687 : 2562076 : --processing_template_decl;
1688 : 2562076 : if ((dep1 || dep2) && dep1 != dep2)
1689 : : return false;
1690 : : }
1691 : :
1692 : : return true;
1693 : : }
1694 : :
1695 : : /* C++ implementation of compatible_types_for_indirection_note_p. */
1696 : :
1697 : : bool
1698 : 1679 : compatible_types_for_indirection_note_p (tree type1, tree type2)
1699 : : {
1700 : 1679 : return same_type_p (type1, type2);
1701 : : }
1702 : :
1703 : : /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1704 : : is a bitwise-or of the COMPARE_* flags. */
1705 : :
1706 : : bool
1707 : 16295861225 : comptypes (tree t1, tree t2, int strict)
1708 : : {
1709 : 16295861225 : gcc_checking_assert (t1 && t2);
1710 : :
1711 : : /* TYPE_ARGUMENT_PACKS are not really types. */
1712 : 16295861225 : gcc_checking_assert (TREE_CODE (t1) != TYPE_ARGUMENT_PACK
1713 : : && TREE_CODE (t2) != TYPE_ARGUMENT_PACK);
1714 : :
1715 : 16295861225 : if (t1 == t2)
1716 : : return true;
1717 : :
1718 : : /* Suppress errors caused by previously reported errors. */
1719 : 10183490851 : if (t1 == error_mark_node || t2 == error_mark_node)
1720 : : return false;
1721 : :
1722 : 10183490690 : if (strict == COMPARE_STRICT)
1723 : : {
1724 : 8921293782 : if (TYPE_STRUCTURAL_EQUALITY_P (t1) || TYPE_STRUCTURAL_EQUALITY_P (t2))
1725 : : /* At least one of the types requires structural equality, so
1726 : : perform a deep check. */
1727 : 775226676 : return structural_comptypes (t1, t2, strict);
1728 : :
1729 : 8146067106 : if (flag_checking && param_use_canonical_types)
1730 : : {
1731 : 8146066106 : bool result = structural_comptypes (t1, t2, strict);
1732 : :
1733 : 8146066106 : if (result && TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1734 : : /* The two types are structurally equivalent, but their
1735 : : canonical types were different. This is a failure of the
1736 : : canonical type propagation code.*/
1737 : 0 : internal_error
1738 : 0 : ("canonical types differ for identical types %qT and %qT",
1739 : : t1, t2);
1740 : 8146066106 : else if (!result && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
1741 : : /* Two types are structurally different, but the canonical
1742 : : types are the same. This means we were over-eager in
1743 : : assigning canonical types. */
1744 : 0 : internal_error
1745 : 0 : ("same canonical type node for different types %qT and %qT",
1746 : : t1, t2);
1747 : :
1748 : : return result;
1749 : : }
1750 : 1000 : if (!flag_checking && param_use_canonical_types)
1751 : 1000 : return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1752 : : else
1753 : 0 : return structural_comptypes (t1, t2, strict);
1754 : : }
1755 : 1262196908 : else if (strict == COMPARE_STRUCTURAL)
1756 : 1229749411 : return structural_comptypes (t1, t2, COMPARE_STRICT);
1757 : : else
1758 : 32447497 : return structural_comptypes (t1, t2, strict);
1759 : : }
1760 : :
1761 : : /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1762 : : top-level qualifiers. */
1763 : :
1764 : : bool
1765 : 2201153673 : same_type_ignoring_top_level_qualifiers_p (tree type1, tree type2)
1766 : : {
1767 : 2201153673 : if (type1 == error_mark_node || type2 == error_mark_node)
1768 : : return false;
1769 : 2201153663 : if (type1 == type2)
1770 : : return true;
1771 : :
1772 : 1314749409 : type1 = cp_build_qualified_type (type1, TYPE_UNQUALIFIED);
1773 : 1314749409 : type2 = cp_build_qualified_type (type2, TYPE_UNQUALIFIED);
1774 : 1314749409 : return same_type_p (type1, type2);
1775 : : }
1776 : :
1777 : : /* Returns nonzero iff TYPE1 and TYPE2 are similar, as per [conv.qual]. */
1778 : :
1779 : : bool
1780 : 195334065 : similar_type_p (tree type1, tree type2)
1781 : : {
1782 : 195334065 : if (type1 == error_mark_node || type2 == error_mark_node)
1783 : : return false;
1784 : :
1785 : : /* Informally, two types are similar if, ignoring top-level cv-qualification:
1786 : : * they are the same type; or
1787 : : * they are both pointers, and the pointed-to types are similar; or
1788 : : * they are both pointers to member of the same class, and the types of
1789 : : the pointed-to members are similar; or
1790 : : * they are both arrays of the same size or both arrays of unknown bound,
1791 : : and the array element types are similar. */
1792 : :
1793 : 195334065 : if (same_type_ignoring_top_level_qualifiers_p (type1, type2))
1794 : : return true;
1795 : :
1796 : 92719760 : if ((TYPE_PTR_P (type1) && TYPE_PTR_P (type2))
1797 : 92671583 : || (TYPE_PTRDATAMEM_P (type1) && TYPE_PTRDATAMEM_P (type2))
1798 : 92671583 : || (TREE_CODE (type1) == ARRAY_TYPE && TREE_CODE (type2) == ARRAY_TYPE))
1799 : 48669 : return comp_ptr_ttypes_const (type1, type2, bounds_either);
1800 : :
1801 : : return false;
1802 : : }
1803 : :
1804 : : /* Helper function for layout_compatible_type_p and
1805 : : is_corresponding_member_aggr. Advance to next members (NULL if
1806 : : no further ones) and return true if those members are still part of
1807 : : the common initial sequence. */
1808 : :
1809 : : bool
1810 : 2112 : next_common_initial_sequence (tree &memb1, tree &memb2)
1811 : : {
1812 : 2587 : while (memb1)
1813 : : {
1814 : 2623 : if (TREE_CODE (memb1) != FIELD_DECL
1815 : 2206 : || (DECL_FIELD_IS_BASE (memb1) && is_empty_field (memb1)))
1816 : : {
1817 : 417 : memb1 = DECL_CHAIN (memb1);
1818 : 417 : continue;
1819 : : }
1820 : 1789 : if (DECL_FIELD_IS_BASE (memb1))
1821 : : {
1822 : 58 : memb1 = TYPE_FIELDS (TREE_TYPE (memb1));
1823 : 58 : continue;
1824 : : }
1825 : : break;
1826 : : }
1827 : 2557 : while (memb2)
1828 : : {
1829 : 2593 : if (TREE_CODE (memb2) != FIELD_DECL
1830 : 2176 : || (DECL_FIELD_IS_BASE (memb2) && is_empty_field (memb2)))
1831 : : {
1832 : 417 : memb2 = DECL_CHAIN (memb2);
1833 : 417 : continue;
1834 : : }
1835 : 1759 : if (DECL_FIELD_IS_BASE (memb2))
1836 : : {
1837 : 28 : memb2 = TYPE_FIELDS (TREE_TYPE (memb2));
1838 : 28 : continue;
1839 : : }
1840 : : break;
1841 : : }
1842 : 2112 : if (memb1 == NULL_TREE && memb2 == NULL_TREE)
1843 : : return true;
1844 : 1731 : if (memb1 == NULL_TREE || memb2 == NULL_TREE)
1845 : : return false;
1846 : 1731 : if (DECL_BIT_FIELD_TYPE (memb1))
1847 : : {
1848 : 150 : if (!DECL_BIT_FIELD_TYPE (memb2))
1849 : : return false;
1850 : 42 : if (!layout_compatible_type_p (DECL_BIT_FIELD_TYPE (memb1),
1851 : 42 : DECL_BIT_FIELD_TYPE (memb2)))
1852 : : return false;
1853 : 42 : if (TYPE_PRECISION (TREE_TYPE (memb1))
1854 : 42 : != TYPE_PRECISION (TREE_TYPE (memb2)))
1855 : : return false;
1856 : : }
1857 : 1581 : else if (DECL_BIT_FIELD_TYPE (memb2))
1858 : : return false;
1859 : 1551 : else if (!layout_compatible_type_p (TREE_TYPE (memb1), TREE_TYPE (memb2)))
1860 : : return false;
1861 : 1524 : if ((!lookup_attribute ("no_unique_address", DECL_ATTRIBUTES (memb1)))
1862 : 1524 : != !lookup_attribute ("no_unique_address", DECL_ATTRIBUTES (memb2)))
1863 : : return false;
1864 : 1494 : if (DECL_ALIGN (memb1) != DECL_ALIGN (memb2))
1865 : : return false;
1866 : 1461 : if (!tree_int_cst_equal (bit_position (memb1), bit_position (memb2)))
1867 : : return false;
1868 : : return true;
1869 : : }
1870 : :
1871 : : /* Return true if TYPE1 and TYPE2 are layout-compatible types. */
1872 : :
1873 : : bool
1874 : 2709 : layout_compatible_type_p (tree type1, tree type2)
1875 : : {
1876 : 2709 : if (type1 == error_mark_node || type2 == error_mark_node)
1877 : : return false;
1878 : 2709 : if (type1 == type2)
1879 : : return true;
1880 : 1318 : if (TREE_CODE (type1) != TREE_CODE (type2))
1881 : : return false;
1882 : :
1883 : 1280 : type1 = cp_build_qualified_type (type1, TYPE_UNQUALIFIED);
1884 : 1280 : type2 = cp_build_qualified_type (type2, TYPE_UNQUALIFIED);
1885 : :
1886 : 1280 : if (TREE_CODE (type1) == ENUMERAL_TYPE)
1887 : 32 : return (tree_int_cst_equal (TYPE_SIZE (type1), TYPE_SIZE (type2))
1888 : 32 : && same_type_p (finish_underlying_type (type1),
1889 : : finish_underlying_type (type2)));
1890 : :
1891 : 391 : if (CLASS_TYPE_P (type1)
1892 : 391 : && std_layout_type_p (type1)
1893 : 381 : && std_layout_type_p (type2)
1894 : 1629 : && tree_int_cst_equal (TYPE_SIZE (type1), TYPE_SIZE (type2)))
1895 : : {
1896 : 336 : tree field1 = TYPE_FIELDS (type1);
1897 : 336 : tree field2 = TYPE_FIELDS (type2);
1898 : 336 : if (TREE_CODE (type1) == RECORD_TYPE)
1899 : : {
1900 : 1011 : while (1)
1901 : : {
1902 : 636 : if (!next_common_initial_sequence (field1, field2))
1903 : : return false;
1904 : 630 : if (field1 == NULL_TREE)
1905 : : return true;
1906 : 375 : field1 = DECL_CHAIN (field1);
1907 : 375 : field2 = DECL_CHAIN (field2);
1908 : : }
1909 : : }
1910 : : /* Otherwise both types must be union types.
1911 : : The standard says:
1912 : : "Two standard-layout unions are layout-compatible if they have
1913 : : the same number of non-static data members and corresponding
1914 : : non-static data members (in any order) have layout-compatible
1915 : : types."
1916 : : but the code anticipates that bitfield vs. non-bitfield,
1917 : : different bitfield widths or presence/absence of
1918 : : [[no_unique_address]] should be checked as well. */
1919 : 75 : auto_vec<tree, 16> vec;
1920 : 75 : unsigned int count = 0;
1921 : 339 : for (; field1; field1 = DECL_CHAIN (field1))
1922 : 264 : if (TREE_CODE (field1) == FIELD_DECL)
1923 : 174 : count++;
1924 : 339 : for (; field2; field2 = DECL_CHAIN (field2))
1925 : 264 : if (TREE_CODE (field2) == FIELD_DECL)
1926 : 174 : vec.safe_push (field2);
1927 : : /* Discussions on core lean towards treating multiple union fields
1928 : : of the same type as the same field, so this might need changing
1929 : : in the future. */
1930 : 150 : if (count != vec.length ())
1931 : : return false;
1932 : 321 : for (field1 = TYPE_FIELDS (type1); field1; field1 = DECL_CHAIN (field1))
1933 : : {
1934 : 252 : if (TREE_CODE (field1) != FIELD_DECL)
1935 : 84 : continue;
1936 : 168 : unsigned int j;
1937 : 168 : tree t1 = DECL_BIT_FIELD_TYPE (field1);
1938 : 168 : if (t1 == NULL_TREE)
1939 : 165 : t1 = TREE_TYPE (field1);
1940 : 276 : FOR_EACH_VEC_ELT (vec, j, field2)
1941 : : {
1942 : 270 : tree t2 = DECL_BIT_FIELD_TYPE (field2);
1943 : 270 : if (t2 == NULL_TREE)
1944 : 258 : t2 = TREE_TYPE (field2);
1945 : 270 : if (DECL_BIT_FIELD_TYPE (field1))
1946 : : {
1947 : 6 : if (!DECL_BIT_FIELD_TYPE (field2))
1948 : 0 : continue;
1949 : 6 : if (TYPE_PRECISION (TREE_TYPE (field1))
1950 : 6 : != TYPE_PRECISION (TREE_TYPE (field2)))
1951 : 6 : continue;
1952 : : }
1953 : 264 : else if (DECL_BIT_FIELD_TYPE (field2))
1954 : 6 : continue;
1955 : 258 : if (!layout_compatible_type_p (t1, t2))
1956 : 96 : continue;
1957 : 162 : if ((!lookup_attribute ("no_unique_address",
1958 : 162 : DECL_ATTRIBUTES (field1)))
1959 : 162 : != !lookup_attribute ("no_unique_address",
1960 : 162 : DECL_ATTRIBUTES (field2)))
1961 : 0 : continue;
1962 : : break;
1963 : : }
1964 : 336 : if (j == vec.length ())
1965 : : return false;
1966 : 162 : vec.unordered_remove (j);
1967 : : }
1968 : : return true;
1969 : 75 : }
1970 : :
1971 : 912 : return same_type_p (type1, type2);
1972 : : }
1973 : :
1974 : : /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1975 : :
1976 : : bool
1977 : 137547640 : at_least_as_qualified_p (const_tree type1, const_tree type2)
1978 : : {
1979 : 137547640 : int q1 = cp_type_quals (type1);
1980 : 137547640 : int q2 = cp_type_quals (type2);
1981 : :
1982 : : /* All qualifiers for TYPE2 must also appear in TYPE1. */
1983 : 137547640 : return (q1 & q2) == q2;
1984 : : }
1985 : :
1986 : : /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1987 : : more cv-qualified that TYPE1, and 0 otherwise. */
1988 : :
1989 : : int
1990 : 9006875 : comp_cv_qualification (int q1, int q2)
1991 : : {
1992 : 9006875 : if (q1 == q2)
1993 : : return 0;
1994 : :
1995 : 2751298 : if ((q1 & q2) == q2)
1996 : : return 1;
1997 : 224035 : else if ((q1 & q2) == q1)
1998 : 223446 : return -1;
1999 : :
2000 : : return 0;
2001 : : }
2002 : :
2003 : : int
2004 : 0 : comp_cv_qualification (const_tree type1, const_tree type2)
2005 : : {
2006 : 0 : int q1 = cp_type_quals (type1);
2007 : 0 : int q2 = cp_type_quals (type2);
2008 : 0 : return comp_cv_qualification (q1, q2);
2009 : : }
2010 : :
2011 : : /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
2012 : : subset of the cv-qualification signature of TYPE2, and the types
2013 : : are similar. Returns -1 if the other way 'round, and 0 otherwise. */
2014 : :
2015 : : int
2016 : 311 : comp_cv_qual_signature (tree type1, tree type2)
2017 : : {
2018 : 311 : if (comp_ptr_ttypes_real (type2, type1, -1))
2019 : : return 1;
2020 : 261 : else if (comp_ptr_ttypes_real (type1, type2, -1))
2021 : : return -1;
2022 : : else
2023 : 249 : return 0;
2024 : : }
2025 : :
2026 : : /* Subroutines of `comptypes'. */
2027 : :
2028 : : /* Return true if two parameter type lists PARMS1 and PARMS2 are
2029 : : equivalent in the sense that functions with those parameter types
2030 : : can have equivalent types. The two lists must be equivalent,
2031 : : element by element. */
2032 : :
2033 : : bool
2034 : 685036554 : compparms (const_tree parms1, const_tree parms2)
2035 : : {
2036 : 685036554 : const_tree t1, t2;
2037 : :
2038 : : /* An unspecified parmlist matches any specified parmlist
2039 : : whose argument types don't need default promotions. */
2040 : :
2041 : 685036554 : for (t1 = parms1, t2 = parms2;
2042 : 1136888328 : t1 || t2;
2043 : 451851774 : t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
2044 : : {
2045 : : /* If one parmlist is shorter than the other,
2046 : : they fail to match. */
2047 : 1074154352 : if (!t1 || !t2)
2048 : : return false;
2049 : 1073480779 : if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
2050 : : return false;
2051 : : }
2052 : : return true;
2053 : : }
2054 : :
2055 : :
2056 : : /* Process a sizeof or alignof expression where the operand is a type.
2057 : : STD_ALIGNOF indicates whether an alignof has C++11 (minimum alignment)
2058 : : or GNU (preferred alignment) semantics; it is ignored if OP is
2059 : : SIZEOF_EXPR. */
2060 : :
2061 : : tree
2062 : 22640146 : cxx_sizeof_or_alignof_type (location_t loc, tree type, enum tree_code op,
2063 : : bool std_alignof, bool complain)
2064 : : {
2065 : 22640146 : gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
2066 : 22640146 : if (type == error_mark_node)
2067 : : return error_mark_node;
2068 : :
2069 : 22640144 : type = non_reference (type);
2070 : 22640144 : if (TREE_CODE (type) == METHOD_TYPE)
2071 : : {
2072 : 0 : if (complain)
2073 : : {
2074 : 0 : pedwarn (loc, OPT_Wpointer_arith,
2075 : : "invalid application of %qs to a member function",
2076 : 0 : OVL_OP_INFO (false, op)->name);
2077 : 0 : return size_one_node;
2078 : : }
2079 : : else
2080 : 0 : return error_mark_node;
2081 : : }
2082 : 22640144 : else if (VOID_TYPE_P (type) && std_alignof)
2083 : : {
2084 : 14 : if (complain)
2085 : 14 : error_at (loc, "invalid application of %qs to a void type",
2086 : 14 : OVL_OP_INFO (false, op)->name);
2087 : 14 : return error_mark_node;
2088 : : }
2089 : :
2090 : 22640130 : bool dependent_p = dependent_type_p (type);
2091 : 22640130 : if (!dependent_p)
2092 : 19084145 : complete_type (type);
2093 : 19084145 : if (dependent_p
2094 : : /* VLA types will have a non-constant size. In the body of an
2095 : : uninstantiated template, we don't need to try to compute the
2096 : : value, because the sizeof expression is not an integral
2097 : : constant expression in that case. And, if we do try to
2098 : : compute the value, we'll likely end up with SAVE_EXPRs, which
2099 : : the template substitution machinery does not expect to see. */
2100 : 19084145 : || (processing_template_decl
2101 : 1629123 : && COMPLETE_TYPE_P (type)
2102 : 1629120 : && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST))
2103 : : {
2104 : 3555985 : tree value = build_min (op, size_type_node, type);
2105 : 3555985 : TREE_READONLY (value) = 1;
2106 : 3555985 : if (op == ALIGNOF_EXPR && std_alignof)
2107 : 427679 : ALIGNOF_EXPR_STD_P (value) = true;
2108 : 3555985 : SET_EXPR_LOCATION (value, loc);
2109 : 3555985 : return value;
2110 : : }
2111 : :
2112 : 19084145 : return c_sizeof_or_alignof_type (loc, complete_type (type),
2113 : : op == SIZEOF_EXPR, std_alignof,
2114 : 19084145 : complain);
2115 : : }
2116 : :
2117 : : /* Return the size of the type, without producing any warnings for
2118 : : types whose size cannot be taken. This routine should be used only
2119 : : in some other routine that has already produced a diagnostic about
2120 : : using the size of such a type. */
2121 : : tree
2122 : 2008680 : cxx_sizeof_nowarn (tree type)
2123 : : {
2124 : 2008680 : if (TREE_CODE (type) == FUNCTION_TYPE
2125 : 2008680 : || VOID_TYPE_P (type)
2126 : 2008596 : || TREE_CODE (type) == ERROR_MARK)
2127 : 84 : return size_one_node;
2128 : 2008596 : else if (!COMPLETE_TYPE_P (type))
2129 : 23 : return size_zero_node;
2130 : : else
2131 : 2008573 : return cxx_sizeof_or_alignof_type (input_location, type,
2132 : 2008573 : SIZEOF_EXPR, false, false);
2133 : : }
2134 : :
2135 : : /* Process a sizeof expression where the operand is an expression. */
2136 : :
2137 : : static tree
2138 : 1310147 : cxx_sizeof_expr (location_t loc, tree e, tsubst_flags_t complain)
2139 : : {
2140 : 1310147 : if (e == error_mark_node)
2141 : : return error_mark_node;
2142 : :
2143 : 1309420 : if (instantiation_dependent_uneval_expression_p (e))
2144 : : {
2145 : 287198 : e = build_min (SIZEOF_EXPR, size_type_node, e);
2146 : 287198 : TREE_SIDE_EFFECTS (e) = 0;
2147 : 287198 : TREE_READONLY (e) = 1;
2148 : 287198 : SET_EXPR_LOCATION (e, loc);
2149 : :
2150 : 287198 : return e;
2151 : : }
2152 : :
2153 : 1022222 : location_t e_loc = cp_expr_loc_or_loc (e, loc);
2154 : 1022222 : STRIP_ANY_LOCATION_WRAPPER (e);
2155 : :
2156 : 1022222 : if (TREE_CODE (e) == PARM_DECL
2157 : 39877 : && DECL_ARRAY_PARAMETER_P (e)
2158 : 1022603 : && (complain & tf_warning))
2159 : : {
2160 : 120 : auto_diagnostic_group d;
2161 : 120 : if (warning_at (e_loc, OPT_Wsizeof_array_argument,
2162 : : "%<sizeof%> on array function parameter %qE "
2163 : 120 : "will return size of %qT", e, TREE_TYPE (e)))
2164 : 24 : inform (DECL_SOURCE_LOCATION (e), "declared here");
2165 : 120 : }
2166 : :
2167 : 1022222 : e = mark_type_use (e);
2168 : :
2169 : 1022222 : if (bitfield_p (e))
2170 : : {
2171 : 12 : if (complain & tf_error)
2172 : 6 : error_at (e_loc,
2173 : : "invalid application of %<sizeof%> to a bit-field");
2174 : : else
2175 : 6 : return error_mark_node;
2176 : 6 : e = char_type_node;
2177 : : }
2178 : 1022210 : else if (is_overloaded_fn (e))
2179 : : {
2180 : 33 : if (complain & tf_error)
2181 : 12 : permerror (e_loc, "ISO C++ forbids applying %<sizeof%> to "
2182 : : "an expression of function type");
2183 : : else
2184 : 21 : return error_mark_node;
2185 : 12 : e = char_type_node;
2186 : : }
2187 : 1022177 : else if (type_unknown_p (e))
2188 : : {
2189 : 0 : if (complain & tf_error)
2190 : 0 : cxx_incomplete_type_error (e_loc, e, TREE_TYPE (e));
2191 : : else
2192 : 0 : return error_mark_node;
2193 : 0 : e = char_type_node;
2194 : : }
2195 : : else
2196 : 1022177 : e = TREE_TYPE (e);
2197 : :
2198 : 1022195 : return cxx_sizeof_or_alignof_type (loc, e, SIZEOF_EXPR, false,
2199 : 1022195 : complain & tf_error);
2200 : : }
2201 : :
2202 : : /* Implement the __alignof keyword: Return the minimum required
2203 : : alignment of E, measured in bytes. For VAR_DECL's and
2204 : : FIELD_DECL's return DECL_ALIGN (which can be set from an
2205 : : "aligned" __attribute__ specification). STD_ALIGNOF acts
2206 : : like in cxx_sizeof_or_alignof_type. */
2207 : :
2208 : : static tree
2209 : 100865 : cxx_alignof_expr (location_t loc, tree e, bool std_alignof,
2210 : : tsubst_flags_t complain)
2211 : : {
2212 : 100865 : tree t;
2213 : :
2214 : 100865 : if (e == error_mark_node)
2215 : : return error_mark_node;
2216 : :
2217 : 100857 : if (processing_template_decl)
2218 : : {
2219 : 19154 : e = build_min (ALIGNOF_EXPR, size_type_node, e);
2220 : 19154 : TREE_SIDE_EFFECTS (e) = 0;
2221 : 19154 : TREE_READONLY (e) = 1;
2222 : 19154 : SET_EXPR_LOCATION (e, loc);
2223 : 19154 : ALIGNOF_EXPR_STD_P (e) = std_alignof;
2224 : :
2225 : 19154 : return e;
2226 : : }
2227 : :
2228 : 81703 : location_t e_loc = cp_expr_loc_or_loc (e, loc);
2229 : 81703 : STRIP_ANY_LOCATION_WRAPPER (e);
2230 : :
2231 : 81703 : e = mark_type_use (e);
2232 : :
2233 : 81703 : if (!verify_type_context (loc, TCTX_ALIGNOF, TREE_TYPE (e),
2234 : : !(complain & tf_error)))
2235 : : {
2236 : 0 : if (!(complain & tf_error))
2237 : 0 : return error_mark_node;
2238 : 0 : t = size_one_node;
2239 : : }
2240 : 81703 : else if (VAR_P (e))
2241 : 12270 : t = size_int (DECL_ALIGN_UNIT (e));
2242 : 69433 : else if (bitfield_p (e))
2243 : : {
2244 : 6 : if (complain & tf_error)
2245 : 6 : error_at (e_loc,
2246 : : "invalid application of %<__alignof%> to a bit-field");
2247 : : else
2248 : 0 : return error_mark_node;
2249 : 6 : t = size_one_node;
2250 : : }
2251 : 69427 : else if (TREE_CODE (e) == COMPONENT_REF
2252 : 69427 : && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL)
2253 : 37792 : t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e, 1)));
2254 : 31635 : else if (is_overloaded_fn (e))
2255 : : {
2256 : 6 : if (complain & tf_error)
2257 : 6 : permerror (e_loc, "ISO C++ forbids applying %<__alignof%> to "
2258 : : "an expression of function type");
2259 : : else
2260 : 0 : return error_mark_node;
2261 : 6 : if (TREE_CODE (e) == FUNCTION_DECL)
2262 : 3 : t = size_int (DECL_ALIGN_UNIT (e));
2263 : : else
2264 : 3 : t = size_one_node;
2265 : : }
2266 : 31629 : else if (type_unknown_p (e))
2267 : : {
2268 : 0 : if (complain & tf_error)
2269 : 0 : cxx_incomplete_type_error (e_loc, e, TREE_TYPE (e));
2270 : : else
2271 : 0 : return error_mark_node;
2272 : 0 : t = size_one_node;
2273 : : }
2274 : : else
2275 : 31629 : return cxx_sizeof_or_alignof_type (loc, TREE_TYPE (e),
2276 : : ALIGNOF_EXPR, std_alignof,
2277 : 31629 : complain & tf_error);
2278 : :
2279 : 50074 : return fold_convert_loc (loc, size_type_node, t);
2280 : : }
2281 : :
2282 : : /* Process a sizeof or alignof expression E with code OP where the operand
2283 : : is an expression. STD_ALIGNOF acts like in cxx_sizeof_or_alignof_type. */
2284 : :
2285 : : tree
2286 : 1411012 : cxx_sizeof_or_alignof_expr (location_t loc, tree e, enum tree_code op,
2287 : : bool std_alignof, bool complain)
2288 : : {
2289 : 1411012 : gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
2290 : 1411012 : if (op == SIZEOF_EXPR)
2291 : 1989675 : return cxx_sizeof_expr (loc, e, complain? tf_warning_or_error : tf_none);
2292 : : else
2293 : 100892 : return cxx_alignof_expr (loc, e, std_alignof,
2294 : 100865 : complain? tf_warning_or_error : tf_none);
2295 : : }
2296 : :
2297 : : /* Build a representation of an expression 'alignas(E).' Return the
2298 : : folded integer value of E if it is an integral constant expression
2299 : : that resolves to a valid alignment. If E depends on a template
2300 : : parameter, return a syntactic representation tree of kind
2301 : : ALIGNOF_EXPR. Otherwise, return an error_mark_node if the
2302 : : expression is ill formed, or NULL_TREE if E is NULL_TREE. */
2303 : :
2304 : : tree
2305 : 188165 : cxx_alignas_expr (tree e)
2306 : : {
2307 : 188165 : if (e == NULL_TREE || e == error_mark_node
2308 : 376330 : || (!TYPE_P (e) && !require_potential_rvalue_constant_expression (e)))
2309 : 0 : return e;
2310 : :
2311 : 188165 : if (TYPE_P (e))
2312 : : /* [dcl.align]/3:
2313 : :
2314 : : When the alignment-specifier is of the form
2315 : : alignas(type-id), it shall have the same effect as
2316 : : alignas(alignof(type-id)). */
2317 : :
2318 : 116273 : return cxx_sizeof_or_alignof_type (input_location,
2319 : : e, ALIGNOF_EXPR,
2320 : : /*std_alignof=*/true,
2321 : 116273 : /*complain=*/true);
2322 : :
2323 : : /* If we reach this point, it means the alignas expression if of
2324 : : the form "alignas(assignment-expression)", so we should follow
2325 : : what is stated by [dcl.align]/2. */
2326 : :
2327 : 71892 : if (value_dependent_expression_p (e))
2328 : : /* Leave value-dependent expression alone for now. */
2329 : : return e;
2330 : :
2331 : 17326 : e = instantiate_non_dependent_expr (e);
2332 : 17326 : e = mark_rvalue_use (e);
2333 : :
2334 : : /* [dcl.align]/2 says:
2335 : :
2336 : : the assignment-expression shall be an integral constant
2337 : : expression. */
2338 : :
2339 : 17326 : if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (e)))
2340 : : {
2341 : 18 : error ("%<alignas%> argument has non-integral type %qT", TREE_TYPE (e));
2342 : 18 : return error_mark_node;
2343 : : }
2344 : :
2345 : 17308 : return cxx_constant_value (e);
2346 : : }
2347 : :
2348 : :
2349 : : /* EXPR is being used in a context that is not a function call.
2350 : : Enforce:
2351 : :
2352 : : [expr.ref]
2353 : :
2354 : : The expression can be used only as the left-hand operand of a
2355 : : member function call.
2356 : :
2357 : : [expr.mptr.operator]
2358 : :
2359 : : If the result of .* or ->* is a function, then that result can be
2360 : : used only as the operand for the function call operator ().
2361 : :
2362 : : by issuing an error message if appropriate. Returns true iff EXPR
2363 : : violates these rules. */
2364 : :
2365 : : bool
2366 : 1063843054 : invalid_nonstatic_memfn_p (location_t loc, tree expr, tsubst_flags_t complain)
2367 : : {
2368 : 1063843054 : if (expr == NULL_TREE)
2369 : : return false;
2370 : : /* Don't enforce this in MS mode. */
2371 : 1063841635 : if (flag_ms_extensions)
2372 : : return false;
2373 : 1063837186 : if (is_overloaded_fn (expr) && !really_overloaded_fn (expr))
2374 : 83306324 : expr = get_first_fn (expr);
2375 : 1063837186 : if (TREE_TYPE (expr)
2376 : 1063837186 : && DECL_IOBJ_MEMBER_FUNCTION_P (expr))
2377 : : {
2378 : 91 : if (complain & tf_error)
2379 : : {
2380 : 87 : if (DECL_P (expr))
2381 : : {
2382 : 69 : auto_diagnostic_group d;
2383 : 69 : error_at (loc, "invalid use of non-static member function %qD",
2384 : : expr);
2385 : 69 : inform (DECL_SOURCE_LOCATION (expr), "declared here");
2386 : 69 : }
2387 : : else
2388 : 18 : error_at (loc, "invalid use of non-static member function of "
2389 : 18 : "type %qT", TREE_TYPE (expr));
2390 : : }
2391 : 91 : return true;
2392 : : }
2393 : : return false;
2394 : : }
2395 : :
2396 : : /* If EXP is a reference to a bit-field, and the type of EXP does not
2397 : : match the declared type of the bit-field, return the declared type
2398 : : of the bit-field. Otherwise, return NULL_TREE. */
2399 : :
2400 : : tree
2401 : 2522907509 : is_bitfield_expr_with_lowered_type (const_tree exp)
2402 : : {
2403 : 3521365547 : switch (TREE_CODE (exp))
2404 : : {
2405 : 4599714 : case COND_EXPR:
2406 : 9199428 : if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1)
2407 : 4599688 : ? TREE_OPERAND (exp, 1)
2408 : 26 : : TREE_OPERAND (exp, 0)))
2409 : : return NULL_TREE;
2410 : 135 : return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 2));
2411 : :
2412 : 596028 : case COMPOUND_EXPR:
2413 : 596028 : return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1));
2414 : :
2415 : 328945947 : case MODIFY_EXPR:
2416 : 328945947 : case SAVE_EXPR:
2417 : 328945947 : case UNARY_PLUS_EXPR:
2418 : 328945947 : case PREDECREMENT_EXPR:
2419 : 328945947 : case PREINCREMENT_EXPR:
2420 : 328945947 : case POSTDECREMENT_EXPR:
2421 : 328945947 : case POSTINCREMENT_EXPR:
2422 : 328945947 : case NEGATE_EXPR:
2423 : 328945947 : case NON_LVALUE_EXPR:
2424 : 328945947 : case BIT_NOT_EXPR:
2425 : 328945947 : case CLEANUP_POINT_EXPR:
2426 : 328945947 : return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
2427 : :
2428 : 221041917 : case COMPONENT_REF:
2429 : 221041917 : {
2430 : 221041917 : tree field;
2431 : :
2432 : 221041917 : field = TREE_OPERAND (exp, 1);
2433 : 221041917 : if (TREE_CODE (field) != FIELD_DECL || !DECL_BIT_FIELD_TYPE (field))
2434 : : return NULL_TREE;
2435 : 35194114 : if (same_type_ignoring_top_level_qualifiers_p
2436 : 35194114 : (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
2437 : : return NULL_TREE;
2438 : 35043205 : return DECL_BIT_FIELD_TYPE (field);
2439 : : }
2440 : :
2441 : 485009587 : case VAR_DECL:
2442 : 485009587 : if (DECL_HAS_VALUE_EXPR_P (exp))
2443 : 1240763 : return is_bitfield_expr_with_lowered_type (DECL_VALUE_EXPR
2444 : 1240763 : (CONST_CAST_TREE (exp)));
2445 : : return NULL_TREE;
2446 : :
2447 : 674546349 : case VIEW_CONVERT_EXPR:
2448 : 674546349 : if (location_wrapper_p (exp))
2449 : 667675165 : return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
2450 : : else
2451 : : return NULL_TREE;
2452 : :
2453 : : default:
2454 : : return NULL_TREE;
2455 : : }
2456 : : }
2457 : :
2458 : : /* Like is_bitfield_with_lowered_type, except that if EXP is not a
2459 : : bitfield with a lowered type, the type of EXP is returned, rather
2460 : : than NULL_TREE. */
2461 : :
2462 : : tree
2463 : 1197609803 : unlowered_expr_type (const_tree exp)
2464 : : {
2465 : 1197609803 : tree type;
2466 : 1197609803 : tree etype = TREE_TYPE (exp);
2467 : :
2468 : 1197609803 : type = is_bitfield_expr_with_lowered_type (exp);
2469 : 1197609803 : if (type)
2470 : 30361292 : type = cp_build_qualified_type (type, cp_type_quals (etype));
2471 : : else
2472 : : type = etype;
2473 : :
2474 : 1197609803 : return type;
2475 : : }
2476 : :
2477 : : /* Perform the conversions in [expr] that apply when an lvalue appears
2478 : : in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
2479 : : function-to-pointer conversions. In addition, bitfield references are
2480 : : converted to their declared types. Note that this function does not perform
2481 : : the lvalue-to-rvalue conversion for class types. If you need that conversion
2482 : : for class types, then you probably need to use force_rvalue.
2483 : :
2484 : : Although the returned value is being used as an rvalue, this
2485 : : function does not wrap the returned expression in a
2486 : : NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
2487 : : that the return value is no longer an lvalue. */
2488 : :
2489 : : tree
2490 : 854371341 : decay_conversion (tree exp,
2491 : : tsubst_flags_t complain,
2492 : : bool reject_builtin /* = true */)
2493 : : {
2494 : 854371341 : tree type;
2495 : 854371341 : enum tree_code code;
2496 : 854371341 : location_t loc = cp_expr_loc_or_input_loc (exp);
2497 : :
2498 : 854371341 : type = TREE_TYPE (exp);
2499 : 854371341 : if (type == error_mark_node)
2500 : : return error_mark_node;
2501 : :
2502 : 854371128 : exp = resolve_nondeduced_context_or_error (exp, complain);
2503 : :
2504 : 854371128 : code = TREE_CODE (type);
2505 : :
2506 : 854371128 : if (error_operand_p (exp))
2507 : 90 : return error_mark_node;
2508 : :
2509 : 854371038 : if (NULLPTR_TYPE_P (type) && !TREE_SIDE_EFFECTS (exp))
2510 : : {
2511 : 1395378 : mark_rvalue_use (exp, loc, reject_builtin);
2512 : 1395378 : return nullptr_node;
2513 : : }
2514 : :
2515 : : /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2516 : : Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
2517 : 852975660 : if (code == VOID_TYPE)
2518 : : {
2519 : 5764 : if (complain & tf_error)
2520 : 3 : error_at (loc, "void value not ignored as it ought to be");
2521 : 5764 : return error_mark_node;
2522 : : }
2523 : 852969896 : if (invalid_nonstatic_memfn_p (loc, exp, complain))
2524 : 6 : return error_mark_node;
2525 : 852969890 : if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
2526 : : {
2527 : 84308334 : exp = mark_lvalue_use (exp);
2528 : 84308334 : if (reject_builtin && reject_gcc_builtin (exp, loc))
2529 : 110 : return error_mark_node;
2530 : 84308224 : return cp_build_addr_expr (exp, complain);
2531 : : }
2532 : 768661556 : if (code == ARRAY_TYPE)
2533 : : {
2534 : 4654112 : tree adr;
2535 : 4654112 : tree ptrtype;
2536 : :
2537 : 4654112 : exp = mark_lvalue_use (exp);
2538 : :
2539 : 4654112 : if (INDIRECT_REF_P (exp))
2540 : 86086 : return build_nop (build_pointer_type (TREE_TYPE (type)),
2541 : 172172 : TREE_OPERAND (exp, 0));
2542 : :
2543 : 4568026 : if (TREE_CODE (exp) == COMPOUND_EXPR)
2544 : : {
2545 : 3 : tree op1 = decay_conversion (TREE_OPERAND (exp, 1), complain);
2546 : 3 : if (op1 == error_mark_node)
2547 : : return error_mark_node;
2548 : 3 : return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
2549 : 6 : TREE_OPERAND (exp, 0), op1);
2550 : : }
2551 : :
2552 : 4568023 : if (!obvalue_p (exp)
2553 : 4568023 : && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
2554 : : {
2555 : 0 : if (complain & tf_error)
2556 : 0 : error_at (loc, "invalid use of non-lvalue array");
2557 : 0 : return error_mark_node;
2558 : : }
2559 : :
2560 : 4568023 : ptrtype = build_pointer_type (TREE_TYPE (type));
2561 : :
2562 : 4568023 : if (VAR_P (exp))
2563 : : {
2564 : 480966 : if (!cxx_mark_addressable (exp))
2565 : 0 : return error_mark_node;
2566 : 480966 : adr = build_nop (ptrtype, build_address (exp));
2567 : 480966 : return adr;
2568 : : }
2569 : : /* This way is better for a COMPONENT_REF since it can
2570 : : simplify the offset for a component. */
2571 : 4087057 : adr = cp_build_addr_expr (exp, complain);
2572 : 4087057 : return cp_convert (ptrtype, adr, complain);
2573 : : }
2574 : :
2575 : : /* Otherwise, it's the lvalue-to-rvalue conversion. */
2576 : 764007444 : exp = mark_rvalue_use (exp, loc, reject_builtin);
2577 : :
2578 : : /* If a bitfield is used in a context where integral promotion
2579 : : applies, then the caller is expected to have used
2580 : : default_conversion. That function promotes bitfields correctly
2581 : : before calling this function. At this point, if we have a
2582 : : bitfield referenced, we may assume that is not subject to
2583 : : promotion, and that, therefore, the type of the resulting rvalue
2584 : : is the declared type of the bitfield. */
2585 : 764007444 : exp = convert_bitfield_to_declared_type (exp);
2586 : :
2587 : : /* We do not call rvalue() here because we do not want to wrap EXP
2588 : : in a NON_LVALUE_EXPR. */
2589 : :
2590 : : /* [basic.lval]
2591 : :
2592 : : Non-class rvalues always have cv-unqualified types. */
2593 : 764007444 : type = TREE_TYPE (exp);
2594 : 764007444 : if (!CLASS_TYPE_P (type) && cv_qualified_p (type))
2595 : 239181738 : exp = build_nop (cv_unqualified (type), exp);
2596 : :
2597 : 764007444 : if (!complete_type_or_maybe_complain (type, exp, complain))
2598 : 42 : return error_mark_node;
2599 : :
2600 : : return exp;
2601 : : }
2602 : :
2603 : : /* Perform preparatory conversions, as part of the "usual arithmetic
2604 : : conversions". In particular, as per [expr]:
2605 : :
2606 : : Whenever an lvalue expression appears as an operand of an
2607 : : operator that expects the rvalue for that operand, the
2608 : : lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2609 : : standard conversions are applied to convert the expression to an
2610 : : rvalue.
2611 : :
2612 : : In addition, we perform integral promotions here, as those are
2613 : : applied to both operands to a binary operator before determining
2614 : : what additional conversions should apply. */
2615 : :
2616 : : static tree
2617 : 238174811 : cp_default_conversion (tree exp, tsubst_flags_t complain)
2618 : : {
2619 : : /* Check for target-specific promotions. */
2620 : 238174811 : tree promoted_type = targetm.promoted_type (TREE_TYPE (exp));
2621 : 238174811 : if (promoted_type)
2622 : 0 : exp = cp_convert (promoted_type, exp, complain);
2623 : : /* Perform the integral promotions first so that bitfield
2624 : : expressions (which may promote to "int", even if the bitfield is
2625 : : declared "unsigned") are promoted correctly. */
2626 : 238174811 : else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
2627 : 154148802 : exp = cp_perform_integral_promotions (exp, complain);
2628 : : /* Perform the other conversions. */
2629 : 238174811 : exp = decay_conversion (exp, complain);
2630 : :
2631 : 238174811 : return exp;
2632 : : }
2633 : :
2634 : : /* C version. */
2635 : :
2636 : : tree
2637 : 25326374 : default_conversion (tree exp)
2638 : : {
2639 : 25326374 : return cp_default_conversion (exp, tf_warning_or_error);
2640 : : }
2641 : :
2642 : : /* EXPR is an expression with an integral or enumeration type.
2643 : : Perform the integral promotions in [conv.prom], and return the
2644 : : converted value. */
2645 : :
2646 : : tree
2647 : 162521516 : cp_perform_integral_promotions (tree expr, tsubst_flags_t complain)
2648 : : {
2649 : 162521516 : tree type;
2650 : 162521516 : tree promoted_type;
2651 : :
2652 : 162521516 : expr = mark_rvalue_use (expr);
2653 : 162521516 : if (error_operand_p (expr))
2654 : 3 : return error_mark_node;
2655 : :
2656 : 162521513 : type = TREE_TYPE (expr);
2657 : :
2658 : : /* [conv.prom]
2659 : :
2660 : : A prvalue for an integral bit-field (11.3.9) can be converted to a prvalue
2661 : : of type int if int can represent all the values of the bit-field;
2662 : : otherwise, it can be converted to unsigned int if unsigned int can
2663 : : represent all the values of the bit-field. If the bit-field is larger yet,
2664 : : no integral promotion applies to it. If the bit-field has an enumerated
2665 : : type, it is treated as any other value of that type for promotion
2666 : : purposes. */
2667 : 162521513 : tree bitfield_type = is_bitfield_expr_with_lowered_type (expr);
2668 : 162521513 : if (bitfield_type
2669 : 162521513 : && (TREE_CODE (bitfield_type) == ENUMERAL_TYPE
2670 : 250735 : || TYPE_PRECISION (type) > TYPE_PRECISION (integer_type_node)))
2671 : : type = bitfield_type;
2672 : :
2673 : 162521513 : gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
2674 : : /* Scoped enums don't promote. */
2675 : 162521513 : if (SCOPED_ENUM_P (type))
2676 : : return expr;
2677 : 162097827 : promoted_type = type_promotes_to (type);
2678 : 162097827 : if (type != promoted_type)
2679 : 50147258 : expr = cp_convert (promoted_type, expr, complain);
2680 : 111950569 : else if (bitfield_type && bitfield_type != type)
2681 : : /* Prevent decay_conversion from converting to bitfield_type. */
2682 : 159 : expr = build_nop (type, expr);
2683 : : return expr;
2684 : : }
2685 : :
2686 : : /* C version. */
2687 : :
2688 : : tree
2689 : 1728993 : perform_integral_promotions (tree expr)
2690 : : {
2691 : 1728993 : return cp_perform_integral_promotions (expr, tf_warning_or_error);
2692 : : }
2693 : :
2694 : : /* Returns nonzero iff exp is a STRING_CST or the result of applying
2695 : : decay_conversion to one. */
2696 : :
2697 : : int
2698 : 2978077 : string_conv_p (const_tree totype, const_tree exp, int warn)
2699 : : {
2700 : 2978077 : tree t;
2701 : :
2702 : 2978077 : if (!TYPE_PTR_P (totype))
2703 : : return 0;
2704 : :
2705 : 2978026 : t = TREE_TYPE (totype);
2706 : 2978026 : if (!same_type_p (t, char_type_node)
2707 : 2839274 : && !same_type_p (t, char8_type_node)
2708 : 2820006 : && !same_type_p (t, char16_type_node)
2709 : 2762202 : && !same_type_p (t, char32_type_node)
2710 : 5682426 : && !same_type_p (t, wchar_type_node))
2711 : : return 0;
2712 : :
2713 : 322977 : location_t loc = EXPR_LOC_OR_LOC (exp, input_location);
2714 : :
2715 : 322977 : STRIP_ANY_LOCATION_WRAPPER (exp);
2716 : :
2717 : 322977 : if (TREE_CODE (exp) == STRING_CST)
2718 : : {
2719 : : /* Make sure that we don't try to convert between char and wide chars. */
2720 : 108 : if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
2721 : : return 0;
2722 : : }
2723 : : else
2724 : : {
2725 : : /* Is this a string constant which has decayed to 'const char *'? */
2726 : 322869 : t = build_pointer_type (cp_build_qualified_type (t, TYPE_QUAL_CONST));
2727 : 322869 : if (!same_type_p (TREE_TYPE (exp), t))
2728 : : return 0;
2729 : 59475 : STRIP_NOPS (exp);
2730 : 59475 : if (TREE_CODE (exp) != ADDR_EXPR
2731 : 59475 : || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
2732 : : return 0;
2733 : : }
2734 : 306 : if (warn)
2735 : : {
2736 : 102 : if (cxx_dialect >= cxx11)
2737 : 87 : pedwarn (loc, OPT_Wwrite_strings,
2738 : : "ISO C++ forbids converting a string constant to %qT",
2739 : : totype);
2740 : : else
2741 : 15 : warning_at (loc, OPT_Wwrite_strings,
2742 : : "deprecated conversion from string constant to %qT",
2743 : : totype);
2744 : : }
2745 : :
2746 : : return 1;
2747 : : }
2748 : :
2749 : : /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2750 : : can, for example, use as an lvalue. This code used to be in
2751 : : unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2752 : : expressions, where we're dealing with aggregates. But now it's again only
2753 : : called from unary_complex_lvalue. The case (in particular) that led to
2754 : : this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2755 : : get it there. */
2756 : :
2757 : : static tree
2758 : 91276 : rationalize_conditional_expr (enum tree_code code, tree t,
2759 : : tsubst_flags_t complain)
2760 : : {
2761 : 91276 : location_t loc = cp_expr_loc_or_input_loc (t);
2762 : :
2763 : : /* For MIN_EXPR or MAX_EXPR, fold-const.cc has arranged things so that
2764 : : the first operand is always the one to be used if both operands
2765 : : are equal, so we know what conditional expression this used to be. */
2766 : 91276 : if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
2767 : : {
2768 : 0 : tree op0 = TREE_OPERAND (t, 0);
2769 : 0 : tree op1 = TREE_OPERAND (t, 1);
2770 : :
2771 : : /* The following code is incorrect if either operand side-effects. */
2772 : 0 : gcc_assert (!TREE_SIDE_EFFECTS (op0)
2773 : : && !TREE_SIDE_EFFECTS (op1));
2774 : 0 : return
2775 : 0 : build_conditional_expr (loc,
2776 : 0 : build_x_binary_op (loc,
2777 : 0 : (TREE_CODE (t) == MIN_EXPR
2778 : : ? LE_EXPR : GE_EXPR),
2779 : 0 : op0, TREE_CODE (op0),
2780 : 0 : op1, TREE_CODE (op1),
2781 : : NULL_TREE,
2782 : : /*overload=*/NULL,
2783 : : complain),
2784 : : cp_build_unary_op (code, op0, false, complain),
2785 : : cp_build_unary_op (code, op1, false, complain),
2786 : : complain);
2787 : : }
2788 : :
2789 : 91276 : tree op1 = TREE_OPERAND (t, 1);
2790 : 91276 : if (TREE_CODE (op1) != THROW_EXPR)
2791 : 91273 : op1 = cp_build_unary_op (code, op1, false, complain);
2792 : 91276 : tree op2 = TREE_OPERAND (t, 2);
2793 : 91276 : if (TREE_CODE (op2) != THROW_EXPR)
2794 : 91270 : op2 = cp_build_unary_op (code, op2, false, complain);
2795 : :
2796 : 91276 : return
2797 : 91276 : build_conditional_expr (loc, TREE_OPERAND (t, 0), op1, op2, complain);
2798 : : }
2799 : :
2800 : : /* Given the TYPE of an anonymous union field inside T, return the
2801 : : FIELD_DECL for the field. If not found return NULL_TREE. Because
2802 : : anonymous unions can nest, we must also search all anonymous unions
2803 : : that are directly reachable. */
2804 : :
2805 : : tree
2806 : 985321 : lookup_anon_field (tree, tree type)
2807 : : {
2808 : 985321 : tree field;
2809 : :
2810 : 985321 : type = TYPE_MAIN_VARIANT (type);
2811 : 985321 : field = ANON_AGGR_TYPE_FIELD (type);
2812 : 985321 : gcc_assert (field);
2813 : 985321 : return field;
2814 : : }
2815 : :
2816 : : /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2817 : : expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2818 : : non-NULL, it indicates the path to the base used to name MEMBER.
2819 : : If PRESERVE_REFERENCE is true, the expression returned will have
2820 : : REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2821 : : returned will have the type referred to by the reference.
2822 : :
2823 : : This function does not perform access control; that is either done
2824 : : earlier by the parser when the name of MEMBER is resolved to MEMBER
2825 : : itself, or later when overload resolution selects one of the
2826 : : functions indicated by MEMBER. */
2827 : :
2828 : : tree
2829 : 95051469 : build_class_member_access_expr (cp_expr object, tree member,
2830 : : tree access_path, bool preserve_reference,
2831 : : tsubst_flags_t complain)
2832 : : {
2833 : 95051469 : tree object_type;
2834 : 95051469 : tree member_scope;
2835 : 95051469 : tree result = NULL_TREE;
2836 : 95051469 : tree using_decl = NULL_TREE;
2837 : :
2838 : 95051469 : if (error_operand_p (object) || error_operand_p (member))
2839 : 48 : return error_mark_node;
2840 : :
2841 : 95051421 : gcc_assert (DECL_P (member) || BASELINK_P (member));
2842 : :
2843 : : /* [expr.ref]
2844 : :
2845 : : The type of the first expression shall be "class object" (of a
2846 : : complete type). */
2847 : 95051421 : object_type = TREE_TYPE (object);
2848 : 95051421 : if (!currently_open_class (object_type)
2849 : 95051421 : && !complete_type_or_maybe_complain (object_type, object, complain))
2850 : 0 : return error_mark_node;
2851 : 95051421 : if (!CLASS_TYPE_P (object_type))
2852 : : {
2853 : 0 : if (complain & tf_error)
2854 : : {
2855 : 0 : if (INDIRECT_TYPE_P (object_type)
2856 : 0 : && CLASS_TYPE_P (TREE_TYPE (object_type)))
2857 : 0 : error ("request for member %qD in %qE, which is of pointer "
2858 : : "type %qT (maybe you meant to use %<->%> ?)",
2859 : : member, object.get_value (), object_type);
2860 : : else
2861 : 0 : error ("request for member %qD in %qE, which is of non-class "
2862 : : "type %qT", member, object.get_value (), object_type);
2863 : : }
2864 : 0 : return error_mark_node;
2865 : : }
2866 : :
2867 : : /* The standard does not seem to actually say that MEMBER must be a
2868 : : member of OBJECT_TYPE. However, that is clearly what is
2869 : : intended. */
2870 : 95051421 : if (DECL_P (member))
2871 : : {
2872 : 40608096 : member_scope = DECL_CLASS_CONTEXT (member);
2873 : 40608096 : if (!mark_used (member, complain) && !(complain & tf_error))
2874 : 0 : return error_mark_node;
2875 : :
2876 : 40608096 : if (TREE_UNAVAILABLE (member))
2877 : 30 : error_unavailable_use (member, NULL_TREE);
2878 : 40608066 : else if (TREE_DEPRECATED (member))
2879 : 30 : warn_deprecated_use (member, NULL_TREE);
2880 : : }
2881 : : else
2882 : 54443325 : member_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (member));
2883 : : /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2884 : : presently be the anonymous union. Go outwards until we find a
2885 : : type related to OBJECT_TYPE. */
2886 : 96040456 : while ((ANON_AGGR_TYPE_P (member_scope) || UNSCOPED_ENUM_P (member_scope))
2887 : 97029892 : && !same_type_ignoring_top_level_qualifiers_p (member_scope,
2888 : : object_type))
2889 : 989035 : member_scope = TYPE_CONTEXT (member_scope);
2890 : 95051421 : if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
2891 : : {
2892 : 3 : if (complain & tf_error)
2893 : : {
2894 : 3 : if (TREE_CODE (member) == FIELD_DECL)
2895 : 0 : error ("invalid use of non-static data member %qE", member);
2896 : : else
2897 : 3 : error ("%qD is not a member of %qT", member, object_type);
2898 : : }
2899 : 3 : return error_mark_node;
2900 : : }
2901 : :
2902 : : /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2903 : : `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2904 : : in the front end; only _DECLs and _REFs are lvalues in the back end. */
2905 : 95051418 : if (tree temp = unary_complex_lvalue (ADDR_EXPR, object))
2906 : : {
2907 : 38 : temp = cp_build_fold_indirect_ref (temp);
2908 : 38 : if (!lvalue_p (object) && lvalue_p (temp))
2909 : : /* Preserve rvalueness. */
2910 : 6 : temp = move (temp);
2911 : 38 : object = temp;
2912 : : }
2913 : :
2914 : : /* In [expr.ref], there is an explicit list of the valid choices for
2915 : : MEMBER. We check for each of those cases here. */
2916 : 95051418 : if (VAR_P (member))
2917 : : {
2918 : : /* A static data member. */
2919 : 86157 : result = member;
2920 : 86157 : mark_exp_read (object);
2921 : :
2922 : 86157 : if (tree wrap = maybe_get_tls_wrapper_call (result))
2923 : : /* Replace an evaluated use of the thread_local variable with
2924 : : a call to its wrapper. */
2925 : 102 : result = wrap;
2926 : :
2927 : : /* If OBJECT has side-effects, they are supposed to occur. */
2928 : 86157 : if (TREE_SIDE_EFFECTS (object))
2929 : 51 : result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
2930 : : }
2931 : 94965261 : else if (TREE_CODE (member) == FIELD_DECL)
2932 : : {
2933 : : /* A non-static data member. */
2934 : 40521813 : bool null_object_p;
2935 : 40521813 : int type_quals;
2936 : 40521813 : tree member_type;
2937 : :
2938 : 40521813 : if (INDIRECT_REF_P (object))
2939 : 30684409 : null_object_p =
2940 : 30684409 : integer_zerop (tree_strip_nop_conversions (TREE_OPERAND (object, 0)));
2941 : : else
2942 : : null_object_p = false;
2943 : :
2944 : : /* Convert OBJECT to the type of MEMBER. */
2945 : 40521813 : if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
2946 : : TYPE_MAIN_VARIANT (member_scope)))
2947 : : {
2948 : 1637920 : tree binfo;
2949 : 1637920 : base_kind kind;
2950 : :
2951 : : /* We didn't complain above about a currently open class, but now we
2952 : : must: we don't know how to refer to a base member before layout is
2953 : : complete. But still don't complain in a template. */
2954 : 1637920 : if (!cp_unevaluated_operand
2955 : 1637563 : && !dependent_type_p (object_type)
2956 : 2998382 : && !complete_type_or_maybe_complain (object_type, object,
2957 : : complain))
2958 : 9 : return error_mark_node;
2959 : :
2960 : 2043344 : binfo = lookup_base (access_path ? access_path : object_type,
2961 : : member_scope, ba_unique, &kind, complain);
2962 : 1637917 : if (binfo == error_mark_node)
2963 : : return error_mark_node;
2964 : :
2965 : : /* It is invalid to try to get to a virtual base of a
2966 : : NULL object. The most common cause is invalid use of
2967 : : offsetof macro. */
2968 : 1637917 : if (null_object_p && kind == bk_via_virtual)
2969 : : {
2970 : 6 : if (complain & tf_error)
2971 : : {
2972 : 6 : error ("invalid access to non-static data member %qD in "
2973 : : "virtual base of NULL object", member);
2974 : : }
2975 : 6 : return error_mark_node;
2976 : : }
2977 : :
2978 : : /* Convert to the base. */
2979 : 3275822 : object = build_base_path (PLUS_EXPR, object, binfo,
2980 : 1637911 : /*nonnull=*/1, complain);
2981 : : /* If we found the base successfully then we should be able
2982 : : to convert to it successfully. */
2983 : 1637911 : gcc_assert (object != error_mark_node);
2984 : : }
2985 : :
2986 : : /* If MEMBER is from an anonymous aggregate, we have converted
2987 : : OBJECT so that it refers to the class containing the
2988 : : anonymous union. Generate a reference to the anonymous union
2989 : : itself, and recur to find MEMBER. */
2990 : 81043608 : if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
2991 : : /* When this code is called from build_field_call, the
2992 : : object already has the type of the anonymous union.
2993 : : That is because the COMPONENT_REF was already
2994 : : constructed, and was then disassembled before calling
2995 : : build_field_call. After the function-call code is
2996 : : cleaned up, this waste can be eliminated. */
2997 : 41507364 : && (!same_type_ignoring_top_level_qualifiers_p
2998 : 985560 : (TREE_TYPE (object), DECL_CONTEXT (member))))
2999 : : {
3000 : 985165 : tree anonymous_union;
3001 : :
3002 : 985165 : anonymous_union = lookup_anon_field (TREE_TYPE (object),
3003 : 985165 : DECL_CONTEXT (member));
3004 : 985165 : object = build_class_member_access_expr (object,
3005 : : anonymous_union,
3006 : : /*access_path=*/NULL_TREE,
3007 : : preserve_reference,
3008 : 985165 : complain);
3009 : : }
3010 : :
3011 : : /* Compute the type of the field, as described in [expr.ref]. */
3012 : 40521804 : type_quals = TYPE_UNQUALIFIED;
3013 : 40521804 : member_type = TREE_TYPE (member);
3014 : 40521804 : if (!TYPE_REF_P (member_type))
3015 : : {
3016 : 39747956 : type_quals = (cp_type_quals (member_type)
3017 : 39747956 : | cp_type_quals (object_type));
3018 : :
3019 : : /* A field is const (volatile) if the enclosing object, or the
3020 : : field itself, is const (volatile). But, a mutable field is
3021 : : not const, even within a const object. */
3022 : 39747956 : if (DECL_MUTABLE_P (member))
3023 : 317740 : type_quals &= ~TYPE_QUAL_CONST;
3024 : 39747956 : member_type = cp_build_qualified_type (member_type, type_quals);
3025 : : }
3026 : :
3027 : 40521804 : result = build3_loc (input_location, COMPONENT_REF, member_type,
3028 : : object, member, NULL_TREE);
3029 : :
3030 : : /* Mark the expression const or volatile, as appropriate. Even
3031 : : though we've dealt with the type above, we still have to mark the
3032 : : expression itself. */
3033 : 40521804 : if (type_quals & TYPE_QUAL_CONST)
3034 : 12953605 : TREE_READONLY (result) = 1;
3035 : 40521804 : if (type_quals & TYPE_QUAL_VOLATILE)
3036 : 179057 : TREE_THIS_VOLATILE (result) = 1;
3037 : : }
3038 : 54443448 : else if (BASELINK_P (member))
3039 : : {
3040 : : /* The member is a (possibly overloaded) member function. */
3041 : 54443322 : tree functions;
3042 : 54443322 : tree type;
3043 : :
3044 : : /* If the MEMBER is exactly one static member function, then we
3045 : : know the type of the expression. Otherwise, we must wait
3046 : : until overload resolution has been performed. */
3047 : 54443322 : functions = BASELINK_FUNCTIONS (member);
3048 : 54443322 : if (TREE_CODE (functions) == OVERLOAD && OVL_SINGLE_P (functions))
3049 : 54443322 : functions = OVL_FIRST (functions);
3050 : 54443322 : if (TREE_CODE (functions) == FUNCTION_DECL
3051 : 54443322 : && DECL_STATIC_FUNCTION_P (functions))
3052 : 421573 : type = TREE_TYPE (functions);
3053 : : else
3054 : 54021749 : type = unknown_type_node;
3055 : : /* Note that we do not convert OBJECT to the BASELINK_BINFO
3056 : : base. That will happen when the function is called. */
3057 : 54443322 : result = build3_loc (input_location, COMPONENT_REF, type, object, member,
3058 : : NULL_TREE);
3059 : : }
3060 : 126 : else if (TREE_CODE (member) == CONST_DECL)
3061 : : {
3062 : : /* The member is an enumerator. */
3063 : 110 : result = member;
3064 : : /* If OBJECT has side-effects, they are supposed to occur. */
3065 : 110 : if (TREE_SIDE_EFFECTS (object))
3066 : 6 : result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
3067 : : object, result);
3068 : : }
3069 : 16 : else if ((using_decl = strip_using_decl (member)) != member)
3070 : 0 : result = build_class_member_access_expr (object,
3071 : : using_decl,
3072 : : access_path, preserve_reference,
3073 : : complain);
3074 : : else
3075 : : {
3076 : 16 : if (complain & tf_error)
3077 : 12 : error ("invalid use of %qD", member);
3078 : 16 : return error_mark_node;
3079 : : }
3080 : :
3081 : 95051393 : if (!preserve_reference)
3082 : : /* [expr.ref]
3083 : :
3084 : : If E2 is declared to have type "reference to T", then ... the
3085 : : type of E1.E2 is T. */
3086 : 89928877 : result = convert_from_reference (result);
3087 : :
3088 : : return result;
3089 : : }
3090 : :
3091 : : /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
3092 : : SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
3093 : :
3094 : : tree
3095 : 146415 : lookup_destructor (tree object, tree scope, tree dtor_name,
3096 : : tsubst_flags_t complain)
3097 : : {
3098 : 146415 : tree object_type = TREE_TYPE (object);
3099 : 146415 : tree dtor_type = TREE_OPERAND (dtor_name, 0);
3100 : 146415 : tree expr;
3101 : :
3102 : : /* We've already complained about this destructor. */
3103 : 146415 : if (dtor_type == error_mark_node)
3104 : : return error_mark_node;
3105 : :
3106 : 146409 : if (scope && !check_dtor_name (scope, dtor_type))
3107 : : {
3108 : 3 : if (complain & tf_error)
3109 : 3 : error ("qualified type %qT does not match destructor name ~%qT",
3110 : : scope, dtor_type);
3111 : 3 : return error_mark_node;
3112 : : }
3113 : 146406 : if (is_auto (dtor_type))
3114 : : dtor_type = object_type;
3115 : 146403 : else if (identifier_p (dtor_type))
3116 : : {
3117 : : /* In a template, names we can't find a match for are still accepted
3118 : : destructor names, and we check them here. */
3119 : 23 : if (check_dtor_name (object_type, dtor_type))
3120 : : dtor_type = object_type;
3121 : : else
3122 : : {
3123 : 3 : if (complain & tf_error)
3124 : 3 : error ("object type %qT does not match destructor name ~%qT",
3125 : : object_type, dtor_type);
3126 : 3 : return error_mark_node;
3127 : : }
3128 : :
3129 : : }
3130 : 146380 : else if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
3131 : : {
3132 : 6 : if (complain & tf_error)
3133 : 6 : error ("the type being destroyed is %qT, but the destructor "
3134 : 6 : "refers to %qT", TYPE_MAIN_VARIANT (object_type), dtor_type);
3135 : 6 : return error_mark_node;
3136 : : }
3137 : 146397 : expr = lookup_member (dtor_type, complete_dtor_identifier,
3138 : : /*protect=*/1, /*want_type=*/false,
3139 : : tf_warning_or_error);
3140 : 146397 : if (!expr)
3141 : : {
3142 : 6 : if (complain & tf_error)
3143 : 6 : cxx_incomplete_type_error (dtor_name, dtor_type);
3144 : 6 : return error_mark_node;
3145 : : }
3146 : 146391 : expr = (adjust_result_of_qualified_name_lookup
3147 : 146391 : (expr, dtor_type, object_type));
3148 : 146391 : if (scope == NULL_TREE)
3149 : : /* We need to call adjust_result_of_qualified_name_lookup in case the
3150 : : destructor names a base class, but we unset BASELINK_QUALIFIED_P so
3151 : : that we still get virtual function binding. */
3152 : 146248 : BASELINK_QUALIFIED_P (expr) = false;
3153 : : return expr;
3154 : : }
3155 : :
3156 : : /* An expression of the form "A::template B" has been resolved to
3157 : : DECL. Issue a diagnostic if B is not a template or template
3158 : : specialization. */
3159 : :
3160 : : void
3161 : 2992745 : check_template_keyword (tree decl)
3162 : : {
3163 : : /* The standard says:
3164 : :
3165 : : [temp.names]
3166 : :
3167 : : If a name prefixed by the keyword template is not a member
3168 : : template, the program is ill-formed.
3169 : :
3170 : : DR 228 removed the restriction that the template be a member
3171 : : template.
3172 : :
3173 : : DR 96, if accepted would add the further restriction that explicit
3174 : : template arguments must be provided if the template keyword is
3175 : : used, but, as of 2005-10-16, that DR is still in "drafting". If
3176 : : this DR is accepted, then the semantic checks here can be
3177 : : simplified, as the entity named must in fact be a template
3178 : : specialization, rather than, as at present, a set of overloaded
3179 : : functions containing at least one template function. */
3180 : 2992745 : if (TREE_CODE (decl) != TEMPLATE_DECL
3181 : 2992745 : && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
3182 : : {
3183 : 2762376 : if (VAR_P (decl))
3184 : : {
3185 : 9755 : if (DECL_USE_TEMPLATE (decl)
3186 : 9755 : && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl)))
3187 : : ;
3188 : : else
3189 : 0 : permerror (input_location, "%qD is not a template", decl);
3190 : : }
3191 : 2752621 : else if (!is_overloaded_fn (decl))
3192 : 0 : permerror (input_location, "%qD is not a template", decl);
3193 : : else
3194 : : {
3195 : 2752621 : bool found = false;
3196 : :
3197 : 5505242 : for (lkp_iterator iter (MAYBE_BASELINK_FUNCTIONS (decl));
3198 : 5505244 : !found && iter; ++iter)
3199 : : {
3200 : 2752623 : tree fn = *iter;
3201 : 2752623 : if (TREE_CODE (fn) == TEMPLATE_DECL
3202 : 2752227 : || TREE_CODE (fn) == TEMPLATE_ID_EXPR
3203 : 2752637 : || (TREE_CODE (fn) == FUNCTION_DECL
3204 : 14 : && DECL_USE_TEMPLATE (fn)
3205 : 6 : && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn))))
3206 : : found = true;
3207 : : }
3208 : 2752621 : if (!found)
3209 : 12 : permerror (input_location, "%qD is not a template", decl);
3210 : : }
3211 : : }
3212 : 2992745 : }
3213 : :
3214 : : /* Record that an access failure occurred on BASETYPE_PATH attempting
3215 : : to access DECL, where DIAG_DECL should be used for diagnostics. */
3216 : :
3217 : : void
3218 : 406 : access_failure_info::record_access_failure (tree basetype_path,
3219 : : tree decl, tree diag_decl)
3220 : : {
3221 : 406 : m_was_inaccessible = true;
3222 : 406 : m_basetype_path = basetype_path;
3223 : 406 : m_decl = decl;
3224 : 406 : m_diag_decl = diag_decl;
3225 : 406 : }
3226 : :
3227 : : /* If an access failure was recorded, then attempt to locate an
3228 : : accessor function for the pertinent field.
3229 : : Otherwise, return NULL_TREE. */
3230 : :
3231 : : tree
3232 : 80204267 : access_failure_info::get_any_accessor (bool const_p) const
3233 : : {
3234 : 80204267 : if (!was_inaccessible_p ())
3235 : : return NULL_TREE;
3236 : :
3237 : 406 : tree accessor
3238 : 406 : = locate_field_accessor (m_basetype_path, m_diag_decl, const_p);
3239 : 406 : if (!accessor)
3240 : : return NULL_TREE;
3241 : :
3242 : : /* The accessor must itself be accessible for it to be a reasonable
3243 : : suggestion. */
3244 : 161 : if (!accessible_p (m_basetype_path, accessor, true))
3245 : : return NULL_TREE;
3246 : :
3247 : : return accessor;
3248 : : }
3249 : :
3250 : : /* Add a fix-it hint to RICHLOC suggesting the use of ACCESSOR_DECL, by
3251 : : replacing the primary location in RICHLOC with "accessor()". */
3252 : :
3253 : : void
3254 : 140 : access_failure_info::add_fixit_hint (rich_location *richloc,
3255 : : tree accessor_decl)
3256 : : {
3257 : 140 : pretty_printer pp;
3258 : 140 : pp_string (&pp, IDENTIFIER_POINTER (DECL_NAME (accessor_decl)));
3259 : 140 : pp_string (&pp, "()");
3260 : 140 : richloc->add_fixit_replace (pp_formatted_text (&pp));
3261 : 140 : }
3262 : :
3263 : : /* If an access failure was recorded, then attempt to locate an
3264 : : accessor function for the pertinent field, and if one is
3265 : : available, add a note and fix-it hint suggesting using it. */
3266 : :
3267 : : void
3268 : 80204197 : access_failure_info::maybe_suggest_accessor (bool const_p) const
3269 : : {
3270 : 80204197 : tree accessor = get_any_accessor (const_p);
3271 : 80204197 : if (accessor == NULL_TREE)
3272 : 80204099 : return;
3273 : 98 : rich_location richloc (line_table, input_location);
3274 : 98 : add_fixit_hint (&richloc, accessor);
3275 : 98 : inform (&richloc, "field %q#D can be accessed via %q#D",
3276 : 98 : m_diag_decl, accessor);
3277 : 98 : }
3278 : :
3279 : : /* Subroutine of finish_class_member_access_expr.
3280 : : Issue an error about NAME not being a member of ACCESS_PATH (or
3281 : : OBJECT_TYPE), potentially providing a fix-it hint for misspelled
3282 : : names. */
3283 : :
3284 : : static void
3285 : 274 : complain_about_unrecognized_member (tree access_path, tree name,
3286 : : tree object_type)
3287 : : {
3288 : : /* Attempt to provide a hint about misspelled names. */
3289 : 274 : tree guessed_id = lookup_member_fuzzy (access_path, name,
3290 : : /*want_type=*/false);
3291 : 274 : if (guessed_id == NULL_TREE)
3292 : : {
3293 : : /* No hint. */
3294 : 164 : error ("%q#T has no member named %qE",
3295 : 164 : TREE_CODE (access_path) == TREE_BINFO
3296 : 6 : ? TREE_TYPE (access_path) : object_type, name);
3297 : 164 : return;
3298 : : }
3299 : :
3300 : 110 : location_t bogus_component_loc = input_location;
3301 : 110 : gcc_rich_location rich_loc (bogus_component_loc);
3302 : :
3303 : : /* Check that the guessed name is accessible along access_path. */
3304 : 110 : access_failure_info afi;
3305 : 110 : lookup_member (access_path, guessed_id, /*protect=*/1,
3306 : : /*want_type=*/false, /*complain=*/false,
3307 : : &afi);
3308 : 110 : if (afi.was_inaccessible_p ())
3309 : : {
3310 : 70 : tree accessor = afi.get_any_accessor (TYPE_READONLY (object_type));
3311 : 70 : if (accessor)
3312 : : {
3313 : : /* The guessed name isn't directly accessible, but can be accessed
3314 : : via an accessor member function. */
3315 : 42 : afi.add_fixit_hint (&rich_loc, accessor);
3316 : 42 : error_at (&rich_loc,
3317 : : "%q#T has no member named %qE;"
3318 : : " did you mean %q#D? (accessible via %q#D)",
3319 : 42 : TREE_CODE (access_path) == TREE_BINFO
3320 : 0 : ? TREE_TYPE (access_path) : object_type,
3321 : : name, afi.get_diag_decl (), accessor);
3322 : : }
3323 : : else
3324 : : {
3325 : : /* The guessed name isn't directly accessible, and no accessor
3326 : : member function could be found. */
3327 : 28 : auto_diagnostic_group d;
3328 : 28 : error_at (&rich_loc,
3329 : : "%q#T has no member named %qE;"
3330 : : " did you mean %q#D? (not accessible from this context)",
3331 : 28 : TREE_CODE (access_path) == TREE_BINFO
3332 : 0 : ? TREE_TYPE (access_path) : object_type,
3333 : : name, afi.get_diag_decl ());
3334 : 28 : complain_about_access (afi.get_decl (), afi.get_diag_decl (),
3335 : : afi.get_diag_decl (), false, ak_none);
3336 : 28 : }
3337 : : }
3338 : : else
3339 : : {
3340 : : /* The guessed name is directly accessible; suggest it. */
3341 : 40 : rich_loc.add_fixit_misspelled_id (bogus_component_loc,
3342 : : guessed_id);
3343 : 40 : error_at (&rich_loc,
3344 : : "%q#T has no member named %qE;"
3345 : : " did you mean %qE?",
3346 : 40 : TREE_CODE (access_path) == TREE_BINFO
3347 : 0 : ? TREE_TYPE (access_path) : object_type,
3348 : : name, guessed_id);
3349 : : }
3350 : 110 : }
3351 : :
3352 : : /* This function is called by the parser to process a class member
3353 : : access expression of the form OBJECT.NAME. NAME is a node used by
3354 : : the parser to represent a name; it is not yet a DECL. It may,
3355 : : however, be a BASELINK where the BASELINK_FUNCTIONS is a
3356 : : TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
3357 : : there is no reason to do the lookup twice, so the parser keeps the
3358 : : BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
3359 : : be a template via the use of the "A::template B" syntax. */
3360 : :
3361 : : tree
3362 : 158435255 : finish_class_member_access_expr (cp_expr object, tree name, bool template_p,
3363 : : tsubst_flags_t complain)
3364 : : {
3365 : 158435255 : tree expr;
3366 : 158435255 : tree object_type;
3367 : 158435255 : tree member;
3368 : 158435255 : tree access_path = NULL_TREE;
3369 : 158435255 : tree orig_object = object;
3370 : 158435255 : tree orig_name = name;
3371 : :
3372 : 158435255 : if (object == error_mark_node || name == error_mark_node)
3373 : : return error_mark_node;
3374 : :
3375 : : /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
3376 : 158434826 : if (!objc_is_public (object, name))
3377 : 0 : return error_mark_node;
3378 : :
3379 : 158434826 : object_type = TREE_TYPE (object);
3380 : :
3381 : 158434826 : if (processing_template_decl)
3382 : : {
3383 : 133354361 : if (/* If OBJECT is dependent, so is OBJECT.NAME. */
3384 : 133354361 : type_dependent_object_expression_p (object)
3385 : : /* If NAME is "f<args>", where either 'f' or 'args' is
3386 : : dependent, then the expression is dependent. */
3387 : 63837593 : || (TREE_CODE (name) == TEMPLATE_ID_EXPR
3388 : 542728 : && dependent_template_id_p (TREE_OPERAND (name, 0),
3389 : 542728 : TREE_OPERAND (name, 1)))
3390 : : /* If NAME is "T::X" where "T" is dependent, then the
3391 : : expression is dependent. */
3392 : 63582754 : || (TREE_CODE (name) == SCOPE_REF
3393 : 106664 : && TYPE_P (TREE_OPERAND (name, 0))
3394 : 106664 : && dependent_scope_p (TREE_OPERAND (name, 0)))
3395 : : /* If NAME is operator T where "T" is dependent, we can't
3396 : : lookup until we instantiate the T. */
3397 : 196830665 : || (TREE_CODE (name) == IDENTIFIER_NODE
3398 : 62924510 : && IDENTIFIER_CONV_OP_P (name)
3399 : 41 : && dependent_type_p (TREE_TYPE (name))))
3400 : : {
3401 : 82937784 : dependent:
3402 : 82937784 : return build_min_nt_loc (UNKNOWN_LOCATION, COMPONENT_REF,
3403 : 82937784 : orig_object, orig_name, NULL_TREE);
3404 : : }
3405 : : }
3406 : 25080465 : else if (c_dialect_objc ()
3407 : 88556731 : && identifier_p (name)
3408 : 25080465 : && (expr = objc_maybe_build_component_ref (object, name)))
3409 : : return expr;
3410 : :
3411 : : /* [expr.ref]
3412 : :
3413 : : The type of the first expression shall be "class object" (of a
3414 : : complete type). */
3415 : 88556731 : if (!currently_open_class (object_type)
3416 : 88556731 : && !complete_type_or_maybe_complain (object_type, object, complain))
3417 : 76 : return error_mark_node;
3418 : 88556655 : if (!CLASS_TYPE_P (object_type))
3419 : : {
3420 : 53275 : if (complain & tf_error)
3421 : : {
3422 : 78 : if (INDIRECT_TYPE_P (object_type)
3423 : 78 : && CLASS_TYPE_P (TREE_TYPE (object_type)))
3424 : 21 : error ("request for member %qD in %qE, which is of pointer "
3425 : : "type %qT (maybe you meant to use %<->%> ?)",
3426 : : name, object.get_value (), object_type);
3427 : : else
3428 : 57 : error ("request for member %qD in %qE, which is of non-class "
3429 : : "type %qT", name, object.get_value (), object_type);
3430 : : }
3431 : 53275 : return error_mark_node;
3432 : : }
3433 : :
3434 : 88503380 : if (BASELINK_P (name))
3435 : : /* A member function that has already been looked up. */
3436 : : member = name;
3437 : : else
3438 : : {
3439 : 80383421 : bool is_template_id = false;
3440 : 80383421 : tree template_args = NULL_TREE;
3441 : 80383421 : tree scope = NULL_TREE;
3442 : :
3443 : 80383421 : access_path = object_type;
3444 : :
3445 : 80383421 : if (TREE_CODE (name) == SCOPE_REF)
3446 : : {
3447 : : /* A qualified name. The qualifying class or namespace `S'
3448 : : has already been looked up; it is either a TYPE or a
3449 : : NAMESPACE_DECL. */
3450 : 1749 : scope = TREE_OPERAND (name, 0);
3451 : 1749 : name = TREE_OPERAND (name, 1);
3452 : :
3453 : : /* If SCOPE is a namespace, then the qualified name does not
3454 : : name a member of OBJECT_TYPE. */
3455 : 1749 : if (TREE_CODE (scope) == NAMESPACE_DECL)
3456 : : {
3457 : 0 : if (complain & tf_error)
3458 : 0 : error ("%<%D::%D%> is not a member of %qT",
3459 : : scope, name, object_type);
3460 : 0 : return error_mark_node;
3461 : : }
3462 : : }
3463 : :
3464 : 80383421 : if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3465 : : {
3466 : 434496 : is_template_id = true;
3467 : 434496 : template_args = TREE_OPERAND (name, 1);
3468 : 434496 : name = TREE_OPERAND (name, 0);
3469 : :
3470 : 829370 : if (!identifier_p (name))
3471 : 394892 : name = OVL_NAME (name);
3472 : : }
3473 : :
3474 : 80383421 : if (scope)
3475 : : {
3476 : 1749 : if (TREE_CODE (scope) == ENUMERAL_TYPE)
3477 : : {
3478 : 12 : gcc_assert (!is_template_id);
3479 : : /* Looking up a member enumerator (c++/56793). */
3480 : 24 : if (!TYPE_CLASS_SCOPE_P (scope)
3481 : 21 : || !DERIVED_FROM_P (TYPE_CONTEXT (scope), object_type))
3482 : : {
3483 : 3 : if (complain & tf_error)
3484 : 3 : error ("%<%D::%D%> is not a member of %qT",
3485 : : scope, name, object_type);
3486 : 3 : return error_mark_node;
3487 : : }
3488 : 9 : tree val = lookup_enumerator (scope, name);
3489 : 9 : if (!val)
3490 : : {
3491 : 6 : if (complain & tf_error)
3492 : 6 : error ("%qD is not a member of %qD",
3493 : : name, scope);
3494 : 6 : return error_mark_node;
3495 : : }
3496 : :
3497 : 3 : if (TREE_SIDE_EFFECTS (object))
3498 : 0 : val = build2 (COMPOUND_EXPR, TREE_TYPE (val), object, val);
3499 : 3 : return val;
3500 : : }
3501 : :
3502 : 1737 : gcc_assert (CLASS_TYPE_P (scope));
3503 : 1737 : gcc_assert (identifier_p (name) || TREE_CODE (name) == BIT_NOT_EXPR);
3504 : :
3505 : 1737 : if (constructor_name_p (name, scope))
3506 : : {
3507 : 3 : if (complain & tf_error)
3508 : 3 : error ("cannot call constructor %<%T::%D%> directly",
3509 : : scope, name);
3510 : 3 : return error_mark_node;
3511 : : }
3512 : :
3513 : : /* NAME may refer to a static data member, in which case there is
3514 : : one copy of the data member that is shared by all the objects of
3515 : : the class. So NAME can be unambiguously referred to even if
3516 : : there are multiple indirect base classes containing NAME. */
3517 : 5202 : const base_access ba = [scope, name] ()
3518 : : {
3519 : 1734 : if (identifier_p (name))
3520 : : {
3521 : 1597 : tree m = lookup_member (scope, name, /*protect=*/0,
3522 : : /*want_type=*/false, tf_none);
3523 : 1597 : if (!m || shared_member_p (m))
3524 : 32 : return ba_any;
3525 : : }
3526 : : return ba_check;
3527 : 1734 : } ();
3528 : :
3529 : : /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
3530 : 1734 : access_path = lookup_base (object_type, scope, ba, NULL, complain);
3531 : 1734 : if (access_path == error_mark_node)
3532 : : return error_mark_node;
3533 : 1722 : if (!access_path)
3534 : : {
3535 : 12 : if (any_dependent_bases_p (object_type))
3536 : 6 : goto dependent;
3537 : 6 : if (complain & tf_error)
3538 : 6 : error ("%qT is not a base of %qT", scope, object_type);
3539 : 6 : return error_mark_node;
3540 : : }
3541 : : }
3542 : :
3543 : 80383382 : if (TREE_CODE (name) == BIT_NOT_EXPR)
3544 : : {
3545 : 179185 : if (dependent_type_p (object_type))
3546 : : /* The destructor isn't declared yet. */
3547 : 32785 : goto dependent;
3548 : 146400 : member = lookup_destructor (object, scope, name, complain);
3549 : : }
3550 : : else
3551 : : {
3552 : : /* Look up the member. */
3553 : 80204197 : {
3554 : 80204197 : auto_diagnostic_group d;
3555 : 80204197 : access_failure_info afi;
3556 : 80204197 : if (processing_template_decl)
3557 : : /* Even though this class member access expression is at this
3558 : : point not dependent, the member itself may be dependent, and
3559 : : we must not potentially push a access check for a dependent
3560 : : member onto TI_DEFERRED_ACCESS_CHECKS. So don't check access
3561 : : ahead of time here; we're going to redo this member lookup at
3562 : : instantiation time anyway. */
3563 : 63212551 : push_deferring_access_checks (dk_no_check);
3564 : 80204197 : member = lookup_member (access_path, name, /*protect=*/1,
3565 : : /*want_type=*/false, complain,
3566 : : &afi);
3567 : 80204197 : if (processing_template_decl)
3568 : 63212551 : pop_deferring_access_checks ();
3569 : 80204197 : afi.maybe_suggest_accessor (TYPE_READONLY (object_type));
3570 : 80204197 : }
3571 : 80204197 : if (member == NULL_TREE)
3572 : : {
3573 : 7872944 : if (dependentish_scope_p (object_type))
3574 : : /* Try again at instantiation time. */
3575 : 7861319 : goto dependent;
3576 : 11625 : if (complain & tf_error)
3577 : 274 : complain_about_unrecognized_member (access_path, name,
3578 : : object_type);
3579 : 11625 : return error_mark_node;
3580 : : }
3581 : 72331253 : if (member == error_mark_node)
3582 : : return error_mark_node;
3583 : 72331209 : if (DECL_P (member)
3584 : 72331209 : && any_dependent_type_attributes_p (DECL_ATTRIBUTES (member)))
3585 : : /* Dependent type attributes on the decl mean that the TREE_TYPE is
3586 : : wrong, so don't use it. */
3587 : 6 : goto dependent;
3588 : 72331203 : if (TREE_CODE (member) == USING_DECL && DECL_DEPENDENT_P (member))
3589 : 5165573 : goto dependent;
3590 : : }
3591 : :
3592 : 67312030 : if (is_template_id)
3593 : : {
3594 : 434486 : tree templ = member;
3595 : :
3596 : 434486 : if (BASELINK_P (templ))
3597 : 434462 : member = lookup_template_function (templ, template_args);
3598 : 24 : else if (variable_template_p (templ))
3599 : 24 : member = (lookup_and_finish_template_variable
3600 : 24 : (templ, template_args, complain));
3601 : : else
3602 : : {
3603 : 0 : if (complain & tf_error)
3604 : 0 : error ("%qD is not a member template function", name);
3605 : 0 : return error_mark_node;
3606 : : }
3607 : : }
3608 : : }
3609 : :
3610 : 75431989 : if (TREE_UNAVAILABLE (member))
3611 : 30 : error_unavailable_use (member, NULL_TREE);
3612 : 75431959 : else if (TREE_DEPRECATED (member))
3613 : 30 : warn_deprecated_use (member, NULL_TREE);
3614 : :
3615 : 75431989 : if (template_p)
3616 : 9513 : check_template_keyword (member);
3617 : :
3618 : 75431989 : expr = build_class_member_access_expr (object, member, access_path,
3619 : : /*preserve_reference=*/false,
3620 : : complain);
3621 : 75431989 : if (processing_template_decl && expr != error_mark_node)
3622 : : {
3623 : 50416505 : if (BASELINK_P (member))
3624 : : {
3625 : 37313150 : if (TREE_CODE (orig_name) == SCOPE_REF)
3626 : 169 : BASELINK_QUALIFIED_P (member) = 1;
3627 : : orig_name = member;
3628 : : }
3629 : 50416505 : return build_min_non_dep (COMPONENT_REF, expr,
3630 : : orig_object, orig_name,
3631 : 50416505 : NULL_TREE);
3632 : : }
3633 : :
3634 : : return expr;
3635 : : }
3636 : :
3637 : : /* Build a COMPONENT_REF of OBJECT and MEMBER with the appropriate
3638 : : type. */
3639 : :
3640 : : tree
3641 : 173008 : build_simple_component_ref (tree object, tree member)
3642 : : {
3643 : 173008 : tree type = cp_build_qualified_type (TREE_TYPE (member),
3644 : 173008 : cp_type_quals (TREE_TYPE (object)));
3645 : 173008 : return build3_loc (input_location,
3646 : : COMPONENT_REF, type,
3647 : 173008 : object, member, NULL_TREE);
3648 : : }
3649 : :
3650 : : /* Return an expression for the MEMBER_NAME field in the internal
3651 : : representation of PTRMEM, a pointer-to-member function. (Each
3652 : : pointer-to-member function type gets its own RECORD_TYPE so it is
3653 : : more convenient to access the fields by name than by FIELD_DECL.)
3654 : : This routine converts the NAME to a FIELD_DECL and then creates the
3655 : : node for the complete expression. */
3656 : :
3657 : : tree
3658 : 172960 : build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
3659 : : {
3660 : 172960 : tree ptrmem_type;
3661 : 172960 : tree member;
3662 : :
3663 : 172960 : if (TREE_CODE (ptrmem) == CONSTRUCTOR)
3664 : : {
3665 : 141 : for (auto &e: CONSTRUCTOR_ELTS (ptrmem))
3666 : 57 : if (e.index && DECL_P (e.index) && DECL_NAME (e.index) == member_name)
3667 : 42 : return e.value;
3668 : 0 : gcc_unreachable ();
3669 : : }
3670 : :
3671 : : /* This code is a stripped down version of
3672 : : build_class_member_access_expr. It does not work to use that
3673 : : routine directly because it expects the object to be of class
3674 : : type. */
3675 : 172918 : ptrmem_type = TREE_TYPE (ptrmem);
3676 : 172918 : gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
3677 : 259283 : for (member = TYPE_FIELDS (ptrmem_type); member;
3678 : 86365 : member = DECL_CHAIN (member))
3679 : 259283 : if (DECL_NAME (member) == member_name)
3680 : : break;
3681 : 172918 : return build_simple_component_ref (ptrmem, member);
3682 : : }
3683 : :
3684 : : /* Return a TREE_LIST of namespace-scope overloads for the given operator,
3685 : : and for any other relevant operator. */
3686 : :
3687 : : static tree
3688 : 111707299 : op_unqualified_lookup (tree_code code, bool is_assign)
3689 : : {
3690 : 111707299 : tree lookups = NULL_TREE;
3691 : :
3692 : 111707299 : if (cxx_dialect >= cxx20 && !is_assign)
3693 : : {
3694 : 28996018 : if (code == NE_EXPR)
3695 : : {
3696 : : /* != can get rewritten in terms of ==. */
3697 : 1859080 : tree fnname = ovl_op_identifier (false, EQ_EXPR);
3698 : 1859080 : if (tree fns = lookup_name (fnname, LOOK_where::BLOCK_NAMESPACE))
3699 : 1845682 : lookups = tree_cons (fnname, fns, lookups);
3700 : : }
3701 : 27136938 : else if (code == GT_EXPR || code == LE_EXPR
3702 : 27136938 : || code == LT_EXPR || code == GE_EXPR)
3703 : : {
3704 : : /* These can get rewritten in terms of <=>. */
3705 : 2542617 : tree fnname = ovl_op_identifier (false, SPACESHIP_EXPR);
3706 : 2542617 : if (tree fns = lookup_name (fnname, LOOK_where::BLOCK_NAMESPACE))
3707 : 2423569 : lookups = tree_cons (fnname, fns, lookups);
3708 : : }
3709 : : }
3710 : :
3711 : 111707299 : tree fnname = ovl_op_identifier (is_assign, code);
3712 : 111707299 : if (tree fns = lookup_name (fnname, LOOK_where::BLOCK_NAMESPACE))
3713 : 63207609 : lookups = tree_cons (fnname, fns, lookups);
3714 : :
3715 : 111707299 : if (lookups)
3716 : : return lookups;
3717 : : else
3718 : 48425348 : return build_tree_list (NULL_TREE, NULL_TREE);
3719 : : }
3720 : :
3721 : : /* Create a DEPENDENT_OPERATOR_TYPE for a dependent operator expression of
3722 : : the given operator. LOOKUPS, if non-NULL, is the result of phase 1
3723 : : name lookup for the given operator. */
3724 : :
3725 : : tree
3726 : 120579273 : build_dependent_operator_type (tree lookups, tree_code code, bool is_assign)
3727 : : {
3728 : 120579273 : if (lookups)
3729 : : /* We're partially instantiating a dependent operator expression, and
3730 : : LOOKUPS is the result of phase 1 name lookup that we performed
3731 : : earlier at template definition time, so just reuse the corresponding
3732 : : DEPENDENT_OPERATOR_TYPE. */
3733 : 8871974 : return TREE_TYPE (lookups);
3734 : :
3735 : : /* Otherwise we're processing a dependent operator expression at template
3736 : : definition time, so perform phase 1 name lookup now. */
3737 : 111707299 : lookups = op_unqualified_lookup (code, is_assign);
3738 : :
3739 : 111707299 : tree type = cxx_make_type (DEPENDENT_OPERATOR_TYPE);
3740 : 111707299 : DEPENDENT_OPERATOR_TYPE_SAVED_LOOKUPS (type) = lookups;
3741 : 111707299 : TREE_TYPE (lookups) = type;
3742 : 111707299 : return type;
3743 : : }
3744 : :
3745 : : /* Given an expression PTR for a pointer, return an expression
3746 : : for the value pointed to.
3747 : : ERRORSTRING is the name of the operator to appear in error messages.
3748 : :
3749 : : This function may need to overload OPERATOR_FNNAME.
3750 : : Must also handle REFERENCE_TYPEs for C++. */
3751 : :
3752 : : tree
3753 : 36055517 : build_x_indirect_ref (location_t loc, tree expr, ref_operator errorstring,
3754 : : tree lookups, tsubst_flags_t complain)
3755 : : {
3756 : 36055517 : tree orig_expr = expr;
3757 : 36055517 : tree rval;
3758 : 36055517 : tree overload = NULL_TREE;
3759 : :
3760 : 36055517 : if (processing_template_decl)
3761 : : {
3762 : : /* Retain the type if we know the operand is a pointer. */
3763 : 21182299 : if (TREE_TYPE (expr) && INDIRECT_TYPE_P (TREE_TYPE (expr)))
3764 : : {
3765 : 11690815 : if (expr == current_class_ptr
3766 : 11690815 : || (TREE_CODE (expr) == NOP_EXPR
3767 : 7296425 : && TREE_OPERAND (expr, 0) == current_class_ptr
3768 : 7284844 : && (same_type_ignoring_top_level_qualifiers_p
3769 : 7284844 : (TREE_TYPE (expr), TREE_TYPE (current_class_ptr)))))
3770 : 7284843 : return current_class_ref;
3771 : 4405972 : return build_min (INDIRECT_REF, TREE_TYPE (TREE_TYPE (expr)), expr);
3772 : : }
3773 : 9491484 : if (type_dependent_expression_p (expr))
3774 : : {
3775 : 9351873 : expr = build_min_nt_loc (loc, INDIRECT_REF, expr);
3776 : 9351873 : TREE_TYPE (expr)
3777 : 9351873 : = build_dependent_operator_type (lookups, INDIRECT_REF, false);
3778 : 9351873 : return expr;
3779 : : }
3780 : : }
3781 : :
3782 : 15012829 : rval = build_new_op (loc, INDIRECT_REF, LOOKUP_NORMAL, expr,
3783 : : NULL_TREE, NULL_TREE, lookups,
3784 : : &overload, complain);
3785 : 15012829 : if (!rval)
3786 : 0 : rval = cp_build_indirect_ref (loc, expr, errorstring, complain);
3787 : :
3788 : 15012829 : if (processing_template_decl && rval != error_mark_node)
3789 : : {
3790 : 137770 : if (overload != NULL_TREE)
3791 : 137739 : return (build_min_non_dep_op_overload
3792 : 137739 : (INDIRECT_REF, rval, overload, orig_expr));
3793 : :
3794 : 31 : return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
3795 : : }
3796 : : else
3797 : : return rval;
3798 : : }
3799 : :
3800 : : /* Like c-family strict_aliasing_warning, but don't warn for dependent
3801 : : types or expressions. */
3802 : :
3803 : : static bool
3804 : 526209 : cp_strict_aliasing_warning (location_t loc, tree type, tree expr)
3805 : : {
3806 : 526209 : if (processing_template_decl)
3807 : : {
3808 : 38654 : tree e = expr;
3809 : 38654 : STRIP_NOPS (e);
3810 : 38654 : if (dependent_type_p (type) || type_dependent_expression_p (e))
3811 : 6456 : return false;
3812 : : }
3813 : 519753 : return strict_aliasing_warning (loc, type, expr);
3814 : : }
3815 : :
3816 : : /* The implementation of the above, and of indirection implied by other
3817 : : constructs. If DO_FOLD is true, fold away INDIRECT_REF of ADDR_EXPR. */
3818 : :
3819 : : static tree
3820 : 276191590 : cp_build_indirect_ref_1 (location_t loc, tree ptr, ref_operator errorstring,
3821 : : tsubst_flags_t complain, bool do_fold)
3822 : : {
3823 : 276191590 : tree pointer, type;
3824 : :
3825 : : /* RO_NULL should only be used with the folding entry points below, not
3826 : : cp_build_indirect_ref. */
3827 : 276191590 : gcc_checking_assert (errorstring != RO_NULL || do_fold);
3828 : :
3829 : 276191590 : if (ptr == current_class_ptr
3830 : 276191590 : || (TREE_CODE (ptr) == NOP_EXPR
3831 : 26978133 : && TREE_OPERAND (ptr, 0) == current_class_ptr
3832 : 14814057 : && (same_type_ignoring_top_level_qualifiers_p
3833 : 14814057 : (TREE_TYPE (ptr), TREE_TYPE (current_class_ptr)))))
3834 : 16080224 : return current_class_ref;
3835 : :
3836 : 260111366 : pointer = (TYPE_REF_P (TREE_TYPE (ptr))
3837 : 260111366 : ? ptr : decay_conversion (ptr, complain));
3838 : 260111366 : if (pointer == error_mark_node)
3839 : : return error_mark_node;
3840 : :
3841 : 260105535 : type = TREE_TYPE (pointer);
3842 : :
3843 : 260105535 : if (INDIRECT_TYPE_P (type))
3844 : : {
3845 : : /* [expr.unary.op]
3846 : :
3847 : : If the type of the expression is "pointer to T," the type
3848 : : of the result is "T." */
3849 : 260105258 : tree t = TREE_TYPE (type);
3850 : :
3851 : 246870998 : if ((CONVERT_EXPR_P (ptr)
3852 : 188293770 : || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
3853 : 320435788 : && (!CLASS_TYPE_P (t) || !CLASSTYPE_EMPTY_P (t)))
3854 : : {
3855 : : /* If a warning is issued, mark it to avoid duplicates from
3856 : : the backend. This only needs to be done at
3857 : : warn_strict_aliasing > 2. */
3858 : 50877203 : if (warn_strict_aliasing > 2
3859 : 51328785 : && cp_strict_aliasing_warning (EXPR_LOCATION (ptr),
3860 : 451582 : type, TREE_OPERAND (ptr, 0)))
3861 : 6 : suppress_warning (ptr, OPT_Wstrict_aliasing);
3862 : : }
3863 : :
3864 : 260105258 : if (VOID_TYPE_P (t))
3865 : : {
3866 : : /* A pointer to incomplete type (other than cv void) can be
3867 : : dereferenced [expr.unary.op]/1 */
3868 : 70 : if (complain & tf_error)
3869 : 19 : error_at (loc, "%qT is not a pointer-to-object type", type);
3870 : 70 : return error_mark_node;
3871 : : }
3872 : 251606903 : else if (do_fold && TREE_CODE (pointer) == ADDR_EXPR
3873 : 265302233 : && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
3874 : : /* The POINTER was something like `&x'. We simplify `*&x' to
3875 : : `x'. */
3876 : 5197045 : return TREE_OPERAND (pointer, 0);
3877 : : else
3878 : : {
3879 : 254908143 : tree ref = build1 (INDIRECT_REF, t, pointer);
3880 : :
3881 : : /* We *must* set TREE_READONLY when dereferencing a pointer to const,
3882 : : so that we get the proper error message if the result is used
3883 : : to assign to. Also, &* is supposed to be a no-op. */
3884 : 254908143 : TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
3885 : 254908143 : TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
3886 : 254908143 : TREE_SIDE_EFFECTS (ref)
3887 : 254908143 : = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
3888 : 254908143 : return ref;
3889 : : }
3890 : : }
3891 : 277 : else if (!(complain & tf_error))
3892 : : /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
3893 : : ;
3894 : : /* `pointer' won't be an error_mark_node if we were given a
3895 : : pointer to member, so it's cool to check for this here. */
3896 : 33 : else if (TYPE_PTRMEM_P (type))
3897 : 15 : switch (errorstring)
3898 : : {
3899 : 0 : case RO_ARRAY_INDEXING:
3900 : 0 : error_at (loc,
3901 : : "invalid use of array indexing on pointer to member");
3902 : 0 : break;
3903 : 12 : case RO_UNARY_STAR:
3904 : 12 : error_at (loc, "invalid use of unary %<*%> on pointer to member");
3905 : 12 : break;
3906 : 0 : case RO_IMPLICIT_CONVERSION:
3907 : 0 : error_at (loc, "invalid use of implicit conversion on pointer "
3908 : : "to member");
3909 : 0 : break;
3910 : 3 : case RO_ARROW_STAR:
3911 : 3 : error_at (loc, "left hand operand of %<->*%> must be a pointer to "
3912 : : "class, but is a pointer to member of type %qT", type);
3913 : 3 : break;
3914 : 0 : default:
3915 : 0 : gcc_unreachable ();
3916 : : }
3917 : 18 : else if (pointer != error_mark_node)
3918 : 18 : invalid_indirection_error (loc, type, errorstring);
3919 : :
3920 : 277 : return error_mark_node;
3921 : : }
3922 : :
3923 : : /* Entry point used by c-common, which expects folding. */
3924 : :
3925 : : tree
3926 : 27444 : build_indirect_ref (location_t loc, tree ptr, ref_operator errorstring)
3927 : : {
3928 : 27444 : return cp_build_indirect_ref_1 (loc, ptr, errorstring,
3929 : 27444 : tf_warning_or_error, true);
3930 : : }
3931 : :
3932 : : /* Entry point used by internal indirection needs that don't correspond to any
3933 : : syntactic construct. */
3934 : :
3935 : : tree
3936 : 254605313 : cp_build_fold_indirect_ref (tree pointer)
3937 : : {
3938 : 254605313 : return cp_build_indirect_ref_1 (input_location, pointer, RO_NULL,
3939 : 254605313 : tf_warning_or_error, true);
3940 : : }
3941 : :
3942 : : /* Entry point used by indirection needs that correspond to some syntactic
3943 : : construct. */
3944 : :
3945 : : tree
3946 : 21558833 : cp_build_indirect_ref (location_t loc, tree ptr, ref_operator errorstring,
3947 : : tsubst_flags_t complain)
3948 : : {
3949 : 21558833 : return cp_build_indirect_ref_1 (loc, ptr, errorstring, complain, false);
3950 : : }
3951 : :
3952 : : /* This handles expressions of the form "a[i]", which denotes
3953 : : an array reference.
3954 : :
3955 : : This is logically equivalent in C to *(a+i), but we may do it differently.
3956 : : If A is a variable or a member, we generate a primitive ARRAY_REF.
3957 : : This avoids forcing the array out of registers, and can work on
3958 : : arrays that are not lvalues (for example, members of structures returned
3959 : : by functions).
3960 : :
3961 : : If INDEX is of some user-defined type, it must be converted to
3962 : : integer type. Otherwise, to make a compatible PLUS_EXPR, it
3963 : : will inherit the type of the array, which will be some pointer type.
3964 : :
3965 : : LOC is the location to use in building the array reference. */
3966 : :
3967 : : tree
3968 : 5019812 : cp_build_array_ref (location_t loc, tree array, tree idx,
3969 : : tsubst_flags_t complain)
3970 : : {
3971 : 5019812 : tree first = NULL_TREE;
3972 : 5019812 : tree ret;
3973 : :
3974 : 5019812 : if (idx == 0)
3975 : : {
3976 : 0 : if (complain & tf_error)
3977 : 0 : error_at (loc, "subscript missing in array reference");
3978 : 0 : return error_mark_node;
3979 : : }
3980 : :
3981 : 5019812 : if (TREE_TYPE (array) == error_mark_node
3982 : 5019812 : || TREE_TYPE (idx) == error_mark_node)
3983 : : return error_mark_node;
3984 : :
3985 : : /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
3986 : : inside it. */
3987 : 5019812 : switch (TREE_CODE (array))
3988 : : {
3989 : 26 : case COMPOUND_EXPR:
3990 : 26 : {
3991 : 26 : tree value = cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
3992 : : complain);
3993 : 26 : ret = build2 (COMPOUND_EXPR, TREE_TYPE (value),
3994 : 26 : TREE_OPERAND (array, 0), value);
3995 : 26 : SET_EXPR_LOCATION (ret, loc);
3996 : 26 : return ret;
3997 : : }
3998 : :
3999 : 13 : case COND_EXPR:
4000 : 13 : ret = build_conditional_expr
4001 : 26 : (loc, TREE_OPERAND (array, 0),
4002 : 13 : cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
4003 : : complain),
4004 : 13 : cp_build_array_ref (loc, TREE_OPERAND (array, 2), idx,
4005 : : complain),
4006 : : complain);
4007 : 13 : protected_set_expr_location (ret, loc);
4008 : 13 : return ret;
4009 : :
4010 : 5019773 : default:
4011 : 5019773 : break;
4012 : : }
4013 : :
4014 : 5019773 : bool non_lvalue = convert_vector_to_array_for_subscript (loc, &array, idx);
4015 : :
4016 : : /* 0[array] */
4017 : 5019773 : if (TREE_CODE (TREE_TYPE (idx)) == ARRAY_TYPE)
4018 : : {
4019 : 7 : std::swap (array, idx);
4020 : 7 : if (flag_strong_eval_order == 2 && TREE_SIDE_EFFECTS (array))
4021 : 6 : idx = first = save_expr (idx);
4022 : : }
4023 : :
4024 : 5019773 : if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
4025 : : {
4026 : 1611316 : tree rval, type;
4027 : :
4028 : 1611316 : warn_array_subscript_with_type_char (loc, idx);
4029 : :
4030 : 1611316 : if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
4031 : : {
4032 : 3 : if (complain & tf_error)
4033 : 3 : error_at (loc, "array subscript is not an integer");
4034 : 3 : return error_mark_node;
4035 : : }
4036 : :
4037 : : /* Apply integral promotions *after* noticing character types.
4038 : : (It is unclear why we do these promotions -- the standard
4039 : : does not say that we should. In fact, the natural thing would
4040 : : seem to be to convert IDX to ptrdiff_t; we're performing
4041 : : pointer arithmetic.) */
4042 : 1611313 : idx = cp_perform_integral_promotions (idx, complain);
4043 : :
4044 : 1611313 : idx = maybe_fold_non_dependent_expr (idx, complain);
4045 : :
4046 : : /* An array that is indexed by a non-constant
4047 : : cannot be stored in a register; we must be able to do
4048 : : address arithmetic on its address.
4049 : : Likewise an array of elements of variable size. */
4050 : 1611313 : if (TREE_CODE (idx) != INTEGER_CST
4051 : 1611313 : || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
4052 : 806953 : && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
4053 : : != INTEGER_CST)))
4054 : : {
4055 : 805611 : if (!cxx_mark_addressable (array, true))
4056 : 0 : return error_mark_node;
4057 : : }
4058 : :
4059 : : /* An array that is indexed by a constant value which is not within
4060 : : the array bounds cannot be stored in a register either; because we
4061 : : would get a crash in store_bit_field/extract_bit_field when trying
4062 : : to access a non-existent part of the register. */
4063 : 1611313 : if (TREE_CODE (idx) == INTEGER_CST
4064 : 806956 : && TYPE_DOMAIN (TREE_TYPE (array))
4065 : 2416958 : && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
4066 : : {
4067 : 2824 : if (!cxx_mark_addressable (array))
4068 : 0 : return error_mark_node;
4069 : : }
4070 : :
4071 : : /* Note in C++ it is valid to subscript a `register' array, since
4072 : : it is valid to take the address of something with that
4073 : : storage specification. */
4074 : 1611313 : if (extra_warnings)
4075 : : {
4076 : 37518 : tree foo = array;
4077 : 57480 : while (TREE_CODE (foo) == COMPONENT_REF)
4078 : 19962 : foo = TREE_OPERAND (foo, 0);
4079 : 8 : if (VAR_P (foo) && DECL_REGISTER (foo)
4080 : 37518 : && (complain & tf_warning))
4081 : 0 : warning_at (loc, OPT_Wextra,
4082 : : "subscripting array declared %<register%>");
4083 : : }
4084 : :
4085 : 1611313 : type = TREE_TYPE (TREE_TYPE (array));
4086 : 1611313 : rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
4087 : : /* Array ref is const/volatile if the array elements are
4088 : : or if the array is.. */
4089 : 4833939 : TREE_READONLY (rval)
4090 : 1611313 : |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
4091 : 4833939 : TREE_SIDE_EFFECTS (rval)
4092 : 1611313 : |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
4093 : 3222626 : TREE_THIS_VOLATILE (rval)
4094 : 1611313 : |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
4095 : 1611313 : ret = require_complete_type (rval, complain);
4096 : 1611313 : protected_set_expr_location (ret, loc);
4097 : 1611313 : if (non_lvalue)
4098 : 6032 : ret = non_lvalue_loc (loc, ret);
4099 : 1611313 : if (first)
4100 : 6 : ret = build2_loc (loc, COMPOUND_EXPR, TREE_TYPE (ret), first, ret);
4101 : 1611313 : return ret;
4102 : : }
4103 : :
4104 : 3408457 : {
4105 : 3408457 : tree ar = cp_default_conversion (array, complain);
4106 : 3408457 : tree ind = cp_default_conversion (idx, complain);
4107 : :
4108 : 3408457 : if (!processing_template_decl
4109 : 3408457 : && !first && flag_strong_eval_order == 2 && TREE_SIDE_EFFECTS (ind))
4110 : 90533 : ar = first = save_expr (ar);
4111 : :
4112 : : /* Put the integer in IND to simplify error checking. */
4113 : 3408457 : if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
4114 : 57 : std::swap (ar, ind);
4115 : :
4116 : 3408457 : if (ar == error_mark_node || ind == error_mark_node)
4117 : : return error_mark_node;
4118 : :
4119 : 3408457 : if (!TYPE_PTR_P (TREE_TYPE (ar)))
4120 : : {
4121 : 22 : if (complain & tf_error)
4122 : 3 : error_at (loc, "subscripted value is neither array nor pointer");
4123 : 22 : return error_mark_node;
4124 : : }
4125 : 3408435 : if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
4126 : : {
4127 : 0 : if (complain & tf_error)
4128 : 0 : error_at (loc, "array subscript is not an integer");
4129 : 0 : return error_mark_node;
4130 : : }
4131 : :
4132 : 3408435 : warn_array_subscript_with_type_char (loc, idx);
4133 : :
4134 : 3408435 : ret = cp_build_binary_op (input_location, PLUS_EXPR, ar, ind, complain);
4135 : 3408435 : if (first)
4136 : 90533 : ret = build2_loc (loc, COMPOUND_EXPR, TREE_TYPE (ret), first, ret);
4137 : 3408435 : ret = cp_build_indirect_ref (loc, ret, RO_ARRAY_INDEXING, complain);
4138 : 3408435 : protected_set_expr_location (ret, loc);
4139 : 3408435 : if (non_lvalue)
4140 : 0 : ret = non_lvalue_loc (loc, ret);
4141 : : return ret;
4142 : : }
4143 : : }
4144 : :
4145 : : /* Entry point for Obj-C++. */
4146 : :
4147 : : tree
4148 : 3419444 : build_array_ref (location_t loc, tree array, tree idx)
4149 : : {
4150 : 3419444 : return cp_build_array_ref (loc, array, idx, tf_warning_or_error);
4151 : : }
4152 : :
4153 : : /* Resolve a pointer to member function. INSTANCE is the object
4154 : : instance to use, if the member points to a virtual member.
4155 : :
4156 : : This used to avoid checking for virtual functions if basetype
4157 : : has no virtual functions, according to an earlier ANSI draft.
4158 : : With the final ISO C++ rules, such an optimization is
4159 : : incorrect: A pointer to a derived member can be static_cast
4160 : : to pointer-to-base-member, as long as the dynamic object
4161 : : later has the right member. So now we only do this optimization
4162 : : when we know the dynamic type of the object. */
4163 : :
4164 : : tree
4165 : 86295 : get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function,
4166 : : tsubst_flags_t complain)
4167 : : {
4168 : 86295 : if (TREE_CODE (function) == OFFSET_REF)
4169 : 0 : function = TREE_OPERAND (function, 1);
4170 : :
4171 : 86295 : if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
4172 : : {
4173 : 86295 : tree idx, delta, e1, e2, e3, vtbl;
4174 : 86295 : bool nonvirtual;
4175 : 86295 : tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
4176 : 86295 : tree basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
4177 : :
4178 : 86295 : tree instance_ptr = *instance_ptrptr;
4179 : 86295 : tree instance_save_expr = 0;
4180 : 86295 : if (instance_ptr == error_mark_node)
4181 : : {
4182 : 0 : if (TREE_CODE (function) == PTRMEM_CST)
4183 : : {
4184 : : /* Extracting the function address from a pmf is only
4185 : : allowed with -Wno-pmf-conversions. It only works for
4186 : : pmf constants. */
4187 : 0 : e1 = build_addr_func (PTRMEM_CST_MEMBER (function), complain);
4188 : 0 : e1 = convert (fntype, e1);
4189 : 0 : return e1;
4190 : : }
4191 : : else
4192 : : {
4193 : 0 : if (complain & tf_error)
4194 : 0 : error ("object missing in use of %qE", function);
4195 : 0 : return error_mark_node;
4196 : : }
4197 : : }
4198 : :
4199 : : /* True if we know that the dynamic type of the object doesn't have
4200 : : virtual functions, so we can assume the PFN field is a pointer. */
4201 : 86295 : nonvirtual = (COMPLETE_TYPE_P (basetype)
4202 : 86253 : && !TYPE_POLYMORPHIC_P (basetype)
4203 : 115907 : && resolves_to_fixed_type_p (instance_ptr, 0));
4204 : :
4205 : : /* If we don't really have an object (i.e. in an ill-formed
4206 : : conversion from PMF to pointer), we can't resolve virtual
4207 : : functions anyway. */
4208 : 86033 : if (!nonvirtual && is_dummy_object (instance_ptr))
4209 : : nonvirtual = true;
4210 : :
4211 : : /* Use force_target_expr even when instance_ptr doesn't have
4212 : : side-effects, unless it is a simple decl or constant, so
4213 : : that we don't ubsan instrument the expression multiple times.
4214 : : Don't use save_expr, as save_expr can avoid building a SAVE_EXPR
4215 : : and building a SAVE_EXPR manually can be optimized away during
4216 : : cp_fold. See PR116449 and PR117259. */
4217 : 86295 : if (TREE_SIDE_EFFECTS (instance_ptr)
4218 : 86295 : || (!nonvirtual
4219 : 29307 : && !DECL_P (instance_ptr)
4220 : 29307 : && !TREE_CONSTANT (instance_ptr)))
4221 : 171834 : instance_ptr = instance_save_expr
4222 : 85917 : = force_target_expr (TREE_TYPE (instance_ptr), instance_ptr,
4223 : : complain);
4224 : :
4225 : : /* See above comment. */
4226 : 86295 : if (TREE_SIDE_EFFECTS (function)
4227 : 86295 : || (!nonvirtual
4228 : 48095 : && !DECL_P (function)
4229 : 48083 : && !TREE_CONSTANT (function)))
4230 : 85818 : function
4231 : 85818 : = force_target_expr (TREE_TYPE (function), function, complain);
4232 : :
4233 : : /* Start by extracting all the information from the PMF itself. */
4234 : 86295 : e3 = pfn_from_ptrmemfunc (function);
4235 : 86295 : delta = delta_from_ptrmemfunc (function);
4236 : 86295 : idx = build1 (NOP_EXPR, vtable_index_type, e3);
4237 : 86295 : switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
4238 : : {
4239 : 86295 : int flag_sanitize_save;
4240 : 86295 : case ptrmemfunc_vbit_in_pfn:
4241 : 86295 : e1 = cp_build_binary_op (input_location,
4242 : : BIT_AND_EXPR, idx, integer_one_node,
4243 : : complain);
4244 : 86295 : idx = cp_build_binary_op (input_location,
4245 : : MINUS_EXPR, idx, integer_one_node,
4246 : : complain);
4247 : 86295 : if (idx == error_mark_node)
4248 : : return error_mark_node;
4249 : 86295 : break;
4250 : :
4251 : : case ptrmemfunc_vbit_in_delta:
4252 : : e1 = cp_build_binary_op (input_location,
4253 : : BIT_AND_EXPR, delta, integer_one_node,
4254 : : complain);
4255 : : /* Don't instrument the RSHIFT_EXPR we're about to create because
4256 : : we're going to use DELTA number of times, and that wouldn't play
4257 : : well with SAVE_EXPRs therein. */
4258 : : flag_sanitize_save = flag_sanitize;
4259 : : flag_sanitize = 0;
4260 : : delta = cp_build_binary_op (input_location,
4261 : : RSHIFT_EXPR, delta, integer_one_node,
4262 : : complain);
4263 : : flag_sanitize = flag_sanitize_save;
4264 : : if (delta == error_mark_node)
4265 : : return error_mark_node;
4266 : : break;
4267 : :
4268 : : default:
4269 : : gcc_unreachable ();
4270 : : }
4271 : :
4272 : 86295 : if (e1 == error_mark_node)
4273 : : return error_mark_node;
4274 : :
4275 : : /* Convert down to the right base before using the instance. A
4276 : : special case is that in a pointer to member of class C, C may
4277 : : be incomplete. In that case, the function will of course be
4278 : : a member of C, and no conversion is required. In fact,
4279 : : lookup_base will fail in that case, because incomplete
4280 : : classes do not have BINFOs. */
4281 : 86295 : if (!same_type_ignoring_top_level_qualifiers_p
4282 : 86295 : (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
4283 : : {
4284 : 78 : basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
4285 : : basetype, ba_check, NULL, complain);
4286 : 78 : instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
4287 : : 1, complain);
4288 : 78 : if (instance_ptr == error_mark_node)
4289 : : return error_mark_node;
4290 : : }
4291 : : /* ...and then the delta in the PMF. */
4292 : 86295 : instance_ptr = fold_build_pointer_plus (instance_ptr, delta);
4293 : :
4294 : : /* Hand back the adjusted 'this' argument to our caller. */
4295 : 86295 : *instance_ptrptr = instance_ptr;
4296 : :
4297 : 86295 : if (nonvirtual)
4298 : : /* Now just return the pointer. */
4299 : : return e3;
4300 : :
4301 : : /* Next extract the vtable pointer from the object. */
4302 : 86015 : vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
4303 : : instance_ptr);
4304 : 86015 : vtbl = cp_build_fold_indirect_ref (vtbl);
4305 : 86015 : if (vtbl == error_mark_node)
4306 : : return error_mark_node;
4307 : :
4308 : : /* Finally, extract the function pointer from the vtable. */
4309 : 86015 : e2 = fold_build_pointer_plus_loc (input_location, vtbl, idx);
4310 : 86015 : e2 = cp_build_fold_indirect_ref (e2);
4311 : 86015 : if (e2 == error_mark_node)
4312 : : return error_mark_node;
4313 : 86015 : TREE_CONSTANT (e2) = 1;
4314 : :
4315 : : /* When using function descriptors, the address of the
4316 : : vtable entry is treated as a function pointer. */
4317 : 86015 : if (TARGET_VTABLE_USES_DESCRIPTORS)
4318 : : e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
4319 : : cp_build_addr_expr (e2, complain));
4320 : :
4321 : 86015 : e2 = fold_convert (TREE_TYPE (e3), e2);
4322 : 86015 : e1 = build_conditional_expr (input_location, e1, e2, e3, complain);
4323 : 86015 : if (e1 == error_mark_node)
4324 : : return error_mark_node;
4325 : :
4326 : : /* Make sure this doesn't get evaluated first inside one of the
4327 : : branches of the COND_EXPR. */
4328 : 86015 : if (instance_save_expr)
4329 : 85869 : e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
4330 : : instance_save_expr, e1);
4331 : :
4332 : : function = e1;
4333 : : }
4334 : : return function;
4335 : : }
4336 : :
4337 : : /* Used by the C-common bits. */
4338 : : tree
4339 : 0 : build_function_call (location_t /*loc*/,
4340 : : tree function, tree params)
4341 : : {
4342 : 0 : return cp_build_function_call (function, params, tf_warning_or_error);
4343 : : }
4344 : :
4345 : : /* Used by the C-common bits. */
4346 : : tree
4347 : 232556 : build_function_call_vec (location_t /*loc*/, vec<location_t> /*arg_loc*/,
4348 : : tree function, vec<tree, va_gc> *params,
4349 : : vec<tree, va_gc> * /*origtypes*/, tree orig_function)
4350 : : {
4351 : 232556 : vec<tree, va_gc> *orig_params = params;
4352 : 232556 : tree ret = cp_build_function_call_vec (function, ¶ms,
4353 : : tf_warning_or_error, orig_function);
4354 : :
4355 : : /* cp_build_function_call_vec can reallocate PARAMS by adding
4356 : : default arguments. That should never happen here. Verify
4357 : : that. */
4358 : 232556 : gcc_assert (params == orig_params);
4359 : :
4360 : 232556 : return ret;
4361 : : }
4362 : :
4363 : : /* Build a function call using a tree list of arguments. */
4364 : :
4365 : : static tree
4366 : 0 : cp_build_function_call (tree function, tree params, tsubst_flags_t complain)
4367 : : {
4368 : 0 : tree ret;
4369 : :
4370 : 0 : releasing_vec vec;
4371 : 0 : for (; params != NULL_TREE; params = TREE_CHAIN (params))
4372 : 0 : vec_safe_push (vec, TREE_VALUE (params));
4373 : 0 : ret = cp_build_function_call_vec (function, &vec, complain);
4374 : 0 : return ret;
4375 : 0 : }
4376 : :
4377 : : /* Build a function call using varargs. */
4378 : :
4379 : : tree
4380 : 460547 : cp_build_function_call_nary (tree function, tsubst_flags_t complain, ...)
4381 : : {
4382 : 460547 : va_list args;
4383 : 460547 : tree ret, t;
4384 : :
4385 : 460547 : releasing_vec vec;
4386 : 460547 : va_start (args, complain);
4387 : 1136776 : for (t = va_arg (args, tree); t != NULL_TREE; t = va_arg (args, tree))
4388 : 676229 : vec_safe_push (vec, t);
4389 : 460547 : va_end (args);
4390 : 460547 : ret = cp_build_function_call_vec (function, &vec, complain);
4391 : 460547 : return ret;
4392 : 460547 : }
4393 : :
4394 : : /* C++ implementation of callback for use when checking param types. */
4395 : :
4396 : : bool
4397 : 18 : cp_comp_parm_types (tree wanted_type, tree actual_type)
4398 : : {
4399 : 18 : if (TREE_CODE (wanted_type) == POINTER_TYPE
4400 : 18 : && TREE_CODE (actual_type) == POINTER_TYPE)
4401 : 15 : return same_or_base_type_p (TREE_TYPE (wanted_type),
4402 : : TREE_TYPE (actual_type));
4403 : : return false;
4404 : : }
4405 : :
4406 : : /* Build a function call using a vector of arguments.
4407 : : If FUNCTION is the result of resolving an overloaded target built-in,
4408 : : ORIG_FNDECL is the original function decl, otherwise it is null.
4409 : : PARAMS may be NULL if there are no parameters. This changes the
4410 : : contents of PARAMS. */
4411 : :
4412 : : tree
4413 : 2716248 : cp_build_function_call_vec (tree function, vec<tree, va_gc> **params,
4414 : : tsubst_flags_t complain, tree orig_fndecl)
4415 : : {
4416 : 2716248 : tree fntype, fndecl;
4417 : 2716248 : int is_method;
4418 : 2716248 : tree original = function;
4419 : 2716248 : int nargs;
4420 : 2716248 : tree *argarray;
4421 : 2716248 : tree parm_types;
4422 : 2716248 : vec<tree, va_gc> *allocated = NULL;
4423 : 2716248 : tree ret;
4424 : :
4425 : : /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
4426 : : expressions, like those used for ObjC messenger dispatches. */
4427 : 2716248 : if (params != NULL && !vec_safe_is_empty (*params))
4428 : 1604742 : function = objc_rewrite_function_call (function, (**params)[0]);
4429 : :
4430 : : /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4431 : : Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
4432 : 2716248 : if (TREE_CODE (function) == NOP_EXPR
4433 : 2716248 : && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
4434 : 15 : function = TREE_OPERAND (function, 0);
4435 : :
4436 : 2716248 : if (TREE_CODE (function) == FUNCTION_DECL)
4437 : : {
4438 : 1236751 : if (!mark_used (function, complain))
4439 : 24 : return error_mark_node;
4440 : 1236727 : fndecl = function;
4441 : :
4442 : : /* Convert anything with function type to a pointer-to-function. */
4443 : 1236727 : if (DECL_MAIN_P (function))
4444 : : {
4445 : 0 : if (complain & tf_error)
4446 : 0 : pedwarn (input_location, OPT_Wpedantic,
4447 : : "ISO C++ forbids calling %<::main%> from within program");
4448 : : else
4449 : 0 : return error_mark_node;
4450 : : }
4451 : 1236727 : function = build_addr_func (function, complain);
4452 : : }
4453 : : else
4454 : : {
4455 : 1479497 : fndecl = NULL_TREE;
4456 : :
4457 : 1479497 : function = build_addr_func (function, complain);
4458 : : }
4459 : :
4460 : 2716224 : if (function == error_mark_node)
4461 : : return error_mark_node;
4462 : :
4463 : 2716122 : fntype = TREE_TYPE (function);
4464 : :
4465 : 2716122 : if (TYPE_PTRMEMFUNC_P (fntype))
4466 : : {
4467 : 15 : if (complain & tf_error)
4468 : 15 : error ("must use %<.*%> or %<->*%> to call pointer-to-member "
4469 : : "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
4470 : : original, original);
4471 : 15 : return error_mark_node;
4472 : : }
4473 : :
4474 : 5432214 : is_method = (TYPE_PTR_P (fntype)
4475 : 2716107 : && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
4476 : :
4477 : 2716107 : if (!(TYPE_PTRFN_P (fntype)
4478 : 87589 : || is_method
4479 : 1367 : || TREE_CODE (function) == TEMPLATE_ID_EXPR))
4480 : : {
4481 : 1367 : if (complain & tf_error)
4482 : : {
4483 : 149 : if (!flag_diagnostics_show_caret)
4484 : 149 : error_at (input_location,
4485 : : "%qE cannot be used as a function", original);
4486 : 0 : else if (DECL_P (original))
4487 : 0 : error_at (input_location,
4488 : : "%qD cannot be used as a function", original);
4489 : : else
4490 : 0 : error_at (input_location,
4491 : : "expression cannot be used as a function");
4492 : : }
4493 : :
4494 : 1367 : return error_mark_node;
4495 : : }
4496 : :
4497 : : /* fntype now gets the type of function pointed to. */
4498 : 2714740 : fntype = TREE_TYPE (fntype);
4499 : 2714740 : parm_types = TYPE_ARG_TYPES (fntype);
4500 : :
4501 : 2714740 : if (params == NULL)
4502 : : {
4503 : 142902 : allocated = make_tree_vector ();
4504 : 142902 : params = &allocated;
4505 : : }
4506 : :
4507 : 2714740 : nargs = convert_arguments (parm_types, params, fndecl, LOOKUP_NORMAL,
4508 : : complain);
4509 : 2714740 : if (nargs < 0)
4510 : 1256 : return error_mark_node;
4511 : :
4512 : 2713484 : argarray = (*params)->address ();
4513 : :
4514 : : /* Check for errors in format strings and inappropriately
4515 : : null parameters. */
4516 : 2713484 : bool warned_p = check_function_arguments (input_location, fndecl, fntype,
4517 : : nargs, argarray, NULL,
4518 : : cp_comp_parm_types);
4519 : :
4520 : 2713484 : ret = build_cxx_call (function, nargs, argarray, complain, orig_fndecl);
4521 : :
4522 : 2713484 : if (warned_p)
4523 : : {
4524 : 27 : tree c = extract_call_expr (ret);
4525 : 27 : if (TREE_CODE (c) == CALL_EXPR)
4526 : 27 : suppress_warning (c, OPT_Wnonnull);
4527 : : }
4528 : :
4529 : 2713484 : if (allocated != NULL)
4530 : 142902 : release_tree_vector (allocated);
4531 : :
4532 : : return ret;
4533 : : }
4534 : :
4535 : : /* Subroutine of convert_arguments.
4536 : : Print an error message about a wrong number of arguments. */
4537 : :
4538 : : static void
4539 : 147 : error_args_num (location_t loc, tree fndecl, bool too_many_p)
4540 : : {
4541 : 147 : if (fndecl)
4542 : : {
4543 : 114 : auto_diagnostic_group d;
4544 : 114 : if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
4545 : : {
4546 : 0 : if (DECL_NAME (fndecl) == NULL_TREE
4547 : 0 : || (DECL_NAME (fndecl)
4548 : 0 : == DECL_NAME (TYPE_NAME (DECL_CONTEXT (fndecl)))))
4549 : 0 : error_at (loc,
4550 : : too_many_p
4551 : : ? G_("too many arguments to constructor %q#D")
4552 : : : G_("too few arguments to constructor %q#D"),
4553 : : fndecl);
4554 : : else
4555 : 0 : error_at (loc,
4556 : : too_many_p
4557 : : ? G_("too many arguments to member function %q#D")
4558 : : : G_("too few arguments to member function %q#D"),
4559 : : fndecl);
4560 : : }
4561 : : else
4562 : 171 : error_at (loc,
4563 : : too_many_p
4564 : : ? G_("too many arguments to function %q#D")
4565 : : : G_("too few arguments to function %q#D"),
4566 : : fndecl);
4567 : 114 : if (!DECL_IS_UNDECLARED_BUILTIN (fndecl))
4568 : 75 : inform (DECL_SOURCE_LOCATION (fndecl), "declared here");
4569 : 114 : }
4570 : : else
4571 : : {
4572 : 33 : if (c_dialect_objc () && objc_message_selector ())
4573 : 0 : error_at (loc,
4574 : : too_many_p
4575 : : ? G_("too many arguments to method %q#D")
4576 : : : G_("too few arguments to method %q#D"),
4577 : : objc_message_selector ());
4578 : : else
4579 : 54 : error_at (loc, too_many_p ? G_("too many arguments to function")
4580 : : : G_("too few arguments to function"));
4581 : : }
4582 : 147 : }
4583 : :
4584 : : /* Convert the actual parameter expressions in the list VALUES to the
4585 : : types in the list TYPELIST. The converted expressions are stored
4586 : : back in the VALUES vector.
4587 : : If parmdecls is exhausted, or when an element has NULL as its type,
4588 : : perform the default conversions.
4589 : :
4590 : : NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
4591 : :
4592 : : This is also where warnings about wrong number of args are generated.
4593 : :
4594 : : Returns the actual number of arguments processed (which might be less
4595 : : than the length of the vector), or -1 on error.
4596 : :
4597 : : In C++, unspecified trailing parameters can be filled in with their
4598 : : default arguments, if such were specified. Do so here. */
4599 : :
4600 : : static int
4601 : 2714740 : convert_arguments (tree typelist, vec<tree, va_gc> **values, tree fndecl,
4602 : : int flags, tsubst_flags_t complain)
4603 : : {
4604 : 2714740 : tree typetail;
4605 : 2714740 : unsigned int i;
4606 : :
4607 : : /* Argument passing is always copy-initialization. */
4608 : 2714740 : flags |= LOOKUP_ONLYCONVERTING;
4609 : :
4610 : 6348944 : for (i = 0, typetail = typelist;
4611 : 6348944 : i < vec_safe_length (*values);
4612 : : i++)
4613 : : {
4614 : 7270324 : tree type = typetail ? TREE_VALUE (typetail) : 0;
4615 : 3635385 : tree val = (**values)[i];
4616 : :
4617 : 3635385 : if (val == error_mark_node || type == error_mark_node)
4618 : : return -1;
4619 : :
4620 : 3635379 : if (type == void_type_node)
4621 : : {
4622 : 190 : if (complain & tf_error)
4623 : : {
4624 : 69 : error_args_num (input_location, fndecl, /*too_many_p=*/true);
4625 : 69 : return i;
4626 : : }
4627 : : else
4628 : : return -1;
4629 : : }
4630 : :
4631 : : /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4632 : : Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
4633 : 3635189 : if (TREE_CODE (val) == NOP_EXPR
4634 : 844217 : && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
4635 : 3635207 : && (type == 0 || !TYPE_REF_P (type)))
4636 : 18 : val = TREE_OPERAND (val, 0);
4637 : :
4638 : 3635189 : if (type == 0 || !TYPE_REF_P (type))
4639 : : {
4640 : 3423284 : if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
4641 : 3423284 : || FUNC_OR_METHOD_TYPE_P (TREE_TYPE (val)))
4642 : 10626 : val = decay_conversion (val, complain);
4643 : : }
4644 : :
4645 : 3635189 : if (val == error_mark_node)
4646 : : return -1;
4647 : :
4648 : 3635189 : if (type != 0)
4649 : : {
4650 : : /* Formal parm type is specified by a function prototype. */
4651 : 3634743 : tree parmval;
4652 : :
4653 : 3634743 : if (!COMPLETE_TYPE_P (complete_type (type)))
4654 : : {
4655 : 18 : if (complain & tf_error)
4656 : : {
4657 : 12 : location_t loc = EXPR_LOC_OR_LOC (val, input_location);
4658 : 12 : if (fndecl)
4659 : : {
4660 : 12 : auto_diagnostic_group d;
4661 : 12 : error_at (loc,
4662 : : "parameter %P of %qD has incomplete type %qT",
4663 : : i, fndecl, type);
4664 : 12 : inform (get_fndecl_argument_location (fndecl, i),
4665 : : " declared here");
4666 : 12 : }
4667 : : else
4668 : 0 : error_at (loc, "parameter %P has incomplete type %qT", i,
4669 : : type);
4670 : : }
4671 : 18 : parmval = error_mark_node;
4672 : : }
4673 : : else
4674 : : {
4675 : 3634725 : parmval = convert_for_initialization
4676 : 3634725 : (NULL_TREE, type, val, flags,
4677 : : ICR_ARGPASS, fndecl, i, complain);
4678 : 3634725 : parmval = convert_for_arg_passing (type, parmval, complain);
4679 : : }
4680 : :
4681 : 3634743 : if (parmval == error_mark_node)
4682 : : return -1;
4683 : :
4684 : 3633758 : (**values)[i] = parmval;
4685 : : }
4686 : : else
4687 : : {
4688 : 446 : int magic = fndecl ? magic_varargs_p (fndecl) : 0;
4689 : 21 : if (magic)
4690 : : {
4691 : : /* Don't truncate excess precision to the semantic type. */
4692 : 0 : if (magic == 1 && TREE_CODE (val) == EXCESS_PRECISION_EXPR)
4693 : 0 : val = TREE_OPERAND (val, 0);
4694 : : /* Don't do ellipsis conversion for __built_in_constant_p
4695 : : as this will result in spurious errors for non-trivial
4696 : : types. */
4697 : 0 : val = require_complete_type (val, complain);
4698 : : }
4699 : : else
4700 : 446 : val = convert_arg_to_ellipsis (val, complain);
4701 : :
4702 : 446 : (**values)[i] = val;
4703 : : }
4704 : :
4705 : 3634204 : if (typetail)
4706 : 3633758 : typetail = TREE_CHAIN (typetail);
4707 : : }
4708 : :
4709 : 2713559 : if (typetail != 0 && typetail != void_list_node)
4710 : : {
4711 : : /* See if there are default arguments that can be used. Because
4712 : : we hold default arguments in the FUNCTION_TYPE (which is so
4713 : : wrong), we can see default parameters here from deduced
4714 : : contexts (and via typeof) for indirect function calls.
4715 : : Fortunately we know whether we have a function decl to
4716 : : provide default arguments in a language conformant
4717 : : manner. */
4718 : 57 : if (fndecl && TREE_PURPOSE (typetail)
4719 : 147 : && TREE_CODE (TREE_PURPOSE (typetail)) != DEFERRED_PARSE)
4720 : : {
4721 : 6 : for (; typetail != void_list_node; ++i)
4722 : : {
4723 : : /* After DR777, with explicit template args we can end up with a
4724 : : default argument followed by no default argument. */
4725 : 6 : if (!TREE_PURPOSE (typetail))
4726 : : break;
4727 : 3 : tree parmval
4728 : 3 : = convert_default_arg (TREE_VALUE (typetail),
4729 : 3 : TREE_PURPOSE (typetail),
4730 : 3 : fndecl, i, complain);
4731 : :
4732 : 3 : if (parmval == error_mark_node)
4733 : 0 : return -1;
4734 : :
4735 : 3 : vec_safe_push (*values, parmval);
4736 : 3 : typetail = TREE_CHAIN (typetail);
4737 : : /* ends with `...'. */
4738 : 3 : if (typetail == NULL_TREE)
4739 : : break;
4740 : : }
4741 : : }
4742 : :
4743 : 144 : if (typetail && typetail != void_list_node)
4744 : : {
4745 : 144 : if (complain & tf_error)
4746 : 78 : error_args_num (input_location, fndecl, /*too_many_p=*/false);
4747 : 144 : return -1;
4748 : : }
4749 : : }
4750 : :
4751 : 2713415 : return (int) i;
4752 : : }
4753 : :
4754 : : /* Build a binary-operation expression, after performing default
4755 : : conversions on the operands. CODE is the kind of expression to
4756 : : build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
4757 : : are the tree codes which correspond to ARG1 and ARG2 when issuing
4758 : : warnings about possibly misplaced parentheses. They may differ
4759 : : from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
4760 : : folding (e.g., if the parser sees "a | 1 + 1", it may call this
4761 : : routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
4762 : : To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
4763 : : ARG2_CODE as ERROR_MARK. */
4764 : :
4765 : : tree
4766 : 184584738 : build_x_binary_op (const op_location_t &loc, enum tree_code code, tree arg1,
4767 : : enum tree_code arg1_code, tree arg2,
4768 : : enum tree_code arg2_code, tree lookups,
4769 : : tree *overload_p, tsubst_flags_t complain)
4770 : : {
4771 : 184584738 : tree orig_arg1;
4772 : 184584738 : tree orig_arg2;
4773 : 184584738 : tree expr;
4774 : 184584738 : tree overload = NULL_TREE;
4775 : :
4776 : 184584738 : orig_arg1 = arg1;
4777 : 184584738 : orig_arg2 = arg2;
4778 : :
4779 : 184584738 : if (processing_template_decl)
4780 : : {
4781 : 109620851 : if (type_dependent_expression_p (arg1)
4782 : 109620851 : || type_dependent_expression_p (arg2))
4783 : : {
4784 : 78590993 : expr = build_min_nt_loc (loc, code, arg1, arg2);
4785 : 78590993 : TREE_TYPE (expr)
4786 : 78590993 : = build_dependent_operator_type (lookups, code, false);
4787 : 78590993 : return expr;
4788 : : }
4789 : : }
4790 : :
4791 : 105993745 : if (code == DOTSTAR_EXPR)
4792 : 105711 : expr = build_m_component_ref (arg1, arg2, complain);
4793 : : else
4794 : 105888034 : expr = build_new_op (loc, code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
4795 : : lookups, &overload, complain);
4796 : :
4797 : 105993712 : if (overload_p != NULL)
4798 : 44315183 : *overload_p = overload;
4799 : :
4800 : : /* Check for cases such as x+y<<z which users are likely to
4801 : : misinterpret. But don't warn about obj << x + y, since that is a
4802 : : common idiom for I/O. */
4803 : 105993712 : if (warn_parentheses
4804 : 1095438 : && (complain & tf_warning)
4805 : 1058612 : && !processing_template_decl
4806 : 735119 : && !error_operand_p (arg1)
4807 : 735113 : && !error_operand_p (arg2)
4808 : 106728813 : && (code != LSHIFT_EXPR
4809 : 67572 : || !CLASS_TYPE_P (TREE_TYPE (arg1))))
4810 : 734116 : warn_about_parentheses (loc, code, arg1_code, orig_arg1,
4811 : : arg2_code, orig_arg2);
4812 : :
4813 : 105993712 : if (processing_template_decl && expr != error_mark_node)
4814 : : {
4815 : 31029667 : if (overload != NULL_TREE)
4816 : 1931256 : return (build_min_non_dep_op_overload
4817 : 1931256 : (code, expr, overload, orig_arg1, orig_arg2));
4818 : :
4819 : 29098411 : return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
4820 : : }
4821 : :
4822 : : return expr;
4823 : : }
4824 : :
4825 : : /* Build and return an ARRAY_REF expression. */
4826 : :
4827 : : tree
4828 : 1717213 : build_x_array_ref (location_t loc, tree arg1, tree arg2,
4829 : : tsubst_flags_t complain)
4830 : : {
4831 : 1717213 : tree orig_arg1 = arg1;
4832 : 1717213 : tree orig_arg2 = arg2;
4833 : 1717213 : tree expr;
4834 : 1717213 : tree overload = NULL_TREE;
4835 : :
4836 : 1717213 : if (processing_template_decl)
4837 : : {
4838 : 638 : if (type_dependent_expression_p (arg1)
4839 : 638 : || type_dependent_expression_p (arg2))
4840 : 620 : return build_min_nt_loc (loc, ARRAY_REF, arg1, arg2,
4841 : 620 : NULL_TREE, NULL_TREE);
4842 : : }
4843 : :
4844 : 1716593 : expr = build_new_op (loc, ARRAY_REF, LOOKUP_NORMAL, arg1, arg2,
4845 : : NULL_TREE, NULL_TREE, &overload, complain);
4846 : :
4847 : 1716593 : if (processing_template_decl && expr != error_mark_node)
4848 : : {
4849 : 15 : if (overload != NULL_TREE)
4850 : 1 : return (build_min_non_dep_op_overload
4851 : 1 : (ARRAY_REF, expr, overload, orig_arg1, orig_arg2));
4852 : :
4853 : 14 : return build_min_non_dep (ARRAY_REF, expr, orig_arg1, orig_arg2,
4854 : 14 : NULL_TREE, NULL_TREE);
4855 : : }
4856 : : return expr;
4857 : : }
4858 : :
4859 : : /* Build an OpenMP array section reference, creating an exact type for the
4860 : : resulting expression based on the element type and bounds if possible. If
4861 : : we have variable bounds, create an incomplete array type for the result
4862 : : instead. */
4863 : :
4864 : : tree
4865 : 10338 : build_omp_array_section (location_t loc, tree array_expr, tree index,
4866 : : tree length)
4867 : : {
4868 : 10338 : tree type = TREE_TYPE (array_expr);
4869 : 10338 : gcc_assert (type);
4870 : 10338 : type = non_reference (type);
4871 : :
4872 : 10338 : tree sectype, eltype = TREE_TYPE (type);
4873 : :
4874 : : /* It's not an array or pointer type. Just reuse the type of the
4875 : : original expression as the type of the array section (an error will be
4876 : : raised anyway, later). */
4877 : 10338 : if (eltype == NULL_TREE)
4878 : 51 : sectype = TREE_TYPE (array_expr);
4879 : : else
4880 : : {
4881 : 10287 : tree idxtype = NULL_TREE;
4882 : :
4883 : : /* If we know the integer bounds, create an index type with exact
4884 : : low/high (or zero/length) bounds. Otherwise, create an incomplete
4885 : : array type. (This mostly only affects diagnostics.) */
4886 : 10287 : if (index != NULL_TREE
4887 : 10287 : && length != NULL_TREE
4888 : 7429 : && TREE_CODE (index) == INTEGER_CST
4889 : 6591 : && TREE_CODE (length) == INTEGER_CST)
4890 : : {
4891 : 5183 : tree low = fold_convert (sizetype, index);
4892 : 5183 : tree high = fold_convert (sizetype, length);
4893 : 5183 : high = size_binop (PLUS_EXPR, low, high);
4894 : 5183 : high = size_binop (MINUS_EXPR, high, size_one_node);
4895 : 5183 : idxtype = build_range_type (sizetype, low, high);
4896 : 5183 : }
4897 : 2906 : else if ((index == NULL_TREE || integer_zerop (index))
4898 : 3429 : && length != NULL_TREE
4899 : 7021 : && TREE_CODE (length) == INTEGER_CST)
4900 : 1364 : idxtype = build_index_type (length);
4901 : :
4902 : 10287 : sectype = build_array_type (eltype, idxtype);
4903 : : }
4904 : :
4905 : 10338 : return build3_loc (loc, OMP_ARRAY_SECTION, sectype, array_expr, index,
4906 : 10338 : length);
4907 : : }
4908 : :
4909 : : /* Return whether OP is an expression of enum type cast to integer
4910 : : type. In C++ even unsigned enum types are cast to signed integer
4911 : : types. We do not want to issue warnings about comparisons between
4912 : : signed and unsigned types when one of the types is an enum type.
4913 : : Those warnings are always false positives in practice. */
4914 : :
4915 : : static bool
4916 : 574984 : enum_cast_to_int (tree op)
4917 : : {
4918 : 563356 : if (CONVERT_EXPR_P (op)
4919 : 12718 : && TREE_TYPE (op) == integer_type_node
4920 : 765 : && TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == ENUMERAL_TYPE
4921 : 575022 : && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 0))))
4922 : : return true;
4923 : :
4924 : : /* The cast may have been pushed into a COND_EXPR. */
4925 : 574954 : if (TREE_CODE (op) == COND_EXPR)
4926 : 755 : return (enum_cast_to_int (TREE_OPERAND (op, 1))
4927 : 755 : || enum_cast_to_int (TREE_OPERAND (op, 2)));
4928 : :
4929 : : return false;
4930 : : }
4931 : :
4932 : : /* For the c-common bits. */
4933 : : tree
4934 : 3670023 : build_binary_op (location_t location, enum tree_code code, tree op0, tree op1,
4935 : : bool /*convert_p*/)
4936 : : {
4937 : 3670023 : return cp_build_binary_op (location, code, op0, op1, tf_warning_or_error);
4938 : : }
4939 : :
4940 : : /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
4941 : : into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
4942 : :
4943 : : static tree
4944 : 6551 : build_vec_cmp (tree_code code, tree type,
4945 : : tree arg0, tree arg1)
4946 : : {
4947 : 6551 : tree zero_vec = build_zero_cst (type);
4948 : 6551 : tree minus_one_vec = build_minus_one_cst (type);
4949 : 6551 : tree cmp_type = truth_type_for (TREE_TYPE (arg0));
4950 : 6551 : tree cmp = build2 (code, cmp_type, arg0, arg1);
4951 : 6551 : return build3 (VEC_COND_EXPR, type, cmp, minus_one_vec, zero_vec);
4952 : : }
4953 : :
4954 : : /* Possibly warn about an address never being NULL. */
4955 : :
4956 : : static void
4957 : 1481395 : warn_for_null_address (location_t location, tree op, tsubst_flags_t complain)
4958 : : {
4959 : : /* Prevent warnings issued for macro expansion. */
4960 : 1481395 : if (!warn_address
4961 : 40242 : || (complain & tf_warning) == 0
4962 : 24026 : || c_inhibit_evaluation_warnings != 0
4963 : 23986 : || from_macro_expansion_at (location)
4964 : 1498769 : || warning_suppressed_p (op, OPT_Waddress))
4965 : 1464344 : return;
4966 : :
4967 : 17341 : tree cop = fold_for_warn (op);
4968 : :
4969 : 17341 : if (TREE_CODE (cop) == NON_LVALUE_EXPR)
4970 : : /* Unwrap the expression for C++ 98. */
4971 : 1 : cop = TREE_OPERAND (cop, 0);
4972 : :
4973 : 17341 : if (TREE_CODE (cop) == PTRMEM_CST)
4974 : : {
4975 : : /* The address of a nonstatic data member is never null. */
4976 : 30 : warning_at (location, OPT_Waddress,
4977 : : "the address %qE will never be NULL",
4978 : : cop);
4979 : 30 : return;
4980 : : }
4981 : :
4982 : 17311 : if (TREE_CODE (cop) == NOP_EXPR)
4983 : : {
4984 : : /* Allow casts to intptr_t to suppress the warning. */
4985 : 1083 : tree type = TREE_TYPE (cop);
4986 : 1083 : if (TREE_CODE (type) == INTEGER_TYPE)
4987 : : return;
4988 : :
4989 : 1083 : STRIP_NOPS (cop);
4990 : : }
4991 : :
4992 : 17311 : auto_diagnostic_group d;
4993 : 17311 : bool warned = false;
4994 : 17311 : if (TREE_CODE (cop) == ADDR_EXPR)
4995 : : {
4996 : 789 : cop = TREE_OPERAND (cop, 0);
4997 : :
4998 : : /* Set to true in the loop below if OP dereferences its operand.
4999 : : In such a case the ultimate target need not be a decl for
5000 : : the null [in]equality test to be necessarily constant. */
5001 : 789 : bool deref = false;
5002 : :
5003 : : /* Get the outermost array or object, or member. */
5004 : 960 : while (handled_component_p (cop))
5005 : : {
5006 : 270 : if (TREE_CODE (cop) == COMPONENT_REF)
5007 : : {
5008 : : /* Get the member (its address is never null). */
5009 : 99 : cop = TREE_OPERAND (cop, 1);
5010 : 99 : break;
5011 : : }
5012 : :
5013 : : /* Get the outer array/object to refer to in the warning. */
5014 : 171 : cop = TREE_OPERAND (cop, 0);
5015 : 171 : deref = true;
5016 : : }
5017 : :
5018 : 639 : if ((!deref && !decl_with_nonnull_addr_p (cop))
5019 : 631 : || from_macro_expansion_at (location)
5020 : 1420 : || warning_suppressed_p (cop, OPT_Waddress))
5021 : 158 : return;
5022 : :
5023 : 631 : warned = warning_at (location, OPT_Waddress,
5024 : : "the address of %qD will never be NULL", cop);
5025 : 631 : op = cop;
5026 : : }
5027 : 16522 : else if (TREE_CODE (cop) == POINTER_PLUS_EXPR)
5028 : : {
5029 : : /* Adding zero to the null pointer is well-defined in C++. When
5030 : : the offset is unknown (i.e., not a constant) warn anyway since
5031 : : it's less likely that the pointer operand is null than not. */
5032 : 102 : tree off = TREE_OPERAND (cop, 1);
5033 : 102 : if (!integer_zerop (off)
5034 : 102 : && !warning_suppressed_p (cop, OPT_Waddress))
5035 : : {
5036 : 102 : tree base = TREE_OPERAND (cop, 0);
5037 : 102 : STRIP_NOPS (base);
5038 : 102 : if (TYPE_REF_P (TREE_TYPE (base)))
5039 : 12 : warning_at (location, OPT_Waddress, "the compiler can assume that "
5040 : : "the address of %qE will never be NULL", base);
5041 : : else
5042 : 90 : warning_at (location, OPT_Waddress, "comparing the result of "
5043 : : "pointer addition %qE and NULL", cop);
5044 : : }
5045 : 102 : return;
5046 : : }
5047 : 15618 : else if (CONVERT_EXPR_P (op)
5048 : 16482 : && TYPE_REF_P (TREE_TYPE (TREE_OPERAND (op, 0))))
5049 : : {
5050 : 62 : STRIP_NOPS (op);
5051 : :
5052 : 62 : if (TREE_CODE (op) == COMPONENT_REF)
5053 : 24 : op = TREE_OPERAND (op, 1);
5054 : :
5055 : 62 : if (DECL_P (op))
5056 : 62 : warned = warning_at (location, OPT_Waddress,
5057 : : "the compiler can assume that the address of "
5058 : : "%qD will never be NULL", op);
5059 : : }
5060 : :
5061 : 693 : if (warned && DECL_P (op))
5062 : 657 : inform (DECL_SOURCE_LOCATION (op), "%qD declared here", op);
5063 : 17311 : }
5064 : :
5065 : : /* Warn about [expr.arith.conv]/2: If one operand is of enumeration type and
5066 : : the other operand is of a different enumeration type or a floating-point
5067 : : type, this behavior is deprecated ([depr.arith.conv.enum]). CODE is the
5068 : : code of the binary operation, TYPE0 and TYPE1 are the types of the operands,
5069 : : and LOC is the location for the whole binary expression.
5070 : : For C++26 this is ill-formed rather than deprecated.
5071 : : Return true for SFINAE errors.
5072 : : TODO: Consider combining this with -Wenum-compare in build_new_op_1. */
5073 : :
5074 : : static bool
5075 : 88772181 : do_warn_enum_conversions (location_t loc, enum tree_code code, tree type0,
5076 : : tree type1, tsubst_flags_t complain)
5077 : : {
5078 : 88772181 : if (TREE_CODE (type0) == ENUMERAL_TYPE
5079 : 2565627 : && TREE_CODE (type1) == ENUMERAL_TYPE
5080 : 90811321 : && TYPE_MAIN_VARIANT (type0) != TYPE_MAIN_VARIANT (type1))
5081 : : {
5082 : 198 : if (cxx_dialect >= cxx26)
5083 : : {
5084 : 60 : if ((complain & tf_warning_or_error) == 0)
5085 : : return true;
5086 : : }
5087 : 138 : else if ((complain & tf_warning) == 0)
5088 : : return false;
5089 : : /* In C++20, -Wdeprecated-enum-enum-conversion is on by default.
5090 : : Otherwise, warn if -Wenum-conversion is on. */
5091 : 190 : enum opt_code opt;
5092 : 190 : if (warn_deprecated_enum_enum_conv)
5093 : : opt = OPT_Wdeprecated_enum_enum_conversion;
5094 : 97 : else if (warn_enum_conversion)
5095 : : opt = OPT_Wenum_conversion;
5096 : : else
5097 : : return false;
5098 : :
5099 : 115 : switch (code)
5100 : : {
5101 : : case GT_EXPR:
5102 : : case LT_EXPR:
5103 : : case GE_EXPR:
5104 : : case LE_EXPR:
5105 : : case EQ_EXPR:
5106 : : case NE_EXPR:
5107 : : /* Comparisons are handled by -Wenum-compare. */
5108 : : return false;
5109 : : case SPACESHIP_EXPR:
5110 : : /* This is invalid, don't warn. */
5111 : : return false;
5112 : 17 : case BIT_AND_EXPR:
5113 : 17 : case BIT_IOR_EXPR:
5114 : 17 : case BIT_XOR_EXPR:
5115 : 17 : if (cxx_dialect >= cxx26)
5116 : 5 : pedwarn (loc, opt, "bitwise operation between different "
5117 : : "enumeration types %qT and %qT", type0, type1);
5118 : : else
5119 : 12 : warning_at (loc, opt, "bitwise operation between different "
5120 : : "enumeration types %qT and %qT is deprecated",
5121 : : type0, type1);
5122 : 17 : return false;
5123 : 41 : default:
5124 : 41 : if (cxx_dialect >= cxx26)
5125 : 12 : pedwarn (loc, opt, "arithmetic between different enumeration "
5126 : : "types %qT and %qT", type0, type1);
5127 : : else
5128 : 29 : warning_at (loc, opt, "arithmetic between different enumeration "
5129 : : "types %qT and %qT is deprecated", type0, type1);
5130 : 41 : return false;
5131 : : }
5132 : : }
5133 : 88771983 : else if ((TREE_CODE (type0) == ENUMERAL_TYPE
5134 : 2565429 : && SCALAR_FLOAT_TYPE_P (type1))
5135 : 88771906 : || (SCALAR_FLOAT_TYPE_P (type0)
5136 : 31441459 : && TREE_CODE (type1) == ENUMERAL_TYPE))
5137 : : {
5138 : 154 : if (cxx_dialect >= cxx26)
5139 : : {
5140 : 46 : if ((complain & tf_warning_or_error) == 0)
5141 : : return true;
5142 : : }
5143 : 108 : else if ((complain & tf_warning) == 0)
5144 : : return false;
5145 : 142 : const bool enum_first_p = TREE_CODE (type0) == ENUMERAL_TYPE;
5146 : : /* In C++20, -Wdeprecated-enum-float-conversion is on by default.
5147 : : Otherwise, warn if -Wenum-conversion is on. */
5148 : 142 : enum opt_code opt;
5149 : 142 : if (warn_deprecated_enum_float_conv)
5150 : : opt = OPT_Wdeprecated_enum_float_conversion;
5151 : 75 : else if (warn_enum_conversion)
5152 : : opt = OPT_Wenum_conversion;
5153 : : else
5154 : : return false;
5155 : :
5156 : 84 : switch (code)
5157 : : {
5158 : 34 : case GT_EXPR:
5159 : 34 : case LT_EXPR:
5160 : 34 : case GE_EXPR:
5161 : 34 : case LE_EXPR:
5162 : 34 : case EQ_EXPR:
5163 : 34 : case NE_EXPR:
5164 : 34 : if (enum_first_p && cxx_dialect >= cxx26)
5165 : 5 : pedwarn (loc, opt, "comparison of enumeration type %qT with "
5166 : : "floating-point type %qT", type0, type1);
5167 : 29 : else if (cxx_dialect >= cxx26)
5168 : 5 : pedwarn (loc, opt, "comparison of floating-point type %qT "
5169 : : "with enumeration type %qT", type0, type1);
5170 : 24 : else if (enum_first_p)
5171 : 12 : warning_at (loc, opt, "comparison of enumeration type %qT with "
5172 : : "floating-point type %qT is deprecated",
5173 : : type0, type1);
5174 : : else
5175 : 12 : warning_at (loc, opt, "comparison of floating-point type %qT "
5176 : : "with enumeration type %qT is deprecated",
5177 : : type0, type1);
5178 : 34 : return false;
5179 : : case SPACESHIP_EXPR:
5180 : : /* This is invalid, don't warn. */
5181 : : return false;
5182 : 38 : default:
5183 : 38 : if (enum_first_p && cxx_dialect >= cxx26)
5184 : 5 : pedwarn (loc, opt, "arithmetic between enumeration type %qT "
5185 : : "and floating-point type %qT", type0, type1);
5186 : 33 : else if (cxx_dialect >= cxx26)
5187 : 6 : pedwarn (loc, opt, "arithmetic between floating-point type %qT "
5188 : : "and enumeration type %qT", type0, type1);
5189 : 27 : else if (enum_first_p)
5190 : 12 : warning_at (loc, opt, "arithmetic between enumeration type %qT "
5191 : : "and floating-point type %qT is deprecated",
5192 : : type0, type1);
5193 : : else
5194 : 15 : warning_at (loc, opt, "arithmetic between floating-point type %qT "
5195 : : "and enumeration type %qT is deprecated",
5196 : : type0, type1);
5197 : 38 : return false;
5198 : : }
5199 : : }
5200 : : return false;
5201 : : }
5202 : :
5203 : : /* Build a binary-operation expression without default conversions.
5204 : : CODE is the kind of expression to build.
5205 : : LOCATION is the location_t of the operator in the source code.
5206 : : This function differs from `build' in several ways:
5207 : : the data type of the result is computed and recorded in it,
5208 : : warnings are generated if arg data types are invalid,
5209 : : special handling for addition and subtraction of pointers is known,
5210 : : and some optimization is done (operations on narrow ints
5211 : : are done in the narrower type when that gives the same result).
5212 : : Constant folding is also done before the result is returned.
5213 : :
5214 : : Note that the operands will never have enumeral types
5215 : : because either they have just had the default conversions performed
5216 : : or they have both just been converted to some other type in which
5217 : : the arithmetic is to be done.
5218 : :
5219 : : C++: must do special pointer arithmetic when implementing
5220 : : multiple inheritance, and deal with pointer to member functions. */
5221 : :
5222 : : tree
5223 : 115816259 : cp_build_binary_op (const op_location_t &location,
5224 : : enum tree_code code, tree orig_op0, tree orig_op1,
5225 : : tsubst_flags_t complain)
5226 : : {
5227 : 115816259 : tree op0, op1;
5228 : 115816259 : enum tree_code code0, code1;
5229 : 115816259 : tree type0, type1, orig_type0, orig_type1;
5230 : 115816259 : const char *invalid_op_diag;
5231 : :
5232 : : /* Expression code to give to the expression when it is built.
5233 : : Normally this is CODE, which is what the caller asked for,
5234 : : but in some special cases we change it. */
5235 : 115816259 : enum tree_code resultcode = code;
5236 : :
5237 : : /* Data type in which the computation is to be performed.
5238 : : In the simplest cases this is the common type of the arguments. */
5239 : 115816259 : tree result_type = NULL_TREE;
5240 : :
5241 : : /* When the computation is in excess precision, the type of the
5242 : : final EXCESS_PRECISION_EXPR. */
5243 : 115816259 : tree semantic_result_type = NULL;
5244 : :
5245 : : /* Nonzero means operands have already been type-converted
5246 : : in whatever way is necessary.
5247 : : Zero means they need to be converted to RESULT_TYPE. */
5248 : 115816259 : int converted = 0;
5249 : :
5250 : : /* Nonzero means create the expression with this type, rather than
5251 : : RESULT_TYPE. */
5252 : 115816259 : tree build_type = 0;
5253 : :
5254 : : /* Nonzero means after finally constructing the expression
5255 : : convert it to this type. */
5256 : 115816259 : tree final_type = 0;
5257 : :
5258 : 115816259 : tree result;
5259 : :
5260 : : /* Nonzero if this is an operation like MIN or MAX which can
5261 : : safely be computed in short if both args are promoted shorts.
5262 : : Also implies COMMON.
5263 : : -1 indicates a bitwise operation; this makes a difference
5264 : : in the exact conditions for when it is safe to do the operation
5265 : : in a narrower mode. */
5266 : 115816259 : int shorten = 0;
5267 : :
5268 : : /* Nonzero if this is a comparison operation;
5269 : : if both args are promoted shorts, compare the original shorts.
5270 : : Also implies COMMON. */
5271 : 115816259 : int short_compare = 0;
5272 : :
5273 : : /* Nonzero if this is a right-shift operation, which can be computed on the
5274 : : original short and then promoted if the operand is a promoted short. */
5275 : 115816259 : int short_shift = 0;
5276 : :
5277 : : /* Nonzero means set RESULT_TYPE to the common type of the args. */
5278 : 115816259 : int common = 0;
5279 : :
5280 : : /* True if both operands have arithmetic type. */
5281 : 115816259 : bool arithmetic_types_p;
5282 : :
5283 : : /* Remember whether we're doing / or %. */
5284 : 115816259 : bool doing_div_or_mod = false;
5285 : :
5286 : : /* Remember whether we're doing << or >>. */
5287 : 115816259 : bool doing_shift = false;
5288 : :
5289 : : /* Tree holding instrumentation expression. */
5290 : 115816259 : tree instrument_expr = NULL_TREE;
5291 : :
5292 : : /* True means this is an arithmetic operation that may need excess
5293 : : precision. */
5294 : 115816259 : bool may_need_excess_precision;
5295 : :
5296 : : /* Apply default conversions. */
5297 : 115816259 : op0 = resolve_nondeduced_context (orig_op0, complain);
5298 : 115816259 : op1 = resolve_nondeduced_context (orig_op1, complain);
5299 : :
5300 : 115816259 : if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
5301 : 105489578 : || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
5302 : 103015763 : || code == TRUTH_XOR_EXPR)
5303 : : {
5304 : 12800496 : if (!really_overloaded_fn (op0) && !VOID_TYPE_P (TREE_TYPE (op0)))
5305 : 12800478 : op0 = decay_conversion (op0, complain);
5306 : 12800496 : if (!really_overloaded_fn (op1) && !VOID_TYPE_P (TREE_TYPE (op1)))
5307 : 12800496 : op1 = decay_conversion (op1, complain);
5308 : : }
5309 : : else
5310 : : {
5311 : 103015763 : if (!really_overloaded_fn (op0) && !VOID_TYPE_P (TREE_TYPE (op0)))
5312 : 103015748 : op0 = cp_default_conversion (op0, complain);
5313 : 103015763 : if (!really_overloaded_fn (op1) && !VOID_TYPE_P (TREE_TYPE (op1)))
5314 : 103015760 : op1 = cp_default_conversion (op1, complain);
5315 : : }
5316 : :
5317 : : /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
5318 : 122812489 : STRIP_TYPE_NOPS (op0);
5319 : 141308943 : STRIP_TYPE_NOPS (op1);
5320 : :
5321 : : /* DTRT if one side is an overloaded function, but complain about it. */
5322 : 115816259 : if (type_unknown_p (op0))
5323 : : {
5324 : 9 : tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
5325 : 9 : if (t != error_mark_node)
5326 : : {
5327 : 0 : if (complain & tf_error)
5328 : 0 : permerror (location,
5329 : : "assuming cast to type %qT from overloaded function",
5330 : 0 : TREE_TYPE (t));
5331 : : op0 = t;
5332 : : }
5333 : : }
5334 : 115816259 : if (type_unknown_p (op1))
5335 : : {
5336 : 3 : tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none);
5337 : 3 : if (t != error_mark_node)
5338 : : {
5339 : 3 : if (complain & tf_error)
5340 : 3 : permerror (location,
5341 : : "assuming cast to type %qT from overloaded function",
5342 : 3 : TREE_TYPE (t));
5343 : : op1 = t;
5344 : : }
5345 : : }
5346 : :
5347 : 115816259 : orig_type0 = type0 = TREE_TYPE (op0);
5348 : 115816259 : orig_type1 = type1 = TREE_TYPE (op1);
5349 : 115816259 : tree non_ep_op0 = op0;
5350 : 115816259 : tree non_ep_op1 = op1;
5351 : :
5352 : : /* The expression codes of the data types of the arguments tell us
5353 : : whether the arguments are integers, floating, pointers, etc. */
5354 : 115816259 : code0 = TREE_CODE (type0);
5355 : 115816259 : code1 = TREE_CODE (type1);
5356 : :
5357 : : /* If an error was already reported for one of the arguments,
5358 : : avoid reporting another error. */
5359 : 115816259 : if (code0 == ERROR_MARK || code1 == ERROR_MARK)
5360 : 97 : return error_mark_node;
5361 : :
5362 : 231632324 : if ((invalid_op_diag
5363 : 115816162 : = targetm.invalid_binary_op (code, type0, type1)))
5364 : : {
5365 : 0 : if (complain & tf_error)
5366 : : {
5367 : 0 : if (code0 == REAL_TYPE
5368 : 0 : && code1 == REAL_TYPE
5369 : 0 : && (extended_float_type_p (type0)
5370 : 0 : || extended_float_type_p (type1))
5371 : 0 : && cp_compare_floating_point_conversion_ranks (type0,
5372 : : type1) == 3)
5373 : : {
5374 : 0 : rich_location richloc (line_table, location);
5375 : 0 : binary_op_error (&richloc, code, type0, type1);
5376 : 0 : }
5377 : : else
5378 : 0 : error (invalid_op_diag);
5379 : : }
5380 : 0 : return error_mark_node;
5381 : : }
5382 : :
5383 : 115816162 : switch (code)
5384 : : {
5385 : : case PLUS_EXPR:
5386 : : case MINUS_EXPR:
5387 : : case MULT_EXPR:
5388 : : case TRUNC_DIV_EXPR:
5389 : : case CEIL_DIV_EXPR:
5390 : : case FLOOR_DIV_EXPR:
5391 : : case ROUND_DIV_EXPR:
5392 : : case EXACT_DIV_EXPR:
5393 : : may_need_excess_precision = true;
5394 : : break;
5395 : 37903720 : case EQ_EXPR:
5396 : 37903720 : case NE_EXPR:
5397 : 37903720 : case LE_EXPR:
5398 : 37903720 : case GE_EXPR:
5399 : 37903720 : case LT_EXPR:
5400 : 37903720 : case GT_EXPR:
5401 : 37903720 : case SPACESHIP_EXPR:
5402 : : /* Excess precision for implicit conversions of integers to
5403 : : floating point. */
5404 : 8183880 : may_need_excess_precision = (ANY_INTEGRAL_TYPE_P (type0)
5405 : 46081619 : || ANY_INTEGRAL_TYPE_P (type1));
5406 : : break;
5407 : : default:
5408 : 115816162 : may_need_excess_precision = false;
5409 : : break;
5410 : : }
5411 : 115816162 : if (TREE_CODE (op0) == EXCESS_PRECISION_EXPR)
5412 : : {
5413 : 17914 : op0 = TREE_OPERAND (op0, 0);
5414 : 17914 : type0 = TREE_TYPE (op0);
5415 : : }
5416 : 115798248 : else if (may_need_excess_precision
5417 : 88656773 : && (code0 == REAL_TYPE || code0 == COMPLEX_TYPE))
5418 : 27465631 : if (tree eptype = excess_precision_type (type0))
5419 : : {
5420 : 47919 : type0 = eptype;
5421 : 47919 : op0 = convert (eptype, op0);
5422 : : }
5423 : 115816162 : if (TREE_CODE (op1) == EXCESS_PRECISION_EXPR)
5424 : : {
5425 : 22570 : op1 = TREE_OPERAND (op1, 0);
5426 : 22570 : type1 = TREE_TYPE (op1);
5427 : : }
5428 : 115793592 : else if (may_need_excess_precision
5429 : 88654642 : && (code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
5430 : 27399940 : if (tree eptype = excess_precision_type (type1))
5431 : : {
5432 : 31597 : type1 = eptype;
5433 : 31597 : op1 = convert (eptype, op1);
5434 : : }
5435 : :
5436 : : /* Issue warnings about peculiar, but valid, uses of NULL. */
5437 : 231632239 : if ((null_node_p (orig_op0) || null_node_p (orig_op1))
5438 : : /* It's reasonable to use pointer values as operands of &&
5439 : : and ||, so NULL is no exception. */
5440 : 11851 : && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
5441 : 11836 : && ( /* Both are NULL (or 0) and the operation was not a
5442 : : comparison or a pointer subtraction. */
5443 : 11909 : (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
5444 : 27 : && code != EQ_EXPR && code != NE_EXPR && code != MINUS_EXPR)
5445 : : /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
5446 : 11824 : || (!null_ptr_cst_p (orig_op0)
5447 : 11763 : && !TYPE_PTR_OR_PTRMEM_P (type0))
5448 : 11812 : || (!null_ptr_cst_p (orig_op1)
5449 : 46 : && !TYPE_PTR_OR_PTRMEM_P (type1)))
5450 : 115816201 : && (complain & tf_warning))
5451 : : {
5452 : 39 : location_t loc =
5453 : 39 : expansion_point_location_if_in_system_header (input_location);
5454 : :
5455 : 39 : warning_at (loc, OPT_Wpointer_arith, "NULL used in arithmetic");
5456 : : }
5457 : :
5458 : : /* In case when one of the operands of the binary operation is
5459 : : a vector and another is a scalar -- convert scalar to vector. */
5460 : 115872738 : if ((gnu_vector_type_p (type0) && code1 != VECTOR_TYPE)
5461 : 115871920 : || (gnu_vector_type_p (type1) && code0 != VECTOR_TYPE))
5462 : : {
5463 : 902 : enum stv_conv convert_flag
5464 : 902 : = scalar_to_vector (location, code, non_ep_op0, non_ep_op1,
5465 : : complain & tf_error);
5466 : :
5467 : 902 : switch (convert_flag)
5468 : : {
5469 : 21 : case stv_error:
5470 : 21 : return error_mark_node;
5471 : 54 : case stv_firstarg:
5472 : 54 : {
5473 : 54 : op0 = convert (TREE_TYPE (type1), op0);
5474 : 54 : op0 = save_expr (op0);
5475 : 54 : op0 = build_vector_from_val (type1, op0);
5476 : 54 : orig_type0 = type0 = TREE_TYPE (op0);
5477 : 54 : code0 = TREE_CODE (type0);
5478 : 54 : converted = 1;
5479 : 54 : break;
5480 : : }
5481 : 722 : case stv_secondarg:
5482 : 722 : {
5483 : 722 : op1 = convert (TREE_TYPE (type0), op1);
5484 : 722 : op1 = save_expr (op1);
5485 : 722 : op1 = build_vector_from_val (type0, op1);
5486 : 722 : orig_type1 = type1 = TREE_TYPE (op1);
5487 : 722 : code1 = TREE_CODE (type1);
5488 : 722 : converted = 1;
5489 : 722 : break;
5490 : : }
5491 : : default:
5492 : : break;
5493 : : }
5494 : : }
5495 : :
5496 : 115816141 : switch (code)
5497 : : {
5498 : 13684840 : case MINUS_EXPR:
5499 : : /* Subtraction of two similar pointers.
5500 : : We must subtract them as integers, then divide by object size. */
5501 : 13684840 : if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
5502 : 14863933 : && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
5503 : 1179093 : TREE_TYPE (type1)))
5504 : : {
5505 : 1179091 : result = pointer_diff (location, op0, op1,
5506 : : common_pointer_type (type0, type1), complain,
5507 : : &instrument_expr);
5508 : 1179091 : if (instrument_expr != NULL)
5509 : 84 : result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
5510 : : instrument_expr, result);
5511 : :
5512 : 1179091 : return result;
5513 : : }
5514 : : /* In all other cases except pointer - int, the usual arithmetic
5515 : : rules apply. */
5516 : 12505749 : else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
5517 : : {
5518 : : common = 1;
5519 : : break;
5520 : : }
5521 : : /* The pointer - int case is just like pointer + int; fall
5522 : : through. */
5523 : 18069059 : gcc_fallthrough ();
5524 : 18069059 : case PLUS_EXPR:
5525 : 18069059 : if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
5526 : 5791030 : && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
5527 : : {
5528 : 5791021 : tree ptr_operand;
5529 : 5791021 : tree int_operand;
5530 : 5791021 : ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
5531 : 16040 : int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
5532 : 5791021 : if (processing_template_decl)
5533 : : {
5534 : 1926905 : result_type = TREE_TYPE (ptr_operand);
5535 : 1926905 : break;
5536 : : }
5537 : 3864116 : return cp_pointer_int_sum (location, code,
5538 : : ptr_operand,
5539 : : int_operand,
5540 : 3864116 : complain);
5541 : : }
5542 : : common = 1;
5543 : : break;
5544 : :
5545 : : case MULT_EXPR:
5546 : 110748281 : common = 1;
5547 : : break;
5548 : :
5549 : 9134545 : case TRUNC_DIV_EXPR:
5550 : 9134545 : case CEIL_DIV_EXPR:
5551 : 9134545 : case FLOOR_DIV_EXPR:
5552 : 9134545 : case ROUND_DIV_EXPR:
5553 : 9134545 : case EXACT_DIV_EXPR:
5554 : 9134545 : if (TREE_CODE (op0) == SIZEOF_EXPR && TREE_CODE (op1) == SIZEOF_EXPR)
5555 : : {
5556 : 94443 : tree type0 = TREE_OPERAND (op0, 0);
5557 : 94443 : tree type1 = TREE_OPERAND (op1, 0);
5558 : 94443 : tree first_arg = tree_strip_any_location_wrapper (type0);
5559 : 94443 : if (!TYPE_P (type0))
5560 : 76109 : type0 = TREE_TYPE (type0);
5561 : 94443 : if (!TYPE_P (type1))
5562 : 42747 : type1 = TREE_TYPE (type1);
5563 : 94443 : if (type0
5564 : 94443 : && type1
5565 : 74864 : && INDIRECT_TYPE_P (type0)
5566 : 94518 : && same_type_p (TREE_TYPE (type0), type1))
5567 : : {
5568 : 27 : if (!(TREE_CODE (first_arg) == PARM_DECL
5569 : 21 : && DECL_ARRAY_PARAMETER_P (first_arg)
5570 : 3 : && warn_sizeof_array_argument)
5571 : 42 : && (complain & tf_warning))
5572 : : {
5573 : 21 : auto_diagnostic_group d;
5574 : 21 : if (warning_at (location, OPT_Wsizeof_pointer_div,
5575 : : "division %<sizeof (%T) / sizeof (%T)%> does "
5576 : : "not compute the number of array elements",
5577 : : type0, type1))
5578 : 18 : if (DECL_P (first_arg))
5579 : 18 : inform (DECL_SOURCE_LOCATION (first_arg),
5580 : : "first %<sizeof%> operand was declared here");
5581 : 21 : }
5582 : : }
5583 : 94419 : else if (!dependent_type_p (type0)
5584 : 23268 : && !dependent_type_p (type1)
5585 : 23170 : && TREE_CODE (type0) == ARRAY_TYPE
5586 : 21566 : && !char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type0)))
5587 : : /* Set by finish_parenthesized_expr. */
5588 : 20951 : && !warning_suppressed_p (op1, OPT_Wsizeof_array_div)
5589 : 115352 : && (complain & tf_warning))
5590 : 20933 : maybe_warn_sizeof_array_div (location, first_arg, type0,
5591 : : op1, non_reference (type1));
5592 : : }
5593 : :
5594 : 9134545 : if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
5595 : : || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
5596 : 9134527 : && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
5597 : : || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
5598 : : {
5599 : 9134518 : enum tree_code tcode0 = code0, tcode1 = code1;
5600 : 9134518 : doing_div_or_mod = true;
5601 : 9134518 : warn_for_div_by_zero (location, fold_for_warn (op1));
5602 : :
5603 : 9134518 : if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
5604 : 58562 : tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
5605 : 9134518 : if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
5606 : 29995 : tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
5607 : :
5608 : 9134518 : if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
5609 : : resultcode = RDIV_EXPR;
5610 : : else
5611 : : {
5612 : : /* When dividing two signed integers, we have to promote to int.
5613 : : unless we divide by a constant != -1. Note that default
5614 : : conversion will have been performed on the operands at this
5615 : : point, so we have to dig out the original type to find out if
5616 : : it was unsigned. */
5617 : 3601290 : tree stripped_op1 = tree_strip_any_location_wrapper (op1);
5618 : 3601290 : shorten = may_shorten_divmod (op0, stripped_op1);
5619 : : }
5620 : :
5621 : : common = 1;
5622 : : }
5623 : : break;
5624 : :
5625 : 1954517 : case BIT_AND_EXPR:
5626 : 1954517 : case BIT_IOR_EXPR:
5627 : 1954517 : case BIT_XOR_EXPR:
5628 : 1954517 : if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
5629 : 1954517 : || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
5630 : 17292 : && !VECTOR_FLOAT_TYPE_P (type0)
5631 : 17274 : && !VECTOR_FLOAT_TYPE_P (type1)))
5632 : : shorten = -1;
5633 : : break;
5634 : :
5635 : 1087209 : case TRUNC_MOD_EXPR:
5636 : 1087209 : case FLOOR_MOD_EXPR:
5637 : 1087209 : doing_div_or_mod = true;
5638 : 1087209 : warn_for_div_by_zero (location, fold_for_warn (op1));
5639 : :
5640 : 1087209 : if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
5641 : 20 : && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
5642 : 1087229 : && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
5643 : : common = 1;
5644 : 1087189 : else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
5645 : : {
5646 : : /* Although it would be tempting to shorten always here, that loses
5647 : : on some targets, since the modulo instruction is undefined if the
5648 : : quotient can't be represented in the computation mode. We shorten
5649 : : only if unsigned or if dividing by something we know != -1. */
5650 : 1087165 : tree stripped_op1 = tree_strip_any_location_wrapper (op1);
5651 : 1087165 : shorten = may_shorten_divmod (op0, stripped_op1);
5652 : 1087165 : common = 1;
5653 : : }
5654 : : break;
5655 : :
5656 : 12800481 : case TRUTH_ANDIF_EXPR:
5657 : 12800481 : case TRUTH_ORIF_EXPR:
5658 : 12800481 : case TRUTH_AND_EXPR:
5659 : 12800481 : case TRUTH_OR_EXPR:
5660 : 12800481 : if (!VECTOR_TYPE_P (type0) && gnu_vector_type_p (type1))
5661 : : {
5662 : 3 : if (!COMPARISON_CLASS_P (op1))
5663 : 3 : op1 = cp_build_binary_op (EXPR_LOCATION (op1), NE_EXPR, op1,
5664 : : build_zero_cst (type1), complain);
5665 : 3 : if (code == TRUTH_ANDIF_EXPR)
5666 : : {
5667 : 0 : tree z = build_zero_cst (TREE_TYPE (op1));
5668 : 0 : return build_conditional_expr (location, op0, op1, z, complain);
5669 : : }
5670 : 3 : else if (code == TRUTH_ORIF_EXPR)
5671 : : {
5672 : 3 : tree m1 = build_all_ones_cst (TREE_TYPE (op1));
5673 : 3 : return build_conditional_expr (location, op0, m1, op1, complain);
5674 : : }
5675 : : else
5676 : 0 : gcc_unreachable ();
5677 : : }
5678 : 12800478 : if (gnu_vector_type_p (type0)
5679 : 12800478 : && (!VECTOR_TYPE_P (type1) || gnu_vector_type_p (type1)))
5680 : : {
5681 : 24 : if (!COMPARISON_CLASS_P (op0))
5682 : 24 : op0 = cp_build_binary_op (EXPR_LOCATION (op0), NE_EXPR, op0,
5683 : : build_zero_cst (type0), complain);
5684 : 24 : if (!VECTOR_TYPE_P (type1))
5685 : : {
5686 : 9 : tree m1 = build_all_ones_cst (TREE_TYPE (op0));
5687 : 9 : tree z = build_zero_cst (TREE_TYPE (op0));
5688 : 9 : op1 = build_conditional_expr (location, op1, m1, z, complain);
5689 : : }
5690 : 15 : else if (!COMPARISON_CLASS_P (op1))
5691 : 15 : op1 = cp_build_binary_op (EXPR_LOCATION (op1), NE_EXPR, op1,
5692 : : build_zero_cst (type1), complain);
5693 : :
5694 : 24 : if (code == TRUTH_ANDIF_EXPR)
5695 : : code = BIT_AND_EXPR;
5696 : 9 : else if (code == TRUTH_ORIF_EXPR)
5697 : : code = BIT_IOR_EXPR;
5698 : : else
5699 : 0 : gcc_unreachable ();
5700 : :
5701 : 24 : return cp_build_binary_op (location, code, op0, op1, complain);
5702 : : }
5703 : :
5704 : 12800454 : result_type = boolean_type_node;
5705 : 12800454 : break;
5706 : :
5707 : : /* Shift operations: result has same type as first operand;
5708 : : always convert second operand to int.
5709 : : Also set SHORT_SHIFT if shifting rightward. */
5710 : :
5711 : 856631 : case RSHIFT_EXPR:
5712 : 856631 : if (gnu_vector_type_p (type0)
5713 : 170 : && code1 == INTEGER_TYPE
5714 : 856678 : && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE)
5715 : : {
5716 : : result_type = type0;
5717 : : converted = 1;
5718 : : }
5719 : 856584 : else if (gnu_vector_type_p (type0)
5720 : 123 : && gnu_vector_type_p (type1)
5721 : 123 : && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
5722 : 120 : && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE
5723 : 856704 : && known_eq (TYPE_VECTOR_SUBPARTS (type0),
5724 : : TYPE_VECTOR_SUBPARTS (type1)))
5725 : : {
5726 : : result_type = type0;
5727 : : converted = 1;
5728 : : }
5729 : 856464 : else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
5730 : : {
5731 : 856437 : tree const_op1 = fold_for_warn (op1);
5732 : 856437 : if (TREE_CODE (const_op1) != INTEGER_CST)
5733 : 68605 : const_op1 = op1;
5734 : 856437 : result_type = type0;
5735 : 856437 : doing_shift = true;
5736 : 856437 : if (TREE_CODE (const_op1) == INTEGER_CST)
5737 : : {
5738 : 787832 : if (tree_int_cst_lt (const_op1, integer_zero_node))
5739 : : {
5740 : 48 : if ((complain & tf_warning)
5741 : 48 : && c_inhibit_evaluation_warnings == 0)
5742 : 36 : warning_at (location, OPT_Wshift_count_negative,
5743 : : "right shift count is negative");
5744 : : }
5745 : : else
5746 : : {
5747 : 787784 : if (!integer_zerop (const_op1))
5748 : 787698 : short_shift = 1;
5749 : :
5750 : 787784 : if (compare_tree_int (const_op1, TYPE_PRECISION (type0)) >= 0
5751 : 46 : && (complain & tf_warning)
5752 : 787830 : && c_inhibit_evaluation_warnings == 0)
5753 : 34 : warning_at (location, OPT_Wshift_count_overflow,
5754 : : "right shift count >= width of type");
5755 : : }
5756 : : }
5757 : : /* Avoid converting op1 to result_type later. */
5758 : : converted = 1;
5759 : : }
5760 : : break;
5761 : :
5762 : 2620835 : case LSHIFT_EXPR:
5763 : 2620835 : if (gnu_vector_type_p (type0)
5764 : 183 : && code1 == INTEGER_TYPE
5765 : 2620872 : && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE)
5766 : : {
5767 : : result_type = type0;
5768 : : converted = 1;
5769 : : }
5770 : 2620798 : else if (gnu_vector_type_p (type0)
5771 : 146 : && gnu_vector_type_p (type1)
5772 : 146 : && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
5773 : 143 : && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE
5774 : 2620938 : && known_eq (TYPE_VECTOR_SUBPARTS (type0),
5775 : : TYPE_VECTOR_SUBPARTS (type1)))
5776 : : {
5777 : : result_type = type0;
5778 : : converted = 1;
5779 : : }
5780 : 2620658 : else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
5781 : : {
5782 : 2620628 : tree const_op0 = fold_for_warn (op0);
5783 : 2620628 : if (TREE_CODE (const_op0) != INTEGER_CST)
5784 : 111406 : const_op0 = op0;
5785 : 2620628 : tree const_op1 = fold_for_warn (op1);
5786 : 2620628 : if (TREE_CODE (const_op1) != INTEGER_CST)
5787 : 165980 : const_op1 = op1;
5788 : 2620628 : result_type = type0;
5789 : 2620628 : doing_shift = true;
5790 : 2620628 : if (TREE_CODE (const_op0) == INTEGER_CST
5791 : 2509222 : && tree_int_cst_sgn (const_op0) < 0
5792 : 280 : && !TYPE_OVERFLOW_WRAPS (type0)
5793 : 196 : && (complain & tf_warning)
5794 : 2620824 : && c_inhibit_evaluation_warnings == 0)
5795 : 196 : warning_at (location, OPT_Wshift_negative_value,
5796 : : "left shift of negative value");
5797 : 2620628 : if (TREE_CODE (const_op1) == INTEGER_CST)
5798 : : {
5799 : 2454648 : if (tree_int_cst_lt (const_op1, integer_zero_node))
5800 : : {
5801 : 57 : if ((complain & tf_warning)
5802 : 57 : && c_inhibit_evaluation_warnings == 0)
5803 : 39 : warning_at (location, OPT_Wshift_count_negative,
5804 : : "left shift count is negative");
5805 : : }
5806 : 2454591 : else if (compare_tree_int (const_op1,
5807 : 2454591 : TYPE_PRECISION (type0)) >= 0)
5808 : : {
5809 : 83 : if ((complain & tf_warning)
5810 : 61 : && c_inhibit_evaluation_warnings == 0)
5811 : 45 : warning_at (location, OPT_Wshift_count_overflow,
5812 : : "left shift count >= width of type");
5813 : : }
5814 : 2454508 : else if (TREE_CODE (const_op0) == INTEGER_CST
5815 : 2364252 : && (complain & tf_warning))
5816 : 2233673 : maybe_warn_shift_overflow (location, const_op0, const_op1);
5817 : : }
5818 : : /* Avoid converting op1 to result_type later. */
5819 : : converted = 1;
5820 : : }
5821 : : break;
5822 : :
5823 : 18632010 : case EQ_EXPR:
5824 : 18632010 : case NE_EXPR:
5825 : 18632010 : if (gnu_vector_type_p (type0) && gnu_vector_type_p (type1))
5826 : 2395 : goto vector_compare;
5827 : 18629615 : if ((complain & tf_warning)
5828 : 17617193 : && c_inhibit_evaluation_warnings == 0
5829 : 35673868 : && (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1)))
5830 : 793787 : warning_at (location, OPT_Wfloat_equal,
5831 : : "comparing floating-point with %<==%> "
5832 : : "or %<!=%> is unsafe");
5833 : 18629615 : {
5834 : 18629615 : tree stripped_orig_op0 = tree_strip_any_location_wrapper (orig_op0);
5835 : 18629615 : tree stripped_orig_op1 = tree_strip_any_location_wrapper (orig_op1);
5836 : 18629615 : if ((complain & tf_warning_or_error)
5837 : 18629615 : && ((TREE_CODE (stripped_orig_op0) == STRING_CST
5838 : 39 : && !integer_zerop (cp_fully_fold (op1)))
5839 : 17760958 : || (TREE_CODE (stripped_orig_op1) == STRING_CST
5840 : 62 : && !integer_zerop (cp_fully_fold (op0)))))
5841 : 41 : warning_at (location, OPT_Waddress,
5842 : : "comparison with string literal results in "
5843 : : "unspecified behavior");
5844 : 18629574 : else if (TREE_CODE (TREE_TYPE (orig_op0)) == ARRAY_TYPE
5845 : 18629574 : && TREE_CODE (TREE_TYPE (orig_op1)) == ARRAY_TYPE)
5846 : : {
5847 : : /* P2865R5 made array comparisons ill-formed in C++26. */
5848 : 76 : if (complain & tf_warning_or_error)
5849 : 45 : do_warn_array_compare (location, code, stripped_orig_op0,
5850 : : stripped_orig_op1);
5851 : 31 : else if (cxx_dialect >= cxx26)
5852 : 13 : return error_mark_node;
5853 : : }
5854 : : }
5855 : :
5856 : 18629602 : build_type = boolean_type_node;
5857 : 18629602 : if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
5858 : : || code0 == COMPLEX_TYPE || code0 == ENUMERAL_TYPE)
5859 : 15750950 : && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
5860 : : || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE))
5861 : : short_compare = 1;
5862 : 19901 : else if (((code0 == POINTER_TYPE || TYPE_PTRDATAMEM_P (type0))
5863 : 2878235 : && null_ptr_cst_p (orig_op1))
5864 : : /* Handle, eg, (void*)0 (c++/43906), and more. */
5865 : 4333552 : || (code0 == POINTER_TYPE
5866 : 1416754 : && TYPE_PTR_P (type1) && integer_zerop (op1)))
5867 : : {
5868 : 1480243 : if (TYPE_PTR_P (type1))
5869 : 19129 : result_type = composite_pointer_type (location,
5870 : : type0, type1, op0, op1,
5871 : : CPO_COMPARISON, complain);
5872 : : else
5873 : : result_type = type0;
5874 : :
5875 : 1480243 : if (char_type_p (TREE_TYPE (orig_op1)))
5876 : : {
5877 : 10 : auto_diagnostic_group d;
5878 : 10 : if (warning_at (location, OPT_Wpointer_compare,
5879 : : "comparison between pointer and zero character "
5880 : : "constant"))
5881 : 10 : inform (location,
5882 : : "did you mean to dereference the pointer?");
5883 : 10 : }
5884 : 1480243 : warn_for_null_address (location, op0, complain);
5885 : : }
5886 : 849 : else if (((code1 == POINTER_TYPE || TYPE_PTRDATAMEM_P (type1))
5887 : 1416632 : && null_ptr_cst_p (orig_op0))
5888 : : /* Handle, eg, (void*)0 (c++/43906), and more. */
5889 : 2833287 : || (code1 == POINTER_TYPE
5890 : 1415372 : && TYPE_PTR_P (type0) && integer_zerop (op0)))
5891 : : {
5892 : 961 : if (TYPE_PTR_P (type0))
5893 : 68 : result_type = composite_pointer_type (location,
5894 : : type0, type1, op0, op1,
5895 : : CPO_COMPARISON, complain);
5896 : : else
5897 : : result_type = type1;
5898 : :
5899 : 961 : if (char_type_p (TREE_TYPE (orig_op0)))
5900 : : {
5901 : 10 : auto_diagnostic_group d;
5902 : 10 : if (warning_at (location, OPT_Wpointer_compare,
5903 : : "comparison between pointer and zero character "
5904 : : "constant"))
5905 : 10 : inform (location,
5906 : : "did you mean to dereference the pointer?");
5907 : 10 : }
5908 : 961 : warn_for_null_address (location, op1, complain);
5909 : : }
5910 : 1416129 : else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
5911 : 18630 : || (TYPE_PTRDATAMEM_P (type0) && TYPE_PTRDATAMEM_P (type1)))
5912 : 1397866 : result_type = composite_pointer_type (location,
5913 : : type0, type1, op0, op1,
5914 : : CPO_COMPARISON, complain);
5915 : 18263 : else if (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1))
5916 : : /* One of the operands must be of nullptr_t type. */
5917 : 65 : result_type = TREE_TYPE (nullptr_node);
5918 : 18198 : else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
5919 : : {
5920 : 58 : result_type = type0;
5921 : 58 : if (complain & tf_error)
5922 : 56 : permerror (location, "ISO C++ forbids comparison between "
5923 : : "pointer and integer");
5924 : : else
5925 : 2 : return error_mark_node;
5926 : : }
5927 : 18140 : else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
5928 : : {
5929 : 17805 : result_type = type1;
5930 : 17805 : if (complain & tf_error)
5931 : 69 : permerror (location, "ISO C++ forbids comparison between "
5932 : : "pointer and integer");
5933 : : else
5934 : 17736 : return error_mark_node;
5935 : : }
5936 : 335 : else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (orig_op1))
5937 : : {
5938 : 191 : if (TARGET_PTRMEMFUNC_VBIT_LOCATION
5939 : : == ptrmemfunc_vbit_in_delta)
5940 : : {
5941 : : tree pfn0, delta0, e1, e2;
5942 : :
5943 : : if (TREE_SIDE_EFFECTS (op0))
5944 : : op0 = cp_save_expr (op0);
5945 : :
5946 : : pfn0 = pfn_from_ptrmemfunc (op0);
5947 : : delta0 = delta_from_ptrmemfunc (op0);
5948 : : {
5949 : : /* If we will warn below about a null-address compare
5950 : : involving the orig_op0 ptrmemfunc, we'd likely also
5951 : : warn about the pfn0's null-address compare, and
5952 : : that would be redundant, so suppress it. */
5953 : : warning_sentinel ws (warn_address);
5954 : : e1 = cp_build_binary_op (location,
5955 : : EQ_EXPR,
5956 : : pfn0,
5957 : : build_zero_cst (TREE_TYPE (pfn0)),
5958 : : complain);
5959 : : }
5960 : : e2 = cp_build_binary_op (location,
5961 : : BIT_AND_EXPR,
5962 : : delta0,
5963 : : integer_one_node,
5964 : : complain);
5965 : :
5966 : : if (complain & tf_warning)
5967 : : maybe_warn_zero_as_null_pointer_constant (op1, input_location);
5968 : :
5969 : : e2 = cp_build_binary_op (location,
5970 : : EQ_EXPR, e2, integer_zero_node,
5971 : : complain);
5972 : : op0 = cp_build_binary_op (location,
5973 : : TRUTH_ANDIF_EXPR, e1, e2,
5974 : : complain);
5975 : : op1 = cp_convert (TREE_TYPE (op0), integer_one_node, complain);
5976 : : }
5977 : : else
5978 : : {
5979 : 191 : op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
5980 : 191 : op1 = cp_convert (TREE_TYPE (op0), op1, complain);
5981 : : }
5982 : 191 : result_type = TREE_TYPE (op0);
5983 : :
5984 : 191 : warn_for_null_address (location, orig_op0, complain);
5985 : : }
5986 : 144 : else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (orig_op0))
5987 : 36 : return cp_build_binary_op (location, code, op1, op0, complain);
5988 : 108 : else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1))
5989 : : {
5990 : 87 : tree type;
5991 : : /* E will be the final comparison. */
5992 : 87 : tree e;
5993 : : /* E1 and E2 are for scratch. */
5994 : 87 : tree e1;
5995 : 87 : tree e2;
5996 : 87 : tree pfn0;
5997 : 87 : tree pfn1;
5998 : 87 : tree delta0;
5999 : 87 : tree delta1;
6000 : :
6001 : 87 : type = composite_pointer_type (location, type0, type1, op0, op1,
6002 : : CPO_COMPARISON, complain);
6003 : :
6004 : 87 : if (!same_type_p (TREE_TYPE (op0), type))
6005 : 6 : op0 = cp_convert_and_check (type, op0, complain);
6006 : 87 : if (!same_type_p (TREE_TYPE (op1), type))
6007 : 9 : op1 = cp_convert_and_check (type, op1, complain);
6008 : :
6009 : 87 : if (op0 == error_mark_node || op1 == error_mark_node)
6010 : : return error_mark_node;
6011 : :
6012 : 84 : if (TREE_SIDE_EFFECTS (op0))
6013 : 31 : op0 = save_expr (op0);
6014 : 84 : if (TREE_SIDE_EFFECTS (op1))
6015 : 0 : op1 = save_expr (op1);
6016 : :
6017 : 84 : pfn0 = pfn_from_ptrmemfunc (op0);
6018 : 84 : pfn0 = cp_fully_fold (pfn0);
6019 : : /* Avoid -Waddress warnings (c++/64877). */
6020 : 84 : if (TREE_CODE (pfn0) == ADDR_EXPR)
6021 : 9 : suppress_warning (pfn0, OPT_Waddress);
6022 : 84 : pfn1 = pfn_from_ptrmemfunc (op1);
6023 : 84 : pfn1 = cp_fully_fold (pfn1);
6024 : 84 : delta0 = delta_from_ptrmemfunc (op0);
6025 : 84 : delta1 = delta_from_ptrmemfunc (op1);
6026 : 84 : if (TARGET_PTRMEMFUNC_VBIT_LOCATION
6027 : : == ptrmemfunc_vbit_in_delta)
6028 : : {
6029 : : /* We generate:
6030 : :
6031 : : (op0.pfn == op1.pfn
6032 : : && ((op0.delta == op1.delta)
6033 : : || (!op0.pfn && op0.delta & 1 == 0
6034 : : && op1.delta & 1 == 0))
6035 : :
6036 : : The reason for the `!op0.pfn' bit is that a NULL
6037 : : pointer-to-member is any member with a zero PFN and
6038 : : LSB of the DELTA field is 0. */
6039 : :
6040 : : e1 = cp_build_binary_op (location, BIT_AND_EXPR,
6041 : : delta0,
6042 : : integer_one_node,
6043 : : complain);
6044 : : e1 = cp_build_binary_op (location,
6045 : : EQ_EXPR, e1, integer_zero_node,
6046 : : complain);
6047 : : e2 = cp_build_binary_op (location, BIT_AND_EXPR,
6048 : : delta1,
6049 : : integer_one_node,
6050 : : complain);
6051 : : e2 = cp_build_binary_op (location,
6052 : : EQ_EXPR, e2, integer_zero_node,
6053 : : complain);
6054 : : e1 = cp_build_binary_op (location,
6055 : : TRUTH_ANDIF_EXPR, e2, e1,
6056 : : complain);
6057 : : e2 = cp_build_binary_op (location, EQ_EXPR,
6058 : : pfn0,
6059 : : build_zero_cst (TREE_TYPE (pfn0)),
6060 : : complain);
6061 : : e2 = cp_build_binary_op (location,
6062 : : TRUTH_ANDIF_EXPR, e2, e1, complain);
6063 : : e1 = cp_build_binary_op (location,
6064 : : EQ_EXPR, delta0, delta1, complain);
6065 : : e1 = cp_build_binary_op (location,
6066 : : TRUTH_ORIF_EXPR, e1, e2, complain);
6067 : : }
6068 : : else
6069 : : {
6070 : : /* We generate:
6071 : :
6072 : : (op0.pfn == op1.pfn
6073 : : && (!op0.pfn || op0.delta == op1.delta))
6074 : :
6075 : : The reason for the `!op0.pfn' bit is that a NULL
6076 : : pointer-to-member is any member with a zero PFN; the
6077 : : DELTA field is unspecified. */
6078 : :
6079 : 84 : e1 = cp_build_binary_op (location,
6080 : : EQ_EXPR, delta0, delta1, complain);
6081 : 84 : e2 = cp_build_binary_op (location,
6082 : : EQ_EXPR,
6083 : : pfn0,
6084 : 84 : build_zero_cst (TREE_TYPE (pfn0)),
6085 : : complain);
6086 : 84 : e1 = cp_build_binary_op (location,
6087 : : TRUTH_ORIF_EXPR, e1, e2, complain);
6088 : : }
6089 : 84 : e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
6090 : 84 : e = cp_build_binary_op (location,
6091 : : TRUTH_ANDIF_EXPR, e2, e1, complain);
6092 : 84 : if (code == EQ_EXPR)
6093 : : return e;
6094 : 24 : return cp_build_binary_op (location,
6095 : 24 : EQ_EXPR, e, integer_zero_node, complain);
6096 : : }
6097 : : else
6098 : : {
6099 : 21 : gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
6100 : : || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
6101 : : type1));
6102 : 21 : gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
6103 : : || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
6104 : : type0));
6105 : : }
6106 : :
6107 : : break;
6108 : :
6109 : 241 : case MAX_EXPR:
6110 : 241 : case MIN_EXPR:
6111 : 241 : if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
6112 : 241 : && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
6113 : : shorten = 1;
6114 : 0 : else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
6115 : 0 : result_type = composite_pointer_type (location,
6116 : : type0, type1, op0, op1,
6117 : : CPO_COMPARISON, complain);
6118 : : break;
6119 : :
6120 : 19271710 : case LE_EXPR:
6121 : 19271710 : case GE_EXPR:
6122 : 19271710 : case LT_EXPR:
6123 : 19271710 : case GT_EXPR:
6124 : 19271710 : case SPACESHIP_EXPR:
6125 : 19271710 : if (TREE_CODE (orig_op0) == STRING_CST
6126 : 19271710 : || TREE_CODE (orig_op1) == STRING_CST)
6127 : : {
6128 : 0 : if (complain & tf_warning)
6129 : 0 : warning_at (location, OPT_Waddress,
6130 : : "comparison with string literal results "
6131 : : "in unspecified behavior");
6132 : : }
6133 : 19271710 : else if (TREE_CODE (TREE_TYPE (orig_op0)) == ARRAY_TYPE
6134 : 153 : && TREE_CODE (TREE_TYPE (orig_op1)) == ARRAY_TYPE
6135 : 19271814 : && code != SPACESHIP_EXPR)
6136 : : {
6137 : 88 : if (complain & tf_warning_or_error)
6138 : 51 : do_warn_array_compare (location, code,
6139 : : tree_strip_any_location_wrapper (orig_op0),
6140 : : tree_strip_any_location_wrapper (orig_op1));
6141 : 37 : else if (cxx_dialect >= cxx26)
6142 : 1 : return error_mark_node;
6143 : : }
6144 : :
6145 : 19271709 : if (gnu_vector_type_p (type0) && gnu_vector_type_p (type1))
6146 : : {
6147 : 6560 : vector_compare:
6148 : 6560 : tree intt;
6149 : 6560 : if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
6150 : 6560 : TREE_TYPE (type1))
6151 : 6560 : && !vector_types_compatible_elements_p (type0, type1))
6152 : : {
6153 : 3 : if (complain & tf_error)
6154 : : {
6155 : 3 : auto_diagnostic_group d;
6156 : 3 : error_at (location, "comparing vectors with different "
6157 : : "element types");
6158 : 3 : inform (location, "operand types are %qT and %qT",
6159 : : type0, type1);
6160 : 3 : }
6161 : 3 : return error_mark_node;
6162 : : }
6163 : :
6164 : 6557 : if (maybe_ne (TYPE_VECTOR_SUBPARTS (type0),
6165 : 13114 : TYPE_VECTOR_SUBPARTS (type1)))
6166 : : {
6167 : 3 : if (complain & tf_error)
6168 : : {
6169 : 3 : auto_diagnostic_group d;
6170 : 3 : error_at (location, "comparing vectors with different "
6171 : : "number of elements");
6172 : 3 : inform (location, "operand types are %qT and %qT",
6173 : : type0, type1);
6174 : 3 : }
6175 : 3 : return error_mark_node;
6176 : : }
6177 : :
6178 : : /* It's not precisely specified how the usual arithmetic
6179 : : conversions apply to the vector types. Here, we use
6180 : : the unsigned type if one of the operands is signed and
6181 : : the other one is unsigned. */
6182 : 6554 : if (TYPE_UNSIGNED (type0) != TYPE_UNSIGNED (type1))
6183 : : {
6184 : 36 : if (!TYPE_UNSIGNED (type0))
6185 : 36 : op0 = build1 (VIEW_CONVERT_EXPR, type1, op0);
6186 : : else
6187 : 0 : op1 = build1 (VIEW_CONVERT_EXPR, type0, op1);
6188 : 36 : warning_at (location, OPT_Wsign_compare, "comparison between "
6189 : : "types %qT and %qT", type0, type1);
6190 : : }
6191 : :
6192 : 6554 : if (resultcode == SPACESHIP_EXPR)
6193 : : {
6194 : 3 : if (complain & tf_error)
6195 : 3 : sorry_at (location, "three-way comparison of vectors");
6196 : 3 : return error_mark_node;
6197 : : }
6198 : :
6199 : : /* Always construct signed integer vector type. */
6200 : 6551 : intt = c_common_type_for_size
6201 : 13102 : (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (TREE_TYPE (type0))), 0);
6202 : 6551 : if (!intt)
6203 : : {
6204 : 0 : if (complain & tf_error)
6205 : 0 : error_at (location, "could not find an integer type "
6206 : 0 : "of the same size as %qT", TREE_TYPE (type0));
6207 : 0 : return error_mark_node;
6208 : : }
6209 : 6551 : result_type = build_opaque_vector_type (intt,
6210 : 6551 : TYPE_VECTOR_SUBPARTS (type0));
6211 : 6551 : return build_vec_cmp (resultcode, result_type, op0, op1);
6212 : : }
6213 : 19267544 : build_type = boolean_type_node;
6214 : 19267544 : if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
6215 : : || code0 == ENUMERAL_TYPE)
6216 : 18375971 : && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
6217 : : || code1 == ENUMERAL_TYPE))
6218 : : short_compare = 1;
6219 : 891660 : else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
6220 : 891428 : result_type = composite_pointer_type (location,
6221 : : type0, type1, op0, op1,
6222 : : CPO_COMPARISON, complain);
6223 : 74 : else if ((code0 == POINTER_TYPE && null_ptr_cst_p (orig_op1))
6224 : 160 : || (code1 == POINTER_TYPE && null_ptr_cst_p (orig_op0))
6225 : 338 : || (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)))
6226 : : {
6227 : : /* Core Issue 1512 made this ill-formed. */
6228 : 191 : if (complain & tf_error)
6229 : 188 : error_at (location, "ordered comparison of pointer with "
6230 : : "integer zero (%qT and %qT)", type0, type1);
6231 : 191 : return error_mark_node;
6232 : : }
6233 : 41 : else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
6234 : : {
6235 : 0 : result_type = type0;
6236 : 0 : if (complain & tf_error)
6237 : 0 : permerror (location, "ISO C++ forbids comparison between "
6238 : : "pointer and integer");
6239 : : else
6240 : 0 : return error_mark_node;
6241 : : }
6242 : 41 : else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
6243 : : {
6244 : 24 : result_type = type1;
6245 : 24 : if (complain & tf_error)
6246 : 24 : permerror (location, "ISO C++ forbids comparison between "
6247 : : "pointer and integer");
6248 : : else
6249 : 0 : return error_mark_node;
6250 : : }
6251 : :
6252 : 19267353 : if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
6253 : 891454 : && !processing_template_decl
6254 : 19950008 : && sanitize_flags_p (SANITIZE_POINTER_COMPARE))
6255 : : {
6256 : 49 : op0 = save_expr (op0);
6257 : 49 : op1 = save_expr (op1);
6258 : :
6259 : 49 : tree tt = builtin_decl_explicit (BUILT_IN_ASAN_POINTER_COMPARE);
6260 : 49 : instrument_expr = build_call_expr_loc (location, tt, 2, op0, op1);
6261 : : }
6262 : :
6263 : : break;
6264 : :
6265 : 0 : case UNORDERED_EXPR:
6266 : 0 : case ORDERED_EXPR:
6267 : 0 : case UNLT_EXPR:
6268 : 0 : case UNLE_EXPR:
6269 : 0 : case UNGT_EXPR:
6270 : 0 : case UNGE_EXPR:
6271 : 0 : case UNEQ_EXPR:
6272 : 0 : build_type = integer_type_node;
6273 : 0 : if (code0 != REAL_TYPE || code1 != REAL_TYPE)
6274 : : {
6275 : 0 : if (complain & tf_error)
6276 : 0 : error ("unordered comparison on non-floating-point argument");
6277 : 0 : return error_mark_node;
6278 : : }
6279 : : common = 1;
6280 : : break;
6281 : :
6282 : : default:
6283 : : break;
6284 : : }
6285 : :
6286 : 110748281 : if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
6287 : : || code0 == ENUMERAL_TYPE)
6288 : 92584356 : && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
6289 : : || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE)))
6290 : : arithmetic_types_p = 1;
6291 : : else
6292 : : {
6293 : 18369551 : arithmetic_types_p = 0;
6294 : : /* Vector arithmetic is only allowed when both sides are vectors. */
6295 : 18369551 : if (gnu_vector_type_p (type0) && gnu_vector_type_p (type1))
6296 : : {
6297 : 49959 : if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
6298 : 49959 : || !vector_types_compatible_elements_p (type0, type1))
6299 : : {
6300 : 18 : if (complain & tf_error)
6301 : : {
6302 : : /* "location" already embeds the locations of the
6303 : : operands, so we don't need to add them separately
6304 : : to richloc. */
6305 : 18 : rich_location richloc (line_table, location);
6306 : 18 : binary_op_error (&richloc, code, type0, type1);
6307 : 18 : }
6308 : 18 : return error_mark_node;
6309 : : }
6310 : : arithmetic_types_p = 1;
6311 : : }
6312 : : }
6313 : : /* Determine the RESULT_TYPE, if it is not already known. */
6314 : 110748263 : if (!result_type
6315 : 110748263 : && arithmetic_types_p
6316 : 88772256 : && (shorten || common || short_compare))
6317 : : {
6318 : 88772181 : result_type = cp_common_type (type0, type1);
6319 : 88772181 : if (result_type == error_mark_node)
6320 : : {
6321 : 0 : tree t1 = type0;
6322 : 0 : tree t2 = type1;
6323 : 0 : if (TREE_CODE (t1) == COMPLEX_TYPE)
6324 : 0 : t1 = TREE_TYPE (t1);
6325 : 0 : if (TREE_CODE (t2) == COMPLEX_TYPE)
6326 : 0 : t2 = TREE_TYPE (t2);
6327 : 0 : gcc_checking_assert (TREE_CODE (t1) == REAL_TYPE
6328 : : && TREE_CODE (t2) == REAL_TYPE
6329 : : && (extended_float_type_p (t1)
6330 : : || extended_float_type_p (t2))
6331 : : && cp_compare_floating_point_conversion_ranks
6332 : : (t1, t2) == 3);
6333 : 0 : if (complain & tf_error)
6334 : : {
6335 : 0 : rich_location richloc (line_table, location);
6336 : 0 : binary_op_error (&richloc, code, type0, type1);
6337 : 0 : }
6338 : 0 : return error_mark_node;
6339 : : }
6340 : 88772181 : if (complain & tf_warning)
6341 : 84517087 : do_warn_double_promotion (result_type, type0, type1,
6342 : : "implicit conversion from %qH to %qI "
6343 : : "to match other operand of binary "
6344 : : "expression", location);
6345 : 88772181 : if (do_warn_enum_conversions (location, code, TREE_TYPE (orig_op0),
6346 : 88772181 : TREE_TYPE (orig_op1), complain))
6347 : 6 : return error_mark_node;
6348 : : }
6349 : 110748257 : if (may_need_excess_precision
6350 : 83607375 : && (orig_type0 != type0 || orig_type1 != type1)
6351 : 68225 : && build_type == NULL_TREE
6352 : 68225 : && result_type)
6353 : : {
6354 : 51568 : gcc_assert (common);
6355 : 51568 : semantic_result_type = cp_common_type (orig_type0, orig_type1);
6356 : 51568 : if (semantic_result_type == error_mark_node)
6357 : : {
6358 : 0 : tree t1 = orig_type0;
6359 : 0 : tree t2 = orig_type1;
6360 : 0 : if (TREE_CODE (t1) == COMPLEX_TYPE)
6361 : 0 : t1 = TREE_TYPE (t1);
6362 : 0 : if (TREE_CODE (t2) == COMPLEX_TYPE)
6363 : 0 : t2 = TREE_TYPE (t2);
6364 : 0 : gcc_checking_assert (TREE_CODE (t1) == REAL_TYPE
6365 : : && TREE_CODE (t2) == REAL_TYPE
6366 : : && (extended_float_type_p (t1)
6367 : : || extended_float_type_p (t2))
6368 : : && cp_compare_floating_point_conversion_ranks
6369 : : (t1, t2) == 3);
6370 : 0 : if (complain & tf_error)
6371 : : {
6372 : 0 : rich_location richloc (line_table, location);
6373 : 0 : binary_op_error (&richloc, code, type0, type1);
6374 : 0 : }
6375 : 0 : return error_mark_node;
6376 : : }
6377 : : }
6378 : :
6379 : 110748257 : if (code == SPACESHIP_EXPR)
6380 : : {
6381 : 147031 : iloc_sentinel s (location);
6382 : :
6383 : 147031 : tree orig_type0 = TREE_TYPE (orig_op0);
6384 : 147031 : tree_code orig_code0 = TREE_CODE (orig_type0);
6385 : 147031 : tree orig_type1 = TREE_TYPE (orig_op1);
6386 : 147031 : tree_code orig_code1 = TREE_CODE (orig_type1);
6387 : 147031 : if (!result_type || result_type == error_mark_node)
6388 : : /* Nope. */
6389 : : result_type = NULL_TREE;
6390 : 147010 : else if ((orig_code0 == BOOLEAN_TYPE) != (orig_code1 == BOOLEAN_TYPE))
6391 : : /* "If one of the operands is of type bool and the other is not, the
6392 : : program is ill-formed." */
6393 : : result_type = NULL_TREE;
6394 : 147007 : else if (code0 == POINTER_TYPE && orig_code0 != POINTER_TYPE
6395 : 16 : && code1 == POINTER_TYPE && orig_code1 != POINTER_TYPE)
6396 : : /* We only do array/function-to-pointer conversion if "at least one of
6397 : : the operands is of pointer type". */
6398 : : result_type = NULL_TREE;
6399 : 146991 : else if (TYPE_PTRFN_P (result_type) || NULLPTR_TYPE_P (result_type))
6400 : : /* <=> no longer supports equality relations. */
6401 : : result_type = NULL_TREE;
6402 : 146988 : else if (orig_code0 == ENUMERAL_TYPE && orig_code1 == ENUMERAL_TYPE
6403 : 147024 : && !(same_type_ignoring_top_level_qualifiers_p
6404 : 36 : (orig_type0, orig_type1)))
6405 : : /* "If both operands have arithmetic types, or one operand has integral
6406 : : type and the other operand has unscoped enumeration type, the usual
6407 : : arithmetic conversions are applied to the operands." So we don't do
6408 : : arithmetic conversions if the operands both have enumeral type. */
6409 : : result_type = NULL_TREE;
6410 : 146973 : else if ((orig_code0 == ENUMERAL_TYPE && orig_code1 == REAL_TYPE)
6411 : 146967 : || (orig_code0 == REAL_TYPE && orig_code1 == ENUMERAL_TYPE))
6412 : : /* [depr.arith.conv.enum]: Three-way comparisons between such operands
6413 : : [where one is of enumeration type and the other is of a different
6414 : : enumeration type or a floating-point type] are ill-formed. */
6415 : : result_type = NULL_TREE;
6416 : :
6417 : 146961 : if (result_type)
6418 : : {
6419 : 146961 : build_type = spaceship_type (result_type, complain);
6420 : 146961 : if (build_type == error_mark_node)
6421 : : return error_mark_node;
6422 : : }
6423 : :
6424 : 147016 : if (result_type && arithmetic_types_p)
6425 : : {
6426 : : /* If a narrowing conversion is required, other than from an integral
6427 : : type to a floating point type, the program is ill-formed. */
6428 : 71048 : bool ok = true;
6429 : 71048 : if (TREE_CODE (result_type) == REAL_TYPE
6430 : 640 : && CP_INTEGRAL_TYPE_P (orig_type0))
6431 : : /* OK */;
6432 : 71037 : else if (!check_narrowing (result_type, orig_op0, complain))
6433 : 71048 : ok = false;
6434 : 71048 : if (TREE_CODE (result_type) == REAL_TYPE
6435 : 640 : && CP_INTEGRAL_TYPE_P (orig_type1))
6436 : : /* OK */;
6437 : 71037 : else if (!check_narrowing (result_type, orig_op1, complain))
6438 : : ok = false;
6439 : 71048 : if (!ok && !(complain & tf_error))
6440 : 4 : return error_mark_node;
6441 : : }
6442 : 147031 : }
6443 : :
6444 : 110748238 : if (!result_type)
6445 : : {
6446 : 475 : if (complain & tf_error)
6447 : : {
6448 : 204 : binary_op_rich_location richloc (location,
6449 : 204 : orig_op0, orig_op1, true);
6450 : 204 : error_at (&richloc,
6451 : : "invalid operands of types %qT and %qT to binary %qO",
6452 : 204 : TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
6453 : 204 : }
6454 : 475 : return error_mark_node;
6455 : : }
6456 : :
6457 : : /* If we're in a template, the only thing we need to know is the
6458 : : RESULT_TYPE. */
6459 : 110747763 : if (processing_template_decl)
6460 : : {
6461 : : /* Since the middle-end checks the type when doing a build2, we
6462 : : need to build the tree in pieces. This built tree will never
6463 : : get out of the front-end as we replace it when instantiating
6464 : : the template. */
6465 : 49135215 : tree tmp = build2 (resultcode,
6466 : : build_type ? build_type : result_type,
6467 : : NULL_TREE, op1);
6468 : 30772923 : TREE_OPERAND (tmp, 0) = op0;
6469 : 30772923 : if (semantic_result_type)
6470 : 0 : tmp = build1 (EXCESS_PRECISION_EXPR, semantic_result_type, tmp);
6471 : 30772923 : return tmp;
6472 : : }
6473 : :
6474 : : /* Remember the original type; RESULT_TYPE might be changed later on
6475 : : by shorten_binary_op. */
6476 : 79974840 : tree orig_type = result_type;
6477 : :
6478 : 79974840 : if (arithmetic_types_p)
6479 : : {
6480 : 70078843 : bool first_complex = (code0 == COMPLEX_TYPE);
6481 : 70078843 : bool second_complex = (code1 == COMPLEX_TYPE);
6482 : 70078843 : int none_complex = (!first_complex && !second_complex);
6483 : :
6484 : : /* Adapted from patch for c/24581. */
6485 : 70078843 : if (first_complex != second_complex
6486 : 160982 : && (code == PLUS_EXPR
6487 : : || code == MINUS_EXPR
6488 : 160982 : || code == MULT_EXPR
6489 : 42080 : || (code == TRUNC_DIV_EXPR && first_complex))
6490 : 147475 : && TREE_CODE (TREE_TYPE (result_type)) == REAL_TYPE
6491 : 70226157 : && flag_signed_zeros)
6492 : : {
6493 : : /* An operation on mixed real/complex operands must be
6494 : : handled specially, but the language-independent code can
6495 : : more easily optimize the plain complex arithmetic if
6496 : : -fno-signed-zeros. */
6497 : 147314 : tree real_type = TREE_TYPE (result_type);
6498 : 147314 : tree real, imag;
6499 : 147314 : if (first_complex)
6500 : : {
6501 : 114313 : if (TREE_TYPE (op0) != result_type)
6502 : 6 : op0 = cp_convert_and_check (result_type, op0, complain);
6503 : 114313 : if (TREE_TYPE (op1) != real_type)
6504 : 26 : op1 = cp_convert_and_check (real_type, op1, complain);
6505 : : }
6506 : : else
6507 : : {
6508 : 33001 : if (TREE_TYPE (op0) != real_type)
6509 : 31 : op0 = cp_convert_and_check (real_type, op0, complain);
6510 : 33001 : if (TREE_TYPE (op1) != result_type)
6511 : 32 : op1 = cp_convert_and_check (result_type, op1, complain);
6512 : : }
6513 : 147314 : if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
6514 : 0 : return error_mark_node;
6515 : 147314 : if (first_complex)
6516 : : {
6517 : 114313 : op0 = save_expr (op0);
6518 : 114313 : real = cp_build_unary_op (REALPART_EXPR, op0, true, complain);
6519 : 114313 : imag = cp_build_unary_op (IMAGPART_EXPR, op0, true, complain);
6520 : 114313 : switch (code)
6521 : : {
6522 : 57139 : case MULT_EXPR:
6523 : 57139 : case TRUNC_DIV_EXPR:
6524 : 57139 : op1 = save_expr (op1);
6525 : 57139 : imag = build2 (resultcode, real_type, imag, op1);
6526 : : /* Fall through. */
6527 : 114313 : case PLUS_EXPR:
6528 : 114313 : case MINUS_EXPR:
6529 : 114313 : real = build2 (resultcode, real_type, real, op1);
6530 : 114313 : break;
6531 : 0 : default:
6532 : 0 : gcc_unreachable();
6533 : : }
6534 : : }
6535 : : else
6536 : : {
6537 : 33001 : op1 = save_expr (op1);
6538 : 33001 : real = cp_build_unary_op (REALPART_EXPR, op1, true, complain);
6539 : 33001 : imag = cp_build_unary_op (IMAGPART_EXPR, op1, true, complain);
6540 : 33001 : switch (code)
6541 : : {
6542 : 632 : case MULT_EXPR:
6543 : 632 : op0 = save_expr (op0);
6544 : 632 : imag = build2 (resultcode, real_type, op0, imag);
6545 : : /* Fall through. */
6546 : 17254 : case PLUS_EXPR:
6547 : 17254 : real = build2 (resultcode, real_type, op0, real);
6548 : 17254 : break;
6549 : 15747 : case MINUS_EXPR:
6550 : 15747 : real = build2 (resultcode, real_type, op0, real);
6551 : 15747 : imag = build1 (NEGATE_EXPR, real_type, imag);
6552 : 15747 : break;
6553 : 0 : default:
6554 : 0 : gcc_unreachable();
6555 : : }
6556 : : }
6557 : 147314 : result = build2 (COMPLEX_EXPR, result_type, real, imag);
6558 : 147314 : if (semantic_result_type)
6559 : 24 : result = build1 (EXCESS_PRECISION_EXPR, semantic_result_type,
6560 : : result);
6561 : 147314 : return result;
6562 : : }
6563 : :
6564 : : /* For certain operations (which identify themselves by shorten != 0)
6565 : : if both args were extended from the same smaller type,
6566 : : do the arithmetic in that type and then extend.
6567 : :
6568 : : shorten !=0 and !=1 indicates a bitwise operation.
6569 : : For them, this optimization is safe only if
6570 : : both args are zero-extended or both are sign-extended.
6571 : : Otherwise, we might change the result.
6572 : : E.g., (short)-1 | (unsigned short)-1 is (int)-1
6573 : : but calculated in (unsigned short) it would be (unsigned short)-1. */
6574 : :
6575 : 69931529 : if (shorten && none_complex)
6576 : : {
6577 : 3709653 : final_type = result_type;
6578 : 3709653 : result_type = shorten_binary_op (result_type, op0, op1,
6579 : : shorten == -1);
6580 : : }
6581 : :
6582 : : /* Shifts can be shortened if shifting right. */
6583 : :
6584 : 69931529 : if (short_shift)
6585 : : {
6586 : 694021 : int unsigned_arg;
6587 : 694021 : tree arg0 = get_narrower (op0, &unsigned_arg);
6588 : : /* We're not really warning here but when we set short_shift we
6589 : : used fold_for_warn to fold the operand. */
6590 : 694021 : tree const_op1 = fold_for_warn (op1);
6591 : :
6592 : 694021 : final_type = result_type;
6593 : :
6594 : 694021 : if (arg0 == op0 && final_type == TREE_TYPE (op0))
6595 : 636983 : unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
6596 : :
6597 : 694021 : if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
6598 : 1052 : && tree_int_cst_sgn (const_op1) > 0
6599 : : /* We can shorten only if the shift count is less than the
6600 : : number of bits in the smaller type size. */
6601 : 1052 : && compare_tree_int (const_op1,
6602 : 1052 : TYPE_PRECISION (TREE_TYPE (arg0))) < 0
6603 : : /* We cannot drop an unsigned shift after sign-extension. */
6604 : 695063 : && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
6605 : : {
6606 : : /* Do an unsigned shift if the operand was zero-extended. */
6607 : 1035 : result_type
6608 : 1035 : = c_common_signed_or_unsigned_type (unsigned_arg,
6609 : 1035 : TREE_TYPE (arg0));
6610 : : /* Convert value-to-be-shifted to that type. */
6611 : 1035 : if (TREE_TYPE (op0) != result_type)
6612 : 1035 : op0 = convert (result_type, op0);
6613 : : converted = 1;
6614 : : }
6615 : : }
6616 : :
6617 : : /* Comparison operations are shortened too but differently.
6618 : : They identify themselves by setting short_compare = 1. */
6619 : :
6620 : 69931529 : if (short_compare)
6621 : : {
6622 : : /* We call shorten_compare only for diagnostics. */
6623 : 22140872 : tree xop0 = fold_simple (op0);
6624 : 22140872 : tree xop1 = fold_simple (op1);
6625 : 22140872 : tree xresult_type = result_type;
6626 : 22140872 : enum tree_code xresultcode = resultcode;
6627 : 22140872 : shorten_compare (location, &xop0, &xop1, &xresult_type,
6628 : : &xresultcode);
6629 : : }
6630 : :
6631 : 47790570 : if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
6632 : 22141061 : && warn_sign_compare
6633 : : /* Do not warn until the template is instantiated; we cannot
6634 : : bound the ranges of the arguments until that point. */
6635 : 307023 : && !processing_template_decl
6636 : 307023 : && (complain & tf_warning)
6637 : 301658 : && c_inhibit_evaluation_warnings == 0
6638 : : /* Even unsigned enum types promote to signed int. We don't
6639 : : want to issue -Wsign-compare warnings for this case. */
6640 : 286737 : && !enum_cast_to_int (orig_op0)
6641 : 70218266 : && !enum_cast_to_int (orig_op1))
6642 : : {
6643 : 286707 : warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
6644 : : result_type, resultcode);
6645 : : }
6646 : : }
6647 : :
6648 : : /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
6649 : : Then the expression will be built.
6650 : : It will be given type FINAL_TYPE if that is nonzero;
6651 : : otherwise, it will be given type RESULT_TYPE. */
6652 : 79827526 : if (! converted)
6653 : : {
6654 : 76668486 : warning_sentinel w (warn_sign_conversion, short_compare);
6655 : 76668486 : if (!same_type_p (TREE_TYPE (op0), result_type))
6656 : 3231713 : op0 = cp_convert_and_check (result_type, op0, complain);
6657 : 76668486 : if (!same_type_p (TREE_TYPE (op1), result_type))
6658 : 13639257 : op1 = cp_convert_and_check (result_type, op1, complain);
6659 : :
6660 : 76668486 : if (op0 == error_mark_node || op1 == error_mark_node)
6661 : 67 : return error_mark_node;
6662 : 76668486 : }
6663 : :
6664 : 79827459 : if (build_type == NULL_TREE)
6665 : 54359162 : build_type = result_type;
6666 : :
6667 : 79827459 : if (doing_shift
6668 : 3158477 : && flag_strong_eval_order == 2
6669 : 3070668 : && TREE_SIDE_EFFECTS (op1)
6670 : 79846735 : && !processing_template_decl)
6671 : : {
6672 : : /* In C++17, in both op0 << op1 and op0 >> op1 op0 is sequenced before
6673 : : op1, so if op1 has side-effects, use SAVE_EXPR around op0. */
6674 : 19276 : op0 = cp_save_expr (op0);
6675 : 19276 : instrument_expr = op0;
6676 : : }
6677 : :
6678 : 79827459 : if (sanitize_flags_p ((SANITIZE_SHIFT
6679 : : | SANITIZE_DIVIDE
6680 : : | SANITIZE_FLOAT_DIVIDE
6681 : : | SANITIZE_SI_OVERFLOW))
6682 : 12198 : && current_function_decl != NULL_TREE
6683 : 10056 : && !processing_template_decl
6684 : 79837515 : && (doing_div_or_mod || doing_shift))
6685 : : {
6686 : : /* OP0 and/or OP1 might have side-effects. */
6687 : 876 : op0 = cp_save_expr (op0);
6688 : 876 : op1 = cp_save_expr (op1);
6689 : 876 : op0 = fold_non_dependent_expr (op0, complain);
6690 : 876 : op1 = fold_non_dependent_expr (op1, complain);
6691 : 876 : tree instrument_expr1 = NULL_TREE;
6692 : 876 : if (doing_div_or_mod
6693 : 876 : && sanitize_flags_p (SANITIZE_DIVIDE
6694 : : | SANITIZE_FLOAT_DIVIDE
6695 : : | SANITIZE_SI_OVERFLOW))
6696 : : {
6697 : : /* For diagnostics we want to use the promoted types without
6698 : : shorten_binary_op. So convert the arguments to the
6699 : : original result_type. */
6700 : 448 : tree cop0 = op0;
6701 : 448 : tree cop1 = op1;
6702 : 448 : if (TREE_TYPE (cop0) != orig_type)
6703 : 6 : cop0 = cp_convert (orig_type, op0, complain);
6704 : 448 : if (TREE_TYPE (cop1) != orig_type)
6705 : 32 : cop1 = cp_convert (orig_type, op1, complain);
6706 : 448 : instrument_expr1 = ubsan_instrument_division (location, cop0, cop1);
6707 : : }
6708 : 428 : else if (doing_shift && sanitize_flags_p (SANITIZE_SHIFT))
6709 : 347 : instrument_expr1 = ubsan_instrument_shift (location, code, op0, op1);
6710 : 876 : if (instrument_expr != NULL)
6711 : 18 : instrument_expr = add_stmt_to_compound (instrument_expr,
6712 : : instrument_expr1);
6713 : : else
6714 : 858 : instrument_expr = instrument_expr1;
6715 : : }
6716 : :
6717 : 79827459 : result = build2_loc (location, resultcode, build_type, op0, op1);
6718 : 79827459 : if (final_type != 0)
6719 : 4403674 : result = cp_convert (final_type, result, complain);
6720 : :
6721 : 79827459 : if (instrument_expr != NULL)
6722 : 19772 : result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
6723 : : instrument_expr, result);
6724 : :
6725 : 79827459 : if (resultcode == SPACESHIP_EXPR && !processing_template_decl)
6726 : 124456 : result = get_target_expr (result, complain);
6727 : :
6728 : 79827459 : if (semantic_result_type)
6729 : 51544 : result = build1 (EXCESS_PRECISION_EXPR, semantic_result_type, result);
6730 : :
6731 : 79827459 : if (!c_inhibit_evaluation_warnings)
6732 : : {
6733 : 72205299 : if (!processing_template_decl)
6734 : : {
6735 : 72205299 : op0 = cp_fully_fold (op0);
6736 : : /* Only consider the second argument if the first isn't overflowed. */
6737 : 72205299 : if (!CONSTANT_CLASS_P (op0) || TREE_OVERFLOW_P (op0))
6738 : : return result;
6739 : 19018135 : op1 = cp_fully_fold (op1);
6740 : 19018135 : if (!CONSTANT_CLASS_P (op1) || TREE_OVERFLOW_P (op1))
6741 : : return result;
6742 : : }
6743 : 0 : else if (!CONSTANT_CLASS_P (op0) || !CONSTANT_CLASS_P (op1)
6744 : 0 : || TREE_OVERFLOW_P (op0) || TREE_OVERFLOW_P (op1))
6745 : : return result;
6746 : :
6747 : 13926611 : tree result_ovl = fold_build2 (resultcode, build_type, op0, op1);
6748 : 13926611 : if (TREE_OVERFLOW_P (result_ovl))
6749 : 188 : overflow_warning (location, result_ovl);
6750 : : }
6751 : :
6752 : : return result;
6753 : : }
6754 : :
6755 : : /* Build a VEC_PERM_EXPR.
6756 : : This is a simple wrapper for c_build_vec_perm_expr. */
6757 : : tree
6758 : 14554 : build_x_vec_perm_expr (location_t loc,
6759 : : tree arg0, tree arg1, tree arg2,
6760 : : tsubst_flags_t complain)
6761 : : {
6762 : 14554 : tree orig_arg0 = arg0;
6763 : 14554 : tree orig_arg1 = arg1;
6764 : 14554 : tree orig_arg2 = arg2;
6765 : 14554 : if (processing_template_decl)
6766 : : {
6767 : 19 : if (type_dependent_expression_p (arg0)
6768 : 13 : || type_dependent_expression_p (arg1)
6769 : 32 : || type_dependent_expression_p (arg2))
6770 : 6 : return build_min_nt_loc (loc, VEC_PERM_EXPR, arg0, arg1, arg2);
6771 : : }
6772 : 14548 : tree exp = c_build_vec_perm_expr (loc, arg0, arg1, arg2, complain & tf_error);
6773 : 14548 : if (processing_template_decl && exp != error_mark_node)
6774 : 13 : return build_min_non_dep (VEC_PERM_EXPR, exp, orig_arg0,
6775 : 13 : orig_arg1, orig_arg2);
6776 : : return exp;
6777 : : }
6778 : :
6779 : : /* Build a VEC_PERM_EXPR.
6780 : : This is a simple wrapper for c_build_shufflevector. */
6781 : : tree
6782 : 34007 : build_x_shufflevector (location_t loc, vec<tree, va_gc> *args,
6783 : : tsubst_flags_t complain)
6784 : : {
6785 : 34007 : tree arg0 = (*args)[0];
6786 : 34007 : tree arg1 = (*args)[1];
6787 : 34007 : if (processing_template_decl)
6788 : : {
6789 : 43 : for (unsigned i = 0; i < args->length (); ++i)
6790 : 40 : if (i <= 1
6791 : 40 : ? type_dependent_expression_p ((*args)[i])
6792 : 9 : : instantiation_dependent_expression_p ((*args)[i]))
6793 : : {
6794 : 22 : tree exp = build_min_nt_call_vec (NULL, args);
6795 : 22 : CALL_EXPR_IFN (exp) = IFN_SHUFFLEVECTOR;
6796 : 22 : return exp;
6797 : : }
6798 : : }
6799 : 33985 : auto_vec<tree, 16> mask;
6800 : 461429 : for (unsigned i = 2; i < args->length (); ++i)
6801 : : {
6802 : 427444 : tree idx = fold_non_dependent_expr ((*args)[i], complain);
6803 : 427444 : mask.safe_push (idx);
6804 : : }
6805 : 33985 : tree exp = c_build_shufflevector (loc, arg0, arg1, mask, complain & tf_error);
6806 : 33985 : if (processing_template_decl && exp != error_mark_node)
6807 : : {
6808 : 3 : exp = build_min_non_dep_call_vec (exp, NULL, args);
6809 : 3 : CALL_EXPR_IFN (exp) = IFN_SHUFFLEVECTOR;
6810 : : }
6811 : 33985 : return exp;
6812 : 33985 : }
6813 : :
6814 : : /* Return a tree for the sum or difference (RESULTCODE says which)
6815 : : of pointer PTROP and integer INTOP. */
6816 : :
6817 : : static tree
6818 : 3864116 : cp_pointer_int_sum (location_t loc, enum tree_code resultcode, tree ptrop,
6819 : : tree intop, tsubst_flags_t complain)
6820 : : {
6821 : 3864116 : tree res_type = TREE_TYPE (ptrop);
6822 : :
6823 : : /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
6824 : : in certain circumstance (when it's valid to do so). So we need
6825 : : to make sure it's complete. We don't need to check here, if we
6826 : : can actually complete it at all, as those checks will be done in
6827 : : pointer_int_sum() anyway. */
6828 : 3864116 : complete_type (TREE_TYPE (res_type));
6829 : :
6830 : 3864116 : return pointer_int_sum (loc, resultcode, ptrop,
6831 : 3864116 : intop, complain & tf_warning_or_error);
6832 : : }
6833 : :
6834 : : /* Return a tree for the difference of pointers OP0 and OP1.
6835 : : The resulting tree has type int. If POINTER_SUBTRACT sanitization is
6836 : : enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
6837 : :
6838 : : static tree
6839 : 1179091 : pointer_diff (location_t loc, tree op0, tree op1, tree ptrtype,
6840 : : tsubst_flags_t complain, tree *instrument_expr)
6841 : : {
6842 : 1179091 : tree result, inttype;
6843 : 1179091 : tree restype = ptrdiff_type_node;
6844 : 1179091 : tree target_type = TREE_TYPE (ptrtype);
6845 : :
6846 : 1179091 : if (!complete_type_or_maybe_complain (target_type, NULL_TREE, complain))
6847 : 12 : return error_mark_node;
6848 : :
6849 : 1179079 : if (VOID_TYPE_P (target_type))
6850 : : {
6851 : 0 : if (complain & tf_error)
6852 : 0 : permerror (loc, "ISO C++ forbids using pointer of "
6853 : : "type %<void *%> in subtraction");
6854 : : else
6855 : 0 : return error_mark_node;
6856 : : }
6857 : 1179079 : if (TREE_CODE (target_type) == FUNCTION_TYPE)
6858 : : {
6859 : 15 : if (complain & tf_error)
6860 : 3 : permerror (loc, "ISO C++ forbids using pointer to "
6861 : : "a function in subtraction");
6862 : : else
6863 : 12 : return error_mark_node;
6864 : : }
6865 : 1179067 : if (TREE_CODE (target_type) == METHOD_TYPE)
6866 : : {
6867 : 0 : if (complain & tf_error)
6868 : 0 : permerror (loc, "ISO C++ forbids using pointer to "
6869 : : "a method in subtraction");
6870 : : else
6871 : 0 : return error_mark_node;
6872 : : }
6873 : 2358134 : else if (!verify_type_context (loc, TCTX_POINTER_ARITH,
6874 : 1179067 : TREE_TYPE (TREE_TYPE (op0)),
6875 : : !(complain & tf_error))
6876 : 2358134 : || !verify_type_context (loc, TCTX_POINTER_ARITH,
6877 : 1179067 : TREE_TYPE (TREE_TYPE (op1)),
6878 : : !(complain & tf_error)))
6879 : 0 : return error_mark_node;
6880 : :
6881 : : /* Determine integer type result of the subtraction. This will usually
6882 : : be the same as the result type (ptrdiff_t), but may need to be a wider
6883 : : type if pointers for the address space are wider than ptrdiff_t. */
6884 : 1179067 : if (TYPE_PRECISION (restype) < TYPE_PRECISION (TREE_TYPE (op0)))
6885 : 0 : inttype = c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op0)), 0);
6886 : : else
6887 : : inttype = restype;
6888 : :
6889 : 1179067 : if (!processing_template_decl
6890 : 1179067 : && sanitize_flags_p (SANITIZE_POINTER_SUBTRACT))
6891 : : {
6892 : 84 : op0 = save_expr (op0);
6893 : 84 : op1 = save_expr (op1);
6894 : :
6895 : 84 : tree tt = builtin_decl_explicit (BUILT_IN_ASAN_POINTER_SUBTRACT);
6896 : 84 : *instrument_expr = build_call_expr_loc (loc, tt, 2, op0, op1);
6897 : : }
6898 : :
6899 : : /* First do the subtraction, then build the divide operator
6900 : : and only convert at the very end.
6901 : : Do not do default conversions in case restype is a short type. */
6902 : :
6903 : : /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
6904 : : pointers. If some platform cannot provide that, or has a larger
6905 : : ptrdiff_type to support differences larger than half the address
6906 : : space, cast the pointers to some larger integer type and do the
6907 : : computations in that type. */
6908 : 1179067 : if (TYPE_PRECISION (inttype) > TYPE_PRECISION (TREE_TYPE (op0)))
6909 : 0 : op0 = cp_build_binary_op (loc,
6910 : : MINUS_EXPR,
6911 : : cp_convert (inttype, op0, complain),
6912 : : cp_convert (inttype, op1, complain),
6913 : : complain);
6914 : : else
6915 : 1179067 : op0 = build2_loc (loc, POINTER_DIFF_EXPR, inttype, op0, op1);
6916 : :
6917 : : /* This generates an error if op1 is a pointer to an incomplete type. */
6918 : 1179067 : if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
6919 : : {
6920 : 0 : if (complain & tf_error)
6921 : 0 : error_at (loc, "invalid use of a pointer to an incomplete type in "
6922 : : "pointer arithmetic");
6923 : : else
6924 : 0 : return error_mark_node;
6925 : : }
6926 : :
6927 : 1179067 : if (pointer_to_zero_sized_aggr_p (TREE_TYPE (op1)))
6928 : : {
6929 : 15 : if (complain & tf_error)
6930 : 15 : error_at (loc, "arithmetic on pointer to an empty aggregate");
6931 : : else
6932 : 0 : return error_mark_node;
6933 : : }
6934 : :
6935 : 1179067 : op1 = (TYPE_PTROB_P (ptrtype)
6936 : 2358134 : ? size_in_bytes_loc (loc, target_type)
6937 : : : integer_one_node);
6938 : :
6939 : : /* Do the division. */
6940 : :
6941 : 1179067 : result = build2_loc (loc, EXACT_DIV_EXPR, inttype, op0,
6942 : : cp_convert (inttype, op1, complain));
6943 : 1179067 : return cp_convert (restype, result, complain);
6944 : : }
6945 : :
6946 : : /* Construct and perhaps optimize a tree representation
6947 : : for a unary operation. CODE, a tree_code, specifies the operation
6948 : : and XARG is the operand. */
6949 : :
6950 : : tree
6951 : 53056385 : build_x_unary_op (location_t loc, enum tree_code code, cp_expr xarg,
6952 : : tree lookups, tsubst_flags_t complain)
6953 : : {
6954 : 53056385 : tree orig_expr = xarg;
6955 : 53056385 : tree exp;
6956 : 53056385 : int ptrmem = 0;
6957 : 53056385 : tree overload = NULL_TREE;
6958 : :
6959 : 53056385 : if (processing_template_decl)
6960 : : {
6961 : 36961755 : if (type_dependent_expression_p (xarg))
6962 : : {
6963 : 24506942 : tree e = build_min_nt_loc (loc, code, xarg.get_value (), NULL_TREE);
6964 : 24506942 : TREE_TYPE (e) = build_dependent_operator_type (lookups, code, false);
6965 : 24506942 : return e;
6966 : : }
6967 : : }
6968 : :
6969 : 28549443 : exp = NULL_TREE;
6970 : :
6971 : : /* [expr.unary.op] says:
6972 : :
6973 : : The address of an object of incomplete type can be taken.
6974 : :
6975 : : (And is just the ordinary address operator, not an overloaded
6976 : : "operator &".) However, if the type is a template
6977 : : specialization, we must complete the type at this point so that
6978 : : an overloaded "operator &" will be available if required. */
6979 : 28549443 : if (code == ADDR_EXPR
6980 : 3261461 : && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
6981 : 31810502 : && ((CLASS_TYPE_P (TREE_TYPE (xarg))
6982 : 1575715 : && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
6983 : 3258962 : || (TREE_CODE (xarg) == OFFSET_REF)))
6984 : : /* Don't look for a function. */;
6985 : : else
6986 : 28483738 : exp = build_new_op (loc, code, LOOKUP_NORMAL, xarg, NULL_TREE,
6987 : : NULL_TREE, lookups, &overload, complain);
6988 : :
6989 : 28549443 : if (!exp && code == ADDR_EXPR)
6990 : : {
6991 : 3261198 : if (is_overloaded_fn (xarg))
6992 : : {
6993 : 353222 : tree fn = get_first_fn (xarg);
6994 : 706444 : if (DECL_CONSTRUCTOR_P (fn) || DECL_DESTRUCTOR_P (fn))
6995 : : {
6996 : 12 : if (complain & tf_error)
6997 : 21 : error_at (loc, DECL_CONSTRUCTOR_P (fn)
6998 : : ? G_("taking address of constructor %qD")
6999 : : : G_("taking address of destructor %qD"),
7000 : : fn);
7001 : 12 : return error_mark_node;
7002 : : }
7003 : : }
7004 : :
7005 : : /* A pointer to member-function can be formed only by saying
7006 : : &X::mf. */
7007 : 3261180 : if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
7008 : 3321256 : && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
7009 : : {
7010 : 9 : if (TREE_CODE (xarg) != OFFSET_REF
7011 : 9 : || !TYPE_P (TREE_OPERAND (xarg, 0)))
7012 : : {
7013 : 9 : if (complain & tf_error)
7014 : : {
7015 : 9 : auto_diagnostic_group d;
7016 : 9 : error_at (loc, "invalid use of %qE to form a "
7017 : : "pointer-to-member-function", xarg.get_value ());
7018 : 9 : if (TREE_CODE (xarg) != OFFSET_REF)
7019 : 6 : inform (loc, " a qualified-id is required");
7020 : 9 : }
7021 : 9 : return error_mark_node;
7022 : : }
7023 : : else
7024 : : {
7025 : 0 : if (complain & tf_error)
7026 : 0 : error_at (loc, "parentheses around %qE cannot be used to "
7027 : : "form a pointer-to-member-function",
7028 : : xarg.get_value ());
7029 : : else
7030 : 0 : return error_mark_node;
7031 : 0 : PTRMEM_OK_P (xarg) = 1;
7032 : : }
7033 : : }
7034 : :
7035 : 3261177 : if (TREE_CODE (xarg) == OFFSET_REF)
7036 : : {
7037 : 63593 : ptrmem = PTRMEM_OK_P (xarg);
7038 : :
7039 : 0 : if (!ptrmem && !flag_ms_extensions
7040 : 63593 : && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
7041 : : {
7042 : : /* A single non-static member, make sure we don't allow a
7043 : : pointer-to-member. */
7044 : 0 : xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
7045 : 0 : TREE_OPERAND (xarg, 0),
7046 : 0 : ovl_make (TREE_OPERAND (xarg, 1)));
7047 : 0 : PTRMEM_OK_P (xarg) = ptrmem;
7048 : : }
7049 : : }
7050 : :
7051 : 6522354 : exp = cp_build_addr_expr_strict (xarg, complain);
7052 : :
7053 : 3261177 : if (TREE_CODE (exp) == PTRMEM_CST)
7054 : 62730 : PTRMEM_CST_LOCATION (exp) = loc;
7055 : : else
7056 : 3198447 : protected_set_expr_location (exp, loc);
7057 : : }
7058 : :
7059 : 28549422 : if (processing_template_decl && exp != error_mark_node)
7060 : : {
7061 : 12454701 : if (overload != NULL_TREE)
7062 : 155946 : return (build_min_non_dep_op_overload
7063 : 155946 : (code, exp, overload, orig_expr, integer_zero_node));
7064 : :
7065 : 12298755 : exp = build_min_non_dep (code, exp, orig_expr,
7066 : : /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
7067 : : }
7068 : 28393476 : if (TREE_CODE (exp) == ADDR_EXPR)
7069 : 2499519 : PTRMEM_OK_P (exp) = ptrmem;
7070 : : return exp;
7071 : : }
7072 : :
7073 : : /* Construct and perhaps optimize a tree representation
7074 : : for __builtin_addressof operation. ARG specifies the operand. */
7075 : :
7076 : : tree
7077 : 416212 : cp_build_addressof (location_t loc, tree arg, tsubst_flags_t complain)
7078 : : {
7079 : 416212 : tree orig_expr = arg;
7080 : :
7081 : 416212 : if (processing_template_decl)
7082 : : {
7083 : 153871 : if (type_dependent_expression_p (arg))
7084 : 153871 : return build_min_nt_loc (loc, ADDRESSOF_EXPR, arg, NULL_TREE);
7085 : : }
7086 : :
7087 : 524682 : tree exp = cp_build_addr_expr_strict (arg, complain);
7088 : :
7089 : 262341 : if (processing_template_decl && exp != error_mark_node)
7090 : 0 : exp = build_min_non_dep (ADDRESSOF_EXPR, exp, orig_expr, NULL_TREE);
7091 : : return exp;
7092 : : }
7093 : :
7094 : : /* Like c_common_truthvalue_conversion, but handle pointer-to-member
7095 : : constants, where a null value is represented by an INTEGER_CST of
7096 : : -1. */
7097 : :
7098 : : tree
7099 : 6675803 : cp_truthvalue_conversion (tree expr, tsubst_flags_t complain)
7100 : : {
7101 : 6675803 : tree type = TREE_TYPE (expr);
7102 : 6675803 : location_t loc = cp_expr_loc_or_input_loc (expr);
7103 : 5640808 : if (TYPE_PTR_OR_PTRMEM_P (type)
7104 : : /* Avoid ICE on invalid use of non-static member function. */
7105 : 12316333 : || TREE_CODE (expr) == FUNCTION_DECL)
7106 : 1035273 : return cp_build_binary_op (loc, NE_EXPR, expr, nullptr_node, complain);
7107 : : else
7108 : 5640530 : return c_common_truthvalue_conversion (loc, expr);
7109 : : }
7110 : :
7111 : : /* Returns EXPR contextually converted to bool. */
7112 : :
7113 : : tree
7114 : 42181979 : contextual_conv_bool (tree expr, tsubst_flags_t complain)
7115 : : {
7116 : 42181979 : return perform_implicit_conversion_flags (boolean_type_node, expr,
7117 : 42181979 : complain, LOOKUP_NORMAL);
7118 : : }
7119 : :
7120 : : /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. This
7121 : : is a low-level function; most callers should use maybe_convert_cond. */
7122 : :
7123 : : tree
7124 : 37678471 : condition_conversion (tree expr)
7125 : : {
7126 : 37678471 : tree t = contextual_conv_bool (expr, tf_warning_or_error);
7127 : 37678471 : if (!processing_template_decl)
7128 : 18913276 : t = fold_build_cleanup_point_expr (boolean_type_node, t);
7129 : 37678471 : return t;
7130 : : }
7131 : :
7132 : : /* Returns the address of T. This function will fold away
7133 : : ADDR_EXPR of INDIRECT_REF. This is only for low-level usage;
7134 : : most places should use cp_build_addr_expr instead. */
7135 : :
7136 : : tree
7137 : 239711846 : build_address (tree t)
7138 : : {
7139 : 239711846 : if (error_operand_p (t) || !cxx_mark_addressable (t))
7140 : 21 : return error_mark_node;
7141 : 239711825 : gcc_checking_assert (TREE_CODE (t) != CONSTRUCTOR
7142 : : || processing_template_decl);
7143 : 239711825 : t = build_fold_addr_expr_loc (EXPR_LOCATION (t), t);
7144 : 239711825 : if (TREE_CODE (t) != ADDR_EXPR)
7145 : 43323762 : t = rvalue (t);
7146 : : return t;
7147 : : }
7148 : :
7149 : : /* Return a NOP_EXPR converting EXPR to TYPE. */
7150 : :
7151 : : tree
7152 : 410096899 : build_nop (tree type, tree expr)
7153 : : {
7154 : 410096899 : if (type == error_mark_node || error_operand_p (expr))
7155 : : return expr;
7156 : 410096823 : return build1_loc (EXPR_LOCATION (expr), NOP_EXPR, type, expr);
7157 : : }
7158 : :
7159 : : /* Take the address of ARG, whatever that means under C++ semantics.
7160 : : If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
7161 : : and class rvalues as well.
7162 : :
7163 : : Nothing should call this function directly; instead, callers should use
7164 : : cp_build_addr_expr or cp_build_addr_expr_strict. */
7165 : :
7166 : : static tree
7167 : 178159883 : cp_build_addr_expr_1 (tree arg, bool strict_lvalue, tsubst_flags_t complain)
7168 : : {
7169 : 178159883 : tree argtype;
7170 : 178159883 : tree val;
7171 : :
7172 : 178159883 : if (!arg || error_operand_p (arg))
7173 : 12 : return error_mark_node;
7174 : :
7175 : 178159871 : arg = mark_lvalue_use (arg);
7176 : 178159871 : if (error_operand_p (arg))
7177 : 3 : return error_mark_node;
7178 : :
7179 : 178159868 : argtype = lvalue_type (arg);
7180 : 178159868 : location_t loc = cp_expr_loc_or_input_loc (arg);
7181 : :
7182 : 178159868 : gcc_assert (!(identifier_p (arg) && IDENTIFIER_ANY_OP_P (arg)));
7183 : :
7184 : 11692343 : if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
7185 : 178160062 : && !really_overloaded_fn (arg))
7186 : : {
7187 : : /* They're trying to take the address of a unique non-static
7188 : : member function. This is ill-formed (except in MS-land),
7189 : : but let's try to DTRT.
7190 : : Note: We only handle unique functions here because we don't
7191 : : want to complain if there's a static overload; non-unique
7192 : : cases will be handled by instantiate_type. But we need to
7193 : : handle this case here to allow casts on the resulting PMF.
7194 : : We could defer this in non-MS mode, but it's easier to give
7195 : : a useful error here. */
7196 : :
7197 : : /* Inside constant member functions, the `this' pointer
7198 : : contains an extra const qualifier. TYPE_MAIN_VARIANT
7199 : : is used here to remove this const from the diagnostics
7200 : : and the created OFFSET_REF. */
7201 : 70 : tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
7202 : 70 : tree fn = get_first_fn (TREE_OPERAND (arg, 1));
7203 : 70 : if (!mark_used (fn, complain) && !(complain & tf_error))
7204 : 0 : return error_mark_node;
7205 : : /* Until microsoft headers are known to incorrectly take the address of
7206 : : unqualified xobj member functions we should not support this
7207 : : extension.
7208 : : See comment in class.cc:resolve_address_of_overloaded_function for
7209 : : the extended reasoning. */
7210 : 70 : if (!flag_ms_extensions || DECL_XOBJ_MEMBER_FUNCTION_P (fn))
7211 : : {
7212 : 64 : auto_diagnostic_group d;
7213 : 64 : tree name = DECL_NAME (fn);
7214 : 64 : if (!(complain & tf_error))
7215 : 0 : return error_mark_node;
7216 : 64 : else if (current_class_type
7217 : 64 : && TREE_OPERAND (arg, 0) == current_class_ref)
7218 : : /* An expression like &memfn. */
7219 : 31 : if (!DECL_XOBJ_MEMBER_FUNCTION_P (fn))
7220 : 21 : permerror (loc,
7221 : : "ISO C++ forbids taking the address of an unqualified"
7222 : : " or parenthesized non-static member function to form"
7223 : : " a pointer to member function. Say %<&%T::%D%>",
7224 : : base, name);
7225 : : else
7226 : 10 : error_at (loc,
7227 : : "ISO C++ forbids taking the address of an unqualified"
7228 : : " or parenthesized non-static member function to form"
7229 : : " a pointer to explicit object member function");
7230 : : else
7231 : 33 : if (!DECL_XOBJ_MEMBER_FUNCTION_P (fn))
7232 : 9 : permerror (loc,
7233 : : "ISO C++ forbids taking the address of a bound member"
7234 : : " function to form a pointer to member function."
7235 : : " Say %<&%T::%D%>",
7236 : : base, name);
7237 : : else
7238 : 24 : error_at (loc,
7239 : : "ISO C++ forbids taking the address of a bound member"
7240 : : " function to form a pointer to explicit object member"
7241 : : " function");
7242 : 64 : if (DECL_XOBJ_MEMBER_FUNCTION_P (fn))
7243 : 34 : inform (loc,
7244 : : "a pointer to explicit object member function can only be "
7245 : : "formed with %<&%T::%D%>", base, name);
7246 : 64 : }
7247 : 70 : arg = build_offset_ref (base, fn, /*address_p=*/true, complain);
7248 : : }
7249 : :
7250 : : /* Uninstantiated types are all functions. Taking the
7251 : : address of a function is a no-op, so just return the
7252 : : argument. */
7253 : 178159868 : if (type_unknown_p (arg))
7254 : 1727 : return build1 (ADDR_EXPR, unknown_type_node, arg);
7255 : :
7256 : 178158141 : if (TREE_CODE (arg) == OFFSET_REF)
7257 : : /* We want a pointer to member; bypass all the code for actually taking
7258 : : the address of something. */
7259 : 62849 : goto offset_ref;
7260 : :
7261 : : /* Anything not already handled and not a true memory reference
7262 : : is an error. */
7263 : 178095292 : if (!FUNC_OR_METHOD_TYPE_P (argtype))
7264 : : {
7265 : 93448368 : cp_lvalue_kind kind = lvalue_kind (arg);
7266 : 93448368 : if (kind == clk_none)
7267 : : {
7268 : 23 : if (complain & tf_error)
7269 : 23 : lvalue_error (loc, lv_addressof);
7270 : 23 : return error_mark_node;
7271 : : }
7272 : 93448345 : if (strict_lvalue && (kind & (clk_rvalueref|clk_class)))
7273 : : {
7274 : 36 : if (!(complain & tf_error))
7275 : 9 : return error_mark_node;
7276 : : /* Make this a permerror because we used to accept it. */
7277 : 27 : permerror (loc, "taking address of rvalue");
7278 : : }
7279 : : }
7280 : :
7281 : 178095260 : if (TYPE_REF_P (argtype))
7282 : : {
7283 : 352 : tree type = build_pointer_type (TREE_TYPE (argtype));
7284 : 352 : arg = build1 (CONVERT_EXPR, type, arg);
7285 : 352 : return arg;
7286 : : }
7287 : 178094908 : else if (pedantic && DECL_MAIN_P (tree_strip_any_location_wrapper (arg)))
7288 : : {
7289 : : /* ARM $3.4 */
7290 : : /* Apparently a lot of autoconf scripts for C++ packages do this,
7291 : : so only complain if -Wpedantic. */
7292 : 9 : if (complain & (flag_pedantic_errors ? tf_error : tf_warning))
7293 : 9 : pedwarn (loc, OPT_Wpedantic,
7294 : : "ISO C++ forbids taking address of function %<::main%>");
7295 : 0 : else if (flag_pedantic_errors)
7296 : 0 : return error_mark_node;
7297 : : }
7298 : :
7299 : : /* Let &* cancel out to simplify resulting code. */
7300 : 178094908 : if (INDIRECT_REF_P (arg))
7301 : : {
7302 : 57683829 : arg = TREE_OPERAND (arg, 0);
7303 : 57683829 : if (TYPE_REF_P (TREE_TYPE (arg)))
7304 : : {
7305 : 31747556 : tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
7306 : 31747556 : arg = build1 (CONVERT_EXPR, type, arg);
7307 : : }
7308 : : else
7309 : : /* Don't let this be an lvalue. */
7310 : 25936273 : arg = rvalue (arg);
7311 : 57683829 : return arg;
7312 : : }
7313 : :
7314 : : /* Handle complex lvalues (when permitted)
7315 : : by reduction to simpler cases. */
7316 : 120411079 : val = unary_complex_lvalue (ADDR_EXPR, arg);
7317 : 120411079 : if (val != 0)
7318 : : return val;
7319 : :
7320 : 119957344 : switch (TREE_CODE (arg))
7321 : : {
7322 : 0 : CASE_CONVERT:
7323 : 0 : case FLOAT_EXPR:
7324 : 0 : case FIX_TRUNC_EXPR:
7325 : : /* We should have handled this above in the lvalue_kind check. */
7326 : 0 : gcc_unreachable ();
7327 : 58811 : break;
7328 : :
7329 : 58811 : case BASELINK:
7330 : 58811 : arg = BASELINK_FUNCTIONS (arg);
7331 : : /* Fall through. */
7332 : :
7333 : 58811 : case OVERLOAD:
7334 : 58811 : arg = OVL_FIRST (arg);
7335 : : break;
7336 : :
7337 : 62849 : case OFFSET_REF:
7338 : 62849 : offset_ref:
7339 : : /* Turn a reference to a non-static data member into a
7340 : : pointer-to-member. */
7341 : 62849 : {
7342 : 62849 : tree type;
7343 : 62849 : tree t;
7344 : :
7345 : 62849 : gcc_assert (PTRMEM_OK_P (arg));
7346 : :
7347 : 62849 : t = TREE_OPERAND (arg, 1);
7348 : 62849 : if (TYPE_REF_P (TREE_TYPE (t)))
7349 : : {
7350 : 15 : if (complain & tf_error)
7351 : 15 : error_at (loc,
7352 : : "cannot create pointer to reference member %qD", t);
7353 : 15 : return error_mark_node;
7354 : : }
7355 : :
7356 : : /* Forming a pointer-to-member is a use of non-pure-virtual fns. */
7357 : 62834 : if (TREE_CODE (t) == FUNCTION_DECL
7358 : 60198 : && !DECL_PURE_VIRTUAL_P (t)
7359 : 123011 : && !mark_used (t, complain) && !(complain & tf_error))
7360 : 3 : return error_mark_node;
7361 : :
7362 : : /* Pull out the function_decl for a single xobj member function, and
7363 : : let the rest of this function handle it. This is similar to how
7364 : : static member functions are handled in the BASELINK case above. */
7365 : 62831 : if (DECL_XOBJ_MEMBER_FUNCTION_P (t))
7366 : : {
7367 : : arg = t;
7368 : : break;
7369 : : }
7370 : :
7371 : 62775 : type = build_ptrmem_type (context_for_name_lookup (t),
7372 : 62775 : TREE_TYPE (t));
7373 : 62775 : t = make_ptrmem_cst (type, t);
7374 : 62775 : return t;
7375 : : }
7376 : :
7377 : : default:
7378 : : break;
7379 : : }
7380 : :
7381 : 119957400 : if (argtype != error_mark_node)
7382 : 119957400 : argtype = build_pointer_type (argtype);
7383 : :
7384 : 119957400 : if (bitfield_p (arg))
7385 : : {
7386 : 33 : if (complain & tf_error)
7387 : 33 : error_at (loc, "attempt to take address of bit-field");
7388 : 33 : return error_mark_node;
7389 : : }
7390 : :
7391 : : /* In a template, we are processing a non-dependent expression
7392 : : so we can just form an ADDR_EXPR with the correct type. */
7393 : 119957367 : if (processing_template_decl || TREE_CODE (arg) != COMPONENT_REF)
7394 : : {
7395 : 108539405 : if (!mark_single_function (arg, complain))
7396 : 3 : return error_mark_node;
7397 : 108539402 : val = build_address (arg);
7398 : 108539402 : if (TREE_CODE (arg) == OFFSET_REF)
7399 : 0 : PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
7400 : : }
7401 : 11417962 : else if (BASELINK_P (TREE_OPERAND (arg, 1)))
7402 : : {
7403 : 27 : tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
7404 : :
7405 : 27 : if (TREE_CODE (fn) == OVERLOAD && OVL_SINGLE_P (fn))
7406 : 27 : fn = OVL_FIRST (fn);
7407 : :
7408 : : /* We can only get here with a single static member
7409 : : function. */
7410 : 27 : gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7411 : : && DECL_STATIC_FUNCTION_P (fn));
7412 : 27 : if (!mark_used (fn, complain) && !(complain & tf_error))
7413 : 0 : return error_mark_node;
7414 : 27 : val = build_address (fn);
7415 : 27 : if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
7416 : : /* Do not lose object's side effects. */
7417 : 12 : val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
7418 : 12 : TREE_OPERAND (arg, 0), val);
7419 : : }
7420 : : else
7421 : : {
7422 : 11417935 : tree object = TREE_OPERAND (arg, 0);
7423 : 11417935 : tree field = TREE_OPERAND (arg, 1);
7424 : 11417935 : gcc_assert (same_type_ignoring_top_level_qualifiers_p
7425 : : (TREE_TYPE (object), decl_type_context (field)));
7426 : 11417935 : val = build_address (arg);
7427 : : }
7428 : :
7429 : 119957364 : if (TYPE_PTR_P (argtype)
7430 : 119957364 : && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
7431 : : {
7432 : 1053 : build_ptrmemfunc_type (argtype);
7433 : 1053 : val = build_ptrmemfunc (argtype, val, 0,
7434 : : /*c_cast_p=*/false,
7435 : : complain);
7436 : : }
7437 : :
7438 : : /* Ensure we have EXPR_LOCATION set for possible later diagnostics. */
7439 : 119957364 : if (TREE_CODE (val) == ADDR_EXPR
7440 : 119957364 : && TREE_CODE (TREE_OPERAND (val, 0)) == FUNCTION_DECL)
7441 : 83622409 : SET_EXPR_LOCATION (val, input_location);
7442 : :
7443 : : return val;
7444 : : }
7445 : :
7446 : : /* Take the address of ARG if it has one, even if it's an rvalue. */
7447 : :
7448 : : tree
7449 : 174636365 : cp_build_addr_expr (tree arg, tsubst_flags_t complain)
7450 : : {
7451 : 174636365 : return cp_build_addr_expr_1 (arg, 0, complain);
7452 : : }
7453 : :
7454 : : /* Take the address of ARG, but only if it's an lvalue. */
7455 : :
7456 : : static tree
7457 : 3523518 : cp_build_addr_expr_strict (tree arg, tsubst_flags_t complain)
7458 : : {
7459 : 3523518 : return cp_build_addr_expr_1 (arg, 1, complain);
7460 : : }
7461 : :
7462 : : /* C++: Must handle pointers to members.
7463 : :
7464 : : Perhaps type instantiation should be extended to handle conversion
7465 : : from aggregates to types we don't yet know we want? (Or are those
7466 : : cases typically errors which should be reported?)
7467 : :
7468 : : NOCONVERT suppresses the default promotions (such as from short to int). */
7469 : :
7470 : : tree
7471 : 25586489 : cp_build_unary_op (enum tree_code code, tree xarg, bool noconvert,
7472 : : tsubst_flags_t complain)
7473 : : {
7474 : : /* No default_conversion here. It causes trouble for ADDR_EXPR. */
7475 : 25586489 : tree arg = xarg;
7476 : 25586489 : location_t location = cp_expr_loc_or_input_loc (arg);
7477 : 25586489 : tree argtype = 0;
7478 : 25586489 : tree eptype = NULL_TREE;
7479 : 25586489 : const char *errstring = NULL;
7480 : 25586489 : tree val;
7481 : 25586489 : const char *invalid_op_diag;
7482 : :
7483 : 25586489 : if (!arg || error_operand_p (arg))
7484 : 3 : return error_mark_node;
7485 : :
7486 : 25586486 : arg = resolve_nondeduced_context (arg, complain);
7487 : :
7488 : 51172972 : if ((invalid_op_diag
7489 : 25586486 : = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
7490 : : ? CONVERT_EXPR
7491 : : : code),
7492 : 25586486 : TREE_TYPE (arg))))
7493 : : {
7494 : 0 : if (complain & tf_error)
7495 : 0 : error (invalid_op_diag);
7496 : 0 : return error_mark_node;
7497 : : }
7498 : :
7499 : 25586486 : if (TREE_CODE (arg) == EXCESS_PRECISION_EXPR)
7500 : : {
7501 : 8152 : eptype = TREE_TYPE (arg);
7502 : 8152 : arg = TREE_OPERAND (arg, 0);
7503 : : }
7504 : :
7505 : 25586486 : switch (code)
7506 : : {
7507 : 2307170 : case UNARY_PLUS_EXPR:
7508 : 2307170 : case NEGATE_EXPR:
7509 : 2307170 : {
7510 : 2307170 : int flags = WANT_ARITH | WANT_ENUM;
7511 : : /* Unary plus (but not unary minus) is allowed on pointers. */
7512 : 2307170 : if (code == UNARY_PLUS_EXPR)
7513 : 160857 : flags |= WANT_POINTER;
7514 : 2307170 : arg = build_expr_type_conversion (flags, arg, true);
7515 : 2307170 : if (!arg)
7516 : 30 : errstring = (code == NEGATE_EXPR
7517 : 24 : ? _("wrong type argument to unary minus")
7518 : 6 : : _("wrong type argument to unary plus"));
7519 : : else
7520 : : {
7521 : 2307140 : if (!noconvert && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (arg)))
7522 : 573023 : arg = cp_perform_integral_promotions (arg, complain);
7523 : :
7524 : : /* Make sure the result is not an lvalue: a unary plus or minus
7525 : : expression is always a rvalue. */
7526 : 2307140 : arg = rvalue (arg);
7527 : : }
7528 : : }
7529 : : break;
7530 : :
7531 : 817870 : case BIT_NOT_EXPR:
7532 : 817870 : if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
7533 : : {
7534 : 15 : code = CONJ_EXPR;
7535 : 15 : if (!noconvert)
7536 : : {
7537 : 15 : arg = cp_default_conversion (arg, complain);
7538 : 15 : if (arg == error_mark_node)
7539 : : return error_mark_node;
7540 : : }
7541 : : }
7542 : 817855 : else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
7543 : : | WANT_VECTOR_OR_COMPLEX,
7544 : : arg, true)))
7545 : 12 : errstring = _("wrong type argument to bit-complement");
7546 : 817843 : else if (!noconvert && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (arg)))
7547 : : {
7548 : : /* Warn if the expression has boolean value. */
7549 : 817608 : if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE
7550 : 817608 : && (complain & tf_warning))
7551 : : {
7552 : 61 : auto_diagnostic_group d;
7553 : 61 : if (warning_at (location, OPT_Wbool_operation,
7554 : : "%<~%> on an expression of type %<bool%>"))
7555 : 42 : inform (location, "did you mean to use logical not (%<!%>)?");
7556 : 61 : }
7557 : 817608 : arg = cp_perform_integral_promotions (arg, complain);
7558 : : }
7559 : 235 : else if (!noconvert && VECTOR_TYPE_P (TREE_TYPE (arg)))
7560 : 235 : arg = mark_rvalue_use (arg);
7561 : : break;
7562 : :
7563 : 0 : case ABS_EXPR:
7564 : 0 : if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
7565 : 0 : errstring = _("wrong type argument to abs");
7566 : 0 : else if (!noconvert)
7567 : : {
7568 : 0 : arg = cp_default_conversion (arg, complain);
7569 : 0 : if (arg == error_mark_node)
7570 : : return error_mark_node;
7571 : : }
7572 : : break;
7573 : :
7574 : 0 : case CONJ_EXPR:
7575 : : /* Conjugating a real value is a no-op, but allow it anyway. */
7576 : 0 : if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
7577 : 0 : errstring = _("wrong type argument to conjugation");
7578 : 0 : else if (!noconvert)
7579 : : {
7580 : 0 : arg = cp_default_conversion (arg, complain);
7581 : 0 : if (arg == error_mark_node)
7582 : : return error_mark_node;
7583 : : }
7584 : : break;
7585 : :
7586 : 14280233 : case TRUTH_NOT_EXPR:
7587 : 14280233 : if (gnu_vector_type_p (TREE_TYPE (arg)))
7588 : 60 : return cp_build_binary_op (input_location, EQ_EXPR, arg,
7589 : 60 : build_zero_cst (TREE_TYPE (arg)), complain);
7590 : 14280173 : arg = perform_implicit_conversion (boolean_type_node, arg,
7591 : : complain);
7592 : 14280173 : if (arg != error_mark_node)
7593 : : {
7594 : 14280162 : if (processing_template_decl)
7595 : 6715166 : return build1_loc (location, TRUTH_NOT_EXPR, boolean_type_node, arg);
7596 : 7564996 : val = invert_truthvalue_loc (location, arg);
7597 : 7564996 : if (obvalue_p (val))
7598 : 12786 : val = non_lvalue_loc (location, val);
7599 : 7564996 : return val;
7600 : : }
7601 : 11 : errstring = _("in argument to unary !");
7602 : 11 : break;
7603 : :
7604 : : case NOP_EXPR:
7605 : : break;
7606 : :
7607 : 454115 : case REALPART_EXPR:
7608 : 454115 : case IMAGPART_EXPR:
7609 : 454115 : val = build_real_imag_expr (input_location, code, arg);
7610 : 454115 : if (eptype && TREE_CODE (eptype) == COMPLEX_EXPR)
7611 : 0 : val = build1_loc (input_location, EXCESS_PRECISION_EXPR,
7612 : 0 : TREE_TYPE (eptype), val);
7613 : : return val;
7614 : :
7615 : 7178301 : case PREINCREMENT_EXPR:
7616 : 7178301 : case POSTINCREMENT_EXPR:
7617 : 7178301 : case PREDECREMENT_EXPR:
7618 : 7178301 : case POSTDECREMENT_EXPR:
7619 : : /* Handle complex lvalues (when permitted)
7620 : : by reduction to simpler cases. */
7621 : :
7622 : 7178301 : val = unary_complex_lvalue (code, arg);
7623 : 7178301 : if (val != 0)
7624 : 30 : goto return_build_unary_op;
7625 : :
7626 : 7178271 : arg = mark_lvalue_use (arg);
7627 : :
7628 : : /* Increment or decrement the real part of the value,
7629 : : and don't change the imaginary part. */
7630 : 7178271 : if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
7631 : : {
7632 : 18 : tree real, imag;
7633 : :
7634 : 18 : arg = cp_stabilize_reference (arg);
7635 : 18 : real = cp_build_unary_op (REALPART_EXPR, arg, true, complain);
7636 : 18 : imag = cp_build_unary_op (IMAGPART_EXPR, arg, true, complain);
7637 : 18 : real = cp_build_unary_op (code, real, true, complain);
7638 : 18 : if (real == error_mark_node || imag == error_mark_node)
7639 : : return error_mark_node;
7640 : 15 : val = build2 (COMPLEX_EXPR, TREE_TYPE (arg), real, imag);
7641 : 15 : goto return_build_unary_op;
7642 : : }
7643 : :
7644 : : /* Report invalid types. */
7645 : :
7646 : 7178253 : if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
7647 : : arg, true)))
7648 : : {
7649 : 36 : if (code == PREINCREMENT_EXPR)
7650 : 9 : errstring = _("no pre-increment operator for type");
7651 : 27 : else if (code == POSTINCREMENT_EXPR)
7652 : 9 : errstring = _("no post-increment operator for type");
7653 : 18 : else if (code == PREDECREMENT_EXPR)
7654 : 9 : errstring = _("no pre-decrement operator for type");
7655 : : else
7656 : 9 : errstring = _("no post-decrement operator for type");
7657 : : break;
7658 : : }
7659 : 7178217 : else if (arg == error_mark_node)
7660 : : return error_mark_node;
7661 : :
7662 : : /* Report something read-only. */
7663 : :
7664 : 7178217 : if (CP_TYPE_CONST_P (TREE_TYPE (arg))
7665 : 7178217 : || TREE_READONLY (arg))
7666 : : {
7667 : 61 : if (complain & tf_error)
7668 : 61 : cxx_readonly_error (location, arg,
7669 : 61 : ((code == PREINCREMENT_EXPR
7670 : 61 : || code == POSTINCREMENT_EXPR)
7671 : : ? lv_increment : lv_decrement));
7672 : : else
7673 : 0 : return error_mark_node;
7674 : : }
7675 : :
7676 : 7178217 : {
7677 : 7178217 : tree inc;
7678 : 7178217 : tree declared_type = unlowered_expr_type (arg);
7679 : :
7680 : 7178217 : argtype = TREE_TYPE (arg);
7681 : :
7682 : : /* ARM $5.2.5 last annotation says this should be forbidden. */
7683 : 7178217 : if (TREE_CODE (argtype) == ENUMERAL_TYPE)
7684 : : {
7685 : 0 : if (complain & tf_error)
7686 : 0 : permerror (location, (code == PREINCREMENT_EXPR
7687 : 0 : || code == POSTINCREMENT_EXPR)
7688 : : ? G_("ISO C++ forbids incrementing an enum")
7689 : : : G_("ISO C++ forbids decrementing an enum"));
7690 : : else
7691 : 0 : return error_mark_node;
7692 : : }
7693 : :
7694 : : /* Compute the increment. */
7695 : :
7696 : 7178217 : if (TYPE_PTR_P (argtype))
7697 : : {
7698 : 1964392 : tree type = complete_type (TREE_TYPE (argtype));
7699 : :
7700 : 1964392 : if (!COMPLETE_OR_VOID_TYPE_P (type))
7701 : : {
7702 : 11 : if (complain & tf_error)
7703 : 9 : error_at (location, ((code == PREINCREMENT_EXPR
7704 : 9 : || code == POSTINCREMENT_EXPR))
7705 : : ? G_("cannot increment a pointer to incomplete "
7706 : : "type %qT")
7707 : : : G_("cannot decrement a pointer to incomplete "
7708 : : "type %qT"),
7709 : 9 : TREE_TYPE (argtype));
7710 : : else
7711 : 2 : return error_mark_node;
7712 : : }
7713 : 1964381 : else if (!TYPE_PTROB_P (argtype))
7714 : : {
7715 : 75 : if (complain & tf_error)
7716 : 63 : pedwarn (location, OPT_Wpointer_arith,
7717 : 63 : (code == PREINCREMENT_EXPR
7718 : 63 : || code == POSTINCREMENT_EXPR)
7719 : : ? G_("ISO C++ forbids incrementing a pointer "
7720 : : "of type %qT")
7721 : : : G_("ISO C++ forbids decrementing a pointer "
7722 : : "of type %qT"),
7723 : : argtype);
7724 : : else
7725 : 12 : return error_mark_node;
7726 : : }
7727 : 1964306 : else if (!verify_type_context (location, TCTX_POINTER_ARITH,
7728 : 1964306 : TREE_TYPE (argtype),
7729 : : !(complain & tf_error)))
7730 : 0 : return error_mark_node;
7731 : :
7732 : 1964378 : inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
7733 : : }
7734 : : else
7735 : 5213825 : inc = VECTOR_TYPE_P (argtype)
7736 : 5213825 : ? build_one_cst (argtype)
7737 : : : integer_one_node;
7738 : :
7739 : 7178203 : inc = cp_convert (argtype, inc, complain);
7740 : :
7741 : : /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
7742 : : need to ask Objective-C to build the increment or decrement
7743 : : expression for it. */
7744 : 7178203 : if (objc_is_property_ref (arg))
7745 : 0 : return objc_build_incr_expr_for_property_ref (input_location, code,
7746 : 0 : arg, inc);
7747 : :
7748 : : /* Complain about anything else that is not a true lvalue. */
7749 : 7178203 : if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
7750 : 7178203 : || code == POSTINCREMENT_EXPR)
7751 : : ? lv_increment : lv_decrement),
7752 : : complain))
7753 : 33 : return error_mark_node;
7754 : :
7755 : : /* [depr.volatile.type] "Postfix ++ and -- expressions and
7756 : : prefix ++ and -- expressions of volatile-qualified arithmetic
7757 : : and pointer types are deprecated." */
7758 : 7177821 : if ((TREE_THIS_VOLATILE (arg) || CP_TYPE_VOLATILE_P (TREE_TYPE (arg)))
7759 : 7178170 : && (complain & tf_warning))
7760 : 462 : warning_at (location, OPT_Wvolatile,
7761 : : "%qs expression of %<volatile%>-qualified type is "
7762 : : "deprecated",
7763 : : ((code == PREINCREMENT_EXPR
7764 : : || code == POSTINCREMENT_EXPR)
7765 : : ? "++" : "--"));
7766 : :
7767 : : /* Forbid using -- or ++ in C++17 on `bool'. */
7768 : 7178170 : if (TREE_CODE (declared_type) == BOOLEAN_TYPE)
7769 : : {
7770 : 95 : if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
7771 : : {
7772 : 33 : if (complain & tf_error)
7773 : 33 : error_at (location,
7774 : : "use of an operand of type %qT in %<operator--%> "
7775 : : "is forbidden", boolean_type_node);
7776 : 33 : return error_mark_node;
7777 : : }
7778 : : else
7779 : : {
7780 : 62 : if (cxx_dialect >= cxx17)
7781 : : {
7782 : 33 : if (complain & tf_error)
7783 : 32 : error_at (location,
7784 : : "use of an operand of type %qT in "
7785 : : "%<operator++%> is forbidden in C++17",
7786 : : boolean_type_node);
7787 : 33 : return error_mark_node;
7788 : : }
7789 : : /* Otherwise, [depr.incr.bool] says this is deprecated. */
7790 : 29 : else if (complain & tf_warning)
7791 : 25 : warning_at (location, OPT_Wdeprecated,
7792 : : "use of an operand of type %qT "
7793 : : "in %<operator++%> is deprecated",
7794 : : boolean_type_node);
7795 : : }
7796 : 29 : val = boolean_increment (code, arg);
7797 : : }
7798 : 7178075 : else if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
7799 : : /* An rvalue has no cv-qualifiers. */
7800 : 976816 : val = build2 (code, cv_unqualified (TREE_TYPE (arg)), arg, inc);
7801 : : else
7802 : 6201259 : val = build2 (code, TREE_TYPE (arg), arg, inc);
7803 : :
7804 : 7178104 : TREE_SIDE_EFFECTS (val) = 1;
7805 : 7178104 : goto return_build_unary_op;
7806 : : }
7807 : :
7808 : 548797 : case ADDR_EXPR:
7809 : : /* Note that this operation never does default_conversion
7810 : : regardless of NOCONVERT. */
7811 : 548797 : return cp_build_addr_expr (arg, complain);
7812 : :
7813 : : default:
7814 : : break;
7815 : : }
7816 : :
7817 : 3125072 : if (!errstring)
7818 : : {
7819 : 3124998 : if (argtype == 0)
7820 : 3124998 : argtype = TREE_TYPE (arg);
7821 : 3124998 : val = build1 (code, argtype, arg);
7822 : 10303147 : return_build_unary_op:
7823 : 10303147 : if (eptype)
7824 : 8143 : val = build1 (EXCESS_PRECISION_EXPR, eptype, val);
7825 : 10303147 : return val;
7826 : : }
7827 : :
7828 : 89 : if (complain & tf_error)
7829 : 47 : error_at (location, "%s", errstring);
7830 : 89 : return error_mark_node;
7831 : : }
7832 : :
7833 : : /* Hook for the c-common bits that build a unary op. */
7834 : : tree
7835 : 4118 : build_unary_op (location_t /*location*/,
7836 : : enum tree_code code, tree xarg, bool noconvert)
7837 : : {
7838 : 4118 : return cp_build_unary_op (code, xarg, noconvert, tf_warning_or_error);
7839 : : }
7840 : :
7841 : : /* Adjust LVALUE, an MODIFY_EXPR, PREINCREMENT_EXPR or PREDECREMENT_EXPR,
7842 : : so that it is a valid lvalue even for GENERIC by replacing
7843 : : (lhs = rhs) with ((lhs = rhs), lhs)
7844 : : (--lhs) with ((--lhs), lhs)
7845 : : (++lhs) with ((++lhs), lhs)
7846 : : and if lhs has side-effects, calling cp_stabilize_reference on it, so
7847 : : that it can be evaluated multiple times. */
7848 : :
7849 : : tree
7850 : 362248 : genericize_compound_lvalue (tree lvalue)
7851 : : {
7852 : 362248 : if (TREE_SIDE_EFFECTS (TREE_OPERAND (lvalue, 0)))
7853 : 188 : lvalue = build2 (TREE_CODE (lvalue), TREE_TYPE (lvalue),
7854 : 188 : cp_stabilize_reference (TREE_OPERAND (lvalue, 0)),
7855 : 188 : TREE_OPERAND (lvalue, 1));
7856 : 362248 : return build2 (COMPOUND_EXPR, TREE_TYPE (TREE_OPERAND (lvalue, 0)),
7857 : 362248 : lvalue, TREE_OPERAND (lvalue, 0));
7858 : : }
7859 : :
7860 : : /* Apply unary lvalue-demanding operator CODE to the expression ARG
7861 : : for certain kinds of expressions which are not really lvalues
7862 : : but which we can accept as lvalues.
7863 : :
7864 : : If ARG is not a kind of expression we can handle, return
7865 : : NULL_TREE. */
7866 : :
7867 : : tree
7868 : 229643664 : unary_complex_lvalue (enum tree_code code, tree arg)
7869 : : {
7870 : : /* Inside a template, making these kinds of adjustments is
7871 : : pointless; we are only concerned with the type of the
7872 : : expression. */
7873 : 230005706 : if (processing_template_decl)
7874 : : return NULL_TREE;
7875 : :
7876 : : /* Handle (a, b) used as an "lvalue". */
7877 : 155765998 : if (TREE_CODE (arg) == COMPOUND_EXPR)
7878 : : {
7879 : 362480 : tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 1), false,
7880 : : tf_warning_or_error);
7881 : 362480 : return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
7882 : 724960 : TREE_OPERAND (arg, 0), real_result);
7883 : : }
7884 : :
7885 : : /* Handle (a ? b : c) used as an "lvalue". */
7886 : 155403518 : if (TREE_CODE (arg) == COND_EXPR
7887 : 155312242 : || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
7888 : 91276 : return rationalize_conditional_expr (code, arg, tf_warning_or_error);
7889 : :
7890 : : /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
7891 : 155312242 : if (TREE_CODE (arg) == MODIFY_EXPR
7892 : 154950377 : || TREE_CODE (arg) == PREINCREMENT_EXPR
7893 : 154950293 : || TREE_CODE (arg) == PREDECREMENT_EXPR)
7894 : 362042 : return unary_complex_lvalue (code, genericize_compound_lvalue (arg));
7895 : :
7896 : 154950200 : if (code != ADDR_EXPR)
7897 : : return NULL_TREE;
7898 : :
7899 : : /* Handle (a = b) used as an "lvalue" for `&'. */
7900 : 152102655 : if (TREE_CODE (arg) == MODIFY_EXPR
7901 : 152102655 : || TREE_CODE (arg) == INIT_EXPR)
7902 : : {
7903 : 0 : tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 0), false,
7904 : : tf_warning_or_error);
7905 : 0 : arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
7906 : : arg, real_result);
7907 : 0 : suppress_warning (arg /* What warning? */);
7908 : 0 : return arg;
7909 : : }
7910 : :
7911 : 238883922 : if (FUNC_OR_METHOD_TYPE_P (TREE_TYPE (arg))
7912 : 238882890 : || TREE_CODE (arg) == OFFSET_REF)
7913 : : return NULL_TREE;
7914 : :
7915 : : /* We permit compiler to make function calls returning
7916 : : objects of aggregate type look like lvalues. */
7917 : 86780235 : {
7918 : 86780235 : tree targ = arg;
7919 : :
7920 : 86780235 : if (TREE_CODE (targ) == SAVE_EXPR)
7921 : 0 : targ = TREE_OPERAND (targ, 0);
7922 : :
7923 : 86780235 : if (TREE_CODE (targ) == CALL_EXPR && MAYBE_CLASS_TYPE_P (TREE_TYPE (targ)))
7924 : : {
7925 : 47 : if (TREE_CODE (arg) == SAVE_EXPR)
7926 : : targ = arg;
7927 : : else
7928 : 47 : targ = build_cplus_new (TREE_TYPE (arg), arg, tf_warning_or_error);
7929 : 47 : return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
7930 : : }
7931 : :
7932 : 86780188 : if (TREE_CODE (arg) == SAVE_EXPR && INDIRECT_REF_P (targ))
7933 : 0 : return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
7934 : 0 : TREE_OPERAND (targ, 0), current_function_decl, NULL);
7935 : : }
7936 : :
7937 : : /* Don't let anything else be handled specially. */
7938 : : return NULL_TREE;
7939 : : }
7940 : :
7941 : : /* Mark EXP saying that we need to be able to take the
7942 : : address of it; it should not be allocated in a register.
7943 : : Value is true if successful. ARRAY_REF_P is true if this
7944 : : is for ARRAY_REF construction - in that case we don't want
7945 : : to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
7946 : : it is fine to use ARRAY_REFs for vector subscripts on vector
7947 : : register variables.
7948 : :
7949 : : C++: we do not allow `current_class_ptr' to be addressable. */
7950 : :
7951 : : bool
7952 : 252709850 : cxx_mark_addressable (tree exp, bool array_ref_p)
7953 : : {
7954 : 252709850 : tree x = exp;
7955 : :
7956 : 299211476 : while (1)
7957 : 299211476 : switch (TREE_CODE (x))
7958 : : {
7959 : 22708636 : case VIEW_CONVERT_EXPR:
7960 : 22708636 : if (array_ref_p
7961 : 703116 : && TREE_CODE (TREE_TYPE (x)) == ARRAY_TYPE
7962 : 23246180 : && VECTOR_TYPE_P (TREE_TYPE (TREE_OPERAND (x, 0))))
7963 : : return true;
7964 : 22705732 : x = TREE_OPERAND (x, 0);
7965 : 22705732 : break;
7966 : :
7967 : 23564951 : case COMPONENT_REF:
7968 : 23564951 : if (bitfield_p (x))
7969 : 9 : error ("attempt to take address of bit-field");
7970 : : /* FALLTHRU */
7971 : 23795894 : case ADDR_EXPR:
7972 : 23795894 : case ARRAY_REF:
7973 : 23795894 : case REALPART_EXPR:
7974 : 23795894 : case IMAGPART_EXPR:
7975 : 23795894 : x = TREE_OPERAND (x, 0);
7976 : 23795894 : break;
7977 : :
7978 : 4307863 : case PARM_DECL:
7979 : 4307863 : if (x == current_class_ptr)
7980 : : {
7981 : 18 : error ("cannot take the address of %<this%>, which is an rvalue expression");
7982 : 18 : TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
7983 : 18 : return true;
7984 : : }
7985 : : /* Fall through. */
7986 : :
7987 : 49621078 : case VAR_DECL:
7988 : : /* Caller should not be trying to mark initialized
7989 : : constant fields addressable. */
7990 : 49621078 : gcc_assert (DECL_LANG_SPECIFIC (x) == 0
7991 : : || DECL_IN_AGGR_P (x) == 0
7992 : : || TREE_STATIC (x)
7993 : : || DECL_EXTERNAL (x));
7994 : : /* Fall through. */
7995 : :
7996 : 49774227 : case RESULT_DECL:
7997 : 49774267 : if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
7998 : 49774261 : && !DECL_ARTIFICIAL (x))
7999 : : {
8000 : 22 : if (VAR_P (x) && DECL_HARD_REGISTER (x))
8001 : : {
8002 : 12 : error
8003 : 12 : ("address of explicit register variable %qD requested", x);
8004 : 12 : return false;
8005 : : }
8006 : 10 : else if (extra_warnings)
8007 : 3 : warning
8008 : 3 : (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
8009 : : }
8010 : 49774215 : TREE_ADDRESSABLE (x) = 1;
8011 : 49774215 : return true;
8012 : :
8013 : 121906534 : case CONST_DECL:
8014 : 121906534 : case FUNCTION_DECL:
8015 : 121906534 : TREE_ADDRESSABLE (x) = 1;
8016 : 121906534 : return true;
8017 : :
8018 : 49273 : case CONSTRUCTOR:
8019 : 49273 : TREE_ADDRESSABLE (x) = 1;
8020 : 49273 : return true;
8021 : :
8022 : 11048116 : case TARGET_EXPR:
8023 : 11048116 : TREE_ADDRESSABLE (x) = 1;
8024 : 11048116 : cxx_mark_addressable (TARGET_EXPR_SLOT (x));
8025 : 11048116 : return true;
8026 : :
8027 : : default:
8028 : : return true;
8029 : : }
8030 : : }
8031 : :
8032 : : /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
8033 : :
8034 : : tree
8035 : 5560127 : build_x_conditional_expr (location_t loc, tree ifexp, tree op1, tree op2,
8036 : : tsubst_flags_t complain)
8037 : : {
8038 : 5560127 : tree orig_ifexp = ifexp;
8039 : 5560127 : tree orig_op1 = op1;
8040 : 5560127 : tree orig_op2 = op2;
8041 : 5560127 : tree expr;
8042 : :
8043 : 5560127 : if (processing_template_decl)
8044 : : {
8045 : : /* The standard says that the expression is type-dependent if
8046 : : IFEXP is type-dependent, even though the eventual type of the
8047 : : expression doesn't dependent on IFEXP. */
8048 : 2448767 : if (type_dependent_expression_p (ifexp)
8049 : : /* As a GNU extension, the middle operand may be omitted. */
8050 : 1189979 : || (op1 && type_dependent_expression_p (op1))
8051 : 3231895 : || type_dependent_expression_p (op2))
8052 : 1690330 : return build_min_nt_loc (loc, COND_EXPR, ifexp, op1, op2);
8053 : : }
8054 : :
8055 : 3869797 : expr = build_conditional_expr (loc, ifexp, op1, op2, complain);
8056 : 3869797 : if (processing_template_decl && expr != error_mark_node)
8057 : : {
8058 : 758431 : tree min = build_min_non_dep (COND_EXPR, expr,
8059 : : orig_ifexp, orig_op1, orig_op2);
8060 : 758431 : expr = convert_from_reference (min);
8061 : : }
8062 : : return expr;
8063 : : }
8064 : :
8065 : : /* Given a list of expressions, return a compound expression
8066 : : that performs them all and returns the value of the last of them. */
8067 : :
8068 : : tree
8069 : 28416741 : build_x_compound_expr_from_list (tree list, expr_list_kind exp,
8070 : : tsubst_flags_t complain)
8071 : : {
8072 : 28416741 : tree expr = TREE_VALUE (list);
8073 : :
8074 : 228073 : if (BRACE_ENCLOSED_INITIALIZER_P (expr)
8075 : 28644808 : && !CONSTRUCTOR_IS_DIRECT_INIT (expr))
8076 : : {
8077 : 19 : if (complain & tf_error)
8078 : 38 : pedwarn (cp_expr_loc_or_input_loc (expr), 0,
8079 : : "list-initializer for non-class type must not "
8080 : : "be parenthesized");
8081 : : else
8082 : 0 : return error_mark_node;
8083 : : }
8084 : :
8085 : 28416741 : if (TREE_CHAIN (list))
8086 : : {
8087 : 23 : if (complain & tf_error)
8088 : 14 : switch (exp)
8089 : : {
8090 : 12 : case ELK_INIT:
8091 : 12 : permerror (input_location, "expression list treated as compound "
8092 : : "expression in initializer");
8093 : 12 : break;
8094 : 2 : case ELK_MEM_INIT:
8095 : 2 : permerror (input_location, "expression list treated as compound "
8096 : : "expression in mem-initializer");
8097 : 2 : break;
8098 : 0 : case ELK_FUNC_CAST:
8099 : 0 : permerror (input_location, "expression list treated as compound "
8100 : : "expression in functional cast");
8101 : 0 : break;
8102 : 0 : default:
8103 : 0 : gcc_unreachable ();
8104 : : }
8105 : : else
8106 : 9 : return error_mark_node;
8107 : :
8108 : 28 : for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
8109 : 28 : expr = build_x_compound_expr (EXPR_LOCATION (TREE_VALUE (list)),
8110 : 14 : expr, TREE_VALUE (list), NULL_TREE,
8111 : : complain);
8112 : : }
8113 : :
8114 : : return expr;
8115 : : }
8116 : :
8117 : : /* Like build_x_compound_expr_from_list, but using a VEC. */
8118 : :
8119 : : tree
8120 : 116884 : build_x_compound_expr_from_vec (vec<tree, va_gc> *vec, const char *msg,
8121 : : tsubst_flags_t complain)
8122 : : {
8123 : 116884 : if (vec_safe_is_empty (vec))
8124 : : return NULL_TREE;
8125 : 116884 : else if (vec->length () == 1)
8126 : 116819 : return (*vec)[0];
8127 : : else
8128 : : {
8129 : 65 : tree expr;
8130 : 65 : unsigned int ix;
8131 : 65 : tree t;
8132 : :
8133 : 65 : if (msg != NULL)
8134 : : {
8135 : 5 : if (complain & tf_error)
8136 : 0 : permerror (input_location,
8137 : : "%s expression list treated as compound expression",
8138 : : msg);
8139 : : else
8140 : 5 : return error_mark_node;
8141 : : }
8142 : :
8143 : 60 : expr = (*vec)[0];
8144 : 134 : for (ix = 1; vec->iterate (ix, &t); ++ix)
8145 : 74 : expr = build_x_compound_expr (EXPR_LOCATION (t), expr,
8146 : : t, NULL_TREE, complain);
8147 : :
8148 : : return expr;
8149 : : }
8150 : : }
8151 : :
8152 : : /* Handle overloading of the ',' operator when needed. */
8153 : :
8154 : : tree
8155 : 2491970 : build_x_compound_expr (location_t loc, tree op1, tree op2,
8156 : : tree lookups, tsubst_flags_t complain)
8157 : : {
8158 : 2491970 : tree result;
8159 : 2491970 : tree orig_op1 = op1;
8160 : 2491970 : tree orig_op2 = op2;
8161 : 2491970 : tree overload = NULL_TREE;
8162 : :
8163 : 2491970 : if (processing_template_decl)
8164 : : {
8165 : 2380482 : if (type_dependent_expression_p (op1)
8166 : 2380482 : || type_dependent_expression_p (op2))
8167 : : {
8168 : 2112993 : result = build_min_nt_loc (loc, COMPOUND_EXPR, op1, op2);
8169 : 2112993 : TREE_TYPE (result)
8170 : 2112993 : = build_dependent_operator_type (lookups, COMPOUND_EXPR, false);
8171 : 2112993 : return result;
8172 : : }
8173 : : }
8174 : :
8175 : 378977 : result = build_new_op (loc, COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2,
8176 : : NULL_TREE, lookups, &overload, complain);
8177 : 378977 : if (!result)
8178 : 372100 : result = cp_build_compound_expr (op1, op2, complain);
8179 : :
8180 : 378977 : if (processing_template_decl && result != error_mark_node)
8181 : : {
8182 : 265668 : if (overload != NULL_TREE)
8183 : 52 : return (build_min_non_dep_op_overload
8184 : 52 : (COMPOUND_EXPR, result, overload, orig_op1, orig_op2));
8185 : :
8186 : 265616 : return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
8187 : : }
8188 : :
8189 : : return result;
8190 : : }
8191 : :
8192 : : /* Like cp_build_compound_expr, but for the c-common bits. */
8193 : :
8194 : : tree
8195 : 10263 : build_compound_expr (location_t /*loc*/, tree lhs, tree rhs)
8196 : : {
8197 : 10263 : return cp_build_compound_expr (lhs, rhs, tf_warning_or_error);
8198 : : }
8199 : :
8200 : : /* Build a compound expression. */
8201 : :
8202 : : tree
8203 : 478763 : cp_build_compound_expr (tree lhs, tree rhs, tsubst_flags_t complain)
8204 : : {
8205 : 478763 : lhs = convert_to_void (lhs, ICV_LEFT_OF_COMMA, complain);
8206 : :
8207 : 478763 : if (lhs == error_mark_node || rhs == error_mark_node)
8208 : : return error_mark_node;
8209 : :
8210 : 478760 : if (TREE_CODE (lhs) == EXCESS_PRECISION_EXPR)
8211 : 0 : lhs = TREE_OPERAND (lhs, 0);
8212 : 478760 : tree eptype = NULL_TREE;
8213 : 478760 : if (TREE_CODE (rhs) == EXCESS_PRECISION_EXPR)
8214 : : {
8215 : 3 : eptype = TREE_TYPE (rhs);
8216 : 3 : rhs = TREE_OPERAND (rhs, 0);
8217 : : }
8218 : :
8219 : 478760 : if (TREE_CODE (rhs) == TARGET_EXPR)
8220 : : {
8221 : : /* If the rhs is a TARGET_EXPR, then build the compound
8222 : : expression inside the target_expr's initializer. This
8223 : : helps the compiler to eliminate unnecessary temporaries. */
8224 : 2590 : tree init = TARGET_EXPR_INITIAL (rhs);
8225 : :
8226 : 2590 : init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
8227 : 2590 : TARGET_EXPR_INITIAL (rhs) = init;
8228 : :
8229 : 2590 : if (eptype)
8230 : 0 : rhs = build1 (EXCESS_PRECISION_EXPR, eptype, rhs);
8231 : 2590 : return rhs;
8232 : : }
8233 : :
8234 : 476170 : rhs = resolve_nondeduced_context (rhs, complain);
8235 : :
8236 : 476170 : if (type_unknown_p (rhs))
8237 : : {
8238 : 33 : if (complain & tf_error)
8239 : 51 : error_at (cp_expr_loc_or_input_loc (rhs),
8240 : : "no context to resolve type of %qE", rhs);
8241 : 33 : return error_mark_node;
8242 : : }
8243 : :
8244 : 476137 : tree ret = build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
8245 : 476137 : if (eptype)
8246 : 3 : ret = build1 (EXCESS_PRECISION_EXPR, eptype, ret);
8247 : : return ret;
8248 : : }
8249 : :
8250 : : /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
8251 : : casts away constness. CAST gives the type of cast. Returns true
8252 : : if the cast is ill-formed, false if it is well-formed.
8253 : :
8254 : : ??? This function warns for casting away any qualifier not just
8255 : : const. We would like to specify exactly what qualifiers are casted
8256 : : away.
8257 : : */
8258 : :
8259 : : static bool
8260 : 576151 : check_for_casting_away_constness (location_t loc, tree src_type,
8261 : : tree dest_type, enum tree_code cast,
8262 : : tsubst_flags_t complain)
8263 : : {
8264 : : /* C-style casts are allowed to cast away constness. With
8265 : : WARN_CAST_QUAL, we still want to issue a warning. */
8266 : 576151 : if (cast == CAST_EXPR && !warn_cast_qual)
8267 : : return false;
8268 : :
8269 : 529299 : if (!casts_away_constness (src_type, dest_type, complain))
8270 : : return false;
8271 : :
8272 : 386 : switch (cast)
8273 : : {
8274 : 329 : case CAST_EXPR:
8275 : 329 : if (complain & tf_warning)
8276 : 329 : warning_at (loc, OPT_Wcast_qual,
8277 : : "cast from type %qT to type %qT casts away qualifiers",
8278 : : src_type, dest_type);
8279 : : return false;
8280 : :
8281 : 36 : case STATIC_CAST_EXPR:
8282 : 36 : if (complain & tf_error)
8283 : 24 : error_at (loc, "%<static_cast%> from type %qT to type %qT casts "
8284 : : "away qualifiers",
8285 : : src_type, dest_type);
8286 : : return true;
8287 : :
8288 : 21 : case REINTERPRET_CAST_EXPR:
8289 : 21 : if (complain & tf_error)
8290 : 15 : error_at (loc, "%<reinterpret_cast%> from type %qT to type %qT "
8291 : : "casts away qualifiers",
8292 : : src_type, dest_type);
8293 : : return true;
8294 : :
8295 : 0 : default:
8296 : 0 : gcc_unreachable();
8297 : : }
8298 : : }
8299 : :
8300 : : /* Warns if the cast from expression EXPR to type TYPE is useless. */
8301 : : void
8302 : 41079101 : maybe_warn_about_useless_cast (location_t loc, tree type, tree expr,
8303 : : tsubst_flags_t complain)
8304 : : {
8305 : 41079101 : if (warn_useless_cast
8306 : 152 : && complain & tf_warning)
8307 : : {
8308 : 152 : if (TYPE_REF_P (type)
8309 : 152 : ? ((TYPE_REF_IS_RVALUE (type)
8310 : 86 : ? xvalue_p (expr) : lvalue_p (expr))
8311 : 172 : && same_type_p (TREE_TYPE (expr), TREE_TYPE (type)))
8312 : : /* Don't warn when converting a class object to a non-reference type,
8313 : : because that's a common way to create a temporary. */
8314 : 66 : : (!glvalue_p (expr) && same_type_p (TREE_TYPE (expr), type)))
8315 : 96 : warning_at (loc, OPT_Wuseless_cast,
8316 : : "useless cast to type %q#T", type);
8317 : : }
8318 : 41079101 : }
8319 : :
8320 : : /* Warns if the cast ignores cv-qualifiers on TYPE. */
8321 : : static void
8322 : 41070463 : maybe_warn_about_cast_ignoring_quals (location_t loc, tree type,
8323 : : tsubst_flags_t complain)
8324 : : {
8325 : 41070463 : if (warn_ignored_qualifiers
8326 : 261702 : && complain & tf_warning
8327 : 261360 : && !CLASS_TYPE_P (type)
8328 : 41327419 : && (cp_type_quals (type) & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE)))
8329 : 36 : warning_at (loc, OPT_Wignored_qualifiers,
8330 : : "type qualifiers ignored on cast result type");
8331 : 41070463 : }
8332 : :
8333 : : /* Convert EXPR (an expression with pointer-to-member type) to TYPE
8334 : : (another pointer-to-member type in the same hierarchy) and return
8335 : : the converted expression. If ALLOW_INVERSE_P is permitted, a
8336 : : pointer-to-derived may be converted to pointer-to-base; otherwise,
8337 : : only the other direction is permitted. If C_CAST_P is true, this
8338 : : conversion is taking place as part of a C-style cast. */
8339 : :
8340 : : tree
8341 : 28893 : convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
8342 : : bool c_cast_p, tsubst_flags_t complain)
8343 : : {
8344 : 28893 : if (same_type_p (type, TREE_TYPE (expr)))
8345 : : return expr;
8346 : :
8347 : 28893 : if (TYPE_PTRDATAMEM_P (type))
8348 : : {
8349 : 364 : tree obase = TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr));
8350 : 364 : tree nbase = TYPE_PTRMEM_CLASS_TYPE (type);
8351 : 364 : tree delta = (get_delta_difference
8352 : 364 : (obase, nbase,
8353 : : allow_inverse_p, c_cast_p, complain));
8354 : :
8355 : 364 : if (delta == error_mark_node)
8356 : : return error_mark_node;
8357 : :
8358 : 358 : if (!same_type_p (obase, nbase))
8359 : : {
8360 : 287 : if (TREE_CODE (expr) == PTRMEM_CST)
8361 : 159 : expr = cplus_expand_constant (expr);
8362 : :
8363 : 287 : tree cond = cp_build_binary_op (input_location, EQ_EXPR, expr,
8364 : 287 : build_int_cst (TREE_TYPE (expr), -1),
8365 : : complain);
8366 : 287 : tree op1 = build_nop (ptrdiff_type_node, expr);
8367 : 287 : tree op2 = cp_build_binary_op (input_location, PLUS_EXPR, op1, delta,
8368 : : complain);
8369 : :
8370 : 287 : expr = fold_build3_loc (input_location,
8371 : : COND_EXPR, ptrdiff_type_node, cond, op1, op2);
8372 : : }
8373 : :
8374 : 358 : return build_nop (type, expr);
8375 : : }
8376 : : else
8377 : 28529 : return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
8378 : 28529 : allow_inverse_p, c_cast_p, complain);
8379 : : }
8380 : :
8381 : : /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
8382 : : this static_cast is being attempted as one of the possible casts
8383 : : allowed by a C-style cast. (In that case, accessibility of base
8384 : : classes is not considered, and it is OK to cast away
8385 : : constness.) Return the result of the cast. *VALID_P is set to
8386 : : indicate whether or not the cast was valid. */
8387 : :
8388 : : static tree
8389 : 40812158 : build_static_cast_1 (location_t loc, tree type, tree expr, bool c_cast_p,
8390 : : bool *valid_p, tsubst_flags_t complain)
8391 : : {
8392 : 40812158 : tree intype;
8393 : 40812158 : tree result;
8394 : 40812158 : cp_lvalue_kind clk;
8395 : :
8396 : : /* Assume the cast is valid. */
8397 : 40812158 : *valid_p = true;
8398 : :
8399 : 40812158 : intype = unlowered_expr_type (expr);
8400 : :
8401 : : /* Save casted types in the function's used types hash table. */
8402 : 40812158 : used_types_insert (type);
8403 : :
8404 : : /* A prvalue of non-class type is cv-unqualified. */
8405 : 40812158 : if (!CLASS_TYPE_P (type))
8406 : 39423083 : type = cv_unqualified (type);
8407 : :
8408 : : /* [expr.static.cast]
8409 : :
8410 : : An lvalue of type "cv1 B", where B is a class type, can be cast
8411 : : to type "reference to cv2 D", where D is a class derived (clause
8412 : : _class.derived_) from B, if a valid standard conversion from
8413 : : "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
8414 : : same cv-qualification as, or greater cv-qualification than, cv1,
8415 : : and B is not a virtual base class of D. */
8416 : : /* We check this case before checking the validity of "TYPE t =
8417 : : EXPR;" below because for this case:
8418 : :
8419 : : struct B {};
8420 : : struct D : public B { D(const B&); };
8421 : : extern B& b;
8422 : : void f() { static_cast<const D&>(b); }
8423 : :
8424 : : we want to avoid constructing a new D. The standard is not
8425 : : completely clear about this issue, but our interpretation is
8426 : : consistent with other compilers. */
8427 : 40812158 : if (TYPE_REF_P (type)
8428 : 2855622 : && CLASS_TYPE_P (TREE_TYPE (type))
8429 : 2274975 : && CLASS_TYPE_P (intype)
8430 : 2274960 : && (TYPE_REF_IS_RVALUE (type) || lvalue_p (expr))
8431 : 2274109 : && DERIVED_FROM_P (intype, TREE_TYPE (type))
8432 : 2244301 : && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
8433 : 2244301 : build_pointer_type (TYPE_MAIN_VARIANT
8434 : : (TREE_TYPE (type))),
8435 : : complain)
8436 : 43056459 : && (c_cast_p
8437 : 2244277 : || at_least_as_qualified_p (TREE_TYPE (type), intype)))
8438 : : {
8439 : 2244301 : tree base;
8440 : :
8441 : 2244301 : if (processing_template_decl)
8442 : : return expr;
8443 : :
8444 : : /* There is a standard conversion from "D*" to "B*" even if "B"
8445 : : is ambiguous or inaccessible. If this is really a
8446 : : static_cast, then we check both for inaccessibility and
8447 : : ambiguity. However, if this is a static_cast being performed
8448 : : because the user wrote a C-style cast, then accessibility is
8449 : : not considered. */
8450 : 4153858 : base = lookup_base (TREE_TYPE (type), intype,
8451 : : c_cast_p ? ba_unique : ba_check,
8452 : : NULL, complain);
8453 : 2076941 : expr = cp_build_addr_expr (expr, complain);
8454 : :
8455 : 2076941 : if (sanitize_flags_p (SANITIZE_VPTR))
8456 : : {
8457 : 334 : tree ubsan_check
8458 : 334 : = cp_ubsan_maybe_instrument_downcast (loc, type,
8459 : : intype, expr);
8460 : 334 : if (ubsan_check)
8461 : 2076941 : expr = ubsan_check;
8462 : : }
8463 : :
8464 : : /* Convert from "B*" to "D*". This function will check that "B"
8465 : : is not a virtual base of "D". Even if we don't have a guarantee
8466 : : that expr is NULL, if the static_cast is to a reference type,
8467 : : it is UB if it would be NULL, so omit the non-NULL check. */
8468 : 2076941 : expr = build_base_path (MINUS_EXPR, expr, base,
8469 : : /*nonnull=*/flag_delete_null_pointer_checks,
8470 : : complain);
8471 : :
8472 : : /* Convert the pointer to a reference -- but then remember that
8473 : : there are no expressions with reference type in C++.
8474 : :
8475 : : We call rvalue so that there's an actual tree code
8476 : : (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
8477 : : is a variable with the same type, the conversion would get folded
8478 : : away, leaving just the variable and causing lvalue_kind to give
8479 : : the wrong answer. */
8480 : 2076941 : expr = cp_fold_convert (type, expr);
8481 : :
8482 : : /* When -fsanitize=null, make sure to diagnose reference binding to
8483 : : NULL even when the reference is converted to pointer later on. */
8484 : 2076941 : if (sanitize_flags_p (SANITIZE_NULL)
8485 : 340 : && TREE_CODE (expr) == COND_EXPR
8486 : 6 : && TREE_OPERAND (expr, 2)
8487 : 6 : && TREE_CODE (TREE_OPERAND (expr, 2)) == INTEGER_CST
8488 : 2076947 : && TREE_TYPE (TREE_OPERAND (expr, 2)) == type)
8489 : 6 : ubsan_maybe_instrument_reference (&TREE_OPERAND (expr, 2));
8490 : :
8491 : 2076941 : return convert_from_reference (rvalue (expr));
8492 : : }
8493 : :
8494 : : /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
8495 : : cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
8496 : 38567857 : if (TYPE_REF_P (type)
8497 : 611321 : && TYPE_REF_IS_RVALUE (type)
8498 : 377713 : && (clk = real_lvalue_p (expr))
8499 : 374940 : && reference_compatible_p (TREE_TYPE (type), intype)
8500 : 38942794 : && (c_cast_p || at_least_as_qualified_p (TREE_TYPE (type), intype)))
8501 : : {
8502 : 374937 : if (processing_template_decl)
8503 : : return expr;
8504 : 374722 : if (clk == clk_ordinary)
8505 : : {
8506 : : /* Handle the (non-bit-field) lvalue case here by casting to
8507 : : lvalue reference and then changing it to an rvalue reference.
8508 : : Casting an xvalue to rvalue reference will be handled by the
8509 : : main code path. */
8510 : 374719 : tree lref = cp_build_reference_type (TREE_TYPE (type), false);
8511 : 374719 : result = (perform_direct_initialization_if_possible
8512 : 374719 : (lref, expr, c_cast_p, complain));
8513 : 374719 : result = build1 (NON_LVALUE_EXPR, type, result);
8514 : 374719 : return convert_from_reference (result);
8515 : : }
8516 : : else
8517 : : /* For a bit-field or packed field, bind to a temporary. */
8518 : 3 : expr = rvalue (expr);
8519 : : }
8520 : :
8521 : : /* Resolve overloaded address here rather than once in
8522 : : implicit_conversion and again in the inverse code below. */
8523 : 38192923 : if (TYPE_PTRMEMFUNC_P (type) && type_unknown_p (expr))
8524 : : {
8525 : 18 : expr = instantiate_type (type, expr, complain);
8526 : 18 : intype = TREE_TYPE (expr);
8527 : : }
8528 : :
8529 : : /* [expr.static.cast]
8530 : :
8531 : : Any expression can be explicitly converted to type cv void. */
8532 : 38192923 : if (VOID_TYPE_P (type))
8533 : : {
8534 : 135302 : if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
8535 : 0 : expr = TREE_OPERAND (expr, 0);
8536 : 135302 : return convert_to_void (expr, ICV_CAST, complain);
8537 : : }
8538 : :
8539 : : /* [class.abstract]
8540 : : An abstract class shall not be used ... as the type of an explicit
8541 : : conversion. */
8542 : 38057621 : if (abstract_virtuals_error (ACU_CAST, type, complain))
8543 : 6 : return error_mark_node;
8544 : :
8545 : : /* [expr.static.cast]
8546 : :
8547 : : An expression e can be explicitly converted to a type T using a
8548 : : static_cast of the form static_cast<T>(e) if the declaration T
8549 : : t(e);" is well-formed, for some invented temporary variable
8550 : : t. */
8551 : 38057615 : result = perform_direct_initialization_if_possible (type, expr,
8552 : : c_cast_p, complain);
8553 : : /* P1975 allows static_cast<Aggr>(42), as well as static_cast<T[5]>(42),
8554 : : which initialize the first element of the aggregate. We need to handle
8555 : : the array case specifically. */
8556 : 38057615 : if (result == NULL_TREE
8557 : 3791444 : && cxx_dialect >= cxx20
8558 : 916005 : && TREE_CODE (type) == ARRAY_TYPE)
8559 : : {
8560 : : /* Create { EXPR } and perform direct-initialization from it. */
8561 : 15 : tree e = build_constructor_single (init_list_type_node, NULL_TREE, expr);
8562 : 15 : CONSTRUCTOR_IS_DIRECT_INIT (e) = true;
8563 : 15 : CONSTRUCTOR_IS_PAREN_INIT (e) = true;
8564 : 15 : result = perform_direct_initialization_if_possible (type, e, c_cast_p,
8565 : : complain);
8566 : : }
8567 : 3791444 : if (result)
8568 : : {
8569 : 34266186 : if (processing_template_decl)
8570 : : return expr;
8571 : :
8572 : 33652273 : result = convert_from_reference (result);
8573 : :
8574 : : /* [expr.static.cast]
8575 : :
8576 : : If T is a reference type, the result is an lvalue; otherwise,
8577 : : the result is an rvalue. */
8578 : 33652273 : if (!TYPE_REF_P (type))
8579 : : {
8580 : 33415983 : result = rvalue (result);
8581 : :
8582 : 33415983 : if (result == expr && SCALAR_TYPE_P (type))
8583 : : /* Leave some record of the cast. */
8584 : 1808300 : result = build_nop (type, expr);
8585 : : }
8586 : 33652273 : return result;
8587 : : }
8588 : :
8589 : : /* [expr.static.cast]
8590 : :
8591 : : The inverse of any standard conversion sequence (clause _conv_),
8592 : : other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
8593 : : (_conv.array_), function-to-pointer (_conv.func_), and boolean
8594 : : (_conv.bool_) conversions, can be performed explicitly using
8595 : : static_cast subject to the restriction that the explicit
8596 : : conversion does not cast away constness (_expr.const.cast_), and
8597 : : the following additional rules for specific cases: */
8598 : : /* For reference, the conversions not excluded are: integral
8599 : : promotions, floating-point promotion, integral conversions,
8600 : : floating-point conversions, floating-integral conversions,
8601 : : pointer conversions, and pointer to member conversions. */
8602 : : /* DR 128
8603 : :
8604 : : A value of integral _or enumeration_ type can be explicitly
8605 : : converted to an enumeration type. */
8606 : : /* The effect of all that is that any conversion between any two
8607 : : types which are integral, floating, or enumeration types can be
8608 : : performed. */
8609 : 3791429 : if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type)
8610 : 2191895 : || SCALAR_FLOAT_TYPE_P (type))
8611 : 1734624 : && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype)
8612 : 237733 : || SCALAR_FLOAT_TYPE_P (intype)))
8613 : : {
8614 : 1631969 : if (processing_template_decl)
8615 : : return expr;
8616 : 1545459 : if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
8617 : 0 : expr = TREE_OPERAND (expr, 0);
8618 : : /* [expr.static.cast]: "If the value is not a bit-field, the result
8619 : : refers to the object or the specified base class subobject thereof;
8620 : : otherwise, the lvalue-to-rvalue conversion is applied to the
8621 : : bit-field and the resulting prvalue is used as the operand of the
8622 : : static_cast." There are no prvalue bit-fields; the l-to-r conversion
8623 : : will give us an object of the underlying type of the bit-field. */
8624 : 1545459 : expr = decay_conversion (expr, complain);
8625 : 1545459 : return ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL, complain);
8626 : : }
8627 : :
8628 : 670644 : if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
8629 : 666371 : && CLASS_TYPE_P (TREE_TYPE (type))
8630 : 191975 : && CLASS_TYPE_P (TREE_TYPE (intype))
8631 : 2195722 : && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
8632 : : (TREE_TYPE (intype))),
8633 : 36262 : build_pointer_type (TYPE_MAIN_VARIANT
8634 : : (TREE_TYPE (type))),
8635 : : complain))
8636 : : {
8637 : 35923 : tree base;
8638 : :
8639 : 35923 : if (processing_template_decl)
8640 : : return expr;
8641 : :
8642 : 35905 : if (!c_cast_p
8643 : 35905 : && check_for_casting_away_constness (loc, intype, type,
8644 : : STATIC_CAST_EXPR,
8645 : : complain))
8646 : 6 : return error_mark_node;
8647 : 71256 : base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
8648 : : c_cast_p ? ba_unique : ba_check,
8649 : : NULL, complain);
8650 : 35899 : expr = build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false,
8651 : : complain);
8652 : :
8653 : 35899 : if (sanitize_flags_p (SANITIZE_VPTR))
8654 : : {
8655 : 43 : tree ubsan_check
8656 : 43 : = cp_ubsan_maybe_instrument_downcast (loc, type,
8657 : : intype, expr);
8658 : 43 : if (ubsan_check)
8659 : 35899 : expr = ubsan_check;
8660 : : }
8661 : :
8662 : 35899 : return cp_fold_convert (type, expr);
8663 : : }
8664 : :
8665 : 89 : if ((TYPE_PTRDATAMEM_P (type) && TYPE_PTRDATAMEM_P (intype))
8666 : 2123537 : || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
8667 : : {
8668 : 232 : tree c1;
8669 : 232 : tree c2;
8670 : 232 : tree t1;
8671 : 232 : tree t2;
8672 : :
8673 : 232 : c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
8674 : 232 : c2 = TYPE_PTRMEM_CLASS_TYPE (type);
8675 : :
8676 : 232 : if (TYPE_PTRDATAMEM_P (type))
8677 : : {
8678 : 89 : t1 = (build_ptrmem_type
8679 : 89 : (c1,
8680 : 89 : TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
8681 : 89 : t2 = (build_ptrmem_type
8682 : 89 : (c2,
8683 : 89 : TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
8684 : : }
8685 : : else
8686 : : {
8687 : : t1 = intype;
8688 : : t2 = type;
8689 : : }
8690 : 232 : if (can_convert (t1, t2, complain) || can_convert (t2, t1, complain))
8691 : : {
8692 : 154 : if (!c_cast_p
8693 : 154 : && check_for_casting_away_constness (loc, intype, type,
8694 : : STATIC_CAST_EXPR,
8695 : : complain))
8696 : 9 : return error_mark_node;
8697 : 145 : if (processing_template_decl)
8698 : : return expr;
8699 : 145 : return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
8700 : 145 : c_cast_p, complain);
8701 : : }
8702 : : }
8703 : :
8704 : : /* [expr.static.cast]
8705 : :
8706 : : An rvalue of type "pointer to cv void" can be explicitly
8707 : : converted to a pointer to object type. A value of type pointer
8708 : : to object converted to "pointer to cv void" and back to the
8709 : : original pointer type will have its original value. */
8710 : 2123383 : if (TYPE_PTR_P (intype)
8711 : 731163 : && VOID_TYPE_P (TREE_TYPE (intype))
8712 : 2730397 : && TYPE_PTROB_P (type))
8713 : : {
8714 : 573425 : if (!c_cast_p
8715 : 573425 : && check_for_casting_away_constness (loc, intype, type,
8716 : : STATIC_CAST_EXPR,
8717 : : complain))
8718 : 21 : return error_mark_node;
8719 : 573404 : if (processing_template_decl)
8720 : : return expr;
8721 : 488870 : return build_nop (type, expr);
8722 : : }
8723 : :
8724 : 1549958 : *valid_p = false;
8725 : 1549958 : return error_mark_node;
8726 : : }
8727 : :
8728 : : /* Return an expression representing static_cast<TYPE>(EXPR). */
8729 : :
8730 : : tree
8731 : 11304624 : build_static_cast (location_t loc, tree type, tree oexpr,
8732 : : tsubst_flags_t complain)
8733 : : {
8734 : 11304624 : tree expr = oexpr;
8735 : 11304624 : tree result;
8736 : 11304624 : bool valid_p;
8737 : :
8738 : 11304624 : if (type == error_mark_node || expr == error_mark_node)
8739 : : return error_mark_node;
8740 : :
8741 : 11304573 : bool dependent = (dependent_type_p (type)
8742 : 11304573 : || type_dependent_expression_p (expr));
8743 : 7449804 : if (dependent)
8744 : : {
8745 : 4807356 : tmpl:
8746 : 4807356 : expr = build_min (STATIC_CAST_EXPR, type, oexpr);
8747 : : /* We don't know if it will or will not have side effects. */
8748 : 4807356 : TREE_SIDE_EFFECTS (expr) = 1;
8749 : 4807356 : result = convert_from_reference (expr);
8750 : 4807356 : protected_set_expr_location (result, loc);
8751 : 4807356 : return result;
8752 : : }
8753 : :
8754 : : /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
8755 : : Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
8756 : 7449804 : if (!TYPE_REF_P (type)
8757 : 4594647 : && TREE_CODE (expr) == NOP_EXPR
8758 : 7541248 : && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
8759 : 48 : expr = TREE_OPERAND (expr, 0);
8760 : :
8761 : 7449804 : result = build_static_cast_1 (loc, type, expr, /*c_cast_p=*/false,
8762 : : &valid_p, complain);
8763 : 7449804 : if (valid_p)
8764 : : {
8765 : 7449643 : if (result != error_mark_node)
8766 : : {
8767 : 7449538 : maybe_warn_about_useless_cast (loc, type, expr, complain);
8768 : 7449538 : maybe_warn_about_cast_ignoring_quals (loc, type, complain);
8769 : : }
8770 : 7449643 : if (processing_template_decl)
8771 : 952587 : goto tmpl;
8772 : 6497056 : protected_set_expr_location (result, loc);
8773 : 6497056 : return result;
8774 : : }
8775 : :
8776 : 161 : if (complain & tf_error)
8777 : : {
8778 : 145 : auto_diagnostic_group d;
8779 : 145 : error_at (loc, "invalid %<static_cast%> from type %qT to type %qT",
8780 : 145 : TREE_TYPE (expr), type);
8781 : 145 : if ((TYPE_PTR_P (type) || TYPE_REF_P (type))
8782 : 118 : && CLASS_TYPE_P (TREE_TYPE (type))
8783 : 174 : && !COMPLETE_TYPE_P (TREE_TYPE (type)))
8784 : 17 : inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (TREE_TYPE (type))),
8785 : 17 : "class type %qT is incomplete", TREE_TYPE (type));
8786 : 145 : tree expr_type = TREE_TYPE (expr);
8787 : 145 : if (TYPE_PTR_P (expr_type))
8788 : 36 : expr_type = TREE_TYPE (expr_type);
8789 : 145 : if (CLASS_TYPE_P (expr_type) && !COMPLETE_TYPE_P (expr_type))
8790 : 12 : inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (expr_type)),
8791 : : "class type %qT is incomplete", expr_type);
8792 : 145 : }
8793 : 161 : return error_mark_node;
8794 : : }
8795 : :
8796 : : /* EXPR is an expression with member function or pointer-to-member
8797 : : function type. TYPE is a pointer type. Converting EXPR to TYPE is
8798 : : not permitted by ISO C++, but we accept it in some modes. If we
8799 : : are not in one of those modes, issue a diagnostic. Return the
8800 : : converted expression. */
8801 : :
8802 : : tree
8803 : 197 : convert_member_func_to_ptr (tree type, tree expr, tsubst_flags_t complain)
8804 : : {
8805 : 197 : tree intype;
8806 : 197 : tree decl;
8807 : :
8808 : 197 : intype = TREE_TYPE (expr);
8809 : 197 : gcc_assert (TYPE_PTRMEMFUNC_P (intype)
8810 : : || TREE_CODE (intype) == METHOD_TYPE);
8811 : :
8812 : 197 : if (!(complain & tf_warning_or_error))
8813 : 0 : return error_mark_node;
8814 : :
8815 : 197 : location_t loc = cp_expr_loc_or_input_loc (expr);
8816 : :
8817 : 197 : if (pedantic || warn_pmf2ptr)
8818 : 271 : pedwarn (loc, pedantic ? OPT_Wpedantic : OPT_Wpmf_conversions,
8819 : : "converting from %qH to %qI", intype, type);
8820 : :
8821 : 197 : STRIP_ANY_LOCATION_WRAPPER (expr);
8822 : :
8823 : 197 : if (TREE_CODE (intype) == METHOD_TYPE)
8824 : 88 : expr = build_addr_func (expr, complain);
8825 : 109 : else if (TREE_CODE (expr) == PTRMEM_CST)
8826 : 91 : expr = build_address (PTRMEM_CST_MEMBER (expr));
8827 : : else
8828 : : {
8829 : 18 : decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
8830 : 18 : decl = build_address (decl);
8831 : 18 : expr = get_member_function_from_ptrfunc (&decl, expr, complain);
8832 : : }
8833 : :
8834 : 197 : if (expr == error_mark_node)
8835 : : return error_mark_node;
8836 : :
8837 : 197 : expr = build_nop (type, expr);
8838 : 197 : SET_EXPR_LOCATION (expr, loc);
8839 : 197 : return expr;
8840 : : }
8841 : :
8842 : : /* Build a NOP_EXPR to TYPE, but mark it as a reinterpret_cast so that
8843 : : constexpr evaluation knows to reject it. */
8844 : :
8845 : : static tree
8846 : 91833 : build_nop_reinterpret (tree type, tree expr)
8847 : : {
8848 : 91833 : tree ret = build_nop (type, expr);
8849 : 91833 : if (ret != expr)
8850 : 91833 : REINTERPRET_CAST_P (ret) = true;
8851 : 91833 : return ret;
8852 : : }
8853 : :
8854 : : /* Return a representation for a reinterpret_cast from EXPR to TYPE.
8855 : : If C_CAST_P is true, this reinterpret cast is being done as part of
8856 : : a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
8857 : : indicate whether or not reinterpret_cast was valid. */
8858 : :
8859 : : static tree
8860 : 1667341 : build_reinterpret_cast_1 (location_t loc, tree type, tree expr,
8861 : : bool c_cast_p, bool *valid_p,
8862 : : tsubst_flags_t complain)
8863 : : {
8864 : 1667341 : tree intype;
8865 : :
8866 : : /* Assume the cast is invalid. */
8867 : 1667341 : if (valid_p)
8868 : 1549853 : *valid_p = true;
8869 : :
8870 : 1667341 : if (type == error_mark_node || error_operand_p (expr))
8871 : : return error_mark_node;
8872 : :
8873 : 1667341 : intype = TREE_TYPE (expr);
8874 : :
8875 : : /* Save casted types in the function's used types hash table. */
8876 : 1667341 : used_types_insert (type);
8877 : :
8878 : : /* A prvalue of non-class type is cv-unqualified. */
8879 : 1667341 : if (!CLASS_TYPE_P (type))
8880 : 1667332 : type = cv_unqualified (type);
8881 : :
8882 : : /* [expr.reinterpret.cast]
8883 : : A glvalue of type T1, designating an object x, can be cast to the type
8884 : : "reference to T2" if an expression of type "pointer to T1" can be
8885 : : explicitly converted to the type "pointer to T2" using a reinterpret_cast.
8886 : : The result is that of *reinterpret_cast<T2 *>(p) where p is a pointer to x
8887 : : of type "pointer to T1". No temporary is created, no copy is made, and no
8888 : : constructors (11.4.4) or conversion functions (11.4.7) are called. */
8889 : 1667341 : if (TYPE_REF_P (type))
8890 : : {
8891 : 11906 : if (!glvalue_p (expr))
8892 : : {
8893 : 9 : if (complain & tf_error)
8894 : 9 : error_at (loc, "invalid cast of a prvalue expression of type "
8895 : : "%qT to type %qT",
8896 : : intype, type);
8897 : 9 : return error_mark_node;
8898 : : }
8899 : :
8900 : : /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
8901 : : "B" are related class types; the reinterpret_cast does not
8902 : : adjust the pointer. */
8903 : 11897 : if (TYPE_PTR_P (intype)
8904 : 3 : && (complain & tf_warning)
8905 : 11900 : && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
8906 : : COMPARE_BASE | COMPARE_DERIVED)))
8907 : 3 : warning_at (loc, 0, "casting %qT to %qT does not dereference pointer",
8908 : : intype, type);
8909 : :
8910 : 11897 : expr = cp_build_addr_expr (expr, complain);
8911 : :
8912 : 11897 : if (warn_strict_aliasing > 2)
8913 : 80 : cp_strict_aliasing_warning (EXPR_LOCATION (expr), type, expr);
8914 : :
8915 : 11897 : if (expr != error_mark_node)
8916 : 11897 : expr = build_reinterpret_cast_1
8917 : 11897 : (loc, build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
8918 : : valid_p, complain);
8919 : 11897 : if (expr != error_mark_node)
8920 : : /* cp_build_indirect_ref isn't right for rvalue refs. */
8921 : 11894 : expr = convert_from_reference (fold_convert (type, expr));
8922 : 11897 : return expr;
8923 : : }
8924 : :
8925 : : /* As a G++ extension, we consider conversions from member
8926 : : functions, and pointers to member functions to
8927 : : pointer-to-function and pointer-to-void types. If
8928 : : -Wno-pmf-conversions has not been specified,
8929 : : convert_member_func_to_ptr will issue an error message. */
8930 : 264 : if ((TYPE_PTRMEMFUNC_P (intype)
8931 : 1655247 : || TREE_CODE (intype) == METHOD_TYPE)
8932 : 276 : && TYPE_PTR_P (type)
8933 : 1655632 : && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
8934 : 155 : || VOID_TYPE_P (TREE_TYPE (type))))
8935 : 188 : return convert_member_func_to_ptr (type, expr, complain);
8936 : :
8937 : : /* If the cast is not to a reference type, the lvalue-to-rvalue,
8938 : : array-to-pointer, and function-to-pointer conversions are
8939 : : performed. */
8940 : 1655247 : expr = decay_conversion (expr, complain);
8941 : :
8942 : : /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
8943 : : Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
8944 : 1655247 : if (TREE_CODE (expr) == NOP_EXPR
8945 : 1655247 : && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
8946 : 31 : expr = TREE_OPERAND (expr, 0);
8947 : :
8948 : 1655247 : if (error_operand_p (expr))
8949 : 30 : return error_mark_node;
8950 : :
8951 : 1655217 : intype = TREE_TYPE (expr);
8952 : :
8953 : : /* [expr.reinterpret.cast]
8954 : : A pointer can be converted to any integral type large enough to
8955 : : hold it. ... A value of type std::nullptr_t can be converted to
8956 : : an integral type; the conversion has the same meaning and
8957 : : validity as a conversion of (void*)0 to the integral type. */
8958 : 1655217 : if (CP_INTEGRAL_TYPE_P (type)
8959 : 139817 : && (TYPE_PTR_P (intype) || NULLPTR_TYPE_P (intype)))
8960 : : {
8961 : 138098 : if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
8962 : : {
8963 : 21 : if (complain & tf_error)
8964 : 15 : permerror (loc, "cast from %qH to %qI loses precision",
8965 : : intype, type);
8966 : : else
8967 : 6 : return error_mark_node;
8968 : : }
8969 : 138092 : if (NULLPTR_TYPE_P (intype))
8970 : 98 : return build_int_cst (type, 0);
8971 : : }
8972 : : /* [expr.reinterpret.cast]
8973 : : A value of integral or enumeration type can be explicitly
8974 : : converted to a pointer. */
8975 : 1517119 : else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
8976 : : /* OK */
8977 : : ;
8978 : 1482369 : else if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type)
8979 : 1480635 : || TYPE_PTR_OR_PTRMEM_P (type))
8980 : 1576750 : && same_type_p (type, intype))
8981 : : /* DR 799 */
8982 : 2516 : return rvalue (expr);
8983 : 1479853 : else if (TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
8984 : : {
8985 : 5452 : if ((complain & tf_warning)
8986 : 10904 : && !cxx_safe_function_type_cast_p (TREE_TYPE (type),
8987 : 5452 : TREE_TYPE (intype)))
8988 : 145 : warning_at (loc, OPT_Wcast_function_type,
8989 : : "cast between incompatible function types"
8990 : : " from %qH to %qI", intype, type);
8991 : 5452 : return build_nop_reinterpret (type, expr);
8992 : : }
8993 : 1474401 : else if (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype))
8994 : : {
8995 : 79 : if ((complain & tf_warning)
8996 : 158 : && !cxx_safe_function_type_cast_p
8997 : 79 : (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (type)),
8998 : 79 : TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (intype))))
8999 : 52 : warning_at (loc, OPT_Wcast_function_type,
9000 : : "cast between incompatible pointer to member types"
9001 : : " from %qH to %qI", intype, type);
9002 : 79 : return build_nop_reinterpret (type, expr);
9003 : : }
9004 : 21 : else if ((TYPE_PTRDATAMEM_P (type) && TYPE_PTRDATAMEM_P (intype))
9005 : 1474322 : || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
9006 : : {
9007 : 86047 : if (!c_cast_p
9008 : 86047 : && check_for_casting_away_constness (loc, intype, type,
9009 : : REINTERPRET_CAST_EXPR,
9010 : : complain))
9011 : 21 : return error_mark_node;
9012 : : /* Warn about possible alignment problems. */
9013 : 86026 : if ((STRICT_ALIGNMENT || warn_cast_align == 2)
9014 : 24 : && (complain & tf_warning)
9015 : 24 : && !VOID_TYPE_P (type)
9016 : 24 : && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
9017 : 24 : && COMPLETE_TYPE_P (TREE_TYPE (type))
9018 : 24 : && COMPLETE_TYPE_P (TREE_TYPE (intype))
9019 : 86074 : && min_align_of_type (TREE_TYPE (type))
9020 : 24 : > min_align_of_type (TREE_TYPE (intype)))
9021 : 18 : warning_at (loc, OPT_Wcast_align, "cast from %qH to %qI "
9022 : : "increases required alignment of target type",
9023 : : intype, type);
9024 : :
9025 : 86026 : if (warn_strict_aliasing <= 2)
9026 : : /* strict_aliasing_warning STRIP_NOPs its expr. */
9027 : 74547 : cp_strict_aliasing_warning (EXPR_LOCATION (expr), type, expr);
9028 : :
9029 : 86026 : return build_nop_reinterpret (type, expr);
9030 : : }
9031 : 297 : else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
9032 : 1388435 : || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
9033 : : {
9034 : 276 : if (complain & tf_warning)
9035 : : /* C++11 5.2.10 p8 says that "Converting a function pointer to an
9036 : : object pointer type or vice versa is conditionally-supported." */
9037 : 276 : warning_at (loc, OPT_Wconditionally_supported,
9038 : : "casting between pointer-to-function and "
9039 : : "pointer-to-object is conditionally-supported");
9040 : 276 : return build_nop_reinterpret (type, expr);
9041 : : }
9042 : 1387999 : else if (gnu_vector_type_p (type) && scalarish_type_p (intype))
9043 : 1386230 : return convert_to_vector (type, rvalue (expr));
9044 : 1769 : else if (gnu_vector_type_p (intype)
9045 : 1769 : && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
9046 : 1669 : return convert_to_integer_nofold (type, expr);
9047 : : else
9048 : : {
9049 : 100 : if (valid_p)
9050 : 82 : *valid_p = false;
9051 : 100 : if (complain & tf_error)
9052 : 91 : error_at (loc, "invalid cast from type %qT to type %qT",
9053 : : intype, type);
9054 : 100 : return error_mark_node;
9055 : : }
9056 : :
9057 : 172744 : expr = cp_convert (type, expr, complain);
9058 : 172744 : if (TREE_CODE (expr) == NOP_EXPR)
9059 : : /* Mark any nop_expr that created as a reintepret_cast. */
9060 : 0 : REINTERPRET_CAST_P (expr) = true;
9061 : : return expr;
9062 : : }
9063 : :
9064 : : tree
9065 : 514805 : build_reinterpret_cast (location_t loc, tree type, tree expr,
9066 : : tsubst_flags_t complain)
9067 : : {
9068 : 514805 : tree r;
9069 : :
9070 : 514805 : if (type == error_mark_node || expr == error_mark_node)
9071 : : return error_mark_node;
9072 : :
9073 : 514798 : if (processing_template_decl)
9074 : : {
9075 : 409151 : tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
9076 : :
9077 : 409151 : if (!TREE_SIDE_EFFECTS (t)
9078 : 409151 : && type_dependent_expression_p (expr))
9079 : : /* There might turn out to be side effects inside expr. */
9080 : 181370 : TREE_SIDE_EFFECTS (t) = 1;
9081 : 409151 : r = convert_from_reference (t);
9082 : 409151 : protected_set_expr_location (r, loc);
9083 : 409151 : return r;
9084 : : }
9085 : :
9086 : 105647 : r = build_reinterpret_cast_1 (loc, type, expr, /*c_cast_p=*/false,
9087 : : /*valid_p=*/NULL, complain);
9088 : 105647 : if (r != error_mark_node)
9089 : : {
9090 : 105584 : maybe_warn_about_useless_cast (loc, type, expr, complain);
9091 : 105584 : maybe_warn_about_cast_ignoring_quals (loc, type, complain);
9092 : : }
9093 : 105647 : protected_set_expr_location (r, loc);
9094 : 105647 : return r;
9095 : : }
9096 : :
9097 : : /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
9098 : : return an appropriate expression. Otherwise, return
9099 : : error_mark_node. If the cast is not valid, and COMPLAIN is true,
9100 : : then a diagnostic will be issued. If VALID_P is non-NULL, we are
9101 : : performing a C-style cast, its value upon return will indicate
9102 : : whether or not the conversion succeeded. */
9103 : :
9104 : : static tree
9105 : 33515715 : build_const_cast_1 (location_t loc, tree dst_type, tree expr,
9106 : : tsubst_flags_t complain, bool *valid_p)
9107 : : {
9108 : 33515715 : tree src_type;
9109 : 33515715 : tree reference_type;
9110 : :
9111 : : /* Callers are responsible for handling error_mark_node as a
9112 : : destination type. */
9113 : 33515715 : gcc_assert (dst_type != error_mark_node);
9114 : : /* In a template, callers should be building syntactic
9115 : : representations of casts, not using this machinery. */
9116 : 33515715 : gcc_assert (!processing_template_decl);
9117 : :
9118 : : /* Assume the conversion is invalid. */
9119 : 33515715 : if (valid_p)
9120 : 33396858 : *valid_p = false;
9121 : :
9122 : 33515715 : if (!INDIRECT_TYPE_P (dst_type) && !TYPE_PTRDATAMEM_P (dst_type))
9123 : : {
9124 : 33008488 : if (complain & tf_error)
9125 : 9 : error_at (loc, "invalid use of %<const_cast%> with type %qT, "
9126 : : "which is not a pointer, reference, "
9127 : : "nor a pointer-to-data-member type", dst_type);
9128 : 33008488 : return error_mark_node;
9129 : : }
9130 : :
9131 : 507227 : if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
9132 : : {
9133 : 3946 : if (complain & tf_error)
9134 : 6 : error_at (loc, "invalid use of %<const_cast%> with type %qT, "
9135 : : "which is a pointer or reference to a function type",
9136 : : dst_type);
9137 : 3946 : return error_mark_node;
9138 : : }
9139 : :
9140 : : /* A prvalue of non-class type is cv-unqualified. */
9141 : 503281 : dst_type = cv_unqualified (dst_type);
9142 : :
9143 : : /* Save casted types in the function's used types hash table. */
9144 : 503281 : used_types_insert (dst_type);
9145 : :
9146 : 503281 : src_type = TREE_TYPE (expr);
9147 : : /* Expressions do not really have reference types. */
9148 : 503281 : if (TYPE_REF_P (src_type))
9149 : 0 : src_type = TREE_TYPE (src_type);
9150 : :
9151 : : /* [expr.const.cast]
9152 : :
9153 : : For two object types T1 and T2, if a pointer to T1 can be explicitly
9154 : : converted to the type "pointer to T2" using a const_cast, then the
9155 : : following conversions can also be made:
9156 : :
9157 : : -- an lvalue of type T1 can be explicitly converted to an lvalue of
9158 : : type T2 using the cast const_cast<T2&>;
9159 : :
9160 : : -- a glvalue of type T1 can be explicitly converted to an xvalue of
9161 : : type T2 using the cast const_cast<T2&&>; and
9162 : :
9163 : : -- if T1 is a class type, a prvalue of type T1 can be explicitly
9164 : : converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
9165 : :
9166 : 503281 : if (TYPE_REF_P (dst_type))
9167 : : {
9168 : 52672 : reference_type = dst_type;
9169 : 52672 : if (!TYPE_REF_IS_RVALUE (dst_type)
9170 : 52672 : ? lvalue_p (expr)
9171 : 534 : : obvalue_p (expr))
9172 : : /* OK. */;
9173 : : else
9174 : : {
9175 : 35 : if (complain & tf_error)
9176 : 9 : error_at (loc, "invalid %<const_cast%> of an rvalue of type %qT "
9177 : : "to type %qT",
9178 : : src_type, dst_type);
9179 : 35 : return error_mark_node;
9180 : : }
9181 : 52637 : dst_type = build_pointer_type (TREE_TYPE (dst_type));
9182 : 52637 : src_type = build_pointer_type (src_type);
9183 : : }
9184 : : else
9185 : : {
9186 : 450609 : reference_type = NULL_TREE;
9187 : : /* If the destination type is not a reference type, the
9188 : : lvalue-to-rvalue, array-to-pointer, and function-to-pointer
9189 : : conversions are performed. */
9190 : 450609 : src_type = type_decays_to (src_type);
9191 : 450609 : if (src_type == error_mark_node)
9192 : : return error_mark_node;
9193 : : }
9194 : :
9195 : 503246 : if (TYPE_PTR_P (src_type) || TYPE_PTRDATAMEM_P (src_type))
9196 : : {
9197 : 367830 : if (comp_ptr_ttypes_const (dst_type, src_type, bounds_none))
9198 : : {
9199 : 153283 : if (valid_p)
9200 : : {
9201 : 34504 : *valid_p = true;
9202 : : /* This cast is actually a C-style cast. Issue a warning if
9203 : : the user is making a potentially unsafe cast. */
9204 : 34504 : check_for_casting_away_constness (loc, src_type, dst_type,
9205 : : CAST_EXPR, complain);
9206 : : /* ??? comp_ptr_ttypes_const ignores TYPE_ALIGN. */
9207 : 34504 : if ((STRICT_ALIGNMENT || warn_cast_align == 2)
9208 : 3 : && (complain & tf_warning)
9209 : 34510 : && min_align_of_type (TREE_TYPE (dst_type))
9210 : 3 : > min_align_of_type (TREE_TYPE (src_type)))
9211 : 3 : warning_at (loc, OPT_Wcast_align, "cast from %qH to %qI "
9212 : : "increases required alignment of target type",
9213 : : src_type, dst_type);
9214 : : }
9215 : 153283 : if (reference_type)
9216 : : {
9217 : 52200 : expr = cp_build_addr_expr (expr, complain);
9218 : 52200 : if (expr == error_mark_node)
9219 : : return error_mark_node;
9220 : 52182 : expr = build_nop (reference_type, expr);
9221 : 52182 : return convert_from_reference (expr);
9222 : : }
9223 : : else
9224 : : {
9225 : 101083 : expr = decay_conversion (expr, complain);
9226 : 101083 : if (expr == error_mark_node)
9227 : : return error_mark_node;
9228 : :
9229 : : /* build_c_cast puts on a NOP_EXPR to make the result not an
9230 : : lvalue. Strip such NOP_EXPRs if VALUE is being used in
9231 : : non-lvalue context. */
9232 : 101083 : if (TREE_CODE (expr) == NOP_EXPR
9233 : 101083 : && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
9234 : 3 : expr = TREE_OPERAND (expr, 0);
9235 : 101083 : return build_nop (dst_type, expr);
9236 : : }
9237 : : }
9238 : 214547 : else if (valid_p
9239 : 429046 : && !at_least_as_qualified_p (TREE_TYPE (dst_type),
9240 : 214499 : TREE_TYPE (src_type)))
9241 : 12786 : check_for_casting_away_constness (loc, src_type, dst_type,
9242 : : CAST_EXPR, complain);
9243 : : }
9244 : :
9245 : 349963 : if (complain & tf_error)
9246 : 30 : error_at (loc, "invalid %<const_cast%> from type %qT to type %qT",
9247 : : src_type, dst_type);
9248 : 349963 : return error_mark_node;
9249 : : }
9250 : :
9251 : : tree
9252 : 503221 : build_const_cast (location_t loc, tree type, tree expr,
9253 : : tsubst_flags_t complain)
9254 : : {
9255 : 503221 : tree r;
9256 : :
9257 : 503221 : if (type == error_mark_node || error_operand_p (expr))
9258 : : return error_mark_node;
9259 : :
9260 : 503213 : if (processing_template_decl)
9261 : : {
9262 : 384356 : tree t = build_min (CONST_CAST_EXPR, type, expr);
9263 : :
9264 : 384356 : if (!TREE_SIDE_EFFECTS (t)
9265 : 384356 : && type_dependent_expression_p (expr))
9266 : : /* There might turn out to be side effects inside expr. */
9267 : 300889 : TREE_SIDE_EFFECTS (t) = 1;
9268 : 384356 : r = convert_from_reference (t);
9269 : 384356 : protected_set_expr_location (r, loc);
9270 : 384356 : return r;
9271 : : }
9272 : :
9273 : 118857 : r = build_const_cast_1 (loc, type, expr, complain, /*valid_p=*/NULL);
9274 : 118857 : if (r != error_mark_node)
9275 : : {
9276 : 118779 : maybe_warn_about_useless_cast (loc, type, expr, complain);
9277 : 118779 : maybe_warn_about_cast_ignoring_quals (loc, type, complain);
9278 : : }
9279 : 118857 : protected_set_expr_location (r, loc);
9280 : 118857 : return r;
9281 : : }
9282 : :
9283 : : /* Like cp_build_c_cast, but for the c-common bits. */
9284 : :
9285 : : tree
9286 : 0 : build_c_cast (location_t loc, tree type, tree expr)
9287 : : {
9288 : 0 : return cp_build_c_cast (loc, type, expr, tf_warning_or_error);
9289 : : }
9290 : :
9291 : : /* Like the "build_c_cast" used for c-common, but using cp_expr to
9292 : : preserve location information even for tree nodes that don't
9293 : : support it. */
9294 : :
9295 : : cp_expr
9296 : 8292580 : build_c_cast (location_t loc, tree type, cp_expr expr)
9297 : : {
9298 : 8292580 : cp_expr result = cp_build_c_cast (loc, type, expr, tf_warning_or_error);
9299 : 8292580 : result.set_location (loc);
9300 : 8292580 : return result;
9301 : : }
9302 : :
9303 : : /* Build an expression representing an explicit C-style cast to type
9304 : : TYPE of expression EXPR. */
9305 : :
9306 : : tree
9307 : 35057763 : cp_build_c_cast (location_t loc, tree type, tree expr,
9308 : : tsubst_flags_t complain)
9309 : : {
9310 : 35057763 : tree value = expr;
9311 : 35057763 : tree result;
9312 : 35057763 : bool valid_p;
9313 : :
9314 : 35057763 : if (type == error_mark_node || error_operand_p (expr))
9315 : : return error_mark_node;
9316 : :
9317 : 35057607 : if (processing_template_decl)
9318 : : {
9319 : 1660740 : tree t = build_min (CAST_EXPR, type,
9320 : : tree_cons (NULL_TREE, value, NULL_TREE));
9321 : : /* We don't know if it will or will not have side effects. */
9322 : 1660740 : TREE_SIDE_EFFECTS (t) = 1;
9323 : 1660740 : return convert_from_reference (t);
9324 : : }
9325 : :
9326 : : /* Casts to a (pointer to a) specific ObjC class (or 'id' or
9327 : : 'Class') should always be retained, because this information aids
9328 : : in method lookup. */
9329 : 33396867 : if (objc_is_object_ptr (type)
9330 : 33396867 : && objc_is_object_ptr (TREE_TYPE (expr)))
9331 : 0 : return build_nop (type, expr);
9332 : :
9333 : : /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
9334 : : Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
9335 : 33396867 : if (!TYPE_REF_P (type)
9336 : 33396083 : && TREE_CODE (value) == NOP_EXPR
9337 : 33595118 : && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
9338 : 61209 : value = TREE_OPERAND (value, 0);
9339 : :
9340 : 33396867 : if (TREE_CODE (type) == ARRAY_TYPE)
9341 : : {
9342 : : /* Allow casting from T1* to T2[] because Cfront allows it.
9343 : : NIHCL uses it. It is not valid ISO C++ however. */
9344 : 3 : if (TYPE_PTR_P (TREE_TYPE (expr)))
9345 : : {
9346 : 0 : if (complain & tf_error)
9347 : 0 : permerror (loc, "ISO C++ forbids casting to an array type %qT",
9348 : : type);
9349 : : else
9350 : 0 : return error_mark_node;
9351 : 0 : type = build_pointer_type (TREE_TYPE (type));
9352 : : }
9353 : : else
9354 : : {
9355 : 3 : if (complain & tf_error)
9356 : 3 : error_at (loc, "ISO C++ forbids casting to an array type %qT",
9357 : : type);
9358 : 3 : return error_mark_node;
9359 : : }
9360 : : }
9361 : :
9362 : 33396864 : if (FUNC_OR_METHOD_TYPE_P (type))
9363 : : {
9364 : 15 : if (complain & tf_error)
9365 : 15 : error_at (loc, "invalid cast to function type %qT", type);
9366 : 15 : return error_mark_node;
9367 : : }
9368 : :
9369 : 33396849 : if (TYPE_PTR_P (type)
9370 : 387451 : && TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
9371 : : /* Casting to an integer of smaller size is an error detected elsewhere. */
9372 : 133899 : && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (value))
9373 : : /* Don't warn about converting any constant. */
9374 : 33477129 : && !TREE_CONSTANT (value))
9375 : 47 : warning_at (loc, OPT_Wint_to_pointer_cast,
9376 : : "cast to pointer from integer of different size");
9377 : :
9378 : : /* A C-style cast can be a const_cast. */
9379 : 33396849 : result = build_const_cast_1 (loc, type, value, complain & tf_warning,
9380 : : &valid_p);
9381 : 33396849 : if (valid_p)
9382 : : {
9383 : 34495 : if (result != error_mark_node)
9384 : : {
9385 : 34486 : maybe_warn_about_useless_cast (loc, type, value, complain);
9386 : 34486 : maybe_warn_about_cast_ignoring_quals (loc, type, complain);
9387 : : }
9388 : 9 : else if (complain & tf_error)
9389 : 9 : build_const_cast_1 (loc, type, value, tf_error, &valid_p);
9390 : 34495 : return result;
9391 : : }
9392 : :
9393 : : /* Or a static cast. */
9394 : 33362354 : result = build_static_cast_1 (loc, type, value, /*c_cast_p=*/true,
9395 : : &valid_p, complain);
9396 : : /* Or a reinterpret_cast. */
9397 : 33362354 : if (!valid_p)
9398 : 1549797 : result = build_reinterpret_cast_1 (loc, type, value, /*c_cast_p=*/true,
9399 : : &valid_p, complain);
9400 : : /* The static_cast or reinterpret_cast may be followed by a
9401 : : const_cast. */
9402 : 33362354 : if (valid_p
9403 : : /* A valid cast may result in errors if, for example, a
9404 : : conversion to an ambiguous base class is required. */
9405 : 33362354 : && !error_operand_p (result))
9406 : : {
9407 : 33362076 : tree result_type;
9408 : :
9409 : 33362076 : maybe_warn_about_useless_cast (loc, type, value, complain);
9410 : 33362076 : maybe_warn_about_cast_ignoring_quals (loc, type, complain);
9411 : :
9412 : : /* Non-class rvalues always have cv-unqualified type. */
9413 : 33362076 : if (!CLASS_TYPE_P (type))
9414 : 32124886 : type = TYPE_MAIN_VARIANT (type);
9415 : 33362076 : result_type = TREE_TYPE (result);
9416 : 33362076 : if (!CLASS_TYPE_P (result_type) && !TYPE_REF_P (type))
9417 : 32124427 : result_type = TYPE_MAIN_VARIANT (result_type);
9418 : : /* If the type of RESULT does not match TYPE, perform a
9419 : : const_cast to make it match. If the static_cast or
9420 : : reinterpret_cast succeeded, we will differ by at most
9421 : : cv-qualification, so the follow-on const_cast is guaranteed
9422 : : to succeed. */
9423 : 33362076 : if (!same_type_p (non_reference (type), non_reference (result_type)))
9424 : : {
9425 : 0 : result = build_const_cast_1 (loc, type, result, tf_none, &valid_p);
9426 : 0 : gcc_assert (valid_p);
9427 : : }
9428 : 33362076 : return result;
9429 : : }
9430 : :
9431 : 278 : return error_mark_node;
9432 : : }
9433 : :
9434 : : /* Warn when a value is moved to itself with std::move. LHS is the target,
9435 : : RHS may be the std::move call, and LOC is the location of the whole
9436 : : assignment. Return true if we warned. */
9437 : :
9438 : : bool
9439 : 22768022 : maybe_warn_self_move (location_t loc, tree lhs, tree rhs)
9440 : : {
9441 : 22768022 : if (!warn_self_move)
9442 : : return false;
9443 : :
9444 : : /* C++98 doesn't know move. */
9445 : 336194 : if (cxx_dialect < cxx11)
9446 : : return false;
9447 : :
9448 : 316543 : if (processing_template_decl)
9449 : : return false;
9450 : :
9451 : 19231 : if (!REFERENCE_REF_P (rhs)
9452 : 271230 : || TREE_CODE (TREE_OPERAND (rhs, 0)) != CALL_EXPR)
9453 : : return false;
9454 : 3999 : tree fn = TREE_OPERAND (rhs, 0);
9455 : 3999 : if (!is_std_move_p (fn))
9456 : : return false;
9457 : :
9458 : : /* Just a little helper to strip * and various NOPs. */
9459 : 5757 : auto extract_op = [] (tree &op) {
9460 : 3838 : STRIP_NOPS (op);
9461 : 5055 : while (INDIRECT_REF_P (op))
9462 : 1217 : op = TREE_OPERAND (op, 0);
9463 : 3838 : op = maybe_undo_parenthesized_ref (op);
9464 : 3838 : STRIP_ANY_LOCATION_WRAPPER (op);
9465 : 3838 : };
9466 : :
9467 : 1919 : tree arg = CALL_EXPR_ARG (fn, 0);
9468 : 1919 : extract_op (arg);
9469 : 1919 : if (TREE_CODE (arg) == ADDR_EXPR)
9470 : 1201 : arg = TREE_OPERAND (arg, 0);
9471 : 1919 : tree type = TREE_TYPE (lhs);
9472 : 1919 : tree orig_lhs = lhs;
9473 : 1919 : extract_op (lhs);
9474 : 1919 : if (cp_tree_equal (lhs, arg)
9475 : : /* Also warn in a member-initializer-list, as in : i(std::move(i)). */
9476 : 1919 : || (TREE_CODE (lhs) == FIELD_DECL
9477 : 520 : && TREE_CODE (arg) == COMPONENT_REF
9478 : 314 : && cp_tree_equal (TREE_OPERAND (arg, 0), current_class_ref)
9479 : 6 : && TREE_OPERAND (arg, 1) == lhs))
9480 : 117 : if (warning_at (loc, OPT_Wself_move,
9481 : : "moving %qE of type %qT to itself", orig_lhs, type))
9482 : : return true;
9483 : :
9484 : : return false;
9485 : : }
9486 : :
9487 : : /* For use from the C common bits. */
9488 : : tree
9489 : 4825 : build_modify_expr (location_t location,
9490 : : tree lhs, tree /*lhs_origtype*/,
9491 : : enum tree_code modifycode,
9492 : : location_t /*rhs_location*/, tree rhs,
9493 : : tree /*rhs_origtype*/)
9494 : : {
9495 : 4825 : return cp_build_modify_expr (location, lhs, modifycode, rhs,
9496 : 4825 : tf_warning_or_error);
9497 : : }
9498 : :
9499 : : /* Build an assignment expression of lvalue LHS from value RHS.
9500 : : MODIFYCODE is the code for a binary operator that we use
9501 : : to combine the old value of LHS with RHS to get the new value.
9502 : : Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
9503 : :
9504 : : C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
9505 : :
9506 : : tree
9507 : 29671439 : cp_build_modify_expr (location_t loc, tree lhs, enum tree_code modifycode,
9508 : : tree rhs, tsubst_flags_t complain)
9509 : : {
9510 : 29671439 : lhs = mark_lvalue_use_nonread (lhs);
9511 : :
9512 : 29671439 : tree result = NULL_TREE;
9513 : 29671439 : tree newrhs = rhs;
9514 : 29671439 : tree lhstype = TREE_TYPE (lhs);
9515 : 29671439 : tree olhs = lhs;
9516 : 29671439 : tree olhstype = lhstype;
9517 : 29671439 : bool plain_assign = (modifycode == NOP_EXPR);
9518 : 29671439 : bool compound_side_effects_p = false;
9519 : 29671439 : tree preeval = NULL_TREE;
9520 : :
9521 : : /* Avoid duplicate error messages from operands that had errors. */
9522 : 29671439 : if (error_operand_p (lhs) || error_operand_p (rhs))
9523 : 20 : return error_mark_node;
9524 : :
9525 : 29671498 : while (TREE_CODE (lhs) == COMPOUND_EXPR)
9526 : : {
9527 : 79 : if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
9528 : 67 : compound_side_effects_p = true;
9529 : 79 : lhs = TREE_OPERAND (lhs, 1);
9530 : : }
9531 : :
9532 : : /* Handle control structure constructs used as "lvalues". Note that we
9533 : : leave COMPOUND_EXPR on the LHS because it is sequenced after the RHS. */
9534 : 29671419 : switch (TREE_CODE (lhs))
9535 : : {
9536 : : /* Handle --foo = 5; as these are valid constructs in C++. */
9537 : 21 : case PREDECREMENT_EXPR:
9538 : 21 : case PREINCREMENT_EXPR:
9539 : 21 : if (compound_side_effects_p)
9540 : 9 : newrhs = rhs = stabilize_expr (rhs, &preeval);
9541 : 21 : lhs = genericize_compound_lvalue (lhs);
9542 : 149 : maybe_add_compound:
9543 : : /* If we had (bar, --foo) = 5; or (bar, (baz, --foo)) = 5;
9544 : : and looked through the COMPOUND_EXPRs, readd them now around
9545 : : the resulting lhs. */
9546 : 149 : if (TREE_CODE (olhs) == COMPOUND_EXPR)
9547 : : {
9548 : 9 : lhs = build2 (COMPOUND_EXPR, lhstype, TREE_OPERAND (olhs, 0), lhs);
9549 : 9 : tree *ptr = &TREE_OPERAND (lhs, 1);
9550 : 9 : for (olhs = TREE_OPERAND (olhs, 1);
9551 : 12 : TREE_CODE (olhs) == COMPOUND_EXPR;
9552 : 3 : olhs = TREE_OPERAND (olhs, 1))
9553 : : {
9554 : 3 : *ptr = build2 (COMPOUND_EXPR, lhstype,
9555 : 3 : TREE_OPERAND (olhs, 0), *ptr);
9556 : 3 : ptr = &TREE_OPERAND (*ptr, 1);
9557 : : }
9558 : : }
9559 : : break;
9560 : :
9561 : 128 : case MODIFY_EXPR:
9562 : 128 : if (compound_side_effects_p)
9563 : 0 : newrhs = rhs = stabilize_expr (rhs, &preeval);
9564 : 128 : lhs = genericize_compound_lvalue (lhs);
9565 : 128 : goto maybe_add_compound;
9566 : :
9567 : 0 : case MIN_EXPR:
9568 : 0 : case MAX_EXPR:
9569 : : /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
9570 : : when neither operand has side-effects. */
9571 : 0 : if (!lvalue_or_else (lhs, lv_assign, complain))
9572 : 0 : return error_mark_node;
9573 : :
9574 : 0 : gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
9575 : : && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
9576 : :
9577 : 0 : lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
9578 : 0 : build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
9579 : : boolean_type_node,
9580 : 0 : TREE_OPERAND (lhs, 0),
9581 : 0 : TREE_OPERAND (lhs, 1)),
9582 : 0 : TREE_OPERAND (lhs, 0),
9583 : 0 : TREE_OPERAND (lhs, 1));
9584 : 200 : gcc_fallthrough ();
9585 : :
9586 : : /* Handle (a ? b : c) used as an "lvalue". */
9587 : 200 : case COND_EXPR:
9588 : 200 : {
9589 : : /* Produce (a ? (b = rhs) : (c = rhs))
9590 : : except that the RHS goes through a save-expr
9591 : : so the code to compute it is only emitted once. */
9592 : 200 : if (VOID_TYPE_P (TREE_TYPE (rhs)))
9593 : : {
9594 : 18 : if (complain & tf_error)
9595 : 24 : error_at (cp_expr_loc_or_loc (rhs, loc),
9596 : : "void value not ignored as it ought to be");
9597 : 18 : return error_mark_node;
9598 : : }
9599 : :
9600 : 182 : rhs = stabilize_expr (rhs, &preeval);
9601 : :
9602 : : /* Check this here to avoid odd errors when trying to convert
9603 : : a throw to the type of the COND_EXPR. */
9604 : 182 : if (!lvalue_or_else (lhs, lv_assign, complain))
9605 : 6 : return error_mark_node;
9606 : :
9607 : 176 : tree op1 = TREE_OPERAND (lhs, 1);
9608 : 176 : if (TREE_CODE (op1) != THROW_EXPR)
9609 : 170 : op1 = cp_build_modify_expr (loc, op1, modifycode, rhs, complain);
9610 : : /* When sanitizing undefined behavior, even when rhs doesn't need
9611 : : stabilization at this point, the sanitization might add extra
9612 : : SAVE_EXPRs in there and so make sure there is no tree sharing
9613 : : in the rhs, otherwise those SAVE_EXPRs will have initialization
9614 : : only in one of the two branches. */
9615 : 176 : if (sanitize_flags_p (SANITIZE_UNDEFINED
9616 : : | SANITIZE_UNDEFINED_NONDEFAULT))
9617 : 3 : rhs = unshare_expr (rhs);
9618 : 176 : tree op2 = TREE_OPERAND (lhs, 2);
9619 : 176 : if (TREE_CODE (op2) != THROW_EXPR)
9620 : 170 : op2 = cp_build_modify_expr (loc, op2, modifycode, rhs, complain);
9621 : 176 : tree cond = build_conditional_expr (input_location,
9622 : 176 : TREE_OPERAND (lhs, 0), op1, op2,
9623 : : complain);
9624 : :
9625 : 176 : if (cond == error_mark_node)
9626 : : return cond;
9627 : : /* If we had (e, (a ? b : c)) = d; or (e, (f, (a ? b : c))) = d;
9628 : : and looked through the COMPOUND_EXPRs, readd them now around
9629 : : the resulting cond before adding the preevaluated rhs. */
9630 : 173 : if (TREE_CODE (olhs) == COMPOUND_EXPR)
9631 : : {
9632 : 15 : cond = build2 (COMPOUND_EXPR, TREE_TYPE (cond),
9633 : 15 : TREE_OPERAND (olhs, 0), cond);
9634 : 15 : tree *ptr = &TREE_OPERAND (cond, 1);
9635 : 15 : for (olhs = TREE_OPERAND (olhs, 1);
9636 : 18 : TREE_CODE (olhs) == COMPOUND_EXPR;
9637 : 3 : olhs = TREE_OPERAND (olhs, 1))
9638 : : {
9639 : 3 : *ptr = build2 (COMPOUND_EXPR, TREE_TYPE (cond),
9640 : 3 : TREE_OPERAND (olhs, 0), *ptr);
9641 : 3 : ptr = &TREE_OPERAND (*ptr, 1);
9642 : : }
9643 : : }
9644 : : /* Make sure the code to compute the rhs comes out
9645 : : before the split. */
9646 : 173 : result = cond;
9647 : 173 : goto ret;
9648 : : }
9649 : :
9650 : : default:
9651 : : lhs = olhs;
9652 : : break;
9653 : : }
9654 : :
9655 : 29671219 : if (modifycode == INIT_EXPR)
9656 : : {
9657 : 3080379 : if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
9658 : : /* Do the default thing. */;
9659 : 2912053 : else if (TREE_CODE (rhs) == CONSTRUCTOR)
9660 : : {
9661 : : /* Compound literal. */
9662 : 169 : if (! same_type_p (TREE_TYPE (rhs), lhstype))
9663 : : /* Call convert to generate an error; see PR 11063. */
9664 : 0 : rhs = convert (lhstype, rhs);
9665 : 169 : result = cp_build_init_expr (lhs, rhs);
9666 : 169 : TREE_SIDE_EFFECTS (result) = 1;
9667 : 169 : goto ret;
9668 : : }
9669 : 2911884 : else if (! MAYBE_CLASS_TYPE_P (lhstype))
9670 : : /* Do the default thing. */;
9671 : : else
9672 : : {
9673 : 39619 : releasing_vec rhs_vec = make_tree_vector_single (rhs);
9674 : 39619 : result = build_special_member_call (lhs, complete_ctor_identifier,
9675 : : &rhs_vec, lhstype, LOOKUP_NORMAL,
9676 : : complain);
9677 : 39619 : if (result == NULL_TREE)
9678 : 0 : return error_mark_node;
9679 : 39619 : goto ret;
9680 : 39619 : }
9681 : : }
9682 : : else
9683 : : {
9684 : 26590840 : lhs = require_complete_type (lhs, complain);
9685 : 26590840 : if (lhs == error_mark_node)
9686 : : return error_mark_node;
9687 : :
9688 : 26590797 : if (modifycode == NOP_EXPR)
9689 : : {
9690 : 22722656 : maybe_warn_self_move (loc, lhs, rhs);
9691 : :
9692 : 22722656 : if (c_dialect_objc ())
9693 : : {
9694 : 0 : result = objc_maybe_build_modify_expr (lhs, rhs);
9695 : 0 : if (result)
9696 : 0 : goto ret;
9697 : : }
9698 : :
9699 : : /* `operator=' is not an inheritable operator. */
9700 : 22722656 : if (! MAYBE_CLASS_TYPE_P (lhstype))
9701 : : /* Do the default thing. */;
9702 : : else
9703 : : {
9704 : 1854277 : result = build_new_op (input_location, MODIFY_EXPR,
9705 : : LOOKUP_NORMAL, lhs, rhs,
9706 : : make_node (NOP_EXPR), NULL_TREE,
9707 : : /*overload=*/NULL, complain);
9708 : 1854277 : if (result == NULL_TREE)
9709 : 0 : return error_mark_node;
9710 : 1854277 : goto ret;
9711 : : }
9712 : : lhstype = olhstype;
9713 : : }
9714 : : else
9715 : : {
9716 : 3868141 : tree init = NULL_TREE;
9717 : :
9718 : : /* A binary op has been requested. Combine the old LHS
9719 : : value with the RHS producing the value we should actually
9720 : : store into the LHS. */
9721 : 3868141 : gcc_assert (!((TYPE_REF_P (lhstype)
9722 : : && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype)))
9723 : : || MAYBE_CLASS_TYPE_P (lhstype)));
9724 : :
9725 : : /* Preevaluate the RHS to make sure its evaluation is complete
9726 : : before the lvalue-to-rvalue conversion of the LHS:
9727 : :
9728 : : [expr.ass] With respect to an indeterminately-sequenced
9729 : : function call, the operation of a compound assignment is a
9730 : : single evaluation. [ Note: Therefore, a function call shall
9731 : : not intervene between the lvalue-to-rvalue conversion and the
9732 : : side effect associated with any single compound assignment
9733 : : operator. -- end note ] */
9734 : 3868141 : lhs = cp_stabilize_reference (lhs);
9735 : 3868141 : rhs = decay_conversion (rhs, complain);
9736 : 3868141 : if (rhs == error_mark_node)
9737 : 123 : return error_mark_node;
9738 : :
9739 : 3868138 : {
9740 : 3868138 : auto_diagnostic_group d;
9741 : 3868138 : rhs = stabilize_expr (rhs, &init);
9742 : 3868138 : newrhs = cp_build_binary_op (loc, modifycode, lhs, rhs, complain);
9743 : 3868138 : if (newrhs == error_mark_node)
9744 : : {
9745 : 120 : if (complain & tf_error)
9746 : 24 : inform (loc, " in evaluation of %<%Q(%#T, %#T)%>",
9747 : 24 : modifycode, TREE_TYPE (lhs), TREE_TYPE (rhs));
9748 : 120 : return error_mark_node;
9749 : : }
9750 : 3868138 : }
9751 : :
9752 : 3868018 : if (init)
9753 : 259127 : newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), init, newrhs);
9754 : :
9755 : : /* Now it looks like a plain assignment. */
9756 : 3868018 : modifycode = NOP_EXPR;
9757 : 3868018 : if (c_dialect_objc ())
9758 : : {
9759 : 0 : result = objc_maybe_build_modify_expr (lhs, newrhs);
9760 : 0 : if (result)
9761 : 0 : goto ret;
9762 : : }
9763 : : }
9764 : 24736397 : gcc_assert (!TYPE_REF_P (lhstype));
9765 : 24736397 : gcc_assert (!TYPE_REF_P (TREE_TYPE (newrhs)));
9766 : : }
9767 : :
9768 : : /* The left-hand side must be an lvalue. */
9769 : 27776988 : if (!lvalue_or_else (lhs, lv_assign, complain))
9770 : 166 : return error_mark_node;
9771 : :
9772 : : /* Warn about modifying something that is `const'. Don't warn if
9773 : : this is initialization. */
9774 : 27776822 : if (modifycode != INIT_EXPR
9775 : 27776822 : && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
9776 : : /* Functions are not modifiable, even though they are
9777 : : lvalues. */
9778 : 24693550 : || FUNC_OR_METHOD_TYPE_P (TREE_TYPE (lhs))
9779 : : /* If it's an aggregate and any field is const, then it is
9780 : : effectively const. */
9781 : 24693520 : || (CLASS_TYPE_P (lhstype)
9782 : 0 : && C_TYPE_FIELDS_READONLY (lhstype))))
9783 : : {
9784 : 42711 : if (complain & tf_error)
9785 : 77 : cxx_readonly_error (loc, lhs, lv_assign);
9786 : 42711 : return error_mark_node;
9787 : : }
9788 : :
9789 : : /* If storing into a structure or union member, it may have been given a
9790 : : lowered bitfield type. We need to convert to the declared type first,
9791 : : so retrieve it now. */
9792 : :
9793 : 27734111 : olhstype = unlowered_expr_type (lhs);
9794 : :
9795 : : /* Convert new value to destination type. */
9796 : :
9797 : 27734111 : if (TREE_CODE (lhstype) == ARRAY_TYPE)
9798 : : {
9799 : 180 : int from_array;
9800 : :
9801 : 180 : if (BRACE_ENCLOSED_INITIALIZER_P (newrhs))
9802 : : {
9803 : 12 : if (modifycode != INIT_EXPR)
9804 : : {
9805 : 12 : if (complain & tf_error)
9806 : 12 : error_at (loc,
9807 : : "assigning to an array from an initializer list");
9808 : 12 : return error_mark_node;
9809 : : }
9810 : 0 : if (check_array_initializer (lhs, lhstype, newrhs))
9811 : 0 : return error_mark_node;
9812 : 0 : newrhs = digest_init (lhstype, newrhs, complain);
9813 : 0 : if (newrhs == error_mark_node)
9814 : : return error_mark_node;
9815 : : }
9816 : :
9817 : : /* C++11 8.5/17: "If the destination type is an array of characters,
9818 : : an array of char16_t, an array of char32_t, or an array of wchar_t,
9819 : : and the initializer is a string literal...". */
9820 : 168 : else if ((TREE_CODE (tree_strip_any_location_wrapper (newrhs))
9821 : : == STRING_CST)
9822 : 43 : && char_type_p (TREE_TYPE (TYPE_MAIN_VARIANT (lhstype)))
9823 : 211 : && modifycode == INIT_EXPR)
9824 : : {
9825 : 28 : newrhs = digest_init (lhstype, newrhs, complain);
9826 : 28 : if (newrhs == error_mark_node)
9827 : : return error_mark_node;
9828 : : }
9829 : :
9830 : 140 : else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
9831 : : TYPE_MAIN_VARIANT (TREE_TYPE (newrhs))))
9832 : : {
9833 : 20 : if (complain & tf_error)
9834 : 15 : error_at (loc, "incompatible types in assignment of %qT to %qT",
9835 : 15 : TREE_TYPE (rhs), lhstype);
9836 : 20 : return error_mark_node;
9837 : : }
9838 : :
9839 : : /* Allow array assignment in compiler-generated code. */
9840 : 120 : else if (DECL_P (lhs) && DECL_ARTIFICIAL (lhs))
9841 : : /* OK, used by coroutines (co-await-initlist1.C). */;
9842 : 118 : else if (!current_function_decl
9843 : 118 : || !DECL_DEFAULTED_FN (current_function_decl))
9844 : : {
9845 : : /* This routine is used for both initialization and assignment.
9846 : : Make sure the diagnostic message differentiates the context. */
9847 : 71 : if (complain & tf_error)
9848 : : {
9849 : 30 : if (modifycode == INIT_EXPR)
9850 : 9 : error_at (loc, "array used as initializer");
9851 : : else
9852 : 21 : error_at (loc, "invalid array assignment");
9853 : : }
9854 : 71 : return error_mark_node;
9855 : : }
9856 : :
9857 : 77 : from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
9858 : 77 : ? 1 + (modifycode != INIT_EXPR) : 0;
9859 : 77 : result = build_vec_init (lhs, NULL_TREE, newrhs,
9860 : : /*explicit_value_init_p=*/false,
9861 : : from_array, complain);
9862 : 77 : goto ret;
9863 : : }
9864 : :
9865 : 27733931 : if (modifycode == INIT_EXPR)
9866 : : /* Calls with INIT_EXPR are all direct-initialization, so don't set
9867 : : LOOKUP_ONLYCONVERTING. */
9868 : 3040533 : newrhs = convert_for_initialization (lhs, olhstype, newrhs, LOOKUP_NORMAL,
9869 : : ICR_INIT, NULL_TREE, 0,
9870 : : complain | tf_no_cleanup);
9871 : : else
9872 : 24693398 : newrhs = convert_for_assignment (olhstype, newrhs, ICR_ASSIGN,
9873 : : NULL_TREE, 0, complain, LOOKUP_IMPLICIT);
9874 : :
9875 : 27733931 : if (!same_type_p (lhstype, olhstype))
9876 : 185204 : newrhs = cp_convert_and_check (lhstype, newrhs, complain);
9877 : :
9878 : 27733931 : if (modifycode != INIT_EXPR)
9879 : : {
9880 : 24693398 : if (TREE_CODE (newrhs) == CALL_EXPR
9881 : 24693398 : && TYPE_NEEDS_CONSTRUCTING (lhstype))
9882 : 0 : newrhs = build_cplus_new (lhstype, newrhs, complain);
9883 : :
9884 : : /* Can't initialize directly from a TARGET_EXPR, since that would
9885 : : cause the lhs to be constructed twice, and possibly result in
9886 : : accidental self-initialization. So we force the TARGET_EXPR to be
9887 : : expanded without a target. */
9888 : 24693398 : if (TREE_CODE (newrhs) == TARGET_EXPR)
9889 : 84 : newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
9890 : 84 : TARGET_EXPR_SLOT (newrhs));
9891 : : }
9892 : :
9893 : 27733931 : if (newrhs == error_mark_node)
9894 : : return error_mark_node;
9895 : :
9896 : 27733363 : if (c_dialect_objc () && flag_objc_gc)
9897 : : {
9898 : 0 : result = objc_generate_write_barrier (lhs, modifycode, newrhs);
9899 : :
9900 : 0 : if (result)
9901 : 0 : goto ret;
9902 : : }
9903 : :
9904 : 30773847 : result = build2_loc (loc, modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
9905 : : lhstype, lhs, newrhs);
9906 : 27733363 : if (modifycode == INIT_EXPR)
9907 : 3040484 : set_target_expr_eliding (newrhs);
9908 : :
9909 : 27733363 : TREE_SIDE_EFFECTS (result) = 1;
9910 : 27733363 : if (!plain_assign)
9911 : 6908472 : suppress_warning (result, OPT_Wparentheses);
9912 : :
9913 : 20824891 : ret:
9914 : 29627678 : if (preeval)
9915 : 33 : result = build2 (COMPOUND_EXPR, TREE_TYPE (result), preeval, result);
9916 : : return result;
9917 : : }
9918 : :
9919 : : cp_expr
9920 : 54695064 : build_x_modify_expr (location_t loc, tree lhs, enum tree_code modifycode,
9921 : : tree rhs, tree lookups, tsubst_flags_t complain)
9922 : : {
9923 : 54695064 : tree orig_lhs = lhs;
9924 : 54695064 : tree orig_rhs = rhs;
9925 : 54695064 : tree overload = NULL_TREE;
9926 : :
9927 : 54695064 : if (lhs == error_mark_node || rhs == error_mark_node)
9928 : 2063 : return cp_expr (error_mark_node, loc);
9929 : :
9930 : 54693001 : tree op = build_min (modifycode, void_type_node, NULL_TREE, NULL_TREE);
9931 : :
9932 : 54693001 : if (processing_template_decl)
9933 : : {
9934 : 36932821 : if (type_dependent_expression_p (lhs)
9935 : 36932821 : || type_dependent_expression_p (rhs))
9936 : : {
9937 : 28331043 : tree rval = build_min_nt_loc (loc, MODOP_EXPR, lhs, op, rhs);
9938 : 28331043 : if (modifycode != NOP_EXPR)
9939 : 5452418 : TREE_TYPE (rval)
9940 : 10904836 : = build_dependent_operator_type (lookups, modifycode, true);
9941 : 28331043 : return rval;
9942 : : }
9943 : : }
9944 : :
9945 : 26361958 : tree rval;
9946 : 26361958 : if (modifycode == NOP_EXPR)
9947 : 20967624 : rval = cp_build_modify_expr (loc, lhs, modifycode, rhs, complain);
9948 : : else
9949 : 5394334 : rval = build_new_op (loc, MODIFY_EXPR, LOOKUP_NORMAL,
9950 : : lhs, rhs, op, lookups, &overload, complain);
9951 : 26361958 : if (rval == error_mark_node)
9952 : 1800 : return error_mark_node;
9953 : 26360158 : if (processing_template_decl)
9954 : : {
9955 : 8601757 : if (overload != NULL_TREE)
9956 : 1135002 : return (build_min_non_dep_op_overload
9957 : 1135002 : (MODIFY_EXPR, rval, overload, orig_lhs, orig_rhs));
9958 : :
9959 : 7466755 : return (build_min_non_dep
9960 : 7466755 : (MODOP_EXPR, rval, orig_lhs, op, orig_rhs));
9961 : : }
9962 : 17758401 : return rval;
9963 : : }
9964 : :
9965 : : /* Helper function for get_delta_difference which assumes FROM is a base
9966 : : class of TO. Returns a delta for the conversion of pointer-to-member
9967 : : of FROM to pointer-to-member of TO. If the conversion is invalid and
9968 : : tf_error is not set in COMPLAIN returns error_mark_node, otherwise
9969 : : returns zero. If FROM is not a base class of TO, returns NULL_TREE.
9970 : : If C_CAST_P is true, this conversion is taking place as part of a
9971 : : C-style cast. */
9972 : :
9973 : : static tree
9974 : 28970 : get_delta_difference_1 (tree from, tree to, bool c_cast_p,
9975 : : tsubst_flags_t complain)
9976 : : {
9977 : 28970 : tree binfo;
9978 : 28970 : base_kind kind;
9979 : :
9980 : 57690 : binfo = lookup_base (to, from, c_cast_p ? ba_unique : ba_check,
9981 : : &kind, complain);
9982 : :
9983 : 28970 : if (binfo == error_mark_node)
9984 : : {
9985 : 51 : if (!(complain & tf_error))
9986 : : return error_mark_node;
9987 : :
9988 : 51 : inform (input_location, " in pointer to member function conversion");
9989 : 51 : return size_zero_node;
9990 : : }
9991 : 28919 : else if (binfo)
9992 : : {
9993 : 28771 : if (kind != bk_via_virtual)
9994 : 28678 : return BINFO_OFFSET (binfo);
9995 : : else
9996 : : /* FROM is a virtual base class of TO. Issue an error or warning
9997 : : depending on whether or not this is a reinterpret cast. */
9998 : : {
9999 : 93 : if (!(complain & tf_error))
10000 : : return error_mark_node;
10001 : :
10002 : 78 : error ("pointer to member conversion via virtual base %qT",
10003 : 78 : BINFO_TYPE (binfo_from_vbase (binfo)));
10004 : :
10005 : 78 : return size_zero_node;
10006 : : }
10007 : : }
10008 : : else
10009 : : return NULL_TREE;
10010 : : }
10011 : :
10012 : : /* Get difference in deltas for different pointer to member function
10013 : : types. If the conversion is invalid and tf_error is not set in
10014 : : COMPLAIN, returns error_mark_node, otherwise returns an integer
10015 : : constant of type PTRDIFF_TYPE_NODE and its value is zero if the
10016 : : conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
10017 : : conversions as well. If C_CAST_P is true this conversion is taking
10018 : : place as part of a C-style cast.
10019 : :
10020 : : Note that the naming of FROM and TO is kind of backwards; the return
10021 : : value is what we add to a TO in order to get a FROM. They are named
10022 : : this way because we call this function to find out how to convert from
10023 : : a pointer to member of FROM to a pointer to member of TO. */
10024 : :
10025 : : static tree
10026 : 90160 : get_delta_difference (tree from, tree to,
10027 : : bool allow_inverse_p,
10028 : : bool c_cast_p, tsubst_flags_t complain)
10029 : : {
10030 : 90160 : auto_diagnostic_group d;
10031 : 90160 : tree result;
10032 : :
10033 : 90160 : if (same_type_ignoring_top_level_qualifiers_p (from, to))
10034 : : /* Pointer to member of incomplete class is permitted*/
10035 : 61338 : result = size_zero_node;
10036 : : else
10037 : 28822 : result = get_delta_difference_1 (from, to, c_cast_p, complain);
10038 : :
10039 : 90160 : if (result == error_mark_node)
10040 : : return error_mark_node;
10041 : :
10042 : 90145 : if (!result)
10043 : : {
10044 : 148 : if (!allow_inverse_p)
10045 : : {
10046 : 0 : if (!(complain & tf_error))
10047 : : return error_mark_node;
10048 : :
10049 : 0 : error_not_base_type (from, to);
10050 : 0 : inform (input_location, " in pointer to member conversion");
10051 : 0 : result = size_zero_node;
10052 : : }
10053 : : else
10054 : : {
10055 : 148 : result = get_delta_difference_1 (to, from, c_cast_p, complain);
10056 : :
10057 : 148 : if (result == error_mark_node)
10058 : : return error_mark_node;
10059 : :
10060 : 148 : if (result)
10061 : 148 : result = size_diffop_loc (input_location,
10062 : : size_zero_node, result);
10063 : : else
10064 : : {
10065 : 0 : if (!(complain & tf_error))
10066 : : return error_mark_node;
10067 : :
10068 : 0 : error_not_base_type (from, to);
10069 : 0 : inform (input_location, " in pointer to member conversion");
10070 : 0 : result = size_zero_node;
10071 : : }
10072 : : }
10073 : : }
10074 : :
10075 : 90145 : return convert_to_integer (ptrdiff_type_node, result);
10076 : 90160 : }
10077 : :
10078 : : /* Return a constructor for the pointer-to-member-function TYPE using
10079 : : the other components as specified. */
10080 : :
10081 : : tree
10082 : 61766 : build_ptrmemfunc1 (tree type, tree delta, tree pfn)
10083 : : {
10084 : 61766 : tree u = NULL_TREE;
10085 : 61766 : tree delta_field;
10086 : 61766 : tree pfn_field;
10087 : 61766 : vec<constructor_elt, va_gc> *v;
10088 : :
10089 : : /* Pull the FIELD_DECLs out of the type. */
10090 : 61766 : pfn_field = TYPE_FIELDS (type);
10091 : 61766 : delta_field = DECL_CHAIN (pfn_field);
10092 : :
10093 : : /* Make sure DELTA has the type we want. */
10094 : 61766 : delta = convert_and_check (input_location, delta_type_node, delta);
10095 : :
10096 : : /* Convert to the correct target type if necessary. */
10097 : 61766 : pfn = fold_convert (TREE_TYPE (pfn_field), pfn);
10098 : :
10099 : : /* Finish creating the initializer. */
10100 : 61766 : vec_alloc (v, 2);
10101 : 61766 : CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
10102 : 61766 : CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
10103 : 61766 : u = build_constructor (type, v);
10104 : 61766 : TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
10105 : 61766 : TREE_STATIC (u) = (TREE_CONSTANT (u)
10106 : 61664 : && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
10107 : : != NULL_TREE)
10108 : 123430 : && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
10109 : : != NULL_TREE));
10110 : 61766 : return u;
10111 : : }
10112 : :
10113 : : /* Build a constructor for a pointer to member function. It can be
10114 : : used to initialize global variables, local variable, or used
10115 : : as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
10116 : : want to be.
10117 : :
10118 : : If FORCE is nonzero, then force this conversion, even if
10119 : : we would rather not do it. Usually set when using an explicit
10120 : : cast. A C-style cast is being processed iff C_CAST_P is true.
10121 : :
10122 : : Return error_mark_node, if something goes wrong. */
10123 : :
10124 : : tree
10125 : 30335 : build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p,
10126 : : tsubst_flags_t complain)
10127 : : {
10128 : 30335 : tree fn;
10129 : 30335 : tree pfn_type;
10130 : 30335 : tree to_type;
10131 : :
10132 : 30335 : if (error_operand_p (pfn))
10133 : 0 : return error_mark_node;
10134 : :
10135 : 30335 : pfn_type = TREE_TYPE (pfn);
10136 : 30335 : to_type = build_ptrmemfunc_type (type);
10137 : :
10138 : : /* Handle multiple conversions of pointer to member functions. */
10139 : 30335 : if (TYPE_PTRMEMFUNC_P (pfn_type))
10140 : : {
10141 : 28529 : tree delta = NULL_TREE;
10142 : 28529 : tree npfn = NULL_TREE;
10143 : 28529 : tree n;
10144 : :
10145 : 28529 : if (!force
10146 : 28529 : && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn,
10147 : : LOOKUP_NORMAL, complain))
10148 : : {
10149 : 0 : if (complain & tf_error)
10150 : 0 : error ("invalid conversion to type %qT from type %qT",
10151 : : to_type, pfn_type);
10152 : : else
10153 : 0 : return error_mark_node;
10154 : : }
10155 : :
10156 : 28529 : n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
10157 : 28529 : TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
10158 : : force,
10159 : : c_cast_p, complain);
10160 : 28529 : if (n == error_mark_node)
10161 : : return error_mark_node;
10162 : :
10163 : 28520 : STRIP_ANY_LOCATION_WRAPPER (pfn);
10164 : :
10165 : : /* We don't have to do any conversion to convert a
10166 : : pointer-to-member to its own type. But, we don't want to
10167 : : just return a PTRMEM_CST if there's an explicit cast; that
10168 : : cast should make the expression an invalid template argument. */
10169 : 28520 : if (TREE_CODE (pfn) != PTRMEM_CST
10170 : 28520 : && same_type_p (to_type, pfn_type))
10171 : : return pfn;
10172 : :
10173 : 28520 : if (TREE_SIDE_EFFECTS (pfn))
10174 : 8 : pfn = save_expr (pfn);
10175 : :
10176 : : /* Obtain the function pointer and the current DELTA. */
10177 : 28520 : if (TREE_CODE (pfn) == PTRMEM_CST)
10178 : 28432 : expand_ptrmemfunc_cst (pfn, &delta, &npfn);
10179 : : else
10180 : : {
10181 : 88 : npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
10182 : 88 : delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
10183 : : }
10184 : :
10185 : : /* Just adjust the DELTA field. */
10186 : 28520 : gcc_assert (same_type_ignoring_top_level_qualifiers_p
10187 : : (TREE_TYPE (delta), ptrdiff_type_node));
10188 : 28520 : if (!integer_zerop (n))
10189 : : {
10190 : 50 : if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
10191 : : n = cp_build_binary_op (input_location,
10192 : : LSHIFT_EXPR, n, integer_one_node,
10193 : : complain);
10194 : 50 : delta = cp_build_binary_op (input_location,
10195 : : PLUS_EXPR, delta, n, complain);
10196 : : }
10197 : 28520 : return build_ptrmemfunc1 (to_type, delta, npfn);
10198 : : }
10199 : :
10200 : : /* Handle null pointer to member function conversions. */
10201 : 1806 : if (null_ptr_cst_p (pfn))
10202 : : {
10203 : 753 : pfn = cp_build_c_cast (input_location,
10204 : 753 : TYPE_PTRMEMFUNC_FN_TYPE_RAW (to_type),
10205 : : pfn, complain);
10206 : 753 : return build_ptrmemfunc1 (to_type,
10207 : : integer_zero_node,
10208 : 753 : pfn);
10209 : : }
10210 : :
10211 : 1053 : if (type_unknown_p (pfn))
10212 : 0 : return instantiate_type (type, pfn, complain);
10213 : :
10214 : 1053 : fn = TREE_OPERAND (pfn, 0);
10215 : 1053 : gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
10216 : : /* In a template, we will have preserved the
10217 : : OFFSET_REF. */
10218 : : || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
10219 : 1053 : return make_ptrmem_cst (to_type, fn);
10220 : : }
10221 : :
10222 : : /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
10223 : : given by CST.
10224 : :
10225 : : ??? There is no consistency as to the types returned for the above
10226 : : values. Some code acts as if it were a sizetype and some as if it were
10227 : : integer_type_node. */
10228 : :
10229 : : void
10230 : 61267 : expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
10231 : : {
10232 : 61267 : tree type = TREE_TYPE (cst);
10233 : 61267 : tree fn = PTRMEM_CST_MEMBER (cst);
10234 : 61267 : tree ptr_class, fn_class;
10235 : :
10236 : 61267 : gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
10237 : :
10238 : : /* The class that the function belongs to. */
10239 : 61267 : fn_class = DECL_CONTEXT (fn);
10240 : :
10241 : : /* The class that we're creating a pointer to member of. */
10242 : 61267 : ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
10243 : :
10244 : : /* First, calculate the adjustment to the function's class. */
10245 : 61267 : *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
10246 : : /*c_cast_p=*/0, tf_warning_or_error);
10247 : :
10248 : 61267 : if (!DECL_VIRTUAL_P (fn))
10249 : : {
10250 : 59960 : tree t = build_addr_func (fn, tf_warning_or_error);
10251 : 59960 : if (TREE_CODE (t) == ADDR_EXPR)
10252 : 59960 : SET_EXPR_LOCATION (t, PTRMEM_CST_LOCATION (cst));
10253 : 59960 : *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), t);
10254 : : }
10255 : : else
10256 : : {
10257 : : /* If we're dealing with a virtual function, we have to adjust 'this'
10258 : : again, to point to the base which provides the vtable entry for
10259 : : fn; the call will do the opposite adjustment. */
10260 : 1307 : tree orig_class = DECL_CONTEXT (fn);
10261 : 1307 : tree binfo = binfo_or_else (orig_class, fn_class);
10262 : 1307 : *delta = fold_build2 (PLUS_EXPR, TREE_TYPE (*delta),
10263 : : *delta, BINFO_OFFSET (binfo));
10264 : :
10265 : : /* We set PFN to the vtable offset at which the function can be
10266 : : found, plus one (unless ptrmemfunc_vbit_in_delta, in which
10267 : : case delta is shifted left, and then incremented). */
10268 : 1307 : *pfn = DECL_VINDEX (fn);
10269 : 1307 : *pfn = fold_build2 (MULT_EXPR, integer_type_node, *pfn,
10270 : : TYPE_SIZE_UNIT (vtable_entry_type));
10271 : :
10272 : 1307 : switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
10273 : : {
10274 : 1307 : case ptrmemfunc_vbit_in_pfn:
10275 : 1307 : *pfn = fold_build2 (PLUS_EXPR, integer_type_node, *pfn,
10276 : : integer_one_node);
10277 : 1307 : break;
10278 : :
10279 : : case ptrmemfunc_vbit_in_delta:
10280 : : *delta = fold_build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
10281 : : *delta, integer_one_node);
10282 : : *delta = fold_build2 (PLUS_EXPR, TREE_TYPE (*delta),
10283 : : *delta, integer_one_node);
10284 : : break;
10285 : :
10286 : : default:
10287 : : gcc_unreachable ();
10288 : : }
10289 : :
10290 : 1307 : *pfn = fold_convert (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
10291 : : }
10292 : 61267 : }
10293 : :
10294 : : /* Return an expression for PFN from the pointer-to-member function
10295 : : given by T. */
10296 : :
10297 : : static tree
10298 : 86463 : pfn_from_ptrmemfunc (tree t)
10299 : : {
10300 : 86463 : if (TREE_CODE (t) == PTRMEM_CST)
10301 : : {
10302 : 171 : tree delta;
10303 : 171 : tree pfn;
10304 : :
10305 : 171 : expand_ptrmemfunc_cst (t, &delta, &pfn);
10306 : 171 : if (pfn)
10307 : 171 : return pfn;
10308 : : }
10309 : :
10310 : 86292 : return build_ptrmemfunc_access_expr (t, pfn_identifier);
10311 : : }
10312 : :
10313 : : /* Return an expression for DELTA from the pointer-to-member function
10314 : : given by T. */
10315 : :
10316 : : static tree
10317 : 86463 : delta_from_ptrmemfunc (tree t)
10318 : : {
10319 : 86463 : if (TREE_CODE (t) == PTRMEM_CST)
10320 : : {
10321 : 171 : tree delta;
10322 : 171 : tree pfn;
10323 : :
10324 : 171 : expand_ptrmemfunc_cst (t, &delta, &pfn);
10325 : 171 : if (delta)
10326 : 171 : return delta;
10327 : : }
10328 : :
10329 : 86292 : return build_ptrmemfunc_access_expr (t, delta_identifier);
10330 : : }
10331 : :
10332 : : /* Convert value RHS to type TYPE as preparation for an assignment to
10333 : : an lvalue of type TYPE. ERRTYPE indicates what kind of error the
10334 : : implicit conversion is. If FNDECL is non-NULL, we are doing the
10335 : : conversion in order to pass the PARMNUMth argument of FNDECL.
10336 : : If FNDECL is NULL, we are doing the conversion in function pointer
10337 : : argument passing, conversion in initialization, etc. */
10338 : :
10339 : : static tree
10340 : 106980503 : convert_for_assignment (tree type, tree rhs,
10341 : : impl_conv_rhs errtype, tree fndecl, int parmnum,
10342 : : tsubst_flags_t complain, int flags)
10343 : : {
10344 : 106980503 : tree rhstype;
10345 : 106980503 : enum tree_code coder;
10346 : :
10347 : 106980503 : location_t rhs_loc = cp_expr_loc_or_input_loc (rhs);
10348 : 106980503 : bool has_loc = EXPR_LOCATION (rhs) != UNKNOWN_LOCATION;
10349 : : /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue,
10350 : : but preserve location wrappers. */
10351 : 106980503 : if (TREE_CODE (rhs) == NON_LVALUE_EXPR
10352 : 106980503 : && !location_wrapper_p (rhs))
10353 : 92921 : rhs = TREE_OPERAND (rhs, 0);
10354 : :
10355 : : /* Handle [dcl.init.list] direct-list-initialization from
10356 : : single element of enumeration with a fixed underlying type. */
10357 : 106980503 : if (is_direct_enum_init (type, rhs))
10358 : : {
10359 : 20 : tree elt = CONSTRUCTOR_ELT (rhs, 0)->value;
10360 : 20 : if (check_narrowing (ENUM_UNDERLYING_TYPE (type), elt, complain))
10361 : : {
10362 : 11 : warning_sentinel w (warn_useless_cast);
10363 : 11 : warning_sentinel w2 (warn_ignored_qualifiers);
10364 : 11 : rhs = cp_build_c_cast (rhs_loc, type, elt, complain);
10365 : 11 : }
10366 : : else
10367 : 9 : rhs = error_mark_node;
10368 : : }
10369 : :
10370 : 106980503 : rhstype = TREE_TYPE (rhs);
10371 : 106980503 : coder = TREE_CODE (rhstype);
10372 : :
10373 : 1194976 : if (VECTOR_TYPE_P (type) && coder == VECTOR_TYPE
10374 : 108175373 : && vector_types_convertible_p (type, rhstype, true))
10375 : : {
10376 : 1194861 : rhs = mark_rvalue_use (rhs);
10377 : 1194861 : return convert (type, rhs);
10378 : : }
10379 : :
10380 : 105785642 : if (rhs == error_mark_node || rhstype == error_mark_node)
10381 : : return error_mark_node;
10382 : 105785633 : if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
10383 : : return error_mark_node;
10384 : :
10385 : : /* The RHS of an assignment cannot have void type. */
10386 : 105785633 : if (coder == VOID_TYPE)
10387 : : {
10388 : 45 : if (complain & tf_error)
10389 : 27 : error_at (rhs_loc, "void value not ignored as it ought to be");
10390 : 45 : return error_mark_node;
10391 : : }
10392 : :
10393 : 105785588 : if (c_dialect_objc ())
10394 : : {
10395 : 0 : int parmno;
10396 : 0 : tree selector;
10397 : 0 : tree rname = fndecl;
10398 : :
10399 : 0 : switch (errtype)
10400 : : {
10401 : : case ICR_ASSIGN:
10402 : : parmno = -1;
10403 : : break;
10404 : 0 : case ICR_INIT:
10405 : 0 : parmno = -2;
10406 : 0 : break;
10407 : 0 : default:
10408 : 0 : selector = objc_message_selector ();
10409 : 0 : parmno = parmnum;
10410 : 0 : if (selector && parmno > 1)
10411 : : {
10412 : 0 : rname = selector;
10413 : 0 : parmno -= 1;
10414 : : }
10415 : : }
10416 : :
10417 : 0 : if (objc_compare_types (type, rhstype, parmno, rname))
10418 : : {
10419 : 0 : rhs = mark_rvalue_use (rhs);
10420 : 0 : return convert (type, rhs);
10421 : : }
10422 : : }
10423 : :
10424 : : /* [expr.ass]
10425 : :
10426 : : The expression is implicitly converted (clause _conv_) to the
10427 : : cv-unqualified type of the left operand.
10428 : :
10429 : : We allow bad conversions here because by the time we get to this point
10430 : : we are committed to doing the conversion. If we end up doing a bad
10431 : : conversion, convert_like will complain. */
10432 : 105785588 : if (!can_convert_arg_bad (type, rhstype, rhs, flags, complain))
10433 : : {
10434 : : /* When -Wno-pmf-conversions is use, we just silently allow
10435 : : conversions from pointers-to-members to plain pointers. If
10436 : : the conversion doesn't work, cp_convert will complain. */
10437 : 1460 : if (!warn_pmf2ptr
10438 : 9 : && TYPE_PTR_P (type)
10439 : 1469 : && TYPE_PTRMEMFUNC_P (rhstype))
10440 : 9 : rhs = cp_convert (strip_top_quals (type), rhs, complain);
10441 : : else
10442 : : {
10443 : 1451 : if (complain & tf_error)
10444 : : {
10445 : 1264 : auto_diagnostic_group d;
10446 : :
10447 : : /* If the right-hand side has unknown type, then it is an
10448 : : overloaded function. Call instantiate_type to get error
10449 : : messages. */
10450 : 1264 : if (rhstype == unknown_type_node)
10451 : : {
10452 : 197 : tree r = instantiate_type (type, rhs, tf_warning_or_error);
10453 : : /* -fpermissive might allow this; recurse. */
10454 : 197 : if (!seen_error ())
10455 : 15 : return convert_for_assignment (type, r, errtype, fndecl,
10456 : : parmnum, complain, flags);
10457 : : }
10458 : 1067 : else if (fndecl)
10459 : 89 : complain_about_bad_argument (rhs_loc,
10460 : : rhstype, type,
10461 : : fndecl, parmnum);
10462 : : else
10463 : : {
10464 : 978 : range_label_for_type_mismatch label (rhstype, type);
10465 : 978 : gcc_rich_location richloc
10466 : : (rhs_loc,
10467 : : has_loc ? &label : NULL,
10468 : 978 : has_loc ? highlight_colors::percent_h : NULL);
10469 : :
10470 : 978 : switch (errtype)
10471 : : {
10472 : 0 : case ICR_DEFAULT_ARGUMENT:
10473 : 0 : error_at (&richloc,
10474 : : "cannot convert %qH to %qI in default argument",
10475 : : rhstype, type);
10476 : 0 : break;
10477 : 6 : case ICR_ARGPASS:
10478 : 6 : error_at (&richloc,
10479 : : "cannot convert %qH to %qI in argument passing",
10480 : : rhstype, type);
10481 : 6 : break;
10482 : 0 : case ICR_CONVERTING:
10483 : 0 : error_at (&richloc, "cannot convert %qH to %qI",
10484 : : rhstype, type);
10485 : 0 : break;
10486 : 542 : case ICR_INIT:
10487 : 542 : error_at (&richloc,
10488 : : "cannot convert %qH to %qI in initialization",
10489 : : rhstype, type);
10490 : 542 : break;
10491 : 16 : case ICR_RETURN:
10492 : 16 : error_at (&richloc, "cannot convert %qH to %qI in return",
10493 : : rhstype, type);
10494 : 16 : break;
10495 : 414 : case ICR_ASSIGN:
10496 : 414 : error_at (&richloc,
10497 : : "cannot convert %qH to %qI in assignment",
10498 : : rhstype, type);
10499 : 414 : break;
10500 : 0 : default:
10501 : 0 : gcc_unreachable();
10502 : : }
10503 : 978 : }
10504 : :
10505 : : /* See if we can be more helpful. */
10506 : 1249 : maybe_show_nonconverting_candidate (type, rhstype, rhs, flags);
10507 : :
10508 : 1249 : if (TYPE_PTR_P (rhstype)
10509 : 411 : && TYPE_PTR_P (type)
10510 : 396 : && CLASS_TYPE_P (TREE_TYPE (rhstype))
10511 : 278 : && CLASS_TYPE_P (TREE_TYPE (type))
10512 : 1311 : && !COMPLETE_TYPE_P (TREE_TYPE (rhstype)))
10513 : 3 : inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL
10514 : : (TREE_TYPE (rhstype))),
10515 : 3 : "class type %qT is incomplete", TREE_TYPE (rhstype));
10516 : 1264 : }
10517 : 1436 : return error_mark_node;
10518 : : }
10519 : : }
10520 : 105784137 : if (warn_suggest_attribute_format)
10521 : : {
10522 : 2363 : const enum tree_code codel = TREE_CODE (type);
10523 : 2363 : if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
10524 : 592 : && coder == codel
10525 : 504 : && check_missing_format_attribute (type, rhstype)
10526 : 2381 : && (complain & tf_warning))
10527 : 18 : switch (errtype)
10528 : : {
10529 : 0 : case ICR_ARGPASS:
10530 : 0 : case ICR_DEFAULT_ARGUMENT:
10531 : 0 : if (fndecl)
10532 : 0 : warning (OPT_Wsuggest_attribute_format,
10533 : : "parameter %qP of %qD might be a candidate "
10534 : : "for a format attribute", parmnum, fndecl);
10535 : : else
10536 : 0 : warning (OPT_Wsuggest_attribute_format,
10537 : : "parameter might be a candidate "
10538 : : "for a format attribute");
10539 : : break;
10540 : 0 : case ICR_CONVERTING:
10541 : 0 : warning (OPT_Wsuggest_attribute_format,
10542 : : "target of conversion might be a candidate "
10543 : : "for a format attribute");
10544 : 0 : break;
10545 : 6 : case ICR_INIT:
10546 : 6 : warning (OPT_Wsuggest_attribute_format,
10547 : : "target of initialization might be a candidate "
10548 : : "for a format attribute");
10549 : 6 : break;
10550 : 6 : case ICR_RETURN:
10551 : 6 : warning (OPT_Wsuggest_attribute_format,
10552 : : "return type might be a candidate "
10553 : : "for a format attribute");
10554 : 6 : break;
10555 : 6 : case ICR_ASSIGN:
10556 : 6 : warning (OPT_Wsuggest_attribute_format,
10557 : : "left-hand side of assignment might be a candidate "
10558 : : "for a format attribute");
10559 : 6 : break;
10560 : 0 : default:
10561 : 0 : gcc_unreachable();
10562 : : }
10563 : : }
10564 : :
10565 : 105784137 : if (TREE_CODE (type) == BOOLEAN_TYPE)
10566 : 20112106 : maybe_warn_unparenthesized_assignment (rhs, /*nested_p=*/true, complain);
10567 : :
10568 : 105784137 : if (complain & tf_warning)
10569 : 104868639 : warn_for_address_of_packed_member (type, rhs);
10570 : :
10571 : 105784137 : return perform_implicit_conversion_flags (strip_top_quals (type), rhs,
10572 : 105784137 : complain, flags);
10573 : : }
10574 : :
10575 : : /* Convert RHS to be of type TYPE.
10576 : : If EXP is nonzero, it is the target of the initialization.
10577 : : ERRTYPE indicates what kind of error the implicit conversion is.
10578 : :
10579 : : Two major differences between the behavior of
10580 : : `convert_for_assignment' and `convert_for_initialization'
10581 : : are that references are bashed in the former, while
10582 : : copied in the latter, and aggregates are assigned in
10583 : : the former (operator=) while initialized in the
10584 : : latter (X(X&)).
10585 : :
10586 : : If using constructor make sure no conversion operator exists, if one does
10587 : : exist, an ambiguity exists. */
10588 : :
10589 : : tree
10590 : 93280091 : convert_for_initialization (tree exp, tree type, tree rhs, int flags,
10591 : : impl_conv_rhs errtype, tree fndecl, int parmnum,
10592 : : tsubst_flags_t complain)
10593 : : {
10594 : 93280091 : enum tree_code codel = TREE_CODE (type);
10595 : 93280091 : tree rhstype;
10596 : 93280091 : enum tree_code coder;
10597 : :
10598 : : /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
10599 : : Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
10600 : 93280091 : if (TREE_CODE (rhs) == NOP_EXPR
10601 : 4288825 : && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
10602 : 93614159 : && codel != REFERENCE_TYPE)
10603 : 334068 : rhs = TREE_OPERAND (rhs, 0);
10604 : :
10605 : 93280091 : if (type == error_mark_node
10606 : 93280053 : || rhs == error_mark_node
10607 : 186560099 : || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
10608 : : return error_mark_node;
10609 : :
10610 : 93280008 : if (MAYBE_CLASS_TYPE_P (non_reference (type)))
10611 : : ;
10612 : 83867572 : else if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
10613 : 1291546 : && TREE_CODE (type) != ARRAY_TYPE
10614 : 1291546 : && (!TYPE_REF_P (type)
10615 : 5407 : || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
10616 : 82581430 : || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
10617 : 11353 : && !TYPE_REFFN_P (type))
10618 : 166439007 : || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
10619 : 1296143 : rhs = decay_conversion (rhs, complain);
10620 : :
10621 : 93280008 : rhstype = TREE_TYPE (rhs);
10622 : 93280008 : coder = TREE_CODE (rhstype);
10623 : :
10624 : 93280008 : if (coder == ERROR_MARK)
10625 : 9 : return error_mark_node;
10626 : :
10627 : : /* We accept references to incomplete types, so we can
10628 : : return here before checking if RHS is of complete type. */
10629 : :
10630 : 93279999 : if (codel == REFERENCE_TYPE)
10631 : : {
10632 : 4672152 : auto_diagnostic_group d;
10633 : : /* This should eventually happen in convert_arguments. */
10634 : 4672152 : int savew = 0, savee = 0;
10635 : :
10636 : 4672152 : if (fndecl)
10637 : 234212 : savew = warningcount + werrorcount, savee = errorcount;
10638 : 4672152 : rhs = initialize_reference (type, rhs, flags, complain);
10639 : :
10640 : 4672152 : if (fndecl
10641 : 4672152 : && (warningcount + werrorcount > savew || errorcount > savee))
10642 : 36 : inform (get_fndecl_argument_location (fndecl, parmnum),
10643 : : "in passing argument %P of %qD", parmnum, fndecl);
10644 : 4672152 : return rhs;
10645 : 4672152 : }
10646 : :
10647 : 88607847 : if (exp != 0)
10648 : 3040421 : exp = require_complete_type (exp, complain);
10649 : 88607847 : if (exp == error_mark_node)
10650 : : return error_mark_node;
10651 : :
10652 : 88607847 : type = complete_type (type);
10653 : :
10654 : 88607847 : if (DIRECT_INIT_EXPR_P (type, rhs))
10655 : : /* Don't try to do copy-initialization if we already have
10656 : : direct-initialization. */
10657 : : return rhs;
10658 : :
10659 : 88602735 : if (MAYBE_CLASS_TYPE_P (type))
10660 : 6315645 : return perform_implicit_conversion_flags (type, rhs, complain, flags);
10661 : :
10662 : 82287090 : return convert_for_assignment (type, rhs, errtype, fndecl, parmnum,
10663 : 82287090 : complain, flags);
10664 : : }
10665 : :
10666 : : /* If RETVAL is the address of, or a reference to, a local variable or
10667 : : temporary give an appropriate warning and return true. */
10668 : :
10669 : : static bool
10670 : 32402574 : maybe_warn_about_returning_address_of_local (tree retval, location_t loc)
10671 : : {
10672 : 32403210 : tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
10673 : 32403210 : tree whats_returned = fold_for_warn (retval);
10674 : 32403210 : if (!loc)
10675 : 32403210 : loc = cp_expr_loc_or_input_loc (retval);
10676 : :
10677 : 39095396 : for (;;)
10678 : : {
10679 : 39095396 : if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
10680 : 426502 : whats_returned = TREE_OPERAND (whats_returned, 1);
10681 : 38668894 : else if (CONVERT_EXPR_P (whats_returned)
10682 : 32422075 : || TREE_CODE (whats_returned) == NON_LVALUE_EXPR)
10683 : 6265684 : whats_returned = TREE_OPERAND (whats_returned, 0);
10684 : : else
10685 : : break;
10686 : : }
10687 : :
10688 : 32403210 : if (TREE_CODE (whats_returned) == TARGET_EXPR
10689 : 32403210 : && is_std_init_list (TREE_TYPE (whats_returned)))
10690 : : {
10691 : 14 : tree init = TARGET_EXPR_INITIAL (whats_returned);
10692 : 14 : if (TREE_CODE (init) == CONSTRUCTOR)
10693 : : /* Pull out the array address. */
10694 : 6 : whats_returned = CONSTRUCTOR_ELT (init, 0)->value;
10695 : 8 : else if (TREE_CODE (init) == INDIRECT_REF)
10696 : : /* The source of a trivial copy looks like *(T*)&var. */
10697 : 5 : whats_returned = TREE_OPERAND (init, 0);
10698 : : else
10699 : : return false;
10700 : 11 : STRIP_NOPS (whats_returned);
10701 : : }
10702 : :
10703 : : /* As a special case, we handle a call to std::move or std::forward. */
10704 : 32403207 : if (TREE_CODE (whats_returned) == CALL_EXPR
10705 : 32403207 : && (is_std_move_p (whats_returned)
10706 : 8914345 : || is_std_forward_p (whats_returned)))
10707 : : {
10708 : 624 : tree arg = CALL_EXPR_ARG (whats_returned, 0);
10709 : 624 : return maybe_warn_about_returning_address_of_local (arg, loc);
10710 : : }
10711 : :
10712 : 32402583 : if (TREE_CODE (whats_returned) != ADDR_EXPR)
10713 : : return false;
10714 : 693484 : whats_returned = TREE_OPERAND (whats_returned, 0);
10715 : :
10716 : 693484 : while (TREE_CODE (whats_returned) == COMPONENT_REF
10717 : 1360811 : || TREE_CODE (whats_returned) == ARRAY_REF)
10718 : 667327 : whats_returned = TREE_OPERAND (whats_returned, 0);
10719 : :
10720 : 693484 : if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
10721 : 693484 : || TREE_CODE (whats_returned) == TARGET_EXPR)
10722 : : {
10723 : 49 : if (TYPE_REF_P (valtype))
10724 : : /* P2748 made this an error in C++26. */
10725 : 70 : emit_diagnostic (cxx_dialect >= cxx26 ? DK_PERMERROR : DK_WARNING,
10726 : : loc, OPT_Wreturn_local_addr,
10727 : : "returning reference to temporary");
10728 : 9 : else if (TYPE_PTR_P (valtype))
10729 : 3 : warning_at (loc, OPT_Wreturn_local_addr,
10730 : : "returning pointer to temporary");
10731 : 6 : else if (is_std_init_list (valtype))
10732 : 6 : warning_at (loc, OPT_Winit_list_lifetime,
10733 : : "returning temporary %<initializer_list%> does not extend "
10734 : : "the lifetime of the underlying array");
10735 : 49 : return true;
10736 : : }
10737 : :
10738 : 693435 : STRIP_ANY_LOCATION_WRAPPER (whats_returned);
10739 : :
10740 : 693435 : if (DECL_P (whats_returned)
10741 : 60939 : && DECL_NAME (whats_returned)
10742 : 60939 : && DECL_FUNCTION_SCOPE_P (whats_returned)
10743 : 14178 : && !is_capture_proxy (whats_returned)
10744 : 707610 : && !(TREE_STATIC (whats_returned)
10745 : : || TREE_PUBLIC (whats_returned)))
10746 : : {
10747 : 106 : if (DECL_DECOMPOSITION_P (whats_returned)
10748 : 39 : && !DECL_DECOMP_IS_BASE (whats_returned)
10749 : 185 : && DECL_HAS_VALUE_EXPR_P (whats_returned))
10750 : : {
10751 : : /* When returning address of a structured binding, if the structured
10752 : : binding is not a reference, continue normally, if it is a
10753 : : reference, recurse on the initializer of the structured
10754 : : binding. */
10755 : 39 : tree base = DECL_DECOMP_BASE (whats_returned);
10756 : 39 : if (TYPE_REF_P (TREE_TYPE (base)))
10757 : : {
10758 : 15 : if (tree init = DECL_INITIAL (base))
10759 : : return maybe_warn_about_returning_address_of_local (init, loc);
10760 : : else
10761 : : return false;
10762 : : }
10763 : : }
10764 : 131 : bool w = false;
10765 : 131 : auto_diagnostic_group d;
10766 : 131 : if (TYPE_REF_P (valtype))
10767 : 81 : w = warning_at (loc, OPT_Wreturn_local_addr,
10768 : : "reference to local variable %qD returned",
10769 : : whats_returned);
10770 : 50 : else if (is_std_init_list (valtype))
10771 : 3 : w = warning_at (loc, OPT_Winit_list_lifetime,
10772 : : "returning local %<initializer_list%> variable %qD "
10773 : : "does not extend the lifetime of the underlying array",
10774 : : whats_returned);
10775 : 47 : else if (POINTER_TYPE_P (valtype)
10776 : 41 : && TREE_CODE (whats_returned) == LABEL_DECL)
10777 : 6 : w = warning_at (loc, OPT_Wreturn_local_addr,
10778 : : "address of label %qD returned",
10779 : : whats_returned);
10780 : 41 : else if (POINTER_TYPE_P (valtype))
10781 : 35 : w = warning_at (loc, OPT_Wreturn_local_addr,
10782 : : "address of local variable %qD returned",
10783 : : whats_returned);
10784 : 125 : if (w)
10785 : 103 : inform (DECL_SOURCE_LOCATION (whats_returned),
10786 : : "declared here");
10787 : 131 : return true;
10788 : 131 : }
10789 : :
10790 : : return false;
10791 : : }
10792 : :
10793 : : /* Returns true if DECL is in the std namespace. */
10794 : :
10795 : : bool
10796 : 63029340 : decl_in_std_namespace_p (tree decl)
10797 : : {
10798 : 73959286 : while (decl)
10799 : : {
10800 : 73544683 : decl = decl_namespace_context (decl);
10801 : 73544683 : if (DECL_NAMESPACE_STD_P (decl))
10802 : : return true;
10803 : : /* Allow inline namespaces inside of std namespace, e.g. with
10804 : : --enable-symvers=gnu-versioned-namespace std::forward would be
10805 : : actually std::_8::forward. */
10806 : 34700568 : if (!DECL_NAMESPACE_INLINE_P (decl))
10807 : : return false;
10808 : 10929946 : decl = CP_DECL_CONTEXT (decl);
10809 : : }
10810 : : return false;
10811 : : }
10812 : :
10813 : : /* Returns true if FN, a CALL_EXPR, is a call to std::forward. */
10814 : :
10815 : : static bool
10816 : 8914345 : is_std_forward_p (tree fn)
10817 : : {
10818 : : /* std::forward only takes one argument. */
10819 : 8914345 : if (call_expr_nargs (fn) != 1)
10820 : : return false;
10821 : :
10822 : 4145575 : tree fndecl = cp_get_callee_fndecl_nofold (fn);
10823 : 4145575 : if (!decl_in_std_namespace_p (fndecl))
10824 : : return false;
10825 : :
10826 : 1394428 : tree name = DECL_NAME (fndecl);
10827 : 1394428 : return name && id_equal (name, "forward");
10828 : : }
10829 : :
10830 : : /* Returns true if FN, a CALL_EXPR, is a call to std::move. */
10831 : :
10832 : : static bool
10833 : 8920815 : is_std_move_p (tree fn)
10834 : : {
10835 : : /* std::move only takes one argument. */
10836 : 8920815 : if (call_expr_nargs (fn) != 1)
10837 : : return false;
10838 : :
10839 : 4151607 : tree fndecl = cp_get_callee_fndecl_nofold (fn);
10840 : 4151607 : if (!decl_in_std_namespace_p (fndecl))
10841 : : return false;
10842 : :
10843 : 1400033 : tree name = DECL_NAME (fndecl);
10844 : 1400033 : return name && id_equal (name, "move");
10845 : : }
10846 : :
10847 : : /* Returns true if RETVAL is a good candidate for the NRVO as per
10848 : : [class.copy.elision]. FUNCTYPE is the type the function is declared
10849 : : to return. */
10850 : :
10851 : : static bool
10852 : 41023467 : can_do_nrvo_p (tree retval, tree functype)
10853 : : {
10854 : 41023467 : if (functype == error_mark_node)
10855 : : return false;
10856 : 41023426 : if (retval)
10857 : 39628783 : STRIP_ANY_LOCATION_WRAPPER (retval);
10858 : 41023426 : tree result = DECL_RESULT (current_function_decl);
10859 : 41023426 : return (retval != NULL_TREE
10860 : 39628783 : && !processing_template_decl
10861 : : /* Must be a local, automatic variable. */
10862 : 33111628 : && VAR_P (retval)
10863 : 3054209 : && DECL_CONTEXT (retval) == current_function_decl
10864 : 2412711 : && !TREE_STATIC (retval)
10865 : : /* And not a lambda or anonymous union proxy. */
10866 : 2410149 : && !DECL_HAS_VALUE_EXPR_P (retval)
10867 : 2409940 : && (DECL_ALIGN (retval) <= DECL_ALIGN (result))
10868 : : /* The cv-unqualified type of the returned value must be the
10869 : : same as the cv-unqualified return type of the
10870 : : function. */
10871 : 2409847 : && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (retval)),
10872 : : TYPE_MAIN_VARIANT (functype))
10873 : : /* And the returned value must be non-volatile. */
10874 : 43428758 : && !TYPE_VOLATILE (TREE_TYPE (retval)));
10875 : : }
10876 : :
10877 : : /* True if we would like to perform NRVO, i.e. can_do_nrvo_p is true and we
10878 : : would otherwise return in memory. */
10879 : :
10880 : : static bool
10881 : 41023140 : want_nrvo_p (tree retval, tree functype)
10882 : : {
10883 : 41023140 : return (can_do_nrvo_p (retval, functype)
10884 : 41023140 : && aggregate_value_p (functype, current_function_decl));
10885 : : }
10886 : :
10887 : : /* Like can_do_nrvo_p, but we check if we're trying to move a class
10888 : : prvalue. */
10889 : :
10890 : : static bool
10891 : 1390 : can_elide_copy_prvalue_p (tree retval, tree functype)
10892 : : {
10893 : 1390 : if (functype == error_mark_node)
10894 : : return false;
10895 : 1390 : if (retval)
10896 : 1390 : STRIP_ANY_LOCATION_WRAPPER (retval);
10897 : 1390 : return (retval != NULL_TREE
10898 : 1390 : && !glvalue_p (retval)
10899 : 135 : && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (retval)),
10900 : : TYPE_MAIN_VARIANT (functype))
10901 : 1498 : && !TYPE_VOLATILE (TREE_TYPE (retval)));
10902 : : }
10903 : :
10904 : : /* If we should treat RETVAL, an expression being returned, as if it were
10905 : : designated by an rvalue, returns it adjusted accordingly; otherwise, returns
10906 : : NULL_TREE. See [class.copy.elision]. RETURN_P is true if this is a return
10907 : : context (rather than throw). */
10908 : :
10909 : : tree
10910 : 7373703 : treat_lvalue_as_rvalue_p (tree expr, bool return_p)
10911 : : {
10912 : 7373703 : if (cxx_dialect == cxx98)
10913 : : return NULL_TREE;
10914 : :
10915 : 7363592 : tree retval = expr;
10916 : 7363592 : STRIP_ANY_LOCATION_WRAPPER (retval);
10917 : 7363592 : if (REFERENCE_REF_P (retval))
10918 : 470400 : retval = TREE_OPERAND (retval, 0);
10919 : :
10920 : : /* An implicitly movable entity is a variable of automatic storage duration
10921 : : that is either a non-volatile object or (C++20) an rvalue reference to a
10922 : : non-volatile object type. */
10923 : 7363592 : if (!(((VAR_P (retval) && !DECL_HAS_VALUE_EXPR_P (retval))
10924 : 6553228 : || TREE_CODE (retval) == PARM_DECL)
10925 : 1062781 : && !TREE_STATIC (retval)
10926 : 1037096 : && !CP_TYPE_VOLATILE_P (non_reference (TREE_TYPE (retval)))
10927 : 1037091 : && (TREE_CODE (TREE_TYPE (retval)) != REFERENCE_TYPE
10928 : 88569 : || (cxx_dialect >= cxx20
10929 : 70567 : && TYPE_REF_IS_RVALUE (TREE_TYPE (retval))))))
10930 : 6414504 : return NULL_TREE;
10931 : :
10932 : : /* If the expression in a return or co_return statement is a (possibly
10933 : : parenthesized) id-expression that names an implicitly movable entity
10934 : : declared in the body or parameter-declaration-clause of the innermost
10935 : : enclosing function or lambda-expression, */
10936 : 949088 : if (return_p)
10937 : : {
10938 : 948979 : if (DECL_CONTEXT (retval) != current_function_decl)
10939 : : return NULL_TREE;
10940 : 948940 : expr = move (expr);
10941 : 948940 : if (expr == error_mark_node)
10942 : : return NULL_TREE;
10943 : 948938 : return set_implicit_rvalue_p (expr);
10944 : : }
10945 : :
10946 : : /* if the id-expression (possibly parenthesized) is the operand of
10947 : : a throw-expression, and names an implicitly movable entity that belongs
10948 : : to a scope that does not contain the compound-statement of the innermost
10949 : : lambda-expression, try-block, or function-try-block (if any) whose
10950 : : compound-statement or ctor-initializer contains the throw-expression. */
10951 : :
10952 : : /* C++20 added move on throw of parms. */
10953 : 109 : if (TREE_CODE (retval) == PARM_DECL && cxx_dialect < cxx20)
10954 : : return NULL_TREE;
10955 : :
10956 : : /* We don't check for lambda-expression here, because we should not get past
10957 : : the DECL_HAS_VALUE_EXPR_P check above. */
10958 : 96 : for (cp_binding_level *b = current_binding_level;
10959 : 187 : b->kind != sk_namespace; b = b->level_chain)
10960 : : {
10961 : 189 : for (tree decl = b->names; decl; decl = TREE_CHAIN (decl))
10962 : 78 : if (decl == retval)
10963 : 66 : return set_implicit_rvalue_p (move (expr));
10964 : 111 : if (b->kind == sk_try)
10965 : : return NULL_TREE;
10966 : : }
10967 : :
10968 : 10 : return set_implicit_rvalue_p (move (expr));
10969 : : }
10970 : :
10971 : : /* Warn about dubious usage of std::move (in a return statement, if RETURN_P
10972 : : is true). EXPR is the std::move expression; TYPE is the type of the object
10973 : : being initialized. */
10974 : :
10975 : : void
10976 : 115181547 : maybe_warn_pessimizing_move (tree expr, tree type, bool return_p)
10977 : : {
10978 : 115181547 : if (!(warn_pessimizing_move || warn_redundant_move))
10979 : : return;
10980 : :
10981 : 4523846 : const location_t loc = cp_expr_loc_or_input_loc (expr);
10982 : :
10983 : : /* C++98 doesn't know move. */
10984 : 4523846 : if (cxx_dialect < cxx11)
10985 : : return;
10986 : :
10987 : : /* Wait until instantiation time, since we can't gauge if we should do
10988 : : the NRVO until then. */
10989 : 4459478 : if (processing_template_decl)
10990 : : return;
10991 : :
10992 : : /* This is only interesting for class types. */
10993 : 4381168 : if (!CLASS_TYPE_P (type))
10994 : : return;
10995 : :
10996 : 85607 : bool wrapped_p = false;
10997 : : /* A a = std::move (A()); */
10998 : 85607 : if (TREE_CODE (expr) == TREE_LIST)
10999 : : {
11000 : 7218 : if (list_length (expr) == 1)
11001 : : {
11002 : 4754 : expr = TREE_VALUE (expr);
11003 : 4754 : wrapped_p = true;
11004 : : }
11005 : : else
11006 : : return;
11007 : : }
11008 : : /* A a = {std::move (A())};
11009 : : A a{std::move (A())}; */
11010 : 78389 : else if (TREE_CODE (expr) == CONSTRUCTOR)
11011 : : {
11012 : 5512 : if (CONSTRUCTOR_NELTS (expr) == 1)
11013 : : {
11014 : 759 : expr = CONSTRUCTOR_ELT (expr, 0)->value;
11015 : 759 : wrapped_p = true;
11016 : : }
11017 : : else
11018 : : return;
11019 : : }
11020 : :
11021 : : /* First, check if this is a call to std::move. */
11022 : 5429 : if (!REFERENCE_REF_P (expr)
11023 : 82533 : || TREE_CODE (TREE_OPERAND (expr, 0)) != CALL_EXPR)
11024 : : return;
11025 : 2458 : tree fn = TREE_OPERAND (expr, 0);
11026 : 2458 : if (!is_std_move_p (fn))
11027 : : return;
11028 : 1988 : tree arg = CALL_EXPR_ARG (fn, 0);
11029 : 1988 : if (TREE_CODE (arg) != NOP_EXPR)
11030 : : return;
11031 : : /* If we're looking at *std::move<T&> ((T &) &arg), do the pessimizing N/RVO
11032 : : and implicitly-movable warnings. */
11033 : 1988 : if (TREE_CODE (TREE_OPERAND (arg, 0)) == ADDR_EXPR)
11034 : : {
11035 : 1390 : arg = TREE_OPERAND (arg, 0);
11036 : 1390 : arg = TREE_OPERAND (arg, 0);
11037 : 1390 : arg = convert_from_reference (arg);
11038 : 1390 : if (can_elide_copy_prvalue_p (arg, type))
11039 : : {
11040 : 108 : auto_diagnostic_group d;
11041 : 108 : if (warning_at (loc, OPT_Wpessimizing_move,
11042 : : "moving a temporary object prevents copy elision"))
11043 : 108 : inform (loc, "remove %<std::move%> call");
11044 : 108 : }
11045 : : /* The rest of the warnings is only relevant for when we are returning
11046 : : from a function. */
11047 : 1390 : if (!return_p)
11048 : : return;
11049 : :
11050 : 327 : tree moved;
11051 : : /* Warn if we could do copy elision were it not for the move. */
11052 : 327 : if (can_do_nrvo_p (arg, type))
11053 : : {
11054 : 48 : auto_diagnostic_group d;
11055 : 48 : if (!warning_suppressed_p (expr, OPT_Wpessimizing_move)
11056 : 48 : && warning_at (loc, OPT_Wpessimizing_move,
11057 : : "moving a local object in a return statement "
11058 : : "prevents copy elision"))
11059 : 42 : inform (loc, "remove %<std::move%> call");
11060 : 48 : }
11061 : : /* Warn if the move is redundant. It is redundant when we would
11062 : : do maybe-rvalue overload resolution even without std::move. */
11063 : 279 : else if (warn_redundant_move
11064 : : /* This doesn't apply for return {std::move (t)};. */
11065 : 160 : && !wrapped_p
11066 : 157 : && !warning_suppressed_p (expr, OPT_Wredundant_move)
11067 : 375 : && (moved = treat_lvalue_as_rvalue_p (arg, /*return*/true)))
11068 : : {
11069 : : /* Make sure that overload resolution would actually succeed
11070 : : if we removed the std::move call. */
11071 : 54 : tree t = convert_for_initialization (NULL_TREE, type,
11072 : : moved,
11073 : : (LOOKUP_NORMAL
11074 : : | LOOKUP_ONLYCONVERTING),
11075 : : ICR_RETURN, NULL_TREE, 0,
11076 : : tf_none);
11077 : : /* If this worked, implicit rvalue would work, so the call to
11078 : : std::move is redundant. */
11079 : 54 : if (t != error_mark_node)
11080 : : {
11081 : 54 : auto_diagnostic_group d;
11082 : 54 : if (warning_at (loc, OPT_Wredundant_move,
11083 : : "redundant move in return statement"))
11084 : 54 : inform (loc, "remove %<std::move%> call");
11085 : 54 : }
11086 : : }
11087 : : }
11088 : : /* Also try to warn about redundant std::move in code such as
11089 : : T f (const T& t)
11090 : : {
11091 : : return std::move(t);
11092 : : }
11093 : : for which EXPR will be something like
11094 : : *std::move<const T&> ((const struct T &) (const struct T *) t)
11095 : : and where the std::move does nothing if T does not have a T(const T&&)
11096 : : constructor, because the argument is const. It will not use T(T&&)
11097 : : because that would mean losing the const. */
11098 : 598 : else if (warn_redundant_move
11099 : 457 : && !warning_suppressed_p (expr, OPT_Wredundant_move)
11100 : 64 : && TYPE_REF_P (TREE_TYPE (arg))
11101 : 662 : && CP_TYPE_CONST_P (TREE_TYPE (TREE_TYPE (arg))))
11102 : : {
11103 : 18 : tree rtype = TREE_TYPE (TREE_TYPE (arg));
11104 : 18 : if (!same_type_ignoring_top_level_qualifiers_p (rtype, type))
11105 : 9 : return;
11106 : : /* Check for the unlikely case there's T(const T&&) (we don't care if
11107 : : it's deleted). */
11108 : 54 : for (tree fn : ovl_range (CLASSTYPE_CONSTRUCTORS (rtype)))
11109 : 30 : if (move_fn_p (fn))
11110 : : {
11111 : 15 : tree t = TREE_VALUE (FUNCTION_FIRST_USER_PARMTYPE (fn));
11112 : 15 : if (UNLIKELY (CP_TYPE_CONST_P (TREE_TYPE (t))))
11113 : 6 : return;
11114 : : }
11115 : 9 : auto_diagnostic_group d;
11116 : 18 : if (return_p
11117 : 9 : ? warning_at (loc, OPT_Wredundant_move,
11118 : : "redundant move in return statement")
11119 : 9 : : warning_at (loc, OPT_Wredundant_move,
11120 : : "redundant move in initialization"))
11121 : 9 : inform (loc, "remove %<std::move%> call");
11122 : 9 : }
11123 : : }
11124 : :
11125 : : /* Check that returning RETVAL from the current function is valid.
11126 : : Return an expression explicitly showing all conversions required to
11127 : : change RETVAL into the function return type, and to assign it to
11128 : : the DECL_RESULT for the function. Set *NO_WARNING to true if
11129 : : code reaches end of non-void function warning shouldn't be issued
11130 : : on this RETURN_EXPR. Set *DANGLING to true if code returns the
11131 : : address of a local variable. */
11132 : :
11133 : : tree
11134 : 96965401 : check_return_expr (tree retval, bool *no_warning, bool *dangling)
11135 : : {
11136 : 96965401 : tree result;
11137 : : /* The type actually returned by the function. */
11138 : 96965401 : tree valtype;
11139 : : /* The type the function is declared to return, or void if
11140 : : the declared type is incomplete. */
11141 : 96965401 : tree functype;
11142 : 96965401 : int fn_returns_value_p;
11143 : 96965401 : location_t loc = cp_expr_loc_or_input_loc (retval);
11144 : :
11145 : 96965401 : *no_warning = false;
11146 : 96965401 : *dangling = false;
11147 : :
11148 : : /* A `volatile' function is one that isn't supposed to return, ever.
11149 : : (This is a G++ extension, used to get better code for functions
11150 : : that call the `volatile' function.) */
11151 : 96965401 : if (TREE_THIS_VOLATILE (current_function_decl))
11152 : 3 : warning (0, "function declared %<noreturn%> has a %<return%> statement");
11153 : :
11154 : : /* Check for various simple errors. */
11155 : 193930802 : if (DECL_DESTRUCTOR_P (current_function_decl))
11156 : : {
11157 : 1509 : if (retval)
11158 : 3 : error_at (loc, "returning a value from a destructor");
11159 : :
11160 : 1509 : if (targetm.cxx.cdtor_returns_this () && !processing_template_decl)
11161 : 0 : retval = current_class_ptr;
11162 : : else
11163 : : return NULL_TREE;
11164 : : }
11165 : 96963892 : else if (DECL_CONSTRUCTOR_P (current_function_decl))
11166 : : {
11167 : 38564 : if (in_function_try_handler)
11168 : : /* If a return statement appears in a handler of the
11169 : : function-try-block of a constructor, the program is ill-formed. */
11170 : 0 : error ("cannot return from a handler of a function-try-block of a constructor");
11171 : 38564 : else if (retval)
11172 : : /* You can't return a value from a constructor. */
11173 : 3 : error_at (loc, "returning a value from a constructor");
11174 : :
11175 : 38564 : if (targetm.cxx.cdtor_returns_this () && !processing_template_decl)
11176 : 0 : retval = current_class_ptr;
11177 : : else
11178 : : return NULL_TREE;
11179 : : }
11180 : :
11181 : 96925328 : const tree saved_retval = retval;
11182 : :
11183 : 96925328 : if (processing_template_decl)
11184 : : {
11185 : 63211341 : current_function_returns_value = 1;
11186 : :
11187 : 63211341 : if (check_for_bare_parameter_packs (retval))
11188 : 10 : return error_mark_node;
11189 : :
11190 : : /* If one of the types might be void, we can't tell whether we're
11191 : : returning a value. */
11192 : 63211331 : if ((WILDCARD_TYPE_P (TREE_TYPE (DECL_RESULT (current_function_decl)))
11193 : 24476879 : && !FNDECL_USED_AUTO (current_function_decl))
11194 : 38734452 : || (retval != NULL_TREE
11195 : 37739440 : && (TREE_TYPE (retval) == NULL_TREE
11196 : 26431386 : || WILDCARD_TYPE_P (TREE_TYPE (retval)))))
11197 : 42855411 : goto dependent;
11198 : : }
11199 : :
11200 : 54069907 : functype = TREE_TYPE (TREE_TYPE (current_function_decl));
11201 : :
11202 : : /* Deduce auto return type from a return statement. */
11203 : 54069907 : if (FNDECL_USED_AUTO (current_function_decl))
11204 : : {
11205 : 680143 : tree pattern = DECL_SAVED_AUTO_RETURN_TYPE (current_function_decl);
11206 : 680143 : tree auto_node;
11207 : 680143 : tree type;
11208 : :
11209 : 680143 : if (!retval && !is_auto (pattern))
11210 : : {
11211 : : /* Give a helpful error message. */
11212 : 3 : auto_diagnostic_group d;
11213 : 3 : error ("return-statement with no value, in function returning %qT",
11214 : : pattern);
11215 : 3 : inform (input_location, "only plain %<auto%> return type can be "
11216 : : "deduced to %<void%>");
11217 : 3 : type = error_mark_node;
11218 : 3 : }
11219 : 680140 : else if (retval && BRACE_ENCLOSED_INITIALIZER_P (retval))
11220 : : {
11221 : 6 : error ("returning initializer list");
11222 : 6 : type = error_mark_node;
11223 : : }
11224 : : else
11225 : : {
11226 : 680134 : if (!retval)
11227 : 4610 : retval = void_node;
11228 : 680134 : auto_node = type_uses_auto (pattern);
11229 : 680134 : type = do_auto_deduction (pattern, retval, auto_node,
11230 : : tf_warning_or_error, adc_return_type);
11231 : : }
11232 : :
11233 : 680143 : if (type == error_mark_node)
11234 : : /* Leave it. */;
11235 : 679957 : else if (functype == pattern)
11236 : 426514 : apply_deduced_return_type (current_function_decl, type);
11237 : 253443 : else if (!same_type_p (type, functype))
11238 : : {
11239 : 21 : if (LAMBDA_FUNCTION_P (current_function_decl))
11240 : 6 : error_at (loc, "inconsistent types %qT and %qT deduced for "
11241 : : "lambda return type", functype, type);
11242 : : else
11243 : 9 : error_at (loc, "inconsistent deduction for auto return type: "
11244 : : "%qT and then %qT", functype, type);
11245 : : }
11246 : : functype = type;
11247 : : }
11248 : :
11249 : 54069907 : result = DECL_RESULT (current_function_decl);
11250 : 54069907 : valtype = TREE_TYPE (result);
11251 : 54069907 : gcc_assert (valtype != NULL_TREE);
11252 : 54069907 : fn_returns_value_p = !VOID_TYPE_P (valtype);
11253 : :
11254 : : /* Check for a return statement with no return value in a function
11255 : : that's supposed to return a value. */
11256 : 54069907 : if (!retval && fn_returns_value_p)
11257 : : {
11258 : 35 : if (functype != error_mark_node)
11259 : 32 : permerror (input_location, "return-statement with no value, in "
11260 : : "function returning %qT", valtype);
11261 : : /* Remember that this function did return. */
11262 : 35 : current_function_returns_value = 1;
11263 : : /* But suppress NRV .*/
11264 : 35 : current_function_return_value = error_mark_node;
11265 : : /* And signal caller that TREE_NO_WARNING should be set on the
11266 : : RETURN_EXPR to avoid control reaches end of non-void function
11267 : : warnings in tree-cfg.cc. */
11268 : 35 : *no_warning = true;
11269 : : }
11270 : : /* Check for a return statement with a value in a function that
11271 : : isn't supposed to return a value. */
11272 : 54069872 : else if (retval && !fn_returns_value_p)
11273 : : {
11274 : 211788 : if (VOID_TYPE_P (TREE_TYPE (retval)))
11275 : : /* You can return a `void' value from a function of `void'
11276 : : type. In that case, we have to evaluate the expression for
11277 : : its side-effects. */
11278 : 211765 : finish_expr_stmt (retval);
11279 : 23 : else if (retval != error_mark_node)
11280 : 20 : permerror (loc, "return-statement with a value, in function "
11281 : : "returning %qT", valtype);
11282 : 211788 : current_function_returns_null = 1;
11283 : :
11284 : : /* There's really no value to return, after all. */
11285 : 211788 : return NULL_TREE;
11286 : : }
11287 : 53858084 : else if (!retval)
11288 : : /* Remember that this function can sometimes return without a
11289 : : value. */
11290 : 1394626 : current_function_returns_null = 1;
11291 : : else
11292 : : /* Remember that this function did return a value. */
11293 : 52463458 : current_function_returns_value = 1;
11294 : :
11295 : : /* Check for erroneous operands -- but after giving ourselves a
11296 : : chance to provide an error about returning a value from a void
11297 : : function. */
11298 : 53858119 : if (error_operand_p (retval))
11299 : : {
11300 : 911 : current_function_return_value = error_mark_node;
11301 : 911 : return error_mark_node;
11302 : : }
11303 : :
11304 : : /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
11305 : 107714416 : if (IDENTIFIER_NEW_OP_P (DECL_NAME (current_function_decl))
11306 : 28796 : && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
11307 : 2772 : && ! flag_check_new
11308 : 53859971 : && retval && null_ptr_cst_p (retval))
11309 : 24 : warning (0, "%<operator new%> must not return NULL unless it is "
11310 : : "declared %<throw()%> (or %<-fcheck-new%> is in effect)");
11311 : :
11312 : : /* Effective C++ rule 15. See also start_function. */
11313 : 53857208 : if (warn_ecpp
11314 : 42 : && DECL_NAME (current_function_decl) == assign_op_identifier
11315 : 53857238 : && !type_dependent_expression_p (retval))
11316 : : {
11317 : 27 : bool warn = true;
11318 : :
11319 : : /* The function return type must be a reference to the current
11320 : : class. */
11321 : 27 : if (TYPE_REF_P (valtype)
11322 : 45 : && same_type_ignoring_top_level_qualifiers_p
11323 : 18 : (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
11324 : : {
11325 : : /* Returning '*this' is obviously OK. */
11326 : 18 : if (retval == current_class_ref)
11327 : : warn = false;
11328 : : /* If we are calling a function whose return type is the same of
11329 : : the current class reference, it is ok. */
11330 : 6 : else if (INDIRECT_REF_P (retval)
11331 : 6 : && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
11332 : : warn = false;
11333 : : }
11334 : :
11335 : : if (warn)
11336 : 9 : warning_at (loc, OPT_Weffc__,
11337 : : "%<operator=%> should return a reference to %<*this%>");
11338 : : }
11339 : :
11340 : 53857208 : if (dependent_type_p (functype)
11341 : 53857208 : || type_dependent_expression_p (retval))
11342 : : {
11343 : 55689479 : dependent:
11344 : : /* We should not have changed the return value. */
11345 : 55689479 : gcc_assert (retval == saved_retval);
11346 : : /* We don't know if this is an lvalue or rvalue use, but
11347 : : either way we can mark it as read. */
11348 : 55689479 : mark_exp_read (retval);
11349 : 55689479 : return retval;
11350 : : }
11351 : :
11352 : : /* The fabled Named Return Value optimization, as per [class.copy]/15:
11353 : :
11354 : : [...] For a function with a class return type, if the expression
11355 : : in the return statement is the name of a local object, and the cv-
11356 : : unqualified type of the local object is the same as the function
11357 : : return type, an implementation is permitted to omit creating the tem-
11358 : : porary object to hold the function return value [...]
11359 : :
11360 : : So, if this is a value-returning function that always returns the same
11361 : : local variable, remember it.
11362 : :
11363 : : We choose the first suitable variable even if the function sometimes
11364 : : returns something else, but only if the variable is out of scope at the
11365 : : other return sites, or else we run the risk of clobbering the variable we
11366 : : chose if the other returned expression uses the chosen variable somehow.
11367 : :
11368 : : We don't currently do this if the first return is a non-variable, as it
11369 : : would be complicated to determine whether an NRV selected later was in
11370 : : scope at the point of the earlier return. We also don't currently support
11371 : : multiple variables with non-overlapping scopes (53637).
11372 : :
11373 : : See finish_function and finalize_nrv for the rest of this optimization. */
11374 : 41023140 : tree bare_retval = NULL_TREE;
11375 : 41023140 : if (retval)
11376 : : {
11377 : 39628494 : retval = maybe_undo_parenthesized_ref (retval);
11378 : 39628494 : bare_retval = tree_strip_any_location_wrapper (retval);
11379 : : }
11380 : :
11381 : 41023140 : bool named_return_value_okay_p = want_nrvo_p (bare_retval, functype);
11382 : 41023140 : if (fn_returns_value_p && flag_elide_constructors
11383 : 39628473 : && current_function_return_value != bare_retval)
11384 : : {
11385 : 39618710 : if (named_return_value_okay_p
11386 : 204836 : && current_function_return_value == NULL_TREE)
11387 : 165480 : current_function_return_value = bare_retval;
11388 : 39453230 : else if (current_function_return_value
11389 : 7285860 : && VAR_P (current_function_return_value)
11390 : 131 : && DECL_NAME (current_function_return_value)
11391 : 39453361 : && !decl_in_scope_p (current_function_return_value))
11392 : : {
11393 : : /* The earlier NRV is out of scope at this point, so it's safe to
11394 : 64 : leave it alone; the current return can't refer to it. */;
11395 : 64 : if (named_return_value_okay_p
11396 : 64 : && !warning_suppressed_p (current_function_decl, OPT_Wnrvo))
11397 : : {
11398 : 8 : warning (OPT_Wnrvo, "not eliding copy on return from %qD",
11399 : : bare_retval);
11400 : 8 : suppress_warning (current_function_decl, OPT_Wnrvo);
11401 : : }
11402 : : }
11403 : : else
11404 : : {
11405 : 39453166 : if ((named_return_value_okay_p
11406 : 39413820 : || (current_function_return_value
11407 : 7246450 : && current_function_return_value != error_mark_node))
11408 : 39453211 : && !warning_suppressed_p (current_function_decl, OPT_Wnrvo))
11409 : : {
11410 : 39325 : warning (OPT_Wnrvo, "not eliding copy on return in %qD",
11411 : : current_function_decl);
11412 : 39325 : suppress_warning (current_function_decl, OPT_Wnrvo);
11413 : : }
11414 : 39453166 : current_function_return_value = error_mark_node;
11415 : : }
11416 : : }
11417 : :
11418 : : /* We don't need to do any conversions when there's nothing being
11419 : : returned. */
11420 : 41023140 : if (!retval)
11421 : : return NULL_TREE;
11422 : :
11423 : 39628494 : if (!named_return_value_okay_p)
11424 : 39413895 : maybe_warn_pessimizing_move (retval, functype, /*return_p*/true);
11425 : :
11426 : : /* Do any required conversions. */
11427 : 79256988 : if (bare_retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
11428 : : /* No conversions are required. */
11429 : : ;
11430 : : else
11431 : : {
11432 : 39628494 : int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
11433 : :
11434 : : /* The functype's return type will have been set to void, if it
11435 : : was an incomplete type. Just treat this as 'return;' */
11436 : 39628494 : if (VOID_TYPE_P (functype))
11437 : 6 : return error_mark_node;
11438 : :
11439 : : /* Under C++11 [12.8/32 class.copy], a returned lvalue is sometimes
11440 : : treated as an rvalue for the purposes of overload resolution to
11441 : : favor move constructors over copy constructors.
11442 : :
11443 : : Note that these conditions are similar to, but not as strict as,
11444 : : the conditions for the named return value optimization. */
11445 : 39628488 : bool converted = false;
11446 : 39628488 : tree moved;
11447 : : /* Until C++23, this was only interesting for class type, but in C++23,
11448 : : we should do the below when we're converting rom/to a class/reference
11449 : : (a non-scalar type). */
11450 : 39628488 : if ((cxx_dialect < cxx23
11451 : 4421319 : ? CLASS_TYPE_P (functype)
11452 : 8032734 : : !SCALAR_TYPE_P (functype) || !SCALAR_TYPE_P (TREE_TYPE (retval)))
11453 : 46431730 : && (moved = treat_lvalue_as_rvalue_p (retval, /*return*/true)))
11454 : : /* In C++20 and earlier we treat the return value as an rvalue
11455 : : that can bind to lvalue refs. In C++23, such an expression is just
11456 : : an xvalue (see reference_binding). */
11457 : : retval = moved;
11458 : :
11459 : : /* The call in a (lambda) thunk needs no conversions. */
11460 : 39628488 : if (TREE_CODE (retval) == CALL_EXPR
11461 : 39628488 : && call_from_lambda_thunk_p (retval))
11462 : : converted = true;
11463 : :
11464 : : /* First convert the value to the function's return type, then
11465 : : to the type of return value's location to handle the
11466 : : case that functype is smaller than the valtype. */
11467 : 39619423 : if (!converted)
11468 : 39619423 : retval = convert_for_initialization
11469 : 39619423 : (NULL_TREE, functype, retval, flags, ICR_RETURN, NULL_TREE, 0,
11470 : : tf_warning_or_error);
11471 : 39628488 : retval = convert (valtype, retval);
11472 : :
11473 : : /* If the conversion failed, treat this just like `return;'. */
11474 : 39628488 : if (retval == error_mark_node)
11475 : : {
11476 : : /* And suppress NRV. */
11477 : 187 : current_function_return_value = error_mark_node;
11478 : 187 : return retval;
11479 : : }
11480 : : /* We can't initialize a register from a AGGR_INIT_EXPR. */
11481 : 39628301 : else if (! cfun->returns_struct
11482 : 38260550 : && TREE_CODE (retval) == TARGET_EXPR
11483 : 43718226 : && TREE_CODE (TARGET_EXPR_INITIAL (retval)) == AGGR_INIT_EXPR)
11484 : 708584 : retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
11485 : 708584 : TARGET_EXPR_SLOT (retval));
11486 : 38919717 : else if (!processing_template_decl
11487 : 32402574 : && maybe_warn_about_returning_address_of_local (retval, loc)
11488 : 38919897 : && INDIRECT_TYPE_P (valtype))
11489 : 165 : *dangling = true;
11490 : : }
11491 : :
11492 : : /* A naive attempt to reduce the number of -Wdangling-reference false
11493 : : positives: if we know that this function can return a variable with
11494 : : static storage duration rather than one of its parameters, suppress
11495 : : the warning. */
11496 : 39628301 : if (warn_dangling_reference
11497 : 360946 : && TYPE_REF_P (functype)
11498 : 23778 : && bare_retval
11499 : : && VAR_P (bare_retval)
11500 : 23778 : && TREE_STATIC (bare_retval))
11501 : 50 : suppress_warning (current_function_decl, OPT_Wdangling_reference);
11502 : :
11503 : 39628301 : if (processing_template_decl)
11504 : : return saved_retval;
11505 : :
11506 : : /* Actually copy the value returned into the appropriate location. */
11507 : 33111158 : if (retval && retval != result)
11508 : 33111158 : retval = cp_build_init_expr (result, retval);
11509 : :
11510 : 33111158 : if (current_function_return_value == bare_retval)
11511 : 175237 : INIT_EXPR_NRV_P (retval) = true;
11512 : :
11513 : 33111158 : if (tree set = maybe_set_retval_sentinel ())
11514 : 129320 : retval = build2 (COMPOUND_EXPR, void_type_node, retval, set);
11515 : :
11516 : : return retval;
11517 : : }
11518 : :
11519 : :
11520 : : /* Returns nonzero if the pointer-type FROM can be converted to the
11521 : : pointer-type TO via a qualification conversion. If CONSTP is -1,
11522 : : then we return nonzero if the pointers are similar, and the
11523 : : cv-qualification signature of FROM is a proper subset of that of TO.
11524 : :
11525 : : If CONSTP is positive, then all outer pointers have been
11526 : : const-qualified. */
11527 : :
11528 : : static bool
11529 : 112267916 : comp_ptr_ttypes_real (tree to, tree from, int constp)
11530 : : {
11531 : 112267916 : bool to_more_cv_qualified = false;
11532 : 112267916 : bool is_opaque_pointer = false;
11533 : :
11534 : 497235 : for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
11535 : : {
11536 : 112765151 : if (TREE_CODE (to) != TREE_CODE (from))
11537 : : return false;
11538 : :
11539 : 70165813 : if (TREE_CODE (from) == OFFSET_TYPE
11540 : 70165813 : && !same_type_p (TYPE_OFFSET_BASETYPE (from),
11541 : : TYPE_OFFSET_BASETYPE (to)))
11542 : : return false;
11543 : :
11544 : : /* Const and volatile mean something different for function and
11545 : : array types, so the usual checks are not appropriate. We'll
11546 : : check the array type elements in further iterations. */
11547 : 70165813 : if (!FUNC_OR_METHOD_TYPE_P (to) && TREE_CODE (to) != ARRAY_TYPE)
11548 : : {
11549 : 69952472 : if (!at_least_as_qualified_p (to, from))
11550 : : return false;
11551 : :
11552 : 61796617 : if (!at_least_as_qualified_p (from, to))
11553 : : {
11554 : 42976948 : if (constp == 0)
11555 : : return false;
11556 : : to_more_cv_qualified = true;
11557 : : }
11558 : :
11559 : 61796358 : if (constp > 0)
11560 : 61792161 : constp &= TYPE_READONLY (to);
11561 : : }
11562 : :
11563 : 62009699 : if (VECTOR_TYPE_P (to))
11564 : 5936 : is_opaque_pointer = vector_targets_convertible_p (to, from);
11565 : :
11566 : : /* P0388R4 allows a conversion from int[N] to int[] but not the
11567 : : other way round. When both arrays have bounds but they do
11568 : : not match, then no conversion is possible. */
11569 : 62009699 : if (TREE_CODE (to) == ARRAY_TYPE
11570 : 62009699 : && !comp_array_types (to, from, bounds_first, /*strict=*/false))
11571 : : return false;
11572 : :
11573 : 62009446 : if (!TYPE_PTR_P (to)
11574 : : && !TYPE_PTRDATAMEM_P (to)
11575 : : /* CWG 330 says we need to look through arrays. */
11576 : : && TREE_CODE (to) != ARRAY_TYPE)
11577 : 61512211 : return ((constp >= 0 || to_more_cv_qualified)
11578 : 61512211 : && (is_opaque_pointer
11579 : 61511713 : || same_type_ignoring_top_level_qualifiers_p (to, from)));
11580 : : }
11581 : : }
11582 : :
11583 : : /* When comparing, say, char ** to char const **, this function takes
11584 : : the 'char *' and 'char const *'. Do not pass non-pointer/reference
11585 : : types to this function. */
11586 : :
11587 : : int
11588 : 112267344 : comp_ptr_ttypes (tree to, tree from)
11589 : : {
11590 : 112267344 : return comp_ptr_ttypes_real (to, from, 1);
11591 : : }
11592 : :
11593 : : /* Returns true iff FNTYPE is a non-class type that involves
11594 : : error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
11595 : : if a parameter type is ill-formed. */
11596 : :
11597 : : bool
11598 : 590572 : error_type_p (const_tree type)
11599 : : {
11600 : 632762 : tree t;
11601 : :
11602 : 632762 : switch (TREE_CODE (type))
11603 : : {
11604 : : case ERROR_MARK:
11605 : : return true;
11606 : :
11607 : 42101 : case POINTER_TYPE:
11608 : 42101 : case REFERENCE_TYPE:
11609 : 42101 : case OFFSET_TYPE:
11610 : 42101 : return error_type_p (TREE_TYPE (type));
11611 : :
11612 : 3639 : case FUNCTION_TYPE:
11613 : 3639 : case METHOD_TYPE:
11614 : 3639 : if (error_type_p (TREE_TYPE (type)))
11615 : : return true;
11616 : 10041 : for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
11617 : 6408 : if (error_type_p (TREE_VALUE (t)))
11618 : : return true;
11619 : : return false;
11620 : :
11621 : 193032 : case RECORD_TYPE:
11622 : 193032 : if (TYPE_PTRMEMFUNC_P (type))
11623 : 89 : return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type));
11624 : : return false;
11625 : :
11626 : : default:
11627 : : return false;
11628 : : }
11629 : : }
11630 : :
11631 : : /* Returns true if to and from are (possibly multi-level) pointers to the same
11632 : : type or inheritance-related types, regardless of cv-quals. */
11633 : :
11634 : : bool
11635 : 79943812 : ptr_reasonably_similar (const_tree to, const_tree from)
11636 : : {
11637 : 944 : for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
11638 : : {
11639 : : /* Any target type is similar enough to void. */
11640 : 79944756 : if (VOID_TYPE_P (to))
11641 : 973 : return !error_type_p (from);
11642 : 79943783 : if (VOID_TYPE_P (from))
11643 : 576626 : return !error_type_p (to);
11644 : :
11645 : 79367157 : if (TREE_CODE (to) != TREE_CODE (from))
11646 : : return false;
11647 : :
11648 : 37222477 : if (TREE_CODE (from) == OFFSET_TYPE
11649 : 37222477 : && comptypes (TYPE_OFFSET_BASETYPE (to),
11650 : 3 : TYPE_OFFSET_BASETYPE (from),
11651 : : COMPARE_BASE | COMPARE_DERIVED))
11652 : 3 : continue;
11653 : :
11654 : 37222471 : if (VECTOR_TYPE_P (to)
11655 : 37222471 : && vector_types_convertible_p (to, from, false))
11656 : : return true;
11657 : :
11658 : 37222387 : if (TREE_CODE (to) == INTEGER_TYPE
11659 : 37222387 : && TYPE_PRECISION (to) == TYPE_PRECISION (from))
11660 : : return true;
11661 : :
11662 : 37076082 : if (TREE_CODE (to) == FUNCTION_TYPE)
11663 : 1463 : return !error_type_p (to) && !error_type_p (from);
11664 : :
11665 : 37074619 : if (!TYPE_PTR_P (to))
11666 : : {
11667 : : /* When either type is incomplete avoid DERIVED_FROM_P,
11668 : : which may call complete_type (c++/57942). */
11669 : 37073678 : bool b = !COMPLETE_TYPE_P (to) || !COMPLETE_TYPE_P (from);
11670 : : return comptypes
11671 : 37073678 : (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
11672 : 37073678 : b ? COMPARE_STRICT : COMPARE_BASE | COMPARE_DERIVED);
11673 : : }
11674 : 944 : }
11675 : : }
11676 : :
11677 : : /* Return true if TO and FROM (both of which are POINTER_TYPEs or
11678 : : pointer-to-member types) are the same, ignoring cv-qualification at
11679 : : all levels. CB says how we should behave when comparing array bounds. */
11680 : :
11681 : : bool
11682 : 584083 : comp_ptr_ttypes_const (tree to, tree from, compare_bounds_t cb)
11683 : : {
11684 : 584083 : bool is_opaque_pointer = false;
11685 : :
11686 : 585070 : for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
11687 : : {
11688 : 1169153 : if (TREE_CODE (to) != TREE_CODE (from))
11689 : : return false;
11690 : :
11691 : 878374 : if (TREE_CODE (from) == OFFSET_TYPE
11692 : 878338 : && same_type_p (TYPE_OFFSET_BASETYPE (from),
11693 : : TYPE_OFFSET_BASETYPE (to)))
11694 : 36 : continue;
11695 : :
11696 : 878302 : if (VECTOR_TYPE_P (to))
11697 : 7485 : is_opaque_pointer = vector_targets_convertible_p (to, from);
11698 : :
11699 : 878302 : if (TREE_CODE (to) == ARRAY_TYPE
11700 : : /* Ignore cv-qualification, but if we see e.g. int[3] and int[4],
11701 : : we must fail. */
11702 : 878302 : && !comp_array_types (to, from, cb, /*strict=*/false))
11703 : : return false;
11704 : :
11705 : : /* CWG 330 says we need to look through arrays. */
11706 : 877878 : if (!TYPE_PTR_P (to) && TREE_CODE (to) != ARRAY_TYPE)
11707 : 292844 : return (is_opaque_pointer
11708 : 292844 : || same_type_ignoring_top_level_qualifiers_p (to, from));
11709 : : }
11710 : : }
11711 : :
11712 : : /* Returns the type qualifiers for this type, including the qualifiers on the
11713 : : elements for an array type. */
11714 : :
11715 : : int
11716 : 42236070314 : cp_type_quals (const_tree type)
11717 : : {
11718 : 42236070314 : int quals;
11719 : : /* This CONST_CAST is okay because strip_array_types returns its
11720 : : argument unmodified and we assign it to a const_tree. */
11721 : 42236070314 : type = strip_array_types (CONST_CAST_TREE (type));
11722 : 42236070314 : if (type == error_mark_node
11723 : : /* Quals on a FUNCTION_TYPE are memfn quals. */
11724 : 42208940693 : || TREE_CODE (type) == FUNCTION_TYPE)
11725 : : return TYPE_UNQUALIFIED;
11726 : 42170810316 : quals = TYPE_QUALS (type);
11727 : : /* METHOD and REFERENCE_TYPEs should never have quals. */
11728 : 42170810316 : gcc_assert ((TREE_CODE (type) != METHOD_TYPE
11729 : : && !TYPE_REF_P (type))
11730 : : || ((quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE))
11731 : : == TYPE_UNQUALIFIED));
11732 : : return quals;
11733 : : }
11734 : :
11735 : : /* Returns the function-ref-qualifier for TYPE */
11736 : :
11737 : : cp_ref_qualifier
11738 : 2292068296 : type_memfn_rqual (const_tree type)
11739 : : {
11740 : 2292068296 : gcc_assert (FUNC_OR_METHOD_TYPE_P (type));
11741 : :
11742 : 2292068296 : if (!FUNCTION_REF_QUALIFIED (type))
11743 : : return REF_QUAL_NONE;
11744 : 36068114 : else if (FUNCTION_RVALUE_QUALIFIED (type))
11745 : : return REF_QUAL_RVALUE;
11746 : : else
11747 : 18075903 : return REF_QUAL_LVALUE;
11748 : : }
11749 : :
11750 : : /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
11751 : : METHOD_TYPE. */
11752 : :
11753 : : int
11754 : 902800096 : type_memfn_quals (const_tree type)
11755 : : {
11756 : 902800096 : if (TREE_CODE (type) == FUNCTION_TYPE)
11757 : 68207363 : return TYPE_QUALS (type);
11758 : 834592733 : else if (TREE_CODE (type) == METHOD_TYPE)
11759 : 834592733 : return cp_type_quals (class_of_this_parm (type));
11760 : : else
11761 : 0 : gcc_unreachable ();
11762 : : }
11763 : :
11764 : : /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
11765 : : MEMFN_QUALS and its ref-qualifier to RQUAL. */
11766 : :
11767 : : tree
11768 : 47473652 : apply_memfn_quals (tree type, cp_cv_quals memfn_quals, cp_ref_qualifier rqual)
11769 : : {
11770 : : /* Could handle METHOD_TYPE here if necessary. */
11771 : 47473652 : gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
11772 : 47473652 : if (TYPE_QUALS (type) == memfn_quals
11773 : 47473652 : && type_memfn_rqual (type) == rqual)
11774 : : return type;
11775 : :
11776 : : /* This should really have a different TYPE_MAIN_VARIANT, but that gets
11777 : : complex. */
11778 : 562839 : tree result = build_qualified_type (type, memfn_quals);
11779 : 562839 : return build_ref_qualified_type (result, rqual);
11780 : : }
11781 : :
11782 : : /* Returns nonzero if TYPE is const or volatile. */
11783 : :
11784 : : bool
11785 : 897092999 : cv_qualified_p (const_tree type)
11786 : : {
11787 : 897092999 : int quals = cp_type_quals (type);
11788 : 897092999 : return (quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE)) != 0;
11789 : : }
11790 : :
11791 : : /* Returns nonzero if the TYPE contains a mutable member. */
11792 : :
11793 : : bool
11794 : 750349968 : cp_has_mutable_p (const_tree type)
11795 : : {
11796 : : /* This CONST_CAST is okay because strip_array_types returns its
11797 : : argument unmodified and we assign it to a const_tree. */
11798 : 750349968 : type = strip_array_types (CONST_CAST_TREE(type));
11799 : :
11800 : 750349968 : return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
11801 : : }
11802 : :
11803 : : /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
11804 : : TYPE_QUALS. For a VAR_DECL, this may be an optimistic
11805 : : approximation. In particular, consider:
11806 : :
11807 : : int f();
11808 : : struct S { int i; };
11809 : : const S s = { f(); }
11810 : :
11811 : : Here, we will make "s" as TREE_READONLY (because it is declared
11812 : : "const") -- only to reverse ourselves upon seeing that the
11813 : : initializer is non-constant. */
11814 : :
11815 : : void
11816 : 798070429 : cp_apply_type_quals_to_decl (int type_quals, tree decl)
11817 : : {
11818 : 798070429 : tree type = TREE_TYPE (decl);
11819 : :
11820 : 798070429 : if (type == error_mark_node)
11821 : : return;
11822 : :
11823 : 798069793 : if (TREE_CODE (decl) == TYPE_DECL)
11824 : : return;
11825 : :
11826 : 715404082 : gcc_assert (!(TREE_CODE (type) == FUNCTION_TYPE
11827 : : && type_quals != TYPE_UNQUALIFIED));
11828 : :
11829 : : /* Avoid setting TREE_READONLY incorrectly. */
11830 : : /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
11831 : : constructor can produce constant init, so rely on cp_finish_decl to
11832 : : clear TREE_READONLY if the variable has non-constant init. */
11833 : :
11834 : : /* If the type has (or might have) a mutable component, that component
11835 : : might be modified. */
11836 : 715404082 : if (TYPE_HAS_MUTABLE_P (type) || !COMPLETE_TYPE_P (type))
11837 : 64034509 : type_quals &= ~TYPE_QUAL_CONST;
11838 : :
11839 : 715404082 : c_apply_type_quals_to_decl (type_quals, decl);
11840 : : }
11841 : :
11842 : : /* Subroutine of casts_away_constness. Make T1 and T2 point at
11843 : : exemplar types such that casting T1 to T2 is casting away constness
11844 : : if and only if there is no implicit conversion from T1 to T2. */
11845 : :
11846 : : static void
11847 : 1058895 : casts_away_constness_r (tree *t1, tree *t2, tsubst_flags_t complain)
11848 : : {
11849 : 1058895 : int quals1;
11850 : 1058895 : int quals2;
11851 : :
11852 : : /* [expr.const.cast]
11853 : :
11854 : : For multi-level pointer to members and multi-level mixed pointers
11855 : : and pointers to members (conv.qual), the "member" aspect of a
11856 : : pointer to member level is ignored when determining if a const
11857 : : cv-qualifier has been cast away. */
11858 : : /* [expr.const.cast]
11859 : :
11860 : : For two pointer types:
11861 : :
11862 : : X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
11863 : : X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
11864 : : K is min(N,M)
11865 : :
11866 : : casting from X1 to X2 casts away constness if, for a non-pointer
11867 : : type T there does not exist an implicit conversion (clause
11868 : : _conv_) from:
11869 : :
11870 : : Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
11871 : :
11872 : : to
11873 : :
11874 : : Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
11875 : 1058895 : if ((!TYPE_PTR_P (*t1) && !TYPE_PTRDATAMEM_P (*t1))
11876 : 529768 : || (!TYPE_PTR_P (*t2) && !TYPE_PTRDATAMEM_P (*t2)))
11877 : : {
11878 : 529275 : *t1 = cp_build_qualified_type (void_type_node,
11879 : : cp_type_quals (*t1));
11880 : 529275 : *t2 = cp_build_qualified_type (void_type_node,
11881 : : cp_type_quals (*t2));
11882 : 529275 : return;
11883 : : }
11884 : :
11885 : 529620 : quals1 = cp_type_quals (*t1);
11886 : 529620 : quals2 = cp_type_quals (*t2);
11887 : :
11888 : 529620 : if (TYPE_PTRDATAMEM_P (*t1))
11889 : 0 : *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
11890 : : else
11891 : 529620 : *t1 = TREE_TYPE (*t1);
11892 : 529620 : if (TYPE_PTRDATAMEM_P (*t2))
11893 : 0 : *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
11894 : : else
11895 : 529620 : *t2 = TREE_TYPE (*t2);
11896 : :
11897 : 529620 : casts_away_constness_r (t1, t2, complain);
11898 : 529620 : *t1 = build_pointer_type (*t1);
11899 : 529620 : *t2 = build_pointer_type (*t2);
11900 : 529620 : *t1 = cp_build_qualified_type (*t1, quals1);
11901 : 529620 : *t2 = cp_build_qualified_type (*t2, quals2);
11902 : : }
11903 : :
11904 : : /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
11905 : : constness.
11906 : :
11907 : : ??? This function returns non-zero if casting away qualifiers not
11908 : : just const. We would like to return to the caller exactly which
11909 : : qualifiers are casted away to give more accurate diagnostics.
11910 : : */
11911 : :
11912 : : static bool
11913 : 529347 : casts_away_constness (tree t1, tree t2, tsubst_flags_t complain)
11914 : : {
11915 : 529347 : if (TYPE_REF_P (t2))
11916 : : {
11917 : : /* [expr.const.cast]
11918 : :
11919 : : Casting from an lvalue of type T1 to an lvalue of type T2
11920 : : using a reference cast casts away constness if a cast from an
11921 : : rvalue of type "pointer to T1" to the type "pointer to T2"
11922 : : casts away constness. */
11923 : 0 : t1 = (TYPE_REF_P (t1) ? TREE_TYPE (t1) : t1);
11924 : 0 : return casts_away_constness (build_pointer_type (t1),
11925 : 0 : build_pointer_type (TREE_TYPE (t2)),
11926 : 0 : complain);
11927 : : }
11928 : :
11929 : 529347 : if (TYPE_PTRDATAMEM_P (t1) && TYPE_PTRDATAMEM_P (t2))
11930 : : /* [expr.const.cast]
11931 : :
11932 : : Casting from an rvalue of type "pointer to data member of X
11933 : : of type T1" to the type "pointer to data member of Y of type
11934 : : T2" casts away constness if a cast from an rvalue of type
11935 : : "pointer to T1" to the type "pointer to T2" casts away
11936 : : constness. */
11937 : 48 : return casts_away_constness
11938 : 48 : (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
11939 : 48 : build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)),
11940 : 48 : complain);
11941 : :
11942 : : /* Casting away constness is only something that makes sense for
11943 : : pointer or reference types. */
11944 : 529299 : if (!TYPE_PTR_P (t1) || !TYPE_PTR_P (t2))
11945 : : return false;
11946 : :
11947 : : /* Top-level qualifiers don't matter. */
11948 : 529275 : t1 = TYPE_MAIN_VARIANT (t1);
11949 : 529275 : t2 = TYPE_MAIN_VARIANT (t2);
11950 : 529275 : casts_away_constness_r (&t1, &t2, complain);
11951 : 529275 : if (!can_convert (t2, t1, complain))
11952 : : return true;
11953 : :
11954 : : return false;
11955 : : }
11956 : :
11957 : : /* If T is a REFERENCE_TYPE return the type to which T refers.
11958 : : Otherwise, return T itself. */
11959 : :
11960 : : tree
11961 : 2554151832 : non_reference (tree t)
11962 : : {
11963 : 2554151832 : if (t && TYPE_REF_P (t))
11964 : 247146307 : t = TREE_TYPE (t);
11965 : 2554151832 : return t;
11966 : : }
11967 : :
11968 : :
11969 : : /* Return nonzero if REF is an lvalue valid for this language;
11970 : : otherwise, print an error message and return zero. USE says
11971 : : how the lvalue is being used and so selects the error message. */
11972 : :
11973 : : int
11974 : 34971474 : lvalue_or_else (tree ref, enum lvalue_use use, tsubst_flags_t complain)
11975 : : {
11976 : 34971474 : cp_lvalue_kind kind = lvalue_kind (ref);
11977 : :
11978 : 34971474 : if (kind == clk_none)
11979 : : {
11980 : 128 : if (complain & tf_error)
11981 : 115 : lvalue_error (cp_expr_loc_or_input_loc (ref), use);
11982 : 128 : return 0;
11983 : : }
11984 : 34971346 : else if (kind & (clk_rvalueref|clk_class))
11985 : : {
11986 : 104 : if (!(complain & tf_error))
11987 : : return 0;
11988 : : /* Make this a permerror because we used to accept it. */
11989 : 18 : permerror (cp_expr_loc_or_input_loc (ref),
11990 : : "using rvalue as lvalue");
11991 : : }
11992 : : return 1;
11993 : : }
11994 : :
11995 : : /* Return true if a user-defined literal operator is a raw operator. */
11996 : :
11997 : : bool
11998 : 115258 : check_raw_literal_operator (const_tree decl)
11999 : : {
12000 : 115258 : tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
12001 : 115258 : tree argtype;
12002 : 115258 : int arity;
12003 : 115258 : bool maybe_raw_p = false;
12004 : :
12005 : : /* Count the number and type of arguments and check for ellipsis. */
12006 : 115258 : for (argtype = argtypes, arity = 0;
12007 : 172904 : argtype && argtype != void_list_node;
12008 : 57646 : ++arity, argtype = TREE_CHAIN (argtype))
12009 : : {
12010 : 57646 : tree t = TREE_VALUE (argtype);
12011 : :
12012 : 57646 : if (same_type_p (t, const_string_type_node))
12013 : 9 : maybe_raw_p = true;
12014 : : }
12015 : 115258 : if (!argtype)
12016 : : return false; /* Found ellipsis. */
12017 : :
12018 : 115258 : if (!maybe_raw_p || arity != 1)
12019 : 115252 : return false;
12020 : :
12021 : : return true;
12022 : : }
12023 : :
12024 : :
12025 : : /* Return true if a user-defined literal operator has one of the allowed
12026 : : argument types. */
12027 : :
12028 : : bool
12029 : 270149 : check_literal_operator_args (const_tree decl,
12030 : : bool *long_long_unsigned_p, bool *long_double_p)
12031 : : {
12032 : 270149 : tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
12033 : :
12034 : 270149 : *long_long_unsigned_p = false;
12035 : 270149 : *long_double_p = false;
12036 : 270149 : if (processing_template_decl || processing_specialization)
12037 : 57747 : return argtypes == void_list_node;
12038 : : else
12039 : : {
12040 : : tree argtype;
12041 : : int arity;
12042 : : int max_arity = 2;
12043 : :
12044 : : /* Count the number and type of arguments and check for ellipsis. */
12045 : 212308 : for (argtype = argtypes, arity = 0;
12046 : 424710 : argtype && argtype != void_list_node;
12047 : 212308 : argtype = TREE_CHAIN (argtype))
12048 : : {
12049 : 212408 : tree t = TREE_VALUE (argtype);
12050 : 212408 : ++arity;
12051 : :
12052 : 212408 : if (TYPE_PTR_P (t))
12053 : : {
12054 : 93958 : bool maybe_raw_p = false;
12055 : 93958 : t = TREE_TYPE (t);
12056 : 93958 : if (cp_type_quals (t) != TYPE_QUAL_CONST)
12057 : : return false;
12058 : 93955 : t = TYPE_MAIN_VARIANT (t);
12059 : 93955 : if ((maybe_raw_p = same_type_p (t, char_type_node))
12060 : 71599 : || same_type_p (t, wchar_type_node)
12061 : 49389 : || same_type_p (t, char8_type_node)
12062 : 44432 : || same_type_p (t, char16_type_node)
12063 : 116171 : || same_type_p (t, char32_type_node))
12064 : : {
12065 : 93952 : argtype = TREE_CHAIN (argtype);
12066 : 93952 : if (!argtype)
12067 : : return false;
12068 : 93952 : t = TREE_VALUE (argtype);
12069 : 93952 : if (maybe_raw_p && argtype == void_list_node)
12070 : : return true;
12071 : 93879 : else if (same_type_p (t, size_type_node))
12072 : : {
12073 : 93873 : ++arity;
12074 : 93873 : continue;
12075 : : }
12076 : : else
12077 : : return false;
12078 : : }
12079 : : }
12080 : 118450 : else if (same_type_p (t, long_long_unsigned_type_node))
12081 : : {
12082 : 32397 : max_arity = 1;
12083 : 32397 : *long_long_unsigned_p = true;
12084 : : }
12085 : 86053 : else if (same_type_p (t, long_double_type_node))
12086 : : {
12087 : 85953 : max_arity = 1;
12088 : 85953 : *long_double_p = true;
12089 : : }
12090 : 100 : else if (same_type_p (t, char_type_node))
12091 : : max_arity = 1;
12092 : 56 : else if (same_type_p (t, wchar_type_node))
12093 : : max_arity = 1;
12094 : 45 : else if (same_type_p (t, char8_type_node))
12095 : : max_arity = 1;
12096 : 40 : else if (same_type_p (t, char16_type_node))
12097 : : max_arity = 1;
12098 : 29 : else if (same_type_p (t, char32_type_node))
12099 : : max_arity = 1;
12100 : : else
12101 : : return false;
12102 : : }
12103 : 212302 : if (!argtype)
12104 : : return false; /* Found ellipsis. */
12105 : :
12106 : 212299 : if (arity != max_arity)
12107 : : return false;
12108 : :
12109 : : return true;
12110 : : }
12111 : : }
12112 : :
12113 : : /* Always returns false since unlike C90, C++ has no concept of implicit
12114 : : function declarations. */
12115 : :
12116 : : bool
12117 : 376 : c_decl_implicit (const_tree)
12118 : : {
12119 : 376 : return false;
12120 : : }
|
