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