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