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