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