]>
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, |
3638a282 | 3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc. |
8d08fdba MS |
4 | Hacked by Michael Tiemann (tiemann@cygnus.com) |
5 | ||
f5adbb8d | 6 | This file is part of GCC. |
8d08fdba | 7 | |
f5adbb8d | 8 | GCC is free software; you can redistribute it and/or modify |
8d08fdba MS |
9 | it under the terms of the GNU General Public License as published by |
10 | the Free Software Foundation; either version 2, or (at your option) | |
11 | any later version. | |
12 | ||
f5adbb8d | 13 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
f5adbb8d | 19 | along with GCC; see the file COPYING. If not, write to |
1788952f KC |
20 | the Free Software Foundation, 51 Franklin Street, Fifth Floor, |
21 | Boston, MA 02110-1301, USA. */ | |
8d08fdba MS |
22 | |
23 | #include "config.h" | |
8d052bc7 | 24 | #include "system.h" |
4977bab6 ZW |
25 | #include "coretypes.h" |
26 | #include "tm.h" | |
8d08fdba MS |
27 | #include "tree.h" |
28 | #include "cp-tree.h" | |
29 | #include "flags.h" | |
11ad4784 | 30 | #include "real.h" |
28cbf42c | 31 | #include "rtl.h" |
12027a89 | 32 | #include "toplev.h" |
46e8c075 MM |
33 | #include "insn-config.h" |
34 | #include "integrate.h" | |
25af8512 | 35 | #include "tree-inline.h" |
e58a9aa1 | 36 | #include "debug.h" |
8a3c9180 | 37 | #include "target.h" |
12027a89 | 38 | |
b57b79f7 NN |
39 | static tree bot_manip (tree *, int *, void *); |
40 | static tree bot_replace (tree *, int *, void *); | |
41 | static tree build_cplus_array_type_1 (tree, tree); | |
42 | static int list_hash_eq (const void *, const void *); | |
43 | static hashval_t list_hash_pieces (tree, tree, tree); | |
44 | static hashval_t list_hash (const void *); | |
d18a8251 | 45 | static cp_lvalue_kind lvalue_p_1 (tree, int); |
b57b79f7 NN |
46 | static tree build_target_expr (tree, tree); |
47 | static tree count_trees_r (tree *, int *, void *); | |
48 | static tree verify_stmt_tree_r (tree *, int *, void *); | |
a6f86b51 | 49 | static tree build_local_temp (tree); |
b57b79f7 NN |
50 | |
51 | static tree handle_java_interface_attribute (tree *, tree, tree, int, bool *); | |
52 | static tree handle_com_interface_attribute (tree *, tree, tree, int, bool *); | |
53 | static tree handle_init_priority_attribute (tree *, tree, tree, int, bool *); | |
91d231cb | 54 | |
27b8d0cd MM |
55 | /* If REF is an lvalue, returns the kind of lvalue that REF is. |
56 | Otherwise, returns clk_none. If TREAT_CLASS_RVALUES_AS_LVALUES is | |
838dfd8a | 57 | nonzero, rvalues of class type are considered lvalues. */ |
8d08fdba | 58 | |
27b8d0cd | 59 | static cp_lvalue_kind |
9f63daea | 60 | lvalue_p_1 (tree ref, |
0cbd7506 | 61 | int treat_class_rvalues_as_lvalues) |
8ccc31eb | 62 | { |
27b8d0cd MM |
63 | cp_lvalue_kind op1_lvalue_kind = clk_none; |
64 | cp_lvalue_kind op2_lvalue_kind = clk_none; | |
65 | ||
8ccc31eb | 66 | if (TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE) |
27b8d0cd | 67 | return clk_ordinary; |
8ccc31eb | 68 | |
394fd776 | 69 | if (ref == current_class_ptr) |
27b8d0cd | 70 | return clk_none; |
8ccc31eb MS |
71 | |
72 | switch (TREE_CODE (ref)) | |
73 | { | |
74 | /* preincrements and predecrements are valid lvals, provided | |
e92cc029 | 75 | what they refer to are valid lvals. */ |
8ccc31eb MS |
76 | case PREINCREMENT_EXPR: |
77 | case PREDECREMENT_EXPR: | |
8ccc31eb | 78 | case SAVE_EXPR: |
c7ae64f2 JM |
79 | case TRY_CATCH_EXPR: |
80 | case WITH_CLEANUP_EXPR: | |
69851283 MM |
81 | case REALPART_EXPR: |
82 | case IMAGPART_EXPR: | |
83 | return lvalue_p_1 (TREE_OPERAND (ref, 0), | |
d18a8251 | 84 | treat_class_rvalues_as_lvalues); |
8ccc31eb | 85 | |
27b8d0cd MM |
86 | case COMPONENT_REF: |
87 | op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0), | |
d18a8251 | 88 | treat_class_rvalues_as_lvalues); |
c8b2e872 | 89 | /* Look at the member designator. */ |
9f63daea EC |
90 | if (!op1_lvalue_kind |
91 | /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some | |
0cbd7506 MS |
92 | situations. */ |
93 | || TREE_CODE (TREE_OPERAND (ref, 1)) != FIELD_DECL) | |
94 | ; | |
e0d1297c | 95 | else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref, 1))) |
27b8d0cd MM |
96 | { |
97 | /* Clear the ordinary bit. If this object was a class | |
98 | rvalue we want to preserve that information. */ | |
99 | op1_lvalue_kind &= ~clk_ordinary; | |
cd0be382 | 100 | /* The lvalue is for a bitfield. */ |
27b8d0cd MM |
101 | op1_lvalue_kind |= clk_bitfield; |
102 | } | |
e0d1297c NS |
103 | else if (DECL_PACKED (TREE_OPERAND (ref, 1))) |
104 | op1_lvalue_kind |= clk_packed; | |
9f63daea | 105 | |
27b8d0cd MM |
106 | return op1_lvalue_kind; |
107 | ||
8ccc31eb | 108 | case STRING_CST: |
27b8d0cd | 109 | return clk_ordinary; |
8ccc31eb | 110 | |
e58a9aa1 | 111 | case CONST_DECL: |
8ccc31eb MS |
112 | case VAR_DECL: |
113 | if (TREE_READONLY (ref) && ! TREE_STATIC (ref) | |
114 | && DECL_LANG_SPECIFIC (ref) | |
115 | && DECL_IN_AGGR_P (ref)) | |
27b8d0cd | 116 | return clk_none; |
8ccc31eb MS |
117 | case INDIRECT_REF: |
118 | case ARRAY_REF: | |
119 | case PARM_DECL: | |
120 | case RESULT_DECL: | |
59e76fc6 | 121 | if (TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE) |
27b8d0cd | 122 | return clk_ordinary; |
8ccc31eb MS |
123 | break; |
124 | ||
8ccc31eb MS |
125 | /* A currently unresolved scope ref. */ |
126 | case SCOPE_REF: | |
315fb5db | 127 | gcc_unreachable (); |
27b8d0cd MM |
128 | case MAX_EXPR: |
129 | case MIN_EXPR: | |
d211a298 RS |
130 | /* Disallow <? and >? as lvalues if either argument side-effects. */ |
131 | if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 0)) | |
132 | || TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 1))) | |
133 | return clk_none; | |
27b8d0cd | 134 | op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0), |
d18a8251 | 135 | treat_class_rvalues_as_lvalues); |
27b8d0cd | 136 | op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1), |
d18a8251 | 137 | treat_class_rvalues_as_lvalues); |
8ccc31eb MS |
138 | break; |
139 | ||
140 | case COND_EXPR: | |
27b8d0cd | 141 | op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1), |
d18a8251 | 142 | treat_class_rvalues_as_lvalues); |
27b8d0cd | 143 | op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 2), |
d18a8251 | 144 | treat_class_rvalues_as_lvalues); |
27b8d0cd | 145 | break; |
8ccc31eb MS |
146 | |
147 | case MODIFY_EXPR: | |
27b8d0cd | 148 | return clk_ordinary; |
8ccc31eb MS |
149 | |
150 | case COMPOUND_EXPR: | |
69851283 | 151 | return lvalue_p_1 (TREE_OPERAND (ref, 1), |
d18a8251 | 152 | treat_class_rvalues_as_lvalues); |
69851283 MM |
153 | |
154 | case TARGET_EXPR: | |
27b8d0cd | 155 | return treat_class_rvalues_as_lvalues ? clk_class : clk_none; |
69851283 | 156 | |
356955cf | 157 | case VA_ARG_EXPR: |
c0ad5a31 MM |
158 | return (treat_class_rvalues_as_lvalues |
159 | && CLASS_TYPE_P (TREE_TYPE (ref)) | |
160 | ? clk_class : clk_none); | |
161 | ||
162 | case CALL_EXPR: | |
4e8dca1c JM |
163 | /* Any class-valued call would be wrapped in a TARGET_EXPR. */ |
164 | return clk_none; | |
69851283 MM |
165 | |
166 | case FUNCTION_DECL: | |
167 | /* All functions (except non-static-member functions) are | |
168 | lvalues. */ | |
9f63daea | 169 | return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref) |
27b8d0cd | 170 | ? clk_none : clk_ordinary); |
7f85441b | 171 | |
d17811fd MM |
172 | case NON_DEPENDENT_EXPR: |
173 | /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that | |
174 | things like "&E" where "E" is an expression with a | |
175 | non-dependent type work. It is safe to be lenient because an | |
176 | error will be issued when the template is instantiated if "E" | |
177 | is not an lvalue. */ | |
178 | return clk_ordinary; | |
179 | ||
7f85441b KG |
180 | default: |
181 | break; | |
8ccc31eb MS |
182 | } |
183 | ||
27b8d0cd MM |
184 | /* If one operand is not an lvalue at all, then this expression is |
185 | not an lvalue. */ | |
186 | if (!op1_lvalue_kind || !op2_lvalue_kind) | |
187 | return clk_none; | |
188 | ||
189 | /* Otherwise, it's an lvalue, and it has all the odd properties | |
190 | contributed by either operand. */ | |
191 | op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind; | |
192 | /* It's not an ordinary lvalue if it involves either a bit-field or | |
193 | a class rvalue. */ | |
194 | if ((op1_lvalue_kind & ~clk_ordinary) != clk_none) | |
195 | op1_lvalue_kind &= ~clk_ordinary; | |
196 | return op1_lvalue_kind; | |
8ccc31eb MS |
197 | } |
198 | ||
aa6e8ed3 MM |
199 | /* Returns the kind of lvalue that REF is, in the sense of |
200 | [basic.lval]. This function should really be named lvalue_p; it | |
201 | computes the C++ definition of lvalue. */ | |
202 | ||
203 | cp_lvalue_kind | |
d18a8251 | 204 | real_lvalue_p (tree ref) |
aa6e8ed3 | 205 | { |
9f63daea | 206 | return lvalue_p_1 (ref, |
d18a8251 | 207 | /*treat_class_rvalues_as_lvalues=*/0); |
aa6e8ed3 MM |
208 | } |
209 | ||
27b8d0cd MM |
210 | /* This differs from real_lvalue_p in that class rvalues are |
211 | considered lvalues. */ | |
69851283 | 212 | |
8d08fdba | 213 | int |
b57b79f7 | 214 | lvalue_p (tree ref) |
8d08fdba | 215 | { |
9f63daea | 216 | return |
d18a8251 | 217 | (lvalue_p_1 (ref, /*class rvalue ok*/ 1) != clk_none); |
6c6e776d MA |
218 | } |
219 | ||
100d337a MA |
220 | /* Test whether DECL is a builtin that may appear in a |
221 | constant-expression. */ | |
222 | ||
223 | bool | |
224 | builtin_valid_in_constant_expr_p (tree decl) | |
225 | { | |
226 | /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing | |
227 | in constant-expressions. We may want to add other builtins later. */ | |
88a7beb7 | 228 | return DECL_IS_BUILTIN_CONSTANT_P (decl); |
100d337a MA |
229 | } |
230 | ||
c506ca22 MM |
231 | /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */ |
232 | ||
233 | static tree | |
b57b79f7 | 234 | build_target_expr (tree decl, tree value) |
c506ca22 MM |
235 | { |
236 | tree t; | |
237 | ||
f293ce4b RS |
238 | t = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value, |
239 | cxx_maybe_build_cleanup (decl), NULL_TREE); | |
c506ca22 MM |
240 | /* We always set TREE_SIDE_EFFECTS so that expand_expr does not |
241 | ignore the TARGET_EXPR. If there really turn out to be no | |
242 | side-effects, then the optimizer should be able to get rid of | |
243 | whatever code is generated anyhow. */ | |
244 | TREE_SIDE_EFFECTS (t) = 1; | |
245 | ||
246 | return t; | |
247 | } | |
248 | ||
a6f86b51 JM |
249 | /* Return an undeclared local temporary of type TYPE for use in building a |
250 | TARGET_EXPR. */ | |
251 | ||
252 | static tree | |
253 | build_local_temp (tree type) | |
254 | { | |
255 | tree slot = build_decl (VAR_DECL, NULL_TREE, type); | |
256 | DECL_ARTIFICIAL (slot) = 1; | |
78e0d62b | 257 | DECL_IGNORED_P (slot) = 1; |
a6f86b51 JM |
258 | DECL_CONTEXT (slot) = current_function_decl; |
259 | layout_decl (slot, 0); | |
260 | return slot; | |
261 | } | |
262 | ||
8d08fdba MS |
263 | /* INIT is a CALL_EXPR which needs info about its target. |
264 | TYPE is the type that this initialization should appear to have. | |
265 | ||
266 | Build an encapsulation of the initialization to perform | |
267 | and return it so that it can be processed by language-independent | |
2ee887f2 | 268 | and language-specific expression expanders. */ |
e92cc029 | 269 | |
8d08fdba | 270 | tree |
b57b79f7 | 271 | build_cplus_new (tree type, tree init) |
8d08fdba | 272 | { |
e1376b00 | 273 | tree fn; |
e8abc66f MS |
274 | tree slot; |
275 | tree rval; | |
4977bab6 | 276 | int is_ctor; |
e8abc66f | 277 | |
27b8d0cd MM |
278 | /* Make sure that we're not trying to create an instance of an |
279 | abstract class. */ | |
5bb2f1e7 | 280 | abstract_virtuals_error (NULL_TREE, type); |
27b8d0cd | 281 | |
02531345 | 282 | if (TREE_CODE (init) != CALL_EXPR && TREE_CODE (init) != AGGR_INIT_EXPR) |
06126ca2 | 283 | return convert (type, init); |
c11b6f21 | 284 | |
4977bab6 ZW |
285 | fn = TREE_OPERAND (init, 0); |
286 | is_ctor = (TREE_CODE (fn) == ADDR_EXPR | |
287 | && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL | |
288 | && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0))); | |
289 | ||
a6f86b51 | 290 | slot = build_local_temp (type); |
e1376b00 MM |
291 | |
292 | /* We split the CALL_EXPR into its function and its arguments here. | |
293 | Then, in expand_expr, we put them back together. The reason for | |
294 | this is that this expression might be a default argument | |
295 | expression. In that case, we need a new temporary every time the | |
296 | expression is used. That's what break_out_target_exprs does; it | |
297 | replaces every AGGR_INIT_EXPR with a copy that uses a fresh | |
298 | temporary slot. Then, expand_expr builds up a call-expression | |
299 | using the new slot. */ | |
4977bab6 ZW |
300 | |
301 | /* If we don't need to use a constructor to create an object of this | |
302 | type, don't mess with AGGR_INIT_EXPR. */ | |
303 | if (is_ctor || TREE_ADDRESSABLE (type)) | |
304 | { | |
f293ce4b RS |
305 | rval = build3 (AGGR_INIT_EXPR, void_type_node, fn, |
306 | TREE_OPERAND (init, 1), slot); | |
4977bab6 ZW |
307 | TREE_SIDE_EFFECTS (rval) = 1; |
308 | AGGR_INIT_VIA_CTOR_P (rval) = is_ctor; | |
309 | } | |
310 | else | |
311 | rval = init; | |
312 | ||
9d85d30c | 313 | rval = build_target_expr (slot, rval); |
8d08fdba | 314 | |
8d08fdba MS |
315 | return rval; |
316 | } | |
317 | ||
ab93b543 | 318 | /* Build a TARGET_EXPR using INIT to initialize a new temporary of the |
c506ca22 | 319 | indicated TYPE. */ |
aa36c081 JM |
320 | |
321 | tree | |
b57b79f7 | 322 | build_target_expr_with_type (tree init, tree type) |
aa36c081 | 323 | { |
50bc768d | 324 | gcc_assert (!VOID_TYPE_P (type)); |
59445d74 | 325 | |
5062dbd5 JM |
326 | if (TREE_CODE (init) == TARGET_EXPR) |
327 | return init; | |
182609b5 | 328 | else if (CLASS_TYPE_P (type) && !TYPE_HAS_TRIVIAL_INIT_REF (type) |
4b5aa881 | 329 | && TREE_CODE (init) != COND_EXPR |
662eceda MM |
330 | && TREE_CODE (init) != CONSTRUCTOR |
331 | && TREE_CODE (init) != VA_ARG_EXPR) | |
182609b5 JM |
332 | /* We need to build up a copy constructor call. COND_EXPR is a special |
333 | case because we already have copies on the arms and we don't want | |
4b5aa881 | 334 | another one here. A CONSTRUCTOR is aggregate initialization, which |
662eceda MM |
335 | is handled separately. A VA_ARG_EXPR is magic creation of an |
336 | aggregate; there's no additional work to be done. */ | |
182609b5 | 337 | return force_rvalue (init); |
5062dbd5 | 338 | |
357d956e | 339 | return force_target_expr (type, init); |
a6f86b51 | 340 | } |
aa36c081 | 341 | |
a6f86b51 JM |
342 | /* Like the above function, but without the checking. This function should |
343 | only be used by code which is deliberately trying to subvert the type | |
344 | system, such as call_builtin_trap. */ | |
345 | ||
346 | tree | |
347 | force_target_expr (tree type, tree init) | |
348 | { | |
59445d74 RH |
349 | tree slot; |
350 | ||
50bc768d | 351 | gcc_assert (!VOID_TYPE_P (type)); |
59445d74 RH |
352 | |
353 | slot = build_local_temp (type); | |
a6f86b51 | 354 | return build_target_expr (slot, init); |
aa36c081 JM |
355 | } |
356 | ||
c506ca22 MM |
357 | /* Like build_target_expr_with_type, but use the type of INIT. */ |
358 | ||
359 | tree | |
b57b79f7 | 360 | get_target_expr (tree init) |
c506ca22 MM |
361 | { |
362 | return build_target_expr_with_type (init, TREE_TYPE (init)); | |
363 | } | |
364 | ||
5cc53d4e MM |
365 | /* EXPR is being used in an rvalue context. Return a version of EXPR |
366 | that is marked as an rvalue. */ | |
367 | ||
368 | tree | |
369 | rvalue (tree expr) | |
370 | { | |
371 | tree type; | |
372 | if (real_lvalue_p (expr)) | |
373 | { | |
374 | type = TREE_TYPE (expr); | |
375 | /* [basic.lval] | |
376 | ||
377 | Non-class rvalues always have cv-unqualified types. */ | |
378 | if (!CLASS_TYPE_P (type)) | |
379 | type = TYPE_MAIN_VARIANT (type); | |
380 | expr = build1 (NON_LVALUE_EXPR, type, expr); | |
381 | } | |
382 | return expr; | |
383 | } | |
384 | ||
8d08fdba | 385 | \f |
bd6dd845 | 386 | static tree |
b57b79f7 | 387 | build_cplus_array_type_1 (tree elt_type, tree index_type) |
8d08fdba | 388 | { |
8d08fdba MS |
389 | tree t; |
390 | ||
adecb3f4 MM |
391 | if (elt_type == error_mark_node || index_type == error_mark_node) |
392 | return error_mark_node; | |
393 | ||
58496de1 NS |
394 | if (dependent_type_p (elt_type) |
395 | || (index_type | |
396 | && value_dependent_expression_p (TYPE_MAX_VALUE (index_type)))) | |
5566b478 MS |
397 | { |
398 | t = make_node (ARRAY_TYPE); | |
399 | TREE_TYPE (t) = elt_type; | |
400 | TYPE_DOMAIN (t) = index_type; | |
401 | } | |
402 | else | |
80661759 | 403 | t = build_array_type (elt_type, index_type); |
8d08fdba MS |
404 | |
405 | /* Push these needs up so that initialization takes place | |
406 | more easily. */ | |
9f63daea | 407 | TYPE_NEEDS_CONSTRUCTING (t) |
db3626d1 | 408 | = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type)); |
9f63daea | 409 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
834c6dff | 410 | = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type)); |
8d08fdba MS |
411 | return t; |
412 | } | |
e349ee73 MS |
413 | |
414 | tree | |
b57b79f7 | 415 | build_cplus_array_type (tree elt_type, tree index_type) |
e349ee73 MS |
416 | { |
417 | tree t; | |
89d684bb | 418 | int type_quals = cp_type_quals (elt_type); |
91063b51 | 419 | |
4b011bbf JM |
420 | if (type_quals != TYPE_UNQUALIFIED) |
421 | elt_type = cp_build_qualified_type (elt_type, TYPE_UNQUALIFIED); | |
e349ee73 MS |
422 | |
423 | t = build_cplus_array_type_1 (elt_type, index_type); | |
424 | ||
4b011bbf JM |
425 | if (type_quals != TYPE_UNQUALIFIED) |
426 | t = cp_build_qualified_type (t, type_quals); | |
e349ee73 MS |
427 | |
428 | return t; | |
429 | } | |
8d08fdba | 430 | \f |
adecb3f4 MM |
431 | /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles |
432 | arrays correctly. In particular, if TYPE is an array of T's, and | |
c2ea3a40 | 433 | TYPE_QUALS is non-empty, returns an array of qualified T's. |
9f63daea | 434 | |
4f2b0fb2 NS |
435 | FLAGS determines how to deal with illformed qualifications. If |
436 | tf_ignore_bad_quals is set, then bad qualifications are dropped | |
437 | (this is permitted if TYPE was introduced via a typedef or template | |
438 | type parameter). If bad qualifications are dropped and tf_warning | |
439 | is set, then a warning is issued for non-const qualifications. If | |
440 | tf_ignore_bad_quals is not set and tf_error is not set, we | |
441 | return error_mark_node. Otherwise, we issue an error, and ignore | |
442 | the qualifications. | |
443 | ||
444 | Qualification of a reference type is valid when the reference came | |
445 | via a typedef or template type argument. [dcl.ref] No such | |
446 | dispensation is provided for qualifying a function type. [dcl.fct] | |
447 | DR 295 queries this and the proposed resolution brings it into line | |
34cd5ae7 | 448 | with qualifying a reference. We implement the DR. We also behave |
4f2b0fb2 | 449 | in a similar manner for restricting non-pointer types. */ |
9f63daea | 450 | |
f376e137 | 451 | tree |
9f63daea | 452 | cp_build_qualified_type_real (tree type, |
0cbd7506 MS |
453 | int type_quals, |
454 | tsubst_flags_t complain) | |
f376e137 | 455 | { |
2adeacc9 | 456 | tree result; |
4f2b0fb2 | 457 | int bad_quals = TYPE_UNQUALIFIED; |
2adeacc9 | 458 | |
e76a2646 MS |
459 | if (type == error_mark_node) |
460 | return type; | |
e271912d | 461 | |
89d684bb | 462 | if (type_quals == cp_type_quals (type)) |
e271912d JM |
463 | return type; |
464 | ||
4f2b0fb2 | 465 | if (TREE_CODE (type) == ARRAY_TYPE) |
f376e137 | 466 | { |
db3626d1 MM |
467 | /* In C++, the qualification really applies to the array element |
468 | type. Obtain the appropriately qualified element type. */ | |
469 | tree t; | |
9f63daea EC |
470 | tree element_type |
471 | = cp_build_qualified_type_real (TREE_TYPE (type), | |
db3626d1 MM |
472 | type_quals, |
473 | complain); | |
474 | ||
475 | if (element_type == error_mark_node) | |
adecb3f4 | 476 | return error_mark_node; |
f376e137 | 477 | |
29fae15c MM |
478 | /* See if we already have an identically qualified type. */ |
479 | for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t)) | |
9f63daea | 480 | if (cp_type_quals (t) == type_quals |
29fae15c MM |
481 | && TYPE_NAME (t) == TYPE_NAME (type) |
482 | && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)) | |
483 | break; | |
9f63daea | 484 | |
29fae15c MM |
485 | if (!t) |
486 | { | |
487 | /* Make a new array type, just like the old one, but with the | |
488 | appropriately qualified element type. */ | |
8dd16ecc | 489 | t = build_variant_type_copy (type); |
29fae15c MM |
490 | TREE_TYPE (t) = element_type; |
491 | } | |
f376e137 | 492 | |
db3626d1 | 493 | /* Even if we already had this variant, we update |
834c6dff | 494 | TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case |
9f63daea EC |
495 | they changed since the variant was originally created. |
496 | ||
db3626d1 MM |
497 | This seems hokey; if there is some way to use a previous |
498 | variant *without* coming through here, | |
499 | TYPE_NEEDS_CONSTRUCTING will never be updated. */ | |
9f63daea | 500 | TYPE_NEEDS_CONSTRUCTING (t) |
db3626d1 | 501 | = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type)); |
9f63daea | 502 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
834c6dff | 503 | = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type)); |
db3626d1 | 504 | return t; |
f376e137 | 505 | } |
2adeacc9 MM |
506 | else if (TYPE_PTRMEMFUNC_P (type)) |
507 | { | |
508 | /* For a pointer-to-member type, we can't just return a | |
509 | cv-qualified version of the RECORD_TYPE. If we do, we | |
4f2b0fb2 | 510 | haven't changed the field that contains the actual pointer to |
2adeacc9 MM |
511 | a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */ |
512 | tree t; | |
513 | ||
514 | t = TYPE_PTRMEMFUNC_FN_TYPE (type); | |
515 | t = cp_build_qualified_type_real (t, type_quals, complain); | |
46cbda4a | 516 | return build_ptrmemfunc_type (t); |
2adeacc9 | 517 | } |
9f63daea | 518 | |
9804209d | 519 | /* A reference or method type shall not be cv qualified. |
4b011bbf JM |
520 | [dcl.ref], [dct.fct] */ |
521 | if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE) | |
522 | && (TREE_CODE (type) == REFERENCE_TYPE | |
4b011bbf JM |
523 | || TREE_CODE (type) == METHOD_TYPE)) |
524 | { | |
525 | bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE); | |
4b011bbf JM |
526 | type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE); |
527 | } | |
9f63daea | 528 | |
4b011bbf | 529 | /* A restrict-qualified type must be a pointer (or reference) |
9804209d | 530 | to object or incomplete type, or a function type. */ |
4b011bbf JM |
531 | if ((type_quals & TYPE_QUAL_RESTRICT) |
532 | && TREE_CODE (type) != TEMPLATE_TYPE_PARM | |
533 | && TREE_CODE (type) != TYPENAME_TYPE | |
9804209d | 534 | && TREE_CODE (type) != FUNCTION_TYPE |
4b011bbf JM |
535 | && !POINTER_TYPE_P (type)) |
536 | { | |
537 | bad_quals |= TYPE_QUAL_RESTRICT; | |
538 | type_quals &= ~TYPE_QUAL_RESTRICT; | |
539 | } | |
540 | ||
541 | if (bad_quals == TYPE_UNQUALIFIED) | |
542 | /*OK*/; | |
543 | else if (!(complain & (tf_error | tf_ignore_bad_quals))) | |
544 | return error_mark_node; | |
4b011bbf JM |
545 | else |
546 | { | |
547 | if (complain & tf_ignore_bad_quals) | |
0cbd7506 MS |
548 | /* We're not going to warn about constifying things that can't |
549 | be constified. */ | |
550 | bad_quals &= ~TYPE_QUAL_CONST; | |
4b011bbf | 551 | if (bad_quals) |
0cbd7506 MS |
552 | { |
553 | tree bad_type = build_qualified_type (ptr_type_node, bad_quals); | |
9f63daea | 554 | |
0cbd7506 MS |
555 | if (!(complain & tf_ignore_bad_quals)) |
556 | error ("%qV qualifiers cannot be applied to %qT", | |
4b011bbf | 557 | bad_type, type); |
0cbd7506 | 558 | } |
4b011bbf | 559 | } |
9f63daea | 560 | |
2adeacc9 MM |
561 | /* Retrieve (or create) the appropriately qualified variant. */ |
562 | result = build_qualified_type (type, type_quals); | |
563 | ||
564 | /* If this was a pointer-to-method type, and we just made a copy, | |
3cfab7ec GK |
565 | then we need to unshare the record that holds the cached |
566 | pointer-to-member-function type, because these will be distinct | |
567 | between the unqualified and qualified types. */ | |
9f63daea | 568 | if (result != type |
2adeacc9 MM |
569 | && TREE_CODE (type) == POINTER_TYPE |
570 | && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE) | |
3cfab7ec | 571 | TYPE_LANG_SPECIFIC (result) = NULL; |
2adeacc9 MM |
572 | |
573 | return result; | |
f376e137 | 574 | } |
53929c47 JM |
575 | |
576 | /* Returns the canonical version of TYPE. In other words, if TYPE is | |
577 | a typedef, returns the underlying type. The cv-qualification of | |
578 | the type returned matches the type input; they will always be | |
579 | compatible types. */ | |
580 | ||
581 | tree | |
b57b79f7 | 582 | canonical_type_variant (tree t) |
53929c47 | 583 | { |
89d684bb | 584 | return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), cp_type_quals (t)); |
53929c47 | 585 | } |
f376e137 | 586 | \f |
48b45647 NS |
587 | /* Makes a copy of BINFO and TYPE, which is to be inherited into a |
588 | graph dominated by T. If BINFO is NULL, TYPE is a dependent base, | |
589 | and we do a shallow copy. If BINFO is non-NULL, we do a deep copy. | |
590 | VIRT indicates whether TYPE is inherited virtually or not. | |
591 | IGO_PREV points at the previous binfo of the inheritance graph | |
592 | order chain. The newly copied binfo's TREE_CHAIN forms this | |
593 | ordering. | |
594 | ||
595 | The CLASSTYPE_VBASECLASSES vector of T is constructed in the | |
596 | correct order. That is in the order the bases themselves should be | |
597 | constructed in. | |
dbbf88d1 NS |
598 | |
599 | The BINFO_INHERITANCE of a virtual base class points to the binfo | |
48b45647 NS |
600 | of the most derived type. ??? We could probably change this so that |
601 | BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence | |
602 | remove a field. They currently can only differ for primary virtual | |
603 | virtual bases. */ | |
dbbf88d1 NS |
604 | |
605 | tree | |
48b45647 | 606 | copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt) |
9a71c18b | 607 | { |
48b45647 | 608 | tree new_binfo; |
9a71c18b | 609 | |
48b45647 NS |
610 | if (virt) |
611 | { | |
612 | /* See if we've already made this virtual base. */ | |
613 | new_binfo = binfo_for_vbase (type, t); | |
614 | if (new_binfo) | |
615 | return new_binfo; | |
616 | } | |
9f63daea | 617 | |
fa743e8c | 618 | new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0); |
48b45647 | 619 | BINFO_TYPE (new_binfo) = type; |
9a71c18b | 620 | |
48b45647 NS |
621 | /* Chain it into the inheritance graph. */ |
622 | TREE_CHAIN (*igo_prev) = new_binfo; | |
623 | *igo_prev = new_binfo; | |
9f63daea | 624 | |
48b45647 | 625 | if (binfo) |
dfbcd65a | 626 | { |
fa743e8c NS |
627 | int ix; |
628 | tree base_binfo; | |
9f63daea | 629 | |
50bc768d | 630 | gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo)); |
539ed333 | 631 | gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type)); |
9f63daea | 632 | |
48b45647 NS |
633 | BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo); |
634 | BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo); | |
9f63daea | 635 | |
fa743e8c NS |
636 | /* We do not need to copy the accesses, as they are read only. */ |
637 | BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo); | |
9f63daea | 638 | |
48b45647 | 639 | /* Recursively copy base binfos of BINFO. */ |
fa743e8c | 640 | for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++) |
dbbf88d1 | 641 | { |
48b45647 | 642 | tree new_base_binfo; |
9f63daea | 643 | |
50bc768d | 644 | gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo)); |
48b45647 NS |
645 | new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo), |
646 | t, igo_prev, | |
647 | BINFO_VIRTUAL_P (base_binfo)); | |
9f63daea | 648 | |
48b45647 NS |
649 | if (!BINFO_INHERITANCE_CHAIN (new_base_binfo)) |
650 | BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo; | |
fa743e8c | 651 | BINFO_BASE_APPEND (new_binfo, new_base_binfo); |
dbbf88d1 | 652 | } |
9a71c18b | 653 | } |
48b45647 NS |
654 | else |
655 | BINFO_DEPENDENT_BASE_P (new_binfo) = 1; | |
9f63daea | 656 | |
48b45647 NS |
657 | if (virt) |
658 | { | |
659 | /* Push it onto the list after any virtual bases it contains | |
660 | will have been pushed. */ | |
661 | VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo); | |
662 | BINFO_VIRTUAL_P (new_binfo) = 1; | |
663 | BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t); | |
664 | } | |
9f63daea | 665 | |
48b45647 | 666 | return new_binfo; |
9a71c18b | 667 | } |
8d08fdba MS |
668 | \f |
669 | /* Hashing of lists so that we don't make duplicates. | |
670 | The entry point is `list_hash_canon'. */ | |
671 | ||
8d08fdba MS |
672 | /* Now here is the hash table. When recording a list, it is added |
673 | to the slot whose index is the hash code mod the table size. | |
674 | Note that the hash table is used for several kinds of lists. | |
675 | While all these live in the same table, they are completely independent, | |
676 | and the hash code is computed differently for each of these. */ | |
677 | ||
e2500fed | 678 | static GTY ((param_is (union tree_node))) htab_t list_hash_table; |
9ccb25d5 | 679 | |
9f63daea | 680 | struct list_proxy |
9ccb25d5 MM |
681 | { |
682 | tree purpose; | |
683 | tree value; | |
684 | tree chain; | |
685 | }; | |
686 | ||
687 | /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy | |
688 | for a node we are thinking about adding). */ | |
689 | ||
690 | static int | |
b57b79f7 | 691 | list_hash_eq (const void* entry, const void* data) |
9ccb25d5 MM |
692 | { |
693 | tree t = (tree) entry; | |
694 | struct list_proxy *proxy = (struct list_proxy *) data; | |
695 | ||
696 | return (TREE_VALUE (t) == proxy->value | |
697 | && TREE_PURPOSE (t) == proxy->purpose | |
698 | && TREE_CHAIN (t) == proxy->chain); | |
699 | } | |
8d08fdba MS |
700 | |
701 | /* Compute a hash code for a list (chain of TREE_LIST nodes | |
702 | with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the | |
703 | TREE_COMMON slots), by adding the hash codes of the individual entries. */ | |
704 | ||
9ccb25d5 | 705 | static hashval_t |
b57b79f7 | 706 | list_hash_pieces (tree purpose, tree value, tree chain) |
8d08fdba | 707 | { |
9ccb25d5 | 708 | hashval_t hashcode = 0; |
9f63daea | 709 | |
37c46b43 | 710 | if (chain) |
fd917e0d | 711 | hashcode += TREE_HASH (chain); |
9f63daea | 712 | |
37c46b43 | 713 | if (value) |
fd917e0d | 714 | hashcode += TREE_HASH (value); |
8d08fdba MS |
715 | else |
716 | hashcode += 1007; | |
37c46b43 | 717 | if (purpose) |
fd917e0d | 718 | hashcode += TREE_HASH (purpose); |
8d08fdba MS |
719 | else |
720 | hashcode += 1009; | |
721 | return hashcode; | |
722 | } | |
723 | ||
9ccb25d5 | 724 | /* Hash an already existing TREE_LIST. */ |
8d08fdba | 725 | |
9ccb25d5 | 726 | static hashval_t |
b57b79f7 | 727 | list_hash (const void* p) |
8d08fdba | 728 | { |
9ccb25d5 | 729 | tree t = (tree) p; |
9f63daea EC |
730 | return list_hash_pieces (TREE_PURPOSE (t), |
731 | TREE_VALUE (t), | |
9ccb25d5 | 732 | TREE_CHAIN (t)); |
8d08fdba MS |
733 | } |
734 | ||
51632249 JM |
735 | /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical |
736 | object for an identical list if one already exists. Otherwise, build a | |
737 | new one, and record it as the canonical object. */ | |
8d08fdba | 738 | |
8d08fdba | 739 | tree |
b57b79f7 | 740 | hash_tree_cons (tree purpose, tree value, tree chain) |
8d08fdba | 741 | { |
a703fb38 | 742 | int hashcode = 0; |
fad205ff | 743 | void **slot; |
9ccb25d5 MM |
744 | struct list_proxy proxy; |
745 | ||
746 | /* Hash the list node. */ | |
747 | hashcode = list_hash_pieces (purpose, value, chain); | |
748 | /* Create a proxy for the TREE_LIST we would like to create. We | |
749 | don't actually create it so as to avoid creating garbage. */ | |
750 | proxy.purpose = purpose; | |
751 | proxy.value = value; | |
752 | proxy.chain = chain; | |
753 | /* See if it is already in the table. */ | |
754 | slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode, | |
755 | INSERT); | |
756 | /* If not, create a new node. */ | |
757 | if (!*slot) | |
fad205ff | 758 | *slot = tree_cons (purpose, value, chain); |
67f5655f | 759 | return (tree) *slot; |
8d08fdba MS |
760 | } |
761 | ||
762 | /* Constructor for hashed lists. */ | |
e92cc029 | 763 | |
8d08fdba | 764 | tree |
b57b79f7 | 765 | hash_tree_chain (tree value, tree chain) |
8d08fdba | 766 | { |
51632249 | 767 | return hash_tree_cons (NULL_TREE, value, chain); |
8d08fdba | 768 | } |
8d08fdba | 769 | \f |
8d08fdba | 770 | void |
b57b79f7 | 771 | debug_binfo (tree elem) |
8d08fdba | 772 | { |
fed3cef0 | 773 | HOST_WIDE_INT n; |
8d08fdba MS |
774 | tree virtuals; |
775 | ||
90ff44cf KG |
776 | fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC |
777 | "\nvtable type:\n", | |
778 | TYPE_NAME_STRING (BINFO_TYPE (elem)), | |
fed3cef0 | 779 | TREE_INT_CST_LOW (BINFO_OFFSET (elem))); |
8d08fdba MS |
780 | debug_tree (BINFO_TYPE (elem)); |
781 | if (BINFO_VTABLE (elem)) | |
fed3cef0 | 782 | fprintf (stderr, "vtable decl \"%s\"\n", |
c35cce41 | 783 | IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem)))); |
8d08fdba MS |
784 | else |
785 | fprintf (stderr, "no vtable decl yet\n"); | |
786 | fprintf (stderr, "virtuals:\n"); | |
da3d4dfa | 787 | virtuals = BINFO_VIRTUALS (elem); |
1f84ec23 | 788 | n = 0; |
f30432d7 | 789 | |
8d08fdba MS |
790 | while (virtuals) |
791 | { | |
83f2ccf4 | 792 | tree fndecl = TREE_VALUE (virtuals); |
71e89f27 | 793 | fprintf (stderr, "%s [%ld =? %ld]\n", |
8d08fdba | 794 | IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)), |
71e89f27 | 795 | (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl))); |
f30432d7 | 796 | ++n; |
8d08fdba | 797 | virtuals = TREE_CHAIN (virtuals); |
8d08fdba MS |
798 | } |
799 | } | |
800 | ||
02ed62dd MM |
801 | /* Build a representation for the qualified name SCOPE::NAME. TYPE is |
802 | the type of the result expression, if known, or NULL_TREE if the | |
803 | resulting expression is type-dependent. If TEMPLATE_P is true, | |
804 | NAME is known to be a template because the user explicitly used the | |
805 | "template" keyword after the "::". | |
806 | ||
807 | All SCOPE_REFs should be built by use of this function. */ | |
808 | ||
809 | tree | |
810 | build_qualified_name (tree type, tree scope, tree name, bool template_p) | |
811 | { | |
812 | tree t; | |
36569397 MM |
813 | if (type == error_mark_node |
814 | || scope == error_mark_node | |
815 | || name == error_mark_node) | |
816 | return error_mark_node; | |
02ed62dd MM |
817 | t = build2 (SCOPE_REF, type, scope, name); |
818 | QUALIFIED_NAME_IS_TEMPLATE (t) = template_p; | |
819 | return t; | |
820 | } | |
821 | ||
8d08fdba | 822 | int |
b57b79f7 | 823 | is_overloaded_fn (tree x) |
8d08fdba | 824 | { |
4bb0968f | 825 | /* A baselink is also considered an overloaded function. */ |
05e0b2f4 JM |
826 | if (TREE_CODE (x) == OFFSET_REF) |
827 | x = TREE_OPERAND (x, 1); | |
4bb0968f | 828 | if (BASELINK_P (x)) |
da15dae6 | 829 | x = BASELINK_FUNCTIONS (x); |
06ab59df MM |
830 | return (TREE_CODE (x) == FUNCTION_DECL |
831 | || TREE_CODE (x) == TEMPLATE_ID_EXPR | |
832 | || DECL_FUNCTION_TEMPLATE_P (x) | |
2c73f9f5 | 833 | || TREE_CODE (x) == OVERLOAD); |
8d08fdba MS |
834 | } |
835 | ||
8926095f | 836 | int |
b57b79f7 | 837 | really_overloaded_fn (tree x) |
9f63daea | 838 | { |
05e0b2f4 JM |
839 | if (TREE_CODE (x) == OFFSET_REF) |
840 | x = TREE_OPERAND (x, 1); | |
7eab6e7b | 841 | /* A baselink is also considered an overloaded function. */ |
4bb0968f | 842 | if (BASELINK_P (x)) |
da15dae6 | 843 | x = BASELINK_FUNCTIONS (x); |
9f63daea | 844 | |
5a9a1961 NS |
845 | return ((TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)) |
846 | || DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x)) | |
847 | || TREE_CODE (x) == TEMPLATE_ID_EXPR); | |
8926095f MS |
848 | } |
849 | ||
8d08fdba | 850 | tree |
b57b79f7 | 851 | get_first_fn (tree from) |
8d08fdba | 852 | { |
50bc768d | 853 | gcc_assert (is_overloaded_fn (from)); |
c6002625 | 854 | /* A baselink is also considered an overloaded function. */ |
4bb0968f | 855 | if (BASELINK_P (from)) |
da15dae6 | 856 | from = BASELINK_FUNCTIONS (from); |
2c73f9f5 ML |
857 | return OVL_CURRENT (from); |
858 | } | |
8d08fdba | 859 | |
c6002625 | 860 | /* Return a new OVL node, concatenating it with the old one. */ |
2c73f9f5 ML |
861 | |
862 | tree | |
b57b79f7 | 863 | ovl_cons (tree decl, tree chain) |
2c73f9f5 ML |
864 | { |
865 | tree result = make_node (OVERLOAD); | |
866 | TREE_TYPE (result) = unknown_type_node; | |
867 | OVL_FUNCTION (result) = decl; | |
868 | TREE_CHAIN (result) = chain; | |
9f63daea | 869 | |
2c73f9f5 ML |
870 | return result; |
871 | } | |
872 | ||
2c73f9f5 ML |
873 | /* Build a new overloaded function. If this is the first one, |
874 | just return it; otherwise, ovl_cons the _DECLs */ | |
875 | ||
876 | tree | |
b57b79f7 | 877 | build_overload (tree decl, tree chain) |
2c73f9f5 | 878 | { |
161c12b0 | 879 | if (! chain && TREE_CODE (decl) != TEMPLATE_DECL) |
2c73f9f5 | 880 | return decl; |
161c12b0 | 881 | if (chain && TREE_CODE (chain) != OVERLOAD) |
2c73f9f5 ML |
882 | chain = ovl_cons (chain, NULL_TREE); |
883 | return ovl_cons (decl, chain); | |
884 | } | |
885 | ||
8d08fdba MS |
886 | \f |
887 | #define PRINT_RING_SIZE 4 | |
888 | ||
e1def31b | 889 | const char * |
b57b79f7 | 890 | cxx_printable_name (tree decl, int v) |
8d08fdba MS |
891 | { |
892 | static tree decl_ring[PRINT_RING_SIZE]; | |
893 | static char *print_ring[PRINT_RING_SIZE]; | |
894 | static int ring_counter; | |
895 | int i; | |
896 | ||
897 | /* Only cache functions. */ | |
2ba25f50 MS |
898 | if (v < 2 |
899 | || TREE_CODE (decl) != FUNCTION_DECL | |
8d08fdba | 900 | || DECL_LANG_SPECIFIC (decl) == 0) |
2ba25f50 | 901 | return lang_decl_name (decl, v); |
8d08fdba MS |
902 | |
903 | /* See if this print name is lying around. */ | |
904 | for (i = 0; i < PRINT_RING_SIZE; i++) | |
905 | if (decl_ring[i] == decl) | |
906 | /* yes, so return it. */ | |
907 | return print_ring[i]; | |
908 | ||
909 | if (++ring_counter == PRINT_RING_SIZE) | |
910 | ring_counter = 0; | |
911 | ||
912 | if (current_function_decl != NULL_TREE) | |
913 | { | |
914 | if (decl_ring[ring_counter] == current_function_decl) | |
915 | ring_counter += 1; | |
916 | if (ring_counter == PRINT_RING_SIZE) | |
917 | ring_counter = 0; | |
315fb5db | 918 | gcc_assert (decl_ring[ring_counter] != current_function_decl); |
8d08fdba MS |
919 | } |
920 | ||
921 | if (print_ring[ring_counter]) | |
922 | free (print_ring[ring_counter]); | |
923 | ||
2ba25f50 MS |
924 | print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v)); |
925 | decl_ring[ring_counter] = decl; | |
8d08fdba MS |
926 | return print_ring[ring_counter]; |
927 | } | |
928 | \f | |
f30432d7 | 929 | /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions |
8d08fdba | 930 | listed in RAISES. */ |
e92cc029 | 931 | |
8d08fdba | 932 | tree |
b57b79f7 | 933 | build_exception_variant (tree type, tree raises) |
8d08fdba | 934 | { |
8d08fdba | 935 | tree v = TYPE_MAIN_VARIANT (type); |
91063b51 | 936 | int type_quals = TYPE_QUALS (type); |
8d08fdba | 937 | |
45537677 | 938 | for (; v; v = TYPE_NEXT_VARIANT (v)) |
896c3aa3 | 939 | if (check_qualified_type (v, type, type_quals) |
0cbd7506 | 940 | && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1)) |
4cc1d462 | 941 | return v; |
8d08fdba MS |
942 | |
943 | /* Need to build a new variant. */ | |
8dd16ecc | 944 | v = build_variant_type_copy (type); |
8d08fdba MS |
945 | TYPE_RAISES_EXCEPTIONS (v) = raises; |
946 | return v; | |
947 | } | |
948 | ||
dac65501 KL |
949 | /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new |
950 | BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template | |
1899c3a4 | 951 | arguments. */ |
73b0fce8 KL |
952 | |
953 | tree | |
b57b79f7 | 954 | bind_template_template_parm (tree t, tree newargs) |
73b0fce8 | 955 | { |
1899c3a4 | 956 | tree decl = TYPE_NAME (t); |
6b9b6b15 JM |
957 | tree t2; |
958 | ||
dac65501 KL |
959 | t2 = make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM); |
960 | decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE); | |
1899c3a4 | 961 | |
dac65501 KL |
962 | /* These nodes have to be created to reflect new TYPE_DECL and template |
963 | arguments. */ | |
964 | TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t)); | |
965 | TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl; | |
966 | TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2) | |
9f63daea | 967 | = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t), |
dac65501 | 968 | newargs, NULL_TREE); |
6b9b6b15 | 969 | |
1899c3a4 KL |
970 | TREE_TYPE (decl) = t2; |
971 | TYPE_NAME (t2) = decl; | |
972 | TYPE_STUB_DECL (t2) = decl; | |
dac65501 | 973 | TYPE_SIZE (t2) = 0; |
73b0fce8 | 974 | |
73b0fce8 KL |
975 | return t2; |
976 | } | |
977 | ||
bf3428d0 | 978 | /* Called from count_trees via walk_tree. */ |
297a5329 JM |
979 | |
980 | static tree | |
44de5aeb | 981 | count_trees_r (tree *tp, int *walk_subtrees, void *data) |
297a5329 | 982 | { |
44de5aeb RK |
983 | ++*((int *) data); |
984 | ||
985 | if (TYPE_P (*tp)) | |
986 | *walk_subtrees = 0; | |
987 | ||
297a5329 JM |
988 | return NULL_TREE; |
989 | } | |
990 | ||
991 | /* Debugging function for measuring the rough complexity of a tree | |
992 | representation. */ | |
993 | ||
994 | int | |
b57b79f7 | 995 | count_trees (tree t) |
297a5329 | 996 | { |
bf3428d0 | 997 | int n_trees = 0; |
ee94fce6 | 998 | walk_tree_without_duplicates (&t, count_trees_r, &n_trees); |
297a5329 | 999 | return n_trees; |
9f63daea | 1000 | } |
297a5329 | 1001 | |
b2244c65 MM |
1002 | /* Called from verify_stmt_tree via walk_tree. */ |
1003 | ||
1004 | static tree | |
9f63daea | 1005 | verify_stmt_tree_r (tree* tp, |
0cbd7506 MS |
1006 | int* walk_subtrees ATTRIBUTE_UNUSED , |
1007 | void* data) | |
b2244c65 MM |
1008 | { |
1009 | tree t = *tp; | |
1010 | htab_t *statements = (htab_t *) data; | |
1011 | void **slot; | |
1012 | ||
009ed910 | 1013 | if (!STATEMENT_CODE_P (TREE_CODE (t))) |
b2244c65 MM |
1014 | return NULL_TREE; |
1015 | ||
1016 | /* If this statement is already present in the hash table, then | |
1017 | there is a circularity in the statement tree. */ | |
315fb5db | 1018 | gcc_assert (!htab_find (*statements, t)); |
9f63daea | 1019 | |
b2244c65 MM |
1020 | slot = htab_find_slot (*statements, t, INSERT); |
1021 | *slot = t; | |
1022 | ||
1023 | return NULL_TREE; | |
1024 | } | |
1025 | ||
1026 | /* Debugging function to check that the statement T has not been | |
1027 | corrupted. For now, this function simply checks that T contains no | |
1028 | circularities. */ | |
1029 | ||
1030 | void | |
b57b79f7 | 1031 | verify_stmt_tree (tree t) |
b2244c65 MM |
1032 | { |
1033 | htab_t statements; | |
1034 | statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL); | |
ee94fce6 | 1035 | walk_tree (&t, verify_stmt_tree_r, &statements, NULL); |
b2244c65 MM |
1036 | htab_delete (statements); |
1037 | } | |
1038 | ||
50a6dbd7 | 1039 | /* Check if the type T depends on a type with no linkage and if so, return |
4684cd27 MM |
1040 | it. If RELAXED_P then do not consider a class type declared within |
1041 | a TREE_PUBLIC function to have no linkage. */ | |
50a6dbd7 JM |
1042 | |
1043 | tree | |
4684cd27 | 1044 | no_linkage_check (tree t, bool relaxed_p) |
50a6dbd7 | 1045 | { |
caf43ca4 MM |
1046 | tree r; |
1047 | ||
2adeacc9 MM |
1048 | /* There's no point in checking linkage on template functions; we |
1049 | can't know their complete types. */ | |
1050 | if (processing_template_decl) | |
1051 | return NULL_TREE; | |
1052 | ||
caf43ca4 MM |
1053 | switch (TREE_CODE (t)) |
1054 | { | |
4684cd27 MM |
1055 | tree fn; |
1056 | ||
caf43ca4 MM |
1057 | case RECORD_TYPE: |
1058 | if (TYPE_PTRMEMFUNC_P (t)) | |
1059 | goto ptrmem; | |
1060 | /* Fall through. */ | |
1061 | case UNION_TYPE: | |
1062 | if (!CLASS_TYPE_P (t)) | |
1063 | return NULL_TREE; | |
1064 | /* Fall through. */ | |
1065 | case ENUMERAL_TYPE: | |
4684cd27 MM |
1066 | if (TYPE_ANONYMOUS_P (t)) |
1067 | return t; | |
1068 | fn = decl_function_context (TYPE_MAIN_DECL (t)); | |
1069 | if (fn && (!relaxed_p || !TREE_PUBLIC (fn))) | |
caf43ca4 MM |
1070 | return t; |
1071 | return NULL_TREE; | |
1072 | ||
1073 | case ARRAY_TYPE: | |
1074 | case POINTER_TYPE: | |
1075 | case REFERENCE_TYPE: | |
4684cd27 | 1076 | return no_linkage_check (TREE_TYPE (t), relaxed_p); |
caf43ca4 MM |
1077 | |
1078 | case OFFSET_TYPE: | |
1079 | ptrmem: | |
4684cd27 MM |
1080 | r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t), |
1081 | relaxed_p); | |
caf43ca4 MM |
1082 | if (r) |
1083 | return r; | |
4684cd27 | 1084 | return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p); |
caf43ca4 MM |
1085 | |
1086 | case METHOD_TYPE: | |
4684cd27 | 1087 | r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p); |
caf43ca4 MM |
1088 | if (r) |
1089 | return r; | |
1090 | /* Fall through. */ | |
1091 | case FUNCTION_TYPE: | |
1092 | { | |
1093 | tree parm; | |
9f63daea EC |
1094 | for (parm = TYPE_ARG_TYPES (t); |
1095 | parm && parm != void_list_node; | |
caf43ca4 MM |
1096 | parm = TREE_CHAIN (parm)) |
1097 | { | |
4684cd27 | 1098 | r = no_linkage_check (TREE_VALUE (parm), relaxed_p); |
caf43ca4 MM |
1099 | if (r) |
1100 | return r; | |
1101 | } | |
4684cd27 | 1102 | return no_linkage_check (TREE_TYPE (t), relaxed_p); |
caf43ca4 MM |
1103 | } |
1104 | ||
1105 | default: | |
1106 | return NULL_TREE; | |
1107 | } | |
50a6dbd7 JM |
1108 | } |
1109 | ||
5566b478 MS |
1110 | #ifdef GATHER_STATISTICS |
1111 | extern int depth_reached; | |
1112 | #endif | |
1113 | ||
8d08fdba | 1114 | void |
b57b79f7 | 1115 | cxx_print_statistics (void) |
8d08fdba | 1116 | { |
8d08fdba MS |
1117 | print_search_statistics (); |
1118 | print_class_statistics (); | |
5566b478 MS |
1119 | #ifdef GATHER_STATISTICS |
1120 | fprintf (stderr, "maximum template instantiation depth reached: %d\n", | |
1121 | depth_reached); | |
1122 | #endif | |
8d08fdba MS |
1123 | } |
1124 | ||
e92cc029 MS |
1125 | /* Return, as an INTEGER_CST node, the number of elements for TYPE |
1126 | (which is an ARRAY_TYPE). This counts only elements of the top | |
1127 | array. */ | |
8d08fdba MS |
1128 | |
1129 | tree | |
b57b79f7 | 1130 | array_type_nelts_top (tree type) |
8d08fdba | 1131 | { |
7866705a SB |
1132 | return fold_build2 (PLUS_EXPR, sizetype, |
1133 | array_type_nelts (type), | |
1134 | integer_one_node); | |
8d08fdba MS |
1135 | } |
1136 | ||
e92cc029 MS |
1137 | /* Return, as an INTEGER_CST node, the number of elements for TYPE |
1138 | (which is an ARRAY_TYPE). This one is a recursive count of all | |
1139 | ARRAY_TYPEs that are clumped together. */ | |
8d08fdba MS |
1140 | |
1141 | tree | |
b57b79f7 | 1142 | array_type_nelts_total (tree type) |
8d08fdba MS |
1143 | { |
1144 | tree sz = array_type_nelts_top (type); | |
1145 | type = TREE_TYPE (type); | |
1146 | while (TREE_CODE (type) == ARRAY_TYPE) | |
1147 | { | |
1148 | tree n = array_type_nelts_top (type); | |
7866705a | 1149 | sz = fold_build2 (MULT_EXPR, sizetype, sz, n); |
8d08fdba MS |
1150 | type = TREE_TYPE (type); |
1151 | } | |
1152 | return sz; | |
1153 | } | |
878cd289 | 1154 | |
b3ab27f3 MM |
1155 | /* Called from break_out_target_exprs via mapcar. */ |
1156 | ||
1157 | static tree | |
b57b79f7 | 1158 | bot_manip (tree* tp, int* walk_subtrees, void* data) |
878cd289 | 1159 | { |
8dfaeb63 MM |
1160 | splay_tree target_remap = ((splay_tree) data); |
1161 | tree t = *tp; | |
1162 | ||
4f976745 | 1163 | if (!TYPE_P (t) && TREE_CONSTANT (t)) |
8dfaeb63 | 1164 | { |
495d26d6 | 1165 | /* There can't be any TARGET_EXPRs or their slot variables below |
0cbd7506 MS |
1166 | this point. We used to check !TREE_SIDE_EFFECTS, but then we |
1167 | failed to copy an ADDR_EXPR of the slot VAR_DECL. */ | |
8dfaeb63 MM |
1168 | *walk_subtrees = 0; |
1169 | return NULL_TREE; | |
1170 | } | |
495d26d6 | 1171 | if (TREE_CODE (t) == TARGET_EXPR) |
73aad9b9 | 1172 | { |
b3ab27f3 MM |
1173 | tree u; |
1174 | ||
02531345 | 1175 | if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR) |
73aad9b9 JM |
1176 | { |
1177 | mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t, 1), 0), 0)); | |
b3ab27f3 | 1178 | u = build_cplus_new |
73aad9b9 JM |
1179 | (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1))); |
1180 | } | |
9f63daea | 1181 | else |
b3ab27f3 | 1182 | { |
495d26d6 JM |
1183 | u = build_target_expr_with_type |
1184 | (break_out_target_exprs (TREE_OPERAND (t, 1)), TREE_TYPE (t)); | |
b3ab27f3 MM |
1185 | } |
1186 | ||
1187 | /* Map the old variable to the new one. */ | |
9f63daea EC |
1188 | splay_tree_insert (target_remap, |
1189 | (splay_tree_key) TREE_OPERAND (t, 0), | |
b3ab27f3 | 1190 | (splay_tree_value) TREE_OPERAND (u, 0)); |
8dfaeb63 MM |
1191 | |
1192 | /* Replace the old expression with the new version. */ | |
1193 | *tp = u; | |
1194 | /* We don't have to go below this point; the recursive call to | |
1195 | break_out_target_exprs will have handled anything below this | |
1196 | point. */ | |
1197 | *walk_subtrees = 0; | |
1198 | return NULL_TREE; | |
73aad9b9 JM |
1199 | } |
1200 | else if (TREE_CODE (t) == CALL_EXPR) | |
1201 | mark_used (TREE_OPERAND (TREE_OPERAND (t, 0), 0)); | |
1202 | ||
8dfaeb63 MM |
1203 | /* Make a copy of this node. */ |
1204 | return copy_tree_r (tp, walk_subtrees, NULL); | |
878cd289 | 1205 | } |
9f63daea | 1206 | |
8dfaeb63 MM |
1207 | /* Replace all remapped VAR_DECLs in T with their new equivalents. |
1208 | DATA is really a splay-tree mapping old variables to new | |
1209 | variables. */ | |
b3ab27f3 MM |
1210 | |
1211 | static tree | |
9f63daea | 1212 | bot_replace (tree* t, |
0cbd7506 MS |
1213 | int* walk_subtrees ATTRIBUTE_UNUSED , |
1214 | void* data) | |
b3ab27f3 | 1215 | { |
8dfaeb63 MM |
1216 | splay_tree target_remap = ((splay_tree) data); |
1217 | ||
b3ab27f3 MM |
1218 | if (TREE_CODE (*t) == VAR_DECL) |
1219 | { | |
1220 | splay_tree_node n = splay_tree_lookup (target_remap, | |
1221 | (splay_tree_key) *t); | |
1222 | if (n) | |
1223 | *t = (tree) n->value; | |
1224 | } | |
1225 | ||
1226 | return NULL_TREE; | |
1227 | } | |
9f63daea | 1228 | |
8dfaeb63 MM |
1229 | /* When we parse a default argument expression, we may create |
1230 | temporary variables via TARGET_EXPRs. When we actually use the | |
1231 | default-argument expression, we make a copy of the expression, but | |
1232 | we must replace the temporaries with appropriate local versions. */ | |
e92cc029 | 1233 | |
878cd289 | 1234 | tree |
b57b79f7 | 1235 | break_out_target_exprs (tree t) |
878cd289 | 1236 | { |
8dfaeb63 MM |
1237 | static int target_remap_count; |
1238 | static splay_tree target_remap; | |
1239 | ||
b3ab27f3 | 1240 | if (!target_remap_count++) |
9f63daea EC |
1241 | target_remap = splay_tree_new (splay_tree_compare_pointers, |
1242 | /*splay_tree_delete_key_fn=*/NULL, | |
b3ab27f3 | 1243 | /*splay_tree_delete_value_fn=*/NULL); |
ee94fce6 MM |
1244 | walk_tree (&t, bot_manip, target_remap, NULL); |
1245 | walk_tree (&t, bot_replace, target_remap, NULL); | |
b3ab27f3 MM |
1246 | |
1247 | if (!--target_remap_count) | |
1248 | { | |
1249 | splay_tree_delete (target_remap); | |
1250 | target_remap = NULL; | |
1251 | } | |
1252 | ||
1253 | return t; | |
878cd289 | 1254 | } |
f30432d7 | 1255 | |
8e1daa34 NS |
1256 | /* Similar to `build_nt', but for template definitions of dependent |
1257 | expressions */ | |
5566b478 MS |
1258 | |
1259 | tree | |
e34d07f2 | 1260 | build_min_nt (enum tree_code code, ...) |
5566b478 | 1261 | { |
926ce8bd KH |
1262 | tree t; |
1263 | int length; | |
1264 | int i; | |
e34d07f2 | 1265 | va_list p; |
5566b478 | 1266 | |
e34d07f2 | 1267 | va_start (p, code); |
5566b478 | 1268 | |
5566b478 | 1269 | t = make_node (code); |
8d5e6e25 | 1270 | length = TREE_CODE_LENGTH (code); |
5566b478 MS |
1271 | |
1272 | for (i = 0; i < length; i++) | |
1273 | { | |
1274 | tree x = va_arg (p, tree); | |
2a1e9fdd | 1275 | TREE_OPERAND (t, i) = x; |
5566b478 MS |
1276 | } |
1277 | ||
e34d07f2 | 1278 | va_end (p); |
5566b478 MS |
1279 | return t; |
1280 | } | |
1281 | ||
8e1daa34 | 1282 | /* Similar to `build', but for template definitions. */ |
5566b478 MS |
1283 | |
1284 | tree | |
e34d07f2 | 1285 | build_min (enum tree_code code, tree tt, ...) |
5566b478 | 1286 | { |
926ce8bd KH |
1287 | tree t; |
1288 | int length; | |
1289 | int i; | |
e34d07f2 | 1290 | va_list p; |
5566b478 | 1291 | |
e34d07f2 | 1292 | va_start (p, tt); |
5566b478 | 1293 | |
5566b478 | 1294 | t = make_node (code); |
8d5e6e25 | 1295 | length = TREE_CODE_LENGTH (code); |
2a1e9fdd | 1296 | TREE_TYPE (t) = tt; |
5566b478 MS |
1297 | |
1298 | for (i = 0; i < length; i++) | |
1299 | { | |
1300 | tree x = va_arg (p, tree); | |
2a1e9fdd | 1301 | TREE_OPERAND (t, i) = x; |
4f976745 | 1302 | if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x)) |
8e1daa34 | 1303 | TREE_SIDE_EFFECTS (t) = 1; |
5566b478 MS |
1304 | } |
1305 | ||
e34d07f2 | 1306 | va_end (p); |
5566b478 MS |
1307 | return t; |
1308 | } | |
1309 | ||
8e1daa34 NS |
1310 | /* Similar to `build', but for template definitions of non-dependent |
1311 | expressions. NON_DEP is the non-dependent expression that has been | |
1312 | built. */ | |
1313 | ||
1314 | tree | |
1315 | build_min_non_dep (enum tree_code code, tree non_dep, ...) | |
1316 | { | |
926ce8bd KH |
1317 | tree t; |
1318 | int length; | |
1319 | int i; | |
8e1daa34 NS |
1320 | va_list p; |
1321 | ||
1322 | va_start (p, non_dep); | |
1323 | ||
1324 | t = make_node (code); | |
1325 | length = TREE_CODE_LENGTH (code); | |
1326 | TREE_TYPE (t) = TREE_TYPE (non_dep); | |
8e1daa34 NS |
1327 | TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep); |
1328 | ||
1329 | for (i = 0; i < length; i++) | |
1330 | { | |
1331 | tree x = va_arg (p, tree); | |
1332 | TREE_OPERAND (t, i) = x; | |
1333 | } | |
1334 | ||
1335 | if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR) | |
1336 | /* This should not be considered a COMPOUND_EXPR, because it | |
04c06002 | 1337 | resolves to an overload. */ |
8e1daa34 | 1338 | COMPOUND_EXPR_OVERLOADED (t) = 1; |
9f63daea | 1339 | |
8e1daa34 NS |
1340 | va_end (p); |
1341 | return t; | |
1342 | } | |
1343 | ||
5566b478 | 1344 | tree |
b57b79f7 | 1345 | get_type_decl (tree t) |
5566b478 | 1346 | { |
5566b478 MS |
1347 | if (TREE_CODE (t) == TYPE_DECL) |
1348 | return t; | |
2f939d94 | 1349 | if (TYPE_P (t)) |
5566b478 | 1350 | return TYPE_STUB_DECL (t); |
315fb5db NS |
1351 | gcc_assert (t == error_mark_node); |
1352 | return t; | |
5566b478 MS |
1353 | } |
1354 | ||
700466c2 JM |
1355 | /* Returns the namespace that contains DECL, whether directly or |
1356 | indirectly. */ | |
1357 | ||
1358 | tree | |
b57b79f7 | 1359 | decl_namespace_context (tree decl) |
700466c2 JM |
1360 | { |
1361 | while (1) | |
1362 | { | |
1363 | if (TREE_CODE (decl) == NAMESPACE_DECL) | |
1364 | return decl; | |
1365 | else if (TYPE_P (decl)) | |
1366 | decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl)); | |
1367 | else | |
1368 | decl = CP_DECL_CONTEXT (decl); | |
1369 | } | |
1370 | } | |
1371 | ||
67d743fe | 1372 | /* Return truthvalue of whether T1 is the same tree structure as T2. |
c8a209ca | 1373 | Return 1 if they are the same. Return 0 if they are different. */ |
67d743fe | 1374 | |
c8a209ca | 1375 | bool |
b57b79f7 | 1376 | cp_tree_equal (tree t1, tree t2) |
67d743fe | 1377 | { |
926ce8bd | 1378 | enum tree_code code1, code2; |
67d743fe MS |
1379 | |
1380 | if (t1 == t2) | |
c8a209ca NS |
1381 | return true; |
1382 | if (!t1 || !t2) | |
1383 | return false; | |
1384 | ||
1385 | for (code1 = TREE_CODE (t1); | |
1386 | code1 == NOP_EXPR || code1 == CONVERT_EXPR | |
1387 | || code1 == NON_LVALUE_EXPR; | |
1388 | code1 = TREE_CODE (t1)) | |
1389 | t1 = TREE_OPERAND (t1, 0); | |
1390 | for (code2 = TREE_CODE (t2); | |
1391 | code2 == NOP_EXPR || code2 == CONVERT_EXPR | |
1392 | || code1 == NON_LVALUE_EXPR; | |
1393 | code2 = TREE_CODE (t2)) | |
1394 | t2 = TREE_OPERAND (t2, 0); | |
1395 | ||
1396 | /* They might have become equal now. */ | |
1397 | if (t1 == t2) | |
1398 | return true; | |
9f63daea | 1399 | |
67d743fe | 1400 | if (code1 != code2) |
c8a209ca | 1401 | return false; |
67d743fe MS |
1402 | |
1403 | switch (code1) | |
1404 | { | |
1405 | case INTEGER_CST: | |
1406 | return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2) | |
1407 | && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2); | |
1408 | ||
1409 | case REAL_CST: | |
1410 | return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2)); | |
1411 | ||
1412 | case STRING_CST: | |
1413 | return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2) | |
da61dec9 | 1414 | && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2), |
c8a209ca | 1415 | TREE_STRING_LENGTH (t1)); |
67d743fe MS |
1416 | |
1417 | case CONSTRUCTOR: | |
7dd4bdf5 MM |
1418 | /* We need to do this when determining whether or not two |
1419 | non-type pointer to member function template arguments | |
1420 | are the same. */ | |
3bfdc719 | 1421 | if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)) |
7dd4bdf5 MM |
1422 | /* The first operand is RTL. */ |
1423 | && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0))) | |
c8a209ca | 1424 | return false; |
7dd4bdf5 MM |
1425 | return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)); |
1426 | ||
1427 | case TREE_LIST: | |
c8a209ca NS |
1428 | if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))) |
1429 | return false; | |
1430 | if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2))) | |
1431 | return false; | |
7dd4bdf5 | 1432 | return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2)); |
67d743fe MS |
1433 | |
1434 | case SAVE_EXPR: | |
1435 | return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
1436 | ||
1437 | case CALL_EXPR: | |
c8a209ca NS |
1438 | if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))) |
1439 | return false; | |
67d743fe MS |
1440 | return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)); |
1441 | ||
c8a209ca NS |
1442 | case TARGET_EXPR: |
1443 | { | |
1444 | tree o1 = TREE_OPERAND (t1, 0); | |
1445 | tree o2 = TREE_OPERAND (t2, 0); | |
9f63daea | 1446 | |
c8a209ca NS |
1447 | /* Special case: if either target is an unallocated VAR_DECL, |
1448 | it means that it's going to be unified with whatever the | |
1449 | TARGET_EXPR is really supposed to initialize, so treat it | |
1450 | as being equivalent to anything. */ | |
1451 | if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE | |
1452 | && !DECL_RTL_SET_P (o1)) | |
1453 | /*Nop*/; | |
1454 | else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE | |
1455 | && !DECL_RTL_SET_P (o2)) | |
1456 | /*Nop*/; | |
1457 | else if (!cp_tree_equal (o1, o2)) | |
1458 | return false; | |
9f63daea | 1459 | |
c8a209ca NS |
1460 | return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)); |
1461 | } | |
9f63daea | 1462 | |
67d743fe | 1463 | case WITH_CLEANUP_EXPR: |
c8a209ca NS |
1464 | if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))) |
1465 | return false; | |
6ad7895a | 1466 | return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1)); |
67d743fe MS |
1467 | |
1468 | case COMPONENT_REF: | |
c8a209ca NS |
1469 | if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1)) |
1470 | return false; | |
1471 | return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
67d743fe MS |
1472 | |
1473 | case VAR_DECL: | |
1474 | case PARM_DECL: | |
1475 | case CONST_DECL: | |
1476 | case FUNCTION_DECL: | |
c8a209ca NS |
1477 | case TEMPLATE_DECL: |
1478 | case IDENTIFIER_NODE: | |
47c0c7d7 | 1479 | case SSA_NAME: |
c8a209ca | 1480 | return false; |
67d743fe | 1481 | |
17a27b4f MM |
1482 | case BASELINK: |
1483 | return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2) | |
1484 | && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2) | |
1485 | && cp_tree_equal (BASELINK_FUNCTIONS (t1), | |
1486 | BASELINK_FUNCTIONS (t2))); | |
1487 | ||
f84b4be9 | 1488 | case TEMPLATE_PARM_INDEX: |
31758337 NS |
1489 | return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2) |
1490 | && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2) | |
1491 | && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)), | |
1492 | TREE_TYPE (TEMPLATE_PARM_DECL (t2)))); | |
67d743fe | 1493 | |
bf12d54d NS |
1494 | case TEMPLATE_ID_EXPR: |
1495 | { | |
1496 | unsigned ix; | |
1497 | tree vec1, vec2; | |
9f63daea | 1498 | |
bf12d54d NS |
1499 | if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))) |
1500 | return false; | |
1501 | vec1 = TREE_OPERAND (t1, 1); | |
1502 | vec2 = TREE_OPERAND (t2, 1); | |
1503 | ||
1504 | if (!vec1 || !vec2) | |
1505 | return !vec1 && !vec2; | |
9f63daea | 1506 | |
bf12d54d NS |
1507 | if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2)) |
1508 | return false; | |
1509 | ||
1510 | for (ix = TREE_VEC_LENGTH (vec1); ix--;) | |
1511 | if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix), | |
1512 | TREE_VEC_ELT (vec2, ix))) | |
1513 | return false; | |
9f63daea | 1514 | |
bf12d54d NS |
1515 | return true; |
1516 | } | |
9f63daea | 1517 | |
67d743fe | 1518 | case SIZEOF_EXPR: |
abff8e06 | 1519 | case ALIGNOF_EXPR: |
c8a209ca NS |
1520 | { |
1521 | tree o1 = TREE_OPERAND (t1, 0); | |
1522 | tree o2 = TREE_OPERAND (t2, 0); | |
9f63daea | 1523 | |
c8a209ca NS |
1524 | if (TREE_CODE (o1) != TREE_CODE (o2)) |
1525 | return false; | |
1526 | if (TYPE_P (o1)) | |
1527 | return same_type_p (o1, o2); | |
1528 | else | |
1529 | return cp_tree_equal (o1, o2); | |
1530 | } | |
9f63daea | 1531 | |
61a127b3 MM |
1532 | case PTRMEM_CST: |
1533 | /* Two pointer-to-members are the same if they point to the same | |
1534 | field or function in the same class. */ | |
c8a209ca NS |
1535 | if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2)) |
1536 | return false; | |
1537 | ||
1538 | return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2)); | |
61a127b3 | 1539 | |
943e3ede MM |
1540 | case OVERLOAD: |
1541 | if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2)) | |
1542 | return false; | |
1543 | return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2)); | |
1544 | ||
7f85441b KG |
1545 | default: |
1546 | break; | |
67d743fe MS |
1547 | } |
1548 | ||
1549 | switch (TREE_CODE_CLASS (code1)) | |
1550 | { | |
6615c446 JO |
1551 | case tcc_unary: |
1552 | case tcc_binary: | |
1553 | case tcc_comparison: | |
1554 | case tcc_expression: | |
1555 | case tcc_reference: | |
1556 | case tcc_statement: | |
aa1826e2 NS |
1557 | { |
1558 | int i; | |
9f63daea | 1559 | |
aa1826e2 | 1560 | for (i = 0; i < TREE_CODE_LENGTH (code1); ++i) |
c8a209ca NS |
1561 | if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i))) |
1562 | return false; | |
9f63daea | 1563 | |
c8a209ca | 1564 | return true; |
aa1826e2 | 1565 | } |
9f63daea | 1566 | |
6615c446 | 1567 | case tcc_type: |
c8a209ca | 1568 | return same_type_p (t1, t2); |
6615c446 JO |
1569 | default: |
1570 | gcc_unreachable (); | |
67d743fe | 1571 | } |
6615c446 | 1572 | /* We can get here with --disable-checking. */ |
c8a209ca | 1573 | return false; |
67d743fe | 1574 | } |
73aad9b9 | 1575 | |
d11ad92e MS |
1576 | /* The type of ARG when used as an lvalue. */ |
1577 | ||
1578 | tree | |
b57b79f7 | 1579 | lvalue_type (tree arg) |
d11ad92e | 1580 | { |
2c73f9f5 | 1581 | tree type = TREE_TYPE (arg); |
8cd4c175 | 1582 | return type; |
d11ad92e MS |
1583 | } |
1584 | ||
1585 | /* The type of ARG for printing error messages; denote lvalues with | |
1586 | reference types. */ | |
1587 | ||
1588 | tree | |
b57b79f7 | 1589 | error_type (tree arg) |
d11ad92e MS |
1590 | { |
1591 | tree type = TREE_TYPE (arg); | |
9f63daea | 1592 | |
d11ad92e MS |
1593 | if (TREE_CODE (type) == ARRAY_TYPE) |
1594 | ; | |
08476342 NS |
1595 | else if (TREE_CODE (type) == ERROR_MARK) |
1596 | ; | |
d11ad92e MS |
1597 | else if (real_lvalue_p (arg)) |
1598 | type = build_reference_type (lvalue_type (arg)); | |
1599 | else if (IS_AGGR_TYPE (type)) | |
1600 | type = lvalue_type (arg); | |
1601 | ||
1602 | return type; | |
1603 | } | |
eb66be0e MS |
1604 | |
1605 | /* Does FUNCTION use a variable-length argument list? */ | |
1606 | ||
1607 | int | |
b57b79f7 | 1608 | varargs_function_p (tree function) |
eb66be0e MS |
1609 | { |
1610 | tree parm = TYPE_ARG_TYPES (TREE_TYPE (function)); | |
1611 | for (; parm; parm = TREE_CHAIN (parm)) | |
1612 | if (TREE_VALUE (parm) == void_type_node) | |
1613 | return 0; | |
1614 | return 1; | |
1615 | } | |
f94ae2f5 JM |
1616 | |
1617 | /* Returns 1 if decl is a member of a class. */ | |
1618 | ||
1619 | int | |
b57b79f7 | 1620 | member_p (tree decl) |
f94ae2f5 | 1621 | { |
2f939d94 TP |
1622 | const tree ctx = DECL_CONTEXT (decl); |
1623 | return (ctx && TYPE_P (ctx)); | |
f94ae2f5 | 1624 | } |
51924768 JM |
1625 | |
1626 | /* Create a placeholder for member access where we don't actually have an | |
1627 | object that the access is against. */ | |
1628 | ||
1629 | tree | |
b57b79f7 | 1630 | build_dummy_object (tree type) |
51924768 | 1631 | { |
44689c12 | 1632 | tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node); |
3e411c3f | 1633 | return build_indirect_ref (decl, NULL); |
51924768 JM |
1634 | } |
1635 | ||
1636 | /* We've gotten a reference to a member of TYPE. Return *this if appropriate, | |
1637 | or a dummy object otherwise. If BINFOP is non-0, it is filled with the | |
1638 | binfo path from current_class_type to TYPE, or 0. */ | |
1639 | ||
1640 | tree | |
b57b79f7 | 1641 | maybe_dummy_object (tree type, tree* binfop) |
51924768 JM |
1642 | { |
1643 | tree decl, context; | |
2db1ab2d | 1644 | tree binfo; |
9f63daea | 1645 | |
51924768 | 1646 | if (current_class_type |
2db1ab2d | 1647 | && (binfo = lookup_base (current_class_type, type, |
18e4be85 | 1648 | ba_unique | ba_quiet, NULL))) |
51924768 JM |
1649 | context = current_class_type; |
1650 | else | |
1651 | { | |
1652 | /* Reference from a nested class member function. */ | |
1653 | context = type; | |
2db1ab2d | 1654 | binfo = TYPE_BINFO (type); |
51924768 JM |
1655 | } |
1656 | ||
2db1ab2d NS |
1657 | if (binfop) |
1658 | *binfop = binfo; | |
9f63daea | 1659 | |
a29e1034 | 1660 | if (current_class_ref && context == current_class_type |
3ebf5204 | 1661 | /* Kludge: Make sure that current_class_type is actually |
0cbd7506 MS |
1662 | correct. It might not be if we're in the middle of |
1663 | tsubst_default_argument. */ | |
a29e1034 JM |
1664 | && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)), |
1665 | current_class_type)) | |
51924768 JM |
1666 | decl = current_class_ref; |
1667 | else | |
1668 | decl = build_dummy_object (context); | |
1669 | ||
1670 | return decl; | |
1671 | } | |
1672 | ||
1673 | /* Returns 1 if OB is a placeholder object, or a pointer to one. */ | |
1674 | ||
1675 | int | |
b57b79f7 | 1676 | is_dummy_object (tree ob) |
51924768 JM |
1677 | { |
1678 | if (TREE_CODE (ob) == INDIRECT_REF) | |
1679 | ob = TREE_OPERAND (ob, 0); | |
1680 | return (TREE_CODE (ob) == NOP_EXPR | |
44689c12 | 1681 | && TREE_OPERAND (ob, 0) == void_zero_node); |
51924768 | 1682 | } |
5524676d JM |
1683 | |
1684 | /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */ | |
1685 | ||
1686 | int | |
b57b79f7 | 1687 | pod_type_p (tree t) |
5524676d | 1688 | { |
38da6039 | 1689 | t = strip_array_types (t); |
5524676d | 1690 | |
17bbb839 MM |
1691 | if (t == error_mark_node) |
1692 | return 1; | |
52fb2769 NS |
1693 | if (INTEGRAL_TYPE_P (t)) |
1694 | return 1; /* integral, character or enumeral type */ | |
1695 | if (FLOAT_TYPE_P (t)) | |
5524676d | 1696 | return 1; |
52fb2769 NS |
1697 | if (TYPE_PTR_P (t)) |
1698 | return 1; /* pointer to non-member */ | |
a5ac359a MM |
1699 | if (TYPE_PTR_TO_MEMBER_P (t)) |
1700 | return 1; /* pointer to member */ | |
b1009a5d ZL |
1701 | |
1702 | if (TREE_CODE (t) == VECTOR_TYPE) | |
44370687 | 1703 | return 1; /* vectors are (small) arrays of scalars */ |
b1009a5d | 1704 | |
52fb2769 NS |
1705 | if (! CLASS_TYPE_P (t)) |
1706 | return 0; /* other non-class type (reference or function) */ | |
1707 | if (CLASSTYPE_NON_POD_P (t)) | |
5524676d | 1708 | return 0; |
5524676d JM |
1709 | return 1; |
1710 | } | |
e5dc5fb2 | 1711 | |
94e6e4c4 AO |
1712 | /* Returns 1 iff zero initialization of type T means actually storing |
1713 | zeros in it. */ | |
1714 | ||
1715 | int | |
b57b79f7 | 1716 | zero_init_p (tree t) |
94e6e4c4 AO |
1717 | { |
1718 | t = strip_array_types (t); | |
1719 | ||
17bbb839 MM |
1720 | if (t == error_mark_node) |
1721 | return 1; | |
1722 | ||
94e6e4c4 AO |
1723 | /* NULL pointers to data members are initialized with -1. */ |
1724 | if (TYPE_PTRMEM_P (t)) | |
1725 | return 0; | |
1726 | ||
1727 | /* Classes that contain types that can't be zero-initialized, cannot | |
1728 | be zero-initialized themselves. */ | |
1729 | if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t)) | |
1730 | return 0; | |
1731 | ||
1732 | return 1; | |
1733 | } | |
1734 | ||
91d231cb | 1735 | /* Table of valid C++ attributes. */ |
349ae713 | 1736 | const struct attribute_spec cxx_attribute_table[] = |
e5dc5fb2 | 1737 | { |
91d231cb JM |
1738 | /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */ |
1739 | { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute }, | |
1740 | { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute }, | |
1741 | { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute }, | |
0cbd7506 | 1742 | { NULL, 0, 0, false, false, false, NULL } |
91d231cb JM |
1743 | }; |
1744 | ||
1745 | /* Handle a "java_interface" attribute; arguments as in | |
1746 | struct attribute_spec.handler. */ | |
1747 | static tree | |
9f63daea | 1748 | handle_java_interface_attribute (tree* node, |
0cbd7506 MS |
1749 | tree name, |
1750 | tree args ATTRIBUTE_UNUSED , | |
1751 | int flags, | |
1752 | bool* no_add_attrs) | |
91d231cb JM |
1753 | { |
1754 | if (DECL_P (*node) | |
1755 | || !CLASS_TYPE_P (*node) | |
1756 | || !TYPE_FOR_JAVA (*node)) | |
60c87482 | 1757 | { |
a82e1a7d | 1758 | error ("%qE attribute can only be applied to Java class definitions", |
4460cef2 | 1759 | name); |
91d231cb JM |
1760 | *no_add_attrs = true; |
1761 | return NULL_TREE; | |
60c87482 | 1762 | } |
91d231cb | 1763 | if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE)) |
8dd16ecc | 1764 | *node = build_variant_type_copy (*node); |
91d231cb | 1765 | TYPE_JAVA_INTERFACE (*node) = 1; |
e5dc5fb2 | 1766 | |
91d231cb JM |
1767 | return NULL_TREE; |
1768 | } | |
1769 | ||
1770 | /* Handle a "com_interface" attribute; arguments as in | |
1771 | struct attribute_spec.handler. */ | |
1772 | static tree | |
9f63daea | 1773 | handle_com_interface_attribute (tree* node, |
0cbd7506 MS |
1774 | tree name, |
1775 | tree args ATTRIBUTE_UNUSED , | |
1776 | int flags ATTRIBUTE_UNUSED , | |
1777 | bool* no_add_attrs) | |
91d231cb JM |
1778 | { |
1779 | static int warned; | |
1780 | ||
1781 | *no_add_attrs = true; | |
1782 | ||
1783 | if (DECL_P (*node) | |
1784 | || !CLASS_TYPE_P (*node) | |
1785 | || *node != TYPE_MAIN_VARIANT (*node)) | |
e5dc5fb2 | 1786 | { |
5c498b10 DD |
1787 | warning (OPT_Wattributes, "%qE attribute can only be applied " |
1788 | "to class definitions", name); | |
91d231cb JM |
1789 | return NULL_TREE; |
1790 | } | |
e5dc5fb2 | 1791 | |
91d231cb | 1792 | if (!warned++) |
d4ee4d25 | 1793 | warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default", |
4460cef2 | 1794 | name); |
91d231cb JM |
1795 | |
1796 | return NULL_TREE; | |
1797 | } | |
1798 | ||
1799 | /* Handle an "init_priority" attribute; arguments as in | |
1800 | struct attribute_spec.handler. */ | |
1801 | static tree | |
9f63daea | 1802 | handle_init_priority_attribute (tree* node, |
0cbd7506 MS |
1803 | tree name, |
1804 | tree args, | |
1805 | int flags ATTRIBUTE_UNUSED , | |
1806 | bool* no_add_attrs) | |
91d231cb JM |
1807 | { |
1808 | tree initp_expr = TREE_VALUE (args); | |
1809 | tree decl = *node; | |
1810 | tree type = TREE_TYPE (decl); | |
1811 | int pri; | |
1812 | ||
1813 | STRIP_NOPS (initp_expr); | |
9f63daea | 1814 | |
91d231cb JM |
1815 | if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST) |
1816 | { | |
1817 | error ("requested init_priority is not an integer constant"); | |
1818 | *no_add_attrs = true; | |
1819 | return NULL_TREE; | |
1820 | } | |
e5dc5fb2 | 1821 | |
91d231cb | 1822 | pri = TREE_INT_CST_LOW (initp_expr); |
9f63daea | 1823 | |
91d231cb JM |
1824 | type = strip_array_types (type); |
1825 | ||
1826 | if (decl == NULL_TREE | |
1827 | || TREE_CODE (decl) != VAR_DECL | |
1828 | || !TREE_STATIC (decl) | |
1829 | || DECL_EXTERNAL (decl) | |
1830 | || (TREE_CODE (type) != RECORD_TYPE | |
1831 | && TREE_CODE (type) != UNION_TYPE) | |
1832 | /* Static objects in functions are initialized the | |
1833 | first time control passes through that | |
1834 | function. This is not precise enough to pin down an | |
c6002625 | 1835 | init_priority value, so don't allow it. */ |
9f63daea | 1836 | || current_function_decl) |
91d231cb | 1837 | { |
a82e1a7d | 1838 | error ("can only use %qE attribute on file-scope definitions " |
0cbd7506 | 1839 | "of objects of class type", name); |
91d231cb JM |
1840 | *no_add_attrs = true; |
1841 | return NULL_TREE; | |
1842 | } | |
e5dc5fb2 | 1843 | |
91d231cb JM |
1844 | if (pri > MAX_INIT_PRIORITY || pri <= 0) |
1845 | { | |
1846 | error ("requested init_priority is out of range"); | |
1847 | *no_add_attrs = true; | |
1848 | return NULL_TREE; | |
1849 | } | |
e5dc5fb2 | 1850 | |
91d231cb JM |
1851 | /* Check for init_priorities that are reserved for |
1852 | language and runtime support implementations.*/ | |
1853 | if (pri <= MAX_RESERVED_INIT_PRIORITY) | |
1854 | { | |
9f63daea | 1855 | warning |
d4ee4d25 | 1856 | (0, "requested init_priority is reserved for internal use"); |
e5dc5fb2 JM |
1857 | } |
1858 | ||
91d231cb JM |
1859 | if (SUPPORTS_INIT_PRIORITY) |
1860 | { | |
820cc88f DB |
1861 | SET_DECL_INIT_PRIORITY (decl, pri); |
1862 | DECL_HAS_INIT_PRIORITY_P (decl) = 1; | |
91d231cb JM |
1863 | return NULL_TREE; |
1864 | } | |
1865 | else | |
1866 | { | |
a82e1a7d | 1867 | error ("%qE attribute is not supported on this platform", name); |
91d231cb JM |
1868 | *no_add_attrs = true; |
1869 | return NULL_TREE; | |
1870 | } | |
e5dc5fb2 | 1871 | } |
87533b37 MM |
1872 | |
1873 | /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the | |
1874 | thing pointed to by the constant. */ | |
1875 | ||
1876 | tree | |
b57b79f7 | 1877 | make_ptrmem_cst (tree type, tree member) |
87533b37 MM |
1878 | { |
1879 | tree ptrmem_cst = make_node (PTRMEM_CST); | |
87533b37 MM |
1880 | TREE_TYPE (ptrmem_cst) = type; |
1881 | PTRMEM_CST_MEMBER (ptrmem_cst) = member; | |
1882 | return ptrmem_cst; | |
1883 | } | |
1884 | ||
e9525111 MM |
1885 | /* Build a variant of TYPE that has the indicated ATTRIBUTES. May |
1886 | return an existing type of an appropriate type already exists. */ | |
1887 | ||
1888 | tree | |
1889 | cp_build_type_attribute_variant (tree type, tree attributes) | |
1890 | { | |
1891 | tree new_type; | |
1892 | ||
1893 | new_type = build_type_attribute_variant (type, attributes); | |
1894 | if (TREE_CODE (new_type) == FUNCTION_TYPE | |
9f63daea | 1895 | && (TYPE_RAISES_EXCEPTIONS (new_type) |
e9525111 MM |
1896 | != TYPE_RAISES_EXCEPTIONS (type))) |
1897 | new_type = build_exception_variant (new_type, | |
1898 | TYPE_RAISES_EXCEPTIONS (type)); | |
1899 | return new_type; | |
1900 | } | |
1901 | ||
25af8512 | 1902 | /* Apply FUNC to all language-specific sub-trees of TP in a pre-order |
350fae66 | 1903 | traversal. Called from walk_tree. */ |
25af8512 | 1904 | |
9f63daea | 1905 | tree |
350fae66 | 1906 | cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func, |
0c58f841 | 1907 | void *data, struct pointer_set_t *pset) |
25af8512 AO |
1908 | { |
1909 | enum tree_code code = TREE_CODE (*tp); | |
6de9cd9a | 1910 | location_t save_locus; |
25af8512 | 1911 | tree result; |
9f63daea | 1912 | |
25af8512 AO |
1913 | #define WALK_SUBTREE(NODE) \ |
1914 | do \ | |
1915 | { \ | |
0c58f841 | 1916 | result = walk_tree (&(NODE), func, data, pset); \ |
6de9cd9a | 1917 | if (result) goto out; \ |
25af8512 AO |
1918 | } \ |
1919 | while (0) | |
1920 | ||
6de9cd9a DN |
1921 | /* Set input_location here so we get the right instantiation context |
1922 | if we call instantiate_decl from inlinable_function_p. */ | |
1923 | save_locus = input_location; | |
93409b8c PB |
1924 | if (EXPR_HAS_LOCATION (*tp)) |
1925 | input_location = EXPR_LOCATION (*tp); | |
6de9cd9a | 1926 | |
25af8512 AO |
1927 | /* Not one of the easy cases. We must explicitly go through the |
1928 | children. */ | |
6de9cd9a | 1929 | result = NULL_TREE; |
25af8512 AO |
1930 | switch (code) |
1931 | { | |
1932 | case DEFAULT_ARG: | |
1933 | case TEMPLATE_TEMPLATE_PARM: | |
1934 | case BOUND_TEMPLATE_TEMPLATE_PARM: | |
b8c6534b | 1935 | case UNBOUND_CLASS_TEMPLATE: |
25af8512 AO |
1936 | case TEMPLATE_PARM_INDEX: |
1937 | case TEMPLATE_TYPE_PARM: | |
1938 | case TYPENAME_TYPE: | |
1939 | case TYPEOF_TYPE: | |
5dae1114 | 1940 | case BASELINK: |
da1d7781 | 1941 | /* None of these have subtrees other than those already walked |
0cbd7506 | 1942 | above. */ |
25af8512 AO |
1943 | *walk_subtrees_p = 0; |
1944 | break; | |
1945 | ||
406d77a4 SB |
1946 | case TINST_LEVEL: |
1947 | WALK_SUBTREE (TINST_DECL (*tp)); | |
1948 | *walk_subtrees_p = 0; | |
1949 | break; | |
1950 | ||
25af8512 AO |
1951 | case PTRMEM_CST: |
1952 | WALK_SUBTREE (TREE_TYPE (*tp)); | |
1953 | *walk_subtrees_p = 0; | |
1954 | break; | |
1955 | ||
1956 | case TREE_LIST: | |
5dae1114 | 1957 | WALK_SUBTREE (TREE_PURPOSE (*tp)); |
25af8512 AO |
1958 | break; |
1959 | ||
1960 | case OVERLOAD: | |
1961 | WALK_SUBTREE (OVL_FUNCTION (*tp)); | |
1962 | WALK_SUBTREE (OVL_CHAIN (*tp)); | |
1963 | *walk_subtrees_p = 0; | |
1964 | break; | |
1965 | ||
1966 | case RECORD_TYPE: | |
1967 | if (TYPE_PTRMEMFUNC_P (*tp)) | |
1968 | WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp)); | |
1969 | break; | |
1970 | ||
1971 | default: | |
6de9cd9a | 1972 | input_location = save_locus; |
350fae66 | 1973 | return NULL_TREE; |
25af8512 AO |
1974 | } |
1975 | ||
1976 | /* We didn't find what we were looking for. */ | |
6de9cd9a DN |
1977 | out: |
1978 | input_location = save_locus; | |
1979 | return result; | |
25af8512 AO |
1980 | |
1981 | #undef WALK_SUBTREE | |
1982 | } | |
1983 | ||
1984 | /* Decide whether there are language-specific reasons to not inline a | |
1985 | function as a tree. */ | |
1986 | ||
19551f29 | 1987 | int |
b57b79f7 | 1988 | cp_cannot_inline_tree_fn (tree* fnp) |
25af8512 AO |
1989 | { |
1990 | tree fn = *fnp; | |
1991 | ||
1992 | /* We can inline a template instantiation only if it's fully | |
1993 | instantiated. */ | |
1994 | if (DECL_TEMPLATE_INFO (fn) | |
1995 | && TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn))) | |
1996 | { | |
a5512a2f MM |
1997 | /* Don't instantiate functions that are not going to be |
1998 | inlined. */ | |
9f63daea | 1999 | if (!DECL_INLINE (DECL_TEMPLATE_RESULT |
a5512a2f MM |
2000 | (template_for_substitution (fn)))) |
2001 | return 1; | |
1a9861e6 | 2002 | |
415c974c | 2003 | fn = *fnp = instantiate_decl (fn, /*defer_ok=*/0, /*undefined_ok=*/0); |
1a9861e6 | 2004 | |
fd852454 RH |
2005 | if (TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn))) |
2006 | return 1; | |
25af8512 AO |
2007 | } |
2008 | ||
d58b7c2d MM |
2009 | if (flag_really_no_inline |
2010 | && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)) == NULL) | |
2011 | return 1; | |
2012 | ||
8a3c9180 | 2013 | /* Don't auto-inline anything that might not be bound within |
6039a93d JH |
2014 | this unit of translation. |
2015 | Exclude comdat functions from this rule. While they can be bound | |
77077b39 | 2016 | to the other unit, they all must be the same. This is especially |
6039a93d JH |
2017 | important so templates can inline. */ |
2018 | if (!DECL_DECLARED_INLINE_P (fn) && !(*targetm.binds_local_p) (fn) | |
2019 | && !DECL_COMDAT (fn)) | |
8a3c9180 RH |
2020 | { |
2021 | DECL_UNINLINABLE (fn) = 1; | |
2022 | return 1; | |
2023 | } | |
2024 | ||
25af8512 AO |
2025 | if (varargs_function_p (fn)) |
2026 | { | |
2027 | DECL_UNINLINABLE (fn) = 1; | |
2028 | return 1; | |
2029 | } | |
2030 | ||
2031 | if (! function_attribute_inlinable_p (fn)) | |
2032 | { | |
2033 | DECL_UNINLINABLE (fn) = 1; | |
2034 | return 1; | |
2035 | } | |
2036 | ||
2037 | return 0; | |
2038 | } | |
2039 | ||
2040 | /* Add any pending functions other than the current function (already | |
2041 | handled by the caller), that thus cannot be inlined, to FNS_P, then | |
2042 | return the latest function added to the array, PREV_FN. */ | |
2043 | ||
19551f29 | 2044 | tree |
b57b79f7 | 2045 | cp_add_pending_fn_decls (void* fns_p, tree prev_fn) |
25af8512 AO |
2046 | { |
2047 | varray_type *fnsp = (varray_type *)fns_p; | |
2048 | struct saved_scope *s; | |
2049 | ||
2050 | for (s = scope_chain; s; s = s->prev) | |
2051 | if (s->function_decl && s->function_decl != prev_fn) | |
2052 | { | |
2053 | VARRAY_PUSH_TREE (*fnsp, s->function_decl); | |
2054 | prev_fn = s->function_decl; | |
2055 | } | |
2056 | ||
2057 | return prev_fn; | |
2058 | } | |
2059 | ||
25af8512 AO |
2060 | /* Determine whether VAR is a declaration of an automatic variable in |
2061 | function FN. */ | |
2062 | ||
19551f29 | 2063 | int |
b57b79f7 | 2064 | cp_auto_var_in_fn_p (tree var, tree fn) |
25af8512 AO |
2065 | { |
2066 | return (DECL_P (var) && DECL_CONTEXT (var) == fn | |
2067 | && nonstatic_local_decl_p (var)); | |
2068 | } | |
2069 | ||
87e3dbc9 MM |
2070 | /* Initialize tree.c. */ |
2071 | ||
0a818f84 | 2072 | void |
b57b79f7 | 2073 | init_tree (void) |
0a818f84 | 2074 | { |
e2500fed | 2075 | list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL); |
0a818f84 GRK |
2076 | } |
2077 | ||
872f37f9 | 2078 | /* Returns the kind of special function that DECL (a FUNCTION_DECL) |
50ad9642 MM |
2079 | is. Note that sfk_none is zero, so this function can be used as a |
2080 | predicate to test whether or not DECL is a special function. */ | |
872f37f9 MM |
2081 | |
2082 | special_function_kind | |
b57b79f7 | 2083 | special_function_p (tree decl) |
872f37f9 MM |
2084 | { |
2085 | /* Rather than doing all this stuff with magic names, we should | |
2086 | probably have a field of type `special_function_kind' in | |
2087 | DECL_LANG_SPECIFIC. */ | |
2088 | if (DECL_COPY_CONSTRUCTOR_P (decl)) | |
2089 | return sfk_copy_constructor; | |
2090 | if (DECL_CONSTRUCTOR_P (decl)) | |
2091 | return sfk_constructor; | |
596ea4e5 | 2092 | if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR) |
872f37f9 MM |
2093 | return sfk_assignment_operator; |
2094 | if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)) | |
2095 | return sfk_destructor; | |
2096 | if (DECL_COMPLETE_DESTRUCTOR_P (decl)) | |
2097 | return sfk_complete_destructor; | |
2098 | if (DECL_BASE_DESTRUCTOR_P (decl)) | |
2099 | return sfk_base_destructor; | |
2100 | if (DECL_DELETING_DESTRUCTOR_P (decl)) | |
2101 | return sfk_deleting_destructor; | |
2102 | if (DECL_CONV_FN_P (decl)) | |
2103 | return sfk_conversion; | |
2104 | ||
2105 | return sfk_none; | |
2106 | } | |
7b019c19 | 2107 | |
838dfd8a | 2108 | /* Returns nonzero if TYPE is a character type, including wchar_t. */ |
7b019c19 MM |
2109 | |
2110 | int | |
b57b79f7 | 2111 | char_type_p (tree type) |
7b019c19 MM |
2112 | { |
2113 | return (same_type_p (type, char_type_node) | |
2114 | || same_type_p (type, unsigned_char_type_node) | |
2115 | || same_type_p (type, signed_char_type_node) | |
2116 | || same_type_p (type, wchar_type_node)); | |
2117 | } | |
ad50e811 MM |
2118 | |
2119 | /* Returns the kind of linkage associated with the indicated DECL. Th | |
2120 | value returned is as specified by the language standard; it is | |
2121 | independent of implementation details regarding template | |
2122 | instantiation, etc. For example, it is possible that a declaration | |
2123 | to which this function assigns external linkage would not show up | |
2124 | as a global symbol when you run `nm' on the resulting object file. */ | |
2125 | ||
2126 | linkage_kind | |
b57b79f7 | 2127 | decl_linkage (tree decl) |
ad50e811 MM |
2128 | { |
2129 | /* This function doesn't attempt to calculate the linkage from first | |
2130 | principles as given in [basic.link]. Instead, it makes use of | |
2131 | the fact that we have already set TREE_PUBLIC appropriately, and | |
2132 | then handles a few special cases. Ideally, we would calculate | |
2133 | linkage first, and then transform that into a concrete | |
2134 | implementation. */ | |
2135 | ||
2136 | /* Things that don't have names have no linkage. */ | |
2137 | if (!DECL_NAME (decl)) | |
2138 | return lk_none; | |
2139 | ||
2140 | /* Things that are TREE_PUBLIC have external linkage. */ | |
2141 | if (TREE_PUBLIC (decl)) | |
2142 | return lk_external; | |
3f774254 DB |
2143 | |
2144 | /* Linkage of a CONST_DECL depends on the linkage of the enumeration | |
2145 | type. */ | |
2146 | if (TREE_CODE (decl) == CONST_DECL) | |
2147 | return decl_linkage (TYPE_NAME (TREE_TYPE (decl))); | |
ad50e811 MM |
2148 | |
2149 | /* Some things that are not TREE_PUBLIC have external linkage, too. | |
2150 | For example, on targets that don't have weak symbols, we make all | |
2151 | template instantiations have internal linkage (in the object | |
2152 | file), but the symbols should still be treated as having external | |
2153 | linkage from the point of view of the language. */ | |
820cc88f | 2154 | if (TREE_CODE (decl) != TYPE_DECL && DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl)) |
ad50e811 MM |
2155 | return lk_external; |
2156 | ||
2157 | /* Things in local scope do not have linkage, if they don't have | |
2158 | TREE_PUBLIC set. */ | |
2159 | if (decl_function_context (decl)) | |
2160 | return lk_none; | |
2161 | ||
2162 | /* Everything else has internal linkage. */ | |
2163 | return lk_internal; | |
2164 | } | |
6f30f1f1 JM |
2165 | \f |
2166 | /* EXP is an expression that we want to pre-evaluate. Returns via INITP an | |
2167 | expression to perform the pre-evaluation, and returns directly an | |
2168 | expression to use the precalculated result. */ | |
2169 | ||
2170 | tree | |
b57b79f7 | 2171 | stabilize_expr (tree exp, tree* initp) |
6f30f1f1 JM |
2172 | { |
2173 | tree init_expr; | |
2174 | ||
2175 | if (!TREE_SIDE_EFFECTS (exp)) | |
2176 | { | |
6de9cd9a | 2177 | init_expr = NULL_TREE; |
6f30f1f1 JM |
2178 | } |
2179 | else if (!real_lvalue_p (exp) | |
2180 | || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp))) | |
2181 | { | |
2182 | init_expr = get_target_expr (exp); | |
2183 | exp = TARGET_EXPR_SLOT (init_expr); | |
2184 | } | |
2185 | else | |
2186 | { | |
2187 | exp = build_unary_op (ADDR_EXPR, exp, 1); | |
2188 | init_expr = get_target_expr (exp); | |
2189 | exp = TARGET_EXPR_SLOT (init_expr); | |
2190 | exp = build_indirect_ref (exp, 0); | |
2191 | } | |
2192 | ||
2193 | *initp = init_expr; | |
2194 | return exp; | |
2195 | } | |
6de9cd9a | 2196 | |
40aac948 JM |
2197 | /* Add NEW, an expression whose value we don't care about, after the |
2198 | similar expression ORIG. */ | |
2199 | ||
2200 | tree | |
2201 | add_stmt_to_compound (tree orig, tree new) | |
2202 | { | |
2203 | if (!new || !TREE_SIDE_EFFECTS (new)) | |
2204 | return orig; | |
2205 | if (!orig || !TREE_SIDE_EFFECTS (orig)) | |
2206 | return new; | |
2207 | return build2 (COMPOUND_EXPR, void_type_node, orig, new); | |
2208 | } | |
2209 | ||
6de9cd9a DN |
2210 | /* Like stabilize_expr, but for a call whose args we want to |
2211 | pre-evaluate. */ | |
2212 | ||
2213 | void | |
2214 | stabilize_call (tree call, tree *initp) | |
2215 | { | |
2216 | tree inits = NULL_TREE; | |
2217 | tree t; | |
2218 | ||
2219 | if (call == error_mark_node) | |
2220 | return; | |
2221 | ||
315fb5db NS |
2222 | gcc_assert (TREE_CODE (call) == CALL_EXPR |
2223 | || TREE_CODE (call) == AGGR_INIT_EXPR); | |
6de9cd9a DN |
2224 | |
2225 | for (t = TREE_OPERAND (call, 1); t; t = TREE_CHAIN (t)) | |
2226 | if (TREE_SIDE_EFFECTS (TREE_VALUE (t))) | |
2227 | { | |
2228 | tree init; | |
2229 | TREE_VALUE (t) = stabilize_expr (TREE_VALUE (t), &init); | |
40aac948 | 2230 | inits = add_stmt_to_compound (inits, init); |
6de9cd9a DN |
2231 | } |
2232 | ||
2233 | *initp = inits; | |
2234 | } | |
2235 | ||
2236 | /* Like stabilize_expr, but for an initialization. If we are initializing | |
2237 | an object of class type, we don't want to introduce an extra temporary, | |
2238 | so we look past the TARGET_EXPR and stabilize the arguments of the call | |
2239 | instead. */ | |
2240 | ||
2241 | bool | |
2242 | stabilize_init (tree init, tree *initp) | |
2243 | { | |
2244 | tree t = init; | |
2245 | ||
2246 | if (t == error_mark_node) | |
2247 | return true; | |
2248 | ||
2249 | if (TREE_CODE (t) == INIT_EXPR | |
2250 | && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR) | |
2251 | TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp); | |
2252 | else | |
2253 | { | |
2254 | if (TREE_CODE (t) == INIT_EXPR) | |
2255 | t = TREE_OPERAND (t, 1); | |
2256 | if (TREE_CODE (t) == TARGET_EXPR) | |
2257 | t = TARGET_EXPR_INITIAL (t); | |
bcac21a0 JM |
2258 | if (TREE_CODE (t) == COMPOUND_EXPR) |
2259 | t = expr_last (t); | |
6de9cd9a | 2260 | if (TREE_CODE (t) == CONSTRUCTOR |
4038c495 | 2261 | && EMPTY_CONSTRUCTOR_P (t)) |
6de9cd9a DN |
2262 | { |
2263 | /* Default-initialization. */ | |
2264 | *initp = NULL_TREE; | |
2265 | return true; | |
2266 | } | |
2267 | ||
2268 | /* If the initializer is a COND_EXPR, we can't preevaluate | |
2269 | anything. */ | |
2270 | if (TREE_CODE (t) == COND_EXPR) | |
2271 | return false; | |
2272 | ||
bf7d31c1 JM |
2273 | /* The TARGET_EXPR might be initializing via bitwise copy from |
2274 | another variable; leave that alone. */ | |
2275 | if (TREE_SIDE_EFFECTS (t)) | |
2276 | stabilize_call (t, initp); | |
6de9cd9a DN |
2277 | } |
2278 | ||
2279 | return true; | |
2280 | } | |
2281 | ||
455f19cb MM |
2282 | /* Like "fold", but should be used whenever we might be processing the |
2283 | body of a template. */ | |
2284 | ||
2285 | tree | |
2286 | fold_if_not_in_template (tree expr) | |
2287 | { | |
2288 | /* In the body of a template, there is never any need to call | |
2289 | "fold". We will call fold later when actually instantiating the | |
2290 | template. Integral constant expressions in templates will be | |
f9f1c24e | 2291 | evaluated via fold_non_dependent_expr, as necessary. */ |
392e3d51 RS |
2292 | if (processing_template_decl) |
2293 | return expr; | |
2294 | ||
2295 | /* Fold C++ front-end specific tree codes. */ | |
2296 | if (TREE_CODE (expr) == UNARY_PLUS_EXPR) | |
2297 | return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0)); | |
2298 | ||
2299 | return fold (expr); | |
455f19cb MM |
2300 | } |
2301 | ||
e2500fed GK |
2302 | \f |
2303 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) | |
2304 | /* Complain that some language-specific thing hanging off a tree | |
2305 | node has been accessed improperly. */ | |
2306 | ||
2307 | void | |
b57b79f7 | 2308 | lang_check_failed (const char* file, int line, const char* function) |
e2500fed GK |
2309 | { |
2310 | internal_error ("lang_* check: failed in %s, at %s:%d", | |
2311 | function, trim_filename (file), line); | |
2312 | } | |
2313 | #endif /* ENABLE_TREE_CHECKING */ | |
2314 | ||
2315 | #include "gt-cp-tree.h" |