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