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