]>
Commit | Line | Data |
---|---|---|
ad321293 MM |
1 | /* Perform the semantic phase of parsing, i.e., the process of |
2 | building tree structure, checking semantic consistency, and | |
3 | building RTL. These routines are used both during actual parsing | |
4 | and during the instantiation of template functions. | |
5 | ||
5088b058 RH |
6 | Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004 |
7 | Free Software Foundation, Inc. | |
ad321293 MM |
8 | Written by Mark Mitchell (mmitchell@usa.net) based on code found |
9 | formerly in parse.y and pt.c. | |
10 | ||
f5adbb8d | 11 | This file is part of GCC. |
ad321293 | 12 | |
f5adbb8d | 13 | GCC is free software; you can redistribute it and/or modify it |
ad321293 MM |
14 | under the terms of the GNU General Public License as published by |
15 | the Free Software Foundation; either version 2, or (at your option) | |
16 | any later version. | |
17 | ||
f5adbb8d | 18 | GCC is distributed in the hope that it will be useful, but |
ad321293 MM |
19 | WITHOUT ANY WARRANTY; without even the implied warranty of |
20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
21 | General Public License for more details. | |
22 | ||
23 | You should have received a copy of the GNU General Public License | |
f5adbb8d | 24 | along with GCC; see the file COPYING. If not, write to the Free |
ad321293 MM |
25 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA |
26 | 02111-1307, USA. */ | |
27 | ||
28 | #include "config.h" | |
8d052bc7 | 29 | #include "system.h" |
4977bab6 ZW |
30 | #include "coretypes.h" |
31 | #include "tm.h" | |
ad321293 MM |
32 | #include "tree.h" |
33 | #include "cp-tree.h" | |
5f070bc7 | 34 | #include "c-common.h" |
25af8512 | 35 | #include "tree-inline.h" |
6de9cd9a | 36 | #include "tree-mudflap.h" |
ad321293 | 37 | #include "except.h" |
12027a89 | 38 | #include "toplev.h" |
84df082b | 39 | #include "flags.h" |
d9b2d9da | 40 | #include "rtl.h" |
d6684bc8 | 41 | #include "expr.h" |
225ff119 | 42 | #include "output.h" |
ea11ca7e | 43 | #include "timevar.h" |
2b85879e | 44 | #include "debug.h" |
6de9cd9a | 45 | #include "diagnostic.h" |
8cd2462c | 46 | #include "cgraph.h" |
325c3691 | 47 | #include "tree-iterator.h" |
3e1f1ba5 | 48 | #include "vec.h" |
44d10c10 | 49 | #include "target.h" |
ad321293 MM |
50 | |
51 | /* There routines provide a modular interface to perform many parsing | |
52 | operations. They may therefore be used during actual parsing, or | |
53 | during template instantiation, which may be regarded as a | |
54 | degenerate form of parsing. Since the current g++ parser is | |
55 | lacking in several respects, and will be reimplemented, we are | |
56 | attempting to move most code that is not directly related to | |
57 | parsing into this file; that will make implementing the new parser | |
58 | much easier since it will be able to make use of these routines. */ | |
59 | ||
3a978d72 NN |
60 | static tree maybe_convert_cond (tree); |
61 | static tree simplify_aggr_init_exprs_r (tree *, int *, void *); | |
62 | static void emit_associated_thunks (tree); | |
6de9cd9a | 63 | static tree finalize_nrv_r (tree *, int *, void *); |
4985cde3 | 64 | |
558475f0 | 65 | |
8d241e0b KL |
66 | /* Deferred Access Checking Overview |
67 | --------------------------------- | |
68 | ||
69 | Most C++ expressions and declarations require access checking | |
70 | to be performed during parsing. However, in several cases, | |
71 | this has to be treated differently. | |
72 | ||
73 | For member declarations, access checking has to be deferred | |
74 | until more information about the declaration is known. For | |
75 | example: | |
76 | ||
77 | class A { | |
78 | typedef int X; | |
79 | public: | |
80 | X f(); | |
81 | }; | |
82 | ||
83 | A::X A::f(); | |
84 | A::X g(); | |
85 | ||
86 | When we are parsing the function return type `A::X', we don't | |
87 | really know if this is allowed until we parse the function name. | |
88 | ||
89 | Furthermore, some contexts require that access checking is | |
90 | never performed at all. These include class heads, and template | |
91 | instantiations. | |
92 | ||
93 | Typical use of access checking functions is described here: | |
94 | ||
95 | 1. When we enter a context that requires certain access checking | |
96 | mode, the function `push_deferring_access_checks' is called with | |
97 | DEFERRING argument specifying the desired mode. Access checking | |
98 | may be performed immediately (dk_no_deferred), deferred | |
99 | (dk_deferred), or not performed (dk_no_check). | |
100 | ||
101 | 2. When a declaration such as a type, or a variable, is encountered, | |
102 | the function `perform_or_defer_access_check' is called. It | |
103 | maintains a TREE_LIST of all deferred checks. | |
104 | ||
105 | 3. The global `current_class_type' or `current_function_decl' is then | |
106 | setup by the parser. `enforce_access' relies on these information | |
107 | to check access. | |
108 | ||
109 | 4. Upon exiting the context mentioned in step 1, | |
110 | `perform_deferred_access_checks' is called to check all declaration | |
111 | stored in the TREE_LIST. `pop_deferring_access_checks' is then | |
112 | called to restore the previous access checking mode. | |
113 | ||
114 | In case of parsing error, we simply call `pop_deferring_access_checks' | |
115 | without `perform_deferred_access_checks'. */ | |
116 | ||
3e1f1ba5 NS |
117 | typedef struct deferred_access GTY(()) |
118 | { | |
119 | /* A TREE_LIST representing name-lookups for which we have deferred | |
120 | checking access controls. We cannot check the accessibility of | |
121 | names used in a decl-specifier-seq until we know what is being | |
122 | declared because code like: | |
123 | ||
124 | class A { | |
125 | class B {}; | |
126 | B* f(); | |
127 | } | |
128 | ||
129 | A::B* A::f() { return 0; } | |
130 | ||
131 | is valid, even though `A::B' is not generally accessible. | |
132 | ||
133 | The TREE_PURPOSE of each node is the scope used to qualify the | |
134 | name being looked up; the TREE_VALUE is the DECL to which the | |
135 | name was resolved. */ | |
136 | tree deferred_access_checks; | |
137 | ||
138 | /* The current mode of access checks. */ | |
139 | enum deferring_kind deferring_access_checks_kind; | |
140 | ||
141 | } deferred_access; | |
4c254e68 | 142 | DEF_VEC_GC_O (deferred_access); |
3e1f1ba5 | 143 | |
cf22909c | 144 | /* Data for deferred access checking. */ |
3e1f1ba5 NS |
145 | static GTY(()) VEC (deferred_access) *deferred_access_stack; |
146 | static GTY(()) unsigned deferred_access_no_check; | |
cf22909c KL |
147 | |
148 | /* Save the current deferred access states and start deferred | |
149 | access checking iff DEFER_P is true. */ | |
150 | ||
572c2b17 AP |
151 | void |
152 | push_deferring_access_checks (deferring_kind deferring) | |
cf22909c | 153 | { |
78757caa KL |
154 | /* For context like template instantiation, access checking |
155 | disabling applies to all nested context. */ | |
3e1f1ba5 NS |
156 | if (deferred_access_no_check || deferring == dk_no_check) |
157 | deferred_access_no_check++; | |
cf22909c | 158 | else |
3e1f1ba5 NS |
159 | { |
160 | deferred_access *ptr; | |
cf22909c | 161 | |
3e1f1ba5 NS |
162 | ptr = VEC_safe_push (deferred_access, deferred_access_stack, NULL); |
163 | ptr->deferred_access_checks = NULL_TREE; | |
164 | ptr->deferring_access_checks_kind = deferring; | |
165 | } | |
cf22909c KL |
166 | } |
167 | ||
168 | /* Resume deferring access checks again after we stopped doing | |
169 | this previously. */ | |
170 | ||
572c2b17 AP |
171 | void |
172 | resume_deferring_access_checks (void) | |
cf22909c | 173 | { |
3e1f1ba5 NS |
174 | if (!deferred_access_no_check) |
175 | VEC_last (deferred_access, deferred_access_stack) | |
176 | ->deferring_access_checks_kind = dk_deferred; | |
cf22909c KL |
177 | } |
178 | ||
179 | /* Stop deferring access checks. */ | |
180 | ||
572c2b17 AP |
181 | void |
182 | stop_deferring_access_checks (void) | |
cf22909c | 183 | { |
3e1f1ba5 NS |
184 | if (!deferred_access_no_check) |
185 | VEC_last (deferred_access, deferred_access_stack) | |
186 | ->deferring_access_checks_kind = dk_no_deferred; | |
cf22909c KL |
187 | } |
188 | ||
189 | /* Discard the current deferred access checks and restore the | |
190 | previous states. */ | |
191 | ||
572c2b17 AP |
192 | void |
193 | pop_deferring_access_checks (void) | |
cf22909c | 194 | { |
3e1f1ba5 NS |
195 | if (deferred_access_no_check) |
196 | deferred_access_no_check--; | |
197 | else | |
198 | VEC_pop (deferred_access, deferred_access_stack); | |
cf22909c KL |
199 | } |
200 | ||
201 | /* Returns a TREE_LIST representing the deferred checks. | |
202 | The TREE_PURPOSE of each node is the type through which the | |
203 | access occurred; the TREE_VALUE is the declaration named. | |
204 | */ | |
205 | ||
572c2b17 AP |
206 | tree |
207 | get_deferred_access_checks (void) | |
cf22909c | 208 | { |
3e1f1ba5 NS |
209 | if (deferred_access_no_check) |
210 | return NULL; | |
211 | else | |
212 | return (VEC_last (deferred_access, deferred_access_stack) | |
213 | ->deferred_access_checks); | |
cf22909c KL |
214 | } |
215 | ||
216 | /* Take current deferred checks and combine with the | |
217 | previous states if we also defer checks previously. | |
218 | Otherwise perform checks now. */ | |
219 | ||
572c2b17 AP |
220 | void |
221 | pop_to_parent_deferring_access_checks (void) | |
cf22909c | 222 | { |
3e1f1ba5 NS |
223 | if (deferred_access_no_check) |
224 | deferred_access_no_check--; | |
225 | else | |
226 | { | |
227 | tree checks; | |
228 | deferred_access *ptr; | |
229 | ||
230 | checks = (VEC_last (deferred_access, deferred_access_stack) | |
231 | ->deferred_access_checks); | |
232 | ||
233 | VEC_pop (deferred_access, deferred_access_stack); | |
234 | ptr = VEC_last (deferred_access, deferred_access_stack); | |
235 | if (ptr->deferring_access_checks_kind == dk_no_deferred) | |
236 | { | |
237 | /* Check access. */ | |
238 | for (; checks; checks = TREE_CHAIN (checks)) | |
239 | enforce_access (TREE_PURPOSE (checks), | |
240 | TREE_VALUE (checks)); | |
241 | } | |
242 | else | |
243 | { | |
244 | /* Merge with parent. */ | |
245 | tree next; | |
246 | tree original = ptr->deferred_access_checks; | |
247 | ||
248 | for (; checks; checks = next) | |
249 | { | |
250 | tree probe; | |
251 | ||
252 | next = TREE_CHAIN (checks); | |
253 | ||
254 | for (probe = original; probe; probe = TREE_CHAIN (probe)) | |
255 | if (TREE_VALUE (probe) == TREE_VALUE (checks) | |
256 | && TREE_PURPOSE (probe) == TREE_PURPOSE (checks)) | |
257 | goto found; | |
258 | /* Insert into parent's checks. */ | |
259 | TREE_CHAIN (checks) = ptr->deferred_access_checks; | |
260 | ptr->deferred_access_checks = checks; | |
261 | found:; | |
262 | } | |
263 | } | |
264 | } | |
cf22909c KL |
265 | } |
266 | ||
25903d03 KL |
267 | /* Perform the deferred access checks. |
268 | ||
269 | After performing the checks, we still have to keep the list | |
270 | `deferred_access_stack->deferred_access_checks' since we may want | |
271 | to check access for them again later in a different context. | |
272 | For example: | |
273 | ||
274 | class A { | |
275 | typedef int X; | |
276 | static X a; | |
277 | }; | |
278 | A::X A::a, x; // No error for `A::a', error for `x' | |
279 | ||
280 | We have to perform deferred access of `A::X', first with `A::a', | |
281 | next with `x'. */ | |
cf22909c | 282 | |
572c2b17 AP |
283 | void |
284 | perform_deferred_access_checks (void) | |
cf22909c KL |
285 | { |
286 | tree deferred_check; | |
3e1f1ba5 NS |
287 | |
288 | for (deferred_check = (VEC_last (deferred_access, deferred_access_stack) | |
289 | ->deferred_access_checks); | |
cf22909c KL |
290 | deferred_check; |
291 | deferred_check = TREE_CHAIN (deferred_check)) | |
292 | /* Check access. */ | |
293 | enforce_access (TREE_PURPOSE (deferred_check), | |
294 | TREE_VALUE (deferred_check)); | |
cf22909c KL |
295 | } |
296 | ||
297 | /* Defer checking the accessibility of DECL, when looked up in | |
6df5158a | 298 | BINFO. */ |
cf22909c | 299 | |
572c2b17 AP |
300 | void |
301 | perform_or_defer_access_check (tree binfo, tree decl) | |
cf22909c KL |
302 | { |
303 | tree check; | |
3e1f1ba5 | 304 | deferred_access *ptr; |
cf22909c | 305 | |
3e1f1ba5 NS |
306 | /* Exit if we are in a context that no access checking is performed. |
307 | */ | |
308 | if (deferred_access_no_check) | |
0f2a66c9 | 309 | return; |
6df5158a | 310 | |
50bc768d | 311 | gcc_assert (TREE_CODE (binfo) == TREE_BINFO); |
0f2a66c9 | 312 | |
3e1f1ba5 NS |
313 | ptr = VEC_last (deferred_access, deferred_access_stack); |
314 | ||
cf22909c | 315 | /* If we are not supposed to defer access checks, just check now. */ |
3e1f1ba5 | 316 | if (ptr->deferring_access_checks_kind == dk_no_deferred) |
cf22909c | 317 | { |
6df5158a | 318 | enforce_access (binfo, decl); |
cf22909c KL |
319 | return; |
320 | } | |
0f2a66c9 | 321 | |
cf22909c | 322 | /* See if we are already going to perform this check. */ |
3e1f1ba5 | 323 | for (check = ptr->deferred_access_checks; |
cf22909c KL |
324 | check; |
325 | check = TREE_CHAIN (check)) | |
6df5158a | 326 | if (TREE_VALUE (check) == decl && TREE_PURPOSE (check) == binfo) |
cf22909c KL |
327 | return; |
328 | /* If not, record the check. */ | |
3e1f1ba5 NS |
329 | ptr->deferred_access_checks |
330 | = tree_cons (binfo, decl, ptr->deferred_access_checks); | |
cf22909c KL |
331 | } |
332 | ||
838dfd8a | 333 | /* Returns nonzero if the current statement is a full expression, |
f2c5f623 BC |
334 | i.e. temporaries created during that statement should be destroyed |
335 | at the end of the statement. */ | |
35b1567d | 336 | |
f2c5f623 | 337 | int |
3a978d72 | 338 | stmts_are_full_exprs_p (void) |
f2c5f623 | 339 | { |
ae499cce MM |
340 | return current_stmt_tree ()->stmts_are_full_exprs_p; |
341 | } | |
342 | ||
343 | /* Returns the stmt_tree (if any) to which statements are currently | |
344 | being added. If there is no active statement-tree, NULL is | |
345 | returned. */ | |
346 | ||
347 | stmt_tree | |
3a978d72 | 348 | current_stmt_tree (void) |
ae499cce MM |
349 | { |
350 | return (cfun | |
e2500fed | 351 | ? &cfun->language->base.x_stmt_tree |
ae499cce | 352 | : &scope_chain->x_stmt_tree); |
f2c5f623 | 353 | } |
35b1567d | 354 | |
543a0daa RH |
355 | /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */ |
356 | ||
357 | static tree | |
358 | maybe_cleanup_point_expr (tree expr) | |
359 | { | |
360 | if (!processing_template_decl && stmts_are_full_exprs_p ()) | |
0ad28dde | 361 | expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr); |
543a0daa RH |
362 | return expr; |
363 | } | |
364 | ||
0ad28dde | 365 | /* Like maybe_cleanup_point_expr except have the type of the new expression be |
22423a1f KH |
366 | void so we don't need to create a temporary variable to hold the inner |
367 | expression. The reason why we do this is because the original type might be | |
368 | an aggregate and we cannot create a temporary variable for that type. */ | |
0ad28dde AP |
369 | |
370 | static tree | |
371 | maybe_cleanup_point_expr_void (tree expr) | |
372 | { | |
373 | if (!processing_template_decl && stmts_are_full_exprs_p ()) | |
374 | expr = fold_build_cleanup_point_expr (void_type_node, expr); | |
375 | return expr; | |
376 | } | |
377 | ||
378 | ||
379 | ||
543a0daa RH |
380 | /* Create a declaration statement for the declaration given by the DECL. */ |
381 | ||
382 | void | |
350fae66 | 383 | add_decl_expr (tree decl) |
543a0daa | 384 | { |
350fae66 | 385 | tree r = build_stmt (DECL_EXPR, decl); |
b187901e AP |
386 | if (DECL_INITIAL (decl) |
387 | || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl)))) | |
0ad28dde | 388 | r = maybe_cleanup_point_expr_void (r); |
543a0daa RH |
389 | add_stmt (r); |
390 | } | |
391 | ||
f2c5f623 BC |
392 | /* Nonzero if TYPE is an anonymous union or struct type. We have to use a |
393 | flag for this because "A union for which objects or pointers are | |
394 | declared is not an anonymous union" [class.union]. */ | |
35b1567d | 395 | |
f2c5f623 | 396 | int |
3a978d72 | 397 | anon_aggr_type_p (tree node) |
35b1567d | 398 | { |
e2500fed | 399 | return ANON_AGGR_TYPE_P (node); |
35b1567d BC |
400 | } |
401 | ||
f2c5f623 | 402 | /* Finish a scope. */ |
35b1567d | 403 | |
af746697 | 404 | static tree |
325c3691 | 405 | do_poplevel (tree stmt_list) |
35b1567d | 406 | { |
325c3691 | 407 | tree block = NULL; |
35b1567d | 408 | |
f2c5f623 | 409 | if (stmts_are_full_exprs_p ()) |
325c3691 | 410 | block = poplevel (kept_level_p (), 1, 0); |
f2c5f623 | 411 | |
325c3691 RH |
412 | stmt_list = pop_stmt_list (stmt_list); |
413 | ||
414 | if (!processing_template_decl) | |
415 | { | |
416 | stmt_list = c_build_bind_expr (block, stmt_list); | |
417 | /* ??? See c_end_compound_stmt re statement expressions. */ | |
35b1567d BC |
418 | } |
419 | ||
325c3691 | 420 | return stmt_list; |
35b1567d BC |
421 | } |
422 | ||
f2c5f623 | 423 | /* Begin a new scope. */ |
35b1567d | 424 | |
325c3691 | 425 | static tree |
92bc1323 | 426 | do_pushlevel (scope_kind sk) |
35b1567d | 427 | { |
325c3691 | 428 | tree ret = push_stmt_list (); |
f2c5f623 | 429 | if (stmts_are_full_exprs_p ()) |
325c3691 RH |
430 | begin_scope (sk, NULL); |
431 | return ret; | |
432 | } | |
5a508662 RH |
433 | |
434 | /* Queue a cleanup. CLEANUP is an expression/statement to be executed | |
435 | when the current scope is exited. EH_ONLY is true when this is not | |
436 | meant to apply to normal control flow transfer. */ | |
437 | ||
438 | void | |
439 | push_cleanup (tree decl, tree cleanup, bool eh_only) | |
440 | { | |
441 | tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl); | |
442 | CLEANUP_EH_ONLY (stmt) = eh_only; | |
443 | add_stmt (stmt); | |
444 | CLEANUP_BODY (stmt) = push_stmt_list (); | |
445 | } | |
325c3691 | 446 | |
caf2523d RH |
447 | /* Begin a conditional that might contain a declaration. When generating |
448 | normal code, we want the declaration to appear before the statement | |
449 | containing the conditional. When generating template code, we want the | |
350fae66 | 450 | conditional to be rendered as the raw DECL_EXPR. */ |
325c3691 RH |
451 | |
452 | static void | |
caf2523d | 453 | begin_cond (tree *cond_p) |
325c3691 | 454 | { |
caf2523d RH |
455 | if (processing_template_decl) |
456 | *cond_p = push_stmt_list (); | |
457 | } | |
458 | ||
459 | /* Finish such a conditional. */ | |
460 | ||
461 | static void | |
462 | finish_cond (tree *cond_p, tree expr) | |
463 | { | |
464 | if (processing_template_decl) | |
35b1567d | 465 | { |
caf2523d | 466 | tree cond = pop_stmt_list (*cond_p); |
350fae66 | 467 | if (TREE_CODE (cond) == DECL_EXPR) |
caf2523d | 468 | expr = cond; |
35b1567d | 469 | } |
caf2523d | 470 | *cond_p = expr; |
35b1567d BC |
471 | } |
472 | ||
325c3691 RH |
473 | /* If *COND_P specifies a conditional with a declaration, transform the |
474 | loop such that | |
caf2523d RH |
475 | while (A x = 42) { } |
476 | for (; A x = 42;) { } | |
325c3691 | 477 | becomes |
caf2523d RH |
478 | while (true) { A x = 42; if (!x) break; } |
479 | for (;;) { A x = 42; if (!x) break; } | |
480 | The statement list for BODY will be empty if the conditional did | |
481 | not declare anything. */ | |
482 | ||
325c3691 | 483 | static void |
caf2523d | 484 | simplify_loop_decl_cond (tree *cond_p, tree body) |
325c3691 | 485 | { |
caf2523d | 486 | tree cond, if_stmt; |
325c3691 | 487 | |
caf2523d RH |
488 | if (!TREE_SIDE_EFFECTS (body)) |
489 | return; | |
325c3691 | 490 | |
caf2523d RH |
491 | cond = *cond_p; |
492 | *cond_p = boolean_true_node; | |
493 | ||
494 | if_stmt = begin_if_stmt (); | |
495 | cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0); | |
496 | finish_if_stmt_cond (cond, if_stmt); | |
497 | finish_break_stmt (); | |
498 | finish_then_clause (if_stmt); | |
499 | finish_if_stmt (if_stmt); | |
500 | } | |
325c3691 | 501 | |
35b1567d BC |
502 | /* Finish a goto-statement. */ |
503 | ||
3e4d04a1 | 504 | tree |
3a978d72 | 505 | finish_goto_stmt (tree destination) |
35b1567d BC |
506 | { |
507 | if (TREE_CODE (destination) == IDENTIFIER_NODE) | |
508 | destination = lookup_label (destination); | |
509 | ||
510 | /* We warn about unused labels with -Wunused. That means we have to | |
511 | mark the used labels as used. */ | |
512 | if (TREE_CODE (destination) == LABEL_DECL) | |
513 | TREE_USED (destination) = 1; | |
fc2b8477 MM |
514 | else |
515 | { | |
516 | /* The DESTINATION is being used as an rvalue. */ | |
517 | if (!processing_template_decl) | |
518 | destination = decay_conversion (destination); | |
519 | /* We don't inline calls to functions with computed gotos. | |
520 | Those functions are typically up to some funny business, | |
521 | and may be depending on the labels being at particular | |
522 | addresses, or some such. */ | |
523 | DECL_UNINLINABLE (current_function_decl) = 1; | |
524 | } | |
35b1567d BC |
525 | |
526 | check_goto (destination); | |
527 | ||
9e14e18f | 528 | return add_stmt (build_stmt (GOTO_EXPR, destination)); |
35b1567d BC |
529 | } |
530 | ||
ed5511d9 MM |
531 | /* COND is the condition-expression for an if, while, etc., |
532 | statement. Convert it to a boolean value, if appropriate. */ | |
533 | ||
8ce33230 | 534 | static tree |
3a978d72 | 535 | maybe_convert_cond (tree cond) |
ed5511d9 MM |
536 | { |
537 | /* Empty conditions remain empty. */ | |
538 | if (!cond) | |
539 | return NULL_TREE; | |
540 | ||
541 | /* Wait until we instantiate templates before doing conversion. */ | |
542 | if (processing_template_decl) | |
543 | return cond; | |
544 | ||
545 | /* Do the conversion. */ | |
546 | cond = convert_from_reference (cond); | |
547 | return condition_conversion (cond); | |
548 | } | |
549 | ||
9bfadf57 | 550 | /* Finish an expression-statement, whose EXPRESSION is as indicated. */ |
a7e4cfa0 | 551 | |
3e4d04a1 | 552 | tree |
3a978d72 | 553 | finish_expr_stmt (tree expr) |
ad321293 | 554 | { |
3e4d04a1 RH |
555 | tree r = NULL_TREE; |
556 | ||
ce4a0391 | 557 | if (expr != NULL_TREE) |
ad321293 | 558 | { |
a5bcc582 | 559 | if (!processing_template_decl) |
3a5b9284 RH |
560 | { |
561 | if (warn_sequence_point) | |
562 | verify_sequence_points (expr); | |
563 | expr = convert_to_void (expr, "statement"); | |
564 | } | |
47d4c811 NS |
565 | else if (!type_dependent_expression_p (expr)) |
566 | convert_to_void (build_non_dependent_expr (expr), "statement"); | |
325c3691 RH |
567 | |
568 | /* Simplification of inner statement expressions, compound exprs, | |
ca5b80f3 | 569 | etc can result in us already having an EXPR_STMT. */ |
543a0daa RH |
570 | if (TREE_CODE (expr) != CLEANUP_POINT_EXPR) |
571 | { | |
572 | if (TREE_CODE (expr) != EXPR_STMT) | |
573 | expr = build_stmt (EXPR_STMT, expr); | |
0ad28dde | 574 | expr = maybe_cleanup_point_expr_void (expr); |
543a0daa RH |
575 | } |
576 | ||
325c3691 | 577 | r = add_stmt (expr); |
35b1567d | 578 | } |
364460b6 | 579 | |
35b1567d | 580 | finish_stmt (); |
558475f0 | 581 | |
3e4d04a1 | 582 | return r; |
35b1567d BC |
583 | } |
584 | ||
35b1567d | 585 | |
ad321293 MM |
586 | /* Begin an if-statement. Returns a newly created IF_STMT if |
587 | appropriate. */ | |
588 | ||
589 | tree | |
3a978d72 | 590 | begin_if_stmt (void) |
ad321293 | 591 | { |
325c3691 RH |
592 | tree r, scope; |
593 | scope = do_pushlevel (sk_block); | |
0dfdeca6 | 594 | r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE); |
325c3691 | 595 | TREE_CHAIN (r) = scope; |
caf2523d | 596 | begin_cond (&IF_COND (r)); |
ad321293 MM |
597 | return r; |
598 | } | |
599 | ||
600 | /* Process the COND of an if-statement, which may be given by | |
601 | IF_STMT. */ | |
602 | ||
603 | void | |
3a978d72 | 604 | finish_if_stmt_cond (tree cond, tree if_stmt) |
ad321293 | 605 | { |
caf2523d RH |
606 | finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond)); |
607 | add_stmt (if_stmt); | |
325c3691 | 608 | THEN_CLAUSE (if_stmt) = push_stmt_list (); |
ad321293 MM |
609 | } |
610 | ||
611 | /* Finish the then-clause of an if-statement, which may be given by | |
612 | IF_STMT. */ | |
613 | ||
614 | tree | |
3a978d72 | 615 | finish_then_clause (tree if_stmt) |
ad321293 | 616 | { |
325c3691 | 617 | THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt)); |
35b1567d | 618 | return if_stmt; |
ad321293 MM |
619 | } |
620 | ||
621 | /* Begin the else-clause of an if-statement. */ | |
622 | ||
325c3691 RH |
623 | void |
624 | begin_else_clause (tree if_stmt) | |
ad321293 | 625 | { |
325c3691 | 626 | ELSE_CLAUSE (if_stmt) = push_stmt_list (); |
ad321293 MM |
627 | } |
628 | ||
629 | /* Finish the else-clause of an if-statement, which may be given by | |
630 | IF_STMT. */ | |
631 | ||
632 | void | |
3a978d72 | 633 | finish_else_clause (tree if_stmt) |
ad321293 | 634 | { |
325c3691 | 635 | ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt)); |
ad321293 MM |
636 | } |
637 | ||
dfbb4f34 | 638 | /* Finish an if-statement. */ |
ad321293 MM |
639 | |
640 | void | |
325c3691 | 641 | finish_if_stmt (tree if_stmt) |
ad321293 | 642 | { |
325c3691 RH |
643 | tree scope = TREE_CHAIN (if_stmt); |
644 | TREE_CHAIN (if_stmt) = NULL; | |
645 | add_stmt (do_poplevel (scope)); | |
ad321293 | 646 | finish_stmt (); |
35b1567d BC |
647 | } |
648 | ||
ad321293 MM |
649 | /* Begin a while-statement. Returns a newly created WHILE_STMT if |
650 | appropriate. */ | |
651 | ||
652 | tree | |
3a978d72 | 653 | begin_while_stmt (void) |
ad321293 MM |
654 | { |
655 | tree r; | |
0dfdeca6 | 656 | r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE); |
ae499cce | 657 | add_stmt (r); |
325c3691 | 658 | WHILE_BODY (r) = do_pushlevel (sk_block); |
caf2523d | 659 | begin_cond (&WHILE_COND (r)); |
ad321293 MM |
660 | return r; |
661 | } | |
662 | ||
27d26ee7 | 663 | /* Process the COND of a while-statement, which may be given by |
ad321293 MM |
664 | WHILE_STMT. */ |
665 | ||
666 | void | |
3a978d72 | 667 | finish_while_stmt_cond (tree cond, tree while_stmt) |
ad321293 | 668 | { |
caf2523d RH |
669 | finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond)); |
670 | simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt)); | |
ad321293 MM |
671 | } |
672 | ||
673 | /* Finish a while-statement, which may be given by WHILE_STMT. */ | |
674 | ||
675 | void | |
3a978d72 | 676 | finish_while_stmt (tree while_stmt) |
ad321293 | 677 | { |
325c3691 | 678 | WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt)); |
ad321293 MM |
679 | finish_stmt (); |
680 | } | |
681 | ||
682 | /* Begin a do-statement. Returns a newly created DO_STMT if | |
683 | appropriate. */ | |
684 | ||
685 | tree | |
3a978d72 | 686 | begin_do_stmt (void) |
ad321293 | 687 | { |
0dfdeca6 | 688 | tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE); |
ae499cce | 689 | add_stmt (r); |
325c3691 | 690 | DO_BODY (r) = push_stmt_list (); |
35b1567d | 691 | return r; |
ad321293 MM |
692 | } |
693 | ||
694 | /* Finish the body of a do-statement, which may be given by DO_STMT. */ | |
695 | ||
696 | void | |
3a978d72 | 697 | finish_do_body (tree do_stmt) |
ad321293 | 698 | { |
325c3691 | 699 | DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt)); |
ad321293 MM |
700 | } |
701 | ||
702 | /* Finish a do-statement, which may be given by DO_STMT, and whose | |
703 | COND is as indicated. */ | |
704 | ||
705 | void | |
3a978d72 | 706 | finish_do_stmt (tree cond, tree do_stmt) |
ad321293 | 707 | { |
ed5511d9 | 708 | cond = maybe_convert_cond (cond); |
35b1567d BC |
709 | DO_COND (do_stmt) = cond; |
710 | finish_stmt (); | |
711 | } | |
ed5511d9 | 712 | |
ad321293 MM |
713 | /* Finish a return-statement. The EXPRESSION returned, if any, is as |
714 | indicated. */ | |
715 | ||
3e4d04a1 | 716 | tree |
3a978d72 | 717 | finish_return_stmt (tree expr) |
ad321293 | 718 | { |
3e4d04a1 RH |
719 | tree r; |
720 | ||
efc7052d | 721 | expr = check_return_expr (expr); |
35b1567d | 722 | if (!processing_template_decl) |
efee38a9 | 723 | { |
44d10c10 PB |
724 | if (DECL_DESTRUCTOR_P (current_function_decl) |
725 | || (DECL_CONSTRUCTOR_P (current_function_decl) | |
726 | && targetm.cxx.cdtor_returns_this ())) | |
efee38a9 MM |
727 | { |
728 | /* Similarly, all destructors must run destructors for | |
729 | base-classes before returning. So, all returns in a | |
dfbb4f34 | 730 | destructor get sent to the DTOR_LABEL; finish_function emits |
efee38a9 | 731 | code to return a value there. */ |
44d10c10 | 732 | return finish_goto_stmt (cdtor_label); |
efee38a9 MM |
733 | } |
734 | } | |
543a0daa | 735 | |
5088b058 | 736 | r = build_stmt (RETURN_EXPR, expr); |
0ad28dde | 737 | r = maybe_cleanup_point_expr_void (r); |
543a0daa | 738 | r = add_stmt (r); |
35b1567d | 739 | finish_stmt (); |
3e4d04a1 RH |
740 | |
741 | return r; | |
35b1567d | 742 | } |
efee38a9 | 743 | |
ad321293 MM |
744 | /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */ |
745 | ||
746 | tree | |
3a978d72 | 747 | begin_for_stmt (void) |
ad321293 MM |
748 | { |
749 | tree r; | |
750 | ||
0dfdeca6 BC |
751 | r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE, |
752 | NULL_TREE, NULL_TREE); | |
325c3691 RH |
753 | |
754 | if (flag_new_for_scope > 0) | |
755 | TREE_CHAIN (r) = do_pushlevel (sk_for); | |
ad321293 | 756 | |
894ca2c9 RH |
757 | if (processing_template_decl) |
758 | FOR_INIT_STMT (r) = push_stmt_list (); | |
759 | ||
ad321293 MM |
760 | return r; |
761 | } | |
762 | ||
763 | /* Finish the for-init-statement of a for-statement, which may be | |
764 | given by FOR_STMT. */ | |
765 | ||
766 | void | |
3a978d72 | 767 | finish_for_init_stmt (tree for_stmt) |
ad321293 | 768 | { |
894ca2c9 RH |
769 | if (processing_template_decl) |
770 | FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt)); | |
325c3691 RH |
771 | add_stmt (for_stmt); |
772 | FOR_BODY (for_stmt) = do_pushlevel (sk_block); | |
caf2523d | 773 | begin_cond (&FOR_COND (for_stmt)); |
ad321293 MM |
774 | } |
775 | ||
776 | /* Finish the COND of a for-statement, which may be given by | |
777 | FOR_STMT. */ | |
778 | ||
779 | void | |
3a978d72 | 780 | finish_for_cond (tree cond, tree for_stmt) |
ad321293 | 781 | { |
caf2523d RH |
782 | finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond)); |
783 | simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt)); | |
ad321293 MM |
784 | } |
785 | ||
786 | /* Finish the increment-EXPRESSION in a for-statement, which may be | |
787 | given by FOR_STMT. */ | |
788 | ||
789 | void | |
3a978d72 | 790 | finish_for_expr (tree expr, tree for_stmt) |
ad321293 | 791 | { |
543a0daa RH |
792 | if (!expr) |
793 | return; | |
6f69173e MM |
794 | /* If EXPR is an overloaded function, issue an error; there is no |
795 | context available to use to perform overload resolution. */ | |
543a0daa | 796 | if (type_unknown_p (expr)) |
6f69173e MM |
797 | { |
798 | cxx_incomplete_type_error (expr, TREE_TYPE (expr)); | |
799 | expr = error_mark_node; | |
800 | } | |
bcd46a7c AP |
801 | if (!processing_template_decl) |
802 | { | |
803 | if (warn_sequence_point) | |
804 | verify_sequence_points (expr); | |
805 | expr = convert_to_void (expr, "3rd expression in for"); | |
806 | } | |
807 | else if (!type_dependent_expression_p (expr)) | |
808 | convert_to_void (build_non_dependent_expr (expr), "3rd expression in for"); | |
0ad28dde | 809 | expr = maybe_cleanup_point_expr_void (expr); |
35b1567d | 810 | FOR_EXPR (for_stmt) = expr; |
ad321293 MM |
811 | } |
812 | ||
813 | /* Finish the body of a for-statement, which may be given by | |
814 | FOR_STMT. The increment-EXPR for the loop must be | |
815 | provided. */ | |
816 | ||
817 | void | |
3a978d72 | 818 | finish_for_stmt (tree for_stmt) |
ad321293 | 819 | { |
325c3691 RH |
820 | FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt)); |
821 | ||
ad321293 | 822 | /* Pop the scope for the body of the loop. */ |
325c3691 RH |
823 | if (flag_new_for_scope > 0) |
824 | { | |
825 | tree scope = TREE_CHAIN (for_stmt); | |
826 | TREE_CHAIN (for_stmt) = NULL; | |
827 | add_stmt (do_poplevel (scope)); | |
828 | } | |
829 | ||
ad321293 MM |
830 | finish_stmt (); |
831 | } | |
832 | ||
833 | /* Finish a break-statement. */ | |
834 | ||
3e4d04a1 | 835 | tree |
3a978d72 | 836 | finish_break_stmt (void) |
ad321293 | 837 | { |
3e4d04a1 | 838 | return add_stmt (build_break_stmt ()); |
35b1567d BC |
839 | } |
840 | ||
ad321293 MM |
841 | /* Finish a continue-statement. */ |
842 | ||
3e4d04a1 | 843 | tree |
3a978d72 | 844 | finish_continue_stmt (void) |
ad321293 | 845 | { |
3e4d04a1 | 846 | return add_stmt (build_continue_stmt ()); |
ad321293 MM |
847 | } |
848 | ||
35b1567d BC |
849 | /* Begin a switch-statement. Returns a new SWITCH_STMT if |
850 | appropriate. */ | |
851 | ||
852 | tree | |
3a978d72 | 853 | begin_switch_stmt (void) |
35b1567d | 854 | { |
325c3691 RH |
855 | tree r, scope; |
856 | ||
6f9fdf4d | 857 | r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE); |
325c3691 RH |
858 | |
859 | scope = do_pushlevel (sk_block); | |
860 | TREE_CHAIN (r) = scope; | |
caf2523d | 861 | begin_cond (&SWITCH_COND (r)); |
325c3691 | 862 | |
527f0080 | 863 | return r; |
ad321293 MM |
864 | } |
865 | ||
527f0080 | 866 | /* Finish the cond of a switch-statement. */ |
ad321293 | 867 | |
527f0080 | 868 | void |
3a978d72 | 869 | finish_switch_cond (tree cond, tree switch_stmt) |
ad321293 | 870 | { |
6f9fdf4d | 871 | tree orig_type = NULL; |
35b1567d | 872 | if (!processing_template_decl) |
373eb3b3 | 873 | { |
56cb9733 MM |
874 | tree index; |
875 | ||
35b1567d | 876 | /* Convert the condition to an integer or enumeration type. */ |
b746c5dc | 877 | cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true); |
35b1567d | 878 | if (cond == NULL_TREE) |
373eb3b3 | 879 | { |
35b1567d BC |
880 | error ("switch quantity not an integer"); |
881 | cond = error_mark_node; | |
882 | } | |
6f9fdf4d | 883 | orig_type = TREE_TYPE (cond); |
35b1567d BC |
884 | if (cond != error_mark_node) |
885 | { | |
0a72704b MM |
886 | /* [stmt.switch] |
887 | ||
888 | Integral promotions are performed. */ | |
889 | cond = perform_integral_promotions (cond); | |
543a0daa | 890 | cond = maybe_cleanup_point_expr (cond); |
373eb3b3 | 891 | } |
56cb9733 | 892 | |
25c8b645 JJ |
893 | if (cond != error_mark_node) |
894 | { | |
895 | index = get_unwidened (cond, NULL_TREE); | |
896 | /* We can't strip a conversion from a signed type to an unsigned, | |
897 | because if we did, int_fits_type_p would do the wrong thing | |
898 | when checking case values for being in range, | |
899 | and it's too hard to do the right thing. */ | |
8df83eae RK |
900 | if (TYPE_UNSIGNED (TREE_TYPE (cond)) |
901 | == TYPE_UNSIGNED (TREE_TYPE (index))) | |
25c8b645 JJ |
902 | cond = index; |
903 | } | |
ad321293 | 904 | } |
caf2523d | 905 | finish_cond (&SWITCH_COND (switch_stmt), cond); |
6f9fdf4d | 906 | SWITCH_TYPE (switch_stmt) = orig_type; |
caf2523d | 907 | add_stmt (switch_stmt); |
56cb9733 | 908 | push_switch (switch_stmt); |
325c3691 | 909 | SWITCH_BODY (switch_stmt) = push_stmt_list (); |
ad321293 MM |
910 | } |
911 | ||
912 | /* Finish the body of a switch-statement, which may be given by | |
913 | SWITCH_STMT. The COND to switch on is indicated. */ | |
914 | ||
915 | void | |
3a978d72 | 916 | finish_switch_stmt (tree switch_stmt) |
ad321293 | 917 | { |
325c3691 RH |
918 | tree scope; |
919 | ||
920 | SWITCH_BODY (switch_stmt) = pop_stmt_list (SWITCH_BODY (switch_stmt)); | |
ad321293 | 921 | pop_switch (); |
ad321293 | 922 | finish_stmt (); |
325c3691 RH |
923 | |
924 | scope = TREE_CHAIN (switch_stmt); | |
925 | TREE_CHAIN (switch_stmt) = NULL; | |
926 | add_stmt (do_poplevel (scope)); | |
ad321293 MM |
927 | } |
928 | ||
ad321293 MM |
929 | /* Begin a try-block. Returns a newly-created TRY_BLOCK if |
930 | appropriate. */ | |
931 | ||
932 | tree | |
3a978d72 | 933 | begin_try_block (void) |
ad321293 | 934 | { |
0dfdeca6 | 935 | tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE); |
ae499cce | 936 | add_stmt (r); |
325c3691 | 937 | TRY_STMTS (r) = push_stmt_list (); |
35b1567d | 938 | return r; |
ad321293 MM |
939 | } |
940 | ||
0dde4175 JM |
941 | /* Likewise, for a function-try-block. */ |
942 | ||
943 | tree | |
3a978d72 | 944 | begin_function_try_block (void) |
0dde4175 | 945 | { |
325c3691 | 946 | tree r = begin_try_block (); |
35b1567d | 947 | FN_TRY_BLOCK_P (r) = 1; |
35b1567d | 948 | return r; |
0dde4175 JM |
949 | } |
950 | ||
ad321293 MM |
951 | /* Finish a try-block, which may be given by TRY_BLOCK. */ |
952 | ||
953 | void | |
3a978d72 | 954 | finish_try_block (tree try_block) |
ad321293 | 955 | { |
325c3691 RH |
956 | TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block)); |
957 | TRY_HANDLERS (try_block) = push_stmt_list (); | |
ad321293 MM |
958 | } |
959 | ||
efa8eda3 MM |
960 | /* Finish the body of a cleanup try-block, which may be given by |
961 | TRY_BLOCK. */ | |
962 | ||
62409b39 | 963 | void |
3a978d72 | 964 | finish_cleanup_try_block (tree try_block) |
62409b39 | 965 | { |
325c3691 | 966 | TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block)); |
62409b39 MM |
967 | } |
968 | ||
f1dedc31 MM |
969 | /* Finish an implicitly generated try-block, with a cleanup is given |
970 | by CLEANUP. */ | |
971 | ||
972 | void | |
3a978d72 | 973 | finish_cleanup (tree cleanup, tree try_block) |
f1dedc31 | 974 | { |
35b1567d BC |
975 | TRY_HANDLERS (try_block) = cleanup; |
976 | CLEANUP_P (try_block) = 1; | |
f1dedc31 MM |
977 | } |
978 | ||
0dde4175 JM |
979 | /* Likewise, for a function-try-block. */ |
980 | ||
981 | void | |
3a978d72 | 982 | finish_function_try_block (tree try_block) |
0dde4175 | 983 | { |
325c3691 RH |
984 | finish_try_block (try_block); |
985 | /* FIXME : something queer about CTOR_INITIALIZER somehow following | |
986 | the try block, but moving it inside. */ | |
b35d4555 | 987 | in_function_try_handler = 1; |
0dde4175 JM |
988 | } |
989 | ||
ad321293 MM |
990 | /* Finish a handler-sequence for a try-block, which may be given by |
991 | TRY_BLOCK. */ | |
992 | ||
993 | void | |
3a978d72 | 994 | finish_handler_sequence (tree try_block) |
ad321293 | 995 | { |
325c3691 | 996 | TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block)); |
35b1567d | 997 | check_handlers (TRY_HANDLERS (try_block)); |
ad321293 MM |
998 | } |
999 | ||
0dde4175 JM |
1000 | /* Likewise, for a function-try-block. */ |
1001 | ||
1002 | void | |
3a978d72 | 1003 | finish_function_handler_sequence (tree try_block) |
0dde4175 | 1004 | { |
b35d4555 | 1005 | in_function_try_handler = 0; |
325c3691 | 1006 | finish_handler_sequence (try_block); |
35b1567d BC |
1007 | } |
1008 | ||
ad321293 MM |
1009 | /* Begin a handler. Returns a HANDLER if appropriate. */ |
1010 | ||
1011 | tree | |
3a978d72 | 1012 | begin_handler (void) |
ad321293 MM |
1013 | { |
1014 | tree r; | |
325c3691 | 1015 | |
0dfdeca6 | 1016 | r = build_stmt (HANDLER, NULL_TREE, NULL_TREE); |
ae499cce | 1017 | add_stmt (r); |
325c3691 | 1018 | |
1a6025b4 JM |
1019 | /* Create a binding level for the eh_info and the exception object |
1020 | cleanup. */ | |
325c3691 RH |
1021 | HANDLER_BODY (r) = do_pushlevel (sk_catch); |
1022 | ||
ad321293 MM |
1023 | return r; |
1024 | } | |
1025 | ||
1026 | /* Finish the handler-parameters for a handler, which may be given by | |
b35d4555 MM |
1027 | HANDLER. DECL is the declaration for the catch parameter, or NULL |
1028 | if this is a `catch (...)' clause. */ | |
ad321293 | 1029 | |
1a6025b4 | 1030 | void |
3a978d72 | 1031 | finish_handler_parms (tree decl, tree handler) |
b35d4555 | 1032 | { |
1a6025b4 | 1033 | tree type = NULL_TREE; |
b35d4555 MM |
1034 | if (processing_template_decl) |
1035 | { | |
1036 | if (decl) | |
1037 | { | |
1038 | decl = pushdecl (decl); | |
1039 | decl = push_template_decl (decl); | |
325c3691 | 1040 | HANDLER_PARMS (handler) = decl; |
1a6025b4 | 1041 | type = TREE_TYPE (decl); |
b35d4555 MM |
1042 | } |
1043 | } | |
35b1567d | 1044 | else |
1a6025b4 | 1045 | type = expand_start_catch_block (decl); |
35b1567d | 1046 | |
1a6025b4 | 1047 | HANDLER_TYPE (handler) = type; |
b80cfdcd | 1048 | if (!processing_template_decl && type) |
6cad4e17 | 1049 | mark_used (eh_type_info (type)); |
35b1567d BC |
1050 | } |
1051 | ||
1052 | /* Finish a handler, which may be given by HANDLER. The BLOCKs are | |
1053 | the return value from the matching call to finish_handler_parms. */ | |
1054 | ||
1055 | void | |
3a978d72 | 1056 | finish_handler (tree handler) |
35b1567d BC |
1057 | { |
1058 | if (!processing_template_decl) | |
1a6025b4 | 1059 | expand_end_catch_block (); |
325c3691 | 1060 | HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler)); |
35b1567d BC |
1061 | } |
1062 | ||
5882f0f3 | 1063 | /* Begin a compound statement. FLAGS contains some bits that control the |
5995ebfb | 1064 | behavior and context. If BCS_NO_SCOPE is set, the compound statement |
5882f0f3 RH |
1065 | does not define a scope. If BCS_FN_BODY is set, this is the outermost |
1066 | block of a function. If BCS_TRY_BLOCK is set, this is the block | |
1067 | created on behalf of a TRY statement. Returns a token to be passed to | |
1068 | finish_compound_stmt. */ | |
ad321293 MM |
1069 | |
1070 | tree | |
325c3691 | 1071 | begin_compound_stmt (unsigned int flags) |
ad321293 | 1072 | { |
325c3691 | 1073 | tree r; |
558475f0 | 1074 | |
325c3691 RH |
1075 | if (flags & BCS_NO_SCOPE) |
1076 | { | |
1077 | r = push_stmt_list (); | |
1078 | STATEMENT_LIST_NO_SCOPE (r) = 1; | |
1079 | ||
1080 | /* Normally, we try hard to keep the BLOCK for a statement-expression. | |
1081 | But, if it's a statement-expression with a scopeless block, there's | |
1082 | nothing to keep, and we don't want to accidentally keep a block | |
1083 | *inside* the scopeless block. */ | |
1084 | keep_next_level (false); | |
1085 | } | |
f1dedc31 | 1086 | else |
325c3691 RH |
1087 | r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block); |
1088 | ||
5882f0f3 RH |
1089 | /* When processing a template, we need to remember where the braces were, |
1090 | so that we can set up identical scopes when instantiating the template | |
1091 | later. BIND_EXPR is a handy candidate for this. | |
1092 | Note that do_poplevel won't create a BIND_EXPR itself here (and thus | |
1093 | result in nested BIND_EXPRs), since we don't build BLOCK nodes when | |
1094 | processing templates. */ | |
1095 | if (processing_template_decl) | |
325c3691 | 1096 | { |
f293ce4b | 1097 | r = build3 (BIND_EXPR, NULL, NULL, r, NULL); |
5882f0f3 RH |
1098 | BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0; |
1099 | BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0; | |
325c3691 RH |
1100 | TREE_SIDE_EFFECTS (r) = 1; |
1101 | } | |
ad321293 MM |
1102 | |
1103 | return r; | |
1104 | } | |
1105 | ||
5882f0f3 | 1106 | /* Finish a compound-statement, which is given by STMT. */ |
ad321293 | 1107 | |
325c3691 RH |
1108 | void |
1109 | finish_compound_stmt (tree stmt) | |
ad321293 | 1110 | { |
5882f0f3 RH |
1111 | if (TREE_CODE (stmt) == BIND_EXPR) |
1112 | BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt)); | |
325c3691 RH |
1113 | else if (STATEMENT_LIST_NO_SCOPE (stmt)) |
1114 | stmt = pop_stmt_list (stmt); | |
7a3397c7 | 1115 | else |
5f070bc7 ZL |
1116 | { |
1117 | /* Destroy any ObjC "super" receivers that may have been | |
1118 | created. */ | |
1119 | objc_clear_super_receiver (); | |
1120 | ||
1121 | stmt = do_poplevel (stmt); | |
1122 | } | |
ad321293 | 1123 | |
325c3691 RH |
1124 | /* ??? See c_end_compound_stmt wrt statement expressions. */ |
1125 | add_stmt (stmt); | |
ad321293 | 1126 | finish_stmt (); |
ad321293 MM |
1127 | } |
1128 | ||
6de9cd9a DN |
1129 | /* Finish an asm-statement, whose components are a STRING, some |
1130 | OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note | |
1131 | whether the asm-statement should be considered volatile. */ | |
7dc5bd62 | 1132 | |
3e4d04a1 | 1133 | tree |
6de9cd9a DN |
1134 | finish_asm_stmt (int volatile_p, tree string, tree output_operands, |
1135 | tree input_operands, tree clobbers) | |
35b1567d BC |
1136 | { |
1137 | tree r; | |
abfc8a36 MM |
1138 | tree t; |
1139 | ||
abfc8a36 | 1140 | if (!processing_template_decl) |
40b18c0a MM |
1141 | { |
1142 | int i; | |
1143 | int ninputs; | |
1144 | int noutputs; | |
1145 | ||
1146 | for (t = input_operands; t; t = TREE_CHAIN (t)) | |
1147 | { | |
1148 | tree converted_operand | |
1149 | = decay_conversion (TREE_VALUE (t)); | |
1150 | ||
1151 | /* If the type of the operand hasn't been determined (e.g., | |
1152 | because it involves an overloaded function), then issue | |
1153 | an error message. There's no context available to | |
1154 | resolve the overloading. */ | |
1155 | if (TREE_TYPE (converted_operand) == unknown_type_node) | |
1156 | { | |
a82e1a7d GDR |
1157 | error ("type of asm operand %qE could not be determined", |
1158 | TREE_VALUE (t)); | |
40b18c0a MM |
1159 | converted_operand = error_mark_node; |
1160 | } | |
1161 | TREE_VALUE (t) = converted_operand; | |
1162 | } | |
1163 | ||
1164 | ninputs = list_length (input_operands); | |
1165 | noutputs = list_length (output_operands); | |
1166 | ||
1167 | for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i) | |
1168 | { | |
1169 | bool allows_mem; | |
1170 | bool allows_reg; | |
1171 | bool is_inout; | |
1172 | const char *constraint; | |
1173 | tree operand; | |
1174 | ||
84b72302 | 1175 | constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t))); |
28c56d25 | 1176 | operand = TREE_VALUE (t); |
40b18c0a MM |
1177 | |
1178 | if (!parse_output_constraint (&constraint, | |
1179 | i, ninputs, noutputs, | |
1180 | &allows_mem, | |
1181 | &allows_reg, | |
1182 | &is_inout)) | |
1183 | { | |
a723baf1 MM |
1184 | /* By marking this operand as erroneous, we will not try |
1185 | to process this operand again in expand_asm_operands. */ | |
1186 | TREE_VALUE (t) = error_mark_node; | |
40b18c0a MM |
1187 | continue; |
1188 | } | |
1189 | ||
1190 | /* If the operand is a DECL that is going to end up in | |
1191 | memory, assume it is addressable. This is a bit more | |
1192 | conservative than it would ideally be; the exact test is | |
1193 | buried deep in expand_asm_operands and depends on the | |
1194 | DECL_RTL for the OPERAND -- which we don't have at this | |
1195 | point. */ | |
1196 | if (!allows_reg && DECL_P (operand)) | |
dffd7eb6 | 1197 | cxx_mark_addressable (operand); |
40b18c0a MM |
1198 | } |
1199 | } | |
abfc8a36 | 1200 | |
e130a54b | 1201 | r = build_stmt (ASM_EXPR, string, |
0dfdeca6 BC |
1202 | output_operands, input_operands, |
1203 | clobbers); | |
6de9cd9a | 1204 | ASM_VOLATILE_P (r) = volatile_p; |
0ad28dde | 1205 | r = maybe_cleanup_point_expr_void (r); |
3e4d04a1 | 1206 | return add_stmt (r); |
ad321293 | 1207 | } |
b4c4a9ec | 1208 | |
f01b0acb MM |
1209 | /* Finish a label with the indicated NAME. */ |
1210 | ||
a723baf1 | 1211 | tree |
3a978d72 | 1212 | finish_label_stmt (tree name) |
f01b0acb | 1213 | { |
5b030314 | 1214 | tree decl = define_label (input_location, name); |
9e14e18f | 1215 | return add_stmt (build_stmt (LABEL_EXPR, decl)); |
f01b0acb MM |
1216 | } |
1217 | ||
acef433b MM |
1218 | /* Finish a series of declarations for local labels. G++ allows users |
1219 | to declare "local" labels, i.e., labels with scope. This extension | |
1220 | is useful when writing code involving statement-expressions. */ | |
1221 | ||
1222 | void | |
3a978d72 | 1223 | finish_label_decl (tree name) |
acef433b MM |
1224 | { |
1225 | tree decl = declare_local_label (name); | |
350fae66 | 1226 | add_decl_expr (decl); |
acef433b MM |
1227 | } |
1228 | ||
659e5a7a | 1229 | /* When DECL goes out of scope, make sure that CLEANUP is executed. */ |
f1dedc31 MM |
1230 | |
1231 | void | |
3a978d72 | 1232 | finish_decl_cleanup (tree decl, tree cleanup) |
f1dedc31 | 1233 | { |
325c3691 | 1234 | push_cleanup (decl, cleanup, false); |
35b1567d BC |
1235 | } |
1236 | ||
659e5a7a | 1237 | /* If the current scope exits with an exception, run CLEANUP. */ |
24bef158 | 1238 | |
659e5a7a | 1239 | void |
3a978d72 | 1240 | finish_eh_cleanup (tree cleanup) |
24bef158 | 1241 | { |
325c3691 | 1242 | push_cleanup (NULL, cleanup, true); |
35b1567d BC |
1243 | } |
1244 | ||
2282d28d MM |
1245 | /* The MEM_INITS is a list of mem-initializers, in reverse of the |
1246 | order they were written by the user. Each node is as for | |
1247 | emit_mem_initializers. */ | |
bf3428d0 MM |
1248 | |
1249 | void | |
2282d28d | 1250 | finish_mem_initializers (tree mem_inits) |
bf3428d0 | 1251 | { |
2282d28d MM |
1252 | /* Reorder the MEM_INITS so that they are in the order they appeared |
1253 | in the source program. */ | |
1254 | mem_inits = nreverse (mem_inits); | |
bf3428d0 | 1255 | |
a0de9d20 | 1256 | if (processing_template_decl) |
2282d28d | 1257 | add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits)); |
cdd2559c | 1258 | else |
2282d28d | 1259 | emit_mem_initializers (mem_inits); |
558475f0 MM |
1260 | } |
1261 | ||
b4c4a9ec MM |
1262 | /* Finish a parenthesized expression EXPR. */ |
1263 | ||
1264 | tree | |
3a978d72 | 1265 | finish_parenthesized_expr (tree expr) |
b4c4a9ec | 1266 | { |
6615c446 | 1267 | if (EXPR_P (expr)) |
78ef5b89 | 1268 | /* This inhibits warnings in c_common_truthvalue_conversion. */ |
31ec7d2f | 1269 | TREE_NO_WARNING (expr) = 1; |
b4c4a9ec | 1270 | |
19420d00 NS |
1271 | if (TREE_CODE (expr) == OFFSET_REF) |
1272 | /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be | |
1273 | enclosed in parentheses. */ | |
1274 | PTRMEM_OK_P (expr) = 0; | |
b4c4a9ec MM |
1275 | return expr; |
1276 | } | |
1277 | ||
a723baf1 MM |
1278 | /* Finish a reference to a non-static data member (DECL) that is not |
1279 | preceded by `.' or `->'. */ | |
1280 | ||
1281 | tree | |
a3f10e50 | 1282 | finish_non_static_data_member (tree decl, tree object, tree qualifying_scope) |
a723baf1 | 1283 | { |
50bc768d | 1284 | gcc_assert (TREE_CODE (decl) == FIELD_DECL); |
a723baf1 | 1285 | |
a3f10e50 | 1286 | if (!object) |
a723baf1 MM |
1287 | { |
1288 | if (current_function_decl | |
1289 | && DECL_STATIC_FUNCTION_P (current_function_decl)) | |
a82e1a7d | 1290 | cp_error_at ("invalid use of member %qD in static member function", |
a723baf1 MM |
1291 | decl); |
1292 | else | |
a82e1a7d | 1293 | cp_error_at ("invalid use of non-static data member %qD", decl); |
a723baf1 MM |
1294 | error ("from this location"); |
1295 | ||
1296 | return error_mark_node; | |
1297 | } | |
1298 | TREE_USED (current_class_ptr) = 1; | |
58e1d54c | 1299 | if (processing_template_decl && !qualifying_scope) |
a723baf1 | 1300 | { |
a3f10e50 | 1301 | tree type = TREE_TYPE (decl); |
a723baf1 | 1302 | |
a3f10e50 NS |
1303 | if (TREE_CODE (type) == REFERENCE_TYPE) |
1304 | type = TREE_TYPE (type); | |
1305 | else | |
1306 | { | |
f4f206f4 | 1307 | /* Set the cv qualifiers. */ |
a3f10e50 NS |
1308 | int quals = cp_type_quals (TREE_TYPE (current_class_ref)); |
1309 | ||
1310 | if (DECL_MUTABLE_P (decl)) | |
1311 | quals &= ~TYPE_QUAL_CONST; | |
9e95d15f | 1312 | |
a3f10e50 NS |
1313 | quals |= cp_type_quals (TREE_TYPE (decl)); |
1314 | type = cp_build_qualified_type (type, quals); | |
1315 | } | |
9e95d15f | 1316 | |
44de5aeb | 1317 | return build_min (COMPONENT_REF, type, object, decl, NULL_TREE); |
a3f10e50 NS |
1318 | } |
1319 | else | |
1320 | { | |
1321 | tree access_type = TREE_TYPE (object); | |
1322 | tree lookup_context = context_for_name_lookup (decl); | |
1323 | ||
1324 | while (!DERIVED_FROM_P (lookup_context, access_type)) | |
a723baf1 MM |
1325 | { |
1326 | access_type = TYPE_CONTEXT (access_type); | |
9f01ded6 | 1327 | while (access_type && DECL_P (access_type)) |
a723baf1 | 1328 | access_type = DECL_CONTEXT (access_type); |
a723baf1 | 1329 | |
a3f10e50 NS |
1330 | if (!access_type) |
1331 | { | |
a82e1a7d | 1332 | cp_error_at ("object missing in reference to %qD", decl); |
a3f10e50 NS |
1333 | error ("from this location"); |
1334 | return error_mark_node; | |
1335 | } | |
9f01ded6 KL |
1336 | } |
1337 | ||
5c425df5 | 1338 | /* If PROCESSING_TEMPLATE_DECL is nonzero here, then |
58e1d54c KL |
1339 | QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF |
1340 | for now. */ | |
1341 | if (processing_template_decl) | |
1342 | return build_min (SCOPE_REF, TREE_TYPE (decl), | |
1343 | qualifying_scope, DECL_NAME (decl)); | |
1344 | ||
6df5158a | 1345 | perform_or_defer_access_check (TYPE_BINFO (access_type), decl); |
a723baf1 MM |
1346 | |
1347 | /* If the data member was named `C::M', convert `*this' to `C' | |
1348 | first. */ | |
1349 | if (qualifying_scope) | |
1350 | { | |
1351 | tree binfo = NULL_TREE; | |
1352 | object = build_scoped_ref (object, qualifying_scope, | |
1353 | &binfo); | |
1354 | } | |
1355 | ||
1356 | return build_class_member_access_expr (object, decl, | |
1357 | /*access_path=*/NULL_TREE, | |
1358 | /*preserve_reference=*/false); | |
1359 | } | |
1360 | } | |
1361 | ||
ee76b931 MM |
1362 | /* DECL was the declaration to which a qualified-id resolved. Issue |
1363 | an error message if it is not accessible. If OBJECT_TYPE is | |
1364 | non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the | |
1365 | type of `*x', or `x', respectively. If the DECL was named as | |
1366 | `A::B' then NESTED_NAME_SPECIFIER is `A'. */ | |
1367 | ||
1368 | void | |
1369 | check_accessibility_of_qualified_id (tree decl, | |
1370 | tree object_type, | |
1371 | tree nested_name_specifier) | |
1372 | { | |
1373 | tree scope; | |
1374 | tree qualifying_type = NULL_TREE; | |
95b4aca6 | 1375 | |
77880ae4 | 1376 | /* If we're not checking, return immediately. */ |
95b4aca6 NS |
1377 | if (deferred_access_no_check) |
1378 | return; | |
ee76b931 MM |
1379 | |
1380 | /* Determine the SCOPE of DECL. */ | |
1381 | scope = context_for_name_lookup (decl); | |
1382 | /* If the SCOPE is not a type, then DECL is not a member. */ | |
1383 | if (!TYPE_P (scope)) | |
1384 | return; | |
1385 | /* Compute the scope through which DECL is being accessed. */ | |
1386 | if (object_type | |
1387 | /* OBJECT_TYPE might not be a class type; consider: | |
1388 | ||
1389 | class A { typedef int I; }; | |
1390 | I *p; | |
1391 | p->A::I::~I(); | |
1392 | ||
1393 | In this case, we will have "A::I" as the DECL, but "I" as the | |
1394 | OBJECT_TYPE. */ | |
1395 | && CLASS_TYPE_P (object_type) | |
1396 | && DERIVED_FROM_P (scope, object_type)) | |
1397 | /* If we are processing a `->' or `.' expression, use the type of the | |
1398 | left-hand side. */ | |
1399 | qualifying_type = object_type; | |
1400 | else if (nested_name_specifier) | |
1401 | { | |
1402 | /* If the reference is to a non-static member of the | |
1403 | current class, treat it as if it were referenced through | |
1404 | `this'. */ | |
1405 | if (DECL_NONSTATIC_MEMBER_P (decl) | |
1406 | && current_class_ptr | |
1407 | && DERIVED_FROM_P (scope, current_class_type)) | |
1408 | qualifying_type = current_class_type; | |
1409 | /* Otherwise, use the type indicated by the | |
1410 | nested-name-specifier. */ | |
1411 | else | |
1412 | qualifying_type = nested_name_specifier; | |
1413 | } | |
1414 | else | |
1415 | /* Otherwise, the name must be from the current class or one of | |
1416 | its bases. */ | |
1417 | qualifying_type = currently_open_derived_class (scope); | |
1418 | ||
c645999e NS |
1419 | if (qualifying_type && IS_AGGR_TYPE_CODE (TREE_CODE (qualifying_type))) |
1420 | /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM | |
1421 | or similar in a default argument value. */ | |
ee76b931 MM |
1422 | perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl); |
1423 | } | |
1424 | ||
1425 | /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the | |
1426 | class named to the left of the "::" operator. DONE is true if this | |
1427 | expression is a complete postfix-expression; it is false if this | |
1428 | expression is followed by '->', '[', '(', etc. ADDRESS_P is true | |
1429 | iff this expression is the operand of '&'. */ | |
1430 | ||
1431 | tree | |
1432 | finish_qualified_id_expr (tree qualifying_class, tree expr, bool done, | |
1433 | bool address_p) | |
1434 | { | |
5e08432e MM |
1435 | if (error_operand_p (expr)) |
1436 | return error_mark_node; | |
1437 | ||
ee76b931 MM |
1438 | /* If EXPR occurs as the operand of '&', use special handling that |
1439 | permits a pointer-to-member. */ | |
1440 | if (address_p && done) | |
1441 | { | |
1442 | if (TREE_CODE (expr) == SCOPE_REF) | |
1443 | expr = TREE_OPERAND (expr, 1); | |
a5ac359a MM |
1444 | expr = build_offset_ref (qualifying_class, expr, |
1445 | /*address_p=*/true); | |
ee76b931 MM |
1446 | return expr; |
1447 | } | |
1448 | ||
1449 | if (TREE_CODE (expr) == FIELD_DECL) | |
a3f10e50 NS |
1450 | expr = finish_non_static_data_member (expr, current_class_ref, |
1451 | qualifying_class); | |
ee76b931 MM |
1452 | else if (BASELINK_P (expr) && !processing_template_decl) |
1453 | { | |
ee76b931 MM |
1454 | tree fns; |
1455 | ||
1456 | /* See if any of the functions are non-static members. */ | |
1457 | fns = BASELINK_FUNCTIONS (expr); | |
1458 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) | |
1459 | fns = TREE_OPERAND (fns, 0); | |
ee76b931 MM |
1460 | /* If so, the expression may be relative to the current |
1461 | class. */ | |
821eaf2a MM |
1462 | if (!shared_member_p (fns) |
1463 | && current_class_type | |
ee76b931 MM |
1464 | && DERIVED_FROM_P (qualifying_class, current_class_type)) |
1465 | expr = (build_class_member_access_expr | |
1466 | (maybe_dummy_object (qualifying_class, NULL), | |
1467 | expr, | |
1468 | BASELINK_ACCESS_BINFO (expr), | |
1469 | /*preserve_reference=*/false)); | |
1470 | else if (done) | |
a5ac359a MM |
1471 | /* The expression is a qualified name whose address is not |
1472 | being taken. */ | |
1473 | expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false); | |
ee76b931 MM |
1474 | } |
1475 | ||
1476 | return expr; | |
1477 | } | |
1478 | ||
b69b1501 MM |
1479 | /* Begin a statement-expression. The value returned must be passed to |
1480 | finish_stmt_expr. */ | |
b4c4a9ec MM |
1481 | |
1482 | tree | |
3a978d72 | 1483 | begin_stmt_expr (void) |
b4c4a9ec | 1484 | { |
325c3691 | 1485 | return push_stmt_list (); |
35b1567d BC |
1486 | } |
1487 | ||
a5bcc582 NS |
1488 | /* Process the final expression of a statement expression. EXPR can be |
1489 | NULL, if the final expression is empty. Build up a TARGET_EXPR so | |
1490 | that the result value can be safely returned to the enclosing | |
1491 | expression. */ | |
1492 | ||
1493 | tree | |
325c3691 | 1494 | finish_stmt_expr_expr (tree expr, tree stmt_expr) |
a5bcc582 NS |
1495 | { |
1496 | tree result = NULL_TREE; | |
a5bcc582 NS |
1497 | |
1498 | if (expr) | |
1499 | { | |
a5bcc582 NS |
1500 | if (!processing_template_decl && !VOID_TYPE_P (TREE_TYPE (expr))) |
1501 | { | |
2692eb7d JM |
1502 | tree type = TREE_TYPE (expr); |
1503 | ||
a5bcc582 NS |
1504 | if (TREE_CODE (type) == ARRAY_TYPE |
1505 | || TREE_CODE (type) == FUNCTION_TYPE) | |
1506 | expr = decay_conversion (expr); | |
1507 | ||
a5bcc582 NS |
1508 | expr = require_complete_type (expr); |
1509 | ||
2692eb7d JM |
1510 | type = TREE_TYPE (expr); |
1511 | ||
a5bcc582 NS |
1512 | /* Build a TARGET_EXPR for this aggregate. finish_stmt_expr |
1513 | will then pull it apart so the lifetime of the target is | |
cd0be382 | 1514 | within the scope of the expression containing this statement |
a5bcc582 NS |
1515 | expression. */ |
1516 | if (TREE_CODE (expr) == TARGET_EXPR) | |
1517 | ; | |
1518 | else if (!IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_INIT_REF (type)) | |
1519 | expr = build_target_expr_with_type (expr, type); | |
1520 | else | |
1521 | { | |
1522 | /* Copy construct. */ | |
1523 | expr = build_special_member_call | |
1524 | (NULL_TREE, complete_ctor_identifier, | |
1525 | build_tree_list (NULL_TREE, expr), | |
cad7e87b | 1526 | type, LOOKUP_NORMAL); |
a5bcc582 | 1527 | expr = build_cplus_new (type, expr); |
50bc768d | 1528 | gcc_assert (TREE_CODE (expr) == TARGET_EXPR); |
a5bcc582 NS |
1529 | } |
1530 | } | |
1531 | ||
1532 | if (expr != error_mark_node) | |
1533 | { | |
1534 | result = build_stmt (EXPR_STMT, expr); | |
325c3691 | 1535 | EXPR_STMT_STMT_EXPR_RESULT (result) = 1; |
a5bcc582 NS |
1536 | add_stmt (result); |
1537 | } | |
1538 | } | |
1539 | ||
1540 | finish_stmt (); | |
1541 | ||
325c3691 RH |
1542 | /* Remember the last expression so that finish_stmt_expr |
1543 | can pull it apart. */ | |
1544 | TREE_TYPE (stmt_expr) = result; | |
a5bcc582 NS |
1545 | |
1546 | return result; | |
1547 | } | |
1548 | ||
303b7406 NS |
1549 | /* Finish a statement-expression. EXPR should be the value returned |
1550 | by the previous begin_stmt_expr. Returns an expression | |
1551 | representing the statement-expression. */ | |
b4c4a9ec MM |
1552 | |
1553 | tree | |
325c3691 | 1554 | finish_stmt_expr (tree stmt_expr, bool has_no_scope) |
b4c4a9ec | 1555 | { |
325c3691 RH |
1556 | tree result, result_stmt, type; |
1557 | tree *result_stmt_p = NULL; | |
1558 | ||
1559 | result_stmt = TREE_TYPE (stmt_expr); | |
1560 | TREE_TYPE (stmt_expr) = void_type_node; | |
1561 | result = pop_stmt_list (stmt_expr); | |
1562 | ||
1563 | if (!result_stmt || VOID_TYPE_P (result_stmt)) | |
a5bcc582 NS |
1564 | type = void_type_node; |
1565 | else | |
1566 | { | |
325c3691 RH |
1567 | /* We need to search the statement expression for the result_stmt, |
1568 | since we'll need to replace it entirely. */ | |
1569 | tree t; | |
1570 | result_stmt_p = &result; | |
1571 | while (1) | |
a5bcc582 | 1572 | { |
325c3691 RH |
1573 | t = *result_stmt_p; |
1574 | if (t == result_stmt) | |
1575 | break; | |
1576 | ||
1577 | switch (TREE_CODE (t)) | |
1578 | { | |
1579 | case STATEMENT_LIST: | |
1580 | { | |
1581 | tree_stmt_iterator i = tsi_last (t); | |
1582 | result_stmt_p = tsi_stmt_ptr (i); | |
1583 | break; | |
1584 | } | |
1585 | case BIND_EXPR: | |
1586 | result_stmt_p = &BIND_EXPR_BODY (t); | |
1587 | break; | |
325c3691 RH |
1588 | case TRY_FINALLY_EXPR: |
1589 | case TRY_CATCH_EXPR: | |
1590 | case CLEANUP_STMT: | |
1591 | result_stmt_p = &TREE_OPERAND (t, 0); | |
1592 | break; | |
1593 | default: | |
315fb5db | 1594 | gcc_unreachable (); |
325c3691 | 1595 | } |
a5bcc582 | 1596 | } |
325c3691 | 1597 | type = TREE_TYPE (EXPR_STMT_EXPR (result_stmt)); |
a5bcc582 | 1598 | } |
6f80451c | 1599 | |
a5bcc582 | 1600 | if (processing_template_decl) |
325c3691 RH |
1601 | { |
1602 | result = build_min (STMT_EXPR, type, result); | |
1603 | TREE_SIDE_EFFECTS (result) = 1; | |
1604 | STMT_EXPR_NO_SCOPE (result) = has_no_scope; | |
1605 | } | |
1606 | else if (!VOID_TYPE_P (type)) | |
a5bcc582 NS |
1607 | { |
1608 | /* Pull out the TARGET_EXPR that is the final expression. Put | |
1609 | the target's init_expr as the final expression and then put | |
1610 | the statement expression itself as the target's init | |
1611 | expr. Finally, return the target expression. */ | |
2692eb7d | 1612 | tree init, target_expr = EXPR_STMT_EXPR (result_stmt); |
50bc768d | 1613 | gcc_assert (TREE_CODE (target_expr) == TARGET_EXPR); |
2692eb7d JM |
1614 | |
1615 | /* The initializer will be void if the initialization is done by | |
1616 | AGGR_INIT_EXPR; propagate that out to the statement-expression as | |
1617 | a whole. */ | |
1618 | init = TREE_OPERAND (target_expr, 1); | |
1619 | type = TREE_TYPE (init); | |
1620 | ||
543a0daa | 1621 | init = maybe_cleanup_point_expr (init); |
2692eb7d JM |
1622 | *result_stmt_p = init; |
1623 | ||
1624 | if (VOID_TYPE_P (type)) | |
1625 | /* No frobbing needed. */; | |
1626 | else if (TREE_CODE (result) == BIND_EXPR) | |
325c3691 | 1627 | { |
2692eb7d JM |
1628 | /* The BIND_EXPR created in finish_compound_stmt is void; if we're |
1629 | returning a value directly, give it the appropriate type. */ | |
325c3691 | 1630 | if (VOID_TYPE_P (TREE_TYPE (result))) |
2692eb7d | 1631 | TREE_TYPE (result) = type; |
325c3691 | 1632 | else |
315fb5db | 1633 | gcc_assert (same_type_p (TREE_TYPE (result), type)); |
325c3691 RH |
1634 | } |
1635 | else if (TREE_CODE (result) == STATEMENT_LIST) | |
2692eb7d JM |
1636 | /* We need to wrap a STATEMENT_LIST in a BIND_EXPR so it can have a |
1637 | type other than void. FIXME why can't we just return a value | |
1638 | from STATEMENT_LIST? */ | |
1639 | result = build3 (BIND_EXPR, type, NULL, result, NULL); | |
325c3691 | 1640 | |
2692eb7d JM |
1641 | TREE_OPERAND (target_expr, 1) = result; |
1642 | result = target_expr; | |
a5bcc582 | 1643 | } |
325c3691 | 1644 | |
b4c4a9ec MM |
1645 | return result; |
1646 | } | |
1647 | ||
b3445994 | 1648 | /* Perform Koenig lookup. FN is the postfix-expression representing |
fa531100 MM |
1649 | the function (or functions) to call; ARGS are the arguments to the |
1650 | call. Returns the functions to be considered by overload | |
1651 | resolution. */ | |
b3445994 MM |
1652 | |
1653 | tree | |
1654 | perform_koenig_lookup (tree fn, tree args) | |
1655 | { | |
1656 | tree identifier = NULL_TREE; | |
1657 | tree functions = NULL_TREE; | |
1658 | ||
1659 | /* Find the name of the overloaded function. */ | |
1660 | if (TREE_CODE (fn) == IDENTIFIER_NODE) | |
1661 | identifier = fn; | |
1662 | else if (is_overloaded_fn (fn)) | |
1663 | { | |
1664 | functions = fn; | |
1665 | identifier = DECL_NAME (get_first_fn (functions)); | |
1666 | } | |
1667 | else if (DECL_P (fn)) | |
1668 | { | |
1669 | functions = fn; | |
1670 | identifier = DECL_NAME (fn); | |
1671 | } | |
1672 | ||
1673 | /* A call to a namespace-scope function using an unqualified name. | |
1674 | ||
1675 | Do Koenig lookup -- unless any of the arguments are | |
1676 | type-dependent. */ | |
1677 | if (!any_type_dependent_arguments_p (args)) | |
1678 | { | |
1679 | fn = lookup_arg_dependent (identifier, functions, args); | |
1680 | if (!fn) | |
1681 | /* The unqualified name could not be resolved. */ | |
1682 | fn = unqualified_fn_lookup_error (identifier); | |
1683 | } | |
1684 | else | |
10b1d5e7 | 1685 | fn = identifier; |
b3445994 MM |
1686 | |
1687 | return fn; | |
1688 | } | |
1689 | ||
4ba126e4 MM |
1690 | /* Generate an expression for `FN (ARGS)'. |
1691 | ||
1692 | If DISALLOW_VIRTUAL is true, the call to FN will be not generated | |
1693 | as a virtual call, even if FN is virtual. (This flag is set when | |
1694 | encountering an expression where the function name is explicitly | |
1695 | qualified. For example a call to `X::f' never generates a virtual | |
1696 | call.) | |
1697 | ||
1698 | Returns code for the call. */ | |
b4c4a9ec MM |
1699 | |
1700 | tree | |
6d80c4b9 | 1701 | finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p) |
b4c4a9ec | 1702 | { |
d17811fd MM |
1703 | tree result; |
1704 | tree orig_fn; | |
1705 | tree orig_args; | |
1706 | ||
4ba126e4 MM |
1707 | if (fn == error_mark_node || args == error_mark_node) |
1708 | return error_mark_node; | |
1709 | ||
4ba126e4 | 1710 | /* ARGS should be a list of arguments. */ |
50bc768d | 1711 | gcc_assert (!args || TREE_CODE (args) == TREE_LIST); |
a759e627 | 1712 | |
d17811fd MM |
1713 | orig_fn = fn; |
1714 | orig_args = args; | |
1715 | ||
1716 | if (processing_template_decl) | |
1717 | { | |
1718 | if (type_dependent_expression_p (fn) | |
1719 | || any_type_dependent_arguments_p (args)) | |
6d80c4b9 | 1720 | { |
6de9cd9a | 1721 | result = build_nt (CALL_EXPR, fn, args, NULL_TREE); |
6d80c4b9 MM |
1722 | KOENIG_LOOKUP_P (result) = koenig_p; |
1723 | return result; | |
1724 | } | |
d17811fd MM |
1725 | if (!BASELINK_P (fn) |
1726 | && TREE_CODE (fn) != PSEUDO_DTOR_EXPR | |
1727 | && TREE_TYPE (fn) != unknown_type_node) | |
1728 | fn = build_non_dependent_expr (fn); | |
1729 | args = build_non_dependent_args (orig_args); | |
1730 | } | |
1731 | ||
a723baf1 MM |
1732 | /* A reference to a member function will appear as an overloaded |
1733 | function (rather than a BASELINK) if an unqualified name was used | |
1734 | to refer to it. */ | |
1735 | if (!BASELINK_P (fn) && is_overloaded_fn (fn)) | |
1736 | { | |
12483c9f | 1737 | tree f = fn; |
a723baf1 | 1738 | |
12483c9f NS |
1739 | if (TREE_CODE (f) == TEMPLATE_ID_EXPR) |
1740 | f = TREE_OPERAND (f, 0); | |
1741 | f = get_first_fn (f); | |
a723baf1 MM |
1742 | if (DECL_FUNCTION_MEMBER_P (f)) |
1743 | { | |
1744 | tree type = currently_open_derived_class (DECL_CONTEXT (f)); | |
c44e68a5 KL |
1745 | if (!type) |
1746 | type = DECL_CONTEXT (f); | |
a723baf1 MM |
1747 | fn = build_baselink (TYPE_BINFO (type), |
1748 | TYPE_BINFO (type), | |
1749 | fn, /*optype=*/NULL_TREE); | |
1750 | } | |
1751 | } | |
1752 | ||
d17811fd | 1753 | result = NULL_TREE; |
4ba126e4 | 1754 | if (BASELINK_P (fn)) |
03d82991 | 1755 | { |
4ba126e4 MM |
1756 | tree object; |
1757 | ||
1758 | /* A call to a member function. From [over.call.func]: | |
1759 | ||
1760 | If the keyword this is in scope and refers to the class of | |
1761 | that member function, or a derived class thereof, then the | |
1762 | function call is transformed into a qualified function call | |
1763 | using (*this) as the postfix-expression to the left of the | |
1764 | . operator.... [Otherwise] a contrived object of type T | |
1765 | becomes the implied object argument. | |
1766 | ||
1767 | This paragraph is unclear about this situation: | |
1768 | ||
1769 | struct A { void f(); }; | |
1770 | struct B : public A {}; | |
1771 | struct C : public A { void g() { B::f(); }}; | |
1772 | ||
1773 | In particular, for `B::f', this paragraph does not make clear | |
1774 | whether "the class of that member function" refers to `A' or | |
1775 | to `B'. We believe it refers to `B'. */ | |
1776 | if (current_class_type | |
1777 | && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)), | |
1778 | current_class_type) | |
1779 | && current_class_ref) | |
127b8136 MM |
1780 | object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)), |
1781 | NULL); | |
4ba126e4 MM |
1782 | else |
1783 | { | |
1784 | tree representative_fn; | |
b4c4a9ec | 1785 | |
4ba126e4 MM |
1786 | representative_fn = BASELINK_FUNCTIONS (fn); |
1787 | if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR) | |
1788 | representative_fn = TREE_OPERAND (representative_fn, 0); | |
1789 | representative_fn = get_first_fn (representative_fn); | |
1790 | object = build_dummy_object (DECL_CONTEXT (representative_fn)); | |
1791 | } | |
b4c4a9ec | 1792 | |
d17811fd MM |
1793 | if (processing_template_decl) |
1794 | { | |
1795 | if (type_dependent_expression_p (object)) | |
6de9cd9a | 1796 | return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE); |
d17811fd MM |
1797 | object = build_non_dependent_expr (object); |
1798 | } | |
1799 | ||
1800 | result = build_new_method_call (object, fn, args, NULL_TREE, | |
1801 | (disallow_virtual | |
1802 | ? LOOKUP_NONVIRTUAL : 0)); | |
4ba126e4 MM |
1803 | } |
1804 | else if (is_overloaded_fn (fn)) | |
1805 | /* A call to a namespace-scope function. */ | |
d17811fd | 1806 | result = build_new_function_call (fn, args); |
a723baf1 MM |
1807 | else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR) |
1808 | { | |
a723baf1 MM |
1809 | if (args) |
1810 | error ("arguments to destructor are not allowed"); | |
1811 | /* Mark the pseudo-destructor call as having side-effects so | |
1812 | that we do not issue warnings about its use. */ | |
1813 | result = build1 (NOP_EXPR, | |
1814 | void_type_node, | |
1815 | TREE_OPERAND (fn, 0)); | |
1816 | TREE_SIDE_EFFECTS (result) = 1; | |
a723baf1 | 1817 | } |
4ba126e4 | 1818 | else if (CLASS_TYPE_P (TREE_TYPE (fn))) |
d17811fd MM |
1819 | /* If the "function" is really an object of class type, it might |
1820 | have an overloaded `operator ()'. */ | |
ec835fb2 MM |
1821 | result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE, |
1822 | /*overloaded_p=*/NULL); | |
d17811fd MM |
1823 | if (!result) |
1824 | /* A call where the function is unknown. */ | |
1825 | result = build_function_call (fn, args); | |
4ba126e4 | 1826 | |
d17811fd | 1827 | if (processing_template_decl) |
6d80c4b9 | 1828 | { |
f293ce4b RS |
1829 | result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn, |
1830 | orig_args, NULL_TREE); | |
6d80c4b9 MM |
1831 | KOENIG_LOOKUP_P (result) = koenig_p; |
1832 | } | |
d17811fd | 1833 | return result; |
b4c4a9ec MM |
1834 | } |
1835 | ||
1836 | /* Finish a call to a postfix increment or decrement or EXPR. (Which | |
1837 | is indicated by CODE, which should be POSTINCREMENT_EXPR or | |
1838 | POSTDECREMENT_EXPR.) */ | |
1839 | ||
1840 | tree | |
3a978d72 | 1841 | finish_increment_expr (tree expr, enum tree_code code) |
b4c4a9ec | 1842 | { |
b4c4a9ec MM |
1843 | return build_x_unary_op (code, expr); |
1844 | } | |
1845 | ||
1846 | /* Finish a use of `this'. Returns an expression for `this'. */ | |
1847 | ||
1848 | tree | |
3a978d72 | 1849 | finish_this_expr (void) |
b4c4a9ec MM |
1850 | { |
1851 | tree result; | |
1852 | ||
1853 | if (current_class_ptr) | |
1854 | { | |
b4c4a9ec MM |
1855 | result = current_class_ptr; |
1856 | } | |
1857 | else if (current_function_decl | |
1858 | && DECL_STATIC_FUNCTION_P (current_function_decl)) | |
1859 | { | |
9e637a26 | 1860 | error ("%<this%> is unavailable for static member functions"); |
b4c4a9ec MM |
1861 | result = error_mark_node; |
1862 | } | |
1863 | else | |
1864 | { | |
1865 | if (current_function_decl) | |
9e637a26 | 1866 | error ("invalid use of %<this%> in non-member function"); |
b4c4a9ec | 1867 | else |
9e637a26 | 1868 | error ("invalid use of %<this%> at top level"); |
b4c4a9ec MM |
1869 | result = error_mark_node; |
1870 | } | |
1871 | ||
1872 | return result; | |
1873 | } | |
1874 | ||
a723baf1 MM |
1875 | /* Finish a pseudo-destructor expression. If SCOPE is NULL, the |
1876 | expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is | |
1877 | the TYPE for the type given. If SCOPE is non-NULL, the expression | |
1878 | was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */ | |
b4c4a9ec MM |
1879 | |
1880 | tree | |
3a978d72 | 1881 | finish_pseudo_destructor_expr (tree object, tree scope, tree destructor) |
b4c4a9ec | 1882 | { |
a723baf1 MM |
1883 | if (destructor == error_mark_node) |
1884 | return error_mark_node; | |
40242ccf | 1885 | |
50bc768d | 1886 | gcc_assert (TYPE_P (destructor)); |
b4c4a9ec | 1887 | |
a723baf1 MM |
1888 | if (!processing_template_decl) |
1889 | { | |
1890 | if (scope == error_mark_node) | |
1891 | { | |
1892 | error ("invalid qualifying scope in pseudo-destructor name"); | |
1893 | return error_mark_node; | |
1894 | } | |
1895 | ||
26bcf8fc MM |
1896 | /* [expr.pseudo] says both: |
1897 | ||
1898 | The type designated by the pseudo-destructor-name shall be | |
1899 | the same as the object type. | |
1900 | ||
1901 | and: | |
1902 | ||
1903 | The cv-unqualified versions of the object type and of the | |
1904 | type designated by the pseudo-destructor-name shall be the | |
1905 | same type. | |
1906 | ||
1907 | We implement the more generous second sentence, since that is | |
1908 | what most other compilers do. */ | |
1909 | if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object), | |
1910 | destructor)) | |
a723baf1 | 1911 | { |
a82e1a7d | 1912 | error ("%qE is not of type %qT", object, destructor); |
a723baf1 MM |
1913 | return error_mark_node; |
1914 | } | |
1915 | } | |
b4c4a9ec | 1916 | |
f293ce4b | 1917 | return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor); |
b4c4a9ec MM |
1918 | } |
1919 | ||
ce4a0391 MM |
1920 | /* Finish an expression of the form CODE EXPR. */ |
1921 | ||
1922 | tree | |
3a978d72 | 1923 | finish_unary_op_expr (enum tree_code code, tree expr) |
ce4a0391 MM |
1924 | { |
1925 | tree result = build_x_unary_op (code, expr); | |
7c355bca ML |
1926 | /* Inside a template, build_x_unary_op does not fold the |
1927 | expression. So check whether the result is folded before | |
1928 | setting TREE_NEGATED_INT. */ | |
1929 | if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST | |
88b4335f | 1930 | && TREE_CODE (result) == INTEGER_CST |
8df83eae | 1931 | && !TYPE_UNSIGNED (TREE_TYPE (result)) |
88b4335f | 1932 | && INT_CST_LT (result, integer_zero_node)) |
ce4a0391 MM |
1933 | TREE_NEGATED_INT (result) = 1; |
1934 | overflow_warning (result); | |
1935 | return result; | |
1936 | } | |
1937 | ||
a723baf1 MM |
1938 | /* Finish a compound-literal expression. TYPE is the type to which |
1939 | the INITIALIZER_LIST is being cast. */ | |
1940 | ||
1941 | tree | |
3a978d72 | 1942 | finish_compound_literal (tree type, tree initializer_list) |
a723baf1 MM |
1943 | { |
1944 | tree compound_literal; | |
1945 | ||
1946 | /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */ | |
dcf92453 | 1947 | compound_literal = build_constructor (NULL_TREE, initializer_list); |
a723baf1 MM |
1948 | /* Mark it as a compound-literal. */ |
1949 | TREE_HAS_CONSTRUCTOR (compound_literal) = 1; | |
1950 | if (processing_template_decl) | |
1951 | TREE_TYPE (compound_literal) = type; | |
1952 | else | |
1953 | { | |
1954 | /* Check the initialization. */ | |
1955 | compound_literal = digest_init (type, compound_literal, NULL); | |
1956 | /* If the TYPE was an array type with an unknown bound, then we can | |
1957 | figure out the dimension now. For example, something like: | |
1958 | ||
1959 | `(int []) { 2, 3 }' | |
1960 | ||
1961 | implies that the array has two elements. */ | |
1962 | if (TREE_CODE (type) == ARRAY_TYPE && !COMPLETE_TYPE_P (type)) | |
1963 | complete_array_type (type, compound_literal, 1); | |
1964 | } | |
1965 | ||
1966 | return compound_literal; | |
1967 | } | |
1968 | ||
5f261ba9 MM |
1969 | /* Return the declaration for the function-name variable indicated by |
1970 | ID. */ | |
1971 | ||
1972 | tree | |
1973 | finish_fname (tree id) | |
1974 | { | |
1975 | tree decl; | |
1976 | ||
1977 | decl = fname_decl (C_RID_CODE (id), id); | |
1978 | if (processing_template_decl) | |
10b1d5e7 | 1979 | decl = DECL_NAME (decl); |
5f261ba9 MM |
1980 | return decl; |
1981 | } | |
1982 | ||
8014a339 | 1983 | /* Finish a translation unit. */ |
ce4a0391 MM |
1984 | |
1985 | void | |
3a978d72 | 1986 | finish_translation_unit (void) |
ce4a0391 MM |
1987 | { |
1988 | /* In case there were missing closebraces, | |
1989 | get us back to the global binding level. */ | |
273a708f | 1990 | pop_everything (); |
ce4a0391 MM |
1991 | while (current_namespace != global_namespace) |
1992 | pop_namespace (); | |
0ba8a114 | 1993 | |
c6002625 | 1994 | /* Do file scope __FUNCTION__ et al. */ |
0ba8a114 | 1995 | finish_fname_decls (); |
ce4a0391 MM |
1996 | } |
1997 | ||
b4c4a9ec MM |
1998 | /* Finish a template type parameter, specified as AGGR IDENTIFIER. |
1999 | Returns the parameter. */ | |
2000 | ||
2001 | tree | |
3a978d72 | 2002 | finish_template_type_parm (tree aggr, tree identifier) |
b4c4a9ec | 2003 | { |
6eabb241 | 2004 | if (aggr != class_type_node) |
b4c4a9ec | 2005 | { |
9e637a26 | 2006 | pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>"); |
b4c4a9ec MM |
2007 | aggr = class_type_node; |
2008 | } | |
2009 | ||
2010 | return build_tree_list (aggr, identifier); | |
2011 | } | |
2012 | ||
2013 | /* Finish a template template parameter, specified as AGGR IDENTIFIER. | |
2014 | Returns the parameter. */ | |
2015 | ||
2016 | tree | |
3a978d72 | 2017 | finish_template_template_parm (tree aggr, tree identifier) |
b4c4a9ec MM |
2018 | { |
2019 | tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE); | |
2020 | tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE); | |
2021 | DECL_TEMPLATE_PARMS (tmpl) = current_template_parms; | |
2022 | DECL_TEMPLATE_RESULT (tmpl) = decl; | |
c727aa5e | 2023 | DECL_ARTIFICIAL (decl) = 1; |
b4c4a9ec MM |
2024 | end_template_decl (); |
2025 | ||
50bc768d | 2026 | gcc_assert (DECL_TEMPLATE_PARMS (tmpl)); |
b37bf5bd | 2027 | |
b4c4a9ec MM |
2028 | return finish_template_type_parm (aggr, tmpl); |
2029 | } | |
ce4a0391 | 2030 | |
8ba658ee MM |
2031 | /* ARGUMENT is the default-argument value for a template template |
2032 | parameter. If ARGUMENT is invalid, issue error messages and return | |
2033 | the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */ | |
2034 | ||
2035 | tree | |
2036 | check_template_template_default_arg (tree argument) | |
2037 | { | |
2038 | if (TREE_CODE (argument) != TEMPLATE_DECL | |
2039 | && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM | |
8ba658ee MM |
2040 | && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE) |
2041 | { | |
a3a503a5 GB |
2042 | if (TREE_CODE (argument) == TYPE_DECL) |
2043 | { | |
2044 | tree t = TREE_TYPE (argument); | |
2045 | ||
2046 | /* Try to emit a slightly smarter error message if we detect | |
2047 | that the user is using a template instantiation. */ | |
2048 | if (CLASSTYPE_TEMPLATE_INFO (t) | |
2049 | && CLASSTYPE_TEMPLATE_INSTANTIATION (t)) | |
a82e1a7d | 2050 | error ("invalid use of type %qT as a default value for a " |
a3a503a5 GB |
2051 | "template template-parameter", t); |
2052 | else | |
a82e1a7d | 2053 | error ("invalid use of %qD as a default value for a template " |
a3a503a5 GB |
2054 | "template-parameter", argument); |
2055 | } | |
2056 | else | |
2057 | error ("invalid default argument for a template template parameter"); | |
8ba658ee MM |
2058 | return error_mark_node; |
2059 | } | |
2060 | ||
2061 | return argument; | |
2062 | } | |
2063 | ||
ce4a0391 MM |
2064 | /* Begin a class definition, as indicated by T. */ |
2065 | ||
2066 | tree | |
3a978d72 | 2067 | begin_class_definition (tree t) |
ce4a0391 | 2068 | { |
7437519c ZW |
2069 | if (t == error_mark_node) |
2070 | return error_mark_node; | |
2071 | ||
522d6614 NS |
2072 | if (processing_template_parmlist) |
2073 | { | |
a82e1a7d | 2074 | error ("definition of %q#T inside template parameter list", t); |
522d6614 NS |
2075 | return error_mark_node; |
2076 | } | |
47ee8904 MM |
2077 | /* A non-implicit typename comes from code like: |
2078 | ||
2079 | template <typename T> struct A { | |
2080 | template <typename U> struct A<T>::B ... | |
2081 | ||
2082 | This is erroneous. */ | |
2083 | else if (TREE_CODE (t) == TYPENAME_TYPE) | |
2084 | { | |
a82e1a7d | 2085 | error ("invalid definition of qualified type %qT", t); |
47ee8904 MM |
2086 | t = error_mark_node; |
2087 | } | |
2088 | ||
2089 | if (t == error_mark_node || ! IS_AGGR_TYPE (t)) | |
ce4a0391 | 2090 | { |
33848bb0 | 2091 | t = make_aggr_type (RECORD_TYPE); |
ce4a0391 MM |
2092 | pushtag (make_anon_name (), t, 0); |
2093 | } | |
830fcda8 | 2094 | |
4c571114 MM |
2095 | /* If this type was already complete, and we see another definition, |
2096 | that's an error. */ | |
8fbc5ae7 | 2097 | if (COMPLETE_TYPE_P (t)) |
4223f82f | 2098 | { |
a82e1a7d GDR |
2099 | error ("redefinition of %q#T", t); |
2100 | cp_error_at ("previous definition of %q#T", t); | |
4223f82f MM |
2101 | return error_mark_node; |
2102 | } | |
4c571114 | 2103 | |
b4f70b3d | 2104 | /* Update the location of the decl. */ |
f31686a3 | 2105 | DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location; |
b4f70b3d | 2106 | |
4c571114 | 2107 | if (TYPE_BEING_DEFINED (t)) |
ce4a0391 | 2108 | { |
33848bb0 | 2109 | t = make_aggr_type (TREE_CODE (t)); |
ce4a0391 | 2110 | pushtag (TYPE_IDENTIFIER (t), t, 0); |
ce4a0391 | 2111 | } |
ff350acd | 2112 | maybe_process_partial_specialization (t); |
29370796 | 2113 | pushclass (t); |
ce4a0391 | 2114 | TYPE_BEING_DEFINED (t) = 1; |
c0694c4b MM |
2115 | if (flag_pack_struct) |
2116 | { | |
2117 | tree v; | |
2118 | TYPE_PACKED (t) = 1; | |
2119 | /* Even though the type is being defined for the first time | |
2120 | here, there might have been a forward declaration, so there | |
2121 | might be cv-qualified variants of T. */ | |
2122 | for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v)) | |
2123 | TYPE_PACKED (v) = 1; | |
2124 | } | |
ce4a0391 MM |
2125 | /* Reset the interface data, at the earliest possible |
2126 | moment, as it might have been set via a class foo; | |
2127 | before. */ | |
1951a1b6 JM |
2128 | if (! TYPE_ANONYMOUS_P (t)) |
2129 | { | |
c162c75e | 2130 | struct c_fileinfo *finfo = get_fileinfo (lbasename (input_filename)); |
5d709b00 | 2131 | CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only; |
1951a1b6 | 2132 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X |
5d709b00 | 2133 | (t, finfo->interface_unknown); |
1951a1b6 | 2134 | } |
ce4a0391 MM |
2135 | reset_specialization(); |
2136 | ||
b7975aed MM |
2137 | /* Make a declaration for this class in its own scope. */ |
2138 | build_self_reference (); | |
2139 | ||
830fcda8 | 2140 | return t; |
ce4a0391 MM |
2141 | } |
2142 | ||
61a127b3 MM |
2143 | /* Finish the member declaration given by DECL. */ |
2144 | ||
2145 | void | |
3a978d72 | 2146 | finish_member_declaration (tree decl) |
61a127b3 MM |
2147 | { |
2148 | if (decl == error_mark_node || decl == NULL_TREE) | |
2149 | return; | |
2150 | ||
2151 | if (decl == void_type_node) | |
2152 | /* The COMPONENT was a friend, not a member, and so there's | |
2153 | nothing for us to do. */ | |
2154 | return; | |
2155 | ||
2156 | /* We should see only one DECL at a time. */ | |
50bc768d | 2157 | gcc_assert (TREE_CHAIN (decl) == NULL_TREE); |
61a127b3 MM |
2158 | |
2159 | /* Set up access control for DECL. */ | |
2160 | TREE_PRIVATE (decl) | |
2161 | = (current_access_specifier == access_private_node); | |
2162 | TREE_PROTECTED (decl) | |
2163 | = (current_access_specifier == access_protected_node); | |
2164 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
2165 | { | |
17aec3eb RK |
2166 | TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl); |
2167 | TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl); | |
61a127b3 MM |
2168 | } |
2169 | ||
2170 | /* Mark the DECL as a member of the current class. */ | |
4f1c5b7d | 2171 | DECL_CONTEXT (decl) = current_class_type; |
61a127b3 | 2172 | |
421844e7 MM |
2173 | /* [dcl.link] |
2174 | ||
2175 | A C language linkage is ignored for the names of class members | |
2176 | and the member function type of class member functions. */ | |
2177 | if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c) | |
5d2ed28c | 2178 | SET_DECL_LANGUAGE (decl, lang_cplusplus); |
421844e7 | 2179 | |
61a127b3 MM |
2180 | /* Put functions on the TYPE_METHODS list and everything else on the |
2181 | TYPE_FIELDS list. Note that these are built up in reverse order. | |
2182 | We reverse them (to obtain declaration order) in finish_struct. */ | |
2183 | if (TREE_CODE (decl) == FUNCTION_DECL | |
2184 | || DECL_FUNCTION_TEMPLATE_P (decl)) | |
2185 | { | |
2186 | /* We also need to add this function to the | |
2187 | CLASSTYPE_METHOD_VEC. */ | |
aaaa46d2 | 2188 | add_method (current_class_type, decl); |
61a127b3 MM |
2189 | |
2190 | TREE_CHAIN (decl) = TYPE_METHODS (current_class_type); | |
2191 | TYPE_METHODS (current_class_type) = decl; | |
f139561c MM |
2192 | |
2193 | maybe_add_class_template_decl_list (current_class_type, decl, | |
2194 | /*friend_p=*/0); | |
61a127b3 | 2195 | } |
f139561c | 2196 | /* Enter the DECL into the scope of the class. */ |
fd9aef9d | 2197 | else if ((TREE_CODE (decl) == USING_DECL && TREE_TYPE (decl)) |
399dedb9 | 2198 | || pushdecl_class_level (decl)) |
61a127b3 MM |
2199 | { |
2200 | /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields | |
2201 | go at the beginning. The reason is that lookup_field_1 | |
2202 | searches the list in order, and we want a field name to | |
2203 | override a type name so that the "struct stat hack" will | |
2204 | work. In particular: | |
2205 | ||
2206 | struct S { enum E { }; int E } s; | |
2207 | s.E = 3; | |
2208 | ||
0e339752 | 2209 | is valid. In addition, the FIELD_DECLs must be maintained in |
61a127b3 MM |
2210 | declaration order so that class layout works as expected. |
2211 | However, we don't need that order until class layout, so we | |
2212 | save a little time by putting FIELD_DECLs on in reverse order | |
2213 | here, and then reversing them in finish_struct_1. (We could | |
2214 | also keep a pointer to the correct insertion points in the | |
2215 | list.) */ | |
2216 | ||
2217 | if (TREE_CODE (decl) == TYPE_DECL) | |
2218 | TYPE_FIELDS (current_class_type) | |
2219 | = chainon (TYPE_FIELDS (current_class_type), decl); | |
2220 | else | |
2221 | { | |
2222 | TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type); | |
2223 | TYPE_FIELDS (current_class_type) = decl; | |
2224 | } | |
8f032717 | 2225 | |
f139561c MM |
2226 | maybe_add_class_template_decl_list (current_class_type, decl, |
2227 | /*friend_p=*/0); | |
61a127b3 | 2228 | } |
5e2f4cd2 MM |
2229 | |
2230 | if (pch_file) | |
2231 | note_decl_for_pch (decl); | |
2232 | } | |
2233 | ||
2234 | /* DECL has been declared while we are building a PCH file. Perform | |
2235 | actions that we might normally undertake lazily, but which can be | |
2236 | performed now so that they do not have to be performed in | |
2237 | translation units which include the PCH file. */ | |
2238 | ||
2239 | void | |
2240 | note_decl_for_pch (tree decl) | |
2241 | { | |
2242 | gcc_assert (pch_file); | |
2243 | ||
2244 | /* A non-template inline function with external linkage will always | |
2245 | be COMDAT. As we must eventually determine the linkage of all | |
2246 | functions, and as that causes writes to the data mapped in from | |
2247 | the PCH file, it's advantageous to mark the functions at this | |
2248 | point. */ | |
2249 | if (TREE_CODE (decl) == FUNCTION_DECL | |
2250 | && TREE_PUBLIC (decl) | |
2251 | && DECL_DECLARED_INLINE_P (decl) | |
2252 | && !DECL_IMPLICIT_INSTANTIATION (decl)) | |
2253 | { | |
2254 | comdat_linkage (decl); | |
2255 | DECL_INTERFACE_KNOWN (decl) = 1; | |
2256 | } | |
2257 | ||
2258 | /* There's a good chance that we'll have to mangle names at some | |
2259 | point, even if only for emission in debugging information. */ | |
2260 | if (TREE_CODE (decl) == VAR_DECL | |
2261 | || TREE_CODE (decl) == FUNCTION_DECL) | |
2262 | mangle_decl (decl); | |
61a127b3 MM |
2263 | } |
2264 | ||
306ef644 | 2265 | /* Finish processing a complete template declaration. The PARMS are |
36a117a5 MM |
2266 | the template parameters. */ |
2267 | ||
2268 | void | |
3a978d72 | 2269 | finish_template_decl (tree parms) |
36a117a5 MM |
2270 | { |
2271 | if (parms) | |
2272 | end_template_decl (); | |
2273 | else | |
2274 | end_specialization (); | |
2275 | } | |
2276 | ||
509fc277 | 2277 | /* Finish processing a template-id (which names a type) of the form |
36a117a5 | 2278 | NAME < ARGS >. Return the TYPE_DECL for the type named by the |
838dfd8a | 2279 | template-id. If ENTERING_SCOPE is nonzero we are about to enter |
36a117a5 MM |
2280 | the scope of template-id indicated. */ |
2281 | ||
2282 | tree | |
3a978d72 | 2283 | finish_template_type (tree name, tree args, int entering_scope) |
36a117a5 MM |
2284 | { |
2285 | tree decl; | |
2286 | ||
2287 | decl = lookup_template_class (name, args, | |
42eaed49 NS |
2288 | NULL_TREE, NULL_TREE, entering_scope, |
2289 | tf_error | tf_warning | tf_user); | |
36a117a5 MM |
2290 | if (decl != error_mark_node) |
2291 | decl = TYPE_STUB_DECL (decl); | |
2292 | ||
2293 | return decl; | |
2294 | } | |
648f19f6 | 2295 | |
ea6021e8 MM |
2296 | /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER. |
2297 | Return a TREE_LIST containing the ACCESS_SPECIFIER and the | |
2298 | BASE_CLASS, or NULL_TREE if an error occurred. The | |
aba649ba | 2299 | ACCESS_SPECIFIER is one of |
809e3e7f NS |
2300 | access_{default,public,protected_private}_node. For a virtual base |
2301 | we set TREE_TYPE. */ | |
ea6021e8 MM |
2302 | |
2303 | tree | |
dbbf88d1 | 2304 | finish_base_specifier (tree base, tree access, bool virtual_p) |
ea6021e8 | 2305 | { |
ea6021e8 MM |
2306 | tree result; |
2307 | ||
dbbf88d1 | 2308 | if (base == error_mark_node) |
acb044ee GDR |
2309 | { |
2310 | error ("invalid base-class specification"); | |
2311 | result = NULL_TREE; | |
2312 | } | |
dbbf88d1 | 2313 | else if (! is_aggr_type (base, 1)) |
ea6021e8 | 2314 | result = NULL_TREE; |
ea6021e8 | 2315 | else |
bb92901d | 2316 | { |
dbbf88d1 | 2317 | if (cp_type_quals (base) != 0) |
bb92901d | 2318 | { |
a82e1a7d | 2319 | error ("base class %qT has cv qualifiers", base); |
dbbf88d1 | 2320 | base = TYPE_MAIN_VARIANT (base); |
bb92901d | 2321 | } |
dbbf88d1 | 2322 | result = build_tree_list (access, base); |
809e3e7f NS |
2323 | if (virtual_p) |
2324 | TREE_TYPE (result) = integer_type_node; | |
bb92901d | 2325 | } |
ea6021e8 MM |
2326 | |
2327 | return result; | |
2328 | } | |
61a127b3 | 2329 | |
8f78f01f MM |
2330 | /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is |
2331 | what we found when we tried to do the lookup. */ | |
22038b2c NS |
2332 | |
2333 | void | |
8f78f01f | 2334 | qualified_name_lookup_error (tree scope, tree name, tree decl) |
22038b2c NS |
2335 | { |
2336 | if (TYPE_P (scope)) | |
2337 | { | |
2338 | if (!COMPLETE_TYPE_P (scope)) | |
a82e1a7d | 2339 | error ("incomplete type %qT used in nested name specifier", scope); |
8f78f01f MM |
2340 | else if (TREE_CODE (decl) == TREE_LIST) |
2341 | { | |
a82e1a7d | 2342 | error ("reference to %<%T::%D%> is ambiguous", scope, name); |
8f78f01f MM |
2343 | print_candidates (decl); |
2344 | } | |
22038b2c | 2345 | else |
a82e1a7d | 2346 | error ("%qD is not a member of %qT", name, scope); |
22038b2c NS |
2347 | } |
2348 | else if (scope != global_namespace) | |
a82e1a7d | 2349 | error ("%qD is not a member of %qD", name, scope); |
22038b2c | 2350 | else |
a82e1a7d | 2351 | error ("%<::%D%> has not been declared", name); |
22038b2c NS |
2352 | } |
2353 | ||
b3445994 MM |
2354 | /* ID_EXPRESSION is a representation of parsed, but unprocessed, |
2355 | id-expression. (See cp_parser_id_expression for details.) SCOPE, | |
2356 | if non-NULL, is the type or namespace used to explicitly qualify | |
2357 | ID_EXPRESSION. DECL is the entity to which that name has been | |
2358 | resolved. | |
2359 | ||
2360 | *CONSTANT_EXPRESSION_P is true if we are presently parsing a | |
2361 | constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will | |
2362 | be set to true if this expression isn't permitted in a | |
2363 | constant-expression, but it is otherwise not set by this function. | |
2364 | *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a | |
2365 | constant-expression, but a non-constant expression is also | |
2366 | permissible. | |
2367 | ||
2368 | If an error occurs, and it is the kind of error that might cause | |
2369 | the parser to abort a tentative parse, *ERROR_MSG is filled in. It | |
2370 | is the caller's responsibility to issue the message. *ERROR_MSG | |
2371 | will be a string with static storage duration, so the caller need | |
2372 | not "free" it. | |
2373 | ||
2374 | Return an expression for the entity, after issuing appropriate | |
2375 | diagnostics. This function is also responsible for transforming a | |
2376 | reference to a non-static member into a COMPONENT_REF that makes | |
2377 | the use of "this" explicit. | |
2378 | ||
2379 | Upon return, *IDK will be filled in appropriately. */ | |
2380 | ||
2381 | tree | |
2382 | finish_id_expression (tree id_expression, | |
2383 | tree decl, | |
2384 | tree scope, | |
2385 | cp_id_kind *idk, | |
2386 | tree *qualifying_class, | |
67c03833 JM |
2387 | bool integral_constant_expression_p, |
2388 | bool allow_non_integral_constant_expression_p, | |
2389 | bool *non_integral_constant_expression_p, | |
b3445994 MM |
2390 | const char **error_msg) |
2391 | { | |
2392 | /* Initialize the output parameters. */ | |
2393 | *idk = CP_ID_KIND_NONE; | |
2394 | *error_msg = NULL; | |
2395 | ||
2396 | if (id_expression == error_mark_node) | |
2397 | return error_mark_node; | |
2398 | /* If we have a template-id, then no further lookup is | |
2399 | required. If the template-id was for a template-class, we | |
2400 | will sometimes have a TYPE_DECL at this point. */ | |
2401 | else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR | |
ee935db4 | 2402 | || TREE_CODE (decl) == TYPE_DECL) |
b3445994 MM |
2403 | ; |
2404 | /* Look up the name. */ | |
2405 | else | |
2406 | { | |
2407 | if (decl == error_mark_node) | |
2408 | { | |
2409 | /* Name lookup failed. */ | |
4546865e MM |
2410 | if (scope |
2411 | && (!TYPE_P (scope) | |
2412 | || (!dependent_type_p (scope) | |
2413 | && !(TREE_CODE (id_expression) == IDENTIFIER_NODE | |
2414 | && IDENTIFIER_TYPENAME_P (id_expression) | |
2415 | && dependent_type_p (TREE_TYPE (id_expression)))))) | |
b3445994 | 2416 | { |
4546865e MM |
2417 | /* If the qualifying type is non-dependent (and the name |
2418 | does not name a conversion operator to a dependent | |
2419 | type), issue an error. */ | |
8f78f01f | 2420 | qualified_name_lookup_error (scope, id_expression, decl); |
b3445994 MM |
2421 | return error_mark_node; |
2422 | } | |
2423 | else if (!scope) | |
2424 | { | |
2425 | /* It may be resolved via Koenig lookup. */ | |
2426 | *idk = CP_ID_KIND_UNQUALIFIED; | |
2427 | return id_expression; | |
2428 | } | |
4546865e MM |
2429 | else |
2430 | decl = id_expression; | |
b3445994 MM |
2431 | } |
2432 | /* If DECL is a variable that would be out of scope under | |
2433 | ANSI/ISO rules, but in scope in the ARM, name lookup | |
2434 | will succeed. Issue a diagnostic here. */ | |
2435 | else | |
2436 | decl = check_for_out_of_scope_variable (decl); | |
2437 | ||
2438 | /* Remember that the name was used in the definition of | |
2439 | the current class so that we can check later to see if | |
2440 | the meaning would have been different after the class | |
2441 | was entirely defined. */ | |
2442 | if (!scope && decl != error_mark_node) | |
2443 | maybe_note_name_used_in_class (id_expression, decl); | |
2444 | } | |
2445 | ||
2446 | /* If we didn't find anything, or what we found was a type, | |
2447 | then this wasn't really an id-expression. */ | |
2448 | if (TREE_CODE (decl) == TEMPLATE_DECL | |
2449 | && !DECL_FUNCTION_TEMPLATE_P (decl)) | |
2450 | { | |
2451 | *error_msg = "missing template arguments"; | |
2452 | return error_mark_node; | |
2453 | } | |
2454 | else if (TREE_CODE (decl) == TYPE_DECL | |
2455 | || TREE_CODE (decl) == NAMESPACE_DECL) | |
2456 | { | |
2457 | *error_msg = "expected primary-expression"; | |
2458 | return error_mark_node; | |
2459 | } | |
2460 | ||
2461 | /* If the name resolved to a template parameter, there is no | |
931a9c05 GB |
2462 | need to look it up again later. */ |
2463 | if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl)) | |
2464 | || TREE_CODE (decl) == TEMPLATE_PARM_INDEX) | |
b3445994 | 2465 | { |
db24eb1f NS |
2466 | tree r; |
2467 | ||
b3445994 | 2468 | *idk = CP_ID_KIND_NONE; |
931a9c05 GB |
2469 | if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX) |
2470 | decl = TEMPLATE_PARM_DECL (decl); | |
db24eb1f NS |
2471 | r = convert_from_reference (DECL_INITIAL (decl)); |
2472 | ||
67c03833 | 2473 | if (integral_constant_expression_p |
68deab91 | 2474 | && !dependent_type_p (TREE_TYPE (decl)) |
db24eb1f | 2475 | && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r)))) |
931a9c05 | 2476 | { |
67c03833 | 2477 | if (!allow_non_integral_constant_expression_p) |
a82e1a7d | 2478 | error ("template parameter %qD of type %qT is not allowed in " |
931a9c05 GB |
2479 | "an integral constant expression because it is not of " |
2480 | "integral or enumeration type", decl, TREE_TYPE (decl)); | |
67c03833 | 2481 | *non_integral_constant_expression_p = true; |
931a9c05 | 2482 | } |
db24eb1f | 2483 | return r; |
931a9c05 GB |
2484 | } |
2485 | /* Similarly, we resolve enumeration constants to their | |
2486 | underlying values. */ | |
2487 | else if (TREE_CODE (decl) == CONST_DECL) | |
2488 | { | |
2489 | *idk = CP_ID_KIND_NONE; | |
2490 | if (!processing_template_decl) | |
b3445994 MM |
2491 | return DECL_INITIAL (decl); |
2492 | return decl; | |
2493 | } | |
2494 | else | |
2495 | { | |
2496 | bool dependent_p; | |
2497 | ||
2498 | /* If the declaration was explicitly qualified indicate | |
2499 | that. The semantics of `A::f(3)' are different than | |
2500 | `f(3)' if `f' is virtual. */ | |
2501 | *idk = (scope | |
2502 | ? CP_ID_KIND_QUALIFIED | |
2503 | : (TREE_CODE (decl) == TEMPLATE_ID_EXPR | |
2504 | ? CP_ID_KIND_TEMPLATE_ID | |
2505 | : CP_ID_KIND_UNQUALIFIED)); | |
2506 | ||
2507 | ||
2508 | /* [temp.dep.expr] | |
2509 | ||
2510 | An id-expression is type-dependent if it contains an | |
2511 | identifier that was declared with a dependent type. | |
2512 | ||
b3445994 MM |
2513 | The standard is not very specific about an id-expression that |
2514 | names a set of overloaded functions. What if some of them | |
2515 | have dependent types and some of them do not? Presumably, | |
2516 | such a name should be treated as a dependent name. */ | |
2517 | /* Assume the name is not dependent. */ | |
2518 | dependent_p = false; | |
2519 | if (!processing_template_decl) | |
2520 | /* No names are dependent outside a template. */ | |
2521 | ; | |
2522 | /* A template-id where the name of the template was not resolved | |
2523 | is definitely dependent. */ | |
2524 | else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR | |
2525 | && (TREE_CODE (TREE_OPERAND (decl, 0)) | |
2526 | == IDENTIFIER_NODE)) | |
2527 | dependent_p = true; | |
2528 | /* For anything except an overloaded function, just check its | |
2529 | type. */ | |
2530 | else if (!is_overloaded_fn (decl)) | |
2531 | dependent_p | |
2532 | = dependent_type_p (TREE_TYPE (decl)); | |
2533 | /* For a set of overloaded functions, check each of the | |
2534 | functions. */ | |
2535 | else | |
2536 | { | |
2537 | tree fns = decl; | |
2538 | ||
2539 | if (BASELINK_P (fns)) | |
2540 | fns = BASELINK_FUNCTIONS (fns); | |
2541 | ||
2542 | /* For a template-id, check to see if the template | |
2543 | arguments are dependent. */ | |
2544 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) | |
2545 | { | |
2546 | tree args = TREE_OPERAND (fns, 1); | |
2547 | dependent_p = any_dependent_template_arguments_p (args); | |
2548 | /* The functions are those referred to by the | |
2549 | template-id. */ | |
2550 | fns = TREE_OPERAND (fns, 0); | |
2551 | } | |
2552 | ||
2553 | /* If there are no dependent template arguments, go through | |
cd0be382 | 2554 | the overloaded functions. */ |
b3445994 MM |
2555 | while (fns && !dependent_p) |
2556 | { | |
2557 | tree fn = OVL_CURRENT (fns); | |
2558 | ||
2559 | /* Member functions of dependent classes are | |
2560 | dependent. */ | |
2561 | if (TREE_CODE (fn) == FUNCTION_DECL | |
2562 | && type_dependent_expression_p (fn)) | |
2563 | dependent_p = true; | |
2564 | else if (TREE_CODE (fn) == TEMPLATE_DECL | |
2565 | && dependent_template_p (fn)) | |
2566 | dependent_p = true; | |
2567 | ||
2568 | fns = OVL_NEXT (fns); | |
2569 | } | |
2570 | } | |
2571 | ||
2572 | /* If the name was dependent on a template parameter, we will | |
2573 | resolve the name at instantiation time. */ | |
2574 | if (dependent_p) | |
2575 | { | |
2576 | /* Create a SCOPE_REF for qualified names, if the scope is | |
2577 | dependent. */ | |
2578 | if (scope) | |
2579 | { | |
2580 | if (TYPE_P (scope)) | |
2581 | *qualifying_class = scope; | |
2582 | /* Since this name was dependent, the expression isn't | |
2583 | constant -- yet. No error is issued because it might | |
2584 | be constant when things are instantiated. */ | |
67c03833 JM |
2585 | if (integral_constant_expression_p) |
2586 | *non_integral_constant_expression_p = true; | |
b3445994 MM |
2587 | if (TYPE_P (scope) && dependent_type_p (scope)) |
2588 | return build_nt (SCOPE_REF, scope, id_expression); | |
2589 | else if (TYPE_P (scope) && DECL_P (decl)) | |
db24eb1f NS |
2590 | return convert_from_reference |
2591 | (build2 (SCOPE_REF, TREE_TYPE (decl), scope, id_expression)); | |
b3445994 | 2592 | else |
db24eb1f | 2593 | return convert_from_reference (decl); |
b3445994 MM |
2594 | } |
2595 | /* A TEMPLATE_ID already contains all the information we | |
2596 | need. */ | |
2597 | if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR) | |
2598 | return id_expression; | |
2599 | /* Since this name was dependent, the expression isn't | |
2600 | constant -- yet. No error is issued because it might be | |
2601 | constant when things are instantiated. */ | |
67c03833 JM |
2602 | if (integral_constant_expression_p) |
2603 | *non_integral_constant_expression_p = true; | |
10b1d5e7 | 2604 | *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT; |
5a98fa7b MM |
2605 | /* If we found a variable, then name lookup during the |
2606 | instantiation will always resolve to the same VAR_DECL | |
2607 | (or an instantiation thereof). */ | |
3c398f34 MM |
2608 | if (TREE_CODE (decl) == VAR_DECL |
2609 | || TREE_CODE (decl) == PARM_DECL) | |
db24eb1f | 2610 | return convert_from_reference (decl); |
bad1f462 KL |
2611 | /* The same is true for FIELD_DECL, but we also need to |
2612 | make sure that the syntax is correct. */ | |
2613 | else if (TREE_CODE (decl) == FIELD_DECL) | |
2614 | return finish_non_static_data_member | |
2615 | (decl, current_class_ref, | |
2616 | /*qualifying_scope=*/NULL_TREE); | |
10b1d5e7 | 2617 | return id_expression; |
b3445994 MM |
2618 | } |
2619 | ||
2620 | /* Only certain kinds of names are allowed in constant | |
db24eb1f NS |
2621 | expression. Enumerators and template parameters have already |
2622 | been handled above. */ | |
c30b4add MM |
2623 | if (integral_constant_expression_p |
2624 | && !DECL_INTEGRAL_CONSTANT_VAR_P (decl)) | |
b3445994 | 2625 | { |
c30b4add | 2626 | if (!allow_non_integral_constant_expression_p) |
b3445994 | 2627 | { |
a82e1a7d | 2628 | error ("%qD cannot appear in a constant-expression", decl); |
c30b4add | 2629 | return error_mark_node; |
b3445994 | 2630 | } |
c30b4add | 2631 | *non_integral_constant_expression_p = true; |
b3445994 | 2632 | } |
415d4636 MM |
2633 | |
2634 | if (TREE_CODE (decl) == NAMESPACE_DECL) | |
9e95d15f | 2635 | { |
a82e1a7d | 2636 | error ("use of namespace %qD as expression", decl); |
9e95d15f NS |
2637 | return error_mark_node; |
2638 | } | |
2639 | else if (DECL_CLASS_TEMPLATE_P (decl)) | |
2640 | { | |
a82e1a7d | 2641 | error ("use of class template %qT as expression", decl); |
9e95d15f NS |
2642 | return error_mark_node; |
2643 | } | |
2644 | else if (TREE_CODE (decl) == TREE_LIST) | |
2645 | { | |
2646 | /* Ambiguous reference to base members. */ | |
a82e1a7d | 2647 | error ("request for member %qD is ambiguous in " |
9e95d15f NS |
2648 | "multiple inheritance lattice", id_expression); |
2649 | print_candidates (decl); | |
2650 | return error_mark_node; | |
2651 | } | |
415d4636 MM |
2652 | |
2653 | /* Mark variable-like entities as used. Functions are similarly | |
2654 | marked either below or after overload resolution. */ | |
2655 | if (TREE_CODE (decl) == VAR_DECL | |
2656 | || TREE_CODE (decl) == PARM_DECL | |
2657 | || TREE_CODE (decl) == RESULT_DECL) | |
2658 | mark_used (decl); | |
2659 | ||
2660 | if (scope) | |
2661 | { | |
2662 | decl = (adjust_result_of_qualified_name_lookup | |
2663 | (decl, scope, current_class_type)); | |
e20bcc5e JH |
2664 | |
2665 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
2666 | mark_used (decl); | |
2667 | ||
415d4636 MM |
2668 | if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl)) |
2669 | *qualifying_class = scope; | |
db24eb1f NS |
2670 | else |
2671 | { | |
2672 | tree r = convert_from_reference (decl); | |
2673 | ||
2674 | if (processing_template_decl | |
2675 | && TYPE_P (scope)) | |
2676 | r = build2 (SCOPE_REF, TREE_TYPE (r), scope, decl); | |
2677 | decl = r; | |
2678 | } | |
415d4636 | 2679 | } |
9e95d15f NS |
2680 | else if (TREE_CODE (decl) == FIELD_DECL) |
2681 | decl = finish_non_static_data_member (decl, current_class_ref, | |
2682 | /*qualifying_scope=*/NULL_TREE); | |
2683 | else if (is_overloaded_fn (decl)) | |
2684 | { | |
2685 | tree first_fn = OVL_CURRENT (decl); | |
b3445994 | 2686 | |
9e95d15f NS |
2687 | if (TREE_CODE (first_fn) == TEMPLATE_DECL) |
2688 | first_fn = DECL_TEMPLATE_RESULT (first_fn); | |
415d4636 MM |
2689 | |
2690 | if (!really_overloaded_fn (decl)) | |
2691 | mark_used (first_fn); | |
2692 | ||
9e95d15f | 2693 | if (TREE_CODE (first_fn) == FUNCTION_DECL |
821eaf2a MM |
2694 | && DECL_FUNCTION_MEMBER_P (first_fn) |
2695 | && !shared_member_p (decl)) | |
9e95d15f NS |
2696 | { |
2697 | /* A set of member functions. */ | |
2698 | decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0); | |
2699 | return finish_class_member_access_expr (decl, id_expression); | |
2700 | } | |
9e95d15f NS |
2701 | } |
2702 | else | |
2703 | { | |
2704 | if (TREE_CODE (decl) == VAR_DECL | |
2705 | || TREE_CODE (decl) == PARM_DECL | |
2706 | || TREE_CODE (decl) == RESULT_DECL) | |
2707 | { | |
2708 | tree context = decl_function_context (decl); | |
2709 | ||
2710 | if (context != NULL_TREE && context != current_function_decl | |
2711 | && ! TREE_STATIC (decl)) | |
2712 | { | |
2713 | error ("use of %s from containing function", | |
2714 | (TREE_CODE (decl) == VAR_DECL | |
a82e1a7d GDR |
2715 | ? "%<auto%> variable" : "parameter")); |
2716 | cp_error_at (" %q#D declared here", decl); | |
9e95d15f NS |
2717 | return error_mark_node; |
2718 | } | |
2719 | } | |
2720 | ||
2721 | if (DECL_P (decl) && DECL_NONLOCAL (decl) | |
2722 | && DECL_CLASS_SCOPE_P (decl) | |
2723 | && DECL_CONTEXT (decl) != current_class_type) | |
2724 | { | |
2725 | tree path; | |
2726 | ||
2727 | path = currently_open_derived_class (DECL_CONTEXT (decl)); | |
2728 | perform_or_defer_access_check (TYPE_BINFO (path), decl); | |
2729 | } | |
2730 | ||
db24eb1f | 2731 | decl = convert_from_reference (decl); |
9e95d15f NS |
2732 | } |
2733 | ||
b3445994 MM |
2734 | /* Resolve references to variables of anonymous unions |
2735 | into COMPONENT_REFs. */ | |
2736 | if (TREE_CODE (decl) == ALIAS_DECL) | |
6de9cd9a | 2737 | decl = unshare_expr (DECL_INITIAL (decl)); |
b3445994 MM |
2738 | } |
2739 | ||
2740 | if (TREE_DEPRECATED (decl)) | |
2741 | warn_deprecated_use (decl); | |
2742 | ||
2743 | return decl; | |
2744 | } | |
2745 | ||
0213a355 JM |
2746 | /* Implement the __typeof keyword: Return the type of EXPR, suitable for |
2747 | use as a type-specifier. */ | |
2748 | ||
b894fc05 | 2749 | tree |
3a978d72 | 2750 | finish_typeof (tree expr) |
b894fc05 | 2751 | { |
65a5559b MM |
2752 | tree type; |
2753 | ||
dffbbe80 | 2754 | if (type_dependent_expression_p (expr)) |
b894fc05 | 2755 | { |
65a5559b | 2756 | type = make_aggr_type (TYPEOF_TYPE); |
eb34af89 | 2757 | TYPEOF_TYPE_EXPR (type) = expr; |
b894fc05 | 2758 | |
65a5559b | 2759 | return type; |
b894fc05 JM |
2760 | } |
2761 | ||
65a5559b MM |
2762 | type = TREE_TYPE (expr); |
2763 | ||
2764 | if (!type || type == unknown_type_node) | |
2765 | { | |
a82e1a7d | 2766 | error ("type of %qE is unknown", expr); |
65a5559b MM |
2767 | return error_mark_node; |
2768 | } | |
2769 | ||
2770 | return type; | |
b894fc05 | 2771 | } |
558475f0 | 2772 | |
3eb24f73 | 2773 | /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs |
6de9cd9a | 2774 | with equivalent CALL_EXPRs. */ |
3eb24f73 MM |
2775 | |
2776 | static tree | |
3a978d72 | 2777 | simplify_aggr_init_exprs_r (tree* tp, |
9eeb200f JM |
2778 | int* walk_subtrees, |
2779 | void* data ATTRIBUTE_UNUSED) | |
3eb24f73 | 2780 | { |
22e92ac3 MM |
2781 | /* We don't need to walk into types; there's nothing in a type that |
2782 | needs simplification. (And, furthermore, there are places we | |
2783 | actively don't want to go. For example, we don't want to wander | |
2784 | into the default arguments for a FUNCTION_DECL that appears in a | |
2785 | CALL_EXPR.) */ | |
9eeb200f | 2786 | if (TYPE_P (*tp)) |
22e92ac3 MM |
2787 | { |
2788 | *walk_subtrees = 0; | |
2789 | return NULL_TREE; | |
2790 | } | |
2791 | /* Only AGGR_INIT_EXPRs are interesting. */ | |
9eeb200f | 2792 | else if (TREE_CODE (*tp) != AGGR_INIT_EXPR) |
3eb24f73 MM |
2793 | return NULL_TREE; |
2794 | ||
9eeb200f JM |
2795 | simplify_aggr_init_expr (tp); |
2796 | ||
2797 | /* Keep iterating. */ | |
2798 | return NULL_TREE; | |
2799 | } | |
2800 | ||
2801 | /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This | |
2802 | function is broken out from the above for the benefit of the tree-ssa | |
2803 | project. */ | |
2804 | ||
2805 | void | |
2806 | simplify_aggr_init_expr (tree *tp) | |
2807 | { | |
2808 | tree aggr_init_expr = *tp; | |
2809 | ||
3eb24f73 | 2810 | /* Form an appropriate CALL_EXPR. */ |
9eeb200f JM |
2811 | tree fn = TREE_OPERAND (aggr_init_expr, 0); |
2812 | tree args = TREE_OPERAND (aggr_init_expr, 1); | |
2813 | tree slot = TREE_OPERAND (aggr_init_expr, 2); | |
2692eb7d | 2814 | tree type = TREE_TYPE (slot); |
9eeb200f JM |
2815 | |
2816 | tree call_expr; | |
2817 | enum style_t { ctor, arg, pcc } style; | |
4977bab6 | 2818 | |
3eb24f73 | 2819 | if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr)) |
4977bab6 ZW |
2820 | style = ctor; |
2821 | #ifdef PCC_STATIC_STRUCT_RETURN | |
2822 | else if (1) | |
2823 | style = pcc; | |
2824 | #endif | |
4977bab6 | 2825 | else |
315fb5db NS |
2826 | { |
2827 | gcc_assert (TREE_ADDRESSABLE (type)); | |
2828 | style = arg; | |
2829 | } | |
4977bab6 ZW |
2830 | |
2831 | if (style == ctor || style == arg) | |
3eb24f73 | 2832 | { |
4977bab6 ZW |
2833 | /* Pass the address of the slot. If this is a constructor, we |
2834 | replace the first argument; otherwise, we tack on a new one. */ | |
9eeb200f JM |
2835 | tree addr; |
2836 | ||
4977bab6 ZW |
2837 | if (style == ctor) |
2838 | args = TREE_CHAIN (args); | |
2839 | ||
dffd7eb6 | 2840 | cxx_mark_addressable (slot); |
2692eb7d | 2841 | addr = build1 (ADDR_EXPR, build_pointer_type (type), slot); |
9eeb200f JM |
2842 | if (style == arg) |
2843 | { | |
2844 | /* The return type might have different cv-quals from the slot. */ | |
2845 | tree fntype = TREE_TYPE (TREE_TYPE (fn)); | |
315fb5db NS |
2846 | |
2847 | gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE | |
2848 | || TREE_CODE (fntype) == METHOD_TYPE); | |
9eeb200f JM |
2849 | addr = convert (build_pointer_type (TREE_TYPE (fntype)), addr); |
2850 | } | |
2851 | ||
2852 | args = tree_cons (NULL_TREE, addr, args); | |
3eb24f73 | 2853 | } |
4977bab6 | 2854 | |
f293ce4b RS |
2855 | call_expr = build3 (CALL_EXPR, |
2856 | TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))), | |
2857 | fn, args, NULL_TREE); | |
3eb24f73 | 2858 | |
4977bab6 | 2859 | if (style == arg) |
89ea02fb JM |
2860 | /* Tell the backend that we've added our return slot to the argument |
2861 | list. */ | |
2862 | CALL_EXPR_HAS_RETURN_SLOT_ADDR (call_expr) = 1; | |
4977bab6 | 2863 | else if (style == pcc) |
3eb24f73 | 2864 | { |
4977bab6 ZW |
2865 | /* If we're using the non-reentrant PCC calling convention, then we |
2866 | need to copy the returned value out of the static buffer into the | |
2867 | SLOT. */ | |
78757caa | 2868 | push_deferring_access_checks (dk_no_check); |
46af705a JDA |
2869 | call_expr = build_aggr_init (slot, call_expr, |
2870 | DIRECT_BIND | LOOKUP_ONLYCONVERTING); | |
78757caa | 2871 | pop_deferring_access_checks (); |
3eb24f73 | 2872 | } |
3eb24f73 | 2873 | |
3eb24f73 | 2874 | *tp = call_expr; |
3eb24f73 MM |
2875 | } |
2876 | ||
31f8e4f3 MM |
2877 | /* Emit all thunks to FN that should be emitted when FN is emitted. */ |
2878 | ||
2879 | static void | |
3a978d72 | 2880 | emit_associated_thunks (tree fn) |
31f8e4f3 MM |
2881 | { |
2882 | /* When we use vcall offsets, we emit thunks with the virtual | |
2883 | functions to which they thunk. The whole point of vcall offsets | |
2884 | is so that you can know statically the entire set of thunks that | |
2885 | will ever be needed for a given virtual function, thereby | |
2886 | enabling you to output all the thunks with the function itself. */ | |
3461fba7 | 2887 | if (DECL_VIRTUAL_P (fn)) |
31f8e4f3 | 2888 | { |
bb5e8a7f | 2889 | tree thunk; |
4977bab6 | 2890 | |
bb5e8a7f | 2891 | for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk)) |
4977bab6 | 2892 | { |
e00853fd | 2893 | if (!THUNK_ALIAS (thunk)) |
4977bab6 | 2894 | { |
bb885938 NS |
2895 | use_thunk (thunk, /*emit_p=*/1); |
2896 | if (DECL_RESULT_THUNK_P (thunk)) | |
2897 | { | |
2898 | tree probe; | |
2899 | ||
2900 | for (probe = DECL_THUNKS (thunk); | |
2901 | probe; probe = TREE_CHAIN (probe)) | |
2902 | use_thunk (probe, /*emit_p=*/1); | |
2903 | } | |
4977bab6 | 2904 | } |
bb885938 | 2905 | else |
50bc768d | 2906 | gcc_assert (!DECL_THUNKS (thunk)); |
4977bab6 | 2907 | } |
31f8e4f3 MM |
2908 | } |
2909 | } | |
2910 | ||
558475f0 MM |
2911 | /* Generate RTL for FN. */ |
2912 | ||
2913 | void | |
3a978d72 | 2914 | expand_body (tree fn) |
558475f0 | 2915 | { |
367aa585 | 2916 | tree saved_function; |
6de9cd9a | 2917 | |
92788413 MM |
2918 | /* Compute the appropriate object-file linkage for inline |
2919 | functions. */ | |
79065db2 | 2920 | if (DECL_DECLARED_INLINE_P (fn)) |
92788413 MM |
2921 | import_export_decl (fn); |
2922 | ||
4f8e1232 MM |
2923 | /* If FN is external, then there's no point in generating RTL for |
2924 | it. This situation can arise with an inline function under | |
83662e2b | 2925 | `-fexternal-templates'; we instantiate the function, even though |
4f8e1232 MM |
2926 | we're not planning on emitting it, in case we get a chance to |
2927 | inline it. */ | |
2928 | if (DECL_EXTERNAL (fn)) | |
2929 | return; | |
2930 | ||
4985cde3 | 2931 | /* ??? When is this needed? */ |
367aa585 | 2932 | saved_function = current_function_decl; |
367aa585 | 2933 | |
de81ffd4 JH |
2934 | /* Emit any thunks that should be emitted at the same time as FN. */ |
2935 | emit_associated_thunks (fn); | |
2936 | ||
fa3ee801 DJ |
2937 | /* This function is only called from cgraph, or recursively from |
2938 | emit_associated_thunks. In neither case should we be currently | |
2939 | generating trees for a function. */ | |
2940 | gcc_assert (function_depth == 0); | |
2941 | ||
0f0377f6 | 2942 | tree_rest_of_compilation (fn); |
d658cd4c | 2943 | |
367aa585 | 2944 | current_function_decl = saved_function; |
ea11ca7e | 2945 | |
85b22f78 NS |
2946 | if (DECL_CLONED_FUNCTION_P (fn)) |
2947 | { | |
2948 | /* If this is a clone, go through the other clones now and mark | |
2949 | their parameters used. We have to do that here, as we don't | |
2950 | know whether any particular clone will be expanded, and | |
2951 | therefore cannot pick one arbitrarily. */ | |
2952 | tree probe; | |
2953 | ||
2954 | for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn)); | |
2955 | probe && DECL_CLONED_FUNCTION_P (probe); | |
2956 | probe = TREE_CHAIN (probe)) | |
2957 | { | |
2958 | tree parms; | |
2959 | ||
2960 | for (parms = DECL_ARGUMENTS (probe); | |
2961 | parms; parms = TREE_CHAIN (parms)) | |
2962 | TREE_USED (parms) = 1; | |
2963 | } | |
2964 | } | |
558475f0 | 2965 | } |
54f7877c | 2966 | |
8cd2462c JH |
2967 | /* Generate RTL for FN. */ |
2968 | ||
2969 | void | |
5671bf27 | 2970 | expand_or_defer_fn (tree fn) |
8cd2462c JH |
2971 | { |
2972 | /* When the parser calls us after finishing the body of a template | |
c353b8e3 MM |
2973 | function, we don't really want to expand the body. */ |
2974 | if (processing_template_decl) | |
8cd2462c JH |
2975 | { |
2976 | /* Normally, collection only occurs in rest_of_compilation. So, | |
2977 | if we don't collect here, we never collect junk generated | |
2978 | during the processing of templates until we hit a | |
2979 | non-template function. */ | |
2980 | ggc_collect (); | |
2981 | return; | |
2982 | } | |
2983 | ||
2984 | /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */ | |
2985 | walk_tree_without_duplicates (&DECL_SAVED_TREE (fn), | |
2986 | simplify_aggr_init_exprs_r, | |
2987 | NULL); | |
2988 | ||
2989 | /* If this is a constructor or destructor body, we have to clone | |
2990 | it. */ | |
2991 | if (maybe_clone_body (fn)) | |
2992 | { | |
2993 | /* We don't want to process FN again, so pretend we've written | |
2994 | it out, even though we haven't. */ | |
2995 | TREE_ASM_WRITTEN (fn) = 1; | |
2996 | return; | |
2997 | } | |
2998 | ||
4684cd27 MM |
2999 | /* If this function is marked with the constructor attribute, add it |
3000 | to the list of functions to be called along with constructors | |
3001 | from static duration objects. */ | |
3002 | if (DECL_STATIC_CONSTRUCTOR (fn)) | |
3003 | static_ctors = tree_cons (NULL_TREE, fn, static_ctors); | |
3004 | ||
3005 | /* If this function is marked with the destructor attribute, add it | |
3006 | to the list of functions to be called along with destructors from | |
3007 | static duration objects. */ | |
3008 | if (DECL_STATIC_DESTRUCTOR (fn)) | |
3009 | static_dtors = tree_cons (NULL_TREE, fn, static_dtors); | |
3010 | ||
3011 | /* We make a decision about linkage for these functions at the end | |
3012 | of the compilation. Until that point, we do not want the back | |
3013 | end to output them -- but we do want it to see the bodies of | |
1a10290c | 3014 | these functions so that it can inline them as appropriate. */ |
4684cd27 MM |
3015 | if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn)) |
3016 | { | |
3017 | if (!at_eof) | |
3018 | { | |
3019 | DECL_EXTERNAL (fn) = 1; | |
3020 | DECL_NOT_REALLY_EXTERN (fn) = 1; | |
3021 | note_vague_linkage_fn (fn); | |
3022 | } | |
3023 | else | |
3024 | import_export_decl (fn); | |
1a10290c MM |
3025 | |
3026 | /* If the user wants us to keep all inline functions, then mark | |
3027 | this function as needed so that finish_file will make sure to | |
3028 | output it later. */ | |
3029 | if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn)) | |
3030 | mark_needed (fn); | |
4684cd27 MM |
3031 | } |
3032 | ||
8cd2462c JH |
3033 | /* There's no reason to do any of the work here if we're only doing |
3034 | semantic analysis; this code just generates RTL. */ | |
3035 | if (flag_syntax_only) | |
3036 | return; | |
3037 | ||
99edd65d RH |
3038 | function_depth++; |
3039 | ||
e4d91027 | 3040 | /* Expand or defer, at the whim of the compilation unit manager. */ |
6b00c969 | 3041 | cgraph_finalize_function (fn, function_depth > 1); |
99edd65d RH |
3042 | |
3043 | function_depth--; | |
8cd2462c JH |
3044 | } |
3045 | ||
6de9cd9a DN |
3046 | struct nrv_data |
3047 | { | |
3048 | tree var; | |
3049 | tree result; | |
3050 | htab_t visited; | |
3051 | }; | |
0d97bf4c | 3052 | |
6de9cd9a DN |
3053 | /* Helper function for walk_tree, used by finalize_nrv below. */ |
3054 | ||
3055 | static tree | |
3056 | finalize_nrv_r (tree* tp, int* walk_subtrees, void* data) | |
0d97bf4c | 3057 | { |
6de9cd9a DN |
3058 | struct nrv_data *dp = (struct nrv_data *)data; |
3059 | void **slot; | |
07b2f2fd JM |
3060 | |
3061 | /* No need to walk into types. There wouldn't be any need to walk into | |
3062 | non-statements, except that we have to consider STMT_EXPRs. */ | |
0d97bf4c JM |
3063 | if (TYPE_P (*tp)) |
3064 | *walk_subtrees = 0; | |
6de9cd9a DN |
3065 | /* Change all returns to just refer to the RESULT_DECL; this is a nop, |
3066 | but differs from using NULL_TREE in that it indicates that we care | |
3067 | about the value of the RESULT_DECL. */ | |
5088b058 RH |
3068 | else if (TREE_CODE (*tp) == RETURN_EXPR) |
3069 | TREE_OPERAND (*tp, 0) = dp->result; | |
6de9cd9a DN |
3070 | /* Change all cleanups for the NRV to only run when an exception is |
3071 | thrown. */ | |
07b2f2fd | 3072 | else if (TREE_CODE (*tp) == CLEANUP_STMT |
6de9cd9a | 3073 | && CLEANUP_DECL (*tp) == dp->var) |
659e5a7a | 3074 | CLEANUP_EH_ONLY (*tp) = 1; |
350fae66 | 3075 | /* Replace the DECL_EXPR for the NRV with an initialization of the |
6de9cd9a | 3076 | RESULT_DECL, if needed. */ |
350fae66 RK |
3077 | else if (TREE_CODE (*tp) == DECL_EXPR |
3078 | && DECL_EXPR_DECL (*tp) == dp->var) | |
6de9cd9a DN |
3079 | { |
3080 | tree init; | |
3081 | if (DECL_INITIAL (dp->var) | |
3082 | && DECL_INITIAL (dp->var) != error_mark_node) | |
3083 | { | |
f293ce4b RS |
3084 | init = build2 (INIT_EXPR, void_type_node, dp->result, |
3085 | DECL_INITIAL (dp->var)); | |
6de9cd9a DN |
3086 | DECL_INITIAL (dp->var) = error_mark_node; |
3087 | } | |
3088 | else | |
543a0daa | 3089 | init = build_empty_stmt (); |
6de9cd9a | 3090 | SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp)); |
6de9cd9a DN |
3091 | *tp = init; |
3092 | } | |
3093 | /* And replace all uses of the NRV with the RESULT_DECL. */ | |
3094 | else if (*tp == dp->var) | |
3095 | *tp = dp->result; | |
3096 | ||
3097 | /* Avoid walking into the same tree more than once. Unfortunately, we | |
3098 | can't just use walk_tree_without duplicates because it would only call | |
3099 | us for the first occurrence of dp->var in the function body. */ | |
3100 | slot = htab_find_slot (dp->visited, *tp, INSERT); | |
3101 | if (*slot) | |
3102 | *walk_subtrees = 0; | |
3103 | else | |
3104 | *slot = *tp; | |
0d97bf4c JM |
3105 | |
3106 | /* Keep iterating. */ | |
3107 | return NULL_TREE; | |
3108 | } | |
3109 | ||
6de9cd9a | 3110 | /* Called from finish_function to implement the named return value |
5088b058 | 3111 | optimization by overriding all the RETURN_EXPRs and pertinent |
6de9cd9a DN |
3112 | CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the |
3113 | RESULT_DECL for the function. */ | |
f444e36b | 3114 | |
4985cde3 | 3115 | void |
6de9cd9a | 3116 | finalize_nrv (tree *tp, tree var, tree result) |
f444e36b | 3117 | { |
6de9cd9a DN |
3118 | struct nrv_data data; |
3119 | ||
3120 | /* Copy debugging information from VAR to RESULT. */ | |
3121 | DECL_NAME (result) = DECL_NAME (var); | |
b785f485 RH |
3122 | DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var); |
3123 | DECL_IGNORED_P (result) = DECL_IGNORED_P (var); | |
6de9cd9a DN |
3124 | DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var); |
3125 | DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var); | |
3126 | /* Don't forget that we take its address. */ | |
3127 | TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var); | |
3128 | ||
3129 | data.var = var; | |
3130 | data.result = result; | |
3131 | data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL); | |
3132 | walk_tree (tp, finalize_nrv_r, &data, 0); | |
3133 | htab_delete (data.visited); | |
b850de4f MM |
3134 | } |
3135 | ||
54f7877c MM |
3136 | /* Perform initialization related to this module. */ |
3137 | ||
3138 | void | |
3a978d72 | 3139 | init_cp_semantics (void) |
54f7877c | 3140 | { |
54f7877c | 3141 | } |
cf22909c KL |
3142 | |
3143 | #include "gt-cp-semantics.h" |