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