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