]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Build expressions with type checking for C++ compiler. |
d6a8bdff | 2 | Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, |
86ac0575 | 3 | 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc. |
8d08fdba MS |
4 | Hacked by Michael Tiemann (tiemann@cygnus.com) |
5 | ||
f5adbb8d | 6 | This file is part of GCC. |
8d08fdba | 7 | |
f5adbb8d | 8 | GCC is free software; you can redistribute it and/or modify |
8d08fdba MS |
9 | it under the terms of the GNU General Public License as published by |
10 | the Free Software Foundation; either version 2, or (at your option) | |
11 | any later version. | |
12 | ||
f5adbb8d | 13 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
f5adbb8d | 19 | along with GCC; see the file COPYING. If not, write to |
6bc06b8f RK |
20 | the Free Software Foundation, 59 Temple Place - Suite 330, |
21 | Boston, MA 02111-1307, USA. */ | |
8d08fdba MS |
22 | |
23 | ||
24 | /* This file is part of the C++ front end. | |
25 | It contains routines to build C++ expressions given their operands, | |
26 | including computing the types of the result, C and C++ specific error | |
27 | checks, and some optimization. | |
28 | ||
29 | There are also routines to build RETURN_STMT nodes and CASE_STMT nodes, | |
30 | and to process initializations in declarations (since they work | |
31 | like a strange sort of assignment). */ | |
32 | ||
8d08fdba | 33 | #include "config.h" |
8d052bc7 | 34 | #include "system.h" |
4977bab6 ZW |
35 | #include "coretypes.h" |
36 | #include "tm.h" | |
8d08fdba MS |
37 | #include "tree.h" |
38 | #include "rtl.h" | |
8f17b5c5 | 39 | #include "expr.h" |
8d08fdba | 40 | #include "cp-tree.h" |
a091679a | 41 | #include "tm_p.h" |
8d08fdba | 42 | #include "flags.h" |
e8abc66f | 43 | #include "output.h" |
12027a89 | 44 | #include "toplev.h" |
2a2b2d43 | 45 | #include "diagnostic.h" |
672a6f42 | 46 | #include "target.h" |
7b6d72fc | 47 | #include "convert.h" |
8d08fdba | 48 | |
acd8e2d0 NS |
49 | static tree convert_for_assignment (tree, tree, const char *, tree, int); |
50 | static tree cp_pointer_int_sum (enum tree_code, tree, tree); | |
51 | static tree rationalize_conditional_expr (enum tree_code, tree); | |
acd8e2d0 NS |
52 | static int comp_ptr_ttypes_real (tree, tree, int); |
53 | static int comp_ptr_ttypes_const (tree, tree); | |
acd8e2d0 NS |
54 | static bool comp_except_types (tree, tree, bool); |
55 | static bool comp_array_types (tree, tree, bool); | |
56 | static tree common_base_type (tree, tree); | |
57 | static tree lookup_anon_field (tree, tree); | |
58 | static tree pointer_diff (tree, tree, tree); | |
acd8e2d0 | 59 | static tree get_delta_difference (tree, tree, int); |
acd8e2d0 NS |
60 | static void casts_away_constness_r (tree *, tree *); |
61 | static bool casts_away_constness (tree, tree); | |
62 | static void maybe_warn_about_returning_address_of_local (tree); | |
a723baf1 | 63 | static tree lookup_destructor (tree, tree, tree); |
8d08fdba | 64 | |
4d6abc1c | 65 | /* Return the target type of TYPE, which means return T for: |
8d08fdba MS |
66 | T*, T&, T[], T (...), and otherwise, just T. */ |
67 | ||
68 | tree | |
acd8e2d0 | 69 | target_type (tree type) |
8d08fdba | 70 | { |
ee76b931 | 71 | type = non_reference (type); |
8d08fdba MS |
72 | while (TREE_CODE (type) == POINTER_TYPE |
73 | || TREE_CODE (type) == ARRAY_TYPE | |
74 | || TREE_CODE (type) == FUNCTION_TYPE | |
75 | || TREE_CODE (type) == METHOD_TYPE | |
a5ac359a | 76 | || TYPE_PTRMEM_P (type)) |
8d08fdba MS |
77 | type = TREE_TYPE (type); |
78 | return type; | |
79 | } | |
80 | ||
81 | /* Do `exp = require_complete_type (exp);' to make sure exp | |
ae58fa02 MM |
82 | does not have an incomplete type. (That includes void types.) |
83 | Returns the error_mark_node if the VALUE does not have | |
84 | complete type when this function returns. */ | |
8d08fdba MS |
85 | |
86 | tree | |
acd8e2d0 | 87 | require_complete_type (tree value) |
8d08fdba | 88 | { |
5566b478 MS |
89 | tree type; |
90 | ||
66543169 | 91 | if (processing_template_decl || value == error_mark_node) |
5566b478 MS |
92 | return value; |
93 | ||
2c73f9f5 ML |
94 | if (TREE_CODE (value) == OVERLOAD) |
95 | type = unknown_type_node; | |
96 | else | |
97 | type = TREE_TYPE (value); | |
8d08fdba MS |
98 | |
99 | /* First, detect a valid value with a complete type. */ | |
d0f062fb | 100 | if (COMPLETE_TYPE_P (type)) |
8d08fdba MS |
101 | return value; |
102 | ||
66543169 | 103 | if (complete_type_or_else (type, value)) |
8f259df3 MM |
104 | return value; |
105 | else | |
ae58fa02 | 106 | return error_mark_node; |
8d08fdba MS |
107 | } |
108 | ||
8f259df3 MM |
109 | /* Try to complete TYPE, if it is incomplete. For example, if TYPE is |
110 | a template instantiation, do the instantiation. Returns TYPE, | |
111 | whether or not it could be completed, unless something goes | |
112 | horribly wrong, in which case the error_mark_node is returned. */ | |
113 | ||
5566b478 | 114 | tree |
acd8e2d0 | 115 | complete_type (tree type) |
5566b478 | 116 | { |
8857f91e MM |
117 | if (type == NULL_TREE) |
118 | /* Rather than crash, we return something sure to cause an error | |
119 | at some point. */ | |
120 | return error_mark_node; | |
121 | ||
d0f062fb | 122 | if (type == error_mark_node || COMPLETE_TYPE_P (type)) |
5566b478 | 123 | ; |
e349ee73 | 124 | else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type)) |
5566b478 MS |
125 | { |
126 | tree t = complete_type (TREE_TYPE (type)); | |
d0f062fb | 127 | if (COMPLETE_TYPE_P (t) && ! processing_template_decl) |
6467930b | 128 | layout_type (type); |
c73964b2 MS |
129 | TYPE_NEEDS_CONSTRUCTING (type) |
130 | = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t)); | |
834c6dff MM |
131 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) |
132 | = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t)); | |
5566b478 | 133 | } |
7ddedda4 | 134 | else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INSTANTIATION (type)) |
e76a2646 | 135 | instantiate_class_template (TYPE_MAIN_VARIANT (type)); |
5566b478 MS |
136 | |
137 | return type; | |
138 | } | |
139 | ||
5aa3396c JM |
140 | /* Like complete_type, but issue an error if the TYPE cannot be completed. |
141 | VALUE is used for informative diagnostics. DIAG_TYPE indicates the type | |
142 | of diagnostic: 0 for an error, 1 for a warning, 2 for a pedwarn. | |
66543169 | 143 | Returns NULL_TREE if the type cannot be made complete. */ |
8f259df3 MM |
144 | |
145 | tree | |
acd8e2d0 | 146 | complete_type_or_diagnostic (tree type, tree value, int diag_type) |
8f259df3 MM |
147 | { |
148 | type = complete_type (type); | |
ae58fa02 MM |
149 | if (type == error_mark_node) |
150 | /* We already issued an error. */ | |
151 | return NULL_TREE; | |
d0f062fb | 152 | else if (!COMPLETE_TYPE_P (type)) |
8f259df3 | 153 | { |
5aa3396c | 154 | cxx_incomplete_type_diagnostic (value, type, diag_type); |
8f259df3 MM |
155 | return NULL_TREE; |
156 | } | |
157 | else | |
158 | return type; | |
159 | } | |
160 | ||
8d08fdba | 161 | /* Return truthvalue of whether type of EXP is instantiated. */ |
e92cc029 | 162 | |
8d08fdba | 163 | int |
5671bf27 | 164 | type_unknown_p (tree exp) |
8d08fdba | 165 | { |
2c73f9f5 | 166 | return (TREE_CODE (exp) == OVERLOAD |
a31fe44e | 167 | || TREE_CODE (exp) == TREE_LIST |
a5ac359a | 168 | || TREE_TYPE (exp) == unknown_type_node); |
8d08fdba MS |
169 | } |
170 | ||
8d08fdba MS |
171 | \f |
172 | /* Return the common type of two parameter lists. | |
173 | We assume that comptypes has already been done and returned 1; | |
174 | if that isn't so, this may crash. | |
175 | ||
176 | As an optimization, free the space we allocate if the parameter | |
177 | lists are already common. */ | |
178 | ||
179 | tree | |
5671bf27 | 180 | commonparms (tree p1, tree p2) |
8d08fdba MS |
181 | { |
182 | tree oldargs = p1, newargs, n; | |
183 | int i, len; | |
184 | int any_change = 0; | |
8d08fdba MS |
185 | |
186 | len = list_length (p1); | |
187 | newargs = tree_last (p1); | |
188 | ||
189 | if (newargs == void_list_node) | |
190 | i = 1; | |
191 | else | |
192 | { | |
193 | i = 0; | |
194 | newargs = 0; | |
195 | } | |
196 | ||
197 | for (; i < len; i++) | |
198 | newargs = tree_cons (NULL_TREE, NULL_TREE, newargs); | |
199 | ||
200 | n = newargs; | |
201 | ||
202 | for (i = 0; p1; | |
203 | p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n), i++) | |
204 | { | |
205 | if (TREE_PURPOSE (p1) && !TREE_PURPOSE (p2)) | |
206 | { | |
8d08fdba MS |
207 | TREE_PURPOSE (n) = TREE_PURPOSE (p1); |
208 | any_change = 1; | |
209 | } | |
210 | else if (! TREE_PURPOSE (p1)) | |
211 | { | |
212 | if (TREE_PURPOSE (p2)) | |
213 | { | |
214 | TREE_PURPOSE (n) = TREE_PURPOSE (p2); | |
215 | any_change = 1; | |
216 | } | |
217 | } | |
218 | else | |
219 | { | |
1743ca29 | 220 | if (1 != simple_cst_equal (TREE_PURPOSE (p1), TREE_PURPOSE (p2))) |
a4443a08 | 221 | any_change = 1; |
8d08fdba MS |
222 | TREE_PURPOSE (n) = TREE_PURPOSE (p2); |
223 | } | |
224 | if (TREE_VALUE (p1) != TREE_VALUE (p2)) | |
225 | { | |
226 | any_change = 1; | |
6da794e8 | 227 | TREE_VALUE (n) = merge_types (TREE_VALUE (p1), TREE_VALUE (p2)); |
8d08fdba MS |
228 | } |
229 | else | |
230 | TREE_VALUE (n) = TREE_VALUE (p1); | |
231 | } | |
232 | if (! any_change) | |
970d6386 | 233 | return oldargs; |
8d08fdba MS |
234 | |
235 | return newargs; | |
236 | } | |
237 | ||
f2ee215b BK |
238 | /* Given a type, perhaps copied for a typedef, |
239 | find the "original" version of it. */ | |
240 | tree | |
5671bf27 | 241 | original_type (tree t) |
f2ee215b BK |
242 | { |
243 | while (TYPE_NAME (t) != NULL_TREE) | |
244 | { | |
245 | tree x = TYPE_NAME (t); | |
246 | if (TREE_CODE (x) != TYPE_DECL) | |
247 | break; | |
248 | x = DECL_ORIGINAL_TYPE (x); | |
249 | if (x == NULL_TREE) | |
250 | break; | |
251 | t = x; | |
252 | } | |
253 | return t; | |
254 | } | |
255 | ||
a7a64a77 | 256 | /* T1 and T2 are arithmetic or enumeration types. Return the type |
aba649ba | 257 | that will result from the "usual arithmetic conversions" on T1 and |
a7a64a77 MM |
258 | T2 as described in [expr]. */ |
259 | ||
260 | tree | |
5671bf27 | 261 | type_after_usual_arithmetic_conversions (tree t1, tree t2) |
a7a64a77 MM |
262 | { |
263 | enum tree_code code1 = TREE_CODE (t1); | |
264 | enum tree_code code2 = TREE_CODE (t2); | |
265 | tree attributes; | |
266 | ||
267 | /* FIXME: Attributes. */ | |
268 | my_friendly_assert (ARITHMETIC_TYPE_P (t1) | |
6da794e8 | 269 | || TREE_CODE (t1) == COMPLEX_TYPE |
a7a64a77 MM |
270 | || TREE_CODE (t1) == ENUMERAL_TYPE, |
271 | 19990725); | |
272 | my_friendly_assert (ARITHMETIC_TYPE_P (t2) | |
6da794e8 | 273 | || TREE_CODE (t2) == COMPLEX_TYPE |
a7a64a77 MM |
274 | || TREE_CODE (t2) == ENUMERAL_TYPE, |
275 | 19990725); | |
276 | ||
6da794e8 JM |
277 | /* In what follows, we slightly generalize the rules given in [expr] so |
278 | as to deal with `long long' and `complex'. First, merge the | |
279 | attributes. */ | |
f6897b10 | 280 | attributes = (*targetm.merge_type_attributes) (t1, t2); |
a7a64a77 | 281 | |
6da794e8 JM |
282 | /* If one type is complex, form the common type of the non-complex |
283 | components, then make that complex. Use T1 or T2 if it is the | |
284 | required type. */ | |
285 | if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE) | |
286 | { | |
287 | tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1; | |
288 | tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2; | |
289 | tree subtype | |
290 | = type_after_usual_arithmetic_conversions (subtype1, subtype2); | |
291 | ||
292 | if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype) | |
293 | return build_type_attribute_variant (t1, attributes); | |
294 | else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype) | |
295 | return build_type_attribute_variant (t2, attributes); | |
296 | else | |
297 | return build_type_attribute_variant (build_complex_type (subtype), | |
298 | attributes); | |
299 | } | |
300 | ||
a7a64a77 MM |
301 | /* If only one is real, use it as the result. */ |
302 | if (code1 == REAL_TYPE && code2 != REAL_TYPE) | |
303 | return build_type_attribute_variant (t1, attributes); | |
304 | if (code2 == REAL_TYPE && code1 != REAL_TYPE) | |
305 | return build_type_attribute_variant (t2, attributes); | |
306 | ||
307 | /* Perform the integral promotions. */ | |
308 | if (code1 != REAL_TYPE) | |
309 | { | |
310 | t1 = type_promotes_to (t1); | |
311 | t2 = type_promotes_to (t2); | |
312 | } | |
313 | ||
314 | /* Both real or both integers; use the one with greater precision. */ | |
315 | if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2)) | |
316 | return build_type_attribute_variant (t1, attributes); | |
317 | else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1)) | |
318 | return build_type_attribute_variant (t2, attributes); | |
319 | ||
2f4d058f AH |
320 | /* The types are the same; no need to do anything fancy. */ |
321 | if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2)) | |
322 | return build_type_attribute_variant (t1, attributes); | |
323 | ||
a7a64a77 MM |
324 | if (code1 != REAL_TYPE) |
325 | { | |
7e9d4b22 JM |
326 | /* If one is a sizetype, use it so size_binop doesn't blow up. */ |
327 | if (TYPE_IS_SIZETYPE (t1) > TYPE_IS_SIZETYPE (t2)) | |
328 | return build_type_attribute_variant (t1, attributes); | |
329 | if (TYPE_IS_SIZETYPE (t2) > TYPE_IS_SIZETYPE (t1)) | |
330 | return build_type_attribute_variant (t2, attributes); | |
331 | ||
a7a64a77 MM |
332 | /* If one is unsigned long long, then convert the other to unsigned |
333 | long long. */ | |
334 | if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node) | |
335 | || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node)) | |
336 | return build_type_attribute_variant (long_long_unsigned_type_node, | |
337 | attributes); | |
338 | /* If one is a long long, and the other is an unsigned long, and | |
339 | long long can represent all the values of an unsigned long, then | |
340 | convert to a long long. Otherwise, convert to an unsigned long | |
341 | long. Otherwise, if either operand is long long, convert the | |
342 | other to long long. | |
343 | ||
344 | Since we're here, we know the TYPE_PRECISION is the same; | |
345 | therefore converting to long long cannot represent all the values | |
346 | of an unsigned long, so we choose unsigned long long in that | |
347 | case. */ | |
348 | if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node) | |
349 | || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node)) | |
350 | { | |
351 | tree t = ((TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2)) | |
352 | ? long_long_unsigned_type_node | |
353 | : long_long_integer_type_node); | |
354 | return build_type_attribute_variant (t, attributes); | |
355 | } | |
356 | ||
357 | /* Go through the same procedure, but for longs. */ | |
358 | if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node) | |
359 | || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node)) | |
360 | return build_type_attribute_variant (long_unsigned_type_node, | |
361 | attributes); | |
362 | if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node) | |
363 | || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node)) | |
364 | { | |
365 | tree t = ((TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2)) | |
366 | ? long_unsigned_type_node : long_integer_type_node); | |
367 | return build_type_attribute_variant (t, attributes); | |
368 | } | |
369 | /* Otherwise prefer the unsigned one. */ | |
370 | if (TREE_UNSIGNED (t1)) | |
371 | return build_type_attribute_variant (t1, attributes); | |
372 | else | |
373 | return build_type_attribute_variant (t2, attributes); | |
374 | } | |
375 | else | |
376 | { | |
377 | if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node) | |
378 | || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node)) | |
379 | return build_type_attribute_variant (long_double_type_node, | |
380 | attributes); | |
381 | if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node) | |
382 | || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node)) | |
383 | return build_type_attribute_variant (double_type_node, | |
384 | attributes); | |
2f4d058f AH |
385 | if (same_type_p (TYPE_MAIN_VARIANT (t1), float_type_node) |
386 | || same_type_p (TYPE_MAIN_VARIANT (t2), float_type_node)) | |
a7a64a77 MM |
387 | return build_type_attribute_variant (float_type_node, |
388 | attributes); | |
2f4d058f AH |
389 | |
390 | /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of | |
391 | the standard C++ floating-point types. Logic earlier in this | |
392 | function has already eliminated the possibility that | |
393 | TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no | |
394 | compelling reason to choose one or the other. */ | |
395 | return build_type_attribute_variant (t1, attributes); | |
a7a64a77 MM |
396 | } |
397 | } | |
398 | ||
a5ac359a MM |
399 | /* Subroutine of composite_pointer_type to implement the recursive |
400 | case. See that function for documentation fo the parameters. */ | |
401 | ||
402 | static tree | |
403 | composite_pointer_type_r (tree t1, tree t2, const char* location) | |
404 | { | |
405 | tree pointee1; | |
406 | tree pointee2; | |
407 | tree result_type; | |
408 | tree attributes; | |
409 | ||
410 | /* Determine the types pointed to by T1 and T2. */ | |
411 | if (TREE_CODE (t1) == POINTER_TYPE) | |
412 | { | |
413 | pointee1 = TREE_TYPE (t1); | |
414 | pointee2 = TREE_TYPE (t2); | |
415 | } | |
416 | else | |
417 | { | |
418 | pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1); | |
419 | pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2); | |
420 | } | |
421 | ||
422 | /* [expr.rel] | |
423 | ||
424 | Otherwise, the composite pointer type is a pointer type | |
425 | similar (_conv.qual_) to the type of one of the operands, | |
426 | with a cv-qualification signature (_conv.qual_) that is the | |
427 | union of the cv-qualification signatures of the operand | |
428 | types. */ | |
429 | if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2)) | |
430 | result_type = pointee1; | |
431 | else if ((TREE_CODE (pointee1) == POINTER_TYPE | |
432 | && TREE_CODE (pointee2) == POINTER_TYPE) | |
433 | || (TYPE_PTR_TO_MEMBER_P (pointee1) | |
434 | && TYPE_PTR_TO_MEMBER_P (pointee2))) | |
435 | result_type = composite_pointer_type_r (pointee1, pointee2, location); | |
436 | else | |
437 | { | |
438 | pedwarn ("%s between distinct pointer types `%T' and `%T' " | |
439 | "lacks a cast", | |
440 | location, t1, t2); | |
441 | result_type = void_type_node; | |
442 | } | |
443 | result_type = cp_build_qualified_type (result_type, | |
444 | (cp_type_quals (pointee1) | |
445 | | cp_type_quals (pointee2))); | |
446 | result_type = build_pointer_type (result_type); | |
447 | /* If the original types were pointers to members, so is the | |
448 | result. */ | |
449 | if (TYPE_PTR_TO_MEMBER_P (t1)) | |
450 | { | |
451 | if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1), | |
452 | TYPE_PTRMEM_CLASS_TYPE (t2))) | |
453 | pedwarn ("%s between distinct pointer types `%T' and `%T' " | |
454 | "lacks a cast", | |
455 | location, t1, t2); | |
456 | result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1), | |
457 | result_type); | |
458 | } | |
459 | ||
460 | /* Merge the attributes. */ | |
461 | attributes = (*targetm.merge_type_attributes) (t1, t2); | |
462 | return build_type_attribute_variant (result_type, attributes); | |
463 | } | |
464 | ||
a7a64a77 MM |
465 | /* Return the composite pointer type (see [expr.rel]) for T1 and T2. |
466 | ARG1 and ARG2 are the values with those types. The LOCATION is a | |
a5ac359a MM |
467 | string describing the current location, in case an error occurs. |
468 | ||
469 | This routine also implements the computation of a common type for | |
470 | pointers-to-members as per [expr.eq]. */ | |
a7a64a77 MM |
471 | |
472 | tree | |
5671bf27 AJ |
473 | composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2, |
474 | const char* location) | |
a7a64a77 | 475 | { |
a5ac359a MM |
476 | tree class1; |
477 | tree class2; | |
a7a64a77 MM |
478 | |
479 | /* [expr.rel] | |
480 | ||
481 | If one operand is a null pointer constant, the composite pointer | |
482 | type is the type of the other operand. */ | |
483 | if (null_ptr_cst_p (arg1)) | |
484 | return t2; | |
485 | if (null_ptr_cst_p (arg2)) | |
486 | return t1; | |
487 | ||
634790f4 MM |
488 | /* We have: |
489 | ||
490 | [expr.rel] | |
491 | ||
492 | If one of the operands has type "pointer to cv1 void*", then | |
493 | the other has type "pointer to cv2T", and the composite pointer | |
494 | type is "pointer to cv12 void", where cv12 is the union of cv1 | |
495 | and cv2. | |
496 | ||
497 | If either type is a pointer to void, make sure it is T1. */ | |
a5ac359a | 498 | if (TREE_CODE (t2) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t2))) |
a7a64a77 | 499 | { |
634790f4 MM |
500 | tree t; |
501 | t = t1; | |
502 | t1 = t2; | |
503 | t2 = t; | |
a7a64a77 | 504 | } |
a5ac359a | 505 | |
634790f4 | 506 | /* Now, if T1 is a pointer to void, merge the qualifiers. */ |
a5ac359a | 507 | if (TREE_CODE (t1) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t1))) |
a7a64a77 | 508 | { |
a5ac359a MM |
509 | tree attributes; |
510 | tree result_type; | |
511 | ||
634790f4 | 512 | if (pedantic && TYPE_PTRFN_P (t2)) |
ddcc7cf6 | 513 | pedwarn ("ISO C++ forbids %s between pointer of type `void *' and pointer-to-function", location); |
a5ac359a MM |
514 | result_type |
515 | = cp_build_qualified_type (void_type_node, | |
516 | (cp_type_quals (TREE_TYPE (t1)) | |
517 | | cp_type_quals (TREE_TYPE (t2)))); | |
634790f4 | 518 | result_type = build_pointer_type (result_type); |
a5ac359a MM |
519 | /* Merge the attributes. */ |
520 | attributes = (*targetm.merge_type_attributes) (t1, t2); | |
521 | return build_type_attribute_variant (result_type, attributes); | |
522 | } | |
523 | ||
524 | /* [expr.eq] permits the application of a pointer conversion to | |
525 | bring the pointers to a common type. */ | |
526 | if (TREE_CODE (t1) == POINTER_TYPE && TREE_CODE (t2) == POINTER_TYPE | |
527 | && CLASS_TYPE_P (TREE_TYPE (t1)) | |
528 | && CLASS_TYPE_P (TREE_TYPE (t2)) | |
529 | && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1), | |
530 | TREE_TYPE (t2))) | |
531 | { | |
532 | class1 = TREE_TYPE (t1); | |
533 | class2 = TREE_TYPE (t2); | |
534 | ||
535 | if (DERIVED_FROM_P (class1, class2)) | |
536 | t2 = (build_pointer_type | |
537 | (cp_build_qualified_type (class1, TYPE_QUALS (class2)))); | |
538 | else if (DERIVED_FROM_P (class2, class1)) | |
539 | t1 = (build_pointer_type | |
540 | (cp_build_qualified_type (class2, TYPE_QUALS (class1)))); | |
541 | else | |
542 | { | |
543 | error ("%s between distinct pointer types `%T' and `%T' " | |
544 | "lacks a cast", location, t1, t2); | |
545 | return error_mark_node; | |
546 | } | |
a7a64a77 | 547 | } |
a5ac359a MM |
548 | /* [expr.eq] permits the application of a pointer-to-member |
549 | conversion to change the class type of one of the types. */ | |
550 | else if (TYPE_PTR_TO_MEMBER_P (t1) | |
551 | && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1), | |
552 | TYPE_PTRMEM_CLASS_TYPE (t2))) | |
708cae97 | 553 | { |
a5ac359a MM |
554 | class1 = TYPE_PTRMEM_CLASS_TYPE (t1); |
555 | class2 = TYPE_PTRMEM_CLASS_TYPE (t2); | |
708cae97 | 556 | |
a5ac359a MM |
557 | if (DERIVED_FROM_P (class1, class2)) |
558 | t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1)); | |
559 | else if (DERIVED_FROM_P (class2, class1)) | |
560 | t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2)); | |
a7a64a77 MM |
561 | else |
562 | { | |
a5ac359a MM |
563 | error ("%s between distinct pointer-to-member types `%T' and `%T' " |
564 | "lacks a cast", location, t1, t2); | |
565 | return error_mark_node; | |
a7a64a77 MM |
566 | } |
567 | } | |
a7a64a77 | 568 | |
a5ac359a | 569 | return composite_pointer_type_r (t1, t2, location); |
a7a64a77 MM |
570 | } |
571 | ||
6da794e8 | 572 | /* Return the merged type of two types. |
8d08fdba MS |
573 | We assume that comptypes has already been done and returned 1; |
574 | if that isn't so, this may crash. | |
575 | ||
6da794e8 JM |
576 | This just combines attributes and default arguments; any other |
577 | differences would cause the two types to compare unalike. */ | |
8d08fdba MS |
578 | |
579 | tree | |
5671bf27 | 580 | merge_types (tree t1, tree t2) |
8d08fdba MS |
581 | { |
582 | register enum tree_code code1; | |
583 | register enum tree_code code2; | |
2986ae00 | 584 | tree attributes; |
8d08fdba MS |
585 | |
586 | /* Save time if the two types are the same. */ | |
f2ee215b | 587 | if (t1 == t2) |
9076e292 | 588 | return t1; |
6da794e8 | 589 | if (original_type (t1) == original_type (t2)) |
9076e292 | 590 | return t1; |
8d08fdba MS |
591 | |
592 | /* If one type is nonsense, use the other. */ | |
593 | if (t1 == error_mark_node) | |
9076e292 | 594 | return t2; |
8d08fdba | 595 | if (t2 == error_mark_node) |
9076e292 | 596 | return t1; |
8d08fdba | 597 | |
d9525bec | 598 | /* Merge the attributes. */ |
f6897b10 | 599 | attributes = (*targetm.merge_type_attributes) (t1, t2); |
2986ae00 | 600 | |
5566b478 MS |
601 | if (TYPE_PTRMEMFUNC_P (t1)) |
602 | t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1); | |
603 | if (TYPE_PTRMEMFUNC_P (t2)) | |
604 | t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2); | |
605 | ||
8d08fdba MS |
606 | code1 = TREE_CODE (t1); |
607 | code2 = TREE_CODE (t2); | |
608 | ||
609 | switch (code1) | |
610 | { | |
8d08fdba MS |
611 | case POINTER_TYPE: |
612 | case REFERENCE_TYPE: | |
6da794e8 | 613 | /* For two pointers, do this recursively on the target type. */ |
8d08fdba | 614 | { |
6da794e8 | 615 | tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2)); |
77adef84 | 616 | int quals = cp_type_quals (t1); |
5b163de4 | 617 | |
8d08fdba | 618 | if (code1 == POINTER_TYPE) |
2986ae00 | 619 | t1 = build_pointer_type (target); |
8d08fdba | 620 | else |
2986ae00 | 621 | t1 = build_reference_type (target); |
71851aaa | 622 | t1 = build_type_attribute_variant (t1, attributes); |
77adef84 | 623 | t1 = cp_build_qualified_type (t1, quals); |
71851aaa MS |
624 | |
625 | if (TREE_CODE (target) == METHOD_TYPE) | |
626 | t1 = build_ptrmemfunc_type (t1); | |
627 | ||
628 | return t1; | |
8d08fdba | 629 | } |
8d08fdba | 630 | |
6da794e8 JM |
631 | case OFFSET_TYPE: |
632 | { | |
fe0378ed MM |
633 | int quals; |
634 | tree pointee; | |
635 | quals = cp_type_quals (t1); | |
636 | pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1), | |
637 | TYPE_PTRMEM_POINTED_TO_TYPE (t2)); | |
638 | t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1), | |
639 | pointee); | |
640 | t1 = cp_build_qualified_type (t1, quals); | |
6da794e8 JM |
641 | break; |
642 | } | |
643 | ||
8d08fdba MS |
644 | case ARRAY_TYPE: |
645 | { | |
6da794e8 | 646 | tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2)); |
8d08fdba MS |
647 | /* Save space: see if the result is identical to one of the args. */ |
648 | if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)) | |
2986ae00 | 649 | return build_type_attribute_variant (t1, attributes); |
8d08fdba | 650 | if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)) |
2986ae00 | 651 | return build_type_attribute_variant (t2, attributes); |
8d08fdba | 652 | /* Merge the element types, and have a size if either arg has one. */ |
e349ee73 MS |
653 | t1 = build_cplus_array_type |
654 | (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2)); | |
6da794e8 | 655 | break; |
8d08fdba MS |
656 | } |
657 | ||
658 | case FUNCTION_TYPE: | |
659 | /* Function types: prefer the one that specified arg types. | |
660 | If both do, merge the arg types. Also merge the return types. */ | |
661 | { | |
6da794e8 | 662 | tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2)); |
8d08fdba MS |
663 | tree p1 = TYPE_ARG_TYPES (t1); |
664 | tree p2 = TYPE_ARG_TYPES (t2); | |
665 | tree rval, raises; | |
666 | ||
667 | /* Save space: see if the result is identical to one of the args. */ | |
668 | if (valtype == TREE_TYPE (t1) && ! p2) | |
2986ae00 | 669 | return build_type_attribute_variant (t1, attributes); |
8d08fdba | 670 | if (valtype == TREE_TYPE (t2) && ! p1) |
2986ae00 | 671 | return build_type_attribute_variant (t2, attributes); |
8d08fdba MS |
672 | |
673 | /* Simple way if one arg fails to specify argument types. */ | |
674 | if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node) | |
675 | { | |
676 | rval = build_function_type (valtype, p2); | |
8926095f | 677 | if ((raises = TYPE_RAISES_EXCEPTIONS (t2))) |
f30432d7 | 678 | rval = build_exception_variant (rval, raises); |
2986ae00 | 679 | return build_type_attribute_variant (rval, attributes); |
8d08fdba MS |
680 | } |
681 | raises = TYPE_RAISES_EXCEPTIONS (t1); | |
682 | if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node) | |
683 | { | |
684 | rval = build_function_type (valtype, p1); | |
685 | if (raises) | |
f30432d7 | 686 | rval = build_exception_variant (rval, raises); |
2986ae00 | 687 | return build_type_attribute_variant (rval, attributes); |
8d08fdba MS |
688 | } |
689 | ||
690 | rval = build_function_type (valtype, commonparms (p1, p2)); | |
6da794e8 JM |
691 | t1 = build_exception_variant (rval, raises); |
692 | break; | |
8d08fdba MS |
693 | } |
694 | ||
6da794e8 JM |
695 | case METHOD_TYPE: |
696 | { | |
697 | /* Get this value the long way, since TYPE_METHOD_BASETYPE | |
698 | is just the main variant of this. */ | |
699 | tree basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2))); | |
700 | tree raises = TYPE_RAISES_EXCEPTIONS (t1); | |
701 | tree t3; | |
702 | ||
703 | /* If this was a member function type, get back to the | |
704 | original type of type member function (i.e., without | |
705 | the class instance variable up front. */ | |
706 | t1 = build_function_type (TREE_TYPE (t1), | |
707 | TREE_CHAIN (TYPE_ARG_TYPES (t1))); | |
708 | t2 = build_function_type (TREE_TYPE (t2), | |
709 | TREE_CHAIN (TYPE_ARG_TYPES (t2))); | |
710 | t3 = merge_types (t1, t2); | |
43dc123f MM |
711 | t3 = build_method_type_directly (basetype, TREE_TYPE (t3), |
712 | TYPE_ARG_TYPES (t3)); | |
6da794e8 JM |
713 | t1 = build_exception_variant (t3, raises); |
714 | break; | |
715 | } | |
8d08fdba | 716 | |
6da794e8 JM |
717 | default:; |
718 | } | |
719 | return build_type_attribute_variant (t1, attributes); | |
720 | } | |
8d08fdba | 721 | |
6da794e8 JM |
722 | /* Return the common type of two types. |
723 | We assume that comptypes has already been done and returned 1; | |
724 | if that isn't so, this may crash. | |
71851aaa | 725 | |
6da794e8 JM |
726 | This is the type for the result of most arithmetic operations |
727 | if the operands have the given two types. */ | |
728 | ||
729 | tree | |
5671bf27 | 730 | common_type (tree t1, tree t2) |
6da794e8 JM |
731 | { |
732 | enum tree_code code1; | |
733 | enum tree_code code2; | |
2986ae00 | 734 | |
6da794e8 JM |
735 | /* If one type is nonsense, bail. */ |
736 | if (t1 == error_mark_node || t2 == error_mark_node) | |
737 | return error_mark_node; | |
8d08fdba | 738 | |
6da794e8 JM |
739 | code1 = TREE_CODE (t1); |
740 | code2 = TREE_CODE (t2); | |
8d08fdba | 741 | |
6da794e8 JM |
742 | if ((ARITHMETIC_TYPE_P (t1) || code1 == ENUMERAL_TYPE |
743 | || code1 == COMPLEX_TYPE) | |
744 | && (ARITHMETIC_TYPE_P (t2) || code2 == ENUMERAL_TYPE | |
745 | || code2 == COMPLEX_TYPE)) | |
746 | return type_after_usual_arithmetic_conversions (t1, t2); | |
747 | ||
748 | else if ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2)) | |
749 | || (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2)) | |
750 | || (TYPE_PTRMEMFUNC_P (t1) && TYPE_PTRMEMFUNC_P (t2))) | |
751 | return composite_pointer_type (t1, t2, error_mark_node, error_mark_node, | |
752 | "conversion"); | |
6da794e8 JM |
753 | else |
754 | abort (); | |
8d08fdba MS |
755 | } |
756 | \f | |
4cc1d462 | 757 | /* Compare two exception specifier types for exactness or subsetness, if |
acd8e2d0 NS |
758 | allowed. Returns false for mismatch, true for match (same, or |
759 | derived and !exact). | |
4cc1d462 NS |
760 | |
761 | [except.spec] "If a class X ... objects of class X or any class publicly | |
34cd5ae7 | 762 | and unambiguously derived from X. Similarly, if a pointer type Y * ... |
4cc1d462 | 763 | exceptions of type Y * or that are pointers to any type publicly and |
34cd5ae7 | 764 | unambiguously derived from Y. Otherwise a function only allows exceptions |
4cc1d462 NS |
765 | that have the same type ..." |
766 | This does not mention cv qualifiers and is different to what throw | |
767 | [except.throw] and catch [except.catch] will do. They will ignore the | |
768 | top level cv qualifiers, and allow qualifiers in the pointer to class | |
769 | example. | |
770 | ||
771 | We implement the letter of the standard. */ | |
772 | ||
acd8e2d0 NS |
773 | static bool |
774 | comp_except_types (tree a, tree b, bool exact) | |
4cc1d462 NS |
775 | { |
776 | if (same_type_p (a, b)) | |
acd8e2d0 | 777 | return true; |
4cc1d462 NS |
778 | else if (!exact) |
779 | { | |
89d684bb | 780 | if (cp_type_quals (a) || cp_type_quals (b)) |
acd8e2d0 | 781 | return false; |
4cc1d462 NS |
782 | |
783 | if (TREE_CODE (a) == POINTER_TYPE | |
784 | && TREE_CODE (b) == POINTER_TYPE) | |
785 | { | |
786 | a = TREE_TYPE (a); | |
787 | b = TREE_TYPE (b); | |
89d684bb | 788 | if (cp_type_quals (a) || cp_type_quals (b)) |
acd8e2d0 | 789 | return false; |
4cc1d462 NS |
790 | } |
791 | ||
792 | if (TREE_CODE (a) != RECORD_TYPE | |
793 | || TREE_CODE (b) != RECORD_TYPE) | |
acd8e2d0 | 794 | return false; |
4cc1d462 NS |
795 | |
796 | if (ACCESSIBLY_UNIQUELY_DERIVED_P (a, b)) | |
acd8e2d0 | 797 | return true; |
4cc1d462 | 798 | } |
acd8e2d0 | 799 | return false; |
4cc1d462 NS |
800 | } |
801 | ||
acd8e2d0 NS |
802 | /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers. |
803 | If EXACT is false, T2 can be stricter than T1 (according to 15.4/7), | |
4cc1d462 NS |
804 | otherwise it must be exact. Exception lists are unordered, but |
805 | we've already filtered out duplicates. Most lists will be in order, | |
806 | we should try to make use of that. */ | |
e92cc029 | 807 | |
acd8e2d0 NS |
808 | bool |
809 | comp_except_specs (tree t1, tree t2, bool exact) | |
8d08fdba | 810 | { |
4cc1d462 NS |
811 | tree probe; |
812 | tree base; | |
813 | int length = 0; | |
814 | ||
815 | if (t1 == t2) | |
acd8e2d0 | 816 | return true; |
4cc1d462 | 817 | |
c6002625 | 818 | if (t1 == NULL_TREE) /* T1 is ... */ |
4cc1d462 NS |
819 | return t2 == NULL_TREE || !exact; |
820 | if (!TREE_VALUE (t1)) /* t1 is EMPTY */ | |
821 | return t2 != NULL_TREE && !TREE_VALUE (t2); | |
c6002625 | 822 | if (t2 == NULL_TREE) /* T2 is ... */ |
acd8e2d0 | 823 | return false; |
dffa4176 | 824 | if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */ |
4cc1d462 NS |
825 | return !exact; |
826 | ||
827 | /* Neither set is ... or EMPTY, make sure each part of T2 is in T1. | |
828 | Count how many we find, to determine exactness. For exact matching and | |
829 | ordered T1, T2, this is an O(n) operation, otherwise its worst case is | |
830 | O(nm). */ | |
831 | for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2)) | |
832 | { | |
833 | for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe)) | |
834 | { | |
835 | tree a = TREE_VALUE (probe); | |
836 | tree b = TREE_VALUE (t2); | |
837 | ||
838 | if (comp_except_types (a, b, exact)) | |
839 | { | |
840 | if (probe == base && exact) | |
841 | base = TREE_CHAIN (probe); | |
842 | length++; | |
843 | break; | |
844 | } | |
845 | } | |
846 | if (probe == NULL_TREE) | |
acd8e2d0 | 847 | return false; |
4cc1d462 NS |
848 | } |
849 | return !exact || base == NULL_TREE || length == list_length (t1); | |
8d08fdba MS |
850 | } |
851 | ||
acd8e2d0 NS |
852 | /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if |
853 | [] can match [size]. */ | |
3bfdc719 | 854 | |
c8a209ca | 855 | static bool |
acd8e2d0 | 856 | comp_array_types (tree t1, tree t2, bool allow_redeclaration) |
8d08fdba | 857 | { |
3bfdc719 MM |
858 | tree d1; |
859 | tree d2; | |
860 | ||
861 | if (t1 == t2) | |
acd8e2d0 | 862 | return true; |
8d08fdba | 863 | |
3bfdc719 | 864 | /* The type of the array elements must be the same. */ |
acd8e2d0 | 865 | if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))) |
c8a209ca | 866 | return false; |
8d08fdba | 867 | |
3bfdc719 MM |
868 | d1 = TYPE_DOMAIN (t1); |
869 | d2 = TYPE_DOMAIN (t2); | |
870 | ||
871 | if (d1 == d2) | |
c8a209ca | 872 | return true; |
8d08fdba | 873 | |
3bfdc719 | 874 | /* If one of the arrays is dimensionless, and the other has a |
0e339752 | 875 | dimension, they are of different types. However, it is valid to |
3bfdc719 MM |
876 | write: |
877 | ||
878 | extern int a[]; | |
879 | int a[3]; | |
880 | ||
881 | by [basic.link]: | |
882 | ||
883 | declarations for an array object can specify | |
884 | array types that differ by the presence or absence of a major | |
885 | array bound (_dcl.array_). */ | |
886 | if (!d1 || !d2) | |
acd8e2d0 | 887 | return allow_redeclaration; |
3bfdc719 MM |
888 | |
889 | /* Check that the dimensions are the same. */ | |
c8a209ca NS |
890 | return (cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)) |
891 | && cp_tree_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2))); | |
8d08fdba MS |
892 | } |
893 | ||
c8a209ca NS |
894 | /* Return true if T1 and T2 are related as allowed by STRICT. STRICT |
895 | is a bitwise-or of the COMPARE_* flags. */ | |
e92cc029 | 896 | |
c8a209ca | 897 | bool |
acd8e2d0 | 898 | comptypes (tree t1, tree t2, int strict) |
8d08fdba | 899 | { |
8d08fdba | 900 | if (t1 == t2) |
c8a209ca NS |
901 | return true; |
902 | ||
8d08fdba MS |
903 | /* This should never happen. */ |
904 | my_friendly_assert (t1 != error_mark_node, 307); | |
905 | ||
c8a209ca | 906 | /* Suppress errors caused by previously reported errors */ |
8d08fdba | 907 | if (t2 == error_mark_node) |
c8a209ca | 908 | return false; |
6df5158a NS |
909 | |
910 | my_friendly_assert (TYPE_P (t1) && TYPE_P (t2), 20030623); | |
911 | ||
c8a209ca NS |
912 | /* TYPENAME_TYPEs should be resolved if the qualifying scope is the |
913 | current instantiation. */ | |
914 | if (TREE_CODE (t1) == TYPENAME_TYPE) | |
915 | { | |
916 | tree resolved = resolve_typename_type (t1, /*only_current_p=*/true); | |
917 | ||
918 | if (resolved != error_mark_node) | |
919 | t1 = resolved; | |
920 | } | |
921 | ||
922 | if (TREE_CODE (t2) == TYPENAME_TYPE) | |
923 | { | |
924 | tree resolved = resolve_typename_type (t2, /*only_current_p=*/true); | |
925 | ||
926 | if (resolved != error_mark_node) | |
927 | t2 = resolved; | |
928 | } | |
8d08fdba | 929 | |
c8a209ca | 930 | /* If either type is the internal version of sizetype, use the |
21318741 RK |
931 | language version. */ |
932 | if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1) | |
c8a209ca | 933 | && TYPE_DOMAIN (t1)) |
21318741 RK |
934 | t1 = TYPE_DOMAIN (t1); |
935 | ||
936 | if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2) | |
c8a209ca | 937 | && TYPE_DOMAIN (t2)) |
21318741 | 938 | t2 = TYPE_DOMAIN (t2); |
fed3cef0 | 939 | |
5566b478 MS |
940 | if (TYPE_PTRMEMFUNC_P (t1)) |
941 | t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1); | |
942 | if (TYPE_PTRMEMFUNC_P (t2)) | |
943 | t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2); | |
944 | ||
8d08fdba | 945 | /* Different classes of types can't be compatible. */ |
8d08fdba | 946 | if (TREE_CODE (t1) != TREE_CODE (t2)) |
c8a209ca | 947 | return false; |
8d08fdba MS |
948 | |
949 | /* Qualifiers must match. */ | |
89d684bb | 950 | if (cp_type_quals (t1) != cp_type_quals (t2)) |
c8a209ca NS |
951 | return false; |
952 | if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2)) | |
953 | return false; | |
8d08fdba MS |
954 | |
955 | /* Allow for two different type nodes which have essentially the same | |
956 | definition. Note that we already checked for equality of the type | |
38e01259 | 957 | qualifiers (just above). */ |
8d08fdba MS |
958 | |
959 | if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2)) | |
c8a209ca | 960 | return true; |
8d08fdba | 961 | |
c8a209ca NS |
962 | if (!(*targetm.comp_type_attributes) (t1, t2)) |
963 | return false; | |
2986ae00 | 964 | |
8d08fdba MS |
965 | switch (TREE_CODE (t1)) |
966 | { | |
e7e66632 | 967 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 968 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
e7e66632 KL |
969 | if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2) |
970 | || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2)) | |
c8a209ca NS |
971 | return false; |
972 | if (!comp_template_parms | |
973 | (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)), | |
974 | DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2)))) | |
975 | return false; | |
a1281f45 | 976 | if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM) |
c8a209ca | 977 | return true; |
e7e66632 | 978 | /* Don't check inheritance. */ |
acd8e2d0 | 979 | strict = COMPARE_STRICT; |
e7e66632 KL |
980 | /* fall through */ |
981 | ||
8d08fdba MS |
982 | case RECORD_TYPE: |
983 | case UNION_TYPE: | |
7ddedda4 MM |
984 | if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2) |
985 | && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2) | |
c8a209ca NS |
986 | || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM) |
987 | && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2))) | |
988 | return true; | |
989 | ||
acd8e2d0 | 990 | if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2)) |
c8a209ca | 991 | return true; |
acd8e2d0 | 992 | else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1)) |
c8a209ca NS |
993 | return true; |
994 | ||
995 | return false; | |
8d08fdba MS |
996 | |
997 | case OFFSET_TYPE: | |
c8a209ca | 998 | if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2), |
acd8e2d0 | 999 | strict & ~COMPARE_REDECLARATION)) |
c8a209ca | 1000 | return false; |
acd8e2d0 | 1001 | /* FALLTHROUGH*/ |
8d08fdba | 1002 | |
8d08fdba MS |
1003 | case POINTER_TYPE: |
1004 | case REFERENCE_TYPE: | |
acd8e2d0 | 1005 | return same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)); |
8d08fdba | 1006 | |
dffa4176 | 1007 | case METHOD_TYPE: |
8d08fdba | 1008 | case FUNCTION_TYPE: |
acd8e2d0 | 1009 | if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))) |
c8a209ca NS |
1010 | return false; |
1011 | return compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)); | |
8d08fdba MS |
1012 | |
1013 | case ARRAY_TYPE: | |
9bcb9aae | 1014 | /* Target types must match incl. qualifiers. */ |
acd8e2d0 | 1015 | return comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION)); |
8d08fdba | 1016 | |
51c184be | 1017 | case TEMPLATE_TYPE_PARM: |
c8a209ca NS |
1018 | return (TEMPLATE_TYPE_IDX (t1) == TEMPLATE_TYPE_IDX (t2) |
1019 | && TEMPLATE_TYPE_LEVEL (t1) == TEMPLATE_TYPE_LEVEL (t2)); | |
e76a2646 MS |
1020 | |
1021 | case TYPENAME_TYPE: | |
c8a209ca NS |
1022 | if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1), |
1023 | TYPENAME_TYPE_FULLNAME (t2))) | |
1024 | return false; | |
3bfdc719 | 1025 | return same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)); |
7f85441b | 1026 | |
b8c6534b | 1027 | case UNBOUND_CLASS_TEMPLATE: |
c8a209ca NS |
1028 | if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2))) |
1029 | return false; | |
b8c6534b KL |
1030 | return same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)); |
1031 | ||
a7a64a77 MM |
1032 | case COMPLEX_TYPE: |
1033 | return same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)); | |
1034 | ||
7f85441b KG |
1035 | default: |
1036 | break; | |
8d08fdba | 1037 | } |
c8a209ca | 1038 | return false; |
8d08fdba MS |
1039 | } |
1040 | ||
91063b51 MM |
1041 | /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */ |
1042 | ||
acd8e2d0 NS |
1043 | bool |
1044 | at_least_as_qualified_p (tree type1, tree type2) | |
91063b51 | 1045 | { |
acd8e2d0 NS |
1046 | int q1 = cp_type_quals (type1); |
1047 | int q2 = cp_type_quals (type2); | |
1048 | ||
91063b51 | 1049 | /* All qualifiers for TYPE2 must also appear in TYPE1. */ |
acd8e2d0 | 1050 | return (q1 & q2) == q2; |
91063b51 MM |
1051 | } |
1052 | ||
1053 | /* Returns 1 if TYPE1 is more qualified than TYPE2. */ | |
1054 | ||
acd8e2d0 NS |
1055 | bool |
1056 | more_qualified_p (tree type1, tree type2) | |
91063b51 | 1057 | { |
acd8e2d0 NS |
1058 | int q1 = cp_type_quals (type1); |
1059 | int q2 = cp_type_quals (type2); | |
1060 | ||
1061 | return q1 != q2 && (q1 & q2) == q2; | |
91063b51 MM |
1062 | } |
1063 | ||
ceab47eb MM |
1064 | /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is |
1065 | more cv-qualified that TYPE1, and 0 otherwise. */ | |
1066 | ||
1067 | int | |
acd8e2d0 | 1068 | comp_cv_qualification (tree type1, tree type2) |
ceab47eb | 1069 | { |
acd8e2d0 NS |
1070 | int q1 = cp_type_quals (type1); |
1071 | int q2 = cp_type_quals (type2); | |
1072 | ||
1073 | if (q1 == q2) | |
ceab47eb MM |
1074 | return 0; |
1075 | ||
acd8e2d0 | 1076 | if ((q1 & q2) == q2) |
ceab47eb | 1077 | return 1; |
acd8e2d0 | 1078 | else if ((q1 & q2) == q1) |
ceab47eb MM |
1079 | return -1; |
1080 | ||
1081 | return 0; | |
1082 | } | |
1083 | ||
1084 | /* Returns 1 if the cv-qualification signature of TYPE1 is a proper | |
1085 | subset of the cv-qualification signature of TYPE2, and the types | |
1086 | are similar. Returns -1 if the other way 'round, and 0 otherwise. */ | |
1087 | ||
1088 | int | |
acd8e2d0 | 1089 | comp_cv_qual_signature (tree type1, tree type2) |
ceab47eb MM |
1090 | { |
1091 | if (comp_ptr_ttypes_real (type2, type1, -1)) | |
1092 | return 1; | |
1093 | else if (comp_ptr_ttypes_real (type1, type2, -1)) | |
1094 | return -1; | |
1095 | else | |
1096 | return 0; | |
1097 | } | |
1098 | ||
8d08fdba MS |
1099 | /* If two types share a common base type, return that basetype. |
1100 | If there is not a unique most-derived base type, this function | |
1101 | returns ERROR_MARK_NODE. */ | |
e92cc029 | 1102 | |
bd6dd845 | 1103 | static tree |
acd8e2d0 | 1104 | common_base_type (tree tt1, tree tt2) |
8d08fdba | 1105 | { |
5566b478 | 1106 | tree best = NULL_TREE; |
8d08fdba MS |
1107 | int i; |
1108 | ||
1109 | /* If one is a baseclass of another, that's good enough. */ | |
1110 | if (UNIQUELY_DERIVED_FROM_P (tt1, tt2)) | |
1111 | return tt1; | |
1112 | if (UNIQUELY_DERIVED_FROM_P (tt2, tt1)) | |
1113 | return tt2; | |
1114 | ||
8d08fdba MS |
1115 | /* Otherwise, try to find a unique baseclass of TT1 |
1116 | that is shared by TT2, and follow that down. */ | |
1117 | for (i = CLASSTYPE_N_BASECLASSES (tt1)-1; i >= 0; i--) | |
1118 | { | |
1119 | tree basetype = TYPE_BINFO_BASETYPE (tt1, i); | |
1120 | tree trial = common_base_type (basetype, tt2); | |
1121 | if (trial) | |
1122 | { | |
1123 | if (trial == error_mark_node) | |
1124 | return trial; | |
1125 | if (best == NULL_TREE) | |
1126 | best = trial; | |
1127 | else if (best != trial) | |
1128 | return error_mark_node; | |
1129 | } | |
1130 | } | |
1131 | ||
1132 | /* Same for TT2. */ | |
1133 | for (i = CLASSTYPE_N_BASECLASSES (tt2)-1; i >= 0; i--) | |
1134 | { | |
1135 | tree basetype = TYPE_BINFO_BASETYPE (tt2, i); | |
1136 | tree trial = common_base_type (tt1, basetype); | |
1137 | if (trial) | |
1138 | { | |
1139 | if (trial == error_mark_node) | |
1140 | return trial; | |
1141 | if (best == NULL_TREE) | |
1142 | best = trial; | |
1143 | else if (best != trial) | |
1144 | return error_mark_node; | |
1145 | } | |
1146 | } | |
1147 | return best; | |
1148 | } | |
1149 | \f | |
1150 | /* Subroutines of `comptypes'. */ | |
1151 | ||
acd8e2d0 | 1152 | /* Return true if two parameter type lists PARMS1 and PARMS2 are |
03017874 MM |
1153 | equivalent in the sense that functions with those parameter types |
1154 | can have equivalent types. The two lists must be equivalent, | |
acd8e2d0 | 1155 | element by element. */ |
8d08fdba | 1156 | |
acd8e2d0 NS |
1157 | bool |
1158 | compparms (tree parms1, tree parms2) | |
8d08fdba | 1159 | { |
acd8e2d0 | 1160 | tree t1, t2; |
8d08fdba MS |
1161 | |
1162 | /* An unspecified parmlist matches any specified parmlist | |
1163 | whose argument types don't need default promotions. */ | |
1164 | ||
acd8e2d0 NS |
1165 | for (t1 = parms1, t2 = parms2; |
1166 | t1 || t2; | |
1167 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)) | |
8d08fdba | 1168 | { |
8d08fdba | 1169 | /* If one parmlist is shorter than the other, |
4daa9c14 | 1170 | they fail to match. */ |
acd8e2d0 NS |
1171 | if (!t1 || !t2) |
1172 | return false; | |
3bfdc719 | 1173 | if (!same_type_p (TREE_VALUE (t2), TREE_VALUE (t1))) |
acd8e2d0 | 1174 | return false; |
8d08fdba | 1175 | } |
acd8e2d0 | 1176 | return true; |
8d08fdba MS |
1177 | } |
1178 | ||
8d08fdba | 1179 | \f |
7a18b933 NS |
1180 | /* Process a sizeof or alignof expression where the operand is a |
1181 | type. */ | |
1182 | ||
8d08fdba | 1183 | tree |
7a18b933 | 1184 | cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain) |
8d08fdba | 1185 | { |
fa72b064 GDR |
1186 | enum tree_code type_code; |
1187 | tree value; | |
1188 | const char *op_name; | |
8d08fdba | 1189 | |
fa72b064 | 1190 | my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720); |
7a18b933 NS |
1191 | if (type == error_mark_node) |
1192 | return error_mark_node; | |
1193 | ||
5156628f | 1194 | if (processing_template_decl) |
7a18b933 NS |
1195 | { |
1196 | value = build_min (op, size_type_node, type); | |
1197 | TREE_READONLY (value) = 1; | |
1198 | return value; | |
1199 | } | |
fa72b064 GDR |
1200 | |
1201 | op_name = operator_name_info[(int) op].name; | |
ee76b931 MM |
1202 | |
1203 | type = non_reference (type); | |
fa72b064 | 1204 | type_code = TREE_CODE (type); |
5566b478 | 1205 | |
fa72b064 | 1206 | if (type_code == METHOD_TYPE) |
8d08fdba | 1207 | { |
ea793912 | 1208 | if (complain && (pedantic || warn_pointer_arith)) |
fa72b064 GDR |
1209 | pedwarn ("invalid application of `%s' to a member function", op_name); |
1210 | value = size_one_node; | |
8d08fdba | 1211 | } |
8422942c | 1212 | else |
ea793912 | 1213 | value = c_sizeof_or_alignof_type (complete_type (type), op, complain); |
8d08fdba | 1214 | |
fa72b064 | 1215 | return value; |
8d08fdba MS |
1216 | } |
1217 | ||
7a18b933 NS |
1218 | /* Process a sizeof or alignof expression where the operand is an |
1219 | expression. */ | |
1220 | ||
5566b478 | 1221 | tree |
7a18b933 | 1222 | cxx_sizeof_or_alignof_expr (tree e, enum tree_code op) |
5566b478 | 1223 | { |
7a18b933 NS |
1224 | const char *op_name = operator_name_info[(int) op].name; |
1225 | ||
1226 | if (e == error_mark_node) | |
1227 | return error_mark_node; | |
1228 | ||
5156628f | 1229 | if (processing_template_decl) |
7a18b933 NS |
1230 | { |
1231 | e = build_min (op, size_type_node, e); | |
1232 | TREE_SIDE_EFFECTS (e) = 0; | |
1233 | TREE_READONLY (e) = 1; | |
1234 | ||
1235 | return e; | |
1236 | } | |
1237 | ||
5566b478 | 1238 | if (TREE_CODE (e) == COMPONENT_REF |
162bc98d | 1239 | && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1))) |
5566b478 | 1240 | { |
7a18b933 NS |
1241 | error ("invalid application of `%s' to a bit-field", op_name); |
1242 | e = char_type_node; | |
1243 | } | |
1244 | else if (is_overloaded_fn (e)) | |
1245 | { | |
1246 | pedwarn ("ISO C++ forbids applying `%s' to an expression of function type", op_name); | |
1247 | e = char_type_node; | |
5566b478 | 1248 | } |
05e0b2f4 JM |
1249 | else if (type_unknown_p (e)) |
1250 | { | |
7a228918 | 1251 | cxx_incomplete_type_error (e, TREE_TYPE (e)); |
7a18b933 | 1252 | e = char_type_node; |
05e0b2f4 | 1253 | } |
7a18b933 NS |
1254 | else |
1255 | e = TREE_TYPE (e); | |
1256 | ||
1257 | return cxx_sizeof_or_alignof_type (e, op, true); | |
5566b478 MS |
1258 | } |
1259 | ||
8d08fdba | 1260 | \f |
0a72704b MM |
1261 | /* Perform the conversions in [expr] that apply when an lvalue appears |
1262 | in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and | |
1263 | function-to-pointer conversions. | |
8d08fdba | 1264 | |
0a72704b | 1265 | In addition manifest constants are replaced by their values. */ |
8d08fdba MS |
1266 | |
1267 | tree | |
acd8e2d0 | 1268 | decay_conversion (tree exp) |
8d08fdba | 1269 | { |
a359be75 JM |
1270 | register tree type; |
1271 | register enum tree_code code; | |
8d08fdba | 1272 | |
a359be75 JM |
1273 | type = TREE_TYPE (exp); |
1274 | code = TREE_CODE (type); | |
8d08fdba MS |
1275 | |
1276 | if (code == REFERENCE_TYPE) | |
1277 | { | |
1278 | exp = convert_from_reference (exp); | |
1279 | type = TREE_TYPE (exp); | |
1280 | code = TREE_CODE (type); | |
1281 | } | |
1282 | ||
07c88314 MM |
1283 | if (type == error_mark_node) |
1284 | return error_mark_node; | |
1285 | ||
40260429 NS |
1286 | if (type_unknown_p (exp)) |
1287 | { | |
7a228918 | 1288 | cxx_incomplete_type_error (exp, TREE_TYPE (exp)); |
40260429 NS |
1289 | return error_mark_node; |
1290 | } | |
1291 | ||
8d08fdba MS |
1292 | /* Constants can be used directly unless they're not loadable. */ |
1293 | if (TREE_CODE (exp) == CONST_DECL) | |
1294 | exp = DECL_INITIAL (exp); | |
5f56af5a MM |
1295 | /* Replace a nonvolatile const static variable with its value. We |
1296 | don't do this for arrays, though; we want the address of the | |
1297 | first element of the array, not the address of the first element | |
2ce07e2d | 1298 | of its initializing constant. */ |
fc611ce0 | 1299 | else if (code != ARRAY_TYPE) |
8d08fdba MS |
1300 | { |
1301 | exp = decl_constant_value (exp); | |
1302 | type = TREE_TYPE (exp); | |
1303 | } | |
1304 | ||
1305 | /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue. | |
1306 | Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */ | |
1307 | ||
8d08fdba MS |
1308 | if (code == VOID_TYPE) |
1309 | { | |
8251199e | 1310 | error ("void value not ignored as it ought to be"); |
8d08fdba MS |
1311 | return error_mark_node; |
1312 | } | |
e6e174e5 | 1313 | if (code == METHOD_TYPE) |
d6b4ea85 MM |
1314 | { |
1315 | error ("invalid use of non-static member function"); | |
1316 | return error_mark_node; | |
1317 | } | |
e6e174e5 | 1318 | if (code == FUNCTION_TYPE || is_overloaded_fn (exp)) |
5f56af5a | 1319 | return build_unary_op (ADDR_EXPR, exp, 0); |
8d08fdba MS |
1320 | if (code == ARRAY_TYPE) |
1321 | { | |
1322 | register tree adr; | |
8d08fdba | 1323 | tree ptrtype; |
8d08fdba MS |
1324 | |
1325 | if (TREE_CODE (exp) == INDIRECT_REF) | |
7b6d72fc MM |
1326 | return build_nop (build_pointer_type (TREE_TYPE (type)), |
1327 | TREE_OPERAND (exp, 0)); | |
8d08fdba MS |
1328 | |
1329 | if (TREE_CODE (exp) == COMPOUND_EXPR) | |
1330 | { | |
a9aedbc2 | 1331 | tree op1 = decay_conversion (TREE_OPERAND (exp, 1)); |
8d08fdba MS |
1332 | return build (COMPOUND_EXPR, TREE_TYPE (op1), |
1333 | TREE_OPERAND (exp, 0), op1); | |
1334 | } | |
1335 | ||
1336 | if (!lvalue_p (exp) | |
1337 | && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp))) | |
1338 | { | |
8251199e | 1339 | error ("invalid use of non-lvalue array"); |
8d08fdba MS |
1340 | return error_mark_node; |
1341 | } | |
1342 | ||
01240200 | 1343 | ptrtype = build_pointer_type (TREE_TYPE (type)); |
8d08fdba MS |
1344 | |
1345 | if (TREE_CODE (exp) == VAR_DECL) | |
1346 | { | |
1347 | /* ??? This is not really quite correct | |
1348 | in that the type of the operand of ADDR_EXPR | |
1349 | is not the target type of the type of the ADDR_EXPR itself. | |
1350 | Question is, can this lossage be avoided? */ | |
1351 | adr = build1 (ADDR_EXPR, ptrtype, exp); | |
dffd7eb6 | 1352 | if (!cxx_mark_addressable (exp)) |
8d08fdba MS |
1353 | return error_mark_node; |
1354 | TREE_CONSTANT (adr) = staticp (exp); | |
1355 | TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */ | |
1356 | return adr; | |
1357 | } | |
1358 | /* This way is better for a COMPONENT_REF since it can | |
1359 | simplify the offset for a component. */ | |
1360 | adr = build_unary_op (ADDR_EXPR, exp, 1); | |
37c46b43 | 1361 | return cp_convert (ptrtype, adr); |
8d08fdba | 1362 | } |
a9aedbc2 | 1363 | |
ba9c33e8 JM |
1364 | /* [basic.lval]: Class rvalues can have cv-qualified types; non-class |
1365 | rvalues always have cv-unqualified types. */ | |
1366 | if (! CLASS_TYPE_P (type)) | |
1367 | exp = cp_convert (TYPE_MAIN_VARIANT (type), exp); | |
1368 | ||
a9aedbc2 MS |
1369 | return exp; |
1370 | } | |
1371 | ||
1372 | tree | |
acd8e2d0 | 1373 | default_conversion (tree exp) |
a9aedbc2 | 1374 | { |
a9aedbc2 MS |
1375 | exp = decay_conversion (exp); |
1376 | ||
0a72704b MM |
1377 | if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (exp))) |
1378 | exp = perform_integral_promotions (exp); | |
a9aedbc2 | 1379 | |
8d08fdba MS |
1380 | return exp; |
1381 | } | |
6b5fbb55 | 1382 | |
0a72704b MM |
1383 | /* EXPR is an expression with an integral or enumeration type. |
1384 | Perform the integral promotions in [conv.prom], and return the | |
1385 | converted value. */ | |
1386 | ||
1387 | tree | |
1388 | perform_integral_promotions (tree expr) | |
1389 | { | |
1390 | tree type; | |
1391 | tree promoted_type; | |
1392 | ||
1393 | type = TREE_TYPE (expr); | |
1394 | my_friendly_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type), 20030703); | |
1395 | promoted_type = type_promotes_to (type); | |
1396 | if (type != promoted_type) | |
1397 | expr = cp_convert (promoted_type, expr); | |
1398 | return expr; | |
1399 | } | |
1400 | ||
6b5fbb55 MS |
1401 | /* Take the address of an inline function without setting TREE_ADDRESSABLE |
1402 | or TREE_USED. */ | |
1403 | ||
1404 | tree | |
acd8e2d0 | 1405 | inline_conversion (tree exp) |
6b5fbb55 MS |
1406 | { |
1407 | if (TREE_CODE (exp) == FUNCTION_DECL) | |
91063b51 MM |
1408 | exp = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (exp)), exp); |
1409 | ||
6b5fbb55 MS |
1410 | return exp; |
1411 | } | |
d9cf7c82 JM |
1412 | |
1413 | /* Returns nonzero iff exp is a STRING_CST or the result of applying | |
1414 | decay_conversion to one. */ | |
1415 | ||
1416 | int | |
acd8e2d0 | 1417 | string_conv_p (tree totype, tree exp, int warn) |
d9cf7c82 JM |
1418 | { |
1419 | tree t; | |
1420 | ||
1421 | if (! flag_const_strings || TREE_CODE (totype) != POINTER_TYPE) | |
1422 | return 0; | |
1423 | ||
1424 | t = TREE_TYPE (totype); | |
3bfdc719 MM |
1425 | if (!same_type_p (t, char_type_node) |
1426 | && !same_type_p (t, wchar_type_node)) | |
d9cf7c82 JM |
1427 | return 0; |
1428 | ||
848b92e1 | 1429 | if (TREE_CODE (exp) == STRING_CST) |
d9cf7c82 | 1430 | { |
848b92e1 | 1431 | /* Make sure that we don't try to convert between char and wchar_t. */ |
6e176bd6 | 1432 | if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t)) |
848b92e1 JM |
1433 | return 0; |
1434 | } | |
1435 | else | |
1436 | { | |
1437 | /* Is this a string constant which has decayed to 'const char *'? */ | |
91063b51 | 1438 | t = build_pointer_type (build_qualified_type (t, TYPE_QUAL_CONST)); |
3bfdc719 | 1439 | if (!same_type_p (TREE_TYPE (exp), t)) |
d9cf7c82 JM |
1440 | return 0; |
1441 | STRIP_NOPS (exp); | |
1442 | if (TREE_CODE (exp) != ADDR_EXPR | |
1443 | || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST) | |
1444 | return 0; | |
1445 | } | |
1446 | ||
1447 | /* This warning is not very useful, as it complains about printf. */ | |
1448 | if (warn && warn_write_strings) | |
33bd39a2 | 1449 | warning ("deprecated conversion from string constant to `%T'", totype); |
d9cf7c82 JM |
1450 | |
1451 | return 1; | |
1452 | } | |
8d08fdba | 1453 | |
e9a25f70 JL |
1454 | /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we |
1455 | can, for example, use as an lvalue. This code used to be in | |
1456 | unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c' | |
1457 | expressions, where we're dealing with aggregates. But now it's again only | |
1458 | called from unary_complex_lvalue. The case (in particular) that led to | |
1459 | this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd | |
1460 | get it there. */ | |
e92cc029 | 1461 | |
8d08fdba | 1462 | static tree |
acd8e2d0 | 1463 | rationalize_conditional_expr (enum tree_code code, tree t) |
8d08fdba | 1464 | { |
e9a25f70 JL |
1465 | /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that |
1466 | the first operand is always the one to be used if both operands | |
1467 | are equal, so we know what conditional expression this used to be. */ | |
1468 | if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR) | |
1469 | { | |
1470 | return | |
1471 | build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR | |
1472 | ? LE_EXPR : GE_EXPR), | |
1473 | TREE_OPERAND (t, 0), | |
1474 | TREE_OPERAND (t, 1)), | |
1475 | build_unary_op (code, TREE_OPERAND (t, 0), 0), | |
1476 | build_unary_op (code, TREE_OPERAND (t, 1), 0)); | |
1477 | } | |
1478 | ||
8d08fdba MS |
1479 | return |
1480 | build_conditional_expr (TREE_OPERAND (t, 0), | |
1481 | build_unary_op (code, TREE_OPERAND (t, 1), 0), | |
1482 | build_unary_op (code, TREE_OPERAND (t, 2), 0)); | |
1483 | } | |
1484 | ||
9e9ff709 MS |
1485 | /* Given the TYPE of an anonymous union field inside T, return the |
1486 | FIELD_DECL for the field. If not found return NULL_TREE. Because | |
1487 | anonymous unions can nest, we must also search all anonymous unions | |
1488 | that are directly reachable. */ | |
e92cc029 | 1489 | |
9e9ff709 | 1490 | static tree |
acd8e2d0 | 1491 | lookup_anon_field (tree t, tree type) |
9e9ff709 MS |
1492 | { |
1493 | tree field; | |
1494 | ||
1495 | for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field)) | |
1496 | { | |
1497 | if (TREE_STATIC (field)) | |
1498 | continue; | |
17bbb839 | 1499 | if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field)) |
9e9ff709 MS |
1500 | continue; |
1501 | ||
1502 | /* If we find it directly, return the field. */ | |
1503 | if (DECL_NAME (field) == NULL_TREE | |
71631a1f | 1504 | && type == TYPE_MAIN_VARIANT (TREE_TYPE (field))) |
9e9ff709 MS |
1505 | { |
1506 | return field; | |
1507 | } | |
1508 | ||
1509 | /* Otherwise, it could be nested, search harder. */ | |
1510 | if (DECL_NAME (field) == NULL_TREE | |
6bdb8141 | 1511 | && ANON_AGGR_TYPE_P (TREE_TYPE (field))) |
9e9ff709 MS |
1512 | { |
1513 | tree subfield = lookup_anon_field (TREE_TYPE (field), type); | |
1514 | if (subfield) | |
1515 | return subfield; | |
1516 | } | |
1517 | } | |
1518 | return NULL_TREE; | |
1519 | } | |
1520 | ||
50ad9642 MM |
1521 | /* Build an expression representing OBJECT.MEMBER. OBJECT is an |
1522 | expression; MEMBER is a DECL or baselink. If ACCESS_PATH is | |
1523 | non-NULL, it indicates the path to the base used to name MEMBER. | |
1524 | If PRESERVE_REFERENCE is true, the expression returned will have | |
1525 | REFERENCE_TYPE if the MEMBER does. Otherwise, the expression | |
1526 | returned will have the type referred to by the reference. | |
1527 | ||
1528 | This function does not perform access control; that is either done | |
1529 | earlier by the parser when the name of MEMBER is resolved to MEMBER | |
1530 | itself, or later when overload resolution selects one of the | |
1531 | functions indicated by MEMBER. */ | |
e92cc029 | 1532 | |
8d08fdba | 1533 | tree |
50ad9642 MM |
1534 | build_class_member_access_expr (tree object, tree member, |
1535 | tree access_path, bool preserve_reference) | |
8d08fdba | 1536 | { |
50ad9642 MM |
1537 | tree object_type; |
1538 | tree member_scope; | |
1539 | tree result = NULL_TREE; | |
8d08fdba | 1540 | |
50ad9642 | 1541 | if (object == error_mark_node || member == error_mark_node) |
01240200 | 1542 | return error_mark_node; |
5566b478 | 1543 | |
a723baf1 MM |
1544 | if (TREE_CODE (member) == PSEUDO_DTOR_EXPR) |
1545 | return member; | |
1546 | ||
50ad9642 MM |
1547 | my_friendly_assert (DECL_P (member) || BASELINK_P (member), |
1548 | 20020801); | |
8d08fdba | 1549 | |
50ad9642 | 1550 | /* [expr.ref] |
5566b478 | 1551 | |
50ad9642 MM |
1552 | The type of the first expression shall be "class object" (of a |
1553 | complete type). */ | |
1554 | object_type = TREE_TYPE (object); | |
1555 | if (!complete_type_or_else (object_type, object)) | |
1556 | return error_mark_node; | |
1557 | if (!CLASS_TYPE_P (object_type)) | |
fc378698 | 1558 | { |
50ad9642 MM |
1559 | error ("request for member `%D' in `%E', which is of non-class type `%T'", |
1560 | member, object, object_type); | |
1561 | return error_mark_node; | |
fc378698 | 1562 | } |
8d08fdba | 1563 | |
50ad9642 MM |
1564 | /* The standard does not seem to actually say that MEMBER must be a |
1565 | member of OBJECT_TYPE. However, that is clearly what is | |
1566 | intended. */ | |
1567 | if (DECL_P (member)) | |
8d08fdba | 1568 | { |
50ad9642 MM |
1569 | member_scope = DECL_CLASS_CONTEXT (member); |
1570 | mark_used (member); | |
1571 | if (TREE_DEPRECATED (member)) | |
1572 | warn_deprecated_use (member); | |
1573 | } | |
1574 | else | |
1575 | member_scope = BINFO_TYPE (BASELINK_BINFO (member)); | |
1576 | /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will | |
1577 | presently be the anonymous union. Go outwards until we find a | |
1578 | type related to OBJECT_TYPE. */ | |
1579 | while (ANON_AGGR_TYPE_P (member_scope) | |
1580 | && !same_type_ignoring_top_level_qualifiers_p (member_scope, | |
1581 | object_type)) | |
1582 | member_scope = TYPE_CONTEXT (member_scope); | |
1583 | if (!member_scope || !DERIVED_FROM_P (member_scope, object_type)) | |
1584 | { | |
ef292d4f GDR |
1585 | if (TREE_CODE (member) == FIELD_DECL) |
1586 | error ("invalid use of nonstatic data member '%E'", member); | |
1587 | else | |
1588 | error ("`%D' is not a member of `%T'", member, object_type); | |
50ad9642 | 1589 | return error_mark_node; |
8d08fdba | 1590 | } |
8d08fdba | 1591 | |
f576dfc4 JM |
1592 | /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into |
1593 | `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue | |
1594 | in the frontend; only _DECLs and _REFs are lvalues in the backend. */ | |
1595 | { | |
1596 | tree temp = unary_complex_lvalue (ADDR_EXPR, object); | |
1597 | if (temp) | |
1598 | object = build_indirect_ref (temp, NULL); | |
1599 | } | |
2050a1bb | 1600 | |
50ad9642 MM |
1601 | /* In [expr.ref], there is an explicit list of the valid choices for |
1602 | MEMBER. We check for each of those cases here. */ | |
1603 | if (TREE_CODE (member) == VAR_DECL) | |
8d08fdba | 1604 | { |
50ad9642 MM |
1605 | /* A static data member. */ |
1606 | result = member; | |
1607 | /* If OBJECT has side-effects, they are supposed to occur. */ | |
1608 | if (TREE_SIDE_EFFECTS (object)) | |
1609 | result = build (COMPOUND_EXPR, TREE_TYPE (result), object, result); | |
8d08fdba | 1610 | } |
50ad9642 MM |
1611 | else if (TREE_CODE (member) == FIELD_DECL) |
1612 | { | |
1613 | /* A non-static data member. */ | |
1614 | bool null_object_p; | |
1615 | int type_quals; | |
1616 | tree member_type; | |
8d08fdba | 1617 | |
50ad9642 MM |
1618 | null_object_p = (TREE_CODE (object) == INDIRECT_REF |
1619 | && integer_zerop (TREE_OPERAND (object, 0))); | |
8d08fdba | 1620 | |
50ad9642 | 1621 | /* Convert OBJECT to the type of MEMBER. */ |
bdaa131b JM |
1622 | if (!same_type_p (TYPE_MAIN_VARIANT (object_type), |
1623 | TYPE_MAIN_VARIANT (member_scope))) | |
8d08fdba | 1624 | { |
50ad9642 MM |
1625 | tree binfo; |
1626 | base_kind kind; | |
1627 | ||
1628 | binfo = lookup_base (access_path ? access_path : object_type, | |
1629 | member_scope, ba_ignore, &kind); | |
1630 | if (binfo == error_mark_node) | |
1631 | return error_mark_node; | |
1632 | ||
bdaa131b | 1633 | /* It is invalid to try to get to a virtual base of a |
50ad9642 MM |
1634 | NULL object. The most common cause is invalid use of |
1635 | offsetof macro. */ | |
1636 | if (null_object_p && kind == bk_via_virtual) | |
1637 | { | |
1638 | error ("invalid access to non-static data member `%D' of NULL object", | |
1639 | member); | |
1640 | error ("(perhaps the `offsetof' macro was used incorrectly)"); | |
1641 | return error_mark_node; | |
1642 | } | |
1643 | ||
1644 | /* Convert to the base. */ | |
1645 | object = build_base_path (PLUS_EXPR, object, binfo, | |
1646 | /*nonnull=*/1); | |
1647 | /* If we found the base successfully then we should be able | |
1648 | to convert to it successfully. */ | |
1649 | my_friendly_assert (object != error_mark_node, | |
1650 | 20020801); | |
8d08fdba | 1651 | } |
3b5b4904 JM |
1652 | |
1653 | /* Complain about other invalid uses of offsetof, even though they will | |
1654 | give the right answer. Note that we complain whether or not they | |
1655 | actually used the offsetof macro, since there's no way to know at this | |
1656 | point. So we just give a warning, instead of a pedwarn. */ | |
a01fff59 MA |
1657 | if (null_object_p && warn_invalid_offsetof |
1658 | && CLASSTYPE_NON_POD_P (object_type)) | |
8d08fdba | 1659 | { |
50ad9642 MM |
1660 | warning ("invalid access to non-static data member `%D' of NULL object", |
1661 | member); | |
1662 | warning ("(perhaps the `offsetof' macro was used incorrectly)"); | |
8d08fdba | 1663 | } |
8d08fdba | 1664 | |
50ad9642 MM |
1665 | /* If MEMBER is from an anonymous aggregate, we have converted |
1666 | OBJECT so that it refers to the class containing the | |
1667 | anonymous union. Generate a reference to the anonymous union | |
1668 | itself, and recur to find MEMBER. */ | |
0ca7178c | 1669 | if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member)) |
a723baf1 MM |
1670 | /* When this code is called from build_field_call, the |
1671 | object already has the type of the anonymous union. | |
1672 | That is because the COMPONENT_REF was already | |
1673 | constructed, and was then disassembled before calling | |
1674 | build_field_call. After the function-call code is | |
1675 | cleaned up, this waste can be eliminated. */ | |
1676 | && (!same_type_ignoring_top_level_qualifiers_p | |
1677 | (TREE_TYPE (object), DECL_CONTEXT (member)))) | |
50ad9642 MM |
1678 | { |
1679 | tree anonymous_union; | |
1680 | ||
1681 | anonymous_union = lookup_anon_field (TREE_TYPE (object), | |
1682 | DECL_CONTEXT (member)); | |
1683 | object = build_class_member_access_expr (object, | |
1684 | anonymous_union, | |
1685 | /*access_path=*/NULL_TREE, | |
1686 | preserve_reference); | |
1687 | } | |
1688 | ||
1689 | /* Compute the type of the field, as described in [expr.ref]. */ | |
1690 | type_quals = TYPE_UNQUALIFIED; | |
1691 | member_type = TREE_TYPE (member); | |
1692 | if (TREE_CODE (member_type) != REFERENCE_TYPE) | |
1693 | { | |
1694 | type_quals = (cp_type_quals (member_type) | |
1695 | | cp_type_quals (object_type)); | |
1696 | ||
1697 | /* A field is const (volatile) if the enclosing object, or the | |
1698 | field itself, is const (volatile). But, a mutable field is | |
1699 | not const, even within a const object. */ | |
1700 | if (DECL_MUTABLE_P (member)) | |
1701 | type_quals &= ~TYPE_QUAL_CONST; | |
1702 | member_type = cp_build_qualified_type (member_type, type_quals); | |
1703 | } | |
1704 | ||
1705 | result = fold (build (COMPONENT_REF, member_type, object, member)); | |
1706 | ||
1707 | /* Mark the expression const or volatile, as appropriate. Even | |
1708 | though we've dealt with the type above, we still have to mark the | |
1709 | expression itself. */ | |
1710 | if (type_quals & TYPE_QUAL_CONST) | |
1711 | TREE_READONLY (result) = 1; | |
1712 | else if (type_quals & TYPE_QUAL_VOLATILE) | |
1713 | TREE_THIS_VOLATILE (result) = 1; | |
1714 | } | |
1715 | else if (BASELINK_P (member)) | |
9e9ff709 | 1716 | { |
50ad9642 MM |
1717 | /* The member is a (possibly overloaded) member function. */ |
1718 | tree functions; | |
a723baf1 | 1719 | tree type; |
50ad9642 MM |
1720 | |
1721 | /* If the MEMBER is exactly one static member function, then we | |
1722 | know the type of the expression. Otherwise, we must wait | |
1723 | until overload resolution has been performed. */ | |
1724 | functions = BASELINK_FUNCTIONS (member); | |
1725 | if (TREE_CODE (functions) == FUNCTION_DECL | |
1726 | && DECL_STATIC_FUNCTION_P (functions)) | |
a723baf1 | 1727 | type = TREE_TYPE (functions); |
50ad9642 | 1728 | else |
a723baf1 MM |
1729 | type = unknown_type_node; |
1730 | /* Note that we do not convert OBJECT to the BASELINK_BINFO | |
1731 | base. That will happen when the function is called. */ | |
1732 | result = build (COMPONENT_REF, type, object, member); | |
9e9ff709 | 1733 | } |
50ad9642 | 1734 | else if (TREE_CODE (member) == CONST_DECL) |
b928a651 | 1735 | { |
50ad9642 MM |
1736 | /* The member is an enumerator. */ |
1737 | result = member; | |
1738 | /* If OBJECT has side-effects, they are supposed to occur. */ | |
1739 | if (TREE_SIDE_EFFECTS (object)) | |
1740 | result = build (COMPOUND_EXPR, TREE_TYPE (result), | |
1741 | object, result); | |
b928a651 | 1742 | } |
8d08fdba MS |
1743 | else |
1744 | { | |
50ad9642 MM |
1745 | error ("invalid use of `%D'", member); |
1746 | return error_mark_node; | |
1747 | } | |
8d08fdba | 1748 | |
50ad9642 MM |
1749 | if (!preserve_reference) |
1750 | /* [expr.ref] | |
1751 | ||
1752 | If E2 is declared to have type "reference to T", then ... the | |
1753 | type of E1.E2 is T. */ | |
1754 | result = convert_from_reference (result); | |
e6f62286 | 1755 | |
50ad9642 MM |
1756 | return result; |
1757 | } | |
8d08fdba | 1758 | |
a723baf1 MM |
1759 | /* Return the destructor denoted by OBJECT.SCOPE::~DTOR_NAME, or, if |
1760 | SCOPE is NULL, by OBJECT.~DTOR_NAME. */ | |
1761 | ||
1762 | static tree | |
1763 | lookup_destructor (tree object, tree scope, tree dtor_name) | |
1764 | { | |
1765 | tree object_type = TREE_TYPE (object); | |
1766 | tree dtor_type = TREE_OPERAND (dtor_name, 0); | |
1767 | ||
1768 | if (scope && !check_dtor_name (scope, dtor_name)) | |
1769 | { | |
1770 | error ("qualified type `%T' does not match destructor name `~%T'", | |
1771 | scope, dtor_type); | |
1772 | return error_mark_node; | |
1773 | } | |
1774 | if (!same_type_p (dtor_type, TYPE_MAIN_VARIANT (object_type))) | |
1775 | { | |
1776 | error ("destructor name `%T' does not match type `%T' of expression", | |
1777 | dtor_type, object_type); | |
1778 | return error_mark_node; | |
1779 | } | |
1780 | if (!TYPE_HAS_DESTRUCTOR (object_type)) | |
1781 | return build (PSEUDO_DTOR_EXPR, void_type_node, object, scope, | |
1782 | dtor_type); | |
1783 | return lookup_member (object_type, complete_dtor_identifier, | |
86ac0575 | 1784 | /*protect=*/1, /*want_type=*/false); |
a723baf1 MM |
1785 | } |
1786 | ||
50ad9642 MM |
1787 | /* This function is called by the parser to process a class member |
1788 | access expression of the form OBJECT.NAME. NAME is a node used by | |
1789 | the parser to represent a name; it is not yet a DECL. It may, | |
1790 | however, be a BASELINK where the BASELINK_FUNCTIONS is a | |
1791 | TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and | |
1792 | there is no reason to do the lookup twice, so the parser keeps the | |
1793 | BASELINK. */ | |
8d08fdba | 1794 | |
50ad9642 MM |
1795 | tree |
1796 | finish_class_member_access_expr (tree object, tree name) | |
1797 | { | |
d17811fd | 1798 | tree expr; |
50ad9642 MM |
1799 | tree object_type; |
1800 | tree member; | |
1801 | tree access_path = NULL_TREE; | |
d17811fd MM |
1802 | tree orig_object = object; |
1803 | tree orig_name = name; | |
3c8c2a0a | 1804 | |
50ad9642 MM |
1805 | if (object == error_mark_node || name == error_mark_node) |
1806 | return error_mark_node; | |
3c8c2a0a | 1807 | |
d17811fd MM |
1808 | object_type = TREE_TYPE (object); |
1809 | ||
50ad9642 | 1810 | if (processing_template_decl) |
d17811fd MM |
1811 | { |
1812 | if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */ | |
1813 | dependent_type_p (object_type) | |
1814 | /* If NAME is "f<args>", where either 'f' or 'args' is | |
1815 | dependent, then the expression is dependent. */ | |
1816 | || (TREE_CODE (name) == TEMPLATE_ID_EXPR | |
1817 | && dependent_template_id_p (TREE_OPERAND (name, 0), | |
1818 | TREE_OPERAND (name, 1))) | |
1819 | /* If NAME is "T::X" where "T" is dependent, then the | |
1820 | expression is dependent. */ | |
1821 | || (TREE_CODE (name) == SCOPE_REF | |
1822 | && TYPE_P (TREE_OPERAND (name, 0)) | |
1823 | && dependent_type_p (TREE_OPERAND (name, 0)))) | |
1824 | return build_min_nt (COMPONENT_REF, object, name); | |
1825 | object = build_non_dependent_expr (object); | |
1826 | } | |
50ad9642 | 1827 | |
50ad9642 MM |
1828 | if (TREE_CODE (object_type) == REFERENCE_TYPE) |
1829 | { | |
1830 | object = convert_from_reference (object); | |
1831 | object_type = TREE_TYPE (object); | |
8d08fdba MS |
1832 | } |
1833 | ||
50ad9642 | 1834 | /* [expr.ref] |
e23bd218 | 1835 | |
50ad9642 MM |
1836 | The type of the first expression shall be "class object" (of a |
1837 | complete type). */ | |
1838 | if (!complete_type_or_else (object_type, object)) | |
1839 | return error_mark_node; | |
1840 | if (!CLASS_TYPE_P (object_type)) | |
1841 | { | |
1842 | error ("request for member `%D' in `%E', which is of non-class type `%T'", | |
1843 | name, object, object_type); | |
1844 | return error_mark_node; | |
1845 | } | |
f2d9afec | 1846 | |
50ad9642 | 1847 | if (BASELINK_P (name)) |
9e9ff709 | 1848 | { |
50ad9642 MM |
1849 | /* A member function that has already been looked up. */ |
1850 | my_friendly_assert ((TREE_CODE (BASELINK_FUNCTIONS (name)) | |
1851 | == TEMPLATE_ID_EXPR), | |
1852 | 20020805); | |
1853 | member = name; | |
1854 | } | |
1855 | else | |
1856 | { | |
1857 | bool is_template_id = false; | |
1858 | tree template_args = NULL_TREE; | |
d17811fd | 1859 | tree scope; |
2ee887f2 | 1860 | |
50ad9642 | 1861 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) |
2ee887f2 | 1862 | { |
50ad9642 MM |
1863 | is_template_id = true; |
1864 | template_args = TREE_OPERAND (name, 1); | |
1865 | name = TREE_OPERAND (name, 0); | |
1866 | } | |
f2d9afec | 1867 | |
50ad9642 MM |
1868 | if (TREE_CODE (name) == SCOPE_REF) |
1869 | { | |
50ad9642 MM |
1870 | /* A qualified name. The qualifying class or namespace `S' has |
1871 | already been looked up; it is either a TYPE or a | |
1872 | NAMESPACE_DECL. The member name is either an IDENTIFIER_NODE | |
1873 | or a BIT_NOT_EXPR. */ | |
1874 | scope = TREE_OPERAND (name, 0); | |
1875 | name = TREE_OPERAND (name, 1); | |
1876 | my_friendly_assert ((CLASS_TYPE_P (scope) | |
1877 | || TREE_CODE (scope) == NAMESPACE_DECL), | |
1878 | 20020804); | |
1879 | my_friendly_assert ((TREE_CODE (name) == IDENTIFIER_NODE | |
1880 | || TREE_CODE (name) == BIT_NOT_EXPR), | |
1881 | 20020804); | |
1882 | ||
1883 | /* If SCOPE is a namespace, then the qualified name does not | |
1884 | name a member of OBJECT_TYPE. */ | |
1885 | if (TREE_CODE (scope) == NAMESPACE_DECL) | |
2ee887f2 | 1886 | { |
50ad9642 | 1887 | error ("`%D::%D' is not a member of `%T'", |
5b770a96 | 1888 | scope, name, object_type); |
2ee887f2 MS |
1889 | return error_mark_node; |
1890 | } | |
50ad9642 MM |
1891 | |
1892 | /* Find the base of OBJECT_TYPE corresponding to SCOPE. */ | |
1893 | access_path = lookup_base (object_type, scope, ba_check, NULL); | |
1894 | if (!access_path || access_path == error_mark_node) | |
1895 | return error_mark_node; | |
2ee887f2 | 1896 | } |
d17811fd MM |
1897 | else |
1898 | { | |
1899 | scope = NULL_TREE; | |
1900 | access_path = object_type; | |
1901 | } | |
1902 | ||
1903 | if (TREE_CODE (name) == BIT_NOT_EXPR) | |
1904 | member = lookup_destructor (object, scope, name); | |
1905 | else | |
9e9ff709 | 1906 | { |
d17811fd MM |
1907 | /* Look up the member. */ |
1908 | member = lookup_member (access_path, name, /*protect=*/1, | |
86ac0575 | 1909 | /*want_type=*/false); |
8a5f4379 GDR |
1910 | if (member == NULL_TREE) |
1911 | { | |
1912 | error ("'%D' has no member named '%E'", object_type, name); | |
1913 | return error_mark_node; | |
1914 | } | |
d17811fd | 1915 | if (member == error_mark_node) |
50ad9642 MM |
1916 | return error_mark_node; |
1917 | } | |
50ad9642 MM |
1918 | |
1919 | if (is_template_id) | |
1920 | { | |
1921 | tree template = member; | |
1922 | ||
1923 | if (BASELINK_P (template)) | |
d17811fd | 1924 | template = lookup_template_function (template, template_args); |
50ad9642 MM |
1925 | else |
1926 | { | |
1927 | error ("`%D' is not a member template function", name); | |
1928 | return error_mark_node; | |
1929 | } | |
9e9ff709 MS |
1930 | } |
1931 | } | |
1932 | ||
a723baf1 MM |
1933 | if (TREE_DEPRECATED (member)) |
1934 | warn_deprecated_use (member); | |
1935 | ||
d17811fd | 1936 | expr = build_class_member_access_expr (object, member, access_path, |
50ad9642 | 1937 | /*preserve_reference=*/false); |
d17811fd MM |
1938 | if (processing_template_decl && expr != error_mark_node) |
1939 | return build_min (COMPONENT_REF, TREE_TYPE (expr), orig_object, | |
1940 | orig_name); | |
1941 | return expr; | |
8d08fdba | 1942 | } |
5156628f | 1943 | |
50ad9642 MM |
1944 | /* Return an expression for the MEMBER_NAME field in the internal |
1945 | representation of PTRMEM, a pointer-to-member function. (Each | |
1946 | pointer-to-member function type gets its own RECORD_TYPE so it is | |
1947 | more convenient to access the fields by name than by FIELD_DECL.) | |
1948 | This routine converts the NAME to a FIELD_DECL and then creates the | |
1949 | node for the complete expression. */ | |
5156628f MS |
1950 | |
1951 | tree | |
50ad9642 | 1952 | build_ptrmemfunc_access_expr (tree ptrmem, tree member_name) |
5156628f | 1953 | { |
50ad9642 MM |
1954 | tree ptrmem_type; |
1955 | tree member; | |
1956 | tree member_type; | |
1957 | ||
1958 | /* This code is a stripped down version of | |
1959 | build_class_member_access_expr. It does not work to use that | |
1960 | routine directly because it expects the object to be of class | |
1961 | type. */ | |
1962 | ptrmem_type = TREE_TYPE (ptrmem); | |
1963 | my_friendly_assert (TYPE_PTRMEMFUNC_P (ptrmem_type), 20020804); | |
1964 | member = lookup_member (ptrmem_type, member_name, /*protect=*/0, | |
86ac0575 | 1965 | /*want_type=*/false); |
50ad9642 MM |
1966 | member_type = cp_build_qualified_type (TREE_TYPE (member), |
1967 | cp_type_quals (ptrmem_type)); | |
1968 | return fold (build (COMPONENT_REF, member_type, ptrmem, member)); | |
5156628f | 1969 | } |
50ad9642 | 1970 | |
8d08fdba MS |
1971 | /* Given an expression PTR for a pointer, return an expression |
1972 | for the value pointed to. | |
1973 | ERRORSTRING is the name of the operator to appear in error messages. | |
1974 | ||
1975 | This function may need to overload OPERATOR_FNNAME. | |
1976 | Must also handle REFERENCE_TYPEs for C++. */ | |
1977 | ||
1978 | tree | |
d17811fd | 1979 | build_x_indirect_ref (tree expr, const char *errorstring) |
8d08fdba | 1980 | { |
d17811fd | 1981 | tree orig_expr = expr; |
5566b478 MS |
1982 | tree rval; |
1983 | ||
5156628f | 1984 | if (processing_template_decl) |
d17811fd MM |
1985 | { |
1986 | if (type_dependent_expression_p (expr)) | |
1987 | return build_min_nt (INDIRECT_REF, expr); | |
1988 | expr = build_non_dependent_expr (expr); | |
1989 | } | |
5566b478 | 1990 | |
d17811fd | 1991 | rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE, |
14d22dd6 | 1992 | NULL_TREE); |
d17811fd MM |
1993 | if (!rval) |
1994 | rval = build_indirect_ref (expr, errorstring); | |
1995 | ||
1996 | if (processing_template_decl && rval != error_mark_node) | |
1997 | return build_min (INDIRECT_REF, TREE_TYPE (rval), orig_expr); | |
1998 | else | |
8d08fdba | 1999 | return rval; |
8d08fdba MS |
2000 | } |
2001 | ||
2002 | tree | |
5671bf27 | 2003 | build_indirect_ref (tree ptr, const char *errorstring) |
8d08fdba | 2004 | { |
c11b6f21 MS |
2005 | register tree pointer, type; |
2006 | ||
2007 | if (ptr == error_mark_node) | |
2008 | return error_mark_node; | |
2009 | ||
90e734a8 JM |
2010 | if (ptr == current_class_ptr) |
2011 | return current_class_ref; | |
2012 | ||
c11b6f21 | 2013 | pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE |
0a72704b | 2014 | ? ptr : decay_conversion (ptr)); |
c11b6f21 | 2015 | type = TREE_TYPE (pointer); |
8d08fdba | 2016 | |
162bc98d | 2017 | if (TYPE_PTR_P (type) || TREE_CODE (type) == REFERENCE_TYPE) |
8d08fdba | 2018 | { |
01240200 MM |
2019 | /* [expr.unary.op] |
2020 | ||
2021 | If the type of the expression is "pointer to T," the type | |
2022 | of the result is "T." | |
2023 | ||
2024 | We must use the canonical variant because certain parts of | |
2025 | the back end, like fold, do pointer comparisons between | |
2026 | types. */ | |
2027 | tree t = canonical_type_variant (TREE_TYPE (type)); | |
2028 | ||
b72801e2 | 2029 | if (VOID_TYPE_P (t)) |
a9183fef NS |
2030 | { |
2031 | /* A pointer to incomplete type (other than cv void) can be | |
2032 | dereferenced [expr.unary.op]/1 */ | |
33bd39a2 | 2033 | error ("`%T' is not a pointer-to-object type", type); |
a9183fef NS |
2034 | return error_mark_node; |
2035 | } | |
2036 | else if (TREE_CODE (pointer) == ADDR_EXPR | |
688f6688 | 2037 | && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0)))) |
01240200 MM |
2038 | /* The POINTER was something like `&x'. We simplify `*&x' to |
2039 | `x'. */ | |
8d08fdba MS |
2040 | return TREE_OPERAND (pointer, 0); |
2041 | else | |
2042 | { | |
01240200 | 2043 | tree ref = build1 (INDIRECT_REF, t, pointer); |
8d08fdba | 2044 | |
b0d75c1e BK |
2045 | /* We *must* set TREE_READONLY when dereferencing a pointer to const, |
2046 | so that we get the proper error message if the result is used | |
2047 | to assign to. Also, &* is supposed to be a no-op. */ | |
91063b51 MM |
2048 | TREE_READONLY (ref) = CP_TYPE_CONST_P (t); |
2049 | TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t); | |
8d08fdba | 2050 | TREE_SIDE_EFFECTS (ref) |
271bd540 | 2051 | = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer)); |
8d08fdba MS |
2052 | return ref; |
2053 | } | |
2054 | } | |
2055 | /* `pointer' won't be an error_mark_node if we were given a | |
2056 | pointer to member, so it's cool to check for this here. */ | |
a5ac359a | 2057 | else if (TYPE_PTR_TO_MEMBER_P (type)) |
162bc98d | 2058 | error ("invalid use of `%s' on pointer to member", errorstring); |
8d08fdba MS |
2059 | else if (pointer != error_mark_node) |
2060 | { | |
2061 | if (errorstring) | |
8251199e | 2062 | error ("invalid type argument of `%s'", errorstring); |
8d08fdba | 2063 | else |
8251199e | 2064 | error ("invalid type argument"); |
8d08fdba MS |
2065 | } |
2066 | return error_mark_node; | |
2067 | } | |
2068 | ||
2069 | /* This handles expressions of the form "a[i]", which denotes | |
2070 | an array reference. | |
2071 | ||
2072 | This is logically equivalent in C to *(a+i), but we may do it differently. | |
2073 | If A is a variable or a member, we generate a primitive ARRAY_REF. | |
2074 | This avoids forcing the array out of registers, and can work on | |
2075 | arrays that are not lvalues (for example, members of structures returned | |
2076 | by functions). | |
2077 | ||
2078 | If INDEX is of some user-defined type, it must be converted to | |
2079 | integer type. Otherwise, to make a compatible PLUS_EXPR, it | |
2080 | will inherit the type of the array, which will be some pointer type. */ | |
2081 | ||
8d08fdba | 2082 | tree |
5671bf27 | 2083 | build_array_ref (tree array, tree idx) |
8d08fdba | 2084 | { |
8d08fdba MS |
2085 | if (idx == 0) |
2086 | { | |
8251199e | 2087 | error ("subscript missing in array reference"); |
8d08fdba MS |
2088 | return error_mark_node; |
2089 | } | |
2090 | ||
2091 | if (TREE_TYPE (array) == error_mark_node | |
2092 | || TREE_TYPE (idx) == error_mark_node) | |
2093 | return error_mark_node; | |
2094 | ||
0450d74d RH |
2095 | /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference |
2096 | inside it. */ | |
2097 | switch (TREE_CODE (array)) | |
2098 | { | |
2099 | case COMPOUND_EXPR: | |
2100 | { | |
2101 | tree value = build_array_ref (TREE_OPERAND (array, 1), idx); | |
2102 | return build (COMPOUND_EXPR, TREE_TYPE (value), | |
2103 | TREE_OPERAND (array, 0), value); | |
2104 | } | |
2105 | ||
2106 | case COND_EXPR: | |
2107 | return build_conditional_expr | |
2108 | (TREE_OPERAND (array, 0), | |
2109 | build_array_ref (TREE_OPERAND (array, 1), idx), | |
2110 | build_array_ref (TREE_OPERAND (array, 2), idx)); | |
2111 | ||
2112 | default: | |
2113 | break; | |
2114 | } | |
2115 | ||
8d08fdba MS |
2116 | if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE |
2117 | && TREE_CODE (array) != INDIRECT_REF) | |
2118 | { | |
2119 | tree rval, type; | |
2120 | ||
2121 | /* Subscripting with type char is likely to lose | |
2122 | on a machine where chars are signed. | |
2123 | So warn on any machine, but optionally. | |
2124 | Don't warn for unsigned char since that type is safe. | |
2125 | Don't warn for signed char because anyone who uses that | |
2126 | must have done so deliberately. */ | |
2127 | if (warn_char_subscripts | |
2128 | && TYPE_MAIN_VARIANT (TREE_TYPE (idx)) == char_type_node) | |
8251199e | 2129 | warning ("array subscript has type `char'"); |
8d08fdba | 2130 | |
0a72704b | 2131 | if (!INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (idx))) |
8d08fdba | 2132 | { |
8251199e | 2133 | error ("array subscript is not an integer"); |
8d08fdba MS |
2134 | return error_mark_node; |
2135 | } | |
2136 | ||
0a72704b MM |
2137 | /* Apply integral promotions *after* noticing character types. |
2138 | (It is unclear why we do these promotions -- the standard | |
2139 | does not say that we should. In fact, the natual thing would | |
2140 | seem to be to convert IDX to ptrdiff_t; we're performing | |
2141 | pointer arithmetic.) */ | |
2142 | idx = perform_integral_promotions (idx); | |
2143 | ||
8d08fdba MS |
2144 | /* An array that is indexed by a non-constant |
2145 | cannot be stored in a register; we must be able to do | |
2146 | address arithmetic on its address. | |
2147 | Likewise an array of elements of variable size. */ | |
2148 | if (TREE_CODE (idx) != INTEGER_CST | |
d0f062fb | 2149 | || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array))) |
3c215895 JM |
2150 | && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) |
2151 | != INTEGER_CST))) | |
8d08fdba | 2152 | { |
dffd7eb6 | 2153 | if (!cxx_mark_addressable (array)) |
8d08fdba MS |
2154 | return error_mark_node; |
2155 | } | |
0450d74d | 2156 | |
8d08fdba MS |
2157 | /* An array that is indexed by a constant value which is not within |
2158 | the array bounds cannot be stored in a register either; because we | |
2159 | would get a crash in store_bit_field/extract_bit_field when trying | |
2160 | to access a non-existent part of the register. */ | |
2161 | if (TREE_CODE (idx) == INTEGER_CST | |
2162 | && TYPE_VALUES (TREE_TYPE (array)) | |
2163 | && ! int_fits_type_p (idx, TYPE_VALUES (TREE_TYPE (array)))) | |
2164 | { | |
dffd7eb6 | 2165 | if (!cxx_mark_addressable (array)) |
8d08fdba MS |
2166 | return error_mark_node; |
2167 | } | |
2168 | ||
8d08fdba | 2169 | if (pedantic && !lvalue_p (array)) |
7e4d7898 | 2170 | pedwarn ("ISO C++ forbids subscripting non-lvalue array"); |
8d08fdba | 2171 | |
b7484fbe MS |
2172 | /* Note in C++ it is valid to subscript a `register' array, since |
2173 | it is valid to take the address of something with that | |
2174 | storage specification. */ | |
2175 | if (extra_warnings) | |
8d08fdba MS |
2176 | { |
2177 | tree foo = array; | |
2178 | while (TREE_CODE (foo) == COMPONENT_REF) | |
2179 | foo = TREE_OPERAND (foo, 0); | |
2180 | if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo)) | |
8251199e | 2181 | warning ("subscripting array declared `register'"); |
8d08fdba MS |
2182 | } |
2183 | ||
01240200 | 2184 | type = TREE_TYPE (TREE_TYPE (array)); |
8d08fdba MS |
2185 | rval = build (ARRAY_REF, type, array, idx); |
2186 | /* Array ref is const/volatile if the array elements are | |
2187 | or if the array is.. */ | |
2188 | TREE_READONLY (rval) | |
91063b51 | 2189 | |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array)); |
8d08fdba | 2190 | TREE_SIDE_EFFECTS (rval) |
91063b51 | 2191 | |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array)); |
8d08fdba | 2192 | TREE_THIS_VOLATILE (rval) |
91063b51 | 2193 | |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array)); |
8d08fdba MS |
2194 | return require_complete_type (fold (rval)); |
2195 | } | |
2196 | ||
2197 | { | |
2198 | tree ar = default_conversion (array); | |
2199 | tree ind = default_conversion (idx); | |
2200 | ||
2201 | /* Put the integer in IND to simplify error checking. */ | |
2202 | if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE) | |
2203 | { | |
2204 | tree temp = ar; | |
2205 | ar = ind; | |
2206 | ind = temp; | |
2207 | } | |
2208 | ||
2209 | if (ar == error_mark_node) | |
2210 | return ar; | |
2211 | ||
2212 | if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE) | |
2213 | { | |
8251199e | 2214 | error ("subscripted value is neither array nor pointer"); |
8d08fdba MS |
2215 | return error_mark_node; |
2216 | } | |
2217 | if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE) | |
2218 | { | |
8251199e | 2219 | error ("array subscript is not an integer"); |
8d08fdba MS |
2220 | return error_mark_node; |
2221 | } | |
2222 | ||
ab76ca54 | 2223 | return build_indirect_ref (cp_build_binary_op (PLUS_EXPR, ar, ind), |
8d08fdba MS |
2224 | "array indexing"); |
2225 | } | |
2226 | } | |
2227 | \f | |
8d08fdba | 2228 | /* Resolve a pointer to member function. INSTANCE is the object |
c87978aa JM |
2229 | instance to use, if the member points to a virtual member. |
2230 | ||
2231 | This used to avoid checking for virtual functions if basetype | |
2232 | has no virtual functions, according to an earlier ANSI draft. | |
2233 | With the final ISO C++ rules, such an optimization is | |
2234 | incorrect: A pointer to a derived member can be static_cast | |
2235 | to pointer-to-base-member, as long as the dynamic object | |
c6002625 | 2236 | later has the right member. */ |
8d08fdba MS |
2237 | |
2238 | tree | |
5671bf27 | 2239 | get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function) |
8d08fdba MS |
2240 | { |
2241 | if (TREE_CODE (function) == OFFSET_REF) | |
338d90b8 | 2242 | function = TREE_OPERAND (function, 1); |
8d08fdba MS |
2243 | |
2244 | if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function))) | |
2245 | { | |
c87978aa JM |
2246 | tree idx, delta, e1, e2, e3, vtbl, basetype; |
2247 | tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function)); | |
f30432d7 | 2248 | |
b7484fbe | 2249 | tree instance_ptr = *instance_ptrptr; |
1c83ea9f | 2250 | tree instance_save_expr = 0; |
c87978aa | 2251 | if (instance_ptr == error_mark_node) |
32facac8 | 2252 | { |
c87978aa JM |
2253 | if (TREE_CODE (function) == PTRMEM_CST) |
2254 | { | |
2255 | /* Extracting the function address from a pmf is only | |
2256 | allowed with -Wno-pmf-conversions. It only works for | |
c6002625 | 2257 | pmf constants. */ |
c87978aa JM |
2258 | e1 = build_addr_func (PTRMEM_CST_MEMBER (function)); |
2259 | e1 = convert (fntype, e1); | |
2260 | return e1; | |
2261 | } | |
2262 | else | |
2263 | { | |
2264 | error ("object missing in use of `%E'", function); | |
2265 | return error_mark_node; | |
2266 | } | |
32facac8 ML |
2267 | } |
2268 | ||
b7484fbe | 2269 | if (TREE_SIDE_EFFECTS (instance_ptr)) |
1c83ea9f | 2270 | instance_ptr = instance_save_expr = save_expr (instance_ptr); |
b7484fbe | 2271 | |
f30432d7 MS |
2272 | if (TREE_SIDE_EFFECTS (function)) |
2273 | function = save_expr (function); | |
2274 | ||
c87978aa | 2275 | /* Start by extracting all the information from the PMF itself. */ |
c1def683 | 2276 | e3 = PFN_FROM_PTRMEMFUNC (function); |
50ad9642 | 2277 | delta = build_ptrmemfunc_access_expr (function, delta_identifier); |
85b7def6 | 2278 | idx = build1 (NOP_EXPR, vtable_index_type, e3); |
cb7fdde2 AO |
2279 | switch (TARGET_PTRMEMFUNC_VBIT_LOCATION) |
2280 | { | |
2281 | case ptrmemfunc_vbit_in_pfn: | |
85b7def6 | 2282 | e1 = cp_build_binary_op (BIT_AND_EXPR, idx, integer_one_node); |
c87978aa | 2283 | idx = cp_build_binary_op (MINUS_EXPR, idx, integer_one_node); |
cb7fdde2 AO |
2284 | break; |
2285 | ||
2286 | case ptrmemfunc_vbit_in_delta: | |
c87978aa JM |
2287 | e1 = cp_build_binary_op (BIT_AND_EXPR, delta, integer_one_node); |
2288 | delta = cp_build_binary_op (RSHIFT_EXPR, delta, integer_one_node); | |
cb7fdde2 AO |
2289 | break; |
2290 | ||
2291 | default: | |
2292 | abort (); | |
2293 | } | |
03b256e4 | 2294 | |
c87978aa | 2295 | /* Convert down to the right base before using the instance. First |
c6002625 | 2296 | use the type... */ |
c87978aa JM |
2297 | basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype)); |
2298 | basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)), | |
2299 | basetype, ba_check, NULL); | |
2300 | instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype, 1); | |
2301 | if (instance_ptr == error_mark_node) | |
2302 | return error_mark_node; | |
2303 | /* ...and then the delta in the PMF. */ | |
2304 | instance_ptr = build (PLUS_EXPR, TREE_TYPE (instance_ptr), | |
2305 | instance_ptr, delta); | |
2306 | ||
2307 | /* Hand back the adjusted 'this' argument to our caller. */ | |
2308 | *instance_ptrptr = instance_ptr; | |
2309 | ||
2310 | /* Next extract the vtable pointer from the object. */ | |
2311 | vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node), | |
2312 | instance_ptr); | |
3e411c3f | 2313 | vtbl = build_indirect_ref (vtbl, NULL); |
85b7def6 | 2314 | |
c87978aa | 2315 | /* Finally, extract the function pointer from the vtable. */ |
85b7def6 JM |
2316 | e2 = fold (build (PLUS_EXPR, TREE_TYPE (vtbl), vtbl, idx)); |
2317 | e2 = build_indirect_ref (e2, NULL); | |
f63ab951 | 2318 | TREE_CONSTANT (e2) = 1; |
c7e266a6 | 2319 | |
67231816 RH |
2320 | /* When using function descriptors, the address of the |
2321 | vtable entry is treated as a function pointer. */ | |
2322 | if (TARGET_VTABLE_USES_DESCRIPTORS) | |
2323 | e2 = build1 (NOP_EXPR, TREE_TYPE (e2), | |
2324 | build_unary_op (ADDR_EXPR, e2, /*noconvert=*/1)); | |
2325 | ||
03b256e4 ML |
2326 | TREE_TYPE (e2) = TREE_TYPE (e3); |
2327 | e1 = build_conditional_expr (e1, e2, e3); | |
2328 | ||
2329 | /* Make sure this doesn't get evaluated first inside one of the | |
2330 | branches of the COND_EXPR. */ | |
1c83ea9f | 2331 | if (instance_save_expr) |
03b256e4 | 2332 | e1 = build (COMPOUND_EXPR, TREE_TYPE (e1), |
1c83ea9f | 2333 | instance_save_expr, e1); |
03b256e4 | 2334 | |
f49422da | 2335 | function = e1; |
8d08fdba MS |
2336 | } |
2337 | return function; | |
2338 | } | |
2339 | ||
2340 | tree | |
5671bf27 | 2341 | build_function_call (tree function, tree params) |
8d08fdba MS |
2342 | { |
2343 | register tree fntype, fndecl; | |
8d08fdba | 2344 | register tree coerced_params; |
1eb8759b | 2345 | tree result; |
8d08fdba MS |
2346 | tree name = NULL_TREE, assembler_name = NULL_TREE; |
2347 | int is_method; | |
2e4cf9dc | 2348 | tree original = function; |
8d08fdba MS |
2349 | |
2350 | /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue. | |
2351 | Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */ | |
2352 | if (TREE_CODE (function) == NOP_EXPR | |
2353 | && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0))) | |
2354 | function = TREE_OPERAND (function, 0); | |
2355 | ||
2356 | if (TREE_CODE (function) == FUNCTION_DECL) | |
2357 | { | |
2358 | name = DECL_NAME (function); | |
2359 | assembler_name = DECL_ASSEMBLER_NAME (function); | |
2360 | ||
72b7eeff | 2361 | mark_used (function); |
8d08fdba MS |
2362 | fndecl = function; |
2363 | ||
2364 | /* Convert anything with function type to a pointer-to-function. */ | |
35680744 | 2365 | if (pedantic && DECL_MAIN_P (function)) |
7e4d7898 | 2366 | pedwarn ("ISO C++ forbids calling `::main' from within program"); |
8d08fdba MS |
2367 | |
2368 | /* Differs from default_conversion by not setting TREE_ADDRESSABLE | |
2369 | (because calling an inline function does not mean the function | |
2370 | needs to be separately compiled). */ | |
2e4cf9dc | 2371 | |
8d08fdba | 2372 | if (DECL_INLINE (function)) |
73aad9b9 | 2373 | function = inline_conversion (function); |
8d08fdba | 2374 | else |
4ac14744 | 2375 | function = build_addr_func (function); |
8d08fdba MS |
2376 | } |
2377 | else | |
2378 | { | |
2379 | fndecl = NULL_TREE; | |
2380 | ||
4ac14744 | 2381 | function = build_addr_func (function); |
8d08fdba MS |
2382 | } |
2383 | ||
4ac14744 MS |
2384 | if (function == error_mark_node) |
2385 | return error_mark_node; | |
2386 | ||
8d08fdba MS |
2387 | fntype = TREE_TYPE (function); |
2388 | ||
2389 | if (TYPE_PTRMEMFUNC_P (fntype)) | |
2390 | { | |
33bd39a2 | 2391 | error ("must use .* or ->* to call pointer-to-member function in `%E (...)'", |
2e4cf9dc | 2392 | original); |
4ac14744 | 2393 | return error_mark_node; |
8d08fdba MS |
2394 | } |
2395 | ||
2396 | is_method = (TREE_CODE (fntype) == POINTER_TYPE | |
2397 | && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE); | |
2398 | ||
2399 | if (!((TREE_CODE (fntype) == POINTER_TYPE | |
2400 | && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE) | |
386b8a85 JM |
2401 | || is_method |
2402 | || TREE_CODE (function) == TEMPLATE_ID_EXPR)) | |
8d08fdba | 2403 | { |
2e4cf9dc | 2404 | error ("`%E' cannot be used as a function", original); |
8d08fdba MS |
2405 | return error_mark_node; |
2406 | } | |
2407 | ||
2408 | /* fntype now gets the type of function pointed to. */ | |
2409 | fntype = TREE_TYPE (fntype); | |
2410 | ||
2411 | /* Convert the parameters to the types declared in the | |
2412 | function prototype, or apply default promotions. */ | |
2413 | ||
125e6594 MM |
2414 | coerced_params = convert_arguments (TYPE_ARG_TYPES (fntype), |
2415 | params, fndecl, LOOKUP_NORMAL); | |
863adfc0 | 2416 | if (coerced_params == error_mark_node) |
125e6594 | 2417 | return error_mark_node; |
863adfc0 | 2418 | |
8d08fdba MS |
2419 | /* Check for errors in format strings. */ |
2420 | ||
80a497e4 JM |
2421 | if (warn_format) |
2422 | check_function_format (NULL, TYPE_ATTRIBUTES (fntype), coerced_params); | |
8d08fdba MS |
2423 | |
2424 | /* Recognize certain built-in functions so we can make tree-codes | |
2425 | other than CALL_EXPR. We do this when it enables fold-const.c | |
2426 | to do something useful. */ | |
2427 | ||
2428 | if (TREE_CODE (function) == ADDR_EXPR | |
2429 | && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL | |
1eb8759b RH |
2430 | && DECL_BUILT_IN (TREE_OPERAND (function, 0))) |
2431 | { | |
2432 | result = expand_tree_builtin (TREE_OPERAND (function, 0), | |
2433 | params, coerced_params); | |
2434 | if (result) | |
2435 | return result; | |
2436 | } | |
8d08fdba | 2437 | |
b2dd096b | 2438 | return build_cxx_call (function, params, coerced_params); |
8d08fdba | 2439 | } |
8d08fdba MS |
2440 | \f |
2441 | /* Convert the actual parameter expressions in the list VALUES | |
2442 | to the types in the list TYPELIST. | |
2443 | If parmdecls is exhausted, or when an element has NULL as its type, | |
2444 | perform the default conversions. | |
2445 | ||
8d08fdba MS |
2446 | NAME is an IDENTIFIER_NODE or 0. It is used only for error messages. |
2447 | ||
2448 | This is also where warnings about wrong number of args are generated. | |
2449 | ||
2450 | Return a list of expressions for the parameters as converted. | |
2451 | ||
2452 | Both VALUES and the returned value are chains of TREE_LIST nodes | |
2453 | with the elements of the list in the TREE_VALUE slots of those nodes. | |
2454 | ||
2455 | In C++, unspecified trailing parameters can be filled in with their | |
2456 | default arguments, if such were specified. Do so here. */ | |
2457 | ||
2458 | tree | |
5671bf27 | 2459 | convert_arguments (tree typelist, tree values, tree fndecl, int flags) |
8d08fdba | 2460 | { |
8d08fdba MS |
2461 | register tree typetail, valtail; |
2462 | register tree result = NULL_TREE; | |
d8e178a0 | 2463 | const char *called_thing = 0; |
8d08fdba MS |
2464 | int i = 0; |
2465 | ||
faf5394a MS |
2466 | /* Argument passing is always copy-initialization. */ |
2467 | flags |= LOOKUP_ONLYCONVERTING; | |
2468 | ||
8d08fdba MS |
2469 | if (fndecl) |
2470 | { | |
2471 | if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE) | |
2472 | { | |
2473 | if (DECL_NAME (fndecl) == NULL_TREE | |
2474 | || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl))) | |
2475 | called_thing = "constructor"; | |
2476 | else | |
2477 | called_thing = "member function"; | |
8d08fdba MS |
2478 | } |
2479 | else | |
a0a33927 | 2480 | called_thing = "function"; |
8d08fdba MS |
2481 | } |
2482 | ||
2483 | for (valtail = values, typetail = typelist; | |
2484 | valtail; | |
2485 | valtail = TREE_CHAIN (valtail), i++) | |
2486 | { | |
2487 | register tree type = typetail ? TREE_VALUE (typetail) : 0; | |
2488 | register tree val = TREE_VALUE (valtail); | |
2489 | ||
8ccc31eb | 2490 | if (val == error_mark_node) |
863adfc0 | 2491 | return error_mark_node; |
8ccc31eb | 2492 | |
8d08fdba MS |
2493 | if (type == void_type_node) |
2494 | { | |
2495 | if (fndecl) | |
bf419747 MM |
2496 | { |
2497 | cp_error_at ("too many arguments to %s `%+#D'", called_thing, | |
2498 | fndecl); | |
2499 | error ("at this point in file"); | |
2500 | } | |
8d08fdba | 2501 | else |
8251199e | 2502 | error ("too many arguments to function"); |
8d08fdba MS |
2503 | /* In case anybody wants to know if this argument |
2504 | list is valid. */ | |
2505 | if (result) | |
2506 | TREE_TYPE (tree_last (result)) = error_mark_node; | |
2507 | break; | |
2508 | } | |
2509 | ||
8d08fdba MS |
2510 | /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue. |
2511 | Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */ | |
2512 | if (TREE_CODE (val) == NOP_EXPR | |
a0a33927 MS |
2513 | && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)) |
2514 | && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)) | |
8d08fdba MS |
2515 | val = TREE_OPERAND (val, 0); |
2516 | ||
00595019 MS |
2517 | if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE) |
2518 | { | |
2519 | if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE | |
8d08fdba | 2520 | || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE |
00595019 | 2521 | || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE) |
0a72704b | 2522 | val = decay_conversion (val); |
00595019 | 2523 | } |
8d08fdba MS |
2524 | |
2525 | if (val == error_mark_node) | |
863adfc0 | 2526 | return error_mark_node; |
8d08fdba | 2527 | |
8d08fdba MS |
2528 | if (type != 0) |
2529 | { | |
2530 | /* Formal parm type is specified by a function prototype. */ | |
2531 | tree parmval; | |
2532 | ||
d0f062fb | 2533 | if (!COMPLETE_TYPE_P (complete_type (type))) |
8d08fdba | 2534 | { |
8251199e | 2535 | error ("parameter type of called function is incomplete"); |
8d08fdba MS |
2536 | parmval = val; |
2537 | } | |
2538 | else | |
2539 | { | |
9a3b49ac | 2540 | parmval = convert_for_initialization |
56ae6d77 | 2541 | (NULL_TREE, type, val, flags, |
9a3b49ac | 2542 | "argument passing", fndecl, i); |
8e51619a | 2543 | parmval = convert_for_arg_passing (type, parmval); |
8d08fdba | 2544 | } |
878cd289 MS |
2545 | |
2546 | if (parmval == error_mark_node) | |
2547 | return error_mark_node; | |
2548 | ||
e1b3e07d | 2549 | result = tree_cons (NULL_TREE, parmval, result); |
8d08fdba MS |
2550 | } |
2551 | else | |
2552 | { | |
2553 | if (TREE_CODE (TREE_TYPE (val)) == REFERENCE_TYPE) | |
2554 | val = convert_from_reference (val); | |
2555 | ||
d1188d91 | 2556 | if (fndecl && DECL_BUILT_IN (fndecl) |
4eaf1d5b AH |
2557 | && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P) |
2558 | /* Don't do ellipsis conversion for __built_in_constant_p | |
2559 | as this will result in spurious warnings for non-POD | |
2560 | types. */ | |
2561 | val = require_complete_type (val); | |
2562 | else | |
2563 | val = convert_arg_to_ellipsis (val); | |
2564 | ||
2565 | result = tree_cons (NULL_TREE, val, result); | |
8d08fdba MS |
2566 | } |
2567 | ||
8d08fdba MS |
2568 | if (typetail) |
2569 | typetail = TREE_CHAIN (typetail); | |
2570 | } | |
2571 | ||
2572 | if (typetail != 0 && typetail != void_list_node) | |
2573 | { | |
2574 | /* See if there are default arguments that can be used */ | |
a723baf1 MM |
2575 | if (TREE_PURPOSE (typetail) |
2576 | && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG) | |
8d08fdba | 2577 | { |
f376e137 | 2578 | for (; typetail != void_list_node; ++i) |
8d08fdba | 2579 | { |
297e73d8 MM |
2580 | tree parmval |
2581 | = convert_default_arg (TREE_VALUE (typetail), | |
2582 | TREE_PURPOSE (typetail), | |
c3f08228 | 2583 | fndecl, i); |
8d08fdba | 2584 | |
878cd289 MS |
2585 | if (parmval == error_mark_node) |
2586 | return error_mark_node; | |
2587 | ||
e1b3e07d | 2588 | result = tree_cons (0, parmval, result); |
8d08fdba MS |
2589 | typetail = TREE_CHAIN (typetail); |
2590 | /* ends with `...'. */ | |
2591 | if (typetail == NULL_TREE) | |
2592 | break; | |
2593 | } | |
2594 | } | |
2595 | else | |
2596 | { | |
2597 | if (fndecl) | |
bf419747 MM |
2598 | { |
2599 | cp_error_at ("too few arguments to %s `%+#D'", | |
2600 | called_thing, fndecl); | |
2601 | error ("at this point in file"); | |
2602 | } | |
8d08fdba | 2603 | else |
8251199e | 2604 | error ("too few arguments to function"); |
8d08fdba MS |
2605 | return error_mark_list; |
2606 | } | |
2607 | } | |
8d08fdba MS |
2608 | |
2609 | return nreverse (result); | |
2610 | } | |
2611 | \f | |
2612 | /* Build a binary-operation expression, after performing default | |
2613 | conversions on the operands. CODE is the kind of expression to build. */ | |
2614 | ||
2615 | tree | |
5671bf27 | 2616 | build_x_binary_op (enum tree_code code, tree arg1, tree arg2) |
8d08fdba | 2617 | { |
d17811fd MM |
2618 | tree orig_arg1; |
2619 | tree orig_arg2; | |
2620 | tree expr; | |
5566b478 | 2621 | |
d17811fd MM |
2622 | orig_arg1 = arg1; |
2623 | orig_arg2 = arg2; | |
d6b4ea85 | 2624 | |
d17811fd | 2625 | if (processing_template_decl) |
14d22dd6 | 2626 | { |
d17811fd MM |
2627 | if (type_dependent_expression_p (arg1) |
2628 | || type_dependent_expression_p (arg2)) | |
2629 | return build_min_nt (code, arg1, arg2); | |
2630 | arg1 = build_non_dependent_expr (arg1); | |
2631 | arg2 = build_non_dependent_expr (arg2); | |
2632 | } | |
14d22dd6 | 2633 | |
d17811fd MM |
2634 | if (code == DOTSTAR_EXPR) |
2635 | expr = build_m_component_ref (arg1, arg2); | |
2636 | else | |
2637 | expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE); | |
14d22dd6 | 2638 | |
d17811fd MM |
2639 | if (processing_template_decl && expr != error_mark_node) |
2640 | return build_min (code, TREE_TYPE (expr), orig_arg1, orig_arg2); | |
14d22dd6 | 2641 | |
d17811fd | 2642 | return expr; |
14d22dd6 MM |
2643 | } |
2644 | ||
8d08fdba MS |
2645 | /* Build a binary-operation expression without default conversions. |
2646 | CODE is the kind of expression to build. | |
2647 | This function differs from `build' in several ways: | |
2648 | the data type of the result is computed and recorded in it, | |
2649 | warnings are generated if arg data types are invalid, | |
2650 | special handling for addition and subtraction of pointers is known, | |
2651 | and some optimization is done (operations on narrow ints | |
2652 | are done in the narrower type when that gives the same result). | |
2653 | Constant folding is also done before the result is returned. | |
2654 | ||
8d08fdba MS |
2655 | Note that the operands will never have enumeral types |
2656 | because either they have just had the default conversions performed | |
2657 | or they have both just been converted to some other type in which | |
2658 | the arithmetic is to be done. | |
2659 | ||
2660 | C++: must do special pointer arithmetic when implementing | |
2661 | multiple inheritance, and deal with pointer to member functions. */ | |
2662 | ||
2663 | tree | |
5671bf27 AJ |
2664 | build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1, |
2665 | int convert_p ATTRIBUTE_UNUSED) | |
8d08fdba | 2666 | { |
39211cd5 MS |
2667 | tree op0, op1; |
2668 | register enum tree_code code0, code1; | |
2669 | tree type0, type1; | |
8d08fdba MS |
2670 | |
2671 | /* Expression code to give to the expression when it is built. | |
2672 | Normally this is CODE, which is what the caller asked for, | |
2673 | but in some special cases we change it. */ | |
2674 | register enum tree_code resultcode = code; | |
2675 | ||
2676 | /* Data type in which the computation is to be performed. | |
2677 | In the simplest cases this is the common type of the arguments. */ | |
2678 | register tree result_type = NULL; | |
2679 | ||
2680 | /* Nonzero means operands have already been type-converted | |
2681 | in whatever way is necessary. | |
2682 | Zero means they need to be converted to RESULT_TYPE. */ | |
2683 | int converted = 0; | |
2684 | ||
28cbf42c MS |
2685 | /* Nonzero means create the expression with this type, rather than |
2686 | RESULT_TYPE. */ | |
2687 | tree build_type = 0; | |
2688 | ||
8d08fdba | 2689 | /* Nonzero means after finally constructing the expression |
faae18ab | 2690 | convert it to this type. */ |
8d08fdba MS |
2691 | tree final_type = 0; |
2692 | ||
2693 | /* Nonzero if this is an operation like MIN or MAX which can | |
2694 | safely be computed in short if both args are promoted shorts. | |
2695 | Also implies COMMON. | |
2696 | -1 indicates a bitwise operation; this makes a difference | |
2697 | in the exact conditions for when it is safe to do the operation | |
2698 | in a narrower mode. */ | |
2699 | int shorten = 0; | |
2700 | ||
2701 | /* Nonzero if this is a comparison operation; | |
2702 | if both args are promoted shorts, compare the original shorts. | |
2703 | Also implies COMMON. */ | |
2704 | int short_compare = 0; | |
2705 | ||
2706 | /* Nonzero if this is a right-shift operation, which can be computed on the | |
2707 | original short and then promoted if the operand is a promoted short. */ | |
2708 | int short_shift = 0; | |
2709 | ||
2710 | /* Nonzero means set RESULT_TYPE to the common type of the args. */ | |
2711 | int common = 0; | |
2712 | ||
39211cd5 | 2713 | /* Apply default conversions. */ |
40260429 NS |
2714 | op0 = orig_op0; |
2715 | op1 = orig_op1; | |
2716 | ||
a9aedbc2 MS |
2717 | if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR |
2718 | || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR | |
2719 | || code == TRUTH_XOR_EXPR) | |
2720 | { | |
40260429 NS |
2721 | if (!really_overloaded_fn (op0)) |
2722 | op0 = decay_conversion (op0); | |
2723 | if (!really_overloaded_fn (op1)) | |
2724 | op1 = decay_conversion (op1); | |
a9aedbc2 MS |
2725 | } |
2726 | else | |
2727 | { | |
40260429 NS |
2728 | if (!really_overloaded_fn (op0)) |
2729 | op0 = default_conversion (op0); | |
2730 | if (!really_overloaded_fn (op1)) | |
2731 | op1 = default_conversion (op1); | |
a9aedbc2 | 2732 | } |
39211cd5 | 2733 | |
a359be75 JM |
2734 | /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */ |
2735 | STRIP_TYPE_NOPS (op0); | |
2736 | STRIP_TYPE_NOPS (op1); | |
2737 | ||
2738 | /* DTRT if one side is an overloaded function, but complain about it. */ | |
2739 | if (type_unknown_p (op0)) | |
2740 | { | |
c2ea3a40 | 2741 | tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none); |
a359be75 JM |
2742 | if (t != error_mark_node) |
2743 | { | |
33bd39a2 | 2744 | pedwarn ("assuming cast to type `%T' from overloaded function", |
a359be75 JM |
2745 | TREE_TYPE (t)); |
2746 | op0 = t; | |
2747 | } | |
2748 | } | |
2749 | if (type_unknown_p (op1)) | |
2750 | { | |
c2ea3a40 | 2751 | tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none); |
a359be75 JM |
2752 | if (t != error_mark_node) |
2753 | { | |
33bd39a2 | 2754 | pedwarn ("assuming cast to type `%T' from overloaded function", |
a359be75 JM |
2755 | TREE_TYPE (t)); |
2756 | op1 = t; | |
2757 | } | |
2758 | } | |
2759 | ||
39211cd5 MS |
2760 | type0 = TREE_TYPE (op0); |
2761 | type1 = TREE_TYPE (op1); | |
2762 | ||
2763 | /* The expression codes of the data types of the arguments tell us | |
2764 | whether the arguments are integers, floating, pointers, etc. */ | |
2765 | code0 = TREE_CODE (type0); | |
2766 | code1 = TREE_CODE (type1); | |
2767 | ||
8d08fdba MS |
2768 | /* If an error was already reported for one of the arguments, |
2769 | avoid reporting another error. */ | |
2770 | ||
2771 | if (code0 == ERROR_MARK || code1 == ERROR_MARK) | |
2772 | return error_mark_node; | |
2773 | ||
2774 | switch (code) | |
2775 | { | |
2776 | case PLUS_EXPR: | |
2777 | /* Handle the pointer + int case. */ | |
2778 | if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE) | |
7552da58 | 2779 | return cp_pointer_int_sum (PLUS_EXPR, op0, op1); |
8d08fdba | 2780 | else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE) |
7552da58 | 2781 | return cp_pointer_int_sum (PLUS_EXPR, op1, op0); |
8d08fdba MS |
2782 | else |
2783 | common = 1; | |
2784 | break; | |
2785 | ||
2786 | case MINUS_EXPR: | |
2787 | /* Subtraction of two similar pointers. | |
2788 | We must subtract them as integers, then divide by object size. */ | |
2789 | if (code0 == POINTER_TYPE && code1 == POINTER_TYPE | |
a5ac359a MM |
2790 | && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0), |
2791 | TREE_TYPE (type1))) | |
79a7c7fa | 2792 | return pointer_diff (op0, op1, common_type (type0, type1)); |
8d08fdba MS |
2793 | /* Handle pointer minus int. Just like pointer plus int. */ |
2794 | else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE) | |
7552da58 | 2795 | return cp_pointer_int_sum (MINUS_EXPR, op0, op1); |
8d08fdba MS |
2796 | else |
2797 | common = 1; | |
2798 | break; | |
2799 | ||
2800 | case MULT_EXPR: | |
2801 | common = 1; | |
2802 | break; | |
2803 | ||
2804 | case TRUNC_DIV_EXPR: | |
2805 | case CEIL_DIV_EXPR: | |
2806 | case FLOOR_DIV_EXPR: | |
2807 | case ROUND_DIV_EXPR: | |
2808 | case EXACT_DIV_EXPR: | |
37c46b43 MS |
2809 | if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE |
2810 | || code0 == COMPLEX_TYPE) | |
2811 | && (code1 == INTEGER_TYPE || code1 == REAL_TYPE | |
2812 | || code1 == COMPLEX_TYPE)) | |
8d08fdba | 2813 | { |
a0a33927 | 2814 | if (TREE_CODE (op1) == INTEGER_CST && integer_zerop (op1)) |
33bd39a2 | 2815 | warning ("division by zero in `%E / 0'", op0); |
a0a33927 | 2816 | else if (TREE_CODE (op1) == REAL_CST && real_zerop (op1)) |
33bd39a2 | 2817 | warning ("division by zero in `%E / 0.'", op0); |
a0a33927 | 2818 | |
8d08fdba MS |
2819 | if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)) |
2820 | resultcode = RDIV_EXPR; | |
2821 | else | |
2822 | /* When dividing two signed integers, we have to promote to int. | |
ddd5a7c1 | 2823 | unless we divide by a constant != -1. Note that default |
8d08fdba MS |
2824 | conversion will have been performed on the operands at this |
2825 | point, so we have to dig out the original type to find out if | |
2826 | it was unsigned. */ | |
2827 | shorten = ((TREE_CODE (op0) == NOP_EXPR | |
2828 | && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0)))) | |
2829 | || (TREE_CODE (op1) == INTEGER_CST | |
05bccae2 RK |
2830 | && ! integer_all_onesp (op1))); |
2831 | ||
8d08fdba MS |
2832 | common = 1; |
2833 | } | |
2834 | break; | |
2835 | ||
2836 | case BIT_AND_EXPR: | |
8d08fdba MS |
2837 | case BIT_IOR_EXPR: |
2838 | case BIT_XOR_EXPR: | |
2839 | if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE) | |
2840 | shorten = -1; | |
8d08fdba MS |
2841 | break; |
2842 | ||
2843 | case TRUNC_MOD_EXPR: | |
2844 | case FLOOR_MOD_EXPR: | |
a0a33927 | 2845 | if (code1 == INTEGER_TYPE && integer_zerop (op1)) |
33bd39a2 | 2846 | warning ("division by zero in `%E %% 0'", op0); |
a0a33927 | 2847 | else if (code1 == REAL_TYPE && real_zerop (op1)) |
33bd39a2 | 2848 | warning ("division by zero in `%E %% 0.'", op0); |
a0a33927 | 2849 | |
8d08fdba MS |
2850 | if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE) |
2851 | { | |
2852 | /* Although it would be tempting to shorten always here, that loses | |
2853 | on some targets, since the modulo instruction is undefined if the | |
2854 | quotient can't be represented in the computation mode. We shorten | |
2855 | only if unsigned or if dividing by something we know != -1. */ | |
2856 | shorten = ((TREE_CODE (op0) == NOP_EXPR | |
2857 | && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0)))) | |
2858 | || (TREE_CODE (op1) == INTEGER_CST | |
05bccae2 | 2859 | && ! integer_all_onesp (op1))); |
8d08fdba MS |
2860 | common = 1; |
2861 | } | |
2862 | break; | |
2863 | ||
2864 | case TRUTH_ANDIF_EXPR: | |
2865 | case TRUTH_ORIF_EXPR: | |
2866 | case TRUTH_AND_EXPR: | |
2867 | case TRUTH_OR_EXPR: | |
255512c1 | 2868 | result_type = boolean_type_node; |
8d08fdba MS |
2869 | break; |
2870 | ||
2871 | /* Shift operations: result has same type as first operand; | |
2872 | always convert second operand to int. | |
2873 | Also set SHORT_SHIFT if shifting rightward. */ | |
2874 | ||
2875 | case RSHIFT_EXPR: | |
2876 | if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE) | |
2877 | { | |
2878 | result_type = type0; | |
2879 | if (TREE_CODE (op1) == INTEGER_CST) | |
2880 | { | |
2881 | if (tree_int_cst_lt (op1, integer_zero_node)) | |
8251199e | 2882 | warning ("right shift count is negative"); |
8d08fdba MS |
2883 | else |
2884 | { | |
665f2503 | 2885 | if (! integer_zerop (op1)) |
8d08fdba | 2886 | short_shift = 1; |
665f2503 | 2887 | if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0) |
8251199e | 2888 | warning ("right shift count >= width of type"); |
8d08fdba MS |
2889 | } |
2890 | } | |
2891 | /* Convert the shift-count to an integer, regardless of | |
2892 | size of value being shifted. */ | |
2893 | if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node) | |
37c46b43 | 2894 | op1 = cp_convert (integer_type_node, op1); |
8d08fdba MS |
2895 | /* Avoid converting op1 to result_type later. */ |
2896 | converted = 1; | |
2897 | } | |
2898 | break; | |
2899 | ||
2900 | case LSHIFT_EXPR: | |
2901 | if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE) | |
2902 | { | |
2903 | result_type = type0; | |
2904 | if (TREE_CODE (op1) == INTEGER_CST) | |
2905 | { | |
2906 | if (tree_int_cst_lt (op1, integer_zero_node)) | |
8251199e | 2907 | warning ("left shift count is negative"); |
665f2503 | 2908 | else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0) |
8251199e | 2909 | warning ("left shift count >= width of type"); |
8d08fdba MS |
2910 | } |
2911 | /* Convert the shift-count to an integer, regardless of | |
2912 | size of value being shifted. */ | |
2913 | if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node) | |
37c46b43 | 2914 | op1 = cp_convert (integer_type_node, op1); |
8d08fdba MS |
2915 | /* Avoid converting op1 to result_type later. */ |
2916 | converted = 1; | |
2917 | } | |
2918 | break; | |
2919 | ||
2920 | case RROTATE_EXPR: | |
2921 | case LROTATE_EXPR: | |
2922 | if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE) | |
2923 | { | |
2924 | result_type = type0; | |
2925 | if (TREE_CODE (op1) == INTEGER_CST) | |
2926 | { | |
2927 | if (tree_int_cst_lt (op1, integer_zero_node)) | |
8251199e | 2928 | warning ("%s rotate count is negative", |
8d08fdba | 2929 | (code == LROTATE_EXPR) ? "left" : "right"); |
665f2503 | 2930 | else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0) |
8251199e | 2931 | warning ("%s rotate count >= width of type", |
8d08fdba MS |
2932 | (code == LROTATE_EXPR) ? "left" : "right"); |
2933 | } | |
2934 | /* Convert the shift-count to an integer, regardless of | |
2935 | size of value being shifted. */ | |
2936 | if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node) | |
37c46b43 | 2937 | op1 = cp_convert (integer_type_node, op1); |
8d08fdba MS |
2938 | } |
2939 | break; | |
2940 | ||
2941 | case EQ_EXPR: | |
2942 | case NE_EXPR: | |
1bdba2c0 DZ |
2943 | if (warn_float_equal && (code0 == REAL_TYPE || code1 == REAL_TYPE)) |
2944 | warning ("comparing floating point with == or != is unsafe"); | |
2945 | ||
28cbf42c | 2946 | build_type = boolean_type_node; |
37c46b43 MS |
2947 | if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE |
2948 | || code0 == COMPLEX_TYPE) | |
2949 | && (code1 == INTEGER_TYPE || code1 == REAL_TYPE | |
2950 | || code1 == COMPLEX_TYPE)) | |
8d08fdba | 2951 | short_compare = 1; |
a5ac359a MM |
2952 | else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE) |
2953 | || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1))) | |
708cae97 JM |
2954 | result_type = composite_pointer_type (type0, type1, op0, op1, |
2955 | "comparison"); | |
a5ac359a MM |
2956 | else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0)) |
2957 | && null_ptr_cst_p (op1)) | |
faae18ab | 2958 | result_type = type0; |
a5ac359a MM |
2959 | else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1)) |
2960 | && null_ptr_cst_p (op0)) | |
faae18ab | 2961 | result_type = type1; |
8d08fdba MS |
2962 | else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE) |
2963 | { | |
faae18ab | 2964 | result_type = type0; |
7e4d7898 | 2965 | error ("ISO C++ forbids comparison between pointer and integer"); |
8d08fdba MS |
2966 | } |
2967 | else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE) | |
2968 | { | |
faae18ab | 2969 | result_type = type1; |
7e4d7898 | 2970 | error ("ISO C++ forbids comparison between pointer and integer"); |
8d08fdba | 2971 | } |
a7a64a77 | 2972 | else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1)) |
8d08fdba | 2973 | { |
50ad9642 | 2974 | op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier); |
1f84ec23 | 2975 | op1 = cp_convert (TREE_TYPE (op0), integer_zero_node); |
faae18ab | 2976 | result_type = TREE_TYPE (op0); |
8d08fdba | 2977 | } |
a7a64a77 | 2978 | else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0)) |
ab76ca54 | 2979 | return cp_build_binary_op (code, op1, op0); |
8d08fdba | 2980 | else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1) |
a359be75 | 2981 | && same_type_p (type0, type1)) |
8d08fdba | 2982 | { |
c7e266a6 MM |
2983 | /* E will be the final comparison. */ |
2984 | tree e; | |
2985 | /* E1 and E2 are for scratch. */ | |
2986 | tree e1; | |
2987 | tree e2; | |
1f84ec23 MM |
2988 | tree pfn0; |
2989 | tree pfn1; | |
2990 | tree delta0; | |
2991 | tree delta1; | |
c7e266a6 | 2992 | |
ebb1abc3 JM |
2993 | if (TREE_SIDE_EFFECTS (op0)) |
2994 | op0 = save_expr (op0); | |
2995 | if (TREE_SIDE_EFFECTS (op1)) | |
2996 | op1 = save_expr (op1); | |
2997 | ||
1f84ec23 MM |
2998 | /* We generate: |
2999 | ||
3000 | (op0.pfn == op1.pfn | |
3001 | && (!op0.pfn || op0.delta == op1.delta)) | |
3002 | ||
3003 | The reason for the `!op0.pfn' bit is that a NULL | |
3004 | pointer-to-member is any member with a zero PFN; the | |
3005 | DELTA field is unspecified. */ | |
3006 | pfn0 = pfn_from_ptrmemfunc (op0); | |
3007 | pfn1 = pfn_from_ptrmemfunc (op1); | |
50ad9642 MM |
3008 | delta0 = build_ptrmemfunc_access_expr (op0, |
3009 | delta_identifier); | |
3010 | delta1 = build_ptrmemfunc_access_expr (op1, | |
3011 | delta_identifier); | |
1f84ec23 MM |
3012 | e1 = cp_build_binary_op (EQ_EXPR, delta0, delta1); |
3013 | e2 = cp_build_binary_op (EQ_EXPR, | |
3014 | pfn0, | |
3015 | cp_convert (TREE_TYPE (pfn0), | |
3016 | integer_zero_node)); | |
3017 | e1 = cp_build_binary_op (TRUTH_ORIF_EXPR, e1, e2); | |
3018 | e2 = build (EQ_EXPR, boolean_type_node, pfn0, pfn1); | |
3019 | e = cp_build_binary_op (TRUTH_ANDIF_EXPR, e2, e1); | |
8d08fdba | 3020 | if (code == EQ_EXPR) |
c7e266a6 | 3021 | return e; |
ab76ca54 | 3022 | return cp_build_binary_op (EQ_EXPR, e, integer_zero_node); |
8d08fdba | 3023 | } |
c7e266a6 MM |
3024 | else if ((TYPE_PTRMEMFUNC_P (type0) |
3025 | && same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0), type1)) | |
3026 | || (TYPE_PTRMEMFUNC_P (type1) | |
3027 | && same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1), type0))) | |
a98facb0 | 3028 | abort (); |
8d08fdba MS |
3029 | break; |
3030 | ||
3031 | case MAX_EXPR: | |
3032 | case MIN_EXPR: | |
3033 | if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE) | |
3034 | && (code1 == INTEGER_TYPE || code1 == REAL_TYPE)) | |
3035 | shorten = 1; | |
3036 | else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE) | |
708cae97 JM |
3037 | result_type = composite_pointer_type (type0, type1, op0, op1, |
3038 | "comparison"); | |
8d08fdba MS |
3039 | break; |
3040 | ||
3041 | case LE_EXPR: | |
3042 | case GE_EXPR: | |
3043 | case LT_EXPR: | |
3044 | case GT_EXPR: | |
28cbf42c | 3045 | build_type = boolean_type_node; |
8d08fdba MS |
3046 | if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE) |
3047 | && (code1 == INTEGER_TYPE || code1 == REAL_TYPE)) | |
3048 | short_compare = 1; | |
3049 | else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE) | |
708cae97 JM |
3050 | result_type = composite_pointer_type (type0, type1, op0, op1, |
3051 | "comparison"); | |
8d08fdba MS |
3052 | else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST |
3053 | && integer_zerop (op1)) | |
faae18ab | 3054 | result_type = type0; |
8d08fdba MS |
3055 | else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST |
3056 | && integer_zerop (op0)) | |
faae18ab | 3057 | result_type = type1; |
8d08fdba MS |
3058 | else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE) |
3059 | { | |
faae18ab | 3060 | result_type = type0; |
7e4d7898 | 3061 | pedwarn ("ISO C++ forbids comparison between pointer and integer"); |
8d08fdba MS |
3062 | } |
3063 | else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE) | |
3064 | { | |
faae18ab | 3065 | result_type = type1; |
7e4d7898 | 3066 | pedwarn ("ISO C++ forbids comparison between pointer and integer"); |
8d08fdba | 3067 | } |
8d08fdba | 3068 | break; |
7f85441b | 3069 | |
1eb8759b RH |
3070 | case UNORDERED_EXPR: |
3071 | case ORDERED_EXPR: | |
3072 | case UNLT_EXPR: | |
3073 | case UNLE_EXPR: | |
3074 | case UNGT_EXPR: | |
3075 | case UNGE_EXPR: | |
3076 | case UNEQ_EXPR: | |
1eb8759b RH |
3077 | build_type = integer_type_node; |
3078 | if (code0 != REAL_TYPE || code1 != REAL_TYPE) | |
3079 | { | |
3080 | error ("unordered comparison on non-floating point argument"); | |
3081 | return error_mark_node; | |
3082 | } | |
3083 | common = 1; | |
3084 | break; | |
3085 | ||
7f85441b KG |
3086 | default: |
3087 | break; | |
8d08fdba MS |
3088 | } |
3089 | ||
37c46b43 MS |
3090 | if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE) |
3091 | && | |
3092 | (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE)) | |
8d08fdba | 3093 | { |
37c46b43 MS |
3094 | int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE); |
3095 | ||
8d08fdba MS |
3096 | if (shorten || common || short_compare) |
3097 | result_type = common_type (type0, type1); | |
3098 | ||
3099 | /* For certain operations (which identify themselves by shorten != 0) | |
3100 | if both args were extended from the same smaller type, | |
3101 | do the arithmetic in that type and then extend. | |
3102 | ||
3103 | shorten !=0 and !=1 indicates a bitwise operation. | |
3104 | For them, this optimization is safe only if | |
3105 | both args are zero-extended or both are sign-extended. | |
3106 | Otherwise, we might change the result. | |
3107 | Eg, (short)-1 | (unsigned short)-1 is (int)-1 | |
3108 | but calculated in (unsigned short) it would be (unsigned short)-1. */ | |
3109 | ||
37c46b43 | 3110 | if (shorten && none_complex) |
8d08fdba MS |
3111 | { |
3112 | int unsigned0, unsigned1; | |
3113 | tree arg0 = get_narrower (op0, &unsigned0); | |
3114 | tree arg1 = get_narrower (op1, &unsigned1); | |
3115 | /* UNS is 1 if the operation to be done is an unsigned one. */ | |
3116 | int uns = TREE_UNSIGNED (result_type); | |
3117 | tree type; | |
3118 | ||
3119 | final_type = result_type; | |
3120 | ||
3121 | /* Handle the case that OP0 does not *contain* a conversion | |
3122 | but it *requires* conversion to FINAL_TYPE. */ | |
3123 | ||
3124 | if (op0 == arg0 && TREE_TYPE (op0) != final_type) | |
3125 | unsigned0 = TREE_UNSIGNED (TREE_TYPE (op0)); | |
3126 | if (op1 == arg1 && TREE_TYPE (op1) != final_type) | |
3127 | unsigned1 = TREE_UNSIGNED (TREE_TYPE (op1)); | |
3128 | ||
3129 | /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */ | |
3130 | ||
3131 | /* For bitwise operations, signedness of nominal type | |
3132 | does not matter. Consider only how operands were extended. */ | |
3133 | if (shorten == -1) | |
3134 | uns = unsigned0; | |
3135 | ||
3136 | /* Note that in all three cases below we refrain from optimizing | |
3137 | an unsigned operation on sign-extended args. | |
3138 | That would not be valid. */ | |
3139 | ||
3140 | /* Both args variable: if both extended in same way | |
3141 | from same width, do it in that width. | |
3142 | Do it unsigned if args were zero-extended. */ | |
3143 | if ((TYPE_PRECISION (TREE_TYPE (arg0)) | |
3144 | < TYPE_PRECISION (result_type)) | |
3145 | && (TYPE_PRECISION (TREE_TYPE (arg1)) | |
3146 | == TYPE_PRECISION (TREE_TYPE (arg0))) | |
3147 | && unsigned0 == unsigned1 | |
3148 | && (unsigned0 || !uns)) | |
ceef8ce4 NB |
3149 | result_type = c_common_signed_or_unsigned_type |
3150 | (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1))); | |
8d08fdba MS |
3151 | else if (TREE_CODE (arg0) == INTEGER_CST |
3152 | && (unsigned1 || !uns) | |
3153 | && (TYPE_PRECISION (TREE_TYPE (arg1)) | |
3154 | < TYPE_PRECISION (result_type)) | |
ceef8ce4 NB |
3155 | && (type = c_common_signed_or_unsigned_type |
3156 | (unsigned1, TREE_TYPE (arg1)), | |
8d08fdba MS |
3157 | int_fits_type_p (arg0, type))) |
3158 | result_type = type; | |
3159 | else if (TREE_CODE (arg1) == INTEGER_CST | |
3160 | && (unsigned0 || !uns) | |
3161 | && (TYPE_PRECISION (TREE_TYPE (arg0)) | |
3162 | < TYPE_PRECISION (result_type)) | |
ceef8ce4 NB |
3163 | && (type = c_common_signed_or_unsigned_type |
3164 | (unsigned0, TREE_TYPE (arg0)), | |
8d08fdba MS |
3165 | int_fits_type_p (arg1, type))) |
3166 | result_type = type; | |
3167 | } | |
3168 | ||
3169 | /* Shifts can be shortened if shifting right. */ | |
3170 | ||
3171 | if (short_shift) | |
3172 | { | |
3173 | int unsigned_arg; | |
3174 | tree arg0 = get_narrower (op0, &unsigned_arg); | |
3175 | ||
3176 | final_type = result_type; | |
3177 | ||
3178 | if (arg0 == op0 && final_type == TREE_TYPE (op0)) | |
3179 | unsigned_arg = TREE_UNSIGNED (TREE_TYPE (op0)); | |
3180 | ||
3181 | if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type) | |
db5ae43f MS |
3182 | /* We can shorten only if the shift count is less than the |
3183 | number of bits in the smaller type size. */ | |
665f2503 | 3184 | && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0 |
8d08fdba MS |
3185 | /* If arg is sign-extended and then unsigned-shifted, |
3186 | we can simulate this with a signed shift in arg's type | |
3187 | only if the extended result is at least twice as wide | |
3188 | as the arg. Otherwise, the shift could use up all the | |
3189 | ones made by sign-extension and bring in zeros. | |
3190 | We can't optimize that case at all, but in most machines | |
3191 | it never happens because available widths are 2**N. */ | |
3192 | && (!TREE_UNSIGNED (final_type) | |
3193 | || unsigned_arg | |
5566b478 | 3194 | || (((unsigned) 2 * TYPE_PRECISION (TREE_TYPE (arg0))) |
8d08fdba MS |
3195 | <= TYPE_PRECISION (result_type)))) |
3196 | { | |
3197 | /* Do an unsigned shift if the operand was zero-extended. */ | |
3198 | result_type | |
ceef8ce4 NB |
3199 | = c_common_signed_or_unsigned_type (unsigned_arg, |
3200 | TREE_TYPE (arg0)); | |
8d08fdba MS |
3201 | /* Convert value-to-be-shifted to that type. */ |
3202 | if (TREE_TYPE (op0) != result_type) | |
37c46b43 | 3203 | op0 = cp_convert (result_type, op0); |
8d08fdba MS |
3204 | converted = 1; |
3205 | } | |
3206 | } | |
3207 | ||
3208 | /* Comparison operations are shortened too but differently. | |
3209 | They identify themselves by setting short_compare = 1. */ | |
3210 | ||
3211 | if (short_compare) | |
3212 | { | |
3213 | /* Don't write &op0, etc., because that would prevent op0 | |
3214 | from being kept in a register. | |
3215 | Instead, make copies of the our local variables and | |
3216 | pass the copies by reference, then copy them back afterward. */ | |
3217 | tree xop0 = op0, xop1 = op1, xresult_type = result_type; | |
3218 | enum tree_code xresultcode = resultcode; | |
3219 | tree val | |
3220 | = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode); | |
3221 | if (val != 0) | |
37c46b43 | 3222 | return cp_convert (boolean_type_node, val); |
28cbf42c MS |
3223 | op0 = xop0, op1 = xop1; |
3224 | converted = 1; | |
8d08fdba MS |
3225 | resultcode = xresultcode; |
3226 | } | |
3227 | ||
8d3b081e | 3228 | if ((short_compare || code == MIN_EXPR || code == MAX_EXPR) |
7d48af30 MM |
3229 | && warn_sign_compare |
3230 | /* Do not warn until the template is instantiated; we cannot | |
3231 | bound the ranges of the arguments until that point. */ | |
3232 | && !processing_template_decl) | |
8d08fdba | 3233 | { |
e3417fcd MS |
3234 | int op0_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op0)); |
3235 | int op1_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op1)); | |
3236 | ||
8d08fdba MS |
3237 | int unsignedp0, unsignedp1; |
3238 | tree primop0 = get_narrower (op0, &unsignedp0); | |
3239 | tree primop1 = get_narrower (op1, &unsignedp1); | |
3240 | ||
e92cc029 | 3241 | /* Check for comparison of different enum types. */ |
84663f74 | 3242 | if (TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE |
72b7eeff MS |
3243 | && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE |
3244 | && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0)) | |
3245 | != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1))) | |
3246 | { | |
33bd39a2 | 3247 | warning ("comparison between types `%#T' and `%#T'", |
72b7eeff MS |
3248 | TREE_TYPE (orig_op0), TREE_TYPE (orig_op1)); |
3249 | } | |
3250 | ||
e3417fcd | 3251 | /* Give warnings for comparisons between signed and unsigned |
faae18ab | 3252 | quantities that may fail. */ |
e3417fcd MS |
3253 | /* Do the checking based on the original operand trees, so that |
3254 | casts will be considered, but default promotions won't be. */ | |
faae18ab MS |
3255 | |
3256 | /* Do not warn if the comparison is being done in a signed type, | |
3257 | since the signed type will only be chosen if it can represent | |
3258 | all the values of the unsigned type. */ | |
3259 | if (! TREE_UNSIGNED (result_type)) | |
3260 | /* OK */; | |
b19b4a78 MS |
3261 | /* Do not warn if both operands are unsigned. */ |
3262 | else if (op0_signed == op1_signed) | |
3263 | /* OK */; | |
faae18ab MS |
3264 | /* Do not warn if the signed quantity is an unsuffixed |
3265 | integer literal (or some static constant expression | |
3facde26 | 3266 | involving such literals or a conditional expression |
faae18ab | 3267 | involving such literals) and it is non-negative. */ |
3facde26 KG |
3268 | else if ((op0_signed && tree_expr_nonnegative_p (orig_op0)) |
3269 | || (op1_signed && tree_expr_nonnegative_p (orig_op1))) | |
faae18ab MS |
3270 | /* OK */; |
3271 | /* Do not warn if the comparison is an equality operation, | |
3272 | the unsigned quantity is an integral constant and it does | |
3273 | not use the most significant bit of result_type. */ | |
3274 | else if ((resultcode == EQ_EXPR || resultcode == NE_EXPR) | |
3275 | && ((op0_signed && TREE_CODE (orig_op1) == INTEGER_CST | |
ceef8ce4 NB |
3276 | && int_fits_type_p (orig_op1, c_common_signed_type |
3277 | (result_type))) | |
faae18ab | 3278 | || (op1_signed && TREE_CODE (orig_op0) == INTEGER_CST |
ceef8ce4 NB |
3279 | && int_fits_type_p (orig_op0, c_common_signed_type |
3280 | (result_type))))) | |
faae18ab MS |
3281 | /* OK */; |
3282 | else | |
f49fad00 | 3283 | warning ("comparison between signed and unsigned integer expressions"); |
8d08fdba MS |
3284 | |
3285 | /* Warn if two unsigned values are being compared in a size | |
3286 | larger than their original size, and one (and only one) is the | |
3287 | result of a `~' operator. This comparison will always fail. | |
3288 | ||
3289 | Also warn if one operand is a constant, and the constant does not | |
3290 | have all bits set that are set in the ~ operand when it is | |
3291 | extended. */ | |
3292 | ||
5566b478 MS |
3293 | if ((TREE_CODE (primop0) == BIT_NOT_EXPR) |
3294 | ^ (TREE_CODE (primop1) == BIT_NOT_EXPR)) | |
8d08fdba MS |
3295 | { |
3296 | if (TREE_CODE (primop0) == BIT_NOT_EXPR) | |
3297 | primop0 = get_narrower (TREE_OPERAND (op0, 0), &unsignedp0); | |
3298 | if (TREE_CODE (primop1) == BIT_NOT_EXPR) | |
3299 | primop1 = get_narrower (TREE_OPERAND (op1, 0), &unsignedp1); | |
3300 | ||
665f2503 | 3301 | if (host_integerp (primop0, 0) || host_integerp (primop1, 0)) |
8d08fdba MS |
3302 | { |
3303 | tree primop; | |
3304 | HOST_WIDE_INT constant, mask; | |
3305 | int unsignedp; | |
665f2503 | 3306 | unsigned int bits; |
8d08fdba | 3307 | |
665f2503 | 3308 | if (host_integerp (primop0, 0)) |
8d08fdba MS |
3309 | { |
3310 | primop = primop1; | |
3311 | unsignedp = unsignedp1; | |
665f2503 | 3312 | constant = tree_low_cst (primop0, 0); |
8d08fdba MS |
3313 | } |
3314 | else | |
3315 | { | |
3316 | primop = primop0; | |
3317 | unsignedp = unsignedp0; | |
665f2503 | 3318 | constant = tree_low_cst (primop1, 0); |
8d08fdba MS |
3319 | } |
3320 | ||
3321 | bits = TYPE_PRECISION (TREE_TYPE (primop)); | |
faae18ab | 3322 | if (bits < TYPE_PRECISION (result_type) |
8d08fdba MS |
3323 | && bits < HOST_BITS_PER_LONG && unsignedp) |
3324 | { | |
3325 | mask = (~ (HOST_WIDE_INT) 0) << bits; | |
3326 | if ((mask & constant) != mask) | |
8251199e | 3327 | warning ("comparison of promoted ~unsigned with constant"); |
8d08fdba MS |
3328 | } |
3329 | } | |
3330 | else if (unsignedp0 && unsignedp1 | |
3331 | && (TYPE_PRECISION (TREE_TYPE (primop0)) | |
faae18ab | 3332 | < TYPE_PRECISION (result_type)) |
8d08fdba | 3333 | && (TYPE_PRECISION (TREE_TYPE (primop1)) |
faae18ab | 3334 | < TYPE_PRECISION (result_type))) |
8251199e | 3335 | warning ("comparison of promoted ~unsigned with unsigned"); |
8d08fdba MS |
3336 | } |
3337 | } | |
3338 | } | |
3339 | ||
3340 | /* At this point, RESULT_TYPE must be nonzero to avoid an error message. | |
3341 | If CONVERTED is zero, both args will be converted to type RESULT_TYPE. | |
3342 | Then the expression will be built. | |
3343 | It will be given type FINAL_TYPE if that is nonzero; | |
3344 | otherwise, it will be given type RESULT_TYPE. */ | |
3345 | ||
3346 | if (!result_type) | |
3347 | { | |
33bd39a2 | 3348 | error ("invalid operands of types `%T' and `%T' to binary `%O'", |
c7e266a6 | 3349 | TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code); |
8d08fdba MS |
3350 | return error_mark_node; |
3351 | } | |
3352 | ||
0e339752 | 3353 | /* Issue warnings about peculiar, but valid, uses of NULL. */ |
03d0f4af MM |
3354 | if (/* It's reasonable to use pointer values as operands of && |
3355 | and ||, so NULL is no exception. */ | |
3356 | !(code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR) | |
3357 | && (/* If OP0 is NULL and OP1 is not a pointer, or vice versa. */ | |
3358 | (orig_op0 == null_node | |
3359 | && TREE_CODE (TREE_TYPE (op1)) != POINTER_TYPE) | |
3360 | /* Or vice versa. */ | |
3361 | || (orig_op1 == null_node | |
3362 | && TREE_CODE (TREE_TYPE (op0)) != POINTER_TYPE) | |
3363 | /* Or, both are NULL and the operation was not a comparison. */ | |
3364 | || (orig_op0 == null_node && orig_op1 == null_node | |
3365 | && code != EQ_EXPR && code != NE_EXPR))) | |
e0f9a8bc MM |
3366 | /* Some sort of arithmetic operation involving NULL was |
3367 | performed. Note that pointer-difference and pointer-addition | |
3368 | have already been handled above, and so we don't end up here in | |
3369 | that case. */ | |
33bd39a2 | 3370 | warning ("NULL used in arithmetic"); |
e0f9a8bc | 3371 | |
8d08fdba MS |
3372 | if (! converted) |
3373 | { | |
3374 | if (TREE_TYPE (op0) != result_type) | |
37c46b43 | 3375 | op0 = cp_convert (result_type, op0); |
8d08fdba | 3376 | if (TREE_TYPE (op1) != result_type) |
37c46b43 | 3377 | op1 = cp_convert (result_type, op1); |
848b92e1 JM |
3378 | |
3379 | if (op0 == error_mark_node || op1 == error_mark_node) | |
3380 | return error_mark_node; | |
8d08fdba MS |
3381 | } |
3382 | ||
28cbf42c MS |
3383 | if (build_type == NULL_TREE) |
3384 | build_type = result_type; | |
3385 | ||
8d08fdba | 3386 | { |
28cbf42c | 3387 | register tree result = build (resultcode, build_type, op0, op1); |
8d08fdba MS |
3388 | register tree folded; |
3389 | ||
3390 | folded = fold (result); | |
3391 | if (folded == result) | |
3392 | TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1); | |
3393 | if (final_type != 0) | |
37c46b43 | 3394 | return cp_convert (final_type, folded); |
8d08fdba MS |
3395 | return folded; |
3396 | } | |
3397 | } | |
3398 | \f | |
3399 | /* Return a tree for the sum or difference (RESULTCODE says which) | |
3400 | of pointer PTROP and integer INTOP. */ | |
3401 | ||
3402 | static tree | |
5671bf27 AJ |
3403 | cp_pointer_int_sum (enum tree_code resultcode, register tree ptrop, |
3404 | register tree intop) | |
8d08fdba | 3405 | { |
bfba94bd MM |
3406 | tree res_type = TREE_TYPE (ptrop); |
3407 | ||
3408 | /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type) | |
3409 | in certain circumstance (when it's valid to do so). So we need | |
3410 | to make sure it's complete. We don't need to check here, if we | |
3411 | can actually complete it at all, as those checks will be done in | |
3412 | pointer_int_sum() anyway. */ | |
3413 | complete_type (TREE_TYPE (res_type)); | |
8f259df3 | 3414 | |
7552da58 | 3415 | return pointer_int_sum (resultcode, ptrop, fold (intop)); |
8d08fdba MS |
3416 | } |
3417 | ||
3418 | /* Return a tree for the difference of pointers OP0 and OP1. | |
3419 | The resulting tree has type int. */ | |
3420 | ||
3421 | static tree | |
5671bf27 | 3422 | pointer_diff (register tree op0, register tree op1, register tree ptrtype) |
8d08fdba MS |
3423 | { |
3424 | register tree result, folded; | |
3425 | tree restype = ptrdiff_type_node; | |
79a7c7fa | 3426 | tree target_type = TREE_TYPE (ptrtype); |
8d08fdba | 3427 | |
66543169 | 3428 | if (!complete_type_or_else (target_type, NULL_TREE)) |
8f259df3 MM |
3429 | return error_mark_node; |
3430 | ||
be99da77 | 3431 | if (pedantic || warn_pointer_arith) |
8d08fdba MS |
3432 | { |
3433 | if (TREE_CODE (target_type) == VOID_TYPE) | |
7e4d7898 | 3434 | pedwarn ("ISO C++ forbids using pointer of type `void *' in subtraction"); |
8d08fdba | 3435 | if (TREE_CODE (target_type) == FUNCTION_TYPE) |
7e4d7898 | 3436 | pedwarn ("ISO C++ forbids using pointer to a function in subtraction"); |
8d08fdba | 3437 | if (TREE_CODE (target_type) == METHOD_TYPE) |
7e4d7898 | 3438 | pedwarn ("ISO C++ forbids using pointer to a method in subtraction"); |
8d08fdba MS |
3439 | } |
3440 | ||
3441 | /* First do the subtraction as integers; | |
3442 | then drop through to build the divide operator. */ | |
3443 | ||
ab76ca54 MM |
3444 | op0 = cp_build_binary_op (MINUS_EXPR, |
3445 | cp_convert (restype, op0), | |
3446 | cp_convert (restype, op1)); | |
8d08fdba MS |
3447 | |
3448 | /* This generates an error if op1 is a pointer to an incomplete type. */ | |
d0f062fb | 3449 | if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1)))) |
7e4d7898 | 3450 | error ("invalid use of a pointer to an incomplete type in pointer arithmetic"); |
8d08fdba | 3451 | |
a5ac359a MM |
3452 | op1 = (TYPE_PTROB_P (ptrtype) |
3453 | ? size_in_bytes (target_type) | |
3454 | : integer_one_node); | |
8d08fdba MS |
3455 | |
3456 | /* Do the division. */ | |
3457 | ||
37c46b43 | 3458 | result = build (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1)); |
8d08fdba MS |
3459 | |
3460 | folded = fold (result); | |
3461 | if (folded == result) | |
3462 | TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1); | |
3463 | return folded; | |
3464 | } | |
3465 | \f | |
8d08fdba MS |
3466 | /* Construct and perhaps optimize a tree representation |
3467 | for a unary operation. CODE, a tree_code, specifies the operation | |
3468 | and XARG is the operand. */ | |
3469 | ||
3470 | tree | |
5671bf27 | 3471 | build_x_unary_op (enum tree_code code, tree xarg) |
8d08fdba | 3472 | { |
d17811fd | 3473 | tree orig_expr = xarg; |
19420d00 NS |
3474 | tree exp; |
3475 | int ptrmem = 0; | |
3476 | ||
5156628f | 3477 | if (processing_template_decl) |
d17811fd MM |
3478 | { |
3479 | if (type_dependent_expression_p (xarg)) | |
3480 | return build_min_nt (code, xarg, NULL_TREE); | |
3481 | xarg = build_non_dependent_expr (xarg); | |
3482 | } | |
3483 | ||
3484 | exp = NULL_TREE; | |
5566b478 | 3485 | |
8d08fdba | 3486 | /* & rec, on incomplete RECORD_TYPEs is the simple opr &, not an |
e92cc029 | 3487 | error message. */ |
db5ae43f | 3488 | if (code == ADDR_EXPR |
386b8a85 | 3489 | && TREE_CODE (xarg) != TEMPLATE_ID_EXPR |
db5ae43f | 3490 | && ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (xarg))) |
d0f062fb | 3491 | && !COMPLETE_TYPE_P (TREE_TYPE (xarg))) |
db5ae43f MS |
3492 | || (TREE_CODE (xarg) == OFFSET_REF))) |
3493 | /* don't look for a function */; | |
3494 | else | |
d17811fd MM |
3495 | exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE); |
3496 | if (!exp && code == ADDR_EXPR) | |
c91a56d2 | 3497 | { |
1e14c7f0 GDR |
3498 | /* A pointer to member-function can be formed only by saying |
3499 | &X::mf. */ | |
3500 | if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE | |
3501 | && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg))) | |
3502 | { | |
3503 | if (TREE_CODE (xarg) != OFFSET_REF) | |
3504 | { | |
3505 | error ("invalid use of '%E' to form a pointer-to-member-function. Use a qualified-id.", | |
3506 | xarg); | |
3507 | return error_mark_node; | |
3508 | } | |
3509 | else | |
3510 | { | |
3511 | error ("parenthesis around '%E' cannot be used to form a pointer-to-member-function", | |
3512 | xarg); | |
3513 | PTRMEM_OK_P (xarg) = 1; | |
3514 | } | |
3515 | } | |
3516 | ||
19420d00 NS |
3517 | if (TREE_CODE (xarg) == OFFSET_REF) |
3518 | { | |
3519 | ptrmem = PTRMEM_OK_P (xarg); | |
3520 | ||
3521 | if (!ptrmem && !flag_ms_extensions | |
3522 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE) | |
4542128e NS |
3523 | { |
3524 | /* A single non-static member, make sure we don't allow a | |
3525 | pointer-to-member. */ | |
3526 | xarg = build (OFFSET_REF, TREE_TYPE (xarg), | |
3527 | TREE_OPERAND (xarg, 0), | |
3528 | ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE)); | |
3529 | PTRMEM_OK_P (xarg) = ptrmem; | |
d17811fd | 3530 | } |
19420d00 NS |
3531 | } |
3532 | else if (TREE_CODE (xarg) == TARGET_EXPR) | |
8251199e | 3533 | warning ("taking address of temporary"); |
d17811fd MM |
3534 | exp = build_unary_op (ADDR_EXPR, xarg, 0); |
3535 | if (TREE_CODE (exp) == ADDR_EXPR) | |
3536 | PTRMEM_OK_P (exp) = ptrmem; | |
c91a56d2 MS |
3537 | } |
3538 | ||
d17811fd | 3539 | if (processing_template_decl && exp != error_mark_node) |
6489f188 | 3540 | return build_min (code, TREE_TYPE (exp), orig_expr, NULL_TREE); |
19420d00 | 3541 | return exp; |
8d08fdba MS |
3542 | } |
3543 | ||
78ef5b89 NB |
3544 | /* Like c_common_truthvalue_conversion, but handle pointer-to-member |
3545 | constants, where a null value is represented by an INTEGER_CST of | |
3546 | -1. */ | |
96d6c610 JM |
3547 | |
3548 | tree | |
5671bf27 | 3549 | cp_truthvalue_conversion (tree expr) |
96d6c610 JM |
3550 | { |
3551 | tree type = TREE_TYPE (expr); | |
3552 | if (TYPE_PTRMEM_P (type)) | |
3553 | return build_binary_op (NE_EXPR, expr, integer_zero_node, 1); | |
3554 | else | |
78ef5b89 | 3555 | return c_common_truthvalue_conversion (expr); |
96d6c610 JM |
3556 | } |
3557 | ||
3558 | /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */ | |
8ccc31eb | 3559 | |
2986ae00 | 3560 | tree |
5671bf27 | 3561 | condition_conversion (tree expr) |
2986ae00 | 3562 | { |
5566b478 | 3563 | tree t; |
5156628f | 3564 | if (processing_template_decl) |
5566b478 | 3565 | return expr; |
5d73aa63 | 3566 | t = perform_implicit_conversion (boolean_type_node, expr); |
8ccc31eb MS |
3567 | t = fold (build1 (CLEANUP_POINT_EXPR, boolean_type_node, t)); |
3568 | return t; | |
2986ae00 | 3569 | } |
7993382e MM |
3570 | |
3571 | /* Return an ADDR_EXPR giving the address of T. This function | |
3572 | attempts no optimizations or simplifications; it is a low-level | |
3573 | primitive. */ | |
3574 | ||
3575 | tree | |
3576 | build_address (tree t) | |
3577 | { | |
3578 | tree addr; | |
3579 | ||
3580 | if (error_operand_p (t) || !cxx_mark_addressable (t)) | |
3581 | return error_mark_node; | |
3582 | ||
3583 | addr = build1 (ADDR_EXPR, | |
3584 | build_pointer_type (TREE_TYPE (t)), | |
3585 | t); | |
3586 | if (staticp (t)) | |
3587 | TREE_CONSTANT (addr) = 1; | |
3588 | ||
3589 | return addr; | |
3590 | } | |
3591 | ||
3592 | /* Return a NOP_EXPR converting EXPR to TYPE. */ | |
3593 | ||
3594 | tree | |
3595 | build_nop (tree type, tree expr) | |
3596 | { | |
3597 | tree nop; | |
3598 | ||
3599 | if (type == error_mark_node || error_operand_p (expr)) | |
3600 | return expr; | |
3601 | ||
3602 | nop = build1 (NOP_EXPR, type, expr); | |
3603 | if (TREE_CONSTANT (expr)) | |
3604 | TREE_CONSTANT (nop) = 1; | |
3605 | ||
3606 | return nop; | |
3607 | } | |
3608 | ||
8d08fdba MS |
3609 | /* C++: Must handle pointers to members. |
3610 | ||
3611 | Perhaps type instantiation should be extended to handle conversion | |
3612 | from aggregates to types we don't yet know we want? (Or are those | |
3613 | cases typically errors which should be reported?) | |
3614 | ||
3615 | NOCONVERT nonzero suppresses the default promotions | |
3616 | (such as from short to int). */ | |
e92cc029 | 3617 | |
8d08fdba | 3618 | tree |
acd8e2d0 | 3619 | build_unary_op (enum tree_code code, tree xarg, int noconvert) |
8d08fdba MS |
3620 | { |
3621 | /* No default_conversion here. It causes trouble for ADDR_EXPR. */ | |
3622 | register tree arg = xarg; | |
3623 | register tree argtype = 0; | |
d8e178a0 | 3624 | const char *errstring = NULL; |
8d08fdba | 3625 | tree val; |
8d08fdba | 3626 | |
b7484fbe | 3627 | if (arg == error_mark_node) |
8d08fdba MS |
3628 | return error_mark_node; |
3629 | ||
8d08fdba MS |
3630 | switch (code) |
3631 | { | |
3632 | case CONVERT_EXPR: | |
3633 | /* This is used for unary plus, because a CONVERT_EXPR | |
3634 | is enough to prevent anybody from looking inside for | |
3635 | associativity, but won't generate any code. */ | |
b7484fbe | 3636 | if (!(arg = build_expr_type_conversion |
b746c5dc | 3637 | (WANT_ARITH | WANT_ENUM | WANT_POINTER, arg, true))) |
b7484fbe MS |
3638 | errstring = "wrong type argument to unary plus"; |
3639 | else | |
8d08fdba MS |
3640 | { |
3641 | if (!noconvert) | |
b7484fbe MS |
3642 | arg = default_conversion (arg); |
3643 | arg = build1 (NON_LVALUE_EXPR, TREE_TYPE (arg), arg); | |
27fafc8d | 3644 | TREE_CONSTANT (arg) = TREE_CONSTANT (TREE_OPERAND (arg, 0)); |
8d08fdba | 3645 | } |
b7484fbe | 3646 | break; |
8d08fdba | 3647 | |
b7484fbe | 3648 | case NEGATE_EXPR: |
b746c5dc | 3649 | if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true))) |
b7484fbe | 3650 | errstring = "wrong type argument to unary minus"; |
0a72704b MM |
3651 | else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg))) |
3652 | arg = perform_integral_promotions (arg); | |
8d08fdba MS |
3653 | break; |
3654 | ||
3655 | case BIT_NOT_EXPR: | |
37c46b43 MS |
3656 | if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE) |
3657 | { | |
3658 | code = CONJ_EXPR; | |
3659 | if (!noconvert) | |
3660 | arg = default_conversion (arg); | |
3661 | } | |
3662 | else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM, | |
b746c5dc | 3663 | arg, true))) |
b7484fbe | 3664 | errstring = "wrong type argument to bit-complement"; |
8d08fdba | 3665 | else if (!noconvert) |
0a72704b | 3666 | arg = perform_integral_promotions (arg); |
8d08fdba MS |
3667 | break; |
3668 | ||
3669 | case ABS_EXPR: | |
b746c5dc | 3670 | if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true))) |
b7484fbe | 3671 | errstring = "wrong type argument to abs"; |
8d08fdba MS |
3672 | else if (!noconvert) |
3673 | arg = default_conversion (arg); | |
3674 | break; | |
3675 | ||
37c46b43 MS |
3676 | case CONJ_EXPR: |
3677 | /* Conjugating a real value is a no-op, but allow it anyway. */ | |
b746c5dc | 3678 | if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true))) |
37c46b43 MS |
3679 | errstring = "wrong type argument to conjugation"; |
3680 | else if (!noconvert) | |
3681 | arg = default_conversion (arg); | |
3682 | break; | |
3683 | ||
8d08fdba | 3684 | case TRUTH_NOT_EXPR: |
6cf4d1bc | 3685 | arg = perform_implicit_conversion (boolean_type_node, arg); |
8d08fdba | 3686 | val = invert_truthvalue (arg); |
2986ae00 MS |
3687 | if (arg != error_mark_node) |
3688 | return val; | |
3689 | errstring = "in argument to unary !"; | |
8d08fdba MS |
3690 | break; |
3691 | ||
3692 | case NOP_EXPR: | |
3693 | break; | |
3694 | ||
37c46b43 MS |
3695 | case REALPART_EXPR: |
3696 | if (TREE_CODE (arg) == COMPLEX_CST) | |
3697 | return TREE_REALPART (arg); | |
3698 | else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE) | |
3699 | return fold (build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg)); | |
3700 | else | |
3701 | return arg; | |
3702 | ||
3703 | case IMAGPART_EXPR: | |
3704 | if (TREE_CODE (arg) == COMPLEX_CST) | |
3705 | return TREE_IMAGPART (arg); | |
3706 | else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE) | |
3707 | return fold (build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg)); | |
3708 | else | |
3709 | return cp_convert (TREE_TYPE (arg), integer_zero_node); | |
3710 | ||
8d08fdba MS |
3711 | case PREINCREMENT_EXPR: |
3712 | case POSTINCREMENT_EXPR: | |
3713 | case PREDECREMENT_EXPR: | |
3714 | case POSTDECREMENT_EXPR: | |
3715 | /* Handle complex lvalues (when permitted) | |
3716 | by reduction to simpler cases. */ | |
3717 | ||
3718 | val = unary_complex_lvalue (code, arg); | |
3719 | if (val != 0) | |
3720 | return val; | |
3721 | ||
37c46b43 MS |
3722 | /* Increment or decrement the real part of the value, |
3723 | and don't change the imaginary part. */ | |
3724 | if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE) | |
3725 | { | |
3726 | tree real, imag; | |
3727 | ||
3728 | arg = stabilize_reference (arg); | |
3729 | real = build_unary_op (REALPART_EXPR, arg, 1); | |
3730 | imag = build_unary_op (IMAGPART_EXPR, arg, 1); | |
3731 | return build (COMPLEX_EXPR, TREE_TYPE (arg), | |
3732 | build_unary_op (code, real, 1), imag); | |
3733 | } | |
3734 | ||
8d08fdba MS |
3735 | /* Report invalid types. */ |
3736 | ||
b7484fbe | 3737 | if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER, |
b746c5dc | 3738 | arg, true))) |
8d08fdba MS |
3739 | { |
3740 | if (code == PREINCREMENT_EXPR) | |
3741 | errstring ="no pre-increment operator for type"; | |
3742 | else if (code == POSTINCREMENT_EXPR) | |
3743 | errstring ="no post-increment operator for type"; | |
3744 | else if (code == PREDECREMENT_EXPR) | |
3745 | errstring ="no pre-decrement operator for type"; | |
3746 | else | |
3747 | errstring ="no post-decrement operator for type"; | |
3748 | break; | |
3749 | } | |
3750 | ||
3751 | /* Report something read-only. */ | |
3752 | ||
91063b51 | 3753 | if (CP_TYPE_CONST_P (TREE_TYPE (arg)) |
8d08fdba MS |
3754 | || TREE_READONLY (arg)) |
3755 | readonly_error (arg, ((code == PREINCREMENT_EXPR | |
3756 | || code == POSTINCREMENT_EXPR) | |
3757 | ? "increment" : "decrement"), | |
3758 | 0); | |
3759 | ||
3760 | { | |
3761 | register tree inc; | |
3762 | tree result_type = TREE_TYPE (arg); | |
3763 | ||
3764 | arg = get_unwidened (arg, 0); | |
3765 | argtype = TREE_TYPE (arg); | |
3766 | ||
3767 | /* ARM $5.2.5 last annotation says this should be forbidden. */ | |
3768 | if (TREE_CODE (argtype) == ENUMERAL_TYPE) | |
7e4d7898 | 3769 | pedwarn ("ISO C++ forbids %sing an enum", |
8d08fdba MS |
3770 | (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR) |
3771 | ? "increment" : "decrement"); | |
3772 | ||
3773 | /* Compute the increment. */ | |
3774 | ||
b7484fbe | 3775 | if (TREE_CODE (argtype) == POINTER_TYPE) |
8d08fdba | 3776 | { |
d0f062fb NS |
3777 | tree type = complete_type (TREE_TYPE (argtype)); |
3778 | ||
3779 | if (!COMPLETE_OR_VOID_TYPE_P (type)) | |
33bd39a2 | 3780 | error ("cannot %s a pointer to incomplete type `%T'", |
39211cd5 MS |
3781 | ((code == PREINCREMENT_EXPR |
3782 | || code == POSTINCREMENT_EXPR) | |
3783 | ? "increment" : "decrement"), TREE_TYPE (argtype)); | |
e62d5b58 | 3784 | else if ((pedantic || warn_pointer_arith) |
a5ac359a | 3785 | && !TYPE_PTROB_P (argtype)) |
33bd39a2 | 3786 | pedwarn ("ISO C++ forbids %sing a pointer of type `%T'", |
39211cd5 MS |
3787 | ((code == PREINCREMENT_EXPR |
3788 | || code == POSTINCREMENT_EXPR) | |
3789 | ? "increment" : "decrement"), argtype); | |
ea793912 | 3790 | inc = cxx_sizeof_nowarn (TREE_TYPE (argtype)); |
8d08fdba MS |
3791 | } |
3792 | else | |
3793 | inc = integer_one_node; | |
3794 | ||
37c46b43 | 3795 | inc = cp_convert (argtype, inc); |
8d08fdba MS |
3796 | |
3797 | /* Handle incrementing a cast-expression. */ | |
3798 | ||
3799 | switch (TREE_CODE (arg)) | |
3800 | { | |
3801 | case NOP_EXPR: | |
3802 | case CONVERT_EXPR: | |
3803 | case FLOAT_EXPR: | |
3804 | case FIX_TRUNC_EXPR: | |
3805 | case FIX_FLOOR_EXPR: | |
3806 | case FIX_ROUND_EXPR: | |
3807 | case FIX_CEIL_EXPR: | |
3808 | { | |
72b7eeff | 3809 | tree incremented, modify, value, compound; |
f0e01782 | 3810 | if (! lvalue_p (arg) && pedantic) |
8251199e | 3811 | pedwarn ("cast to non-reference type used as lvalue"); |
8d08fdba MS |
3812 | arg = stabilize_reference (arg); |
3813 | if (code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR) | |
3814 | value = arg; | |
3815 | else | |
3816 | value = save_expr (arg); | |
3817 | incremented = build (((code == PREINCREMENT_EXPR | |
3818 | || code == POSTINCREMENT_EXPR) | |
3819 | ? PLUS_EXPR : MINUS_EXPR), | |
3820 | argtype, value, inc); | |
72b7eeff | 3821 | |
8d08fdba | 3822 | modify = build_modify_expr (arg, NOP_EXPR, incremented); |
72b7eeff MS |
3823 | compound = build (COMPOUND_EXPR, TREE_TYPE (arg), modify, value); |
3824 | ||
e92cc029 | 3825 | /* Eliminate warning about unused result of + or -. */ |
72b7eeff MS |
3826 | TREE_NO_UNUSED_WARNING (compound) = 1; |
3827 | return compound; | |
8d08fdba | 3828 | } |
7f85441b KG |
3829 | |
3830 | default: | |
3831 | break; | |
8d08fdba MS |
3832 | } |
3833 | ||
8d08fdba MS |
3834 | /* Complain about anything else that is not a true lvalue. */ |
3835 | if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR | |
3836 | || code == POSTINCREMENT_EXPR) | |
3837 | ? "increment" : "decrement"))) | |
3838 | return error_mark_node; | |
3839 | ||
b7484fbe MS |
3840 | /* Forbid using -- on `bool'. */ |
3841 | if (TREE_TYPE (arg) == boolean_type_node) | |
3842 | { | |
3843 | if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR) | |
3844 | { | |
33bd39a2 | 3845 | error ("invalid use of `--' on bool variable `%D'", arg); |
b7484fbe MS |
3846 | return error_mark_node; |
3847 | } | |
19552aa5 | 3848 | val = boolean_increment (code, arg); |
b7484fbe MS |
3849 | } |
3850 | else | |
3851 | val = build (code, TREE_TYPE (arg), arg, inc); | |
3852 | ||
8d08fdba | 3853 | TREE_SIDE_EFFECTS (val) = 1; |
37c46b43 | 3854 | return cp_convert (result_type, val); |
8d08fdba MS |
3855 | } |
3856 | ||
3857 | case ADDR_EXPR: | |
3858 | /* Note that this operation never does default_conversion | |
3859 | regardless of NOCONVERT. */ | |
3860 | ||
8cd4c175 | 3861 | argtype = lvalue_type (arg); |
a5ac359a MM |
3862 | |
3863 | if (TREE_CODE (arg) == OFFSET_REF) | |
3864 | goto offset_ref; | |
3865 | ||
b7484fbe | 3866 | if (TREE_CODE (argtype) == REFERENCE_TYPE) |
8d08fdba | 3867 | { |
eb66be0e MS |
3868 | arg = build1 |
3869 | (CONVERT_EXPR, | |
8cd4c175 | 3870 | build_pointer_type (TREE_TYPE (argtype)), arg); |
eb66be0e | 3871 | TREE_CONSTANT (arg) = TREE_CONSTANT (TREE_OPERAND (arg, 0)); |
8d08fdba MS |
3872 | return arg; |
3873 | } | |
35680744 | 3874 | else if (pedantic && DECL_MAIN_P (arg)) |
a0a33927 | 3875 | /* ARM $3.4 */ |
7e4d7898 | 3876 | pedwarn ("ISO C++ forbids taking address of function `::main'"); |
8d08fdba MS |
3877 | |
3878 | /* Let &* cancel out to simplify resulting code. */ | |
3879 | if (TREE_CODE (arg) == INDIRECT_REF) | |
3880 | { | |
4ac14744 | 3881 | /* We don't need to have `current_class_ptr' wrapped in a |
8d08fdba | 3882 | NON_LVALUE_EXPR node. */ |
4ac14744 MS |
3883 | if (arg == current_class_ref) |
3884 | return current_class_ptr; | |
8d08fdba | 3885 | |
8d08fdba MS |
3886 | arg = TREE_OPERAND (arg, 0); |
3887 | if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE) | |
3888 | { | |
eb66be0e MS |
3889 | arg = build1 |
3890 | (CONVERT_EXPR, | |
3891 | build_pointer_type (TREE_TYPE (TREE_TYPE (arg))), arg); | |
8d08fdba MS |
3892 | TREE_CONSTANT (arg) = TREE_CONSTANT (TREE_OPERAND (arg, 0)); |
3893 | } | |
3894 | else if (lvalue_p (arg)) | |
3895 | /* Don't let this be an lvalue. */ | |
3896 | return non_lvalue (arg); | |
3897 | return arg; | |
3898 | } | |
3899 | ||
3900 | /* For &x[y], return x+y */ | |
3901 | if (TREE_CODE (arg) == ARRAY_REF) | |
3902 | { | |
dffd7eb6 | 3903 | if (!cxx_mark_addressable (TREE_OPERAND (arg, 0))) |
8d08fdba | 3904 | return error_mark_node; |
ab76ca54 MM |
3905 | return cp_build_binary_op (PLUS_EXPR, TREE_OPERAND (arg, 0), |
3906 | TREE_OPERAND (arg, 1)); | |
8d08fdba MS |
3907 | } |
3908 | ||
8d08fdba MS |
3909 | /* Uninstantiated types are all functions. Taking the |
3910 | address of a function is a no-op, so just return the | |
3911 | argument. */ | |
3912 | ||
3913 | if (TREE_CODE (arg) == IDENTIFIER_NODE | |
3914 | && IDENTIFIER_OPNAME_P (arg)) | |
3915 | { | |
a98facb0 | 3916 | abort (); |
8d08fdba MS |
3917 | /* We don't know the type yet, so just work around the problem. |
3918 | We know that this will resolve to an lvalue. */ | |
3919 | return build1 (ADDR_EXPR, unknown_type_node, arg); | |
3920 | } | |
3921 | ||
96d6c610 | 3922 | if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg) |
50ad9642 | 3923 | && !really_overloaded_fn (TREE_OPERAND (arg, 1))) |
19420d00 | 3924 | { |
fbf6f1ba | 3925 | /* They're trying to take the address of a unique non-static |
96d6c610 JM |
3926 | member function. This is ill-formed (except in MS-land), |
3927 | but let's try to DTRT. | |
3928 | Note: We only handle unique functions here because we don't | |
3929 | want to complain if there's a static overload; non-unique | |
3930 | cases will be handled by instantiate_type. But we need to | |
3931 | handle this case here to allow casts on the resulting PMF. | |
3932 | We could defer this in non-MS mode, but it's easier to give | |
3933 | a useful error here. */ | |
fbf6f1ba | 3934 | |
d219f3ff KL |
3935 | /* Inside constant member functions, the `this' pointer |
3936 | contains an extra const qualifier. TYPE_MAIN_VARIANT | |
3937 | is used here to remove this const from the diagnostics | |
3938 | and the created OFFSET_REF. */ | |
3939 | tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0))); | |
50ad9642 | 3940 | tree name = DECL_NAME (get_first_fn (TREE_OPERAND (arg, 1))); |
96d6c610 JM |
3941 | |
3942 | if (! flag_ms_extensions) | |
3943 | { | |
3944 | if (current_class_type | |
3945 | && TREE_OPERAND (arg, 0) == current_class_ref) | |
3946 | /* An expression like &memfn. */ | |
16692dd5 KL |
3947 | pedwarn ("ISO C++ forbids taking the address of an unqualified" |
3948 | " or parenthesized non-static member function to form" | |
3949 | " a pointer to member function. Say `&%T::%D'", | |
d219f3ff | 3950 | base, name); |
96d6c610 | 3951 | else |
16692dd5 KL |
3952 | pedwarn ("ISO C++ forbids taking the address of a bound member" |
3953 | " function to form a pointer to member function." | |
3954 | " Say `&%T::%D'", | |
d219f3ff | 3955 | base, name); |
96d6c610 | 3956 | } |
a5ac359a | 3957 | arg = build_offset_ref (base, name, /*address_p=*/true); |
19420d00 | 3958 | } |
a5ac359a MM |
3959 | |
3960 | offset_ref: | |
03017874 | 3961 | if (type_unknown_p (arg)) |
51924768 | 3962 | return build1 (ADDR_EXPR, unknown_type_node, arg); |
19420d00 | 3963 | |
8d08fdba MS |
3964 | /* Handle complex lvalues (when permitted) |
3965 | by reduction to simpler cases. */ | |
3966 | val = unary_complex_lvalue (code, arg); | |
3967 | if (val != 0) | |
3968 | return val; | |
3969 | ||
8d08fdba MS |
3970 | switch (TREE_CODE (arg)) |
3971 | { | |
3972 | case NOP_EXPR: | |
3973 | case CONVERT_EXPR: | |
3974 | case FLOAT_EXPR: | |
3975 | case FIX_TRUNC_EXPR: | |
3976 | case FIX_FLOOR_EXPR: | |
3977 | case FIX_ROUND_EXPR: | |
3978 | case FIX_CEIL_EXPR: | |
f0e01782 | 3979 | if (! lvalue_p (arg) && pedantic) |
ddcc7cf6 | 3980 | pedwarn ("ISO C++ forbids taking the address of a cast to a non-lvalue expression"); |
7f85441b KG |
3981 | break; |
3982 | ||
3983 | default: | |
3984 | break; | |
8d08fdba | 3985 | } |
8d08fdba MS |
3986 | |
3987 | /* Allow the address of a constructor if all the elements | |
3988 | are constant. */ | |
dc26f471 JM |
3989 | if (TREE_CODE (arg) == CONSTRUCTOR && TREE_HAS_CONSTRUCTOR (arg) |
3990 | && TREE_CONSTANT (arg)) | |
8d08fdba MS |
3991 | ; |
3992 | /* Anything not already handled and not a true memory reference | |
3993 | is an error. */ | |
b7484fbe MS |
3994 | else if (TREE_CODE (argtype) != FUNCTION_TYPE |
3995 | && TREE_CODE (argtype) != METHOD_TYPE | |
d18a8251 | 3996 | && !lvalue_or_else (arg, "unary `&'")) |
8d08fdba MS |
3997 | return error_mark_node; |
3998 | ||
01240200 MM |
3999 | if (argtype != error_mark_node) |
4000 | argtype = build_pointer_type (argtype); | |
8d08fdba | 4001 | |
8d08fdba MS |
4002 | { |
4003 | tree addr; | |
4004 | ||
a723baf1 MM |
4005 | if (TREE_CODE (arg) == COMPONENT_REF |
4006 | && TREE_CODE (TREE_OPERAND (arg, 1)) == BASELINK) | |
4007 | arg = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1)); | |
4008 | ||
8de9bb0e NS |
4009 | if (TREE_CODE (arg) != COMPONENT_REF) |
4010 | addr = build_address (arg); | |
4011 | else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1))) | |
c93a26f5 NS |
4012 | { |
4013 | error ("attempt to take address of bit-field structure member `%D'", | |
4014 | TREE_OPERAND (arg, 1)); | |
4015 | return error_mark_node; | |
4016 | } | |
8de9bb0e | 4017 | else |
eac5ce6c | 4018 | { |
8de9bb0e NS |
4019 | /* Unfortunately we cannot just build an address |
4020 | expression here, because we would not handle | |
4021 | address-constant-expressions or offsetof correctly. */ | |
eac5ce6c NS |
4022 | tree field = TREE_OPERAND (arg, 1); |
4023 | tree rval = build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), 0); | |
4024 | tree binfo = lookup_base (TREE_TYPE (TREE_TYPE (rval)), | |
4025 | decl_type_context (field), | |
4026 | ba_check, NULL); | |
4027 | ||
4028 | rval = build_base_path (PLUS_EXPR, rval, binfo, 1); | |
7b6d72fc | 4029 | rval = build_nop (argtype, rval); |
eac5ce6c NS |
4030 | addr = fold (build (PLUS_EXPR, argtype, rval, |
4031 | cp_convert (argtype, byte_position (field)))); | |
4032 | } | |
4ac14744 | 4033 | |
beb53fb8 JM |
4034 | if (TREE_CODE (argtype) == POINTER_TYPE |
4035 | && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE) | |
4ac14744 MS |
4036 | { |
4037 | build_ptrmemfunc_type (argtype); | |
4038 | addr = build_ptrmemfunc (argtype, addr, 0); | |
4039 | } | |
4040 | ||
8d08fdba MS |
4041 | return addr; |
4042 | } | |
7f85441b KG |
4043 | |
4044 | default: | |
4045 | break; | |
8d08fdba MS |
4046 | } |
4047 | ||
4048 | if (!errstring) | |
4049 | { | |
4050 | if (argtype == 0) | |
4051 | argtype = TREE_TYPE (arg); | |
4052 | return fold (build1 (code, argtype, arg)); | |
4053 | } | |
4054 | ||
b9d12519 | 4055 | error ("%s", errstring); |
8d08fdba MS |
4056 | return error_mark_node; |
4057 | } | |
4058 | ||
8d08fdba MS |
4059 | /* Apply unary lvalue-demanding operator CODE to the expression ARG |
4060 | for certain kinds of expressions which are not really lvalues | |
4061 | but which we can accept as lvalues. | |
4062 | ||
4063 | If ARG is not a kind of expression we can handle, return zero. */ | |
4064 | ||
4065 | tree | |
acd8e2d0 | 4066 | unary_complex_lvalue (enum tree_code code, tree arg) |
8d08fdba MS |
4067 | { |
4068 | /* Handle (a, b) used as an "lvalue". */ | |
4069 | if (TREE_CODE (arg) == COMPOUND_EXPR) | |
4070 | { | |
4071 | tree real_result = build_unary_op (code, TREE_OPERAND (arg, 1), 0); | |
8d08fdba MS |
4072 | return build (COMPOUND_EXPR, TREE_TYPE (real_result), |
4073 | TREE_OPERAND (arg, 0), real_result); | |
4074 | } | |
4075 | ||
4076 | /* Handle (a ? b : c) used as an "lvalue". */ | |
e9a25f70 JL |
4077 | if (TREE_CODE (arg) == COND_EXPR |
4078 | || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR) | |
a4443a08 MS |
4079 | return rationalize_conditional_expr (code, arg); |
4080 | ||
ae818d3b | 4081 | /* Handle (a = b), (++a), and (--a) used as an "lvalue". */ |
e1cd6e56 MS |
4082 | if (TREE_CODE (arg) == MODIFY_EXPR |
4083 | || TREE_CODE (arg) == PREINCREMENT_EXPR | |
4084 | || TREE_CODE (arg) == PREDECREMENT_EXPR) | |
ae818d3b ER |
4085 | { |
4086 | tree lvalue = TREE_OPERAND (arg, 0); | |
4087 | if (TREE_SIDE_EFFECTS (lvalue)) | |
4088 | { | |
4089 | lvalue = stabilize_reference (lvalue); | |
4090 | arg = build (TREE_CODE (arg), TREE_TYPE (arg), | |
4091 | lvalue, TREE_OPERAND (arg, 1)); | |
4092 | } | |
4093 | return unary_complex_lvalue | |
4094 | (code, build (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue)); | |
4095 | } | |
8d08fdba MS |
4096 | |
4097 | if (code != ADDR_EXPR) | |
4098 | return 0; | |
4099 | ||
4100 | /* Handle (a = b) used as an "lvalue" for `&'. */ | |
4101 | if (TREE_CODE (arg) == MODIFY_EXPR | |
4102 | || TREE_CODE (arg) == INIT_EXPR) | |
4103 | { | |
4104 | tree real_result = build_unary_op (code, TREE_OPERAND (arg, 0), 0); | |
faf5394a MS |
4105 | arg = build (COMPOUND_EXPR, TREE_TYPE (real_result), arg, real_result); |
4106 | TREE_NO_UNUSED_WARNING (arg) = 1; | |
4107 | return arg; | |
8d08fdba MS |
4108 | } |
4109 | ||
8d08fdba MS |
4110 | if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE |
4111 | || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE | |
a5ac359a | 4112 | || TREE_CODE (arg) == OFFSET_REF) |
8d08fdba | 4113 | { |
8d08fdba | 4114 | tree t; |
8d08fdba MS |
4115 | |
4116 | my_friendly_assert (TREE_CODE (arg) != SCOPE_REF, 313); | |
4117 | ||
4118 | if (TREE_CODE (arg) != OFFSET_REF) | |
4119 | return 0; | |
4120 | ||
4121 | t = TREE_OPERAND (arg, 1); | |
4122 | ||
3c215895 JM |
4123 | /* Check all this code for right semantics. */ |
4124 | if (TREE_CODE (t) == FUNCTION_DECL) | |
1c2c08a5 JM |
4125 | { |
4126 | if (DECL_DESTRUCTOR_P (t)) | |
33bd39a2 | 4127 | error ("taking address of destructor"); |
1c2c08a5 JM |
4128 | return build_unary_op (ADDR_EXPR, t, 0); |
4129 | } | |
8d08fdba MS |
4130 | if (TREE_CODE (t) == VAR_DECL) |
4131 | return build_unary_op (ADDR_EXPR, t, 0); | |
4132 | else | |
4133 | { | |
d22c8596 | 4134 | tree type; |
d22c8596 | 4135 | |
8d08fdba | 4136 | if (TREE_OPERAND (arg, 0) |
51924768 | 4137 | && ! is_dummy_object (TREE_OPERAND (arg, 0)) |
01240200 MM |
4138 | && TREE_CODE (t) != FIELD_DECL) |
4139 | { | |
33bd39a2 | 4140 | error ("taking address of bound pointer-to-member expression"); |
01240200 MM |
4141 | return error_mark_node; |
4142 | } | |
4542128e | 4143 | if (!PTRMEM_OK_P (arg)) |
d6b4ea85 | 4144 | return build_unary_op (code, arg, 0); |
4542128e NS |
4145 | |
4146 | if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE) | |
4147 | { | |
4148 | error ("cannot create pointer to reference member `%D'", t); | |
4149 | return error_mark_node; | |
4150 | } | |
8d08fdba | 4151 | |
9e259dd1 | 4152 | type = build_ptrmem_type (DECL_FIELD_CONTEXT (t), TREE_TYPE (t)); |
87533b37 | 4153 | t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1)); |
61a127b3 | 4154 | return t; |
8d08fdba MS |
4155 | } |
4156 | } | |
4157 | ||
c91a56d2 | 4158 | |
8d08fdba MS |
4159 | /* We permit compiler to make function calls returning |
4160 | objects of aggregate type look like lvalues. */ | |
4161 | { | |
4162 | tree targ = arg; | |
4163 | ||
4164 | if (TREE_CODE (targ) == SAVE_EXPR) | |
4165 | targ = TREE_OPERAND (targ, 0); | |
4166 | ||
4167 | if (TREE_CODE (targ) == CALL_EXPR && IS_AGGR_TYPE (TREE_TYPE (targ))) | |
4168 | { | |
4169 | if (TREE_CODE (arg) == SAVE_EXPR) | |
4170 | targ = arg; | |
4171 | else | |
5566b478 | 4172 | targ = build_cplus_new (TREE_TYPE (arg), arg); |
f30432d7 | 4173 | return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ); |
8d08fdba MS |
4174 | } |
4175 | ||
4176 | if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF) | |
f30432d7 | 4177 | return build (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)), |
8d08fdba | 4178 | TREE_OPERAND (targ, 0), current_function_decl, NULL); |
8d08fdba MS |
4179 | } |
4180 | ||
4181 | /* Don't let anything else be handled specially. */ | |
4182 | return 0; | |
4183 | } | |
8d08fdba MS |
4184 | \f |
4185 | /* Mark EXP saying that we need to be able to take the | |
4186 | address of it; it should not be allocated in a register. | |
dffd7eb6 | 4187 | Value is true if successful. |
8d08fdba | 4188 | |
4ac14744 | 4189 | C++: we do not allow `current_class_ptr' to be addressable. */ |
8d08fdba | 4190 | |
dffd7eb6 | 4191 | bool |
acd8e2d0 | 4192 | cxx_mark_addressable (tree exp) |
8d08fdba MS |
4193 | { |
4194 | register tree x = exp; | |
4195 | ||
8d08fdba MS |
4196 | while (1) |
4197 | switch (TREE_CODE (x)) | |
4198 | { | |
4199 | case ADDR_EXPR: | |
4200 | case COMPONENT_REF: | |
4201 | case ARRAY_REF: | |
37c46b43 MS |
4202 | case REALPART_EXPR: |
4203 | case IMAGPART_EXPR: | |
8d08fdba MS |
4204 | x = TREE_OPERAND (x, 0); |
4205 | break; | |
4206 | ||
4207 | case PARM_DECL: | |
4ac14744 | 4208 | if (x == current_class_ptr) |
8d08fdba | 4209 | { |
394fd776 | 4210 | error ("cannot take the address of `this', which is an rvalue expression"); |
8d08fdba | 4211 | TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later */ |
dffd7eb6 | 4212 | return true; |
8d08fdba | 4213 | } |
aa8dea09 RH |
4214 | /* FALLTHRU */ |
4215 | ||
8d08fdba | 4216 | case VAR_DECL: |
8d08fdba MS |
4217 | /* Caller should not be trying to mark initialized |
4218 | constant fields addressable. */ | |
4219 | my_friendly_assert (DECL_LANG_SPECIFIC (x) == 0 | |
4220 | || DECL_IN_AGGR_P (x) == 0 | |
4221 | || TREE_STATIC (x) | |
4222 | || DECL_EXTERNAL (x), 314); | |
aa8dea09 | 4223 | /* FALLTHRU */ |
8d08fdba MS |
4224 | |
4225 | case CONST_DECL: | |
4226 | case RESULT_DECL: | |
9a3b49ac MS |
4227 | if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x) |
4228 | && !DECL_ARTIFICIAL (x) && extra_warnings) | |
33bd39a2 | 4229 | warning ("address requested for `%D', which is declared `register'", |
9a3b49ac | 4230 | x); |
8d08fdba | 4231 | TREE_ADDRESSABLE (x) = 1; |
f29a2bd1 | 4232 | put_var_into_stack (x, /*rescan=*/true); |
dffd7eb6 | 4233 | return true; |
8d08fdba MS |
4234 | |
4235 | case FUNCTION_DECL: | |
8d08fdba | 4236 | TREE_ADDRESSABLE (x) = 1; |
8d08fdba | 4237 | TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1; |
dffd7eb6 | 4238 | return true; |
8d08fdba | 4239 | |
e92cc029 MS |
4240 | case CONSTRUCTOR: |
4241 | TREE_ADDRESSABLE (x) = 1; | |
dffd7eb6 | 4242 | return true; |
e92cc029 | 4243 | |
9a3b49ac MS |
4244 | case TARGET_EXPR: |
4245 | TREE_ADDRESSABLE (x) = 1; | |
dffd7eb6 NB |
4246 | cxx_mark_addressable (TREE_OPERAND (x, 0)); |
4247 | return true; | |
9a3b49ac | 4248 | |
8d08fdba | 4249 | default: |
dffd7eb6 | 4250 | return true; |
8d08fdba MS |
4251 | } |
4252 | } | |
4253 | \f | |
4254 | /* Build and return a conditional expression IFEXP ? OP1 : OP2. */ | |
4255 | ||
4256 | tree | |
acd8e2d0 | 4257 | build_x_conditional_expr (tree ifexp, tree op1, tree op2) |
8d08fdba | 4258 | { |
d17811fd MM |
4259 | tree orig_ifexp = ifexp; |
4260 | tree orig_op1 = op1; | |
4261 | tree orig_op2 = op2; | |
4262 | tree expr; | |
4263 | ||
5156628f | 4264 | if (processing_template_decl) |
d17811fd MM |
4265 | { |
4266 | /* The standard says that the expression is type-dependent if | |
4267 | IFEXP is type-dependent, even though the eventual type of the | |
4268 | expression doesn't dependent on IFEXP. */ | |
4269 | if (type_dependent_expression_p (ifexp) | |
4270 | || type_dependent_expression_p (op1) | |
4271 | || type_dependent_expression_p (op2)) | |
4272 | return build_min_nt (COND_EXPR, ifexp, op1, op2); | |
4273 | ifexp = build_non_dependent_expr (ifexp); | |
4274 | op1 = build_non_dependent_expr (op1); | |
4275 | op2 = build_non_dependent_expr (op2); | |
4276 | } | |
5566b478 | 4277 | |
d17811fd MM |
4278 | expr = build_conditional_expr (ifexp, op1, op2); |
4279 | if (processing_template_decl && expr != error_mark_node) | |
4280 | return build_min (COND_EXPR, TREE_TYPE (expr), | |
4281 | orig_ifexp, orig_op1, orig_op2); | |
4282 | return expr; | |
8d08fdba MS |
4283 | } |
4284 | \f | |
c7b62f14 NS |
4285 | /* Given a list of expressions, return a compound expression |
4286 | that performs them all and returns the value of the last of them. */ | |
4287 | ||
4288 | tree build_x_compound_expr_from_list (tree list, const char *msg) | |
4289 | { | |
4290 | tree expr = TREE_VALUE (list); | |
4291 | ||
4292 | if (TREE_CHAIN (list)) | |
4293 | { | |
4294 | if (msg) | |
4295 | pedwarn ("%s expression list treated as compound expression", msg); | |
4296 | ||
4297 | for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list)) | |
4298 | expr = build_x_compound_expr (expr, TREE_VALUE (list)); | |
4299 | } | |
4300 | ||
4301 | return expr; | |
4302 | } | |
4303 | ||
4304 | /* Handle overloading of the ',' operator when needed. */ | |
e92cc029 | 4305 | |
8d08fdba | 4306 | tree |
d17811fd | 4307 | build_x_compound_expr (tree op1, tree op2) |
8d08fdba | 4308 | { |
8d08fdba | 4309 | tree result; |
d17811fd MM |
4310 | tree orig_op1 = op1; |
4311 | tree orig_op2 = op2; | |
8d08fdba | 4312 | |
5156628f | 4313 | if (processing_template_decl) |
d17811fd MM |
4314 | { |
4315 | if (type_dependent_expression_p (op1) | |
4316 | || type_dependent_expression_p (op2)) | |
4317 | return build_min_nt (COMPOUND_EXPR, op1, op2); | |
4318 | op1 = build_non_dependent_expr (op1); | |
4319 | op2 = build_non_dependent_expr (op2); | |
4320 | } | |
b19b4a78 | 4321 | |
d17811fd MM |
4322 | result = build_new_op (COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2, NULL_TREE); |
4323 | if (!result) | |
e895113a | 4324 | result = build_compound_expr (op1, op2); |
b19b4a78 | 4325 | |
d17811fd MM |
4326 | if (processing_template_decl && result != error_mark_node) |
4327 | return build_min (COMPOUND_EXPR, TREE_TYPE (result), | |
4328 | orig_op1, orig_op2); | |
4329 | return result; | |
8d08fdba MS |
4330 | } |
4331 | ||
c7b62f14 | 4332 | /* Build a compound expression. */ |
8d08fdba MS |
4333 | |
4334 | tree | |
c7b62f14 | 4335 | build_compound_expr (tree lhs, tree rhs) |
8d08fdba | 4336 | { |
47d4c811 NS |
4337 | lhs = decl_constant_value (lhs); |
4338 | lhs = convert_to_void (lhs, "left-hand operand of comma"); | |
e895113a | 4339 | |
c7b62f14 | 4340 | if (lhs == error_mark_node || rhs == error_mark_node) |
66543169 | 4341 | return error_mark_node; |
e895113a | 4342 | |
d340e53f NS |
4343 | if (TREE_CODE (rhs) == TARGET_EXPR) |
4344 | { | |
4345 | /* If the rhs is a TARGET_EXPR, then build the compound | |
4346 | expression inside the target_expr's initializer. This | |
4347 | helps the compiler to eliminate unncessary temporaries. */ | |
4348 | tree init = TREE_OPERAND (rhs, 1); | |
e895113a | 4349 | |
d340e53f NS |
4350 | init = build (COMPOUND_EXPR, TREE_TYPE (init), lhs, init); |
4351 | TREE_OPERAND (rhs, 1) = init; | |
4352 | ||
4353 | return rhs; | |
4354 | } | |
66543169 | 4355 | |
c7b62f14 | 4356 | return build (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs); |
8d08fdba MS |
4357 | } |
4358 | ||
3fe18f1d | 4359 | /* Issue an error message if casting from SRC_TYPE to DEST_TYPE casts |
a5ac359a MM |
4360 | away constness. DESCRIPTION explains what operation is taking |
4361 | place. */ | |
3fe18f1d MM |
4362 | |
4363 | static void | |
a5ac359a MM |
4364 | check_for_casting_away_constness (tree src_type, tree dest_type, |
4365 | const char *description) | |
3fe18f1d MM |
4366 | { |
4367 | if (casts_away_constness (src_type, dest_type)) | |
a5ac359a MM |
4368 | error ("%s from type `%T' to type `%T' casts away constness", |
4369 | description, src_type, dest_type); | |
3fe18f1d MM |
4370 | } |
4371 | ||
4372 | /* Return an expression representing static_cast<TYPE>(EXPR). */ | |
4373 | ||
cdf5b885 | 4374 | tree |
acd8e2d0 | 4375 | build_static_cast (tree type, tree expr) |
a4443a08 | 4376 | { |
00bb3dad | 4377 | tree intype; |
3fe18f1d | 4378 | tree result; |
c11b6f21 MS |
4379 | |
4380 | if (type == error_mark_node || expr == error_mark_node) | |
4381 | return error_mark_node; | |
4382 | ||
5156628f | 4383 | if (processing_template_decl) |
e92cc029 | 4384 | { |
2a1e9fdd | 4385 | tree t = build_min (STATIC_CAST_EXPR, type, expr); |
e92cc029 MS |
4386 | return t; |
4387 | } | |
4388 | ||
c11b6f21 MS |
4389 | /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue. |
4390 | Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */ | |
4391 | if (TREE_CODE (type) != REFERENCE_TYPE | |
4392 | && TREE_CODE (expr) == NOP_EXPR | |
4393 | && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0))) | |
4394 | expr = TREE_OPERAND (expr, 0); | |
4395 | ||
3fe18f1d | 4396 | intype = TREE_TYPE (expr); |
c11b6f21 | 4397 | |
3fe18f1d | 4398 | /* [expr.static.cast] |
c11b6f21 | 4399 | |
3fe18f1d MM |
4400 | An lvalue of type "cv1 B", where B is a class type, can be cast |
4401 | to type "reference to cv2 D", where D is a class derived (clause | |
4402 | _class.derived_) from B, if a valid standard conversion from | |
4403 | "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the | |
4404 | same cv-qualification as, or greater cv-qualification than, cv1, | |
4405 | and B is not a virtual base class of D. */ | |
0a72704b MM |
4406 | /* We check this case before checking the validity of "TYPE t = |
4407 | EXPR;" below because for this case: | |
4408 | ||
4409 | struct B {}; | |
4410 | struct D : public B { D(const B&); }; | |
4411 | extern B& b; | |
4412 | void f() { static_cast<const D&>(b); } | |
4413 | ||
4414 | we want to avoid constructing a new D. The standard is not | |
4415 | completely clear about this issue, but our interpretation is | |
4416 | consistent with other compilers. */ | |
3fe18f1d MM |
4417 | if (TREE_CODE (type) == REFERENCE_TYPE |
4418 | && CLASS_TYPE_P (TREE_TYPE (type)) | |
4419 | && CLASS_TYPE_P (intype) | |
d18a8251 | 4420 | && real_lvalue_p (expr) |
3fe18f1d MM |
4421 | && DERIVED_FROM_P (intype, TREE_TYPE (type)) |
4422 | && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)), | |
4423 | build_pointer_type (TYPE_MAIN_VARIANT | |
4424 | (TREE_TYPE (type)))) | |
4425 | && at_least_as_qualified_p (TREE_TYPE (type), intype)) | |
c11b6f21 | 4426 | { |
3fe18f1d MM |
4427 | /* At this point we have checked all of the conditions except |
4428 | that B is not a virtual base class of D. That will be | |
4429 | checked by build_base_path. */ | |
4430 | tree base = lookup_base (TREE_TYPE (type), intype, ba_any, NULL); | |
4431 | ||
4432 | /* Convert from B* to D*. */ | |
4433 | expr = build_base_path (MINUS_EXPR, build_address (expr), | |
4434 | base, /*nonnull=*/false); | |
3a73bcc6 MM |
4435 | /* Convert the pointer to a reference -- but then remember that |
4436 | there are no expressions with reference type in C++. */ | |
4437 | return convert_from_reference (build_nop (type, expr)); | |
c11b6f21 | 4438 | } |
3fe18f1d | 4439 | |
0a72704b MM |
4440 | /* [expr.static.cast] |
4441 | ||
4442 | An expression e can be explicitly converted to a type T using a | |
4443 | static_cast of the form static_cast<T>(e) if the declaration T | |
4444 | t(e);" is well-formed, for some invented temporary variable | |
4445 | t. */ | |
4446 | result = perform_direct_initialization_if_possible (type, expr); | |
4447 | if (result) | |
4448 | return convert_from_reference (result); | |
4449 | ||
4450 | /* [expr.static.cast] | |
4451 | ||
4452 | Any expression can be explicitly converted to type cv void. */ | |
4453 | if (TREE_CODE (type) == VOID_TYPE) | |
4454 | return convert_to_void (expr, /*implicit=*/NULL); | |
4455 | ||
3fe18f1d MM |
4456 | /* [expr.static.cast] |
4457 | ||
4458 | The inverse of any standard conversion sequence (clause _conv_), | |
4459 | other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer | |
4460 | (_conv.array_), function-to-pointer (_conv.func_), and boolean | |
4461 | (_conv.bool_) conversions, can be performed explicitly using | |
4462 | static_cast subject to the restriction that the explicit | |
4463 | conversion does not cast away constness (_expr.const.cast_), and | |
4464 | the following additional rules for specific cases: */ | |
4465 | /* For reference, the conversions not excluded are: integral | |
4466 | promotions, floating point promotion, integral conversions, | |
4467 | floating point conversions, floating-integral conversions, | |
4468 | pointer conversions, and pointer to member conversions. */ | |
4469 | if ((ARITHMETIC_TYPE_P (type) && ARITHMETIC_TYPE_P (intype)) | |
4470 | /* DR 128 | |
4471 | ||
4472 | A value of integral _or enumeration_ type can be explicitly | |
4473 | converted to an enumeration type. */ | |
4474 | || (INTEGRAL_OR_ENUMERATION_TYPE_P (type) | |
4475 | && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))) | |
4476 | /* Really, build_c_cast should defer to this function rather | |
4477 | than the other way around. */ | |
4478 | return build_c_cast (type, expr); | |
4479 | if (TYPE_PTR_P (type) && TYPE_PTR_P (intype) | |
4480 | && CLASS_TYPE_P (TREE_TYPE (type)) | |
4481 | && CLASS_TYPE_P (TREE_TYPE (intype)) | |
4482 | && can_convert (build_pointer_type (TYPE_MAIN_VARIANT | |
4483 | (TREE_TYPE (intype))), | |
4484 | build_pointer_type (TYPE_MAIN_VARIANT | |
4485 | (TREE_TYPE (type))))) | |
999cc24c | 4486 | { |
3fe18f1d MM |
4487 | tree base; |
4488 | ||
a5ac359a | 4489 | check_for_casting_away_constness (intype, type, "static_cast"); |
3fe18f1d MM |
4490 | base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype), |
4491 | ba_check | ba_quiet, NULL); | |
4492 | return build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false); | |
999cc24c | 4493 | } |
3fe18f1d MM |
4494 | if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype)) |
4495 | || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype))) | |
4496 | { | |
4497 | tree c1; | |
4498 | tree c2; | |
4499 | tree t1; | |
4500 | tree t2; | |
c11b6f21 | 4501 | |
3fe18f1d MM |
4502 | c1 = TYPE_PTRMEM_CLASS_TYPE (intype); |
4503 | c2 = TYPE_PTRMEM_CLASS_TYPE (type); | |
4504 | ||
4505 | if (TYPE_PTRMEM_P (type)) | |
4506 | { | |
4507 | t1 = (build_ptrmem_type | |
4508 | (c1, | |
4509 | TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype)))); | |
4510 | t2 = (build_ptrmem_type | |
4511 | (c2, | |
4512 | TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type)))); | |
4513 | } | |
4514 | else | |
4515 | { | |
4516 | t1 = intype; | |
4517 | t2 = type; | |
4518 | } | |
4519 | if (can_convert (t1, t2)) | |
4520 | { | |
a5ac359a | 4521 | check_for_casting_away_constness (intype, type, "static_cast"); |
3fe18f1d MM |
4522 | if (TYPE_PTRMEM_P (type)) |
4523 | { | |
a5ac359a MM |
4524 | tree delta; |
4525 | ||
3fe18f1d MM |
4526 | if (TREE_CODE (expr) == PTRMEM_CST) |
4527 | expr = cplus_expand_constant (expr); | |
a5ac359a MM |
4528 | delta = get_delta_difference (c1, c2, /*force=*/1); |
4529 | if (!integer_zerop (delta)) | |
4530 | expr = cp_build_binary_op (PLUS_EXPR, | |
4531 | build_nop (ptrdiff_type_node, expr), | |
4532 | delta); | |
3fe18f1d MM |
4533 | return build_nop (type, expr); |
4534 | } | |
4535 | else | |
4536 | return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr, | |
4537 | /*force=*/1); | |
4538 | } | |
4539 | } | |
4540 | ||
af7b9902 MM |
4541 | /* [expr.static.cast] |
4542 | ||
3fe18f1d MM |
4543 | An rvalue of type "pointer to cv void" can be explicitly |
4544 | converted to a pointer to object type. A value of type pointer | |
4545 | to object converted to "pointer to cv void" and back to the | |
4546 | original pointer type will have its original value. */ | |
4547 | if (TREE_CODE (intype) == POINTER_TYPE | |
4548 | && VOID_TYPE_P (TREE_TYPE (intype)) | |
4549 | && TYPE_PTROB_P (type)) | |
af7b9902 | 4550 | { |
a5ac359a | 4551 | check_for_casting_away_constness (intype, type, "static_cast"); |
3fe18f1d | 4552 | return build_nop (type, expr); |
af7b9902 MM |
4553 | } |
4554 | ||
33bd39a2 | 4555 | error ("invalid static_cast from type `%T' to type `%T'", intype, type); |
c11b6f21 | 4556 | return error_mark_node; |
a4443a08 MS |
4557 | } |
4558 | ||
cdf5b885 | 4559 | tree |
acd8e2d0 | 4560 | build_reinterpret_cast (tree type, tree expr) |
a4443a08 | 4561 | { |
c11b6f21 MS |
4562 | tree intype; |
4563 | ||
4564 | if (type == error_mark_node || expr == error_mark_node) | |
4565 | return error_mark_node; | |
4566 | ||
5156628f | 4567 | if (processing_template_decl) |
5566b478 | 4568 | { |
2a1e9fdd | 4569 | tree t = build_min (REINTERPRET_CAST_EXPR, type, expr); |
5566b478 MS |
4570 | return t; |
4571 | } | |
4572 | ||
c11b6f21 MS |
4573 | if (TREE_CODE (type) != REFERENCE_TYPE) |
4574 | { | |
4575 | expr = decay_conversion (expr); | |
4576 | ||
4577 | /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue. | |
4578 | Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */ | |
4579 | if (TREE_CODE (expr) == NOP_EXPR | |
4580 | && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0))) | |
4581 | expr = TREE_OPERAND (expr, 0); | |
4582 | } | |
4583 | ||
c11b6f21 | 4584 | intype = TREE_TYPE (expr); |
a80e4195 | 4585 | |
c11b6f21 MS |
4586 | if (TREE_CODE (type) == REFERENCE_TYPE) |
4587 | { | |
4588 | if (! real_lvalue_p (expr)) | |
4589 | { | |
33bd39a2 | 4590 | error ("invalid reinterpret_cast of an rvalue expression of type `%T' to type `%T'", intype, type); |
c11b6f21 MS |
4591 | return error_mark_node; |
4592 | } | |
4593 | expr = build_unary_op (ADDR_EXPR, expr, 0); | |
4594 | if (expr != error_mark_node) | |
4595 | expr = build_reinterpret_cast | |
4596 | (build_pointer_type (TREE_TYPE (type)), expr); | |
4597 | if (expr != error_mark_node) | |
4598 | expr = build_indirect_ref (expr, 0); | |
4599 | return expr; | |
4600 | } | |
9edc3913 | 4601 | else if (same_type_ignoring_top_level_qualifiers_p (intype, type)) |
c11b6f21 | 4602 | return build_static_cast (type, expr); |
8ccc31eb | 4603 | |
c11b6f21 MS |
4604 | if (TYPE_PTR_P (type) && (TREE_CODE (intype) == INTEGER_TYPE |
4605 | || TREE_CODE (intype) == ENUMERAL_TYPE)) | |
4606 | /* OK */; | |
4607 | else if (TREE_CODE (type) == INTEGER_TYPE && TYPE_PTR_P (intype)) | |
8ccc31eb | 4608 | { |
c11b6f21 | 4609 | if (TYPE_PRECISION (type) < TYPE_PRECISION (intype)) |
33bd39a2 | 4610 | pedwarn ("reinterpret_cast from `%T' to `%T' loses precision", |
c11b6f21 | 4611 | intype, type); |
8ccc31eb | 4612 | } |
c11b6f21 MS |
4613 | else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype)) |
4614 | || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype))) | |
8ccc31eb | 4615 | { |
fc611ce0 | 4616 | expr = decl_constant_value (expr); |
c11b6f21 | 4617 | return fold (build1 (NOP_EXPR, type, expr)); |
8ccc31eb | 4618 | } |
c11b6f21 MS |
4619 | else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype)) |
4620 | || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype))) | |
8ccc31eb | 4621 | { |
a5ac359a | 4622 | check_for_casting_away_constness (intype, type, "reinterpret_cast"); |
fc611ce0 | 4623 | expr = decl_constant_value (expr); |
c11b6f21 | 4624 | return fold (build1 (NOP_EXPR, type, expr)); |
8ccc31eb | 4625 | } |
ffb690bd | 4626 | else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype)) |
a06d48ef | 4627 | || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type))) |
ffb690bd | 4628 | { |
7e4d7898 | 4629 | pedwarn ("ISO C++ forbids casting between pointer-to-function and pointer-to-object"); |
fc611ce0 | 4630 | expr = decl_constant_value (expr); |
ffb690bd JM |
4631 | return fold (build1 (NOP_EXPR, type, expr)); |
4632 | } | |
c11b6f21 | 4633 | else |
8ccc31eb | 4634 | { |
33bd39a2 | 4635 | error ("invalid reinterpret_cast from type `%T' to type `%T'", |
7e4d7898 | 4636 | intype, type); |
8ccc31eb MS |
4637 | return error_mark_node; |
4638 | } | |
c11b6f21 | 4639 | |
37c46b43 | 4640 | return cp_convert (type, expr); |
a4443a08 MS |
4641 | } |
4642 | ||
cdf5b885 | 4643 | tree |
acd8e2d0 | 4644 | build_const_cast (tree type, tree expr) |
a4443a08 | 4645 | { |
c11b6f21 | 4646 | tree intype; |
8ccc31eb | 4647 | |
f30432d7 MS |
4648 | if (type == error_mark_node || expr == error_mark_node) |
4649 | return error_mark_node; | |
4650 | ||
5156628f | 4651 | if (processing_template_decl) |
e92cc029 | 4652 | { |
2a1e9fdd | 4653 | tree t = build_min (CONST_CAST_EXPR, type, expr); |
e92cc029 MS |
4654 | return t; |
4655 | } | |
4656 | ||
2f8ec491 | 4657 | if (!POINTER_TYPE_P (type)) |
33bd39a2 | 4658 | error ("invalid use of const_cast with type `%T', which is not a pointer, reference, nor a pointer-to-data-member type", type); |
2f8ec491 MM |
4659 | else if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE) |
4660 | { | |
33bd39a2 | 4661 | error ("invalid use of const_cast with type `%T', which is a pointer or reference to a function type", type); |
3fd91cbd MM |
4662 | return error_mark_node; |
4663 | } | |
4664 | ||
c11b6f21 | 4665 | if (TREE_CODE (type) != REFERENCE_TYPE) |
8ccc31eb | 4666 | { |
c11b6f21 MS |
4667 | expr = decay_conversion (expr); |
4668 | ||
4669 | /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue. | |
4670 | Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */ | |
4671 | if (TREE_CODE (expr) == NOP_EXPR | |
4672 | && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0))) | |
4673 | expr = TREE_OPERAND (expr, 0); | |
8ccc31eb MS |
4674 | } |
4675 | ||
c11b6f21 | 4676 | intype = TREE_TYPE (expr); |
9edc3913 MM |
4677 | |
4678 | if (same_type_ignoring_top_level_qualifiers_p (intype, type)) | |
c11b6f21 MS |
4679 | return build_static_cast (type, expr); |
4680 | else if (TREE_CODE (type) == REFERENCE_TYPE) | |
8ccc31eb | 4681 | { |
c11b6f21 | 4682 | if (! real_lvalue_p (expr)) |
8ccc31eb | 4683 | { |
33bd39a2 | 4684 | error ("invalid const_cast of an rvalue of type `%T' to type `%T'", intype, type); |
8ccc31eb MS |
4685 | return error_mark_node; |
4686 | } | |
8ccc31eb | 4687 | |
c11b6f21 | 4688 | if (comp_ptr_ttypes_const (TREE_TYPE (type), intype)) |
c2840dfb JM |
4689 | { |
4690 | expr = build_unary_op (ADDR_EXPR, expr, 0); | |
4691 | expr = build1 (NOP_EXPR, type, expr); | |
4692 | return convert_from_reference (expr); | |
4693 | } | |
8ccc31eb | 4694 | } |
a5ac359a MM |
4695 | else if (((TREE_CODE (type) == POINTER_TYPE |
4696 | && TREE_CODE (intype) == POINTER_TYPE) | |
4697 | || (TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))) | |
c11b6f21 | 4698 | && comp_ptr_ttypes_const (TREE_TYPE (type), TREE_TYPE (intype))) |
37c46b43 | 4699 | return cp_convert (type, expr); |
8ccc31eb | 4700 | |
33bd39a2 | 4701 | error ("invalid const_cast from type `%T' to type `%T'", intype, type); |
c11b6f21 | 4702 | return error_mark_node; |
a4443a08 MS |
4703 | } |
4704 | ||
6060a796 MS |
4705 | /* Build an expression representing a cast to type TYPE of expression EXPR. |
4706 | ||
4707 | ALLOW_NONCONVERTING is true if we should allow non-converting constructors | |
4708 | when doing the cast. */ | |
8d08fdba MS |
4709 | |
4710 | tree | |
acd8e2d0 | 4711 | build_c_cast (tree type, tree expr) |
8d08fdba MS |
4712 | { |
4713 | register tree value = expr; | |
e6e174e5 | 4714 | tree otype; |
8d08fdba MS |
4715 | |
4716 | if (type == error_mark_node || expr == error_mark_node) | |
4717 | return error_mark_node; | |
4718 | ||
0949f723 NS |
4719 | if (processing_template_decl) |
4720 | { | |
4721 | tree t = build_min (CAST_EXPR, type, | |
4722 | tree_cons (NULL_TREE, value, NULL_TREE)); | |
4723 | return t; | |
4724 | } | |
4725 | ||
8d08fdba | 4726 | /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue. |
8ccc31eb MS |
4727 | Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */ |
4728 | if (TREE_CODE (type) != REFERENCE_TYPE | |
4729 | && TREE_CODE (value) == NOP_EXPR | |
8d08fdba MS |
4730 | && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0))) |
4731 | value = TREE_OPERAND (value, 0); | |
4732 | ||
8d08fdba MS |
4733 | if (TREE_CODE (type) == ARRAY_TYPE) |
4734 | { | |
4735 | /* Allow casting from T1* to T2[] because Cfront allows it. | |
cab1f180 | 4736 | NIHCL uses it. It is not valid ISO C++ however. */ |
8d08fdba MS |
4737 | if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE) |
4738 | { | |
33bd39a2 | 4739 | pedwarn ("ISO C++ forbids casting to an array type `%T'", type); |
8d08fdba MS |
4740 | type = build_pointer_type (TREE_TYPE (type)); |
4741 | } | |
4742 | else | |
4743 | { | |
33bd39a2 | 4744 | error ("ISO C++ forbids casting to an array type `%T'", type); |
8d08fdba MS |
4745 | return error_mark_node; |
4746 | } | |
4747 | } | |
4748 | ||
a0a33927 MS |
4749 | if (TREE_CODE (type) == FUNCTION_TYPE |
4750 | || TREE_CODE (type) == METHOD_TYPE) | |
4751 | { | |
33bd39a2 | 4752 | error ("invalid cast to function type `%T'", type); |
a0a33927 MS |
4753 | return error_mark_node; |
4754 | } | |
4755 | ||
02cac427 NS |
4756 | if (TREE_CODE (type) == VOID_TYPE) |
4757 | { | |
4758 | /* Conversion to void does not cause any of the normal function to | |
4759 | * pointer, array to pointer and lvalue to rvalue decays. */ | |
4760 | ||
4761 | value = convert_to_void (value, /*implicit=*/NULL); | |
4762 | return value; | |
4763 | } | |
79b59cc3 MM |
4764 | |
4765 | if (!complete_type_or_else (type, NULL_TREE)) | |
4766 | return error_mark_node; | |
4767 | ||
e6e174e5 JM |
4768 | /* Convert functions and arrays to pointers and |
4769 | convert references to their expanded types, | |
4770 | but don't convert any other types. If, however, we are | |
4771 | casting to a class type, there's no reason to do this: the | |
4772 | cast will only succeed if there is a converting constructor, | |
4773 | and the default conversions will be done at that point. In | |
4774 | fact, doing the default conversion here is actually harmful | |
4775 | in cases like this: | |
4776 | ||
4777 | typedef int A[2]; | |
4778 | struct S { S(const A&); }; | |
4779 | ||
4780 | since we don't want the array-to-pointer conversion done. */ | |
4781 | if (!IS_AGGR_TYPE (type)) | |
4782 | { | |
4783 | if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE | |
4784 | || (TREE_CODE (TREE_TYPE (value)) == METHOD_TYPE | |
8d7f862c | 4785 | /* Don't do the default conversion on a ->* expression. */ |
e6e174e5 | 4786 | && ! (TREE_CODE (type) == POINTER_TYPE |
8d7f862c | 4787 | && bound_pmf_p (value))) |
e6e174e5 JM |
4788 | || TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE |
4789 | || TREE_CODE (TREE_TYPE (value)) == REFERENCE_TYPE) | |
0a72704b | 4790 | value = decay_conversion (value); |
e6e174e5 JM |
4791 | } |
4792 | else if (TREE_CODE (TREE_TYPE (value)) == REFERENCE_TYPE) | |
4793 | /* However, even for class types, we still need to strip away | |
4794 | the reference type, since the call to convert_force below | |
4795 | does not expect the input expression to be of reference | |
4796 | type. */ | |
4797 | value = convert_from_reference (value); | |
4785faf1 | 4798 | |
e6e174e5 JM |
4799 | otype = TREE_TYPE (value); |
4800 | ||
4801 | /* Optionally warn about potentially worrisome casts. */ | |
4802 | ||
4803 | if (warn_cast_qual | |
4804 | && TREE_CODE (type) == POINTER_TYPE | |
4805 | && TREE_CODE (otype) == POINTER_TYPE | |
4806 | && !at_least_as_qualified_p (TREE_TYPE (type), | |
4807 | TREE_TYPE (otype))) | |
33bd39a2 | 4808 | warning ("cast from `%T' to `%T' discards qualifiers from pointer target type", |
8be7ab5d | 4809 | otype, type); |
8d08fdba | 4810 | |
e6e174e5 | 4811 | if (TREE_CODE (type) == INTEGER_TYPE |
a5ac359a | 4812 | && TYPE_PTR_P (otype) |
e6e174e5 JM |
4813 | && TYPE_PRECISION (type) != TYPE_PRECISION (otype)) |
4814 | warning ("cast from pointer to integer of different size"); | |
4815 | ||
a5ac359a | 4816 | if (TYPE_PTR_P (type) |
e6e174e5 JM |
4817 | && TREE_CODE (otype) == INTEGER_TYPE |
4818 | && TYPE_PRECISION (type) != TYPE_PRECISION (otype) | |
bf061ee4 RH |
4819 | /* Don't warn about converting any constant. */ |
4820 | && !TREE_CONSTANT (value)) | |
e6e174e5 | 4821 | warning ("cast to pointer from integer of different size"); |
8d08fdba | 4822 | |
02cac427 | 4823 | if (TREE_CODE (type) == REFERENCE_TYPE) |
e6e174e5 JM |
4824 | value = (convert_from_reference |
4825 | (convert_to_reference (type, value, CONV_C_CAST, | |
4826 | LOOKUP_COMPLAIN, NULL_TREE))); | |
4827 | else | |
4828 | { | |
4829 | tree ovalue; | |
8ccc31eb | 4830 | |
fc611ce0 | 4831 | value = decl_constant_value (value); |
8ccc31eb | 4832 | |
e6e174e5 JM |
4833 | ovalue = value; |
4834 | value = convert_force (type, value, CONV_C_CAST); | |
8ccc31eb | 4835 | |
e6e174e5 JM |
4836 | /* Ignore any integer overflow caused by the cast. */ |
4837 | if (TREE_CODE (value) == INTEGER_CST) | |
4838 | { | |
4839 | TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue); | |
4840 | TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue); | |
8d08fdba MS |
4841 | } |
4842 | } | |
4843 | ||
8be7ab5d NS |
4844 | /* Warn about possible alignment problems. Do this here when we will have |
4845 | instantiated any necessary template types. */ | |
4846 | if (STRICT_ALIGNMENT && warn_cast_align | |
4847 | && TREE_CODE (type) == POINTER_TYPE | |
4848 | && TREE_CODE (otype) == POINTER_TYPE | |
4849 | && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE | |
4850 | && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE | |
d0f062fb NS |
4851 | && COMPLETE_TYPE_P (TREE_TYPE (otype)) |
4852 | && COMPLETE_TYPE_P (TREE_TYPE (type)) | |
8be7ab5d | 4853 | && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype))) |
33bd39a2 | 4854 | warning ("cast from `%T' to `%T' increases required alignment of target type", |
8be7ab5d NS |
4855 | otype, type); |
4856 | ||
8d08fdba | 4857 | /* Always produce some operator for an explicit cast, |
c11b6f21 MS |
4858 | so we can tell (for -pedantic) that the cast is no lvalue. */ |
4859 | if (TREE_CODE (type) != REFERENCE_TYPE && value == expr | |
4860 | && real_lvalue_p (value)) | |
8ccc31eb | 4861 | value = non_lvalue (value); |
8d08fdba MS |
4862 | |
4863 | return value; | |
4864 | } | |
4865 | \f | |
8d08fdba MS |
4866 | /* Build an assignment expression of lvalue LHS from value RHS. |
4867 | MODIFYCODE is the code for a binary operator that we use | |
4868 | to combine the old value of LHS with RHS to get the new value. | |
4869 | Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. | |
4870 | ||
e92cc029 MS |
4871 | C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */ |
4872 | ||
8d08fdba | 4873 | tree |
acd8e2d0 | 4874 | build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs) |
8d08fdba MS |
4875 | { |
4876 | register tree result; | |
4877 | tree newrhs = rhs; | |
4878 | tree lhstype = TREE_TYPE (lhs); | |
4879 | tree olhstype = lhstype; | |
a3203465 | 4880 | tree olhs = lhs; |
8d08fdba | 4881 | |
8d08fdba | 4882 | /* Avoid duplicate error messages from operands that had errors. */ |
bd6dd845 | 4883 | if (lhs == error_mark_node || rhs == error_mark_node) |
8d08fdba MS |
4884 | return error_mark_node; |
4885 | ||
8d08fdba | 4886 | /* Handle control structure constructs used as "lvalues". */ |
8d08fdba MS |
4887 | switch (TREE_CODE (lhs)) |
4888 | { | |
4889 | /* Handle --foo = 5; as these are valid constructs in C++ */ | |
4890 | case PREDECREMENT_EXPR: | |
4891 | case PREINCREMENT_EXPR: | |
4892 | if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))) | |
4893 | lhs = build (TREE_CODE (lhs), TREE_TYPE (lhs), | |
46b02c6d MS |
4894 | stabilize_reference (TREE_OPERAND (lhs, 0)), |
4895 | TREE_OPERAND (lhs, 1)); | |
8d08fdba MS |
4896 | return build (COMPOUND_EXPR, lhstype, |
4897 | lhs, | |
4898 | build_modify_expr (TREE_OPERAND (lhs, 0), | |
4899 | modifycode, rhs)); | |
4900 | ||
4901 | /* Handle (a, b) used as an "lvalue". */ | |
4902 | case COMPOUND_EXPR: | |
8d08fdba MS |
4903 | newrhs = build_modify_expr (TREE_OPERAND (lhs, 1), |
4904 | modifycode, rhs); | |
bd6dd845 | 4905 | if (newrhs == error_mark_node) |
8d08fdba MS |
4906 | return error_mark_node; |
4907 | return build (COMPOUND_EXPR, lhstype, | |
4908 | TREE_OPERAND (lhs, 0), newrhs); | |
4909 | ||
a4443a08 | 4910 | case MODIFY_EXPR: |
a65cddcf JM |
4911 | if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))) |
4912 | lhs = build (TREE_CODE (lhs), TREE_TYPE (lhs), | |
4913 | stabilize_reference (TREE_OPERAND (lhs, 0)), | |
4914 | TREE_OPERAND (lhs, 1)); | |
a4443a08 | 4915 | newrhs = build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs); |
bd6dd845 | 4916 | if (newrhs == error_mark_node) |
a4443a08 MS |
4917 | return error_mark_node; |
4918 | return build (COMPOUND_EXPR, lhstype, lhs, newrhs); | |
4919 | ||
8d08fdba MS |
4920 | /* Handle (a ? b : c) used as an "lvalue". */ |
4921 | case COND_EXPR: | |
8d08fdba MS |
4922 | { |
4923 | /* Produce (a ? (b = rhs) : (c = rhs)) | |
4924 | except that the RHS goes through a save-expr | |
4925 | so the code to compute it is only emitted once. */ | |
df39af7d | 4926 | tree cond; |
a77a9a18 | 4927 | tree preeval = NULL_TREE; |
df39af7d | 4928 | |
a77a9a18 | 4929 | rhs = stabilize_expr (rhs, &preeval); |
a56ca899 | 4930 | |
df39af7d JM |
4931 | /* Check this here to avoid odd errors when trying to convert |
4932 | a throw to the type of the COND_EXPR. */ | |
4933 | if (!lvalue_or_else (lhs, "assignment")) | |
4934 | return error_mark_node; | |
4935 | ||
4936 | cond = build_conditional_expr | |
4937 | (TREE_OPERAND (lhs, 0), | |
4938 | build_modify_expr (cp_convert (TREE_TYPE (lhs), | |
4939 | TREE_OPERAND (lhs, 1)), | |
4940 | modifycode, rhs), | |
4941 | build_modify_expr (cp_convert (TREE_TYPE (lhs), | |
4942 | TREE_OPERAND (lhs, 2)), | |
4943 | modifycode, rhs)); | |
4944 | ||
bd6dd845 | 4945 | if (cond == error_mark_node) |
8d08fdba MS |
4946 | return cond; |
4947 | /* Make sure the code to compute the rhs comes out | |
4948 | before the split. */ | |
a77a9a18 | 4949 | return build (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond); |
8d08fdba | 4950 | } |
a56ca899 | 4951 | |
7f85441b KG |
4952 | default: |
4953 | break; | |
8d08fdba MS |
4954 | } |
4955 | ||
8d08fdba MS |
4956 | if (modifycode == INIT_EXPR) |
4957 | { | |
f30efcb7 JM |
4958 | if (TREE_CODE (rhs) == CONSTRUCTOR) |
4959 | { | |
a56ca899 NS |
4960 | my_friendly_assert (same_type_p (TREE_TYPE (rhs), lhstype), |
4961 | 20011220); | |
f30efcb7 JM |
4962 | result = build (INIT_EXPR, lhstype, lhs, rhs); |
4963 | TREE_SIDE_EFFECTS (result) = 1; | |
4964 | return result; | |
4965 | } | |
4966 | else if (! IS_AGGR_TYPE (lhstype)) | |
db5ae43f | 4967 | /* Do the default thing */; |
db5ae43f | 4968 | else |
8d08fdba | 4969 | { |
4ba126e4 MM |
4970 | result = build_special_member_call (lhs, complete_ctor_identifier, |
4971 | build_tree_list (NULL_TREE, rhs), | |
4972 | TYPE_BINFO (lhstype), | |
4973 | LOOKUP_NORMAL); | |
8d08fdba MS |
4974 | if (result == NULL_TREE) |
4975 | return error_mark_node; | |
4976 | return result; | |
4977 | } | |
4978 | } | |
a56ca899 | 4979 | else |
8d08fdba | 4980 | { |
a56ca899 | 4981 | if (TREE_CODE (lhstype) == REFERENCE_TYPE) |
8d08fdba | 4982 | { |
a56ca899 NS |
4983 | lhs = convert_from_reference (lhs); |
4984 | olhstype = lhstype = TREE_TYPE (lhs); | |
8d08fdba | 4985 | } |
a56ca899 NS |
4986 | lhs = require_complete_type (lhs); |
4987 | if (lhs == error_mark_node) | |
4988 | return error_mark_node; | |
4989 | ||
4990 | if (modifycode == NOP_EXPR) | |
c91a56d2 | 4991 | { |
a56ca899 NS |
4992 | /* `operator=' is not an inheritable operator. */ |
4993 | if (! IS_AGGR_TYPE (lhstype)) | |
4994 | /* Do the default thing */; | |
4995 | else | |
4996 | { | |
14d22dd6 MM |
4997 | result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, |
4998 | lhs, rhs, make_node (NOP_EXPR)); | |
a56ca899 NS |
4999 | if (result == NULL_TREE) |
5000 | return error_mark_node; | |
5001 | return result; | |
5002 | } | |
5003 | lhstype = olhstype; | |
5004 | } | |
5005 | else | |
5006 | { | |
5007 | /* A binary op has been requested. Combine the old LHS | |
5008 | value with the RHS producing the value we should actually | |
5009 | store into the LHS. */ | |
5010 | ||
5011 | my_friendly_assert (!PROMOTES_TO_AGGR_TYPE (lhstype, REFERENCE_TYPE), | |
5012 | 978652); | |
5013 | lhs = stabilize_reference (lhs); | |
5014 | newrhs = cp_build_binary_op (modifycode, lhs, rhs); | |
5015 | if (newrhs == error_mark_node) | |
5016 | { | |
5017 | error (" in evaluation of `%Q(%#T, %#T)'", modifycode, | |
5018 | TREE_TYPE (lhs), TREE_TYPE (rhs)); | |
5019 | return error_mark_node; | |
5020 | } | |
5021 | ||
5022 | /* Now it looks like a plain assignment. */ | |
5023 | modifycode = NOP_EXPR; | |
c91a56d2 | 5024 | } |
a56ca899 NS |
5025 | my_friendly_assert (TREE_CODE (lhstype) != REFERENCE_TYPE, 20011220); |
5026 | my_friendly_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE, | |
5027 | 20011220); | |
8d08fdba MS |
5028 | } |
5029 | ||
5030 | /* Handle a cast used as an "lvalue". | |
5031 | We have already performed any binary operator using the value as cast. | |
5032 | Now convert the result to the cast type of the lhs, | |
5033 | and then true type of the lhs and store it there; | |
5034 | then convert result back to the cast type to be the value | |
5035 | of the assignment. */ | |
5036 | ||
5037 | switch (TREE_CODE (lhs)) | |
5038 | { | |
5039 | case NOP_EXPR: | |
5040 | case CONVERT_EXPR: | |
5041 | case FLOAT_EXPR: | |
5042 | case FIX_TRUNC_EXPR: | |
5043 | case FIX_FLOOR_EXPR: | |
5044 | case FIX_ROUND_EXPR: | |
5045 | case FIX_CEIL_EXPR: | |
8d08fdba MS |
5046 | { |
5047 | tree inner_lhs = TREE_OPERAND (lhs, 0); | |
5048 | tree result; | |
2ba25f50 | 5049 | |
a56ca899 NS |
5050 | if (TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE |
5051 | || TREE_CODE (TREE_TYPE (newrhs)) == FUNCTION_TYPE | |
5052 | || TREE_CODE (TREE_TYPE (newrhs)) == METHOD_TYPE | |
5053 | || TREE_CODE (TREE_TYPE (newrhs)) == OFFSET_TYPE) | |
0a72704b | 5054 | newrhs = decay_conversion (newrhs); |
a56ca899 | 5055 | |
cab1f180 ML |
5056 | /* ISO C++ 5.4/1: The result is an lvalue if T is a reference |
5057 | type, otherwise the result is an rvalue. */ | |
2ba25f50 | 5058 | if (! lvalue_p (lhs)) |
7e4d7898 | 5059 | pedwarn ("ISO C++ forbids cast to non-reference type used as lvalue"); |
a0a33927 | 5060 | |
8d08fdba | 5061 | result = build_modify_expr (inner_lhs, NOP_EXPR, |
37c46b43 MS |
5062 | cp_convert (TREE_TYPE (inner_lhs), |
5063 | cp_convert (lhstype, newrhs))); | |
bd6dd845 | 5064 | if (result == error_mark_node) |
8d08fdba | 5065 | return result; |
37c46b43 | 5066 | return cp_convert (TREE_TYPE (lhs), result); |
8d08fdba | 5067 | } |
7f85441b KG |
5068 | |
5069 | default: | |
5070 | break; | |
8d08fdba | 5071 | } |
8d08fdba MS |
5072 | |
5073 | /* Now we have handled acceptable kinds of LHS that are not truly lvalues. | |
5074 | Reject anything strange now. */ | |
5075 | ||
5076 | if (!lvalue_or_else (lhs, "assignment")) | |
5077 | return error_mark_node; | |
5078 | ||
a56ca899 NS |
5079 | /* Warn about modifying something that is `const'. Don't warn if |
5080 | this is initialization. */ | |
8d08fdba | 5081 | if (modifycode != INIT_EXPR |
91063b51 | 5082 | && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype) |
69851283 MM |
5083 | /* Functions are not modifiable, even though they are |
5084 | lvalues. */ | |
5085 | || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE | |
a56ca899 NS |
5086 | || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE |
5087 | /* If it's an aggregate and any field is const, then it is | |
5088 | effectively const. */ | |
5552b43c | 5089 | || (CLASS_TYPE_P (lhstype) |
a56ca899 | 5090 | && C_TYPE_FIELDS_READONLY (lhstype)))) |
8d08fdba MS |
5091 | readonly_error (lhs, "assignment", 0); |
5092 | ||
a56ca899 NS |
5093 | /* If storing into a structure or union member, it has probably been |
5094 | given type `int'. Compute the type that would go with the actual | |
5095 | amount of storage the member occupies. */ | |
8d08fdba MS |
5096 | |
5097 | if (TREE_CODE (lhs) == COMPONENT_REF | |
5098 | && (TREE_CODE (lhstype) == INTEGER_TYPE | |
5099 | || TREE_CODE (lhstype) == REAL_TYPE | |
5100 | || TREE_CODE (lhstype) == ENUMERAL_TYPE)) | |
a0a33927 MS |
5101 | { |
5102 | lhstype = TREE_TYPE (get_unwidened (lhs, 0)); | |
5103 | ||
5104 | /* If storing in a field that is in actuality a short or narrower | |
5105 | than one, we must store in the field in its actual type. */ | |
5106 | ||
5107 | if (lhstype != TREE_TYPE (lhs)) | |
5108 | { | |
5109 | lhs = copy_node (lhs); | |
5110 | TREE_TYPE (lhs) = lhstype; | |
5111 | } | |
5112 | } | |
8d08fdba | 5113 | |
8d08fdba MS |
5114 | /* Convert new value to destination type. */ |
5115 | ||
5116 | if (TREE_CODE (lhstype) == ARRAY_TYPE) | |
5117 | { | |
f376e137 MS |
5118 | int from_array; |
5119 | ||
985723ce JM |
5120 | if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype), |
5121 | TYPE_MAIN_VARIANT (TREE_TYPE (rhs)))) | |
44a8d0b3 | 5122 | { |
33bd39a2 | 5123 | error ("incompatible types in assignment of `%T' to `%T'", |
985723ce | 5124 | TREE_TYPE (rhs), lhstype); |
44a8d0b3 MS |
5125 | return error_mark_node; |
5126 | } | |
5127 | ||
39211cd5 | 5128 | /* Allow array assignment in compiler-generated code. */ |
a49cfba8 | 5129 | if (! DECL_ARTIFICIAL (current_function_decl)) |
7e4d7898 | 5130 | pedwarn ("ISO C++ forbids assignment of arrays"); |
39211cd5 | 5131 | |
f376e137 MS |
5132 | from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE |
5133 | ? 1 + (modifycode != INIT_EXPR): 0; | |
a48cccea | 5134 | return build_vec_init (lhs, NULL_TREE, newrhs, from_array); |
8d08fdba MS |
5135 | } |
5136 | ||
5137 | if (modifycode == INIT_EXPR) | |
a56ca899 NS |
5138 | newrhs = convert_for_initialization (lhs, lhstype, newrhs, LOOKUP_NORMAL, |
5139 | "initialization", NULL_TREE, 0); | |
8d08fdba MS |
5140 | else |
5141 | { | |
e92cc029 | 5142 | /* Avoid warnings on enum bit fields. */ |
8d08fdba MS |
5143 | if (TREE_CODE (olhstype) == ENUMERAL_TYPE |
5144 | && TREE_CODE (lhstype) == INTEGER_TYPE) | |
5145 | { | |
5146 | newrhs = convert_for_assignment (olhstype, newrhs, "assignment", | |
5147 | NULL_TREE, 0); | |
6060a796 | 5148 | newrhs = convert_force (lhstype, newrhs, 0); |
8d08fdba MS |
5149 | } |
5150 | else | |
5151 | newrhs = convert_for_assignment (lhstype, newrhs, "assignment", | |
b7484fbe MS |
5152 | NULL_TREE, 0); |
5153 | if (TREE_CODE (newrhs) == CALL_EXPR | |
5154 | && TYPE_NEEDS_CONSTRUCTING (lhstype)) | |
5566b478 | 5155 | newrhs = build_cplus_new (lhstype, newrhs); |
b7484fbe | 5156 | |
e8abc66f | 5157 | /* Can't initialize directly from a TARGET_EXPR, since that would |
07674418 MS |
5158 | cause the lhs to be constructed twice, and possibly result in |
5159 | accidental self-initialization. So we force the TARGET_EXPR to be | |
be99da77 | 5160 | expanded without a target. */ |
b7484fbe | 5161 | if (TREE_CODE (newrhs) == TARGET_EXPR) |
be99da77 | 5162 | newrhs = build (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs, |
a0128b67 | 5163 | TREE_OPERAND (newrhs, 0)); |
8d08fdba MS |
5164 | } |
5165 | ||
bd6dd845 | 5166 | if (newrhs == error_mark_node) |
8d08fdba MS |
5167 | return error_mark_node; |
5168 | ||
4a386498 MM |
5169 | result = build (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR, |
5170 | lhstype, lhs, newrhs); | |
2ee887f2 | 5171 | |
8d08fdba MS |
5172 | TREE_SIDE_EFFECTS (result) = 1; |
5173 | ||
5174 | /* If we got the LHS in a different type for storing in, | |
5175 | convert the result back to the nominal type of LHS | |
5176 | so that the value we return always has the same type | |
5177 | as the LHS argument. */ | |
5178 | ||
5179 | if (olhstype == TREE_TYPE (result)) | |
5180 | return result; | |
5181 | /* Avoid warnings converting integral types back into enums | |
e92cc029 | 5182 | for enum bit fields. */ |
8d08fdba MS |
5183 | if (TREE_CODE (TREE_TYPE (result)) == INTEGER_TYPE |
5184 | && TREE_CODE (olhstype) == ENUMERAL_TYPE) | |
a3203465 MS |
5185 | { |
5186 | result = build (COMPOUND_EXPR, olhstype, result, olhs); | |
5187 | TREE_NO_UNUSED_WARNING (result) = 1; | |
5188 | return result; | |
5189 | } | |
8d08fdba MS |
5190 | return convert_for_assignment (olhstype, result, "assignment", |
5191 | NULL_TREE, 0); | |
5192 | } | |
5193 | ||
5566b478 | 5194 | tree |
acd8e2d0 | 5195 | build_x_modify_expr (tree lhs, enum tree_code modifycode, tree rhs) |
5566b478 | 5196 | { |
5156628f | 5197 | if (processing_template_decl) |
5566b478 | 5198 | return build_min_nt (MODOP_EXPR, lhs, |
4dabb379 | 5199 | build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs); |
5566b478 MS |
5200 | |
5201 | if (modifycode != NOP_EXPR) | |
5202 | { | |
14d22dd6 MM |
5203 | tree rval = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs, |
5204 | make_node (modifycode)); | |
5566b478 MS |
5205 | if (rval) |
5206 | return rval; | |
5207 | } | |
5208 | return build_modify_expr (lhs, modifycode, rhs); | |
5209 | } | |
8d08fdba | 5210 | |
8d08fdba | 5211 | \f |
ddd5a7c1 | 5212 | /* Get difference in deltas for different pointer to member function |
7b6d72fc MM |
5213 | types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If |
5214 | the conversion is invalid, the constant is zero. If FORCE is true, | |
5215 | then allow reverse conversions as well. | |
3927874d JM |
5216 | |
5217 | Note that the naming of FROM and TO is kind of backwards; the return | |
5218 | value is what we add to a TO in order to get a FROM. They are named | |
5219 | this way because we call this function to find out how to convert from | |
5220 | a pointer to member of FROM to a pointer to member of TO. */ | |
e92cc029 | 5221 | |
51c184be | 5222 | static tree |
acd8e2d0 | 5223 | get_delta_difference (tree from, tree to, int force) |
51c184be | 5224 | { |
51c184be | 5225 | tree binfo; |
f9825168 | 5226 | tree virt_binfo; |
2db1ab2d | 5227 | base_kind kind; |
51c184be | 5228 | |
2db1ab2d NS |
5229 | binfo = lookup_base (to, from, ba_check, &kind); |
5230 | if (kind == bk_inaccessible || kind == bk_ambig) | |
51c184be | 5231 | { |
8251199e | 5232 | error (" in pointer to member function conversion"); |
7b6d72fc | 5233 | goto error; |
51c184be | 5234 | } |
2db1ab2d | 5235 | if (!binfo) |
51c184be MS |
5236 | { |
5237 | if (!force) | |
5238 | { | |
5239 | error_not_base_type (from, to); | |
8251199e | 5240 | error (" in pointer to member conversion"); |
7b6d72fc | 5241 | goto error; |
51c184be | 5242 | } |
2db1ab2d | 5243 | binfo = lookup_base (from, to, ba_check, &kind); |
7b6d72fc MM |
5244 | if (!binfo) |
5245 | goto error; | |
f9825168 | 5246 | virt_binfo = binfo_from_vbase (binfo); |
f9825168 | 5247 | if (virt_binfo) |
61402b80 | 5248 | { |
c6002625 | 5249 | /* This is a reinterpret cast, we choose to do nothing. */ |
dbbf88d1 NS |
5250 | warning ("pointer to member cast via virtual base `%T'", |
5251 | BINFO_TYPE (virt_binfo)); | |
7b6d72fc | 5252 | goto error; |
61402b80 | 5253 | } |
7b6d72fc MM |
5254 | return convert_to_integer (ptrdiff_type_node, |
5255 | size_diffop (size_zero_node, | |
5256 | BINFO_OFFSET (binfo))); | |
51c184be | 5257 | } |
32e02ee0 | 5258 | |
f9825168 | 5259 | virt_binfo = binfo_from_vbase (binfo); |
7b6d72fc MM |
5260 | if (!virt_binfo) |
5261 | return convert_to_integer (ptrdiff_type_node, BINFO_OFFSET (binfo)); | |
5262 | ||
5263 | /* This is a reinterpret cast, we choose to do nothing. */ | |
5264 | if (force) | |
5265 | warning ("pointer to member cast via virtual base `%T'", | |
5266 | BINFO_TYPE (virt_binfo)); | |
5267 | else | |
5268 | error ("pointer to member conversion via virtual base `%T'", | |
5269 | BINFO_TYPE (virt_binfo)); | |
32e02ee0 | 5270 | |
7b6d72fc MM |
5271 | error: |
5272 | return convert_to_integer(ptrdiff_type_node, integer_zero_node); | |
51c184be MS |
5273 | } |
5274 | ||
c7e266a6 MM |
5275 | /* Return a constructor for the pointer-to-member-function TYPE using |
5276 | the other components as specified. */ | |
5277 | ||
e08a8f45 | 5278 | tree |
acd8e2d0 | 5279 | build_ptrmemfunc1 (tree type, tree delta, tree pfn) |
594740f3 | 5280 | { |
f78c7bc6 | 5281 | tree u = NULL_TREE; |
c7e266a6 | 5282 | tree delta_field; |
c7e266a6 | 5283 | tree pfn_field; |
594740f3 | 5284 | |
c7e266a6 | 5285 | /* Pull the FIELD_DECLs out of the type. */ |
1f84ec23 MM |
5286 | pfn_field = TYPE_FIELDS (type); |
5287 | delta_field = TREE_CHAIN (pfn_field); | |
594740f3 | 5288 | |
c7e266a6 MM |
5289 | /* Make sure DELTA has the type we want. */ |
5290 | delta = convert_and_check (delta_type_node, delta); | |
594740f3 | 5291 | |
c7e266a6 | 5292 | /* Finish creating the initializer. */ |
18ae7f63 AO |
5293 | u = tree_cons (pfn_field, pfn, |
5294 | build_tree_list (delta_field, delta)); | |
dcf92453 | 5295 | u = build_constructor (type, u); |
530ec96d MM |
5296 | TREE_CONSTANT (u) = TREE_CONSTANT (pfn) && TREE_CONSTANT (delta); |
5297 | TREE_STATIC (u) = (TREE_CONSTANT (u) | |
5298 | && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn)) | |
5299 | != NULL_TREE) | |
5300 | && (initializer_constant_valid_p (delta, TREE_TYPE (delta)) | |
5301 | != NULL_TREE)); | |
594740f3 | 5302 | return u; |
594740f3 MS |
5303 | } |
5304 | ||
8d08fdba MS |
5305 | /* Build a constructor for a pointer to member function. It can be |
5306 | used to initialize global variables, local variable, or used | |
5307 | as a value in expressions. TYPE is the POINTER to METHOD_TYPE we | |
5308 | want to be. | |
5309 | ||
838dfd8a | 5310 | If FORCE is nonzero, then force this conversion, even if |
8d08fdba | 5311 | we would rather not do it. Usually set when using an explicit |
51c184be MS |
5312 | cast. |
5313 | ||
5314 | Return error_mark_node, if something goes wrong. */ | |
8d08fdba MS |
5315 | |
5316 | tree | |
acd8e2d0 | 5317 | build_ptrmemfunc (tree type, tree pfn, int force) |
8d08fdba | 5318 | { |
e08a8f45 | 5319 | tree fn; |
7993382e MM |
5320 | tree pfn_type; |
5321 | tree to_type; | |
5322 | ||
5323 | if (error_operand_p (pfn)) | |
5324 | return error_mark_node; | |
5325 | ||
5326 | pfn_type = TREE_TYPE (pfn); | |
5327 | to_type = build_ptrmemfunc_type (type); | |
b928a651 | 5328 | |
e92cc029 | 5329 | /* Handle multiple conversions of pointer to member functions. */ |
7993382e | 5330 | if (TYPE_PTRMEMFUNC_P (pfn_type)) |
8d08fdba | 5331 | { |
530ec96d | 5332 | tree delta = NULL_TREE; |
7133357a | 5333 | tree npfn = NULL_TREE; |
1f84ec23 | 5334 | tree n; |
594740f3 | 5335 | |
b928a651 MM |
5336 | if (!force |
5337 | && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn)) | |
33bd39a2 | 5338 | error ("invalid conversion to type `%T' from type `%T'", |
b928a651 | 5339 | to_type, pfn_type); |
9ca21c0a | 5340 | |
3f2b640a JM |
5341 | n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type), |
5342 | TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type), | |
5343 | force); | |
5344 | ||
c7e266a6 MM |
5345 | /* We don't have to do any conversion to convert a |
5346 | pointer-to-member to its own type. But, we don't want to | |
5347 | just return a PTRMEM_CST if there's an explicit cast; that | |
5348 | cast should make the expression an invalid template argument. */ | |
3f2b640a JM |
5349 | if (TREE_CODE (pfn) != PTRMEM_CST) |
5350 | { | |
5351 | if (same_type_p (to_type, pfn_type)) | |
5352 | return pfn; | |
5353 | else if (integer_zerop (n)) | |
5354 | return build_reinterpret_cast (to_type, pfn); | |
5355 | } | |
c7e266a6 | 5356 | |
7def1251 JM |
5357 | if (TREE_SIDE_EFFECTS (pfn)) |
5358 | pfn = save_expr (pfn); | |
5359 | ||
530ec96d MM |
5360 | /* Obtain the function pointer and the current DELTA. */ |
5361 | if (TREE_CODE (pfn) == PTRMEM_CST) | |
18ae7f63 | 5362 | expand_ptrmemfunc_cst (pfn, &delta, &npfn); |
530ec96d MM |
5363 | else |
5364 | { | |
50ad9642 MM |
5365 | npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier); |
5366 | delta = build_ptrmemfunc_access_expr (pfn, delta_identifier); | |
530ec96d MM |
5367 | } |
5368 | ||
3461fba7 | 5369 | /* Just adjust the DELTA field. */ |
7b6d72fc | 5370 | my_friendly_assert (TREE_TYPE (delta) == ptrdiff_type_node, 20030727); |
cb7fdde2 AO |
5371 | if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta) |
5372 | n = cp_build_binary_op (LSHIFT_EXPR, n, integer_one_node); | |
1f84ec23 | 5373 | delta = cp_build_binary_op (PLUS_EXPR, delta, n); |
18ae7f63 | 5374 | return build_ptrmemfunc1 (to_type, delta, npfn); |
8d08fdba | 5375 | } |
51c184be | 5376 | |
e92cc029 | 5377 | /* Handle null pointer to member function conversions. */ |
51c184be MS |
5378 | if (integer_zerop (pfn)) |
5379 | { | |
faf5394a | 5380 | pfn = build_c_cast (type, integer_zero_node); |
b928a651 | 5381 | return build_ptrmemfunc1 (to_type, |
1f84ec23 | 5382 | integer_zero_node, |
18ae7f63 | 5383 | pfn); |
51c184be MS |
5384 | } |
5385 | ||
e6e174e5 | 5386 | if (type_unknown_p (pfn)) |
c2ea3a40 | 5387 | return instantiate_type (type, pfn, tf_error | tf_warning); |
a0a33927 | 5388 | |
e08a8f45 MM |
5389 | fn = TREE_OPERAND (pfn, 0); |
5390 | my_friendly_assert (TREE_CODE (fn) == FUNCTION_DECL, 0); | |
b928a651 | 5391 | return make_ptrmem_cst (to_type, fn); |
e08a8f45 | 5392 | } |
8d08fdba | 5393 | |
18ae7f63 | 5394 | /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST |
fed3cef0 RK |
5395 | given by CST. |
5396 | ||
5397 | ??? There is no consistency as to the types returned for the above | |
5398 | values. Some code acts as if its a sizetype and some as if its | |
5399 | integer_type_node. */ | |
8d08fdba | 5400 | |
e08a8f45 | 5401 | void |
acd8e2d0 | 5402 | expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn) |
e08a8f45 MM |
5403 | { |
5404 | tree type = TREE_TYPE (cst); | |
5405 | tree fn = PTRMEM_CST_MEMBER (cst); | |
3927874d | 5406 | tree ptr_class, fn_class; |
8d08fdba | 5407 | |
e08a8f45 | 5408 | my_friendly_assert (TREE_CODE (fn) == FUNCTION_DECL, 0); |
3927874d JM |
5409 | |
5410 | /* The class that the function belongs to. */ | |
4f1c5b7d | 5411 | fn_class = DECL_CONTEXT (fn); |
3927874d JM |
5412 | |
5413 | /* The class that we're creating a pointer to member of. */ | |
5414 | ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type); | |
5415 | ||
5416 | /* First, calculate the adjustment to the function's class. */ | |
5417 | *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0); | |
5418 | ||
e08a8f45 | 5419 | if (!DECL_VIRTUAL_P (fn)) |
18ae7f63 | 5420 | *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn)); |
8d08fdba | 5421 | else |
51c184be | 5422 | { |
3927874d JM |
5423 | /* If we're dealing with a virtual function, we have to adjust 'this' |
5424 | again, to point to the base which provides the vtable entry for | |
5425 | fn; the call will do the opposite adjustment. */ | |
e93ee644 | 5426 | tree orig_class = DECL_CONTEXT (fn); |
3927874d | 5427 | tree binfo = binfo_or_else (orig_class, fn_class); |
fed3cef0 RK |
5428 | *delta = fold (build (PLUS_EXPR, TREE_TYPE (*delta), |
5429 | *delta, BINFO_OFFSET (binfo))); | |
3927874d | 5430 | |
3461fba7 NS |
5431 | /* We set PFN to the vtable offset at which the function can be |
5432 | found, plus one (unless ptrmemfunc_vbit_in_delta, in which | |
5433 | case delta is shifted left, and then incremented). */ | |
cb7fdde2 | 5434 | *pfn = DECL_VINDEX (fn); |
eb2d0614 AO |
5435 | *pfn = fold (build (MULT_EXPR, integer_type_node, *pfn, |
5436 | TYPE_SIZE_UNIT (vtable_entry_type))); | |
cb7fdde2 AO |
5437 | |
5438 | switch (TARGET_PTRMEMFUNC_VBIT_LOCATION) | |
5439 | { | |
5440 | case ptrmemfunc_vbit_in_pfn: | |
cb7fdde2 AO |
5441 | *pfn = fold (build (PLUS_EXPR, integer_type_node, *pfn, |
5442 | integer_one_node)); | |
5443 | break; | |
5444 | ||
5445 | case ptrmemfunc_vbit_in_delta: | |
5446 | *delta = fold (build (LSHIFT_EXPR, TREE_TYPE (*delta), | |
5447 | *delta, integer_one_node)); | |
5448 | *delta = fold (build (PLUS_EXPR, TREE_TYPE (*delta), | |
5449 | *delta, integer_one_node)); | |
5450 | break; | |
5451 | ||
5452 | default: | |
5453 | abort (); | |
5454 | } | |
5455 | ||
1f84ec23 MM |
5456 | *pfn = fold (build1 (NOP_EXPR, TYPE_PTRMEMFUNC_FN_TYPE (type), |
5457 | *pfn)); | |
e08a8f45 MM |
5458 | } |
5459 | } | |
8d08fdba | 5460 | |
e08a8f45 MM |
5461 | /* Return an expression for PFN from the pointer-to-member function |
5462 | given by T. */ | |
5463 | ||
5464 | tree | |
acd8e2d0 | 5465 | pfn_from_ptrmemfunc (tree t) |
e08a8f45 MM |
5466 | { |
5467 | if (TREE_CODE (t) == PTRMEM_CST) | |
5468 | { | |
5469 | tree delta; | |
e08a8f45 | 5470 | tree pfn; |
e08a8f45 | 5471 | |
18ae7f63 | 5472 | expand_ptrmemfunc_cst (t, &delta, &pfn); |
e08a8f45 MM |
5473 | if (pfn) |
5474 | return pfn; | |
51c184be | 5475 | } |
8d08fdba | 5476 | |
50ad9642 | 5477 | return build_ptrmemfunc_access_expr (t, pfn_identifier); |
8d08fdba MS |
5478 | } |
5479 | ||
c3f08228 NS |
5480 | /* Expression EXPR is about to be implicitly converted to TYPE. Warn |
5481 | if this is a potentially dangerous thing to do. Returns a possibly | |
5482 | marked EXPR. */ | |
5483 | ||
5484 | tree | |
acd8e2d0 NS |
5485 | dubious_conversion_warnings (tree type, tree expr, |
5486 | const char *errtype, tree fndecl, int parmnum) | |
c3f08228 | 5487 | { |
ee76b931 | 5488 | type = non_reference (type); |
55df0175 | 5489 | |
0e339752 | 5490 | /* Issue warnings about peculiar, but valid, uses of NULL. */ |
c3f08228 NS |
5491 | if (ARITHMETIC_TYPE_P (type) && expr == null_node) |
5492 | { | |
5493 | if (fndecl) | |
33bd39a2 | 5494 | warning ("passing NULL used for non-pointer %s %P of `%D'", |
c3f08228 NS |
5495 | errtype, parmnum, fndecl); |
5496 | else | |
33bd39a2 | 5497 | warning ("%s to non-pointer type `%T' from NULL", errtype, type); |
c3f08228 NS |
5498 | } |
5499 | ||
5500 | /* Warn about assigning a floating-point type to an integer type. */ | |
5501 | if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE | |
5502 | && TREE_CODE (type) == INTEGER_TYPE) | |
5503 | { | |
5504 | if (fndecl) | |
33bd39a2 | 5505 | warning ("passing `%T' for %s %P of `%D'", |
c3f08228 NS |
5506 | TREE_TYPE (expr), errtype, parmnum, fndecl); |
5507 | else | |
33bd39a2 | 5508 | warning ("%s to `%T' from `%T'", errtype, type, TREE_TYPE (expr)); |
c3f08228 NS |
5509 | } |
5510 | /* And warn about assigning a negative value to an unsigned | |
5511 | variable. */ | |
5512 | else if (TREE_UNSIGNED (type) && TREE_CODE (type) != BOOLEAN_TYPE) | |
5513 | { | |
5514 | if (TREE_CODE (expr) == INTEGER_CST | |
5515 | && TREE_NEGATED_INT (expr)) | |
5516 | { | |
5517 | if (fndecl) | |
33bd39a2 | 5518 | warning ("passing negative value `%E' for %s %P of `%D'", |
c3f08228 NS |
5519 | expr, errtype, parmnum, fndecl); |
5520 | else | |
33bd39a2 | 5521 | warning ("%s of negative value `%E' to `%T'", |
c3f08228 NS |
5522 | errtype, expr, type); |
5523 | } | |
44475138 | 5524 | |
e36308b0 | 5525 | overflow_warning (expr); |
44475138 | 5526 | |
c3f08228 NS |
5527 | if (TREE_CONSTANT (expr)) |
5528 | expr = fold (expr); | |
5529 | } | |
5530 | return expr; | |
5531 | } | |
5532 | ||
a7a64a77 MM |
5533 | /* Convert value RHS to type TYPE as preparation for an assignment to |
5534 | an lvalue of type TYPE. ERRTYPE is a string to use in error | |
5535 | messages: "assignment", "return", etc. If FNDECL is non-NULL, we | |
5536 | are doing the conversion in order to pass the PARMNUMth argument of | |
5537 | FNDECL. */ | |
8d08fdba MS |
5538 | |
5539 | static tree | |
acd8e2d0 NS |
5540 | convert_for_assignment (tree type, tree rhs, |
5541 | const char *errtype, tree fndecl, int parmnum) | |
8d08fdba | 5542 | { |
8d08fdba | 5543 | register tree rhstype; |
a359be75 | 5544 | register enum tree_code coder; |
8d08fdba | 5545 | |
8d08fdba MS |
5546 | /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */ |
5547 | if (TREE_CODE (rhs) == NON_LVALUE_EXPR) | |
5548 | rhs = TREE_OPERAND (rhs, 0); | |
5549 | ||
a7a64a77 MM |
5550 | rhstype = TREE_TYPE (rhs); |
5551 | coder = TREE_CODE (rhstype); | |
5552 | ||
7d149679 AH |
5553 | if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE |
5554 | && ((*targetm.vector_opaque_p) (type) | |
5555 | || (*targetm.vector_opaque_p) (rhstype))) | |
5556 | return convert (type, rhs); | |
5557 | ||
a7a64a77 | 5558 | if (rhs == error_mark_node || rhstype == error_mark_node) |
8d08fdba | 5559 | return error_mark_node; |
2c73f9f5 | 5560 | if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node) |
8d08fdba MS |
5561 | return error_mark_node; |
5562 | ||
c3f08228 | 5563 | rhs = dubious_conversion_warnings (type, rhs, errtype, fndecl, parmnum); |
a359be75 | 5564 | |
a7a64a77 | 5565 | /* The RHS of an assignment cannot have void type. */ |
8d08fdba MS |
5566 | if (coder == VOID_TYPE) |
5567 | { | |
8251199e | 5568 | error ("void value not ignored as it ought to be"); |
8d08fdba MS |
5569 | return error_mark_node; |
5570 | } | |
8d08fdba | 5571 | |
a7a64a77 MM |
5572 | /* Simplify the RHS if possible. */ |
5573 | if (TREE_CODE (rhs) == CONST_DECL) | |
5574 | rhs = DECL_INITIAL (rhs); | |
c17707f1 MM |
5575 | |
5576 | /* We do not use decl_constant_value here because of this case: | |
5577 | ||
5578 | const char* const s = "s"; | |
5579 | ||
5580 | The conversion rules for a string literal are more lax than for a | |
5581 | variable; in particular, a string literal can be converted to a | |
5582 | "char *" but the variable "s" cannot be converted in the same | |
5583 | way. If the conversion is allowed, the optimization should be | |
5584 | performed while creating the converted expression. */ | |
e1cd6e56 | 5585 | |
a7a64a77 MM |
5586 | /* [expr.ass] |
5587 | ||
5588 | The expression is implicitly converted (clause _conv_) to the | |
72a08131 JM |
5589 | cv-unqualified type of the left operand. |
5590 | ||
5591 | We allow bad conversions here because by the time we get to this point | |
5592 | we are committed to doing the conversion. If we end up doing a bad | |
5593 | conversion, convert_like will complain. */ | |
5594 | if (!can_convert_arg_bad (type, rhstype, rhs)) | |
a7a64a77 | 5595 | { |
32facac8 | 5596 | /* When -Wno-pmf-conversions is use, we just silently allow |
a7a64a77 MM |
5597 | conversions from pointers-to-members to plain pointers. If |
5598 | the conversion doesn't work, cp_convert will complain. */ | |
5599 | if (!warn_pmf2ptr | |
5600 | && TYPE_PTR_P (type) | |
5601 | && TYPE_PTRMEMFUNC_P (rhstype)) | |
5602 | rhs = cp_convert (strip_top_quals (type), rhs); | |
72a08131 | 5603 | else |
32facac8 ML |
5604 | { |
5605 | /* If the right-hand side has unknown type, then it is an | |
5606 | overloaded function. Call instantiate_type to get error | |
5607 | messages. */ | |
5608 | if (rhstype == unknown_type_node) | |
c2ea3a40 | 5609 | instantiate_type (type, rhs, tf_error | tf_warning); |
32facac8 | 5610 | else if (fndecl) |
33bd39a2 | 5611 | error ("cannot convert `%T' to `%T' for argument `%P' to `%D'", |
32facac8 ML |
5612 | rhstype, type, parmnum, fndecl); |
5613 | else | |
33bd39a2 | 5614 | error ("cannot convert `%T' to `%T' in %s", rhstype, type, |
32facac8 ML |
5615 | errtype); |
5616 | return error_mark_node; | |
5617 | } | |
51c184be | 5618 | } |
4143af33 | 5619 | return perform_implicit_conversion (strip_top_quals (type), rhs); |
8d08fdba MS |
5620 | } |
5621 | ||
56ae6d77 | 5622 | /* Convert RHS to be of type TYPE. |
838dfd8a | 5623 | If EXP is nonzero, it is the target of the initialization. |
8d08fdba MS |
5624 | ERRTYPE is a string to use in error messages. |
5625 | ||
5626 | Two major differences between the behavior of | |
5627 | `convert_for_assignment' and `convert_for_initialization' | |
5628 | are that references are bashed in the former, while | |
5629 | copied in the latter, and aggregates are assigned in | |
5630 | the former (operator=) while initialized in the | |
5631 | latter (X(X&)). | |
5632 | ||
5633 | If using constructor make sure no conversion operator exists, if one does | |
878cd289 MS |
5634 | exist, an ambiguity exists. |
5635 | ||
5636 | If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */ | |
e92cc029 | 5637 | |
8d08fdba | 5638 | tree |
acd8e2d0 NS |
5639 | convert_for_initialization (tree exp, tree type, tree rhs, int flags, |
5640 | const char *errtype, tree fndecl, int parmnum) | |
8d08fdba MS |
5641 | { |
5642 | register enum tree_code codel = TREE_CODE (type); | |
5643 | register tree rhstype; | |
5644 | register enum tree_code coder; | |
5645 | ||
5646 | /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue. | |
5647 | Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */ | |
5648 | if (TREE_CODE (rhs) == NOP_EXPR | |
a0a33927 MS |
5649 | && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0)) |
5650 | && codel != REFERENCE_TYPE) | |
8d08fdba MS |
5651 | rhs = TREE_OPERAND (rhs, 0); |
5652 | ||
5653 | if (rhs == error_mark_node | |
5654 | || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)) | |
5655 | return error_mark_node; | |
5656 | ||
8ccc31eb MS |
5657 | if (TREE_CODE (TREE_TYPE (rhs)) == REFERENCE_TYPE) |
5658 | rhs = convert_from_reference (rhs); | |
5659 | ||
8d08fdba | 5660 | if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE |
8ccc31eb MS |
5661 | && TREE_CODE (type) != ARRAY_TYPE |
5662 | && (TREE_CODE (type) != REFERENCE_TYPE | |
5663 | || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE)) | |
59e76fc6 JM |
5664 | || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE |
5665 | && (TREE_CODE (type) != REFERENCE_TYPE | |
5666 | || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)) | |
8d08fdba | 5667 | || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE) |
0a72704b | 5668 | rhs = decay_conversion (rhs); |
8d08fdba MS |
5669 | |
5670 | rhstype = TREE_TYPE (rhs); | |
5671 | coder = TREE_CODE (rhstype); | |
5672 | ||
8d08fdba MS |
5673 | if (coder == ERROR_MARK) |
5674 | return error_mark_node; | |
5675 | ||
8d08fdba MS |
5676 | /* We accept references to incomplete types, so we can |
5677 | return here before checking if RHS is of complete type. */ | |
5678 | ||
5679 | if (codel == REFERENCE_TYPE) | |
2986ae00 MS |
5680 | { |
5681 | /* This should eventually happen in convert_arguments. */ | |
a703fb38 | 5682 | int savew = 0, savee = 0; |
2986ae00 MS |
5683 | |
5684 | if (fndecl) | |
5685 | savew = warningcount, savee = errorcount; | |
7e99327d MM |
5686 | rhs = initialize_reference (type, rhs, /*decl=*/NULL_TREE, |
5687 | /*cleanup=*/NULL); | |
2986ae00 MS |
5688 | if (fndecl) |
5689 | { | |
5690 | if (warningcount > savew) | |
8251199e | 5691 | cp_warning_at ("in passing argument %P of `%+D'", parmnum, fndecl); |
2986ae00 | 5692 | else if (errorcount > savee) |
8251199e | 5693 | cp_error_at ("in passing argument %P of `%+D'", parmnum, fndecl); |
2986ae00 MS |
5694 | } |
5695 | return rhs; | |
5696 | } | |
8d08fdba | 5697 | |
66543169 NS |
5698 | if (exp != 0) |
5699 | exp = require_complete_type (exp); | |
8d08fdba MS |
5700 | if (exp == error_mark_node) |
5701 | return error_mark_node; | |
5702 | ||
ee76b931 | 5703 | rhstype = non_reference (rhstype); |
8d08fdba | 5704 | |
6467930b MS |
5705 | type = complete_type (type); |
5706 | ||
7bae46f4 | 5707 | if (IS_AGGR_TYPE (type)) |
277294d7 | 5708 | return ocp_convert (type, rhs, CONV_IMPLICIT|CONV_FORCE_TEMP, flags); |
8d08fdba | 5709 | |
8d08fdba MS |
5710 | return convert_for_assignment (type, rhs, errtype, fndecl, parmnum); |
5711 | } | |
5712 | \f | |
5713 | /* Expand an ASM statement with operands, handling output operands | |
5714 | that are not variables or INDIRECT_REFS by transforming such | |
5715 | cases into cases that expand_asm_operands can handle. | |
5716 | ||
5717 | Arguments are same as for expand_asm_operands. | |
5718 | ||
5719 | We don't do default conversions on all inputs, because it can screw | |
5720 | up operands that are expected to be in memory. */ | |
5721 | ||
5722 | void | |
acd8e2d0 NS |
5723 | c_expand_asm_operands (tree string, tree outputs, tree inputs, tree clobbers, |
5724 | int vol, const char *filename, int line) | |
8d08fdba MS |
5725 | { |
5726 | int noutputs = list_length (outputs); | |
5727 | register int i; | |
5728 | /* o[I] is the place that output number I should be written. */ | |
c68b0a84 | 5729 | register tree *o = alloca (noutputs * sizeof (tree)); |
8d08fdba MS |
5730 | register tree tail; |
5731 | ||
5732 | /* Record the contents of OUTPUTS before it is modified. */ | |
5733 | for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++) | |
5734 | o[i] = TREE_VALUE (tail); | |
5735 | ||
5736 | /* Generate the ASM_OPERANDS insn; | |
5737 | store into the TREE_VALUEs of OUTPUTS some trees for | |
5738 | where the values were actually stored. */ | |
5739 | expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line); | |
5740 | ||
5741 | /* Copy all the intermediate outputs into the specified outputs. */ | |
5742 | for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++) | |
5743 | { | |
5744 | if (o[i] != TREE_VALUE (tail)) | |
5745 | { | |
5746 | expand_expr (build_modify_expr (o[i], NOP_EXPR, TREE_VALUE (tail)), | |
9f617717 | 5747 | const0_rtx, VOIDmode, EXPAND_NORMAL); |
8d08fdba | 5748 | free_temp_slots (); |
713f0303 RH |
5749 | |
5750 | /* Restore the original value so that it's correct the next | |
5751 | time we expand this function. */ | |
5752 | TREE_VALUE (tail) = o[i]; | |
8d08fdba MS |
5753 | } |
5754 | /* Detect modification of read-only values. | |
5755 | (Otherwise done by build_modify_expr.) */ | |
5756 | else | |
5757 | { | |
5758 | tree type = TREE_TYPE (o[i]); | |
28c56d25 NS |
5759 | if (type != error_mark_node |
5760 | && (CP_TYPE_CONST_P (type) | |
5552b43c | 5761 | || (CLASS_TYPE_P (type) && C_TYPE_FIELDS_READONLY (type)))) |
8d08fdba MS |
5762 | readonly_error (o[i], "modification by `asm'", 1); |
5763 | } | |
5764 | } | |
5765 | ||
5766 | /* Those MODIFY_EXPRs could do autoincrements. */ | |
5767 | emit_queue (); | |
5768 | } | |
5769 | \f | |
efee38a9 | 5770 | /* If RETVAL is the address of, or a reference to, a local variable or |
34cd5ae7 | 5771 | temporary give an appropriate warning. */ |
8d08fdba | 5772 | |
efee38a9 | 5773 | static void |
acd8e2d0 | 5774 | maybe_warn_about_returning_address_of_local (tree retval) |
efee38a9 MM |
5775 | { |
5776 | tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl)); | |
2bfa73e4 | 5777 | tree whats_returned = retval; |
8d08fdba | 5778 | |
2bfa73e4 | 5779 | for (;;) |
efee38a9 | 5780 | { |
efee38a9 | 5781 | if (TREE_CODE (whats_returned) == COMPOUND_EXPR) |
2bfa73e4 BS |
5782 | whats_returned = TREE_OPERAND (whats_returned, 1); |
5783 | else if (TREE_CODE (whats_returned) == CONVERT_EXPR | |
5784 | || TREE_CODE (whats_returned) == NON_LVALUE_EXPR | |
5785 | || TREE_CODE (whats_returned) == NOP_EXPR) | |
efee38a9 | 5786 | whats_returned = TREE_OPERAND (whats_returned, 0); |
2bfa73e4 BS |
5787 | else |
5788 | break; | |
5789 | } | |
5790 | ||
5791 | if (TREE_CODE (whats_returned) != ADDR_EXPR) | |
5792 | return; | |
5793 | whats_returned = TREE_OPERAND (whats_returned, 0); | |
5794 | ||
5795 | if (TREE_CODE (valtype) == REFERENCE_TYPE) | |
5796 | { | |
5797 | if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR | |
5798 | || TREE_CODE (whats_returned) == TARGET_EXPR) | |
efee38a9 | 5799 | { |
2bfa73e4 BS |
5800 | warning ("returning reference to temporary"); |
5801 | return; | |
efee38a9 | 5802 | } |
efee38a9 | 5803 | if (TREE_CODE (whats_returned) == VAR_DECL |
2bfa73e4 BS |
5804 | && DECL_NAME (whats_returned) |
5805 | && TEMP_NAME_P (DECL_NAME (whats_returned))) | |
efee38a9 | 5806 | { |
2bfa73e4 BS |
5807 | warning ("reference to non-lvalue returned"); |
5808 | return; | |
efee38a9 MM |
5809 | } |
5810 | } | |
efee38a9 | 5811 | |
2bfa73e4 BS |
5812 | if (TREE_CODE (whats_returned) == VAR_DECL |
5813 | && DECL_NAME (whats_returned) | |
5814 | && DECL_FUNCTION_SCOPE_P (whats_returned) | |
5815 | && !(TREE_STATIC (whats_returned) | |
5816 | || TREE_PUBLIC (whats_returned))) | |
5817 | { | |
5818 | if (TREE_CODE (valtype) == REFERENCE_TYPE) | |
5819 | cp_warning_at ("reference to local variable `%D' returned", | |
5820 | whats_returned); | |
5821 | else | |
efee38a9 MM |
5822 | cp_warning_at ("address of local variable `%D' returned", |
5823 | whats_returned); | |
2bfa73e4 | 5824 | return; |
efee38a9 MM |
5825 | } |
5826 | } | |
5827 | ||
0e339752 | 5828 | /* Check that returning RETVAL from the current function is valid. |
efee38a9 MM |
5829 | Return an expression explicitly showing all conversions required to |
5830 | change RETVAL into the function return type, and to assign it to | |
5831 | the DECL_RESULT for the function. */ | |
5832 | ||
5833 | tree | |
acd8e2d0 | 5834 | check_return_expr (tree retval) |
8d08fdba | 5835 | { |
efee38a9 MM |
5836 | tree result; |
5837 | /* The type actually returned by the function, after any | |
5838 | promotions. */ | |
5839 | tree valtype; | |
5840 | int fn_returns_value_p; | |
5841 | ||
5842 | /* A `volatile' function is one that isn't supposed to return, ever. | |
5843 | (This is a G++ extension, used to get better code for functions | |
5844 | that call the `volatile' function.) */ | |
8d08fdba | 5845 | if (TREE_THIS_VOLATILE (current_function_decl)) |
8251199e | 5846 | warning ("function declared `noreturn' has a `return' statement"); |
8d08fdba | 5847 | |
efee38a9 | 5848 | /* Check for various simple errors. */ |
a0de9d20 | 5849 | if (DECL_DESTRUCTOR_P (current_function_decl)) |
8d08fdba | 5850 | { |
1c2c08a5 | 5851 | if (retval) |
8251199e | 5852 | error ("returning a value from a destructor"); |
efee38a9 | 5853 | return NULL_TREE; |
1c2c08a5 | 5854 | } |
90418208 | 5855 | else if (DECL_CONSTRUCTOR_P (current_function_decl)) |
0dde4175 | 5856 | { |
90418208 JM |
5857 | if (in_function_try_handler) |
5858 | /* If a return statement appears in a handler of the | |
c6002625 | 5859 | function-try-block of a constructor, the program is ill-formed. */ |
90418208 JM |
5860 | error ("cannot return from a handler of a function-try-block of a constructor"); |
5861 | else if (retval) | |
5862 | /* You can't return a value from a constructor. */ | |
5863 | error ("returning a value from a constructor"); | |
5864 | return NULL_TREE; | |
efee38a9 | 5865 | } |
efee38a9 | 5866 | |
efc7052d JM |
5867 | if (processing_template_decl) |
5868 | { | |
5869 | current_function_returns_value = 1; | |
5870 | return retval; | |
5871 | } | |
5872 | ||
efee38a9 MM |
5873 | /* When no explicit return-value is given in a function with a named |
5874 | return value, the named return value is used. */ | |
5875 | result = DECL_RESULT (current_function_decl); | |
5876 | valtype = TREE_TYPE (result); | |
5877 | my_friendly_assert (valtype != NULL_TREE, 19990924); | |
b72801e2 | 5878 | fn_returns_value_p = !VOID_TYPE_P (valtype); |
efee38a9 MM |
5879 | if (!retval && DECL_NAME (result) && fn_returns_value_p) |
5880 | retval = result; | |
5881 | ||
5882 | /* Check for a return statement with no return value in a function | |
5883 | that's supposed to return a value. */ | |
5884 | if (!retval && fn_returns_value_p) | |
5885 | { | |
b0e3f7ec | 5886 | pedwarn ("return-statement with no value, in function returning '%T'", |
c8a209ca | 5887 | valtype); |
efee38a9 MM |
5888 | /* Clear this, so finish_function won't say that we reach the |
5889 | end of a non-void function (which we don't, we gave a | |
5890 | return!). */ | |
5891 | current_function_returns_null = 0; | |
5892 | } | |
5893 | /* Check for a return statement with a value in a function that | |
5894 | isn't supposed to return a value. */ | |
5895 | else if (retval && !fn_returns_value_p) | |
5896 | { | |
b72801e2 | 5897 | if (VOID_TYPE_P (TREE_TYPE (retval))) |
efee38a9 MM |
5898 | /* You can return a `void' value from a function of `void' |
5899 | type. In that case, we have to evaluate the expression for | |
5900 | its side-effects. */ | |
5901 | finish_expr_stmt (retval); | |
5902 | else | |
b0e3f7ec GDR |
5903 | pedwarn ("return-statement with a value, in function " |
5904 | "returning 'void'"); | |
efee38a9 MM |
5905 | |
5906 | current_function_returns_null = 1; | |
5907 | ||
5908 | /* There's really no value to return, after all. */ | |
5909 | return NULL_TREE; | |
0dde4175 | 5910 | } |
efee38a9 MM |
5911 | else if (!retval) |
5912 | /* Remember that this function can sometimes return without a | |
5913 | value. */ | |
5914 | current_function_returns_null = 1; | |
90418208 JM |
5915 | else |
5916 | /* Remember that this function did return a value. */ | |
5917 | current_function_returns_value = 1; | |
1c2c08a5 | 5918 | |
7f477e81 | 5919 | /* Only operator new(...) throw(), can return NULL [expr.new/13]. */ |
596ea4e5 AS |
5920 | if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR |
5921 | || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR) | |
7f477e81 | 5922 | && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl)) |
708cae97 | 5923 | && ! flag_check_new |
7f477e81 | 5924 | && null_ptr_cst_p (retval)) |
33bd39a2 | 5925 | warning ("`operator new' must not return NULL unless it is declared `throw()' (or -fcheck-new is in effect)"); |
8d08fdba | 5926 | |
824b9a4c | 5927 | /* Effective C++ rule 15. See also start_function. */ |
eb448459 | 5928 | if (warn_ecpp |
596ea4e5 | 5929 | && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR) |
824b9a4c | 5930 | && retval != current_class_ref) |
33bd39a2 | 5931 | warning ("`operator=' should return a reference to `*this'"); |
824b9a4c | 5932 | |
07b2f2fd JM |
5933 | /* The fabled Named Return Value optimization, as per [class.copy]/15: |
5934 | ||
5935 | [...] For a function with a class return type, if the expression | |
5936 | in the return statement is the name of a local object, and the cv- | |
5937 | unqualified type of the local object is the same as the function | |
5938 | return type, an implementation is permitted to omit creating the tem- | |
5939 | porary object to hold the function return value [...] | |
5940 | ||
5941 | So, if this is a value-returning function that always returns the same | |
5942 | local variable, remember it. | |
0d97bf4c JM |
5943 | |
5944 | It might be nice to be more flexible, and choose the first suitable | |
5945 | variable even if the function sometimes returns something else, but | |
5946 | then we run the risk of clobbering the variable we chose if the other | |
5947 | returned expression uses the chosen variable somehow. And people expect | |
07b2f2fd JM |
5948 | this restriction, anyway. (jason 2000-11-19) |
5949 | ||
5950 | See finish_function, genrtl_start_function, and declare_return_variable | |
5951 | for other pieces of this optimization. */ | |
0d97bf4c | 5952 | |
01f9e964 | 5953 | if (fn_returns_value_p && flag_elide_constructors) |
0d97bf4c JM |
5954 | { |
5955 | if (retval != NULL_TREE | |
5956 | && (current_function_return_value == NULL_TREE | |
5957 | || current_function_return_value == retval) | |
5958 | && TREE_CODE (retval) == VAR_DECL | |
5959 | && DECL_CONTEXT (retval) == current_function_decl | |
5960 | && ! TREE_STATIC (retval) | |
01f9e964 | 5961 | && (DECL_ALIGN (retval) |
07b2f2fd JM |
5962 | >= DECL_ALIGN (DECL_RESULT (current_function_decl))) |
5963 | && same_type_p ((TYPE_MAIN_VARIANT | |
5964 | (TREE_TYPE (retval))), | |
5965 | (TYPE_MAIN_VARIANT | |
5966 | (TREE_TYPE (TREE_TYPE (current_function_decl)))))) | |
0d97bf4c JM |
5967 | current_function_return_value = retval; |
5968 | else | |
5969 | current_function_return_value = error_mark_node; | |
5970 | } | |
5971 | ||
efee38a9 MM |
5972 | /* We don't need to do any conversions when there's nothing being |
5973 | returned. */ | |
90418208 JM |
5974 | if (!retval || retval == error_mark_node) |
5975 | return retval; | |
efee38a9 MM |
5976 | |
5977 | /* Do any required conversions. */ | |
5978 | if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl)) | |
5979 | /* No conversions are required. */ | |
5980 | ; | |
8d08fdba MS |
5981 | else |
5982 | { | |
efee38a9 | 5983 | /* The type the function is declared to return. */ |
cce2be43 JM |
5984 | tree functype = TREE_TYPE (TREE_TYPE (current_function_decl)); |
5985 | ||
5986 | /* First convert the value to the function's return type, then | |
5987 | to the type of return value's location to handle the | |
c6002625 | 5988 | case that functype is smaller than the valtype. */ |
c1bc6829 | 5989 | retval = convert_for_initialization |
cce2be43 | 5990 | (NULL_TREE, functype, retval, LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING, |
c1bc6829 | 5991 | "return", NULL_TREE, 0); |
cce2be43 JM |
5992 | retval = convert (valtype, retval); |
5993 | ||
efee38a9 | 5994 | /* If the conversion failed, treat this just like `return;'. */ |
691c003d | 5995 | if (retval == error_mark_node) |
90418208 | 5996 | return retval; |
02531345 | 5997 | /* We can't initialize a register from a AGGR_INIT_EXPR. */ |
c1bc6829 JM |
5998 | else if (! current_function_returns_struct |
5999 | && TREE_CODE (retval) == TARGET_EXPR | |
02531345 | 6000 | && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR) |
c1bc6829 JM |
6001 | retval = build (COMPOUND_EXPR, TREE_TYPE (retval), retval, |
6002 | TREE_OPERAND (retval, 0)); | |
efee38a9 MM |
6003 | else |
6004 | maybe_warn_about_returning_address_of_local (retval); | |
8d08fdba | 6005 | } |
efee38a9 MM |
6006 | |
6007 | /* Actually copy the value returned into the appropriate location. */ | |
691c003d | 6008 | if (retval && retval != result) |
c557501d | 6009 | retval = build (INIT_EXPR, TREE_TYPE (result), result, retval); |
b88c08b6 | 6010 | |
efee38a9 MM |
6011 | return retval; |
6012 | } | |
6013 | ||
8d08fdba | 6014 | \f |
838dfd8a | 6015 | /* Returns nonzero if the pointer-type FROM can be converted to the |
ceab47eb | 6016 | pointer-type TO via a qualification conversion. If CONSTP is -1, |
838dfd8a | 6017 | then we return nonzero if the pointers are similar, and the |
ceab47eb MM |
6018 | cv-qualification signature of FROM is a proper subset of that of TO. |
6019 | ||
6020 | If CONSTP is positive, then all outer pointers have been | |
6021 | const-qualified. */ | |
e92cc029 | 6022 | |
bd6dd845 | 6023 | static int |
acd8e2d0 | 6024 | comp_ptr_ttypes_real (tree to, tree from, int constp) |
a0a33927 | 6025 | { |
a5ac359a | 6026 | bool to_more_cv_qualified = false; |
ceab47eb | 6027 | |
a0a33927 MS |
6028 | for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from)) |
6029 | { | |
6030 | if (TREE_CODE (to) != TREE_CODE (from)) | |
6031 | return 0; | |
6032 | ||
d11ad92e | 6033 | if (TREE_CODE (from) == OFFSET_TYPE |
b7a78333 MM |
6034 | && !same_type_p (TYPE_OFFSET_BASETYPE (from), |
6035 | TYPE_OFFSET_BASETYPE (to))) | |
6036 | return 0; | |
d11ad92e | 6037 | |
f30432d7 MS |
6038 | /* Const and volatile mean something different for function types, |
6039 | so the usual checks are not appropriate. */ | |
6040 | if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE) | |
6041 | { | |
91063b51 | 6042 | if (!at_least_as_qualified_p (to, from)) |
02020185 | 6043 | return 0; |
a0a33927 | 6044 | |
91063b51 | 6045 | if (!at_least_as_qualified_p (from, to)) |
02020185 | 6046 | { |
ceab47eb MM |
6047 | if (constp == 0) |
6048 | return 0; | |
a5ac359a | 6049 | to_more_cv_qualified = true; |
ceab47eb MM |
6050 | } |
6051 | ||
6052 | if (constp > 0) | |
6053 | constp &= TYPE_READONLY (to); | |
f30432d7 | 6054 | } |
a0a33927 | 6055 | |
ae0b7dfc | 6056 | if (TREE_CODE (to) != POINTER_TYPE && !TYPE_PTRMEM_P (to)) |
8de9bb0e NS |
6057 | return ((constp >= 0 || to_more_cv_qualified) |
6058 | && same_type_ignoring_top_level_qualifiers_p (to, from)); | |
a0a33927 MS |
6059 | } |
6060 | } | |
6061 | ||
8de9bb0e NS |
6062 | /* When comparing, say, char ** to char const **, this function takes |
6063 | the 'char *' and 'char const *'. Do not pass non-pointer/reference | |
6064 | types to this function. */ | |
e92cc029 | 6065 | |
a0a33927 | 6066 | int |
acd8e2d0 | 6067 | comp_ptr_ttypes (tree to, tree from) |
a0a33927 MS |
6068 | { |
6069 | return comp_ptr_ttypes_real (to, from, 1); | |
6070 | } | |
d11ad92e MS |
6071 | |
6072 | /* Returns 1 if to and from are (possibly multi-level) pointers to the same | |
6073 | type or inheritance-related types, regardless of cv-quals. */ | |
6074 | ||
6075 | int | |
acd8e2d0 | 6076 | ptr_reasonably_similar (tree to, tree from) |
d11ad92e MS |
6077 | { |
6078 | for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from)) | |
6079 | { | |
72a08131 JM |
6080 | /* Any target type is similar enough to void. */ |
6081 | if (TREE_CODE (to) == VOID_TYPE | |
6082 | || TREE_CODE (from) == VOID_TYPE) | |
6083 | return 1; | |
6084 | ||
d11ad92e MS |
6085 | if (TREE_CODE (to) != TREE_CODE (from)) |
6086 | return 0; | |
6087 | ||
6088 | if (TREE_CODE (from) == OFFSET_TYPE | |
6089 | && comptypes (TYPE_OFFSET_BASETYPE (to), | |
3bfdc719 | 6090 | TYPE_OFFSET_BASETYPE (from), |
c8a209ca | 6091 | COMPARE_BASE | COMPARE_DERIVED)) |
d11ad92e MS |
6092 | continue; |
6093 | ||
8a2b77e7 JM |
6094 | if (TREE_CODE (to) == INTEGER_TYPE |
6095 | && TYPE_PRECISION (to) == TYPE_PRECISION (from)) | |
6096 | return 1; | |
6097 | ||
6098 | if (TREE_CODE (to) == FUNCTION_TYPE) | |
6099 | return 1; | |
6100 | ||
d11ad92e MS |
6101 | if (TREE_CODE (to) != POINTER_TYPE) |
6102 | return comptypes | |
3bfdc719 | 6103 | (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from), |
c8a209ca | 6104 | COMPARE_BASE | COMPARE_DERIVED); |
d11ad92e MS |
6105 | } |
6106 | } | |
c11b6f21 MS |
6107 | |
6108 | /* Like comp_ptr_ttypes, for const_cast. */ | |
6109 | ||
bd6dd845 | 6110 | static int |
acd8e2d0 | 6111 | comp_ptr_ttypes_const (tree to, tree from) |
c11b6f21 MS |
6112 | { |
6113 | for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from)) | |
6114 | { | |
6115 | if (TREE_CODE (to) != TREE_CODE (from)) | |
6116 | return 0; | |
6117 | ||
6118 | if (TREE_CODE (from) == OFFSET_TYPE | |
3bfdc719 MM |
6119 | && same_type_p (TYPE_OFFSET_BASETYPE (from), |
6120 | TYPE_OFFSET_BASETYPE (to))) | |
c11b6f21 MS |
6121 | continue; |
6122 | ||
6123 | if (TREE_CODE (to) != POINTER_TYPE) | |
9edc3913 | 6124 | return same_type_ignoring_top_level_qualifiers_p (to, from); |
c11b6f21 MS |
6125 | } |
6126 | } | |
6127 | ||
89d684bb BM |
6128 | /* Returns the type qualifiers for this type, including the qualifiers on the |
6129 | elements for an array type. */ | |
27778b73 MM |
6130 | |
6131 | int | |
acd8e2d0 | 6132 | cp_type_quals (tree type) |
27778b73 | 6133 | { |
38da6039 | 6134 | type = strip_array_types (type); |
328de7c2 MM |
6135 | if (type == error_mark_node) |
6136 | return TYPE_UNQUALIFIED; | |
38da6039 | 6137 | return TYPE_QUALS (type); |
91063b51 | 6138 | } |
a7a7710d | 6139 | |
838dfd8a | 6140 | /* Returns nonzero if the TYPE contains a mutable member */ |
a7a7710d | 6141 | |
acd8e2d0 NS |
6142 | bool |
6143 | cp_has_mutable_p (tree type) | |
a7a7710d | 6144 | { |
38da6039 | 6145 | type = strip_array_types (type); |
a7a7710d NS |
6146 | |
6147 | return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type); | |
6148 | } | |
af7b9902 MM |
6149 | |
6150 | /* Subroutine of casts_away_constness. Make T1 and T2 point at | |
6151 | exemplar types such that casting T1 to T2 is casting away castness | |
6152 | if and only if there is no implicit conversion from T1 to T2. */ | |
6153 | ||
6154 | static void | |
acd8e2d0 | 6155 | casts_away_constness_r (tree *t1, tree *t2) |
af7b9902 MM |
6156 | { |
6157 | int quals1; | |
6158 | int quals2; | |
6159 | ||
6160 | /* [expr.const.cast] | |
6161 | ||
6162 | For multi-level pointer to members and multi-level mixed pointers | |
6163 | and pointers to members (conv.qual), the "member" aspect of a | |
6164 | pointer to member level is ignored when determining if a const | |
6165 | cv-qualifier has been cast away. */ | |
6166 | if (TYPE_PTRMEM_P (*t1)) | |
a5ac359a | 6167 | *t1 = build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (*t1)); |
af7b9902 | 6168 | if (TYPE_PTRMEM_P (*t2)) |
a5ac359a | 6169 | *t2 = build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (*t2)); |
af7b9902 MM |
6170 | |
6171 | /* [expr.const.cast] | |
6172 | ||
6173 | For two pointer types: | |
6174 | ||
6175 | X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type | |
6176 | X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type | |
6177 | K is min(N,M) | |
6178 | ||
6179 | casting from X1 to X2 casts away constness if, for a non-pointer | |
6180 | type T there does not exist an implicit conversion (clause | |
6181 | _conv_) from: | |
6182 | ||
6183 | Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N * | |
6184 | ||
6185 | to | |
6186 | ||
6187 | Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */ | |
6188 | ||
6189 | if (TREE_CODE (*t1) != POINTER_TYPE | |
6190 | || TREE_CODE (*t2) != POINTER_TYPE) | |
6191 | { | |
6192 | *t1 = cp_build_qualified_type (void_type_node, | |
89d684bb | 6193 | cp_type_quals (*t1)); |
af7b9902 | 6194 | *t2 = cp_build_qualified_type (void_type_node, |
89d684bb | 6195 | cp_type_quals (*t2)); |
af7b9902 MM |
6196 | return; |
6197 | } | |
6198 | ||
89d684bb BM |
6199 | quals1 = cp_type_quals (*t1); |
6200 | quals2 = cp_type_quals (*t2); | |
af7b9902 MM |
6201 | *t1 = TREE_TYPE (*t1); |
6202 | *t2 = TREE_TYPE (*t2); | |
6203 | casts_away_constness_r (t1, t2); | |
6204 | *t1 = build_pointer_type (*t1); | |
6205 | *t2 = build_pointer_type (*t2); | |
6206 | *t1 = cp_build_qualified_type (*t1, quals1); | |
6207 | *t2 = cp_build_qualified_type (*t2, quals2); | |
6208 | } | |
6209 | ||
838dfd8a | 6210 | /* Returns nonzero if casting from TYPE1 to TYPE2 casts away |
af7b9902 MM |
6211 | constness. */ |
6212 | ||
acd8e2d0 NS |
6213 | static bool |
6214 | casts_away_constness (tree t1, tree t2) | |
af7b9902 MM |
6215 | { |
6216 | if (TREE_CODE (t2) == REFERENCE_TYPE) | |
6217 | { | |
6218 | /* [expr.const.cast] | |
6219 | ||
6220 | Casting from an lvalue of type T1 to an lvalue of type T2 | |
6221 | using a reference cast casts away constness if a cast from an | |
6222 | rvalue of type "pointer to T1" to the type "pointer to T2" | |
6223 | casts away constness. */ | |
acd8e2d0 | 6224 | t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1); |
af7b9902 MM |
6225 | return casts_away_constness (build_pointer_type (t1), |
6226 | build_pointer_type (TREE_TYPE (t2))); | |
6227 | } | |
6228 | ||
6229 | if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2)) | |
6230 | /* [expr.const.cast] | |
6231 | ||
6232 | Casting from an rvalue of type "pointer to data member of X | |
6233 | of type T1" to the type "pointer to data member of Y of type | |
6234 | T2" casts away constness if a cast from an rvalue of type | |
aba649ba | 6235 | "pointer to T1" to the type "pointer to T2" casts away |
af7b9902 | 6236 | constness. */ |
3e0b4710 | 6237 | return casts_away_constness |
a5ac359a MM |
6238 | (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)), |
6239 | build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2))); | |
af7b9902 MM |
6240 | |
6241 | /* Casting away constness is only something that makes sense for | |
6242 | pointer or reference types. */ | |
6243 | if (TREE_CODE (t1) != POINTER_TYPE | |
6244 | || TREE_CODE (t2) != POINTER_TYPE) | |
acd8e2d0 | 6245 | return false; |
af7b9902 MM |
6246 | |
6247 | /* Top-level qualifiers don't matter. */ | |
6248 | t1 = TYPE_MAIN_VARIANT (t1); | |
6249 | t2 = TYPE_MAIN_VARIANT (t2); | |
6250 | casts_away_constness_r (&t1, &t2); | |
6251 | if (!can_convert (t2, t1)) | |
acd8e2d0 | 6252 | return true; |
af7b9902 | 6253 | |
acd8e2d0 | 6254 | return false; |
af7b9902 | 6255 | } |
6816f040 | 6256 | |
ee76b931 MM |
6257 | /* If T is a REFERENCE_TYPE return the type to which T refers. |
6258 | Otherwise, return T itself. */ | |
6259 | ||
6260 | tree | |
6261 | non_reference (tree t) | |
6262 | { | |
6263 | if (TREE_CODE (t) == REFERENCE_TYPE) | |
6264 | t = TREE_TYPE (t); | |
6265 | return t; | |
6266 | } |