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