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