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