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