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