]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Language-dependent node constructors for parse phase of GNU compiler. |
06ceef4e | 2 | Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, |
7c475d11 | 3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010 |
e77f031d | 4 | Free Software Foundation, Inc. |
8d08fdba MS |
5 | Hacked by Michael Tiemann (tiemann@cygnus.com) |
6 | ||
f5adbb8d | 7 | This file is part of GCC. |
8d08fdba | 8 | |
f5adbb8d | 9 | GCC is free software; you can redistribute it and/or modify |
8d08fdba | 10 | it under the terms of the GNU General Public License as published by |
e77f031d | 11 | the Free Software Foundation; either version 3, or (at your option) |
8d08fdba MS |
12 | any later version. |
13 | ||
f5adbb8d | 14 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
18 | ||
19 | You should have received a copy of the GNU General Public License | |
e77f031d NC |
20 | along with GCC; see the file COPYING3. If not see |
21 | <http://www.gnu.org/licenses/>. */ | |
8d08fdba MS |
22 | |
23 | #include "config.h" | |
8d052bc7 | 24 | #include "system.h" |
4977bab6 ZW |
25 | #include "coretypes.h" |
26 | #include "tm.h" | |
8d08fdba MS |
27 | #include "tree.h" |
28 | #include "cp-tree.h" | |
29 | #include "flags.h" | |
25af8512 | 30 | #include "tree-inline.h" |
e58a9aa1 | 31 | #include "debug.h" |
41990f96 | 32 | #include "convert.h" |
87501227 | 33 | #include "cgraph.h" |
245763e3 | 34 | #include "splay-tree.h" |
6662d794 | 35 | #include "gimple.h" /* gimple_has_body_p */ |
12027a89 | 36 | |
b57b79f7 NN |
37 | static tree bot_manip (tree *, int *, void *); |
38 | static tree bot_replace (tree *, int *, void *); | |
b57b79f7 NN |
39 | static int list_hash_eq (const void *, const void *); |
40 | static hashval_t list_hash_pieces (tree, tree, tree); | |
41 | static hashval_t list_hash (const void *); | |
b57b79f7 NN |
42 | static tree build_target_expr (tree, tree); |
43 | static tree count_trees_r (tree *, int *, void *); | |
44 | static tree verify_stmt_tree_r (tree *, int *, void *); | |
a6f86b51 | 45 | static tree build_local_temp (tree); |
b57b79f7 NN |
46 | |
47 | static tree handle_java_interface_attribute (tree *, tree, tree, int, bool *); | |
48 | static tree handle_com_interface_attribute (tree *, tree, tree, int, bool *); | |
49 | static tree handle_init_priority_attribute (tree *, tree, tree, int, bool *); | |
91d231cb | 50 | |
27b8d0cd | 51 | /* If REF is an lvalue, returns the kind of lvalue that REF is. |
df5c89cb | 52 | Otherwise, returns clk_none. */ |
8d08fdba | 53 | |
4e9ca9b0 JM |
54 | cp_lvalue_kind |
55 | lvalue_kind (const_tree ref) | |
8ccc31eb | 56 | { |
27b8d0cd MM |
57 | cp_lvalue_kind op1_lvalue_kind = clk_none; |
58 | cp_lvalue_kind op2_lvalue_kind = clk_none; | |
59 | ||
8af2fec4 RY |
60 | /* Expressions of reference type are sometimes wrapped in |
61 | INDIRECT_REFs. INDIRECT_REFs are just internal compiler | |
62 | representation, not part of the language, so we have to look | |
63 | through them. */ | |
64 | if (TREE_CODE (ref) == INDIRECT_REF | |
65 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref, 0))) | |
66 | == REFERENCE_TYPE) | |
4e9ca9b0 | 67 | return lvalue_kind (TREE_OPERAND (ref, 0)); |
8af2fec4 | 68 | |
8810610e JJ |
69 | if (TREE_TYPE (ref) |
70 | && TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE) | |
8af2fec4 RY |
71 | { |
72 | /* unnamed rvalue references are rvalues */ | |
73 | if (TYPE_REF_IS_RVALUE (TREE_TYPE (ref)) | |
74 | && TREE_CODE (ref) != PARM_DECL | |
75 | && TREE_CODE (ref) != VAR_DECL | |
b24290fb JM |
76 | && TREE_CODE (ref) != COMPONENT_REF |
77 | /* Functions are always lvalues. */ | |
78 | && TREE_CODE (TREE_TYPE (TREE_TYPE (ref))) != FUNCTION_TYPE) | |
df5c89cb | 79 | return clk_rvalueref; |
8af2fec4 | 80 | |
d732e98f | 81 | /* lvalue references and named rvalue references are lvalues. */ |
8af2fec4 RY |
82 | return clk_ordinary; |
83 | } | |
8ccc31eb | 84 | |
394fd776 | 85 | if (ref == current_class_ptr) |
27b8d0cd | 86 | return clk_none; |
8ccc31eb MS |
87 | |
88 | switch (TREE_CODE (ref)) | |
89 | { | |
8f4361eb AP |
90 | case SAVE_EXPR: |
91 | return clk_none; | |
8ccc31eb | 92 | /* preincrements and predecrements are valid lvals, provided |
e92cc029 | 93 | what they refer to are valid lvals. */ |
8ccc31eb MS |
94 | case PREINCREMENT_EXPR: |
95 | case PREDECREMENT_EXPR: | |
c7ae64f2 JM |
96 | case TRY_CATCH_EXPR: |
97 | case WITH_CLEANUP_EXPR: | |
69851283 MM |
98 | case REALPART_EXPR: |
99 | case IMAGPART_EXPR: | |
4e9ca9b0 | 100 | return lvalue_kind (TREE_OPERAND (ref, 0)); |
8ccc31eb | 101 | |
27b8d0cd | 102 | case COMPONENT_REF: |
4e9ca9b0 | 103 | op1_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 0)); |
c8b2e872 | 104 | /* Look at the member designator. */ |
4af9e878 | 105 | if (!op1_lvalue_kind) |
0cbd7506 | 106 | ; |
4af9e878 JM |
107 | else if (is_overloaded_fn (TREE_OPERAND (ref, 1))) |
108 | /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some | |
b7da27c2 JM |
109 | situations. If we're seeing a COMPONENT_REF, it's a non-static |
110 | member, so it isn't an lvalue. */ | |
111 | op1_lvalue_kind = clk_none; | |
112 | else if (TREE_CODE (TREE_OPERAND (ref, 1)) != FIELD_DECL) | |
113 | /* This can be IDENTIFIER_NODE in a template. */; | |
e0d1297c | 114 | else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref, 1))) |
27b8d0cd MM |
115 | { |
116 | /* Clear the ordinary bit. If this object was a class | |
117 | rvalue we want to preserve that information. */ | |
118 | op1_lvalue_kind &= ~clk_ordinary; | |
cd0be382 | 119 | /* The lvalue is for a bitfield. */ |
27b8d0cd MM |
120 | op1_lvalue_kind |= clk_bitfield; |
121 | } | |
e0d1297c NS |
122 | else if (DECL_PACKED (TREE_OPERAND (ref, 1))) |
123 | op1_lvalue_kind |= clk_packed; | |
9f63daea | 124 | |
27b8d0cd MM |
125 | return op1_lvalue_kind; |
126 | ||
8ccc31eb | 127 | case STRING_CST: |
266b4890 | 128 | case COMPOUND_LITERAL_EXPR: |
27b8d0cd | 129 | return clk_ordinary; |
8ccc31eb | 130 | |
e58a9aa1 | 131 | case CONST_DECL: |
4b8c1a92 JJ |
132 | /* CONST_DECL without TREE_STATIC are enumeration values and |
133 | thus not lvalues. With TREE_STATIC they are used by ObjC++ | |
134 | in objc_build_string_object and need to be considered as | |
135 | lvalues. */ | |
136 | if (! TREE_STATIC (ref)) | |
137 | return clk_none; | |
8ccc31eb MS |
138 | case VAR_DECL: |
139 | if (TREE_READONLY (ref) && ! TREE_STATIC (ref) | |
140 | && DECL_LANG_SPECIFIC (ref) | |
141 | && DECL_IN_AGGR_P (ref)) | |
27b8d0cd | 142 | return clk_none; |
8ccc31eb MS |
143 | case INDIRECT_REF: |
144 | case ARRAY_REF: | |
145 | case PARM_DECL: | |
146 | case RESULT_DECL: | |
59e76fc6 | 147 | if (TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE) |
27b8d0cd | 148 | return clk_ordinary; |
8ccc31eb MS |
149 | break; |
150 | ||
3ee353e9 JM |
151 | /* A scope ref in a template, left as SCOPE_REF to support later |
152 | access checking. */ | |
8ccc31eb | 153 | case SCOPE_REF: |
3ee353e9 JM |
154 | gcc_assert (!type_dependent_expression_p (CONST_CAST_TREE(ref))); |
155 | return lvalue_kind (TREE_OPERAND (ref, 1)); | |
156 | ||
27b8d0cd MM |
157 | case MAX_EXPR: |
158 | case MIN_EXPR: | |
d211a298 RS |
159 | /* Disallow <? and >? as lvalues if either argument side-effects. */ |
160 | if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 0)) | |
161 | || TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 1))) | |
162 | return clk_none; | |
4e9ca9b0 JM |
163 | op1_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 0)); |
164 | op2_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 1)); | |
8ccc31eb MS |
165 | break; |
166 | ||
167 | case COND_EXPR: | |
4e9ca9b0 | 168 | op1_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 1) |
42924ed7 | 169 | ? TREE_OPERAND (ref, 1) |
df5c89cb | 170 | : TREE_OPERAND (ref, 0)); |
4e9ca9b0 | 171 | op2_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 2)); |
27b8d0cd | 172 | break; |
8ccc31eb MS |
173 | |
174 | case MODIFY_EXPR: | |
27b8d0cd | 175 | return clk_ordinary; |
8ccc31eb MS |
176 | |
177 | case COMPOUND_EXPR: | |
4e9ca9b0 | 178 | return lvalue_kind (TREE_OPERAND (ref, 1)); |
69851283 MM |
179 | |
180 | case TARGET_EXPR: | |
df5c89cb | 181 | return clk_class; |
69851283 | 182 | |
356955cf | 183 | case VA_ARG_EXPR: |
df5c89cb | 184 | return (CLASS_TYPE_P (TREE_TYPE (ref)) ? clk_class : clk_none); |
c0ad5a31 MM |
185 | |
186 | case CALL_EXPR: | |
4e8dca1c JM |
187 | /* Any class-valued call would be wrapped in a TARGET_EXPR. */ |
188 | return clk_none; | |
69851283 MM |
189 | |
190 | case FUNCTION_DECL: | |
191 | /* All functions (except non-static-member functions) are | |
192 | lvalues. */ | |
9f63daea | 193 | return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref) |
27b8d0cd | 194 | ? clk_none : clk_ordinary); |
7f85441b | 195 | |
4af9e878 JM |
196 | case BASELINK: |
197 | /* We now represent a reference to a single static member function | |
198 | with a BASELINK. */ | |
1e4ae551 MLI |
199 | /* This CONST_CAST is okay because BASELINK_FUNCTIONS returns |
200 | its argument unmodified and we assign it to a const_tree. */ | |
4e9ca9b0 | 201 | return lvalue_kind (BASELINK_FUNCTIONS (CONST_CAST_TREE (ref))); |
4af9e878 | 202 | |
d17811fd MM |
203 | case NON_DEPENDENT_EXPR: |
204 | /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that | |
205 | things like "&E" where "E" is an expression with a | |
206 | non-dependent type work. It is safe to be lenient because an | |
207 | error will be issued when the template is instantiated if "E" | |
208 | is not an lvalue. */ | |
209 | return clk_ordinary; | |
210 | ||
7f85441b KG |
211 | default: |
212 | break; | |
8ccc31eb MS |
213 | } |
214 | ||
27b8d0cd MM |
215 | /* If one operand is not an lvalue at all, then this expression is |
216 | not an lvalue. */ | |
217 | if (!op1_lvalue_kind || !op2_lvalue_kind) | |
218 | return clk_none; | |
219 | ||
220 | /* Otherwise, it's an lvalue, and it has all the odd properties | |
221 | contributed by either operand. */ | |
222 | op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind; | |
9771799c | 223 | /* It's not an ordinary lvalue if it involves any other kind. */ |
27b8d0cd MM |
224 | if ((op1_lvalue_kind & ~clk_ordinary) != clk_none) |
225 | op1_lvalue_kind &= ~clk_ordinary; | |
9771799c JM |
226 | /* It can't be both a pseudo-lvalue and a non-addressable lvalue. |
227 | A COND_EXPR of those should be wrapped in a TARGET_EXPR. */ | |
228 | if ((op1_lvalue_kind & (clk_rvalueref|clk_class)) | |
229 | && (op1_lvalue_kind & (clk_bitfield|clk_packed))) | |
230 | op1_lvalue_kind = clk_none; | |
27b8d0cd | 231 | return op1_lvalue_kind; |
8ccc31eb MS |
232 | } |
233 | ||
aa6e8ed3 MM |
234 | /* Returns the kind of lvalue that REF is, in the sense of |
235 | [basic.lval]. This function should really be named lvalue_p; it | |
236 | computes the C++ definition of lvalue. */ | |
237 | ||
238 | cp_lvalue_kind | |
4e9ca9b0 | 239 | real_lvalue_p (const_tree ref) |
aa6e8ed3 | 240 | { |
4e9ca9b0 | 241 | cp_lvalue_kind kind = lvalue_kind (ref); |
df5c89cb JM |
242 | if (kind & (clk_rvalueref|clk_class)) |
243 | return clk_none; | |
244 | else | |
245 | return kind; | |
aa6e8ed3 MM |
246 | } |
247 | ||
df5c89cb JM |
248 | /* This differs from real_lvalue_p in that class rvalues are considered |
249 | lvalues. */ | |
69851283 | 250 | |
1e4ae551 MLI |
251 | bool |
252 | lvalue_p (const_tree ref) | |
8d08fdba | 253 | { |
4e9ca9b0 | 254 | return (lvalue_kind (ref) != clk_none); |
df5c89cb JM |
255 | } |
256 | ||
257 | /* This differs from real_lvalue_p in that rvalues formed by dereferencing | |
258 | rvalue references are considered rvalues. */ | |
259 | ||
260 | bool | |
261 | lvalue_or_rvalue_with_address_p (const_tree ref) | |
262 | { | |
4e9ca9b0 | 263 | cp_lvalue_kind kind = lvalue_kind (ref); |
df5c89cb JM |
264 | if (kind & clk_class) |
265 | return false; | |
266 | else | |
267 | return (kind != clk_none); | |
6c6e776d MA |
268 | } |
269 | ||
100d337a MA |
270 | /* Test whether DECL is a builtin that may appear in a |
271 | constant-expression. */ | |
272 | ||
273 | bool | |
58f9752a | 274 | builtin_valid_in_constant_expr_p (const_tree decl) |
100d337a MA |
275 | { |
276 | /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing | |
277 | in constant-expressions. We may want to add other builtins later. */ | |
88a7beb7 | 278 | return DECL_IS_BUILTIN_CONSTANT_P (decl); |
100d337a MA |
279 | } |
280 | ||
c506ca22 MM |
281 | /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */ |
282 | ||
283 | static tree | |
b57b79f7 | 284 | build_target_expr (tree decl, tree value) |
c506ca22 MM |
285 | { |
286 | tree t; | |
04941f76 AO |
287 | |
288 | #ifdef ENABLE_CHECKING | |
289 | gcc_assert (VOID_TYPE_P (TREE_TYPE (value)) | |
290 | || TREE_TYPE (decl) == TREE_TYPE (value) | |
291 | || useless_type_conversion_p (TREE_TYPE (decl), | |
292 | TREE_TYPE (value))); | |
293 | #endif | |
c506ca22 | 294 | |
f293ce4b RS |
295 | t = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value, |
296 | cxx_maybe_build_cleanup (decl), NULL_TREE); | |
c506ca22 MM |
297 | /* We always set TREE_SIDE_EFFECTS so that expand_expr does not |
298 | ignore the TARGET_EXPR. If there really turn out to be no | |
299 | side-effects, then the optimizer should be able to get rid of | |
300 | whatever code is generated anyhow. */ | |
301 | TREE_SIDE_EFFECTS (t) = 1; | |
302 | ||
303 | return t; | |
304 | } | |
305 | ||
a6f86b51 JM |
306 | /* Return an undeclared local temporary of type TYPE for use in building a |
307 | TARGET_EXPR. */ | |
308 | ||
309 | static tree | |
310 | build_local_temp (tree type) | |
311 | { | |
c2255bc4 AH |
312 | tree slot = build_decl (input_location, |
313 | VAR_DECL, NULL_TREE, type); | |
a6f86b51 | 314 | DECL_ARTIFICIAL (slot) = 1; |
78e0d62b | 315 | DECL_IGNORED_P (slot) = 1; |
a6f86b51 JM |
316 | DECL_CONTEXT (slot) = current_function_decl; |
317 | layout_decl (slot, 0); | |
318 | return slot; | |
319 | } | |
320 | ||
5039610b SL |
321 | /* Set various status flags when building an AGGR_INIT_EXPR object T. */ |
322 | ||
323 | static void | |
324 | process_aggr_init_operands (tree t) | |
325 | { | |
326 | bool side_effects; | |
327 | ||
328 | side_effects = TREE_SIDE_EFFECTS (t); | |
329 | if (!side_effects) | |
330 | { | |
331 | int i, n; | |
332 | n = TREE_OPERAND_LENGTH (t); | |
333 | for (i = 1; i < n; i++) | |
334 | { | |
335 | tree op = TREE_OPERAND (t, i); | |
336 | if (op && TREE_SIDE_EFFECTS (op)) | |
337 | { | |
338 | side_effects = 1; | |
339 | break; | |
340 | } | |
341 | } | |
342 | } | |
343 | TREE_SIDE_EFFECTS (t) = side_effects; | |
344 | } | |
345 | ||
346 | /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE, | |
347 | FN, and SLOT. NARGS is the number of call arguments which are specified | |
348 | as a tree array ARGS. */ | |
349 | ||
350 | static tree | |
351 | build_aggr_init_array (tree return_type, tree fn, tree slot, int nargs, | |
352 | tree *args) | |
353 | { | |
354 | tree t; | |
355 | int i; | |
356 | ||
357 | t = build_vl_exp (AGGR_INIT_EXPR, nargs + 3); | |
358 | TREE_TYPE (t) = return_type; | |
359 | AGGR_INIT_EXPR_FN (t) = fn; | |
360 | AGGR_INIT_EXPR_SLOT (t) = slot; | |
361 | for (i = 0; i < nargs; i++) | |
362 | AGGR_INIT_EXPR_ARG (t, i) = args[i]; | |
363 | process_aggr_init_operands (t); | |
364 | return t; | |
365 | } | |
366 | ||
367 | /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its | |
844ae01d | 368 | target. TYPE is the type to be initialized. |
8d08fdba | 369 | |
844ae01d JM |
370 | Build an AGGR_INIT_EXPR to represent the initialization. This function |
371 | differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used | |
372 | to initialize another object, whereas a TARGET_EXPR can either | |
373 | initialize another object or create its own temporary object, and as a | |
374 | result building up a TARGET_EXPR requires that the type's destructor be | |
375 | callable. */ | |
e92cc029 | 376 | |
8d08fdba | 377 | tree |
362115a9 | 378 | build_aggr_init_expr (tree type, tree init, tsubst_flags_t complain) |
8d08fdba | 379 | { |
e1376b00 | 380 | tree fn; |
e8abc66f MS |
381 | tree slot; |
382 | tree rval; | |
4977bab6 | 383 | int is_ctor; |
e8abc66f | 384 | |
27b8d0cd MM |
385 | /* Make sure that we're not trying to create an instance of an |
386 | abstract class. */ | |
3cf0ca23 | 387 | if (abstract_virtuals_error_sfinae (NULL_TREE, type, complain)) |
362115a9 | 388 | return error_mark_node; |
27b8d0cd | 389 | |
5039610b SL |
390 | if (TREE_CODE (init) == CALL_EXPR) |
391 | fn = CALL_EXPR_FN (init); | |
392 | else if (TREE_CODE (init) == AGGR_INIT_EXPR) | |
393 | fn = AGGR_INIT_EXPR_FN (init); | |
394 | else | |
06126ca2 | 395 | return convert (type, init); |
c11b6f21 | 396 | |
4977bab6 ZW |
397 | is_ctor = (TREE_CODE (fn) == ADDR_EXPR |
398 | && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL | |
399 | && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0))); | |
400 | ||
e1376b00 MM |
401 | /* We split the CALL_EXPR into its function and its arguments here. |
402 | Then, in expand_expr, we put them back together. The reason for | |
403 | this is that this expression might be a default argument | |
404 | expression. In that case, we need a new temporary every time the | |
405 | expression is used. That's what break_out_target_exprs does; it | |
406 | replaces every AGGR_INIT_EXPR with a copy that uses a fresh | |
407 | temporary slot. Then, expand_expr builds up a call-expression | |
408 | using the new slot. */ | |
4977bab6 ZW |
409 | |
410 | /* If we don't need to use a constructor to create an object of this | |
411 | type, don't mess with AGGR_INIT_EXPR. */ | |
412 | if (is_ctor || TREE_ADDRESSABLE (type)) | |
413 | { | |
844ae01d JM |
414 | slot = build_local_temp (type); |
415 | ||
5039610b SL |
416 | if (TREE_CODE(init) == CALL_EXPR) |
417 | rval = build_aggr_init_array (void_type_node, fn, slot, | |
418 | call_expr_nargs (init), | |
419 | CALL_EXPR_ARGP (init)); | |
420 | else | |
421 | rval = build_aggr_init_array (void_type_node, fn, slot, | |
422 | aggr_init_expr_nargs (init), | |
423 | AGGR_INIT_EXPR_ARGP (init)); | |
4977bab6 ZW |
424 | TREE_SIDE_EFFECTS (rval) = 1; |
425 | AGGR_INIT_VIA_CTOR_P (rval) = is_ctor; | |
d8a0d13e | 426 | TREE_NOTHROW (rval) = TREE_NOTHROW (init); |
4977bab6 ZW |
427 | } |
428 | else | |
429 | rval = init; | |
430 | ||
844ae01d JM |
431 | return rval; |
432 | } | |
433 | ||
434 | /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its | |
435 | target. TYPE is the type that this initialization should appear to | |
436 | have. | |
437 | ||
438 | Build an encapsulation of the initialization to perform | |
439 | and return it so that it can be processed by language-independent | |
440 | and language-specific expression expanders. */ | |
441 | ||
442 | tree | |
362115a9 | 443 | build_cplus_new (tree type, tree init, tsubst_flags_t complain) |
844ae01d | 444 | { |
362115a9 | 445 | tree rval = build_aggr_init_expr (type, init, complain); |
844ae01d JM |
446 | tree slot; |
447 | ||
448 | if (TREE_CODE (rval) == AGGR_INIT_EXPR) | |
449 | slot = AGGR_INIT_EXPR_SLOT (rval); | |
236fd18c JM |
450 | else if (TREE_CODE (rval) == CALL_EXPR |
451 | || TREE_CODE (rval) == CONSTRUCTOR) | |
844ae01d JM |
452 | slot = build_local_temp (type); |
453 | else | |
454 | return rval; | |
455 | ||
9d85d30c | 456 | rval = build_target_expr (slot, rval); |
c08cd4c1 | 457 | TARGET_EXPR_IMPLICIT_P (rval) = 1; |
8d08fdba | 458 | |
8d08fdba MS |
459 | return rval; |
460 | } | |
461 | ||
262a7d6b JM |
462 | /* Subroutine of build_vec_init_expr: Build up a single element |
463 | intialization as a proxy for the full array initialization to get things | |
464 | marked as used and any appropriate diagnostics. | |
465 | ||
466 | Since we're deferring building the actual constructor calls until | |
467 | gimplification time, we need to build one now and throw it away so | |
468 | that the relevant constructor gets mark_used before cgraph decides | |
469 | what functions are needed. Here we assume that init is either | |
470 | NULL_TREE, void_type_node (indicating value-initialization), or | |
471 | another array to copy. */ | |
472 | ||
473 | static tree | |
474 | build_vec_init_elt (tree type, tree init) | |
475 | { | |
476 | tree inner_type = strip_array_types (type); | |
477 | VEC(tree,gc) *argvec; | |
478 | ||
479 | if (integer_zerop (array_type_nelts_total (type)) | |
480 | || !CLASS_TYPE_P (inner_type)) | |
481 | /* No interesting initialization to do. */ | |
482 | return integer_zero_node; | |
483 | else if (init == void_type_node) | |
484 | return build_value_init (inner_type, tf_warning_or_error); | |
485 | ||
486 | gcc_assert (init == NULL_TREE | |
487 | || (same_type_ignoring_top_level_qualifiers_p | |
488 | (type, TREE_TYPE (init)))); | |
489 | ||
490 | argvec = make_tree_vector (); | |
491 | if (init) | |
492 | { | |
493 | tree dummy = build_dummy_object (inner_type); | |
494 | if (!real_lvalue_p (init)) | |
495 | dummy = move (dummy); | |
496 | VEC_quick_push (tree, argvec, dummy); | |
497 | } | |
498 | return build_special_member_call (NULL_TREE, complete_ctor_identifier, | |
499 | &argvec, inner_type, LOOKUP_NORMAL, | |
500 | tf_warning_or_error); | |
501 | } | |
502 | ||
534ecb17 JM |
503 | /* Return a TARGET_EXPR which expresses the initialization of an array to |
504 | be named later, either default-initialization or copy-initialization | |
505 | from another array of the same type. */ | |
d5f4eddd JM |
506 | |
507 | tree | |
534ecb17 | 508 | build_vec_init_expr (tree type, tree init) |
d5f4eddd | 509 | { |
534ecb17 | 510 | tree slot; |
4de2f020 | 511 | bool value_init = false; |
262a7d6b | 512 | tree elt_init = build_vec_init_elt (type, init); |
534ecb17 | 513 | |
262a7d6b | 514 | if (init == void_type_node) |
534ecb17 | 515 | { |
4de2f020 JM |
516 | value_init = true; |
517 | init = NULL_TREE; | |
518 | } | |
534ecb17 JM |
519 | |
520 | slot = build_local_temp (type); | |
d5f4eddd JM |
521 | init = build2 (VEC_INIT_EXPR, type, slot, init); |
522 | SET_EXPR_LOCATION (init, input_location); | |
4de2f020 | 523 | |
262a7d6b JM |
524 | if (cxx_dialect >= cxx0x |
525 | && potential_constant_expression (elt_init)) | |
526 | VEC_INIT_EXPR_IS_CONSTEXPR (init) = true; | |
4de2f020 JM |
527 | VEC_INIT_EXPR_VALUE_INIT (init) = value_init; |
528 | ||
d5f4eddd JM |
529 | init = build_target_expr (slot, init); |
530 | TARGET_EXPR_IMPLICIT_P (init) = 1; | |
531 | ||
532 | return init; | |
533 | } | |
534 | ||
262a7d6b JM |
535 | /* Give a helpful diagnostic for a non-constexpr VEC_INIT_EXPR in a context |
536 | that requires a constant expression. */ | |
537 | ||
538 | void | |
539 | diagnose_non_constexpr_vec_init (tree expr) | |
540 | { | |
541 | tree type = TREE_TYPE (VEC_INIT_EXPR_SLOT (expr)); | |
542 | tree init, elt_init; | |
543 | if (VEC_INIT_EXPR_VALUE_INIT (expr)) | |
544 | init = void_zero_node; | |
545 | else | |
546 | init = VEC_INIT_EXPR_INIT (expr); | |
547 | ||
548 | elt_init = build_vec_init_elt (type, init); | |
549 | require_potential_constant_expression (elt_init); | |
550 | } | |
551 | ||
534ecb17 JM |
552 | tree |
553 | build_array_copy (tree init) | |
554 | { | |
555 | return build_vec_init_expr (TREE_TYPE (init), init); | |
556 | } | |
557 | ||
ab93b543 | 558 | /* Build a TARGET_EXPR using INIT to initialize a new temporary of the |
c506ca22 | 559 | indicated TYPE. */ |
aa36c081 JM |
560 | |
561 | tree | |
b57b79f7 | 562 | build_target_expr_with_type (tree init, tree type) |
aa36c081 | 563 | { |
50bc768d | 564 | gcc_assert (!VOID_TYPE_P (type)); |
59445d74 | 565 | |
309714d4 JM |
566 | if (TREE_CODE (init) == TARGET_EXPR |
567 | || init == error_mark_node) | |
5062dbd5 | 568 | return init; |
d758e847 | 569 | else if (CLASS_TYPE_P (type) && type_has_nontrivial_copy_init (type) |
7efc22ea | 570 | && !VOID_TYPE_P (TREE_TYPE (init)) |
4b5aa881 | 571 | && TREE_CODE (init) != COND_EXPR |
662eceda MM |
572 | && TREE_CODE (init) != CONSTRUCTOR |
573 | && TREE_CODE (init) != VA_ARG_EXPR) | |
7efc22ea JM |
574 | /* We need to build up a copy constructor call. A void initializer |
575 | means we're being called from bot_manip. COND_EXPR is a special | |
182609b5 | 576 | case because we already have copies on the arms and we don't want |
4b5aa881 | 577 | another one here. A CONSTRUCTOR is aggregate initialization, which |
662eceda MM |
578 | is handled separately. A VA_ARG_EXPR is magic creation of an |
579 | aggregate; there's no additional work to be done. */ | |
182609b5 | 580 | return force_rvalue (init); |
5062dbd5 | 581 | |
357d956e | 582 | return force_target_expr (type, init); |
a6f86b51 | 583 | } |
aa36c081 | 584 | |
a6f86b51 JM |
585 | /* Like the above function, but without the checking. This function should |
586 | only be used by code which is deliberately trying to subvert the type | |
d758e847 JM |
587 | system, such as call_builtin_trap. Or build_over_call, to avoid |
588 | infinite recursion. */ | |
a6f86b51 JM |
589 | |
590 | tree | |
591 | force_target_expr (tree type, tree init) | |
592 | { | |
59445d74 RH |
593 | tree slot; |
594 | ||
50bc768d | 595 | gcc_assert (!VOID_TYPE_P (type)); |
59445d74 RH |
596 | |
597 | slot = build_local_temp (type); | |
a6f86b51 | 598 | return build_target_expr (slot, init); |
aa36c081 JM |
599 | } |
600 | ||
c506ca22 MM |
601 | /* Like build_target_expr_with_type, but use the type of INIT. */ |
602 | ||
603 | tree | |
b57b79f7 | 604 | get_target_expr (tree init) |
c506ca22 | 605 | { |
450a927a JM |
606 | if (TREE_CODE (init) == AGGR_INIT_EXPR) |
607 | return build_target_expr (AGGR_INIT_EXPR_SLOT (init), init); | |
608 | else | |
609 | return build_target_expr_with_type (init, TREE_TYPE (init)); | |
c506ca22 MM |
610 | } |
611 | ||
e1039697 MM |
612 | /* If EXPR is a bitfield reference, convert it to the declared type of |
613 | the bitfield, and return the resulting expression. Otherwise, | |
614 | return EXPR itself. */ | |
615 | ||
616 | tree | |
617 | convert_bitfield_to_declared_type (tree expr) | |
618 | { | |
619 | tree bitfield_type; | |
620 | ||
621 | bitfield_type = is_bitfield_expr_with_lowered_type (expr); | |
622 | if (bitfield_type) | |
41990f96 MM |
623 | expr = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type), |
624 | expr); | |
e1039697 MM |
625 | return expr; |
626 | } | |
627 | ||
5cc53d4e MM |
628 | /* EXPR is being used in an rvalue context. Return a version of EXPR |
629 | that is marked as an rvalue. */ | |
630 | ||
631 | tree | |
632 | rvalue (tree expr) | |
633 | { | |
41990f96 MM |
634 | tree type; |
635 | ||
636 | if (error_operand_p (expr)) | |
637 | return expr; | |
638 | ||
03a904b5 JJ |
639 | expr = mark_rvalue_use (expr); |
640 | ||
41990f96 MM |
641 | /* [basic.lval] |
642 | ||
643 | Non-class rvalues always have cv-unqualified types. */ | |
644 | type = TREE_TYPE (expr); | |
36c37128 JM |
645 | if (!CLASS_TYPE_P (type) && cv_qualified_p (type)) |
646 | type = cv_unqualified (type); | |
41990f96 | 647 | |
b9c6b842 JM |
648 | /* We need to do this for rvalue refs as well to get the right answer |
649 | from decltype; see c++/36628. */ | |
650 | if (!processing_template_decl && lvalue_or_rvalue_with_address_p (expr)) | |
41990f96 MM |
651 | expr = build1 (NON_LVALUE_EXPR, type, expr); |
652 | else if (type != TREE_TYPE (expr)) | |
653 | expr = build_nop (type, expr); | |
654 | ||
5cc53d4e MM |
655 | return expr; |
656 | } | |
657 | ||
8d08fdba | 658 | \f |
06d40de8 DG |
659 | /* Hash an ARRAY_TYPE. K is really of type `tree'. */ |
660 | ||
661 | static hashval_t | |
662 | cplus_array_hash (const void* k) | |
663 | { | |
664 | hashval_t hash; | |
741ac903 | 665 | const_tree const t = (const_tree) k; |
06d40de8 | 666 | |
eb9c434c JJ |
667 | hash = TYPE_UID (TREE_TYPE (t)); |
668 | if (TYPE_DOMAIN (t)) | |
669 | hash ^= TYPE_UID (TYPE_DOMAIN (t)); | |
06d40de8 DG |
670 | return hash; |
671 | } | |
672 | ||
673 | typedef struct cplus_array_info { | |
674 | tree type; | |
675 | tree domain; | |
676 | } cplus_array_info; | |
677 | ||
678 | /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really | |
679 | of type `cplus_array_info*'. */ | |
680 | ||
681 | static int | |
682 | cplus_array_compare (const void * k1, const void * k2) | |
683 | { | |
741ac903 KG |
684 | const_tree const t1 = (const_tree) k1; |
685 | const cplus_array_info *const t2 = (const cplus_array_info*) k2; | |
06d40de8 | 686 | |
714f2304 | 687 | return (TREE_TYPE (t1) == t2->type && TYPE_DOMAIN (t1) == t2->domain); |
06d40de8 DG |
688 | } |
689 | ||
38e40fcd JM |
690 | /* Hash table containing dependent array types, which are unsuitable for |
691 | the language-independent type hash table. */ | |
06d40de8 DG |
692 | static GTY ((param_is (union tree_node))) htab_t cplus_array_htab; |
693 | ||
38e40fcd | 694 | /* Like build_array_type, but handle special C++ semantics. */ |
06d40de8 | 695 | |
38e40fcd JM |
696 | tree |
697 | build_cplus_array_type (tree elt_type, tree index_type) | |
8d08fdba | 698 | { |
8d08fdba MS |
699 | tree t; |
700 | ||
adecb3f4 MM |
701 | if (elt_type == error_mark_node || index_type == error_mark_node) |
702 | return error_mark_node; | |
703 | ||
6da06848 JJ |
704 | if (processing_template_decl |
705 | && (dependent_type_p (elt_type) | |
706 | || (index_type && !TREE_CONSTANT (TYPE_MAX_VALUE (index_type))))) | |
5566b478 | 707 | { |
06d40de8 DG |
708 | void **e; |
709 | cplus_array_info cai; | |
710 | hashval_t hash; | |
714f2304 | 711 | |
06d40de8 DG |
712 | if (cplus_array_htab == NULL) |
713 | cplus_array_htab = htab_create_ggc (61, &cplus_array_hash, | |
714 | &cplus_array_compare, NULL); | |
715 | ||
eb9c434c JJ |
716 | hash = TYPE_UID (elt_type); |
717 | if (index_type) | |
718 | hash ^= TYPE_UID (index_type); | |
06d40de8 DG |
719 | cai.type = elt_type; |
720 | cai.domain = index_type; | |
721 | ||
722 | e = htab_find_slot_with_hash (cplus_array_htab, &cai, hash, INSERT); | |
723 | if (*e) | |
714f2304 | 724 | /* We have found the type: we're done. */ |
06d40de8 DG |
725 | return (tree) *e; |
726 | else | |
727 | { | |
714f2304 | 728 | /* Build a new array type. */ |
7ecbca9d | 729 | t = cxx_make_type (ARRAY_TYPE); |
06d40de8 DG |
730 | TREE_TYPE (t) = elt_type; |
731 | TYPE_DOMAIN (t) = index_type; | |
732 | ||
714f2304 DG |
733 | /* Store it in the hash table. */ |
734 | *e = t; | |
735 | ||
736 | /* Set the canonical type for this new node. */ | |
06d40de8 DG |
737 | if (TYPE_STRUCTURAL_EQUALITY_P (elt_type) |
738 | || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type))) | |
739 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
740 | else if (TYPE_CANONICAL (elt_type) != elt_type | |
741 | || (index_type | |
742 | && TYPE_CANONICAL (index_type) != index_type)) | |
714f2304 DG |
743 | TYPE_CANONICAL (t) |
744 | = build_cplus_array_type | |
745 | (TYPE_CANONICAL (elt_type), | |
6da06848 | 746 | index_type ? TYPE_CANONICAL (index_type) : index_type); |
714f2304 DG |
747 | else |
748 | TYPE_CANONICAL (t) = t; | |
06d40de8 | 749 | } |
5566b478 MS |
750 | } |
751 | else | |
80661759 | 752 | t = build_array_type (elt_type, index_type); |
8d08fdba | 753 | |
38e40fcd JM |
754 | /* We want TYPE_MAIN_VARIANT of an array to strip cv-quals from the |
755 | element type as well, so fix it up if needed. */ | |
756 | if (elt_type != TYPE_MAIN_VARIANT (elt_type)) | |
757 | { | |
758 | tree m = build_cplus_array_type (TYPE_MAIN_VARIANT (elt_type), | |
759 | index_type); | |
760 | if (TYPE_MAIN_VARIANT (t) != m) | |
761 | { | |
762 | TYPE_MAIN_VARIANT (t) = m; | |
763 | TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m); | |
764 | TYPE_NEXT_VARIANT (m) = t; | |
765 | } | |
766 | } | |
767 | ||
8d08fdba MS |
768 | /* Push these needs up so that initialization takes place |
769 | more easily. */ | |
9f63daea | 770 | TYPE_NEEDS_CONSTRUCTING (t) |
db3626d1 | 771 | = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type)); |
9f63daea | 772 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
834c6dff | 773 | = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type)); |
8d08fdba MS |
774 | return t; |
775 | } | |
e349ee73 | 776 | |
09357846 JM |
777 | /* Return an ARRAY_TYPE with element type ELT and length N. */ |
778 | ||
779 | tree | |
780 | build_array_of_n_type (tree elt, int n) | |
781 | { | |
782 | return build_cplus_array_type (elt, build_index_type (size_int (n - 1))); | |
783 | } | |
784 | ||
8af2fec4 RY |
785 | /* Return a reference type node referring to TO_TYPE. If RVAL is |
786 | true, return an rvalue reference type, otherwise return an lvalue | |
787 | reference type. If a type node exists, reuse it, otherwise create | |
788 | a new one. */ | |
789 | tree | |
790 | cp_build_reference_type (tree to_type, bool rval) | |
791 | { | |
792 | tree lvalue_ref, t; | |
793 | lvalue_ref = build_reference_type (to_type); | |
794 | if (!rval) | |
795 | return lvalue_ref; | |
796 | ||
797 | /* This code to create rvalue reference types is based on and tied | |
798 | to the code creating lvalue reference types in the middle-end | |
799 | functions build_reference_type_for_mode and build_reference_type. | |
800 | ||
801 | It works by putting the rvalue reference type nodes after the | |
802 | lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so | |
803 | they will effectively be ignored by the middle end. */ | |
804 | ||
805 | for (t = lvalue_ref; (t = TYPE_NEXT_REF_TO (t)); ) | |
806 | if (TYPE_REF_IS_RVALUE (t)) | |
807 | return t; | |
808 | ||
22521c89 | 809 | t = build_distinct_type_copy (lvalue_ref); |
8af2fec4 RY |
810 | |
811 | TYPE_REF_IS_RVALUE (t) = true; | |
812 | TYPE_NEXT_REF_TO (t) = TYPE_NEXT_REF_TO (lvalue_ref); | |
813 | TYPE_NEXT_REF_TO (lvalue_ref) = t; | |
8af2fec4 RY |
814 | |
815 | if (TYPE_STRUCTURAL_EQUALITY_P (to_type)) | |
816 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
817 | else if (TYPE_CANONICAL (to_type) != to_type) | |
818 | TYPE_CANONICAL (t) | |
819 | = cp_build_reference_type (TYPE_CANONICAL (to_type), rval); | |
820 | else | |
821 | TYPE_CANONICAL (t) = t; | |
822 | ||
823 | layout_type (t); | |
824 | ||
825 | return t; | |
826 | ||
827 | } | |
828 | ||
d5f4eddd JM |
829 | /* Returns EXPR cast to rvalue reference type, like std::move. */ |
830 | ||
831 | tree | |
832 | move (tree expr) | |
833 | { | |
834 | tree type = TREE_TYPE (expr); | |
835 | gcc_assert (TREE_CODE (type) != REFERENCE_TYPE); | |
836 | type = cp_build_reference_type (type, /*rval*/true); | |
837 | return build_static_cast (type, expr, tf_warning_or_error); | |
838 | } | |
839 | ||
9ae165a0 DG |
840 | /* Used by the C++ front end to build qualified array types. However, |
841 | the C version of this function does not properly maintain canonical | |
842 | types (which are not used in C). */ | |
843 | tree | |
844 | c_build_qualified_type (tree type, int type_quals) | |
845 | { | |
846 | return cp_build_qualified_type (type, type_quals); | |
847 | } | |
8af2fec4 | 848 | |
8d08fdba | 849 | \f |
adecb3f4 MM |
850 | /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles |
851 | arrays correctly. In particular, if TYPE is an array of T's, and | |
c2ea3a40 | 852 | TYPE_QUALS is non-empty, returns an array of qualified T's. |
9f63daea | 853 | |
39a13be5 | 854 | FLAGS determines how to deal with ill-formed qualifications. If |
4f2b0fb2 NS |
855 | tf_ignore_bad_quals is set, then bad qualifications are dropped |
856 | (this is permitted if TYPE was introduced via a typedef or template | |
857 | type parameter). If bad qualifications are dropped and tf_warning | |
858 | is set, then a warning is issued for non-const qualifications. If | |
859 | tf_ignore_bad_quals is not set and tf_error is not set, we | |
860 | return error_mark_node. Otherwise, we issue an error, and ignore | |
861 | the qualifications. | |
862 | ||
863 | Qualification of a reference type is valid when the reference came | |
864 | via a typedef or template type argument. [dcl.ref] No such | |
865 | dispensation is provided for qualifying a function type. [dcl.fct] | |
866 | DR 295 queries this and the proposed resolution brings it into line | |
34cd5ae7 | 867 | with qualifying a reference. We implement the DR. We also behave |
4f2b0fb2 | 868 | in a similar manner for restricting non-pointer types. */ |
9f63daea | 869 | |
f376e137 | 870 | tree |
9f63daea | 871 | cp_build_qualified_type_real (tree type, |
0cbd7506 MS |
872 | int type_quals, |
873 | tsubst_flags_t complain) | |
f376e137 | 874 | { |
2adeacc9 | 875 | tree result; |
4f2b0fb2 | 876 | int bad_quals = TYPE_UNQUALIFIED; |
2adeacc9 | 877 | |
e76a2646 MS |
878 | if (type == error_mark_node) |
879 | return type; | |
e271912d | 880 | |
89d684bb | 881 | if (type_quals == cp_type_quals (type)) |
e271912d JM |
882 | return type; |
883 | ||
4f2b0fb2 | 884 | if (TREE_CODE (type) == ARRAY_TYPE) |
f376e137 | 885 | { |
db3626d1 MM |
886 | /* In C++, the qualification really applies to the array element |
887 | type. Obtain the appropriately qualified element type. */ | |
888 | tree t; | |
9f63daea EC |
889 | tree element_type |
890 | = cp_build_qualified_type_real (TREE_TYPE (type), | |
db3626d1 MM |
891 | type_quals, |
892 | complain); | |
893 | ||
894 | if (element_type == error_mark_node) | |
adecb3f4 | 895 | return error_mark_node; |
f376e137 | 896 | |
38e40fcd JM |
897 | /* See if we already have an identically qualified type. Tests |
898 | should be equivalent to those in check_qualified_type. */ | |
29fae15c | 899 | for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t)) |
ef765996 | 900 | if (TREE_TYPE (t) == element_type |
29fae15c | 901 | && TYPE_NAME (t) == TYPE_NAME (type) |
38e40fcd JM |
902 | && TYPE_CONTEXT (t) == TYPE_CONTEXT (type) |
903 | && attribute_list_equal (TYPE_ATTRIBUTES (t), | |
904 | TYPE_ATTRIBUTES (type))) | |
29fae15c | 905 | break; |
9f63daea | 906 | |
29fae15c | 907 | if (!t) |
38e40fcd JM |
908 | { |
909 | t = build_cplus_array_type (element_type, TYPE_DOMAIN (type)); | |
910 | ||
911 | /* Keep the typedef name. */ | |
912 | if (TYPE_NAME (t) != TYPE_NAME (type)) | |
913 | { | |
914 | t = build_variant_type_copy (t); | |
915 | TYPE_NAME (t) = TYPE_NAME (type); | |
916 | } | |
917 | } | |
f376e137 | 918 | |
db3626d1 | 919 | /* Even if we already had this variant, we update |
834c6dff | 920 | TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case |
9f63daea EC |
921 | they changed since the variant was originally created. |
922 | ||
db3626d1 MM |
923 | This seems hokey; if there is some way to use a previous |
924 | variant *without* coming through here, | |
925 | TYPE_NEEDS_CONSTRUCTING will never be updated. */ | |
9f63daea | 926 | TYPE_NEEDS_CONSTRUCTING (t) |
db3626d1 | 927 | = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type)); |
9f63daea | 928 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
834c6dff | 929 | = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type)); |
db3626d1 | 930 | return t; |
f376e137 | 931 | } |
2adeacc9 MM |
932 | else if (TYPE_PTRMEMFUNC_P (type)) |
933 | { | |
934 | /* For a pointer-to-member type, we can't just return a | |
935 | cv-qualified version of the RECORD_TYPE. If we do, we | |
4f2b0fb2 | 936 | haven't changed the field that contains the actual pointer to |
2adeacc9 MM |
937 | a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */ |
938 | tree t; | |
939 | ||
940 | t = TYPE_PTRMEMFUNC_FN_TYPE (type); | |
941 | t = cp_build_qualified_type_real (t, type_quals, complain); | |
46cbda4a | 942 | return build_ptrmemfunc_type (t); |
2adeacc9 | 943 | } |
9a3c2683 JJ |
944 | else if (TREE_CODE (type) == TYPE_PACK_EXPANSION) |
945 | { | |
946 | tree t = PACK_EXPANSION_PATTERN (type); | |
947 | ||
948 | t = cp_build_qualified_type_real (t, type_quals, complain); | |
949 | return make_pack_expansion (t); | |
950 | } | |
9f63daea | 951 | |
39a13be5 | 952 | /* A reference or method type shall not be cv-qualified. |
93e1ddcf JM |
953 | [dcl.ref], [dcl.fct]. This used to be an error, but as of DR 295 |
954 | (in CD1) we always ignore extra cv-quals on functions. */ | |
4b011bbf JM |
955 | if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE) |
956 | && (TREE_CODE (type) == REFERENCE_TYPE | |
2872152c | 957 | || TREE_CODE (type) == FUNCTION_TYPE |
4b011bbf JM |
958 | || TREE_CODE (type) == METHOD_TYPE)) |
959 | { | |
93e1ddcf JM |
960 | if (TREE_CODE (type) == REFERENCE_TYPE) |
961 | bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE); | |
4b011bbf JM |
962 | type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE); |
963 | } | |
9f63daea | 964 | |
2872152c JM |
965 | /* But preserve any function-cv-quals on a FUNCTION_TYPE. */ |
966 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
967 | type_quals |= type_memfn_quals (type); | |
968 | ||
4b011bbf | 969 | /* A restrict-qualified type must be a pointer (or reference) |
0d9c0892 | 970 | to object or incomplete type. */ |
4b011bbf JM |
971 | if ((type_quals & TYPE_QUAL_RESTRICT) |
972 | && TREE_CODE (type) != TEMPLATE_TYPE_PARM | |
973 | && TREE_CODE (type) != TYPENAME_TYPE | |
974 | && !POINTER_TYPE_P (type)) | |
975 | { | |
976 | bad_quals |= TYPE_QUAL_RESTRICT; | |
977 | type_quals &= ~TYPE_QUAL_RESTRICT; | |
978 | } | |
979 | ||
93e1ddcf JM |
980 | if (bad_quals == TYPE_UNQUALIFIED |
981 | || (complain & tf_ignore_bad_quals)) | |
4b011bbf | 982 | /*OK*/; |
93e1ddcf | 983 | else if (!(complain & tf_error)) |
4b011bbf | 984 | return error_mark_node; |
4b011bbf JM |
985 | else |
986 | { | |
93e1ddcf JM |
987 | tree bad_type = build_qualified_type (ptr_type_node, bad_quals); |
988 | error ("%qV qualifiers cannot be applied to %qT", | |
989 | bad_type, type); | |
4b011bbf | 990 | } |
9f63daea | 991 | |
2adeacc9 MM |
992 | /* Retrieve (or create) the appropriately qualified variant. */ |
993 | result = build_qualified_type (type, type_quals); | |
994 | ||
995 | /* If this was a pointer-to-method type, and we just made a copy, | |
3cfab7ec GK |
996 | then we need to unshare the record that holds the cached |
997 | pointer-to-member-function type, because these will be distinct | |
998 | between the unqualified and qualified types. */ | |
9f63daea | 999 | if (result != type |
2adeacc9 | 1000 | && TREE_CODE (type) == POINTER_TYPE |
0f67bdf1 JM |
1001 | && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE |
1002 | && TYPE_LANG_SPECIFIC (result) == TYPE_LANG_SPECIFIC (type)) | |
3cfab7ec | 1003 | TYPE_LANG_SPECIFIC (result) = NULL; |
2adeacc9 | 1004 | |
7aa4a1df DG |
1005 | /* We may also have ended up building a new copy of the canonical |
1006 | type of a pointer-to-method type, which could have the same | |
1007 | sharing problem described above. */ | |
1008 | if (TYPE_CANONICAL (result) != TYPE_CANONICAL (type) | |
1009 | && TREE_CODE (type) == POINTER_TYPE | |
1010 | && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE | |
1011 | && (TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result)) | |
1012 | == TYPE_LANG_SPECIFIC (TYPE_CANONICAL (type)))) | |
1013 | TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result)) = NULL; | |
7aa4a1df | 1014 | |
2adeacc9 | 1015 | return result; |
f376e137 | 1016 | } |
53929c47 | 1017 | |
164247b0 JM |
1018 | /* Return TYPE with const and volatile removed. */ |
1019 | ||
1020 | tree | |
1021 | cv_unqualified (tree type) | |
1022 | { | |
ea8b8aa0 JM |
1023 | int quals; |
1024 | ||
1025 | if (type == error_mark_node) | |
1026 | return type; | |
1027 | ||
a3360e77 | 1028 | quals = cp_type_quals (type); |
164247b0 JM |
1029 | quals &= ~(TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE); |
1030 | return cp_build_qualified_type (type, quals); | |
1031 | } | |
1032 | ||
cd41d410 DS |
1033 | /* Builds a qualified variant of T that is not a typedef variant. |
1034 | E.g. consider the following declarations: | |
1035 | typedef const int ConstInt; | |
1036 | typedef ConstInt* PtrConstInt; | |
1037 | If T is PtrConstInt, this function returns a type representing | |
1038 | const int*. | |
1039 | In other words, if T is a typedef, the function returns the underlying type. | |
1040 | The cv-qualification and attributes of the type returned match the | |
1041 | input type. | |
1042 | They will always be compatible types. | |
1043 | The returned type is built so that all of its subtypes | |
1044 | recursively have their typedefs stripped as well. | |
1045 | ||
1046 | This is different from just returning TYPE_CANONICAL (T) | |
1047 | Because of several reasons: | |
1048 | * If T is a type that needs structural equality | |
1049 | its TYPE_CANONICAL (T) will be NULL. | |
1050 | * TYPE_CANONICAL (T) desn't carry type attributes | |
1051 | and looses template parameter names. */ | |
53929c47 JM |
1052 | |
1053 | tree | |
cd41d410 | 1054 | strip_typedefs (tree t) |
53929c47 | 1055 | { |
cd41d410 DS |
1056 | tree result = NULL, type = NULL, t0 = NULL; |
1057 | ||
1058 | if (!t || t == error_mark_node || t == TYPE_CANONICAL (t)) | |
1059 | return t; | |
1060 | ||
1061 | gcc_assert (TYPE_P (t)); | |
1062 | ||
1063 | switch (TREE_CODE (t)) | |
1064 | { | |
1065 | case POINTER_TYPE: | |
1066 | type = strip_typedefs (TREE_TYPE (t)); | |
1067 | result = build_pointer_type (type); | |
1068 | break; | |
1069 | case REFERENCE_TYPE: | |
1070 | type = strip_typedefs (TREE_TYPE (t)); | |
1071 | result = cp_build_reference_type (type, TYPE_REF_IS_RVALUE (t)); | |
1072 | break; | |
1073 | case OFFSET_TYPE: | |
1074 | t0 = strip_typedefs (TYPE_OFFSET_BASETYPE (t)); | |
1075 | type = strip_typedefs (TREE_TYPE (t)); | |
1076 | result = build_offset_type (t0, type); | |
1077 | break; | |
1078 | case RECORD_TYPE: | |
1079 | if (TYPE_PTRMEMFUNC_P (t)) | |
1080 | { | |
1081 | t0 = strip_typedefs (TYPE_PTRMEMFUNC_FN_TYPE (t)); | |
1082 | result = build_ptrmemfunc_type (t0); | |
1083 | } | |
1084 | break; | |
1085 | case ARRAY_TYPE: | |
1086 | type = strip_typedefs (TREE_TYPE (t)); | |
1087 | t0 = strip_typedefs (TYPE_DOMAIN (t));; | |
1088 | result = build_cplus_array_type (type, t0); | |
1089 | break; | |
1090 | case FUNCTION_TYPE: | |
1091 | case METHOD_TYPE: | |
1092 | { | |
1093 | tree arg_types = NULL, arg_node, arg_type; | |
1094 | for (arg_node = TYPE_ARG_TYPES (t); | |
1095 | arg_node; | |
1096 | arg_node = TREE_CHAIN (arg_node)) | |
1097 | { | |
1098 | if (arg_node == void_list_node) | |
1099 | break; | |
1100 | arg_type = strip_typedefs (TREE_VALUE (arg_node)); | |
1101 | gcc_assert (arg_type); | |
1102 | ||
1103 | arg_types = | |
1104 | tree_cons (TREE_PURPOSE (arg_node), arg_type, arg_types); | |
1105 | } | |
1106 | ||
1107 | if (arg_types) | |
1108 | arg_types = nreverse (arg_types); | |
1109 | ||
1110 | /* A list of parameters not ending with an ellipsis | |
1111 | must end with void_list_node. */ | |
1112 | if (arg_node) | |
1113 | arg_types = chainon (arg_types, void_list_node); | |
1114 | ||
1115 | type = strip_typedefs (TREE_TYPE (t)); | |
1116 | if (TREE_CODE (t) == METHOD_TYPE) | |
1117 | { | |
1118 | tree class_type = TREE_TYPE (TREE_VALUE (arg_types)); | |
1119 | gcc_assert (class_type); | |
1120 | result = | |
1121 | build_method_type_directly (class_type, type, | |
1122 | TREE_CHAIN (arg_types)); | |
1123 | } | |
1124 | else | |
2872152c | 1125 | { |
cd41d410 DS |
1126 | result = build_function_type (type, |
1127 | arg_types); | |
2872152c JM |
1128 | result = apply_memfn_quals (result, type_memfn_quals (t)); |
1129 | } | |
3c3905fc JM |
1130 | |
1131 | if (TYPE_RAISES_EXCEPTIONS (t)) | |
1132 | result = build_exception_variant (result, | |
1133 | TYPE_RAISES_EXCEPTIONS (t)); | |
cd41d410 DS |
1134 | } |
1135 | break; | |
e6c2fc5d DS |
1136 | case TYPENAME_TYPE: |
1137 | result = make_typename_type (strip_typedefs (TYPE_CONTEXT (t)), | |
1138 | TYPENAME_TYPE_FULLNAME (t), | |
1139 | typename_type, tf_none); | |
1140 | break; | |
cd41d410 DS |
1141 | default: |
1142 | break; | |
1143 | } | |
1ad8aeeb | 1144 | |
cd41d410 DS |
1145 | if (!result) |
1146 | result = TYPE_MAIN_VARIANT (t); | |
3c3905fc JM |
1147 | if (TYPE_ATTRIBUTES (t)) |
1148 | result = cp_build_type_attribute_variant (result, TYPE_ATTRIBUTES (t)); | |
cd41d410 | 1149 | return cp_build_qualified_type (result, cp_type_quals (t)); |
53929c47 | 1150 | } |
cd41d410 | 1151 | |
48b45647 NS |
1152 | /* Makes a copy of BINFO and TYPE, which is to be inherited into a |
1153 | graph dominated by T. If BINFO is NULL, TYPE is a dependent base, | |
1154 | and we do a shallow copy. If BINFO is non-NULL, we do a deep copy. | |
1155 | VIRT indicates whether TYPE is inherited virtually or not. | |
1156 | IGO_PREV points at the previous binfo of the inheritance graph | |
1157 | order chain. The newly copied binfo's TREE_CHAIN forms this | |
1158 | ordering. | |
1159 | ||
1160 | The CLASSTYPE_VBASECLASSES vector of T is constructed in the | |
1161 | correct order. That is in the order the bases themselves should be | |
1162 | constructed in. | |
dbbf88d1 NS |
1163 | |
1164 | The BINFO_INHERITANCE of a virtual base class points to the binfo | |
48b45647 NS |
1165 | of the most derived type. ??? We could probably change this so that |
1166 | BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence | |
1167 | remove a field. They currently can only differ for primary virtual | |
1168 | virtual bases. */ | |
dbbf88d1 NS |
1169 | |
1170 | tree | |
48b45647 | 1171 | copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt) |
9a71c18b | 1172 | { |
48b45647 | 1173 | tree new_binfo; |
9a71c18b | 1174 | |
48b45647 NS |
1175 | if (virt) |
1176 | { | |
1177 | /* See if we've already made this virtual base. */ | |
1178 | new_binfo = binfo_for_vbase (type, t); | |
1179 | if (new_binfo) | |
1180 | return new_binfo; | |
1181 | } | |
9f63daea | 1182 | |
fa743e8c | 1183 | new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0); |
48b45647 | 1184 | BINFO_TYPE (new_binfo) = type; |
9a71c18b | 1185 | |
48b45647 NS |
1186 | /* Chain it into the inheritance graph. */ |
1187 | TREE_CHAIN (*igo_prev) = new_binfo; | |
1188 | *igo_prev = new_binfo; | |
9f63daea | 1189 | |
48b45647 | 1190 | if (binfo) |
dfbcd65a | 1191 | { |
fa743e8c NS |
1192 | int ix; |
1193 | tree base_binfo; | |
9f63daea | 1194 | |
50bc768d | 1195 | gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo)); |
539ed333 | 1196 | gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type)); |
9f63daea | 1197 | |
48b45647 NS |
1198 | BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo); |
1199 | BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo); | |
9f63daea | 1200 | |
fa743e8c NS |
1201 | /* We do not need to copy the accesses, as they are read only. */ |
1202 | BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo); | |
9f63daea | 1203 | |
48b45647 | 1204 | /* Recursively copy base binfos of BINFO. */ |
fa743e8c | 1205 | for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++) |
dbbf88d1 | 1206 | { |
48b45647 | 1207 | tree new_base_binfo; |
9f63daea | 1208 | |
50bc768d | 1209 | gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo)); |
48b45647 NS |
1210 | new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo), |
1211 | t, igo_prev, | |
1212 | BINFO_VIRTUAL_P (base_binfo)); | |
9f63daea | 1213 | |
48b45647 NS |
1214 | if (!BINFO_INHERITANCE_CHAIN (new_base_binfo)) |
1215 | BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo; | |
fa743e8c | 1216 | BINFO_BASE_APPEND (new_binfo, new_base_binfo); |
dbbf88d1 | 1217 | } |
9a71c18b | 1218 | } |
48b45647 NS |
1219 | else |
1220 | BINFO_DEPENDENT_BASE_P (new_binfo) = 1; | |
9f63daea | 1221 | |
48b45647 NS |
1222 | if (virt) |
1223 | { | |
1224 | /* Push it onto the list after any virtual bases it contains | |
1225 | will have been pushed. */ | |
1226 | VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo); | |
1227 | BINFO_VIRTUAL_P (new_binfo) = 1; | |
1228 | BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t); | |
1229 | } | |
9f63daea | 1230 | |
48b45647 | 1231 | return new_binfo; |
9a71c18b | 1232 | } |
8d08fdba MS |
1233 | \f |
1234 | /* Hashing of lists so that we don't make duplicates. | |
1235 | The entry point is `list_hash_canon'. */ | |
1236 | ||
8d08fdba MS |
1237 | /* Now here is the hash table. When recording a list, it is added |
1238 | to the slot whose index is the hash code mod the table size. | |
1239 | Note that the hash table is used for several kinds of lists. | |
1240 | While all these live in the same table, they are completely independent, | |
1241 | and the hash code is computed differently for each of these. */ | |
1242 | ||
e2500fed | 1243 | static GTY ((param_is (union tree_node))) htab_t list_hash_table; |
9ccb25d5 | 1244 | |
9f63daea | 1245 | struct list_proxy |
9ccb25d5 MM |
1246 | { |
1247 | tree purpose; | |
1248 | tree value; | |
1249 | tree chain; | |
1250 | }; | |
1251 | ||
1252 | /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy | |
1253 | for a node we are thinking about adding). */ | |
1254 | ||
1255 | static int | |
b57b79f7 | 1256 | list_hash_eq (const void* entry, const void* data) |
9ccb25d5 | 1257 | { |
741ac903 KG |
1258 | const_tree const t = (const_tree) entry; |
1259 | const struct list_proxy *const proxy = (const struct list_proxy *) data; | |
9ccb25d5 MM |
1260 | |
1261 | return (TREE_VALUE (t) == proxy->value | |
1262 | && TREE_PURPOSE (t) == proxy->purpose | |
1263 | && TREE_CHAIN (t) == proxy->chain); | |
1264 | } | |
8d08fdba MS |
1265 | |
1266 | /* Compute a hash code for a list (chain of TREE_LIST nodes | |
1267 | with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the | |
1268 | TREE_COMMON slots), by adding the hash codes of the individual entries. */ | |
1269 | ||
9ccb25d5 | 1270 | static hashval_t |
b57b79f7 | 1271 | list_hash_pieces (tree purpose, tree value, tree chain) |
8d08fdba | 1272 | { |
9ccb25d5 | 1273 | hashval_t hashcode = 0; |
9f63daea | 1274 | |
37c46b43 | 1275 | if (chain) |
fd917e0d | 1276 | hashcode += TREE_HASH (chain); |
9f63daea | 1277 | |
37c46b43 | 1278 | if (value) |
fd917e0d | 1279 | hashcode += TREE_HASH (value); |
8d08fdba MS |
1280 | else |
1281 | hashcode += 1007; | |
37c46b43 | 1282 | if (purpose) |
fd917e0d | 1283 | hashcode += TREE_HASH (purpose); |
8d08fdba MS |
1284 | else |
1285 | hashcode += 1009; | |
1286 | return hashcode; | |
1287 | } | |
1288 | ||
9ccb25d5 | 1289 | /* Hash an already existing TREE_LIST. */ |
8d08fdba | 1290 | |
9ccb25d5 | 1291 | static hashval_t |
b57b79f7 | 1292 | list_hash (const void* p) |
8d08fdba | 1293 | { |
741ac903 | 1294 | const_tree const t = (const_tree) p; |
9f63daea EC |
1295 | return list_hash_pieces (TREE_PURPOSE (t), |
1296 | TREE_VALUE (t), | |
9ccb25d5 | 1297 | TREE_CHAIN (t)); |
8d08fdba MS |
1298 | } |
1299 | ||
51632249 JM |
1300 | /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical |
1301 | object for an identical list if one already exists. Otherwise, build a | |
1302 | new one, and record it as the canonical object. */ | |
8d08fdba | 1303 | |
8d08fdba | 1304 | tree |
b57b79f7 | 1305 | hash_tree_cons (tree purpose, tree value, tree chain) |
8d08fdba | 1306 | { |
a703fb38 | 1307 | int hashcode = 0; |
fad205ff | 1308 | void **slot; |
9ccb25d5 MM |
1309 | struct list_proxy proxy; |
1310 | ||
1311 | /* Hash the list node. */ | |
1312 | hashcode = list_hash_pieces (purpose, value, chain); | |
1313 | /* Create a proxy for the TREE_LIST we would like to create. We | |
1314 | don't actually create it so as to avoid creating garbage. */ | |
1315 | proxy.purpose = purpose; | |
1316 | proxy.value = value; | |
1317 | proxy.chain = chain; | |
1318 | /* See if it is already in the table. */ | |
1319 | slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode, | |
1320 | INSERT); | |
1321 | /* If not, create a new node. */ | |
1322 | if (!*slot) | |
fad205ff | 1323 | *slot = tree_cons (purpose, value, chain); |
67f5655f | 1324 | return (tree) *slot; |
8d08fdba MS |
1325 | } |
1326 | ||
1327 | /* Constructor for hashed lists. */ | |
e92cc029 | 1328 | |
8d08fdba | 1329 | tree |
b57b79f7 | 1330 | hash_tree_chain (tree value, tree chain) |
8d08fdba | 1331 | { |
51632249 | 1332 | return hash_tree_cons (NULL_TREE, value, chain); |
8d08fdba | 1333 | } |
8d08fdba | 1334 | \f |
8d08fdba | 1335 | void |
b57b79f7 | 1336 | debug_binfo (tree elem) |
8d08fdba | 1337 | { |
fed3cef0 | 1338 | HOST_WIDE_INT n; |
8d08fdba MS |
1339 | tree virtuals; |
1340 | ||
90ff44cf KG |
1341 | fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC |
1342 | "\nvtable type:\n", | |
1343 | TYPE_NAME_STRING (BINFO_TYPE (elem)), | |
fed3cef0 | 1344 | TREE_INT_CST_LOW (BINFO_OFFSET (elem))); |
8d08fdba MS |
1345 | debug_tree (BINFO_TYPE (elem)); |
1346 | if (BINFO_VTABLE (elem)) | |
fed3cef0 | 1347 | fprintf (stderr, "vtable decl \"%s\"\n", |
c35cce41 | 1348 | IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem)))); |
8d08fdba MS |
1349 | else |
1350 | fprintf (stderr, "no vtable decl yet\n"); | |
1351 | fprintf (stderr, "virtuals:\n"); | |
da3d4dfa | 1352 | virtuals = BINFO_VIRTUALS (elem); |
1f84ec23 | 1353 | n = 0; |
f30432d7 | 1354 | |
8d08fdba MS |
1355 | while (virtuals) |
1356 | { | |
83f2ccf4 | 1357 | tree fndecl = TREE_VALUE (virtuals); |
71e89f27 | 1358 | fprintf (stderr, "%s [%ld =? %ld]\n", |
8d08fdba | 1359 | IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)), |
71e89f27 | 1360 | (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl))); |
f30432d7 | 1361 | ++n; |
8d08fdba | 1362 | virtuals = TREE_CHAIN (virtuals); |
8d08fdba MS |
1363 | } |
1364 | } | |
1365 | ||
02ed62dd MM |
1366 | /* Build a representation for the qualified name SCOPE::NAME. TYPE is |
1367 | the type of the result expression, if known, or NULL_TREE if the | |
1368 | resulting expression is type-dependent. If TEMPLATE_P is true, | |
1369 | NAME is known to be a template because the user explicitly used the | |
3db45ab5 | 1370 | "template" keyword after the "::". |
02ed62dd MM |
1371 | |
1372 | All SCOPE_REFs should be built by use of this function. */ | |
1373 | ||
1374 | tree | |
1375 | build_qualified_name (tree type, tree scope, tree name, bool template_p) | |
1376 | { | |
1377 | tree t; | |
36569397 MM |
1378 | if (type == error_mark_node |
1379 | || scope == error_mark_node | |
1380 | || name == error_mark_node) | |
1381 | return error_mark_node; | |
02ed62dd MM |
1382 | t = build2 (SCOPE_REF, type, scope, name); |
1383 | QUALIFIED_NAME_IS_TEMPLATE (t) = template_p; | |
7097b3ac JM |
1384 | if (type) |
1385 | t = convert_from_reference (t); | |
02ed62dd MM |
1386 | return t; |
1387 | } | |
1388 | ||
3b426391 | 1389 | /* Returns nonzero if X is an expression for a (possibly overloaded) |
eff3a276 MM |
1390 | function. If "f" is a function or function template, "f", "c->f", |
1391 | "c.f", "C::f", and "f<int>" will all be considered possibly | |
1392 | overloaded functions. Returns 2 if the function is actually | |
b9704fc5 | 1393 | overloaded, i.e., if it is impossible to know the type of the |
eff3a276 MM |
1394 | function without performing overload resolution. */ |
1395 | ||
8d08fdba | 1396 | int |
b57b79f7 | 1397 | is_overloaded_fn (tree x) |
8d08fdba | 1398 | { |
4bb0968f | 1399 | /* A baselink is also considered an overloaded function. */ |
ccbe00a4 JM |
1400 | if (TREE_CODE (x) == OFFSET_REF |
1401 | || TREE_CODE (x) == COMPONENT_REF) | |
05e0b2f4 | 1402 | x = TREE_OPERAND (x, 1); |
4bb0968f | 1403 | if (BASELINK_P (x)) |
da15dae6 | 1404 | x = BASELINK_FUNCTIONS (x); |
d095e03c JM |
1405 | if (TREE_CODE (x) == TEMPLATE_ID_EXPR) |
1406 | x = TREE_OPERAND (x, 0); | |
1407 | if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x)) | |
eff3a276 MM |
1408 | || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x))) |
1409 | return 2; | |
1410 | return (TREE_CODE (x) == FUNCTION_DECL | |
1411 | || TREE_CODE (x) == OVERLOAD); | |
8d08fdba MS |
1412 | } |
1413 | ||
eff3a276 MM |
1414 | /* Returns true iff X is an expression for an overloaded function |
1415 | whose type cannot be known without performing overload | |
1416 | resolution. */ | |
1417 | ||
1418 | bool | |
b57b79f7 | 1419 | really_overloaded_fn (tree x) |
9f63daea | 1420 | { |
eff3a276 | 1421 | return is_overloaded_fn (x) == 2; |
8926095f MS |
1422 | } |
1423 | ||
8d08fdba | 1424 | tree |
294e855f | 1425 | get_fns (tree from) |
8d08fdba | 1426 | { |
50bc768d | 1427 | gcc_assert (is_overloaded_fn (from)); |
c6002625 | 1428 | /* A baselink is also considered an overloaded function. */ |
7e361ae6 JM |
1429 | if (TREE_CODE (from) == OFFSET_REF |
1430 | || TREE_CODE (from) == COMPONENT_REF) | |
ccbe00a4 | 1431 | from = TREE_OPERAND (from, 1); |
4bb0968f | 1432 | if (BASELINK_P (from)) |
da15dae6 | 1433 | from = BASELINK_FUNCTIONS (from); |
d095e03c JM |
1434 | if (TREE_CODE (from) == TEMPLATE_ID_EXPR) |
1435 | from = TREE_OPERAND (from, 0); | |
294e855f JM |
1436 | return from; |
1437 | } | |
1438 | ||
1439 | tree | |
1440 | get_first_fn (tree from) | |
1441 | { | |
1442 | return OVL_CURRENT (get_fns (from)); | |
2c73f9f5 | 1443 | } |
8d08fdba | 1444 | |
c6002625 | 1445 | /* Return a new OVL node, concatenating it with the old one. */ |
2c73f9f5 ML |
1446 | |
1447 | tree | |
b57b79f7 | 1448 | ovl_cons (tree decl, tree chain) |
2c73f9f5 ML |
1449 | { |
1450 | tree result = make_node (OVERLOAD); | |
1451 | TREE_TYPE (result) = unknown_type_node; | |
1452 | OVL_FUNCTION (result) = decl; | |
1453 | TREE_CHAIN (result) = chain; | |
9f63daea | 1454 | |
2c73f9f5 ML |
1455 | return result; |
1456 | } | |
1457 | ||
2c73f9f5 ML |
1458 | /* Build a new overloaded function. If this is the first one, |
1459 | just return it; otherwise, ovl_cons the _DECLs */ | |
1460 | ||
1461 | tree | |
b57b79f7 | 1462 | build_overload (tree decl, tree chain) |
2c73f9f5 | 1463 | { |
161c12b0 | 1464 | if (! chain && TREE_CODE (decl) != TEMPLATE_DECL) |
2c73f9f5 | 1465 | return decl; |
2c73f9f5 ML |
1466 | return ovl_cons (decl, chain); |
1467 | } | |
1468 | ||
8d08fdba MS |
1469 | \f |
1470 | #define PRINT_RING_SIZE 4 | |
1471 | ||
f41c4af3 JM |
1472 | static const char * |
1473 | cxx_printable_name_internal (tree decl, int v, bool translate) | |
8d08fdba | 1474 | { |
1bde0042 | 1475 | static unsigned int uid_ring[PRINT_RING_SIZE]; |
8d08fdba | 1476 | static char *print_ring[PRINT_RING_SIZE]; |
f41c4af3 | 1477 | static bool trans_ring[PRINT_RING_SIZE]; |
8d08fdba MS |
1478 | static int ring_counter; |
1479 | int i; | |
1480 | ||
1481 | /* Only cache functions. */ | |
2ba25f50 MS |
1482 | if (v < 2 |
1483 | || TREE_CODE (decl) != FUNCTION_DECL | |
8d08fdba | 1484 | || DECL_LANG_SPECIFIC (decl) == 0) |
f41c4af3 | 1485 | return lang_decl_name (decl, v, translate); |
8d08fdba MS |
1486 | |
1487 | /* See if this print name is lying around. */ | |
1488 | for (i = 0; i < PRINT_RING_SIZE; i++) | |
f41c4af3 | 1489 | if (uid_ring[i] == DECL_UID (decl) && translate == trans_ring[i]) |
8d08fdba MS |
1490 | /* yes, so return it. */ |
1491 | return print_ring[i]; | |
1492 | ||
1493 | if (++ring_counter == PRINT_RING_SIZE) | |
1494 | ring_counter = 0; | |
1495 | ||
1496 | if (current_function_decl != NULL_TREE) | |
1497 | { | |
8fa6fa79 JM |
1498 | /* There may be both translated and untranslated versions of the |
1499 | name cached. */ | |
1500 | for (i = 0; i < 2; i++) | |
1501 | { | |
1502 | if (uid_ring[ring_counter] == DECL_UID (current_function_decl)) | |
1503 | ring_counter += 1; | |
1504 | if (ring_counter == PRINT_RING_SIZE) | |
1505 | ring_counter = 0; | |
1506 | } | |
1bde0042 | 1507 | gcc_assert (uid_ring[ring_counter] != DECL_UID (current_function_decl)); |
8d08fdba MS |
1508 | } |
1509 | ||
1510 | if (print_ring[ring_counter]) | |
1511 | free (print_ring[ring_counter]); | |
1512 | ||
f41c4af3 | 1513 | print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v, translate)); |
1bde0042 | 1514 | uid_ring[ring_counter] = DECL_UID (decl); |
f41c4af3 | 1515 | trans_ring[ring_counter] = translate; |
8d08fdba MS |
1516 | return print_ring[ring_counter]; |
1517 | } | |
f41c4af3 JM |
1518 | |
1519 | const char * | |
1520 | cxx_printable_name (tree decl, int v) | |
1521 | { | |
1522 | return cxx_printable_name_internal (decl, v, false); | |
1523 | } | |
1524 | ||
1525 | const char * | |
1526 | cxx_printable_name_translate (tree decl, int v) | |
1527 | { | |
1528 | return cxx_printable_name_internal (decl, v, true); | |
1529 | } | |
8d08fdba | 1530 | \f |
f30432d7 | 1531 | /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions |
8d08fdba | 1532 | listed in RAISES. */ |
e92cc029 | 1533 | |
8d08fdba | 1534 | tree |
b57b79f7 | 1535 | build_exception_variant (tree type, tree raises) |
8d08fdba | 1536 | { |
3a55fb4c JM |
1537 | tree v; |
1538 | int type_quals; | |
8d08fdba | 1539 | |
3a55fb4c JM |
1540 | if (comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (type), ce_exact)) |
1541 | return type; | |
1542 | ||
1543 | type_quals = TYPE_QUALS (type); | |
1544 | for (v = TYPE_MAIN_VARIANT (type); v; v = TYPE_NEXT_VARIANT (v)) | |
896c3aa3 | 1545 | if (check_qualified_type (v, type, type_quals) |
3a55fb4c | 1546 | && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), ce_exact)) |
4cc1d462 | 1547 | return v; |
8d08fdba MS |
1548 | |
1549 | /* Need to build a new variant. */ | |
8dd16ecc | 1550 | v = build_variant_type_copy (type); |
8d08fdba MS |
1551 | TYPE_RAISES_EXCEPTIONS (v) = raises; |
1552 | return v; | |
1553 | } | |
1554 | ||
dac65501 KL |
1555 | /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new |
1556 | BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template | |
1899c3a4 | 1557 | arguments. */ |
73b0fce8 KL |
1558 | |
1559 | tree | |
b57b79f7 | 1560 | bind_template_template_parm (tree t, tree newargs) |
73b0fce8 | 1561 | { |
1899c3a4 | 1562 | tree decl = TYPE_NAME (t); |
6b9b6b15 JM |
1563 | tree t2; |
1564 | ||
9e1e64ec | 1565 | t2 = cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM); |
c2255bc4 AH |
1566 | decl = build_decl (input_location, |
1567 | TYPE_DECL, DECL_NAME (decl), NULL_TREE); | |
1899c3a4 | 1568 | |
dac65501 KL |
1569 | /* These nodes have to be created to reflect new TYPE_DECL and template |
1570 | arguments. */ | |
1571 | TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t)); | |
1572 | TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl; | |
1573 | TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2) | |
aa373032 | 1574 | = build_template_info (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t), newargs); |
6b9b6b15 | 1575 | |
1899c3a4 KL |
1576 | TREE_TYPE (decl) = t2; |
1577 | TYPE_NAME (t2) = decl; | |
1578 | TYPE_STUB_DECL (t2) = decl; | |
dac65501 | 1579 | TYPE_SIZE (t2) = 0; |
06d40de8 | 1580 | SET_TYPE_STRUCTURAL_EQUALITY (t2); |
73b0fce8 | 1581 | |
73b0fce8 KL |
1582 | return t2; |
1583 | } | |
1584 | ||
bf3428d0 | 1585 | /* Called from count_trees via walk_tree. */ |
297a5329 JM |
1586 | |
1587 | static tree | |
44de5aeb | 1588 | count_trees_r (tree *tp, int *walk_subtrees, void *data) |
297a5329 | 1589 | { |
44de5aeb RK |
1590 | ++*((int *) data); |
1591 | ||
1592 | if (TYPE_P (*tp)) | |
1593 | *walk_subtrees = 0; | |
1594 | ||
297a5329 JM |
1595 | return NULL_TREE; |
1596 | } | |
1597 | ||
1598 | /* Debugging function for measuring the rough complexity of a tree | |
1599 | representation. */ | |
1600 | ||
1601 | int | |
b57b79f7 | 1602 | count_trees (tree t) |
297a5329 | 1603 | { |
bf3428d0 | 1604 | int n_trees = 0; |
14588106 | 1605 | cp_walk_tree_without_duplicates (&t, count_trees_r, &n_trees); |
297a5329 | 1606 | return n_trees; |
9f63daea | 1607 | } |
297a5329 | 1608 | |
b2244c65 MM |
1609 | /* Called from verify_stmt_tree via walk_tree. */ |
1610 | ||
1611 | static tree | |
9f63daea | 1612 | verify_stmt_tree_r (tree* tp, |
0cbd7506 MS |
1613 | int* walk_subtrees ATTRIBUTE_UNUSED , |
1614 | void* data) | |
b2244c65 MM |
1615 | { |
1616 | tree t = *tp; | |
1617 | htab_t *statements = (htab_t *) data; | |
1618 | void **slot; | |
1619 | ||
009ed910 | 1620 | if (!STATEMENT_CODE_P (TREE_CODE (t))) |
b2244c65 MM |
1621 | return NULL_TREE; |
1622 | ||
1623 | /* If this statement is already present in the hash table, then | |
1624 | there is a circularity in the statement tree. */ | |
315fb5db | 1625 | gcc_assert (!htab_find (*statements, t)); |
9f63daea | 1626 | |
b2244c65 MM |
1627 | slot = htab_find_slot (*statements, t, INSERT); |
1628 | *slot = t; | |
1629 | ||
1630 | return NULL_TREE; | |
1631 | } | |
1632 | ||
1633 | /* Debugging function to check that the statement T has not been | |
1634 | corrupted. For now, this function simply checks that T contains no | |
1635 | circularities. */ | |
1636 | ||
1637 | void | |
b57b79f7 | 1638 | verify_stmt_tree (tree t) |
b2244c65 MM |
1639 | { |
1640 | htab_t statements; | |
1641 | statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL); | |
14588106 | 1642 | cp_walk_tree (&t, verify_stmt_tree_r, &statements, NULL); |
b2244c65 MM |
1643 | htab_delete (statements); |
1644 | } | |
1645 | ||
50a6dbd7 | 1646 | /* Check if the type T depends on a type with no linkage and if so, return |
4684cd27 | 1647 | it. If RELAXED_P then do not consider a class type declared within |
ecc607fc | 1648 | a vague-linkage function to have no linkage. */ |
50a6dbd7 JM |
1649 | |
1650 | tree | |
4684cd27 | 1651 | no_linkage_check (tree t, bool relaxed_p) |
50a6dbd7 | 1652 | { |
caf43ca4 MM |
1653 | tree r; |
1654 | ||
2adeacc9 MM |
1655 | /* There's no point in checking linkage on template functions; we |
1656 | can't know their complete types. */ | |
1657 | if (processing_template_decl) | |
1658 | return NULL_TREE; | |
1659 | ||
caf43ca4 MM |
1660 | switch (TREE_CODE (t)) |
1661 | { | |
1662 | case RECORD_TYPE: | |
1663 | if (TYPE_PTRMEMFUNC_P (t)) | |
1664 | goto ptrmem; | |
e6d92cec JM |
1665 | /* Lambda types that don't have mangling scope have no linkage. We |
1666 | check CLASSTYPE_LAMBDA_EXPR here rather than LAMBDA_TYPE_P because | |
1667 | when we get here from pushtag none of the lambda information is | |
1668 | set up yet, so we want to assume that the lambda has linkage and | |
1669 | fix it up later if not. */ | |
1670 | if (CLASSTYPE_LAMBDA_EXPR (t) | |
1671 | && LAMBDA_TYPE_EXTRA_SCOPE (t) == NULL_TREE) | |
1672 | return t; | |
caf43ca4 MM |
1673 | /* Fall through. */ |
1674 | case UNION_TYPE: | |
1675 | if (!CLASS_TYPE_P (t)) | |
1676 | return NULL_TREE; | |
1677 | /* Fall through. */ | |
1678 | case ENUMERAL_TYPE: | |
ecc607fc | 1679 | /* Only treat anonymous types as having no linkage if they're at |
2f59d9e0 | 1680 | namespace scope. This is core issue 966. */ |
ecc607fc | 1681 | if (TYPE_ANONYMOUS_P (t) && TYPE_NAMESPACE_SCOPE_P (t)) |
caf43ca4 | 1682 | return t; |
ecc607fc | 1683 | |
e6d92cec | 1684 | for (r = CP_TYPE_CONTEXT (t); ; ) |
ecc607fc | 1685 | { |
e6d92cec JM |
1686 | /* If we're a nested type of a !TREE_PUBLIC class, we might not |
1687 | have linkage, or we might just be in an anonymous namespace. | |
1688 | If we're in a TREE_PUBLIC class, we have linkage. */ | |
1689 | if (TYPE_P (r) && !TREE_PUBLIC (TYPE_NAME (r))) | |
1690 | return no_linkage_check (TYPE_CONTEXT (t), relaxed_p); | |
1691 | else if (TREE_CODE (r) == FUNCTION_DECL) | |
1692 | { | |
d6dcdbd5 | 1693 | if (!relaxed_p || !vague_linkage_p (r)) |
e6d92cec JM |
1694 | return t; |
1695 | else | |
1696 | r = CP_DECL_CONTEXT (r); | |
1697 | } | |
ecc607fc | 1698 | else |
e6d92cec | 1699 | break; |
ecc607fc JM |
1700 | } |
1701 | ||
caf43ca4 MM |
1702 | return NULL_TREE; |
1703 | ||
1704 | case ARRAY_TYPE: | |
1705 | case POINTER_TYPE: | |
1706 | case REFERENCE_TYPE: | |
4684cd27 | 1707 | return no_linkage_check (TREE_TYPE (t), relaxed_p); |
caf43ca4 MM |
1708 | |
1709 | case OFFSET_TYPE: | |
1710 | ptrmem: | |
4684cd27 MM |
1711 | r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t), |
1712 | relaxed_p); | |
caf43ca4 MM |
1713 | if (r) |
1714 | return r; | |
4684cd27 | 1715 | return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p); |
caf43ca4 MM |
1716 | |
1717 | case METHOD_TYPE: | |
4684cd27 | 1718 | r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p); |
caf43ca4 MM |
1719 | if (r) |
1720 | return r; | |
1721 | /* Fall through. */ | |
1722 | case FUNCTION_TYPE: | |
1723 | { | |
1724 | tree parm; | |
9f63daea EC |
1725 | for (parm = TYPE_ARG_TYPES (t); |
1726 | parm && parm != void_list_node; | |
caf43ca4 MM |
1727 | parm = TREE_CHAIN (parm)) |
1728 | { | |
4684cd27 | 1729 | r = no_linkage_check (TREE_VALUE (parm), relaxed_p); |
caf43ca4 MM |
1730 | if (r) |
1731 | return r; | |
1732 | } | |
4684cd27 | 1733 | return no_linkage_check (TREE_TYPE (t), relaxed_p); |
caf43ca4 MM |
1734 | } |
1735 | ||
1736 | default: | |
1737 | return NULL_TREE; | |
1738 | } | |
50a6dbd7 JM |
1739 | } |
1740 | ||
5566b478 MS |
1741 | #ifdef GATHER_STATISTICS |
1742 | extern int depth_reached; | |
1743 | #endif | |
1744 | ||
8d08fdba | 1745 | void |
b57b79f7 | 1746 | cxx_print_statistics (void) |
8d08fdba | 1747 | { |
8d08fdba MS |
1748 | print_search_statistics (); |
1749 | print_class_statistics (); | |
7dcfe861 | 1750 | print_template_statistics (); |
5566b478 MS |
1751 | #ifdef GATHER_STATISTICS |
1752 | fprintf (stderr, "maximum template instantiation depth reached: %d\n", | |
1753 | depth_reached); | |
1754 | #endif | |
8d08fdba MS |
1755 | } |
1756 | ||
e92cc029 MS |
1757 | /* Return, as an INTEGER_CST node, the number of elements for TYPE |
1758 | (which is an ARRAY_TYPE). This counts only elements of the top | |
1759 | array. */ | |
8d08fdba MS |
1760 | |
1761 | tree | |
b57b79f7 | 1762 | array_type_nelts_top (tree type) |
8d08fdba | 1763 | { |
db3927fb AH |
1764 | return fold_build2_loc (input_location, |
1765 | PLUS_EXPR, sizetype, | |
7866705a | 1766 | array_type_nelts (type), |
701e903a | 1767 | size_one_node); |
8d08fdba MS |
1768 | } |
1769 | ||
e92cc029 MS |
1770 | /* Return, as an INTEGER_CST node, the number of elements for TYPE |
1771 | (which is an ARRAY_TYPE). This one is a recursive count of all | |
1772 | ARRAY_TYPEs that are clumped together. */ | |
8d08fdba MS |
1773 | |
1774 | tree | |
b57b79f7 | 1775 | array_type_nelts_total (tree type) |
8d08fdba MS |
1776 | { |
1777 | tree sz = array_type_nelts_top (type); | |
1778 | type = TREE_TYPE (type); | |
1779 | while (TREE_CODE (type) == ARRAY_TYPE) | |
1780 | { | |
1781 | tree n = array_type_nelts_top (type); | |
db3927fb AH |
1782 | sz = fold_build2_loc (input_location, |
1783 | MULT_EXPR, sizetype, sz, n); | |
8d08fdba MS |
1784 | type = TREE_TYPE (type); |
1785 | } | |
1786 | return sz; | |
1787 | } | |
878cd289 | 1788 | |
b3ab27f3 MM |
1789 | /* Called from break_out_target_exprs via mapcar. */ |
1790 | ||
1791 | static tree | |
b57b79f7 | 1792 | bot_manip (tree* tp, int* walk_subtrees, void* data) |
878cd289 | 1793 | { |
8dfaeb63 MM |
1794 | splay_tree target_remap = ((splay_tree) data); |
1795 | tree t = *tp; | |
1796 | ||
edb7c512 | 1797 | if (!TYPE_P (t) && TREE_CONSTANT (t) && !TREE_SIDE_EFFECTS (t)) |
8dfaeb63 | 1798 | { |
495d26d6 | 1799 | /* There can't be any TARGET_EXPRs or their slot variables below |
edb7c512 | 1800 | this point. */ |
8dfaeb63 MM |
1801 | *walk_subtrees = 0; |
1802 | return NULL_TREE; | |
1803 | } | |
495d26d6 | 1804 | if (TREE_CODE (t) == TARGET_EXPR) |
73aad9b9 | 1805 | { |
b3ab27f3 MM |
1806 | tree u; |
1807 | ||
02531345 | 1808 | if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR) |
362115a9 JM |
1809 | u = build_cplus_new (TREE_TYPE (t), TREE_OPERAND (t, 1), |
1810 | tf_warning_or_error); | |
9f63daea | 1811 | else |
7efc22ea | 1812 | u = build_target_expr_with_type (TREE_OPERAND (t, 1), TREE_TYPE (t)); |
b3ab27f3 MM |
1813 | |
1814 | /* Map the old variable to the new one. */ | |
9f63daea EC |
1815 | splay_tree_insert (target_remap, |
1816 | (splay_tree_key) TREE_OPERAND (t, 0), | |
b3ab27f3 | 1817 | (splay_tree_value) TREE_OPERAND (u, 0)); |
8dfaeb63 | 1818 | |
7efc22ea JM |
1819 | TREE_OPERAND (u, 1) = break_out_target_exprs (TREE_OPERAND (u, 1)); |
1820 | ||
8dfaeb63 MM |
1821 | /* Replace the old expression with the new version. */ |
1822 | *tp = u; | |
1823 | /* We don't have to go below this point; the recursive call to | |
1824 | break_out_target_exprs will have handled anything below this | |
1825 | point. */ | |
1826 | *walk_subtrees = 0; | |
1827 | return NULL_TREE; | |
73aad9b9 | 1828 | } |
73aad9b9 | 1829 | |
8dfaeb63 MM |
1830 | /* Make a copy of this node. */ |
1831 | return copy_tree_r (tp, walk_subtrees, NULL); | |
878cd289 | 1832 | } |
9f63daea | 1833 | |
8dfaeb63 MM |
1834 | /* Replace all remapped VAR_DECLs in T with their new equivalents. |
1835 | DATA is really a splay-tree mapping old variables to new | |
1836 | variables. */ | |
b3ab27f3 MM |
1837 | |
1838 | static tree | |
9f63daea | 1839 | bot_replace (tree* t, |
0cbd7506 MS |
1840 | int* walk_subtrees ATTRIBUTE_UNUSED , |
1841 | void* data) | |
b3ab27f3 | 1842 | { |
8dfaeb63 MM |
1843 | splay_tree target_remap = ((splay_tree) data); |
1844 | ||
b3ab27f3 MM |
1845 | if (TREE_CODE (*t) == VAR_DECL) |
1846 | { | |
1847 | splay_tree_node n = splay_tree_lookup (target_remap, | |
1848 | (splay_tree_key) *t); | |
1849 | if (n) | |
1850 | *t = (tree) n->value; | |
1851 | } | |
1852 | ||
1853 | return NULL_TREE; | |
1854 | } | |
9f63daea | 1855 | |
8dfaeb63 MM |
1856 | /* When we parse a default argument expression, we may create |
1857 | temporary variables via TARGET_EXPRs. When we actually use the | |
1858 | default-argument expression, we make a copy of the expression, but | |
1859 | we must replace the temporaries with appropriate local versions. */ | |
e92cc029 | 1860 | |
878cd289 | 1861 | tree |
b57b79f7 | 1862 | break_out_target_exprs (tree t) |
878cd289 | 1863 | { |
8dfaeb63 MM |
1864 | static int target_remap_count; |
1865 | static splay_tree target_remap; | |
1866 | ||
b3ab27f3 | 1867 | if (!target_remap_count++) |
9f63daea EC |
1868 | target_remap = splay_tree_new (splay_tree_compare_pointers, |
1869 | /*splay_tree_delete_key_fn=*/NULL, | |
b3ab27f3 | 1870 | /*splay_tree_delete_value_fn=*/NULL); |
14588106 RG |
1871 | cp_walk_tree (&t, bot_manip, target_remap, NULL); |
1872 | cp_walk_tree (&t, bot_replace, target_remap, NULL); | |
b3ab27f3 MM |
1873 | |
1874 | if (!--target_remap_count) | |
1875 | { | |
1876 | splay_tree_delete (target_remap); | |
1877 | target_remap = NULL; | |
1878 | } | |
1879 | ||
1880 | return t; | |
878cd289 | 1881 | } |
f30432d7 | 1882 | |
8e1daa34 NS |
1883 | /* Similar to `build_nt', but for template definitions of dependent |
1884 | expressions */ | |
5566b478 MS |
1885 | |
1886 | tree | |
e34d07f2 | 1887 | build_min_nt (enum tree_code code, ...) |
5566b478 | 1888 | { |
926ce8bd KH |
1889 | tree t; |
1890 | int length; | |
1891 | int i; | |
e34d07f2 | 1892 | va_list p; |
5566b478 | 1893 | |
5039610b SL |
1894 | gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp); |
1895 | ||
e34d07f2 | 1896 | va_start (p, code); |
5566b478 | 1897 | |
5566b478 | 1898 | t = make_node (code); |
8d5e6e25 | 1899 | length = TREE_CODE_LENGTH (code); |
5566b478 MS |
1900 | |
1901 | for (i = 0; i < length; i++) | |
1902 | { | |
1903 | tree x = va_arg (p, tree); | |
2a1e9fdd | 1904 | TREE_OPERAND (t, i) = x; |
5566b478 MS |
1905 | } |
1906 | ||
e34d07f2 | 1907 | va_end (p); |
5566b478 MS |
1908 | return t; |
1909 | } | |
1910 | ||
5039610b | 1911 | |
8e1daa34 | 1912 | /* Similar to `build', but for template definitions. */ |
5566b478 MS |
1913 | |
1914 | tree | |
e34d07f2 | 1915 | build_min (enum tree_code code, tree tt, ...) |
5566b478 | 1916 | { |
926ce8bd KH |
1917 | tree t; |
1918 | int length; | |
1919 | int i; | |
e34d07f2 | 1920 | va_list p; |
5566b478 | 1921 | |
5039610b SL |
1922 | gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp); |
1923 | ||
e34d07f2 | 1924 | va_start (p, tt); |
5566b478 | 1925 | |
5566b478 | 1926 | t = make_node (code); |
8d5e6e25 | 1927 | length = TREE_CODE_LENGTH (code); |
2a1e9fdd | 1928 | TREE_TYPE (t) = tt; |
5566b478 MS |
1929 | |
1930 | for (i = 0; i < length; i++) | |
1931 | { | |
1932 | tree x = va_arg (p, tree); | |
2a1e9fdd | 1933 | TREE_OPERAND (t, i) = x; |
4f976745 | 1934 | if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x)) |
8e1daa34 | 1935 | TREE_SIDE_EFFECTS (t) = 1; |
5566b478 MS |
1936 | } |
1937 | ||
e34d07f2 | 1938 | va_end (p); |
5566b478 MS |
1939 | return t; |
1940 | } | |
1941 | ||
8e1daa34 NS |
1942 | /* Similar to `build', but for template definitions of non-dependent |
1943 | expressions. NON_DEP is the non-dependent expression that has been | |
1944 | built. */ | |
1945 | ||
1946 | tree | |
1947 | build_min_non_dep (enum tree_code code, tree non_dep, ...) | |
1948 | { | |
926ce8bd KH |
1949 | tree t; |
1950 | int length; | |
1951 | int i; | |
8e1daa34 NS |
1952 | va_list p; |
1953 | ||
5039610b SL |
1954 | gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp); |
1955 | ||
8e1daa34 NS |
1956 | va_start (p, non_dep); |
1957 | ||
1958 | t = make_node (code); | |
1959 | length = TREE_CODE_LENGTH (code); | |
1960 | TREE_TYPE (t) = TREE_TYPE (non_dep); | |
8e1daa34 NS |
1961 | TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep); |
1962 | ||
1963 | for (i = 0; i < length; i++) | |
1964 | { | |
1965 | tree x = va_arg (p, tree); | |
1966 | TREE_OPERAND (t, i) = x; | |
1967 | } | |
1968 | ||
1969 | if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR) | |
1970 | /* This should not be considered a COMPOUND_EXPR, because it | |
04c06002 | 1971 | resolves to an overload. */ |
8e1daa34 | 1972 | COMPOUND_EXPR_OVERLOADED (t) = 1; |
9f63daea | 1973 | |
8e1daa34 NS |
1974 | va_end (p); |
1975 | return t; | |
1976 | } | |
1977 | ||
3fcb9d1b NF |
1978 | /* Similar to `build_nt_call_vec', but for template definitions of |
1979 | non-dependent expressions. NON_DEP is the non-dependent expression | |
1980 | that has been built. */ | |
5039610b SL |
1981 | |
1982 | tree | |
c166b898 | 1983 | build_min_non_dep_call_vec (tree non_dep, tree fn, VEC(tree,gc) *argvec) |
5039610b | 1984 | { |
c166b898 | 1985 | tree t = build_nt_call_vec (fn, argvec); |
5039610b SL |
1986 | TREE_TYPE (t) = TREE_TYPE (non_dep); |
1987 | TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep); | |
1988 | return t; | |
1989 | } | |
1990 | ||
5566b478 | 1991 | tree |
b57b79f7 | 1992 | get_type_decl (tree t) |
5566b478 | 1993 | { |
5566b478 MS |
1994 | if (TREE_CODE (t) == TYPE_DECL) |
1995 | return t; | |
2f939d94 | 1996 | if (TYPE_P (t)) |
5566b478 | 1997 | return TYPE_STUB_DECL (t); |
315fb5db NS |
1998 | gcc_assert (t == error_mark_node); |
1999 | return t; | |
5566b478 MS |
2000 | } |
2001 | ||
700466c2 JM |
2002 | /* Returns the namespace that contains DECL, whether directly or |
2003 | indirectly. */ | |
2004 | ||
2005 | tree | |
b57b79f7 | 2006 | decl_namespace_context (tree decl) |
700466c2 JM |
2007 | { |
2008 | while (1) | |
2009 | { | |
2010 | if (TREE_CODE (decl) == NAMESPACE_DECL) | |
2011 | return decl; | |
2012 | else if (TYPE_P (decl)) | |
2013 | decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl)); | |
2014 | else | |
2015 | decl = CP_DECL_CONTEXT (decl); | |
2016 | } | |
2017 | } | |
2018 | ||
b9e75696 JM |
2019 | /* Returns true if decl is within an anonymous namespace, however deeply |
2020 | nested, or false otherwise. */ | |
2021 | ||
2022 | bool | |
58f9752a | 2023 | decl_anon_ns_mem_p (const_tree decl) |
b9e75696 JM |
2024 | { |
2025 | while (1) | |
2026 | { | |
653109bd | 2027 | if (decl == NULL_TREE || decl == error_mark_node) |
b9e75696 JM |
2028 | return false; |
2029 | if (TREE_CODE (decl) == NAMESPACE_DECL | |
2030 | && DECL_NAME (decl) == NULL_TREE) | |
2031 | return true; | |
2032 | /* Classes and namespaces inside anonymous namespaces have | |
2033 | TREE_PUBLIC == 0, so we can shortcut the search. */ | |
2034 | else if (TYPE_P (decl)) | |
2035 | return (TREE_PUBLIC (TYPE_NAME (decl)) == 0); | |
2036 | else if (TREE_CODE (decl) == NAMESPACE_DECL) | |
2037 | return (TREE_PUBLIC (decl) == 0); | |
2038 | else | |
2039 | decl = DECL_CONTEXT (decl); | |
2040 | } | |
2041 | } | |
2042 | ||
67d743fe | 2043 | /* Return truthvalue of whether T1 is the same tree structure as T2. |
c8a209ca | 2044 | Return 1 if they are the same. Return 0 if they are different. */ |
67d743fe | 2045 | |
c8a209ca | 2046 | bool |
b57b79f7 | 2047 | cp_tree_equal (tree t1, tree t2) |
67d743fe | 2048 | { |
926ce8bd | 2049 | enum tree_code code1, code2; |
67d743fe MS |
2050 | |
2051 | if (t1 == t2) | |
c8a209ca NS |
2052 | return true; |
2053 | if (!t1 || !t2) | |
2054 | return false; | |
2055 | ||
2056 | for (code1 = TREE_CODE (t1); | |
1a87cf0c | 2057 | CONVERT_EXPR_CODE_P (code1) |
c8a209ca NS |
2058 | || code1 == NON_LVALUE_EXPR; |
2059 | code1 = TREE_CODE (t1)) | |
2060 | t1 = TREE_OPERAND (t1, 0); | |
2061 | for (code2 = TREE_CODE (t2); | |
1a87cf0c | 2062 | CONVERT_EXPR_CODE_P (code2) |
c8a209ca NS |
2063 | || code1 == NON_LVALUE_EXPR; |
2064 | code2 = TREE_CODE (t2)) | |
2065 | t2 = TREE_OPERAND (t2, 0); | |
2066 | ||
2067 | /* They might have become equal now. */ | |
2068 | if (t1 == t2) | |
2069 | return true; | |
9f63daea | 2070 | |
67d743fe | 2071 | if (code1 != code2) |
c8a209ca | 2072 | return false; |
67d743fe MS |
2073 | |
2074 | switch (code1) | |
2075 | { | |
2076 | case INTEGER_CST: | |
2077 | return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2) | |
2078 | && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2); | |
2079 | ||
2080 | case REAL_CST: | |
2081 | return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2)); | |
2082 | ||
2083 | case STRING_CST: | |
2084 | return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2) | |
da61dec9 | 2085 | && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2), |
c8a209ca | 2086 | TREE_STRING_LENGTH (t1)); |
67d743fe | 2087 | |
d05739f8 JM |
2088 | case FIXED_CST: |
2089 | return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), | |
2090 | TREE_FIXED_CST (t2)); | |
2091 | ||
2a2193e0 SM |
2092 | case COMPLEX_CST: |
2093 | return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2)) | |
2094 | && cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2)); | |
2095 | ||
67d743fe | 2096 | case CONSTRUCTOR: |
7dd4bdf5 MM |
2097 | /* We need to do this when determining whether or not two |
2098 | non-type pointer to member function template arguments | |
2099 | are the same. */ | |
31d06664 JM |
2100 | if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)) |
2101 | || CONSTRUCTOR_NELTS (t1) != CONSTRUCTOR_NELTS (t2)) | |
c8a209ca | 2102 | return false; |
31d06664 JM |
2103 | { |
2104 | tree field, value; | |
2105 | unsigned int i; | |
2106 | FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t1), i, field, value) | |
2107 | { | |
2108 | constructor_elt *elt2 = CONSTRUCTOR_ELT (t2, i); | |
2109 | if (!cp_tree_equal (field, elt2->index) | |
2110 | || !cp_tree_equal (value, elt2->value)) | |
2111 | return false; | |
2112 | } | |
2113 | } | |
2114 | return true; | |
7dd4bdf5 MM |
2115 | |
2116 | case TREE_LIST: | |
c8a209ca NS |
2117 | if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))) |
2118 | return false; | |
2119 | if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2))) | |
2120 | return false; | |
7dd4bdf5 | 2121 | return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2)); |
67d743fe MS |
2122 | |
2123 | case SAVE_EXPR: | |
2124 | return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
2125 | ||
2126 | case CALL_EXPR: | |
5039610b SL |
2127 | { |
2128 | tree arg1, arg2; | |
2129 | call_expr_arg_iterator iter1, iter2; | |
2130 | if (!cp_tree_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2))) | |
2131 | return false; | |
2132 | for (arg1 = first_call_expr_arg (t1, &iter1), | |
2133 | arg2 = first_call_expr_arg (t2, &iter2); | |
2134 | arg1 && arg2; | |
2135 | arg1 = next_call_expr_arg (&iter1), | |
2136 | arg2 = next_call_expr_arg (&iter2)) | |
2137 | if (!cp_tree_equal (arg1, arg2)) | |
2138 | return false; | |
96b4a0b5 JM |
2139 | if (arg1 || arg2) |
2140 | return false; | |
2141 | return true; | |
5039610b | 2142 | } |
67d743fe | 2143 | |
c8a209ca NS |
2144 | case TARGET_EXPR: |
2145 | { | |
2146 | tree o1 = TREE_OPERAND (t1, 0); | |
2147 | tree o2 = TREE_OPERAND (t2, 0); | |
9f63daea | 2148 | |
c8a209ca NS |
2149 | /* Special case: if either target is an unallocated VAR_DECL, |
2150 | it means that it's going to be unified with whatever the | |
2151 | TARGET_EXPR is really supposed to initialize, so treat it | |
2152 | as being equivalent to anything. */ | |
2153 | if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE | |
2154 | && !DECL_RTL_SET_P (o1)) | |
2155 | /*Nop*/; | |
2156 | else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE | |
2157 | && !DECL_RTL_SET_P (o2)) | |
2158 | /*Nop*/; | |
2159 | else if (!cp_tree_equal (o1, o2)) | |
2160 | return false; | |
9f63daea | 2161 | |
c8a209ca NS |
2162 | return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)); |
2163 | } | |
9f63daea | 2164 | |
67d743fe | 2165 | case WITH_CLEANUP_EXPR: |
c8a209ca NS |
2166 | if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))) |
2167 | return false; | |
6ad7895a | 2168 | return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1)); |
67d743fe MS |
2169 | |
2170 | case COMPONENT_REF: | |
c8a209ca NS |
2171 | if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1)) |
2172 | return false; | |
2173 | return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
67d743fe | 2174 | |
67d743fe | 2175 | case PARM_DECL: |
a77f94e2 | 2176 | /* For comparing uses of parameters in late-specified return types |
e7dc5734 JM |
2177 | with an out-of-class definition of the function, but can also come |
2178 | up for expressions that involve 'this' in a member function | |
2179 | template. */ | |
2180 | if (same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))) | |
2181 | { | |
2182 | if (DECL_ARTIFICIAL (t1) ^ DECL_ARTIFICIAL (t2)) | |
2183 | return false; | |
2184 | if (DECL_ARTIFICIAL (t1) | |
2185 | || (DECL_PARM_LEVEL (t1) == DECL_PARM_LEVEL (t2) | |
2186 | && DECL_PARM_INDEX (t1) == DECL_PARM_INDEX (t2))) | |
2187 | return true; | |
2188 | } | |
2189 | return false; | |
a77f94e2 JM |
2190 | |
2191 | case VAR_DECL: | |
67d743fe MS |
2192 | case CONST_DECL: |
2193 | case FUNCTION_DECL: | |
c8a209ca NS |
2194 | case TEMPLATE_DECL: |
2195 | case IDENTIFIER_NODE: | |
47c0c7d7 | 2196 | case SSA_NAME: |
c8a209ca | 2197 | return false; |
67d743fe | 2198 | |
17a27b4f MM |
2199 | case BASELINK: |
2200 | return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2) | |
2201 | && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2) | |
2202 | && cp_tree_equal (BASELINK_FUNCTIONS (t1), | |
2203 | BASELINK_FUNCTIONS (t2))); | |
2204 | ||
f84b4be9 | 2205 | case TEMPLATE_PARM_INDEX: |
25aea4e9 DS |
2206 | if (TEMPLATE_PARM_NUM_SIBLINGS (t1) |
2207 | != TEMPLATE_PARM_NUM_SIBLINGS (t2)) | |
2208 | return false; | |
31758337 NS |
2209 | return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2) |
2210 | && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2) | |
9524f710 LE |
2211 | && (TEMPLATE_PARM_PARAMETER_PACK (t1) |
2212 | == TEMPLATE_PARM_PARAMETER_PACK (t2)) | |
31758337 NS |
2213 | && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)), |
2214 | TREE_TYPE (TEMPLATE_PARM_DECL (t2)))); | |
67d743fe | 2215 | |
bf12d54d NS |
2216 | case TEMPLATE_ID_EXPR: |
2217 | { | |
2218 | unsigned ix; | |
2219 | tree vec1, vec2; | |
9f63daea | 2220 | |
bf12d54d NS |
2221 | if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))) |
2222 | return false; | |
2223 | vec1 = TREE_OPERAND (t1, 1); | |
2224 | vec2 = TREE_OPERAND (t2, 1); | |
2225 | ||
2226 | if (!vec1 || !vec2) | |
2227 | return !vec1 && !vec2; | |
9f63daea | 2228 | |
bf12d54d NS |
2229 | if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2)) |
2230 | return false; | |
2231 | ||
2232 | for (ix = TREE_VEC_LENGTH (vec1); ix--;) | |
2233 | if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix), | |
2234 | TREE_VEC_ELT (vec2, ix))) | |
2235 | return false; | |
9f63daea | 2236 | |
bf12d54d NS |
2237 | return true; |
2238 | } | |
9f63daea | 2239 | |
67d743fe | 2240 | case SIZEOF_EXPR: |
abff8e06 | 2241 | case ALIGNOF_EXPR: |
c8a209ca NS |
2242 | { |
2243 | tree o1 = TREE_OPERAND (t1, 0); | |
2244 | tree o2 = TREE_OPERAND (t2, 0); | |
9f63daea | 2245 | |
c8a209ca NS |
2246 | if (TREE_CODE (o1) != TREE_CODE (o2)) |
2247 | return false; | |
2248 | if (TYPE_P (o1)) | |
2249 | return same_type_p (o1, o2); | |
2250 | else | |
2251 | return cp_tree_equal (o1, o2); | |
2252 | } | |
9f63daea | 2253 | |
6f9f76e3 SM |
2254 | case MODOP_EXPR: |
2255 | { | |
2256 | tree t1_op1, t2_op1; | |
2257 | ||
2258 | if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))) | |
2259 | return false; | |
2260 | ||
2261 | t1_op1 = TREE_OPERAND (t1, 1); | |
2262 | t2_op1 = TREE_OPERAND (t2, 1); | |
2263 | if (TREE_CODE (t1_op1) != TREE_CODE (t2_op1)) | |
2264 | return false; | |
2265 | ||
2266 | return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t2, 2)); | |
2267 | } | |
2268 | ||
61a127b3 MM |
2269 | case PTRMEM_CST: |
2270 | /* Two pointer-to-members are the same if they point to the same | |
2271 | field or function in the same class. */ | |
c8a209ca NS |
2272 | if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2)) |
2273 | return false; | |
2274 | ||
2275 | return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2)); | |
61a127b3 | 2276 | |
943e3ede MM |
2277 | case OVERLOAD: |
2278 | if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2)) | |
2279 | return false; | |
2280 | return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2)); | |
2281 | ||
ea798d0f PC |
2282 | case TRAIT_EXPR: |
2283 | if (TRAIT_EXPR_KIND (t1) != TRAIT_EXPR_KIND (t2)) | |
2284 | return false; | |
2285 | return same_type_p (TRAIT_EXPR_TYPE1 (t1), TRAIT_EXPR_TYPE1 (t2)) | |
2286 | && same_type_p (TRAIT_EXPR_TYPE2 (t1), TRAIT_EXPR_TYPE2 (t2)); | |
2287 | ||
ab73eba8 JM |
2288 | case CAST_EXPR: |
2289 | case STATIC_CAST_EXPR: | |
2290 | case REINTERPRET_CAST_EXPR: | |
2291 | case CONST_CAST_EXPR: | |
2292 | case DYNAMIC_CAST_EXPR: | |
2293 | case NEW_EXPR: | |
2294 | if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))) | |
2295 | return false; | |
2296 | /* Now compare operands as usual. */ | |
2297 | break; | |
2298 | ||
7f85441b KG |
2299 | default: |
2300 | break; | |
67d743fe MS |
2301 | } |
2302 | ||
2303 | switch (TREE_CODE_CLASS (code1)) | |
2304 | { | |
6615c446 JO |
2305 | case tcc_unary: |
2306 | case tcc_binary: | |
2307 | case tcc_comparison: | |
2308 | case tcc_expression: | |
5039610b | 2309 | case tcc_vl_exp: |
6615c446 JO |
2310 | case tcc_reference: |
2311 | case tcc_statement: | |
aa1826e2 | 2312 | { |
5039610b SL |
2313 | int i, n; |
2314 | ||
2315 | n = TREE_OPERAND_LENGTH (t1); | |
2316 | if (TREE_CODE_CLASS (code1) == tcc_vl_exp | |
2317 | && n != TREE_OPERAND_LENGTH (t2)) | |
2318 | return false; | |
9f63daea | 2319 | |
5039610b | 2320 | for (i = 0; i < n; ++i) |
c8a209ca NS |
2321 | if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i))) |
2322 | return false; | |
9f63daea | 2323 | |
c8a209ca | 2324 | return true; |
aa1826e2 | 2325 | } |
9f63daea | 2326 | |
6615c446 | 2327 | case tcc_type: |
c8a209ca | 2328 | return same_type_p (t1, t2); |
6615c446 JO |
2329 | default: |
2330 | gcc_unreachable (); | |
67d743fe | 2331 | } |
6615c446 | 2332 | /* We can get here with --disable-checking. */ |
c8a209ca | 2333 | return false; |
67d743fe | 2334 | } |
73aad9b9 | 2335 | |
d11ad92e MS |
2336 | /* The type of ARG when used as an lvalue. */ |
2337 | ||
2338 | tree | |
b57b79f7 | 2339 | lvalue_type (tree arg) |
d11ad92e | 2340 | { |
2c73f9f5 | 2341 | tree type = TREE_TYPE (arg); |
8cd4c175 | 2342 | return type; |
d11ad92e MS |
2343 | } |
2344 | ||
2345 | /* The type of ARG for printing error messages; denote lvalues with | |
2346 | reference types. */ | |
2347 | ||
2348 | tree | |
b57b79f7 | 2349 | error_type (tree arg) |
d11ad92e MS |
2350 | { |
2351 | tree type = TREE_TYPE (arg); | |
9f63daea | 2352 | |
d11ad92e MS |
2353 | if (TREE_CODE (type) == ARRAY_TYPE) |
2354 | ; | |
08476342 NS |
2355 | else if (TREE_CODE (type) == ERROR_MARK) |
2356 | ; | |
d11ad92e MS |
2357 | else if (real_lvalue_p (arg)) |
2358 | type = build_reference_type (lvalue_type (arg)); | |
9e1e64ec | 2359 | else if (MAYBE_CLASS_TYPE_P (type)) |
d11ad92e MS |
2360 | type = lvalue_type (arg); |
2361 | ||
2362 | return type; | |
2363 | } | |
eb66be0e MS |
2364 | |
2365 | /* Does FUNCTION use a variable-length argument list? */ | |
2366 | ||
2367 | int | |
58f9752a | 2368 | varargs_function_p (const_tree function) |
eb66be0e | 2369 | { |
f38958e8 | 2370 | return stdarg_p (TREE_TYPE (function)); |
eb66be0e | 2371 | } |
f94ae2f5 JM |
2372 | |
2373 | /* Returns 1 if decl is a member of a class. */ | |
2374 | ||
2375 | int | |
58f9752a | 2376 | member_p (const_tree decl) |
f94ae2f5 | 2377 | { |
58f9752a | 2378 | const_tree const ctx = DECL_CONTEXT (decl); |
2f939d94 | 2379 | return (ctx && TYPE_P (ctx)); |
f94ae2f5 | 2380 | } |
51924768 JM |
2381 | |
2382 | /* Create a placeholder for member access where we don't actually have an | |
2383 | object that the access is against. */ | |
2384 | ||
2385 | tree | |
b57b79f7 | 2386 | build_dummy_object (tree type) |
51924768 | 2387 | { |
44689c12 | 2388 | tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node); |
dd865ef6 | 2389 | return cp_build_indirect_ref (decl, RO_NULL, tf_warning_or_error); |
51924768 JM |
2390 | } |
2391 | ||
2392 | /* We've gotten a reference to a member of TYPE. Return *this if appropriate, | |
2393 | or a dummy object otherwise. If BINFOP is non-0, it is filled with the | |
2394 | binfo path from current_class_type to TYPE, or 0. */ | |
2395 | ||
2396 | tree | |
b57b79f7 | 2397 | maybe_dummy_object (tree type, tree* binfop) |
51924768 JM |
2398 | { |
2399 | tree decl, context; | |
2db1ab2d | 2400 | tree binfo; |
a6846853 | 2401 | tree current = current_nonlambda_class_type (); |
9f63daea | 2402 | |
a6846853 JM |
2403 | if (current |
2404 | && (binfo = lookup_base (current, type, ba_any, NULL))) | |
2405 | context = current; | |
51924768 JM |
2406 | else |
2407 | { | |
2408 | /* Reference from a nested class member function. */ | |
2409 | context = type; | |
2db1ab2d | 2410 | binfo = TYPE_BINFO (type); |
51924768 JM |
2411 | } |
2412 | ||
2db1ab2d NS |
2413 | if (binfop) |
2414 | *binfop = binfo; | |
9f63daea | 2415 | |
41d04a8d JM |
2416 | if (current_class_ref |
2417 | /* current_class_ref might not correspond to current_class_type if | |
2418 | we're in tsubst_default_argument or a lambda-declarator; in either | |
2419 | case, we want to use current_class_ref if it matches CONTEXT. */ | |
2420 | && (same_type_ignoring_top_level_qualifiers_p | |
2421 | (TREE_TYPE (current_class_ref), context))) | |
51924768 | 2422 | decl = current_class_ref; |
a6846853 JM |
2423 | else if (current != current_class_type |
2424 | && context == nonlambda_method_basetype ()) | |
2425 | /* In a lambda, need to go through 'this' capture. */ | |
ac4b1cc0 | 2426 | decl = (build_x_indirect_ref |
a6846853 JM |
2427 | ((lambda_expr_this_capture |
2428 | (CLASSTYPE_LAMBDA_EXPR (current_class_type))), | |
2429 | RO_NULL, tf_warning_or_error)); | |
51924768 JM |
2430 | else |
2431 | decl = build_dummy_object (context); | |
2432 | ||
2433 | return decl; | |
2434 | } | |
2435 | ||
2436 | /* Returns 1 if OB is a placeholder object, or a pointer to one. */ | |
2437 | ||
2438 | int | |
58f9752a | 2439 | is_dummy_object (const_tree ob) |
51924768 JM |
2440 | { |
2441 | if (TREE_CODE (ob) == INDIRECT_REF) | |
2442 | ob = TREE_OPERAND (ob, 0); | |
2443 | return (TREE_CODE (ob) == NOP_EXPR | |
44689c12 | 2444 | && TREE_OPERAND (ob, 0) == void_zero_node); |
51924768 | 2445 | } |
5524676d | 2446 | |
c32097d8 JM |
2447 | /* Returns 1 iff type T is something we want to treat as a scalar type for |
2448 | the purpose of deciding whether it is trivial/POD/standard-layout. */ | |
2449 | ||
2450 | static bool | |
2451 | scalarish_type_p (const_tree t) | |
2452 | { | |
2453 | if (t == error_mark_node) | |
2454 | return 1; | |
2455 | ||
2456 | return (SCALAR_TYPE_P (t) | |
2457 | || TREE_CODE (t) == VECTOR_TYPE); | |
2458 | } | |
2459 | ||
2460 | /* Returns true iff T requires non-trivial default initialization. */ | |
2461 | ||
2462 | bool | |
2463 | type_has_nontrivial_default_init (const_tree t) | |
2464 | { | |
2465 | t = strip_array_types (CONST_CAST_TREE (t)); | |
2466 | ||
2467 | if (CLASS_TYPE_P (t)) | |
2468 | return TYPE_HAS_COMPLEX_DFLT (t); | |
2469 | else | |
2470 | return 0; | |
2471 | } | |
2472 | ||
d758e847 JM |
2473 | /* Returns true iff copying an object of type T (including via move |
2474 | constructor) is non-trivial. That is, T has no non-trivial copy | |
2475 | constructors and no non-trivial move constructors. */ | |
c32097d8 JM |
2476 | |
2477 | bool | |
2478 | type_has_nontrivial_copy_init (const_tree t) | |
2479 | { | |
2480 | t = strip_array_types (CONST_CAST_TREE (t)); | |
2481 | ||
2482 | if (CLASS_TYPE_P (t)) | |
d758e847 JM |
2483 | { |
2484 | gcc_assert (COMPLETE_TYPE_P (t)); | |
2485 | return ((TYPE_HAS_COPY_CTOR (t) | |
2486 | && TYPE_HAS_COMPLEX_COPY_CTOR (t)) | |
2487 | || TYPE_HAS_COMPLEX_MOVE_CTOR (t)); | |
2488 | } | |
c32097d8 JM |
2489 | else |
2490 | return 0; | |
2491 | } | |
2492 | ||
46408846 JM |
2493 | /* Returns 1 iff type T is a trivially copyable type, as defined in |
2494 | [basic.types] and [class]. */ | |
c32097d8 JM |
2495 | |
2496 | bool | |
46408846 | 2497 | trivially_copyable_p (const_tree t) |
c32097d8 JM |
2498 | { |
2499 | t = strip_array_types (CONST_CAST_TREE (t)); | |
2500 | ||
2501 | if (CLASS_TYPE_P (t)) | |
d758e847 JM |
2502 | return ((!TYPE_HAS_COPY_CTOR (t) |
2503 | || !TYPE_HAS_COMPLEX_COPY_CTOR (t)) | |
2504 | && !TYPE_HAS_COMPLEX_MOVE_CTOR (t) | |
2505 | && (!TYPE_HAS_COPY_ASSIGN (t) | |
2506 | || !TYPE_HAS_COMPLEX_COPY_ASSIGN (t)) | |
2507 | && !TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) | |
334738b4 | 2508 | && TYPE_HAS_TRIVIAL_DESTRUCTOR (t)); |
c32097d8 JM |
2509 | else |
2510 | return scalarish_type_p (t); | |
2511 | } | |
2512 | ||
46408846 JM |
2513 | /* Returns 1 iff type T is a trivial type, as defined in [basic.types] and |
2514 | [class]. */ | |
2515 | ||
2516 | bool | |
2517 | trivial_type_p (const_tree t) | |
2518 | { | |
2519 | t = strip_array_types (CONST_CAST_TREE (t)); | |
2520 | ||
2521 | if (CLASS_TYPE_P (t)) | |
2522 | return (TYPE_HAS_TRIVIAL_DFLT (t) | |
2523 | && trivially_copyable_p (t)); | |
2524 | else | |
2525 | return scalarish_type_p (t); | |
2526 | } | |
2527 | ||
5524676d JM |
2528 | /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */ |
2529 | ||
c32097d8 | 2530 | bool |
58f9752a | 2531 | pod_type_p (const_tree t) |
5524676d | 2532 | { |
4e9b57fa | 2533 | /* This CONST_CAST is okay because strip_array_types returns its |
75547801 | 2534 | argument unmodified and we assign it to a const_tree. */ |
b1d5455a | 2535 | t = strip_array_types (CONST_CAST_TREE(t)); |
5524676d | 2536 | |
cc72bbaa JM |
2537 | if (!CLASS_TYPE_P (t)) |
2538 | return scalarish_type_p (t); | |
2539 | else if (cxx_dialect > cxx98) | |
c32097d8 JM |
2540 | /* [class]/10: A POD struct is a class that is both a trivial class and a |
2541 | standard-layout class, and has no non-static data members of type | |
2542 | non-POD struct, non-POD union (or array of such types). | |
2543 | ||
2544 | We don't need to check individual members because if a member is | |
2545 | non-std-layout or non-trivial, the class will be too. */ | |
2546 | return (std_layout_type_p (t) && trivial_type_p (t)); | |
2547 | else | |
cc72bbaa JM |
2548 | /* The C++98 definition of POD is different. */ |
2549 | return !CLASSTYPE_NON_LAYOUT_POD_P (t); | |
c32097d8 JM |
2550 | } |
2551 | ||
2552 | /* Returns true iff T is POD for the purpose of layout, as defined in the | |
2553 | C++ ABI. */ | |
2554 | ||
2555 | bool | |
2556 | layout_pod_type_p (const_tree t) | |
2557 | { | |
2558 | t = strip_array_types (CONST_CAST_TREE (t)); | |
2559 | ||
2560 | if (CLASS_TYPE_P (t)) | |
2561 | return !CLASSTYPE_NON_LAYOUT_POD_P (t); | |
2562 | else | |
2563 | return scalarish_type_p (t); | |
2564 | } | |
2565 | ||
2566 | /* Returns true iff T is a standard-layout type, as defined in | |
2567 | [basic.types]. */ | |
2568 | ||
2569 | bool | |
2570 | std_layout_type_p (const_tree t) | |
2571 | { | |
2572 | t = strip_array_types (CONST_CAST_TREE (t)); | |
2573 | ||
2574 | if (CLASS_TYPE_P (t)) | |
2575 | return !CLASSTYPE_NON_STD_LAYOUT (t); | |
2576 | else | |
2577 | return scalarish_type_p (t); | |
5524676d | 2578 | } |
e5dc5fb2 | 2579 | |
39ef6592 LC |
2580 | /* Nonzero iff type T is a class template implicit specialization. */ |
2581 | ||
2582 | bool | |
ac7d7749 | 2583 | class_tmpl_impl_spec_p (const_tree t) |
39ef6592 LC |
2584 | { |
2585 | return CLASS_TYPE_P (t) && CLASSTYPE_TEMPLATE_INSTANTIATION (t); | |
2586 | } | |
2587 | ||
94e6e4c4 AO |
2588 | /* Returns 1 iff zero initialization of type T means actually storing |
2589 | zeros in it. */ | |
2590 | ||
2591 | int | |
58f9752a | 2592 | zero_init_p (const_tree t) |
94e6e4c4 | 2593 | { |
4e9b57fa | 2594 | /* This CONST_CAST is okay because strip_array_types returns its |
75547801 | 2595 | argument unmodified and we assign it to a const_tree. */ |
b1d5455a | 2596 | t = strip_array_types (CONST_CAST_TREE(t)); |
94e6e4c4 | 2597 | |
17bbb839 MM |
2598 | if (t == error_mark_node) |
2599 | return 1; | |
2600 | ||
94e6e4c4 AO |
2601 | /* NULL pointers to data members are initialized with -1. */ |
2602 | if (TYPE_PTRMEM_P (t)) | |
2603 | return 0; | |
2604 | ||
2605 | /* Classes that contain types that can't be zero-initialized, cannot | |
2606 | be zero-initialized themselves. */ | |
2607 | if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t)) | |
2608 | return 0; | |
2609 | ||
2610 | return 1; | |
2611 | } | |
2612 | ||
91d231cb | 2613 | /* Table of valid C++ attributes. */ |
349ae713 | 2614 | const struct attribute_spec cxx_attribute_table[] = |
e5dc5fb2 | 2615 | { |
62d784f7 KT |
2616 | /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler, |
2617 | affects_type_identity } */ | |
2618 | { "java_interface", 0, 0, false, false, false, | |
2619 | handle_java_interface_attribute, false }, | |
2620 | { "com_interface", 0, 0, false, false, false, | |
2621 | handle_com_interface_attribute, false }, | |
2622 | { "init_priority", 1, 1, true, false, false, | |
2623 | handle_init_priority_attribute, false }, | |
2624 | { NULL, 0, 0, false, false, false, NULL, false } | |
91d231cb JM |
2625 | }; |
2626 | ||
2627 | /* Handle a "java_interface" attribute; arguments as in | |
2628 | struct attribute_spec.handler. */ | |
2629 | static tree | |
9f63daea | 2630 | handle_java_interface_attribute (tree* node, |
0cbd7506 MS |
2631 | tree name, |
2632 | tree args ATTRIBUTE_UNUSED , | |
2633 | int flags, | |
2634 | bool* no_add_attrs) | |
91d231cb JM |
2635 | { |
2636 | if (DECL_P (*node) | |
2637 | || !CLASS_TYPE_P (*node) | |
2638 | || !TYPE_FOR_JAVA (*node)) | |
60c87482 | 2639 | { |
a82e1a7d | 2640 | error ("%qE attribute can only be applied to Java class definitions", |
4460cef2 | 2641 | name); |
91d231cb JM |
2642 | *no_add_attrs = true; |
2643 | return NULL_TREE; | |
60c87482 | 2644 | } |
91d231cb | 2645 | if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE)) |
8dd16ecc | 2646 | *node = build_variant_type_copy (*node); |
91d231cb | 2647 | TYPE_JAVA_INTERFACE (*node) = 1; |
e5dc5fb2 | 2648 | |
91d231cb JM |
2649 | return NULL_TREE; |
2650 | } | |
2651 | ||
2652 | /* Handle a "com_interface" attribute; arguments as in | |
2653 | struct attribute_spec.handler. */ | |
2654 | static tree | |
9f63daea | 2655 | handle_com_interface_attribute (tree* node, |
0cbd7506 MS |
2656 | tree name, |
2657 | tree args ATTRIBUTE_UNUSED , | |
2658 | int flags ATTRIBUTE_UNUSED , | |
2659 | bool* no_add_attrs) | |
91d231cb JM |
2660 | { |
2661 | static int warned; | |
2662 | ||
2663 | *no_add_attrs = true; | |
2664 | ||
2665 | if (DECL_P (*node) | |
2666 | || !CLASS_TYPE_P (*node) | |
2667 | || *node != TYPE_MAIN_VARIANT (*node)) | |
e5dc5fb2 | 2668 | { |
5c498b10 DD |
2669 | warning (OPT_Wattributes, "%qE attribute can only be applied " |
2670 | "to class definitions", name); | |
91d231cb JM |
2671 | return NULL_TREE; |
2672 | } | |
e5dc5fb2 | 2673 | |
91d231cb | 2674 | if (!warned++) |
d4ee4d25 | 2675 | warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default", |
4460cef2 | 2676 | name); |
91d231cb JM |
2677 | |
2678 | return NULL_TREE; | |
2679 | } | |
2680 | ||
2681 | /* Handle an "init_priority" attribute; arguments as in | |
2682 | struct attribute_spec.handler. */ | |
2683 | static tree | |
9f63daea | 2684 | handle_init_priority_attribute (tree* node, |
0cbd7506 MS |
2685 | tree name, |
2686 | tree args, | |
2687 | int flags ATTRIBUTE_UNUSED , | |
2688 | bool* no_add_attrs) | |
91d231cb JM |
2689 | { |
2690 | tree initp_expr = TREE_VALUE (args); | |
2691 | tree decl = *node; | |
2692 | tree type = TREE_TYPE (decl); | |
2693 | int pri; | |
2694 | ||
2695 | STRIP_NOPS (initp_expr); | |
9f63daea | 2696 | |
91d231cb JM |
2697 | if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST) |
2698 | { | |
2699 | error ("requested init_priority is not an integer constant"); | |
2700 | *no_add_attrs = true; | |
2701 | return NULL_TREE; | |
2702 | } | |
e5dc5fb2 | 2703 | |
91d231cb | 2704 | pri = TREE_INT_CST_LOW (initp_expr); |
9f63daea | 2705 | |
91d231cb JM |
2706 | type = strip_array_types (type); |
2707 | ||
2708 | if (decl == NULL_TREE | |
2709 | || TREE_CODE (decl) != VAR_DECL | |
2710 | || !TREE_STATIC (decl) | |
2711 | || DECL_EXTERNAL (decl) | |
2712 | || (TREE_CODE (type) != RECORD_TYPE | |
2713 | && TREE_CODE (type) != UNION_TYPE) | |
2714 | /* Static objects in functions are initialized the | |
2715 | first time control passes through that | |
2716 | function. This is not precise enough to pin down an | |
c6002625 | 2717 | init_priority value, so don't allow it. */ |
9f63daea | 2718 | || current_function_decl) |
91d231cb | 2719 | { |
a82e1a7d | 2720 | error ("can only use %qE attribute on file-scope definitions " |
0cbd7506 | 2721 | "of objects of class type", name); |
91d231cb JM |
2722 | *no_add_attrs = true; |
2723 | return NULL_TREE; | |
2724 | } | |
e5dc5fb2 | 2725 | |
91d231cb JM |
2726 | if (pri > MAX_INIT_PRIORITY || pri <= 0) |
2727 | { | |
2728 | error ("requested init_priority is out of range"); | |
2729 | *no_add_attrs = true; | |
2730 | return NULL_TREE; | |
2731 | } | |
e5dc5fb2 | 2732 | |
91d231cb JM |
2733 | /* Check for init_priorities that are reserved for |
2734 | language and runtime support implementations.*/ | |
2735 | if (pri <= MAX_RESERVED_INIT_PRIORITY) | |
2736 | { | |
9f63daea | 2737 | warning |
d4ee4d25 | 2738 | (0, "requested init_priority is reserved for internal use"); |
e5dc5fb2 JM |
2739 | } |
2740 | ||
91d231cb JM |
2741 | if (SUPPORTS_INIT_PRIORITY) |
2742 | { | |
820cc88f DB |
2743 | SET_DECL_INIT_PRIORITY (decl, pri); |
2744 | DECL_HAS_INIT_PRIORITY_P (decl) = 1; | |
91d231cb JM |
2745 | return NULL_TREE; |
2746 | } | |
2747 | else | |
2748 | { | |
a82e1a7d | 2749 | error ("%qE attribute is not supported on this platform", name); |
91d231cb JM |
2750 | *no_add_attrs = true; |
2751 | return NULL_TREE; | |
2752 | } | |
e5dc5fb2 | 2753 | } |
87533b37 MM |
2754 | |
2755 | /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the | |
2756 | thing pointed to by the constant. */ | |
2757 | ||
2758 | tree | |
b57b79f7 | 2759 | make_ptrmem_cst (tree type, tree member) |
87533b37 MM |
2760 | { |
2761 | tree ptrmem_cst = make_node (PTRMEM_CST); | |
87533b37 MM |
2762 | TREE_TYPE (ptrmem_cst) = type; |
2763 | PTRMEM_CST_MEMBER (ptrmem_cst) = member; | |
2764 | return ptrmem_cst; | |
2765 | } | |
2766 | ||
e9525111 | 2767 | /* Build a variant of TYPE that has the indicated ATTRIBUTES. May |
51035976 | 2768 | return an existing type if an appropriate type already exists. */ |
e9525111 MM |
2769 | |
2770 | tree | |
2771 | cp_build_type_attribute_variant (tree type, tree attributes) | |
2772 | { | |
2773 | tree new_type; | |
2774 | ||
2775 | new_type = build_type_attribute_variant (type, attributes); | |
3a55fb4c JM |
2776 | if (TREE_CODE (new_type) == FUNCTION_TYPE |
2777 | || TREE_CODE (new_type) == METHOD_TYPE) | |
e9525111 MM |
2778 | new_type = build_exception_variant (new_type, |
2779 | TYPE_RAISES_EXCEPTIONS (type)); | |
8e30dcf3 JM |
2780 | |
2781 | /* Making a new main variant of a class type is broken. */ | |
2782 | gcc_assert (!CLASS_TYPE_P (type) || new_type == type); | |
2783 | ||
e9525111 MM |
2784 | return new_type; |
2785 | } | |
2786 | ||
2dff8956 JJ |
2787 | /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes. |
2788 | Called only after doing all language independent checks. Only | |
2789 | to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already | |
2790 | compared in type_hash_eq. */ | |
2791 | ||
2792 | bool | |
2793 | cxx_type_hash_eq (const_tree typea, const_tree typeb) | |
2794 | { | |
220e83ca KT |
2795 | gcc_assert (TREE_CODE (typea) == FUNCTION_TYPE |
2796 | || TREE_CODE (typea) == METHOD_TYPE); | |
2dff8956 JJ |
2797 | |
2798 | return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea), | |
3a55fb4c | 2799 | TYPE_RAISES_EXCEPTIONS (typeb), ce_exact); |
2dff8956 JJ |
2800 | } |
2801 | ||
25af8512 | 2802 | /* Apply FUNC to all language-specific sub-trees of TP in a pre-order |
350fae66 | 2803 | traversal. Called from walk_tree. */ |
25af8512 | 2804 | |
9f63daea | 2805 | tree |
350fae66 | 2806 | cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func, |
0c58f841 | 2807 | void *data, struct pointer_set_t *pset) |
25af8512 AO |
2808 | { |
2809 | enum tree_code code = TREE_CODE (*tp); | |
2810 | tree result; | |
9f63daea | 2811 | |
25af8512 AO |
2812 | #define WALK_SUBTREE(NODE) \ |
2813 | do \ | |
2814 | { \ | |
14588106 | 2815 | result = cp_walk_tree (&(NODE), func, data, pset); \ |
6de9cd9a | 2816 | if (result) goto out; \ |
25af8512 AO |
2817 | } \ |
2818 | while (0) | |
2819 | ||
2820 | /* Not one of the easy cases. We must explicitly go through the | |
2821 | children. */ | |
6de9cd9a | 2822 | result = NULL_TREE; |
25af8512 AO |
2823 | switch (code) |
2824 | { | |
2825 | case DEFAULT_ARG: | |
2826 | case TEMPLATE_TEMPLATE_PARM: | |
2827 | case BOUND_TEMPLATE_TEMPLATE_PARM: | |
b8c6534b | 2828 | case UNBOUND_CLASS_TEMPLATE: |
25af8512 AO |
2829 | case TEMPLATE_PARM_INDEX: |
2830 | case TEMPLATE_TYPE_PARM: | |
2831 | case TYPENAME_TYPE: | |
2832 | case TYPEOF_TYPE: | |
da1d7781 | 2833 | /* None of these have subtrees other than those already walked |
0cbd7506 | 2834 | above. */ |
25af8512 AO |
2835 | *walk_subtrees_p = 0; |
2836 | break; | |
2837 | ||
5d80a306 DG |
2838 | case BASELINK: |
2839 | WALK_SUBTREE (BASELINK_FUNCTIONS (*tp)); | |
2840 | *walk_subtrees_p = 0; | |
2841 | break; | |
2842 | ||
25af8512 AO |
2843 | case PTRMEM_CST: |
2844 | WALK_SUBTREE (TREE_TYPE (*tp)); | |
2845 | *walk_subtrees_p = 0; | |
2846 | break; | |
2847 | ||
2848 | case TREE_LIST: | |
5dae1114 | 2849 | WALK_SUBTREE (TREE_PURPOSE (*tp)); |
25af8512 AO |
2850 | break; |
2851 | ||
2852 | case OVERLOAD: | |
2853 | WALK_SUBTREE (OVL_FUNCTION (*tp)); | |
2854 | WALK_SUBTREE (OVL_CHAIN (*tp)); | |
2855 | *walk_subtrees_p = 0; | |
4439d02f DG |
2856 | break; |
2857 | ||
2858 | case USING_DECL: | |
2859 | WALK_SUBTREE (DECL_NAME (*tp)); | |
2860 | WALK_SUBTREE (USING_DECL_SCOPE (*tp)); | |
2861 | WALK_SUBTREE (USING_DECL_DECLS (*tp)); | |
2862 | *walk_subtrees_p = 0; | |
25af8512 AO |
2863 | break; |
2864 | ||
2865 | case RECORD_TYPE: | |
2866 | if (TYPE_PTRMEMFUNC_P (*tp)) | |
2867 | WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp)); | |
2868 | break; | |
2869 | ||
5d80a306 DG |
2870 | case TYPE_ARGUMENT_PACK: |
2871 | case NONTYPE_ARGUMENT_PACK: | |
2872 | { | |
2873 | tree args = ARGUMENT_PACK_ARGS (*tp); | |
2874 | int i, len = TREE_VEC_LENGTH (args); | |
2875 | for (i = 0; i < len; i++) | |
2876 | WALK_SUBTREE (TREE_VEC_ELT (args, i)); | |
2877 | } | |
2878 | break; | |
2879 | ||
2880 | case TYPE_PACK_EXPANSION: | |
2881 | WALK_SUBTREE (TREE_TYPE (*tp)); | |
2882 | *walk_subtrees_p = 0; | |
2883 | break; | |
2884 | ||
2885 | case EXPR_PACK_EXPANSION: | |
2886 | WALK_SUBTREE (TREE_OPERAND (*tp, 0)); | |
2887 | *walk_subtrees_p = 0; | |
2888 | break; | |
2889 | ||
2890 | case CAST_EXPR: | |
a7cbc517 JJ |
2891 | case REINTERPRET_CAST_EXPR: |
2892 | case STATIC_CAST_EXPR: | |
2893 | case CONST_CAST_EXPR: | |
2894 | case DYNAMIC_CAST_EXPR: | |
5d80a306 DG |
2895 | if (TREE_TYPE (*tp)) |
2896 | WALK_SUBTREE (TREE_TYPE (*tp)); | |
2897 | ||
2898 | { | |
2899 | int i; | |
2900 | for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (*tp)); ++i) | |
2901 | WALK_SUBTREE (TREE_OPERAND (*tp, i)); | |
2902 | } | |
2903 | *walk_subtrees_p = 0; | |
2904 | break; | |
2905 | ||
cb68ec50 PC |
2906 | case TRAIT_EXPR: |
2907 | WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp)); | |
2908 | WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp)); | |
2909 | *walk_subtrees_p = 0; | |
2910 | break; | |
2911 | ||
3ad6a8e1 DG |
2912 | case DECLTYPE_TYPE: |
2913 | WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp)); | |
2914 | *walk_subtrees_p = 0; | |
2915 | break; | |
2916 | ||
2917 | ||
25af8512 | 2918 | default: |
350fae66 | 2919 | return NULL_TREE; |
25af8512 AO |
2920 | } |
2921 | ||
2922 | /* We didn't find what we were looking for. */ | |
6de9cd9a | 2923 | out: |
6de9cd9a | 2924 | return result; |
25af8512 AO |
2925 | |
2926 | #undef WALK_SUBTREE | |
2927 | } | |
2928 | ||
b655f214 MM |
2929 | /* Like save_expr, but for C++. */ |
2930 | ||
2931 | tree | |
2932 | cp_save_expr (tree expr) | |
2933 | { | |
2934 | /* There is no reason to create a SAVE_EXPR within a template; if | |
2935 | needed, we can create the SAVE_EXPR when instantiating the | |
2936 | template. Furthermore, the middle-end cannot handle C++-specific | |
2937 | tree codes. */ | |
2938 | if (processing_template_decl) | |
2939 | return expr; | |
2940 | return save_expr (expr); | |
2941 | } | |
2942 | ||
87e3dbc9 MM |
2943 | /* Initialize tree.c. */ |
2944 | ||
0a818f84 | 2945 | void |
b57b79f7 | 2946 | init_tree (void) |
0a818f84 | 2947 | { |
e2500fed | 2948 | list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL); |
0a818f84 GRK |
2949 | } |
2950 | ||
872f37f9 | 2951 | /* Returns the kind of special function that DECL (a FUNCTION_DECL) |
50ad9642 MM |
2952 | is. Note that sfk_none is zero, so this function can be used as a |
2953 | predicate to test whether or not DECL is a special function. */ | |
872f37f9 MM |
2954 | |
2955 | special_function_kind | |
58f9752a | 2956 | special_function_p (const_tree decl) |
872f37f9 MM |
2957 | { |
2958 | /* Rather than doing all this stuff with magic names, we should | |
2959 | probably have a field of type `special_function_kind' in | |
2960 | DECL_LANG_SPECIFIC. */ | |
2961 | if (DECL_COPY_CONSTRUCTOR_P (decl)) | |
2962 | return sfk_copy_constructor; | |
d5f4eddd JM |
2963 | if (DECL_MOVE_CONSTRUCTOR_P (decl)) |
2964 | return sfk_move_constructor; | |
872f37f9 MM |
2965 | if (DECL_CONSTRUCTOR_P (decl)) |
2966 | return sfk_constructor; | |
596ea4e5 | 2967 | if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR) |
ac177431 JM |
2968 | { |
2969 | if (copy_fn_p (decl)) | |
2970 | return sfk_copy_assignment; | |
2971 | if (move_fn_p (decl)) | |
2972 | return sfk_move_assignment; | |
2973 | } | |
872f37f9 MM |
2974 | if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)) |
2975 | return sfk_destructor; | |
2976 | if (DECL_COMPLETE_DESTRUCTOR_P (decl)) | |
2977 | return sfk_complete_destructor; | |
2978 | if (DECL_BASE_DESTRUCTOR_P (decl)) | |
2979 | return sfk_base_destructor; | |
2980 | if (DECL_DELETING_DESTRUCTOR_P (decl)) | |
2981 | return sfk_deleting_destructor; | |
2982 | if (DECL_CONV_FN_P (decl)) | |
2983 | return sfk_conversion; | |
2984 | ||
2985 | return sfk_none; | |
2986 | } | |
7b019c19 | 2987 | |
838dfd8a | 2988 | /* Returns nonzero if TYPE is a character type, including wchar_t. */ |
7b019c19 MM |
2989 | |
2990 | int | |
b57b79f7 | 2991 | char_type_p (tree type) |
7b019c19 MM |
2992 | { |
2993 | return (same_type_p (type, char_type_node) | |
2994 | || same_type_p (type, unsigned_char_type_node) | |
2995 | || same_type_p (type, signed_char_type_node) | |
b6baa67d KVH |
2996 | || same_type_p (type, char16_type_node) |
2997 | || same_type_p (type, char32_type_node) | |
7b019c19 MM |
2998 | || same_type_p (type, wchar_type_node)); |
2999 | } | |
ad50e811 MM |
3000 | |
3001 | /* Returns the kind of linkage associated with the indicated DECL. Th | |
3002 | value returned is as specified by the language standard; it is | |
3003 | independent of implementation details regarding template | |
3004 | instantiation, etc. For example, it is possible that a declaration | |
3005 | to which this function assigns external linkage would not show up | |
3006 | as a global symbol when you run `nm' on the resulting object file. */ | |
3007 | ||
3008 | linkage_kind | |
b57b79f7 | 3009 | decl_linkage (tree decl) |
ad50e811 MM |
3010 | { |
3011 | /* This function doesn't attempt to calculate the linkage from first | |
3012 | principles as given in [basic.link]. Instead, it makes use of | |
3013 | the fact that we have already set TREE_PUBLIC appropriately, and | |
3014 | then handles a few special cases. Ideally, we would calculate | |
3015 | linkage first, and then transform that into a concrete | |
3016 | implementation. */ | |
3017 | ||
3018 | /* Things that don't have names have no linkage. */ | |
3019 | if (!DECL_NAME (decl)) | |
3020 | return lk_none; | |
3021 | ||
c02cdc25 TT |
3022 | /* Fields have no linkage. */ |
3023 | if (TREE_CODE (decl) == FIELD_DECL) | |
3024 | return lk_none; | |
3025 | ||
ad50e811 MM |
3026 | /* Things that are TREE_PUBLIC have external linkage. */ |
3027 | if (TREE_PUBLIC (decl)) | |
3028 | return lk_external; | |
3db45ab5 | 3029 | |
b70f0f48 JM |
3030 | if (TREE_CODE (decl) == NAMESPACE_DECL) |
3031 | return lk_external; | |
3032 | ||
3db45ab5 | 3033 | /* Linkage of a CONST_DECL depends on the linkage of the enumeration |
3f774254 DB |
3034 | type. */ |
3035 | if (TREE_CODE (decl) == CONST_DECL) | |
3036 | return decl_linkage (TYPE_NAME (TREE_TYPE (decl))); | |
ad50e811 MM |
3037 | |
3038 | /* Some things that are not TREE_PUBLIC have external linkage, too. | |
3039 | For example, on targets that don't have weak symbols, we make all | |
3040 | template instantiations have internal linkage (in the object | |
3041 | file), but the symbols should still be treated as having external | |
3042 | linkage from the point of view of the language. */ | |
ad909c97 JM |
3043 | if ((TREE_CODE (decl) == FUNCTION_DECL |
3044 | || TREE_CODE (decl) == VAR_DECL) | |
b9e75696 | 3045 | && DECL_COMDAT (decl)) |
ad50e811 MM |
3046 | return lk_external; |
3047 | ||
3048 | /* Things in local scope do not have linkage, if they don't have | |
3049 | TREE_PUBLIC set. */ | |
3050 | if (decl_function_context (decl)) | |
3051 | return lk_none; | |
3052 | ||
b70f0f48 JM |
3053 | /* Members of the anonymous namespace also have TREE_PUBLIC unset, but |
3054 | are considered to have external linkage for language purposes. DECLs | |
3055 | really meant to have internal linkage have DECL_THIS_STATIC set. */ | |
ce41114b | 3056 | if (TREE_CODE (decl) == TYPE_DECL) |
b70f0f48 | 3057 | return lk_external; |
ce41114b JJ |
3058 | if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL) |
3059 | { | |
3060 | if (!DECL_THIS_STATIC (decl)) | |
3061 | return lk_external; | |
3062 | ||
3063 | /* Static data members and static member functions from classes | |
3064 | in anonymous namespace also don't have TREE_PUBLIC set. */ | |
3065 | if (DECL_CLASS_CONTEXT (decl)) | |
3066 | return lk_external; | |
3067 | } | |
b70f0f48 | 3068 | |
ad50e811 MM |
3069 | /* Everything else has internal linkage. */ |
3070 | return lk_internal; | |
3071 | } | |
b95ca513 JM |
3072 | |
3073 | /* Returns the storage duration of the object or reference associated with | |
3074 | the indicated DECL, which should be a VAR_DECL or PARM_DECL. */ | |
3075 | ||
3076 | duration_kind | |
3077 | decl_storage_duration (tree decl) | |
3078 | { | |
3079 | if (TREE_CODE (decl) == PARM_DECL) | |
3080 | return dk_auto; | |
3081 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
3082 | return dk_static; | |
3083 | gcc_assert (TREE_CODE (decl) == VAR_DECL); | |
3084 | if (!TREE_STATIC (decl) | |
3085 | && !DECL_EXTERNAL (decl)) | |
3086 | return dk_auto; | |
3087 | if (DECL_THREAD_LOCAL_P (decl)) | |
3088 | return dk_thread; | |
3089 | return dk_static; | |
3090 | } | |
6f30f1f1 | 3091 | \f |
9beafc83 MM |
3092 | /* EXP is an expression that we want to pre-evaluate. Returns (in |
3093 | *INITP) an expression that will perform the pre-evaluation. The | |
3094 | value returned by this function is a side-effect free expression | |
3095 | equivalent to the pre-evaluated expression. Callers must ensure | |
3096 | that *INITP is evaluated before EXP. */ | |
6f30f1f1 JM |
3097 | |
3098 | tree | |
b57b79f7 | 3099 | stabilize_expr (tree exp, tree* initp) |
6f30f1f1 JM |
3100 | { |
3101 | tree init_expr; | |
3102 | ||
3103 | if (!TREE_SIDE_EFFECTS (exp)) | |
9beafc83 | 3104 | init_expr = NULL_TREE; |
7d127f59 | 3105 | else if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)) |
883fff6c | 3106 | || !lvalue_or_rvalue_with_address_p (exp)) |
6f30f1f1 JM |
3107 | { |
3108 | init_expr = get_target_expr (exp); | |
3109 | exp = TARGET_EXPR_SLOT (init_expr); | |
3110 | } | |
3111 | else | |
3112 | { | |
883fff6c | 3113 | bool xval = !real_lvalue_p (exp); |
93c0e0bb | 3114 | exp = cp_build_addr_expr (exp, tf_warning_or_error); |
6f30f1f1 JM |
3115 | init_expr = get_target_expr (exp); |
3116 | exp = TARGET_EXPR_SLOT (init_expr); | |
dd865ef6 | 3117 | exp = cp_build_indirect_ref (exp, RO_NULL, tf_warning_or_error); |
883fff6c JM |
3118 | if (xval) |
3119 | exp = move (exp); | |
6f30f1f1 | 3120 | } |
6f30f1f1 | 3121 | *initp = init_expr; |
9beafc83 MM |
3122 | |
3123 | gcc_assert (!TREE_SIDE_EFFECTS (exp)); | |
6f30f1f1 JM |
3124 | return exp; |
3125 | } | |
6de9cd9a | 3126 | |
be93747e | 3127 | /* Add NEW_EXPR, an expression whose value we don't care about, after the |
40aac948 JM |
3128 | similar expression ORIG. */ |
3129 | ||
3130 | tree | |
be93747e | 3131 | add_stmt_to_compound (tree orig, tree new_expr) |
40aac948 | 3132 | { |
be93747e | 3133 | if (!new_expr || !TREE_SIDE_EFFECTS (new_expr)) |
40aac948 JM |
3134 | return orig; |
3135 | if (!orig || !TREE_SIDE_EFFECTS (orig)) | |
be93747e KG |
3136 | return new_expr; |
3137 | return build2 (COMPOUND_EXPR, void_type_node, orig, new_expr); | |
40aac948 JM |
3138 | } |
3139 | ||
9beafc83 MM |
3140 | /* Like stabilize_expr, but for a call whose arguments we want to |
3141 | pre-evaluate. CALL is modified in place to use the pre-evaluated | |
3142 | arguments, while, upon return, *INITP contains an expression to | |
3143 | compute the arguments. */ | |
6de9cd9a DN |
3144 | |
3145 | void | |
3146 | stabilize_call (tree call, tree *initp) | |
3147 | { | |
3148 | tree inits = NULL_TREE; | |
5039610b SL |
3149 | int i; |
3150 | int nargs = call_expr_nargs (call); | |
6de9cd9a | 3151 | |
28267cfc JJ |
3152 | if (call == error_mark_node || processing_template_decl) |
3153 | { | |
3154 | *initp = NULL_TREE; | |
3155 | return; | |
3156 | } | |
6de9cd9a | 3157 | |
5039610b | 3158 | gcc_assert (TREE_CODE (call) == CALL_EXPR); |
6de9cd9a | 3159 | |
5039610b SL |
3160 | for (i = 0; i < nargs; i++) |
3161 | { | |
3162 | tree init; | |
3163 | CALL_EXPR_ARG (call, i) = | |
3164 | stabilize_expr (CALL_EXPR_ARG (call, i), &init); | |
3165 | inits = add_stmt_to_compound (inits, init); | |
3166 | } | |
3167 | ||
3168 | *initp = inits; | |
3169 | } | |
3170 | ||
3171 | /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want | |
3172 | to pre-evaluate. CALL is modified in place to use the pre-evaluated | |
3173 | arguments, while, upon return, *INITP contains an expression to | |
3174 | compute the arguments. */ | |
3175 | ||
3176 | void | |
3177 | stabilize_aggr_init (tree call, tree *initp) | |
3178 | { | |
3179 | tree inits = NULL_TREE; | |
3180 | int i; | |
3181 | int nargs = aggr_init_expr_nargs (call); | |
3182 | ||
3183 | if (call == error_mark_node) | |
3184 | return; | |
3185 | ||
3186 | gcc_assert (TREE_CODE (call) == AGGR_INIT_EXPR); | |
3187 | ||
3188 | for (i = 0; i < nargs; i++) | |
3189 | { | |
3190 | tree init; | |
3191 | AGGR_INIT_EXPR_ARG (call, i) = | |
3192 | stabilize_expr (AGGR_INIT_EXPR_ARG (call, i), &init); | |
3193 | inits = add_stmt_to_compound (inits, init); | |
3194 | } | |
6de9cd9a DN |
3195 | |
3196 | *initp = inits; | |
3197 | } | |
3198 | ||
9beafc83 MM |
3199 | /* Like stabilize_expr, but for an initialization. |
3200 | ||
3201 | If the initialization is for an object of class type, this function | |
3202 | takes care not to introduce additional temporaries. | |
3203 | ||
3204 | Returns TRUE iff the expression was successfully pre-evaluated, | |
3205 | i.e., if INIT is now side-effect free, except for, possible, a | |
3206 | single call to a constructor. */ | |
6de9cd9a DN |
3207 | |
3208 | bool | |
3209 | stabilize_init (tree init, tree *initp) | |
3210 | { | |
3211 | tree t = init; | |
3212 | ||
9beafc83 MM |
3213 | *initp = NULL_TREE; |
3214 | ||
28267cfc | 3215 | if (t == error_mark_node || processing_template_decl) |
6de9cd9a DN |
3216 | return true; |
3217 | ||
3218 | if (TREE_CODE (t) == INIT_EXPR | |
844ae01d JM |
3219 | && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR |
3220 | && TREE_CODE (TREE_OPERAND (t, 1)) != AGGR_INIT_EXPR) | |
6de9cd9a | 3221 | { |
9beafc83 MM |
3222 | TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp); |
3223 | return true; | |
3224 | } | |
6de9cd9a | 3225 | |
9beafc83 MM |
3226 | if (TREE_CODE (t) == INIT_EXPR) |
3227 | t = TREE_OPERAND (t, 1); | |
3228 | if (TREE_CODE (t) == TARGET_EXPR) | |
3229 | t = TARGET_EXPR_INITIAL (t); | |
3230 | if (TREE_CODE (t) == COMPOUND_EXPR) | |
3231 | t = expr_last (t); | |
3232 | if (TREE_CODE (t) == CONSTRUCTOR | |
3233 | && EMPTY_CONSTRUCTOR_P (t)) | |
3234 | /* Default-initialization. */ | |
3235 | return true; | |
3236 | ||
3237 | /* If the initializer is a COND_EXPR, we can't preevaluate | |
3238 | anything. */ | |
3239 | if (TREE_CODE (t) == COND_EXPR) | |
3240 | return false; | |
6de9cd9a | 3241 | |
5039610b | 3242 | if (TREE_CODE (t) == CALL_EXPR) |
9beafc83 MM |
3243 | { |
3244 | stabilize_call (t, initp); | |
3245 | return true; | |
6de9cd9a DN |
3246 | } |
3247 | ||
5039610b SL |
3248 | if (TREE_CODE (t) == AGGR_INIT_EXPR) |
3249 | { | |
3250 | stabilize_aggr_init (t, initp); | |
3251 | return true; | |
3252 | } | |
3253 | ||
9beafc83 MM |
3254 | /* The initialization is being performed via a bitwise copy -- and |
3255 | the item copied may have side effects. */ | |
3256 | return TREE_SIDE_EFFECTS (init); | |
6de9cd9a DN |
3257 | } |
3258 | ||
455f19cb MM |
3259 | /* Like "fold", but should be used whenever we might be processing the |
3260 | body of a template. */ | |
3261 | ||
3262 | tree | |
3263 | fold_if_not_in_template (tree expr) | |
3264 | { | |
3265 | /* In the body of a template, there is never any need to call | |
3266 | "fold". We will call fold later when actually instantiating the | |
3267 | template. Integral constant expressions in templates will be | |
f9f1c24e | 3268 | evaluated via fold_non_dependent_expr, as necessary. */ |
392e3d51 RS |
3269 | if (processing_template_decl) |
3270 | return expr; | |
3271 | ||
3272 | /* Fold C++ front-end specific tree codes. */ | |
3273 | if (TREE_CODE (expr) == UNARY_PLUS_EXPR) | |
3274 | return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0)); | |
3275 | ||
3276 | return fold (expr); | |
455f19cb MM |
3277 | } |
3278 | ||
015c2c66 MM |
3279 | /* Returns true if a cast to TYPE may appear in an integral constant |
3280 | expression. */ | |
3281 | ||
3282 | bool | |
3283 | cast_valid_in_integral_constant_expression_p (tree type) | |
3284 | { | |
3285 | return (INTEGRAL_OR_ENUMERATION_TYPE_P (type) | |
fa2200cb | 3286 | || cxx_dialect >= cxx0x |
015c2c66 MM |
3287 | || dependent_type_p (type) |
3288 | || type == error_mark_node); | |
3289 | } | |
3290 | ||
4537ec0c DN |
3291 | /* Return true if we need to fix linkage information of DECL. */ |
3292 | ||
3293 | static bool | |
3294 | cp_fix_function_decl_p (tree decl) | |
3295 | { | |
3296 | /* Skip if DECL is not externally visible. */ | |
3297 | if (!TREE_PUBLIC (decl)) | |
3298 | return false; | |
3299 | ||
3300 | /* We need to fix DECL if it a appears to be exported but with no | |
3301 | function body. Thunks do not have CFGs and we may need to | |
3302 | handle them specially later. */ | |
3303 | if (!gimple_has_body_p (decl) | |
3304 | && !DECL_THUNK_P (decl) | |
3305 | && !DECL_EXTERNAL (decl)) | |
87501227 JJ |
3306 | { |
3307 | struct cgraph_node *node = cgraph_get_node (decl); | |
3308 | ||
3309 | /* Don't fix same_body aliases. Although they don't have their own | |
3310 | CFG, they share it with what they alias to. */ | |
3311 | if (!node | |
3312 | || node->decl == decl | |
3313 | || !node->same_body) | |
3314 | return true; | |
3315 | } | |
4537ec0c DN |
3316 | |
3317 | return false; | |
3318 | } | |
3319 | ||
3320 | /* Clean the C++ specific parts of the tree T. */ | |
3321 | ||
3322 | void | |
3323 | cp_free_lang_data (tree t) | |
3324 | { | |
3325 | if (TREE_CODE (t) == METHOD_TYPE | |
3326 | || TREE_CODE (t) == FUNCTION_TYPE) | |
3327 | { | |
3328 | /* Default args are not interesting anymore. */ | |
3329 | tree argtypes = TYPE_ARG_TYPES (t); | |
3330 | while (argtypes) | |
3331 | { | |
3332 | TREE_PURPOSE (argtypes) = 0; | |
3333 | argtypes = TREE_CHAIN (argtypes); | |
3334 | } | |
3335 | } | |
3336 | else if (TREE_CODE (t) == FUNCTION_DECL | |
3337 | && cp_fix_function_decl_p (t)) | |
3338 | { | |
3339 | /* If T is used in this translation unit at all, the definition | |
3340 | must exist somewhere else since we have decided to not emit it | |
3341 | in this TU. So make it an external reference. */ | |
3342 | DECL_EXTERNAL (t) = 1; | |
3343 | TREE_STATIC (t) = 0; | |
3344 | } | |
652a8c1c RG |
3345 | if (CP_AGGREGATE_TYPE_P (t) |
3346 | && TYPE_NAME (t)) | |
3347 | { | |
3348 | tree name = TYPE_NAME (t); | |
3349 | if (TREE_CODE (name) == TYPE_DECL) | |
3350 | name = DECL_NAME (name); | |
3351 | /* Drop anonymous names. */ | |
3352 | if (name != NULL_TREE | |
3353 | && ANON_AGGRNAME_P (name)) | |
3354 | TYPE_NAME (t) = NULL_TREE; | |
3355 | } | |
b4ca4f9e RG |
3356 | if (TREE_CODE (t) == NAMESPACE_DECL) |
3357 | { | |
3358 | /* The list of users of a namespace isn't useful for the middle-end | |
3359 | or debug generators. */ | |
3360 | DECL_NAMESPACE_USERS (t) = NULL_TREE; | |
3361 | /* Neither do we need the leftover chaining of namespaces | |
3362 | from the binding level. */ | |
3363 | DECL_CHAIN (t) = NULL_TREE; | |
3364 | } | |
4537ec0c DN |
3365 | } |
3366 | ||
bffad7f1 SB |
3367 | /* Stub for c-common. Please keep in sync with c-decl.c. |
3368 | FIXME: If address space support is target specific, then this | |
3369 | should be a C target hook. But currently this is not possible, | |
3370 | because this function is called via REGISTER_TARGET_PRAGMAS. */ | |
3371 | void | |
3372 | c_register_addr_space (const char *word ATTRIBUTE_UNUSED, | |
3373 | addr_space_t as ATTRIBUTE_UNUSED) | |
3374 | { | |
3375 | } | |
3376 | ||
e2500fed GK |
3377 | \f |
3378 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) | |
3379 | /* Complain that some language-specific thing hanging off a tree | |
3380 | node has been accessed improperly. */ | |
3381 | ||
3382 | void | |
b57b79f7 | 3383 | lang_check_failed (const char* file, int line, const char* function) |
e2500fed GK |
3384 | { |
3385 | internal_error ("lang_* check: failed in %s, at %s:%d", | |
3386 | function, trim_filename (file), line); | |
3387 | } | |
3388 | #endif /* ENABLE_TREE_CHECKING */ | |
3389 | ||
3390 | #include "gt-cp-tree.h" |