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