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