]>
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, |
95cc031f | 7 | 2008, 2009, 2010, 2011 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" | |
39dabefd | 33 | #include "c-family/c-common.h" |
61d3ce20 | 34 | #include "c-family/c-objc.h" |
25af8512 | 35 | #include "tree-inline.h" |
6de9cd9a | 36 | #include "tree-mudflap.h" |
12027a89 | 37 | #include "toplev.h" |
84df082b | 38 | #include "flags.h" |
225ff119 | 39 | #include "output.h" |
ea11ca7e | 40 | #include "timevar.h" |
6de9cd9a | 41 | #include "diagnostic.h" |
8cd2462c | 42 | #include "cgraph.h" |
325c3691 | 43 | #include "tree-iterator.h" |
3e1f1ba5 | 44 | #include "vec.h" |
44d10c10 | 45 | #include "target.h" |
726a989a | 46 | #include "gimple.h" |
7a8cba34 | 47 | #include "bitmap.h" |
ad321293 MM |
48 | |
49 | /* There routines provide a modular interface to perform many parsing | |
50 | operations. They may therefore be used during actual parsing, or | |
51 | during template instantiation, which may be regarded as a | |
0b4d5576 | 52 | degenerate form of parsing. */ |
ad321293 | 53 | |
3a978d72 | 54 | static tree maybe_convert_cond (tree); |
6de9cd9a | 55 | static tree finalize_nrv_r (tree *, int *, void *); |
d5f4eddd | 56 | static tree capture_decltype (tree); |
9660afe0 | 57 | static tree thisify_lambda_field (tree); |
4985cde3 | 58 | |
558475f0 | 59 | |
8d241e0b KL |
60 | /* Deferred Access Checking Overview |
61 | --------------------------------- | |
62 | ||
63 | Most C++ expressions and declarations require access checking | |
64 | to be performed during parsing. However, in several cases, | |
65 | this has to be treated differently. | |
66 | ||
67 | For member declarations, access checking has to be deferred | |
68 | until more information about the declaration is known. For | |
69 | example: | |
70 | ||
71 | class A { | |
0cbd7506 | 72 | typedef int X; |
8d241e0b | 73 | public: |
0cbd7506 | 74 | X f(); |
8d241e0b KL |
75 | }; |
76 | ||
77 | A::X A::f(); | |
78 | A::X g(); | |
79 | ||
80 | When we are parsing the function return type `A::X', we don't | |
81 | really know if this is allowed until we parse the function name. | |
82 | ||
83 | Furthermore, some contexts require that access checking is | |
84 | never performed at all. These include class heads, and template | |
85 | instantiations. | |
86 | ||
87 | Typical use of access checking functions is described here: | |
c8094d83 | 88 | |
8d241e0b KL |
89 | 1. When we enter a context that requires certain access checking |
90 | mode, the function `push_deferring_access_checks' is called with | |
91 | DEFERRING argument specifying the desired mode. Access checking | |
92 | may be performed immediately (dk_no_deferred), deferred | |
93 | (dk_deferred), or not performed (dk_no_check). | |
94 | ||
95 | 2. When a declaration such as a type, or a variable, is encountered, | |
96 | the function `perform_or_defer_access_check' is called. It | |
d6b418fa | 97 | maintains a VEC of all deferred checks. |
8d241e0b KL |
98 | |
99 | 3. The global `current_class_type' or `current_function_decl' is then | |
100 | setup by the parser. `enforce_access' relies on these information | |
101 | to check access. | |
102 | ||
103 | 4. Upon exiting the context mentioned in step 1, | |
104 | `perform_deferred_access_checks' is called to check all declaration | |
d6b418fa | 105 | stored in the VEC. `pop_deferring_access_checks' is then |
8d241e0b KL |
106 | called to restore the previous access checking mode. |
107 | ||
108 | In case of parsing error, we simply call `pop_deferring_access_checks' | |
109 | without `perform_deferred_access_checks'. */ | |
110 | ||
d1b38208 | 111 | typedef struct GTY(()) deferred_access { |
d6b418fa | 112 | /* A VEC representing name-lookups for which we have deferred |
3e1f1ba5 NS |
113 | checking access controls. We cannot check the accessibility of |
114 | names used in a decl-specifier-seq until we know what is being | |
115 | declared because code like: | |
116 | ||
c8094d83 | 117 | class A { |
0cbd7506 MS |
118 | class B {}; |
119 | B* f(); | |
3e1f1ba5 NS |
120 | } |
121 | ||
122 | A::B* A::f() { return 0; } | |
123 | ||
d6b418fa SM |
124 | is valid, even though `A::B' is not generally accessible. */ |
125 | VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks; | |
c8094d83 | 126 | |
3e1f1ba5 NS |
127 | /* The current mode of access checks. */ |
128 | enum deferring_kind deferring_access_checks_kind; | |
c8094d83 | 129 | |
3e1f1ba5 | 130 | } deferred_access; |
d4e6fecb NS |
131 | DEF_VEC_O (deferred_access); |
132 | DEF_VEC_ALLOC_O (deferred_access,gc); | |
3e1f1ba5 | 133 | |
cf22909c | 134 | /* Data for deferred access checking. */ |
d4e6fecb | 135 | static GTY(()) VEC(deferred_access,gc) *deferred_access_stack; |
3e1f1ba5 | 136 | static GTY(()) unsigned deferred_access_no_check; |
cf22909c KL |
137 | |
138 | /* Save the current deferred access states and start deferred | |
139 | access checking iff DEFER_P is true. */ | |
140 | ||
572c2b17 AP |
141 | void |
142 | push_deferring_access_checks (deferring_kind deferring) | |
cf22909c | 143 | { |
78757caa KL |
144 | /* For context like template instantiation, access checking |
145 | disabling applies to all nested context. */ | |
3e1f1ba5 NS |
146 | if (deferred_access_no_check || deferring == dk_no_check) |
147 | deferred_access_no_check++; | |
cf22909c | 148 | else |
3e1f1ba5 NS |
149 | { |
150 | deferred_access *ptr; | |
cf22909c | 151 | |
d4e6fecb | 152 | ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL); |
d6b418fa | 153 | ptr->deferred_access_checks = NULL; |
3e1f1ba5 NS |
154 | ptr->deferring_access_checks_kind = deferring; |
155 | } | |
cf22909c KL |
156 | } |
157 | ||
158 | /* Resume deferring access checks again after we stopped doing | |
159 | this previously. */ | |
160 | ||
572c2b17 AP |
161 | void |
162 | resume_deferring_access_checks (void) | |
cf22909c | 163 | { |
3e1f1ba5 NS |
164 | if (!deferred_access_no_check) |
165 | VEC_last (deferred_access, deferred_access_stack) | |
166 | ->deferring_access_checks_kind = dk_deferred; | |
cf22909c KL |
167 | } |
168 | ||
169 | /* Stop deferring access checks. */ | |
170 | ||
572c2b17 AP |
171 | void |
172 | stop_deferring_access_checks (void) | |
cf22909c | 173 | { |
3e1f1ba5 NS |
174 | if (!deferred_access_no_check) |
175 | VEC_last (deferred_access, deferred_access_stack) | |
176 | ->deferring_access_checks_kind = dk_no_deferred; | |
cf22909c KL |
177 | } |
178 | ||
179 | /* Discard the current deferred access checks and restore the | |
180 | previous states. */ | |
181 | ||
572c2b17 AP |
182 | void |
183 | pop_deferring_access_checks (void) | |
cf22909c | 184 | { |
3e1f1ba5 NS |
185 | if (deferred_access_no_check) |
186 | deferred_access_no_check--; | |
187 | else | |
188 | VEC_pop (deferred_access, deferred_access_stack); | |
cf22909c KL |
189 | } |
190 | ||
c8094d83 MS |
191 | /* Returns a TREE_LIST representing the deferred checks. |
192 | The TREE_PURPOSE of each node is the type through which the | |
cf22909c KL |
193 | access occurred; the TREE_VALUE is the declaration named. |
194 | */ | |
195 | ||
d6b418fa | 196 | VEC (deferred_access_check,gc)* |
572c2b17 | 197 | get_deferred_access_checks (void) |
cf22909c | 198 | { |
3e1f1ba5 NS |
199 | if (deferred_access_no_check) |
200 | return NULL; | |
201 | else | |
202 | return (VEC_last (deferred_access, deferred_access_stack) | |
203 | ->deferred_access_checks); | |
cf22909c KL |
204 | } |
205 | ||
206 | /* Take current deferred checks and combine with the | |
207 | previous states if we also defer checks previously. | |
208 | Otherwise perform checks now. */ | |
209 | ||
572c2b17 AP |
210 | void |
211 | pop_to_parent_deferring_access_checks (void) | |
cf22909c | 212 | { |
3e1f1ba5 NS |
213 | if (deferred_access_no_check) |
214 | deferred_access_no_check--; | |
215 | else | |
216 | { | |
d6b418fa | 217 | VEC (deferred_access_check,gc) *checks; |
3e1f1ba5 NS |
218 | deferred_access *ptr; |
219 | ||
220 | checks = (VEC_last (deferred_access, deferred_access_stack) | |
221 | ->deferred_access_checks); | |
222 | ||
223 | VEC_pop (deferred_access, deferred_access_stack); | |
224 | ptr = VEC_last (deferred_access, deferred_access_stack); | |
225 | if (ptr->deferring_access_checks_kind == dk_no_deferred) | |
226 | { | |
227 | /* Check access. */ | |
d6b418fa | 228 | perform_access_checks (checks); |
3e1f1ba5 NS |
229 | } |
230 | else | |
231 | { | |
232 | /* Merge with parent. */ | |
d6b418fa SM |
233 | int i, j; |
234 | deferred_access_check *chk, *probe; | |
c8094d83 | 235 | |
ac47786e | 236 | FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk) |
3e1f1ba5 | 237 | { |
ac47786e NF |
238 | FOR_EACH_VEC_ELT (deferred_access_check, |
239 | ptr->deferred_access_checks, j, probe) | |
d6b418fa SM |
240 | { |
241 | if (probe->binfo == chk->binfo && | |
242 | probe->decl == chk->decl && | |
243 | probe->diag_decl == chk->diag_decl) | |
244 | goto found; | |
245 | } | |
3e1f1ba5 | 246 | /* Insert into parent's checks. */ |
d6b418fa SM |
247 | VEC_safe_push (deferred_access_check, gc, |
248 | ptr->deferred_access_checks, chk); | |
3e1f1ba5 NS |
249 | found:; |
250 | } | |
251 | } | |
252 | } | |
cf22909c KL |
253 | } |
254 | ||
6b648482 MM |
255 | /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node |
256 | is the BINFO indicating the qualifying scope used to access the | |
257 | DECL node stored in the TREE_VALUE of the node. */ | |
258 | ||
259 | void | |
d6b418fa | 260 | perform_access_checks (VEC (deferred_access_check,gc)* checks) |
6b648482 | 261 | { |
d6b418fa SM |
262 | int i; |
263 | deferred_access_check *chk; | |
264 | ||
265 | if (!checks) | |
266 | return; | |
267 | ||
ac47786e | 268 | FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk) |
d6b418fa | 269 | enforce_access (chk->binfo, chk->decl, chk->diag_decl); |
6b648482 MM |
270 | } |
271 | ||
25903d03 KL |
272 | /* Perform the deferred access checks. |
273 | ||
274 | After performing the checks, we still have to keep the list | |
275 | `deferred_access_stack->deferred_access_checks' since we may want | |
276 | to check access for them again later in a different context. | |
277 | For example: | |
278 | ||
279 | class A { | |
280 | typedef int X; | |
281 | static X a; | |
282 | }; | |
283 | A::X A::a, x; // No error for `A::a', error for `x' | |
284 | ||
285 | We have to perform deferred access of `A::X', first with `A::a', | |
286 | next with `x'. */ | |
cf22909c | 287 | |
572c2b17 AP |
288 | void |
289 | perform_deferred_access_checks (void) | |
cf22909c | 290 | { |
6b648482 | 291 | perform_access_checks (get_deferred_access_checks ()); |
cf22909c KL |
292 | } |
293 | ||
294 | /* Defer checking the accessibility of DECL, when looked up in | |
02022f3a | 295 | BINFO. DIAG_DECL is the declaration to use to print diagnostics. */ |
cf22909c | 296 | |
572c2b17 | 297 | void |
02022f3a | 298 | perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl) |
cf22909c | 299 | { |
d6b418fa | 300 | int i; |
3e1f1ba5 | 301 | deferred_access *ptr; |
d6b418fa SM |
302 | deferred_access_check *chk; |
303 | deferred_access_check *new_access; | |
304 | ||
cf22909c | 305 | |
3e1f1ba5 NS |
306 | /* Exit if we are in a context that no access checking is performed. |
307 | */ | |
308 | if (deferred_access_no_check) | |
0f2a66c9 | 309 | return; |
c8094d83 | 310 | |
50bc768d | 311 | gcc_assert (TREE_CODE (binfo) == TREE_BINFO); |
0f2a66c9 | 312 | |
3e1f1ba5 | 313 | ptr = VEC_last (deferred_access, deferred_access_stack); |
c8094d83 | 314 | |
cf22909c | 315 | /* If we are not supposed to defer access checks, just check now. */ |
3e1f1ba5 | 316 | if (ptr->deferring_access_checks_kind == dk_no_deferred) |
cf22909c | 317 | { |
02022f3a | 318 | enforce_access (binfo, decl, diag_decl); |
cf22909c KL |
319 | return; |
320 | } | |
c8094d83 | 321 | |
cf22909c | 322 | /* See if we are already going to perform this check. */ |
ac47786e NF |
323 | FOR_EACH_VEC_ELT (deferred_access_check, |
324 | ptr->deferred_access_checks, i, chk) | |
d6b418fa SM |
325 | { |
326 | if (chk->decl == decl && chk->binfo == binfo && | |
327 | chk->diag_decl == diag_decl) | |
328 | { | |
329 | return; | |
330 | } | |
331 | } | |
cf22909c | 332 | /* If not, record the check. */ |
d6b418fa SM |
333 | new_access = |
334 | VEC_safe_push (deferred_access_check, gc, | |
335 | ptr->deferred_access_checks, 0); | |
336 | new_access->binfo = binfo; | |
337 | new_access->decl = decl; | |
338 | new_access->diag_decl = diag_decl; | |
cf22909c KL |
339 | } |
340 | ||
f7d042e2 JM |
341 | /* Used by build_over_call in LOOKUP_SPECULATIVE mode: return whether DECL |
342 | is accessible in BINFO, and possibly complain if not. If we're not | |
343 | checking access, everything is accessible. */ | |
344 | ||
345 | bool | |
346 | speculative_access_check (tree binfo, tree decl, tree diag_decl, | |
347 | bool complain) | |
348 | { | |
349 | if (deferred_access_no_check) | |
350 | return true; | |
351 | ||
352 | /* If we're checking for implicit delete, we don't want access | |
353 | control errors. */ | |
354 | if (!accessible_p (binfo, decl, true)) | |
355 | { | |
356 | /* Unless we're under maybe_explain_implicit_delete. */ | |
357 | if (complain) | |
358 | enforce_access (binfo, decl, diag_decl); | |
359 | return false; | |
360 | } | |
361 | ||
362 | return true; | |
363 | } | |
364 | ||
838dfd8a | 365 | /* Returns nonzero if the current statement is a full expression, |
f2c5f623 BC |
366 | i.e. temporaries created during that statement should be destroyed |
367 | at the end of the statement. */ | |
35b1567d | 368 | |
f2c5f623 | 369 | int |
3a978d72 | 370 | stmts_are_full_exprs_p (void) |
f2c5f623 | 371 | { |
ae499cce MM |
372 | return current_stmt_tree ()->stmts_are_full_exprs_p; |
373 | } | |
374 | ||
ed3d0b14 ILT |
375 | /* T is a statement. Add it to the statement-tree. This is the C++ |
376 | version. The C/ObjC frontends have a slightly different version of | |
377 | this function. */ | |
378 | ||
379 | tree | |
380 | add_stmt (tree t) | |
381 | { | |
382 | enum tree_code code = TREE_CODE (t); | |
383 | ||
384 | if (EXPR_P (t) && code != LABEL_EXPR) | |
385 | { | |
386 | if (!EXPR_HAS_LOCATION (t)) | |
387 | SET_EXPR_LOCATION (t, input_location); | |
388 | ||
389 | /* When we expand a statement-tree, we must know whether or not the | |
390 | statements are full-expressions. We record that fact here. */ | |
391 | STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p (); | |
392 | } | |
393 | ||
394 | /* Add T to the statement-tree. Non-side-effect statements need to be | |
395 | recorded during statement expressions. */ | |
396 | append_to_statement_list_force (t, &cur_stmt_list); | |
397 | ||
398 | return t; | |
399 | } | |
400 | ||
e8924938 | 401 | /* Returns the stmt_tree to which statements are currently being added. */ |
ae499cce MM |
402 | |
403 | stmt_tree | |
3a978d72 | 404 | current_stmt_tree (void) |
ae499cce | 405 | { |
c8094d83 MS |
406 | return (cfun |
407 | ? &cfun->language->base.x_stmt_tree | |
ae499cce | 408 | : &scope_chain->x_stmt_tree); |
f2c5f623 | 409 | } |
35b1567d | 410 | |
543a0daa RH |
411 | /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */ |
412 | ||
413 | static tree | |
414 | maybe_cleanup_point_expr (tree expr) | |
415 | { | |
416 | if (!processing_template_decl && stmts_are_full_exprs_p ()) | |
0ad28dde | 417 | expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr); |
543a0daa RH |
418 | return expr; |
419 | } | |
420 | ||
0ad28dde | 421 | /* Like maybe_cleanup_point_expr except have the type of the new expression be |
22423a1f KH |
422 | void so we don't need to create a temporary variable to hold the inner |
423 | expression. The reason why we do this is because the original type might be | |
424 | an aggregate and we cannot create a temporary variable for that type. */ | |
0ad28dde AP |
425 | |
426 | static tree | |
427 | maybe_cleanup_point_expr_void (tree expr) | |
428 | { | |
429 | if (!processing_template_decl && stmts_are_full_exprs_p ()) | |
430 | expr = fold_build_cleanup_point_expr (void_type_node, expr); | |
431 | return expr; | |
432 | } | |
433 | ||
434 | ||
435 | ||
543a0daa RH |
436 | /* Create a declaration statement for the declaration given by the DECL. */ |
437 | ||
438 | void | |
350fae66 | 439 | add_decl_expr (tree decl) |
543a0daa | 440 | { |
c2255bc4 | 441 | tree r = build_stmt (input_location, DECL_EXPR, decl); |
b187901e AP |
442 | if (DECL_INITIAL (decl) |
443 | || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl)))) | |
0ad28dde | 444 | r = maybe_cleanup_point_expr_void (r); |
543a0daa RH |
445 | add_stmt (r); |
446 | } | |
447 | ||
f2c5f623 | 448 | /* Finish a scope. */ |
35b1567d | 449 | |
20aff0b3 | 450 | tree |
325c3691 | 451 | do_poplevel (tree stmt_list) |
35b1567d | 452 | { |
325c3691 | 453 | tree block = NULL; |
35b1567d | 454 | |
f2c5f623 | 455 | if (stmts_are_full_exprs_p ()) |
325c3691 | 456 | block = poplevel (kept_level_p (), 1, 0); |
f2c5f623 | 457 | |
325c3691 | 458 | stmt_list = pop_stmt_list (stmt_list); |
c8094d83 | 459 | |
325c3691 RH |
460 | if (!processing_template_decl) |
461 | { | |
c2255bc4 | 462 | stmt_list = c_build_bind_expr (input_location, block, stmt_list); |
325c3691 | 463 | /* ??? See c_end_compound_stmt re statement expressions. */ |
35b1567d BC |
464 | } |
465 | ||
325c3691 | 466 | return stmt_list; |
35b1567d BC |
467 | } |
468 | ||
c8094d83 | 469 | /* Begin a new scope. */ |
35b1567d | 470 | |
325c3691 | 471 | static tree |
92bc1323 | 472 | do_pushlevel (scope_kind sk) |
35b1567d | 473 | { |
325c3691 | 474 | tree ret = push_stmt_list (); |
f2c5f623 | 475 | if (stmts_are_full_exprs_p ()) |
325c3691 RH |
476 | begin_scope (sk, NULL); |
477 | return ret; | |
478 | } | |
5a508662 RH |
479 | |
480 | /* Queue a cleanup. CLEANUP is an expression/statement to be executed | |
481 | when the current scope is exited. EH_ONLY is true when this is not | |
482 | meant to apply to normal control flow transfer. */ | |
483 | ||
484 | void | |
485 | push_cleanup (tree decl, tree cleanup, bool eh_only) | |
486 | { | |
c2255bc4 | 487 | tree stmt = build_stmt (input_location, CLEANUP_STMT, NULL, cleanup, decl); |
5a508662 RH |
488 | CLEANUP_EH_ONLY (stmt) = eh_only; |
489 | add_stmt (stmt); | |
490 | CLEANUP_BODY (stmt) = push_stmt_list (); | |
491 | } | |
325c3691 | 492 | |
caf2523d RH |
493 | /* Begin a conditional that might contain a declaration. When generating |
494 | normal code, we want the declaration to appear before the statement | |
495 | containing the conditional. When generating template code, we want the | |
350fae66 | 496 | conditional to be rendered as the raw DECL_EXPR. */ |
325c3691 RH |
497 | |
498 | static void | |
caf2523d | 499 | begin_cond (tree *cond_p) |
325c3691 | 500 | { |
caf2523d RH |
501 | if (processing_template_decl) |
502 | *cond_p = push_stmt_list (); | |
503 | } | |
504 | ||
505 | /* Finish such a conditional. */ | |
506 | ||
507 | static void | |
508 | finish_cond (tree *cond_p, tree expr) | |
509 | { | |
510 | if (processing_template_decl) | |
35b1567d | 511 | { |
caf2523d | 512 | tree cond = pop_stmt_list (*cond_p); |
350fae66 | 513 | if (TREE_CODE (cond) == DECL_EXPR) |
caf2523d | 514 | expr = cond; |
5d80a306 | 515 | |
7b3e2d46 | 516 | if (check_for_bare_parameter_packs (expr)) |
4439d02f | 517 | *cond_p = error_mark_node; |
35b1567d | 518 | } |
caf2523d | 519 | *cond_p = expr; |
35b1567d BC |
520 | } |
521 | ||
325c3691 RH |
522 | /* If *COND_P specifies a conditional with a declaration, transform the |
523 | loop such that | |
0cbd7506 MS |
524 | while (A x = 42) { } |
525 | for (; A x = 42;) { } | |
325c3691 | 526 | becomes |
0cbd7506 MS |
527 | while (true) { A x = 42; if (!x) break; } |
528 | for (;;) { A x = 42; if (!x) break; } | |
caf2523d RH |
529 | The statement list for BODY will be empty if the conditional did |
530 | not declare anything. */ | |
c8094d83 | 531 | |
325c3691 | 532 | static void |
caf2523d | 533 | simplify_loop_decl_cond (tree *cond_p, tree body) |
325c3691 | 534 | { |
caf2523d | 535 | tree cond, if_stmt; |
325c3691 | 536 | |
caf2523d RH |
537 | if (!TREE_SIDE_EFFECTS (body)) |
538 | return; | |
325c3691 | 539 | |
caf2523d RH |
540 | cond = *cond_p; |
541 | *cond_p = boolean_true_node; | |
c8094d83 | 542 | |
caf2523d | 543 | if_stmt = begin_if_stmt (); |
5ade1ed2 | 544 | cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error); |
caf2523d RH |
545 | finish_if_stmt_cond (cond, if_stmt); |
546 | finish_break_stmt (); | |
547 | finish_then_clause (if_stmt); | |
548 | finish_if_stmt (if_stmt); | |
549 | } | |
325c3691 | 550 | |
35b1567d BC |
551 | /* Finish a goto-statement. */ |
552 | ||
3e4d04a1 | 553 | tree |
3a978d72 | 554 | finish_goto_stmt (tree destination) |
35b1567d BC |
555 | { |
556 | if (TREE_CODE (destination) == IDENTIFIER_NODE) | |
557 | destination = lookup_label (destination); | |
558 | ||
559 | /* We warn about unused labels with -Wunused. That means we have to | |
560 | mark the used labels as used. */ | |
561 | if (TREE_CODE (destination) == LABEL_DECL) | |
562 | TREE_USED (destination) = 1; | |
fc2b8477 MM |
563 | else |
564 | { | |
84628aa8 | 565 | destination = mark_rvalue_use (destination); |
fc2b8477 | 566 | if (!processing_template_decl) |
f5651df1 | 567 | { |
f5651df1 JJ |
568 | destination = cp_convert (ptr_type_node, destination); |
569 | if (error_operand_p (destination)) | |
570 | return NULL_TREE; | |
571 | } | |
fc2b8477 | 572 | } |
c8094d83 | 573 | |
35b1567d BC |
574 | check_goto (destination); |
575 | ||
c2255bc4 | 576 | return add_stmt (build_stmt (input_location, GOTO_EXPR, destination)); |
35b1567d BC |
577 | } |
578 | ||
ed5511d9 | 579 | /* COND is the condition-expression for an if, while, etc., |
d4033c81 MLI |
580 | statement. Convert it to a boolean value, if appropriate. |
581 | In addition, verify sequence points if -Wsequence-point is enabled. */ | |
ed5511d9 | 582 | |
8ce33230 | 583 | static tree |
3a978d72 | 584 | maybe_convert_cond (tree cond) |
ed5511d9 MM |
585 | { |
586 | /* Empty conditions remain empty. */ | |
587 | if (!cond) | |
588 | return NULL_TREE; | |
589 | ||
590 | /* Wait until we instantiate templates before doing conversion. */ | |
591 | if (processing_template_decl) | |
592 | return cond; | |
593 | ||
d4033c81 MLI |
594 | if (warn_sequence_point) |
595 | verify_sequence_points (cond); | |
596 | ||
ed5511d9 MM |
597 | /* Do the conversion. */ |
598 | cond = convert_from_reference (cond); | |
fbc8d2d3 ILT |
599 | |
600 | if (TREE_CODE (cond) == MODIFY_EXPR | |
601 | && !TREE_NO_WARNING (cond) | |
602 | && warn_parentheses) | |
603 | { | |
604 | warning (OPT_Wparentheses, | |
605 | "suggest parentheses around assignment used as truth value"); | |
606 | TREE_NO_WARNING (cond) = 1; | |
607 | } | |
608 | ||
ed5511d9 MM |
609 | return condition_conversion (cond); |
610 | } | |
611 | ||
9bfadf57 | 612 | /* Finish an expression-statement, whose EXPRESSION is as indicated. */ |
a7e4cfa0 | 613 | |
3e4d04a1 | 614 | tree |
3a978d72 | 615 | finish_expr_stmt (tree expr) |
ad321293 | 616 | { |
3e4d04a1 RH |
617 | tree r = NULL_TREE; |
618 | ||
ce4a0391 | 619 | if (expr != NULL_TREE) |
ad321293 | 620 | { |
a5bcc582 | 621 | if (!processing_template_decl) |
3a5b9284 RH |
622 | { |
623 | if (warn_sequence_point) | |
624 | verify_sequence_points (expr); | |
ebeb2c24 | 625 | expr = convert_to_void (expr, ICV_STATEMENT, tf_warning_or_error); |
3a5b9284 | 626 | } |
47d4c811 | 627 | else if (!type_dependent_expression_p (expr)) |
ebeb2c24 | 628 | convert_to_void (build_non_dependent_expr (expr), ICV_STATEMENT, |
5ade1ed2 | 629 | tf_warning_or_error); |
325c3691 | 630 | |
7b3e2d46 | 631 | if (check_for_bare_parameter_packs (expr)) |
4439d02f | 632 | expr = error_mark_node; |
5d80a306 | 633 | |
325c3691 | 634 | /* Simplification of inner statement expressions, compound exprs, |
ca5b80f3 | 635 | etc can result in us already having an EXPR_STMT. */ |
543a0daa RH |
636 | if (TREE_CODE (expr) != CLEANUP_POINT_EXPR) |
637 | { | |
638 | if (TREE_CODE (expr) != EXPR_STMT) | |
c2255bc4 | 639 | expr = build_stmt (input_location, EXPR_STMT, expr); |
0ad28dde | 640 | expr = maybe_cleanup_point_expr_void (expr); |
543a0daa RH |
641 | } |
642 | ||
325c3691 | 643 | r = add_stmt (expr); |
35b1567d | 644 | } |
364460b6 | 645 | |
35b1567d | 646 | finish_stmt (); |
558475f0 | 647 | |
3e4d04a1 | 648 | return r; |
35b1567d BC |
649 | } |
650 | ||
35b1567d | 651 | |
ad321293 MM |
652 | /* Begin an if-statement. Returns a newly created IF_STMT if |
653 | appropriate. */ | |
654 | ||
655 | tree | |
3a978d72 | 656 | begin_if_stmt (void) |
ad321293 | 657 | { |
325c3691 RH |
658 | tree r, scope; |
659 | scope = do_pushlevel (sk_block); | |
545f261b NF |
660 | r = build_stmt (input_location, IF_STMT, NULL_TREE, |
661 | NULL_TREE, NULL_TREE, scope); | |
caf2523d | 662 | begin_cond (&IF_COND (r)); |
ad321293 MM |
663 | return r; |
664 | } | |
665 | ||
666 | /* Process the COND of an if-statement, which may be given by | |
667 | IF_STMT. */ | |
668 | ||
c8094d83 | 669 | void |
3a978d72 | 670 | finish_if_stmt_cond (tree cond, tree if_stmt) |
ad321293 | 671 | { |
caf2523d RH |
672 | finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond)); |
673 | add_stmt (if_stmt); | |
325c3691 | 674 | THEN_CLAUSE (if_stmt) = push_stmt_list (); |
ad321293 MM |
675 | } |
676 | ||
677 | /* Finish the then-clause of an if-statement, which may be given by | |
678 | IF_STMT. */ | |
679 | ||
680 | tree | |
3a978d72 | 681 | finish_then_clause (tree if_stmt) |
ad321293 | 682 | { |
325c3691 | 683 | THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt)); |
35b1567d | 684 | return if_stmt; |
ad321293 MM |
685 | } |
686 | ||
687 | /* Begin the else-clause of an if-statement. */ | |
688 | ||
325c3691 RH |
689 | void |
690 | begin_else_clause (tree if_stmt) | |
ad321293 | 691 | { |
325c3691 | 692 | ELSE_CLAUSE (if_stmt) = push_stmt_list (); |
ad321293 MM |
693 | } |
694 | ||
695 | /* Finish the else-clause of an if-statement, which may be given by | |
696 | IF_STMT. */ | |
697 | ||
698 | void | |
3a978d72 | 699 | finish_else_clause (tree if_stmt) |
ad321293 | 700 | { |
325c3691 | 701 | ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt)); |
ad321293 MM |
702 | } |
703 | ||
dfbb4f34 | 704 | /* Finish an if-statement. */ |
ad321293 | 705 | |
c8094d83 | 706 | void |
325c3691 | 707 | finish_if_stmt (tree if_stmt) |
ad321293 | 708 | { |
545f261b NF |
709 | tree scope = IF_SCOPE (if_stmt); |
710 | IF_SCOPE (if_stmt) = NULL; | |
325c3691 | 711 | add_stmt (do_poplevel (scope)); |
ad321293 | 712 | finish_stmt (); |
35b1567d BC |
713 | } |
714 | ||
ad321293 MM |
715 | /* Begin a while-statement. Returns a newly created WHILE_STMT if |
716 | appropriate. */ | |
717 | ||
718 | tree | |
3a978d72 | 719 | begin_while_stmt (void) |
ad321293 MM |
720 | { |
721 | tree r; | |
c2255bc4 | 722 | r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE); |
ae499cce | 723 | add_stmt (r); |
325c3691 | 724 | WHILE_BODY (r) = do_pushlevel (sk_block); |
caf2523d | 725 | begin_cond (&WHILE_COND (r)); |
ad321293 MM |
726 | return r; |
727 | } | |
728 | ||
27d26ee7 | 729 | /* Process the COND of a while-statement, which may be given by |
ad321293 MM |
730 | WHILE_STMT. */ |
731 | ||
c8094d83 | 732 | void |
3a978d72 | 733 | finish_while_stmt_cond (tree cond, tree while_stmt) |
ad321293 | 734 | { |
caf2523d RH |
735 | finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond)); |
736 | simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt)); | |
ad321293 MM |
737 | } |
738 | ||
739 | /* Finish a while-statement, which may be given by WHILE_STMT. */ | |
740 | ||
c8094d83 | 741 | void |
3a978d72 | 742 | finish_while_stmt (tree while_stmt) |
ad321293 | 743 | { |
325c3691 | 744 | WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt)); |
ad321293 MM |
745 | finish_stmt (); |
746 | } | |
747 | ||
748 | /* Begin a do-statement. Returns a newly created DO_STMT if | |
749 | appropriate. */ | |
750 | ||
751 | tree | |
3a978d72 | 752 | begin_do_stmt (void) |
ad321293 | 753 | { |
c2255bc4 | 754 | tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE); |
ae499cce | 755 | add_stmt (r); |
325c3691 | 756 | DO_BODY (r) = push_stmt_list (); |
35b1567d | 757 | return r; |
ad321293 MM |
758 | } |
759 | ||
760 | /* Finish the body of a do-statement, which may be given by DO_STMT. */ | |
761 | ||
762 | void | |
3a978d72 | 763 | finish_do_body (tree do_stmt) |
ad321293 | 764 | { |
62e00e94 DM |
765 | tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt)); |
766 | ||
767 | if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body)) | |
768 | body = STATEMENT_LIST_TAIL (body)->stmt; | |
769 | ||
770 | if (IS_EMPTY_STMT (body)) | |
771 | warning (OPT_Wempty_body, | |
772 | "suggest explicit braces around empty body in %<do%> statement"); | |
ad321293 MM |
773 | } |
774 | ||
775 | /* Finish a do-statement, which may be given by DO_STMT, and whose | |
776 | COND is as indicated. */ | |
777 | ||
778 | void | |
3a978d72 | 779 | finish_do_stmt (tree cond, tree do_stmt) |
ad321293 | 780 | { |
ed5511d9 | 781 | cond = maybe_convert_cond (cond); |
35b1567d BC |
782 | DO_COND (do_stmt) = cond; |
783 | finish_stmt (); | |
784 | } | |
ed5511d9 | 785 | |
ad321293 MM |
786 | /* Finish a return-statement. The EXPRESSION returned, if any, is as |
787 | indicated. */ | |
788 | ||
3e4d04a1 | 789 | tree |
3a978d72 | 790 | finish_return_stmt (tree expr) |
ad321293 | 791 | { |
3e4d04a1 | 792 | tree r; |
0c9b182b | 793 | bool no_warning; |
3e4d04a1 | 794 | |
0c9b182b | 795 | expr = check_return_expr (expr, &no_warning); |
1799e5d5 RH |
796 | |
797 | if (flag_openmp && !check_omp_return ()) | |
798 | return error_mark_node; | |
35b1567d | 799 | if (!processing_template_decl) |
efee38a9 | 800 | { |
d4033c81 MLI |
801 | if (warn_sequence_point) |
802 | verify_sequence_points (expr); | |
803 | ||
44d10c10 | 804 | if (DECL_DESTRUCTOR_P (current_function_decl) |
c8094d83 | 805 | || (DECL_CONSTRUCTOR_P (current_function_decl) |
44d10c10 | 806 | && targetm.cxx.cdtor_returns_this ())) |
efee38a9 MM |
807 | { |
808 | /* Similarly, all destructors must run destructors for | |
809 | base-classes before returning. So, all returns in a | |
dfbb4f34 | 810 | destructor get sent to the DTOR_LABEL; finish_function emits |
efee38a9 | 811 | code to return a value there. */ |
44d10c10 | 812 | return finish_goto_stmt (cdtor_label); |
efee38a9 MM |
813 | } |
814 | } | |
543a0daa | 815 | |
c2255bc4 | 816 | r = build_stmt (input_location, RETURN_EXPR, expr); |
0c9b182b | 817 | TREE_NO_WARNING (r) |= no_warning; |
0ad28dde | 818 | r = maybe_cleanup_point_expr_void (r); |
543a0daa | 819 | r = add_stmt (r); |
35b1567d | 820 | finish_stmt (); |
3e4d04a1 RH |
821 | |
822 | return r; | |
35b1567d | 823 | } |
efee38a9 | 824 | |
3f43ac31 RRC |
825 | /* Begin the scope of a for-statement or a range-for-statement. |
826 | Both the returned trees are to be used in a call to | |
827 | begin_for_stmt or begin_range_for_stmt. */ | |
ad321293 MM |
828 | |
829 | tree | |
3f43ac31 RRC |
830 | begin_for_scope (tree *init) |
831 | { | |
832 | tree scope = NULL_TREE; | |
833 | if (flag_new_for_scope > 0) | |
834 | scope = do_pushlevel (sk_for); | |
835 | ||
836 | if (processing_template_decl) | |
837 | *init = push_stmt_list (); | |
838 | else | |
839 | *init = NULL_TREE; | |
840 | ||
841 | return scope; | |
842 | } | |
843 | ||
844 | /* Begin a for-statement. Returns a new FOR_STMT. | |
845 | SCOPE and INIT should be the return of begin_for_scope, | |
846 | or both NULL_TREE */ | |
847 | ||
848 | tree | |
849 | begin_for_stmt (tree scope, tree init) | |
ad321293 MM |
850 | { |
851 | tree r; | |
852 | ||
c2255bc4 | 853 | r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE, |
40e71fc7 | 854 | NULL_TREE, NULL_TREE, NULL_TREE); |
325c3691 | 855 | |
3f43ac31 RRC |
856 | if (scope == NULL_TREE) |
857 | { | |
95cc031f JJ |
858 | gcc_assert (!init || !(flag_new_for_scope > 0)); |
859 | if (!init) | |
860 | scope = begin_for_scope (&init); | |
3f43ac31 RRC |
861 | } |
862 | FOR_INIT_STMT (r) = init; | |
40e71fc7 | 863 | FOR_SCOPE (r) = scope; |
894ca2c9 | 864 | |
ad321293 MM |
865 | return r; |
866 | } | |
867 | ||
868 | /* Finish the for-init-statement of a for-statement, which may be | |
869 | given by FOR_STMT. */ | |
870 | ||
871 | void | |
3a978d72 | 872 | finish_for_init_stmt (tree for_stmt) |
ad321293 | 873 | { |
894ca2c9 RH |
874 | if (processing_template_decl) |
875 | FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt)); | |
325c3691 RH |
876 | add_stmt (for_stmt); |
877 | FOR_BODY (for_stmt) = do_pushlevel (sk_block); | |
caf2523d | 878 | begin_cond (&FOR_COND (for_stmt)); |
ad321293 MM |
879 | } |
880 | ||
881 | /* Finish the COND of a for-statement, which may be given by | |
882 | FOR_STMT. */ | |
883 | ||
884 | void | |
3a978d72 | 885 | finish_for_cond (tree cond, tree for_stmt) |
ad321293 | 886 | { |
caf2523d RH |
887 | finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond)); |
888 | simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt)); | |
ad321293 MM |
889 | } |
890 | ||
891 | /* Finish the increment-EXPRESSION in a for-statement, which may be | |
892 | given by FOR_STMT. */ | |
893 | ||
894 | void | |
3a978d72 | 895 | finish_for_expr (tree expr, tree for_stmt) |
ad321293 | 896 | { |
543a0daa RH |
897 | if (!expr) |
898 | return; | |
6f69173e MM |
899 | /* If EXPR is an overloaded function, issue an error; there is no |
900 | context available to use to perform overload resolution. */ | |
543a0daa | 901 | if (type_unknown_p (expr)) |
6f69173e MM |
902 | { |
903 | cxx_incomplete_type_error (expr, TREE_TYPE (expr)); | |
904 | expr = error_mark_node; | |
905 | } | |
bcd46a7c AP |
906 | if (!processing_template_decl) |
907 | { | |
908 | if (warn_sequence_point) | |
0cbd7506 | 909 | verify_sequence_points (expr); |
ebeb2c24 | 910 | expr = convert_to_void (expr, ICV_THIRD_IN_FOR, |
5ade1ed2 | 911 | tf_warning_or_error); |
bcd46a7c AP |
912 | } |
913 | else if (!type_dependent_expression_p (expr)) | |
ebeb2c24 | 914 | convert_to_void (build_non_dependent_expr (expr), ICV_THIRD_IN_FOR, |
5ade1ed2 | 915 | tf_warning_or_error); |
0ad28dde | 916 | expr = maybe_cleanup_point_expr_void (expr); |
7b3e2d46 | 917 | if (check_for_bare_parameter_packs (expr)) |
4439d02f | 918 | expr = error_mark_node; |
35b1567d | 919 | FOR_EXPR (for_stmt) = expr; |
ad321293 MM |
920 | } |
921 | ||
922 | /* Finish the body of a for-statement, which may be given by | |
923 | FOR_STMT. The increment-EXPR for the loop must be | |
f9132eb7 RRC |
924 | provided. |
925 | It can also finish RANGE_FOR_STMT. */ | |
ad321293 MM |
926 | |
927 | void | |
3a978d72 | 928 | finish_for_stmt (tree for_stmt) |
ad321293 | 929 | { |
f9132eb7 | 930 | if (TREE_CODE (for_stmt) == RANGE_FOR_STMT) |
a8733ebf | 931 | RANGE_FOR_BODY (for_stmt) = do_poplevel (RANGE_FOR_BODY (for_stmt)); |
f9132eb7 | 932 | else |
a8733ebf | 933 | FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt)); |
325c3691 | 934 | |
ad321293 | 935 | /* Pop the scope for the body of the loop. */ |
a8733ebf | 936 | if (flag_new_for_scope > 0) |
325c3691 | 937 | { |
40e71fc7 NF |
938 | tree scope; |
939 | tree *scope_ptr = (TREE_CODE (for_stmt) == RANGE_FOR_STMT | |
940 | ? &RANGE_FOR_SCOPE (for_stmt) | |
941 | : &FOR_SCOPE (for_stmt)); | |
942 | scope = *scope_ptr; | |
943 | *scope_ptr = NULL; | |
325c3691 RH |
944 | add_stmt (do_poplevel (scope)); |
945 | } | |
946 | ||
c8094d83 | 947 | finish_stmt (); |
ad321293 MM |
948 | } |
949 | ||
f9132eb7 | 950 | /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT. |
3f43ac31 RRC |
951 | SCOPE and INIT should be the return of begin_for_scope, |
952 | or both NULL_TREE . | |
f9132eb7 RRC |
953 | To finish it call finish_for_stmt(). */ |
954 | ||
955 | tree | |
3f43ac31 | 956 | begin_range_for_stmt (tree scope, tree init) |
f9132eb7 RRC |
957 | { |
958 | tree r; | |
a8733ebf | 959 | |
f9132eb7 | 960 | r = build_stmt (input_location, RANGE_FOR_STMT, |
40e71fc7 | 961 | NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE); |
a8733ebf | 962 | |
3f43ac31 RRC |
963 | if (scope == NULL_TREE) |
964 | { | |
95cc031f JJ |
965 | gcc_assert (!init || !(flag_new_for_scope > 0)); |
966 | if (!init) | |
967 | scope = begin_for_scope (&init); | |
3f43ac31 RRC |
968 | } |
969 | ||
970 | /* RANGE_FOR_STMTs do not use nor save the init tree, so we | |
971 | pop it now. */ | |
972 | if (init) | |
973 | pop_stmt_list (init); | |
40e71fc7 | 974 | RANGE_FOR_SCOPE (r) = scope; |
f9132eb7 RRC |
975 | |
976 | return r; | |
977 | } | |
978 | ||
979 | /* Finish the head of a range-based for statement, which may | |
980 | be given by RANGE_FOR_STMT. DECL must be the declaration | |
981 | and EXPR must be the loop expression. */ | |
982 | ||
983 | void | |
984 | finish_range_for_decl (tree range_for_stmt, tree decl, tree expr) | |
985 | { | |
986 | RANGE_FOR_DECL (range_for_stmt) = decl; | |
987 | RANGE_FOR_EXPR (range_for_stmt) = expr; | |
988 | add_stmt (range_for_stmt); | |
989 | RANGE_FOR_BODY (range_for_stmt) = do_pushlevel (sk_block); | |
990 | } | |
991 | ||
ad321293 MM |
992 | /* Finish a break-statement. */ |
993 | ||
3e4d04a1 | 994 | tree |
3a978d72 | 995 | finish_break_stmt (void) |
ad321293 | 996 | { |
c2255bc4 | 997 | return add_stmt (build_stmt (input_location, BREAK_STMT)); |
35b1567d BC |
998 | } |
999 | ||
ad321293 MM |
1000 | /* Finish a continue-statement. */ |
1001 | ||
3e4d04a1 | 1002 | tree |
3a978d72 | 1003 | finish_continue_stmt (void) |
ad321293 | 1004 | { |
c2255bc4 | 1005 | return add_stmt (build_stmt (input_location, CONTINUE_STMT)); |
ad321293 MM |
1006 | } |
1007 | ||
35b1567d BC |
1008 | /* Begin a switch-statement. Returns a new SWITCH_STMT if |
1009 | appropriate. */ | |
1010 | ||
1011 | tree | |
3a978d72 | 1012 | begin_switch_stmt (void) |
35b1567d | 1013 | { |
325c3691 RH |
1014 | tree r, scope; |
1015 | ||
325c3691 | 1016 | scope = do_pushlevel (sk_block); |
1f18dbc6 NF |
1017 | r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE, scope); |
1018 | ||
ebaae582 | 1019 | begin_cond (&SWITCH_STMT_COND (r)); |
325c3691 | 1020 | |
527f0080 | 1021 | return r; |
ad321293 MM |
1022 | } |
1023 | ||
527f0080 | 1024 | /* Finish the cond of a switch-statement. */ |
ad321293 | 1025 | |
527f0080 | 1026 | void |
3a978d72 | 1027 | finish_switch_cond (tree cond, tree switch_stmt) |
ad321293 | 1028 | { |
6f9fdf4d | 1029 | tree orig_type = NULL; |
35b1567d | 1030 | if (!processing_template_decl) |
373eb3b3 | 1031 | { |
35b1567d | 1032 | /* Convert the condition to an integer or enumeration type. */ |
b746c5dc | 1033 | cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true); |
35b1567d | 1034 | if (cond == NULL_TREE) |
373eb3b3 | 1035 | { |
35b1567d BC |
1036 | error ("switch quantity not an integer"); |
1037 | cond = error_mark_node; | |
1038 | } | |
6f9fdf4d | 1039 | orig_type = TREE_TYPE (cond); |
35b1567d BC |
1040 | if (cond != error_mark_node) |
1041 | { | |
0a72704b MM |
1042 | /* [stmt.switch] |
1043 | ||
1044 | Integral promotions are performed. */ | |
1045 | cond = perform_integral_promotions (cond); | |
543a0daa | 1046 | cond = maybe_cleanup_point_expr (cond); |
373eb3b3 | 1047 | } |
ad321293 | 1048 | } |
7b3e2d46 | 1049 | if (check_for_bare_parameter_packs (cond)) |
4439d02f | 1050 | cond = error_mark_node; |
d4033c81 MLI |
1051 | else if (!processing_template_decl && warn_sequence_point) |
1052 | verify_sequence_points (cond); | |
1053 | ||
ebaae582 SB |
1054 | finish_cond (&SWITCH_STMT_COND (switch_stmt), cond); |
1055 | SWITCH_STMT_TYPE (switch_stmt) = orig_type; | |
caf2523d | 1056 | add_stmt (switch_stmt); |
56cb9733 | 1057 | push_switch (switch_stmt); |
ebaae582 | 1058 | SWITCH_STMT_BODY (switch_stmt) = push_stmt_list (); |
ad321293 MM |
1059 | } |
1060 | ||
1061 | /* Finish the body of a switch-statement, which may be given by | |
1062 | SWITCH_STMT. The COND to switch on is indicated. */ | |
1063 | ||
1064 | void | |
3a978d72 | 1065 | finish_switch_stmt (tree switch_stmt) |
ad321293 | 1066 | { |
325c3691 RH |
1067 | tree scope; |
1068 | ||
ebaae582 SB |
1069 | SWITCH_STMT_BODY (switch_stmt) = |
1070 | pop_stmt_list (SWITCH_STMT_BODY (switch_stmt)); | |
c8094d83 | 1071 | pop_switch (); |
ad321293 | 1072 | finish_stmt (); |
325c3691 | 1073 | |
1f18dbc6 NF |
1074 | scope = SWITCH_STMT_SCOPE (switch_stmt); |
1075 | SWITCH_STMT_SCOPE (switch_stmt) = NULL; | |
325c3691 | 1076 | add_stmt (do_poplevel (scope)); |
ad321293 MM |
1077 | } |
1078 | ||
ad321293 MM |
1079 | /* Begin a try-block. Returns a newly-created TRY_BLOCK if |
1080 | appropriate. */ | |
1081 | ||
1082 | tree | |
3a978d72 | 1083 | begin_try_block (void) |
ad321293 | 1084 | { |
c2255bc4 | 1085 | tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE); |
ae499cce | 1086 | add_stmt (r); |
325c3691 | 1087 | TRY_STMTS (r) = push_stmt_list (); |
35b1567d | 1088 | return r; |
ad321293 MM |
1089 | } |
1090 | ||
eaf6fb90 MM |
1091 | /* Likewise, for a function-try-block. The block returned in |
1092 | *COMPOUND_STMT is an artificial outer scope, containing the | |
1093 | function-try-block. */ | |
0dde4175 JM |
1094 | |
1095 | tree | |
eaf6fb90 | 1096 | begin_function_try_block (tree *compound_stmt) |
0dde4175 | 1097 | { |
eaf6fb90 MM |
1098 | tree r; |
1099 | /* This outer scope does not exist in the C++ standard, but we need | |
1100 | a place to put __FUNCTION__ and similar variables. */ | |
1101 | *compound_stmt = begin_compound_stmt (0); | |
1102 | r = begin_try_block (); | |
35b1567d | 1103 | FN_TRY_BLOCK_P (r) = 1; |
35b1567d | 1104 | return r; |
0dde4175 JM |
1105 | } |
1106 | ||
ad321293 MM |
1107 | /* Finish a try-block, which may be given by TRY_BLOCK. */ |
1108 | ||
1109 | void | |
3a978d72 | 1110 | finish_try_block (tree try_block) |
ad321293 | 1111 | { |
325c3691 RH |
1112 | TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block)); |
1113 | TRY_HANDLERS (try_block) = push_stmt_list (); | |
ad321293 MM |
1114 | } |
1115 | ||
efa8eda3 MM |
1116 | /* Finish the body of a cleanup try-block, which may be given by |
1117 | TRY_BLOCK. */ | |
1118 | ||
62409b39 | 1119 | void |
3a978d72 | 1120 | finish_cleanup_try_block (tree try_block) |
62409b39 | 1121 | { |
325c3691 | 1122 | TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block)); |
62409b39 MM |
1123 | } |
1124 | ||
f1dedc31 MM |
1125 | /* Finish an implicitly generated try-block, with a cleanup is given |
1126 | by CLEANUP. */ | |
1127 | ||
1128 | void | |
3a978d72 | 1129 | finish_cleanup (tree cleanup, tree try_block) |
f1dedc31 | 1130 | { |
35b1567d BC |
1131 | TRY_HANDLERS (try_block) = cleanup; |
1132 | CLEANUP_P (try_block) = 1; | |
f1dedc31 MM |
1133 | } |
1134 | ||
0dde4175 JM |
1135 | /* Likewise, for a function-try-block. */ |
1136 | ||
1137 | void | |
3a978d72 | 1138 | finish_function_try_block (tree try_block) |
0dde4175 | 1139 | { |
325c3691 RH |
1140 | finish_try_block (try_block); |
1141 | /* FIXME : something queer about CTOR_INITIALIZER somehow following | |
1142 | the try block, but moving it inside. */ | |
b35d4555 | 1143 | in_function_try_handler = 1; |
0dde4175 JM |
1144 | } |
1145 | ||
ad321293 MM |
1146 | /* Finish a handler-sequence for a try-block, which may be given by |
1147 | TRY_BLOCK. */ | |
1148 | ||
1149 | void | |
3a978d72 | 1150 | finish_handler_sequence (tree try_block) |
ad321293 | 1151 | { |
325c3691 | 1152 | TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block)); |
35b1567d | 1153 | check_handlers (TRY_HANDLERS (try_block)); |
ad321293 MM |
1154 | } |
1155 | ||
eaf6fb90 MM |
1156 | /* Finish the handler-seq for a function-try-block, given by |
1157 | TRY_BLOCK. COMPOUND_STMT is the outer block created by | |
1158 | begin_function_try_block. */ | |
0dde4175 JM |
1159 | |
1160 | void | |
eaf6fb90 | 1161 | finish_function_handler_sequence (tree try_block, tree compound_stmt) |
0dde4175 | 1162 | { |
b35d4555 | 1163 | in_function_try_handler = 0; |
325c3691 | 1164 | finish_handler_sequence (try_block); |
eaf6fb90 | 1165 | finish_compound_stmt (compound_stmt); |
35b1567d BC |
1166 | } |
1167 | ||
ad321293 MM |
1168 | /* Begin a handler. Returns a HANDLER if appropriate. */ |
1169 | ||
1170 | tree | |
3a978d72 | 1171 | begin_handler (void) |
ad321293 MM |
1172 | { |
1173 | tree r; | |
325c3691 | 1174 | |
c2255bc4 | 1175 | r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE); |
ae499cce | 1176 | add_stmt (r); |
325c3691 | 1177 | |
1a6025b4 JM |
1178 | /* Create a binding level for the eh_info and the exception object |
1179 | cleanup. */ | |
325c3691 RH |
1180 | HANDLER_BODY (r) = do_pushlevel (sk_catch); |
1181 | ||
ad321293 MM |
1182 | return r; |
1183 | } | |
1184 | ||
1185 | /* Finish the handler-parameters for a handler, which may be given by | |
b35d4555 MM |
1186 | HANDLER. DECL is the declaration for the catch parameter, or NULL |
1187 | if this is a `catch (...)' clause. */ | |
ad321293 | 1188 | |
1a6025b4 | 1189 | void |
3a978d72 | 1190 | finish_handler_parms (tree decl, tree handler) |
b35d4555 | 1191 | { |
1a6025b4 | 1192 | tree type = NULL_TREE; |
b35d4555 MM |
1193 | if (processing_template_decl) |
1194 | { | |
1195 | if (decl) | |
1196 | { | |
1197 | decl = pushdecl (decl); | |
1198 | decl = push_template_decl (decl); | |
325c3691 | 1199 | HANDLER_PARMS (handler) = decl; |
1a6025b4 | 1200 | type = TREE_TYPE (decl); |
b35d4555 MM |
1201 | } |
1202 | } | |
35b1567d | 1203 | else |
1a6025b4 | 1204 | type = expand_start_catch_block (decl); |
1a6025b4 | 1205 | HANDLER_TYPE (handler) = type; |
b80cfdcd | 1206 | if (!processing_template_decl && type) |
6cad4e17 | 1207 | mark_used (eh_type_info (type)); |
35b1567d BC |
1208 | } |
1209 | ||
1210 | /* Finish a handler, which may be given by HANDLER. The BLOCKs are | |
1211 | the return value from the matching call to finish_handler_parms. */ | |
1212 | ||
1213 | void | |
3a978d72 | 1214 | finish_handler (tree handler) |
35b1567d BC |
1215 | { |
1216 | if (!processing_template_decl) | |
1a6025b4 | 1217 | expand_end_catch_block (); |
325c3691 | 1218 | HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler)); |
35b1567d BC |
1219 | } |
1220 | ||
5882f0f3 | 1221 | /* Begin a compound statement. FLAGS contains some bits that control the |
5995ebfb | 1222 | behavior and context. If BCS_NO_SCOPE is set, the compound statement |
5882f0f3 | 1223 | does not define a scope. If BCS_FN_BODY is set, this is the outermost |
c8094d83 | 1224 | block of a function. If BCS_TRY_BLOCK is set, this is the block |
5882f0f3 RH |
1225 | created on behalf of a TRY statement. Returns a token to be passed to |
1226 | finish_compound_stmt. */ | |
ad321293 MM |
1227 | |
1228 | tree | |
325c3691 | 1229 | begin_compound_stmt (unsigned int flags) |
ad321293 | 1230 | { |
325c3691 | 1231 | tree r; |
558475f0 | 1232 | |
325c3691 RH |
1233 | if (flags & BCS_NO_SCOPE) |
1234 | { | |
1235 | r = push_stmt_list (); | |
1236 | STATEMENT_LIST_NO_SCOPE (r) = 1; | |
1237 | ||
1238 | /* Normally, we try hard to keep the BLOCK for a statement-expression. | |
1239 | But, if it's a statement-expression with a scopeless block, there's | |
1240 | nothing to keep, and we don't want to accidentally keep a block | |
c8094d83 | 1241 | *inside* the scopeless block. */ |
325c3691 RH |
1242 | keep_next_level (false); |
1243 | } | |
f1dedc31 | 1244 | else |
325c3691 RH |
1245 | r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block); |
1246 | ||
5882f0f3 RH |
1247 | /* When processing a template, we need to remember where the braces were, |
1248 | so that we can set up identical scopes when instantiating the template | |
1249 | later. BIND_EXPR is a handy candidate for this. | |
1250 | Note that do_poplevel won't create a BIND_EXPR itself here (and thus | |
1251 | result in nested BIND_EXPRs), since we don't build BLOCK nodes when | |
1252 | processing templates. */ | |
1253 | if (processing_template_decl) | |
325c3691 | 1254 | { |
f293ce4b | 1255 | r = build3 (BIND_EXPR, NULL, NULL, r, NULL); |
5882f0f3 RH |
1256 | BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0; |
1257 | BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0; | |
325c3691 RH |
1258 | TREE_SIDE_EFFECTS (r) = 1; |
1259 | } | |
ad321293 MM |
1260 | |
1261 | return r; | |
1262 | } | |
1263 | ||
5882f0f3 | 1264 | /* Finish a compound-statement, which is given by STMT. */ |
ad321293 | 1265 | |
325c3691 RH |
1266 | void |
1267 | finish_compound_stmt (tree stmt) | |
ad321293 | 1268 | { |
5882f0f3 | 1269 | if (TREE_CODE (stmt) == BIND_EXPR) |
e02927a1 JM |
1270 | { |
1271 | tree body = do_poplevel (BIND_EXPR_BODY (stmt)); | |
1272 | /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special, | |
1273 | discard the BIND_EXPR so it can be merged with the containing | |
1274 | STATEMENT_LIST. */ | |
1275 | if (TREE_CODE (body) == STATEMENT_LIST | |
1276 | && STATEMENT_LIST_HEAD (body) == NULL | |
1277 | && !BIND_EXPR_BODY_BLOCK (stmt) | |
1278 | && !BIND_EXPR_TRY_BLOCK (stmt)) | |
1279 | stmt = body; | |
1280 | else | |
1281 | BIND_EXPR_BODY (stmt) = body; | |
1282 | } | |
325c3691 RH |
1283 | else if (STATEMENT_LIST_NO_SCOPE (stmt)) |
1284 | stmt = pop_stmt_list (stmt); | |
7a3397c7 | 1285 | else |
5f070bc7 ZL |
1286 | { |
1287 | /* Destroy any ObjC "super" receivers that may have been | |
1288 | created. */ | |
1289 | objc_clear_super_receiver (); | |
1290 | ||
1291 | stmt = do_poplevel (stmt); | |
1292 | } | |
ad321293 | 1293 | |
325c3691 RH |
1294 | /* ??? See c_end_compound_stmt wrt statement expressions. */ |
1295 | add_stmt (stmt); | |
ad321293 | 1296 | finish_stmt (); |
ad321293 MM |
1297 | } |
1298 | ||
6de9cd9a | 1299 | /* Finish an asm-statement, whose components are a STRING, some |
1c384bf1 RH |
1300 | OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some |
1301 | LABELS. Also note whether the asm-statement should be | |
1302 | considered volatile. */ | |
7dc5bd62 | 1303 | |
3e4d04a1 | 1304 | tree |
6de9cd9a | 1305 | finish_asm_stmt (int volatile_p, tree string, tree output_operands, |
1c384bf1 | 1306 | tree input_operands, tree clobbers, tree labels) |
35b1567d BC |
1307 | { |
1308 | tree r; | |
abfc8a36 | 1309 | tree t; |
5544530a PB |
1310 | int ninputs = list_length (input_operands); |
1311 | int noutputs = list_length (output_operands); | |
abfc8a36 | 1312 | |
abfc8a36 | 1313 | if (!processing_template_decl) |
40b18c0a | 1314 | { |
74f0c611 RH |
1315 | const char *constraint; |
1316 | const char **oconstraints; | |
1317 | bool allows_mem, allows_reg, is_inout; | |
1318 | tree operand; | |
40b18c0a | 1319 | int i; |
40b18c0a | 1320 | |
86b8fed1 | 1321 | oconstraints = XALLOCAVEC (const char *, noutputs); |
74f0c611 RH |
1322 | |
1323 | string = resolve_asm_operand_names (string, output_operands, | |
1c384bf1 | 1324 | input_operands, labels); |
74f0c611 RH |
1325 | |
1326 | for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i) | |
40b18c0a | 1327 | { |
74f0c611 RH |
1328 | operand = TREE_VALUE (t); |
1329 | ||
1330 | /* ??? Really, this should not be here. Users should be using a | |
1331 | proper lvalue, dammit. But there's a long history of using | |
1332 | casts in the output operands. In cases like longlong.h, this | |
1333 | becomes a primitive form of typechecking -- if the cast can be | |
1334 | removed, then the output operand had a type of the proper width; | |
1335 | otherwise we'll get an error. Gross, but ... */ | |
1336 | STRIP_NOPS (operand); | |
1337 | ||
03a904b5 JJ |
1338 | operand = mark_lvalue_use (operand); |
1339 | ||
5ade1ed2 | 1340 | if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error)) |
74f0c611 RH |
1341 | operand = error_mark_node; |
1342 | ||
3db45ab5 | 1343 | if (operand != error_mark_node |
5544530a PB |
1344 | && (TREE_READONLY (operand) |
1345 | || CP_TYPE_CONST_P (TREE_TYPE (operand)) | |
3db45ab5 MS |
1346 | /* Functions are not modifiable, even though they are |
1347 | lvalues. */ | |
1348 | || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE | |
1349 | || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE | |
1350 | /* If it's an aggregate and any field is const, then it is | |
1351 | effectively const. */ | |
1352 | || (CLASS_TYPE_P (TREE_TYPE (operand)) | |
1353 | && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand))))) | |
4816c593 | 1354 | cxx_readonly_error (operand, lv_asm); |
5544530a | 1355 | |
74f0c611 RH |
1356 | constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t))); |
1357 | oconstraints[i] = constraint; | |
1358 | ||
1359 | if (parse_output_constraint (&constraint, i, ninputs, noutputs, | |
1360 | &allows_mem, &allows_reg, &is_inout)) | |
1361 | { | |
1362 | /* If the operand is going to end up in memory, | |
1363 | mark it addressable. */ | |
1364 | if (!allows_reg && !cxx_mark_addressable (operand)) | |
1365 | operand = error_mark_node; | |
1366 | } | |
1367 | else | |
1368 | operand = error_mark_node; | |
1369 | ||
1370 | TREE_VALUE (t) = operand; | |
1371 | } | |
1372 | ||
1373 | for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t)) | |
1374 | { | |
1375 | constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t))); | |
c8094d83 | 1376 | operand = decay_conversion (TREE_VALUE (t)); |
74f0c611 | 1377 | |
40b18c0a MM |
1378 | /* If the type of the operand hasn't been determined (e.g., |
1379 | because it involves an overloaded function), then issue | |
1380 | an error message. There's no context available to | |
1381 | resolve the overloading. */ | |
74f0c611 | 1382 | if (TREE_TYPE (operand) == unknown_type_node) |
40b18c0a | 1383 | { |
c8094d83 | 1384 | error ("type of asm operand %qE could not be determined", |
0cbd7506 | 1385 | TREE_VALUE (t)); |
74f0c611 | 1386 | operand = error_mark_node; |
40b18c0a | 1387 | } |
40b18c0a | 1388 | |
74f0c611 RH |
1389 | if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0, |
1390 | oconstraints, &allows_mem, &allows_reg)) | |
40b18c0a | 1391 | { |
74f0c611 RH |
1392 | /* If the operand is going to end up in memory, |
1393 | mark it addressable. */ | |
b4c33883 AP |
1394 | if (!allows_reg && allows_mem) |
1395 | { | |
1396 | /* Strip the nops as we allow this case. FIXME, this really | |
1397 | should be rejected or made deprecated. */ | |
1398 | STRIP_NOPS (operand); | |
1399 | if (!cxx_mark_addressable (operand)) | |
1400 | operand = error_mark_node; | |
1401 | } | |
40b18c0a | 1402 | } |
74f0c611 RH |
1403 | else |
1404 | operand = error_mark_node; | |
40b18c0a | 1405 | |
74f0c611 | 1406 | TREE_VALUE (t) = operand; |
40b18c0a MM |
1407 | } |
1408 | } | |
abfc8a36 | 1409 | |
c2255bc4 | 1410 | r = build_stmt (input_location, ASM_EXPR, string, |
0dfdeca6 | 1411 | output_operands, input_operands, |
1c384bf1 | 1412 | clobbers, labels); |
5544530a | 1413 | ASM_VOLATILE_P (r) = volatile_p || noutputs == 0; |
0ad28dde | 1414 | r = maybe_cleanup_point_expr_void (r); |
3e4d04a1 | 1415 | return add_stmt (r); |
ad321293 | 1416 | } |
b4c4a9ec | 1417 | |
5bca4e80 | 1418 | /* Finish a label with the indicated NAME. Returns the new label. */ |
f01b0acb | 1419 | |
a723baf1 | 1420 | tree |
3a978d72 | 1421 | finish_label_stmt (tree name) |
f01b0acb | 1422 | { |
5b030314 | 1423 | tree decl = define_label (input_location, name); |
417fa55b | 1424 | |
5bca4e80 | 1425 | if (decl == error_mark_node) |
417fa55b LM |
1426 | return error_mark_node; |
1427 | ||
c2255bc4 | 1428 | add_stmt (build_stmt (input_location, LABEL_EXPR, decl)); |
5bca4e80 ILT |
1429 | |
1430 | return decl; | |
f01b0acb MM |
1431 | } |
1432 | ||
acef433b MM |
1433 | /* Finish a series of declarations for local labels. G++ allows users |
1434 | to declare "local" labels, i.e., labels with scope. This extension | |
1435 | is useful when writing code involving statement-expressions. */ | |
1436 | ||
1437 | void | |
3a978d72 | 1438 | finish_label_decl (tree name) |
acef433b | 1439 | { |
a6d76a95 PC |
1440 | if (!at_function_scope_p ()) |
1441 | { | |
1442 | error ("__label__ declarations are only allowed in function scopes"); | |
1443 | return; | |
1444 | } | |
1445 | ||
1446 | add_decl_expr (declare_local_label (name)); | |
acef433b MM |
1447 | } |
1448 | ||
659e5a7a | 1449 | /* When DECL goes out of scope, make sure that CLEANUP is executed. */ |
f1dedc31 | 1450 | |
c8094d83 | 1451 | void |
3a978d72 | 1452 | finish_decl_cleanup (tree decl, tree cleanup) |
f1dedc31 | 1453 | { |
325c3691 | 1454 | push_cleanup (decl, cleanup, false); |
35b1567d BC |
1455 | } |
1456 | ||
659e5a7a | 1457 | /* If the current scope exits with an exception, run CLEANUP. */ |
24bef158 | 1458 | |
659e5a7a | 1459 | void |
3a978d72 | 1460 | finish_eh_cleanup (tree cleanup) |
24bef158 | 1461 | { |
325c3691 | 1462 | push_cleanup (NULL, cleanup, true); |
35b1567d BC |
1463 | } |
1464 | ||
2282d28d MM |
1465 | /* The MEM_INITS is a list of mem-initializers, in reverse of the |
1466 | order they were written by the user. Each node is as for | |
1467 | emit_mem_initializers. */ | |
bf3428d0 MM |
1468 | |
1469 | void | |
2282d28d | 1470 | finish_mem_initializers (tree mem_inits) |
bf3428d0 | 1471 | { |
2282d28d MM |
1472 | /* Reorder the MEM_INITS so that they are in the order they appeared |
1473 | in the source program. */ | |
1474 | mem_inits = nreverse (mem_inits); | |
bf3428d0 | 1475 | |
a0de9d20 | 1476 | if (processing_template_decl) |
5d80a306 DG |
1477 | { |
1478 | tree mem; | |
1479 | ||
1480 | for (mem = mem_inits; mem; mem = TREE_CHAIN (mem)) | |
1481 | { | |
1482 | /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the | |
1483 | check for bare parameter packs in the TREE_VALUE, because | |
1484 | any parameter packs in the TREE_VALUE have already been | |
1485 | bound as part of the TREE_PURPOSE. See | |
1486 | make_pack_expansion for more information. */ | |
4439d02f | 1487 | if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION |
7b3e2d46 | 1488 | && check_for_bare_parameter_packs (TREE_VALUE (mem))) |
4439d02f | 1489 | TREE_VALUE (mem) = error_mark_node; |
5d80a306 DG |
1490 | } |
1491 | ||
1492 | add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits)); | |
1493 | } | |
cdd2559c | 1494 | else |
2282d28d | 1495 | emit_mem_initializers (mem_inits); |
558475f0 MM |
1496 | } |
1497 | ||
b4c4a9ec MM |
1498 | /* Finish a parenthesized expression EXPR. */ |
1499 | ||
1500 | tree | |
3a978d72 | 1501 | finish_parenthesized_expr (tree expr) |
b4c4a9ec | 1502 | { |
6615c446 | 1503 | if (EXPR_P (expr)) |
78ef5b89 | 1504 | /* This inhibits warnings in c_common_truthvalue_conversion. */ |
31ec7d2f | 1505 | TREE_NO_WARNING (expr) = 1; |
b4c4a9ec | 1506 | |
19420d00 NS |
1507 | if (TREE_CODE (expr) == OFFSET_REF) |
1508 | /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be | |
1509 | enclosed in parentheses. */ | |
1510 | PTRMEM_OK_P (expr) = 0; | |
c8094d83 | 1511 | |
7a8380ae NS |
1512 | if (TREE_CODE (expr) == STRING_CST) |
1513 | PAREN_STRING_LITERAL_P (expr) = 1; | |
c8094d83 | 1514 | |
b4c4a9ec MM |
1515 | return expr; |
1516 | } | |
1517 | ||
a723baf1 MM |
1518 | /* Finish a reference to a non-static data member (DECL) that is not |
1519 | preceded by `.' or `->'. */ | |
1520 | ||
1521 | tree | |
a3f10e50 | 1522 | finish_non_static_data_member (tree decl, tree object, tree qualifying_scope) |
a723baf1 | 1523 | { |
50bc768d | 1524 | gcc_assert (TREE_CODE (decl) == FIELD_DECL); |
a723baf1 | 1525 | |
2defb926 | 1526 | if (!object) |
51fc2d02 | 1527 | { |
51fc2d02 JM |
1528 | tree scope = qualifying_scope; |
1529 | if (scope == NULL_TREE) | |
1530 | scope = context_for_name_lookup (decl); | |
1531 | object = maybe_dummy_object (scope, NULL); | |
1532 | } | |
1533 | ||
1496e7d6 PC |
1534 | if (object == error_mark_node) |
1535 | return error_mark_node; | |
1536 | ||
2defb926 JM |
1537 | /* DR 613: Can use non-static data members without an associated |
1538 | object in sizeof/decltype/alignof. */ | |
1539 | if (is_dummy_object (object) && cp_unevaluated_operand == 0 | |
1540 | && (!processing_template_decl || !current_class_ref)) | |
a723baf1 | 1541 | { |
c8094d83 | 1542 | if (current_function_decl |
a723baf1 | 1543 | && DECL_STATIC_FUNCTION_P (current_function_decl)) |
dee15844 | 1544 | error ("invalid use of member %q+D in static member function", decl); |
a723baf1 | 1545 | else |
dee15844 | 1546 | error ("invalid use of non-static data member %q+D", decl); |
a723baf1 MM |
1547 | error ("from this location"); |
1548 | ||
1549 | return error_mark_node; | |
1550 | } | |
d5f4eddd | 1551 | |
51fc2d02 JM |
1552 | if (current_class_ptr) |
1553 | TREE_USED (current_class_ptr) = 1; | |
58e1d54c | 1554 | if (processing_template_decl && !qualifying_scope) |
a723baf1 | 1555 | { |
a3f10e50 | 1556 | tree type = TREE_TYPE (decl); |
a723baf1 | 1557 | |
a3f10e50 NS |
1558 | if (TREE_CODE (type) == REFERENCE_TYPE) |
1559 | type = TREE_TYPE (type); | |
1560 | else | |
1561 | { | |
f4f206f4 | 1562 | /* Set the cv qualifiers. */ |
51fc2d02 JM |
1563 | int quals = (current_class_ref |
1564 | ? cp_type_quals (TREE_TYPE (current_class_ref)) | |
1565 | : TYPE_UNQUALIFIED); | |
c8094d83 | 1566 | |
a3f10e50 NS |
1567 | if (DECL_MUTABLE_P (decl)) |
1568 | quals &= ~TYPE_QUAL_CONST; | |
9e95d15f | 1569 | |
a3f10e50 NS |
1570 | quals |= cp_type_quals (TREE_TYPE (decl)); |
1571 | type = cp_build_qualified_type (type, quals); | |
1572 | } | |
c8094d83 | 1573 | |
44de5aeb | 1574 | return build_min (COMPONENT_REF, type, object, decl, NULL_TREE); |
a3f10e50 | 1575 | } |
ab11c13f JM |
1576 | /* If PROCESSING_TEMPLATE_DECL is nonzero here, then |
1577 | QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF | |
1578 | for now. */ | |
1579 | else if (processing_template_decl) | |
1580 | return build_qualified_name (TREE_TYPE (decl), | |
1581 | qualifying_scope, | |
1582 | DECL_NAME (decl), | |
1583 | /*template_p=*/false); | |
a3f10e50 NS |
1584 | else |
1585 | { | |
1586 | tree access_type = TREE_TYPE (object); | |
9f01ded6 | 1587 | |
02022f3a SM |
1588 | perform_or_defer_access_check (TYPE_BINFO (access_type), decl, |
1589 | decl); | |
a723baf1 MM |
1590 | |
1591 | /* If the data member was named `C::M', convert `*this' to `C' | |
1592 | first. */ | |
1593 | if (qualifying_scope) | |
1594 | { | |
1595 | tree binfo = NULL_TREE; | |
1596 | object = build_scoped_ref (object, qualifying_scope, | |
1597 | &binfo); | |
1598 | } | |
1599 | ||
1600 | return build_class_member_access_expr (object, decl, | |
1601 | /*access_path=*/NULL_TREE, | |
5ade1ed2 DG |
1602 | /*preserve_reference=*/false, |
1603 | tf_warning_or_error); | |
a723baf1 MM |
1604 | } |
1605 | } | |
1606 | ||
aa373032 DS |
1607 | /* If we are currently parsing a template and we encountered a typedef |
1608 | TYPEDEF_DECL that is being accessed though CONTEXT, this function | |
1609 | adds the typedef to a list tied to the current template. | |
1610 | At tempate instantiatin time, that list is walked and access check | |
1611 | performed for each typedef. | |
1612 | LOCATION is the location of the usage point of TYPEDEF_DECL. */ | |
1613 | ||
1614 | void | |
1615 | add_typedef_to_current_template_for_access_check (tree typedef_decl, | |
1616 | tree context, | |
1617 | location_t location) | |
1618 | { | |
1619 | tree template_info = NULL; | |
1620 | tree cs = current_scope (); | |
1621 | ||
1622 | if (!is_typedef_decl (typedef_decl) | |
1623 | || !context | |
1624 | || !CLASS_TYPE_P (context) | |
1625 | || !cs) | |
1626 | return; | |
1627 | ||
1628 | if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL) | |
1629 | template_info = get_template_info (cs); | |
1630 | ||
1631 | if (template_info | |
1632 | && TI_TEMPLATE (template_info) | |
1633 | && !currently_open_class (context)) | |
1634 | append_type_to_template_for_access_check (cs, typedef_decl, | |
1635 | context, location); | |
1636 | } | |
1637 | ||
ee76b931 MM |
1638 | /* DECL was the declaration to which a qualified-id resolved. Issue |
1639 | an error message if it is not accessible. If OBJECT_TYPE is | |
1640 | non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the | |
1641 | type of `*x', or `x', respectively. If the DECL was named as | |
1642 | `A::B' then NESTED_NAME_SPECIFIER is `A'. */ | |
1643 | ||
1644 | void | |
c8094d83 MS |
1645 | check_accessibility_of_qualified_id (tree decl, |
1646 | tree object_type, | |
ee76b931 MM |
1647 | tree nested_name_specifier) |
1648 | { | |
1649 | tree scope; | |
1650 | tree qualifying_type = NULL_TREE; | |
95b4aca6 | 1651 | |
d0940d56 DS |
1652 | /* If we are parsing a template declaration and if decl is a typedef, |
1653 | add it to a list tied to the template. | |
1654 | At template instantiation time, that list will be walked and | |
1655 | access check performed. */ | |
aa373032 DS |
1656 | add_typedef_to_current_template_for_access_check (decl, |
1657 | nested_name_specifier | |
1658 | ? nested_name_specifier | |
1659 | : DECL_CONTEXT (decl), | |
1660 | input_location); | |
d0940d56 | 1661 | |
77880ae4 | 1662 | /* If we're not checking, return immediately. */ |
95b4aca6 NS |
1663 | if (deferred_access_no_check) |
1664 | return; | |
c8094d83 | 1665 | |
ee76b931 MM |
1666 | /* Determine the SCOPE of DECL. */ |
1667 | scope = context_for_name_lookup (decl); | |
1668 | /* If the SCOPE is not a type, then DECL is not a member. */ | |
1669 | if (!TYPE_P (scope)) | |
1670 | return; | |
1671 | /* Compute the scope through which DECL is being accessed. */ | |
c8094d83 | 1672 | if (object_type |
ee76b931 MM |
1673 | /* OBJECT_TYPE might not be a class type; consider: |
1674 | ||
1675 | class A { typedef int I; }; | |
1676 | I *p; | |
1677 | p->A::I::~I(); | |
1678 | ||
0cbd7506 | 1679 | In this case, we will have "A::I" as the DECL, but "I" as the |
ee76b931 MM |
1680 | OBJECT_TYPE. */ |
1681 | && CLASS_TYPE_P (object_type) | |
1682 | && DERIVED_FROM_P (scope, object_type)) | |
1683 | /* If we are processing a `->' or `.' expression, use the type of the | |
1684 | left-hand side. */ | |
1685 | qualifying_type = object_type; | |
1686 | else if (nested_name_specifier) | |
1687 | { | |
1688 | /* If the reference is to a non-static member of the | |
1689 | current class, treat it as if it were referenced through | |
1690 | `this'. */ | |
1691 | if (DECL_NONSTATIC_MEMBER_P (decl) | |
1692 | && current_class_ptr | |
1693 | && DERIVED_FROM_P (scope, current_class_type)) | |
1694 | qualifying_type = current_class_type; | |
1695 | /* Otherwise, use the type indicated by the | |
1696 | nested-name-specifier. */ | |
1697 | else | |
1698 | qualifying_type = nested_name_specifier; | |
1699 | } | |
1700 | else | |
1701 | /* Otherwise, the name must be from the current class or one of | |
1702 | its bases. */ | |
1703 | qualifying_type = currently_open_derived_class (scope); | |
1704 | ||
fc429748 MM |
1705 | if (qualifying_type |
1706 | /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM | |
1707 | or similar in a default argument value. */ | |
1708 | && CLASS_TYPE_P (qualifying_type) | |
1709 | && !dependent_type_p (qualifying_type)) | |
02022f3a SM |
1710 | perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl, |
1711 | decl); | |
ee76b931 MM |
1712 | } |
1713 | ||
1714 | /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the | |
1715 | class named to the left of the "::" operator. DONE is true if this | |
1716 | expression is a complete postfix-expression; it is false if this | |
1717 | expression is followed by '->', '[', '(', etc. ADDRESS_P is true | |
02ed62dd MM |
1718 | iff this expression is the operand of '&'. TEMPLATE_P is true iff |
1719 | the qualified-id was of the form "A::template B". TEMPLATE_ARG_P | |
1720 | is true iff this qualified name appears as a template argument. */ | |
ee76b931 MM |
1721 | |
1722 | tree | |
3db45ab5 MS |
1723 | finish_qualified_id_expr (tree qualifying_class, |
1724 | tree expr, | |
02ed62dd | 1725 | bool done, |
3db45ab5 | 1726 | bool address_p, |
02ed62dd MM |
1727 | bool template_p, |
1728 | bool template_arg_p) | |
ee76b931 | 1729 | { |
d4f0f205 MM |
1730 | gcc_assert (TYPE_P (qualifying_class)); |
1731 | ||
5e08432e MM |
1732 | if (error_operand_p (expr)) |
1733 | return error_mark_node; | |
1734 | ||
7eab6e7b | 1735 | if (DECL_P (expr) || BASELINK_P (expr)) |
d4f0f205 | 1736 | mark_used (expr); |
d4f0f205 | 1737 | |
02ed62dd MM |
1738 | if (template_p) |
1739 | check_template_keyword (expr); | |
1740 | ||
ee76b931 MM |
1741 | /* If EXPR occurs as the operand of '&', use special handling that |
1742 | permits a pointer-to-member. */ | |
1743 | if (address_p && done) | |
1744 | { | |
1745 | if (TREE_CODE (expr) == SCOPE_REF) | |
1746 | expr = TREE_OPERAND (expr, 1); | |
c8094d83 | 1747 | expr = build_offset_ref (qualifying_class, expr, |
a5ac359a | 1748 | /*address_p=*/true); |
ee76b931 MM |
1749 | return expr; |
1750 | } | |
1751 | ||
02ed62dd MM |
1752 | /* Within the scope of a class, turn references to non-static |
1753 | members into expression of the form "this->...". */ | |
1754 | if (template_arg_p) | |
1755 | /* But, within a template argument, we do not want make the | |
1756 | transformation, as there is no "this" pointer. */ | |
1757 | ; | |
1758 | else if (TREE_CODE (expr) == FIELD_DECL) | |
43854f72 SB |
1759 | { |
1760 | push_deferring_access_checks (dk_no_check); | |
2defb926 | 1761 | expr = finish_non_static_data_member (expr, NULL_TREE, |
43854f72 SB |
1762 | qualifying_class); |
1763 | pop_deferring_access_checks (); | |
1764 | } | |
ee76b931 MM |
1765 | else if (BASELINK_P (expr) && !processing_template_decl) |
1766 | { | |
38f1276b | 1767 | tree ob; |
ee76b931 MM |
1768 | |
1769 | /* See if any of the functions are non-static members. */ | |
7e361ae6 | 1770 | /* If so, the expression may be relative to 'this'. */ |
294e855f | 1771 | if (!shared_member_p (expr) |
38f1276b JM |
1772 | && (ob = maybe_dummy_object (qualifying_class, NULL), |
1773 | !is_dummy_object (ob))) | |
c8094d83 | 1774 | expr = (build_class_member_access_expr |
38f1276b | 1775 | (ob, |
ee76b931 MM |
1776 | expr, |
1777 | BASELINK_ACCESS_BINFO (expr), | |
5ade1ed2 DG |
1778 | /*preserve_reference=*/false, |
1779 | tf_warning_or_error)); | |
ee76b931 | 1780 | else if (done) |
a5ac359a MM |
1781 | /* The expression is a qualified name whose address is not |
1782 | being taken. */ | |
1783 | expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false); | |
ee76b931 MM |
1784 | } |
1785 | ||
1786 | return expr; | |
1787 | } | |
1788 | ||
b69b1501 MM |
1789 | /* Begin a statement-expression. The value returned must be passed to |
1790 | finish_stmt_expr. */ | |
b4c4a9ec | 1791 | |
c8094d83 | 1792 | tree |
3a978d72 | 1793 | begin_stmt_expr (void) |
b4c4a9ec | 1794 | { |
325c3691 | 1795 | return push_stmt_list (); |
35b1567d BC |
1796 | } |
1797 | ||
a5bcc582 | 1798 | /* Process the final expression of a statement expression. EXPR can be |
85a56c9d MM |
1799 | NULL, if the final expression is empty. Return a STATEMENT_LIST |
1800 | containing all the statements in the statement-expression, or | |
1801 | ERROR_MARK_NODE if there was an error. */ | |
a5bcc582 NS |
1802 | |
1803 | tree | |
325c3691 | 1804 | finish_stmt_expr_expr (tree expr, tree stmt_expr) |
a5bcc582 | 1805 | { |
72e4661a | 1806 | if (error_operand_p (expr)) |
76b9a2a1 AP |
1807 | { |
1808 | /* The type of the statement-expression is the type of the last | |
1809 | expression. */ | |
1810 | TREE_TYPE (stmt_expr) = error_mark_node; | |
1811 | return error_mark_node; | |
1812 | } | |
c8094d83 | 1813 | |
85a56c9d | 1814 | /* If the last statement does not have "void" type, then the value |
3db45ab5 | 1815 | of the last statement is the value of the entire expression. */ |
a5bcc582 NS |
1816 | if (expr) |
1817 | { | |
c6c7698d JM |
1818 | tree type = TREE_TYPE (expr); |
1819 | ||
1820 | if (processing_template_decl) | |
1821 | { | |
c2255bc4 | 1822 | expr = build_stmt (input_location, EXPR_STMT, expr); |
c6c7698d JM |
1823 | expr = add_stmt (expr); |
1824 | /* Mark the last statement so that we can recognize it as such at | |
1825 | template-instantiation time. */ | |
1826 | EXPR_STMT_STMT_EXPR_RESULT (expr) = 1; | |
1827 | } | |
1828 | else if (VOID_TYPE_P (type)) | |
a5bcc582 | 1829 | { |
c6c7698d JM |
1830 | /* Just treat this like an ordinary statement. */ |
1831 | expr = finish_expr_stmt (expr); | |
1832 | } | |
1833 | else | |
1834 | { | |
1835 | /* It actually has a value we need to deal with. First, force it | |
1836 | to be an rvalue so that we won't need to build up a copy | |
1837 | constructor call later when we try to assign it to something. */ | |
574cfaa4 | 1838 | expr = force_rvalue (expr, tf_warning_or_error); |
85a56c9d MM |
1839 | if (error_operand_p (expr)) |
1840 | return error_mark_node; | |
c6c7698d JM |
1841 | |
1842 | /* Update for array-to-pointer decay. */ | |
2692eb7d | 1843 | type = TREE_TYPE (expr); |
c6c7698d JM |
1844 | |
1845 | /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a | |
1846 | normal statement, but don't convert to void or actually add | |
1847 | the EXPR_STMT. */ | |
1848 | if (TREE_CODE (expr) != CLEANUP_POINT_EXPR) | |
1849 | expr = maybe_cleanup_point_expr (expr); | |
1850 | add_stmt (expr); | |
85a56c9d | 1851 | } |
c6c7698d | 1852 | |
85a56c9d MM |
1853 | /* The type of the statement-expression is the type of the last |
1854 | expression. */ | |
1855 | TREE_TYPE (stmt_expr) = type; | |
a5bcc582 | 1856 | } |
c8094d83 | 1857 | |
85a56c9d | 1858 | return stmt_expr; |
a5bcc582 NS |
1859 | } |
1860 | ||
303b7406 NS |
1861 | /* Finish a statement-expression. EXPR should be the value returned |
1862 | by the previous begin_stmt_expr. Returns an expression | |
1863 | representing the statement-expression. */ | |
b4c4a9ec | 1864 | |
c8094d83 | 1865 | tree |
325c3691 | 1866 | finish_stmt_expr (tree stmt_expr, bool has_no_scope) |
b4c4a9ec | 1867 | { |
85a56c9d MM |
1868 | tree type; |
1869 | tree result; | |
325c3691 | 1870 | |
85a56c9d | 1871 | if (error_operand_p (stmt_expr)) |
d7b5fa31 JJ |
1872 | { |
1873 | pop_stmt_list (stmt_expr); | |
1874 | return error_mark_node; | |
1875 | } | |
325c3691 | 1876 | |
85a56c9d | 1877 | gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST); |
325c3691 | 1878 | |
85a56c9d MM |
1879 | type = TREE_TYPE (stmt_expr); |
1880 | result = pop_stmt_list (stmt_expr); | |
c6c7698d | 1881 | TREE_TYPE (result) = type; |
6f80451c | 1882 | |
a5bcc582 | 1883 | if (processing_template_decl) |
325c3691 RH |
1884 | { |
1885 | result = build_min (STMT_EXPR, type, result); | |
1886 | TREE_SIDE_EFFECTS (result) = 1; | |
1887 | STMT_EXPR_NO_SCOPE (result) = has_no_scope; | |
1888 | } | |
c6c7698d | 1889 | else if (CLASS_TYPE_P (type)) |
a5bcc582 | 1890 | { |
c6c7698d JM |
1891 | /* Wrap the statement-expression in a TARGET_EXPR so that the |
1892 | temporary object created by the final expression is destroyed at | |
1893 | the end of the full-expression containing the | |
1894 | statement-expression. */ | |
574cfaa4 | 1895 | result = force_target_expr (type, result, tf_warning_or_error); |
a5bcc582 | 1896 | } |
325c3691 | 1897 | |
b4c4a9ec MM |
1898 | return result; |
1899 | } | |
1900 | ||
c2acde1e JM |
1901 | /* Returns the expression which provides the value of STMT_EXPR. */ |
1902 | ||
1903 | tree | |
1904 | stmt_expr_value_expr (tree stmt_expr) | |
1905 | { | |
1906 | tree t = STMT_EXPR_STMT (stmt_expr); | |
1907 | ||
1908 | if (TREE_CODE (t) == BIND_EXPR) | |
1909 | t = BIND_EXPR_BODY (t); | |
1910 | ||
9de0e916 | 1911 | if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t)) |
c2acde1e JM |
1912 | t = STATEMENT_LIST_TAIL (t)->stmt; |
1913 | ||
1914 | if (TREE_CODE (t) == EXPR_STMT) | |
1915 | t = EXPR_STMT_EXPR (t); | |
1916 | ||
1917 | return t; | |
1918 | } | |
1919 | ||
9af66ed1 DS |
1920 | /* Return TRUE iff EXPR_STMT is an empty list of |
1921 | expression statements. */ | |
1922 | ||
1923 | bool | |
1924 | empty_expr_stmt_p (tree expr_stmt) | |
1925 | { | |
1926 | tree body = NULL_TREE; | |
1927 | ||
489df541 DS |
1928 | if (expr_stmt == void_zero_node) |
1929 | return true; | |
1930 | ||
9af66ed1 DS |
1931 | if (expr_stmt) |
1932 | { | |
1933 | if (TREE_CODE (expr_stmt) == EXPR_STMT) | |
1934 | body = EXPR_STMT_EXPR (expr_stmt); | |
1935 | else if (TREE_CODE (expr_stmt) == STATEMENT_LIST) | |
1936 | body = expr_stmt; | |
1937 | } | |
1938 | ||
489df541 DS |
1939 | if (body) |
1940 | { | |
1941 | if (TREE_CODE (body) == STATEMENT_LIST) | |
1942 | return tsi_end_p (tsi_start (body)); | |
1943 | else | |
1944 | return empty_expr_stmt_p (body); | |
1945 | } | |
9af66ed1 DS |
1946 | return false; |
1947 | } | |
1948 | ||
b3445994 | 1949 | /* Perform Koenig lookup. FN is the postfix-expression representing |
fa531100 | 1950 | the function (or functions) to call; ARGS are the arguments to the |
f9132eb7 RRC |
1951 | call; if INCLUDE_STD then the `std' namespace is automatically |
1952 | considered an associated namespace (used in range-based for loops). | |
1953 | Returns the functions to be considered by overload resolution. */ | |
b3445994 MM |
1954 | |
1955 | tree | |
f9132eb7 | 1956 | perform_koenig_lookup (tree fn, VEC(tree,gc) *args, bool include_std) |
b3445994 MM |
1957 | { |
1958 | tree identifier = NULL_TREE; | |
1959 | tree functions = NULL_TREE; | |
d095e03c | 1960 | tree tmpl_args = NULL_TREE; |
4e6a9725 | 1961 | bool template_id = false; |
d095e03c JM |
1962 | |
1963 | if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) | |
1964 | { | |
4e6a9725 JM |
1965 | /* Use a separate flag to handle null args. */ |
1966 | template_id = true; | |
d095e03c JM |
1967 | tmpl_args = TREE_OPERAND (fn, 1); |
1968 | fn = TREE_OPERAND (fn, 0); | |
1969 | } | |
b3445994 MM |
1970 | |
1971 | /* Find the name of the overloaded function. */ | |
1972 | if (TREE_CODE (fn) == IDENTIFIER_NODE) | |
1973 | identifier = fn; | |
1974 | else if (is_overloaded_fn (fn)) | |
1975 | { | |
1976 | functions = fn; | |
1977 | identifier = DECL_NAME (get_first_fn (functions)); | |
1978 | } | |
1979 | else if (DECL_P (fn)) | |
1980 | { | |
1981 | functions = fn; | |
1982 | identifier = DECL_NAME (fn); | |
1983 | } | |
1984 | ||
1985 | /* A call to a namespace-scope function using an unqualified name. | |
1986 | ||
1987 | Do Koenig lookup -- unless any of the arguments are | |
1988 | type-dependent. */ | |
d095e03c JM |
1989 | if (!any_type_dependent_arguments_p (args) |
1990 | && !any_dependent_template_arguments_p (tmpl_args)) | |
b3445994 | 1991 | { |
f9132eb7 | 1992 | fn = lookup_arg_dependent (identifier, functions, args, include_std); |
b3445994 MM |
1993 | if (!fn) |
1994 | /* The unqualified name could not be resolved. */ | |
1995 | fn = unqualified_fn_lookup_error (identifier); | |
1996 | } | |
b3445994 | 1997 | |
4e6a9725 JM |
1998 | if (fn && template_id) |
1999 | fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args); | |
d095e03c | 2000 | |
b3445994 MM |
2001 | return fn; |
2002 | } | |
2003 | ||
c166b898 ILT |
2004 | /* Generate an expression for `FN (ARGS)'. This may change the |
2005 | contents of ARGS. | |
4ba126e4 MM |
2006 | |
2007 | If DISALLOW_VIRTUAL is true, the call to FN will be not generated | |
2008 | as a virtual call, even if FN is virtual. (This flag is set when | |
2009 | encountering an expression where the function name is explicitly | |
2010 | qualified. For example a call to `X::f' never generates a virtual | |
2011 | call.) | |
2012 | ||
2013 | Returns code for the call. */ | |
b4c4a9ec | 2014 | |
c8094d83 | 2015 | tree |
c166b898 ILT |
2016 | finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual, |
2017 | bool koenig_p, tsubst_flags_t complain) | |
b4c4a9ec | 2018 | { |
d17811fd MM |
2019 | tree result; |
2020 | tree orig_fn; | |
c166b898 | 2021 | VEC(tree,gc) *orig_args = NULL; |
d17811fd | 2022 | |
c166b898 | 2023 | if (fn == error_mark_node) |
4ba126e4 MM |
2024 | return error_mark_node; |
2025 | ||
4860b874 | 2026 | gcc_assert (!TYPE_P (fn)); |
a759e627 | 2027 | |
d17811fd | 2028 | orig_fn = fn; |
d17811fd MM |
2029 | |
2030 | if (processing_template_decl) | |
2031 | { | |
1770aeed DS |
2032 | /* If the call expression is dependent, build a CALL_EXPR node |
2033 | with no type; type_dependent_expression_p recognizes | |
2034 | expressions with no type as being dependent. */ | |
d17811fd | 2035 | if (type_dependent_expression_p (fn) |
1770aeed DS |
2036 | || any_type_dependent_arguments_p (*args) |
2037 | /* For a non-static member function, we need to specifically | |
2038 | test the type dependency of the "this" pointer because it | |
2039 | is not included in *ARGS even though it is considered to | |
2040 | be part of the list of arguments. Note that this is | |
2041 | related to CWG issues 515 and 1005. */ | |
f62cd409 DS |
2042 | || (((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) |
2043 | || BASELINK_P (fn)) | |
1770aeed DS |
2044 | && current_class_ref |
2045 | && type_dependent_expression_p (current_class_ref))) | |
6d80c4b9 | 2046 | { |
c166b898 | 2047 | result = build_nt_call_vec (fn, *args); |
5094a795 | 2048 | KOENIG_LOOKUP_P (result) = koenig_p; |
be461b8f JJ |
2049 | if (cfun) |
2050 | { | |
2051 | do | |
2052 | { | |
2053 | tree fndecl = OVL_CURRENT (fn); | |
2054 | if (TREE_CODE (fndecl) != FUNCTION_DECL | |
2055 | || !TREE_THIS_VOLATILE (fndecl)) | |
2056 | break; | |
2057 | fn = OVL_NEXT (fn); | |
2058 | } | |
2059 | while (fn); | |
2060 | if (!fn) | |
2061 | current_function_returns_abnormally = 1; | |
2062 | } | |
6d80c4b9 MM |
2063 | return result; |
2064 | } | |
c166b898 | 2065 | orig_args = make_tree_vector_copy (*args); |
d17811fd MM |
2066 | if (!BASELINK_P (fn) |
2067 | && TREE_CODE (fn) != PSEUDO_DTOR_EXPR | |
2068 | && TREE_TYPE (fn) != unknown_type_node) | |
2069 | fn = build_non_dependent_expr (fn); | |
c166b898 | 2070 | make_args_non_dependent (*args); |
d17811fd MM |
2071 | } |
2072 | ||
deb9642d JM |
2073 | if (TREE_CODE (fn) == COMPONENT_REF) |
2074 | { | |
2075 | tree member = TREE_OPERAND (fn, 1); | |
2076 | if (BASELINK_P (member)) | |
2077 | { | |
2078 | tree object = TREE_OPERAND (fn, 0); | |
2079 | return build_new_method_call (object, member, | |
2080 | args, NULL_TREE, | |
2081 | (disallow_virtual | |
2082 | ? LOOKUP_NORMAL | LOOKUP_NONVIRTUAL | |
2083 | : LOOKUP_NORMAL), | |
2084 | /*fn_p=*/NULL, | |
2085 | complain); | |
2086 | } | |
2087 | } | |
2088 | ||
eff3a276 MM |
2089 | if (is_overloaded_fn (fn)) |
2090 | fn = baselink_for_fns (fn); | |
a723baf1 | 2091 | |
d17811fd | 2092 | result = NULL_TREE; |
4ba126e4 | 2093 | if (BASELINK_P (fn)) |
03d82991 | 2094 | { |
4ba126e4 MM |
2095 | tree object; |
2096 | ||
2097 | /* A call to a member function. From [over.call.func]: | |
2098 | ||
2099 | If the keyword this is in scope and refers to the class of | |
2100 | that member function, or a derived class thereof, then the | |
2101 | function call is transformed into a qualified function call | |
2102 | using (*this) as the postfix-expression to the left of the | |
2103 | . operator.... [Otherwise] a contrived object of type T | |
c8094d83 | 2104 | becomes the implied object argument. |
4ba126e4 | 2105 | |
38f1276b | 2106 | In this situation: |
4ba126e4 MM |
2107 | |
2108 | struct A { void f(); }; | |
2109 | struct B : public A {}; | |
2110 | struct C : public A { void g() { B::f(); }}; | |
2111 | ||
38f1276b JM |
2112 | "the class of that member function" refers to `A'. But 11.2 |
2113 | [class.access.base] says that we need to convert 'this' to B* as | |
2114 | part of the access, so we pass 'B' to maybe_dummy_object. */ | |
b4c4a9ec | 2115 | |
38f1276b JM |
2116 | object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)), |
2117 | NULL); | |
b4c4a9ec | 2118 | |
d17811fd MM |
2119 | if (processing_template_decl) |
2120 | { | |
2121 | if (type_dependent_expression_p (object)) | |
c166b898 ILT |
2122 | { |
2123 | tree ret = build_nt_call_vec (orig_fn, orig_args); | |
2124 | release_tree_vector (orig_args); | |
2125 | return ret; | |
2126 | } | |
d17811fd MM |
2127 | object = build_non_dependent_expr (object); |
2128 | } | |
2129 | ||
2130 | result = build_new_method_call (object, fn, args, NULL_TREE, | |
c8094d83 | 2131 | (disallow_virtual |
c2aa8dc9 JM |
2132 | ? LOOKUP_NORMAL|LOOKUP_NONVIRTUAL |
2133 | : LOOKUP_NORMAL), | |
5ade1ed2 DG |
2134 | /*fn_p=*/NULL, |
2135 | complain); | |
4ba126e4 MM |
2136 | } |
2137 | else if (is_overloaded_fn (fn)) | |
16c35a1f RH |
2138 | { |
2139 | /* If the function is an overloaded builtin, resolve it. */ | |
2140 | if (TREE_CODE (fn) == FUNCTION_DECL | |
58646b77 PB |
2141 | && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL |
2142 | || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD)) | |
c2255bc4 | 2143 | result = resolve_overloaded_builtin (input_location, fn, *args); |
16c35a1f RH |
2144 | |
2145 | if (!result) | |
2146 | /* A call to a namespace-scope function. */ | |
5094a795 | 2147 | result = build_new_function_call (fn, args, koenig_p, complain); |
16c35a1f | 2148 | } |
a723baf1 MM |
2149 | else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR) |
2150 | { | |
c166b898 | 2151 | if (!VEC_empty (tree, *args)) |
a723baf1 MM |
2152 | error ("arguments to destructor are not allowed"); |
2153 | /* Mark the pseudo-destructor call as having side-effects so | |
2154 | that we do not issue warnings about its use. */ | |
2155 | result = build1 (NOP_EXPR, | |
2156 | void_type_node, | |
2157 | TREE_OPERAND (fn, 0)); | |
2158 | TREE_SIDE_EFFECTS (result) = 1; | |
a723baf1 | 2159 | } |
4ba126e4 | 2160 | else if (CLASS_TYPE_P (TREE_TYPE (fn))) |
d17811fd MM |
2161 | /* If the "function" is really an object of class type, it might |
2162 | have an overloaded `operator ()'. */ | |
c166b898 | 2163 | result = build_op_call (fn, args, complain); |
16c35a1f | 2164 | |
d17811fd MM |
2165 | if (!result) |
2166 | /* A call where the function is unknown. */ | |
c166b898 | 2167 | result = cp_build_function_call_vec (fn, args, complain); |
4ba126e4 | 2168 | |
bb4586d3 | 2169 | if (processing_template_decl && result != error_mark_node) |
6d80c4b9 | 2170 | { |
bb4586d3 JM |
2171 | if (TREE_CODE (result) == INDIRECT_REF) |
2172 | result = TREE_OPERAND (result, 0); | |
c166b898 | 2173 | result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args); |
5094a795 | 2174 | KOENIG_LOOKUP_P (result) = koenig_p; |
c166b898 | 2175 | release_tree_vector (orig_args); |
bb4586d3 | 2176 | result = convert_from_reference (result); |
6d80c4b9 | 2177 | } |
c166b898 | 2178 | |
3a2cb4d0 JM |
2179 | if (koenig_p) |
2180 | { | |
2181 | /* Free garbage OVERLOADs from arg-dependent lookup. */ | |
2182 | tree next = NULL_TREE; | |
2183 | for (fn = orig_fn; | |
2184 | fn && TREE_CODE (fn) == OVERLOAD && OVL_ARG_DEPENDENT (fn); | |
2185 | fn = next) | |
2186 | { | |
2187 | if (processing_template_decl) | |
2188 | /* In a template, we'll re-use them at instantiation time. */ | |
2189 | OVL_ARG_DEPENDENT (fn) = false; | |
2190 | else | |
2191 | { | |
2192 | next = OVL_CHAIN (fn); | |
2193 | ggc_free (fn); | |
2194 | } | |
2195 | } | |
2196 | } | |
2197 | ||
d17811fd | 2198 | return result; |
b4c4a9ec MM |
2199 | } |
2200 | ||
2201 | /* Finish a call to a postfix increment or decrement or EXPR. (Which | |
2202 | is indicated by CODE, which should be POSTINCREMENT_EXPR or | |
2203 | POSTDECREMENT_EXPR.) */ | |
2204 | ||
c8094d83 | 2205 | tree |
3a978d72 | 2206 | finish_increment_expr (tree expr, enum tree_code code) |
b4c4a9ec | 2207 | { |
5ade1ed2 | 2208 | return build_x_unary_op (code, expr, tf_warning_or_error); |
b4c4a9ec MM |
2209 | } |
2210 | ||
2211 | /* Finish a use of `this'. Returns an expression for `this'. */ | |
2212 | ||
c8094d83 | 2213 | tree |
3a978d72 | 2214 | finish_this_expr (void) |
b4c4a9ec MM |
2215 | { |
2216 | tree result; | |
2217 | ||
c6be04ad JM |
2218 | if (current_class_ptr) |
2219 | { | |
2220 | tree type = TREE_TYPE (current_class_ref); | |
2221 | ||
2222 | /* In a lambda expression, 'this' refers to the captured 'this'. */ | |
2223 | if (LAMBDA_TYPE_P (type)) | |
2224 | result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type)); | |
2225 | else | |
2226 | result = current_class_ptr; | |
2227 | ||
2228 | } | |
b4c4a9ec MM |
2229 | else if (current_function_decl |
2230 | && DECL_STATIC_FUNCTION_P (current_function_decl)) | |
2231 | { | |
9e637a26 | 2232 | error ("%<this%> is unavailable for static member functions"); |
b4c4a9ec MM |
2233 | result = error_mark_node; |
2234 | } | |
2235 | else | |
2236 | { | |
2237 | if (current_function_decl) | |
9e637a26 | 2238 | error ("invalid use of %<this%> in non-member function"); |
b4c4a9ec | 2239 | else |
9e637a26 | 2240 | error ("invalid use of %<this%> at top level"); |
b4c4a9ec MM |
2241 | result = error_mark_node; |
2242 | } | |
2243 | ||
2244 | return result; | |
2245 | } | |
2246 | ||
a723baf1 MM |
2247 | /* Finish a pseudo-destructor expression. If SCOPE is NULL, the |
2248 | expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is | |
2249 | the TYPE for the type given. If SCOPE is non-NULL, the expression | |
2250 | was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */ | |
b4c4a9ec | 2251 | |
c8094d83 | 2252 | tree |
3a978d72 | 2253 | finish_pseudo_destructor_expr (tree object, tree scope, tree destructor) |
b4c4a9ec | 2254 | { |
09b1ccd6 | 2255 | if (object == error_mark_node || destructor == error_mark_node) |
a723baf1 | 2256 | return error_mark_node; |
40242ccf | 2257 | |
50bc768d | 2258 | gcc_assert (TYPE_P (destructor)); |
b4c4a9ec | 2259 | |
a723baf1 MM |
2260 | if (!processing_template_decl) |
2261 | { | |
2262 | if (scope == error_mark_node) | |
2263 | { | |
2264 | error ("invalid qualifying scope in pseudo-destructor name"); | |
2265 | return error_mark_node; | |
2266 | } | |
5cf10afb AP |
2267 | if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor)) |
2268 | { | |
2269 | error ("qualified type %qT does not match destructor name ~%qT", | |
2270 | scope, destructor); | |
2271 | return error_mark_node; | |
2272 | } | |
2273 | ||
c8094d83 | 2274 | |
26bcf8fc MM |
2275 | /* [expr.pseudo] says both: |
2276 | ||
0cbd7506 | 2277 | The type designated by the pseudo-destructor-name shall be |
26bcf8fc MM |
2278 | the same as the object type. |
2279 | ||
0cbd7506 | 2280 | and: |
26bcf8fc | 2281 | |
0cbd7506 | 2282 | The cv-unqualified versions of the object type and of the |
26bcf8fc MM |
2283 | type designated by the pseudo-destructor-name shall be the |
2284 | same type. | |
2285 | ||
0cbd7506 MS |
2286 | We implement the more generous second sentence, since that is |
2287 | what most other compilers do. */ | |
c8094d83 | 2288 | if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object), |
26bcf8fc | 2289 | destructor)) |
a723baf1 | 2290 | { |
a82e1a7d | 2291 | error ("%qE is not of type %qT", object, destructor); |
a723baf1 MM |
2292 | return error_mark_node; |
2293 | } | |
2294 | } | |
b4c4a9ec | 2295 | |
f293ce4b | 2296 | return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor); |
b4c4a9ec MM |
2297 | } |
2298 | ||
ce4a0391 MM |
2299 | /* Finish an expression of the form CODE EXPR. */ |
2300 | ||
2301 | tree | |
3a978d72 | 2302 | finish_unary_op_expr (enum tree_code code, tree expr) |
ce4a0391 | 2303 | { |
5ade1ed2 | 2304 | tree result = build_x_unary_op (code, expr, tf_warning_or_error); |
7c355bca ML |
2305 | /* Inside a template, build_x_unary_op does not fold the |
2306 | expression. So check whether the result is folded before | |
2307 | setting TREE_NEGATED_INT. */ | |
2308 | if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST | |
88b4335f | 2309 | && TREE_CODE (result) == INTEGER_CST |
8df83eae | 2310 | && !TYPE_UNSIGNED (TREE_TYPE (result)) |
88b4335f | 2311 | && INT_CST_LT (result, integer_zero_node)) |
6fc98adf MM |
2312 | { |
2313 | /* RESULT may be a cached INTEGER_CST, so we must copy it before | |
2314 | setting TREE_NEGATED_INT. */ | |
2315 | result = copy_node (result); | |
2316 | TREE_NEGATED_INT (result) = 1; | |
2317 | } | |
59c0753d | 2318 | if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr)) |
c2255bc4 | 2319 | overflow_warning (input_location, result); |
59c0753d | 2320 | |
ce4a0391 MM |
2321 | return result; |
2322 | } | |
2323 | ||
a723baf1 | 2324 | /* Finish a compound-literal expression. TYPE is the type to which |
09357846 | 2325 | the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */ |
a723baf1 MM |
2326 | |
2327 | tree | |
834aa426 JM |
2328 | finish_compound_literal (tree type, tree compound_literal, |
2329 | tsubst_flags_t complain) | |
a723baf1 | 2330 | { |
326a4d4e JJ |
2331 | if (type == error_mark_node) |
2332 | return error_mark_node; | |
2333 | ||
76186d20 JM |
2334 | if (TREE_CODE (type) == REFERENCE_TYPE) |
2335 | { | |
2336 | compound_literal | |
2337 | = finish_compound_literal (TREE_TYPE (type), compound_literal, | |
2338 | complain); | |
2339 | return cp_build_c_cast (type, compound_literal, complain); | |
2340 | } | |
2341 | ||
2b643eda MM |
2342 | if (!TYPE_OBJ_P (type)) |
2343 | { | |
834aa426 JM |
2344 | if (complain & tf_error) |
2345 | error ("compound literal of non-object type %qT", type); | |
2b643eda MM |
2346 | return error_mark_node; |
2347 | } | |
2348 | ||
a723baf1 | 2349 | if (processing_template_decl) |
a723baf1 | 2350 | { |
e92fb501 MM |
2351 | TREE_TYPE (compound_literal) = type; |
2352 | /* Mark the expression as a compound literal. */ | |
2353 | TREE_HAS_CONSTRUCTOR (compound_literal) = 1; | |
2354 | return compound_literal; | |
a723baf1 MM |
2355 | } |
2356 | ||
df794884 | 2357 | type = complete_type (type); |
09357846 JM |
2358 | |
2359 | if (TYPE_NON_AGGREGATE_CLASS (type)) | |
2360 | { | |
2361 | /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST | |
2362 | everywhere that deals with function arguments would be a pain, so | |
2363 | just wrap it in a TREE_LIST. The parser set a flag so we know | |
2364 | that it came from T{} rather than T({}). */ | |
2365 | CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1; | |
2366 | compound_literal = build_tree_list (NULL_TREE, compound_literal); | |
834aa426 | 2367 | return build_functional_cast (type, compound_literal, complain); |
09357846 JM |
2368 | } |
2369 | ||
23bee8f4 JJ |
2370 | if (TREE_CODE (type) == ARRAY_TYPE |
2371 | && check_array_initializer (NULL_TREE, type, compound_literal)) | |
2372 | return error_mark_node; | |
df794884 | 2373 | compound_literal = reshape_init (type, compound_literal); |
80c6dcf5 JM |
2374 | if (TREE_CODE (type) == ARRAY_TYPE |
2375 | && TYPE_DOMAIN (type) == NULL_TREE) | |
2376 | { | |
2377 | cp_complete_array_type_or_error (&type, compound_literal, | |
2378 | false, complain); | |
2379 | if (type == error_mark_node) | |
2380 | return error_mark_node; | |
2381 | } | |
df794884 | 2382 | compound_literal = digest_init (type, compound_literal); |
a63940ba JM |
2383 | /* Put static/constant array temporaries in static variables, but always |
2384 | represent class temporaries with TARGET_EXPR so we elide copies. */ | |
2385 | if ((!at_function_scope_p () || CP_TYPE_CONST_P (type)) | |
2386 | && TREE_CODE (type) == ARRAY_TYPE | |
fa9ef321 | 2387 | && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) |
a63940ba JM |
2388 | && initializer_constant_valid_p (compound_literal, type)) |
2389 | { | |
2390 | tree decl = create_temporary_var (type); | |
2391 | DECL_INITIAL (decl) = compound_literal; | |
2392 | TREE_STATIC (decl) = 1; | |
2393 | if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type)) | |
2394 | { | |
2395 | /* 5.19 says that a constant expression can include an | |
2396 | lvalue-rvalue conversion applied to "a glvalue of literal type | |
2397 | that refers to a non-volatile temporary object initialized | |
2398 | with a constant expression". Rather than try to communicate | |
2399 | that this VAR_DECL is a temporary, just mark it constexpr. */ | |
2400 | DECL_DECLARED_CONSTEXPR_P (decl) = true; | |
2401 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true; | |
2402 | TREE_CONSTANT (decl) = true; | |
2403 | } | |
2404 | cp_apply_type_quals_to_decl (cp_type_quals (type), decl); | |
2405 | decl = pushdecl_top_level (decl); | |
2406 | DECL_NAME (decl) = make_anon_name (); | |
2407 | SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl)); | |
2408 | return decl; | |
2409 | } | |
2410 | else | |
574cfaa4 | 2411 | return get_target_expr_sfinae (compound_literal, complain); |
a723baf1 MM |
2412 | } |
2413 | ||
5f261ba9 MM |
2414 | /* Return the declaration for the function-name variable indicated by |
2415 | ID. */ | |
2416 | ||
2417 | tree | |
2418 | finish_fname (tree id) | |
2419 | { | |
2420 | tree decl; | |
c8094d83 | 2421 | |
3ba09659 | 2422 | decl = fname_decl (input_location, C_RID_CODE (id), id); |
be771f25 | 2423 | if (processing_template_decl && current_function_decl) |
10b1d5e7 | 2424 | decl = DECL_NAME (decl); |
5f261ba9 MM |
2425 | return decl; |
2426 | } | |
2427 | ||
8014a339 | 2428 | /* Finish a translation unit. */ |
ce4a0391 | 2429 | |
c8094d83 | 2430 | void |
3a978d72 | 2431 | finish_translation_unit (void) |
ce4a0391 MM |
2432 | { |
2433 | /* In case there were missing closebraces, | |
2434 | get us back to the global binding level. */ | |
273a708f | 2435 | pop_everything (); |
ce4a0391 MM |
2436 | while (current_namespace != global_namespace) |
2437 | pop_namespace (); | |
0ba8a114 | 2438 | |
c6002625 | 2439 | /* Do file scope __FUNCTION__ et al. */ |
0ba8a114 | 2440 | finish_fname_decls (); |
ce4a0391 MM |
2441 | } |
2442 | ||
b4c4a9ec MM |
2443 | /* Finish a template type parameter, specified as AGGR IDENTIFIER. |
2444 | Returns the parameter. */ | |
2445 | ||
c8094d83 | 2446 | tree |
3a978d72 | 2447 | finish_template_type_parm (tree aggr, tree identifier) |
b4c4a9ec | 2448 | { |
6eabb241 | 2449 | if (aggr != class_type_node) |
b4c4a9ec | 2450 | { |
cbe5f3b3 | 2451 | permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>"); |
b4c4a9ec MM |
2452 | aggr = class_type_node; |
2453 | } | |
2454 | ||
2455 | return build_tree_list (aggr, identifier); | |
2456 | } | |
2457 | ||
2458 | /* Finish a template template parameter, specified as AGGR IDENTIFIER. | |
2459 | Returns the parameter. */ | |
2460 | ||
c8094d83 | 2461 | tree |
3a978d72 | 2462 | finish_template_template_parm (tree aggr, tree identifier) |
b4c4a9ec | 2463 | { |
c2255bc4 AH |
2464 | tree decl = build_decl (input_location, |
2465 | TYPE_DECL, identifier, NULL_TREE); | |
b4c4a9ec MM |
2466 | tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE); |
2467 | DECL_TEMPLATE_PARMS (tmpl) = current_template_parms; | |
2468 | DECL_TEMPLATE_RESULT (tmpl) = decl; | |
c727aa5e | 2469 | DECL_ARTIFICIAL (decl) = 1; |
b4c4a9ec MM |
2470 | end_template_decl (); |
2471 | ||
50bc768d | 2472 | gcc_assert (DECL_TEMPLATE_PARMS (tmpl)); |
b37bf5bd | 2473 | |
85d85234 DG |
2474 | check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl), |
2475 | /*is_primary=*/true, /*is_partial=*/false, | |
2476 | /*is_friend=*/0); | |
2477 | ||
b4c4a9ec MM |
2478 | return finish_template_type_parm (aggr, tmpl); |
2479 | } | |
ce4a0391 | 2480 | |
8ba658ee MM |
2481 | /* ARGUMENT is the default-argument value for a template template |
2482 | parameter. If ARGUMENT is invalid, issue error messages and return | |
2483 | the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */ | |
2484 | ||
2485 | tree | |
2486 | check_template_template_default_arg (tree argument) | |
2487 | { | |
2488 | if (TREE_CODE (argument) != TEMPLATE_DECL | |
2489 | && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM | |
8ba658ee MM |
2490 | && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE) |
2491 | { | |
a3a503a5 | 2492 | if (TREE_CODE (argument) == TYPE_DECL) |
e488a090 VR |
2493 | error ("invalid use of type %qT as a default value for a template " |
2494 | "template-parameter", TREE_TYPE (argument)); | |
a3a503a5 GB |
2495 | else |
2496 | error ("invalid default argument for a template template parameter"); | |
8ba658ee MM |
2497 | return error_mark_node; |
2498 | } | |
2499 | ||
2500 | return argument; | |
2501 | } | |
2502 | ||
ce4a0391 MM |
2503 | /* Begin a class definition, as indicated by T. */ |
2504 | ||
2505 | tree | |
b9e75696 | 2506 | begin_class_definition (tree t, tree attributes) |
ce4a0391 | 2507 | { |
7d2f0ecd | 2508 | if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t))) |
7437519c ZW |
2509 | return error_mark_node; |
2510 | ||
522d6614 NS |
2511 | if (processing_template_parmlist) |
2512 | { | |
a82e1a7d | 2513 | error ("definition of %q#T inside template parameter list", t); |
522d6614 NS |
2514 | return error_mark_node; |
2515 | } | |
ebf0bf7f JJ |
2516 | |
2517 | /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733 | |
2518 | are passed the same as decimal scalar types. */ | |
cd924144 JM |
2519 | if (TREE_CODE (t) == RECORD_TYPE |
2520 | && !processing_template_decl) | |
ebf0bf7f | 2521 | { |
cd924144 JM |
2522 | tree ns = TYPE_CONTEXT (t); |
2523 | if (ns && TREE_CODE (ns) == NAMESPACE_DECL | |
2524 | && DECL_CONTEXT (ns) == std_node | |
935c0a5d | 2525 | && DECL_NAME (ns) |
cd924144 JM |
2526 | && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal")) |
2527 | { | |
2528 | const char *n = TYPE_NAME_STRING (t); | |
2529 | if ((strcmp (n, "decimal32") == 0) | |
2530 | || (strcmp (n, "decimal64") == 0) | |
2531 | || (strcmp (n, "decimal128") == 0)) | |
2532 | TYPE_TRANSPARENT_AGGR (t) = 1; | |
2533 | } | |
ebf0bf7f JJ |
2534 | } |
2535 | ||
47ee8904 MM |
2536 | /* A non-implicit typename comes from code like: |
2537 | ||
2538 | template <typename T> struct A { | |
0cbd7506 | 2539 | template <typename U> struct A<T>::B ... |
47ee8904 MM |
2540 | |
2541 | This is erroneous. */ | |
2542 | else if (TREE_CODE (t) == TYPENAME_TYPE) | |
2543 | { | |
a82e1a7d | 2544 | error ("invalid definition of qualified type %qT", t); |
47ee8904 MM |
2545 | t = error_mark_node; |
2546 | } | |
2547 | ||
9e1e64ec | 2548 | if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t)) |
ce4a0391 | 2549 | { |
9e1e64ec | 2550 | t = make_class_type (RECORD_TYPE); |
bd3d082e | 2551 | pushtag (make_anon_name (), t, /*tag_scope=*/ts_current); |
ce4a0391 | 2552 | } |
830fcda8 | 2553 | |
4c571114 | 2554 | if (TYPE_BEING_DEFINED (t)) |
ce4a0391 | 2555 | { |
9e1e64ec | 2556 | t = make_class_type (TREE_CODE (t)); |
bd3d082e | 2557 | pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current); |
ce4a0391 | 2558 | } |
ff350acd | 2559 | maybe_process_partial_specialization (t); |
29370796 | 2560 | pushclass (t); |
ce4a0391 | 2561 | TYPE_BEING_DEFINED (t) = 1; |
b9e75696 JM |
2562 | |
2563 | cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE); | |
8943989d | 2564 | fixup_attribute_variants (t); |
b9e75696 | 2565 | |
c0694c4b MM |
2566 | if (flag_pack_struct) |
2567 | { | |
2568 | tree v; | |
2569 | TYPE_PACKED (t) = 1; | |
2570 | /* Even though the type is being defined for the first time | |
2571 | here, there might have been a forward declaration, so there | |
2572 | might be cv-qualified variants of T. */ | |
2573 | for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v)) | |
2574 | TYPE_PACKED (v) = 1; | |
2575 | } | |
ce4a0391 MM |
2576 | /* Reset the interface data, at the earliest possible |
2577 | moment, as it might have been set via a class foo; | |
2578 | before. */ | |
1951a1b6 JM |
2579 | if (! TYPE_ANONYMOUS_P (t)) |
2580 | { | |
c533e34d | 2581 | struct c_fileinfo *finfo = get_fileinfo (input_filename); |
5d709b00 | 2582 | CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only; |
1951a1b6 | 2583 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X |
5d709b00 | 2584 | (t, finfo->interface_unknown); |
1951a1b6 | 2585 | } |
ce4a0391 | 2586 | reset_specialization(); |
c8094d83 | 2587 | |
b7975aed MM |
2588 | /* Make a declaration for this class in its own scope. */ |
2589 | build_self_reference (); | |
2590 | ||
830fcda8 | 2591 | return t; |
ce4a0391 MM |
2592 | } |
2593 | ||
61a127b3 MM |
2594 | /* Finish the member declaration given by DECL. */ |
2595 | ||
2596 | void | |
3a978d72 | 2597 | finish_member_declaration (tree decl) |
61a127b3 MM |
2598 | { |
2599 | if (decl == error_mark_node || decl == NULL_TREE) | |
2600 | return; | |
2601 | ||
2602 | if (decl == void_type_node) | |
2603 | /* The COMPONENT was a friend, not a member, and so there's | |
2604 | nothing for us to do. */ | |
2605 | return; | |
2606 | ||
2607 | /* We should see only one DECL at a time. */ | |
910ad8de | 2608 | gcc_assert (DECL_CHAIN (decl) == NULL_TREE); |
61a127b3 MM |
2609 | |
2610 | /* Set up access control for DECL. */ | |
c8094d83 | 2611 | TREE_PRIVATE (decl) |
61a127b3 | 2612 | = (current_access_specifier == access_private_node); |
c8094d83 | 2613 | TREE_PROTECTED (decl) |
61a127b3 MM |
2614 | = (current_access_specifier == access_protected_node); |
2615 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
2616 | { | |
17aec3eb RK |
2617 | TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl); |
2618 | TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl); | |
61a127b3 MM |
2619 | } |
2620 | ||
2621 | /* Mark the DECL as a member of the current class. */ | |
4f1c5b7d | 2622 | DECL_CONTEXT (decl) = current_class_type; |
61a127b3 | 2623 | |
b1d7b1c0 | 2624 | /* Check for bare parameter packs in the member variable declaration. */ |
1ad8aeeb | 2625 | if (TREE_CODE (decl) == FIELD_DECL) |
4439d02f | 2626 | { |
7b3e2d46 | 2627 | if (check_for_bare_parameter_packs (TREE_TYPE (decl))) |
4439d02f | 2628 | TREE_TYPE (decl) = error_mark_node; |
7b3e2d46 | 2629 | if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl))) |
4439d02f DG |
2630 | DECL_ATTRIBUTES (decl) = NULL_TREE; |
2631 | } | |
b1d7b1c0 | 2632 | |
421844e7 MM |
2633 | /* [dcl.link] |
2634 | ||
2635 | A C language linkage is ignored for the names of class members | |
2636 | and the member function type of class member functions. */ | |
2637 | if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c) | |
5d2ed28c | 2638 | SET_DECL_LANGUAGE (decl, lang_cplusplus); |
421844e7 | 2639 | |
61a127b3 MM |
2640 | /* Put functions on the TYPE_METHODS list and everything else on the |
2641 | TYPE_FIELDS list. Note that these are built up in reverse order. | |
2642 | We reverse them (to obtain declaration order) in finish_struct. */ | |
c8094d83 | 2643 | if (TREE_CODE (decl) == FUNCTION_DECL |
61a127b3 MM |
2644 | || DECL_FUNCTION_TEMPLATE_P (decl)) |
2645 | { | |
2646 | /* We also need to add this function to the | |
2647 | CLASSTYPE_METHOD_VEC. */ | |
b77fe7b4 NS |
2648 | if (add_method (current_class_type, decl, NULL_TREE)) |
2649 | { | |
910ad8de | 2650 | DECL_CHAIN (decl) = TYPE_METHODS (current_class_type); |
b77fe7b4 | 2651 | TYPE_METHODS (current_class_type) = decl; |
f139561c | 2652 | |
b77fe7b4 NS |
2653 | maybe_add_class_template_decl_list (current_class_type, decl, |
2654 | /*friend_p=*/0); | |
2655 | } | |
61a127b3 | 2656 | } |
f139561c | 2657 | /* Enter the DECL into the scope of the class. */ |
98ed9dae | 2658 | else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl)) |
399dedb9 | 2659 | || pushdecl_class_level (decl)) |
61a127b3 MM |
2660 | { |
2661 | /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields | |
2662 | go at the beginning. The reason is that lookup_field_1 | |
2663 | searches the list in order, and we want a field name to | |
2664 | override a type name so that the "struct stat hack" will | |
2665 | work. In particular: | |
2666 | ||
2667 | struct S { enum E { }; int E } s; | |
2668 | s.E = 3; | |
2669 | ||
0e339752 | 2670 | is valid. In addition, the FIELD_DECLs must be maintained in |
61a127b3 MM |
2671 | declaration order so that class layout works as expected. |
2672 | However, we don't need that order until class layout, so we | |
2673 | save a little time by putting FIELD_DECLs on in reverse order | |
2674 | here, and then reversing them in finish_struct_1. (We could | |
2675 | also keep a pointer to the correct insertion points in the | |
2676 | list.) */ | |
2677 | ||
2678 | if (TREE_CODE (decl) == TYPE_DECL) | |
c8094d83 | 2679 | TYPE_FIELDS (current_class_type) |
61a127b3 MM |
2680 | = chainon (TYPE_FIELDS (current_class_type), decl); |
2681 | else | |
2682 | { | |
910ad8de | 2683 | DECL_CHAIN (decl) = TYPE_FIELDS (current_class_type); |
61a127b3 MM |
2684 | TYPE_FIELDS (current_class_type) = decl; |
2685 | } | |
8f032717 | 2686 | |
c8094d83 | 2687 | maybe_add_class_template_decl_list (current_class_type, decl, |
f139561c | 2688 | /*friend_p=*/0); |
61a127b3 | 2689 | } |
5e2f4cd2 MM |
2690 | |
2691 | if (pch_file) | |
2692 | note_decl_for_pch (decl); | |
2693 | } | |
2694 | ||
2695 | /* DECL has been declared while we are building a PCH file. Perform | |
2696 | actions that we might normally undertake lazily, but which can be | |
2697 | performed now so that they do not have to be performed in | |
2698 | translation units which include the PCH file. */ | |
2699 | ||
2700 | void | |
2701 | note_decl_for_pch (tree decl) | |
2702 | { | |
2703 | gcc_assert (pch_file); | |
2704 | ||
5e2f4cd2 MM |
2705 | /* There's a good chance that we'll have to mangle names at some |
2706 | point, even if only for emission in debugging information. */ | |
ec0897de JM |
2707 | if ((TREE_CODE (decl) == VAR_DECL |
2708 | || TREE_CODE (decl) == FUNCTION_DECL) | |
2709 | && !processing_template_decl) | |
5e2f4cd2 | 2710 | mangle_decl (decl); |
61a127b3 MM |
2711 | } |
2712 | ||
306ef644 | 2713 | /* Finish processing a complete template declaration. The PARMS are |
36a117a5 MM |
2714 | the template parameters. */ |
2715 | ||
2716 | void | |
3a978d72 | 2717 | finish_template_decl (tree parms) |
36a117a5 MM |
2718 | { |
2719 | if (parms) | |
2720 | end_template_decl (); | |
2721 | else | |
2722 | end_specialization (); | |
2723 | } | |
2724 | ||
509fc277 | 2725 | /* Finish processing a template-id (which names a type) of the form |
36a117a5 | 2726 | NAME < ARGS >. Return the TYPE_DECL for the type named by the |
838dfd8a | 2727 | template-id. If ENTERING_SCOPE is nonzero we are about to enter |
36a117a5 MM |
2728 | the scope of template-id indicated. */ |
2729 | ||
2730 | tree | |
3a978d72 | 2731 | finish_template_type (tree name, tree args, int entering_scope) |
36a117a5 MM |
2732 | { |
2733 | tree decl; | |
2734 | ||
2735 | decl = lookup_template_class (name, args, | |
42eaed49 | 2736 | NULL_TREE, NULL_TREE, entering_scope, |
23fca1f5 | 2737 | tf_warning_or_error | tf_user); |
36a117a5 MM |
2738 | if (decl != error_mark_node) |
2739 | decl = TYPE_STUB_DECL (decl); | |
2740 | ||
2741 | return decl; | |
2742 | } | |
648f19f6 | 2743 | |
ea6021e8 MM |
2744 | /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER. |
2745 | Return a TREE_LIST containing the ACCESS_SPECIFIER and the | |
2746 | BASE_CLASS, or NULL_TREE if an error occurred. The | |
aba649ba | 2747 | ACCESS_SPECIFIER is one of |
809e3e7f NS |
2748 | access_{default,public,protected_private}_node. For a virtual base |
2749 | we set TREE_TYPE. */ | |
ea6021e8 | 2750 | |
c8094d83 | 2751 | tree |
dbbf88d1 | 2752 | finish_base_specifier (tree base, tree access, bool virtual_p) |
ea6021e8 | 2753 | { |
ea6021e8 MM |
2754 | tree result; |
2755 | ||
dbbf88d1 | 2756 | if (base == error_mark_node) |
acb044ee GDR |
2757 | { |
2758 | error ("invalid base-class specification"); | |
2759 | result = NULL_TREE; | |
2760 | } | |
9e1e64ec PC |
2761 | else if (! MAYBE_CLASS_TYPE_P (base)) |
2762 | { | |
2763 | error ("%qT is not a class type", base); | |
2764 | result = NULL_TREE; | |
2765 | } | |
ea6021e8 | 2766 | else |
bb92901d | 2767 | { |
dbbf88d1 | 2768 | if (cp_type_quals (base) != 0) |
0cbd7506 | 2769 | { |
546a4197 PC |
2770 | /* DR 484: Can a base-specifier name a cv-qualified |
2771 | class type? */ | |
0cbd7506 MS |
2772 | base = TYPE_MAIN_VARIANT (base); |
2773 | } | |
dbbf88d1 | 2774 | result = build_tree_list (access, base); |
809e3e7f NS |
2775 | if (virtual_p) |
2776 | TREE_TYPE (result) = integer_type_node; | |
bb92901d | 2777 | } |
ea6021e8 MM |
2778 | |
2779 | return result; | |
2780 | } | |
61a127b3 | 2781 | |
eff3a276 MM |
2782 | /* If FNS is a member function, a set of member functions, or a |
2783 | template-id referring to one or more member functions, return a | |
2784 | BASELINK for FNS, incorporating the current access context. | |
2785 | Otherwise, return FNS unchanged. */ | |
2786 | ||
2787 | tree | |
2788 | baselink_for_fns (tree fns) | |
2789 | { | |
2790 | tree fn; | |
2791 | tree cl; | |
2792 | ||
2793 | if (BASELINK_P (fns) | |
eff3a276 MM |
2794 | || error_operand_p (fns)) |
2795 | return fns; | |
2796 | ||
2797 | fn = fns; | |
2798 | if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) | |
2799 | fn = TREE_OPERAND (fn, 0); | |
2800 | fn = get_first_fn (fn); | |
2801 | if (!DECL_FUNCTION_MEMBER_P (fn)) | |
2802 | return fns; | |
2803 | ||
2804 | cl = currently_open_derived_class (DECL_CONTEXT (fn)); | |
2805 | if (!cl) | |
2806 | cl = DECL_CONTEXT (fn); | |
2807 | cl = TYPE_BINFO (cl); | |
5a40306b | 2808 | return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE); |
eff3a276 MM |
2809 | } |
2810 | ||
d5f4eddd JM |
2811 | /* Returns true iff DECL is an automatic variable from a function outside |
2812 | the current one. */ | |
2813 | ||
2814 | static bool | |
2815 | outer_automatic_var_p (tree decl) | |
2816 | { | |
2817 | return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL) | |
2818 | && DECL_FUNCTION_SCOPE_P (decl) | |
2819 | && !TREE_STATIC (decl) | |
2820 | && DECL_CONTEXT (decl) != current_function_decl); | |
2821 | } | |
2822 | ||
9660afe0 JM |
2823 | /* Returns true iff DECL is a capture field from a lambda that is not our |
2824 | immediate context. */ | |
2825 | ||
2826 | static bool | |
2827 | outer_lambda_capture_p (tree decl) | |
2828 | { | |
2829 | return (TREE_CODE (decl) == FIELD_DECL | |
2830 | && LAMBDA_TYPE_P (DECL_CONTEXT (decl)) | |
19030d77 JM |
2831 | && (!current_class_type |
2832 | || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type))); | |
9660afe0 JM |
2833 | } |
2834 | ||
b3445994 MM |
2835 | /* ID_EXPRESSION is a representation of parsed, but unprocessed, |
2836 | id-expression. (See cp_parser_id_expression for details.) SCOPE, | |
2837 | if non-NULL, is the type or namespace used to explicitly qualify | |
2838 | ID_EXPRESSION. DECL is the entity to which that name has been | |
c8094d83 | 2839 | resolved. |
b3445994 MM |
2840 | |
2841 | *CONSTANT_EXPRESSION_P is true if we are presently parsing a | |
2842 | constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will | |
2843 | be set to true if this expression isn't permitted in a | |
2844 | constant-expression, but it is otherwise not set by this function. | |
2845 | *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a | |
2846 | constant-expression, but a non-constant expression is also | |
2847 | permissible. | |
2848 | ||
02ed62dd MM |
2849 | DONE is true if this expression is a complete postfix-expression; |
2850 | it is false if this expression is followed by '->', '[', '(', etc. | |
2851 | ADDRESS_P is true iff this expression is the operand of '&'. | |
2852 | TEMPLATE_P is true iff the qualified-id was of the form | |
2853 | "A::template B". TEMPLATE_ARG_P is true iff this qualified name | |
2854 | appears as a template argument. | |
2855 | ||
b3445994 MM |
2856 | If an error occurs, and it is the kind of error that might cause |
2857 | the parser to abort a tentative parse, *ERROR_MSG is filled in. It | |
2858 | is the caller's responsibility to issue the message. *ERROR_MSG | |
2859 | will be a string with static storage duration, so the caller need | |
2860 | not "free" it. | |
2861 | ||
2862 | Return an expression for the entity, after issuing appropriate | |
2863 | diagnostics. This function is also responsible for transforming a | |
2864 | reference to a non-static member into a COMPONENT_REF that makes | |
c8094d83 | 2865 | the use of "this" explicit. |
b3445994 MM |
2866 | |
2867 | Upon return, *IDK will be filled in appropriately. */ | |
b3445994 | 2868 | tree |
c8094d83 | 2869 | finish_id_expression (tree id_expression, |
b3445994 MM |
2870 | tree decl, |
2871 | tree scope, | |
2872 | cp_id_kind *idk, | |
67c03833 JM |
2873 | bool integral_constant_expression_p, |
2874 | bool allow_non_integral_constant_expression_p, | |
2875 | bool *non_integral_constant_expression_p, | |
02ed62dd MM |
2876 | bool template_p, |
2877 | bool done, | |
2878 | bool address_p, | |
2879 | bool template_arg_p, | |
2b7a3abf DS |
2880 | const char **error_msg, |
2881 | location_t location) | |
b3445994 MM |
2882 | { |
2883 | /* Initialize the output parameters. */ | |
2884 | *idk = CP_ID_KIND_NONE; | |
2885 | *error_msg = NULL; | |
2886 | ||
2887 | if (id_expression == error_mark_node) | |
2888 | return error_mark_node; | |
2889 | /* If we have a template-id, then no further lookup is | |
2890 | required. If the template-id was for a template-class, we | |
2891 | will sometimes have a TYPE_DECL at this point. */ | |
2892 | else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR | |
ee935db4 | 2893 | || TREE_CODE (decl) == TYPE_DECL) |
b3445994 MM |
2894 | ; |
2895 | /* Look up the name. */ | |
c8094d83 | 2896 | else |
b3445994 MM |
2897 | { |
2898 | if (decl == error_mark_node) | |
2899 | { | |
2900 | /* Name lookup failed. */ | |
c8094d83 MS |
2901 | if (scope |
2902 | && (!TYPE_P (scope) | |
4546865e MM |
2903 | || (!dependent_type_p (scope) |
2904 | && !(TREE_CODE (id_expression) == IDENTIFIER_NODE | |
2905 | && IDENTIFIER_TYPENAME_P (id_expression) | |
2906 | && dependent_type_p (TREE_TYPE (id_expression)))))) | |
b3445994 | 2907 | { |
4546865e MM |
2908 | /* If the qualifying type is non-dependent (and the name |
2909 | does not name a conversion operator to a dependent | |
2910 | type), issue an error. */ | |
2b7a3abf | 2911 | qualified_name_lookup_error (scope, id_expression, decl, location); |
b3445994 MM |
2912 | return error_mark_node; |
2913 | } | |
2914 | else if (!scope) | |
2915 | { | |
2916 | /* It may be resolved via Koenig lookup. */ | |
2917 | *idk = CP_ID_KIND_UNQUALIFIED; | |
2918 | return id_expression; | |
2919 | } | |
4546865e MM |
2920 | else |
2921 | decl = id_expression; | |
b3445994 MM |
2922 | } |
2923 | /* If DECL is a variable that would be out of scope under | |
2924 | ANSI/ISO rules, but in scope in the ARM, name lookup | |
2925 | will succeed. Issue a diagnostic here. */ | |
2926 | else | |
2927 | decl = check_for_out_of_scope_variable (decl); | |
2928 | ||
2929 | /* Remember that the name was used in the definition of | |
2930 | the current class so that we can check later to see if | |
2931 | the meaning would have been different after the class | |
2932 | was entirely defined. */ | |
c97c25c0 JM |
2933 | if (!scope && decl != error_mark_node |
2934 | && TREE_CODE (id_expression) == IDENTIFIER_NODE) | |
b3445994 | 2935 | maybe_note_name_used_in_class (id_expression, decl); |
8ca4bf25 | 2936 | |
d5f4eddd JM |
2937 | /* Disallow uses of local variables from containing functions, except |
2938 | within lambda-expressions. */ | |
9660afe0 JM |
2939 | if ((outer_automatic_var_p (decl) |
2940 | || outer_lambda_capture_p (decl)) | |
d5f4eddd JM |
2941 | /* It's not a use (3.2) if we're in an unevaluated context. */ |
2942 | && !cp_unevaluated_operand) | |
8ca4bf25 | 2943 | { |
d5f4eddd JM |
2944 | tree context = DECL_CONTEXT (decl); |
2945 | tree containing_function = current_function_decl; | |
2946 | tree lambda_stack = NULL_TREE; | |
2947 | tree lambda_expr = NULL_TREE; | |
9660afe0 | 2948 | tree initializer = decl; |
d5f4eddd JM |
2949 | |
2950 | /* Core issue 696: "[At the July 2009 meeting] the CWG expressed | |
2951 | support for an approach in which a reference to a local | |
2952 | [constant] automatic variable in a nested class or lambda body | |
2953 | would enter the expression as an rvalue, which would reduce | |
2954 | the complexity of the problem" | |
2955 | ||
2956 | FIXME update for final resolution of core issue 696. */ | |
aef4a215 | 2957 | if (decl_constant_var_p (decl)) |
d5f4eddd JM |
2958 | return integral_constant_value (decl); |
2959 | ||
9660afe0 JM |
2960 | if (TYPE_P (context)) |
2961 | { | |
2962 | /* Implicit capture of an explicit capture. */ | |
2963 | context = lambda_function (context); | |
2964 | initializer = thisify_lambda_field (decl); | |
2965 | } | |
2966 | ||
d5f4eddd JM |
2967 | /* If we are in a lambda function, we can move out until we hit |
2968 | 1. the context, | |
2969 | 2. a non-lambda function, or | |
2970 | 3. a non-default capturing lambda function. */ | |
2971 | while (context != containing_function | |
2972 | && LAMBDA_FUNCTION_P (containing_function)) | |
2973 | { | |
2974 | lambda_expr = CLASSTYPE_LAMBDA_EXPR | |
2975 | (DECL_CONTEXT (containing_function)); | |
2976 | ||
2977 | if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) | |
2978 | == CPLD_NONE) | |
2979 | break; | |
2980 | ||
2981 | lambda_stack = tree_cons (NULL_TREE, | |
2982 | lambda_expr, | |
2983 | lambda_stack); | |
2984 | ||
2985 | containing_function | |
2986 | = decl_function_context (containing_function); | |
2987 | } | |
2988 | ||
2989 | if (context == containing_function) | |
2990 | { | |
2991 | decl = add_default_capture (lambda_stack, | |
2992 | /*id=*/DECL_NAME (decl), | |
9660afe0 | 2993 | initializer); |
d5f4eddd JM |
2994 | } |
2995 | else if (lambda_expr) | |
2996 | { | |
2997 | error ("%qD is not captured", decl); | |
2998 | return error_mark_node; | |
2999 | } | |
3000 | else | |
8ca4bf25 MM |
3001 | { |
3002 | error (TREE_CODE (decl) == VAR_DECL | |
3003 | ? "use of %<auto%> variable from containing function" | |
3004 | : "use of parameter from containing function"); | |
3005 | error (" %q+#D declared here", decl); | |
3006 | return error_mark_node; | |
3007 | } | |
3008 | } | |
da9bc840 JM |
3009 | |
3010 | /* Also disallow uses of function parameters outside the function | |
3011 | body, except inside an unevaluated context (i.e. decltype). */ | |
3012 | if (TREE_CODE (decl) == PARM_DECL | |
3013 | && DECL_CONTEXT (decl) == NULL_TREE | |
3014 | && !cp_unevaluated_operand) | |
3015 | { | |
3016 | error ("use of parameter %qD outside function body", decl); | |
3017 | return error_mark_node; | |
3018 | } | |
b3445994 MM |
3019 | } |
3020 | ||
3021 | /* If we didn't find anything, or what we found was a type, | |
3022 | then this wasn't really an id-expression. */ | |
3023 | if (TREE_CODE (decl) == TEMPLATE_DECL | |
3024 | && !DECL_FUNCTION_TEMPLATE_P (decl)) | |
3025 | { | |
3026 | *error_msg = "missing template arguments"; | |
3027 | return error_mark_node; | |
3028 | } | |
3029 | else if (TREE_CODE (decl) == TYPE_DECL | |
3030 | || TREE_CODE (decl) == NAMESPACE_DECL) | |
3031 | { | |
3032 | *error_msg = "expected primary-expression"; | |
3033 | return error_mark_node; | |
3034 | } | |
3035 | ||
3036 | /* If the name resolved to a template parameter, there is no | |
931a9c05 GB |
3037 | need to look it up again later. */ |
3038 | if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl)) | |
3039 | || TREE_CODE (decl) == TEMPLATE_PARM_INDEX) | |
b3445994 | 3040 | { |
db24eb1f | 3041 | tree r; |
c8094d83 | 3042 | |
b3445994 | 3043 | *idk = CP_ID_KIND_NONE; |
931a9c05 GB |
3044 | if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX) |
3045 | decl = TEMPLATE_PARM_DECL (decl); | |
db24eb1f | 3046 | r = convert_from_reference (DECL_INITIAL (decl)); |
c8094d83 MS |
3047 | |
3048 | if (integral_constant_expression_p | |
68deab91 | 3049 | && !dependent_type_p (TREE_TYPE (decl)) |
db24eb1f | 3050 | && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r)))) |
931a9c05 | 3051 | { |
67c03833 | 3052 | if (!allow_non_integral_constant_expression_p) |
a82e1a7d | 3053 | error ("template parameter %qD of type %qT is not allowed in " |
931a9c05 GB |
3054 | "an integral constant expression because it is not of " |
3055 | "integral or enumeration type", decl, TREE_TYPE (decl)); | |
67c03833 | 3056 | *non_integral_constant_expression_p = true; |
931a9c05 | 3057 | } |
db24eb1f | 3058 | return r; |
931a9c05 | 3059 | } |
c8094d83 | 3060 | /* Similarly, we resolve enumeration constants to their |
931a9c05 GB |
3061 | underlying values. */ |
3062 | else if (TREE_CODE (decl) == CONST_DECL) | |
3063 | { | |
3064 | *idk = CP_ID_KIND_NONE; | |
3065 | if (!processing_template_decl) | |
6193b8b7 DJ |
3066 | { |
3067 | used_types_insert (TREE_TYPE (decl)); | |
3068 | return DECL_INITIAL (decl); | |
3069 | } | |
b3445994 MM |
3070 | return decl; |
3071 | } | |
3072 | else | |
3073 | { | |
3074 | bool dependent_p; | |
3075 | ||
3076 | /* If the declaration was explicitly qualified indicate | |
3077 | that. The semantics of `A::f(3)' are different than | |
3078 | `f(3)' if `f' is virtual. */ | |
c8094d83 | 3079 | *idk = (scope |
b3445994 MM |
3080 | ? CP_ID_KIND_QUALIFIED |
3081 | : (TREE_CODE (decl) == TEMPLATE_ID_EXPR | |
3082 | ? CP_ID_KIND_TEMPLATE_ID | |
3083 | : CP_ID_KIND_UNQUALIFIED)); | |
3084 | ||
3085 | ||
3086 | /* [temp.dep.expr] | |
3087 | ||
3088 | An id-expression is type-dependent if it contains an | |
3089 | identifier that was declared with a dependent type. | |
3090 | ||
b3445994 MM |
3091 | The standard is not very specific about an id-expression that |
3092 | names a set of overloaded functions. What if some of them | |
3093 | have dependent types and some of them do not? Presumably, | |
3094 | such a name should be treated as a dependent name. */ | |
3095 | /* Assume the name is not dependent. */ | |
3096 | dependent_p = false; | |
3097 | if (!processing_template_decl) | |
3098 | /* No names are dependent outside a template. */ | |
3099 | ; | |
3100 | /* A template-id where the name of the template was not resolved | |
3101 | is definitely dependent. */ | |
3102 | else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR | |
c8094d83 | 3103 | && (TREE_CODE (TREE_OPERAND (decl, 0)) |
b3445994 MM |
3104 | == IDENTIFIER_NODE)) |
3105 | dependent_p = true; | |
3106 | /* For anything except an overloaded function, just check its | |
3107 | type. */ | |
3108 | else if (!is_overloaded_fn (decl)) | |
c8094d83 | 3109 | dependent_p |
b3445994 MM |
3110 | = dependent_type_p (TREE_TYPE (decl)); |
3111 | /* For a set of overloaded functions, check each of the | |
3112 | functions. */ | |
3113 | else | |
3114 | { | |
3115 | tree fns = decl; | |
3116 | ||
3117 | if (BASELINK_P (fns)) | |
3118 | fns = BASELINK_FUNCTIONS (fns); | |
3119 | ||
3120 | /* For a template-id, check to see if the template | |
3121 | arguments are dependent. */ | |
3122 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) | |
3123 | { | |
3124 | tree args = TREE_OPERAND (fns, 1); | |
3125 | dependent_p = any_dependent_template_arguments_p (args); | |
3126 | /* The functions are those referred to by the | |
3127 | template-id. */ | |
3128 | fns = TREE_OPERAND (fns, 0); | |
3129 | } | |
3130 | ||
3131 | /* If there are no dependent template arguments, go through | |
cd0be382 | 3132 | the overloaded functions. */ |
b3445994 MM |
3133 | while (fns && !dependent_p) |
3134 | { | |
3135 | tree fn = OVL_CURRENT (fns); | |
3136 | ||
3137 | /* Member functions of dependent classes are | |
3138 | dependent. */ | |
3139 | if (TREE_CODE (fn) == FUNCTION_DECL | |
3140 | && type_dependent_expression_p (fn)) | |
3141 | dependent_p = true; | |
3142 | else if (TREE_CODE (fn) == TEMPLATE_DECL | |
3143 | && dependent_template_p (fn)) | |
3144 | dependent_p = true; | |
3145 | ||
3146 | fns = OVL_NEXT (fns); | |
3147 | } | |
3148 | } | |
3149 | ||
3150 | /* If the name was dependent on a template parameter, we will | |
3151 | resolve the name at instantiation time. */ | |
3152 | if (dependent_p) | |
3153 | { | |
3154 | /* Create a SCOPE_REF for qualified names, if the scope is | |
3155 | dependent. */ | |
3156 | if (scope) | |
3157 | { | |
02ed62dd MM |
3158 | if (TYPE_P (scope)) |
3159 | { | |
3160 | if (address_p && done) | |
3161 | decl = finish_qualified_id_expr (scope, decl, | |
3162 | done, address_p, | |
3163 | template_p, | |
3164 | template_arg_p); | |
7e361ae6 JM |
3165 | else |
3166 | { | |
3167 | tree type = NULL_TREE; | |
3168 | if (DECL_P (decl) && !dependent_scope_p (scope)) | |
3169 | type = TREE_TYPE (decl); | |
3170 | decl = build_qualified_name (type, | |
3171 | scope, | |
3172 | id_expression, | |
3173 | template_p); | |
3174 | } | |
02ed62dd MM |
3175 | } |
3176 | if (TREE_TYPE (decl)) | |
3177 | decl = convert_from_reference (decl); | |
3178 | return decl; | |
b3445994 MM |
3179 | } |
3180 | /* A TEMPLATE_ID already contains all the information we | |
3181 | need. */ | |
3182 | if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR) | |
3183 | return id_expression; | |
10b1d5e7 | 3184 | *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT; |
5a98fa7b MM |
3185 | /* If we found a variable, then name lookup during the |
3186 | instantiation will always resolve to the same VAR_DECL | |
3187 | (or an instantiation thereof). */ | |
3c398f34 MM |
3188 | if (TREE_CODE (decl) == VAR_DECL |
3189 | || TREE_CODE (decl) == PARM_DECL) | |
db24eb1f | 3190 | return convert_from_reference (decl); |
bad1f462 KL |
3191 | /* The same is true for FIELD_DECL, but we also need to |
3192 | make sure that the syntax is correct. */ | |
3193 | else if (TREE_CODE (decl) == FIELD_DECL) | |
a26ddf11 KL |
3194 | { |
3195 | /* Since SCOPE is NULL here, this is an unqualified name. | |
3196 | Access checking has been performed during name lookup | |
3197 | already. Turn off checking to avoid duplicate errors. */ | |
3198 | push_deferring_access_checks (dk_no_check); | |
3199 | decl = finish_non_static_data_member | |
2defb926 | 3200 | (decl, NULL_TREE, |
a26ddf11 KL |
3201 | /*qualifying_scope=*/NULL_TREE); |
3202 | pop_deferring_access_checks (); | |
3203 | return decl; | |
3204 | } | |
10b1d5e7 | 3205 | return id_expression; |
b3445994 MM |
3206 | } |
3207 | ||
415d4636 | 3208 | if (TREE_CODE (decl) == NAMESPACE_DECL) |
9e95d15f | 3209 | { |
a82e1a7d | 3210 | error ("use of namespace %qD as expression", decl); |
9e95d15f NS |
3211 | return error_mark_node; |
3212 | } | |
3213 | else if (DECL_CLASS_TEMPLATE_P (decl)) | |
3214 | { | |
a82e1a7d | 3215 | error ("use of class template %qT as expression", decl); |
9e95d15f NS |
3216 | return error_mark_node; |
3217 | } | |
3218 | else if (TREE_CODE (decl) == TREE_LIST) | |
3219 | { | |
3220 | /* Ambiguous reference to base members. */ | |
a82e1a7d | 3221 | error ("request for member %qD is ambiguous in " |
9e95d15f NS |
3222 | "multiple inheritance lattice", id_expression); |
3223 | print_candidates (decl); | |
3224 | return error_mark_node; | |
3225 | } | |
415d4636 MM |
3226 | |
3227 | /* Mark variable-like entities as used. Functions are similarly | |
3228 | marked either below or after overload resolution. */ | |
3229 | if (TREE_CODE (decl) == VAR_DECL | |
3230 | || TREE_CODE (decl) == PARM_DECL | |
3231 | || TREE_CODE (decl) == RESULT_DECL) | |
3232 | mark_used (decl); | |
3233 | ||
aef4a215 JM |
3234 | /* Only certain kinds of names are allowed in constant |
3235 | expression. Enumerators and template parameters have already | |
3236 | been handled above. */ | |
7f7d4b12 DS |
3237 | if (! error_operand_p (decl) |
3238 | && integral_constant_expression_p | |
aef4a215 JM |
3239 | && ! decl_constant_var_p (decl) |
3240 | && ! builtin_valid_in_constant_expr_p (decl)) | |
3241 | { | |
3242 | if (!allow_non_integral_constant_expression_p) | |
3243 | { | |
3244 | error ("%qD cannot appear in a constant-expression", decl); | |
3245 | return error_mark_node; | |
3246 | } | |
3247 | *non_integral_constant_expression_p = true; | |
3248 | } | |
3249 | ||
415d4636 MM |
3250 | if (scope) |
3251 | { | |
c8094d83 | 3252 | decl = (adjust_result_of_qualified_name_lookup |
415d4636 | 3253 | (decl, scope, current_class_type)); |
e20bcc5e JH |
3254 | |
3255 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
3256 | mark_used (decl); | |
3257 | ||
415d4636 | 3258 | if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl)) |
02ed62dd MM |
3259 | decl = finish_qualified_id_expr (scope, |
3260 | decl, | |
3261 | done, | |
3262 | address_p, | |
3263 | template_p, | |
3264 | template_arg_p); | |
db24eb1f NS |
3265 | else |
3266 | { | |
3267 | tree r = convert_from_reference (decl); | |
c8094d83 | 3268 | |
d3a79fcc JM |
3269 | /* In a template, return a SCOPE_REF for most qualified-ids |
3270 | so that we can check access at instantiation time. But if | |
3271 | we're looking at a member of the current instantiation, we | |
3272 | know we have access and building up the SCOPE_REF confuses | |
3273 | non-type template argument handling. */ | |
3274 | if (processing_template_decl && TYPE_P (scope) | |
3275 | && !currently_open_class (scope)) | |
02ed62dd MM |
3276 | r = build_qualified_name (TREE_TYPE (r), |
3277 | scope, decl, | |
3278 | template_p); | |
db24eb1f NS |
3279 | decl = r; |
3280 | } | |
415d4636 | 3281 | } |
9e95d15f | 3282 | else if (TREE_CODE (decl) == FIELD_DECL) |
a26ddf11 KL |
3283 | { |
3284 | /* Since SCOPE is NULL here, this is an unqualified name. | |
3285 | Access checking has been performed during name lookup | |
3286 | already. Turn off checking to avoid duplicate errors. */ | |
3287 | push_deferring_access_checks (dk_no_check); | |
2defb926 | 3288 | decl = finish_non_static_data_member (decl, NULL_TREE, |
a26ddf11 KL |
3289 | /*qualifying_scope=*/NULL_TREE); |
3290 | pop_deferring_access_checks (); | |
3291 | } | |
9e95d15f NS |
3292 | else if (is_overloaded_fn (decl)) |
3293 | { | |
eff3a276 | 3294 | tree first_fn; |
b3445994 | 3295 | |
294e855f | 3296 | first_fn = get_first_fn (decl); |
9e95d15f NS |
3297 | if (TREE_CODE (first_fn) == TEMPLATE_DECL) |
3298 | first_fn = DECL_TEMPLATE_RESULT (first_fn); | |
415d4636 MM |
3299 | |
3300 | if (!really_overloaded_fn (decl)) | |
3301 | mark_used (first_fn); | |
3302 | ||
02ed62dd MM |
3303 | if (!template_arg_p |
3304 | && TREE_CODE (first_fn) == FUNCTION_DECL | |
821eaf2a MM |
3305 | && DECL_FUNCTION_MEMBER_P (first_fn) |
3306 | && !shared_member_p (decl)) | |
9e95d15f NS |
3307 | { |
3308 | /* A set of member functions. */ | |
3309 | decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0); | |
02ed62dd | 3310 | return finish_class_member_access_expr (decl, id_expression, |
5ade1ed2 DG |
3311 | /*template_p=*/false, |
3312 | tf_warning_or_error); | |
9e95d15f | 3313 | } |
eff3a276 MM |
3314 | |
3315 | decl = baselink_for_fns (decl); | |
9e95d15f NS |
3316 | } |
3317 | else | |
3318 | { | |
9e95d15f | 3319 | if (DECL_P (decl) && DECL_NONLOCAL (decl) |
24f58e74 | 3320 | && DECL_CLASS_SCOPE_P (decl)) |
9e95d15f | 3321 | { |
24f58e74 PC |
3322 | tree context = context_for_name_lookup (decl); |
3323 | if (context != current_class_type) | |
3324 | { | |
3325 | tree path = currently_open_derived_class (context); | |
3326 | perform_or_defer_access_check (TYPE_BINFO (path), | |
3327 | decl, decl); | |
3328 | } | |
9e95d15f | 3329 | } |
c8094d83 | 3330 | |
db24eb1f | 3331 | decl = convert_from_reference (decl); |
9e95d15f | 3332 | } |
b3445994 MM |
3333 | } |
3334 | ||
3335 | if (TREE_DEPRECATED (decl)) | |
9b86d6bb | 3336 | warn_deprecated_use (decl, NULL_TREE); |
b3445994 MM |
3337 | |
3338 | return decl; | |
3339 | } | |
3340 | ||
0213a355 JM |
3341 | /* Implement the __typeof keyword: Return the type of EXPR, suitable for |
3342 | use as a type-specifier. */ | |
3343 | ||
b894fc05 | 3344 | tree |
3a978d72 | 3345 | finish_typeof (tree expr) |
b894fc05 | 3346 | { |
65a5559b MM |
3347 | tree type; |
3348 | ||
dffbbe80 | 3349 | if (type_dependent_expression_p (expr)) |
b894fc05 | 3350 | { |
9e1e64ec | 3351 | type = cxx_make_type (TYPEOF_TYPE); |
eb34af89 | 3352 | TYPEOF_TYPE_EXPR (type) = expr; |
3ad6a8e1 | 3353 | SET_TYPE_STRUCTURAL_EQUALITY (type); |
b894fc05 | 3354 | |
65a5559b | 3355 | return type; |
b894fc05 JM |
3356 | } |
3357 | ||
03a904b5 JJ |
3358 | expr = mark_type_use (expr); |
3359 | ||
3c38f0ff | 3360 | type = unlowered_expr_type (expr); |
65a5559b MM |
3361 | |
3362 | if (!type || type == unknown_type_node) | |
3363 | { | |
a82e1a7d | 3364 | error ("type of %qE is unknown", expr); |
65a5559b MM |
3365 | return error_mark_node; |
3366 | } | |
3367 | ||
3368 | return type; | |
b894fc05 | 3369 | } |
558475f0 | 3370 | |
a0d260fc PC |
3371 | /* Implement the __underlying_type keyword: Return the underlying |
3372 | type of TYPE, suitable for use as a type-specifier. */ | |
3373 | ||
3374 | tree | |
3375 | finish_underlying_type (tree type) | |
3376 | { | |
3377 | tree underlying_type; | |
3378 | ||
3379 | if (processing_template_decl) | |
3380 | { | |
3381 | underlying_type = cxx_make_type (UNDERLYING_TYPE); | |
3382 | UNDERLYING_TYPE_TYPE (underlying_type) = type; | |
3383 | SET_TYPE_STRUCTURAL_EQUALITY (underlying_type); | |
3384 | ||
3385 | return underlying_type; | |
3386 | } | |
3387 | ||
3388 | complete_type (type); | |
3389 | ||
3390 | if (TREE_CODE (type) != ENUMERAL_TYPE) | |
3391 | { | |
3392 | error ("%qE is not an enumeration type", type); | |
3393 | return error_mark_node; | |
3394 | } | |
3395 | ||
3396 | underlying_type = ENUM_UNDERLYING_TYPE (type); | |
3397 | ||
3398 | /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE | |
3399 | includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information. | |
3400 | See finish_enum_value_list for details. */ | |
3401 | if (!ENUM_FIXED_UNDERLYING_TYPE_P (type)) | |
3402 | underlying_type | |
3403 | = c_common_type_for_mode (TYPE_MODE (underlying_type), | |
3404 | TYPE_UNSIGNED (underlying_type)); | |
3405 | ||
3406 | return underlying_type; | |
3407 | } | |
3408 | ||
c291f8b1 VR |
3409 | /* Perform C++-specific checks for __builtin_offsetof before calling |
3410 | fold_offsetof. */ | |
3411 | ||
3412 | tree | |
3413 | finish_offsetof (tree expr) | |
3414 | { | |
4c65a534 VR |
3415 | if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR) |
3416 | { | |
3417 | error ("cannot apply %<offsetof%> to destructor %<~%T%>", | |
3418 | TREE_OPERAND (expr, 2)); | |
3419 | return error_mark_node; | |
3420 | } | |
c291f8b1 VR |
3421 | if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE |
3422 | || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE | |
fbfc8363 | 3423 | || TREE_TYPE (expr) == unknown_type_node) |
c291f8b1 | 3424 | { |
1916c916 VR |
3425 | if (TREE_CODE (expr) == COMPONENT_REF |
3426 | || TREE_CODE (expr) == COMPOUND_EXPR) | |
0a9367cb VR |
3427 | expr = TREE_OPERAND (expr, 1); |
3428 | error ("cannot apply %<offsetof%> to member function %qD", expr); | |
c291f8b1 VR |
3429 | return error_mark_node; |
3430 | } | |
60c4d135 JJ |
3431 | if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr)) |
3432 | expr = TREE_OPERAND (expr, 0); | |
6d4d7b0e | 3433 | return fold_offsetof (expr, NULL_TREE); |
c291f8b1 VR |
3434 | } |
3435 | ||
9eeb200f JM |
3436 | /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This |
3437 | function is broken out from the above for the benefit of the tree-ssa | |
3438 | project. */ | |
3439 | ||
3440 | void | |
3441 | simplify_aggr_init_expr (tree *tp) | |
3442 | { | |
3443 | tree aggr_init_expr = *tp; | |
3444 | ||
3eb24f73 | 3445 | /* Form an appropriate CALL_EXPR. */ |
5039610b SL |
3446 | tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr); |
3447 | tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr); | |
2692eb7d | 3448 | tree type = TREE_TYPE (slot); |
9eeb200f JM |
3449 | |
3450 | tree call_expr; | |
3451 | enum style_t { ctor, arg, pcc } style; | |
4977bab6 | 3452 | |
3eb24f73 | 3453 | if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr)) |
4977bab6 ZW |
3454 | style = ctor; |
3455 | #ifdef PCC_STATIC_STRUCT_RETURN | |
3456 | else if (1) | |
3457 | style = pcc; | |
3458 | #endif | |
4977bab6 | 3459 | else |
315fb5db NS |
3460 | { |
3461 | gcc_assert (TREE_ADDRESSABLE (type)); | |
3462 | style = arg; | |
3463 | } | |
4977bab6 | 3464 | |
db3927fb AH |
3465 | call_expr = build_call_array_loc (input_location, |
3466 | TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))), | |
3467 | fn, | |
3468 | aggr_init_expr_nargs (aggr_init_expr), | |
3469 | AGGR_INIT_EXPR_ARGP (aggr_init_expr)); | |
d8a0d13e | 3470 | TREE_NOTHROW (call_expr) = TREE_NOTHROW (aggr_init_expr); |
5039610b | 3471 | |
fa47911c | 3472 | if (style == ctor) |
3eb24f73 | 3473 | { |
fa47911c JM |
3474 | /* Replace the first argument to the ctor with the address of the |
3475 | slot. */ | |
dffd7eb6 | 3476 | cxx_mark_addressable (slot); |
5039610b SL |
3477 | CALL_EXPR_ARG (call_expr, 0) = |
3478 | build1 (ADDR_EXPR, build_pointer_type (type), slot); | |
3eb24f73 | 3479 | } |
5039610b | 3480 | else if (style == arg) |
fa47911c JM |
3481 | { |
3482 | /* Just mark it addressable here, and leave the rest to | |
3483 | expand_call{,_inline}. */ | |
3484 | cxx_mark_addressable (slot); | |
3485 | CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true; | |
941f78d1 | 3486 | call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr); |
fa47911c | 3487 | } |
4977bab6 | 3488 | else if (style == pcc) |
3eb24f73 | 3489 | { |
4977bab6 ZW |
3490 | /* If we're using the non-reentrant PCC calling convention, then we |
3491 | need to copy the returned value out of the static buffer into the | |
3492 | SLOT. */ | |
78757caa | 3493 | push_deferring_access_checks (dk_no_check); |
46af705a | 3494 | call_expr = build_aggr_init (slot, call_expr, |
5ade1ed2 DG |
3495 | DIRECT_BIND | LOOKUP_ONLYCONVERTING, |
3496 | tf_warning_or_error); | |
78757caa | 3497 | pop_deferring_access_checks (); |
d17791d6 | 3498 | call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot); |
3eb24f73 | 3499 | } |
3eb24f73 | 3500 | |
450a927a JM |
3501 | if (AGGR_INIT_ZERO_FIRST (aggr_init_expr)) |
3502 | { | |
3503 | tree init = build_zero_init (type, NULL_TREE, | |
3504 | /*static_storage_p=*/false); | |
3505 | init = build2 (INIT_EXPR, void_type_node, slot, init); | |
3506 | call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr), | |
3507 | init, call_expr); | |
3508 | } | |
3509 | ||
3eb24f73 | 3510 | *tp = call_expr; |
3eb24f73 MM |
3511 | } |
3512 | ||
31f8e4f3 MM |
3513 | /* Emit all thunks to FN that should be emitted when FN is emitted. */ |
3514 | ||
e89d6010 | 3515 | void |
3a978d72 | 3516 | emit_associated_thunks (tree fn) |
31f8e4f3 MM |
3517 | { |
3518 | /* When we use vcall offsets, we emit thunks with the virtual | |
3519 | functions to which they thunk. The whole point of vcall offsets | |
3520 | is so that you can know statically the entire set of thunks that | |
3521 | will ever be needed for a given virtual function, thereby | |
3522 | enabling you to output all the thunks with the function itself. */ | |
4537ec0c DN |
3523 | if (DECL_VIRTUAL_P (fn) |
3524 | /* Do not emit thunks for extern template instantiations. */ | |
3525 | && ! DECL_REALLY_EXTERN (fn)) | |
31f8e4f3 | 3526 | { |
bb5e8a7f | 3527 | tree thunk; |
c8094d83 | 3528 | |
910ad8de | 3529 | for (thunk = DECL_THUNKS (fn); thunk; thunk = DECL_CHAIN (thunk)) |
4977bab6 | 3530 | { |
e00853fd | 3531 | if (!THUNK_ALIAS (thunk)) |
4977bab6 | 3532 | { |
bb885938 NS |
3533 | use_thunk (thunk, /*emit_p=*/1); |
3534 | if (DECL_RESULT_THUNK_P (thunk)) | |
3535 | { | |
3536 | tree probe; | |
c8094d83 | 3537 | |
bb885938 | 3538 | for (probe = DECL_THUNKS (thunk); |
910ad8de | 3539 | probe; probe = DECL_CHAIN (probe)) |
bb885938 NS |
3540 | use_thunk (probe, /*emit_p=*/1); |
3541 | } | |
4977bab6 | 3542 | } |
bb885938 | 3543 | else |
50bc768d | 3544 | gcc_assert (!DECL_THUNKS (thunk)); |
4977bab6 | 3545 | } |
31f8e4f3 MM |
3546 | } |
3547 | } | |
3548 | ||
558475f0 MM |
3549 | /* Generate RTL for FN. */ |
3550 | ||
b2583345 JJ |
3551 | bool |
3552 | expand_or_defer_fn_1 (tree fn) | |
8cd2462c JH |
3553 | { |
3554 | /* When the parser calls us after finishing the body of a template | |
c353b8e3 MM |
3555 | function, we don't really want to expand the body. */ |
3556 | if (processing_template_decl) | |
8cd2462c JH |
3557 | { |
3558 | /* Normally, collection only occurs in rest_of_compilation. So, | |
3559 | if we don't collect here, we never collect junk generated | |
3560 | during the processing of templates until we hit a | |
27250734 MM |
3561 | non-template function. It's not safe to do this inside a |
3562 | nested class, though, as the parser may have local state that | |
3563 | is not a GC root. */ | |
3564 | if (!function_depth) | |
3565 | ggc_collect (); | |
b2583345 | 3566 | return false; |
8cd2462c JH |
3567 | } |
3568 | ||
a406865a | 3569 | gcc_assert (DECL_SAVED_TREE (fn)); |
726a989a | 3570 | |
8cd2462c JH |
3571 | /* If this is a constructor or destructor body, we have to clone |
3572 | it. */ | |
3573 | if (maybe_clone_body (fn)) | |
3574 | { | |
3575 | /* We don't want to process FN again, so pretend we've written | |
3576 | it out, even though we haven't. */ | |
3577 | TREE_ASM_WRITTEN (fn) = 1; | |
c6a21142 | 3578 | DECL_SAVED_TREE (fn) = NULL_TREE; |
b2583345 | 3579 | return false; |
8cd2462c JH |
3580 | } |
3581 | ||
4684cd27 MM |
3582 | /* We make a decision about linkage for these functions at the end |
3583 | of the compilation. Until that point, we do not want the back | |
3584 | end to output them -- but we do want it to see the bodies of | |
1a10290c | 3585 | these functions so that it can inline them as appropriate. */ |
4684cd27 MM |
3586 | if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn)) |
3587 | { | |
1ef0df47 MM |
3588 | if (DECL_INTERFACE_KNOWN (fn)) |
3589 | /* We've already made a decision as to how this function will | |
3590 | be handled. */; | |
3591 | else if (!at_eof) | |
4684cd27 MM |
3592 | { |
3593 | DECL_EXTERNAL (fn) = 1; | |
3594 | DECL_NOT_REALLY_EXTERN (fn) = 1; | |
3595 | note_vague_linkage_fn (fn); | |
1ef0df47 MM |
3596 | /* A non-template inline function with external linkage will |
3597 | always be COMDAT. As we must eventually determine the | |
3598 | linkage of all functions, and as that causes writes to | |
3599 | the data mapped in from the PCH file, it's advantageous | |
3600 | to mark the functions at this point. */ | |
3601 | if (!DECL_IMPLICIT_INSTANTIATION (fn)) | |
3602 | { | |
3603 | /* This function must have external linkage, as | |
3604 | otherwise DECL_INTERFACE_KNOWN would have been | |
3605 | set. */ | |
3606 | gcc_assert (TREE_PUBLIC (fn)); | |
3607 | comdat_linkage (fn); | |
3608 | DECL_INTERFACE_KNOWN (fn) = 1; | |
3609 | } | |
4684cd27 MM |
3610 | } |
3611 | else | |
3612 | import_export_decl (fn); | |
1a10290c MM |
3613 | |
3614 | /* If the user wants us to keep all inline functions, then mark | |
3615 | this function as needed so that finish_file will make sure to | |
fe2978fb MM |
3616 | output it later. Similarly, all dllexport'd functions must |
3617 | be emitted; there may be callers in other DLLs. */ | |
3fc20697 RG |
3618 | if ((flag_keep_inline_functions |
3619 | && DECL_DECLARED_INLINE_P (fn) | |
3620 | && !DECL_REALLY_EXTERN (fn)) | |
47ea1edf DK |
3621 | || (flag_keep_inline_dllexport |
3622 | && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))) | |
1a10290c | 3623 | mark_needed (fn); |
4684cd27 MM |
3624 | } |
3625 | ||
8cd2462c JH |
3626 | /* There's no reason to do any of the work here if we're only doing |
3627 | semantic analysis; this code just generates RTL. */ | |
3628 | if (flag_syntax_only) | |
b2583345 JJ |
3629 | return false; |
3630 | ||
3631 | return true; | |
3632 | } | |
8cd2462c | 3633 | |
b2583345 JJ |
3634 | void |
3635 | expand_or_defer_fn (tree fn) | |
3636 | { | |
3637 | if (expand_or_defer_fn_1 (fn)) | |
3638 | { | |
3639 | function_depth++; | |
99edd65d | 3640 | |
b2583345 JJ |
3641 | /* Expand or defer, at the whim of the compilation unit manager. */ |
3642 | cgraph_finalize_function (fn, function_depth > 1); | |
6744a6ab | 3643 | emit_associated_thunks (fn); |
99edd65d | 3644 | |
b2583345 JJ |
3645 | function_depth--; |
3646 | } | |
8cd2462c JH |
3647 | } |
3648 | ||
6de9cd9a DN |
3649 | struct nrv_data |
3650 | { | |
3651 | tree var; | |
3652 | tree result; | |
3653 | htab_t visited; | |
3654 | }; | |
0d97bf4c | 3655 | |
6de9cd9a DN |
3656 | /* Helper function for walk_tree, used by finalize_nrv below. */ |
3657 | ||
3658 | static tree | |
3659 | finalize_nrv_r (tree* tp, int* walk_subtrees, void* data) | |
0d97bf4c | 3660 | { |
6de9cd9a DN |
3661 | struct nrv_data *dp = (struct nrv_data *)data; |
3662 | void **slot; | |
07b2f2fd JM |
3663 | |
3664 | /* No need to walk into types. There wouldn't be any need to walk into | |
3665 | non-statements, except that we have to consider STMT_EXPRs. */ | |
0d97bf4c JM |
3666 | if (TYPE_P (*tp)) |
3667 | *walk_subtrees = 0; | |
6de9cd9a DN |
3668 | /* Change all returns to just refer to the RESULT_DECL; this is a nop, |
3669 | but differs from using NULL_TREE in that it indicates that we care | |
3670 | about the value of the RESULT_DECL. */ | |
5088b058 RH |
3671 | else if (TREE_CODE (*tp) == RETURN_EXPR) |
3672 | TREE_OPERAND (*tp, 0) = dp->result; | |
6de9cd9a DN |
3673 | /* Change all cleanups for the NRV to only run when an exception is |
3674 | thrown. */ | |
07b2f2fd | 3675 | else if (TREE_CODE (*tp) == CLEANUP_STMT |
6de9cd9a | 3676 | && CLEANUP_DECL (*tp) == dp->var) |
659e5a7a | 3677 | CLEANUP_EH_ONLY (*tp) = 1; |
350fae66 | 3678 | /* Replace the DECL_EXPR for the NRV with an initialization of the |
6de9cd9a | 3679 | RESULT_DECL, if needed. */ |
350fae66 RK |
3680 | else if (TREE_CODE (*tp) == DECL_EXPR |
3681 | && DECL_EXPR_DECL (*tp) == dp->var) | |
6de9cd9a DN |
3682 | { |
3683 | tree init; | |
3684 | if (DECL_INITIAL (dp->var) | |
3685 | && DECL_INITIAL (dp->var) != error_mark_node) | |
2d188530 JJ |
3686 | init = build2 (INIT_EXPR, void_type_node, dp->result, |
3687 | DECL_INITIAL (dp->var)); | |
6de9cd9a | 3688 | else |
c2255bc4 | 3689 | init = build_empty_stmt (EXPR_LOCATION (*tp)); |
2d188530 | 3690 | DECL_INITIAL (dp->var) = NULL_TREE; |
5e278028 | 3691 | SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp)); |
6de9cd9a DN |
3692 | *tp = init; |
3693 | } | |
3694 | /* And replace all uses of the NRV with the RESULT_DECL. */ | |
3695 | else if (*tp == dp->var) | |
3696 | *tp = dp->result; | |
3697 | ||
3698 | /* Avoid walking into the same tree more than once. Unfortunately, we | |
3699 | can't just use walk_tree_without duplicates because it would only call | |
3700 | us for the first occurrence of dp->var in the function body. */ | |
3701 | slot = htab_find_slot (dp->visited, *tp, INSERT); | |
3702 | if (*slot) | |
3703 | *walk_subtrees = 0; | |
3704 | else | |
3705 | *slot = *tp; | |
0d97bf4c JM |
3706 | |
3707 | /* Keep iterating. */ | |
3708 | return NULL_TREE; | |
3709 | } | |
3710 | ||
6de9cd9a | 3711 | /* Called from finish_function to implement the named return value |
5088b058 | 3712 | optimization by overriding all the RETURN_EXPRs and pertinent |
6de9cd9a DN |
3713 | CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the |
3714 | RESULT_DECL for the function. */ | |
f444e36b | 3715 | |
4985cde3 | 3716 | void |
6de9cd9a | 3717 | finalize_nrv (tree *tp, tree var, tree result) |
f444e36b | 3718 | { |
6de9cd9a DN |
3719 | struct nrv_data data; |
3720 | ||
add86e09 | 3721 | /* Copy name from VAR to RESULT. */ |
6de9cd9a | 3722 | DECL_NAME (result) = DECL_NAME (var); |
6de9cd9a DN |
3723 | /* Don't forget that we take its address. */ |
3724 | TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var); | |
add86e09 JJ |
3725 | /* Finally set DECL_VALUE_EXPR to avoid assigning |
3726 | a stack slot at -O0 for the original var and debug info | |
3727 | uses RESULT location for VAR. */ | |
3728 | SET_DECL_VALUE_EXPR (var, result); | |
3729 | DECL_HAS_VALUE_EXPR_P (var) = 1; | |
6de9cd9a DN |
3730 | |
3731 | data.var = var; | |
3732 | data.result = result; | |
3733 | data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL); | |
14588106 | 3734 | cp_walk_tree (tp, finalize_nrv_r, &data, 0); |
6de9cd9a | 3735 | htab_delete (data.visited); |
b850de4f | 3736 | } |
1799e5d5 | 3737 | \f |
a68ab351 JJ |
3738 | /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */ |
3739 | ||
3740 | bool | |
3741 | cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor, | |
3742 | bool need_copy_ctor, bool need_copy_assignment) | |
3743 | { | |
3744 | int save_errorcount = errorcount; | |
3745 | tree info, t; | |
3746 | ||
3747 | /* Always allocate 3 elements for simplicity. These are the | |
3748 | function decls for the ctor, dtor, and assignment op. | |
3749 | This layout is known to the three lang hooks, | |
3750 | cxx_omp_clause_default_init, cxx_omp_clause_copy_init, | |
3751 | and cxx_omp_clause_assign_op. */ | |
3752 | info = make_tree_vec (3); | |
3753 | CP_OMP_CLAUSE_INFO (c) = info; | |
3754 | ||
ac177431 | 3755 | if (need_default_ctor || need_copy_ctor) |
a68ab351 JJ |
3756 | { |
3757 | if (need_default_ctor) | |
ac177431 | 3758 | t = get_default_ctor (type); |
a68ab351 | 3759 | else |
ac177431 JM |
3760 | t = get_copy_ctor (type); |
3761 | ||
3762 | if (t && !trivial_fn_p (t)) | |
3763 | TREE_VEC_ELT (info, 0) = t; | |
a68ab351 JJ |
3764 | } |
3765 | ||
3766 | if ((need_default_ctor || need_copy_ctor) | |
3767 | && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
ac177431 | 3768 | TREE_VEC_ELT (info, 1) = get_dtor (type); |
a68ab351 | 3769 | |
ac177431 | 3770 | if (need_copy_assignment) |
a68ab351 | 3771 | { |
ac177431 JM |
3772 | t = get_copy_assign (type); |
3773 | ||
3774 | if (t && !trivial_fn_p (t)) | |
3775 | TREE_VEC_ELT (info, 2) = t; | |
a68ab351 JJ |
3776 | } |
3777 | ||
3778 | return errorcount != save_errorcount; | |
3779 | } | |
3780 | ||
1799e5d5 RH |
3781 | /* For all elements of CLAUSES, validate them vs OpenMP constraints. |
3782 | Remove any elements from the list that are invalid. */ | |
3783 | ||
3784 | tree | |
3785 | finish_omp_clauses (tree clauses) | |
3786 | { | |
3787 | bitmap_head generic_head, firstprivate_head, lastprivate_head; | |
3788 | tree c, t, *pc = &clauses; | |
3789 | const char *name; | |
3790 | ||
3791 | bitmap_obstack_initialize (NULL); | |
3792 | bitmap_initialize (&generic_head, &bitmap_default_obstack); | |
3793 | bitmap_initialize (&firstprivate_head, &bitmap_default_obstack); | |
3794 | bitmap_initialize (&lastprivate_head, &bitmap_default_obstack); | |
3795 | ||
3796 | for (pc = &clauses, c = clauses; c ; c = *pc) | |
3797 | { | |
3798 | bool remove = false; | |
3799 | ||
3800 | switch (OMP_CLAUSE_CODE (c)) | |
3801 | { | |
3802 | case OMP_CLAUSE_SHARED: | |
3803 | name = "shared"; | |
3804 | goto check_dup_generic; | |
3805 | case OMP_CLAUSE_PRIVATE: | |
3806 | name = "private"; | |
3807 | goto check_dup_generic; | |
3808 | case OMP_CLAUSE_REDUCTION: | |
3809 | name = "reduction"; | |
3810 | goto check_dup_generic; | |
3811 | case OMP_CLAUSE_COPYPRIVATE: | |
3812 | name = "copyprivate"; | |
3813 | goto check_dup_generic; | |
3814 | case OMP_CLAUSE_COPYIN: | |
3815 | name = "copyin"; | |
3816 | goto check_dup_generic; | |
3817 | check_dup_generic: | |
3818 | t = OMP_CLAUSE_DECL (c); | |
3819 | if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) | |
3820 | { | |
3821 | if (processing_template_decl) | |
3822 | break; | |
76dc15d4 JJ |
3823 | if (DECL_P (t)) |
3824 | error ("%qD is not a variable in clause %qs", t, name); | |
3825 | else | |
3826 | error ("%qE is not a variable in clause %qs", t, name); | |
1799e5d5 RH |
3827 | remove = true; |
3828 | } | |
3829 | else if (bitmap_bit_p (&generic_head, DECL_UID (t)) | |
3830 | || bitmap_bit_p (&firstprivate_head, DECL_UID (t)) | |
3831 | || bitmap_bit_p (&lastprivate_head, DECL_UID (t))) | |
3832 | { | |
76dc15d4 | 3833 | error ("%qD appears more than once in data clauses", t); |
1799e5d5 RH |
3834 | remove = true; |
3835 | } | |
3836 | else | |
3837 | bitmap_set_bit (&generic_head, DECL_UID (t)); | |
3838 | break; | |
3839 | ||
3840 | case OMP_CLAUSE_FIRSTPRIVATE: | |
3841 | t = OMP_CLAUSE_DECL (c); | |
3842 | if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) | |
3843 | { | |
3844 | if (processing_template_decl) | |
3845 | break; | |
85b20612 JJ |
3846 | if (DECL_P (t)) |
3847 | error ("%qD is not a variable in clause %<firstprivate%>", t); | |
3848 | else | |
3849 | error ("%qE is not a variable in clause %<firstprivate%>", t); | |
1799e5d5 RH |
3850 | remove = true; |
3851 | } | |
3852 | else if (bitmap_bit_p (&generic_head, DECL_UID (t)) | |
3853 | || bitmap_bit_p (&firstprivate_head, DECL_UID (t))) | |
3854 | { | |
85b20612 | 3855 | error ("%qD appears more than once in data clauses", t); |
1799e5d5 RH |
3856 | remove = true; |
3857 | } | |
3858 | else | |
3859 | bitmap_set_bit (&firstprivate_head, DECL_UID (t)); | |
3860 | break; | |
3861 | ||
3862 | case OMP_CLAUSE_LASTPRIVATE: | |
3863 | t = OMP_CLAUSE_DECL (c); | |
3864 | if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) | |
3865 | { | |
3866 | if (processing_template_decl) | |
3867 | break; | |
85b20612 JJ |
3868 | if (DECL_P (t)) |
3869 | error ("%qD is not a variable in clause %<lastprivate%>", t); | |
3870 | else | |
3871 | error ("%qE is not a variable in clause %<lastprivate%>", t); | |
1799e5d5 RH |
3872 | remove = true; |
3873 | } | |
3874 | else if (bitmap_bit_p (&generic_head, DECL_UID (t)) | |
3875 | || bitmap_bit_p (&lastprivate_head, DECL_UID (t))) | |
3876 | { | |
85b20612 | 3877 | error ("%qD appears more than once in data clauses", t); |
1799e5d5 RH |
3878 | remove = true; |
3879 | } | |
3880 | else | |
3881 | bitmap_set_bit (&lastprivate_head, DECL_UID (t)); | |
3882 | break; | |
3883 | ||
3884 | case OMP_CLAUSE_IF: | |
3885 | t = OMP_CLAUSE_IF_EXPR (c); | |
3886 | t = maybe_convert_cond (t); | |
3887 | if (t == error_mark_node) | |
3888 | remove = true; | |
3889 | OMP_CLAUSE_IF_EXPR (c) = t; | |
3890 | break; | |
3891 | ||
3892 | case OMP_CLAUSE_NUM_THREADS: | |
3893 | t = OMP_CLAUSE_NUM_THREADS_EXPR (c); | |
3894 | if (t == error_mark_node) | |
3895 | remove = true; | |
6e684eee JJ |
3896 | else if (!type_dependent_expression_p (t) |
3897 | && !INTEGRAL_TYPE_P (TREE_TYPE (t))) | |
1799e5d5 RH |
3898 | { |
3899 | error ("num_threads expression must be integral"); | |
3900 | remove = true; | |
3901 | } | |
3902 | break; | |
3903 | ||
3904 | case OMP_CLAUSE_SCHEDULE: | |
3905 | t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c); | |
3906 | if (t == NULL) | |
3907 | ; | |
3908 | else if (t == error_mark_node) | |
3909 | remove = true; | |
6e684eee JJ |
3910 | else if (!type_dependent_expression_p (t) |
3911 | && !INTEGRAL_TYPE_P (TREE_TYPE (t))) | |
1799e5d5 RH |
3912 | { |
3913 | error ("schedule chunk size expression must be integral"); | |
3914 | remove = true; | |
3915 | } | |
3916 | break; | |
3917 | ||
3918 | case OMP_CLAUSE_NOWAIT: | |
3919 | case OMP_CLAUSE_ORDERED: | |
3920 | case OMP_CLAUSE_DEFAULT: | |
a68ab351 JJ |
3921 | case OMP_CLAUSE_UNTIED: |
3922 | case OMP_CLAUSE_COLLAPSE: | |
1799e5d5 RH |
3923 | break; |
3924 | ||
3925 | default: | |
3926 | gcc_unreachable (); | |
3927 | } | |
3928 | ||
3929 | if (remove) | |
3930 | *pc = OMP_CLAUSE_CHAIN (c); | |
3931 | else | |
3932 | pc = &OMP_CLAUSE_CHAIN (c); | |
3933 | } | |
3934 | ||
3935 | for (pc = &clauses, c = clauses; c ; c = *pc) | |
3936 | { | |
81f40b79 | 3937 | enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c); |
1799e5d5 RH |
3938 | bool remove = false; |
3939 | bool need_complete_non_reference = false; | |
3940 | bool need_default_ctor = false; | |
3941 | bool need_copy_ctor = false; | |
3942 | bool need_copy_assignment = false; | |
3943 | bool need_implicitly_determined = false; | |
3944 | tree type, inner_type; | |
3945 | ||
3946 | switch (c_kind) | |
3947 | { | |
3948 | case OMP_CLAUSE_SHARED: | |
3949 | name = "shared"; | |
3950 | need_implicitly_determined = true; | |
3951 | break; | |
3952 | case OMP_CLAUSE_PRIVATE: | |
3953 | name = "private"; | |
3954 | need_complete_non_reference = true; | |
3955 | need_default_ctor = true; | |
3956 | need_implicitly_determined = true; | |
3957 | break; | |
3958 | case OMP_CLAUSE_FIRSTPRIVATE: | |
3959 | name = "firstprivate"; | |
3960 | need_complete_non_reference = true; | |
3961 | need_copy_ctor = true; | |
3962 | need_implicitly_determined = true; | |
3963 | break; | |
3964 | case OMP_CLAUSE_LASTPRIVATE: | |
3965 | name = "lastprivate"; | |
3966 | need_complete_non_reference = true; | |
3967 | need_copy_assignment = true; | |
3968 | need_implicitly_determined = true; | |
3969 | break; | |
3970 | case OMP_CLAUSE_REDUCTION: | |
3971 | name = "reduction"; | |
3972 | need_implicitly_determined = true; | |
3973 | break; | |
3974 | case OMP_CLAUSE_COPYPRIVATE: | |
3975 | name = "copyprivate"; | |
3976 | need_copy_assignment = true; | |
3977 | break; | |
3978 | case OMP_CLAUSE_COPYIN: | |
3979 | name = "copyin"; | |
3980 | need_copy_assignment = true; | |
3981 | break; | |
3982 | default: | |
3983 | pc = &OMP_CLAUSE_CHAIN (c); | |
3984 | continue; | |
3985 | } | |
3986 | ||
3987 | t = OMP_CLAUSE_DECL (c); | |
3988 | if (processing_template_decl | |
3989 | && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) | |
3990 | { | |
3991 | pc = &OMP_CLAUSE_CHAIN (c); | |
3992 | continue; | |
3993 | } | |
3994 | ||
3995 | switch (c_kind) | |
3996 | { | |
3997 | case OMP_CLAUSE_LASTPRIVATE: | |
3998 | if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t))) | |
3999 | need_default_ctor = true; | |
4000 | break; | |
4001 | ||
4002 | case OMP_CLAUSE_REDUCTION: | |
4003 | if (AGGREGATE_TYPE_P (TREE_TYPE (t)) | |
4004 | || POINTER_TYPE_P (TREE_TYPE (t))) | |
4005 | { | |
4006 | error ("%qE has invalid type for %<reduction%>", t); | |
4007 | remove = true; | |
4008 | } | |
4009 | else if (FLOAT_TYPE_P (TREE_TYPE (t))) | |
4010 | { | |
4011 | enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c); | |
4012 | switch (r_code) | |
4013 | { | |
4014 | case PLUS_EXPR: | |
4015 | case MULT_EXPR: | |
4016 | case MINUS_EXPR: | |
4017 | break; | |
4018 | default: | |
4019 | error ("%qE has invalid type for %<reduction(%s)%>", | |
4020 | t, operator_name_info[r_code].name); | |
4021 | remove = true; | |
4022 | } | |
4023 | } | |
4024 | break; | |
4025 | ||
4026 | case OMP_CLAUSE_COPYIN: | |
4027 | if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t)) | |
4028 | { | |
4029 | error ("%qE must be %<threadprivate%> for %<copyin%>", t); | |
4030 | remove = true; | |
4031 | } | |
4032 | break; | |
4033 | ||
4034 | default: | |
4035 | break; | |
4036 | } | |
4037 | ||
4038 | if (need_complete_non_reference) | |
4039 | { | |
4040 | t = require_complete_type (t); | |
4041 | if (t == error_mark_node) | |
4042 | remove = true; | |
4043 | else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE) | |
4044 | { | |
4045 | error ("%qE has reference type for %qs", t, name); | |
4046 | remove = true; | |
4047 | } | |
4048 | } | |
4049 | if (need_implicitly_determined) | |
4050 | { | |
4051 | const char *share_name = NULL; | |
4052 | ||
4053 | if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t)) | |
4054 | share_name = "threadprivate"; | |
4055 | else switch (cxx_omp_predetermined_sharing (t)) | |
4056 | { | |
4057 | case OMP_CLAUSE_DEFAULT_UNSPECIFIED: | |
4058 | break; | |
4059 | case OMP_CLAUSE_DEFAULT_SHARED: | |
4060 | share_name = "shared"; | |
4061 | break; | |
4062 | case OMP_CLAUSE_DEFAULT_PRIVATE: | |
4063 | share_name = "private"; | |
4064 | break; | |
4065 | default: | |
4066 | gcc_unreachable (); | |
4067 | } | |
4068 | if (share_name) | |
4069 | { | |
4070 | error ("%qE is predetermined %qs for %qs", | |
4071 | t, share_name, name); | |
4072 | remove = true; | |
4073 | } | |
4074 | } | |
4075 | ||
4076 | /* We're interested in the base element, not arrays. */ | |
4077 | inner_type = type = TREE_TYPE (t); | |
4078 | while (TREE_CODE (inner_type) == ARRAY_TYPE) | |
4079 | inner_type = TREE_TYPE (inner_type); | |
4080 | ||
84dc00e8 | 4081 | /* Check for special function availability by building a call to one. |
1799e5d5 RH |
4082 | Save the results, because later we won't be in the right context |
4083 | for making these queries. */ | |
4084 | if (CLASS_TYPE_P (inner_type) | |
6f719560 | 4085 | && (need_default_ctor || need_copy_ctor || need_copy_assignment) |
a68ab351 JJ |
4086 | && !type_dependent_expression_p (t) |
4087 | && cxx_omp_create_clause_info (c, inner_type, need_default_ctor, | |
4088 | need_copy_ctor, need_copy_assignment)) | |
4089 | remove = true; | |
1799e5d5 RH |
4090 | |
4091 | if (remove) | |
4092 | *pc = OMP_CLAUSE_CHAIN (c); | |
4093 | else | |
4094 | pc = &OMP_CLAUSE_CHAIN (c); | |
4095 | } | |
4096 | ||
4097 | bitmap_obstack_release (NULL); | |
4098 | return clauses; | |
4099 | } | |
4100 | ||
4101 | /* For all variables in the tree_list VARS, mark them as thread local. */ | |
4102 | ||
4103 | void | |
4104 | finish_omp_threadprivate (tree vars) | |
4105 | { | |
4106 | tree t; | |
4107 | ||
4108 | /* Mark every variable in VARS to be assigned thread local storage. */ | |
4109 | for (t = vars; t; t = TREE_CHAIN (t)) | |
4110 | { | |
4111 | tree v = TREE_PURPOSE (t); | |
4112 | ||
edb6000e JJ |
4113 | if (error_operand_p (v)) |
4114 | ; | |
4115 | else if (TREE_CODE (v) != VAR_DECL) | |
4116 | error ("%<threadprivate%> %qD is not file, namespace " | |
4117 | "or block scope variable", v); | |
1799e5d5 RH |
4118 | /* If V had already been marked threadprivate, it doesn't matter |
4119 | whether it had been used prior to this point. */ | |
edb6000e | 4120 | else if (TREE_USED (v) |
1799e5d5 RH |
4121 | && (DECL_LANG_SPECIFIC (v) == NULL |
4122 | || !CP_DECL_THREADPRIVATE_P (v))) | |
4123 | error ("%qE declared %<threadprivate%> after first use", v); | |
4124 | else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v)) | |
4125 | error ("automatic variable %qE cannot be %<threadprivate%>", v); | |
4126 | else if (! COMPLETE_TYPE_P (TREE_TYPE (v))) | |
4127 | error ("%<threadprivate%> %qE has incomplete type", v); | |
a68ab351 JJ |
4128 | else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v)) |
4129 | && CP_DECL_CONTEXT (v) != current_class_type) | |
4130 | error ("%<threadprivate%> %qE directive not " | |
4131 | "in %qT definition", v, CP_DECL_CONTEXT (v)); | |
1799e5d5 RH |
4132 | else |
4133 | { | |
4134 | /* Allocate a LANG_SPECIFIC structure for V, if needed. */ | |
4135 | if (DECL_LANG_SPECIFIC (v) == NULL) | |
4136 | { | |
4137 | retrofit_lang_decl (v); | |
4138 | ||
4139 | /* Make sure that DECL_DISCRIMINATOR_P continues to be true | |
4140 | after the allocation of the lang_decl structure. */ | |
4141 | if (DECL_DISCRIMINATOR_P (v)) | |
b97e8a14 | 4142 | DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1; |
1799e5d5 RH |
4143 | } |
4144 | ||
4145 | if (! DECL_THREAD_LOCAL_P (v)) | |
4146 | { | |
4147 | DECL_TLS_MODEL (v) = decl_default_tls_model (v); | |
4148 | /* If rtl has been already set for this var, call | |
4149 | make_decl_rtl once again, so that encode_section_info | |
4150 | has a chance to look at the new decl flags. */ | |
4151 | if (DECL_RTL_SET_P (v)) | |
4152 | make_decl_rtl (v); | |
4153 | } | |
4154 | CP_DECL_THREADPRIVATE_P (v) = 1; | |
4155 | } | |
4156 | } | |
4157 | } | |
4158 | ||
4159 | /* Build an OpenMP structured block. */ | |
4160 | ||
4161 | tree | |
4162 | begin_omp_structured_block (void) | |
4163 | { | |
4164 | return do_pushlevel (sk_omp); | |
4165 | } | |
4166 | ||
4167 | tree | |
4168 | finish_omp_structured_block (tree block) | |
4169 | { | |
4170 | return do_poplevel (block); | |
4171 | } | |
4172 | ||
84dc00e8 | 4173 | /* Similarly, except force the retention of the BLOCK. */ |
1799e5d5 RH |
4174 | |
4175 | tree | |
4176 | begin_omp_parallel (void) | |
4177 | { | |
4178 | keep_next_level (true); | |
4179 | return begin_omp_structured_block (); | |
4180 | } | |
4181 | ||
4182 | tree | |
4183 | finish_omp_parallel (tree clauses, tree body) | |
4184 | { | |
4185 | tree stmt; | |
4186 | ||
4187 | body = finish_omp_structured_block (body); | |
b850de4f | 4188 | |
1799e5d5 RH |
4189 | stmt = make_node (OMP_PARALLEL); |
4190 | TREE_TYPE (stmt) = void_type_node; | |
4191 | OMP_PARALLEL_CLAUSES (stmt) = clauses; | |
4192 | OMP_PARALLEL_BODY (stmt) = body; | |
54f7877c | 4193 | |
1799e5d5 RH |
4194 | return add_stmt (stmt); |
4195 | } | |
4196 | ||
a68ab351 JJ |
4197 | tree |
4198 | begin_omp_task (void) | |
4199 | { | |
4200 | keep_next_level (true); | |
4201 | return begin_omp_structured_block (); | |
4202 | } | |
4203 | ||
4204 | tree | |
4205 | finish_omp_task (tree clauses, tree body) | |
4206 | { | |
4207 | tree stmt; | |
4208 | ||
4209 | body = finish_omp_structured_block (body); | |
4210 | ||
4211 | stmt = make_node (OMP_TASK); | |
4212 | TREE_TYPE (stmt) = void_type_node; | |
4213 | OMP_TASK_CLAUSES (stmt) = clauses; | |
4214 | OMP_TASK_BODY (stmt) = body; | |
4215 | ||
4216 | return add_stmt (stmt); | |
4217 | } | |
4218 | ||
4219 | /* Helper function for finish_omp_for. Convert Ith random access iterator | |
4220 | into integral iterator. Return FALSE if successful. */ | |
4221 | ||
4222 | static bool | |
4223 | handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv, | |
4224 | tree condv, tree incrv, tree *body, | |
4225 | tree *pre_body, tree clauses) | |
4226 | { | |
4227 | tree diff, iter_init, iter_incr = NULL, last; | |
4228 | tree incr_var = NULL, orig_pre_body, orig_body, c; | |
4229 | tree decl = TREE_VEC_ELT (declv, i); | |
4230 | tree init = TREE_VEC_ELT (initv, i); | |
4231 | tree cond = TREE_VEC_ELT (condv, i); | |
4232 | tree incr = TREE_VEC_ELT (incrv, i); | |
4233 | tree iter = decl; | |
4234 | location_t elocus = locus; | |
4235 | ||
4236 | if (init && EXPR_HAS_LOCATION (init)) | |
4237 | elocus = EXPR_LOCATION (init); | |
4238 | ||
4239 | switch (TREE_CODE (cond)) | |
4240 | { | |
4241 | case GT_EXPR: | |
4242 | case GE_EXPR: | |
4243 | case LT_EXPR: | |
4244 | case LE_EXPR: | |
c5cdb03f JJ |
4245 | if (TREE_OPERAND (cond, 1) == iter) |
4246 | cond = build2 (swap_tree_comparison (TREE_CODE (cond)), | |
4247 | TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0)); | |
a68ab351 JJ |
4248 | if (TREE_OPERAND (cond, 0) != iter) |
4249 | cond = error_mark_node; | |
4250 | else | |
4251 | { | |
4252 | tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK, | |
4253 | TREE_OPERAND (cond, 1), ERROR_MARK, | |
4254 | NULL, tf_warning_or_error); | |
4255 | if (error_operand_p (tem)) | |
4256 | return true; | |
4257 | } | |
4258 | break; | |
4259 | default: | |
4260 | cond = error_mark_node; | |
4261 | break; | |
4262 | } | |
4263 | if (cond == error_mark_node) | |
4264 | { | |
69bc6bff | 4265 | error_at (elocus, "invalid controlling predicate"); |
a68ab351 JJ |
4266 | return true; |
4267 | } | |
4268 | diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1), | |
4269 | ERROR_MARK, iter, ERROR_MARK, NULL, | |
4270 | tf_warning_or_error); | |
4271 | if (error_operand_p (diff)) | |
4272 | return true; | |
4273 | if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE) | |
4274 | { | |
69bc6bff MLI |
4275 | error_at (elocus, "difference between %qE and %qD does not have integer type", |
4276 | TREE_OPERAND (cond, 1), iter); | |
a68ab351 JJ |
4277 | return true; |
4278 | } | |
4279 | ||
4280 | switch (TREE_CODE (incr)) | |
4281 | { | |
4282 | case PREINCREMENT_EXPR: | |
4283 | case PREDECREMENT_EXPR: | |
4284 | case POSTINCREMENT_EXPR: | |
4285 | case POSTDECREMENT_EXPR: | |
4286 | if (TREE_OPERAND (incr, 0) != iter) | |
4287 | { | |
4288 | incr = error_mark_node; | |
4289 | break; | |
4290 | } | |
4291 | iter_incr = build_x_unary_op (TREE_CODE (incr), iter, | |
4292 | tf_warning_or_error); | |
4293 | if (error_operand_p (iter_incr)) | |
4294 | return true; | |
4295 | else if (TREE_CODE (incr) == PREINCREMENT_EXPR | |
4296 | || TREE_CODE (incr) == POSTINCREMENT_EXPR) | |
4297 | incr = integer_one_node; | |
4298 | else | |
4299 | incr = integer_minus_one_node; | |
4300 | break; | |
4301 | case MODIFY_EXPR: | |
4302 | if (TREE_OPERAND (incr, 0) != iter) | |
4303 | incr = error_mark_node; | |
4304 | else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR | |
4305 | || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR) | |
4306 | { | |
4307 | tree rhs = TREE_OPERAND (incr, 1); | |
4308 | if (TREE_OPERAND (rhs, 0) == iter) | |
4309 | { | |
4310 | if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1))) | |
4311 | != INTEGER_TYPE) | |
4312 | incr = error_mark_node; | |
4313 | else | |
4314 | { | |
4315 | iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs), | |
4316 | TREE_OPERAND (rhs, 1), | |
4317 | tf_warning_or_error); | |
4318 | if (error_operand_p (iter_incr)) | |
4319 | return true; | |
4320 | incr = TREE_OPERAND (rhs, 1); | |
4321 | incr = cp_convert (TREE_TYPE (diff), incr); | |
4322 | if (TREE_CODE (rhs) == MINUS_EXPR) | |
4323 | { | |
4324 | incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr); | |
4325 | incr = fold_if_not_in_template (incr); | |
4326 | } | |
4327 | if (TREE_CODE (incr) != INTEGER_CST | |
4328 | && (TREE_CODE (incr) != NOP_EXPR | |
4329 | || (TREE_CODE (TREE_OPERAND (incr, 0)) | |
4330 | != INTEGER_CST))) | |
4331 | iter_incr = NULL; | |
4332 | } | |
4333 | } | |
4334 | else if (TREE_OPERAND (rhs, 1) == iter) | |
4335 | { | |
4336 | if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE | |
4337 | || TREE_CODE (rhs) != PLUS_EXPR) | |
4338 | incr = error_mark_node; | |
4339 | else | |
4340 | { | |
4341 | iter_incr = build_x_binary_op (PLUS_EXPR, | |
4342 | TREE_OPERAND (rhs, 0), | |
4343 | ERROR_MARK, iter, | |
4344 | ERROR_MARK, NULL, | |
4345 | tf_warning_or_error); | |
4346 | if (error_operand_p (iter_incr)) | |
4347 | return true; | |
4348 | iter_incr = build_x_modify_expr (iter, NOP_EXPR, | |
4349 | iter_incr, | |
4350 | tf_warning_or_error); | |
4351 | if (error_operand_p (iter_incr)) | |
4352 | return true; | |
4353 | incr = TREE_OPERAND (rhs, 0); | |
4354 | iter_incr = NULL; | |
4355 | } | |
4356 | } | |
4357 | else | |
4358 | incr = error_mark_node; | |
4359 | } | |
4360 | else | |
4361 | incr = error_mark_node; | |
4362 | break; | |
4363 | default: | |
4364 | incr = error_mark_node; | |
4365 | break; | |
4366 | } | |
4367 | ||
4368 | if (incr == error_mark_node) | |
4369 | { | |
69bc6bff | 4370 | error_at (elocus, "invalid increment expression"); |
a68ab351 JJ |
4371 | return true; |
4372 | } | |
4373 | ||
4374 | incr = cp_convert (TREE_TYPE (diff), incr); | |
4375 | for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c)) | |
4376 | if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE | |
4377 | && OMP_CLAUSE_DECL (c) == iter) | |
4378 | break; | |
4379 | ||
4380 | decl = create_temporary_var (TREE_TYPE (diff)); | |
4381 | pushdecl (decl); | |
4382 | add_decl_expr (decl); | |
4383 | last = create_temporary_var (TREE_TYPE (diff)); | |
4384 | pushdecl (last); | |
4385 | add_decl_expr (last); | |
4386 | if (c && iter_incr == NULL) | |
4387 | { | |
4388 | incr_var = create_temporary_var (TREE_TYPE (diff)); | |
4389 | pushdecl (incr_var); | |
4390 | add_decl_expr (incr_var); | |
4391 | } | |
4392 | gcc_assert (stmts_are_full_exprs_p ()); | |
4393 | ||
4394 | orig_pre_body = *pre_body; | |
4395 | *pre_body = push_stmt_list (); | |
4396 | if (orig_pre_body) | |
4397 | add_stmt (orig_pre_body); | |
4398 | if (init != NULL) | |
4399 | finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init, | |
4400 | tf_warning_or_error)); | |
4401 | init = build_int_cst (TREE_TYPE (diff), 0); | |
4402 | if (c && iter_incr == NULL) | |
4403 | { | |
4404 | finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR, | |
4405 | incr, tf_warning_or_error)); | |
4406 | incr = incr_var; | |
4407 | iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr, | |
4408 | tf_warning_or_error); | |
4409 | } | |
4410 | finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init, | |
4411 | tf_warning_or_error)); | |
4412 | *pre_body = pop_stmt_list (*pre_body); | |
4413 | ||
ba47d38d AH |
4414 | cond = cp_build_binary_op (elocus, |
4415 | TREE_CODE (cond), decl, diff, | |
a68ab351 | 4416 | tf_warning_or_error); |
32e8bb8e | 4417 | incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR, |
c2255bc4 | 4418 | elocus, incr, NULL_TREE); |
a68ab351 JJ |
4419 | |
4420 | orig_body = *body; | |
4421 | *body = push_stmt_list (); | |
4422 | iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last); | |
4423 | iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init, | |
4424 | tf_warning_or_error); | |
4425 | iter_init = build1 (NOP_EXPR, void_type_node, iter_init); | |
4426 | finish_expr_stmt (iter_init); | |
4427 | finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl, | |
4428 | tf_warning_or_error)); | |
4429 | add_stmt (orig_body); | |
4430 | *body = pop_stmt_list (*body); | |
4431 | ||
4432 | if (c) | |
4433 | { | |
4434 | OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list (); | |
4435 | finish_expr_stmt (iter_incr); | |
4436 | OMP_CLAUSE_LASTPRIVATE_STMT (c) | |
4437 | = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c)); | |
4438 | } | |
4439 | ||
4440 | TREE_VEC_ELT (declv, i) = decl; | |
4441 | TREE_VEC_ELT (initv, i) = init; | |
4442 | TREE_VEC_ELT (condv, i) = cond; | |
4443 | TREE_VEC_ELT (incrv, i) = incr; | |
4444 | ||
4445 | return false; | |
4446 | } | |
4447 | ||
1799e5d5 RH |
4448 | /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR |
4449 | are directly for their associated operands in the statement. DECL | |
4450 | and INIT are a combo; if DECL is NULL then INIT ought to be a | |
4451 | MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are | |
4452 | optional statements that need to go before the loop into its | |
4453 | sk_omp scope. */ | |
4454 | ||
4455 | tree | |
a68ab351 JJ |
4456 | finish_omp_for (location_t locus, tree declv, tree initv, tree condv, |
4457 | tree incrv, tree body, tree pre_body, tree clauses) | |
4458 | { | |
4459 | tree omp_for = NULL, orig_incr = NULL; | |
4460 | tree decl, init, cond, incr; | |
4461 | location_t elocus; | |
4462 | int i; | |
4463 | ||
4464 | gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv)); | |
4465 | gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv)); | |
4466 | gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv)); | |
4467 | for (i = 0; i < TREE_VEC_LENGTH (declv); i++) | |
4468 | { | |
4469 | decl = TREE_VEC_ELT (declv, i); | |
4470 | init = TREE_VEC_ELT (initv, i); | |
4471 | cond = TREE_VEC_ELT (condv, i); | |
4472 | incr = TREE_VEC_ELT (incrv, i); | |
4473 | elocus = locus; | |
4474 | ||
4475 | if (decl == NULL) | |
4476 | { | |
4477 | if (init != NULL) | |
4478 | switch (TREE_CODE (init)) | |
1799e5d5 | 4479 | { |
a68ab351 | 4480 | case MODIFY_EXPR: |
1799e5d5 | 4481 | decl = TREE_OPERAND (init, 0); |
a68ab351 JJ |
4482 | init = TREE_OPERAND (init, 1); |
4483 | break; | |
4484 | case MODOP_EXPR: | |
4485 | if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR) | |
4486 | { | |
4487 | decl = TREE_OPERAND (init, 0); | |
4488 | init = TREE_OPERAND (init, 2); | |
4489 | } | |
4490 | break; | |
4491 | default: | |
4492 | break; | |
1799e5d5 | 4493 | } |
1799e5d5 | 4494 | |
a68ab351 JJ |
4495 | if (decl == NULL) |
4496 | { | |
69bc6bff MLI |
4497 | error_at (locus, |
4498 | "expected iteration declaration or initialization"); | |
a68ab351 JJ |
4499 | return NULL; |
4500 | } | |
1799e5d5 | 4501 | } |
1799e5d5 | 4502 | |
a68ab351 JJ |
4503 | if (init && EXPR_HAS_LOCATION (init)) |
4504 | elocus = EXPR_LOCATION (init); | |
1799e5d5 RH |
4505 | |
4506 | if (cond == NULL) | |
4507 | { | |
69bc6bff | 4508 | error_at (elocus, "missing controlling predicate"); |
1799e5d5 RH |
4509 | return NULL; |
4510 | } | |
4511 | ||
4512 | if (incr == NULL) | |
4513 | { | |
69bc6bff | 4514 | error_at (elocus, "missing increment expression"); |
1799e5d5 RH |
4515 | return NULL; |
4516 | } | |
4517 | ||
a68ab351 JJ |
4518 | TREE_VEC_ELT (declv, i) = decl; |
4519 | TREE_VEC_ELT (initv, i) = init; | |
4520 | } | |
4521 | ||
4522 | if (dependent_omp_for_p (declv, initv, condv, incrv)) | |
4523 | { | |
4524 | tree stmt; | |
4525 | ||
1799e5d5 RH |
4526 | stmt = make_node (OMP_FOR); |
4527 | ||
a68ab351 JJ |
4528 | for (i = 0; i < TREE_VEC_LENGTH (declv); i++) |
4529 | { | |
4530 | /* This is really just a place-holder. We'll be decomposing this | |
4531 | again and going through the cp_build_modify_expr path below when | |
4532 | we instantiate the thing. */ | |
4533 | TREE_VEC_ELT (initv, i) | |
4534 | = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i), | |
4535 | TREE_VEC_ELT (initv, i)); | |
4536 | } | |
1799e5d5 RH |
4537 | |
4538 | TREE_TYPE (stmt) = void_type_node; | |
a68ab351 JJ |
4539 | OMP_FOR_INIT (stmt) = initv; |
4540 | OMP_FOR_COND (stmt) = condv; | |
4541 | OMP_FOR_INCR (stmt) = incrv; | |
1799e5d5 RH |
4542 | OMP_FOR_BODY (stmt) = body; |
4543 | OMP_FOR_PRE_BODY (stmt) = pre_body; | |
a68ab351 | 4544 | OMP_FOR_CLAUSES (stmt) = clauses; |
1799e5d5 RH |
4545 | |
4546 | SET_EXPR_LOCATION (stmt, locus); | |
4547 | return add_stmt (stmt); | |
4548 | } | |
4549 | ||
a68ab351 JJ |
4550 | if (processing_template_decl) |
4551 | orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv)); | |
1799e5d5 | 4552 | |
a68ab351 | 4553 | for (i = 0; i < TREE_VEC_LENGTH (declv); ) |
dadb19e0 | 4554 | { |
a68ab351 JJ |
4555 | decl = TREE_VEC_ELT (declv, i); |
4556 | init = TREE_VEC_ELT (initv, i); | |
4557 | cond = TREE_VEC_ELT (condv, i); | |
4558 | incr = TREE_VEC_ELT (incrv, i); | |
4559 | if (orig_incr) | |
4560 | TREE_VEC_ELT (orig_incr, i) = incr; | |
4561 | elocus = locus; | |
4562 | ||
4563 | if (init && EXPR_HAS_LOCATION (init)) | |
dadb19e0 | 4564 | elocus = EXPR_LOCATION (init); |
dadb19e0 | 4565 | |
a68ab351 JJ |
4566 | if (!DECL_P (decl)) |
4567 | { | |
69bc6bff | 4568 | error_at (elocus, "expected iteration declaration or initialization"); |
a68ab351 JJ |
4569 | return NULL; |
4570 | } | |
969c111d | 4571 | |
a68ab351 JJ |
4572 | if (incr && TREE_CODE (incr) == MODOP_EXPR) |
4573 | { | |
4574 | if (orig_incr) | |
4575 | TREE_VEC_ELT (orig_incr, i) = incr; | |
4576 | incr = cp_build_modify_expr (TREE_OPERAND (incr, 0), | |
4577 | TREE_CODE (TREE_OPERAND (incr, 1)), | |
4578 | TREE_OPERAND (incr, 2), | |
4579 | tf_warning_or_error); | |
4580 | } | |
4581 | ||
4582 | if (CLASS_TYPE_P (TREE_TYPE (decl))) | |
4583 | { | |
4584 | if (handle_omp_for_class_iterator (i, locus, declv, initv, condv, | |
4585 | incrv, &body, &pre_body, clauses)) | |
4586 | return NULL; | |
4587 | continue; | |
4588 | } | |
4589 | ||
4590 | if (!INTEGRAL_TYPE_P (TREE_TYPE (decl)) | |
4591 | && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE) | |
4592 | { | |
69bc6bff | 4593 | error_at (elocus, "invalid type for iteration variable %qE", decl); |
a68ab351 JJ |
4594 | return NULL; |
4595 | } | |
969c111d | 4596 | |
b2ebd268 | 4597 | if (!processing_template_decl) |
8569b2d0 JJ |
4598 | { |
4599 | init = fold_build_cleanup_point_expr (TREE_TYPE (init), init); | |
4600 | init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error); | |
4601 | } | |
4602 | else | |
4603 | init = build2 (MODIFY_EXPR, void_type_node, decl, init); | |
e4ebaef3 JJ |
4604 | if (cond |
4605 | && TREE_SIDE_EFFECTS (cond) | |
4606 | && COMPARISON_CLASS_P (cond) | |
4607 | && !processing_template_decl) | |
a68ab351 | 4608 | { |
e4ebaef3 JJ |
4609 | tree t = TREE_OPERAND (cond, 0); |
4610 | if (TREE_SIDE_EFFECTS (t) | |
4611 | && t != decl | |
4612 | && (TREE_CODE (t) != NOP_EXPR | |
4613 | || TREE_OPERAND (t, 0) != decl)) | |
4614 | TREE_OPERAND (cond, 0) | |
4615 | = fold_build_cleanup_point_expr (TREE_TYPE (t), t); | |
a68ab351 | 4616 | |
e4ebaef3 JJ |
4617 | t = TREE_OPERAND (cond, 1); |
4618 | if (TREE_SIDE_EFFECTS (t) | |
4619 | && t != decl | |
4620 | && (TREE_CODE (t) != NOP_EXPR | |
4621 | || TREE_OPERAND (t, 0) != decl)) | |
4622 | TREE_OPERAND (cond, 1) | |
a68ab351 JJ |
4623 | = fold_build_cleanup_point_expr (TREE_TYPE (t), t); |
4624 | } | |
4625 | if (decl == error_mark_node || init == error_mark_node) | |
4626 | return NULL; | |
4627 | ||
4628 | TREE_VEC_ELT (declv, i) = decl; | |
4629 | TREE_VEC_ELT (initv, i) = init; | |
4630 | TREE_VEC_ELT (condv, i) = cond; | |
4631 | TREE_VEC_ELT (incrv, i) = incr; | |
4632 | i++; | |
969c111d | 4633 | } |
a68ab351 JJ |
4634 | |
4635 | if (IS_EMPTY_STMT (pre_body)) | |
4636 | pre_body = NULL; | |
4637 | ||
4638 | omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv, | |
4639 | body, pre_body); | |
4640 | ||
4641 | if (omp_for == NULL) | |
4642 | return NULL; | |
4643 | ||
4644 | for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++) | |
969c111d | 4645 | { |
e4ebaef3 JJ |
4646 | decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0); |
4647 | incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i); | |
969c111d | 4648 | |
a68ab351 JJ |
4649 | if (TREE_CODE (incr) != MODIFY_EXPR) |
4650 | continue; | |
4651 | ||
4652 | if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1)) | |
e4ebaef3 JJ |
4653 | && BINARY_CLASS_P (TREE_OPERAND (incr, 1)) |
4654 | && !processing_template_decl) | |
a68ab351 | 4655 | { |
e4ebaef3 JJ |
4656 | tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0); |
4657 | if (TREE_SIDE_EFFECTS (t) | |
4658 | && t != decl | |
4659 | && (TREE_CODE (t) != NOP_EXPR | |
4660 | || TREE_OPERAND (t, 0) != decl)) | |
4661 | TREE_OPERAND (TREE_OPERAND (incr, 1), 0) | |
4662 | = fold_build_cleanup_point_expr (TREE_TYPE (t), t); | |
a68ab351 | 4663 | |
e4ebaef3 JJ |
4664 | t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1); |
4665 | if (TREE_SIDE_EFFECTS (t) | |
4666 | && t != decl | |
4667 | && (TREE_CODE (t) != NOP_EXPR | |
4668 | || TREE_OPERAND (t, 0) != decl)) | |
4669 | TREE_OPERAND (TREE_OPERAND (incr, 1), 1) | |
4670 | = fold_build_cleanup_point_expr (TREE_TYPE (t), t); | |
a68ab351 JJ |
4671 | } |
4672 | ||
4673 | if (orig_incr) | |
4674 | TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i); | |
969c111d | 4675 | } |
a68ab351 JJ |
4676 | if (omp_for != NULL) |
4677 | OMP_FOR_CLAUSES (omp_for) = clauses; | |
969c111d | 4678 | return omp_for; |
1799e5d5 RH |
4679 | } |
4680 | ||
4681 | void | |
4682 | finish_omp_atomic (enum tree_code code, tree lhs, tree rhs) | |
4683 | { | |
239371f9 JJ |
4684 | tree orig_lhs; |
4685 | tree orig_rhs; | |
4686 | bool dependent_p; | |
e6bd5565 MM |
4687 | tree stmt; |
4688 | ||
239371f9 JJ |
4689 | orig_lhs = lhs; |
4690 | orig_rhs = rhs; | |
4691 | dependent_p = false; | |
4692 | stmt = NULL_TREE; | |
4693 | ||
4694 | /* Even in a template, we can detect invalid uses of the atomic | |
4695 | pragma if neither LHS nor RHS is type-dependent. */ | |
4696 | if (processing_template_decl) | |
e6bd5565 | 4697 | { |
239371f9 JJ |
4698 | dependent_p = (type_dependent_expression_p (lhs) |
4699 | || type_dependent_expression_p (rhs)); | |
4700 | if (!dependent_p) | |
e6bd5565 MM |
4701 | { |
4702 | lhs = build_non_dependent_expr (lhs); | |
4703 | rhs = build_non_dependent_expr (rhs); | |
4704 | } | |
239371f9 JJ |
4705 | } |
4706 | if (!dependent_p) | |
4707 | { | |
c2255bc4 | 4708 | stmt = c_finish_omp_atomic (input_location, code, lhs, rhs); |
239371f9 JJ |
4709 | if (stmt == error_mark_node) |
4710 | return; | |
e6bd5565 | 4711 | } |
239371f9 JJ |
4712 | if (processing_template_decl) |
4713 | stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node, | |
4714 | build2 (code, void_type_node, orig_lhs, orig_rhs)); | |
4715 | add_stmt (stmt); | |
1799e5d5 RH |
4716 | } |
4717 | ||
4718 | void | |
4719 | finish_omp_barrier (void) | |
4720 | { | |
4721 | tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER]; | |
c166b898 ILT |
4722 | VEC(tree,gc) *vec = make_tree_vector (); |
4723 | tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error); | |
4724 | release_tree_vector (vec); | |
1799e5d5 RH |
4725 | finish_expr_stmt (stmt); |
4726 | } | |
4727 | ||
4728 | void | |
4729 | finish_omp_flush (void) | |
4730 | { | |
4731 | tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE]; | |
c166b898 ILT |
4732 | VEC(tree,gc) *vec = make_tree_vector (); |
4733 | tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error); | |
4734 | release_tree_vector (vec); | |
1799e5d5 RH |
4735 | finish_expr_stmt (stmt); |
4736 | } | |
4737 | ||
a68ab351 JJ |
4738 | void |
4739 | finish_omp_taskwait (void) | |
1799e5d5 | 4740 | { |
a68ab351 | 4741 | tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT]; |
c166b898 ILT |
4742 | VEC(tree,gc) *vec = make_tree_vector (); |
4743 | tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error); | |
4744 | release_tree_vector (vec); | |
a68ab351 | 4745 | finish_expr_stmt (stmt); |
1799e5d5 RH |
4746 | } |
4747 | \f | |
54f7877c | 4748 | void |
3a978d72 | 4749 | init_cp_semantics (void) |
54f7877c | 4750 | { |
54f7877c | 4751 | } |
55a3debe DG |
4752 | \f |
4753 | /* Build a STATIC_ASSERT for a static assertion with the condition | |
4754 | CONDITION and the message text MESSAGE. LOCATION is the location | |
4755 | of the static assertion in the source code. When MEMBER_P, this | |
4756 | static assertion is a member of a class. */ | |
4757 | void | |
4758 | finish_static_assert (tree condition, tree message, location_t location, | |
4759 | bool member_p) | |
4760 | { | |
7b3e2d46 DG |
4761 | if (check_for_bare_parameter_packs (condition)) |
4762 | condition = error_mark_node; | |
4763 | ||
55a3debe DG |
4764 | if (type_dependent_expression_p (condition) |
4765 | || value_dependent_expression_p (condition)) | |
4766 | { | |
4767 | /* We're in a template; build a STATIC_ASSERT and put it in | |
4768 | the right place. */ | |
4769 | tree assertion; | |
4770 | ||
4771 | assertion = make_node (STATIC_ASSERT); | |
4772 | STATIC_ASSERT_CONDITION (assertion) = condition; | |
4773 | STATIC_ASSERT_MESSAGE (assertion) = message; | |
4774 | STATIC_ASSERT_SOURCE_LOCATION (assertion) = location; | |
4775 | ||
4776 | if (member_p) | |
4777 | maybe_add_class_template_decl_list (current_class_type, | |
4778 | assertion, | |
4779 | /*friend_p=*/0); | |
4780 | else | |
4781 | add_stmt (assertion); | |
4782 | ||
4783 | return; | |
4784 | } | |
4785 | ||
4786 | /* Fold the expression and convert it to a boolean value. */ | |
4787 | condition = fold_non_dependent_expr (condition); | |
4788 | condition = cp_convert (boolean_type_node, condition); | |
fa2200cb | 4789 | condition = maybe_constant_value (condition); |
55a3debe DG |
4790 | |
4791 | if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition)) | |
4792 | /* Do nothing; the condition is satisfied. */ | |
4793 | ; | |
4794 | else | |
4795 | { | |
4796 | location_t saved_loc = input_location; | |
4797 | ||
4798 | input_location = location; | |
4799 | if (TREE_CODE (condition) == INTEGER_CST | |
4800 | && integer_zerop (condition)) | |
4801 | /* Report the error. */ | |
4802 | error ("static assertion failed: %E", message); | |
4803 | else if (condition && condition != error_mark_node) | |
fa2200cb JM |
4804 | { |
4805 | error ("non-constant condition for static assertion"); | |
4806 | cxx_constant_value (condition); | |
4807 | } | |
55a3debe DG |
4808 | input_location = saved_loc; |
4809 | } | |
4810 | } | |
3ad6a8e1 | 4811 | \f |
4b4a42c4 JM |
4812 | /* Returns the type of EXPR for cases where we can determine it even though |
4813 | EXPR is a type-dependent expression. */ | |
a77f94e2 JM |
4814 | |
4815 | tree | |
4816 | describable_type (tree expr) | |
4817 | { | |
4818 | tree type = NULL_TREE; | |
4819 | ||
a77f94e2 JM |
4820 | if (! type_dependent_expression_p (expr) |
4821 | && ! type_unknown_p (expr)) | |
4822 | { | |
aef8bce8 | 4823 | type = unlowered_expr_type (expr); |
a77f94e2 JM |
4824 | if (real_lvalue_p (expr)) |
4825 | type = build_reference_type (type); | |
4826 | } | |
a77f94e2 JM |
4827 | |
4828 | if (type) | |
4829 | return type; | |
4830 | ||
4831 | switch (TREE_CODE (expr)) | |
4832 | { | |
4833 | case VAR_DECL: | |
4834 | case PARM_DECL: | |
4835 | case RESULT_DECL: | |
4836 | case FUNCTION_DECL: | |
4b4a42c4 | 4837 | return TREE_TYPE (expr); |
a77f94e2 JM |
4838 | break; |
4839 | ||
4840 | case NEW_EXPR: | |
4841 | case CONST_DECL: | |
4842 | case TEMPLATE_PARM_INDEX: | |
4843 | case CAST_EXPR: | |
4844 | case STATIC_CAST_EXPR: | |
4845 | case REINTERPRET_CAST_EXPR: | |
4846 | case CONST_CAST_EXPR: | |
4847 | case DYNAMIC_CAST_EXPR: | |
4848 | type = TREE_TYPE (expr); | |
4849 | break; | |
4850 | ||
4851 | case INDIRECT_REF: | |
4852 | { | |
4853 | tree ptrtype = describable_type (TREE_OPERAND (expr, 0)); | |
4854 | if (ptrtype && POINTER_TYPE_P (ptrtype)) | |
4855 | type = build_reference_type (TREE_TYPE (ptrtype)); | |
4856 | } | |
4857 | break; | |
4858 | ||
4859 | default: | |
4860 | if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant) | |
4861 | type = TREE_TYPE (expr); | |
4862 | break; | |
4863 | } | |
4864 | ||
4865 | if (type && type_uses_auto (type)) | |
4866 | return NULL_TREE; | |
4867 | else | |
4868 | return type; | |
4869 | } | |
4870 | ||
3ad6a8e1 DG |
4871 | /* Implements the C++0x decltype keyword. Returns the type of EXPR, |
4872 | suitable for use as a type-specifier. | |
4873 | ||
4874 | ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an | |
4875 | id-expression or a class member access, FALSE when it was parsed as | |
4876 | a full expression. */ | |
a77f94e2 | 4877 | |
3ad6a8e1 | 4878 | tree |
5b97c77f JM |
4879 | finish_decltype_type (tree expr, bool id_expression_or_member_access_p, |
4880 | tsubst_flags_t complain) | |
3ad6a8e1 | 4881 | { |
056dd1af | 4882 | tree type = NULL_TREE; |
3ad6a8e1 | 4883 | |
e4fd5b87 DG |
4884 | if (!expr || error_operand_p (expr)) |
4885 | return error_mark_node; | |
4886 | ||
7a547b93 JJ |
4887 | if (TYPE_P (expr) |
4888 | || TREE_CODE (expr) == TYPE_DECL | |
4889 | || (TREE_CODE (expr) == BIT_NOT_EXPR | |
4890 | && TYPE_P (TREE_OPERAND (expr, 0)))) | |
4891 | { | |
5b97c77f JM |
4892 | if (complain & tf_error) |
4893 | error ("argument to decltype must be an expression"); | |
7a547b93 JJ |
4894 | return error_mark_node; |
4895 | } | |
4896 | ||
67e18edb | 4897 | /* FIXME instantiation-dependent */ |
21920fd1 JM |
4898 | if (type_dependent_expression_p (expr) |
4899 | /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even | |
4900 | if it isn't dependent, so that we can check access control at | |
4901 | instantiation time, so defer the decltype as well (PR 42277). */ | |
4902 | || (id_expression_or_member_access_p | |
4903 | && processing_template_decl | |
4904 | && TREE_CODE (expr) == COMPONENT_REF)) | |
3ad6a8e1 | 4905 | { |
9e1e64ec | 4906 | type = cxx_make_type (DECLTYPE_TYPE); |
3ad6a8e1 DG |
4907 | DECLTYPE_TYPE_EXPR (type) = expr; |
4908 | DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type) | |
4909 | = id_expression_or_member_access_p; | |
4910 | SET_TYPE_STRUCTURAL_EQUALITY (type); | |
4911 | ||
4912 | return type; | |
4913 | } | |
4914 | ||
4915 | /* The type denoted by decltype(e) is defined as follows: */ | |
4916 | ||
ccb05613 | 4917 | expr = resolve_nondeduced_context (expr); |
48326487 | 4918 | |
6cdb1428 JM |
4919 | if (type_unknown_p (expr)) |
4920 | { | |
4921 | if (complain & tf_error) | |
4922 | error ("decltype cannot resolve address of overloaded function"); | |
4923 | return error_mark_node; | |
4924 | } | |
4925 | ||
48326487 JM |
4926 | /* To get the size of a static data member declared as an array of |
4927 | unknown bound, we need to instantiate it. */ | |
4928 | if (TREE_CODE (expr) == VAR_DECL | |
4929 | && VAR_HAD_UNKNOWN_BOUND (expr) | |
4930 | && DECL_TEMPLATE_INSTANTIATION (expr)) | |
4931 | instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false); | |
4932 | ||
3ad6a8e1 DG |
4933 | if (id_expression_or_member_access_p) |
4934 | { | |
4935 | /* If e is an id-expression or a class member access (5.2.5 | |
4936 | [expr.ref]), decltype(e) is defined as the type of the entity | |
4937 | named by e. If there is no such entity, or e names a set of | |
4938 | overloaded functions, the program is ill-formed. */ | |
4939 | if (TREE_CODE (expr) == IDENTIFIER_NODE) | |
4940 | expr = lookup_name (expr); | |
4941 | ||
4942 | if (TREE_CODE (expr) == INDIRECT_REF) | |
4943 | /* This can happen when the expression is, e.g., "a.b". Just | |
4944 | look at the underlying operand. */ | |
4945 | expr = TREE_OPERAND (expr, 0); | |
4946 | ||
4947 | if (TREE_CODE (expr) == OFFSET_REF | |
4948 | || TREE_CODE (expr) == MEMBER_REF) | |
4949 | /* We're only interested in the field itself. If it is a | |
4950 | BASELINK, we will need to see through it in the next | |
4951 | step. */ | |
4952 | expr = TREE_OPERAND (expr, 1); | |
4953 | ||
4954 | if (TREE_CODE (expr) == BASELINK) | |
6cdb1428 | 4955 | /* See through BASELINK nodes to the underlying function. */ |
3ad6a8e1 DG |
4956 | expr = BASELINK_FUNCTIONS (expr); |
4957 | ||
3ad6a8e1 DG |
4958 | switch (TREE_CODE (expr)) |
4959 | { | |
4960 | case FIELD_DECL: | |
e76d7cc7 | 4961 | if (DECL_BIT_FIELD_TYPE (expr)) |
3ad6a8e1 DG |
4962 | { |
4963 | type = DECL_BIT_FIELD_TYPE (expr); | |
4964 | break; | |
4965 | } | |
4966 | /* Fall through for fields that aren't bitfields. */ | |
4967 | ||
4968 | case FUNCTION_DECL: | |
4969 | case VAR_DECL: | |
4970 | case CONST_DECL: | |
4971 | case PARM_DECL: | |
4972 | case RESULT_DECL: | |
088d4f95 | 4973 | case TEMPLATE_PARM_INDEX: |
03a904b5 | 4974 | expr = mark_type_use (expr); |
3ad6a8e1 DG |
4975 | type = TREE_TYPE (expr); |
4976 | break; | |
4977 | ||
4978 | case ERROR_MARK: | |
4979 | type = error_mark_node; | |
4980 | break; | |
4981 | ||
4982 | case COMPONENT_REF: | |
03a904b5 | 4983 | mark_type_use (expr); |
3ad6a8e1 DG |
4984 | type = is_bitfield_expr_with_lowered_type (expr); |
4985 | if (!type) | |
4986 | type = TREE_TYPE (TREE_OPERAND (expr, 1)); | |
4987 | break; | |
4988 | ||
4989 | case BIT_FIELD_REF: | |
4990 | gcc_unreachable (); | |
4991 | ||
4992 | case INTEGER_CST: | |
4993 | /* We can get here when the id-expression refers to an | |
4994 | enumerator. */ | |
4995 | type = TREE_TYPE (expr); | |
4996 | break; | |
4997 | ||
4998 | default: | |
6cdb1428 | 4999 | gcc_unreachable (); |
3ad6a8e1 DG |
5000 | return error_mark_node; |
5001 | } | |
5002 | } | |
5003 | else | |
5004 | { | |
c1e41527 JM |
5005 | /* Within a lambda-expression: |
5006 | ||
5007 | Every occurrence of decltype((x)) where x is a possibly | |
5008 | parenthesized id-expression that names an entity of | |
5009 | automatic storage duration is treated as if x were | |
5010 | transformed into an access to a corresponding data member | |
5011 | of the closure type that would have been declared if x | |
5012 | were a use of the denoted entity. */ | |
5013 | if (outer_automatic_var_p (expr) | |
5014 | && current_function_decl | |
5015 | && LAMBDA_FUNCTION_P (current_function_decl)) | |
5016 | type = capture_decltype (expr); | |
5017 | else if (error_operand_p (expr)) | |
5018 | type = error_mark_node; | |
5019 | else if (expr == current_class_ptr) | |
5020 | /* If the expression is just "this", we want the | |
5021 | cv-unqualified pointer for the "this" type. */ | |
5022 | type = TYPE_MAIN_VARIANT (TREE_TYPE (expr)); | |
5023 | else | |
5024 | { | |
5025 | /* Otherwise, where T is the type of e, if e is an lvalue, | |
5026 | decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */ | |
5027 | cp_lvalue_kind clk = lvalue_kind (expr); | |
5028 | type = unlowered_expr_type (expr); | |
5029 | gcc_assert (TREE_CODE (type) != REFERENCE_TYPE); | |
5030 | if (clk != clk_none && !(clk & clk_class)) | |
5031 | type = cp_build_reference_type (type, (clk & clk_rvalueref)); | |
5032 | } | |
3ad6a8e1 DG |
5033 | } |
5034 | ||
3ad6a8e1 DG |
5035 | return type; |
5036 | } | |
cf22909c | 5037 | |
b29441ec PC |
5038 | /* Called from trait_expr_value to evaluate either __has_nothrow_assign or |
5039 | __has_nothrow_copy, depending on assign_p. */ | |
cb68ec50 PC |
5040 | |
5041 | static bool | |
b29441ec | 5042 | classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p) |
cb68ec50 | 5043 | { |
b29441ec | 5044 | tree fns; |
cb68ec50 | 5045 | |
b29441ec PC |
5046 | if (assign_p) |
5047 | { | |
5048 | int ix; | |
5049 | ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR)); | |
5050 | if (ix < 0) | |
cb68ec50 | 5051 | return false; |
b29441ec PC |
5052 | fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix); |
5053 | } | |
066ec0a4 | 5054 | else if (TYPE_HAS_COPY_CTOR (type)) |
b29441ec PC |
5055 | { |
5056 | /* If construction of the copy constructor was postponed, create | |
5057 | it now. */ | |
5058 | if (CLASSTYPE_LAZY_COPY_CTOR (type)) | |
5059 | lazily_declare_fn (sfk_copy_constructor, type); | |
d5f4eddd JM |
5060 | if (CLASSTYPE_LAZY_MOVE_CTOR (type)) |
5061 | lazily_declare_fn (sfk_move_constructor, type); | |
b29441ec | 5062 | fns = CLASSTYPE_CONSTRUCTORS (type); |
cb68ec50 PC |
5063 | } |
5064 | else | |
5065 | return false; | |
5066 | ||
b29441ec | 5067 | for (; fns; fns = OVL_NEXT (fns)) |
279086c3 PC |
5068 | { |
5069 | tree fn = OVL_CURRENT (fns); | |
5070 | ||
5071 | if (assign_p) | |
5072 | { | |
5073 | if (copy_fn_p (fn) == 0) | |
5074 | continue; | |
5075 | } | |
5076 | else if (copy_fn_p (fn) <= 0) | |
5077 | continue; | |
5078 | ||
5079 | if (!TYPE_NOTHROW_P (TREE_TYPE (fn))) | |
5080 | return false; | |
5081 | } | |
b29441ec | 5082 | |
cb68ec50 PC |
5083 | return true; |
5084 | } | |
5085 | ||
5086 | /* Actually evaluates the trait. */ | |
5087 | ||
5088 | static bool | |
5089 | trait_expr_value (cp_trait_kind kind, tree type1, tree type2) | |
5090 | { | |
5091 | enum tree_code type_code1; | |
5092 | tree t; | |
5093 | ||
5094 | type_code1 = TREE_CODE (type1); | |
5095 | ||
5096 | switch (kind) | |
5097 | { | |
5098 | case CPTK_HAS_NOTHROW_ASSIGN: | |
c32097d8 | 5099 | type1 = strip_array_types (type1); |
b29441ec PC |
5100 | return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE |
5101 | && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2) | |
5102 | || (CLASS_TYPE_P (type1) | |
5103 | && classtype_has_nothrow_assign_or_copy_p (type1, | |
5104 | true)))); | |
cb68ec50 PC |
5105 | |
5106 | case CPTK_HAS_TRIVIAL_ASSIGN: | |
c32097d8 JM |
5107 | /* ??? The standard seems to be missing the "or array of such a class |
5108 | type" wording for this trait. */ | |
5109 | type1 = strip_array_types (type1); | |
cb68ec50 | 5110 | return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE |
c32097d8 | 5111 | && (trivial_type_p (type1) |
cb68ec50 | 5112 | || (CLASS_TYPE_P (type1) |
066ec0a4 | 5113 | && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1)))); |
cb68ec50 PC |
5114 | |
5115 | case CPTK_HAS_NOTHROW_CONSTRUCTOR: | |
5116 | type1 = strip_array_types (type1); | |
5117 | return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2) | |
5118 | || (CLASS_TYPE_P (type1) | |
ac177431 | 5119 | && (t = locate_ctor (type1)) |
e24313f3 | 5120 | && TYPE_NOTHROW_P (TREE_TYPE (t)))); |
cb68ec50 PC |
5121 | |
5122 | case CPTK_HAS_TRIVIAL_CONSTRUCTOR: | |
5123 | type1 = strip_array_types (type1); | |
c32097d8 | 5124 | return (trivial_type_p (type1) |
cb68ec50 PC |
5125 | || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1))); |
5126 | ||
5127 | case CPTK_HAS_NOTHROW_COPY: | |
c32097d8 | 5128 | type1 = strip_array_types (type1); |
cb68ec50 PC |
5129 | return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2) |
5130 | || (CLASS_TYPE_P (type1) | |
b29441ec | 5131 | && classtype_has_nothrow_assign_or_copy_p (type1, false))); |
cb68ec50 PC |
5132 | |
5133 | case CPTK_HAS_TRIVIAL_COPY: | |
c32097d8 JM |
5134 | /* ??? The standard seems to be missing the "or array of such a class |
5135 | type" wording for this trait. */ | |
5136 | type1 = strip_array_types (type1); | |
5137 | return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE | |
066ec0a4 | 5138 | || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1))); |
cb68ec50 PC |
5139 | |
5140 | case CPTK_HAS_TRIVIAL_DESTRUCTOR: | |
5141 | type1 = strip_array_types (type1); | |
c32097d8 | 5142 | return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE |
cb68ec50 PC |
5143 | || (CLASS_TYPE_P (type1) |
5144 | && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1))); | |
5145 | ||
5146 | case CPTK_HAS_VIRTUAL_DESTRUCTOR: | |
46408846 | 5147 | return type_has_virtual_destructor (type1); |
cb68ec50 PC |
5148 | |
5149 | case CPTK_IS_ABSTRACT: | |
5150 | return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1)); | |
5151 | ||
5152 | case CPTK_IS_BASE_OF: | |
5153 | return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2) | |
5154 | && DERIVED_FROM_P (type1, type2)); | |
5155 | ||
5156 | case CPTK_IS_CLASS: | |
5157 | return (NON_UNION_CLASS_TYPE_P (type1)); | |
5158 | ||
5159 | case CPTK_IS_CONVERTIBLE_TO: | |
5160 | /* TODO */ | |
5161 | return false; | |
5162 | ||
5163 | case CPTK_IS_EMPTY: | |
5164 | return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1)); | |
5165 | ||
5166 | case CPTK_IS_ENUM: | |
5167 | return (type_code1 == ENUMERAL_TYPE); | |
5168 | ||
5169 | case CPTK_IS_POD: | |
5170 | return (pod_type_p (type1)); | |
5171 | ||
5172 | case CPTK_IS_POLYMORPHIC: | |
5173 | return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1)); | |
5174 | ||
c32097d8 JM |
5175 | case CPTK_IS_STD_LAYOUT: |
5176 | return (std_layout_type_p (type1)); | |
5177 | ||
5178 | case CPTK_IS_TRIVIAL: | |
5179 | return (trivial_type_p (type1)); | |
5180 | ||
cb68ec50 PC |
5181 | case CPTK_IS_UNION: |
5182 | return (type_code1 == UNION_TYPE); | |
5183 | ||
2b08f2c5 JM |
5184 | case CPTK_IS_LITERAL_TYPE: |
5185 | return (literal_type_p (type1)); | |
5186 | ||
cb68ec50 PC |
5187 | default: |
5188 | gcc_unreachable (); | |
5189 | return false; | |
5190 | } | |
5191 | } | |
5192 | ||
ff284b4b PC |
5193 | /* Returns true if TYPE is a complete type, an array of unknown bound, |
5194 | or (possibly cv-qualified) void, returns false otherwise. */ | |
5195 | ||
5196 | static bool | |
5197 | check_trait_type (tree type) | |
5198 | { | |
5199 | if (COMPLETE_TYPE_P (type)) | |
5200 | return true; | |
5201 | ||
f94ae987 JM |
5202 | if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type) |
5203 | && COMPLETE_TYPE_P (TREE_TYPE (type))) | |
ff284b4b PC |
5204 | return true; |
5205 | ||
5206 | if (VOID_TYPE_P (type)) | |
5207 | return true; | |
5208 | ||
5209 | return false; | |
5210 | } | |
5211 | ||
cb68ec50 PC |
5212 | /* Process a trait expression. */ |
5213 | ||
5214 | tree | |
5215 | finish_trait_expr (cp_trait_kind kind, tree type1, tree type2) | |
5216 | { | |
5217 | gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN | |
5218 | || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR | |
5219 | || kind == CPTK_HAS_NOTHROW_COPY | |
5220 | || kind == CPTK_HAS_TRIVIAL_ASSIGN | |
5221 | || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR | |
5222 | || kind == CPTK_HAS_TRIVIAL_COPY | |
5223 | || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR | |
5224 | || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR | |
5225 | || kind == CPTK_IS_ABSTRACT | |
5226 | || kind == CPTK_IS_BASE_OF | |
5227 | || kind == CPTK_IS_CLASS | |
5228 | || kind == CPTK_IS_CONVERTIBLE_TO | |
5229 | || kind == CPTK_IS_EMPTY | |
5230 | || kind == CPTK_IS_ENUM | |
5231 | || kind == CPTK_IS_POD | |
5232 | || kind == CPTK_IS_POLYMORPHIC | |
c32097d8 JM |
5233 | || kind == CPTK_IS_STD_LAYOUT |
5234 | || kind == CPTK_IS_TRIVIAL | |
2b08f2c5 | 5235 | || kind == CPTK_IS_LITERAL_TYPE |
cb68ec50 PC |
5236 | || kind == CPTK_IS_UNION); |
5237 | ||
5238 | if (kind == CPTK_IS_CONVERTIBLE_TO) | |
5239 | { | |
5240 | sorry ("__is_convertible_to"); | |
5241 | return error_mark_node; | |
5242 | } | |
5243 | ||
5244 | if (type1 == error_mark_node | |
5245 | || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO) | |
5246 | && type2 == error_mark_node)) | |
5247 | return error_mark_node; | |
5248 | ||
5249 | if (processing_template_decl) | |
5250 | { | |
5251 | tree trait_expr = make_node (TRAIT_EXPR); | |
5252 | TREE_TYPE (trait_expr) = boolean_type_node; | |
5253 | TRAIT_EXPR_TYPE1 (trait_expr) = type1; | |
5254 | TRAIT_EXPR_TYPE2 (trait_expr) = type2; | |
5255 | TRAIT_EXPR_KIND (trait_expr) = kind; | |
5256 | return trait_expr; | |
5257 | } | |
5258 | ||
10c1d4af PC |
5259 | complete_type (type1); |
5260 | if (type2) | |
5261 | complete_type (type2); | |
5262 | ||
ff284b4b | 5263 | switch (kind) |
cb68ec50 | 5264 | { |
ff284b4b PC |
5265 | case CPTK_HAS_NOTHROW_ASSIGN: |
5266 | case CPTK_HAS_TRIVIAL_ASSIGN: | |
5267 | case CPTK_HAS_NOTHROW_CONSTRUCTOR: | |
5268 | case CPTK_HAS_TRIVIAL_CONSTRUCTOR: | |
5269 | case CPTK_HAS_NOTHROW_COPY: | |
5270 | case CPTK_HAS_TRIVIAL_COPY: | |
5271 | case CPTK_HAS_TRIVIAL_DESTRUCTOR: | |
5272 | case CPTK_HAS_VIRTUAL_DESTRUCTOR: | |
5273 | case CPTK_IS_ABSTRACT: | |
5274 | case CPTK_IS_EMPTY: | |
5275 | case CPTK_IS_POD: | |
5276 | case CPTK_IS_POLYMORPHIC: | |
c32097d8 JM |
5277 | case CPTK_IS_STD_LAYOUT: |
5278 | case CPTK_IS_TRIVIAL: | |
2b08f2c5 | 5279 | case CPTK_IS_LITERAL_TYPE: |
ff284b4b PC |
5280 | if (!check_trait_type (type1)) |
5281 | { | |
5282 | error ("incomplete type %qT not allowed", type1); | |
5283 | return error_mark_node; | |
5284 | } | |
5285 | break; | |
5286 | ||
5287 | case CPTK_IS_BASE_OF: | |
5288 | if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2) | |
5289 | && !same_type_ignoring_top_level_qualifiers_p (type1, type2) | |
5290 | && !COMPLETE_TYPE_P (type2)) | |
5291 | { | |
5292 | error ("incomplete type %qT not allowed", type2); | |
5293 | return error_mark_node; | |
5294 | } | |
5295 | break; | |
5296 | ||
5297 | case CPTK_IS_CLASS: | |
5298 | case CPTK_IS_ENUM: | |
5299 | case CPTK_IS_UNION: | |
5300 | break; | |
5301 | ||
5302 | case CPTK_IS_CONVERTIBLE_TO: | |
5303 | default: | |
5304 | gcc_unreachable (); | |
cb68ec50 PC |
5305 | } |
5306 | ||
5307 | return (trait_expr_value (kind, type1, type2) | |
5308 | ? boolean_true_node : boolean_false_node); | |
5309 | } | |
5310 | ||
6ec637a4 JJ |
5311 | /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64, |
5312 | which is ignored for C++. */ | |
5313 | ||
5314 | void | |
5315 | set_float_const_decimal64 (void) | |
5316 | { | |
5317 | } | |
5318 | ||
5319 | void | |
5320 | clear_float_const_decimal64 (void) | |
5321 | { | |
5322 | } | |
5323 | ||
5324 | bool | |
5325 | float_const_decimal64_p (void) | |
5326 | { | |
5327 | return 0; | |
5328 | } | |
5329 | ||
3b49d762 | 5330 | \f |
7ecbca9d GDR |
5331 | /* Return true if T is a literal type. */ |
5332 | ||
5333 | bool | |
5334 | literal_type_p (tree t) | |
5335 | { | |
83b6b866 PC |
5336 | if (SCALAR_TYPE_P (t) |
5337 | || TREE_CODE (t) == REFERENCE_TYPE) | |
7ecbca9d GDR |
5338 | return true; |
5339 | if (CLASS_TYPE_P (t)) | |
5340 | return CLASSTYPE_LITERAL_P (t); | |
5341 | if (TREE_CODE (t) == ARRAY_TYPE) | |
5342 | return literal_type_p (strip_array_types (t)); | |
5343 | return false; | |
5344 | } | |
5345 | ||
7ecbca9d GDR |
5346 | /* If DECL is a variable declared `constexpr', require its type |
5347 | be literal. Return the DECL if OK, otherwise NULL. */ | |
5348 | ||
5349 | tree | |
5350 | ensure_literal_type_for_constexpr_object (tree decl) | |
5351 | { | |
5352 | tree type = TREE_TYPE (decl); | |
5353 | if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl) | |
fa2200cb JM |
5354 | && !processing_template_decl |
5355 | /* The call to complete_type is just for initializer_list. */ | |
5356 | && !literal_type_p (complete_type (type))) | |
7ecbca9d GDR |
5357 | { |
5358 | error ("the type %qT of constexpr variable %qD is not literal", | |
5359 | type, decl); | |
5360 | return NULL; | |
5361 | } | |
5362 | return decl; | |
5363 | } | |
5364 | ||
66e61a34 JM |
5365 | /* Representation of entries in the constexpr function definition table. */ |
5366 | ||
5367 | typedef struct GTY(()) constexpr_fundef { | |
5368 | tree decl; | |
5369 | tree body; | |
5370 | } constexpr_fundef; | |
5371 | ||
5372 | /* This table holds all constexpr function definitions seen in | |
5373 | the current translation unit. */ | |
5374 | ||
5375 | static GTY ((param_is (constexpr_fundef))) htab_t constexpr_fundef_table; | |
5376 | ||
66e61a34 JM |
5377 | /* Utility function used for managing the constexpr function table. |
5378 | Return true if the entries pointed to by P and Q are for the | |
5379 | same constexpr function. */ | |
5380 | ||
5381 | static inline int | |
5382 | constexpr_fundef_equal (const void *p, const void *q) | |
5383 | { | |
5384 | const constexpr_fundef *lhs = (const constexpr_fundef *) p; | |
5385 | const constexpr_fundef *rhs = (const constexpr_fundef *) q; | |
5386 | return lhs->decl == rhs->decl; | |
5387 | } | |
5388 | ||
5389 | /* Utility function used for managing the constexpr function table. | |
5390 | Return a hash value for the entry pointed to by Q. */ | |
5391 | ||
5392 | static inline hashval_t | |
5393 | constexpr_fundef_hash (const void *p) | |
5394 | { | |
5395 | const constexpr_fundef *fundef = (const constexpr_fundef *) p; | |
5396 | return DECL_UID (fundef->decl); | |
5397 | } | |
5398 | ||
5399 | /* Return a previously saved definition of function FUN. */ | |
5400 | ||
5401 | static constexpr_fundef * | |
5402 | retrieve_constexpr_fundef (tree fun) | |
5403 | { | |
5404 | constexpr_fundef fundef = { NULL, NULL }; | |
5405 | if (constexpr_fundef_table == NULL) | |
5406 | return NULL; | |
5407 | ||
5408 | fundef.decl = fun; | |
5409 | return (constexpr_fundef *) htab_find (constexpr_fundef_table, &fundef); | |
5410 | } | |
5411 | ||
91ea6df3 GDR |
5412 | /* Check whether the parameter and return types of FUN are valid for a |
5413 | constexpr function, and complain if COMPLAIN. */ | |
5414 | ||
5415 | static bool | |
5416 | is_valid_constexpr_fn (tree fun, bool complain) | |
5417 | { | |
5418 | tree parm = FUNCTION_FIRST_USER_PARM (fun); | |
5419 | bool ret = true; | |
5420 | for (; parm != NULL; parm = TREE_CHAIN (parm)) | |
83b6b866 | 5421 | if (!literal_type_p (TREE_TYPE (parm))) |
91ea6df3 GDR |
5422 | { |
5423 | ret = false; | |
5424 | if (complain) | |
915829cc JM |
5425 | error ("invalid type for parameter %d of constexpr " |
5426 | "function %q+#D", DECL_PARM_INDEX (parm), fun); | |
91ea6df3 GDR |
5427 | } |
5428 | ||
5429 | if (!DECL_CONSTRUCTOR_P (fun)) | |
5430 | { | |
5431 | tree rettype = TREE_TYPE (TREE_TYPE (fun)); | |
83b6b866 | 5432 | if (!literal_type_p (rettype)) |
91ea6df3 GDR |
5433 | { |
5434 | ret = false; | |
5435 | if (complain) | |
915829cc | 5436 | error ("invalid return type %qT of constexpr function %q+D", |
91ea6df3 GDR |
5437 | rettype, fun); |
5438 | } | |
5439 | ||
5440 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun) | |
a90caaa2 | 5441 | && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun))) |
91ea6df3 GDR |
5442 | { |
5443 | ret = false; | |
5444 | if (complain) | |
915829cc | 5445 | error ("enclosing class of %q+#D is not a literal type", fun); |
91ea6df3 GDR |
5446 | } |
5447 | } | |
5448 | ||
5449 | return ret; | |
5450 | } | |
5451 | ||
7ecbca9d GDR |
5452 | /* Return non-null if FUN certainly designates a valid constexpr function |
5453 | declaration. Otherwise return NULL. Issue appropriate diagnostics | |
5454 | if necessary. Note that we only check the declaration, not the body | |
5455 | of the function. */ | |
5456 | ||
5457 | tree | |
5458 | validate_constexpr_fundecl (tree fun) | |
5459 | { | |
66e61a34 JM |
5460 | constexpr_fundef entry; |
5461 | constexpr_fundef **slot; | |
5462 | ||
91ea6df3 | 5463 | if (processing_template_decl || !DECL_DECLARED_CONSTEXPR_P (fun)) |
7ecbca9d | 5464 | return NULL; |
91ea6df3 GDR |
5465 | else if (DECL_CLONED_FUNCTION_P (fun)) |
5466 | /* We already checked the original function. */ | |
7ecbca9d GDR |
5467 | return fun; |
5468 | ||
91ea6df3 | 5469 | if (!is_valid_constexpr_fn (fun, !DECL_TEMPLATE_INSTANTIATION (fun))) |
7ecbca9d | 5470 | { |
91ea6df3 | 5471 | DECL_DECLARED_CONSTEXPR_P (fun) = false; |
7ecbca9d GDR |
5472 | return NULL; |
5473 | } | |
91ea6df3 | 5474 | |
66e61a34 JM |
5475 | /* Create the constexpr function table if necessary. */ |
5476 | if (constexpr_fundef_table == NULL) | |
5477 | constexpr_fundef_table = htab_create_ggc (101, | |
5478 | constexpr_fundef_hash, | |
5479 | constexpr_fundef_equal, | |
5480 | ggc_free); | |
5481 | entry.decl = fun; | |
5482 | entry.body = NULL; | |
5483 | slot = (constexpr_fundef **) | |
5484 | htab_find_slot (constexpr_fundef_table, &entry, INSERT); | |
5485 | if (*slot == NULL) | |
5486 | { | |
5487 | *slot = ggc_alloc_constexpr_fundef (); | |
5488 | **slot = entry; | |
5489 | } | |
5490 | return fun; | |
5491 | } | |
5492 | ||
5493 | /* Subroutine of build_constexpr_constructor_member_initializers. | |
5494 | The expression tree T represents a data member initialization | |
5495 | in a (constexpr) constructor definition. Build a pairing of | |
5496 | the data member with its initializer, and prepend that pair | |
5497 | to the existing initialization pair INITS. */ | |
5498 | ||
5499 | static bool | |
5500 | build_data_member_initialization (tree t, VEC(constructor_elt,gc) **vec) | |
5501 | { | |
5502 | tree member, init; | |
5503 | if (TREE_CODE (t) == CLEANUP_POINT_EXPR) | |
5504 | t = TREE_OPERAND (t, 0); | |
5505 | if (TREE_CODE (t) == EXPR_STMT) | |
5506 | t = TREE_OPERAND (t, 0); | |
5507 | if (t == error_mark_node) | |
5508 | return false; | |
60d237af JJ |
5509 | if (TREE_CODE (t) == STATEMENT_LIST) |
5510 | { | |
5511 | tree_stmt_iterator i; | |
5512 | for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i)) | |
5513 | { | |
5514 | if (! build_data_member_initialization (tsi_stmt (i), vec)) | |
5515 | return false; | |
5516 | } | |
5517 | return true; | |
5518 | } | |
66e61a34 | 5519 | if (TREE_CODE (t) == CLEANUP_STMT) |
ebb526f9 JJ |
5520 | { |
5521 | /* We can't see a CLEANUP_STMT in a constructor for a literal class, | |
5522 | but we can in a constexpr constructor for a non-literal class. Just | |
5523 | ignore it; either all the initialization will be constant, in which | |
5524 | case the cleanup can't run, or it can't be constexpr. | |
5525 | Still recurse into CLEANUP_BODY. */ | |
60d237af | 5526 | return build_data_member_initialization (CLEANUP_BODY (t), vec); |
ebb526f9 | 5527 | } |
66e61a34 JM |
5528 | if (TREE_CODE (t) == CONVERT_EXPR) |
5529 | t = TREE_OPERAND (t, 0); | |
5530 | if (TREE_CODE (t) == INIT_EXPR | |
5531 | || TREE_CODE (t) == MODIFY_EXPR) | |
5532 | { | |
5533 | member = TREE_OPERAND (t, 0); | |
5534 | init = unshare_expr (TREE_OPERAND (t, 1)); | |
5535 | } | |
5536 | else | |
5537 | { | |
66e61a34 JM |
5538 | gcc_assert (TREE_CODE (t) == CALL_EXPR); |
5539 | member = CALL_EXPR_ARG (t, 0); | |
0e5dcad1 JM |
5540 | /* We don't use build_cplus_new here because it complains about |
5541 | abstract bases. Leaving the call unwrapped means that it has the | |
5542 | wrong type, but cxx_eval_constant_expression doesn't care. */ | |
5543 | init = unshare_expr (t); | |
5544 | } | |
5545 | if (TREE_CODE (member) == INDIRECT_REF) | |
5546 | member = TREE_OPERAND (member, 0); | |
5547 | if (TREE_CODE (member) == NOP_EXPR) | |
5548 | { | |
5549 | tree op = member; | |
5550 | STRIP_NOPS (op); | |
5551 | if (TREE_CODE (op) == ADDR_EXPR) | |
66e61a34 | 5552 | { |
0e5dcad1 JM |
5553 | gcc_assert (same_type_ignoring_top_level_qualifiers_p |
5554 | (TREE_TYPE (TREE_TYPE (op)), | |
5555 | TREE_TYPE (TREE_TYPE (member)))); | |
5556 | /* Initializing a cv-qualified member; we need to look through | |
5557 | the const_cast. */ | |
5558 | member = op; | |
66e61a34 JM |
5559 | } |
5560 | else | |
5561 | { | |
0e5dcad1 JM |
5562 | /* We don't put out anything for an empty base. */ |
5563 | gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member)))); | |
5564 | /* But if the initializer isn't constexpr, leave it in so we | |
5565 | complain later. */ | |
d6ed1c89 | 5566 | if (potential_constant_expression (init)) |
0e5dcad1 | 5567 | return true; |
66e61a34 | 5568 | } |
66e61a34 | 5569 | } |
0e5dcad1 JM |
5570 | if (TREE_CODE (member) == ADDR_EXPR) |
5571 | member = TREE_OPERAND (member, 0); | |
d79b88a1 JM |
5572 | if (TREE_CODE (member) == COMPONENT_REF |
5573 | /* If we're initializing a member of a subaggregate, it's a vtable | |
5574 | pointer. Leave it as COMPONENT_REF so we remember the path to get | |
5575 | to the vfield. */ | |
5576 | && TREE_CODE (TREE_OPERAND (member, 0)) != COMPONENT_REF) | |
66e61a34 JM |
5577 | member = TREE_OPERAND (member, 1); |
5578 | CONSTRUCTOR_APPEND_ELT (*vec, member, init); | |
5579 | return true; | |
5580 | } | |
5581 | ||
9b7d0509 JM |
5582 | /* Make sure that there are no statements after LAST in the constructor |
5583 | body represented by LIST. */ | |
5584 | ||
5585 | bool | |
5586 | check_constexpr_ctor_body (tree last, tree list) | |
5587 | { | |
5588 | bool ok = true; | |
5589 | if (TREE_CODE (list) == STATEMENT_LIST) | |
5590 | { | |
5591 | tree_stmt_iterator i = tsi_last (list); | |
5592 | for (; !tsi_end_p (i); tsi_prev (&i)) | |
5593 | { | |
5594 | tree t = tsi_stmt (i); | |
5595 | if (t == last) | |
5596 | break; | |
5597 | if (TREE_CODE (t) == BIND_EXPR) | |
5598 | { | |
5599 | if (!check_constexpr_ctor_body (last, BIND_EXPR_BODY (t))) | |
5600 | return false; | |
5601 | else | |
5602 | continue; | |
5603 | } | |
5604 | /* We currently allow typedefs and static_assert. | |
5605 | FIXME allow them in the standard, too. */ | |
5606 | if (TREE_CODE (t) != STATIC_ASSERT) | |
5607 | { | |
5608 | ok = false; | |
5609 | break; | |
5610 | } | |
5611 | } | |
5612 | } | |
5613 | else if (list != last | |
5614 | && TREE_CODE (list) != STATIC_ASSERT) | |
5615 | ok = false; | |
5616 | if (!ok) | |
5617 | { | |
5618 | error ("constexpr constructor does not have empty body"); | |
5619 | DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false; | |
5620 | } | |
5621 | return ok; | |
5622 | } | |
5623 | ||
66e61a34 JM |
5624 | /* Build compile-time evalable representations of member-initializer list |
5625 | for a constexpr constructor. */ | |
5626 | ||
5627 | static tree | |
5628 | build_constexpr_constructor_member_initializers (tree type, tree body) | |
5629 | { | |
5630 | VEC(constructor_elt,gc) *vec = NULL; | |
5631 | bool ok = true; | |
5632 | if (TREE_CODE (body) == MUST_NOT_THROW_EXPR | |
5633 | || TREE_CODE (body) == EH_SPEC_BLOCK) | |
5634 | body = TREE_OPERAND (body, 0); | |
d4e55f30 JM |
5635 | if (TREE_CODE (body) == STATEMENT_LIST) |
5636 | body = STATEMENT_LIST_HEAD (body)->stmt; | |
5637 | body = BIND_EXPR_BODY (body); | |
66e61a34 | 5638 | if (TREE_CODE (body) == CLEANUP_POINT_EXPR) |
62f9aedc JM |
5639 | { |
5640 | body = TREE_OPERAND (body, 0); | |
5641 | if (TREE_CODE (body) == EXPR_STMT) | |
5642 | body = TREE_OPERAND (body, 0); | |
5643 | if (TREE_CODE (body) == INIT_EXPR | |
5644 | && (same_type_ignoring_top_level_qualifiers_p | |
5645 | (TREE_TYPE (TREE_OPERAND (body, 0)), | |
5646 | current_class_type))) | |
5647 | { | |
5648 | /* Trivial copy. */ | |
5649 | return TREE_OPERAND (body, 1); | |
5650 | } | |
5651 | ok = build_data_member_initialization (body, &vec); | |
5652 | } | |
0787e2e7 | 5653 | else if (TREE_CODE (body) == STATEMENT_LIST) |
66e61a34 JM |
5654 | { |
5655 | tree_stmt_iterator i; | |
66e61a34 JM |
5656 | for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i)) |
5657 | { | |
5658 | ok = build_data_member_initialization (tsi_stmt (i), &vec); | |
5659 | if (!ok) | |
5660 | break; | |
5661 | } | |
5662 | } | |
0787e2e7 JM |
5663 | else |
5664 | gcc_assert (errorcount > 0); | |
66e61a34 JM |
5665 | if (ok) |
5666 | return build_constructor (type, vec); | |
5667 | else | |
5668 | return error_mark_node; | |
5669 | } | |
5670 | ||
62add5e1 JM |
5671 | /* Subroutine of register_constexpr_fundef. BODY is the body of a function |
5672 | declared to be constexpr, or a sub-statement thereof. Returns the | |
5673 | return value if suitable, error_mark_node for a statement not allowed in | |
5674 | a constexpr function, or NULL_TREE if no return value was found. */ | |
5675 | ||
5676 | static tree | |
5677 | constexpr_fn_retval (tree body) | |
5678 | { | |
5679 | switch (TREE_CODE (body)) | |
5680 | { | |
5681 | case STATEMENT_LIST: | |
5682 | { | |
5683 | tree_stmt_iterator i; | |
5684 | tree expr = NULL_TREE; | |
5685 | for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i)) | |
5686 | { | |
5687 | tree s = constexpr_fn_retval (tsi_stmt (i)); | |
5688 | if (s == error_mark_node) | |
5689 | return error_mark_node; | |
5690 | else if (s == NULL_TREE) | |
5691 | /* Keep iterating. */; | |
5692 | else if (expr) | |
5693 | /* Multiple return statements. */ | |
5694 | return error_mark_node; | |
5695 | else | |
5696 | expr = s; | |
5697 | } | |
5698 | return expr; | |
5699 | } | |
5700 | ||
5701 | case RETURN_EXPR: | |
5702 | return unshare_expr (TREE_OPERAND (body, 0)); | |
5703 | ||
5704 | case DECL_EXPR: | |
5705 | if (TREE_CODE (DECL_EXPR_DECL (body)) == USING_DECL) | |
5706 | return NULL_TREE; | |
5707 | return error_mark_node; | |
5708 | ||
5709 | case USING_STMT: | |
5710 | return NULL_TREE; | |
5711 | ||
5712 | default: | |
5713 | return error_mark_node; | |
5714 | } | |
5715 | } | |
5716 | ||
66e61a34 JM |
5717 | /* We are processing the definition of the constexpr function FUN. |
5718 | Check that its BODY fulfills the propriate requirements and | |
5719 | enter it in the constexpr function definition table. | |
5720 | For constructor BODY is actually the TREE_LIST of the | |
5721 | member-initializer list. */ | |
5722 | ||
5723 | tree | |
5724 | register_constexpr_fundef (tree fun, tree body) | |
5725 | { | |
5726 | constexpr_fundef *fundef = retrieve_constexpr_fundef (fun); | |
5727 | gcc_assert (fundef != NULL && fundef->body == NULL); | |
5728 | ||
5729 | if (DECL_CONSTRUCTOR_P (fun)) | |
5730 | body = build_constexpr_constructor_member_initializers | |
5731 | (DECL_CONTEXT (fun), body); | |
5732 | else | |
5733 | { | |
5734 | if (TREE_CODE (body) == BIND_EXPR) | |
5735 | body = BIND_EXPR_BODY (body); | |
5736 | if (TREE_CODE (body) == EH_SPEC_BLOCK) | |
5737 | body = EH_SPEC_STMTS (body); | |
5738 | if (TREE_CODE (body) == MUST_NOT_THROW_EXPR) | |
5739 | body = TREE_OPERAND (body, 0); | |
5740 | if (TREE_CODE (body) == CLEANUP_POINT_EXPR) | |
5741 | body = TREE_OPERAND (body, 0); | |
62add5e1 JM |
5742 | body = constexpr_fn_retval (body); |
5743 | if (body == NULL_TREE || body == error_mark_node) | |
66e61a34 JM |
5744 | { |
5745 | error ("body of constexpr function %qD not a return-statement", fun); | |
5746 | DECL_DECLARED_CONSTEXPR_P (fun) = false; | |
5747 | return NULL; | |
5748 | } | |
66e61a34 JM |
5749 | } |
5750 | ||
cb21e9cd | 5751 | if (!potential_rvalue_constant_expression (body)) |
66e61a34 JM |
5752 | { |
5753 | DECL_DECLARED_CONSTEXPR_P (fun) = false; | |
d6ed1c89 | 5754 | if (!DECL_TEMPLATE_INSTANTIATION (fun)) |
cb21e9cd | 5755 | require_potential_rvalue_constant_expression (body); |
66e61a34 JM |
5756 | return NULL; |
5757 | } | |
5758 | fundef->body = body; | |
5759 | return fun; | |
5760 | } | |
5761 | ||
c41095db GDR |
5762 | /* Objects of this type represent calls to constexpr functions |
5763 | along with the bindings of parameters to their arguments, for | |
5764 | the purpose of compile time evaluation. */ | |
5765 | ||
5766 | typedef struct GTY(()) constexpr_call { | |
5767 | /* Description of the constexpr function definition. */ | |
5768 | constexpr_fundef *fundef; | |
5769 | /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE | |
5770 | is a parameter _DECL and the TREE_VALUE is the value of the parameter. | |
5771 | Note: This arrangement is made to accomodate the use of | |
5772 | iterative_hash_template_arg (see pt.c). If you change this | |
5773 | representation, also change the hash calculation in | |
5774 | cxx_eval_call_expression. */ | |
5775 | tree bindings; | |
5776 | /* Result of the call. | |
5777 | NULL means the call is being evaluated. | |
5778 | error_mark_node means that the evaluation was erroneous; | |
5779 | otherwise, the actuall value of the call. */ | |
5780 | tree result; | |
5781 | /* The hash of this call; we remember it here to avoid having to | |
5782 | recalculate it when expanding the hash table. */ | |
5783 | hashval_t hash; | |
5784 | } constexpr_call; | |
5785 | ||
5786 | /* A table of all constexpr calls that have been evaluated by the | |
5787 | compiler in this translation unit. */ | |
5788 | ||
5789 | static GTY ((param_is (constexpr_call))) htab_t constexpr_call_table; | |
5790 | ||
5791 | static tree cxx_eval_constant_expression (const constexpr_call *, tree, | |
5792 | bool, bool, bool *); | |
5793 | ||
5794 | /* Compute a hash value for a constexpr call representation. */ | |
5795 | ||
5796 | static hashval_t | |
5797 | constexpr_call_hash (const void *p) | |
5798 | { | |
5799 | const constexpr_call *info = (const constexpr_call *) p; | |
5800 | return info->hash; | |
5801 | } | |
5802 | ||
5803 | /* Return 1 if the objects pointed to by P and Q represent calls | |
5804 | to the same constexpr function with the same arguments. | |
5805 | Otherwise, return 0. */ | |
5806 | ||
5807 | static int | |
5808 | constexpr_call_equal (const void *p, const void *q) | |
5809 | { | |
5810 | const constexpr_call *lhs = (const constexpr_call *) p; | |
5811 | const constexpr_call *rhs = (const constexpr_call *) q; | |
5812 | tree lhs_bindings; | |
5813 | tree rhs_bindings; | |
5814 | if (lhs == rhs) | |
5815 | return 1; | |
5816 | if (!constexpr_fundef_equal (lhs->fundef, rhs->fundef)) | |
5817 | return 0; | |
5818 | lhs_bindings = lhs->bindings; | |
5819 | rhs_bindings = rhs->bindings; | |
5820 | while (lhs_bindings != NULL && rhs_bindings != NULL) | |
5821 | { | |
5822 | tree lhs_arg = TREE_VALUE (lhs_bindings); | |
5823 | tree rhs_arg = TREE_VALUE (rhs_bindings); | |
5824 | gcc_assert (TREE_TYPE (lhs_arg) == TREE_TYPE (rhs_arg)); | |
5825 | if (!cp_tree_equal (lhs_arg, rhs_arg)) | |
5826 | return 0; | |
5827 | lhs_bindings = TREE_CHAIN (lhs_bindings); | |
5828 | rhs_bindings = TREE_CHAIN (rhs_bindings); | |
5829 | } | |
5830 | return lhs_bindings == rhs_bindings; | |
5831 | } | |
5832 | ||
5833 | /* Initialize the constexpr call table, if needed. */ | |
5834 | ||
5835 | static void | |
5836 | maybe_initialize_constexpr_call_table (void) | |
5837 | { | |
5838 | if (constexpr_call_table == NULL) | |
5839 | constexpr_call_table = htab_create_ggc (101, | |
5840 | constexpr_call_hash, | |
5841 | constexpr_call_equal, | |
5842 | ggc_free); | |
5843 | } | |
5844 | ||
66e61a34 JM |
5845 | /* Return true if T designates the implied `this' parameter. */ |
5846 | ||
5847 | static inline bool | |
5848 | is_this_parameter (tree t) | |
5849 | { | |
5850 | return t == current_class_ptr; | |
5851 | } | |
5852 | ||
5853 | /* We have an expression tree T that represents a call, either CALL_EXPR | |
5854 | or AGGR_INIT_EXPR. If the call is lexically to a named function, | |
5855 | retrun the _DECL for that function. */ | |
5856 | ||
5857 | static tree | |
5858 | get_function_named_in_call (tree t) | |
5859 | { | |
5860 | tree fun = NULL; | |
5861 | switch (TREE_CODE (t)) | |
5862 | { | |
5863 | case CALL_EXPR: | |
5864 | fun = CALL_EXPR_FN (t); | |
5865 | break; | |
5866 | ||
5867 | case AGGR_INIT_EXPR: | |
5868 | fun = AGGR_INIT_EXPR_FN (t); | |
5869 | break; | |
5870 | ||
5871 | default: | |
5872 | gcc_unreachable(); | |
5873 | break; | |
5874 | } | |
5875 | if (TREE_CODE (fun) == ADDR_EXPR | |
5876 | && TREE_CODE (TREE_OPERAND (fun, 0)) == FUNCTION_DECL) | |
5877 | fun = TREE_OPERAND (fun, 0); | |
7ecbca9d GDR |
5878 | return fun; |
5879 | } | |
5880 | ||
66e61a34 JM |
5881 | /* We have an expression tree T that represents a call, either CALL_EXPR |
5882 | or AGGR_INIT_EXPR. Return the Nth argument. */ | |
5883 | ||
5884 | static inline tree | |
5885 | get_nth_callarg (tree t, int n) | |
5886 | { | |
5887 | switch (TREE_CODE (t)) | |
5888 | { | |
5889 | case CALL_EXPR: | |
5890 | return CALL_EXPR_ARG (t, n); | |
5891 | ||
5892 | case AGGR_INIT_EXPR: | |
5893 | return AGGR_INIT_EXPR_ARG (t, n); | |
5894 | ||
5895 | default: | |
5896 | gcc_unreachable (); | |
5897 | return NULL; | |
5898 | } | |
5899 | } | |
5900 | ||
c41095db GDR |
5901 | /* Look up the binding of the function parameter T in a constexpr |
5902 | function call context CALL. */ | |
5903 | ||
5904 | static tree | |
5905 | lookup_parameter_binding (const constexpr_call *call, tree t) | |
5906 | { | |
5907 | tree b = purpose_member (t, call->bindings); | |
5908 | return TREE_VALUE (b); | |
5909 | } | |
5910 | ||
5911 | /* Attempt to evaluate T which represents a call to a builtin function. | |
5912 | We assume here that all builtin functions evaluate to scalar types | |
5913 | represented by _CST nodes. */ | |
5914 | ||
5915 | static tree | |
5916 | cxx_eval_builtin_function_call (const constexpr_call *call, tree t, | |
5917 | bool allow_non_constant, bool addr, | |
5918 | bool *non_constant_p) | |
5919 | { | |
5920 | const int nargs = call_expr_nargs (t); | |
5921 | tree *args = (tree *) alloca (nargs * sizeof (tree)); | |
5922 | tree new_call; | |
5923 | int i; | |
5924 | for (i = 0; i < nargs; ++i) | |
5925 | { | |
5926 | args[i] = cxx_eval_constant_expression (call, CALL_EXPR_ARG (t, i), | |
5927 | allow_non_constant, addr, | |
5928 | non_constant_p); | |
5929 | if (allow_non_constant && *non_constant_p) | |
5930 | return t; | |
5931 | } | |
5932 | if (*non_constant_p) | |
5933 | return t; | |
5934 | new_call = build_call_array_loc (EXPR_LOCATION (t), TREE_TYPE (t), | |
5935 | CALL_EXPR_FN (t), nargs, args); | |
5936 | return fold (new_call); | |
5937 | } | |
5938 | ||
5939 | /* TEMP is the constant value of a temporary object of type TYPE. Adjust | |
5940 | the type of the value to match. */ | |
5941 | ||
5942 | static tree | |
5943 | adjust_temp_type (tree type, tree temp) | |
5944 | { | |
5945 | if (TREE_TYPE (temp) == type) | |
5946 | return temp; | |
5947 | /* Avoid wrapping an aggregate value in a NOP_EXPR. */ | |
5948 | if (TREE_CODE (temp) == CONSTRUCTOR) | |
5949 | return build_constructor (type, CONSTRUCTOR_ELTS (temp)); | |
5950 | gcc_assert (SCALAR_TYPE_P (type)); | |
9e115cec | 5951 | return cp_fold_convert (type, temp); |
c41095db GDR |
5952 | } |
5953 | ||
5954 | /* Subroutine of cxx_eval_call_expression. | |
5955 | We are processing a call expression (either CALL_EXPR or | |
5956 | AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate | |
5957 | all arguments and bind their values to correspondings | |
5958 | parameters, making up the NEW_CALL context. */ | |
5959 | ||
5960 | static void | |
5961 | cxx_bind_parameters_in_call (const constexpr_call *old_call, tree t, | |
5962 | constexpr_call *new_call, | |
5963 | bool allow_non_constant, | |
5964 | bool *non_constant_p) | |
5965 | { | |
5966 | const int nargs = call_expr_nargs (t); | |
5967 | tree fun = new_call->fundef->decl; | |
5968 | tree parms = DECL_ARGUMENTS (fun); | |
5969 | int i; | |
5970 | for (i = 0; i < nargs; ++i) | |
5971 | { | |
5972 | tree x, arg; | |
5973 | tree type = parms ? TREE_TYPE (parms) : void_type_node; | |
5974 | /* For member function, the first argument is a pointer to the implied | |
5975 | object. And for an object contruction, don't bind `this' before | |
5976 | it is fully constructed. */ | |
5977 | if (i == 0 && DECL_CONSTRUCTOR_P (fun)) | |
5978 | goto next; | |
5979 | x = get_nth_callarg (t, i); | |
5980 | arg = cxx_eval_constant_expression (old_call, x, allow_non_constant, | |
5981 | TREE_CODE (type) == REFERENCE_TYPE, | |
5982 | non_constant_p); | |
5983 | /* Don't VERIFY_CONSTANT here. */ | |
5984 | if (*non_constant_p && allow_non_constant) | |
5985 | return; | |
5986 | /* Just discard ellipsis args after checking their constantitude. */ | |
5987 | if (!parms) | |
5988 | continue; | |
c6f54c7a JM |
5989 | if (*non_constant_p) |
5990 | /* Don't try to adjust the type of non-constant args. */ | |
5991 | goto next; | |
c41095db GDR |
5992 | |
5993 | /* Make sure the binding has the same type as the parm. */ | |
5994 | if (TREE_CODE (type) != REFERENCE_TYPE) | |
5995 | arg = adjust_temp_type (type, arg); | |
5996 | new_call->bindings = tree_cons (parms, arg, new_call->bindings); | |
5997 | next: | |
5998 | parms = TREE_CHAIN (parms); | |
5999 | } | |
6000 | } | |
6001 | ||
2bfe0527 JM |
6002 | /* Variables and functions to manage constexpr call expansion context. |
6003 | These do not need to be marked for PCH or GC. */ | |
6004 | ||
17bc631c | 6005 | /* FIXME remember and print actual constant arguments. */ |
2bfe0527 JM |
6006 | static VEC(tree,heap) *call_stack = NULL; |
6007 | static int call_stack_tick; | |
6008 | static int last_cx_error_tick; | |
6009 | ||
17bc631c | 6010 | static bool |
2bfe0527 JM |
6011 | push_cx_call_context (tree call) |
6012 | { | |
6013 | ++call_stack_tick; | |
6014 | if (!EXPR_HAS_LOCATION (call)) | |
6015 | SET_EXPR_LOCATION (call, input_location); | |
6016 | VEC_safe_push (tree, heap, call_stack, call); | |
17bc631c JM |
6017 | if (VEC_length (tree, call_stack) > (unsigned) max_constexpr_depth) |
6018 | return false; | |
6019 | return true; | |
2bfe0527 JM |
6020 | } |
6021 | ||
6022 | static void | |
6023 | pop_cx_call_context (void) | |
6024 | { | |
6025 | ++call_stack_tick; | |
6026 | VEC_pop (tree, call_stack); | |
6027 | } | |
6028 | ||
6029 | VEC(tree,heap) * | |
6030 | cx_error_context (void) | |
6031 | { | |
6032 | VEC(tree,heap) *r = NULL; | |
6033 | if (call_stack_tick != last_cx_error_tick | |
6034 | && !VEC_empty (tree, call_stack)) | |
6035 | r = call_stack; | |
6036 | last_cx_error_tick = call_stack_tick; | |
6037 | return r; | |
6038 | } | |
6039 | ||
c41095db GDR |
6040 | /* Subroutine of cxx_eval_constant_expression. |
6041 | Evaluate the call expression tree T in the context of OLD_CALL expression | |
6042 | evaluation. */ | |
6043 | ||
6044 | static tree | |
6045 | cxx_eval_call_expression (const constexpr_call *old_call, tree t, | |
6046 | bool allow_non_constant, bool addr, | |
6047 | bool *non_constant_p) | |
6048 | { | |
2bfe0527 | 6049 | location_t loc = EXPR_LOC_OR_HERE (t); |
c41095db GDR |
6050 | tree fun = get_function_named_in_call (t); |
6051 | tree result; | |
6052 | constexpr_call new_call = { NULL, NULL, NULL, 0 }; | |
6053 | constexpr_call **slot; | |
17bc631c JM |
6054 | constexpr_call *entry; |
6055 | bool depth_ok; | |
6056 | ||
c41095db GDR |
6057 | if (TREE_CODE (fun) != FUNCTION_DECL) |
6058 | { | |
6059 | /* Might be a constexpr function pointer. */ | |
6060 | fun = cxx_eval_constant_expression (old_call, fun, allow_non_constant, | |
6061 | /*addr*/false, non_constant_p); | |
6062 | if (TREE_CODE (fun) == ADDR_EXPR) | |
6063 | fun = TREE_OPERAND (fun, 0); | |
6064 | } | |
6065 | if (TREE_CODE (fun) != FUNCTION_DECL) | |
6066 | { | |
6067 | if (!allow_non_constant) | |
6068 | error_at (loc, "expression %qE does not designate a constexpr " | |
6069 | "function", fun); | |
6070 | *non_constant_p = true; | |
6071 | return t; | |
6072 | } | |
6073 | if (DECL_CLONED_FUNCTION_P (fun)) | |
6074 | fun = DECL_CLONED_FUNCTION (fun); | |
6075 | if (is_builtin_fn (fun)) | |
6076 | return cxx_eval_builtin_function_call (old_call, t, allow_non_constant, | |
6077 | addr, non_constant_p); | |
6078 | if (!DECL_DECLARED_CONSTEXPR_P (fun)) | |
6079 | { | |
6080 | if (!allow_non_constant) | |
6081 | { | |
6082 | error_at (loc, "%qD is not a constexpr function", fun); | |
6083 | if (DECL_TEMPLATE_INSTANTIATION (fun) | |
6084 | && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT | |
6085 | (DECL_TI_TEMPLATE (fun)))) | |
6086 | is_valid_constexpr_fn (fun, true); | |
6087 | } | |
6088 | *non_constant_p = true; | |
6089 | return t; | |
6090 | } | |
6091 | ||
06a85dd3 JM |
6092 | /* Shortcut trivial copy constructor/op=. */ |
6093 | if (call_expr_nargs (t) == 2 && trivial_fn_p (fun)) | |
c62f4cd9 JM |
6094 | { |
6095 | tree arg = convert_from_reference (get_nth_callarg (t, 1)); | |
6096 | return cxx_eval_constant_expression (old_call, arg, allow_non_constant, | |
6097 | addr, non_constant_p); | |
6098 | } | |
06a85dd3 | 6099 | |
c41095db GDR |
6100 | /* If in direct recursive call, optimize definition search. */ |
6101 | if (old_call != NULL && old_call->fundef->decl == fun) | |
6102 | new_call.fundef = old_call->fundef; | |
6103 | else | |
6104 | { | |
6105 | new_call.fundef = retrieve_constexpr_fundef (fun); | |
6106 | if (new_call.fundef == NULL || new_call.fundef->body == NULL) | |
6107 | { | |
6108 | if (!allow_non_constant) | |
6109 | error_at (loc, "%qD used before its definition", fun); | |
6110 | *non_constant_p = true; | |
6111 | return t; | |
6112 | } | |
6113 | } | |
6114 | cxx_bind_parameters_in_call (old_call, t, &new_call, | |
6115 | allow_non_constant, non_constant_p); | |
6116 | if (*non_constant_p) | |
6117 | return t; | |
6118 | ||
17bc631c | 6119 | depth_ok = push_cx_call_context (t); |
2bfe0527 | 6120 | |
c41095db GDR |
6121 | new_call.hash |
6122 | = iterative_hash_template_arg (new_call.bindings, | |
6123 | constexpr_fundef_hash (new_call.fundef)); | |
6124 | ||
6125 | /* If we have seen this call before, we are done. */ | |
6126 | maybe_initialize_constexpr_call_table (); | |
6127 | slot = (constexpr_call **) | |
6128 | htab_find_slot (constexpr_call_table, &new_call, INSERT); | |
17bc631c JM |
6129 | entry = *slot; |
6130 | if (entry == NULL) | |
c41095db GDR |
6131 | { |
6132 | /* We need to keep a pointer to the entry, not just the slot, as the | |
6133 | slot can move in the call to cxx_eval_builtin_function_call. */ | |
17bc631c | 6134 | *slot = entry = ggc_alloc_constexpr_call (); |
c41095db | 6135 | *entry = new_call; |
17bc631c JM |
6136 | } |
6137 | /* Calls which are in progress have their result set to NULL | |
6138 | so that we can detect circular dependencies. */ | |
6139 | else if (entry->result == NULL) | |
6140 | { | |
6141 | if (!allow_non_constant) | |
6142 | error ("call has circular dependency"); | |
6143 | *non_constant_p = true; | |
6144 | entry->result = result = error_mark_node; | |
6145 | } | |
6146 | ||
6147 | if (!depth_ok) | |
6148 | { | |
6149 | if (!allow_non_constant) | |
6150 | error ("constexpr evaluation depth exceeds maximum of %d (use " | |
6151 | "-fconstexpr-depth= to increase the maximum)", | |
6152 | max_constexpr_depth); | |
6153 | *non_constant_p = true; | |
6154 | entry->result = result = error_mark_node; | |
6155 | } | |
6156 | else | |
6157 | { | |
6158 | result = entry->result; | |
6159 | if (!result || (result == error_mark_node && !allow_non_constant)) | |
6160 | result = (cxx_eval_constant_expression | |
6161 | (&new_call, new_call.fundef->body, | |
6162 | allow_non_constant, addr, | |
6163 | non_constant_p)); | |
6164 | if (result == error_mark_node) | |
6165 | *non_constant_p = true; | |
c41095db GDR |
6166 | if (*non_constant_p) |
6167 | entry->result = result = error_mark_node; | |
6168 | else | |
6169 | { | |
6170 | /* If this was a call to initialize an object, set the type of | |
6171 | the CONSTRUCTOR to the type of that object. */ | |
6172 | if (DECL_CONSTRUCTOR_P (fun)) | |
6173 | { | |
6174 | tree ob_arg = get_nth_callarg (t, 0); | |
6175 | STRIP_NOPS (ob_arg); | |
6176 | gcc_assert (TREE_CODE (TREE_TYPE (ob_arg)) == POINTER_TYPE | |
6177 | && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg)))); | |
6178 | result = adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg)), | |
6179 | result); | |
6180 | } | |
6181 | entry->result = result; | |
6182 | } | |
6183 | } | |
6184 | ||
2bfe0527 | 6185 | pop_cx_call_context (); |
e26ab5ec | 6186 | return unshare_expr (result); |
c41095db GDR |
6187 | } |
6188 | ||
9e115cec JM |
6189 | /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */ |
6190 | ||
c41095db GDR |
6191 | bool |
6192 | reduced_constant_expression_p (tree t) | |
6193 | { | |
9e115cec JM |
6194 | if (TREE_OVERFLOW_P (t)) |
6195 | /* Integer overflow makes this not a constant expression. */ | |
c41095db GDR |
6196 | return false; |
6197 | /* FIXME are we calling this too much? */ | |
6198 | return initializer_constant_valid_p (t, TREE_TYPE (t)) != NULL_TREE; | |
6199 | } | |
6200 | ||
6201 | /* Some expressions may have constant operands but are not constant | |
6202 | themselves, such as 1/0. Call this function (or rather, the macro | |
6203 | following it) to check for that condition. | |
6204 | ||
6205 | We only call this in places that require an arithmetic constant, not in | |
6206 | places where we might have a non-constant expression that can be a | |
6207 | component of a constant expression, such as the address of a constexpr | |
6208 | variable that might be dereferenced later. */ | |
6209 | ||
6210 | static bool | |
6211 | verify_constant (tree t, bool allow_non_constant, bool *non_constant_p) | |
6212 | { | |
6213 | if (!*non_constant_p && !reduced_constant_expression_p (t)) | |
6214 | { | |
6215 | if (!allow_non_constant) | |
9e115cec JM |
6216 | { |
6217 | /* If T was already folded to a _CST with TREE_OVERFLOW set, | |
6218 | printing the folded constant isn't helpful. */ | |
6219 | if (TREE_OVERFLOW_P (t)) | |
6220 | { | |
6221 | permerror (input_location, "overflow in constant expression"); | |
6222 | /* If we're being permissive (and are in an enforcing | |
6223 | context), consider this constant. */ | |
6224 | if (flag_permissive) | |
6225 | return false; | |
6226 | } | |
6227 | else | |
6228 | error ("%q+E is not a constant expression", t); | |
6229 | } | |
c41095db GDR |
6230 | *non_constant_p = true; |
6231 | } | |
6232 | return *non_constant_p; | |
6233 | } | |
6234 | #define VERIFY_CONSTANT(X) \ | |
6235 | do { \ | |
6236 | if (verify_constant ((X), allow_non_constant, non_constant_p)) \ | |
6237 | return t; \ | |
6238 | } while (0) | |
6239 | ||
6240 | /* Subroutine of cxx_eval_constant_expression. | |
6241 | Attempt to reduce the unary expression tree T to a compile time value. | |
6242 | If successful, return the value. Otherwise issue a diagnostic | |
6243 | and return error_mark_node. */ | |
6244 | ||
6245 | static tree | |
6246 | cxx_eval_unary_expression (const constexpr_call *call, tree t, | |
6247 | bool allow_non_constant, bool addr, | |
6248 | bool *non_constant_p) | |
6249 | { | |
6250 | tree r; | |
6251 | tree orig_arg = TREE_OPERAND (t, 0); | |
6252 | tree arg = cxx_eval_constant_expression (call, orig_arg, allow_non_constant, | |
6253 | addr, non_constant_p); | |
6254 | VERIFY_CONSTANT (arg); | |
6255 | if (arg == orig_arg) | |
6256 | return t; | |
6257 | r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), arg); | |
6258 | VERIFY_CONSTANT (r); | |
6259 | return r; | |
6260 | } | |
6261 | ||
6262 | /* Subroutine of cxx_eval_constant_expression. | |
6263 | Like cxx_eval_unary_expression, except for binary expressions. */ | |
6264 | ||
6265 | static tree | |
6266 | cxx_eval_binary_expression (const constexpr_call *call, tree t, | |
6267 | bool allow_non_constant, bool addr, | |
6268 | bool *non_constant_p) | |
6269 | { | |
6270 | tree r; | |
6271 | tree orig_lhs = TREE_OPERAND (t, 0); | |
6272 | tree orig_rhs = TREE_OPERAND (t, 1); | |
6273 | tree lhs, rhs; | |
6274 | lhs = cxx_eval_constant_expression (call, orig_lhs, | |
6275 | allow_non_constant, addr, | |
6276 | non_constant_p); | |
6277 | VERIFY_CONSTANT (lhs); | |
6278 | rhs = cxx_eval_constant_expression (call, orig_rhs, | |
6279 | allow_non_constant, addr, | |
6280 | non_constant_p); | |
6281 | VERIFY_CONSTANT (rhs); | |
6282 | if (lhs == orig_lhs && rhs == orig_rhs) | |
6283 | return t; | |
6284 | r = fold_build2 (TREE_CODE (t), TREE_TYPE (t), lhs, rhs); | |
6285 | VERIFY_CONSTANT (r); | |
6286 | return r; | |
6287 | } | |
6288 | ||
6289 | /* Subroutine of cxx_eval_constant_expression. | |
6290 | Attempt to evaluate condition expressions. Dead branches are not | |
6291 | looked into. */ | |
6292 | ||
6293 | static tree | |
6294 | cxx_eval_conditional_expression (const constexpr_call *call, tree t, | |
6295 | bool allow_non_constant, bool addr, | |
6296 | bool *non_constant_p) | |
6297 | { | |
6298 | tree val = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0), | |
6299 | allow_non_constant, addr, | |
6300 | non_constant_p); | |
6301 | VERIFY_CONSTANT (val); | |
6302 | if (val == boolean_true_node) | |
6303 | return cxx_eval_constant_expression (call, TREE_OPERAND (t, 1), | |
6304 | allow_non_constant, addr, | |
6305 | non_constant_p); | |
6306 | gcc_assert (val == boolean_false_node); | |
6307 | /* Don't VERIFY_CONSTANT here. */ | |
6308 | return cxx_eval_constant_expression (call, TREE_OPERAND (t, 2), | |
6309 | allow_non_constant, addr, | |
6310 | non_constant_p); | |
6311 | } | |
6312 | ||
6313 | /* Subroutine of cxx_eval_constant_expression. | |
6314 | Attempt to reduce a reference to an array slot. */ | |
6315 | ||
6316 | static tree | |
6317 | cxx_eval_array_reference (const constexpr_call *call, tree t, | |
6318 | bool allow_non_constant, bool addr, | |
6319 | bool *non_constant_p) | |
6320 | { | |
6321 | tree oldary = TREE_OPERAND (t, 0); | |
6322 | tree ary = cxx_eval_constant_expression (call, oldary, | |
6323 | allow_non_constant, addr, | |
6324 | non_constant_p); | |
6325 | tree index, oldidx; | |
6326 | HOST_WIDE_INT i; | |
9c76a19e | 6327 | unsigned len, elem_nchars = 1; |
c41095db GDR |
6328 | if (*non_constant_p) |
6329 | return t; | |
6330 | oldidx = TREE_OPERAND (t, 1); | |
6331 | index = cxx_eval_constant_expression (call, oldidx, | |
6332 | allow_non_constant, false, | |
6333 | non_constant_p); | |
6334 | VERIFY_CONSTANT (index); | |
6335 | if (addr && ary == oldary && index == oldidx) | |
6336 | return t; | |
6337 | else if (addr) | |
6338 | return build4 (ARRAY_REF, TREE_TYPE (t), ary, index, NULL, NULL); | |
9c76a19e JJ |
6339 | if (TREE_CODE (ary) == CONSTRUCTOR) |
6340 | len = CONSTRUCTOR_NELTS (ary); | |
6341 | else | |
6342 | { | |
6343 | elem_nchars = (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (ary))) | |
6344 | / TYPE_PRECISION (char_type_node)); | |
6345 | len = (unsigned) TREE_STRING_LENGTH (ary) / elem_nchars; | |
6346 | } | |
c41095db GDR |
6347 | if (compare_tree_int (index, len) >= 0) |
6348 | { | |
6349 | if (!allow_non_constant) | |
6350 | error ("array subscript out of bound"); | |
6351 | *non_constant_p = true; | |
6352 | return t; | |
6353 | } | |
6354 | i = tree_low_cst (index, 0); | |
6355 | if (TREE_CODE (ary) == CONSTRUCTOR) | |
6356 | return VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ary), i)->value; | |
9c76a19e | 6357 | else if (elem_nchars == 1) |
c41095db GDR |
6358 | return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary))), |
6359 | TREE_STRING_POINTER (ary)[i]); | |
9c76a19e JJ |
6360 | else |
6361 | { | |
6362 | tree type = cv_unqualified (TREE_TYPE (TREE_TYPE (ary))); | |
6363 | return native_interpret_expr (type, (const unsigned char *) | |
6364 | TREE_STRING_POINTER (ary) | |
6365 | + i * elem_nchars, elem_nchars); | |
6366 | } | |
c41095db GDR |
6367 | /* Don't VERIFY_CONSTANT here. */ |
6368 | } | |
6369 | ||
6370 | /* Subroutine of cxx_eval_constant_expression. | |
6371 | Attempt to reduce a field access of a value of class type. */ | |
6372 | ||
6373 | static tree | |
6374 | cxx_eval_component_reference (const constexpr_call *call, tree t, | |
6375 | bool allow_non_constant, bool addr, | |
6376 | bool *non_constant_p) | |
6377 | { | |
6378 | unsigned HOST_WIDE_INT i; | |
6379 | tree field; | |
6380 | tree value; | |
6381 | tree part = TREE_OPERAND (t, 1); | |
6382 | tree orig_whole = TREE_OPERAND (t, 0); | |
6383 | tree whole = cxx_eval_constant_expression (call, orig_whole, | |
6384 | allow_non_constant, addr, | |
6385 | non_constant_p); | |
6386 | if (whole == orig_whole) | |
6387 | return t; | |
6388 | if (addr) | |
6389 | return fold_build3 (COMPONENT_REF, TREE_TYPE (t), | |
6390 | whole, part, NULL_TREE); | |
6391 | /* Don't VERIFY_CONSTANT here; we only want to check that we got a | |
6392 | CONSTRUCTOR. */ | |
6393 | if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR) | |
6394 | { | |
6395 | if (!allow_non_constant) | |
6396 | error ("%qE is not a constant expression", orig_whole); | |
6397 | *non_constant_p = true; | |
6398 | } | |
6399 | if (*non_constant_p) | |
6400 | return t; | |
6401 | FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value) | |
6402 | { | |
6403 | if (field == part) | |
6404 | return value; | |
6405 | } | |
6406 | if (TREE_CODE (TREE_TYPE (whole)) == UNION_TYPE) | |
6407 | { | |
6408 | /* FIXME Mike Miller wants this to be OK. */ | |
6409 | if (!allow_non_constant) | |
6410 | error ("accessing %qD member instead of initialized %qD member in " | |
6411 | "constant expression", part, CONSTRUCTOR_ELT (whole, 0)->index); | |
6412 | *non_constant_p = true; | |
6413 | return t; | |
6414 | } | |
6415 | gcc_unreachable(); | |
6416 | return error_mark_node; | |
6417 | } | |
6418 | ||
4ddf1c7f JM |
6419 | /* Subroutine of cxx_eval_constant_expression. |
6420 | Attempt to reduce a field access of a value of class type that is | |
6421 | expressed as a BIT_FIELD_REF. */ | |
6422 | ||
6423 | static tree | |
6424 | cxx_eval_bit_field_ref (const constexpr_call *call, tree t, | |
6425 | bool allow_non_constant, bool addr, | |
6426 | bool *non_constant_p) | |
6427 | { | |
6428 | tree orig_whole = TREE_OPERAND (t, 0); | |
6429 | tree whole = cxx_eval_constant_expression (call, orig_whole, | |
6430 | allow_non_constant, addr, | |
6431 | non_constant_p); | |
6432 | tree start, field, value; | |
6433 | unsigned HOST_WIDE_INT i; | |
6434 | ||
6435 | if (whole == orig_whole) | |
6436 | return t; | |
6437 | /* Don't VERIFY_CONSTANT here; we only want to check that we got a | |
6438 | CONSTRUCTOR. */ | |
6439 | if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR) | |
6440 | { | |
6441 | if (!allow_non_constant) | |
6442 | error ("%qE is not a constant expression", orig_whole); | |
6443 | *non_constant_p = true; | |
6444 | } | |
6445 | if (*non_constant_p) | |
6446 | return t; | |
6447 | ||
6448 | start = TREE_OPERAND (t, 2); | |
6449 | FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value) | |
6450 | { | |
6451 | if (bit_position (field) == start) | |
6452 | return value; | |
6453 | } | |
6454 | gcc_unreachable(); | |
6455 | return error_mark_node; | |
6456 | } | |
6457 | ||
c41095db GDR |
6458 | /* Subroutine of cxx_eval_constant_expression. |
6459 | Evaluate a short-circuited logical expression T in the context | |
6460 | of a given constexpr CALL. BAILOUT_VALUE is the value for | |
6461 | early return. CONTINUE_VALUE is used here purely for | |
6462 | sanity check purposes. */ | |
6463 | ||
6464 | static tree | |
6465 | cxx_eval_logical_expression (const constexpr_call *call, tree t, | |
6466 | tree bailout_value, tree continue_value, | |
6467 | bool allow_non_constant, bool addr, | |
6468 | bool *non_constant_p) | |
6469 | { | |
6470 | tree r; | |
6471 | tree lhs = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0), | |
6472 | allow_non_constant, addr, | |
6473 | non_constant_p); | |
6474 | VERIFY_CONSTANT (lhs); | |
6475 | if (lhs == bailout_value) | |
6476 | return lhs; | |
6477 | gcc_assert (lhs == continue_value); | |
6478 | r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1), | |
6479 | allow_non_constant, addr, non_constant_p); | |
6480 | VERIFY_CONSTANT (r); | |
6481 | return r; | |
6482 | } | |
6483 | ||
d79b88a1 JM |
6484 | /* REF is a COMPONENT_REF designating a particular field. V is a vector of |
6485 | CONSTRUCTOR elements to initialize (part of) an object containing that | |
6486 | field. Return a pointer to the constructor_elt corresponding to the | |
6487 | initialization of the field. */ | |
6488 | ||
6489 | static constructor_elt * | |
6490 | base_field_constructor_elt (VEC(constructor_elt,gc) *v, tree ref) | |
6491 | { | |
6492 | tree aggr = TREE_OPERAND (ref, 0); | |
6493 | tree field = TREE_OPERAND (ref, 1); | |
6494 | HOST_WIDE_INT i; | |
6495 | constructor_elt *ce; | |
6496 | ||
6497 | gcc_assert (TREE_CODE (ref) == COMPONENT_REF); | |
6498 | ||
6499 | if (TREE_CODE (aggr) == COMPONENT_REF) | |
6500 | { | |
6501 | constructor_elt *base_ce | |
6502 | = base_field_constructor_elt (v, aggr); | |
6503 | v = CONSTRUCTOR_ELTS (base_ce->value); | |
6504 | } | |
6505 | ||
6506 | for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i) | |
6507 | if (ce->index == field) | |
6508 | return ce; | |
6509 | ||
6510 | gcc_unreachable (); | |
6511 | return NULL; | |
6512 | } | |
6513 | ||
c41095db GDR |
6514 | /* Subroutine of cxx_eval_constant_expression. |
6515 | The expression tree T denotes a C-style array or a C-style | |
6516 | aggregate. Reduce it to a constant expression. */ | |
6517 | ||
6518 | static tree | |
6519 | cxx_eval_bare_aggregate (const constexpr_call *call, tree t, | |
6520 | bool allow_non_constant, bool addr, | |
6521 | bool *non_constant_p) | |
6522 | { | |
6523 | VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (t); | |
6524 | VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc, | |
6525 | VEC_length (constructor_elt, v)); | |
6526 | constructor_elt *ce; | |
6527 | HOST_WIDE_INT i; | |
6528 | bool changed = false; | |
c41095db GDR |
6529 | gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t)); |
6530 | for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i) | |
6531 | { | |
6532 | tree elt = cxx_eval_constant_expression (call, ce->value, | |
6533 | allow_non_constant, addr, | |
6534 | non_constant_p); | |
6535 | /* Don't VERIFY_CONSTANT here. */ | |
6536 | if (allow_non_constant && *non_constant_p) | |
6537 | goto fail; | |
6538 | if (elt != ce->value) | |
6539 | changed = true; | |
d79b88a1 | 6540 | if (TREE_CODE (ce->index) == COMPONENT_REF) |
c41095db | 6541 | { |
d79b88a1 JM |
6542 | /* This is an initialization of a vfield inside a base |
6543 | subaggregate that we already initialized; push this | |
6544 | initialization into the previous initialization. */ | |
6545 | constructor_elt *inner = base_field_constructor_elt (n, ce->index); | |
6546 | inner->value = elt; | |
c41095db GDR |
6547 | } |
6548 | else | |
6549 | CONSTRUCTOR_APPEND_ELT (n, ce->index, elt); | |
6550 | } | |
6551 | if (*non_constant_p || !changed) | |
6552 | { | |
6553 | fail: | |
6554 | VEC_free (constructor_elt, gc, n); | |
6555 | return t; | |
6556 | } | |
6557 | t = build_constructor (TREE_TYPE (t), n); | |
6558 | TREE_CONSTANT (t) = true; | |
6559 | return t; | |
6560 | } | |
6561 | ||
6562 | /* Subroutine of cxx_eval_constant_expression. | |
6563 | The expression tree T is a VEC_INIT_EXPR which denotes the desired | |
6564 | initialization of a non-static data member of array type. Reduce it to a | |
6565 | CONSTRUCTOR. | |
6566 | ||
2b00e201 JM |
6567 | Note that apart from value-initialization (when VALUE_INIT is true), |
6568 | this is only intended to support value-initialization and the | |
6569 | initializations done by defaulted constructors for classes with | |
6570 | non-static data members of array type. In this case, VEC_INIT_EXPR_INIT | |
6571 | will either be NULL_TREE for the default constructor, or a COMPONENT_REF | |
6572 | for the copy/move constructor. */ | |
c41095db GDR |
6573 | |
6574 | static tree | |
6575 | cxx_eval_vec_init_1 (const constexpr_call *call, tree atype, tree init, | |
2b00e201 | 6576 | bool value_init, bool allow_non_constant, bool addr, |
c41095db GDR |
6577 | bool *non_constant_p) |
6578 | { | |
6579 | tree elttype = TREE_TYPE (atype); | |
6580 | int max = tree_low_cst (array_type_nelts (atype), 0); | |
6581 | VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc, max + 1); | |
6582 | int i; | |
6583 | ||
6584 | /* For the default constructor, build up a call to the default | |
6585 | constructor of the element type. We only need to handle class types | |
6586 | here, as for a constructor to be constexpr, all members must be | |
6587 | initialized, which for a defaulted default constructor means they must | |
6588 | be of a class type with a constexpr default constructor. */ | |
2b00e201 JM |
6589 | if (value_init) |
6590 | gcc_assert (!init); | |
6591 | else if (!init) | |
c41095db GDR |
6592 | { |
6593 | VEC(tree,gc) *argvec = make_tree_vector (); | |
6594 | init = build_special_member_call (NULL_TREE, complete_ctor_identifier, | |
6595 | &argvec, elttype, LOOKUP_NORMAL, | |
6596 | tf_warning_or_error); | |
6597 | release_tree_vector (argvec); | |
6598 | init = cxx_eval_constant_expression (call, init, allow_non_constant, | |
6599 | addr, non_constant_p); | |
6600 | } | |
6601 | ||
6602 | if (*non_constant_p && !allow_non_constant) | |
6603 | goto fail; | |
6604 | ||
6605 | for (i = 0; i <= max; ++i) | |
6606 | { | |
6607 | tree idx = build_int_cst (size_type_node, i); | |
6608 | tree eltinit; | |
6609 | if (TREE_CODE (elttype) == ARRAY_TYPE) | |
6610 | { | |
6611 | /* A multidimensional array; recurse. */ | |
2b00e201 JM |
6612 | if (value_init) |
6613 | eltinit = NULL_TREE; | |
6614 | else | |
6615 | eltinit = cp_build_array_ref (input_location, init, idx, | |
6616 | tf_warning_or_error); | |
6617 | eltinit = cxx_eval_vec_init_1 (call, elttype, eltinit, value_init, | |
c41095db GDR |
6618 | allow_non_constant, addr, |
6619 | non_constant_p); | |
6620 | } | |
2b00e201 JM |
6621 | else if (value_init) |
6622 | { | |
6623 | eltinit = build_value_init (elttype, tf_warning_or_error); | |
6624 | eltinit = cxx_eval_constant_expression | |
6625 | (call, eltinit, allow_non_constant, addr, non_constant_p); | |
6626 | } | |
c41095db GDR |
6627 | else if (TREE_CODE (init) == CONSTRUCTOR) |
6628 | { | |
6629 | /* Initializing an element using the call to the default | |
6630 | constructor we just built above. */ | |
6631 | eltinit = unshare_expr (init); | |
6632 | } | |
6633 | else | |
6634 | { | |
6635 | /* Copying an element. */ | |
6636 | VEC(tree,gc) *argvec; | |
6637 | gcc_assert (same_type_ignoring_top_level_qualifiers_p | |
6638 | (atype, TREE_TYPE (init))); | |
6639 | eltinit = cp_build_array_ref (input_location, init, idx, | |
6640 | tf_warning_or_error); | |
6641 | if (!real_lvalue_p (init)) | |
6642 | eltinit = move (eltinit); | |
6643 | argvec = make_tree_vector (); | |
6644 | VEC_quick_push (tree, argvec, eltinit); | |
6645 | eltinit = (build_special_member_call | |
6646 | (NULL_TREE, complete_ctor_identifier, &argvec, | |
6647 | elttype, LOOKUP_NORMAL, tf_warning_or_error)); | |
6648 | release_tree_vector (argvec); | |
6649 | eltinit = cxx_eval_constant_expression | |
6650 | (call, eltinit, allow_non_constant, addr, non_constant_p); | |
6651 | } | |
6652 | if (*non_constant_p && !allow_non_constant) | |
6653 | goto fail; | |
6654 | CONSTRUCTOR_APPEND_ELT (n, idx, eltinit); | |
6655 | } | |
6656 | ||
6657 | if (!*non_constant_p) | |
6658 | { | |
6659 | init = build_constructor (TREE_TYPE (atype), n); | |
6660 | TREE_CONSTANT (init) = true; | |
6661 | return init; | |
6662 | } | |
6663 | ||
6664 | fail: | |
6665 | VEC_free (constructor_elt, gc, n); | |
6666 | return init; | |
6667 | } | |
6668 | ||
6669 | static tree | |
6670 | cxx_eval_vec_init (const constexpr_call *call, tree t, | |
6671 | bool allow_non_constant, bool addr, | |
6672 | bool *non_constant_p) | |
6673 | { | |
6674 | tree atype = TREE_TYPE (t); | |
6675 | tree init = VEC_INIT_EXPR_INIT (t); | |
2b00e201 JM |
6676 | tree r = cxx_eval_vec_init_1 (call, atype, init, |
6677 | VEC_INIT_EXPR_VALUE_INIT (t), | |
6678 | allow_non_constant, addr, non_constant_p); | |
c41095db GDR |
6679 | if (*non_constant_p) |
6680 | return t; | |
6681 | else | |
6682 | return r; | |
6683 | } | |
6684 | ||
6685 | /* A less strict version of fold_indirect_ref_1, which requires cv-quals to | |
6686 | match. We want to be less strict for simple *& folding; if we have a | |
6687 | non-const temporary that we access through a const pointer, that should | |
6688 | work. We handle this here rather than change fold_indirect_ref_1 | |
6689 | because we're dealing with things like ADDR_EXPR of INTEGER_CST which | |
6690 | don't really make sense outside of constant expression evaluation. Also | |
6691 | we want to allow folding to COMPONENT_REF, which could cause trouble | |
6692 | with TBAA in fold_indirect_ref_1. */ | |
6693 | ||
6694 | static tree | |
6695 | cxx_eval_indirect_ref (const constexpr_call *call, tree t, | |
6696 | bool allow_non_constant, bool addr, | |
6697 | bool *non_constant_p) | |
6698 | { | |
6699 | tree orig_op0 = TREE_OPERAND (t, 0); | |
6700 | tree op0 = cxx_eval_constant_expression (call, orig_op0, allow_non_constant, | |
6701 | /*addr*/false, non_constant_p); | |
6702 | tree type, sub, subtype, r; | |
6703 | bool empty_base; | |
6704 | ||
6705 | /* Don't VERIFY_CONSTANT here. */ | |
6706 | if (*non_constant_p) | |
6707 | return t; | |
6708 | ||
6709 | type = TREE_TYPE (t); | |
6710 | sub = op0; | |
6711 | r = NULL_TREE; | |
6712 | empty_base = false; | |
6713 | ||
6714 | STRIP_NOPS (sub); | |
6715 | subtype = TREE_TYPE (sub); | |
6716 | gcc_assert (POINTER_TYPE_P (subtype)); | |
6717 | ||
6718 | if (TREE_CODE (sub) == ADDR_EXPR) | |
6719 | { | |
6720 | tree op = TREE_OPERAND (sub, 0); | |
6721 | tree optype = TREE_TYPE (op); | |
6722 | ||
6723 | if (same_type_ignoring_top_level_qualifiers_p (optype, type)) | |
6724 | r = op; | |
6725 | /* Also handle conversion to an empty base class, which | |
6726 | is represented with a NOP_EXPR. */ | |
6727 | else if (!addr && is_empty_class (type) | |
6728 | && CLASS_TYPE_P (optype) | |
6729 | && DERIVED_FROM_P (type, optype)) | |
6730 | { | |
6731 | r = op; | |
6732 | empty_base = true; | |
6733 | } | |
6734 | /* *(foo *)&struct_with_foo_field => COMPONENT_REF */ | |
6735 | else if (RECORD_OR_UNION_TYPE_P (optype)) | |
6736 | { | |
6737 | tree field = TYPE_FIELDS (optype); | |
6738 | for (; field; field = DECL_CHAIN (field)) | |
6739 | if (TREE_CODE (field) == FIELD_DECL | |
6740 | && integer_zerop (byte_position (field)) | |
6741 | && (same_type_ignoring_top_level_qualifiers_p | |
6742 | (TREE_TYPE (field), type))) | |
6743 | { | |
6744 | r = fold_build3 (COMPONENT_REF, type, op, field, NULL_TREE); | |
6745 | break; | |
6746 | } | |
6747 | } | |
6748 | } | |
6749 | else if (TREE_CODE (sub) == POINTER_PLUS_EXPR | |
6750 | && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST) | |
6751 | { | |
6752 | tree op00 = TREE_OPERAND (sub, 0); | |
6753 | tree op01 = TREE_OPERAND (sub, 1); | |
6754 | ||
6755 | STRIP_NOPS (op00); | |
6756 | if (TREE_CODE (op00) == ADDR_EXPR) | |
6757 | { | |
6758 | tree op00type; | |
6759 | op00 = TREE_OPERAND (op00, 0); | |
6760 | op00type = TREE_TYPE (op00); | |
6761 | ||
6762 | /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */ | |
6763 | if (RECORD_OR_UNION_TYPE_P (op00type)) | |
6764 | { | |
6765 | tree field = TYPE_FIELDS (op00type); | |
6766 | for (; field; field = DECL_CHAIN (field)) | |
6767 | if (TREE_CODE (field) == FIELD_DECL | |
6768 | && tree_int_cst_equal (byte_position (field), op01) | |
6769 | && (same_type_ignoring_top_level_qualifiers_p | |
6770 | (TREE_TYPE (field), type))) | |
6771 | { | |
6772 | r = fold_build3 (COMPONENT_REF, type, op00, | |
6773 | field, NULL_TREE); | |
6774 | break; | |
6775 | } | |
6776 | } | |
6777 | } | |
6778 | } | |
6779 | ||
6780 | /* Let build_fold_indirect_ref handle the cases it does fine with. */ | |
6781 | if (r == NULL_TREE) | |
6782 | r = build_fold_indirect_ref (op0); | |
6783 | if (TREE_CODE (r) != INDIRECT_REF) | |
6784 | r = cxx_eval_constant_expression (call, r, allow_non_constant, | |
6785 | addr, non_constant_p); | |
6786 | else if (TREE_CODE (sub) == ADDR_EXPR | |
6787 | || TREE_CODE (sub) == POINTER_PLUS_EXPR) | |
6788 | { | |
6789 | gcc_assert (!same_type_ignoring_top_level_qualifiers_p | |
6790 | (TREE_TYPE (TREE_TYPE (sub)), TREE_TYPE (t))); | |
6791 | /* FIXME Mike Miller wants this to be OK. */ | |
6792 | if (!allow_non_constant) | |
6793 | error ("accessing value of %qE through a %qT glvalue in a " | |
6794 | "constant expression", build_fold_indirect_ref (sub), | |
6795 | TREE_TYPE (t)); | |
6796 | *non_constant_p = true; | |
6797 | return t; | |
6798 | } | |
6799 | ||
6800 | /* If we're pulling out the value of an empty base, make sure | |
6801 | that the whole object is constant and then return an empty | |
6802 | CONSTRUCTOR. */ | |
6803 | if (empty_base) | |
6804 | { | |
6805 | VERIFY_CONSTANT (r); | |
6806 | r = build_constructor (TREE_TYPE (t), NULL); | |
6807 | TREE_CONSTANT (r) = true; | |
6808 | } | |
6809 | ||
6810 | if (TREE_CODE (r) == INDIRECT_REF && TREE_OPERAND (r, 0) == orig_op0) | |
6811 | return t; | |
6812 | return r; | |
6813 | } | |
6814 | ||
acfd3fff JM |
6815 | /* Complain about R, a VAR_DECL, not being usable in a constant expression. |
6816 | Shared between potential_constant_expression and | |
6817 | cxx_eval_constant_expression. */ | |
6818 | ||
6819 | static void | |
6820 | non_const_var_error (tree r) | |
6821 | { | |
6822 | tree type = TREE_TYPE (r); | |
6823 | error ("the value of %qD is not usable in a constant " | |
6824 | "expression", r); | |
ef5daa25 JM |
6825 | /* Avoid error cascade. */ |
6826 | if (DECL_INITIAL (r) == error_mark_node) | |
6827 | return; | |
acfd3fff JM |
6828 | if (DECL_DECLARED_CONSTEXPR_P (r)) |
6829 | inform (DECL_SOURCE_LOCATION (r), | |
6830 | "%qD used in its own initializer", r); | |
6831 | else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type)) | |
6832 | { | |
6833 | if (!CP_TYPE_CONST_P (type)) | |
6834 | inform (DECL_SOURCE_LOCATION (r), | |
6835 | "%q#D is not const", r); | |
6836 | else if (CP_TYPE_VOLATILE_P (type)) | |
6837 | inform (DECL_SOURCE_LOCATION (r), | |
6838 | "%q#D is volatile", r); | |
6839 | else if (!DECL_INITIAL (r)) | |
6840 | inform (DECL_SOURCE_LOCATION (r), | |
6841 | "%qD was not initialized with a constant " | |
6842 | "expression", r); | |
6843 | else | |
6844 | gcc_unreachable (); | |
6845 | } | |
6846 | else | |
6847 | { | |
6848 | if (cxx_dialect >= cxx0x && !DECL_DECLARED_CONSTEXPR_P (r)) | |
6849 | inform (DECL_SOURCE_LOCATION (r), | |
6850 | "%qD was not declared %<constexpr%>", r); | |
6851 | else | |
6852 | inform (DECL_SOURCE_LOCATION (r), | |
6853 | "%qD does not have integral or enumeration type", | |
6854 | r); | |
6855 | } | |
6856 | } | |
6857 | ||
c41095db GDR |
6858 | /* Attempt to reduce the expression T to a constant value. |
6859 | On failure, issue diagnostic and return error_mark_node. */ | |
6860 | /* FIXME unify with c_fully_fold */ | |
6861 | ||
6862 | static tree | |
6863 | cxx_eval_constant_expression (const constexpr_call *call, tree t, | |
6864 | bool allow_non_constant, bool addr, | |
6865 | bool *non_constant_p) | |
6866 | { | |
6867 | tree r = t; | |
6868 | ||
6869 | if (t == error_mark_node) | |
6870 | { | |
6871 | *non_constant_p = true; | |
6872 | return t; | |
6873 | } | |
6874 | if (CONSTANT_CLASS_P (t)) | |
6875 | { | |
6876 | if (TREE_CODE (t) == PTRMEM_CST) | |
6877 | t = cplus_expand_constant (t); | |
6878 | return t; | |
6879 | } | |
6880 | if (TREE_CODE (t) != NOP_EXPR | |
6881 | && reduced_constant_expression_p (t)) | |
6882 | return fold (t); | |
6883 | ||
6884 | switch (TREE_CODE (t)) | |
6885 | { | |
6886 | case VAR_DECL: | |
6887 | if (addr) | |
6888 | return t; | |
6889 | /* else fall through. */ | |
6890 | case CONST_DECL: | |
6891 | r = integral_constant_value (t); | |
6892 | if (TREE_CODE (r) == TARGET_EXPR | |
6893 | && TREE_CODE (TARGET_EXPR_INITIAL (r)) == CONSTRUCTOR) | |
6894 | r = TARGET_EXPR_INITIAL (r); | |
6895 | if (DECL_P (r)) | |
6896 | { | |
6897 | if (!allow_non_constant) | |
acfd3fff | 6898 | non_const_var_error (r); |
c41095db GDR |
6899 | *non_constant_p = true; |
6900 | } | |
6901 | break; | |
6902 | ||
6903 | case FUNCTION_DECL: | |
6904 | case LABEL_DECL: | |
6905 | return t; | |
6906 | ||
6907 | case PARM_DECL: | |
6908 | if (call && DECL_CONTEXT (t) == call->fundef->decl) | |
6909 | r = lookup_parameter_binding (call, t); | |
6910 | else if (addr) | |
6911 | /* Defer in case this is only used for its type. */; | |
6912 | else | |
6913 | { | |
6914 | if (!allow_non_constant) | |
6915 | error ("%qE is not a constant expression", t); | |
6916 | *non_constant_p = true; | |
6917 | } | |
6918 | break; | |
6919 | ||
6920 | case CALL_EXPR: | |
6921 | case AGGR_INIT_EXPR: | |
6922 | r = cxx_eval_call_expression (call, t, allow_non_constant, addr, | |
6923 | non_constant_p); | |
6924 | break; | |
6925 | ||
6926 | case TARGET_EXPR: | |
6927 | case INIT_EXPR: | |
6928 | /* Pass false for 'addr' because these codes indicate | |
6929 | initialization of a temporary. */ | |
6930 | r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1), | |
6931 | allow_non_constant, false, | |
6932 | non_constant_p); | |
6933 | if (!*non_constant_p) | |
6934 | /* Adjust the type of the result to the type of the temporary. */ | |
6935 | r = adjust_temp_type (TREE_TYPE (t), r); | |
6936 | break; | |
6937 | ||
6938 | case SCOPE_REF: | |
6939 | r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1), | |
6940 | allow_non_constant, addr, | |
6941 | non_constant_p); | |
6942 | break; | |
6943 | ||
6944 | case RETURN_EXPR: | |
6945 | case NON_LVALUE_EXPR: | |
6946 | case TRY_CATCH_EXPR: | |
6947 | case CLEANUP_POINT_EXPR: | |
6948 | case MUST_NOT_THROW_EXPR: | |
6949 | case SAVE_EXPR: | |
6950 | r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0), | |
6951 | allow_non_constant, addr, | |
6952 | non_constant_p); | |
6953 | break; | |
6954 | ||
6955 | /* These differ from cxx_eval_unary_expression in that this doesn't | |
6956 | check for a constant operand or result; an address can be | |
6957 | constant without its operand being, and vice versa. */ | |
6958 | case INDIRECT_REF: | |
6959 | r = cxx_eval_indirect_ref (call, t, allow_non_constant, addr, | |
6960 | non_constant_p); | |
6961 | break; | |
6962 | ||
6963 | case ADDR_EXPR: | |
6964 | { | |
6965 | tree oldop = TREE_OPERAND (t, 0); | |
6966 | tree op = cxx_eval_constant_expression (call, oldop, | |
6967 | allow_non_constant, | |
6968 | /*addr*/true, | |
6969 | non_constant_p); | |
6970 | /* Don't VERIFY_CONSTANT here. */ | |
6971 | if (*non_constant_p) | |
6972 | return t; | |
6973 | /* This function does more aggressive folding than fold itself. */ | |
6974 | r = build_fold_addr_expr_with_type (op, TREE_TYPE (t)); | |
6975 | if (TREE_CODE (r) == ADDR_EXPR && TREE_OPERAND (r, 0) == oldop) | |
6976 | return t; | |
6977 | break; | |
6978 | } | |
6979 | ||
6980 | case REALPART_EXPR: | |
6981 | case IMAGPART_EXPR: | |
6982 | case CONJ_EXPR: | |
6983 | case FIX_TRUNC_EXPR: | |
6984 | case FLOAT_EXPR: | |
6985 | case NEGATE_EXPR: | |
6986 | case ABS_EXPR: | |
6987 | case BIT_NOT_EXPR: | |
6988 | case TRUTH_NOT_EXPR: | |
6989 | case FIXED_CONVERT_EXPR: | |
6990 | r = cxx_eval_unary_expression (call, t, allow_non_constant, addr, | |
6991 | non_constant_p); | |
6992 | break; | |
6993 | ||
6994 | case COMPOUND_EXPR: | |
6995 | { | |
6996 | /* check_return_expr sometimes wraps a TARGET_EXPR in a | |
6997 | COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR | |
6998 | introduced by build_call_a. */ | |
6999 | tree op0 = TREE_OPERAND (t, 0); | |
7000 | tree op1 = TREE_OPERAND (t, 1); | |
7001 | STRIP_NOPS (op1); | |
7002 | if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0)) | |
7003 | || TREE_CODE (op1) == EMPTY_CLASS_EXPR) | |
7004 | r = cxx_eval_constant_expression (call, op0, allow_non_constant, | |
7005 | addr, non_constant_p); | |
7006 | else | |
3f7c7453 JM |
7007 | { |
7008 | /* Check that the LHS is constant and then discard it. */ | |
7009 | cxx_eval_constant_expression (call, op0, allow_non_constant, | |
7010 | false, non_constant_p); | |
7011 | r = cxx_eval_constant_expression (call, op1, allow_non_constant, | |
7012 | addr, non_constant_p); | |
7013 | } | |
c41095db GDR |
7014 | } |
7015 | break; | |
7016 | ||
7017 | case POINTER_PLUS_EXPR: | |
7018 | case PLUS_EXPR: | |
7019 | case MINUS_EXPR: | |
7020 | case MULT_EXPR: | |
7021 | case TRUNC_DIV_EXPR: | |
7022 | case CEIL_DIV_EXPR: | |
7023 | case FLOOR_DIV_EXPR: | |
7024 | case ROUND_DIV_EXPR: | |
7025 | case TRUNC_MOD_EXPR: | |
7026 | case CEIL_MOD_EXPR: | |
7027 | case ROUND_MOD_EXPR: | |
7028 | case RDIV_EXPR: | |
7029 | case EXACT_DIV_EXPR: | |
7030 | case MIN_EXPR: | |
7031 | case MAX_EXPR: | |
7032 | case LSHIFT_EXPR: | |
7033 | case RSHIFT_EXPR: | |
7034 | case LROTATE_EXPR: | |
7035 | case RROTATE_EXPR: | |
7036 | case BIT_IOR_EXPR: | |
7037 | case BIT_XOR_EXPR: | |
7038 | case BIT_AND_EXPR: | |
7039 | case TRUTH_XOR_EXPR: | |
7040 | case LT_EXPR: | |
7041 | case LE_EXPR: | |
7042 | case GT_EXPR: | |
7043 | case GE_EXPR: | |
7044 | case EQ_EXPR: | |
7045 | case NE_EXPR: | |
7046 | case UNORDERED_EXPR: | |
7047 | case ORDERED_EXPR: | |
7048 | case UNLT_EXPR: | |
7049 | case UNLE_EXPR: | |
7050 | case UNGT_EXPR: | |
7051 | case UNGE_EXPR: | |
7052 | case UNEQ_EXPR: | |
7053 | case RANGE_EXPR: | |
7054 | case COMPLEX_EXPR: | |
c41095db GDR |
7055 | r = cxx_eval_binary_expression (call, t, allow_non_constant, addr, |
7056 | non_constant_p); | |
7057 | break; | |
7058 | ||
7059 | /* fold can introduce non-IF versions of these; still treat them as | |
7060 | short-circuiting. */ | |
7061 | case TRUTH_AND_EXPR: | |
7062 | case TRUTH_ANDIF_EXPR: | |
7063 | r = cxx_eval_logical_expression (call, t, boolean_false_node, | |
7064 | boolean_true_node, | |
7065 | allow_non_constant, addr, | |
7066 | non_constant_p); | |
7067 | break; | |
7068 | ||
7069 | case TRUTH_OR_EXPR: | |
7070 | case TRUTH_ORIF_EXPR: | |
7071 | r = cxx_eval_logical_expression (call, t, boolean_true_node, | |
7072 | boolean_false_node, | |
7073 | allow_non_constant, addr, | |
7074 | non_constant_p); | |
7075 | break; | |
7076 | ||
7077 | case ARRAY_REF: | |
7078 | r = cxx_eval_array_reference (call, t, allow_non_constant, addr, | |
7079 | non_constant_p); | |
7080 | break; | |
7081 | ||
7082 | case COMPONENT_REF: | |
7083 | r = cxx_eval_component_reference (call, t, allow_non_constant, addr, | |
7084 | non_constant_p); | |
7085 | break; | |
7086 | ||
4ddf1c7f JM |
7087 | case BIT_FIELD_REF: |
7088 | r = cxx_eval_bit_field_ref (call, t, allow_non_constant, addr, | |
7089 | non_constant_p); | |
7090 | break; | |
7091 | ||
c41095db GDR |
7092 | case COND_EXPR: |
7093 | case VEC_COND_EXPR: | |
7094 | r = cxx_eval_conditional_expression (call, t, allow_non_constant, addr, | |
7095 | non_constant_p); | |
7096 | break; | |
7097 | ||
7098 | case CONSTRUCTOR: | |
7099 | r = cxx_eval_bare_aggregate (call, t, allow_non_constant, addr, | |
7100 | non_constant_p); | |
7101 | break; | |
7102 | ||
7103 | case VEC_INIT_EXPR: | |
7104 | /* We can get this in a defaulted constructor for a class with a | |
7105 | non-static data member of array type. Either the initializer will | |
7106 | be NULL, meaning default-initialization, or it will be an lvalue | |
7107 | or xvalue of the same type, meaning direct-initialization from the | |
7108 | corresponding member. */ | |
7109 | r = cxx_eval_vec_init (call, t, allow_non_constant, addr, | |
7110 | non_constant_p); | |
7111 | break; | |
7112 | ||
7113 | case CONVERT_EXPR: | |
7114 | case VIEW_CONVERT_EXPR: | |
7115 | case NOP_EXPR: | |
7116 | { | |
7117 | tree oldop = TREE_OPERAND (t, 0); | |
7118 | tree op = oldop; | |
7119 | tree to = TREE_TYPE (t); | |
7120 | tree source = TREE_TYPE (op); | |
7121 | if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (to) | |
7122 | && !(TREE_CODE (op) == COMPONENT_REF | |
7123 | && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op, 0))))) | |
7124 | { | |
7125 | if (!allow_non_constant) | |
7126 | error ("conversion of expression %qE of pointer type " | |
7127 | "cannot yield a constant expression", op); | |
7128 | *non_constant_p = true; | |
7129 | return t; | |
7130 | } | |
7131 | op = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0), | |
7132 | allow_non_constant, addr, | |
7133 | non_constant_p); | |
7134 | if (*non_constant_p) | |
7135 | return t; | |
7136 | if (op == oldop) | |
7137 | /* We didn't fold at the top so we could check for ptr-int | |
7138 | conversion. */ | |
7139 | return fold (t); | |
7140 | r = fold_build1 (TREE_CODE (t), to, op); | |
c598e5fa JM |
7141 | /* Conversion of an out-of-range value has implementation-defined |
7142 | behavior; the language considers it different from arithmetic | |
7143 | overflow, which is undefined. */ | |
7144 | if (TREE_OVERFLOW_P (r) && !TREE_OVERFLOW_P (op)) | |
7145 | TREE_OVERFLOW (r) = false; | |
c41095db GDR |
7146 | } |
7147 | break; | |
7148 | ||
7149 | case EMPTY_CLASS_EXPR: | |
7150 | /* This is good enough for a function argument that might not get | |
7151 | used, and they can't do anything with it, so just return it. */ | |
7152 | return t; | |
7153 | ||
7154 | case LAMBDA_EXPR: | |
7155 | case DYNAMIC_CAST_EXPR: | |
7156 | case PSEUDO_DTOR_EXPR: | |
7157 | case PREINCREMENT_EXPR: | |
7158 | case POSTINCREMENT_EXPR: | |
7159 | case PREDECREMENT_EXPR: | |
7160 | case POSTDECREMENT_EXPR: | |
7161 | case NEW_EXPR: | |
7162 | case VEC_NEW_EXPR: | |
7163 | case DELETE_EXPR: | |
7164 | case VEC_DELETE_EXPR: | |
7165 | case THROW_EXPR: | |
7166 | case MODIFY_EXPR: | |
7167 | case MODOP_EXPR: | |
7168 | /* GCC internal stuff. */ | |
7169 | case VA_ARG_EXPR: | |
7170 | case OBJ_TYPE_REF: | |
7171 | case WITH_CLEANUP_EXPR: | |
7172 | case STATEMENT_LIST: | |
7173 | case BIND_EXPR: | |
7174 | case NON_DEPENDENT_EXPR: | |
7175 | case BASELINK: | |
7176 | case EXPR_STMT: | |
0eb35d46 | 7177 | case OFFSET_REF: |
c41095db GDR |
7178 | if (!allow_non_constant) |
7179 | error_at (EXPR_LOC_OR_HERE (t), | |
7180 | "expression %qE is not a constant-expression", t); | |
7181 | *non_constant_p = true; | |
7182 | break; | |
7183 | ||
7184 | default: | |
7185 | internal_error ("unexpected expression %qE of kind %s", t, | |
7186 | tree_code_name[TREE_CODE (t)]); | |
7187 | *non_constant_p = true; | |
7188 | break; | |
7189 | } | |
7190 | ||
7191 | if (r == error_mark_node) | |
7192 | *non_constant_p = true; | |
7193 | ||
7194 | if (*non_constant_p) | |
7195 | return t; | |
7196 | else | |
7197 | return r; | |
7198 | } | |
7199 | ||
7200 | static tree | |
7201 | cxx_eval_outermost_constant_expr (tree t, bool allow_non_constant) | |
7202 | { | |
7203 | bool non_constant_p = false; | |
7204 | tree r = cxx_eval_constant_expression (NULL, t, allow_non_constant, | |
7205 | false, &non_constant_p); | |
7206 | ||
9e115cec | 7207 | verify_constant (r, allow_non_constant, &non_constant_p); |
c41095db GDR |
7208 | |
7209 | if (non_constant_p && !allow_non_constant) | |
7210 | return error_mark_node; | |
7211 | else if (non_constant_p && TREE_CONSTANT (t)) | |
7212 | { | |
7213 | /* This isn't actually constant, so unset TREE_CONSTANT. */ | |
7214 | if (EXPR_P (t) || TREE_CODE (t) == CONSTRUCTOR) | |
7215 | r = copy_node (t); | |
7216 | else | |
7217 | r = build_nop (TREE_TYPE (t), t); | |
7218 | TREE_CONSTANT (r) = false; | |
7219 | return r; | |
7220 | } | |
7221 | else if (non_constant_p || r == t) | |
7222 | return t; | |
7223 | else if (TREE_CODE (r) == CONSTRUCTOR && CLASS_TYPE_P (TREE_TYPE (r))) | |
7224 | { | |
7225 | if (TREE_CODE (t) == TARGET_EXPR | |
7226 | && TARGET_EXPR_INITIAL (t) == r) | |
7227 | return t; | |
7228 | else | |
7229 | { | |
7230 | r = get_target_expr (r); | |
7231 | TREE_CONSTANT (r) = true; | |
7232 | return r; | |
7233 | } | |
7234 | } | |
7235 | else | |
7236 | return r; | |
7237 | } | |
7238 | ||
fa2200cb JM |
7239 | /* Returns true if T is a valid subexpression of a constant expression, |
7240 | even if it isn't itself a constant expression. */ | |
7241 | ||
7242 | bool | |
7243 | is_sub_constant_expr (tree t) | |
7244 | { | |
7245 | bool non_constant_p = false; | |
7246 | cxx_eval_constant_expression (NULL, t, true, false, &non_constant_p); | |
7247 | return !non_constant_p; | |
7248 | } | |
7249 | ||
c41095db GDR |
7250 | /* If T represents a constant expression returns its reduced value. |
7251 | Otherwise return error_mark_node. If T is dependent, then | |
7252 | return NULL. */ | |
7253 | ||
7254 | tree | |
7255 | cxx_constant_value (tree t) | |
7256 | { | |
7257 | return cxx_eval_outermost_constant_expr (t, false); | |
7258 | } | |
7259 | ||
7260 | /* If T is a constant expression, returns its reduced value. | |
7261 | Otherwise, if T does not have TREE_CONSTANT set, returns T. | |
7262 | Otherwise, returns a version of T without TREE_CONSTANT. */ | |
7263 | ||
7264 | tree | |
7265 | maybe_constant_value (tree t) | |
7266 | { | |
7267 | tree r; | |
7268 | ||
7269 | if (type_dependent_expression_p (t) | |
4be5e5b1 | 7270 | || type_unknown_p (t) |
d6ed1c89 | 7271 | || !potential_constant_expression (t) |
c41095db GDR |
7272 | || value_dependent_expression_p (t)) |
7273 | return t; | |
7274 | ||
7275 | r = cxx_eval_outermost_constant_expr (t, true); | |
7276 | #ifdef ENABLE_CHECKING | |
7277 | /* cp_tree_equal looks through NOPs, so allow them. */ | |
7278 | gcc_assert (r == t | |
7279 | || CONVERT_EXPR_P (t) | |
7280 | || (TREE_CONSTANT (t) && !TREE_CONSTANT (r)) | |
7281 | || !cp_tree_equal (r, t)); | |
7282 | #endif | |
7283 | return r; | |
7284 | } | |
7285 | ||
7286 | /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather | |
7287 | than wrapped in a TARGET_EXPR. */ | |
7288 | ||
7289 | tree | |
7290 | maybe_constant_init (tree t) | |
7291 | { | |
7292 | t = maybe_constant_value (t); | |
7293 | if (TREE_CODE (t) == TARGET_EXPR) | |
7294 | { | |
7295 | tree init = TARGET_EXPR_INITIAL (t); | |
7296 | if (TREE_CODE (init) == CONSTRUCTOR | |
7297 | && TREE_CONSTANT (init)) | |
7298 | t = init; | |
7299 | } | |
7300 | return t; | |
7301 | } | |
7302 | ||
d6ed1c89 JM |
7303 | #if 0 |
7304 | /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */ | |
66e61a34 JM |
7305 | /* Return true if the object referred to by REF has automatic or thread |
7306 | local storage. */ | |
7ecbca9d | 7307 | |
66e61a34 JM |
7308 | enum { ck_ok, ck_bad, ck_unknown }; |
7309 | static int | |
7310 | check_automatic_or_tls (tree ref) | |
7311 | { | |
7312 | enum machine_mode mode; | |
7313 | HOST_WIDE_INT bitsize, bitpos; | |
7314 | tree offset; | |
7315 | int volatilep = 0, unsignedp = 0; | |
7316 | tree decl = get_inner_reference (ref, &bitsize, &bitpos, &offset, | |
7317 | &mode, &unsignedp, &volatilep, false); | |
7318 | duration_kind dk; | |
7319 | ||
7320 | /* If there isn't a decl in the middle, we don't know the linkage here, | |
7321 | and this isn't a constant expression anyway. */ | |
7322 | if (!DECL_P (decl)) | |
7323 | return ck_unknown; | |
7324 | dk = decl_storage_duration (decl); | |
7325 | return (dk == dk_auto || dk == dk_thread) ? ck_bad : ck_ok; | |
7326 | } | |
d6ed1c89 | 7327 | #endif |
66e61a34 JM |
7328 | |
7329 | /* Return true if the DECL designates a builtin function that is | |
7330 | morally constexpr, in the sense that its parameter types and | |
7331 | return type are literal types and the compiler is allowed to | |
7332 | fold its invocations. */ | |
7333 | ||
7334 | static bool | |
7335 | morally_constexpr_builtin_function_p (tree decl) | |
7336 | { | |
7337 | tree funtype = TREE_TYPE (decl); | |
7338 | tree t; | |
7339 | ||
7340 | if (!is_builtin_fn (decl)) | |
7341 | return false; | |
7342 | if (!literal_type_p (TREE_TYPE (funtype))) | |
7343 | return false; | |
7344 | for (t = TYPE_ARG_TYPES (funtype); t != NULL ; t = TREE_CHAIN (t)) | |
7345 | { | |
7346 | if (t == void_list_node) | |
7347 | return true; | |
7348 | if (!literal_type_p (TREE_VALUE (t))) | |
7349 | return false; | |
7350 | } | |
7351 | /* We assume no varargs builtins are suitable. */ | |
7352 | return t != NULL; | |
7353 | } | |
7354 | ||
d6ed1c89 JM |
7355 | /* Return true if T denotes a potentially constant expression. Issue |
7356 | diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true, | |
7357 | an lvalue-rvalue conversion is implied. | |
66e61a34 | 7358 | |
d6ed1c89 | 7359 | C++0x [expr.const] used to say |
66e61a34 JM |
7360 | |
7361 | 6 An expression is a potential constant expression if it is | |
7362 | a constant expression where all occurences of function | |
7363 | parameters are replaced by arbitrary constant expressions | |
7364 | of the appropriate type. | |
7365 | ||
7366 | 2 A conditional expression is a constant expression unless it | |
7367 | involves one of the following as a potentially evaluated | |
7368 | subexpression (3.2), but subexpressions of logical AND (5.14), | |
7369 | logical OR (5.15), and conditional (5.16) operations that are | |
7370 | not evaluated are not considered. */ | |
7371 | ||
d6ed1c89 JM |
7372 | static bool |
7373 | potential_constant_expression_1 (tree t, bool want_rval, tsubst_flags_t flags) | |
66e61a34 | 7374 | { |
d6ed1c89 | 7375 | enum { any = false, rval = true }; |
66e61a34 JM |
7376 | int i; |
7377 | tree tmp; | |
d6ed1c89 JM |
7378 | |
7379 | /* C++98 has different rules for the form of a constant expression that | |
7380 | are enforced in the parser, so we can assume that anything that gets | |
7381 | this far is suitable. */ | |
7382 | if (cxx_dialect < cxx0x) | |
7383 | return true; | |
7384 | ||
66e61a34 JM |
7385 | if (t == error_mark_node) |
7386 | return false; | |
d6ed1c89 JM |
7387 | if (t == NULL_TREE) |
7388 | return true; | |
66e61a34 JM |
7389 | if (TREE_THIS_VOLATILE (t)) |
7390 | { | |
7391 | if (flags & tf_error) | |
7392 | error ("expression %qE has side-effects", t); | |
7393 | return false; | |
7394 | } | |
7395 | if (CONSTANT_CLASS_P (t)) | |
93dd46fb JM |
7396 | { |
7397 | if (TREE_OVERFLOW (t)) | |
7398 | { | |
7399 | if (flags & tf_error) | |
7400 | { | |
7401 | permerror (EXPR_LOC_OR_HERE (t), | |
7402 | "overflow in constant expression"); | |
7403 | if (flag_permissive) | |
7404 | return true; | |
7405 | } | |
7406 | return false; | |
7407 | } | |
7408 | return true; | |
7409 | } | |
66e61a34 JM |
7410 | |
7411 | switch (TREE_CODE (t)) | |
7412 | { | |
7413 | case FUNCTION_DECL: | |
d6ed1c89 | 7414 | case BASELINK: |
5b883ca6 | 7415 | case TEMPLATE_DECL: |
d6ed1c89 JM |
7416 | case OVERLOAD: |
7417 | case TEMPLATE_ID_EXPR: | |
66e61a34 JM |
7418 | case LABEL_DECL: |
7419 | case CONST_DECL: | |
d6ed1c89 JM |
7420 | case SIZEOF_EXPR: |
7421 | case ALIGNOF_EXPR: | |
7422 | case OFFSETOF_EXPR: | |
7423 | case NOEXCEPT_EXPR: | |
7424 | case TEMPLATE_PARM_INDEX: | |
7425 | case TRAIT_EXPR: | |
7426 | case IDENTIFIER_NODE: | |
66e61a34 JM |
7427 | return true; |
7428 | ||
7429 | case PARM_DECL: | |
7430 | /* -- this (5.1) unless it appears as the postfix-expression in a | |
7431 | class member access expression, including the result of the | |
7432 | implicit transformation in the body of the non-static | |
7433 | member function (9.3.1); */ | |
f5a28e87 JM |
7434 | /* FIXME this restriction seems pointless since the standard dropped |
7435 | "potential constant expression". */ | |
66e61a34 JM |
7436 | if (is_this_parameter (t)) |
7437 | { | |
7438 | if (flags & tf_error) | |
7439 | error ("%qE is not a potential constant expression", t); | |
7440 | return false; | |
7441 | } | |
7442 | return true; | |
7443 | ||
7444 | case AGGR_INIT_EXPR: | |
7445 | case CALL_EXPR: | |
7446 | /* -- an invocation of a function other than a constexpr function | |
7447 | or a constexpr constructor. */ | |
7448 | { | |
7449 | tree fun = get_function_named_in_call (t); | |
7450 | const int nargs = call_expr_nargs (t); | |
f5a28e87 JM |
7451 | i = 0; |
7452 | ||
7453 | if (is_overloaded_fn (fun)) | |
7454 | { | |
7455 | if (TREE_CODE (fun) == FUNCTION_DECL) | |
7456 | { | |
7457 | if (builtin_valid_in_constant_expr_p (fun)) | |
7458 | return true; | |
7459 | if (!DECL_DECLARED_CONSTEXPR_P (fun) | |
7460 | && !morally_constexpr_builtin_function_p (fun)) | |
7461 | { | |
7462 | if (flags & tf_error) | |
7463 | error ("%qD is not %<constexpr%>", fun); | |
7464 | return false; | |
7465 | } | |
7466 | /* A call to a non-static member function takes the address | |
7467 | of the object as the first argument. But in a constant | |
7468 | expression the address will be folded away, so look | |
7469 | through it now. */ | |
7470 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun) | |
7471 | && !DECL_CONSTRUCTOR_P (fun)) | |
7472 | { | |
7473 | tree x = get_nth_callarg (t, 0); | |
7474 | if (is_this_parameter (x)) | |
7475 | /* OK. */; | |
7476 | else if (!potential_constant_expression_1 (x, rval, flags)) | |
7477 | { | |
7478 | if (flags & tf_error) | |
7479 | error ("object argument is not a potential " | |
7480 | "constant expression"); | |
7481 | return false; | |
7482 | } | |
7483 | i = 1; | |
7484 | } | |
7485 | } | |
7486 | else | |
7487 | fun = get_first_fn (fun); | |
7488 | /* Skip initial arguments to base constructors. */ | |
7489 | if (DECL_BASE_CONSTRUCTOR_P (fun)) | |
7490 | i = num_artificial_parms_for (fun); | |
7491 | fun = DECL_ORIGIN (fun); | |
7492 | } | |
66e61a34 | 7493 | else |
66e61a34 | 7494 | { |
f5a28e87 JM |
7495 | if (potential_constant_expression_1 (fun, rval, flags)) |
7496 | /* Might end up being a constant function pointer. */; | |
7497 | else | |
7498 | { | |
7499 | if (flags & tf_error) | |
7500 | error ("%qE is not a function name", fun); | |
7501 | return false; | |
7502 | } | |
66e61a34 JM |
7503 | } |
7504 | for (; i < nargs; ++i) | |
7505 | { | |
7506 | tree x = get_nth_callarg (t, i); | |
f5a28e87 | 7507 | if (!potential_constant_expression_1 (x, rval, flags)) |
66e61a34 JM |
7508 | { |
7509 | if (flags & tf_error) | |
7510 | error ("argument in position %qP is not a " | |
7511 | "potential constant expression", i); | |
7512 | return false; | |
7513 | } | |
7514 | } | |
7515 | return true; | |
7516 | } | |
7517 | ||
7518 | case NON_LVALUE_EXPR: | |
7519 | /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to | |
7520 | -- an lvalue of integral type that refers to a non-volatile | |
7521 | const variable or static data member initialized with | |
7522 | constant expressions, or | |
7523 | ||
7524 | -- an lvalue of literal type that refers to non-volatile | |
7525 | object defined with constexpr, or that refers to a | |
7526 | sub-object of such an object; */ | |
d6ed1c89 | 7527 | return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags); |
66e61a34 JM |
7528 | |
7529 | case VAR_DECL: | |
acfd3fff JM |
7530 | if (want_rval && !decl_constant_var_p (t) |
7531 | && !dependent_type_p (TREE_TYPE (t))) | |
66e61a34 JM |
7532 | { |
7533 | if (flags & tf_error) | |
acfd3fff | 7534 | non_const_var_error (t); |
66e61a34 JM |
7535 | return false; |
7536 | } | |
7537 | return true; | |
7538 | ||
7539 | case NOP_EXPR: | |
7540 | case CONVERT_EXPR: | |
7541 | case VIEW_CONVERT_EXPR: | |
7542 | /* -- an array-to-pointer conversion that is applied to an lvalue | |
7543 | that designates an object with thread or automatic storage | |
7544 | duration; FIXME not implemented as it breaks constexpr arrays; | |
7545 | need to fix the standard | |
7546 | -- a type conversion from a pointer or pointer-to-member type | |
7547 | to a literal type. */ | |
7548 | { | |
7549 | tree from = TREE_OPERAND (t, 0); | |
7550 | tree source = TREE_TYPE (from); | |
7551 | tree target = TREE_TYPE (t); | |
7552 | if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (target) | |
7553 | && !(TREE_CODE (from) == COMPONENT_REF | |
7554 | && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from, 0))))) | |
7555 | { | |
7556 | if (flags & tf_error) | |
7557 | error ("conversion of expression %qE of pointer type " | |
7558 | "cannot yield a constant expression", from); | |
7559 | return false; | |
7560 | } | |
d6ed1c89 JM |
7561 | return (potential_constant_expression_1 |
7562 | (from, TREE_CODE (t) != VIEW_CONVERT_EXPR, flags)); | |
66e61a34 JM |
7563 | } |
7564 | ||
7565 | case ADDR_EXPR: | |
7566 | /* -- a unary operator & that is applied to an lvalue that | |
7567 | designates an object with thread or automatic storage | |
7568 | duration; */ | |
7569 | t = TREE_OPERAND (t, 0); | |
d6ed1c89 JM |
7570 | #if 0 |
7571 | /* FIXME adjust when issue 1197 is fully resolved. For now don't do | |
7572 | any checking here, as we might dereference the pointer later. If | |
7573 | we remove this code, also remove check_automatic_or_tls. */ | |
66e61a34 JM |
7574 | i = check_automatic_or_tls (t); |
7575 | if (i == ck_ok) | |
7576 | return true; | |
7577 | if (i == ck_bad) | |
7578 | { | |
7579 | if (flags & tf_error) | |
7580 | error ("address-of an object %qE with thread local or " | |
7581 | "automatic storage is not a constant expression", t); | |
7582 | return false; | |
7583 | } | |
d6ed1c89 JM |
7584 | #endif |
7585 | return potential_constant_expression_1 (t, any, flags); | |
66e61a34 JM |
7586 | |
7587 | case COMPONENT_REF: | |
7588 | case BIT_FIELD_REF: | |
d6ed1c89 JM |
7589 | case ARROW_EXPR: |
7590 | case OFFSET_REF: | |
66e61a34 JM |
7591 | /* -- a class member access unless its postfix-expression is |
7592 | of literal type or of pointer to literal type. */ | |
7593 | /* This test would be redundant, as it follows from the | |
7594 | postfix-expression being a potential constant expression. */ | |
d6ed1c89 JM |
7595 | return potential_constant_expression_1 (TREE_OPERAND (t, 0), |
7596 | want_rval, flags); | |
7597 | ||
7598 | case EXPR_PACK_EXPANSION: | |
7599 | return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t), | |
7600 | want_rval, flags); | |
66e61a34 JM |
7601 | |
7602 | case INDIRECT_REF: | |
7603 | { | |
7604 | tree x = TREE_OPERAND (t, 0); | |
7605 | STRIP_NOPS (x); | |
7606 | if (is_this_parameter (x)) | |
cb21e9cd JM |
7607 | { |
7608 | if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)) && want_rval) | |
7609 | { | |
7610 | if (flags & tf_error) | |
00a0d6f3 JM |
7611 | sorry ("use of the value of the object being constructed " |
7612 | "in a constant expression"); | |
cb21e9cd JM |
7613 | return false; |
7614 | } | |
7615 | return true; | |
7616 | } | |
d6ed1c89 | 7617 | return potential_constant_expression_1 (x, rval, flags); |
66e61a34 JM |
7618 | } |
7619 | ||
7620 | case LAMBDA_EXPR: | |
7621 | case DYNAMIC_CAST_EXPR: | |
7622 | case PSEUDO_DTOR_EXPR: | |
7623 | case PREINCREMENT_EXPR: | |
7624 | case POSTINCREMENT_EXPR: | |
7625 | case PREDECREMENT_EXPR: | |
7626 | case POSTDECREMENT_EXPR: | |
7627 | case NEW_EXPR: | |
7628 | case VEC_NEW_EXPR: | |
7629 | case DELETE_EXPR: | |
7630 | case VEC_DELETE_EXPR: | |
7631 | case THROW_EXPR: | |
7632 | case MODIFY_EXPR: | |
7633 | case MODOP_EXPR: | |
7634 | /* GCC internal stuff. */ | |
7635 | case VA_ARG_EXPR: | |
7636 | case OBJ_TYPE_REF: | |
7637 | case WITH_CLEANUP_EXPR: | |
7638 | case CLEANUP_POINT_EXPR: | |
7639 | case MUST_NOT_THROW_EXPR: | |
7640 | case TRY_CATCH_EXPR: | |
7641 | case STATEMENT_LIST: | |
d6ed1c89 JM |
7642 | /* Don't bother trying to define a subset of statement-expressions to |
7643 | be constant-expressions, at least for now. */ | |
7644 | case STMT_EXPR: | |
7645 | case EXPR_STMT: | |
66e61a34 JM |
7646 | case BIND_EXPR: |
7647 | if (flags & tf_error) | |
7648 | error ("expression %qE is not a constant-expression", t); | |
7649 | return false; | |
7650 | ||
7651 | case TYPEID_EXPR: | |
7652 | /* -- a typeid expression whose operand is of polymorphic | |
7653 | class type; */ | |
7654 | { | |
7655 | tree e = TREE_OPERAND (t, 0); | |
d6ed1c89 JM |
7656 | if (!TYPE_P (e) && !type_dependent_expression_p (e) |
7657 | && TYPE_POLYMORPHIC_P (TREE_TYPE (e))) | |
66e61a34 JM |
7658 | { |
7659 | if (flags & tf_error) | |
7660 | error ("typeid-expression is not a constant expression " | |
7661 | "because %qE is of polymorphic type", e); | |
7662 | return false; | |
7663 | } | |
7664 | return true; | |
7665 | } | |
7666 | ||
7667 | case MINUS_EXPR: | |
7668 | /* -- a subtraction where both operands are pointers. */ | |
7669 | if (TYPE_PTR_P (TREE_OPERAND (t, 0)) | |
7670 | && TYPE_PTR_P (TREE_OPERAND (t, 1))) | |
7671 | { | |
7672 | if (flags & tf_error) | |
7673 | error ("difference of two pointer expressions is not " | |
7674 | "a constant expression"); | |
7675 | return false; | |
7676 | } | |
d6ed1c89 | 7677 | want_rval = true; |
66e61a34 JM |
7678 | goto binary; |
7679 | ||
7680 | case LT_EXPR: | |
7681 | case LE_EXPR: | |
7682 | case GT_EXPR: | |
7683 | case GE_EXPR: | |
7684 | case EQ_EXPR: | |
7685 | case NE_EXPR: | |
7686 | /* -- a relational or equality operator where at least | |
7687 | one of the operands is a pointer. */ | |
7688 | if (TYPE_PTR_P (TREE_OPERAND (t, 0)) | |
7689 | || TYPE_PTR_P (TREE_OPERAND (t, 1))) | |
7690 | { | |
7691 | if (flags & tf_error) | |
7692 | error ("pointer comparison expression is not a " | |
7693 | "constant expression"); | |
7694 | return false; | |
7695 | } | |
d6ed1c89 | 7696 | want_rval = true; |
66e61a34 JM |
7697 | goto binary; |
7698 | ||
7699 | case REALPART_EXPR: | |
7700 | case IMAGPART_EXPR: | |
7701 | case CONJ_EXPR: | |
7702 | case SAVE_EXPR: | |
7703 | case FIX_TRUNC_EXPR: | |
7704 | case FLOAT_EXPR: | |
7705 | case NEGATE_EXPR: | |
7706 | case ABS_EXPR: | |
7707 | case BIT_NOT_EXPR: | |
7708 | case TRUTH_NOT_EXPR: | |
66e61a34 | 7709 | case FIXED_CONVERT_EXPR: |
d6ed1c89 JM |
7710 | case UNARY_PLUS_EXPR: |
7711 | return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, | |
7712 | flags); | |
7713 | ||
7714 | case CAST_EXPR: | |
7715 | case CONST_CAST_EXPR: | |
7716 | case STATIC_CAST_EXPR: | |
7717 | case REINTERPRET_CAST_EXPR: | |
7718 | return (potential_constant_expression_1 | |
7719 | (TREE_OPERAND (t, 0), | |
7720 | TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE, flags)); | |
7721 | ||
7722 | case PAREN_EXPR: | |
7723 | case NON_DEPENDENT_EXPR: | |
66e61a34 JM |
7724 | /* For convenience. */ |
7725 | case RETURN_EXPR: | |
d6ed1c89 JM |
7726 | return potential_constant_expression_1 (TREE_OPERAND (t, 0), |
7727 | want_rval, flags); | |
7728 | ||
7729 | case SCOPE_REF: | |
7730 | return potential_constant_expression_1 (TREE_OPERAND (t, 1), | |
7731 | want_rval, flags); | |
66e61a34 JM |
7732 | |
7733 | case INIT_EXPR: | |
7734 | case TARGET_EXPR: | |
d6ed1c89 JM |
7735 | return potential_constant_expression_1 (TREE_OPERAND (t, 1), |
7736 | rval, flags); | |
66e61a34 JM |
7737 | |
7738 | case CONSTRUCTOR: | |
7739 | { | |
7740 | VEC(constructor_elt, gc) *v = CONSTRUCTOR_ELTS (t); | |
7741 | constructor_elt *ce; | |
7742 | for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i) | |
d6ed1c89 | 7743 | if (!potential_constant_expression_1 (ce->value, want_rval, flags)) |
66e61a34 JM |
7744 | return false; |
7745 | return true; | |
7746 | } | |
7747 | ||
7748 | case TREE_LIST: | |
7749 | { | |
7750 | gcc_assert (TREE_PURPOSE (t) == NULL_TREE | |
7751 | || DECL_P (TREE_PURPOSE (t))); | |
d6ed1c89 JM |
7752 | if (!potential_constant_expression_1 (TREE_VALUE (t), want_rval, |
7753 | flags)) | |
66e61a34 JM |
7754 | return false; |
7755 | if (TREE_CHAIN (t) == NULL_TREE) | |
7756 | return true; | |
d6ed1c89 JM |
7757 | return potential_constant_expression_1 (TREE_CHAIN (t), want_rval, |
7758 | flags); | |
66e61a34 JM |
7759 | } |
7760 | ||
7761 | case TRUNC_DIV_EXPR: | |
7762 | case CEIL_DIV_EXPR: | |
7763 | case FLOOR_DIV_EXPR: | |
7764 | case ROUND_DIV_EXPR: | |
7765 | case TRUNC_MOD_EXPR: | |
7766 | case CEIL_MOD_EXPR: | |
7767 | case ROUND_MOD_EXPR: | |
d6ed1c89 JM |
7768 | { |
7769 | tree denom = TREE_OPERAND (t, 1); | |
7770 | /* We can't call maybe_constant_value on an expression | |
7771 | that hasn't been through fold_non_dependent_expr yet. */ | |
7772 | if (!processing_template_decl) | |
7773 | denom = maybe_constant_value (denom); | |
7774 | if (integer_zerop (denom)) | |
7775 | { | |
7776 | if (flags & tf_error) | |
7777 | error ("division by zero is not a constant-expression"); | |
7778 | return false; | |
7779 | } | |
7780 | else | |
7781 | { | |
7782 | want_rval = true; | |
7783 | goto binary; | |
7784 | } | |
7785 | } | |
66e61a34 JM |
7786 | |
7787 | case COMPOUND_EXPR: | |
7788 | { | |
7789 | /* check_return_expr sometimes wraps a TARGET_EXPR in a | |
7790 | COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR | |
7791 | introduced by build_call_a. */ | |
7792 | tree op0 = TREE_OPERAND (t, 0); | |
7793 | tree op1 = TREE_OPERAND (t, 1); | |
7794 | STRIP_NOPS (op1); | |
7795 | if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0)) | |
7796 | || TREE_CODE (op1) == EMPTY_CLASS_EXPR) | |
d6ed1c89 | 7797 | return potential_constant_expression_1 (op0, want_rval, flags); |
66e61a34 JM |
7798 | else |
7799 | goto binary; | |
7800 | } | |
7801 | ||
7802 | /* If the first operand is the non-short-circuit constant, look at | |
7803 | the second operand; otherwise we only care about the first one for | |
7804 | potentiality. */ | |
7805 | case TRUTH_AND_EXPR: | |
7806 | case TRUTH_ANDIF_EXPR: | |
7807 | tmp = boolean_true_node; | |
7808 | goto truth; | |
7809 | case TRUTH_OR_EXPR: | |
7810 | case TRUTH_ORIF_EXPR: | |
7811 | tmp = boolean_false_node; | |
7812 | truth: | |
7813 | if (TREE_OPERAND (t, 0) == tmp) | |
d6ed1c89 | 7814 | return potential_constant_expression_1 (TREE_OPERAND (t, 1), rval, flags); |
66e61a34 | 7815 | else |
d6ed1c89 | 7816 | return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags); |
66e61a34 | 7817 | |
66e61a34 JM |
7818 | case PLUS_EXPR: |
7819 | case MULT_EXPR: | |
7820 | case POINTER_PLUS_EXPR: | |
7821 | case RDIV_EXPR: | |
7822 | case EXACT_DIV_EXPR: | |
7823 | case MIN_EXPR: | |
7824 | case MAX_EXPR: | |
7825 | case LSHIFT_EXPR: | |
7826 | case RSHIFT_EXPR: | |
7827 | case LROTATE_EXPR: | |
7828 | case RROTATE_EXPR: | |
7829 | case BIT_IOR_EXPR: | |
7830 | case BIT_XOR_EXPR: | |
7831 | case BIT_AND_EXPR: | |
81cce6f6 | 7832 | case TRUTH_XOR_EXPR: |
e0f89433 JM |
7833 | case UNORDERED_EXPR: |
7834 | case ORDERED_EXPR: | |
66e61a34 JM |
7835 | case UNLT_EXPR: |
7836 | case UNLE_EXPR: | |
7837 | case UNGT_EXPR: | |
7838 | case UNGE_EXPR: | |
7839 | case UNEQ_EXPR: | |
7840 | case RANGE_EXPR: | |
7841 | case COMPLEX_EXPR: | |
d6ed1c89 JM |
7842 | want_rval = true; |
7843 | /* Fall through. */ | |
7844 | case ARRAY_REF: | |
7845 | case ARRAY_RANGE_REF: | |
7846 | case MEMBER_REF: | |
7847 | case DOTSTAR_EXPR: | |
66e61a34 JM |
7848 | binary: |
7849 | for (i = 0; i < 2; ++i) | |
d6ed1c89 JM |
7850 | if (!potential_constant_expression_1 (TREE_OPERAND (t, i), |
7851 | want_rval, flags)) | |
66e61a34 JM |
7852 | return false; |
7853 | return true; | |
7854 | ||
7855 | case COND_EXPR: | |
7856 | case VEC_COND_EXPR: | |
7857 | /* If the condition is a known constant, we know which of the legs we | |
7858 | care about; otherwise we only require that the condition and | |
7859 | either of the legs be potentially constant. */ | |
7860 | tmp = TREE_OPERAND (t, 0); | |
d6ed1c89 | 7861 | if (!potential_constant_expression_1 (tmp, rval, flags)) |
66e61a34 JM |
7862 | return false; |
7863 | else if (tmp == boolean_true_node) | |
d6ed1c89 JM |
7864 | return potential_constant_expression_1 (TREE_OPERAND (t, 1), |
7865 | want_rval, flags); | |
66e61a34 | 7866 | else if (tmp == boolean_false_node) |
d6ed1c89 JM |
7867 | return potential_constant_expression_1 (TREE_OPERAND (t, 2), |
7868 | want_rval, flags); | |
66e61a34 | 7869 | for (i = 1; i < 3; ++i) |
d6ed1c89 JM |
7870 | if (potential_constant_expression_1 (TREE_OPERAND (t, i), |
7871 | want_rval, tf_none)) | |
66e61a34 JM |
7872 | return true; |
7873 | if (flags & tf_error) | |
7874 | error ("expression %qE is not a constant-expression", t); | |
7875 | return false; | |
7876 | ||
7877 | case VEC_INIT_EXPR: | |
d6ed1c89 JM |
7878 | if (VEC_INIT_EXPR_IS_CONSTEXPR (t)) |
7879 | return true; | |
7880 | if (flags & tf_error) | |
262a7d6b JM |
7881 | { |
7882 | error ("non-constant array initialization"); | |
7883 | diagnose_non_constexpr_vec_init (t); | |
7884 | } | |
d6ed1c89 | 7885 | return false; |
66e61a34 JM |
7886 | |
7887 | default: | |
7888 | sorry ("unexpected ast of kind %s", tree_code_name[TREE_CODE (t)]); | |
7889 | gcc_unreachable(); | |
7890 | return false; | |
7891 | } | |
7892 | } | |
7893 | ||
d6ed1c89 JM |
7894 | /* The main entry point to the above. */ |
7895 | ||
7896 | bool | |
7897 | potential_constant_expression (tree t) | |
7898 | { | |
7899 | return potential_constant_expression_1 (t, false, tf_none); | |
7900 | } | |
7901 | ||
4be5e5b1 JM |
7902 | /* As above, but require a constant rvalue. */ |
7903 | ||
7904 | bool | |
7905 | potential_rvalue_constant_expression (tree t) | |
7906 | { | |
7907 | return potential_constant_expression_1 (t, true, tf_none); | |
7908 | } | |
7909 | ||
d6ed1c89 JM |
7910 | /* Like above, but complain about non-constant expressions. */ |
7911 | ||
7912 | bool | |
7913 | require_potential_constant_expression (tree t) | |
7914 | { | |
7915 | return potential_constant_expression_1 (t, false, tf_warning_or_error); | |
7916 | } | |
4be5e5b1 JM |
7917 | |
7918 | /* Cross product of the above. */ | |
7919 | ||
7920 | bool | |
7921 | require_potential_rvalue_constant_expression (tree t) | |
7922 | { | |
7923 | return potential_constant_expression_1 (t, true, tf_warning_or_error); | |
7924 | } | |
66e61a34 | 7925 | \f |
d5f4eddd JM |
7926 | /* Constructor for a lambda expression. */ |
7927 | ||
7928 | tree | |
7929 | build_lambda_expr (void) | |
7930 | { | |
7931 | tree lambda = make_node (LAMBDA_EXPR); | |
7932 | LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE; | |
7933 | LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE; | |
7934 | LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE; | |
7935 | LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE; | |
7936 | LAMBDA_EXPR_MUTABLE_P (lambda) = false; | |
7937 | return lambda; | |
7938 | } | |
7939 | ||
7940 | /* Create the closure object for a LAMBDA_EXPR. */ | |
7941 | ||
7942 | tree | |
7943 | build_lambda_object (tree lambda_expr) | |
7944 | { | |
7945 | /* Build aggregate constructor call. | |
7946 | - cp_parser_braced_list | |
7947 | - cp_parser_functional_cast */ | |
7948 | VEC(constructor_elt,gc) *elts = NULL; | |
7949 | tree node, expr, type; | |
7950 | location_t saved_loc; | |
7951 | ||
7952 | if (processing_template_decl) | |
7953 | return lambda_expr; | |
7954 | ||
7955 | /* Make sure any error messages refer to the lambda-introducer. */ | |
7956 | saved_loc = input_location; | |
7957 | input_location = LAMBDA_EXPR_LOCATION (lambda_expr); | |
7958 | ||
7959 | for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr); | |
7960 | node; | |
7961 | node = TREE_CHAIN (node)) | |
7962 | { | |
7963 | tree field = TREE_PURPOSE (node); | |
7964 | tree val = TREE_VALUE (node); | |
7965 | ||
a26e0b81 PC |
7966 | if (field == error_mark_node) |
7967 | { | |
7968 | expr = error_mark_node; | |
7969 | goto out; | |
7970 | } | |
7971 | ||
1f4a7a48 JM |
7972 | if (DECL_P (val)) |
7973 | mark_used (val); | |
7974 | ||
d5f4eddd JM |
7975 | /* Mere mortals can't copy arrays with aggregate initialization, so |
7976 | do some magic to make it work here. */ | |
7977 | if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE) | |
7978 | val = build_array_copy (val); | |
37a7519a JM |
7979 | else if (DECL_NORMAL_CAPTURE_P (field) |
7980 | && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE) | |
7981 | { | |
7982 | /* "the entities that are captured by copy are used to | |
7983 | direct-initialize each corresponding non-static data | |
7984 | member of the resulting closure object." | |
7985 | ||
7986 | There's normally no way to express direct-initialization | |
7987 | from an element of a CONSTRUCTOR, so we build up a special | |
7988 | TARGET_EXPR to bypass the usual copy-initialization. */ | |
574cfaa4 | 7989 | val = force_rvalue (val, tf_warning_or_error); |
37a7519a JM |
7990 | if (TREE_CODE (val) == TARGET_EXPR) |
7991 | TARGET_EXPR_DIRECT_INIT_P (val) = true; | |
7992 | } | |
d5f4eddd JM |
7993 | |
7994 | CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val); | |
7995 | } | |
7996 | ||
7997 | expr = build_constructor (init_list_type_node, elts); | |
7998 | CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1; | |
7999 | ||
8000 | /* N2927: "[The closure] class type is not an aggregate." | |
8001 | But we briefly treat it as an aggregate to make this simpler. */ | |
8002 | type = TREE_TYPE (lambda_expr); | |
8003 | CLASSTYPE_NON_AGGREGATE (type) = 0; | |
834aa426 | 8004 | expr = finish_compound_literal (type, expr, tf_warning_or_error); |
d5f4eddd JM |
8005 | CLASSTYPE_NON_AGGREGATE (type) = 1; |
8006 | ||
a26e0b81 | 8007 | out: |
d5f4eddd JM |
8008 | input_location = saved_loc; |
8009 | return expr; | |
8010 | } | |
8011 | ||
8012 | /* Return an initialized RECORD_TYPE for LAMBDA. | |
8013 | LAMBDA must have its explicit captures already. */ | |
8014 | ||
8015 | tree | |
8016 | begin_lambda_type (tree lambda) | |
8017 | { | |
8018 | tree type; | |
8019 | ||
8020 | { | |
8021 | /* Unique name. This is just like an unnamed class, but we cannot use | |
8022 | make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */ | |
8023 | tree name; | |
8024 | name = make_lambda_name (); | |
8025 | ||
8026 | /* Create the new RECORD_TYPE for this lambda. */ | |
8027 | type = xref_tag (/*tag_code=*/record_type, | |
8028 | name, | |
8029 | /*scope=*/ts_within_enclosing_non_class, | |
8030 | /*template_header_p=*/false); | |
8031 | } | |
8032 | ||
8033 | /* Designate it as a struct so that we can use aggregate initialization. */ | |
8034 | CLASSTYPE_DECLARED_CLASS (type) = false; | |
8035 | ||
8036 | /* Clear base types. */ | |
8037 | xref_basetypes (type, /*bases=*/NULL_TREE); | |
8038 | ||
8039 | /* Start the class. */ | |
8040 | type = begin_class_definition (type, /*attributes=*/NULL_TREE); | |
8041 | ||
8042 | /* Cross-reference the expression and the type. */ | |
8043 | TREE_TYPE (lambda) = type; | |
8044 | CLASSTYPE_LAMBDA_EXPR (type) = lambda; | |
8045 | ||
8046 | return type; | |
8047 | } | |
8048 | ||
8049 | /* Returns the type to use for the return type of the operator() of a | |
8050 | closure class. */ | |
8051 | ||
8052 | tree | |
8053 | lambda_return_type (tree expr) | |
8054 | { | |
8055 | tree type; | |
95b24c84 JM |
8056 | if (BRACE_ENCLOSED_INITIALIZER_P (expr)) |
8057 | { | |
8058 | warning (0, "cannot deduce lambda return type from a braced-init-list"); | |
8059 | return void_type_node; | |
8060 | } | |
d5f4eddd JM |
8061 | if (type_dependent_expression_p (expr)) |
8062 | { | |
8063 | type = cxx_make_type (DECLTYPE_TYPE); | |
8064 | DECLTYPE_TYPE_EXPR (type) = expr; | |
8065 | DECLTYPE_FOR_LAMBDA_RETURN (type) = true; | |
8066 | SET_TYPE_STRUCTURAL_EQUALITY (type); | |
8067 | } | |
8068 | else | |
8069 | type = type_decays_to (unlowered_expr_type (expr)); | |
8070 | return type; | |
8071 | } | |
8072 | ||
8073 | /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the | |
8074 | closure type. */ | |
8075 | ||
8076 | tree | |
8077 | lambda_function (tree lambda) | |
8078 | { | |
8079 | tree type; | |
8080 | if (TREE_CODE (lambda) == LAMBDA_EXPR) | |
8081 | type = TREE_TYPE (lambda); | |
8082 | else | |
8083 | type = lambda; | |
8084 | gcc_assert (LAMBDA_TYPE_P (type)); | |
8085 | /* Don't let debug_tree cause instantiation. */ | |
8086 | if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type)) | |
8087 | return NULL_TREE; | |
8088 | lambda = lookup_member (type, ansi_opname (CALL_EXPR), | |
8089 | /*protect=*/0, /*want_type=*/false); | |
8090 | if (lambda) | |
8091 | lambda = BASELINK_FUNCTIONS (lambda); | |
8092 | return lambda; | |
8093 | } | |
8094 | ||
8095 | /* Returns the type to use for the FIELD_DECL corresponding to the | |
8096 | capture of EXPR. | |
8097 | The caller should add REFERENCE_TYPE for capture by reference. */ | |
8098 | ||
8099 | tree | |
8100 | lambda_capture_field_type (tree expr) | |
8101 | { | |
8102 | tree type; | |
8103 | if (type_dependent_expression_p (expr)) | |
8104 | { | |
8105 | type = cxx_make_type (DECLTYPE_TYPE); | |
8106 | DECLTYPE_TYPE_EXPR (type) = expr; | |
8107 | DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true; | |
8108 | SET_TYPE_STRUCTURAL_EQUALITY (type); | |
8109 | } | |
8110 | else | |
8111 | type = non_reference (unlowered_expr_type (expr)); | |
8112 | return type; | |
8113 | } | |
8114 | ||
8115 | /* Recompute the return type for LAMBDA with body of the form: | |
8116 | { return EXPR ; } */ | |
8117 | ||
8118 | void | |
8119 | apply_lambda_return_type (tree lambda, tree return_type) | |
8120 | { | |
8121 | tree fco = lambda_function (lambda); | |
8122 | tree result; | |
8123 | ||
8124 | LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type; | |
8125 | ||
8126 | /* If we got a DECLTYPE_TYPE, don't stick it in the function yet, | |
8127 | it would interfere with instantiating the closure type. */ | |
8128 | if (dependent_type_p (return_type)) | |
8129 | return; | |
8130 | if (return_type == error_mark_node) | |
8131 | return; | |
8132 | ||
8133 | /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE | |
8134 | TREE_TYPE (METHOD_TYPE) == return-type */ | |
643d4cd6 | 8135 | TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco)); |
d5f4eddd JM |
8136 | |
8137 | result = DECL_RESULT (fco); | |
8138 | if (result == NULL_TREE) | |
8139 | return; | |
8140 | ||
8141 | /* We already have a DECL_RESULT from start_preparsed_function. | |
8142 | Now we need to redo the work it and allocate_struct_function | |
8143 | did to reflect the new type. */ | |
8144 | result = build_decl (input_location, RESULT_DECL, NULL_TREE, | |
8145 | TYPE_MAIN_VARIANT (return_type)); | |
8146 | DECL_ARTIFICIAL (result) = 1; | |
8147 | DECL_IGNORED_P (result) = 1; | |
8148 | cp_apply_type_quals_to_decl (cp_type_quals (return_type), | |
8149 | result); | |
8150 | ||
8151 | DECL_RESULT (fco) = result; | |
8152 | ||
8153 | if (!processing_template_decl && aggregate_value_p (result, fco)) | |
8154 | { | |
8155 | #ifdef PCC_STATIC_STRUCT_RETURN | |
8156 | cfun->returns_pcc_struct = 1; | |
8157 | #endif | |
8158 | cfun->returns_struct = 1; | |
8159 | } | |
8160 | ||
8161 | } | |
8162 | ||
8163 | /* DECL is a local variable or parameter from the surrounding scope of a | |
8164 | lambda-expression. Returns the decltype for a use of the capture field | |
8165 | for DECL even if it hasn't been captured yet. */ | |
8166 | ||
8167 | static tree | |
8168 | capture_decltype (tree decl) | |
8169 | { | |
8170 | tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl)); | |
8171 | /* FIXME do lookup instead of list walk? */ | |
8172 | tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam)); | |
8173 | tree type; | |
8174 | ||
8175 | if (cap) | |
8176 | type = TREE_TYPE (TREE_PURPOSE (cap)); | |
8177 | else | |
8178 | switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam)) | |
8179 | { | |
8180 | case CPLD_NONE: | |
8181 | error ("%qD is not captured", decl); | |
8182 | return error_mark_node; | |
8183 | ||
8184 | case CPLD_COPY: | |
8185 | type = TREE_TYPE (decl); | |
8186 | if (TREE_CODE (type) == REFERENCE_TYPE | |
8187 | && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE) | |
8188 | type = TREE_TYPE (type); | |
8189 | break; | |
8190 | ||
8191 | case CPLD_REFERENCE: | |
8192 | type = TREE_TYPE (decl); | |
8193 | if (TREE_CODE (type) != REFERENCE_TYPE) | |
8194 | type = build_reference_type (TREE_TYPE (decl)); | |
8195 | break; | |
8196 | ||
8197 | default: | |
8198 | gcc_unreachable (); | |
8199 | } | |
8200 | ||
8201 | if (TREE_CODE (type) != REFERENCE_TYPE) | |
8202 | { | |
8203 | if (!LAMBDA_EXPR_MUTABLE_P (lam)) | |
a3360e77 | 8204 | type = cp_build_qualified_type (type, (cp_type_quals (type) |
d5f4eddd JM |
8205 | |TYPE_QUAL_CONST)); |
8206 | type = build_reference_type (type); | |
8207 | } | |
8208 | return type; | |
8209 | } | |
8210 | ||
8211 | /* From an ID and INITIALIZER, create a capture (by reference if | |
8212 | BY_REFERENCE_P is true), add it to the capture-list for LAMBDA, | |
8213 | and return it. */ | |
8214 | ||
8215 | tree | |
37a7519a JM |
8216 | add_capture (tree lambda, tree id, tree initializer, bool by_reference_p, |
8217 | bool explicit_init_p) | |
d5f4eddd JM |
8218 | { |
8219 | tree type; | |
8220 | tree member; | |
8221 | ||
8222 | type = lambda_capture_field_type (initializer); | |
8223 | if (by_reference_p) | |
8224 | { | |
8225 | type = build_reference_type (type); | |
8226 | if (!real_lvalue_p (initializer)) | |
8227 | error ("cannot capture %qE by reference", initializer); | |
8228 | } | |
8229 | ||
8230 | /* Make member variable. */ | |
8231 | member = build_lang_decl (FIELD_DECL, id, type); | |
37a7519a JM |
8232 | if (!explicit_init_p) |
8233 | /* Normal captures are invisible to name lookup but uses are replaced | |
8234 | with references to the capture field; we implement this by only | |
8235 | really making them invisible in unevaluated context; see | |
8236 | qualify_lookup. For now, let's make explicitly initialized captures | |
8237 | always visible. */ | |
8238 | DECL_NORMAL_CAPTURE_P (member) = true; | |
d5f4eddd | 8239 | |
19030d77 JM |
8240 | /* Add it to the appropriate closure class if we've started it. */ |
8241 | if (current_class_type && current_class_type == TREE_TYPE (lambda)) | |
8242 | finish_member_declaration (member); | |
d5f4eddd JM |
8243 | |
8244 | LAMBDA_EXPR_CAPTURE_LIST (lambda) | |
8245 | = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda)); | |
8246 | ||
8247 | if (id == get_identifier ("__this")) | |
8248 | { | |
8249 | if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda)) | |
8250 | error ("already captured %<this%> in lambda expression"); | |
8251 | LAMBDA_EXPR_THIS_CAPTURE (lambda) = member; | |
8252 | } | |
8253 | ||
8254 | return member; | |
8255 | } | |
8256 | ||
19030d77 JM |
8257 | /* Register all the capture members on the list CAPTURES, which is the |
8258 | LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */ | |
8259 | ||
8260 | void register_capture_members (tree captures) | |
8261 | { | |
8262 | if (captures) | |
8263 | { | |
8264 | register_capture_members (TREE_CHAIN (captures)); | |
8265 | finish_member_declaration (TREE_PURPOSE (captures)); | |
8266 | } | |
8267 | } | |
8268 | ||
9660afe0 JM |
8269 | /* Given a FIELD_DECL decl belonging to a closure type, return a |
8270 | COMPONENT_REF of it relative to the 'this' parameter of the op() for | |
8271 | that type. */ | |
8272 | ||
8273 | static tree | |
8274 | thisify_lambda_field (tree decl) | |
8275 | { | |
8276 | tree context = lambda_function (DECL_CONTEXT (decl)); | |
8277 | tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context), | |
dd865ef6 | 8278 | RO_NULL, |
9660afe0 JM |
8279 | tf_warning_or_error); |
8280 | return finish_non_static_data_member (decl, object, | |
8281 | /*qualifying_scope*/NULL_TREE); | |
8282 | } | |
8283 | ||
d5f4eddd JM |
8284 | /* Similar to add_capture, except this works on a stack of nested lambdas. |
8285 | BY_REFERENCE_P in this case is derived from the default capture mode. | |
8286 | Returns the capture for the lambda at the bottom of the stack. */ | |
8287 | ||
8288 | tree | |
8289 | add_default_capture (tree lambda_stack, tree id, tree initializer) | |
8290 | { | |
8291 | bool this_capture_p = (id == get_identifier ("__this")); | |
8292 | ||
8293 | tree member = NULL_TREE; | |
8294 | ||
8295 | tree saved_class_type = current_class_type; | |
8296 | ||
8297 | tree node; | |
8298 | ||
8299 | for (node = lambda_stack; | |
8300 | node; | |
8301 | node = TREE_CHAIN (node)) | |
8302 | { | |
8303 | tree lambda = TREE_VALUE (node); | |
8304 | ||
8305 | current_class_type = TREE_TYPE (lambda); | |
8306 | member = add_capture (lambda, | |
8307 | id, | |
8308 | initializer, | |
8309 | /*by_reference_p=*/ | |
8310 | (!this_capture_p | |
8311 | && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) | |
37a7519a JM |
8312 | == CPLD_REFERENCE)), |
8313 | /*explicit_init_p=*/false); | |
9660afe0 | 8314 | initializer = thisify_lambda_field (member); |
d5f4eddd JM |
8315 | } |
8316 | ||
8317 | current_class_type = saved_class_type; | |
8318 | ||
8319 | return member; | |
d5f4eddd JM |
8320 | } |
8321 | ||
8322 | /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an | |
8323 | INDIRECT_REF, possibly adding it through default capturing. */ | |
8324 | ||
8325 | tree | |
8326 | lambda_expr_this_capture (tree lambda) | |
8327 | { | |
8328 | tree result; | |
8329 | ||
8330 | tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda); | |
8331 | ||
8332 | /* Try to default capture 'this' if we can. */ | |
8333 | if (!this_capture | |
8334 | && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE) | |
8335 | { | |
8336 | tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda)); | |
8337 | tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE); | |
71d16049 | 8338 | tree init = NULL_TREE; |
d5f4eddd JM |
8339 | |
8340 | /* If we are in a lambda function, we can move out until we hit: | |
8341 | 1. a non-lambda function, | |
8342 | 2. a lambda function capturing 'this', or | |
8343 | 3. a non-default capturing lambda function. */ | |
8344 | while (LAMBDA_FUNCTION_P (containing_function)) | |
8345 | { | |
8346 | tree lambda | |
8347 | = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function)); | |
8348 | ||
71d16049 JM |
8349 | if (LAMBDA_EXPR_THIS_CAPTURE (lambda)) |
8350 | { | |
8351 | /* An outer lambda has already captured 'this'. */ | |
8352 | tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda); | |
92de1b37 | 8353 | init = thisify_lambda_field (cap); |
71d16049 JM |
8354 | break; |
8355 | } | |
8356 | ||
8357 | if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE) | |
8358 | /* An outer lambda won't let us capture 'this'. */ | |
8359 | break; | |
d5f4eddd JM |
8360 | |
8361 | lambda_stack = tree_cons (NULL_TREE, | |
8362 | lambda, | |
8363 | lambda_stack); | |
8364 | ||
8365 | containing_function = decl_function_context (containing_function); | |
8366 | } | |
8367 | ||
71d16049 JM |
8368 | if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function) |
8369 | && !LAMBDA_FUNCTION_P (containing_function)) | |
8370 | /* First parameter is 'this'. */ | |
8371 | init = DECL_ARGUMENTS (containing_function); | |
d5f4eddd | 8372 | |
71d16049 JM |
8373 | if (init) |
8374 | this_capture = add_default_capture (lambda_stack, | |
8375 | /*id=*/get_identifier ("__this"), | |
8376 | init); | |
d5f4eddd JM |
8377 | } |
8378 | ||
8379 | if (!this_capture) | |
8380 | { | |
8381 | error ("%<this%> was not captured for this lambda function"); | |
8382 | result = error_mark_node; | |
8383 | } | |
8384 | else | |
8385 | { | |
8386 | /* To make sure that current_class_ref is for the lambda. */ | |
8387 | gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda)); | |
8388 | ||
8389 | result = finish_non_static_data_member (this_capture, | |
2defb926 | 8390 | NULL_TREE, |
d5f4eddd JM |
8391 | /*qualifying_scope=*/NULL_TREE); |
8392 | ||
8393 | /* If 'this' is captured, each use of 'this' is transformed into an | |
8394 | access to the corresponding unnamed data member of the closure | |
8395 | type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast | |
8396 | ensures that the transformed expression is an rvalue. ] */ | |
8397 | result = rvalue (result); | |
8398 | } | |
8399 | ||
8400 | return result; | |
8401 | } | |
8402 | ||
a6846853 JM |
8403 | /* Returns the method basetype of the innermost non-lambda function, or |
8404 | NULL_TREE if none. */ | |
8405 | ||
8406 | tree | |
8407 | nonlambda_method_basetype (void) | |
8408 | { | |
8409 | tree fn, type; | |
8410 | if (!current_class_ref) | |
8411 | return NULL_TREE; | |
8412 | ||
8413 | type = current_class_type; | |
8414 | if (!LAMBDA_TYPE_P (type)) | |
8415 | return type; | |
8416 | ||
8417 | /* Find the nearest enclosing non-lambda function. */ | |
8418 | fn = TYPE_NAME (type); | |
8419 | do | |
8420 | fn = decl_function_context (fn); | |
8421 | while (fn && LAMBDA_FUNCTION_P (fn)); | |
8422 | ||
8423 | if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)) | |
8424 | return NULL_TREE; | |
8425 | ||
8426 | return TYPE_METHOD_BASETYPE (TREE_TYPE (fn)); | |
8427 | } | |
8428 | ||
b77068f2 JM |
8429 | /* If the closure TYPE has a static op(), also add a conversion to function |
8430 | pointer. */ | |
8431 | ||
8432 | void | |
8433 | maybe_add_lambda_conv_op (tree type) | |
8434 | { | |
8435 | bool nested = (current_function_decl != NULL_TREE); | |
8436 | tree callop = lambda_function (type); | |
8437 | tree rettype, name, fntype, fn, body, compound_stmt; | |
c6be04ad JM |
8438 | tree thistype, stattype, statfn, convfn, call, arg; |
8439 | VEC (tree, gc) *argvec; | |
b77068f2 | 8440 | |
c6be04ad | 8441 | if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE) |
b77068f2 JM |
8442 | return; |
8443 | ||
c6be04ad JM |
8444 | stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)), |
8445 | FUNCTION_ARG_CHAIN (callop)); | |
8446 | ||
8447 | /* First build up the conversion op. */ | |
8448 | ||
8449 | rettype = build_pointer_type (stattype); | |
b77068f2 | 8450 | name = mangle_conv_op_name_for_type (rettype); |
c6be04ad JM |
8451 | thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST); |
8452 | fntype = build_method_type_directly (thistype, rettype, void_list_node); | |
8453 | fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype); | |
b77068f2 JM |
8454 | DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop); |
8455 | ||
8456 | if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn | |
8457 | && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT) | |
8458 | DECL_ALIGN (fn) = 2 * BITS_PER_UNIT; | |
8459 | ||
8460 | SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR); | |
8461 | grokclassfn (type, fn, NO_SPECIAL); | |
8462 | set_linkage_according_to_type (type, fn); | |
8463 | rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof); | |
8464 | DECL_IN_AGGR_P (fn) = 1; | |
8465 | DECL_ARTIFICIAL (fn) = 1; | |
8466 | DECL_NOT_REALLY_EXTERN (fn) = 1; | |
8467 | DECL_DECLARED_INLINE_P (fn) = 1; | |
c6be04ad JM |
8468 | DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST); |
8469 | if (nested) | |
8470 | DECL_INTERFACE_KNOWN (fn) = 1; | |
8471 | ||
8472 | add_method (type, fn, NULL_TREE); | |
8473 | ||
8474 | /* Generic thunk code fails for varargs; we'll complain in mark_used if | |
8475 | the conversion op is used. */ | |
8476 | if (varargs_function_p (callop)) | |
8477 | { | |
8478 | DECL_DELETED_FN (fn) = 1; | |
8479 | return; | |
8480 | } | |
8481 | ||
8482 | /* Now build up the thunk to be returned. */ | |
8483 | ||
8484 | name = get_identifier ("_FUN"); | |
8485 | fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype); | |
8486 | DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop); | |
8487 | if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn | |
8488 | && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT) | |
8489 | DECL_ALIGN (fn) = 2 * BITS_PER_UNIT; | |
8490 | grokclassfn (type, fn, NO_SPECIAL); | |
8491 | set_linkage_according_to_type (type, fn); | |
8492 | rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof); | |
8493 | DECL_IN_AGGR_P (fn) = 1; | |
8494 | DECL_ARTIFICIAL (fn) = 1; | |
8495 | DECL_NOT_REALLY_EXTERN (fn) = 1; | |
8496 | DECL_DECLARED_INLINE_P (fn) = 1; | |
b77068f2 | 8497 | DECL_STATIC_FUNCTION_P (fn) = 1; |
910ad8de NF |
8498 | DECL_ARGUMENTS (fn) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop))); |
8499 | for (arg = DECL_ARGUMENTS (fn); arg; arg = DECL_CHAIN (arg)) | |
c6be04ad | 8500 | DECL_CONTEXT (arg) = fn; |
7a79ff3b JM |
8501 | if (nested) |
8502 | DECL_INTERFACE_KNOWN (fn) = 1; | |
b77068f2 JM |
8503 | |
8504 | add_method (type, fn, NULL_TREE); | |
8505 | ||
8506 | if (nested) | |
8507 | push_function_context (); | |
c6be04ad JM |
8508 | |
8509 | /* Generate the body of the thunk. */ | |
8510 | ||
8511 | start_preparsed_function (statfn, NULL_TREE, | |
8512 | SF_PRE_PARSED | SF_INCLASS_INLINE); | |
8513 | if (DECL_ONE_ONLY (statfn)) | |
8514 | { | |
8515 | /* Put the thunk in the same comdat group as the call op. */ | |
8516 | struct cgraph_node *callop_node, *thunk_node; | |
8517 | DECL_COMDAT_GROUP (statfn) = DECL_COMDAT_GROUP (callop); | |
a358e188 MJ |
8518 | callop_node = cgraph_get_create_node (callop); |
8519 | thunk_node = cgraph_get_create_node (statfn); | |
c6be04ad JM |
8520 | gcc_assert (callop_node->same_comdat_group == NULL); |
8521 | gcc_assert (thunk_node->same_comdat_group == NULL); | |
8522 | callop_node->same_comdat_group = thunk_node; | |
8523 | thunk_node->same_comdat_group = callop_node; | |
8524 | } | |
8525 | body = begin_function_body (); | |
8526 | compound_stmt = begin_compound_stmt (0); | |
8527 | ||
9542943d JM |
8528 | arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)), |
8529 | null_pointer_node); | |
c6be04ad JM |
8530 | argvec = make_tree_vector (); |
8531 | VEC_quick_push (tree, argvec, arg); | |
910ad8de | 8532 | for (arg = DECL_ARGUMENTS (statfn); arg; arg = DECL_CHAIN (arg)) |
c6be04ad | 8533 | VEC_safe_push (tree, gc, argvec, arg); |
e62e4922 JM |
8534 | call = build_call_a (callop, VEC_length (tree, argvec), |
8535 | VEC_address (tree, argvec)); | |
c6be04ad | 8536 | CALL_FROM_THUNK_P (call) = 1; |
e62e4922 | 8537 | if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call))) |
362115a9 | 8538 | call = build_cplus_new (TREE_TYPE (call), call, tf_warning_or_error); |
e62e4922 | 8539 | call = convert_from_reference (call); |
c6be04ad JM |
8540 | finish_return_stmt (call); |
8541 | ||
8542 | finish_compound_stmt (compound_stmt); | |
8543 | finish_function_body (body); | |
8544 | ||
8545 | expand_or_defer_fn (finish_function (2)); | |
8546 | ||
8547 | /* Generate the body of the conversion op. */ | |
8548 | ||
8549 | start_preparsed_function (convfn, NULL_TREE, | |
b77068f2 JM |
8550 | SF_PRE_PARSED | SF_INCLASS_INLINE); |
8551 | body = begin_function_body (); | |
8552 | compound_stmt = begin_compound_stmt (0); | |
8553 | ||
c6be04ad | 8554 | finish_return_stmt (decay_conversion (statfn)); |
b77068f2 JM |
8555 | |
8556 | finish_compound_stmt (compound_stmt); | |
8557 | finish_function_body (body); | |
8558 | ||
8559 | expand_or_defer_fn (finish_function (2)); | |
c6be04ad | 8560 | |
b77068f2 JM |
8561 | if (nested) |
8562 | pop_function_context (); | |
8563 | } | |
cf22909c | 8564 | #include "gt-cp-semantics.h" |