]>
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 | |
b2ebd268 | 6 | Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, |
66647d44 | 7 | 2008, 2009 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" |
726a989a | 49 | #include "gimple.h" |
ad321293 MM |
50 | |
51 | /* There routines provide a modular interface to perform many parsing | |
52 | operations. They may therefore be used during actual parsing, or | |
53 | during template instantiation, which may be regarded as a | |
0b4d5576 | 54 | degenerate form of parsing. */ |
ad321293 | 55 | |
3a978d72 | 56 | static tree maybe_convert_cond (tree); |
6de9cd9a | 57 | static tree finalize_nrv_r (tree *, int *, void *); |
d5f4eddd | 58 | static tree capture_decltype (tree); |
9660afe0 | 59 | static tree thisify_lambda_field (tree); |
4985cde3 | 60 | |
558475f0 | 61 | |
8d241e0b KL |
62 | /* Deferred Access Checking Overview |
63 | --------------------------------- | |
64 | ||
65 | Most C++ expressions and declarations require access checking | |
66 | to be performed during parsing. However, in several cases, | |
67 | this has to be treated differently. | |
68 | ||
69 | For member declarations, access checking has to be deferred | |
70 | until more information about the declaration is known. For | |
71 | example: | |
72 | ||
73 | class A { | |
0cbd7506 | 74 | typedef int X; |
8d241e0b | 75 | public: |
0cbd7506 | 76 | X f(); |
8d241e0b KL |
77 | }; |
78 | ||
79 | A::X A::f(); | |
80 | A::X g(); | |
81 | ||
82 | When we are parsing the function return type `A::X', we don't | |
83 | really know if this is allowed until we parse the function name. | |
84 | ||
85 | Furthermore, some contexts require that access checking is | |
86 | never performed at all. These include class heads, and template | |
87 | instantiations. | |
88 | ||
89 | Typical use of access checking functions is described here: | |
c8094d83 | 90 | |
8d241e0b KL |
91 | 1. When we enter a context that requires certain access checking |
92 | mode, the function `push_deferring_access_checks' is called with | |
93 | DEFERRING argument specifying the desired mode. Access checking | |
94 | may be performed immediately (dk_no_deferred), deferred | |
95 | (dk_deferred), or not performed (dk_no_check). | |
96 | ||
97 | 2. When a declaration such as a type, or a variable, is encountered, | |
98 | the function `perform_or_defer_access_check' is called. It | |
d6b418fa | 99 | maintains a VEC of all deferred checks. |
8d241e0b KL |
100 | |
101 | 3. The global `current_class_type' or `current_function_decl' is then | |
102 | setup by the parser. `enforce_access' relies on these information | |
103 | to check access. | |
104 | ||
105 | 4. Upon exiting the context mentioned in step 1, | |
106 | `perform_deferred_access_checks' is called to check all declaration | |
d6b418fa | 107 | stored in the VEC. `pop_deferring_access_checks' is then |
8d241e0b KL |
108 | called to restore the previous access checking mode. |
109 | ||
110 | In case of parsing error, we simply call `pop_deferring_access_checks' | |
111 | without `perform_deferred_access_checks'. */ | |
112 | ||
d1b38208 | 113 | typedef struct GTY(()) deferred_access { |
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 | ||
e8924938 | 385 | /* Returns the stmt_tree to which statements are currently being added. */ |
ae499cce MM |
386 | |
387 | stmt_tree | |
3a978d72 | 388 | current_stmt_tree (void) |
ae499cce | 389 | { |
c8094d83 MS |
390 | return (cfun |
391 | ? &cfun->language->base.x_stmt_tree | |
ae499cce | 392 | : &scope_chain->x_stmt_tree); |
f2c5f623 | 393 | } |
35b1567d | 394 | |
543a0daa RH |
395 | /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */ |
396 | ||
397 | static tree | |
398 | maybe_cleanup_point_expr (tree expr) | |
399 | { | |
400 | if (!processing_template_decl && stmts_are_full_exprs_p ()) | |
0ad28dde | 401 | expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr); |
543a0daa RH |
402 | return expr; |
403 | } | |
404 | ||
0ad28dde | 405 | /* Like maybe_cleanup_point_expr except have the type of the new expression be |
22423a1f KH |
406 | void so we don't need to create a temporary variable to hold the inner |
407 | expression. The reason why we do this is because the original type might be | |
408 | an aggregate and we cannot create a temporary variable for that type. */ | |
0ad28dde AP |
409 | |
410 | static tree | |
411 | maybe_cleanup_point_expr_void (tree expr) | |
412 | { | |
413 | if (!processing_template_decl && stmts_are_full_exprs_p ()) | |
414 | expr = fold_build_cleanup_point_expr (void_type_node, expr); | |
415 | return expr; | |
416 | } | |
417 | ||
418 | ||
419 | ||
543a0daa RH |
420 | /* Create a declaration statement for the declaration given by the DECL. */ |
421 | ||
422 | void | |
350fae66 | 423 | add_decl_expr (tree decl) |
543a0daa | 424 | { |
c2255bc4 | 425 | tree r = build_stmt (input_location, DECL_EXPR, decl); |
b187901e AP |
426 | if (DECL_INITIAL (decl) |
427 | || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl)))) | |
0ad28dde | 428 | r = maybe_cleanup_point_expr_void (r); |
543a0daa RH |
429 | add_stmt (r); |
430 | } | |
431 | ||
f2c5f623 | 432 | /* Finish a scope. */ |
35b1567d | 433 | |
20aff0b3 | 434 | tree |
325c3691 | 435 | do_poplevel (tree stmt_list) |
35b1567d | 436 | { |
325c3691 | 437 | tree block = NULL; |
35b1567d | 438 | |
f2c5f623 | 439 | if (stmts_are_full_exprs_p ()) |
325c3691 | 440 | block = poplevel (kept_level_p (), 1, 0); |
f2c5f623 | 441 | |
325c3691 | 442 | stmt_list = pop_stmt_list (stmt_list); |
c8094d83 | 443 | |
325c3691 RH |
444 | if (!processing_template_decl) |
445 | { | |
c2255bc4 | 446 | stmt_list = c_build_bind_expr (input_location, block, stmt_list); |
325c3691 | 447 | /* ??? See c_end_compound_stmt re statement expressions. */ |
35b1567d BC |
448 | } |
449 | ||
325c3691 | 450 | return stmt_list; |
35b1567d BC |
451 | } |
452 | ||
c8094d83 | 453 | /* Begin a new scope. */ |
35b1567d | 454 | |
325c3691 | 455 | static tree |
92bc1323 | 456 | do_pushlevel (scope_kind sk) |
35b1567d | 457 | { |
325c3691 | 458 | tree ret = push_stmt_list (); |
f2c5f623 | 459 | if (stmts_are_full_exprs_p ()) |
325c3691 RH |
460 | begin_scope (sk, NULL); |
461 | return ret; | |
462 | } | |
5a508662 RH |
463 | |
464 | /* Queue a cleanup. CLEANUP is an expression/statement to be executed | |
465 | when the current scope is exited. EH_ONLY is true when this is not | |
466 | meant to apply to normal control flow transfer. */ | |
467 | ||
468 | void | |
469 | push_cleanup (tree decl, tree cleanup, bool eh_only) | |
470 | { | |
c2255bc4 | 471 | tree stmt = build_stmt (input_location, CLEANUP_STMT, NULL, cleanup, decl); |
5a508662 RH |
472 | CLEANUP_EH_ONLY (stmt) = eh_only; |
473 | add_stmt (stmt); | |
474 | CLEANUP_BODY (stmt) = push_stmt_list (); | |
475 | } | |
325c3691 | 476 | |
caf2523d RH |
477 | /* Begin a conditional that might contain a declaration. When generating |
478 | normal code, we want the declaration to appear before the statement | |
479 | containing the conditional. When generating template code, we want the | |
350fae66 | 480 | conditional to be rendered as the raw DECL_EXPR. */ |
325c3691 RH |
481 | |
482 | static void | |
caf2523d | 483 | begin_cond (tree *cond_p) |
325c3691 | 484 | { |
caf2523d RH |
485 | if (processing_template_decl) |
486 | *cond_p = push_stmt_list (); | |
487 | } | |
488 | ||
489 | /* Finish such a conditional. */ | |
490 | ||
491 | static void | |
492 | finish_cond (tree *cond_p, tree expr) | |
493 | { | |
494 | if (processing_template_decl) | |
35b1567d | 495 | { |
caf2523d | 496 | tree cond = pop_stmt_list (*cond_p); |
350fae66 | 497 | if (TREE_CODE (cond) == DECL_EXPR) |
caf2523d | 498 | expr = cond; |
5d80a306 | 499 | |
7b3e2d46 | 500 | if (check_for_bare_parameter_packs (expr)) |
4439d02f | 501 | *cond_p = error_mark_node; |
35b1567d | 502 | } |
caf2523d | 503 | *cond_p = expr; |
35b1567d BC |
504 | } |
505 | ||
325c3691 RH |
506 | /* If *COND_P specifies a conditional with a declaration, transform the |
507 | loop such that | |
0cbd7506 MS |
508 | while (A x = 42) { } |
509 | for (; A x = 42;) { } | |
325c3691 | 510 | becomes |
0cbd7506 MS |
511 | while (true) { A x = 42; if (!x) break; } |
512 | for (;;) { A x = 42; if (!x) break; } | |
caf2523d RH |
513 | The statement list for BODY will be empty if the conditional did |
514 | not declare anything. */ | |
c8094d83 | 515 | |
325c3691 | 516 | static void |
caf2523d | 517 | simplify_loop_decl_cond (tree *cond_p, tree body) |
325c3691 | 518 | { |
caf2523d | 519 | tree cond, if_stmt; |
325c3691 | 520 | |
caf2523d RH |
521 | if (!TREE_SIDE_EFFECTS (body)) |
522 | return; | |
325c3691 | 523 | |
caf2523d RH |
524 | cond = *cond_p; |
525 | *cond_p = boolean_true_node; | |
c8094d83 | 526 | |
caf2523d | 527 | if_stmt = begin_if_stmt (); |
5ade1ed2 | 528 | cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error); |
caf2523d RH |
529 | finish_if_stmt_cond (cond, if_stmt); |
530 | finish_break_stmt (); | |
531 | finish_then_clause (if_stmt); | |
532 | finish_if_stmt (if_stmt); | |
533 | } | |
325c3691 | 534 | |
35b1567d BC |
535 | /* Finish a goto-statement. */ |
536 | ||
3e4d04a1 | 537 | tree |
3a978d72 | 538 | finish_goto_stmt (tree destination) |
35b1567d BC |
539 | { |
540 | if (TREE_CODE (destination) == IDENTIFIER_NODE) | |
541 | destination = lookup_label (destination); | |
542 | ||
543 | /* We warn about unused labels with -Wunused. That means we have to | |
544 | mark the used labels as used. */ | |
545 | if (TREE_CODE (destination) == LABEL_DECL) | |
546 | TREE_USED (destination) = 1; | |
fc2b8477 MM |
547 | else |
548 | { | |
549 | /* The DESTINATION is being used as an rvalue. */ | |
550 | if (!processing_template_decl) | |
f5651df1 JJ |
551 | { |
552 | destination = decay_conversion (destination); | |
553 | destination = cp_convert (ptr_type_node, destination); | |
554 | if (error_operand_p (destination)) | |
555 | return NULL_TREE; | |
556 | } | |
fc2b8477 MM |
557 | /* We don't inline calls to functions with computed gotos. |
558 | Those functions are typically up to some funny business, | |
559 | and may be depending on the labels being at particular | |
560 | addresses, or some such. */ | |
561 | DECL_UNINLINABLE (current_function_decl) = 1; | |
562 | } | |
c8094d83 | 563 | |
35b1567d BC |
564 | check_goto (destination); |
565 | ||
c2255bc4 | 566 | return add_stmt (build_stmt (input_location, GOTO_EXPR, destination)); |
35b1567d BC |
567 | } |
568 | ||
ed5511d9 | 569 | /* COND is the condition-expression for an if, while, etc., |
d4033c81 MLI |
570 | statement. Convert it to a boolean value, if appropriate. |
571 | In addition, verify sequence points if -Wsequence-point is enabled. */ | |
ed5511d9 | 572 | |
8ce33230 | 573 | static tree |
3a978d72 | 574 | maybe_convert_cond (tree cond) |
ed5511d9 MM |
575 | { |
576 | /* Empty conditions remain empty. */ | |
577 | if (!cond) | |
578 | return NULL_TREE; | |
579 | ||
580 | /* Wait until we instantiate templates before doing conversion. */ | |
581 | if (processing_template_decl) | |
582 | return cond; | |
583 | ||
d4033c81 MLI |
584 | if (warn_sequence_point) |
585 | verify_sequence_points (cond); | |
586 | ||
ed5511d9 MM |
587 | /* Do the conversion. */ |
588 | cond = convert_from_reference (cond); | |
fbc8d2d3 ILT |
589 | |
590 | if (TREE_CODE (cond) == MODIFY_EXPR | |
591 | && !TREE_NO_WARNING (cond) | |
592 | && warn_parentheses) | |
593 | { | |
594 | warning (OPT_Wparentheses, | |
595 | "suggest parentheses around assignment used as truth value"); | |
596 | TREE_NO_WARNING (cond) = 1; | |
597 | } | |
598 | ||
ed5511d9 MM |
599 | return condition_conversion (cond); |
600 | } | |
601 | ||
9bfadf57 | 602 | /* Finish an expression-statement, whose EXPRESSION is as indicated. */ |
a7e4cfa0 | 603 | |
3e4d04a1 | 604 | tree |
3a978d72 | 605 | finish_expr_stmt (tree expr) |
ad321293 | 606 | { |
3e4d04a1 RH |
607 | tree r = NULL_TREE; |
608 | ||
ce4a0391 | 609 | if (expr != NULL_TREE) |
ad321293 | 610 | { |
a5bcc582 | 611 | if (!processing_template_decl) |
3a5b9284 RH |
612 | { |
613 | if (warn_sequence_point) | |
614 | verify_sequence_points (expr); | |
5ade1ed2 | 615 | expr = convert_to_void (expr, "statement", tf_warning_or_error); |
3a5b9284 | 616 | } |
47d4c811 | 617 | else if (!type_dependent_expression_p (expr)) |
5ade1ed2 DG |
618 | convert_to_void (build_non_dependent_expr (expr), "statement", |
619 | tf_warning_or_error); | |
325c3691 | 620 | |
7b3e2d46 | 621 | if (check_for_bare_parameter_packs (expr)) |
4439d02f | 622 | expr = error_mark_node; |
5d80a306 | 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) | |
c2255bc4 | 629 | expr = build_stmt (input_location, 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); | |
c2255bc4 | 650 | r = build_stmt (input_location, 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 (); |
35b1567d BC |
703 | } |
704 | ||
ad321293 MM |
705 | /* Begin a while-statement. Returns a newly created WHILE_STMT if |
706 | appropriate. */ | |
707 | ||
708 | tree | |
3a978d72 | 709 | begin_while_stmt (void) |
ad321293 MM |
710 | { |
711 | tree r; | |
c2255bc4 | 712 | r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE); |
ae499cce | 713 | add_stmt (r); |
325c3691 | 714 | WHILE_BODY (r) = do_pushlevel (sk_block); |
caf2523d | 715 | begin_cond (&WHILE_COND (r)); |
ad321293 MM |
716 | return r; |
717 | } | |
718 | ||
27d26ee7 | 719 | /* Process the COND of a while-statement, which may be given by |
ad321293 MM |
720 | WHILE_STMT. */ |
721 | ||
c8094d83 | 722 | void |
3a978d72 | 723 | finish_while_stmt_cond (tree cond, tree while_stmt) |
ad321293 | 724 | { |
caf2523d RH |
725 | finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond)); |
726 | simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt)); | |
ad321293 MM |
727 | } |
728 | ||
729 | /* Finish a while-statement, which may be given by WHILE_STMT. */ | |
730 | ||
c8094d83 | 731 | void |
3a978d72 | 732 | finish_while_stmt (tree while_stmt) |
ad321293 | 733 | { |
325c3691 | 734 | WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt)); |
ad321293 MM |
735 | finish_stmt (); |
736 | } | |
737 | ||
738 | /* Begin a do-statement. Returns a newly created DO_STMT if | |
739 | appropriate. */ | |
740 | ||
741 | tree | |
3a978d72 | 742 | begin_do_stmt (void) |
ad321293 | 743 | { |
c2255bc4 | 744 | tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE); |
ae499cce | 745 | add_stmt (r); |
325c3691 | 746 | DO_BODY (r) = push_stmt_list (); |
35b1567d | 747 | return r; |
ad321293 MM |
748 | } |
749 | ||
750 | /* Finish the body of a do-statement, which may be given by DO_STMT. */ | |
751 | ||
752 | void | |
3a978d72 | 753 | finish_do_body (tree do_stmt) |
ad321293 | 754 | { |
62e00e94 DM |
755 | tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt)); |
756 | ||
757 | if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body)) | |
758 | body = STATEMENT_LIST_TAIL (body)->stmt; | |
759 | ||
760 | if (IS_EMPTY_STMT (body)) | |
761 | warning (OPT_Wempty_body, | |
762 | "suggest explicit braces around empty body in %<do%> statement"); | |
ad321293 MM |
763 | } |
764 | ||
765 | /* Finish a do-statement, which may be given by DO_STMT, and whose | |
766 | COND is as indicated. */ | |
767 | ||
768 | void | |
3a978d72 | 769 | finish_do_stmt (tree cond, tree do_stmt) |
ad321293 | 770 | { |
ed5511d9 | 771 | cond = maybe_convert_cond (cond); |
35b1567d BC |
772 | DO_COND (do_stmt) = cond; |
773 | finish_stmt (); | |
774 | } | |
ed5511d9 | 775 | |
ad321293 MM |
776 | /* Finish a return-statement. The EXPRESSION returned, if any, is as |
777 | indicated. */ | |
778 | ||
3e4d04a1 | 779 | tree |
3a978d72 | 780 | finish_return_stmt (tree expr) |
ad321293 | 781 | { |
3e4d04a1 | 782 | tree r; |
0c9b182b | 783 | bool no_warning; |
3e4d04a1 | 784 | |
0c9b182b | 785 | expr = check_return_expr (expr, &no_warning); |
1799e5d5 RH |
786 | |
787 | if (flag_openmp && !check_omp_return ()) | |
788 | return error_mark_node; | |
35b1567d | 789 | if (!processing_template_decl) |
efee38a9 | 790 | { |
d4033c81 MLI |
791 | if (warn_sequence_point) |
792 | verify_sequence_points (expr); | |
793 | ||
44d10c10 | 794 | if (DECL_DESTRUCTOR_P (current_function_decl) |
c8094d83 | 795 | || (DECL_CONSTRUCTOR_P (current_function_decl) |
44d10c10 | 796 | && targetm.cxx.cdtor_returns_this ())) |
efee38a9 MM |
797 | { |
798 | /* Similarly, all destructors must run destructors for | |
799 | base-classes before returning. So, all returns in a | |
dfbb4f34 | 800 | destructor get sent to the DTOR_LABEL; finish_function emits |
efee38a9 | 801 | code to return a value there. */ |
44d10c10 | 802 | return finish_goto_stmt (cdtor_label); |
efee38a9 MM |
803 | } |
804 | } | |
543a0daa | 805 | |
c2255bc4 | 806 | r = build_stmt (input_location, RETURN_EXPR, expr); |
0c9b182b | 807 | TREE_NO_WARNING (r) |= no_warning; |
0ad28dde | 808 | r = maybe_cleanup_point_expr_void (r); |
543a0daa | 809 | r = add_stmt (r); |
35b1567d | 810 | finish_stmt (); |
3e4d04a1 RH |
811 | |
812 | return r; | |
35b1567d | 813 | } |
efee38a9 | 814 | |
ad321293 MM |
815 | /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */ |
816 | ||
817 | tree | |
3a978d72 | 818 | begin_for_stmt (void) |
ad321293 MM |
819 | { |
820 | tree r; | |
821 | ||
c2255bc4 | 822 | r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE, |
0dfdeca6 | 823 | NULL_TREE, NULL_TREE); |
325c3691 RH |
824 | |
825 | if (flag_new_for_scope > 0) | |
826 | TREE_CHAIN (r) = do_pushlevel (sk_for); | |
ad321293 | 827 | |
894ca2c9 RH |
828 | if (processing_template_decl) |
829 | FOR_INIT_STMT (r) = push_stmt_list (); | |
830 | ||
ad321293 MM |
831 | return r; |
832 | } | |
833 | ||
834 | /* Finish the for-init-statement of a for-statement, which may be | |
835 | given by FOR_STMT. */ | |
836 | ||
837 | void | |
3a978d72 | 838 | finish_for_init_stmt (tree for_stmt) |
ad321293 | 839 | { |
894ca2c9 RH |
840 | if (processing_template_decl) |
841 | FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt)); | |
325c3691 RH |
842 | add_stmt (for_stmt); |
843 | FOR_BODY (for_stmt) = do_pushlevel (sk_block); | |
caf2523d | 844 | begin_cond (&FOR_COND (for_stmt)); |
ad321293 MM |
845 | } |
846 | ||
847 | /* Finish the COND of a for-statement, which may be given by | |
848 | FOR_STMT. */ | |
849 | ||
850 | void | |
3a978d72 | 851 | finish_for_cond (tree cond, tree for_stmt) |
ad321293 | 852 | { |
caf2523d RH |
853 | finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond)); |
854 | simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt)); | |
ad321293 MM |
855 | } |
856 | ||
857 | /* Finish the increment-EXPRESSION in a for-statement, which may be | |
858 | given by FOR_STMT. */ | |
859 | ||
860 | void | |
3a978d72 | 861 | finish_for_expr (tree expr, tree for_stmt) |
ad321293 | 862 | { |
543a0daa RH |
863 | if (!expr) |
864 | return; | |
6f69173e MM |
865 | /* If EXPR is an overloaded function, issue an error; there is no |
866 | context available to use to perform overload resolution. */ | |
543a0daa | 867 | if (type_unknown_p (expr)) |
6f69173e MM |
868 | { |
869 | cxx_incomplete_type_error (expr, TREE_TYPE (expr)); | |
870 | expr = error_mark_node; | |
871 | } | |
bcd46a7c AP |
872 | if (!processing_template_decl) |
873 | { | |
874 | if (warn_sequence_point) | |
0cbd7506 | 875 | verify_sequence_points (expr); |
5ade1ed2 DG |
876 | expr = convert_to_void (expr, "3rd expression in for", |
877 | tf_warning_or_error); | |
bcd46a7c AP |
878 | } |
879 | else if (!type_dependent_expression_p (expr)) | |
5ade1ed2 DG |
880 | convert_to_void (build_non_dependent_expr (expr), "3rd expression in for", |
881 | tf_warning_or_error); | |
0ad28dde | 882 | expr = maybe_cleanup_point_expr_void (expr); |
7b3e2d46 | 883 | if (check_for_bare_parameter_packs (expr)) |
4439d02f | 884 | expr = error_mark_node; |
35b1567d | 885 | FOR_EXPR (for_stmt) = expr; |
ad321293 MM |
886 | } |
887 | ||
888 | /* Finish the body of a for-statement, which may be given by | |
889 | FOR_STMT. The increment-EXPR for the loop must be | |
890 | provided. */ | |
891 | ||
892 | void | |
3a978d72 | 893 | finish_for_stmt (tree for_stmt) |
ad321293 | 894 | { |
325c3691 RH |
895 | FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt)); |
896 | ||
ad321293 | 897 | /* Pop the scope for the body of the loop. */ |
325c3691 RH |
898 | if (flag_new_for_scope > 0) |
899 | { | |
900 | tree scope = TREE_CHAIN (for_stmt); | |
901 | TREE_CHAIN (for_stmt) = NULL; | |
902 | add_stmt (do_poplevel (scope)); | |
903 | } | |
904 | ||
c8094d83 | 905 | finish_stmt (); |
ad321293 MM |
906 | } |
907 | ||
908 | /* Finish a break-statement. */ | |
909 | ||
3e4d04a1 | 910 | tree |
3a978d72 | 911 | finish_break_stmt (void) |
ad321293 | 912 | { |
c2255bc4 | 913 | return add_stmt (build_stmt (input_location, BREAK_STMT)); |
35b1567d BC |
914 | } |
915 | ||
ad321293 MM |
916 | /* Finish a continue-statement. */ |
917 | ||
3e4d04a1 | 918 | tree |
3a978d72 | 919 | finish_continue_stmt (void) |
ad321293 | 920 | { |
c2255bc4 | 921 | return add_stmt (build_stmt (input_location, CONTINUE_STMT)); |
ad321293 MM |
922 | } |
923 | ||
35b1567d BC |
924 | /* Begin a switch-statement. Returns a new SWITCH_STMT if |
925 | appropriate. */ | |
926 | ||
927 | tree | |
3a978d72 | 928 | begin_switch_stmt (void) |
35b1567d | 929 | { |
325c3691 RH |
930 | tree r, scope; |
931 | ||
c2255bc4 | 932 | r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE); |
325c3691 RH |
933 | |
934 | scope = do_pushlevel (sk_block); | |
935 | TREE_CHAIN (r) = scope; | |
ebaae582 | 936 | begin_cond (&SWITCH_STMT_COND (r)); |
325c3691 | 937 | |
527f0080 | 938 | return r; |
ad321293 MM |
939 | } |
940 | ||
527f0080 | 941 | /* Finish the cond of a switch-statement. */ |
ad321293 | 942 | |
527f0080 | 943 | void |
3a978d72 | 944 | finish_switch_cond (tree cond, tree switch_stmt) |
ad321293 | 945 | { |
6f9fdf4d | 946 | tree orig_type = NULL; |
35b1567d | 947 | if (!processing_template_decl) |
373eb3b3 | 948 | { |
35b1567d | 949 | /* Convert the condition to an integer or enumeration type. */ |
b746c5dc | 950 | cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true); |
35b1567d | 951 | if (cond == NULL_TREE) |
373eb3b3 | 952 | { |
35b1567d BC |
953 | error ("switch quantity not an integer"); |
954 | cond = error_mark_node; | |
955 | } | |
6f9fdf4d | 956 | orig_type = TREE_TYPE (cond); |
35b1567d BC |
957 | if (cond != error_mark_node) |
958 | { | |
0a72704b MM |
959 | /* [stmt.switch] |
960 | ||
961 | Integral promotions are performed. */ | |
962 | cond = perform_integral_promotions (cond); | |
543a0daa | 963 | cond = maybe_cleanup_point_expr (cond); |
373eb3b3 | 964 | } |
ad321293 | 965 | } |
7b3e2d46 | 966 | if (check_for_bare_parameter_packs (cond)) |
4439d02f | 967 | cond = error_mark_node; |
d4033c81 MLI |
968 | else if (!processing_template_decl && warn_sequence_point) |
969 | verify_sequence_points (cond); | |
970 | ||
ebaae582 SB |
971 | finish_cond (&SWITCH_STMT_COND (switch_stmt), cond); |
972 | SWITCH_STMT_TYPE (switch_stmt) = orig_type; | |
caf2523d | 973 | add_stmt (switch_stmt); |
56cb9733 | 974 | push_switch (switch_stmt); |
ebaae582 | 975 | SWITCH_STMT_BODY (switch_stmt) = push_stmt_list (); |
ad321293 MM |
976 | } |
977 | ||
978 | /* Finish the body of a switch-statement, which may be given by | |
979 | SWITCH_STMT. The COND to switch on is indicated. */ | |
980 | ||
981 | void | |
3a978d72 | 982 | finish_switch_stmt (tree switch_stmt) |
ad321293 | 983 | { |
325c3691 RH |
984 | tree scope; |
985 | ||
ebaae582 SB |
986 | SWITCH_STMT_BODY (switch_stmt) = |
987 | pop_stmt_list (SWITCH_STMT_BODY (switch_stmt)); | |
c8094d83 | 988 | pop_switch (); |
ad321293 | 989 | finish_stmt (); |
325c3691 RH |
990 | |
991 | scope = TREE_CHAIN (switch_stmt); | |
992 | TREE_CHAIN (switch_stmt) = NULL; | |
993 | add_stmt (do_poplevel (scope)); | |
ad321293 MM |
994 | } |
995 | ||
ad321293 MM |
996 | /* Begin a try-block. Returns a newly-created TRY_BLOCK if |
997 | appropriate. */ | |
998 | ||
999 | tree | |
3a978d72 | 1000 | begin_try_block (void) |
ad321293 | 1001 | { |
c2255bc4 | 1002 | tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE); |
ae499cce | 1003 | add_stmt (r); |
325c3691 | 1004 | TRY_STMTS (r) = push_stmt_list (); |
35b1567d | 1005 | return r; |
ad321293 MM |
1006 | } |
1007 | ||
eaf6fb90 MM |
1008 | /* Likewise, for a function-try-block. The block returned in |
1009 | *COMPOUND_STMT is an artificial outer scope, containing the | |
1010 | function-try-block. */ | |
0dde4175 JM |
1011 | |
1012 | tree | |
eaf6fb90 | 1013 | begin_function_try_block (tree *compound_stmt) |
0dde4175 | 1014 | { |
eaf6fb90 MM |
1015 | tree r; |
1016 | /* This outer scope does not exist in the C++ standard, but we need | |
1017 | a place to put __FUNCTION__ and similar variables. */ | |
1018 | *compound_stmt = begin_compound_stmt (0); | |
1019 | r = begin_try_block (); | |
35b1567d | 1020 | FN_TRY_BLOCK_P (r) = 1; |
35b1567d | 1021 | return r; |
0dde4175 JM |
1022 | } |
1023 | ||
ad321293 MM |
1024 | /* Finish a try-block, which may be given by TRY_BLOCK. */ |
1025 | ||
1026 | void | |
3a978d72 | 1027 | finish_try_block (tree try_block) |
ad321293 | 1028 | { |
325c3691 RH |
1029 | TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block)); |
1030 | TRY_HANDLERS (try_block) = push_stmt_list (); | |
ad321293 MM |
1031 | } |
1032 | ||
efa8eda3 MM |
1033 | /* Finish the body of a cleanup try-block, which may be given by |
1034 | TRY_BLOCK. */ | |
1035 | ||
62409b39 | 1036 | void |
3a978d72 | 1037 | finish_cleanup_try_block (tree try_block) |
62409b39 | 1038 | { |
325c3691 | 1039 | TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block)); |
62409b39 MM |
1040 | } |
1041 | ||
f1dedc31 MM |
1042 | /* Finish an implicitly generated try-block, with a cleanup is given |
1043 | by CLEANUP. */ | |
1044 | ||
1045 | void | |
3a978d72 | 1046 | finish_cleanup (tree cleanup, tree try_block) |
f1dedc31 | 1047 | { |
35b1567d BC |
1048 | TRY_HANDLERS (try_block) = cleanup; |
1049 | CLEANUP_P (try_block) = 1; | |
f1dedc31 MM |
1050 | } |
1051 | ||
0dde4175 JM |
1052 | /* Likewise, for a function-try-block. */ |
1053 | ||
1054 | void | |
3a978d72 | 1055 | finish_function_try_block (tree try_block) |
0dde4175 | 1056 | { |
325c3691 RH |
1057 | finish_try_block (try_block); |
1058 | /* FIXME : something queer about CTOR_INITIALIZER somehow following | |
1059 | the try block, but moving it inside. */ | |
b35d4555 | 1060 | in_function_try_handler = 1; |
0dde4175 JM |
1061 | } |
1062 | ||
ad321293 MM |
1063 | /* Finish a handler-sequence for a try-block, which may be given by |
1064 | TRY_BLOCK. */ | |
1065 | ||
1066 | void | |
3a978d72 | 1067 | finish_handler_sequence (tree try_block) |
ad321293 | 1068 | { |
325c3691 | 1069 | TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block)); |
35b1567d | 1070 | check_handlers (TRY_HANDLERS (try_block)); |
ad321293 MM |
1071 | } |
1072 | ||
eaf6fb90 MM |
1073 | /* Finish the handler-seq for a function-try-block, given by |
1074 | TRY_BLOCK. COMPOUND_STMT is the outer block created by | |
1075 | begin_function_try_block. */ | |
0dde4175 JM |
1076 | |
1077 | void | |
eaf6fb90 | 1078 | finish_function_handler_sequence (tree try_block, tree compound_stmt) |
0dde4175 | 1079 | { |
b35d4555 | 1080 | in_function_try_handler = 0; |
325c3691 | 1081 | finish_handler_sequence (try_block); |
eaf6fb90 | 1082 | finish_compound_stmt (compound_stmt); |
35b1567d BC |
1083 | } |
1084 | ||
ad321293 MM |
1085 | /* Begin a handler. Returns a HANDLER if appropriate. */ |
1086 | ||
1087 | tree | |
3a978d72 | 1088 | begin_handler (void) |
ad321293 MM |
1089 | { |
1090 | tree r; | |
325c3691 | 1091 | |
c2255bc4 | 1092 | r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE); |
ae499cce | 1093 | add_stmt (r); |
325c3691 | 1094 | |
1a6025b4 JM |
1095 | /* Create a binding level for the eh_info and the exception object |
1096 | cleanup. */ | |
325c3691 RH |
1097 | HANDLER_BODY (r) = do_pushlevel (sk_catch); |
1098 | ||
ad321293 MM |
1099 | return r; |
1100 | } | |
1101 | ||
1102 | /* Finish the handler-parameters for a handler, which may be given by | |
b35d4555 MM |
1103 | HANDLER. DECL is the declaration for the catch parameter, or NULL |
1104 | if this is a `catch (...)' clause. */ | |
ad321293 | 1105 | |
1a6025b4 | 1106 | void |
3a978d72 | 1107 | finish_handler_parms (tree decl, tree handler) |
b35d4555 | 1108 | { |
1a6025b4 | 1109 | tree type = NULL_TREE; |
b35d4555 MM |
1110 | if (processing_template_decl) |
1111 | { | |
1112 | if (decl) | |
1113 | { | |
1114 | decl = pushdecl (decl); | |
1115 | decl = push_template_decl (decl); | |
325c3691 | 1116 | HANDLER_PARMS (handler) = decl; |
1a6025b4 | 1117 | type = TREE_TYPE (decl); |
b35d4555 MM |
1118 | } |
1119 | } | |
35b1567d | 1120 | else |
1a6025b4 | 1121 | type = expand_start_catch_block (decl); |
1a6025b4 | 1122 | HANDLER_TYPE (handler) = type; |
b80cfdcd | 1123 | if (!processing_template_decl && type) |
6cad4e17 | 1124 | mark_used (eh_type_info (type)); |
35b1567d BC |
1125 | } |
1126 | ||
1127 | /* Finish a handler, which may be given by HANDLER. The BLOCKs are | |
1128 | the return value from the matching call to finish_handler_parms. */ | |
1129 | ||
1130 | void | |
3a978d72 | 1131 | finish_handler (tree handler) |
35b1567d BC |
1132 | { |
1133 | if (!processing_template_decl) | |
1a6025b4 | 1134 | expand_end_catch_block (); |
325c3691 | 1135 | HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler)); |
35b1567d BC |
1136 | } |
1137 | ||
5882f0f3 | 1138 | /* Begin a compound statement. FLAGS contains some bits that control the |
5995ebfb | 1139 | behavior and context. If BCS_NO_SCOPE is set, the compound statement |
5882f0f3 | 1140 | does not define a scope. If BCS_FN_BODY is set, this is the outermost |
c8094d83 | 1141 | block of a function. If BCS_TRY_BLOCK is set, this is the block |
5882f0f3 RH |
1142 | created on behalf of a TRY statement. Returns a token to be passed to |
1143 | finish_compound_stmt. */ | |
ad321293 MM |
1144 | |
1145 | tree | |
325c3691 | 1146 | begin_compound_stmt (unsigned int flags) |
ad321293 | 1147 | { |
325c3691 | 1148 | tree r; |
558475f0 | 1149 | |
325c3691 RH |
1150 | if (flags & BCS_NO_SCOPE) |
1151 | { | |
1152 | r = push_stmt_list (); | |
1153 | STATEMENT_LIST_NO_SCOPE (r) = 1; | |
1154 | ||
1155 | /* Normally, we try hard to keep the BLOCK for a statement-expression. | |
1156 | But, if it's a statement-expression with a scopeless block, there's | |
1157 | nothing to keep, and we don't want to accidentally keep a block | |
c8094d83 | 1158 | *inside* the scopeless block. */ |
325c3691 RH |
1159 | keep_next_level (false); |
1160 | } | |
f1dedc31 | 1161 | else |
325c3691 RH |
1162 | r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block); |
1163 | ||
5882f0f3 RH |
1164 | /* When processing a template, we need to remember where the braces were, |
1165 | so that we can set up identical scopes when instantiating the template | |
1166 | later. BIND_EXPR is a handy candidate for this. | |
1167 | Note that do_poplevel won't create a BIND_EXPR itself here (and thus | |
1168 | result in nested BIND_EXPRs), since we don't build BLOCK nodes when | |
1169 | processing templates. */ | |
1170 | if (processing_template_decl) | |
325c3691 | 1171 | { |
f293ce4b | 1172 | r = build3 (BIND_EXPR, NULL, NULL, r, NULL); |
5882f0f3 RH |
1173 | BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0; |
1174 | BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0; | |
325c3691 RH |
1175 | TREE_SIDE_EFFECTS (r) = 1; |
1176 | } | |
ad321293 MM |
1177 | |
1178 | return r; | |
1179 | } | |
1180 | ||
5882f0f3 | 1181 | /* Finish a compound-statement, which is given by STMT. */ |
ad321293 | 1182 | |
325c3691 RH |
1183 | void |
1184 | finish_compound_stmt (tree stmt) | |
ad321293 | 1185 | { |
5882f0f3 RH |
1186 | if (TREE_CODE (stmt) == BIND_EXPR) |
1187 | BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt)); | |
325c3691 RH |
1188 | else if (STATEMENT_LIST_NO_SCOPE (stmt)) |
1189 | stmt = pop_stmt_list (stmt); | |
7a3397c7 | 1190 | else |
5f070bc7 ZL |
1191 | { |
1192 | /* Destroy any ObjC "super" receivers that may have been | |
1193 | created. */ | |
1194 | objc_clear_super_receiver (); | |
1195 | ||
1196 | stmt = do_poplevel (stmt); | |
1197 | } | |
ad321293 | 1198 | |
325c3691 RH |
1199 | /* ??? See c_end_compound_stmt wrt statement expressions. */ |
1200 | add_stmt (stmt); | |
ad321293 | 1201 | finish_stmt (); |
ad321293 MM |
1202 | } |
1203 | ||
6de9cd9a | 1204 | /* Finish an asm-statement, whose components are a STRING, some |
1c384bf1 RH |
1205 | OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some |
1206 | LABELS. Also note whether the asm-statement should be | |
1207 | considered volatile. */ | |
7dc5bd62 | 1208 | |
3e4d04a1 | 1209 | tree |
6de9cd9a | 1210 | finish_asm_stmt (int volatile_p, tree string, tree output_operands, |
1c384bf1 | 1211 | tree input_operands, tree clobbers, tree labels) |
35b1567d BC |
1212 | { |
1213 | tree r; | |
abfc8a36 | 1214 | tree t; |
5544530a PB |
1215 | int ninputs = list_length (input_operands); |
1216 | int noutputs = list_length (output_operands); | |
abfc8a36 | 1217 | |
abfc8a36 | 1218 | if (!processing_template_decl) |
40b18c0a | 1219 | { |
74f0c611 RH |
1220 | const char *constraint; |
1221 | const char **oconstraints; | |
1222 | bool allows_mem, allows_reg, is_inout; | |
1223 | tree operand; | |
40b18c0a | 1224 | int i; |
40b18c0a | 1225 | |
74f0c611 RH |
1226 | oconstraints = (const char **) alloca (noutputs * sizeof (char *)); |
1227 | ||
1228 | string = resolve_asm_operand_names (string, output_operands, | |
1c384bf1 | 1229 | input_operands, labels); |
74f0c611 RH |
1230 | |
1231 | for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i) | |
40b18c0a | 1232 | { |
74f0c611 RH |
1233 | operand = TREE_VALUE (t); |
1234 | ||
1235 | /* ??? Really, this should not be here. Users should be using a | |
1236 | proper lvalue, dammit. But there's a long history of using | |
1237 | casts in the output operands. In cases like longlong.h, this | |
1238 | becomes a primitive form of typechecking -- if the cast can be | |
1239 | removed, then the output operand had a type of the proper width; | |
1240 | otherwise we'll get an error. Gross, but ... */ | |
1241 | STRIP_NOPS (operand); | |
1242 | ||
5ade1ed2 | 1243 | if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error)) |
74f0c611 RH |
1244 | operand = error_mark_node; |
1245 | ||
3db45ab5 | 1246 | if (operand != error_mark_node |
5544530a PB |
1247 | && (TREE_READONLY (operand) |
1248 | || CP_TYPE_CONST_P (TREE_TYPE (operand)) | |
3db45ab5 MS |
1249 | /* Functions are not modifiable, even though they are |
1250 | lvalues. */ | |
1251 | || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE | |
1252 | || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE | |
1253 | /* If it's an aggregate and any field is const, then it is | |
1254 | effectively const. */ | |
1255 | || (CLASS_TYPE_P (TREE_TYPE (operand)) | |
1256 | && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand))))) | |
4cd5a50a | 1257 | readonly_error (operand, REK_ASSIGNMENT_ASM); |
5544530a | 1258 | |
74f0c611 RH |
1259 | constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t))); |
1260 | oconstraints[i] = constraint; | |
1261 | ||
1262 | if (parse_output_constraint (&constraint, i, ninputs, noutputs, | |
1263 | &allows_mem, &allows_reg, &is_inout)) | |
1264 | { | |
1265 | /* If the operand is going to end up in memory, | |
1266 | mark it addressable. */ | |
1267 | if (!allows_reg && !cxx_mark_addressable (operand)) | |
1268 | operand = error_mark_node; | |
1269 | } | |
1270 | else | |
1271 | operand = error_mark_node; | |
1272 | ||
1273 | TREE_VALUE (t) = operand; | |
1274 | } | |
1275 | ||
1276 | for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t)) | |
1277 | { | |
1278 | constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t))); | |
c8094d83 | 1279 | operand = decay_conversion (TREE_VALUE (t)); |
74f0c611 | 1280 | |
40b18c0a MM |
1281 | /* If the type of the operand hasn't been determined (e.g., |
1282 | because it involves an overloaded function), then issue | |
1283 | an error message. There's no context available to | |
1284 | resolve the overloading. */ | |
74f0c611 | 1285 | if (TREE_TYPE (operand) == unknown_type_node) |
40b18c0a | 1286 | { |
c8094d83 | 1287 | error ("type of asm operand %qE could not be determined", |
0cbd7506 | 1288 | TREE_VALUE (t)); |
74f0c611 | 1289 | operand = error_mark_node; |
40b18c0a | 1290 | } |
40b18c0a | 1291 | |
74f0c611 RH |
1292 | if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0, |
1293 | oconstraints, &allows_mem, &allows_reg)) | |
40b18c0a | 1294 | { |
74f0c611 RH |
1295 | /* If the operand is going to end up in memory, |
1296 | mark it addressable. */ | |
b4c33883 AP |
1297 | if (!allows_reg && allows_mem) |
1298 | { | |
1299 | /* Strip the nops as we allow this case. FIXME, this really | |
1300 | should be rejected or made deprecated. */ | |
1301 | STRIP_NOPS (operand); | |
1302 | if (!cxx_mark_addressable (operand)) | |
1303 | operand = error_mark_node; | |
1304 | } | |
40b18c0a | 1305 | } |
74f0c611 RH |
1306 | else |
1307 | operand = error_mark_node; | |
40b18c0a | 1308 | |
74f0c611 | 1309 | TREE_VALUE (t) = operand; |
40b18c0a MM |
1310 | } |
1311 | } | |
abfc8a36 | 1312 | |
c2255bc4 | 1313 | r = build_stmt (input_location, ASM_EXPR, string, |
0dfdeca6 | 1314 | output_operands, input_operands, |
1c384bf1 | 1315 | clobbers, labels); |
5544530a | 1316 | ASM_VOLATILE_P (r) = volatile_p || noutputs == 0; |
0ad28dde | 1317 | r = maybe_cleanup_point_expr_void (r); |
3e4d04a1 | 1318 | return add_stmt (r); |
ad321293 | 1319 | } |
b4c4a9ec | 1320 | |
5bca4e80 | 1321 | /* Finish a label with the indicated NAME. Returns the new label. */ |
f01b0acb | 1322 | |
a723baf1 | 1323 | tree |
3a978d72 | 1324 | finish_label_stmt (tree name) |
f01b0acb | 1325 | { |
5b030314 | 1326 | tree decl = define_label (input_location, name); |
417fa55b | 1327 | |
5bca4e80 | 1328 | if (decl == error_mark_node) |
417fa55b LM |
1329 | return error_mark_node; |
1330 | ||
c2255bc4 | 1331 | add_stmt (build_stmt (input_location, LABEL_EXPR, decl)); |
5bca4e80 ILT |
1332 | |
1333 | return decl; | |
f01b0acb MM |
1334 | } |
1335 | ||
acef433b MM |
1336 | /* Finish a series of declarations for local labels. G++ allows users |
1337 | to declare "local" labels, i.e., labels with scope. This extension | |
1338 | is useful when writing code involving statement-expressions. */ | |
1339 | ||
1340 | void | |
3a978d72 | 1341 | finish_label_decl (tree name) |
acef433b | 1342 | { |
a6d76a95 PC |
1343 | if (!at_function_scope_p ()) |
1344 | { | |
1345 | error ("__label__ declarations are only allowed in function scopes"); | |
1346 | return; | |
1347 | } | |
1348 | ||
1349 | add_decl_expr (declare_local_label (name)); | |
acef433b MM |
1350 | } |
1351 | ||
659e5a7a | 1352 | /* When DECL goes out of scope, make sure that CLEANUP is executed. */ |
f1dedc31 | 1353 | |
c8094d83 | 1354 | void |
3a978d72 | 1355 | finish_decl_cleanup (tree decl, tree cleanup) |
f1dedc31 | 1356 | { |
325c3691 | 1357 | push_cleanup (decl, cleanup, false); |
35b1567d BC |
1358 | } |
1359 | ||
659e5a7a | 1360 | /* If the current scope exits with an exception, run CLEANUP. */ |
24bef158 | 1361 | |
659e5a7a | 1362 | void |
3a978d72 | 1363 | finish_eh_cleanup (tree cleanup) |
24bef158 | 1364 | { |
325c3691 | 1365 | push_cleanup (NULL, cleanup, true); |
35b1567d BC |
1366 | } |
1367 | ||
2282d28d MM |
1368 | /* The MEM_INITS is a list of mem-initializers, in reverse of the |
1369 | order they were written by the user. Each node is as for | |
1370 | emit_mem_initializers. */ | |
bf3428d0 MM |
1371 | |
1372 | void | |
2282d28d | 1373 | finish_mem_initializers (tree mem_inits) |
bf3428d0 | 1374 | { |
2282d28d MM |
1375 | /* Reorder the MEM_INITS so that they are in the order they appeared |
1376 | in the source program. */ | |
1377 | mem_inits = nreverse (mem_inits); | |
bf3428d0 | 1378 | |
a0de9d20 | 1379 | if (processing_template_decl) |
5d80a306 DG |
1380 | { |
1381 | tree mem; | |
1382 | ||
1383 | for (mem = mem_inits; mem; mem = TREE_CHAIN (mem)) | |
1384 | { | |
1385 | /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the | |
1386 | check for bare parameter packs in the TREE_VALUE, because | |
1387 | any parameter packs in the TREE_VALUE have already been | |
1388 | bound as part of the TREE_PURPOSE. See | |
1389 | make_pack_expansion for more information. */ | |
4439d02f | 1390 | if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION |
7b3e2d46 | 1391 | && check_for_bare_parameter_packs (TREE_VALUE (mem))) |
4439d02f | 1392 | TREE_VALUE (mem) = error_mark_node; |
5d80a306 DG |
1393 | } |
1394 | ||
1395 | add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits)); | |
1396 | } | |
cdd2559c | 1397 | else |
2282d28d | 1398 | emit_mem_initializers (mem_inits); |
558475f0 MM |
1399 | } |
1400 | ||
b4c4a9ec MM |
1401 | /* Finish a parenthesized expression EXPR. */ |
1402 | ||
1403 | tree | |
3a978d72 | 1404 | finish_parenthesized_expr (tree expr) |
b4c4a9ec | 1405 | { |
6615c446 | 1406 | if (EXPR_P (expr)) |
78ef5b89 | 1407 | /* This inhibits warnings in c_common_truthvalue_conversion. */ |
31ec7d2f | 1408 | TREE_NO_WARNING (expr) = 1; |
b4c4a9ec | 1409 | |
19420d00 NS |
1410 | if (TREE_CODE (expr) == OFFSET_REF) |
1411 | /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be | |
1412 | enclosed in parentheses. */ | |
1413 | PTRMEM_OK_P (expr) = 0; | |
c8094d83 | 1414 | |
7a8380ae NS |
1415 | if (TREE_CODE (expr) == STRING_CST) |
1416 | PAREN_STRING_LITERAL_P (expr) = 1; | |
c8094d83 | 1417 | |
b4c4a9ec MM |
1418 | return expr; |
1419 | } | |
1420 | ||
a723baf1 MM |
1421 | /* Finish a reference to a non-static data member (DECL) that is not |
1422 | preceded by `.' or `->'. */ | |
1423 | ||
1424 | tree | |
a3f10e50 | 1425 | finish_non_static_data_member (tree decl, tree object, tree qualifying_scope) |
a723baf1 | 1426 | { |
50bc768d | 1427 | gcc_assert (TREE_CODE (decl) == FIELD_DECL); |
a723baf1 | 1428 | |
7d882b83 | 1429 | if (!object && cp_unevaluated_operand != 0) |
51fc2d02 JM |
1430 | { |
1431 | /* DR 613: Can use non-static data members without an associated | |
1432 | object in sizeof/decltype/alignof. */ | |
1433 | tree scope = qualifying_scope; | |
1434 | if (scope == NULL_TREE) | |
1435 | scope = context_for_name_lookup (decl); | |
1436 | object = maybe_dummy_object (scope, NULL); | |
1437 | } | |
1438 | ||
a3f10e50 | 1439 | if (!object) |
a723baf1 | 1440 | { |
c8094d83 | 1441 | if (current_function_decl |
a723baf1 | 1442 | && DECL_STATIC_FUNCTION_P (current_function_decl)) |
dee15844 | 1443 | error ("invalid use of member %q+D in static member function", decl); |
a723baf1 | 1444 | else |
dee15844 | 1445 | error ("invalid use of non-static data member %q+D", decl); |
a723baf1 MM |
1446 | error ("from this location"); |
1447 | ||
1448 | return error_mark_node; | |
1449 | } | |
d5f4eddd | 1450 | |
9660afe0 JM |
1451 | /* If decl is a non-capture field and object has a lambda type, |
1452 | then we have a reference to a member of 'this' from a | |
d5f4eddd JM |
1453 | lambda inside a non-static member function, and we must get to decl |
1454 | through the 'this' capture. If decl is not a member of that object, | |
1455 | either, then its access will still fail later. */ | |
1456 | if (LAMBDA_TYPE_P (TREE_TYPE (object)) | |
9660afe0 | 1457 | && !LAMBDA_TYPE_P (DECL_CONTEXT (decl))) |
d5f4eddd JM |
1458 | object = cp_build_indirect_ref (lambda_expr_this_capture |
1459 | (CLASSTYPE_LAMBDA_EXPR | |
1460 | (TREE_TYPE (object))), | |
1461 | /*errorstring=*/"", | |
1462 | /*complain=*/tf_warning_or_error); | |
1463 | ||
51fc2d02 JM |
1464 | if (current_class_ptr) |
1465 | TREE_USED (current_class_ptr) = 1; | |
58e1d54c | 1466 | if (processing_template_decl && !qualifying_scope) |
a723baf1 | 1467 | { |
a3f10e50 | 1468 | tree type = TREE_TYPE (decl); |
a723baf1 | 1469 | |
a3f10e50 NS |
1470 | if (TREE_CODE (type) == REFERENCE_TYPE) |
1471 | type = TREE_TYPE (type); | |
1472 | else | |
1473 | { | |
f4f206f4 | 1474 | /* Set the cv qualifiers. */ |
51fc2d02 JM |
1475 | int quals = (current_class_ref |
1476 | ? cp_type_quals (TREE_TYPE (current_class_ref)) | |
1477 | : TYPE_UNQUALIFIED); | |
c8094d83 | 1478 | |
a3f10e50 NS |
1479 | if (DECL_MUTABLE_P (decl)) |
1480 | quals &= ~TYPE_QUAL_CONST; | |
9e95d15f | 1481 | |
a3f10e50 NS |
1482 | quals |= cp_type_quals (TREE_TYPE (decl)); |
1483 | type = cp_build_qualified_type (type, quals); | |
1484 | } | |
c8094d83 | 1485 | |
44de5aeb | 1486 | return build_min (COMPONENT_REF, type, object, decl, NULL_TREE); |
a3f10e50 | 1487 | } |
ab11c13f JM |
1488 | /* If PROCESSING_TEMPLATE_DECL is nonzero here, then |
1489 | QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF | |
1490 | for now. */ | |
1491 | else if (processing_template_decl) | |
1492 | return build_qualified_name (TREE_TYPE (decl), | |
1493 | qualifying_scope, | |
1494 | DECL_NAME (decl), | |
1495 | /*template_p=*/false); | |
a3f10e50 NS |
1496 | else |
1497 | { | |
1498 | tree access_type = TREE_TYPE (object); | |
1499 | tree lookup_context = context_for_name_lookup (decl); | |
c8094d83 | 1500 | |
a3f10e50 | 1501 | while (!DERIVED_FROM_P (lookup_context, access_type)) |
a723baf1 MM |
1502 | { |
1503 | access_type = TYPE_CONTEXT (access_type); | |
9f01ded6 | 1504 | while (access_type && DECL_P (access_type)) |
a723baf1 | 1505 | access_type = DECL_CONTEXT (access_type); |
a723baf1 | 1506 | |
a3f10e50 NS |
1507 | if (!access_type) |
1508 | { | |
dee15844 | 1509 | error ("object missing in reference to %q+D", decl); |
a3f10e50 NS |
1510 | error ("from this location"); |
1511 | return error_mark_node; | |
1512 | } | |
9f01ded6 KL |
1513 | } |
1514 | ||
02022f3a SM |
1515 | perform_or_defer_access_check (TYPE_BINFO (access_type), decl, |
1516 | decl); | |
a723baf1 MM |
1517 | |
1518 | /* If the data member was named `C::M', convert `*this' to `C' | |
1519 | first. */ | |
1520 | if (qualifying_scope) | |
1521 | { | |
1522 | tree binfo = NULL_TREE; | |
1523 | object = build_scoped_ref (object, qualifying_scope, | |
1524 | &binfo); | |
1525 | } | |
1526 | ||
1527 | return build_class_member_access_expr (object, decl, | |
1528 | /*access_path=*/NULL_TREE, | |
5ade1ed2 DG |
1529 | /*preserve_reference=*/false, |
1530 | tf_warning_or_error); | |
a723baf1 MM |
1531 | } |
1532 | } | |
1533 | ||
aa373032 DS |
1534 | /* If we are currently parsing a template and we encountered a typedef |
1535 | TYPEDEF_DECL that is being accessed though CONTEXT, this function | |
1536 | adds the typedef to a list tied to the current template. | |
1537 | At tempate instantiatin time, that list is walked and access check | |
1538 | performed for each typedef. | |
1539 | LOCATION is the location of the usage point of TYPEDEF_DECL. */ | |
1540 | ||
1541 | void | |
1542 | add_typedef_to_current_template_for_access_check (tree typedef_decl, | |
1543 | tree context, | |
1544 | location_t location) | |
1545 | { | |
1546 | tree template_info = NULL; | |
1547 | tree cs = current_scope (); | |
1548 | ||
1549 | if (!is_typedef_decl (typedef_decl) | |
1550 | || !context | |
1551 | || !CLASS_TYPE_P (context) | |
1552 | || !cs) | |
1553 | return; | |
1554 | ||
1555 | if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL) | |
1556 | template_info = get_template_info (cs); | |
1557 | ||
1558 | if (template_info | |
1559 | && TI_TEMPLATE (template_info) | |
1560 | && !currently_open_class (context)) | |
1561 | append_type_to_template_for_access_check (cs, typedef_decl, | |
1562 | context, location); | |
1563 | } | |
1564 | ||
ee76b931 MM |
1565 | /* DECL was the declaration to which a qualified-id resolved. Issue |
1566 | an error message if it is not accessible. If OBJECT_TYPE is | |
1567 | non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the | |
1568 | type of `*x', or `x', respectively. If the DECL was named as | |
1569 | `A::B' then NESTED_NAME_SPECIFIER is `A'. */ | |
1570 | ||
1571 | void | |
c8094d83 MS |
1572 | check_accessibility_of_qualified_id (tree decl, |
1573 | tree object_type, | |
ee76b931 MM |
1574 | tree nested_name_specifier) |
1575 | { | |
1576 | tree scope; | |
1577 | tree qualifying_type = NULL_TREE; | |
95b4aca6 | 1578 | |
d0940d56 DS |
1579 | /* If we are parsing a template declaration and if decl is a typedef, |
1580 | add it to a list tied to the template. | |
1581 | At template instantiation time, that list will be walked and | |
1582 | access check performed. */ | |
aa373032 DS |
1583 | add_typedef_to_current_template_for_access_check (decl, |
1584 | nested_name_specifier | |
1585 | ? nested_name_specifier | |
1586 | : DECL_CONTEXT (decl), | |
1587 | input_location); | |
d0940d56 | 1588 | |
77880ae4 | 1589 | /* If we're not checking, return immediately. */ |
95b4aca6 NS |
1590 | if (deferred_access_no_check) |
1591 | return; | |
c8094d83 | 1592 | |
ee76b931 MM |
1593 | /* Determine the SCOPE of DECL. */ |
1594 | scope = context_for_name_lookup (decl); | |
1595 | /* If the SCOPE is not a type, then DECL is not a member. */ | |
1596 | if (!TYPE_P (scope)) | |
1597 | return; | |
1598 | /* Compute the scope through which DECL is being accessed. */ | |
c8094d83 | 1599 | if (object_type |
ee76b931 MM |
1600 | /* OBJECT_TYPE might not be a class type; consider: |
1601 | ||
1602 | class A { typedef int I; }; | |
1603 | I *p; | |
1604 | p->A::I::~I(); | |
1605 | ||
0cbd7506 | 1606 | In this case, we will have "A::I" as the DECL, but "I" as the |
ee76b931 MM |
1607 | OBJECT_TYPE. */ |
1608 | && CLASS_TYPE_P (object_type) | |
1609 | && DERIVED_FROM_P (scope, object_type)) | |
1610 | /* If we are processing a `->' or `.' expression, use the type of the | |
1611 | left-hand side. */ | |
1612 | qualifying_type = object_type; | |
1613 | else if (nested_name_specifier) | |
1614 | { | |
1615 | /* If the reference is to a non-static member of the | |
1616 | current class, treat it as if it were referenced through | |
1617 | `this'. */ | |
1618 | if (DECL_NONSTATIC_MEMBER_P (decl) | |
1619 | && current_class_ptr | |
1620 | && DERIVED_FROM_P (scope, current_class_type)) | |
1621 | qualifying_type = current_class_type; | |
1622 | /* Otherwise, use the type indicated by the | |
1623 | nested-name-specifier. */ | |
1624 | else | |
1625 | qualifying_type = nested_name_specifier; | |
1626 | } | |
1627 | else | |
1628 | /* Otherwise, the name must be from the current class or one of | |
1629 | its bases. */ | |
1630 | qualifying_type = currently_open_derived_class (scope); | |
1631 | ||
fc429748 MM |
1632 | if (qualifying_type |
1633 | /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM | |
1634 | or similar in a default argument value. */ | |
1635 | && CLASS_TYPE_P (qualifying_type) | |
1636 | && !dependent_type_p (qualifying_type)) | |
02022f3a SM |
1637 | perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl, |
1638 | decl); | |
ee76b931 MM |
1639 | } |
1640 | ||
1641 | /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the | |
1642 | class named to the left of the "::" operator. DONE is true if this | |
1643 | expression is a complete postfix-expression; it is false if this | |
1644 | expression is followed by '->', '[', '(', etc. ADDRESS_P is true | |
02ed62dd MM |
1645 | iff this expression is the operand of '&'. TEMPLATE_P is true iff |
1646 | the qualified-id was of the form "A::template B". TEMPLATE_ARG_P | |
1647 | is true iff this qualified name appears as a template argument. */ | |
ee76b931 MM |
1648 | |
1649 | tree | |
3db45ab5 MS |
1650 | finish_qualified_id_expr (tree qualifying_class, |
1651 | tree expr, | |
02ed62dd | 1652 | bool done, |
3db45ab5 | 1653 | bool address_p, |
02ed62dd MM |
1654 | bool template_p, |
1655 | bool template_arg_p) | |
ee76b931 | 1656 | { |
d4f0f205 MM |
1657 | gcc_assert (TYPE_P (qualifying_class)); |
1658 | ||
5e08432e MM |
1659 | if (error_operand_p (expr)) |
1660 | return error_mark_node; | |
1661 | ||
7eab6e7b | 1662 | if (DECL_P (expr) || BASELINK_P (expr)) |
d4f0f205 | 1663 | mark_used (expr); |
d4f0f205 | 1664 | |
02ed62dd MM |
1665 | if (template_p) |
1666 | check_template_keyword (expr); | |
1667 | ||
ee76b931 MM |
1668 | /* If EXPR occurs as the operand of '&', use special handling that |
1669 | permits a pointer-to-member. */ | |
1670 | if (address_p && done) | |
1671 | { | |
1672 | if (TREE_CODE (expr) == SCOPE_REF) | |
1673 | expr = TREE_OPERAND (expr, 1); | |
c8094d83 | 1674 | expr = build_offset_ref (qualifying_class, expr, |
a5ac359a | 1675 | /*address_p=*/true); |
ee76b931 MM |
1676 | return expr; |
1677 | } | |
1678 | ||
02ed62dd MM |
1679 | /* Within the scope of a class, turn references to non-static |
1680 | members into expression of the form "this->...". */ | |
1681 | if (template_arg_p) | |
1682 | /* But, within a template argument, we do not want make the | |
1683 | transformation, as there is no "this" pointer. */ | |
1684 | ; | |
1685 | else if (TREE_CODE (expr) == FIELD_DECL) | |
43854f72 SB |
1686 | { |
1687 | push_deferring_access_checks (dk_no_check); | |
1688 | expr = finish_non_static_data_member (expr, current_class_ref, | |
1689 | qualifying_class); | |
1690 | pop_deferring_access_checks (); | |
1691 | } | |
ee76b931 MM |
1692 | else if (BASELINK_P (expr) && !processing_template_decl) |
1693 | { | |
ee76b931 MM |
1694 | tree fns; |
1695 | ||
1696 | /* See if any of the functions are non-static members. */ | |
1697 | fns = BASELINK_FUNCTIONS (expr); | |
1698 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) | |
1699 | fns = TREE_OPERAND (fns, 0); | |
7e361ae6 | 1700 | /* If so, the expression may be relative to 'this'. */ |
821eaf2a | 1701 | if (!shared_member_p (fns) |
7e361ae6 JM |
1702 | && current_class_ref |
1703 | && DERIVED_FROM_P (qualifying_class, TREE_TYPE (current_class_ref))) | |
c8094d83 | 1704 | expr = (build_class_member_access_expr |
ee76b931 MM |
1705 | (maybe_dummy_object (qualifying_class, NULL), |
1706 | expr, | |
1707 | BASELINK_ACCESS_BINFO (expr), | |
5ade1ed2 DG |
1708 | /*preserve_reference=*/false, |
1709 | tf_warning_or_error)); | |
ee76b931 | 1710 | else if (done) |
a5ac359a MM |
1711 | /* The expression is a qualified name whose address is not |
1712 | being taken. */ | |
1713 | expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false); | |
ee76b931 MM |
1714 | } |
1715 | ||
1716 | return expr; | |
1717 | } | |
1718 | ||
b69b1501 MM |
1719 | /* Begin a statement-expression. The value returned must be passed to |
1720 | finish_stmt_expr. */ | |
b4c4a9ec | 1721 | |
c8094d83 | 1722 | tree |
3a978d72 | 1723 | begin_stmt_expr (void) |
b4c4a9ec | 1724 | { |
325c3691 | 1725 | return push_stmt_list (); |
35b1567d BC |
1726 | } |
1727 | ||
a5bcc582 | 1728 | /* Process the final expression of a statement expression. EXPR can be |
85a56c9d MM |
1729 | NULL, if the final expression is empty. Return a STATEMENT_LIST |
1730 | containing all the statements in the statement-expression, or | |
1731 | ERROR_MARK_NODE if there was an error. */ | |
a5bcc582 NS |
1732 | |
1733 | tree | |
325c3691 | 1734 | finish_stmt_expr_expr (tree expr, tree stmt_expr) |
a5bcc582 | 1735 | { |
72e4661a | 1736 | if (error_operand_p (expr)) |
76b9a2a1 AP |
1737 | { |
1738 | /* The type of the statement-expression is the type of the last | |
1739 | expression. */ | |
1740 | TREE_TYPE (stmt_expr) = error_mark_node; | |
1741 | return error_mark_node; | |
1742 | } | |
c8094d83 | 1743 | |
85a56c9d | 1744 | /* If the last statement does not have "void" type, then the value |
3db45ab5 | 1745 | of the last statement is the value of the entire expression. */ |
a5bcc582 NS |
1746 | if (expr) |
1747 | { | |
c6c7698d JM |
1748 | tree type = TREE_TYPE (expr); |
1749 | ||
1750 | if (processing_template_decl) | |
1751 | { | |
c2255bc4 | 1752 | expr = build_stmt (input_location, EXPR_STMT, expr); |
c6c7698d JM |
1753 | expr = add_stmt (expr); |
1754 | /* Mark the last statement so that we can recognize it as such at | |
1755 | template-instantiation time. */ | |
1756 | EXPR_STMT_STMT_EXPR_RESULT (expr) = 1; | |
1757 | } | |
1758 | else if (VOID_TYPE_P (type)) | |
a5bcc582 | 1759 | { |
c6c7698d JM |
1760 | /* Just treat this like an ordinary statement. */ |
1761 | expr = finish_expr_stmt (expr); | |
1762 | } | |
1763 | else | |
1764 | { | |
1765 | /* It actually has a value we need to deal with. First, force it | |
1766 | to be an rvalue so that we won't need to build up a copy | |
1767 | constructor call later when we try to assign it to something. */ | |
1768 | expr = force_rvalue (expr); | |
85a56c9d MM |
1769 | if (error_operand_p (expr)) |
1770 | return error_mark_node; | |
c6c7698d JM |
1771 | |
1772 | /* Update for array-to-pointer decay. */ | |
2692eb7d | 1773 | type = TREE_TYPE (expr); |
c6c7698d JM |
1774 | |
1775 | /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a | |
1776 | normal statement, but don't convert to void or actually add | |
1777 | the EXPR_STMT. */ | |
1778 | if (TREE_CODE (expr) != CLEANUP_POINT_EXPR) | |
1779 | expr = maybe_cleanup_point_expr (expr); | |
1780 | add_stmt (expr); | |
85a56c9d | 1781 | } |
c6c7698d | 1782 | |
85a56c9d MM |
1783 | /* The type of the statement-expression is the type of the last |
1784 | expression. */ | |
1785 | TREE_TYPE (stmt_expr) = type; | |
a5bcc582 | 1786 | } |
c8094d83 | 1787 | |
85a56c9d | 1788 | return stmt_expr; |
a5bcc582 NS |
1789 | } |
1790 | ||
303b7406 NS |
1791 | /* Finish a statement-expression. EXPR should be the value returned |
1792 | by the previous begin_stmt_expr. Returns an expression | |
1793 | representing the statement-expression. */ | |
b4c4a9ec | 1794 | |
c8094d83 | 1795 | tree |
325c3691 | 1796 | finish_stmt_expr (tree stmt_expr, bool has_no_scope) |
b4c4a9ec | 1797 | { |
85a56c9d MM |
1798 | tree type; |
1799 | tree result; | |
325c3691 | 1800 | |
85a56c9d | 1801 | if (error_operand_p (stmt_expr)) |
d7b5fa31 JJ |
1802 | { |
1803 | pop_stmt_list (stmt_expr); | |
1804 | return error_mark_node; | |
1805 | } | |
325c3691 | 1806 | |
85a56c9d | 1807 | gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST); |
325c3691 | 1808 | |
85a56c9d MM |
1809 | type = TREE_TYPE (stmt_expr); |
1810 | result = pop_stmt_list (stmt_expr); | |
c6c7698d | 1811 | TREE_TYPE (result) = type; |
6f80451c | 1812 | |
a5bcc582 | 1813 | if (processing_template_decl) |
325c3691 RH |
1814 | { |
1815 | result = build_min (STMT_EXPR, type, result); | |
1816 | TREE_SIDE_EFFECTS (result) = 1; | |
1817 | STMT_EXPR_NO_SCOPE (result) = has_no_scope; | |
1818 | } | |
c6c7698d | 1819 | else if (CLASS_TYPE_P (type)) |
a5bcc582 | 1820 | { |
c6c7698d JM |
1821 | /* Wrap the statement-expression in a TARGET_EXPR so that the |
1822 | temporary object created by the final expression is destroyed at | |
1823 | the end of the full-expression containing the | |
1824 | statement-expression. */ | |
1825 | result = force_target_expr (type, result); | |
a5bcc582 | 1826 | } |
325c3691 | 1827 | |
b4c4a9ec MM |
1828 | return result; |
1829 | } | |
1830 | ||
c2acde1e JM |
1831 | /* Returns the expression which provides the value of STMT_EXPR. */ |
1832 | ||
1833 | tree | |
1834 | stmt_expr_value_expr (tree stmt_expr) | |
1835 | { | |
1836 | tree t = STMT_EXPR_STMT (stmt_expr); | |
1837 | ||
1838 | if (TREE_CODE (t) == BIND_EXPR) | |
1839 | t = BIND_EXPR_BODY (t); | |
1840 | ||
9de0e916 | 1841 | if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t)) |
c2acde1e JM |
1842 | t = STATEMENT_LIST_TAIL (t)->stmt; |
1843 | ||
1844 | if (TREE_CODE (t) == EXPR_STMT) | |
1845 | t = EXPR_STMT_EXPR (t); | |
1846 | ||
1847 | return t; | |
1848 | } | |
1849 | ||
9af66ed1 DS |
1850 | /* Return TRUE iff EXPR_STMT is an empty list of |
1851 | expression statements. */ | |
1852 | ||
1853 | bool | |
1854 | empty_expr_stmt_p (tree expr_stmt) | |
1855 | { | |
1856 | tree body = NULL_TREE; | |
1857 | ||
489df541 DS |
1858 | if (expr_stmt == void_zero_node) |
1859 | return true; | |
1860 | ||
9af66ed1 DS |
1861 | if (expr_stmt) |
1862 | { | |
1863 | if (TREE_CODE (expr_stmt) == EXPR_STMT) | |
1864 | body = EXPR_STMT_EXPR (expr_stmt); | |
1865 | else if (TREE_CODE (expr_stmt) == STATEMENT_LIST) | |
1866 | body = expr_stmt; | |
1867 | } | |
1868 | ||
489df541 DS |
1869 | if (body) |
1870 | { | |
1871 | if (TREE_CODE (body) == STATEMENT_LIST) | |
1872 | return tsi_end_p (tsi_start (body)); | |
1873 | else | |
1874 | return empty_expr_stmt_p (body); | |
1875 | } | |
9af66ed1 DS |
1876 | return false; |
1877 | } | |
1878 | ||
b3445994 | 1879 | /* Perform Koenig lookup. FN is the postfix-expression representing |
fa531100 MM |
1880 | the function (or functions) to call; ARGS are the arguments to the |
1881 | call. Returns the functions to be considered by overload | |
1882 | resolution. */ | |
b3445994 MM |
1883 | |
1884 | tree | |
c166b898 | 1885 | perform_koenig_lookup (tree fn, VEC(tree,gc) *args) |
b3445994 MM |
1886 | { |
1887 | tree identifier = NULL_TREE; | |
1888 | tree functions = NULL_TREE; | |
d095e03c | 1889 | tree tmpl_args = NULL_TREE; |
4e6a9725 | 1890 | bool template_id = false; |
d095e03c JM |
1891 | |
1892 | if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) | |
1893 | { | |
4e6a9725 JM |
1894 | /* Use a separate flag to handle null args. */ |
1895 | template_id = true; | |
d095e03c JM |
1896 | tmpl_args = TREE_OPERAND (fn, 1); |
1897 | fn = TREE_OPERAND (fn, 0); | |
1898 | } | |
b3445994 MM |
1899 | |
1900 | /* Find the name of the overloaded function. */ | |
1901 | if (TREE_CODE (fn) == IDENTIFIER_NODE) | |
1902 | identifier = fn; | |
1903 | else if (is_overloaded_fn (fn)) | |
1904 | { | |
1905 | functions = fn; | |
1906 | identifier = DECL_NAME (get_first_fn (functions)); | |
1907 | } | |
1908 | else if (DECL_P (fn)) | |
1909 | { | |
1910 | functions = fn; | |
1911 | identifier = DECL_NAME (fn); | |
1912 | } | |
1913 | ||
1914 | /* A call to a namespace-scope function using an unqualified name. | |
1915 | ||
1916 | Do Koenig lookup -- unless any of the arguments are | |
1917 | type-dependent. */ | |
d095e03c JM |
1918 | if (!any_type_dependent_arguments_p (args) |
1919 | && !any_dependent_template_arguments_p (tmpl_args)) | |
b3445994 MM |
1920 | { |
1921 | fn = lookup_arg_dependent (identifier, functions, args); | |
1922 | if (!fn) | |
1923 | /* The unqualified name could not be resolved. */ | |
1924 | fn = unqualified_fn_lookup_error (identifier); | |
1925 | } | |
b3445994 | 1926 | |
4e6a9725 JM |
1927 | if (fn && template_id) |
1928 | fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args); | |
d095e03c | 1929 | |
b3445994 MM |
1930 | return fn; |
1931 | } | |
1932 | ||
c166b898 ILT |
1933 | /* Generate an expression for `FN (ARGS)'. This may change the |
1934 | contents of ARGS. | |
4ba126e4 MM |
1935 | |
1936 | If DISALLOW_VIRTUAL is true, the call to FN will be not generated | |
1937 | as a virtual call, even if FN is virtual. (This flag is set when | |
1938 | encountering an expression where the function name is explicitly | |
1939 | qualified. For example a call to `X::f' never generates a virtual | |
1940 | call.) | |
1941 | ||
1942 | Returns code for the call. */ | |
b4c4a9ec | 1943 | |
c8094d83 | 1944 | tree |
c166b898 ILT |
1945 | finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual, |
1946 | bool koenig_p, tsubst_flags_t complain) | |
b4c4a9ec | 1947 | { |
d17811fd MM |
1948 | tree result; |
1949 | tree orig_fn; | |
c166b898 | 1950 | VEC(tree,gc) *orig_args = NULL; |
d17811fd | 1951 | |
c166b898 | 1952 | if (fn == error_mark_node) |
4ba126e4 MM |
1953 | return error_mark_node; |
1954 | ||
4860b874 | 1955 | gcc_assert (!TYPE_P (fn)); |
a759e627 | 1956 | |
d17811fd | 1957 | orig_fn = fn; |
d17811fd MM |
1958 | |
1959 | if (processing_template_decl) | |
1960 | { | |
1961 | if (type_dependent_expression_p (fn) | |
c166b898 | 1962 | || any_type_dependent_arguments_p (*args)) |
6d80c4b9 | 1963 | { |
c166b898 | 1964 | result = build_nt_call_vec (fn, *args); |
5094a795 | 1965 | KOENIG_LOOKUP_P (result) = koenig_p; |
be461b8f JJ |
1966 | if (cfun) |
1967 | { | |
1968 | do | |
1969 | { | |
1970 | tree fndecl = OVL_CURRENT (fn); | |
1971 | if (TREE_CODE (fndecl) != FUNCTION_DECL | |
1972 | || !TREE_THIS_VOLATILE (fndecl)) | |
1973 | break; | |
1974 | fn = OVL_NEXT (fn); | |
1975 | } | |
1976 | while (fn); | |
1977 | if (!fn) | |
1978 | current_function_returns_abnormally = 1; | |
1979 | } | |
6d80c4b9 MM |
1980 | return result; |
1981 | } | |
c166b898 | 1982 | orig_args = make_tree_vector_copy (*args); |
d17811fd MM |
1983 | if (!BASELINK_P (fn) |
1984 | && TREE_CODE (fn) != PSEUDO_DTOR_EXPR | |
1985 | && TREE_TYPE (fn) != unknown_type_node) | |
1986 | fn = build_non_dependent_expr (fn); | |
c166b898 | 1987 | make_args_non_dependent (*args); |
d17811fd MM |
1988 | } |
1989 | ||
eff3a276 MM |
1990 | if (is_overloaded_fn (fn)) |
1991 | fn = baselink_for_fns (fn); | |
a723baf1 | 1992 | |
d17811fd | 1993 | result = NULL_TREE; |
4ba126e4 | 1994 | if (BASELINK_P (fn)) |
03d82991 | 1995 | { |
4ba126e4 MM |
1996 | tree object; |
1997 | ||
1998 | /* A call to a member function. From [over.call.func]: | |
1999 | ||
2000 | If the keyword this is in scope and refers to the class of | |
2001 | that member function, or a derived class thereof, then the | |
2002 | function call is transformed into a qualified function call | |
2003 | using (*this) as the postfix-expression to the left of the | |
2004 | . operator.... [Otherwise] a contrived object of type T | |
c8094d83 | 2005 | becomes the implied object argument. |
4ba126e4 | 2006 | |
0cbd7506 | 2007 | This paragraph is unclear about this situation: |
4ba126e4 MM |
2008 | |
2009 | struct A { void f(); }; | |
2010 | struct B : public A {}; | |
2011 | struct C : public A { void g() { B::f(); }}; | |
2012 | ||
2013 | In particular, for `B::f', this paragraph does not make clear | |
c8094d83 | 2014 | whether "the class of that member function" refers to `A' or |
4ba126e4 | 2015 | to `B'. We believe it refers to `B'. */ |
c8094d83 | 2016 | if (current_class_type |
4ba126e4 MM |
2017 | && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)), |
2018 | current_class_type) | |
2019 | && current_class_ref) | |
127b8136 MM |
2020 | object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)), |
2021 | NULL); | |
4ba126e4 MM |
2022 | else |
2023 | { | |
2024 | tree representative_fn; | |
b4c4a9ec | 2025 | |
4ba126e4 MM |
2026 | representative_fn = BASELINK_FUNCTIONS (fn); |
2027 | if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR) | |
2028 | representative_fn = TREE_OPERAND (representative_fn, 0); | |
2029 | representative_fn = get_first_fn (representative_fn); | |
2030 | object = build_dummy_object (DECL_CONTEXT (representative_fn)); | |
2031 | } | |
b4c4a9ec | 2032 | |
d17811fd MM |
2033 | if (processing_template_decl) |
2034 | { | |
2035 | if (type_dependent_expression_p (object)) | |
c166b898 ILT |
2036 | { |
2037 | tree ret = build_nt_call_vec (orig_fn, orig_args); | |
2038 | release_tree_vector (orig_args); | |
2039 | return ret; | |
2040 | } | |
d17811fd MM |
2041 | object = build_non_dependent_expr (object); |
2042 | } | |
2043 | ||
2044 | result = build_new_method_call (object, fn, args, NULL_TREE, | |
c8094d83 | 2045 | (disallow_virtual |
63c9a190 | 2046 | ? LOOKUP_NONVIRTUAL : 0), |
5ade1ed2 DG |
2047 | /*fn_p=*/NULL, |
2048 | complain); | |
4ba126e4 MM |
2049 | } |
2050 | else if (is_overloaded_fn (fn)) | |
16c35a1f RH |
2051 | { |
2052 | /* If the function is an overloaded builtin, resolve it. */ | |
2053 | if (TREE_CODE (fn) == FUNCTION_DECL | |
58646b77 PB |
2054 | && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL |
2055 | || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD)) | |
c2255bc4 | 2056 | result = resolve_overloaded_builtin (input_location, fn, *args); |
16c35a1f RH |
2057 | |
2058 | if (!result) | |
2059 | /* A call to a namespace-scope function. */ | |
5094a795 | 2060 | result = build_new_function_call (fn, args, koenig_p, complain); |
16c35a1f | 2061 | } |
a723baf1 MM |
2062 | else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR) |
2063 | { | |
c166b898 | 2064 | if (!VEC_empty (tree, *args)) |
a723baf1 MM |
2065 | error ("arguments to destructor are not allowed"); |
2066 | /* Mark the pseudo-destructor call as having side-effects so | |
2067 | that we do not issue warnings about its use. */ | |
2068 | result = build1 (NOP_EXPR, | |
2069 | void_type_node, | |
2070 | TREE_OPERAND (fn, 0)); | |
2071 | TREE_SIDE_EFFECTS (result) = 1; | |
a723baf1 | 2072 | } |
4ba126e4 | 2073 | else if (CLASS_TYPE_P (TREE_TYPE (fn))) |
d17811fd MM |
2074 | /* If the "function" is really an object of class type, it might |
2075 | have an overloaded `operator ()'. */ | |
c166b898 | 2076 | result = build_op_call (fn, args, complain); |
16c35a1f | 2077 | |
d17811fd MM |
2078 | if (!result) |
2079 | /* A call where the function is unknown. */ | |
c166b898 | 2080 | result = cp_build_function_call_vec (fn, args, complain); |
4ba126e4 | 2081 | |
d17811fd | 2082 | if (processing_template_decl) |
6d80c4b9 | 2083 | { |
c166b898 | 2084 | result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args); |
5094a795 | 2085 | KOENIG_LOOKUP_P (result) = koenig_p; |
c166b898 | 2086 | release_tree_vector (orig_args); |
6d80c4b9 | 2087 | } |
c166b898 | 2088 | |
d17811fd | 2089 | return result; |
b4c4a9ec MM |
2090 | } |
2091 | ||
2092 | /* Finish a call to a postfix increment or decrement or EXPR. (Which | |
2093 | is indicated by CODE, which should be POSTINCREMENT_EXPR or | |
2094 | POSTDECREMENT_EXPR.) */ | |
2095 | ||
c8094d83 | 2096 | tree |
3a978d72 | 2097 | finish_increment_expr (tree expr, enum tree_code code) |
b4c4a9ec | 2098 | { |
5ade1ed2 | 2099 | return build_x_unary_op (code, expr, tf_warning_or_error); |
b4c4a9ec MM |
2100 | } |
2101 | ||
2102 | /* Finish a use of `this'. Returns an expression for `this'. */ | |
2103 | ||
c8094d83 | 2104 | tree |
3a978d72 | 2105 | finish_this_expr (void) |
b4c4a9ec MM |
2106 | { |
2107 | tree result; | |
2108 | ||
b77068f2 JM |
2109 | /* In a lambda expression, 'this' refers to the captured 'this'. */ |
2110 | if (current_function_decl | |
2111 | && LAMBDA_FUNCTION_P (current_function_decl)) | |
2112 | result = (lambda_expr_this_capture | |
2113 | (CLASSTYPE_LAMBDA_EXPR (current_class_type))); | |
2114 | else if (current_class_ptr) | |
2115 | result = current_class_ptr; | |
b4c4a9ec MM |
2116 | else if (current_function_decl |
2117 | && DECL_STATIC_FUNCTION_P (current_function_decl)) | |
2118 | { | |
9e637a26 | 2119 | error ("%<this%> is unavailable for static member functions"); |
b4c4a9ec MM |
2120 | result = error_mark_node; |
2121 | } | |
2122 | else | |
2123 | { | |
2124 | if (current_function_decl) | |
9e637a26 | 2125 | error ("invalid use of %<this%> in non-member function"); |
b4c4a9ec | 2126 | else |
9e637a26 | 2127 | error ("invalid use of %<this%> at top level"); |
b4c4a9ec MM |
2128 | result = error_mark_node; |
2129 | } | |
2130 | ||
2131 | return result; | |
2132 | } | |
2133 | ||
a723baf1 MM |
2134 | /* Finish a pseudo-destructor expression. If SCOPE is NULL, the |
2135 | expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is | |
2136 | the TYPE for the type given. If SCOPE is non-NULL, the expression | |
2137 | was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */ | |
b4c4a9ec | 2138 | |
c8094d83 | 2139 | tree |
3a978d72 | 2140 | finish_pseudo_destructor_expr (tree object, tree scope, tree destructor) |
b4c4a9ec | 2141 | { |
09b1ccd6 | 2142 | if (object == error_mark_node || destructor == error_mark_node) |
a723baf1 | 2143 | return error_mark_node; |
40242ccf | 2144 | |
50bc768d | 2145 | gcc_assert (TYPE_P (destructor)); |
b4c4a9ec | 2146 | |
a723baf1 MM |
2147 | if (!processing_template_decl) |
2148 | { | |
2149 | if (scope == error_mark_node) | |
2150 | { | |
2151 | error ("invalid qualifying scope in pseudo-destructor name"); | |
2152 | return error_mark_node; | |
2153 | } | |
5cf10afb AP |
2154 | if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor)) |
2155 | { | |
2156 | error ("qualified type %qT does not match destructor name ~%qT", | |
2157 | scope, destructor); | |
2158 | return error_mark_node; | |
2159 | } | |
2160 | ||
c8094d83 | 2161 | |
26bcf8fc MM |
2162 | /* [expr.pseudo] says both: |
2163 | ||
0cbd7506 | 2164 | The type designated by the pseudo-destructor-name shall be |
26bcf8fc MM |
2165 | the same as the object type. |
2166 | ||
0cbd7506 | 2167 | and: |
26bcf8fc | 2168 | |
0cbd7506 | 2169 | The cv-unqualified versions of the object type and of the |
26bcf8fc MM |
2170 | type designated by the pseudo-destructor-name shall be the |
2171 | same type. | |
2172 | ||
0cbd7506 MS |
2173 | We implement the more generous second sentence, since that is |
2174 | what most other compilers do. */ | |
c8094d83 | 2175 | if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object), |
26bcf8fc | 2176 | destructor)) |
a723baf1 | 2177 | { |
a82e1a7d | 2178 | error ("%qE is not of type %qT", object, destructor); |
a723baf1 MM |
2179 | return error_mark_node; |
2180 | } | |
2181 | } | |
b4c4a9ec | 2182 | |
f293ce4b | 2183 | return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor); |
b4c4a9ec MM |
2184 | } |
2185 | ||
ce4a0391 MM |
2186 | /* Finish an expression of the form CODE EXPR. */ |
2187 | ||
2188 | tree | |
3a978d72 | 2189 | finish_unary_op_expr (enum tree_code code, tree expr) |
ce4a0391 | 2190 | { |
5ade1ed2 | 2191 | tree result = build_x_unary_op (code, expr, tf_warning_or_error); |
7c355bca ML |
2192 | /* Inside a template, build_x_unary_op does not fold the |
2193 | expression. So check whether the result is folded before | |
2194 | setting TREE_NEGATED_INT. */ | |
2195 | if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST | |
88b4335f | 2196 | && TREE_CODE (result) == INTEGER_CST |
8df83eae | 2197 | && !TYPE_UNSIGNED (TREE_TYPE (result)) |
88b4335f | 2198 | && INT_CST_LT (result, integer_zero_node)) |
6fc98adf MM |
2199 | { |
2200 | /* RESULT may be a cached INTEGER_CST, so we must copy it before | |
2201 | setting TREE_NEGATED_INT. */ | |
2202 | result = copy_node (result); | |
2203 | TREE_NEGATED_INT (result) = 1; | |
2204 | } | |
59c0753d | 2205 | if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr)) |
c2255bc4 | 2206 | overflow_warning (input_location, result); |
59c0753d | 2207 | |
ce4a0391 MM |
2208 | return result; |
2209 | } | |
2210 | ||
a723baf1 | 2211 | /* Finish a compound-literal expression. TYPE is the type to which |
09357846 | 2212 | the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */ |
a723baf1 MM |
2213 | |
2214 | tree | |
09357846 | 2215 | finish_compound_literal (tree type, tree compound_literal) |
a723baf1 | 2216 | { |
326a4d4e JJ |
2217 | if (type == error_mark_node) |
2218 | return error_mark_node; | |
2219 | ||
2b643eda MM |
2220 | if (!TYPE_OBJ_P (type)) |
2221 | { | |
2222 | error ("compound literal of non-object type %qT", type); | |
2223 | return error_mark_node; | |
2224 | } | |
2225 | ||
a723baf1 | 2226 | if (processing_template_decl) |
a723baf1 | 2227 | { |
e92fb501 MM |
2228 | TREE_TYPE (compound_literal) = type; |
2229 | /* Mark the expression as a compound literal. */ | |
2230 | TREE_HAS_CONSTRUCTOR (compound_literal) = 1; | |
2231 | return compound_literal; | |
a723baf1 MM |
2232 | } |
2233 | ||
df794884 | 2234 | type = complete_type (type); |
09357846 JM |
2235 | |
2236 | if (TYPE_NON_AGGREGATE_CLASS (type)) | |
2237 | { | |
2238 | /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST | |
2239 | everywhere that deals with function arguments would be a pain, so | |
2240 | just wrap it in a TREE_LIST. The parser set a flag so we know | |
2241 | that it came from T{} rather than T({}). */ | |
2242 | CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1; | |
2243 | compound_literal = build_tree_list (NULL_TREE, compound_literal); | |
2244 | return build_functional_cast (type, compound_literal, tf_error); | |
2245 | } | |
2246 | ||
23bee8f4 JJ |
2247 | if (TREE_CODE (type) == ARRAY_TYPE |
2248 | && check_array_initializer (NULL_TREE, type, compound_literal)) | |
2249 | return error_mark_node; | |
df794884 JM |
2250 | compound_literal = reshape_init (type, compound_literal); |
2251 | if (TREE_CODE (type) == ARRAY_TYPE) | |
2252 | cp_complete_array_type (&type, compound_literal, false); | |
2253 | compound_literal = digest_init (type, compound_literal); | |
09357846 JM |
2254 | if ((!at_function_scope_p () || cp_type_readonly (type)) |
2255 | && initializer_constant_valid_p (compound_literal, type)) | |
2256 | { | |
2257 | tree decl = create_temporary_var (type); | |
2258 | DECL_INITIAL (decl) = compound_literal; | |
2259 | TREE_STATIC (decl) = 1; | |
2260 | decl = pushdecl_top_level (decl); | |
2261 | DECL_NAME (decl) = make_anon_name (); | |
2262 | SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl)); | |
2263 | return decl; | |
2264 | } | |
2265 | else | |
2266 | return get_target_expr (compound_literal); | |
a723baf1 MM |
2267 | } |
2268 | ||
5f261ba9 MM |
2269 | /* Return the declaration for the function-name variable indicated by |
2270 | ID. */ | |
2271 | ||
2272 | tree | |
2273 | finish_fname (tree id) | |
2274 | { | |
2275 | tree decl; | |
c8094d83 | 2276 | |
3ba09659 | 2277 | decl = fname_decl (input_location, C_RID_CODE (id), id); |
5f261ba9 | 2278 | if (processing_template_decl) |
10b1d5e7 | 2279 | decl = DECL_NAME (decl); |
5f261ba9 MM |
2280 | return decl; |
2281 | } | |
2282 | ||
8014a339 | 2283 | /* Finish a translation unit. */ |
ce4a0391 | 2284 | |
c8094d83 | 2285 | void |
3a978d72 | 2286 | finish_translation_unit (void) |
ce4a0391 MM |
2287 | { |
2288 | /* In case there were missing closebraces, | |
2289 | get us back to the global binding level. */ | |
273a708f | 2290 | pop_everything (); |
ce4a0391 MM |
2291 | while (current_namespace != global_namespace) |
2292 | pop_namespace (); | |
0ba8a114 | 2293 | |
c6002625 | 2294 | /* Do file scope __FUNCTION__ et al. */ |
0ba8a114 | 2295 | finish_fname_decls (); |
ce4a0391 MM |
2296 | } |
2297 | ||
b4c4a9ec MM |
2298 | /* Finish a template type parameter, specified as AGGR IDENTIFIER. |
2299 | Returns the parameter. */ | |
2300 | ||
c8094d83 | 2301 | tree |
3a978d72 | 2302 | finish_template_type_parm (tree aggr, tree identifier) |
b4c4a9ec | 2303 | { |
6eabb241 | 2304 | if (aggr != class_type_node) |
b4c4a9ec | 2305 | { |
cbe5f3b3 | 2306 | permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>"); |
b4c4a9ec MM |
2307 | aggr = class_type_node; |
2308 | } | |
2309 | ||
2310 | return build_tree_list (aggr, identifier); | |
2311 | } | |
2312 | ||
2313 | /* Finish a template template parameter, specified as AGGR IDENTIFIER. | |
2314 | Returns the parameter. */ | |
2315 | ||
c8094d83 | 2316 | tree |
3a978d72 | 2317 | finish_template_template_parm (tree aggr, tree identifier) |
b4c4a9ec | 2318 | { |
c2255bc4 AH |
2319 | tree decl = build_decl (input_location, |
2320 | TYPE_DECL, identifier, NULL_TREE); | |
b4c4a9ec MM |
2321 | tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE); |
2322 | DECL_TEMPLATE_PARMS (tmpl) = current_template_parms; | |
2323 | DECL_TEMPLATE_RESULT (tmpl) = decl; | |
c727aa5e | 2324 | DECL_ARTIFICIAL (decl) = 1; |
b4c4a9ec MM |
2325 | end_template_decl (); |
2326 | ||
50bc768d | 2327 | gcc_assert (DECL_TEMPLATE_PARMS (tmpl)); |
b37bf5bd | 2328 | |
85d85234 DG |
2329 | check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl), |
2330 | /*is_primary=*/true, /*is_partial=*/false, | |
2331 | /*is_friend=*/0); | |
2332 | ||
b4c4a9ec MM |
2333 | return finish_template_type_parm (aggr, tmpl); |
2334 | } | |
ce4a0391 | 2335 | |
8ba658ee MM |
2336 | /* ARGUMENT is the default-argument value for a template template |
2337 | parameter. If ARGUMENT is invalid, issue error messages and return | |
2338 | the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */ | |
2339 | ||
2340 | tree | |
2341 | check_template_template_default_arg (tree argument) | |
2342 | { | |
2343 | if (TREE_CODE (argument) != TEMPLATE_DECL | |
2344 | && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM | |
8ba658ee MM |
2345 | && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE) |
2346 | { | |
a3a503a5 | 2347 | if (TREE_CODE (argument) == TYPE_DECL) |
e488a090 VR |
2348 | error ("invalid use of type %qT as a default value for a template " |
2349 | "template-parameter", TREE_TYPE (argument)); | |
a3a503a5 GB |
2350 | else |
2351 | error ("invalid default argument for a template template parameter"); | |
8ba658ee MM |
2352 | return error_mark_node; |
2353 | } | |
2354 | ||
2355 | return argument; | |
2356 | } | |
2357 | ||
ce4a0391 MM |
2358 | /* Begin a class definition, as indicated by T. */ |
2359 | ||
2360 | tree | |
b9e75696 | 2361 | begin_class_definition (tree t, tree attributes) |
ce4a0391 | 2362 | { |
7d2f0ecd | 2363 | if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t))) |
7437519c ZW |
2364 | return error_mark_node; |
2365 | ||
522d6614 NS |
2366 | if (processing_template_parmlist) |
2367 | { | |
a82e1a7d | 2368 | error ("definition of %q#T inside template parameter list", t); |
522d6614 NS |
2369 | return error_mark_node; |
2370 | } | |
47ee8904 MM |
2371 | /* A non-implicit typename comes from code like: |
2372 | ||
2373 | template <typename T> struct A { | |
0cbd7506 | 2374 | template <typename U> struct A<T>::B ... |
47ee8904 MM |
2375 | |
2376 | This is erroneous. */ | |
2377 | else if (TREE_CODE (t) == TYPENAME_TYPE) | |
2378 | { | |
a82e1a7d | 2379 | error ("invalid definition of qualified type %qT", t); |
47ee8904 MM |
2380 | t = error_mark_node; |
2381 | } | |
2382 | ||
9e1e64ec | 2383 | if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t)) |
ce4a0391 | 2384 | { |
9e1e64ec | 2385 | t = make_class_type (RECORD_TYPE); |
bd3d082e | 2386 | pushtag (make_anon_name (), t, /*tag_scope=*/ts_current); |
ce4a0391 | 2387 | } |
830fcda8 | 2388 | |
4c571114 | 2389 | if (TYPE_BEING_DEFINED (t)) |
ce4a0391 | 2390 | { |
9e1e64ec | 2391 | t = make_class_type (TREE_CODE (t)); |
bd3d082e | 2392 | pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current); |
ce4a0391 | 2393 | } |
ff350acd | 2394 | maybe_process_partial_specialization (t); |
29370796 | 2395 | pushclass (t); |
ce4a0391 | 2396 | TYPE_BEING_DEFINED (t) = 1; |
b9e75696 JM |
2397 | |
2398 | cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE); | |
2399 | ||
c0694c4b MM |
2400 | if (flag_pack_struct) |
2401 | { | |
2402 | tree v; | |
2403 | TYPE_PACKED (t) = 1; | |
2404 | /* Even though the type is being defined for the first time | |
2405 | here, there might have been a forward declaration, so there | |
2406 | might be cv-qualified variants of T. */ | |
2407 | for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v)) | |
2408 | TYPE_PACKED (v) = 1; | |
2409 | } | |
ce4a0391 MM |
2410 | /* Reset the interface data, at the earliest possible |
2411 | moment, as it might have been set via a class foo; | |
2412 | before. */ | |
1951a1b6 JM |
2413 | if (! TYPE_ANONYMOUS_P (t)) |
2414 | { | |
c533e34d | 2415 | struct c_fileinfo *finfo = get_fileinfo (input_filename); |
5d709b00 | 2416 | CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only; |
1951a1b6 | 2417 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X |
5d709b00 | 2418 | (t, finfo->interface_unknown); |
1951a1b6 | 2419 | } |
ce4a0391 | 2420 | reset_specialization(); |
c8094d83 | 2421 | |
b7975aed MM |
2422 | /* Make a declaration for this class in its own scope. */ |
2423 | build_self_reference (); | |
2424 | ||
830fcda8 | 2425 | return t; |
ce4a0391 MM |
2426 | } |
2427 | ||
61a127b3 MM |
2428 | /* Finish the member declaration given by DECL. */ |
2429 | ||
2430 | void | |
3a978d72 | 2431 | finish_member_declaration (tree decl) |
61a127b3 MM |
2432 | { |
2433 | if (decl == error_mark_node || decl == NULL_TREE) | |
2434 | return; | |
2435 | ||
2436 | if (decl == void_type_node) | |
2437 | /* The COMPONENT was a friend, not a member, and so there's | |
2438 | nothing for us to do. */ | |
2439 | return; | |
2440 | ||
2441 | /* We should see only one DECL at a time. */ | |
50bc768d | 2442 | gcc_assert (TREE_CHAIN (decl) == NULL_TREE); |
61a127b3 MM |
2443 | |
2444 | /* Set up access control for DECL. */ | |
c8094d83 | 2445 | TREE_PRIVATE (decl) |
61a127b3 | 2446 | = (current_access_specifier == access_private_node); |
c8094d83 | 2447 | TREE_PROTECTED (decl) |
61a127b3 MM |
2448 | = (current_access_specifier == access_protected_node); |
2449 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
2450 | { | |
17aec3eb RK |
2451 | TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl); |
2452 | TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl); | |
61a127b3 MM |
2453 | } |
2454 | ||
2455 | /* Mark the DECL as a member of the current class. */ | |
4f1c5b7d | 2456 | DECL_CONTEXT (decl) = current_class_type; |
61a127b3 | 2457 | |
b1d7b1c0 | 2458 | /* Check for bare parameter packs in the member variable declaration. */ |
1ad8aeeb | 2459 | if (TREE_CODE (decl) == FIELD_DECL) |
4439d02f | 2460 | { |
7b3e2d46 | 2461 | if (check_for_bare_parameter_packs (TREE_TYPE (decl))) |
4439d02f | 2462 | TREE_TYPE (decl) = error_mark_node; |
7b3e2d46 | 2463 | if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl))) |
4439d02f DG |
2464 | DECL_ATTRIBUTES (decl) = NULL_TREE; |
2465 | } | |
b1d7b1c0 | 2466 | |
421844e7 MM |
2467 | /* [dcl.link] |
2468 | ||
2469 | A C language linkage is ignored for the names of class members | |
2470 | and the member function type of class member functions. */ | |
2471 | if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c) | |
5d2ed28c | 2472 | SET_DECL_LANGUAGE (decl, lang_cplusplus); |
421844e7 | 2473 | |
61a127b3 MM |
2474 | /* Put functions on the TYPE_METHODS list and everything else on the |
2475 | TYPE_FIELDS list. Note that these are built up in reverse order. | |
2476 | We reverse them (to obtain declaration order) in finish_struct. */ | |
c8094d83 | 2477 | if (TREE_CODE (decl) == FUNCTION_DECL |
61a127b3 MM |
2478 | || DECL_FUNCTION_TEMPLATE_P (decl)) |
2479 | { | |
2480 | /* We also need to add this function to the | |
2481 | CLASSTYPE_METHOD_VEC. */ | |
b77fe7b4 NS |
2482 | if (add_method (current_class_type, decl, NULL_TREE)) |
2483 | { | |
2484 | TREE_CHAIN (decl) = TYPE_METHODS (current_class_type); | |
2485 | TYPE_METHODS (current_class_type) = decl; | |
f139561c | 2486 | |
b77fe7b4 NS |
2487 | maybe_add_class_template_decl_list (current_class_type, decl, |
2488 | /*friend_p=*/0); | |
2489 | } | |
61a127b3 | 2490 | } |
f139561c | 2491 | /* Enter the DECL into the scope of the class. */ |
98ed9dae | 2492 | else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl)) |
399dedb9 | 2493 | || pushdecl_class_level (decl)) |
61a127b3 MM |
2494 | { |
2495 | /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields | |
2496 | go at the beginning. The reason is that lookup_field_1 | |
2497 | searches the list in order, and we want a field name to | |
2498 | override a type name so that the "struct stat hack" will | |
2499 | work. In particular: | |
2500 | ||
2501 | struct S { enum E { }; int E } s; | |
2502 | s.E = 3; | |
2503 | ||
0e339752 | 2504 | is valid. In addition, the FIELD_DECLs must be maintained in |
61a127b3 MM |
2505 | declaration order so that class layout works as expected. |
2506 | However, we don't need that order until class layout, so we | |
2507 | save a little time by putting FIELD_DECLs on in reverse order | |
2508 | here, and then reversing them in finish_struct_1. (We could | |
2509 | also keep a pointer to the correct insertion points in the | |
2510 | list.) */ | |
2511 | ||
2512 | if (TREE_CODE (decl) == TYPE_DECL) | |
c8094d83 | 2513 | TYPE_FIELDS (current_class_type) |
61a127b3 MM |
2514 | = chainon (TYPE_FIELDS (current_class_type), decl); |
2515 | else | |
2516 | { | |
2517 | TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type); | |
2518 | TYPE_FIELDS (current_class_type) = decl; | |
2519 | } | |
8f032717 | 2520 | |
c8094d83 | 2521 | maybe_add_class_template_decl_list (current_class_type, decl, |
f139561c | 2522 | /*friend_p=*/0); |
61a127b3 | 2523 | } |
5e2f4cd2 MM |
2524 | |
2525 | if (pch_file) | |
2526 | note_decl_for_pch (decl); | |
2527 | } | |
2528 | ||
2529 | /* DECL has been declared while we are building a PCH file. Perform | |
2530 | actions that we might normally undertake lazily, but which can be | |
2531 | performed now so that they do not have to be performed in | |
2532 | translation units which include the PCH file. */ | |
2533 | ||
2534 | void | |
2535 | note_decl_for_pch (tree decl) | |
2536 | { | |
2537 | gcc_assert (pch_file); | |
2538 | ||
5e2f4cd2 MM |
2539 | /* There's a good chance that we'll have to mangle names at some |
2540 | point, even if only for emission in debugging information. */ | |
ec0897de JM |
2541 | if ((TREE_CODE (decl) == VAR_DECL |
2542 | || TREE_CODE (decl) == FUNCTION_DECL) | |
2543 | && !processing_template_decl) | |
5e2f4cd2 | 2544 | mangle_decl (decl); |
61a127b3 MM |
2545 | } |
2546 | ||
306ef644 | 2547 | /* Finish processing a complete template declaration. The PARMS are |
36a117a5 MM |
2548 | the template parameters. */ |
2549 | ||
2550 | void | |
3a978d72 | 2551 | finish_template_decl (tree parms) |
36a117a5 MM |
2552 | { |
2553 | if (parms) | |
2554 | end_template_decl (); | |
2555 | else | |
2556 | end_specialization (); | |
2557 | } | |
2558 | ||
509fc277 | 2559 | /* Finish processing a template-id (which names a type) of the form |
36a117a5 | 2560 | NAME < ARGS >. Return the TYPE_DECL for the type named by the |
838dfd8a | 2561 | template-id. If ENTERING_SCOPE is nonzero we are about to enter |
36a117a5 MM |
2562 | the scope of template-id indicated. */ |
2563 | ||
2564 | tree | |
3a978d72 | 2565 | finish_template_type (tree name, tree args, int entering_scope) |
36a117a5 MM |
2566 | { |
2567 | tree decl; | |
2568 | ||
2569 | decl = lookup_template_class (name, args, | |
42eaed49 | 2570 | NULL_TREE, NULL_TREE, entering_scope, |
23fca1f5 | 2571 | tf_warning_or_error | tf_user); |
36a117a5 MM |
2572 | if (decl != error_mark_node) |
2573 | decl = TYPE_STUB_DECL (decl); | |
2574 | ||
2575 | return decl; | |
2576 | } | |
648f19f6 | 2577 | |
ea6021e8 MM |
2578 | /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER. |
2579 | Return a TREE_LIST containing the ACCESS_SPECIFIER and the | |
2580 | BASE_CLASS, or NULL_TREE if an error occurred. The | |
aba649ba | 2581 | ACCESS_SPECIFIER is one of |
809e3e7f NS |
2582 | access_{default,public,protected_private}_node. For a virtual base |
2583 | we set TREE_TYPE. */ | |
ea6021e8 | 2584 | |
c8094d83 | 2585 | tree |
dbbf88d1 | 2586 | finish_base_specifier (tree base, tree access, bool virtual_p) |
ea6021e8 | 2587 | { |
ea6021e8 MM |
2588 | tree result; |
2589 | ||
dbbf88d1 | 2590 | if (base == error_mark_node) |
acb044ee GDR |
2591 | { |
2592 | error ("invalid base-class specification"); | |
2593 | result = NULL_TREE; | |
2594 | } | |
9e1e64ec PC |
2595 | else if (! MAYBE_CLASS_TYPE_P (base)) |
2596 | { | |
2597 | error ("%qT is not a class type", base); | |
2598 | result = NULL_TREE; | |
2599 | } | |
ea6021e8 | 2600 | else |
bb92901d | 2601 | { |
dbbf88d1 | 2602 | if (cp_type_quals (base) != 0) |
0cbd7506 MS |
2603 | { |
2604 | error ("base class %qT has cv qualifiers", base); | |
2605 | base = TYPE_MAIN_VARIANT (base); | |
2606 | } | |
dbbf88d1 | 2607 | result = build_tree_list (access, base); |
809e3e7f NS |
2608 | if (virtual_p) |
2609 | TREE_TYPE (result) = integer_type_node; | |
bb92901d | 2610 | } |
ea6021e8 MM |
2611 | |
2612 | return result; | |
2613 | } | |
61a127b3 | 2614 | |
8f78f01f | 2615 | /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is |
2b7a3abf DS |
2616 | what we found when we tried to do the lookup. |
2617 | LOCATION is the location of the NAME identifier; | |
2618 | The location is used in the error message*/ | |
22038b2c NS |
2619 | |
2620 | void | |
2b7a3abf DS |
2621 | qualified_name_lookup_error (tree scope, tree name, |
2622 | tree decl, location_t location) | |
22038b2c | 2623 | { |
1e1b4b37 VR |
2624 | if (scope == error_mark_node) |
2625 | ; /* We already complained. */ | |
2626 | else if (TYPE_P (scope)) | |
22038b2c NS |
2627 | { |
2628 | if (!COMPLETE_TYPE_P (scope)) | |
69bc6bff MLI |
2629 | error_at (location, "incomplete type %qT used in nested name specifier", |
2630 | scope); | |
8f78f01f MM |
2631 | else if (TREE_CODE (decl) == TREE_LIST) |
2632 | { | |
69bc6bff MLI |
2633 | error_at (location, "reference to %<%T::%D%> is ambiguous", |
2634 | scope, name); | |
8f78f01f MM |
2635 | print_candidates (decl); |
2636 | } | |
22038b2c | 2637 | else |
69bc6bff | 2638 | error_at (location, "%qD is not a member of %qT", name, scope); |
22038b2c NS |
2639 | } |
2640 | else if (scope != global_namespace) | |
69bc6bff | 2641 | error_at (location, "%qD is not a member of %qD", name, scope); |
22038b2c | 2642 | else |
69bc6bff | 2643 | error_at (location, "%<::%D%> has not been declared", name); |
22038b2c | 2644 | } |
c8094d83 | 2645 | |
eff3a276 MM |
2646 | /* If FNS is a member function, a set of member functions, or a |
2647 | template-id referring to one or more member functions, return a | |
2648 | BASELINK for FNS, incorporating the current access context. | |
2649 | Otherwise, return FNS unchanged. */ | |
2650 | ||
2651 | tree | |
2652 | baselink_for_fns (tree fns) | |
2653 | { | |
2654 | tree fn; | |
2655 | tree cl; | |
2656 | ||
2657 | if (BASELINK_P (fns) | |
eff3a276 MM |
2658 | || error_operand_p (fns)) |
2659 | return fns; | |
2660 | ||
2661 | fn = fns; | |
2662 | if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) | |
2663 | fn = TREE_OPERAND (fn, 0); | |
2664 | fn = get_first_fn (fn); | |
2665 | if (!DECL_FUNCTION_MEMBER_P (fn)) | |
2666 | return fns; | |
2667 | ||
2668 | cl = currently_open_derived_class (DECL_CONTEXT (fn)); | |
2669 | if (!cl) | |
2670 | cl = DECL_CONTEXT (fn); | |
2671 | cl = TYPE_BINFO (cl); | |
2672 | return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE); | |
2673 | } | |
2674 | ||
d5f4eddd JM |
2675 | /* Returns true iff DECL is an automatic variable from a function outside |
2676 | the current one. */ | |
2677 | ||
2678 | static bool | |
2679 | outer_automatic_var_p (tree decl) | |
2680 | { | |
2681 | return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL) | |
2682 | && DECL_FUNCTION_SCOPE_P (decl) | |
2683 | && !TREE_STATIC (decl) | |
2684 | && DECL_CONTEXT (decl) != current_function_decl); | |
2685 | } | |
2686 | ||
9660afe0 JM |
2687 | /* Returns true iff DECL is a capture field from a lambda that is not our |
2688 | immediate context. */ | |
2689 | ||
2690 | static bool | |
2691 | outer_lambda_capture_p (tree decl) | |
2692 | { | |
2693 | return (TREE_CODE (decl) == FIELD_DECL | |
2694 | && LAMBDA_TYPE_P (DECL_CONTEXT (decl)) | |
2695 | && (!current_class_type | |
2696 | || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type))); | |
2697 | } | |
2698 | ||
b3445994 MM |
2699 | /* ID_EXPRESSION is a representation of parsed, but unprocessed, |
2700 | id-expression. (See cp_parser_id_expression for details.) SCOPE, | |
2701 | if non-NULL, is the type or namespace used to explicitly qualify | |
2702 | ID_EXPRESSION. DECL is the entity to which that name has been | |
c8094d83 | 2703 | resolved. |
b3445994 MM |
2704 | |
2705 | *CONSTANT_EXPRESSION_P is true if we are presently parsing a | |
2706 | constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will | |
2707 | be set to true if this expression isn't permitted in a | |
2708 | constant-expression, but it is otherwise not set by this function. | |
2709 | *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a | |
2710 | constant-expression, but a non-constant expression is also | |
2711 | permissible. | |
2712 | ||
02ed62dd MM |
2713 | DONE is true if this expression is a complete postfix-expression; |
2714 | it is false if this expression is followed by '->', '[', '(', etc. | |
2715 | ADDRESS_P is true iff this expression is the operand of '&'. | |
2716 | TEMPLATE_P is true iff the qualified-id was of the form | |
2717 | "A::template B". TEMPLATE_ARG_P is true iff this qualified name | |
2718 | appears as a template argument. | |
2719 | ||
b3445994 MM |
2720 | If an error occurs, and it is the kind of error that might cause |
2721 | the parser to abort a tentative parse, *ERROR_MSG is filled in. It | |
2722 | is the caller's responsibility to issue the message. *ERROR_MSG | |
2723 | will be a string with static storage duration, so the caller need | |
2724 | not "free" it. | |
2725 | ||
2726 | Return an expression for the entity, after issuing appropriate | |
2727 | diagnostics. This function is also responsible for transforming a | |
2728 | reference to a non-static member into a COMPONENT_REF that makes | |
c8094d83 | 2729 | the use of "this" explicit. |
b3445994 MM |
2730 | |
2731 | Upon return, *IDK will be filled in appropriately. */ | |
b3445994 | 2732 | tree |
c8094d83 | 2733 | finish_id_expression (tree id_expression, |
b3445994 MM |
2734 | tree decl, |
2735 | tree scope, | |
2736 | cp_id_kind *idk, | |
67c03833 JM |
2737 | bool integral_constant_expression_p, |
2738 | bool allow_non_integral_constant_expression_p, | |
2739 | bool *non_integral_constant_expression_p, | |
02ed62dd MM |
2740 | bool template_p, |
2741 | bool done, | |
2742 | bool address_p, | |
2743 | bool template_arg_p, | |
2b7a3abf DS |
2744 | const char **error_msg, |
2745 | location_t location) | |
b3445994 MM |
2746 | { |
2747 | /* Initialize the output parameters. */ | |
2748 | *idk = CP_ID_KIND_NONE; | |
2749 | *error_msg = NULL; | |
2750 | ||
2751 | if (id_expression == error_mark_node) | |
2752 | return error_mark_node; | |
2753 | /* If we have a template-id, then no further lookup is | |
2754 | required. If the template-id was for a template-class, we | |
2755 | will sometimes have a TYPE_DECL at this point. */ | |
2756 | else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR | |
ee935db4 | 2757 | || TREE_CODE (decl) == TYPE_DECL) |
b3445994 MM |
2758 | ; |
2759 | /* Look up the name. */ | |
c8094d83 | 2760 | else |
b3445994 MM |
2761 | { |
2762 | if (decl == error_mark_node) | |
2763 | { | |
2764 | /* Name lookup failed. */ | |
c8094d83 MS |
2765 | if (scope |
2766 | && (!TYPE_P (scope) | |
4546865e MM |
2767 | || (!dependent_type_p (scope) |
2768 | && !(TREE_CODE (id_expression) == IDENTIFIER_NODE | |
2769 | && IDENTIFIER_TYPENAME_P (id_expression) | |
2770 | && dependent_type_p (TREE_TYPE (id_expression)))))) | |
b3445994 | 2771 | { |
4546865e MM |
2772 | /* If the qualifying type is non-dependent (and the name |
2773 | does not name a conversion operator to a dependent | |
2774 | type), issue an error. */ | |
2b7a3abf | 2775 | qualified_name_lookup_error (scope, id_expression, decl, location); |
b3445994 MM |
2776 | return error_mark_node; |
2777 | } | |
2778 | else if (!scope) | |
2779 | { | |
2780 | /* It may be resolved via Koenig lookup. */ | |
2781 | *idk = CP_ID_KIND_UNQUALIFIED; | |
2782 | return id_expression; | |
2783 | } | |
4546865e MM |
2784 | else |
2785 | decl = id_expression; | |
b3445994 MM |
2786 | } |
2787 | /* If DECL is a variable that would be out of scope under | |
2788 | ANSI/ISO rules, but in scope in the ARM, name lookup | |
2789 | will succeed. Issue a diagnostic here. */ | |
2790 | else | |
2791 | decl = check_for_out_of_scope_variable (decl); | |
2792 | ||
2793 | /* Remember that the name was used in the definition of | |
2794 | the current class so that we can check later to see if | |
2795 | the meaning would have been different after the class | |
2796 | was entirely defined. */ | |
2797 | if (!scope && decl != error_mark_node) | |
2798 | maybe_note_name_used_in_class (id_expression, decl); | |
8ca4bf25 | 2799 | |
d5f4eddd JM |
2800 | /* Disallow uses of local variables from containing functions, except |
2801 | within lambda-expressions. */ | |
9660afe0 JM |
2802 | if ((outer_automatic_var_p (decl) |
2803 | || outer_lambda_capture_p (decl)) | |
d5f4eddd JM |
2804 | /* It's not a use (3.2) if we're in an unevaluated context. */ |
2805 | && !cp_unevaluated_operand) | |
8ca4bf25 | 2806 | { |
d5f4eddd JM |
2807 | tree context = DECL_CONTEXT (decl); |
2808 | tree containing_function = current_function_decl; | |
2809 | tree lambda_stack = NULL_TREE; | |
2810 | tree lambda_expr = NULL_TREE; | |
9660afe0 | 2811 | tree initializer = decl; |
d5f4eddd JM |
2812 | |
2813 | /* Core issue 696: "[At the July 2009 meeting] the CWG expressed | |
2814 | support for an approach in which a reference to a local | |
2815 | [constant] automatic variable in a nested class or lambda body | |
2816 | would enter the expression as an rvalue, which would reduce | |
2817 | the complexity of the problem" | |
2818 | ||
2819 | FIXME update for final resolution of core issue 696. */ | |
2820 | if (DECL_INTEGRAL_CONSTANT_VAR_P (decl)) | |
2821 | return integral_constant_value (decl); | |
2822 | ||
9660afe0 JM |
2823 | if (TYPE_P (context)) |
2824 | { | |
2825 | /* Implicit capture of an explicit capture. */ | |
2826 | context = lambda_function (context); | |
2827 | initializer = thisify_lambda_field (decl); | |
2828 | } | |
2829 | ||
d5f4eddd JM |
2830 | /* If we are in a lambda function, we can move out until we hit |
2831 | 1. the context, | |
2832 | 2. a non-lambda function, or | |
2833 | 3. a non-default capturing lambda function. */ | |
2834 | while (context != containing_function | |
2835 | && LAMBDA_FUNCTION_P (containing_function)) | |
2836 | { | |
2837 | lambda_expr = CLASSTYPE_LAMBDA_EXPR | |
2838 | (DECL_CONTEXT (containing_function)); | |
2839 | ||
2840 | if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) | |
2841 | == CPLD_NONE) | |
2842 | break; | |
2843 | ||
2844 | lambda_stack = tree_cons (NULL_TREE, | |
2845 | lambda_expr, | |
2846 | lambda_stack); | |
2847 | ||
2848 | containing_function | |
2849 | = decl_function_context (containing_function); | |
2850 | } | |
2851 | ||
2852 | if (context == containing_function) | |
2853 | { | |
2854 | decl = add_default_capture (lambda_stack, | |
2855 | /*id=*/DECL_NAME (decl), | |
9660afe0 | 2856 | initializer); |
d5f4eddd JM |
2857 | } |
2858 | else if (lambda_expr) | |
2859 | { | |
2860 | error ("%qD is not captured", decl); | |
2861 | return error_mark_node; | |
2862 | } | |
2863 | else | |
8ca4bf25 MM |
2864 | { |
2865 | error (TREE_CODE (decl) == VAR_DECL | |
2866 | ? "use of %<auto%> variable from containing function" | |
2867 | : "use of parameter from containing function"); | |
2868 | error (" %q+#D declared here", decl); | |
2869 | return error_mark_node; | |
2870 | } | |
2871 | } | |
b3445994 MM |
2872 | } |
2873 | ||
2874 | /* If we didn't find anything, or what we found was a type, | |
2875 | then this wasn't really an id-expression. */ | |
2876 | if (TREE_CODE (decl) == TEMPLATE_DECL | |
2877 | && !DECL_FUNCTION_TEMPLATE_P (decl)) | |
2878 | { | |
2879 | *error_msg = "missing template arguments"; | |
2880 | return error_mark_node; | |
2881 | } | |
2882 | else if (TREE_CODE (decl) == TYPE_DECL | |
2883 | || TREE_CODE (decl) == NAMESPACE_DECL) | |
2884 | { | |
2885 | *error_msg = "expected primary-expression"; | |
2886 | return error_mark_node; | |
2887 | } | |
2888 | ||
2889 | /* If the name resolved to a template parameter, there is no | |
931a9c05 GB |
2890 | need to look it up again later. */ |
2891 | if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl)) | |
2892 | || TREE_CODE (decl) == TEMPLATE_PARM_INDEX) | |
b3445994 | 2893 | { |
db24eb1f | 2894 | tree r; |
c8094d83 | 2895 | |
b3445994 | 2896 | *idk = CP_ID_KIND_NONE; |
931a9c05 GB |
2897 | if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX) |
2898 | decl = TEMPLATE_PARM_DECL (decl); | |
db24eb1f | 2899 | r = convert_from_reference (DECL_INITIAL (decl)); |
c8094d83 MS |
2900 | |
2901 | if (integral_constant_expression_p | |
68deab91 | 2902 | && !dependent_type_p (TREE_TYPE (decl)) |
db24eb1f | 2903 | && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r)))) |
931a9c05 | 2904 | { |
67c03833 | 2905 | if (!allow_non_integral_constant_expression_p) |
a82e1a7d | 2906 | error ("template parameter %qD of type %qT is not allowed in " |
931a9c05 GB |
2907 | "an integral constant expression because it is not of " |
2908 | "integral or enumeration type", decl, TREE_TYPE (decl)); | |
67c03833 | 2909 | *non_integral_constant_expression_p = true; |
931a9c05 | 2910 | } |
db24eb1f | 2911 | return r; |
931a9c05 | 2912 | } |
c8094d83 | 2913 | /* Similarly, we resolve enumeration constants to their |
931a9c05 GB |
2914 | underlying values. */ |
2915 | else if (TREE_CODE (decl) == CONST_DECL) | |
2916 | { | |
2917 | *idk = CP_ID_KIND_NONE; | |
2918 | if (!processing_template_decl) | |
6193b8b7 DJ |
2919 | { |
2920 | used_types_insert (TREE_TYPE (decl)); | |
2921 | return DECL_INITIAL (decl); | |
2922 | } | |
b3445994 MM |
2923 | return decl; |
2924 | } | |
2925 | else | |
2926 | { | |
2927 | bool dependent_p; | |
2928 | ||
2929 | /* If the declaration was explicitly qualified indicate | |
2930 | that. The semantics of `A::f(3)' are different than | |
2931 | `f(3)' if `f' is virtual. */ | |
c8094d83 | 2932 | *idk = (scope |
b3445994 MM |
2933 | ? CP_ID_KIND_QUALIFIED |
2934 | : (TREE_CODE (decl) == TEMPLATE_ID_EXPR | |
2935 | ? CP_ID_KIND_TEMPLATE_ID | |
2936 | : CP_ID_KIND_UNQUALIFIED)); | |
2937 | ||
2938 | ||
2939 | /* [temp.dep.expr] | |
2940 | ||
2941 | An id-expression is type-dependent if it contains an | |
2942 | identifier that was declared with a dependent type. | |
2943 | ||
b3445994 MM |
2944 | The standard is not very specific about an id-expression that |
2945 | names a set of overloaded functions. What if some of them | |
2946 | have dependent types and some of them do not? Presumably, | |
2947 | such a name should be treated as a dependent name. */ | |
2948 | /* Assume the name is not dependent. */ | |
2949 | dependent_p = false; | |
2950 | if (!processing_template_decl) | |
2951 | /* No names are dependent outside a template. */ | |
2952 | ; | |
2953 | /* A template-id where the name of the template was not resolved | |
2954 | is definitely dependent. */ | |
2955 | else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR | |
c8094d83 | 2956 | && (TREE_CODE (TREE_OPERAND (decl, 0)) |
b3445994 MM |
2957 | == IDENTIFIER_NODE)) |
2958 | dependent_p = true; | |
2959 | /* For anything except an overloaded function, just check its | |
2960 | type. */ | |
2961 | else if (!is_overloaded_fn (decl)) | |
c8094d83 | 2962 | dependent_p |
b3445994 MM |
2963 | = dependent_type_p (TREE_TYPE (decl)); |
2964 | /* For a set of overloaded functions, check each of the | |
2965 | functions. */ | |
2966 | else | |
2967 | { | |
2968 | tree fns = decl; | |
2969 | ||
2970 | if (BASELINK_P (fns)) | |
2971 | fns = BASELINK_FUNCTIONS (fns); | |
2972 | ||
2973 | /* For a template-id, check to see if the template | |
2974 | arguments are dependent. */ | |
2975 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) | |
2976 | { | |
2977 | tree args = TREE_OPERAND (fns, 1); | |
2978 | dependent_p = any_dependent_template_arguments_p (args); | |
2979 | /* The functions are those referred to by the | |
2980 | template-id. */ | |
2981 | fns = TREE_OPERAND (fns, 0); | |
2982 | } | |
2983 | ||
2984 | /* If there are no dependent template arguments, go through | |
cd0be382 | 2985 | the overloaded functions. */ |
b3445994 MM |
2986 | while (fns && !dependent_p) |
2987 | { | |
2988 | tree fn = OVL_CURRENT (fns); | |
2989 | ||
2990 | /* Member functions of dependent classes are | |
2991 | dependent. */ | |
2992 | if (TREE_CODE (fn) == FUNCTION_DECL | |
2993 | && type_dependent_expression_p (fn)) | |
2994 | dependent_p = true; | |
2995 | else if (TREE_CODE (fn) == TEMPLATE_DECL | |
2996 | && dependent_template_p (fn)) | |
2997 | dependent_p = true; | |
2998 | ||
2999 | fns = OVL_NEXT (fns); | |
3000 | } | |
3001 | } | |
3002 | ||
3003 | /* If the name was dependent on a template parameter, we will | |
3004 | resolve the name at instantiation time. */ | |
3005 | if (dependent_p) | |
3006 | { | |
3007 | /* Create a SCOPE_REF for qualified names, if the scope is | |
3008 | dependent. */ | |
3009 | if (scope) | |
3010 | { | |
02ed62dd MM |
3011 | if (TYPE_P (scope)) |
3012 | { | |
3013 | if (address_p && done) | |
3014 | decl = finish_qualified_id_expr (scope, decl, | |
3015 | done, address_p, | |
3016 | template_p, | |
3017 | template_arg_p); | |
7e361ae6 JM |
3018 | else |
3019 | { | |
3020 | tree type = NULL_TREE; | |
3021 | if (DECL_P (decl) && !dependent_scope_p (scope)) | |
3022 | type = TREE_TYPE (decl); | |
3023 | decl = build_qualified_name (type, | |
3024 | scope, | |
3025 | id_expression, | |
3026 | template_p); | |
3027 | } | |
02ed62dd MM |
3028 | } |
3029 | if (TREE_TYPE (decl)) | |
3030 | decl = convert_from_reference (decl); | |
3031 | return decl; | |
b3445994 MM |
3032 | } |
3033 | /* A TEMPLATE_ID already contains all the information we | |
3034 | need. */ | |
3035 | if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR) | |
3036 | return id_expression; | |
10b1d5e7 | 3037 | *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT; |
5a98fa7b MM |
3038 | /* If we found a variable, then name lookup during the |
3039 | instantiation will always resolve to the same VAR_DECL | |
3040 | (or an instantiation thereof). */ | |
3c398f34 MM |
3041 | if (TREE_CODE (decl) == VAR_DECL |
3042 | || TREE_CODE (decl) == PARM_DECL) | |
db24eb1f | 3043 | return convert_from_reference (decl); |
bad1f462 KL |
3044 | /* The same is true for FIELD_DECL, but we also need to |
3045 | make sure that the syntax is correct. */ | |
3046 | else if (TREE_CODE (decl) == FIELD_DECL) | |
a26ddf11 KL |
3047 | { |
3048 | /* Since SCOPE is NULL here, this is an unqualified name. | |
3049 | Access checking has been performed during name lookup | |
3050 | already. Turn off checking to avoid duplicate errors. */ | |
3051 | push_deferring_access_checks (dk_no_check); | |
3052 | decl = finish_non_static_data_member | |
3053 | (decl, current_class_ref, | |
3054 | /*qualifying_scope=*/NULL_TREE); | |
3055 | pop_deferring_access_checks (); | |
3056 | return decl; | |
3057 | } | |
10b1d5e7 | 3058 | return id_expression; |
b3445994 MM |
3059 | } |
3060 | ||
3061 | /* Only certain kinds of names are allowed in constant | |
0cbd7506 MS |
3062 | expression. Enumerators and template parameters have already |
3063 | been handled above. */ | |
c30b4add | 3064 | if (integral_constant_expression_p |
100d337a MA |
3065 | && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl) |
3066 | && ! builtin_valid_in_constant_expr_p (decl)) | |
b3445994 | 3067 | { |
c30b4add | 3068 | if (!allow_non_integral_constant_expression_p) |
b3445994 | 3069 | { |
a82e1a7d | 3070 | error ("%qD cannot appear in a constant-expression", decl); |
c30b4add | 3071 | return error_mark_node; |
b3445994 | 3072 | } |
c30b4add | 3073 | *non_integral_constant_expression_p = true; |
b3445994 | 3074 | } |
c8094d83 | 3075 | |
415d4636 | 3076 | if (TREE_CODE (decl) == NAMESPACE_DECL) |
9e95d15f | 3077 | { |
a82e1a7d | 3078 | error ("use of namespace %qD as expression", decl); |
9e95d15f NS |
3079 | return error_mark_node; |
3080 | } | |
3081 | else if (DECL_CLASS_TEMPLATE_P (decl)) | |
3082 | { | |
a82e1a7d | 3083 | error ("use of class template %qT as expression", decl); |
9e95d15f NS |
3084 | return error_mark_node; |
3085 | } | |
3086 | else if (TREE_CODE (decl) == TREE_LIST) | |
3087 | { | |
3088 | /* Ambiguous reference to base members. */ | |
a82e1a7d | 3089 | error ("request for member %qD is ambiguous in " |
9e95d15f NS |
3090 | "multiple inheritance lattice", id_expression); |
3091 | print_candidates (decl); | |
3092 | return error_mark_node; | |
3093 | } | |
415d4636 MM |
3094 | |
3095 | /* Mark variable-like entities as used. Functions are similarly | |
3096 | marked either below or after overload resolution. */ | |
3097 | if (TREE_CODE (decl) == VAR_DECL | |
3098 | || TREE_CODE (decl) == PARM_DECL | |
3099 | || TREE_CODE (decl) == RESULT_DECL) | |
3100 | mark_used (decl); | |
3101 | ||
3102 | if (scope) | |
3103 | { | |
c8094d83 | 3104 | decl = (adjust_result_of_qualified_name_lookup |
415d4636 | 3105 | (decl, scope, current_class_type)); |
e20bcc5e JH |
3106 | |
3107 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
3108 | mark_used (decl); | |
3109 | ||
415d4636 | 3110 | if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl)) |
02ed62dd MM |
3111 | decl = finish_qualified_id_expr (scope, |
3112 | decl, | |
3113 | done, | |
3114 | address_p, | |
3115 | template_p, | |
3116 | template_arg_p); | |
db24eb1f NS |
3117 | else |
3118 | { | |
3119 | tree r = convert_from_reference (decl); | |
c8094d83 | 3120 | |
02ed62dd MM |
3121 | if (processing_template_decl && TYPE_P (scope)) |
3122 | r = build_qualified_name (TREE_TYPE (r), | |
3123 | scope, decl, | |
3124 | template_p); | |
db24eb1f NS |
3125 | decl = r; |
3126 | } | |
415d4636 | 3127 | } |
9e95d15f | 3128 | else if (TREE_CODE (decl) == FIELD_DECL) |
a26ddf11 KL |
3129 | { |
3130 | /* Since SCOPE is NULL here, this is an unqualified name. | |
3131 | Access checking has been performed during name lookup | |
3132 | already. Turn off checking to avoid duplicate errors. */ | |
3133 | push_deferring_access_checks (dk_no_check); | |
3134 | decl = finish_non_static_data_member (decl, current_class_ref, | |
3135 | /*qualifying_scope=*/NULL_TREE); | |
3136 | pop_deferring_access_checks (); | |
3137 | } | |
9e95d15f NS |
3138 | else if (is_overloaded_fn (decl)) |
3139 | { | |
eff3a276 | 3140 | tree first_fn; |
b3445994 | 3141 | |
eff3a276 MM |
3142 | first_fn = decl; |
3143 | if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR) | |
3144 | first_fn = TREE_OPERAND (first_fn, 0); | |
3145 | first_fn = get_first_fn (first_fn); | |
9e95d15f NS |
3146 | if (TREE_CODE (first_fn) == TEMPLATE_DECL) |
3147 | first_fn = DECL_TEMPLATE_RESULT (first_fn); | |
415d4636 MM |
3148 | |
3149 | if (!really_overloaded_fn (decl)) | |
3150 | mark_used (first_fn); | |
3151 | ||
02ed62dd MM |
3152 | if (!template_arg_p |
3153 | && TREE_CODE (first_fn) == FUNCTION_DECL | |
821eaf2a MM |
3154 | && DECL_FUNCTION_MEMBER_P (first_fn) |
3155 | && !shared_member_p (decl)) | |
9e95d15f NS |
3156 | { |
3157 | /* A set of member functions. */ | |
3158 | decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0); | |
02ed62dd | 3159 | return finish_class_member_access_expr (decl, id_expression, |
5ade1ed2 DG |
3160 | /*template_p=*/false, |
3161 | tf_warning_or_error); | |
9e95d15f | 3162 | } |
eff3a276 MM |
3163 | |
3164 | decl = baselink_for_fns (decl); | |
9e95d15f NS |
3165 | } |
3166 | else | |
3167 | { | |
9e95d15f | 3168 | if (DECL_P (decl) && DECL_NONLOCAL (decl) |
24f58e74 | 3169 | && DECL_CLASS_SCOPE_P (decl)) |
9e95d15f | 3170 | { |
24f58e74 PC |
3171 | tree context = context_for_name_lookup (decl); |
3172 | if (context != current_class_type) | |
3173 | { | |
3174 | tree path = currently_open_derived_class (context); | |
3175 | perform_or_defer_access_check (TYPE_BINFO (path), | |
3176 | decl, decl); | |
3177 | } | |
9e95d15f | 3178 | } |
c8094d83 | 3179 | |
db24eb1f | 3180 | decl = convert_from_reference (decl); |
9e95d15f | 3181 | } |
b3445994 MM |
3182 | } |
3183 | ||
3184 | if (TREE_DEPRECATED (decl)) | |
9b86d6bb | 3185 | warn_deprecated_use (decl, NULL_TREE); |
b3445994 MM |
3186 | |
3187 | return decl; | |
3188 | } | |
3189 | ||
0213a355 JM |
3190 | /* Implement the __typeof keyword: Return the type of EXPR, suitable for |
3191 | use as a type-specifier. */ | |
3192 | ||
b894fc05 | 3193 | tree |
3a978d72 | 3194 | finish_typeof (tree expr) |
b894fc05 | 3195 | { |
65a5559b MM |
3196 | tree type; |
3197 | ||
dffbbe80 | 3198 | if (type_dependent_expression_p (expr)) |
b894fc05 | 3199 | { |
9e1e64ec | 3200 | type = cxx_make_type (TYPEOF_TYPE); |
eb34af89 | 3201 | TYPEOF_TYPE_EXPR (type) = expr; |
3ad6a8e1 | 3202 | SET_TYPE_STRUCTURAL_EQUALITY (type); |
b894fc05 | 3203 | |
65a5559b | 3204 | return type; |
b894fc05 JM |
3205 | } |
3206 | ||
3c38f0ff | 3207 | type = unlowered_expr_type (expr); |
65a5559b MM |
3208 | |
3209 | if (!type || type == unknown_type_node) | |
3210 | { | |
a82e1a7d | 3211 | error ("type of %qE is unknown", expr); |
65a5559b MM |
3212 | return error_mark_node; |
3213 | } | |
3214 | ||
3215 | return type; | |
b894fc05 | 3216 | } |
558475f0 | 3217 | |
c291f8b1 VR |
3218 | /* Perform C++-specific checks for __builtin_offsetof before calling |
3219 | fold_offsetof. */ | |
3220 | ||
3221 | tree | |
3222 | finish_offsetof (tree expr) | |
3223 | { | |
4c65a534 VR |
3224 | if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR) |
3225 | { | |
3226 | error ("cannot apply %<offsetof%> to destructor %<~%T%>", | |
3227 | TREE_OPERAND (expr, 2)); | |
3228 | return error_mark_node; | |
3229 | } | |
c291f8b1 VR |
3230 | if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE |
3231 | || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE | |
3232 | || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE) | |
3233 | { | |
1916c916 VR |
3234 | if (TREE_CODE (expr) == COMPONENT_REF |
3235 | || TREE_CODE (expr) == COMPOUND_EXPR) | |
0a9367cb VR |
3236 | expr = TREE_OPERAND (expr, 1); |
3237 | error ("cannot apply %<offsetof%> to member function %qD", expr); | |
c291f8b1 VR |
3238 | return error_mark_node; |
3239 | } | |
60c4d135 JJ |
3240 | if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr)) |
3241 | expr = TREE_OPERAND (expr, 0); | |
6d4d7b0e | 3242 | return fold_offsetof (expr, NULL_TREE); |
c291f8b1 VR |
3243 | } |
3244 | ||
9eeb200f JM |
3245 | /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This |
3246 | function is broken out from the above for the benefit of the tree-ssa | |
3247 | project. */ | |
3248 | ||
3249 | void | |
3250 | simplify_aggr_init_expr (tree *tp) | |
3251 | { | |
3252 | tree aggr_init_expr = *tp; | |
3253 | ||
3eb24f73 | 3254 | /* Form an appropriate CALL_EXPR. */ |
5039610b SL |
3255 | tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr); |
3256 | tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr); | |
2692eb7d | 3257 | tree type = TREE_TYPE (slot); |
9eeb200f JM |
3258 | |
3259 | tree call_expr; | |
3260 | enum style_t { ctor, arg, pcc } style; | |
4977bab6 | 3261 | |
3eb24f73 | 3262 | if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr)) |
4977bab6 ZW |
3263 | style = ctor; |
3264 | #ifdef PCC_STATIC_STRUCT_RETURN | |
3265 | else if (1) | |
3266 | style = pcc; | |
3267 | #endif | |
4977bab6 | 3268 | else |
315fb5db NS |
3269 | { |
3270 | gcc_assert (TREE_ADDRESSABLE (type)); | |
3271 | style = arg; | |
3272 | } | |
4977bab6 | 3273 | |
db3927fb AH |
3274 | call_expr = build_call_array_loc (input_location, |
3275 | TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))), | |
3276 | fn, | |
3277 | aggr_init_expr_nargs (aggr_init_expr), | |
3278 | AGGR_INIT_EXPR_ARGP (aggr_init_expr)); | |
5039610b | 3279 | |
fa47911c | 3280 | if (style == ctor) |
3eb24f73 | 3281 | { |
fa47911c JM |
3282 | /* Replace the first argument to the ctor with the address of the |
3283 | slot. */ | |
dffd7eb6 | 3284 | cxx_mark_addressable (slot); |
5039610b SL |
3285 | CALL_EXPR_ARG (call_expr, 0) = |
3286 | build1 (ADDR_EXPR, build_pointer_type (type), slot); | |
3eb24f73 | 3287 | } |
5039610b | 3288 | else if (style == arg) |
fa47911c JM |
3289 | { |
3290 | /* Just mark it addressable here, and leave the rest to | |
3291 | expand_call{,_inline}. */ | |
3292 | cxx_mark_addressable (slot); | |
3293 | CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true; | |
3294 | call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr); | |
3295 | } | |
4977bab6 | 3296 | else if (style == pcc) |
3eb24f73 | 3297 | { |
4977bab6 ZW |
3298 | /* If we're using the non-reentrant PCC calling convention, then we |
3299 | need to copy the returned value out of the static buffer into the | |
3300 | SLOT. */ | |
78757caa | 3301 | push_deferring_access_checks (dk_no_check); |
46af705a | 3302 | call_expr = build_aggr_init (slot, call_expr, |
5ade1ed2 DG |
3303 | DIRECT_BIND | LOOKUP_ONLYCONVERTING, |
3304 | tf_warning_or_error); | |
78757caa | 3305 | pop_deferring_access_checks (); |
d17791d6 | 3306 | call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot); |
3eb24f73 | 3307 | } |
3eb24f73 | 3308 | |
450a927a JM |
3309 | if (AGGR_INIT_ZERO_FIRST (aggr_init_expr)) |
3310 | { | |
3311 | tree init = build_zero_init (type, NULL_TREE, | |
3312 | /*static_storage_p=*/false); | |
3313 | init = build2 (INIT_EXPR, void_type_node, slot, init); | |
3314 | call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr), | |
3315 | init, call_expr); | |
3316 | } | |
3317 | ||
3eb24f73 | 3318 | *tp = call_expr; |
3eb24f73 MM |
3319 | } |
3320 | ||
31f8e4f3 MM |
3321 | /* Emit all thunks to FN that should be emitted when FN is emitted. */ |
3322 | ||
e89d6010 | 3323 | void |
3a978d72 | 3324 | emit_associated_thunks (tree fn) |
31f8e4f3 MM |
3325 | { |
3326 | /* When we use vcall offsets, we emit thunks with the virtual | |
3327 | functions to which they thunk. The whole point of vcall offsets | |
3328 | is so that you can know statically the entire set of thunks that | |
3329 | will ever be needed for a given virtual function, thereby | |
3330 | enabling you to output all the thunks with the function itself. */ | |
4537ec0c DN |
3331 | if (DECL_VIRTUAL_P (fn) |
3332 | /* Do not emit thunks for extern template instantiations. */ | |
3333 | && ! DECL_REALLY_EXTERN (fn)) | |
31f8e4f3 | 3334 | { |
bb5e8a7f | 3335 | tree thunk; |
c8094d83 | 3336 | |
bb5e8a7f | 3337 | for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk)) |
4977bab6 | 3338 | { |
e00853fd | 3339 | if (!THUNK_ALIAS (thunk)) |
4977bab6 | 3340 | { |
bb885938 NS |
3341 | use_thunk (thunk, /*emit_p=*/1); |
3342 | if (DECL_RESULT_THUNK_P (thunk)) | |
3343 | { | |
3344 | tree probe; | |
c8094d83 | 3345 | |
bb885938 NS |
3346 | for (probe = DECL_THUNKS (thunk); |
3347 | probe; probe = TREE_CHAIN (probe)) | |
3348 | use_thunk (probe, /*emit_p=*/1); | |
3349 | } | |
4977bab6 | 3350 | } |
bb885938 | 3351 | else |
50bc768d | 3352 | gcc_assert (!DECL_THUNKS (thunk)); |
4977bab6 | 3353 | } |
31f8e4f3 MM |
3354 | } |
3355 | } | |
3356 | ||
558475f0 MM |
3357 | /* Generate RTL for FN. */ |
3358 | ||
b2583345 JJ |
3359 | bool |
3360 | expand_or_defer_fn_1 (tree fn) | |
8cd2462c JH |
3361 | { |
3362 | /* When the parser calls us after finishing the body of a template | |
c353b8e3 MM |
3363 | function, we don't really want to expand the body. */ |
3364 | if (processing_template_decl) | |
8cd2462c JH |
3365 | { |
3366 | /* Normally, collection only occurs in rest_of_compilation. So, | |
3367 | if we don't collect here, we never collect junk generated | |
3368 | during the processing of templates until we hit a | |
27250734 MM |
3369 | non-template function. It's not safe to do this inside a |
3370 | nested class, though, as the parser may have local state that | |
3371 | is not a GC root. */ | |
3372 | if (!function_depth) | |
3373 | ggc_collect (); | |
b2583345 | 3374 | return false; |
8cd2462c JH |
3375 | } |
3376 | ||
a406865a | 3377 | gcc_assert (DECL_SAVED_TREE (fn)); |
726a989a | 3378 | |
8cd2462c JH |
3379 | /* If this is a constructor or destructor body, we have to clone |
3380 | it. */ | |
3381 | if (maybe_clone_body (fn)) | |
3382 | { | |
3383 | /* We don't want to process FN again, so pretend we've written | |
3384 | it out, even though we haven't. */ | |
3385 | TREE_ASM_WRITTEN (fn) = 1; | |
c6a21142 | 3386 | DECL_SAVED_TREE (fn) = NULL_TREE; |
b2583345 | 3387 | return false; |
8cd2462c JH |
3388 | } |
3389 | ||
4684cd27 MM |
3390 | /* We make a decision about linkage for these functions at the end |
3391 | of the compilation. Until that point, we do not want the back | |
3392 | end to output them -- but we do want it to see the bodies of | |
1a10290c | 3393 | these functions so that it can inline them as appropriate. */ |
4684cd27 MM |
3394 | if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn)) |
3395 | { | |
1ef0df47 MM |
3396 | if (DECL_INTERFACE_KNOWN (fn)) |
3397 | /* We've already made a decision as to how this function will | |
3398 | be handled. */; | |
3399 | else if (!at_eof) | |
4684cd27 MM |
3400 | { |
3401 | DECL_EXTERNAL (fn) = 1; | |
3402 | DECL_NOT_REALLY_EXTERN (fn) = 1; | |
3403 | note_vague_linkage_fn (fn); | |
1ef0df47 MM |
3404 | /* A non-template inline function with external linkage will |
3405 | always be COMDAT. As we must eventually determine the | |
3406 | linkage of all functions, and as that causes writes to | |
3407 | the data mapped in from the PCH file, it's advantageous | |
3408 | to mark the functions at this point. */ | |
3409 | if (!DECL_IMPLICIT_INSTANTIATION (fn)) | |
3410 | { | |
3411 | /* This function must have external linkage, as | |
3412 | otherwise DECL_INTERFACE_KNOWN would have been | |
3413 | set. */ | |
3414 | gcc_assert (TREE_PUBLIC (fn)); | |
3415 | comdat_linkage (fn); | |
3416 | DECL_INTERFACE_KNOWN (fn) = 1; | |
3417 | } | |
4684cd27 MM |
3418 | } |
3419 | else | |
3420 | import_export_decl (fn); | |
1a10290c MM |
3421 | |
3422 | /* If the user wants us to keep all inline functions, then mark | |
3423 | this function as needed so that finish_file will make sure to | |
fe2978fb MM |
3424 | output it later. Similarly, all dllexport'd functions must |
3425 | be emitted; there may be callers in other DLLs. */ | |
3426 | if ((flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn)) | |
3427 | || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn))) | |
1a10290c | 3428 | mark_needed (fn); |
4684cd27 MM |
3429 | } |
3430 | ||
8cd2462c JH |
3431 | /* There's no reason to do any of the work here if we're only doing |
3432 | semantic analysis; this code just generates RTL. */ | |
3433 | if (flag_syntax_only) | |
b2583345 JJ |
3434 | return false; |
3435 | ||
3436 | return true; | |
3437 | } | |
8cd2462c | 3438 | |
b2583345 JJ |
3439 | void |
3440 | expand_or_defer_fn (tree fn) | |
3441 | { | |
3442 | if (expand_or_defer_fn_1 (fn)) | |
3443 | { | |
3444 | function_depth++; | |
99edd65d | 3445 | |
b2583345 JJ |
3446 | /* Expand or defer, at the whim of the compilation unit manager. */ |
3447 | cgraph_finalize_function (fn, function_depth > 1); | |
6744a6ab | 3448 | emit_associated_thunks (fn); |
99edd65d | 3449 | |
b2583345 JJ |
3450 | function_depth--; |
3451 | } | |
8cd2462c JH |
3452 | } |
3453 | ||
6de9cd9a DN |
3454 | struct nrv_data |
3455 | { | |
3456 | tree var; | |
3457 | tree result; | |
3458 | htab_t visited; | |
3459 | }; | |
0d97bf4c | 3460 | |
6de9cd9a DN |
3461 | /* Helper function for walk_tree, used by finalize_nrv below. */ |
3462 | ||
3463 | static tree | |
3464 | finalize_nrv_r (tree* tp, int* walk_subtrees, void* data) | |
0d97bf4c | 3465 | { |
6de9cd9a DN |
3466 | struct nrv_data *dp = (struct nrv_data *)data; |
3467 | void **slot; | |
07b2f2fd JM |
3468 | |
3469 | /* No need to walk into types. There wouldn't be any need to walk into | |
3470 | non-statements, except that we have to consider STMT_EXPRs. */ | |
0d97bf4c JM |
3471 | if (TYPE_P (*tp)) |
3472 | *walk_subtrees = 0; | |
6de9cd9a DN |
3473 | /* Change all returns to just refer to the RESULT_DECL; this is a nop, |
3474 | but differs from using NULL_TREE in that it indicates that we care | |
3475 | about the value of the RESULT_DECL. */ | |
5088b058 RH |
3476 | else if (TREE_CODE (*tp) == RETURN_EXPR) |
3477 | TREE_OPERAND (*tp, 0) = dp->result; | |
6de9cd9a DN |
3478 | /* Change all cleanups for the NRV to only run when an exception is |
3479 | thrown. */ | |
07b2f2fd | 3480 | else if (TREE_CODE (*tp) == CLEANUP_STMT |
6de9cd9a | 3481 | && CLEANUP_DECL (*tp) == dp->var) |
659e5a7a | 3482 | CLEANUP_EH_ONLY (*tp) = 1; |
350fae66 | 3483 | /* Replace the DECL_EXPR for the NRV with an initialization of the |
6de9cd9a | 3484 | RESULT_DECL, if needed. */ |
350fae66 RK |
3485 | else if (TREE_CODE (*tp) == DECL_EXPR |
3486 | && DECL_EXPR_DECL (*tp) == dp->var) | |
6de9cd9a DN |
3487 | { |
3488 | tree init; | |
3489 | if (DECL_INITIAL (dp->var) | |
3490 | && DECL_INITIAL (dp->var) != error_mark_node) | |
2d188530 JJ |
3491 | init = build2 (INIT_EXPR, void_type_node, dp->result, |
3492 | DECL_INITIAL (dp->var)); | |
6de9cd9a | 3493 | else |
c2255bc4 | 3494 | init = build_empty_stmt (EXPR_LOCATION (*tp)); |
2d188530 | 3495 | DECL_INITIAL (dp->var) = NULL_TREE; |
5e278028 | 3496 | SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp)); |
6de9cd9a DN |
3497 | *tp = init; |
3498 | } | |
3499 | /* And replace all uses of the NRV with the RESULT_DECL. */ | |
3500 | else if (*tp == dp->var) | |
3501 | *tp = dp->result; | |
3502 | ||
3503 | /* Avoid walking into the same tree more than once. Unfortunately, we | |
3504 | can't just use walk_tree_without duplicates because it would only call | |
3505 | us for the first occurrence of dp->var in the function body. */ | |
3506 | slot = htab_find_slot (dp->visited, *tp, INSERT); | |
3507 | if (*slot) | |
3508 | *walk_subtrees = 0; | |
3509 | else | |
3510 | *slot = *tp; | |
0d97bf4c JM |
3511 | |
3512 | /* Keep iterating. */ | |
3513 | return NULL_TREE; | |
3514 | } | |
3515 | ||
6de9cd9a | 3516 | /* Called from finish_function to implement the named return value |
5088b058 | 3517 | optimization by overriding all the RETURN_EXPRs and pertinent |
6de9cd9a DN |
3518 | CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the |
3519 | RESULT_DECL for the function. */ | |
f444e36b | 3520 | |
4985cde3 | 3521 | void |
6de9cd9a | 3522 | finalize_nrv (tree *tp, tree var, tree result) |
f444e36b | 3523 | { |
6de9cd9a DN |
3524 | struct nrv_data data; |
3525 | ||
3526 | /* Copy debugging information from VAR to RESULT. */ | |
3527 | DECL_NAME (result) = DECL_NAME (var); | |
b785f485 RH |
3528 | DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var); |
3529 | DECL_IGNORED_P (result) = DECL_IGNORED_P (var); | |
6de9cd9a DN |
3530 | DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var); |
3531 | DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var); | |
3532 | /* Don't forget that we take its address. */ | |
3533 | TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var); | |
3534 | ||
3535 | data.var = var; | |
3536 | data.result = result; | |
3537 | data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL); | |
14588106 | 3538 | cp_walk_tree (tp, finalize_nrv_r, &data, 0); |
6de9cd9a | 3539 | htab_delete (data.visited); |
b850de4f | 3540 | } |
1799e5d5 | 3541 | \f |
7a0112e7 JJ |
3542 | /* Return the declaration for the function called by CALL_EXPR T, |
3543 | TYPE is the class type of the clause decl. */ | |
3544 | ||
3545 | static tree | |
3546 | omp_clause_info_fndecl (tree t, tree type) | |
3547 | { | |
3548 | tree ret = get_callee_fndecl (t); | |
3549 | ||
3550 | if (ret) | |
3551 | return ret; | |
3552 | ||
3553 | gcc_assert (TREE_CODE (t) == CALL_EXPR); | |
3554 | t = CALL_EXPR_FN (t); | |
3555 | STRIP_NOPS (t); | |
3556 | if (TREE_CODE (t) == OBJ_TYPE_REF) | |
3557 | { | |
3558 | t = cp_fold_obj_type_ref (t, type); | |
3559 | if (TREE_CODE (t) == ADDR_EXPR | |
3560 | && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL) | |
3561 | return TREE_OPERAND (t, 0); | |
3562 | } | |
3563 | ||
3564 | return NULL_TREE; | |
3565 | } | |
3566 | ||
a68ab351 JJ |
3567 | /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */ |
3568 | ||
3569 | bool | |
3570 | cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor, | |
3571 | bool need_copy_ctor, bool need_copy_assignment) | |
3572 | { | |
3573 | int save_errorcount = errorcount; | |
3574 | tree info, t; | |
3575 | ||
3576 | /* Always allocate 3 elements for simplicity. These are the | |
3577 | function decls for the ctor, dtor, and assignment op. | |
3578 | This layout is known to the three lang hooks, | |
3579 | cxx_omp_clause_default_init, cxx_omp_clause_copy_init, | |
3580 | and cxx_omp_clause_assign_op. */ | |
3581 | info = make_tree_vec (3); | |
3582 | CP_OMP_CLAUSE_INFO (c) = info; | |
3583 | ||
3584 | if (need_default_ctor | |
3585 | || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type))) | |
3586 | { | |
c166b898 ILT |
3587 | VEC(tree,gc) *vec; |
3588 | ||
a68ab351 | 3589 | if (need_default_ctor) |
c166b898 | 3590 | vec = NULL; |
a68ab351 JJ |
3591 | else |
3592 | { | |
3593 | t = build_int_cst (build_pointer_type (type), 0); | |
3594 | t = build1 (INDIRECT_REF, type, t); | |
c166b898 | 3595 | vec = make_tree_vector_single (t); |
a68ab351 JJ |
3596 | } |
3597 | t = build_special_member_call (NULL_TREE, complete_ctor_identifier, | |
c166b898 | 3598 | &vec, type, LOOKUP_NORMAL, |
a68ab351 JJ |
3599 | tf_warning_or_error); |
3600 | ||
c166b898 ILT |
3601 | if (vec != NULL) |
3602 | release_tree_vector (vec); | |
3603 | ||
a68ab351 JJ |
3604 | if (targetm.cxx.cdtor_returns_this () || errorcount) |
3605 | /* Because constructors and destructors return this, | |
3606 | the call will have been cast to "void". Remove the | |
3607 | cast here. We would like to use STRIP_NOPS, but it | |
3608 | wouldn't work here because TYPE_MODE (t) and | |
3609 | TYPE_MODE (TREE_OPERAND (t, 0)) are different. | |
3610 | They are VOIDmode and Pmode, respectively. */ | |
3611 | if (TREE_CODE (t) == NOP_EXPR) | |
3612 | t = TREE_OPERAND (t, 0); | |
3613 | ||
3614 | TREE_VEC_ELT (info, 0) = get_callee_fndecl (t); | |
3615 | } | |
3616 | ||
3617 | if ((need_default_ctor || need_copy_ctor) | |
3618 | && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
3619 | { | |
3620 | t = build_int_cst (build_pointer_type (type), 0); | |
3621 | t = build1 (INDIRECT_REF, type, t); | |
3622 | t = build_special_member_call (t, complete_dtor_identifier, | |
3623 | NULL, type, LOOKUP_NORMAL, | |
3624 | tf_warning_or_error); | |
3625 | ||
3626 | if (targetm.cxx.cdtor_returns_this () || errorcount) | |
3627 | /* Because constructors and destructors return this, | |
3628 | the call will have been cast to "void". Remove the | |
3629 | cast here. We would like to use STRIP_NOPS, but it | |
3630 | wouldn't work here because TYPE_MODE (t) and | |
3631 | TYPE_MODE (TREE_OPERAND (t, 0)) are different. | |
3632 | They are VOIDmode and Pmode, respectively. */ | |
3633 | if (TREE_CODE (t) == NOP_EXPR) | |
3634 | t = TREE_OPERAND (t, 0); | |
3635 | ||
3636 | TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type); | |
3637 | } | |
3638 | ||
3639 | if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type)) | |
3640 | { | |
c166b898 ILT |
3641 | VEC(tree,gc) *vec; |
3642 | ||
a68ab351 JJ |
3643 | t = build_int_cst (build_pointer_type (type), 0); |
3644 | t = build1 (INDIRECT_REF, type, t); | |
c166b898 | 3645 | vec = make_tree_vector_single (t); |
a68ab351 | 3646 | t = build_special_member_call (t, ansi_assopname (NOP_EXPR), |
c166b898 | 3647 | &vec, type, LOOKUP_NORMAL, |
a68ab351 | 3648 | tf_warning_or_error); |
c166b898 | 3649 | release_tree_vector (vec); |
a68ab351 JJ |
3650 | |
3651 | /* We'll have called convert_from_reference on the call, which | |
3652 | may well have added an indirect_ref. It's unneeded here, | |
3653 | and in the way, so kill it. */ | |
3654 | if (TREE_CODE (t) == INDIRECT_REF) | |
3655 | t = TREE_OPERAND (t, 0); | |
3656 | ||
3657 | TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type); | |
3658 | } | |
3659 | ||
3660 | return errorcount != save_errorcount; | |
3661 | } | |
3662 | ||
1799e5d5 RH |
3663 | /* For all elements of CLAUSES, validate them vs OpenMP constraints. |
3664 | Remove any elements from the list that are invalid. */ | |
3665 | ||
3666 | tree | |
3667 | finish_omp_clauses (tree clauses) | |
3668 | { | |
3669 | bitmap_head generic_head, firstprivate_head, lastprivate_head; | |
3670 | tree c, t, *pc = &clauses; | |
3671 | const char *name; | |
3672 | ||
3673 | bitmap_obstack_initialize (NULL); | |
3674 | bitmap_initialize (&generic_head, &bitmap_default_obstack); | |
3675 | bitmap_initialize (&firstprivate_head, &bitmap_default_obstack); | |
3676 | bitmap_initialize (&lastprivate_head, &bitmap_default_obstack); | |
3677 | ||
3678 | for (pc = &clauses, c = clauses; c ; c = *pc) | |
3679 | { | |
3680 | bool remove = false; | |
3681 | ||
3682 | switch (OMP_CLAUSE_CODE (c)) | |
3683 | { | |
3684 | case OMP_CLAUSE_SHARED: | |
3685 | name = "shared"; | |
3686 | goto check_dup_generic; | |
3687 | case OMP_CLAUSE_PRIVATE: | |
3688 | name = "private"; | |
3689 | goto check_dup_generic; | |
3690 | case OMP_CLAUSE_REDUCTION: | |
3691 | name = "reduction"; | |
3692 | goto check_dup_generic; | |
3693 | case OMP_CLAUSE_COPYPRIVATE: | |
3694 | name = "copyprivate"; | |
3695 | goto check_dup_generic; | |
3696 | case OMP_CLAUSE_COPYIN: | |
3697 | name = "copyin"; | |
3698 | goto check_dup_generic; | |
3699 | check_dup_generic: | |
3700 | t = OMP_CLAUSE_DECL (c); | |
3701 | if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) | |
3702 | { | |
3703 | if (processing_template_decl) | |
3704 | break; | |
76dc15d4 JJ |
3705 | if (DECL_P (t)) |
3706 | error ("%qD is not a variable in clause %qs", t, name); | |
3707 | else | |
3708 | error ("%qE is not a variable in clause %qs", t, name); | |
1799e5d5 RH |
3709 | remove = true; |
3710 | } | |
3711 | else if (bitmap_bit_p (&generic_head, DECL_UID (t)) | |
3712 | || bitmap_bit_p (&firstprivate_head, DECL_UID (t)) | |
3713 | || bitmap_bit_p (&lastprivate_head, DECL_UID (t))) | |
3714 | { | |
76dc15d4 | 3715 | error ("%qD appears more than once in data clauses", t); |
1799e5d5 RH |
3716 | remove = true; |
3717 | } | |
3718 | else | |
3719 | bitmap_set_bit (&generic_head, DECL_UID (t)); | |
3720 | break; | |
3721 | ||
3722 | case OMP_CLAUSE_FIRSTPRIVATE: | |
3723 | t = OMP_CLAUSE_DECL (c); | |
3724 | if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) | |
3725 | { | |
3726 | if (processing_template_decl) | |
3727 | break; | |
85b20612 JJ |
3728 | if (DECL_P (t)) |
3729 | error ("%qD is not a variable in clause %<firstprivate%>", t); | |
3730 | else | |
3731 | error ("%qE is not a variable in clause %<firstprivate%>", t); | |
1799e5d5 RH |
3732 | remove = true; |
3733 | } | |
3734 | else if (bitmap_bit_p (&generic_head, DECL_UID (t)) | |
3735 | || bitmap_bit_p (&firstprivate_head, DECL_UID (t))) | |
3736 | { | |
85b20612 | 3737 | error ("%qD appears more than once in data clauses", t); |
1799e5d5 RH |
3738 | remove = true; |
3739 | } | |
3740 | else | |
3741 | bitmap_set_bit (&firstprivate_head, DECL_UID (t)); | |
3742 | break; | |
3743 | ||
3744 | case OMP_CLAUSE_LASTPRIVATE: | |
3745 | t = OMP_CLAUSE_DECL (c); | |
3746 | if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) | |
3747 | { | |
3748 | if (processing_template_decl) | |
3749 | break; | |
85b20612 JJ |
3750 | if (DECL_P (t)) |
3751 | error ("%qD is not a variable in clause %<lastprivate%>", t); | |
3752 | else | |
3753 | error ("%qE is not a variable in clause %<lastprivate%>", t); | |
1799e5d5 RH |
3754 | remove = true; |
3755 | } | |
3756 | else if (bitmap_bit_p (&generic_head, DECL_UID (t)) | |
3757 | || bitmap_bit_p (&lastprivate_head, DECL_UID (t))) | |
3758 | { | |
85b20612 | 3759 | error ("%qD appears more than once in data clauses", t); |
1799e5d5 RH |
3760 | remove = true; |
3761 | } | |
3762 | else | |
3763 | bitmap_set_bit (&lastprivate_head, DECL_UID (t)); | |
3764 | break; | |
3765 | ||
3766 | case OMP_CLAUSE_IF: | |
3767 | t = OMP_CLAUSE_IF_EXPR (c); | |
3768 | t = maybe_convert_cond (t); | |
3769 | if (t == error_mark_node) | |
3770 | remove = true; | |
3771 | OMP_CLAUSE_IF_EXPR (c) = t; | |
3772 | break; | |
3773 | ||
3774 | case OMP_CLAUSE_NUM_THREADS: | |
3775 | t = OMP_CLAUSE_NUM_THREADS_EXPR (c); | |
3776 | if (t == error_mark_node) | |
3777 | remove = true; | |
6e684eee JJ |
3778 | else if (!type_dependent_expression_p (t) |
3779 | && !INTEGRAL_TYPE_P (TREE_TYPE (t))) | |
1799e5d5 RH |
3780 | { |
3781 | error ("num_threads expression must be integral"); | |
3782 | remove = true; | |
3783 | } | |
3784 | break; | |
3785 | ||
3786 | case OMP_CLAUSE_SCHEDULE: | |
3787 | t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c); | |
3788 | if (t == NULL) | |
3789 | ; | |
3790 | else if (t == error_mark_node) | |
3791 | remove = true; | |
6e684eee JJ |
3792 | else if (!type_dependent_expression_p (t) |
3793 | && !INTEGRAL_TYPE_P (TREE_TYPE (t))) | |
1799e5d5 RH |
3794 | { |
3795 | error ("schedule chunk size expression must be integral"); | |
3796 | remove = true; | |
3797 | } | |
3798 | break; | |
3799 | ||
3800 | case OMP_CLAUSE_NOWAIT: | |
3801 | case OMP_CLAUSE_ORDERED: | |
3802 | case OMP_CLAUSE_DEFAULT: | |
a68ab351 JJ |
3803 | case OMP_CLAUSE_UNTIED: |
3804 | case OMP_CLAUSE_COLLAPSE: | |
1799e5d5 RH |
3805 | break; |
3806 | ||
3807 | default: | |
3808 | gcc_unreachable (); | |
3809 | } | |
3810 | ||
3811 | if (remove) | |
3812 | *pc = OMP_CLAUSE_CHAIN (c); | |
3813 | else | |
3814 | pc = &OMP_CLAUSE_CHAIN (c); | |
3815 | } | |
3816 | ||
3817 | for (pc = &clauses, c = clauses; c ; c = *pc) | |
3818 | { | |
81f40b79 | 3819 | enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c); |
1799e5d5 RH |
3820 | bool remove = false; |
3821 | bool need_complete_non_reference = false; | |
3822 | bool need_default_ctor = false; | |
3823 | bool need_copy_ctor = false; | |
3824 | bool need_copy_assignment = false; | |
3825 | bool need_implicitly_determined = false; | |
3826 | tree type, inner_type; | |
3827 | ||
3828 | switch (c_kind) | |
3829 | { | |
3830 | case OMP_CLAUSE_SHARED: | |
3831 | name = "shared"; | |
3832 | need_implicitly_determined = true; | |
3833 | break; | |
3834 | case OMP_CLAUSE_PRIVATE: | |
3835 | name = "private"; | |
3836 | need_complete_non_reference = true; | |
3837 | need_default_ctor = true; | |
3838 | need_implicitly_determined = true; | |
3839 | break; | |
3840 | case OMP_CLAUSE_FIRSTPRIVATE: | |
3841 | name = "firstprivate"; | |
3842 | need_complete_non_reference = true; | |
3843 | need_copy_ctor = true; | |
3844 | need_implicitly_determined = true; | |
3845 | break; | |
3846 | case OMP_CLAUSE_LASTPRIVATE: | |
3847 | name = "lastprivate"; | |
3848 | need_complete_non_reference = true; | |
3849 | need_copy_assignment = true; | |
3850 | need_implicitly_determined = true; | |
3851 | break; | |
3852 | case OMP_CLAUSE_REDUCTION: | |
3853 | name = "reduction"; | |
3854 | need_implicitly_determined = true; | |
3855 | break; | |
3856 | case OMP_CLAUSE_COPYPRIVATE: | |
3857 | name = "copyprivate"; | |
3858 | need_copy_assignment = true; | |
3859 | break; | |
3860 | case OMP_CLAUSE_COPYIN: | |
3861 | name = "copyin"; | |
3862 | need_copy_assignment = true; | |
3863 | break; | |
3864 | default: | |
3865 | pc = &OMP_CLAUSE_CHAIN (c); | |
3866 | continue; | |
3867 | } | |
3868 | ||
3869 | t = OMP_CLAUSE_DECL (c); | |
3870 | if (processing_template_decl | |
3871 | && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) | |
3872 | { | |
3873 | pc = &OMP_CLAUSE_CHAIN (c); | |
3874 | continue; | |
3875 | } | |
3876 | ||
3877 | switch (c_kind) | |
3878 | { | |
3879 | case OMP_CLAUSE_LASTPRIVATE: | |
3880 | if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t))) | |
3881 | need_default_ctor = true; | |
3882 | break; | |
3883 | ||
3884 | case OMP_CLAUSE_REDUCTION: | |
3885 | if (AGGREGATE_TYPE_P (TREE_TYPE (t)) | |
3886 | || POINTER_TYPE_P (TREE_TYPE (t))) | |
3887 | { | |
3888 | error ("%qE has invalid type for %<reduction%>", t); | |
3889 | remove = true; | |
3890 | } | |
3891 | else if (FLOAT_TYPE_P (TREE_TYPE (t))) | |
3892 | { | |
3893 | enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c); | |
3894 | switch (r_code) | |
3895 | { | |
3896 | case PLUS_EXPR: | |
3897 | case MULT_EXPR: | |
3898 | case MINUS_EXPR: | |
3899 | break; | |
3900 | default: | |
3901 | error ("%qE has invalid type for %<reduction(%s)%>", | |
3902 | t, operator_name_info[r_code].name); | |
3903 | remove = true; | |
3904 | } | |
3905 | } | |
3906 | break; | |
3907 | ||
3908 | case OMP_CLAUSE_COPYIN: | |
3909 | if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t)) | |
3910 | { | |
3911 | error ("%qE must be %<threadprivate%> for %<copyin%>", t); | |
3912 | remove = true; | |
3913 | } | |
3914 | break; | |
3915 | ||
3916 | default: | |
3917 | break; | |
3918 | } | |
3919 | ||
3920 | if (need_complete_non_reference) | |
3921 | { | |
3922 | t = require_complete_type (t); | |
3923 | if (t == error_mark_node) | |
3924 | remove = true; | |
3925 | else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE) | |
3926 | { | |
3927 | error ("%qE has reference type for %qs", t, name); | |
3928 | remove = true; | |
3929 | } | |
3930 | } | |
3931 | if (need_implicitly_determined) | |
3932 | { | |
3933 | const char *share_name = NULL; | |
3934 | ||
3935 | if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t)) | |
3936 | share_name = "threadprivate"; | |
3937 | else switch (cxx_omp_predetermined_sharing (t)) | |
3938 | { | |
3939 | case OMP_CLAUSE_DEFAULT_UNSPECIFIED: | |
3940 | break; | |
3941 | case OMP_CLAUSE_DEFAULT_SHARED: | |
3942 | share_name = "shared"; | |
3943 | break; | |
3944 | case OMP_CLAUSE_DEFAULT_PRIVATE: | |
3945 | share_name = "private"; | |
3946 | break; | |
3947 | default: | |
3948 | gcc_unreachable (); | |
3949 | } | |
3950 | if (share_name) | |
3951 | { | |
3952 | error ("%qE is predetermined %qs for %qs", | |
3953 | t, share_name, name); | |
3954 | remove = true; | |
3955 | } | |
3956 | } | |
3957 | ||
3958 | /* We're interested in the base element, not arrays. */ | |
3959 | inner_type = type = TREE_TYPE (t); | |
3960 | while (TREE_CODE (inner_type) == ARRAY_TYPE) | |
3961 | inner_type = TREE_TYPE (inner_type); | |
3962 | ||
84dc00e8 | 3963 | /* Check for special function availability by building a call to one. |
1799e5d5 RH |
3964 | Save the results, because later we won't be in the right context |
3965 | for making these queries. */ | |
3966 | if (CLASS_TYPE_P (inner_type) | |
6f719560 | 3967 | && (need_default_ctor || need_copy_ctor || need_copy_assignment) |
a68ab351 JJ |
3968 | && !type_dependent_expression_p (t) |
3969 | && cxx_omp_create_clause_info (c, inner_type, need_default_ctor, | |
3970 | need_copy_ctor, need_copy_assignment)) | |
3971 | remove = true; | |
1799e5d5 RH |
3972 | |
3973 | if (remove) | |
3974 | *pc = OMP_CLAUSE_CHAIN (c); | |
3975 | else | |
3976 | pc = &OMP_CLAUSE_CHAIN (c); | |
3977 | } | |
3978 | ||
3979 | bitmap_obstack_release (NULL); | |
3980 | return clauses; | |
3981 | } | |
3982 | ||
3983 | /* For all variables in the tree_list VARS, mark them as thread local. */ | |
3984 | ||
3985 | void | |
3986 | finish_omp_threadprivate (tree vars) | |
3987 | { | |
3988 | tree t; | |
3989 | ||
3990 | /* Mark every variable in VARS to be assigned thread local storage. */ | |
3991 | for (t = vars; t; t = TREE_CHAIN (t)) | |
3992 | { | |
3993 | tree v = TREE_PURPOSE (t); | |
3994 | ||
edb6000e JJ |
3995 | if (error_operand_p (v)) |
3996 | ; | |
3997 | else if (TREE_CODE (v) != VAR_DECL) | |
3998 | error ("%<threadprivate%> %qD is not file, namespace " | |
3999 | "or block scope variable", v); | |
1799e5d5 RH |
4000 | /* If V had already been marked threadprivate, it doesn't matter |
4001 | whether it had been used prior to this point. */ | |
edb6000e | 4002 | else if (TREE_USED (v) |
1799e5d5 RH |
4003 | && (DECL_LANG_SPECIFIC (v) == NULL |
4004 | || !CP_DECL_THREADPRIVATE_P (v))) | |
4005 | error ("%qE declared %<threadprivate%> after first use", v); | |
4006 | else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v)) | |
4007 | error ("automatic variable %qE cannot be %<threadprivate%>", v); | |
4008 | else if (! COMPLETE_TYPE_P (TREE_TYPE (v))) | |
4009 | error ("%<threadprivate%> %qE has incomplete type", v); | |
a68ab351 JJ |
4010 | else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v)) |
4011 | && CP_DECL_CONTEXT (v) != current_class_type) | |
4012 | error ("%<threadprivate%> %qE directive not " | |
4013 | "in %qT definition", v, CP_DECL_CONTEXT (v)); | |
1799e5d5 RH |
4014 | else |
4015 | { | |
4016 | /* Allocate a LANG_SPECIFIC structure for V, if needed. */ | |
4017 | if (DECL_LANG_SPECIFIC (v) == NULL) | |
4018 | { | |
4019 | retrofit_lang_decl (v); | |
4020 | ||
4021 | /* Make sure that DECL_DISCRIMINATOR_P continues to be true | |
4022 | after the allocation of the lang_decl structure. */ | |
4023 | if (DECL_DISCRIMINATOR_P (v)) | |
b97e8a14 | 4024 | DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1; |
1799e5d5 RH |
4025 | } |
4026 | ||
4027 | if (! DECL_THREAD_LOCAL_P (v)) | |
4028 | { | |
4029 | DECL_TLS_MODEL (v) = decl_default_tls_model (v); | |
4030 | /* If rtl has been already set for this var, call | |
4031 | make_decl_rtl once again, so that encode_section_info | |
4032 | has a chance to look at the new decl flags. */ | |
4033 | if (DECL_RTL_SET_P (v)) | |
4034 | make_decl_rtl (v); | |
4035 | } | |
4036 | CP_DECL_THREADPRIVATE_P (v) = 1; | |
4037 | } | |
4038 | } | |
4039 | } | |
4040 | ||
4041 | /* Build an OpenMP structured block. */ | |
4042 | ||
4043 | tree | |
4044 | begin_omp_structured_block (void) | |
4045 | { | |
4046 | return do_pushlevel (sk_omp); | |
4047 | } | |
4048 | ||
4049 | tree | |
4050 | finish_omp_structured_block (tree block) | |
4051 | { | |
4052 | return do_poplevel (block); | |
4053 | } | |
4054 | ||
84dc00e8 | 4055 | /* Similarly, except force the retention of the BLOCK. */ |
1799e5d5 RH |
4056 | |
4057 | tree | |
4058 | begin_omp_parallel (void) | |
4059 | { | |
4060 | keep_next_level (true); | |
4061 | return begin_omp_structured_block (); | |
4062 | } | |
4063 | ||
4064 | tree | |
4065 | finish_omp_parallel (tree clauses, tree body) | |
4066 | { | |
4067 | tree stmt; | |
4068 | ||
4069 | body = finish_omp_structured_block (body); | |
b850de4f | 4070 | |
1799e5d5 RH |
4071 | stmt = make_node (OMP_PARALLEL); |
4072 | TREE_TYPE (stmt) = void_type_node; | |
4073 | OMP_PARALLEL_CLAUSES (stmt) = clauses; | |
4074 | OMP_PARALLEL_BODY (stmt) = body; | |
54f7877c | 4075 | |
1799e5d5 RH |
4076 | return add_stmt (stmt); |
4077 | } | |
4078 | ||
a68ab351 JJ |
4079 | tree |
4080 | begin_omp_task (void) | |
4081 | { | |
4082 | keep_next_level (true); | |
4083 | return begin_omp_structured_block (); | |
4084 | } | |
4085 | ||
4086 | tree | |
4087 | finish_omp_task (tree clauses, tree body) | |
4088 | { | |
4089 | tree stmt; | |
4090 | ||
4091 | body = finish_omp_structured_block (body); | |
4092 | ||
4093 | stmt = make_node (OMP_TASK); | |
4094 | TREE_TYPE (stmt) = void_type_node; | |
4095 | OMP_TASK_CLAUSES (stmt) = clauses; | |
4096 | OMP_TASK_BODY (stmt) = body; | |
4097 | ||
4098 | return add_stmt (stmt); | |
4099 | } | |
4100 | ||
4101 | /* Helper function for finish_omp_for. Convert Ith random access iterator | |
4102 | into integral iterator. Return FALSE if successful. */ | |
4103 | ||
4104 | static bool | |
4105 | handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv, | |
4106 | tree condv, tree incrv, tree *body, | |
4107 | tree *pre_body, tree clauses) | |
4108 | { | |
4109 | tree diff, iter_init, iter_incr = NULL, last; | |
4110 | tree incr_var = NULL, orig_pre_body, orig_body, c; | |
4111 | tree decl = TREE_VEC_ELT (declv, i); | |
4112 | tree init = TREE_VEC_ELT (initv, i); | |
4113 | tree cond = TREE_VEC_ELT (condv, i); | |
4114 | tree incr = TREE_VEC_ELT (incrv, i); | |
4115 | tree iter = decl; | |
4116 | location_t elocus = locus; | |
4117 | ||
4118 | if (init && EXPR_HAS_LOCATION (init)) | |
4119 | elocus = EXPR_LOCATION (init); | |
4120 | ||
4121 | switch (TREE_CODE (cond)) | |
4122 | { | |
4123 | case GT_EXPR: | |
4124 | case GE_EXPR: | |
4125 | case LT_EXPR: | |
4126 | case LE_EXPR: | |
c5cdb03f JJ |
4127 | if (TREE_OPERAND (cond, 1) == iter) |
4128 | cond = build2 (swap_tree_comparison (TREE_CODE (cond)), | |
4129 | TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0)); | |
a68ab351 JJ |
4130 | if (TREE_OPERAND (cond, 0) != iter) |
4131 | cond = error_mark_node; | |
4132 | else | |
4133 | { | |
4134 | tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK, | |
4135 | TREE_OPERAND (cond, 1), ERROR_MARK, | |
4136 | NULL, tf_warning_or_error); | |
4137 | if (error_operand_p (tem)) | |
4138 | return true; | |
4139 | } | |
4140 | break; | |
4141 | default: | |
4142 | cond = error_mark_node; | |
4143 | break; | |
4144 | } | |
4145 | if (cond == error_mark_node) | |
4146 | { | |
69bc6bff | 4147 | error_at (elocus, "invalid controlling predicate"); |
a68ab351 JJ |
4148 | return true; |
4149 | } | |
4150 | diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1), | |
4151 | ERROR_MARK, iter, ERROR_MARK, NULL, | |
4152 | tf_warning_or_error); | |
4153 | if (error_operand_p (diff)) | |
4154 | return true; | |
4155 | if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE) | |
4156 | { | |
69bc6bff MLI |
4157 | error_at (elocus, "difference between %qE and %qD does not have integer type", |
4158 | TREE_OPERAND (cond, 1), iter); | |
a68ab351 JJ |
4159 | return true; |
4160 | } | |
4161 | ||
4162 | switch (TREE_CODE (incr)) | |
4163 | { | |
4164 | case PREINCREMENT_EXPR: | |
4165 | case PREDECREMENT_EXPR: | |
4166 | case POSTINCREMENT_EXPR: | |
4167 | case POSTDECREMENT_EXPR: | |
4168 | if (TREE_OPERAND (incr, 0) != iter) | |
4169 | { | |
4170 | incr = error_mark_node; | |
4171 | break; | |
4172 | } | |
4173 | iter_incr = build_x_unary_op (TREE_CODE (incr), iter, | |
4174 | tf_warning_or_error); | |
4175 | if (error_operand_p (iter_incr)) | |
4176 | return true; | |
4177 | else if (TREE_CODE (incr) == PREINCREMENT_EXPR | |
4178 | || TREE_CODE (incr) == POSTINCREMENT_EXPR) | |
4179 | incr = integer_one_node; | |
4180 | else | |
4181 | incr = integer_minus_one_node; | |
4182 | break; | |
4183 | case MODIFY_EXPR: | |
4184 | if (TREE_OPERAND (incr, 0) != iter) | |
4185 | incr = error_mark_node; | |
4186 | else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR | |
4187 | || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR) | |
4188 | { | |
4189 | tree rhs = TREE_OPERAND (incr, 1); | |
4190 | if (TREE_OPERAND (rhs, 0) == iter) | |
4191 | { | |
4192 | if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1))) | |
4193 | != INTEGER_TYPE) | |
4194 | incr = error_mark_node; | |
4195 | else | |
4196 | { | |
4197 | iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs), | |
4198 | TREE_OPERAND (rhs, 1), | |
4199 | tf_warning_or_error); | |
4200 | if (error_operand_p (iter_incr)) | |
4201 | return true; | |
4202 | incr = TREE_OPERAND (rhs, 1); | |
4203 | incr = cp_convert (TREE_TYPE (diff), incr); | |
4204 | if (TREE_CODE (rhs) == MINUS_EXPR) | |
4205 | { | |
4206 | incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr); | |
4207 | incr = fold_if_not_in_template (incr); | |
4208 | } | |
4209 | if (TREE_CODE (incr) != INTEGER_CST | |
4210 | && (TREE_CODE (incr) != NOP_EXPR | |
4211 | || (TREE_CODE (TREE_OPERAND (incr, 0)) | |
4212 | != INTEGER_CST))) | |
4213 | iter_incr = NULL; | |
4214 | } | |
4215 | } | |
4216 | else if (TREE_OPERAND (rhs, 1) == iter) | |
4217 | { | |
4218 | if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE | |
4219 | || TREE_CODE (rhs) != PLUS_EXPR) | |
4220 | incr = error_mark_node; | |
4221 | else | |
4222 | { | |
4223 | iter_incr = build_x_binary_op (PLUS_EXPR, | |
4224 | TREE_OPERAND (rhs, 0), | |
4225 | ERROR_MARK, iter, | |
4226 | ERROR_MARK, NULL, | |
4227 | tf_warning_or_error); | |
4228 | if (error_operand_p (iter_incr)) | |
4229 | return true; | |
4230 | iter_incr = build_x_modify_expr (iter, NOP_EXPR, | |
4231 | iter_incr, | |
4232 | tf_warning_or_error); | |
4233 | if (error_operand_p (iter_incr)) | |
4234 | return true; | |
4235 | incr = TREE_OPERAND (rhs, 0); | |
4236 | iter_incr = NULL; | |
4237 | } | |
4238 | } | |
4239 | else | |
4240 | incr = error_mark_node; | |
4241 | } | |
4242 | else | |
4243 | incr = error_mark_node; | |
4244 | break; | |
4245 | default: | |
4246 | incr = error_mark_node; | |
4247 | break; | |
4248 | } | |
4249 | ||
4250 | if (incr == error_mark_node) | |
4251 | { | |
69bc6bff | 4252 | error_at (elocus, "invalid increment expression"); |
a68ab351 JJ |
4253 | return true; |
4254 | } | |
4255 | ||
4256 | incr = cp_convert (TREE_TYPE (diff), incr); | |
4257 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
4258 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE | |
4259 | && OMP_CLAUSE_DECL (c) == iter) | |
4260 | break; | |
4261 | ||
4262 | decl = create_temporary_var (TREE_TYPE (diff)); | |
4263 | pushdecl (decl); | |
4264 | add_decl_expr (decl); | |
4265 | last = create_temporary_var (TREE_TYPE (diff)); | |
4266 | pushdecl (last); | |
4267 | add_decl_expr (last); | |
4268 | if (c && iter_incr == NULL) | |
4269 | { | |
4270 | incr_var = create_temporary_var (TREE_TYPE (diff)); | |
4271 | pushdecl (incr_var); | |
4272 | add_decl_expr (incr_var); | |
4273 | } | |
4274 | gcc_assert (stmts_are_full_exprs_p ()); | |
4275 | ||
4276 | orig_pre_body = *pre_body; | |
4277 | *pre_body = push_stmt_list (); | |
4278 | if (orig_pre_body) | |
4279 | add_stmt (orig_pre_body); | |
4280 | if (init != NULL) | |
4281 | finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init, | |
4282 | tf_warning_or_error)); | |
4283 | init = build_int_cst (TREE_TYPE (diff), 0); | |
4284 | if (c && iter_incr == NULL) | |
4285 | { | |
4286 | finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR, | |
4287 | incr, tf_warning_or_error)); | |
4288 | incr = incr_var; | |
4289 | iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr, | |
4290 | tf_warning_or_error); | |
4291 | } | |
4292 | finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init, | |
4293 | tf_warning_or_error)); | |
4294 | *pre_body = pop_stmt_list (*pre_body); | |
4295 | ||
ba47d38d AH |
4296 | cond = cp_build_binary_op (elocus, |
4297 | TREE_CODE (cond), decl, diff, | |
a68ab351 | 4298 | tf_warning_or_error); |
32e8bb8e | 4299 | incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR, |
c2255bc4 | 4300 | elocus, incr, NULL_TREE); |
a68ab351 JJ |
4301 | |
4302 | orig_body = *body; | |
4303 | *body = push_stmt_list (); | |
4304 | iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last); | |
4305 | iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init, | |
4306 | tf_warning_or_error); | |
4307 | iter_init = build1 (NOP_EXPR, void_type_node, iter_init); | |
4308 | finish_expr_stmt (iter_init); | |
4309 | finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl, | |
4310 | tf_warning_or_error)); | |
4311 | add_stmt (orig_body); | |
4312 | *body = pop_stmt_list (*body); | |
4313 | ||
4314 | if (c) | |
4315 | { | |
4316 | OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list (); | |
4317 | finish_expr_stmt (iter_incr); | |
4318 | OMP_CLAUSE_LASTPRIVATE_STMT (c) | |
4319 | = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c)); | |
4320 | } | |
4321 | ||
4322 | TREE_VEC_ELT (declv, i) = decl; | |
4323 | TREE_VEC_ELT (initv, i) = init; | |
4324 | TREE_VEC_ELT (condv, i) = cond; | |
4325 | TREE_VEC_ELT (incrv, i) = incr; | |
4326 | ||
4327 | return false; | |
4328 | } | |
4329 | ||
1799e5d5 RH |
4330 | /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR |
4331 | are directly for their associated operands in the statement. DECL | |
4332 | and INIT are a combo; if DECL is NULL then INIT ought to be a | |
4333 | MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are | |
4334 | optional statements that need to go before the loop into its | |
4335 | sk_omp scope. */ | |
4336 | ||
4337 | tree | |
a68ab351 JJ |
4338 | finish_omp_for (location_t locus, tree declv, tree initv, tree condv, |
4339 | tree incrv, tree body, tree pre_body, tree clauses) | |
4340 | { | |
4341 | tree omp_for = NULL, orig_incr = NULL; | |
4342 | tree decl, init, cond, incr; | |
4343 | location_t elocus; | |
4344 | int i; | |
4345 | ||
4346 | gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv)); | |
4347 | gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv)); | |
4348 | gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv)); | |
4349 | for (i = 0; i < TREE_VEC_LENGTH (declv); i++) | |
4350 | { | |
4351 | decl = TREE_VEC_ELT (declv, i); | |
4352 | init = TREE_VEC_ELT (initv, i); | |
4353 | cond = TREE_VEC_ELT (condv, i); | |
4354 | incr = TREE_VEC_ELT (incrv, i); | |
4355 | elocus = locus; | |
4356 | ||
4357 | if (decl == NULL) | |
4358 | { | |
4359 | if (init != NULL) | |
4360 | switch (TREE_CODE (init)) | |
1799e5d5 | 4361 | { |
a68ab351 | 4362 | case MODIFY_EXPR: |
1799e5d5 | 4363 | decl = TREE_OPERAND (init, 0); |
a68ab351 JJ |
4364 | init = TREE_OPERAND (init, 1); |
4365 | break; | |
4366 | case MODOP_EXPR: | |
4367 | if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR) | |
4368 | { | |
4369 | decl = TREE_OPERAND (init, 0); | |
4370 | init = TREE_OPERAND (init, 2); | |
4371 | } | |
4372 | break; | |
4373 | default: | |
4374 | break; | |
1799e5d5 | 4375 | } |
1799e5d5 | 4376 | |
a68ab351 JJ |
4377 | if (decl == NULL) |
4378 | { | |
69bc6bff MLI |
4379 | error_at (locus, |
4380 | "expected iteration declaration or initialization"); | |
a68ab351 JJ |
4381 | return NULL; |
4382 | } | |
1799e5d5 | 4383 | } |
1799e5d5 | 4384 | |
a68ab351 JJ |
4385 | if (init && EXPR_HAS_LOCATION (init)) |
4386 | elocus = EXPR_LOCATION (init); | |
1799e5d5 RH |
4387 | |
4388 | if (cond == NULL) | |
4389 | { | |
69bc6bff | 4390 | error_at (elocus, "missing controlling predicate"); |
1799e5d5 RH |
4391 | return NULL; |
4392 | } | |
4393 | ||
4394 | if (incr == NULL) | |
4395 | { | |
69bc6bff | 4396 | error_at (elocus, "missing increment expression"); |
1799e5d5 RH |
4397 | return NULL; |
4398 | } | |
4399 | ||
a68ab351 JJ |
4400 | TREE_VEC_ELT (declv, i) = decl; |
4401 | TREE_VEC_ELT (initv, i) = init; | |
4402 | } | |
4403 | ||
4404 | if (dependent_omp_for_p (declv, initv, condv, incrv)) | |
4405 | { | |
4406 | tree stmt; | |
4407 | ||
1799e5d5 RH |
4408 | stmt = make_node (OMP_FOR); |
4409 | ||
a68ab351 JJ |
4410 | for (i = 0; i < TREE_VEC_LENGTH (declv); i++) |
4411 | { | |
4412 | /* This is really just a place-holder. We'll be decomposing this | |
4413 | again and going through the cp_build_modify_expr path below when | |
4414 | we instantiate the thing. */ | |
4415 | TREE_VEC_ELT (initv, i) | |
4416 | = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i), | |
4417 | TREE_VEC_ELT (initv, i)); | |
4418 | } | |
1799e5d5 RH |
4419 | |
4420 | TREE_TYPE (stmt) = void_type_node; | |
a68ab351 JJ |
4421 | OMP_FOR_INIT (stmt) = initv; |
4422 | OMP_FOR_COND (stmt) = condv; | |
4423 | OMP_FOR_INCR (stmt) = incrv; | |
1799e5d5 RH |
4424 | OMP_FOR_BODY (stmt) = body; |
4425 | OMP_FOR_PRE_BODY (stmt) = pre_body; | |
a68ab351 | 4426 | OMP_FOR_CLAUSES (stmt) = clauses; |
1799e5d5 RH |
4427 | |
4428 | SET_EXPR_LOCATION (stmt, locus); | |
4429 | return add_stmt (stmt); | |
4430 | } | |
4431 | ||
a68ab351 JJ |
4432 | if (processing_template_decl) |
4433 | orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv)); | |
1799e5d5 | 4434 | |
a68ab351 | 4435 | for (i = 0; i < TREE_VEC_LENGTH (declv); ) |
dadb19e0 | 4436 | { |
a68ab351 JJ |
4437 | decl = TREE_VEC_ELT (declv, i); |
4438 | init = TREE_VEC_ELT (initv, i); | |
4439 | cond = TREE_VEC_ELT (condv, i); | |
4440 | incr = TREE_VEC_ELT (incrv, i); | |
4441 | if (orig_incr) | |
4442 | TREE_VEC_ELT (orig_incr, i) = incr; | |
4443 | elocus = locus; | |
4444 | ||
4445 | if (init && EXPR_HAS_LOCATION (init)) | |
dadb19e0 | 4446 | elocus = EXPR_LOCATION (init); |
dadb19e0 | 4447 | |
a68ab351 JJ |
4448 | if (!DECL_P (decl)) |
4449 | { | |
69bc6bff | 4450 | error_at (elocus, "expected iteration declaration or initialization"); |
a68ab351 JJ |
4451 | return NULL; |
4452 | } | |
969c111d | 4453 | |
a68ab351 JJ |
4454 | if (incr && TREE_CODE (incr) == MODOP_EXPR) |
4455 | { | |
4456 | if (orig_incr) | |
4457 | TREE_VEC_ELT (orig_incr, i) = incr; | |
4458 | incr = cp_build_modify_expr (TREE_OPERAND (incr, 0), | |
4459 | TREE_CODE (TREE_OPERAND (incr, 1)), | |
4460 | TREE_OPERAND (incr, 2), | |
4461 | tf_warning_or_error); | |
4462 | } | |
4463 | ||
4464 | if (CLASS_TYPE_P (TREE_TYPE (decl))) | |
4465 | { | |
4466 | if (handle_omp_for_class_iterator (i, locus, declv, initv, condv, | |
4467 | incrv, &body, &pre_body, clauses)) | |
4468 | return NULL; | |
4469 | continue; | |
4470 | } | |
4471 | ||
4472 | if (!INTEGRAL_TYPE_P (TREE_TYPE (decl)) | |
4473 | && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE) | |
4474 | { | |
69bc6bff | 4475 | error_at (elocus, "invalid type for iteration variable %qE", decl); |
a68ab351 JJ |
4476 | return NULL; |
4477 | } | |
969c111d | 4478 | |
b2ebd268 | 4479 | if (!processing_template_decl) |
8569b2d0 JJ |
4480 | { |
4481 | init = fold_build_cleanup_point_expr (TREE_TYPE (init), init); | |
4482 | init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error); | |
4483 | } | |
4484 | else | |
4485 | init = build2 (MODIFY_EXPR, void_type_node, decl, init); | |
e4ebaef3 JJ |
4486 | if (cond |
4487 | && TREE_SIDE_EFFECTS (cond) | |
4488 | && COMPARISON_CLASS_P (cond) | |
4489 | && !processing_template_decl) | |
a68ab351 | 4490 | { |
e4ebaef3 JJ |
4491 | tree t = TREE_OPERAND (cond, 0); |
4492 | if (TREE_SIDE_EFFECTS (t) | |
4493 | && t != decl | |
4494 | && (TREE_CODE (t) != NOP_EXPR | |
4495 | || TREE_OPERAND (t, 0) != decl)) | |
4496 | TREE_OPERAND (cond, 0) | |
4497 | = fold_build_cleanup_point_expr (TREE_TYPE (t), t); | |
a68ab351 | 4498 | |
e4ebaef3 JJ |
4499 | t = TREE_OPERAND (cond, 1); |
4500 | if (TREE_SIDE_EFFECTS (t) | |
4501 | && t != decl | |
4502 | && (TREE_CODE (t) != NOP_EXPR | |
4503 | || TREE_OPERAND (t, 0) != decl)) | |
4504 | TREE_OPERAND (cond, 1) | |
a68ab351 JJ |
4505 | = fold_build_cleanup_point_expr (TREE_TYPE (t), t); |
4506 | } | |
4507 | if (decl == error_mark_node || init == error_mark_node) | |
4508 | return NULL; | |
4509 | ||
4510 | TREE_VEC_ELT (declv, i) = decl; | |
4511 | TREE_VEC_ELT (initv, i) = init; | |
4512 | TREE_VEC_ELT (condv, i) = cond; | |
4513 | TREE_VEC_ELT (incrv, i) = incr; | |
4514 | i++; | |
969c111d | 4515 | } |
a68ab351 JJ |
4516 | |
4517 | if (IS_EMPTY_STMT (pre_body)) | |
4518 | pre_body = NULL; | |
4519 | ||
4520 | omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv, | |
4521 | body, pre_body); | |
4522 | ||
4523 | if (omp_for == NULL) | |
4524 | return NULL; | |
4525 | ||
4526 | for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++) | |
969c111d | 4527 | { |
e4ebaef3 JJ |
4528 | decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0); |
4529 | incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i); | |
969c111d | 4530 | |
a68ab351 JJ |
4531 | if (TREE_CODE (incr) != MODIFY_EXPR) |
4532 | continue; | |
4533 | ||
4534 | if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1)) | |
e4ebaef3 JJ |
4535 | && BINARY_CLASS_P (TREE_OPERAND (incr, 1)) |
4536 | && !processing_template_decl) | |
a68ab351 | 4537 | { |
e4ebaef3 JJ |
4538 | tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0); |
4539 | if (TREE_SIDE_EFFECTS (t) | |
4540 | && t != decl | |
4541 | && (TREE_CODE (t) != NOP_EXPR | |
4542 | || TREE_OPERAND (t, 0) != decl)) | |
4543 | TREE_OPERAND (TREE_OPERAND (incr, 1), 0) | |
4544 | = fold_build_cleanup_point_expr (TREE_TYPE (t), t); | |
a68ab351 | 4545 | |
e4ebaef3 JJ |
4546 | t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1); |
4547 | if (TREE_SIDE_EFFECTS (t) | |
4548 | && t != decl | |
4549 | && (TREE_CODE (t) != NOP_EXPR | |
4550 | || TREE_OPERAND (t, 0) != decl)) | |
4551 | TREE_OPERAND (TREE_OPERAND (incr, 1), 1) | |
4552 | = fold_build_cleanup_point_expr (TREE_TYPE (t), t); | |
a68ab351 JJ |
4553 | } |
4554 | ||
4555 | if (orig_incr) | |
4556 | TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i); | |
969c111d | 4557 | } |
a68ab351 JJ |
4558 | if (omp_for != NULL) |
4559 | OMP_FOR_CLAUSES (omp_for) = clauses; | |
969c111d | 4560 | return omp_for; |
1799e5d5 RH |
4561 | } |
4562 | ||
4563 | void | |
4564 | finish_omp_atomic (enum tree_code code, tree lhs, tree rhs) | |
4565 | { | |
239371f9 JJ |
4566 | tree orig_lhs; |
4567 | tree orig_rhs; | |
4568 | bool dependent_p; | |
e6bd5565 MM |
4569 | tree stmt; |
4570 | ||
239371f9 JJ |
4571 | orig_lhs = lhs; |
4572 | orig_rhs = rhs; | |
4573 | dependent_p = false; | |
4574 | stmt = NULL_TREE; | |
4575 | ||
4576 | /* Even in a template, we can detect invalid uses of the atomic | |
4577 | pragma if neither LHS nor RHS is type-dependent. */ | |
4578 | if (processing_template_decl) | |
e6bd5565 | 4579 | { |
239371f9 JJ |
4580 | dependent_p = (type_dependent_expression_p (lhs) |
4581 | || type_dependent_expression_p (rhs)); | |
4582 | if (!dependent_p) | |
e6bd5565 MM |
4583 | { |
4584 | lhs = build_non_dependent_expr (lhs); | |
4585 | rhs = build_non_dependent_expr (rhs); | |
4586 | } | |
239371f9 JJ |
4587 | } |
4588 | if (!dependent_p) | |
4589 | { | |
c2255bc4 | 4590 | stmt = c_finish_omp_atomic (input_location, code, lhs, rhs); |
239371f9 JJ |
4591 | if (stmt == error_mark_node) |
4592 | return; | |
e6bd5565 | 4593 | } |
239371f9 JJ |
4594 | if (processing_template_decl) |
4595 | stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node, | |
4596 | build2 (code, void_type_node, orig_lhs, orig_rhs)); | |
4597 | add_stmt (stmt); | |
1799e5d5 RH |
4598 | } |
4599 | ||
4600 | void | |
4601 | finish_omp_barrier (void) | |
4602 | { | |
4603 | tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER]; | |
c166b898 ILT |
4604 | VEC(tree,gc) *vec = make_tree_vector (); |
4605 | tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error); | |
4606 | release_tree_vector (vec); | |
1799e5d5 RH |
4607 | finish_expr_stmt (stmt); |
4608 | } | |
4609 | ||
4610 | void | |
4611 | finish_omp_flush (void) | |
4612 | { | |
4613 | tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE]; | |
c166b898 ILT |
4614 | VEC(tree,gc) *vec = make_tree_vector (); |
4615 | tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error); | |
4616 | release_tree_vector (vec); | |
1799e5d5 RH |
4617 | finish_expr_stmt (stmt); |
4618 | } | |
4619 | ||
a68ab351 JJ |
4620 | void |
4621 | finish_omp_taskwait (void) | |
1799e5d5 | 4622 | { |
a68ab351 | 4623 | tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT]; |
c166b898 ILT |
4624 | VEC(tree,gc) *vec = make_tree_vector (); |
4625 | tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error); | |
4626 | release_tree_vector (vec); | |
a68ab351 | 4627 | finish_expr_stmt (stmt); |
1799e5d5 RH |
4628 | } |
4629 | \f | |
54f7877c | 4630 | void |
3a978d72 | 4631 | init_cp_semantics (void) |
54f7877c | 4632 | { |
54f7877c | 4633 | } |
55a3debe DG |
4634 | \f |
4635 | /* Build a STATIC_ASSERT for a static assertion with the condition | |
4636 | CONDITION and the message text MESSAGE. LOCATION is the location | |
4637 | of the static assertion in the source code. When MEMBER_P, this | |
4638 | static assertion is a member of a class. */ | |
4639 | void | |
4640 | finish_static_assert (tree condition, tree message, location_t location, | |
4641 | bool member_p) | |
4642 | { | |
7b3e2d46 DG |
4643 | if (check_for_bare_parameter_packs (condition)) |
4644 | condition = error_mark_node; | |
4645 | ||
55a3debe DG |
4646 | if (type_dependent_expression_p (condition) |
4647 | || value_dependent_expression_p (condition)) | |
4648 | { | |
4649 | /* We're in a template; build a STATIC_ASSERT and put it in | |
4650 | the right place. */ | |
4651 | tree assertion; | |
4652 | ||
4653 | assertion = make_node (STATIC_ASSERT); | |
4654 | STATIC_ASSERT_CONDITION (assertion) = condition; | |
4655 | STATIC_ASSERT_MESSAGE (assertion) = message; | |
4656 | STATIC_ASSERT_SOURCE_LOCATION (assertion) = location; | |
4657 | ||
4658 | if (member_p) | |
4659 | maybe_add_class_template_decl_list (current_class_type, | |
4660 | assertion, | |
4661 | /*friend_p=*/0); | |
4662 | else | |
4663 | add_stmt (assertion); | |
4664 | ||
4665 | return; | |
4666 | } | |
4667 | ||
4668 | /* Fold the expression and convert it to a boolean value. */ | |
4669 | condition = fold_non_dependent_expr (condition); | |
4670 | condition = cp_convert (boolean_type_node, condition); | |
4671 | ||
4672 | if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition)) | |
4673 | /* Do nothing; the condition is satisfied. */ | |
4674 | ; | |
4675 | else | |
4676 | { | |
4677 | location_t saved_loc = input_location; | |
4678 | ||
4679 | input_location = location; | |
4680 | if (TREE_CODE (condition) == INTEGER_CST | |
4681 | && integer_zerop (condition)) | |
4682 | /* Report the error. */ | |
4683 | error ("static assertion failed: %E", message); | |
4684 | else if (condition && condition != error_mark_node) | |
4685 | error ("non-constant condition for static assertion"); | |
4686 | input_location = saved_loc; | |
4687 | } | |
4688 | } | |
3ad6a8e1 | 4689 | \f |
a77f94e2 JM |
4690 | /* Returns decltype((EXPR)) for cases where we can drop the decltype and |
4691 | just return the type even though EXPR is a type-dependent expression. | |
4692 | The ABI specifies which cases this applies to, which is a subset of the | |
4693 | possible cases. */ | |
4694 | ||
4695 | tree | |
4696 | describable_type (tree expr) | |
4697 | { | |
4698 | tree type = NULL_TREE; | |
4699 | ||
a77f94e2 JM |
4700 | if (! type_dependent_expression_p (expr) |
4701 | && ! type_unknown_p (expr)) | |
4702 | { | |
aef8bce8 | 4703 | type = unlowered_expr_type (expr); |
a77f94e2 JM |
4704 | if (real_lvalue_p (expr)) |
4705 | type = build_reference_type (type); | |
4706 | } | |
a77f94e2 JM |
4707 | |
4708 | if (type) | |
4709 | return type; | |
4710 | ||
4711 | switch (TREE_CODE (expr)) | |
4712 | { | |
4713 | case VAR_DECL: | |
4714 | case PARM_DECL: | |
4715 | case RESULT_DECL: | |
4716 | case FUNCTION_DECL: | |
4717 | /* Named rvalue reference becomes lvalue. */ | |
4718 | type = build_reference_type (non_reference (TREE_TYPE (expr))); | |
4719 | break; | |
4720 | ||
4721 | case NEW_EXPR: | |
4722 | case CONST_DECL: | |
4723 | case TEMPLATE_PARM_INDEX: | |
4724 | case CAST_EXPR: | |
4725 | case STATIC_CAST_EXPR: | |
4726 | case REINTERPRET_CAST_EXPR: | |
4727 | case CONST_CAST_EXPR: | |
4728 | case DYNAMIC_CAST_EXPR: | |
4729 | type = TREE_TYPE (expr); | |
4730 | break; | |
4731 | ||
4732 | case INDIRECT_REF: | |
4733 | { | |
4734 | tree ptrtype = describable_type (TREE_OPERAND (expr, 0)); | |
4735 | if (ptrtype && POINTER_TYPE_P (ptrtype)) | |
4736 | type = build_reference_type (TREE_TYPE (ptrtype)); | |
4737 | } | |
4738 | break; | |
4739 | ||
4740 | default: | |
4741 | if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant) | |
4742 | type = TREE_TYPE (expr); | |
4743 | break; | |
4744 | } | |
4745 | ||
4746 | if (type && type_uses_auto (type)) | |
4747 | return NULL_TREE; | |
4748 | else | |
4749 | return type; | |
4750 | } | |
4751 | ||
3ad6a8e1 DG |
4752 | /* Implements the C++0x decltype keyword. Returns the type of EXPR, |
4753 | suitable for use as a type-specifier. | |
4754 | ||
4755 | ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an | |
4756 | id-expression or a class member access, FALSE when it was parsed as | |
4757 | a full expression. */ | |
a77f94e2 | 4758 | |
3ad6a8e1 DG |
4759 | tree |
4760 | finish_decltype_type (tree expr, bool id_expression_or_member_access_p) | |
4761 | { | |
4762 | tree orig_expr = expr; | |
056dd1af | 4763 | tree type = NULL_TREE; |
3ad6a8e1 | 4764 | |
e4fd5b87 DG |
4765 | if (!expr || error_operand_p (expr)) |
4766 | return error_mark_node; | |
4767 | ||
7a547b93 JJ |
4768 | if (TYPE_P (expr) |
4769 | || TREE_CODE (expr) == TYPE_DECL | |
4770 | || (TREE_CODE (expr) == BIT_NOT_EXPR | |
4771 | && TYPE_P (TREE_OPERAND (expr, 0)))) | |
4772 | { | |
4773 | error ("argument to decltype must be an expression"); | |
4774 | return error_mark_node; | |
4775 | } | |
4776 | ||
3ad6a8e1 DG |
4777 | if (type_dependent_expression_p (expr)) |
4778 | { | |
a77f94e2 JM |
4779 | if (id_expression_or_member_access_p) |
4780 | { | |
4781 | switch (TREE_CODE (expr)) | |
4782 | { | |
4783 | case VAR_DECL: | |
4784 | case PARM_DECL: | |
4785 | case RESULT_DECL: | |
4786 | case FUNCTION_DECL: | |
4787 | case CONST_DECL: | |
4788 | case TEMPLATE_PARM_INDEX: | |
4789 | type = TREE_TYPE (expr); | |
4790 | break; | |
4791 | ||
4792 | default: | |
4793 | break; | |
4794 | } | |
4795 | } | |
a77f94e2 JM |
4796 | |
4797 | if (type && !type_uses_auto (type)) | |
4798 | return type; | |
4799 | ||
9e1e64ec | 4800 | type = cxx_make_type (DECLTYPE_TYPE); |
3ad6a8e1 DG |
4801 | DECLTYPE_TYPE_EXPR (type) = expr; |
4802 | DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type) | |
4803 | = id_expression_or_member_access_p; | |
4804 | SET_TYPE_STRUCTURAL_EQUALITY (type); | |
4805 | ||
4806 | return type; | |
4807 | } | |
4808 | ||
4809 | /* The type denoted by decltype(e) is defined as follows: */ | |
4810 | ||
ccb05613 | 4811 | expr = resolve_nondeduced_context (expr); |
3ad6a8e1 DG |
4812 | if (id_expression_or_member_access_p) |
4813 | { | |
4814 | /* If e is an id-expression or a class member access (5.2.5 | |
4815 | [expr.ref]), decltype(e) is defined as the type of the entity | |
4816 | named by e. If there is no such entity, or e names a set of | |
4817 | overloaded functions, the program is ill-formed. */ | |
4818 | if (TREE_CODE (expr) == IDENTIFIER_NODE) | |
4819 | expr = lookup_name (expr); | |
4820 | ||
4821 | if (TREE_CODE (expr) == INDIRECT_REF) | |
4822 | /* This can happen when the expression is, e.g., "a.b". Just | |
4823 | look at the underlying operand. */ | |
4824 | expr = TREE_OPERAND (expr, 0); | |
4825 | ||
4826 | if (TREE_CODE (expr) == OFFSET_REF | |
4827 | || TREE_CODE (expr) == MEMBER_REF) | |
4828 | /* We're only interested in the field itself. If it is a | |
4829 | BASELINK, we will need to see through it in the next | |
4830 | step. */ | |
4831 | expr = TREE_OPERAND (expr, 1); | |
4832 | ||
4833 | if (TREE_CODE (expr) == BASELINK) | |
4834 | /* See through BASELINK nodes to the underlying functions. */ | |
4835 | expr = BASELINK_FUNCTIONS (expr); | |
4836 | ||
ccb05613 JM |
4837 | if (TREE_CODE (expr) == TEMPLATE_ID_EXPR) |
4838 | expr = TREE_OPERAND (expr, 0); | |
4839 | ||
3ad6a8e1 DG |
4840 | if (TREE_CODE (expr) == OVERLOAD) |
4841 | { | |
ccb05613 JM |
4842 | if (OVL_CHAIN (expr) |
4843 | || TREE_CODE (OVL_FUNCTION (expr)) == TEMPLATE_DECL) | |
3ad6a8e1 DG |
4844 | { |
4845 | error ("%qE refers to a set of overloaded functions", orig_expr); | |
4846 | return error_mark_node; | |
4847 | } | |
4848 | else | |
4849 | /* An overload set containing only one function: just look | |
4850 | at that function. */ | |
4851 | expr = OVL_FUNCTION (expr); | |
4852 | } | |
4853 | ||
4854 | switch (TREE_CODE (expr)) | |
4855 | { | |
4856 | case FIELD_DECL: | |
e76d7cc7 | 4857 | if (DECL_BIT_FIELD_TYPE (expr)) |
3ad6a8e1 DG |
4858 | { |
4859 | type = DECL_BIT_FIELD_TYPE (expr); | |
4860 | break; | |
4861 | } | |
4862 | /* Fall through for fields that aren't bitfields. */ | |
4863 | ||
4864 | case FUNCTION_DECL: | |
4865 | case VAR_DECL: | |
4866 | case CONST_DECL: | |
4867 | case PARM_DECL: | |
4868 | case RESULT_DECL: | |
088d4f95 | 4869 | case TEMPLATE_PARM_INDEX: |
3ad6a8e1 DG |
4870 | type = TREE_TYPE (expr); |
4871 | break; | |
4872 | ||
4873 | case ERROR_MARK: | |
4874 | type = error_mark_node; | |
4875 | break; | |
4876 | ||
4877 | case COMPONENT_REF: | |
4878 | type = is_bitfield_expr_with_lowered_type (expr); | |
4879 | if (!type) | |
4880 | type = TREE_TYPE (TREE_OPERAND (expr, 1)); | |
4881 | break; | |
4882 | ||
4883 | case BIT_FIELD_REF: | |
4884 | gcc_unreachable (); | |
4885 | ||
4886 | case INTEGER_CST: | |
4887 | /* We can get here when the id-expression refers to an | |
4888 | enumerator. */ | |
4889 | type = TREE_TYPE (expr); | |
4890 | break; | |
4891 | ||
4892 | default: | |
91929b4d JJ |
4893 | gcc_assert (TYPE_P (expr) || DECL_P (expr) |
4894 | || TREE_CODE (expr) == SCOPE_REF); | |
3ad6a8e1 DG |
4895 | error ("argument to decltype must be an expression"); |
4896 | return error_mark_node; | |
4897 | } | |
4898 | } | |
4899 | else | |
4900 | { | |
e4fd5b87 DG |
4901 | /* Expressions of reference type are sometimes wrapped in |
4902 | INDIRECT_REFs. INDIRECT_REFs are just internal compiler | |
4903 | representation, not part of the language, so we have to look | |
4904 | through them. */ | |
4905 | if (TREE_CODE (expr) == INDIRECT_REF | |
4906 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) | |
4907 | == REFERENCE_TYPE) | |
4908 | expr = TREE_OPERAND (expr, 0); | |
4909 | ||
ed85a1f6 DG |
4910 | if (TREE_CODE (expr) == CALL_EXPR) |
4911 | { | |
4912 | /* If e is a function call (5.2.2 [expr.call]) or an | |
3ad6a8e1 DG |
4913 | invocation of an overloaded operator (parentheses around e |
4914 | are ignored), decltype(e) is defined as the return type of | |
4915 | that function. */ | |
ed85a1f6 DG |
4916 | tree fndecl = get_callee_fndecl (expr); |
4917 | if (fndecl && fndecl != error_mark_node) | |
4918 | type = TREE_TYPE (TREE_TYPE (fndecl)); | |
4919 | else | |
4920 | { | |
4921 | tree target_type = TREE_TYPE (CALL_EXPR_FN (expr)); | |
4922 | if ((TREE_CODE (target_type) == REFERENCE_TYPE | |
4923 | || TREE_CODE (target_type) == POINTER_TYPE) | |
4924 | && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE | |
4925 | || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE)) | |
4926 | type = TREE_TYPE (TREE_TYPE (target_type)); | |
4927 | else | |
4928 | sorry ("unable to determine the declared type of expression %<%E%>", | |
4929 | expr); | |
4930 | } | |
4931 | } | |
3ad6a8e1 DG |
4932 | else |
4933 | { | |
4934 | type = is_bitfield_expr_with_lowered_type (expr); | |
4935 | if (type) | |
4936 | { | |
4937 | /* Bitfields are special, because their type encodes the | |
4938 | number of bits they store. If the expression referenced a | |
4939 | bitfield, TYPE now has the declared type of that | |
4940 | bitfield. */ | |
4941 | type = cp_build_qualified_type (type, | |
4942 | cp_type_quals (TREE_TYPE (expr))); | |
4943 | ||
4944 | if (real_lvalue_p (expr)) | |
4945 | type = build_reference_type (type); | |
4946 | } | |
d5f4eddd JM |
4947 | /* Within a lambda-expression: |
4948 | ||
4949 | Every occurrence of decltype((x)) where x is a possibly | |
4950 | parenthesized id-expression that names an entity of | |
4951 | automatic storage duration is treated as if x were | |
4952 | transformed into an access to a corresponding data member | |
4953 | of the closure type that would have been declared if x | |
4954 | were a use of the denoted entity. */ | |
4955 | else if (outer_automatic_var_p (expr) | |
4956 | && current_function_decl | |
4957 | && LAMBDA_FUNCTION_P (current_function_decl)) | |
4958 | type = capture_decltype (expr); | |
3ad6a8e1 DG |
4959 | else |
4960 | { | |
4961 | /* Otherwise, where T is the type of e, if e is an lvalue, | |
4962 | decltype(e) is defined as T&, otherwise decltype(e) is | |
4963 | defined as T. */ | |
4964 | type = TREE_TYPE (expr); | |
e4fd5b87 DG |
4965 | if (type == error_mark_node) |
4966 | return error_mark_node; | |
4967 | else if (expr == current_class_ptr) | |
3ad6a8e1 DG |
4968 | /* If the expression is just "this", we want the |
4969 | cv-unqualified pointer for the "this" type. */ | |
4970 | type = TYPE_MAIN_VARIANT (type); | |
4971 | else if (real_lvalue_p (expr)) | |
4972 | { | |
4973 | if (TREE_CODE (type) != REFERENCE_TYPE) | |
4974 | type = build_reference_type (type); | |
4975 | } | |
4976 | else | |
4977 | type = non_reference (type); | |
4978 | } | |
4979 | } | |
4980 | } | |
4981 | ||
4982 | if (!type || type == unknown_type_node) | |
4983 | { | |
4984 | error ("type of %qE is unknown", expr); | |
4985 | return error_mark_node; | |
4986 | } | |
4987 | ||
4988 | return type; | |
4989 | } | |
cf22909c | 4990 | |
b29441ec PC |
4991 | /* Called from trait_expr_value to evaluate either __has_nothrow_assign or |
4992 | __has_nothrow_copy, depending on assign_p. */ | |
cb68ec50 PC |
4993 | |
4994 | static bool | |
b29441ec | 4995 | classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p) |
cb68ec50 | 4996 | { |
b29441ec | 4997 | tree fns; |
cb68ec50 | 4998 | |
b29441ec PC |
4999 | if (assign_p) |
5000 | { | |
5001 | int ix; | |
5002 | ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR)); | |
5003 | if (ix < 0) | |
cb68ec50 | 5004 | return false; |
b29441ec PC |
5005 | fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix); |
5006 | } | |
5007 | else if (TYPE_HAS_INIT_REF (type)) | |
5008 | { | |
5009 | /* If construction of the copy constructor was postponed, create | |
5010 | it now. */ | |
5011 | if (CLASSTYPE_LAZY_COPY_CTOR (type)) | |
5012 | lazily_declare_fn (sfk_copy_constructor, type); | |
d5f4eddd JM |
5013 | if (CLASSTYPE_LAZY_MOVE_CTOR (type)) |
5014 | lazily_declare_fn (sfk_move_constructor, type); | |
b29441ec | 5015 | fns = CLASSTYPE_CONSTRUCTORS (type); |
cb68ec50 PC |
5016 | } |
5017 | else | |
5018 | return false; | |
5019 | ||
b29441ec | 5020 | for (; fns; fns = OVL_NEXT (fns)) |
279086c3 PC |
5021 | { |
5022 | tree fn = OVL_CURRENT (fns); | |
5023 | ||
5024 | if (assign_p) | |
5025 | { | |
5026 | if (copy_fn_p (fn) == 0) | |
5027 | continue; | |
5028 | } | |
5029 | else if (copy_fn_p (fn) <= 0) | |
5030 | continue; | |
5031 | ||
5032 | if (!TYPE_NOTHROW_P (TREE_TYPE (fn))) | |
5033 | return false; | |
5034 | } | |
b29441ec | 5035 | |
cb68ec50 PC |
5036 | return true; |
5037 | } | |
5038 | ||
5039 | /* Actually evaluates the trait. */ | |
5040 | ||
5041 | static bool | |
5042 | trait_expr_value (cp_trait_kind kind, tree type1, tree type2) | |
5043 | { | |
5044 | enum tree_code type_code1; | |
5045 | tree t; | |
5046 | ||
5047 | type_code1 = TREE_CODE (type1); | |
5048 | ||
5049 | switch (kind) | |
5050 | { | |
5051 | case CPTK_HAS_NOTHROW_ASSIGN: | |
c32097d8 | 5052 | type1 = strip_array_types (type1); |
b29441ec PC |
5053 | return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE |
5054 | && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2) | |
5055 | || (CLASS_TYPE_P (type1) | |
5056 | && classtype_has_nothrow_assign_or_copy_p (type1, | |
5057 | true)))); | |
cb68ec50 PC |
5058 | |
5059 | case CPTK_HAS_TRIVIAL_ASSIGN: | |
c32097d8 JM |
5060 | /* ??? The standard seems to be missing the "or array of such a class |
5061 | type" wording for this trait. */ | |
5062 | type1 = strip_array_types (type1); | |
cb68ec50 | 5063 | return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE |
c32097d8 | 5064 | && (trivial_type_p (type1) |
cb68ec50 PC |
5065 | || (CLASS_TYPE_P (type1) |
5066 | && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1)))); | |
5067 | ||
5068 | case CPTK_HAS_NOTHROW_CONSTRUCTOR: | |
5069 | type1 = strip_array_types (type1); | |
5070 | return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2) | |
5071 | || (CLASS_TYPE_P (type1) | |
e24313f3 PC |
5072 | && (t = locate_ctor (type1, NULL)) |
5073 | && TYPE_NOTHROW_P (TREE_TYPE (t)))); | |
cb68ec50 PC |
5074 | |
5075 | case CPTK_HAS_TRIVIAL_CONSTRUCTOR: | |
5076 | type1 = strip_array_types (type1); | |
c32097d8 | 5077 | return (trivial_type_p (type1) |
cb68ec50 PC |
5078 | || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1))); |
5079 | ||
5080 | case CPTK_HAS_NOTHROW_COPY: | |
c32097d8 | 5081 | type1 = strip_array_types (type1); |
cb68ec50 PC |
5082 | return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2) |
5083 | || (CLASS_TYPE_P (type1) | |
b29441ec | 5084 | && classtype_has_nothrow_assign_or_copy_p (type1, false))); |
cb68ec50 PC |
5085 | |
5086 | case CPTK_HAS_TRIVIAL_COPY: | |
c32097d8 JM |
5087 | /* ??? The standard seems to be missing the "or array of such a class |
5088 | type" wording for this trait. */ | |
5089 | type1 = strip_array_types (type1); | |
5090 | return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE | |
cb68ec50 PC |
5091 | || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1))); |
5092 | ||
5093 | case CPTK_HAS_TRIVIAL_DESTRUCTOR: | |
5094 | type1 = strip_array_types (type1); | |
c32097d8 | 5095 | return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE |
cb68ec50 PC |
5096 | || (CLASS_TYPE_P (type1) |
5097 | && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1))); | |
5098 | ||
5099 | case CPTK_HAS_VIRTUAL_DESTRUCTOR: | |
5100 | return (CLASS_TYPE_P (type1) | |
5101 | && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t)); | |
5102 | ||
5103 | case CPTK_IS_ABSTRACT: | |
5104 | return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1)); | |
5105 | ||
5106 | case CPTK_IS_BASE_OF: | |
5107 | return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2) | |
5108 | && DERIVED_FROM_P (type1, type2)); | |
5109 | ||
5110 | case CPTK_IS_CLASS: | |
5111 | return (NON_UNION_CLASS_TYPE_P (type1)); | |
5112 | ||
5113 | case CPTK_IS_CONVERTIBLE_TO: | |
5114 | /* TODO */ | |
5115 | return false; | |
5116 | ||
5117 | case CPTK_IS_EMPTY: | |
5118 | return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1)); | |
5119 | ||
5120 | case CPTK_IS_ENUM: | |
5121 | return (type_code1 == ENUMERAL_TYPE); | |
5122 | ||
5123 | case CPTK_IS_POD: | |
5124 | return (pod_type_p (type1)); | |
5125 | ||
5126 | case CPTK_IS_POLYMORPHIC: | |
5127 | return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1)); | |
5128 | ||
c32097d8 JM |
5129 | case CPTK_IS_STD_LAYOUT: |
5130 | return (std_layout_type_p (type1)); | |
5131 | ||
5132 | case CPTK_IS_TRIVIAL: | |
5133 | return (trivial_type_p (type1)); | |
5134 | ||
cb68ec50 PC |
5135 | case CPTK_IS_UNION: |
5136 | return (type_code1 == UNION_TYPE); | |
5137 | ||
5138 | default: | |
5139 | gcc_unreachable (); | |
5140 | return false; | |
5141 | } | |
5142 | } | |
5143 | ||
ff284b4b PC |
5144 | /* Returns true if TYPE is a complete type, an array of unknown bound, |
5145 | or (possibly cv-qualified) void, returns false otherwise. */ | |
5146 | ||
5147 | static bool | |
5148 | check_trait_type (tree type) | |
5149 | { | |
5150 | if (COMPLETE_TYPE_P (type)) | |
5151 | return true; | |
5152 | ||
5153 | if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)) | |
5154 | return true; | |
5155 | ||
5156 | if (VOID_TYPE_P (type)) | |
5157 | return true; | |
5158 | ||
5159 | return false; | |
5160 | } | |
5161 | ||
cb68ec50 PC |
5162 | /* Process a trait expression. */ |
5163 | ||
5164 | tree | |
5165 | finish_trait_expr (cp_trait_kind kind, tree type1, tree type2) | |
5166 | { | |
5167 | gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN | |
5168 | || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR | |
5169 | || kind == CPTK_HAS_NOTHROW_COPY | |
5170 | || kind == CPTK_HAS_TRIVIAL_ASSIGN | |
5171 | || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR | |
5172 | || kind == CPTK_HAS_TRIVIAL_COPY | |
5173 | || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR | |
5174 | || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR | |
5175 | || kind == CPTK_IS_ABSTRACT | |
5176 | || kind == CPTK_IS_BASE_OF | |
5177 | || kind == CPTK_IS_CLASS | |
5178 | || kind == CPTK_IS_CONVERTIBLE_TO | |
5179 | || kind == CPTK_IS_EMPTY | |
5180 | || kind == CPTK_IS_ENUM | |
5181 | || kind == CPTK_IS_POD | |
5182 | || kind == CPTK_IS_POLYMORPHIC | |
c32097d8 JM |
5183 | || kind == CPTK_IS_STD_LAYOUT |
5184 | || kind == CPTK_IS_TRIVIAL | |
cb68ec50 PC |
5185 | || kind == CPTK_IS_UNION); |
5186 | ||
5187 | if (kind == CPTK_IS_CONVERTIBLE_TO) | |
5188 | { | |
5189 | sorry ("__is_convertible_to"); | |
5190 | return error_mark_node; | |
5191 | } | |
5192 | ||
5193 | if (type1 == error_mark_node | |
5194 | || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO) | |
5195 | && type2 == error_mark_node)) | |
5196 | return error_mark_node; | |
5197 | ||
5198 | if (processing_template_decl) | |
5199 | { | |
5200 | tree trait_expr = make_node (TRAIT_EXPR); | |
5201 | TREE_TYPE (trait_expr) = boolean_type_node; | |
5202 | TRAIT_EXPR_TYPE1 (trait_expr) = type1; | |
5203 | TRAIT_EXPR_TYPE2 (trait_expr) = type2; | |
5204 | TRAIT_EXPR_KIND (trait_expr) = kind; | |
5205 | return trait_expr; | |
5206 | } | |
5207 | ||
10c1d4af PC |
5208 | complete_type (type1); |
5209 | if (type2) | |
5210 | complete_type (type2); | |
5211 | ||
ff284b4b | 5212 | switch (kind) |
cb68ec50 | 5213 | { |
ff284b4b PC |
5214 | case CPTK_HAS_NOTHROW_ASSIGN: |
5215 | case CPTK_HAS_TRIVIAL_ASSIGN: | |
5216 | case CPTK_HAS_NOTHROW_CONSTRUCTOR: | |
5217 | case CPTK_HAS_TRIVIAL_CONSTRUCTOR: | |
5218 | case CPTK_HAS_NOTHROW_COPY: | |
5219 | case CPTK_HAS_TRIVIAL_COPY: | |
5220 | case CPTK_HAS_TRIVIAL_DESTRUCTOR: | |
5221 | case CPTK_HAS_VIRTUAL_DESTRUCTOR: | |
5222 | case CPTK_IS_ABSTRACT: | |
5223 | case CPTK_IS_EMPTY: | |
5224 | case CPTK_IS_POD: | |
5225 | case CPTK_IS_POLYMORPHIC: | |
c32097d8 JM |
5226 | case CPTK_IS_STD_LAYOUT: |
5227 | case CPTK_IS_TRIVIAL: | |
ff284b4b PC |
5228 | if (!check_trait_type (type1)) |
5229 | { | |
5230 | error ("incomplete type %qT not allowed", type1); | |
5231 | return error_mark_node; | |
5232 | } | |
5233 | break; | |
5234 | ||
5235 | case CPTK_IS_BASE_OF: | |
5236 | if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2) | |
5237 | && !same_type_ignoring_top_level_qualifiers_p (type1, type2) | |
5238 | && !COMPLETE_TYPE_P (type2)) | |
5239 | { | |
5240 | error ("incomplete type %qT not allowed", type2); | |
5241 | return error_mark_node; | |
5242 | } | |
5243 | break; | |
5244 | ||
5245 | case CPTK_IS_CLASS: | |
5246 | case CPTK_IS_ENUM: | |
5247 | case CPTK_IS_UNION: | |
5248 | break; | |
5249 | ||
5250 | case CPTK_IS_CONVERTIBLE_TO: | |
5251 | default: | |
5252 | gcc_unreachable (); | |
cb68ec50 PC |
5253 | } |
5254 | ||
5255 | return (trait_expr_value (kind, type1, type2) | |
5256 | ? boolean_true_node : boolean_false_node); | |
5257 | } | |
5258 | ||
6ec637a4 JJ |
5259 | /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64, |
5260 | which is ignored for C++. */ | |
5261 | ||
5262 | void | |
5263 | set_float_const_decimal64 (void) | |
5264 | { | |
5265 | } | |
5266 | ||
5267 | void | |
5268 | clear_float_const_decimal64 (void) | |
5269 | { | |
5270 | } | |
5271 | ||
5272 | bool | |
5273 | float_const_decimal64_p (void) | |
5274 | { | |
5275 | return 0; | |
5276 | } | |
5277 | ||
7ecbca9d GDR |
5278 | /* Return true if T is a literal type. */ |
5279 | ||
5280 | bool | |
5281 | literal_type_p (tree t) | |
5282 | { | |
5283 | if (SCALAR_TYPE_P (t)) | |
5284 | return true; | |
5285 | if (CLASS_TYPE_P (t)) | |
5286 | return CLASSTYPE_LITERAL_P (t); | |
5287 | if (TREE_CODE (t) == ARRAY_TYPE) | |
5288 | return literal_type_p (strip_array_types (t)); | |
5289 | return false; | |
5290 | } | |
5291 | ||
5292 | ||
5293 | /* If DECL is a variable declared `constexpr', require its type | |
5294 | be literal. Return the DECL if OK, otherwise NULL. */ | |
5295 | ||
5296 | tree | |
5297 | ensure_literal_type_for_constexpr_object (tree decl) | |
5298 | { | |
5299 | tree type = TREE_TYPE (decl); | |
5300 | if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl) | |
5301 | && !processing_template_decl && !literal_type_p (type)) | |
5302 | { | |
5303 | error ("the type %qT of constexpr variable %qD is not literal", | |
5304 | type, decl); | |
5305 | return NULL; | |
5306 | } | |
5307 | return decl; | |
5308 | } | |
5309 | ||
5310 | /* Return non-null if FUN certainly designates a valid constexpr function | |
5311 | declaration. Otherwise return NULL. Issue appropriate diagnostics | |
5312 | if necessary. Note that we only check the declaration, not the body | |
5313 | of the function. */ | |
5314 | ||
5315 | tree | |
5316 | validate_constexpr_fundecl (tree fun) | |
5317 | { | |
5318 | tree rettype = NULL; | |
5319 | tree parm = NULL; | |
5320 | ||
5321 | /* Don't bother if FUN is not marked constexpr. */ | |
5322 | if (!DECL_DECLARED_CONSTEXPR_P (fun)) | |
5323 | return NULL; | |
5324 | ||
5325 | /* For a function template, we have absolutely no guarantee that all | |
5326 | instantiations will be constexpr. */ | |
5327 | if (TREE_CODE (fun) == TEMPLATE_DECL) | |
5328 | return NULL; | |
5329 | ||
5330 | parm = FUNCTION_FIRST_USER_PARM (fun); | |
5331 | for (; parm != NULL; parm = TREE_CHAIN (parm)) | |
5332 | { | |
5333 | tree type = TREE_TYPE (parm); | |
5334 | if (dependent_type_p (type)) | |
5335 | return NULL; | |
5336 | if (!literal_type_p (type)) | |
5337 | { | |
5338 | error ("parameter %q#D is not of literal type", parm); | |
5339 | return NULL; | |
5340 | } | |
5341 | } | |
5342 | ||
5343 | if (DECL_CONSTRUCTOR_P (fun)) | |
5344 | return fun; | |
5345 | ||
5346 | rettype = TREE_TYPE (TREE_TYPE (fun)); | |
5347 | if (dependent_type_p (rettype)) | |
5348 | return NULL; | |
5349 | if (!literal_type_p (rettype)) | |
5350 | { | |
5351 | error ("return type %qT of function %qD is not a literal type", | |
5352 | TREE_TYPE (TREE_TYPE (fun)), fun); | |
5353 | return NULL; | |
5354 | } | |
5355 | return fun; | |
5356 | } | |
5357 | ||
5358 | ||
d5f4eddd JM |
5359 | /* Constructor for a lambda expression. */ |
5360 | ||
5361 | tree | |
5362 | build_lambda_expr (void) | |
5363 | { | |
5364 | tree lambda = make_node (LAMBDA_EXPR); | |
5365 | LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE; | |
5366 | LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE; | |
5367 | LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE; | |
5368 | LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE; | |
5369 | LAMBDA_EXPR_MUTABLE_P (lambda) = false; | |
5370 | return lambda; | |
5371 | } | |
5372 | ||
5373 | /* Create the closure object for a LAMBDA_EXPR. */ | |
5374 | ||
5375 | tree | |
5376 | build_lambda_object (tree lambda_expr) | |
5377 | { | |
5378 | /* Build aggregate constructor call. | |
5379 | - cp_parser_braced_list | |
5380 | - cp_parser_functional_cast */ | |
5381 | VEC(constructor_elt,gc) *elts = NULL; | |
5382 | tree node, expr, type; | |
5383 | location_t saved_loc; | |
5384 | ||
5385 | if (processing_template_decl) | |
5386 | return lambda_expr; | |
5387 | ||
5388 | /* Make sure any error messages refer to the lambda-introducer. */ | |
5389 | saved_loc = input_location; | |
5390 | input_location = LAMBDA_EXPR_LOCATION (lambda_expr); | |
5391 | ||
5392 | for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr); | |
5393 | node; | |
5394 | node = TREE_CHAIN (node)) | |
5395 | { | |
5396 | tree field = TREE_PURPOSE (node); | |
5397 | tree val = TREE_VALUE (node); | |
5398 | ||
5399 | /* Mere mortals can't copy arrays with aggregate initialization, so | |
5400 | do some magic to make it work here. */ | |
5401 | if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE) | |
5402 | val = build_array_copy (val); | |
37a7519a JM |
5403 | else if (DECL_NORMAL_CAPTURE_P (field) |
5404 | && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE) | |
5405 | { | |
5406 | /* "the entities that are captured by copy are used to | |
5407 | direct-initialize each corresponding non-static data | |
5408 | member of the resulting closure object." | |
5409 | ||
5410 | There's normally no way to express direct-initialization | |
5411 | from an element of a CONSTRUCTOR, so we build up a special | |
5412 | TARGET_EXPR to bypass the usual copy-initialization. */ | |
5413 | val = force_rvalue (val); | |
5414 | if (TREE_CODE (val) == TARGET_EXPR) | |
5415 | TARGET_EXPR_DIRECT_INIT_P (val) = true; | |
5416 | } | |
d5f4eddd JM |
5417 | |
5418 | CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val); | |
5419 | } | |
5420 | ||
5421 | expr = build_constructor (init_list_type_node, elts); | |
5422 | CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1; | |
5423 | ||
5424 | /* N2927: "[The closure] class type is not an aggregate." | |
5425 | But we briefly treat it as an aggregate to make this simpler. */ | |
5426 | type = TREE_TYPE (lambda_expr); | |
5427 | CLASSTYPE_NON_AGGREGATE (type) = 0; | |
5428 | expr = finish_compound_literal (type, expr); | |
5429 | CLASSTYPE_NON_AGGREGATE (type) = 1; | |
5430 | ||
5431 | input_location = saved_loc; | |
5432 | return expr; | |
5433 | } | |
5434 | ||
5435 | /* Return an initialized RECORD_TYPE for LAMBDA. | |
5436 | LAMBDA must have its explicit captures already. */ | |
5437 | ||
5438 | tree | |
5439 | begin_lambda_type (tree lambda) | |
5440 | { | |
5441 | tree type; | |
5442 | ||
5443 | { | |
5444 | /* Unique name. This is just like an unnamed class, but we cannot use | |
5445 | make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */ | |
5446 | tree name; | |
5447 | name = make_lambda_name (); | |
5448 | ||
5449 | /* Create the new RECORD_TYPE for this lambda. */ | |
5450 | type = xref_tag (/*tag_code=*/record_type, | |
5451 | name, | |
5452 | /*scope=*/ts_within_enclosing_non_class, | |
5453 | /*template_header_p=*/false); | |
5454 | } | |
5455 | ||
5456 | /* Designate it as a struct so that we can use aggregate initialization. */ | |
5457 | CLASSTYPE_DECLARED_CLASS (type) = false; | |
5458 | ||
5459 | /* Clear base types. */ | |
5460 | xref_basetypes (type, /*bases=*/NULL_TREE); | |
5461 | ||
5462 | /* Start the class. */ | |
5463 | type = begin_class_definition (type, /*attributes=*/NULL_TREE); | |
5464 | ||
5465 | /* Cross-reference the expression and the type. */ | |
5466 | TREE_TYPE (lambda) = type; | |
5467 | CLASSTYPE_LAMBDA_EXPR (type) = lambda; | |
5468 | ||
5469 | return type; | |
5470 | } | |
5471 | ||
5472 | /* Returns the type to use for the return type of the operator() of a | |
5473 | closure class. */ | |
5474 | ||
5475 | tree | |
5476 | lambda_return_type (tree expr) | |
5477 | { | |
5478 | tree type; | |
5479 | if (type_dependent_expression_p (expr)) | |
5480 | { | |
5481 | type = cxx_make_type (DECLTYPE_TYPE); | |
5482 | DECLTYPE_TYPE_EXPR (type) = expr; | |
5483 | DECLTYPE_FOR_LAMBDA_RETURN (type) = true; | |
5484 | SET_TYPE_STRUCTURAL_EQUALITY (type); | |
5485 | } | |
5486 | else | |
5487 | type = type_decays_to (unlowered_expr_type (expr)); | |
5488 | return type; | |
5489 | } | |
5490 | ||
5491 | /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the | |
5492 | closure type. */ | |
5493 | ||
5494 | tree | |
5495 | lambda_function (tree lambda) | |
5496 | { | |
5497 | tree type; | |
5498 | if (TREE_CODE (lambda) == LAMBDA_EXPR) | |
5499 | type = TREE_TYPE (lambda); | |
5500 | else | |
5501 | type = lambda; | |
5502 | gcc_assert (LAMBDA_TYPE_P (type)); | |
5503 | /* Don't let debug_tree cause instantiation. */ | |
5504 | if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type)) | |
5505 | return NULL_TREE; | |
5506 | lambda = lookup_member (type, ansi_opname (CALL_EXPR), | |
5507 | /*protect=*/0, /*want_type=*/false); | |
5508 | if (lambda) | |
5509 | lambda = BASELINK_FUNCTIONS (lambda); | |
5510 | return lambda; | |
5511 | } | |
5512 | ||
5513 | /* Returns the type to use for the FIELD_DECL corresponding to the | |
5514 | capture of EXPR. | |
5515 | The caller should add REFERENCE_TYPE for capture by reference. */ | |
5516 | ||
5517 | tree | |
5518 | lambda_capture_field_type (tree expr) | |
5519 | { | |
5520 | tree type; | |
5521 | if (type_dependent_expression_p (expr)) | |
5522 | { | |
5523 | type = cxx_make_type (DECLTYPE_TYPE); | |
5524 | DECLTYPE_TYPE_EXPR (type) = expr; | |
5525 | DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true; | |
5526 | SET_TYPE_STRUCTURAL_EQUALITY (type); | |
5527 | } | |
5528 | else | |
5529 | type = non_reference (unlowered_expr_type (expr)); | |
5530 | return type; | |
5531 | } | |
5532 | ||
5533 | /* Recompute the return type for LAMBDA with body of the form: | |
5534 | { return EXPR ; } */ | |
5535 | ||
5536 | void | |
5537 | apply_lambda_return_type (tree lambda, tree return_type) | |
5538 | { | |
5539 | tree fco = lambda_function (lambda); | |
5540 | tree result; | |
5541 | ||
5542 | LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type; | |
5543 | ||
5544 | /* If we got a DECLTYPE_TYPE, don't stick it in the function yet, | |
5545 | it would interfere with instantiating the closure type. */ | |
5546 | if (dependent_type_p (return_type)) | |
5547 | return; | |
5548 | if (return_type == error_mark_node) | |
5549 | return; | |
5550 | ||
5551 | /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE | |
5552 | TREE_TYPE (METHOD_TYPE) == return-type */ | |
5553 | TREE_TYPE (TREE_TYPE (fco)) = return_type; | |
5554 | ||
5555 | result = DECL_RESULT (fco); | |
5556 | if (result == NULL_TREE) | |
5557 | return; | |
5558 | ||
5559 | /* We already have a DECL_RESULT from start_preparsed_function. | |
5560 | Now we need to redo the work it and allocate_struct_function | |
5561 | did to reflect the new type. */ | |
5562 | result = build_decl (input_location, RESULT_DECL, NULL_TREE, | |
5563 | TYPE_MAIN_VARIANT (return_type)); | |
5564 | DECL_ARTIFICIAL (result) = 1; | |
5565 | DECL_IGNORED_P (result) = 1; | |
5566 | cp_apply_type_quals_to_decl (cp_type_quals (return_type), | |
5567 | result); | |
5568 | ||
5569 | DECL_RESULT (fco) = result; | |
5570 | ||
5571 | if (!processing_template_decl && aggregate_value_p (result, fco)) | |
5572 | { | |
5573 | #ifdef PCC_STATIC_STRUCT_RETURN | |
5574 | cfun->returns_pcc_struct = 1; | |
5575 | #endif | |
5576 | cfun->returns_struct = 1; | |
5577 | } | |
5578 | ||
5579 | } | |
5580 | ||
5581 | /* DECL is a local variable or parameter from the surrounding scope of a | |
5582 | lambda-expression. Returns the decltype for a use of the capture field | |
5583 | for DECL even if it hasn't been captured yet. */ | |
5584 | ||
5585 | static tree | |
5586 | capture_decltype (tree decl) | |
5587 | { | |
5588 | tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl)); | |
5589 | /* FIXME do lookup instead of list walk? */ | |
5590 | tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam)); | |
5591 | tree type; | |
5592 | ||
5593 | if (cap) | |
5594 | type = TREE_TYPE (TREE_PURPOSE (cap)); | |
5595 | else | |
5596 | switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam)) | |
5597 | { | |
5598 | case CPLD_NONE: | |
5599 | error ("%qD is not captured", decl); | |
5600 | return error_mark_node; | |
5601 | ||
5602 | case CPLD_COPY: | |
5603 | type = TREE_TYPE (decl); | |
5604 | if (TREE_CODE (type) == REFERENCE_TYPE | |
5605 | && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE) | |
5606 | type = TREE_TYPE (type); | |
5607 | break; | |
5608 | ||
5609 | case CPLD_REFERENCE: | |
5610 | type = TREE_TYPE (decl); | |
5611 | if (TREE_CODE (type) != REFERENCE_TYPE) | |
5612 | type = build_reference_type (TREE_TYPE (decl)); | |
5613 | break; | |
5614 | ||
5615 | default: | |
5616 | gcc_unreachable (); | |
5617 | } | |
5618 | ||
5619 | if (TREE_CODE (type) != REFERENCE_TYPE) | |
5620 | { | |
5621 | if (!LAMBDA_EXPR_MUTABLE_P (lam)) | |
5622 | type = cp_build_qualified_type (type, (TYPE_QUALS (type) | |
5623 | |TYPE_QUAL_CONST)); | |
5624 | type = build_reference_type (type); | |
5625 | } | |
5626 | return type; | |
5627 | } | |
5628 | ||
5629 | /* From an ID and INITIALIZER, create a capture (by reference if | |
5630 | BY_REFERENCE_P is true), add it to the capture-list for LAMBDA, | |
5631 | and return it. */ | |
5632 | ||
5633 | tree | |
37a7519a JM |
5634 | add_capture (tree lambda, tree id, tree initializer, bool by_reference_p, |
5635 | bool explicit_init_p) | |
d5f4eddd JM |
5636 | { |
5637 | tree type; | |
5638 | tree member; | |
5639 | ||
5640 | type = lambda_capture_field_type (initializer); | |
5641 | if (by_reference_p) | |
5642 | { | |
5643 | type = build_reference_type (type); | |
5644 | if (!real_lvalue_p (initializer)) | |
5645 | error ("cannot capture %qE by reference", initializer); | |
5646 | } | |
5647 | ||
5648 | /* Make member variable. */ | |
5649 | member = build_lang_decl (FIELD_DECL, id, type); | |
37a7519a JM |
5650 | if (!explicit_init_p) |
5651 | /* Normal captures are invisible to name lookup but uses are replaced | |
5652 | with references to the capture field; we implement this by only | |
5653 | really making them invisible in unevaluated context; see | |
5654 | qualify_lookup. For now, let's make explicitly initialized captures | |
5655 | always visible. */ | |
5656 | DECL_NORMAL_CAPTURE_P (member) = true; | |
d5f4eddd JM |
5657 | |
5658 | /* Add it to the appropriate closure class. */ | |
5659 | finish_member_declaration (member); | |
5660 | ||
5661 | LAMBDA_EXPR_CAPTURE_LIST (lambda) | |
5662 | = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda)); | |
5663 | ||
5664 | if (id == get_identifier ("__this")) | |
5665 | { | |
5666 | if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda)) | |
5667 | error ("already captured %<this%> in lambda expression"); | |
5668 | LAMBDA_EXPR_THIS_CAPTURE (lambda) = member; | |
5669 | } | |
5670 | ||
5671 | return member; | |
5672 | } | |
5673 | ||
9660afe0 JM |
5674 | /* Given a FIELD_DECL decl belonging to a closure type, return a |
5675 | COMPONENT_REF of it relative to the 'this' parameter of the op() for | |
5676 | that type. */ | |
5677 | ||
5678 | static tree | |
5679 | thisify_lambda_field (tree decl) | |
5680 | { | |
5681 | tree context = lambda_function (DECL_CONTEXT (decl)); | |
5682 | tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context), | |
5683 | /*errorstring*/"", | |
5684 | tf_warning_or_error); | |
5685 | return finish_non_static_data_member (decl, object, | |
5686 | /*qualifying_scope*/NULL_TREE); | |
5687 | } | |
5688 | ||
d5f4eddd JM |
5689 | /* Similar to add_capture, except this works on a stack of nested lambdas. |
5690 | BY_REFERENCE_P in this case is derived from the default capture mode. | |
5691 | Returns the capture for the lambda at the bottom of the stack. */ | |
5692 | ||
5693 | tree | |
5694 | add_default_capture (tree lambda_stack, tree id, tree initializer) | |
5695 | { | |
5696 | bool this_capture_p = (id == get_identifier ("__this")); | |
5697 | ||
5698 | tree member = NULL_TREE; | |
5699 | ||
5700 | tree saved_class_type = current_class_type; | |
5701 | ||
5702 | tree node; | |
5703 | ||
5704 | for (node = lambda_stack; | |
5705 | node; | |
5706 | node = TREE_CHAIN (node)) | |
5707 | { | |
5708 | tree lambda = TREE_VALUE (node); | |
5709 | ||
5710 | current_class_type = TREE_TYPE (lambda); | |
5711 | member = add_capture (lambda, | |
5712 | id, | |
5713 | initializer, | |
5714 | /*by_reference_p=*/ | |
5715 | (!this_capture_p | |
5716 | && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) | |
37a7519a JM |
5717 | == CPLD_REFERENCE)), |
5718 | /*explicit_init_p=*/false); | |
9660afe0 | 5719 | initializer = thisify_lambda_field (member); |
d5f4eddd JM |
5720 | } |
5721 | ||
5722 | current_class_type = saved_class_type; | |
5723 | ||
5724 | return member; | |
d5f4eddd JM |
5725 | } |
5726 | ||
5727 | /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an | |
5728 | INDIRECT_REF, possibly adding it through default capturing. */ | |
5729 | ||
5730 | tree | |
5731 | lambda_expr_this_capture (tree lambda) | |
5732 | { | |
5733 | tree result; | |
5734 | ||
5735 | tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda); | |
5736 | ||
5737 | /* Try to default capture 'this' if we can. */ | |
5738 | if (!this_capture | |
5739 | && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE) | |
5740 | { | |
5741 | tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda)); | |
5742 | tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE); | |
71d16049 | 5743 | tree init = NULL_TREE; |
d5f4eddd JM |
5744 | |
5745 | /* If we are in a lambda function, we can move out until we hit: | |
5746 | 1. a non-lambda function, | |
5747 | 2. a lambda function capturing 'this', or | |
5748 | 3. a non-default capturing lambda function. */ | |
5749 | while (LAMBDA_FUNCTION_P (containing_function)) | |
5750 | { | |
5751 | tree lambda | |
5752 | = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function)); | |
5753 | ||
71d16049 JM |
5754 | if (LAMBDA_EXPR_THIS_CAPTURE (lambda)) |
5755 | { | |
5756 | /* An outer lambda has already captured 'this'. */ | |
5757 | tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda); | |
92de1b37 | 5758 | init = thisify_lambda_field (cap); |
71d16049 JM |
5759 | break; |
5760 | } | |
5761 | ||
5762 | if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE) | |
5763 | /* An outer lambda won't let us capture 'this'. */ | |
5764 | break; | |
d5f4eddd JM |
5765 | |
5766 | lambda_stack = tree_cons (NULL_TREE, | |
5767 | lambda, | |
5768 | lambda_stack); | |
5769 | ||
5770 | containing_function = decl_function_context (containing_function); | |
5771 | } | |
5772 | ||
71d16049 JM |
5773 | if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function) |
5774 | && !LAMBDA_FUNCTION_P (containing_function)) | |
5775 | /* First parameter is 'this'. */ | |
5776 | init = DECL_ARGUMENTS (containing_function); | |
d5f4eddd | 5777 | |
71d16049 JM |
5778 | if (init) |
5779 | this_capture = add_default_capture (lambda_stack, | |
5780 | /*id=*/get_identifier ("__this"), | |
5781 | init); | |
d5f4eddd JM |
5782 | } |
5783 | ||
5784 | if (!this_capture) | |
5785 | { | |
5786 | error ("%<this%> was not captured for this lambda function"); | |
5787 | result = error_mark_node; | |
5788 | } | |
5789 | else | |
5790 | { | |
5791 | /* To make sure that current_class_ref is for the lambda. */ | |
5792 | gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda)); | |
5793 | ||
5794 | result = finish_non_static_data_member (this_capture, | |
5795 | current_class_ref, | |
5796 | /*qualifying_scope=*/NULL_TREE); | |
5797 | ||
5798 | /* If 'this' is captured, each use of 'this' is transformed into an | |
5799 | access to the corresponding unnamed data member of the closure | |
5800 | type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast | |
5801 | ensures that the transformed expression is an rvalue. ] */ | |
5802 | result = rvalue (result); | |
5803 | } | |
5804 | ||
5805 | return result; | |
5806 | } | |
5807 | ||
b77068f2 JM |
5808 | /* If the closure TYPE has a static op(), also add a conversion to function |
5809 | pointer. */ | |
5810 | ||
5811 | void | |
5812 | maybe_add_lambda_conv_op (tree type) | |
5813 | { | |
5814 | bool nested = (current_function_decl != NULL_TREE); | |
5815 | tree callop = lambda_function (type); | |
5816 | tree rettype, name, fntype, fn, body, compound_stmt; | |
5817 | ||
5818 | if (!DECL_STATIC_FUNCTION_P (callop)) | |
5819 | return; | |
5820 | ||
5821 | rettype = build_pointer_type (TREE_TYPE (callop)); | |
5822 | name = mangle_conv_op_name_for_type (rettype); | |
5823 | fntype = build_function_type (rettype, void_list_node); | |
5824 | fn = build_lang_decl (FUNCTION_DECL, name, fntype); | |
5825 | DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop); | |
5826 | ||
5827 | if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn | |
5828 | && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT) | |
5829 | DECL_ALIGN (fn) = 2 * BITS_PER_UNIT; | |
5830 | ||
5831 | SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR); | |
5832 | grokclassfn (type, fn, NO_SPECIAL); | |
5833 | set_linkage_according_to_type (type, fn); | |
5834 | rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof); | |
5835 | DECL_IN_AGGR_P (fn) = 1; | |
5836 | DECL_ARTIFICIAL (fn) = 1; | |
5837 | DECL_NOT_REALLY_EXTERN (fn) = 1; | |
5838 | DECL_DECLARED_INLINE_P (fn) = 1; | |
5839 | DECL_STATIC_FUNCTION_P (fn) = 1; | |
5840 | ||
5841 | add_method (type, fn, NULL_TREE); | |
5842 | ||
5843 | if (nested) | |
5844 | push_function_context (); | |
5845 | start_preparsed_function (fn, NULL_TREE, | |
5846 | SF_PRE_PARSED | SF_INCLASS_INLINE); | |
5847 | body = begin_function_body (); | |
5848 | compound_stmt = begin_compound_stmt (0); | |
5849 | ||
5850 | finish_return_stmt (decay_conversion (callop)); | |
5851 | ||
5852 | finish_compound_stmt (compound_stmt); | |
5853 | finish_function_body (body); | |
5854 | ||
5855 | expand_or_defer_fn (finish_function (2)); | |
5856 | if (nested) | |
5857 | pop_function_context (); | |
5858 | } | |
cf22909c | 5859 | #include "gt-cp-semantics.h" |