]>
Commit | Line | Data |
---|---|---|
ad321293 MM |
1 | /* Perform the semantic phase of parsing, i.e., the process of |
2 | building tree structure, checking semantic consistency, and | |
3 | building RTL. These routines are used both during actual parsing | |
4 | and during the instantiation of template functions. | |
5 | ||
4c571114 | 6 | Copyright (C) 1998, 1999 Free Software Foundation, Inc. |
ad321293 MM |
7 | Written by Mark Mitchell (mmitchell@usa.net) based on code found |
8 | formerly in parse.y and pt.c. | |
9 | ||
10 | This file is part of GNU CC. | |
11 | ||
12 | GNU CC is free software; you can redistribute it and/or modify it | |
13 | under the terms of the GNU General Public License as published by | |
14 | the Free Software Foundation; either version 2, or (at your option) | |
15 | any later version. | |
16 | ||
17 | GNU CC is distributed in the hope that it will be useful, but | |
18 | WITHOUT ANY WARRANTY; without even the implied warranty of | |
19 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
20 | General Public License for more details. | |
21 | ||
22 | You should have received a copy of the GNU General Public License | |
23 | along with GNU CC; see the file COPYING. If not, write to the Free | |
24 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA | |
25 | 02111-1307, USA. */ | |
26 | ||
27 | #include "config.h" | |
8d052bc7 | 28 | #include "system.h" |
ad321293 MM |
29 | #include "tree.h" |
30 | #include "cp-tree.h" | |
31 | #include "except.h" | |
32 | #include "lex.h" | |
12027a89 | 33 | #include "toplev.h" |
ad321293 MM |
34 | |
35 | /* There routines provide a modular interface to perform many parsing | |
36 | operations. They may therefore be used during actual parsing, or | |
37 | during template instantiation, which may be regarded as a | |
38 | degenerate form of parsing. Since the current g++ parser is | |
39 | lacking in several respects, and will be reimplemented, we are | |
40 | attempting to move most code that is not directly related to | |
41 | parsing into this file; that will make implementing the new parser | |
42 | much easier since it will be able to make use of these routines. */ | |
43 | ||
44 | /* When parsing a template, LAST_TREE contains the last statement | |
45 | parsed. These are chained together through the TREE_CHAIN field, | |
46 | but often need to be re-organized since the parse is performed | |
47 | bottom-up. This macro makes LAST_TREE the indicated SUBSTMT of | |
48 | STMT. */ | |
49 | ||
50 | #define RECHAIN_STMTS(stmt, substmt, last) \ | |
51 | do { \ | |
52 | substmt = last; \ | |
53 | TREE_CHAIN (stmt) = NULL_TREE; \ | |
54 | last_tree = stmt; \ | |
55 | } while (0) | |
56 | ||
57 | #define RECHAIN_STMTS_FROM_LAST(stmt, substmt) \ | |
58 | RECHAIN_STMTS (stmt, substmt, last_tree) | |
59 | ||
60 | #define RECHAIN_STMTS_FROM_CHAIN(stmt, substmt) \ | |
61 | RECHAIN_STMTS (stmt, substmt, TREE_CHAIN (stmt)) | |
62 | ||
63 | /* Finish an expression-statement, whose EXPRESSION is as indicated. */ | |
64 | ||
65 | void | |
66 | finish_expr_stmt (expr) | |
67 | tree expr; | |
68 | { | |
ce4a0391 | 69 | if (expr != NULL_TREE) |
ad321293 | 70 | { |
ce4a0391 MM |
71 | if (!processing_template_decl) |
72 | { | |
73 | emit_line_note (input_filename, lineno); | |
74 | /* Do default conversion if safe and possibly important, | |
75 | in case within ({...}). */ | |
76 | if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE | |
77 | && lvalue_p (expr)) | |
78 | || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE) | |
79 | expr = default_conversion (expr); | |
80 | } | |
81 | ||
82 | cplus_expand_expr_stmt (expr); | |
83 | clear_momentary (); | |
ad321293 | 84 | } |
ce4a0391 | 85 | |
ad321293 MM |
86 | finish_stmt (); |
87 | } | |
88 | ||
89 | /* Begin an if-statement. Returns a newly created IF_STMT if | |
90 | appropriate. */ | |
91 | ||
92 | tree | |
93 | begin_if_stmt () | |
94 | { | |
95 | tree r; | |
96 | ||
97 | if (processing_template_decl) | |
98 | { | |
99 | r = build_min_nt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE); | |
100 | add_tree (r); | |
101 | } | |
102 | else | |
103 | r = NULL_TREE; | |
104 | ||
105 | do_pushlevel (); | |
106 | ||
107 | return r; | |
108 | } | |
109 | ||
110 | /* Process the COND of an if-statement, which may be given by | |
111 | IF_STMT. */ | |
112 | ||
113 | void | |
114 | finish_if_stmt_cond (cond, if_stmt) | |
115 | tree cond; | |
116 | tree if_stmt; | |
117 | { | |
118 | if (processing_template_decl) | |
119 | { | |
120 | if (last_tree != if_stmt) | |
121 | RECHAIN_STMTS_FROM_LAST (if_stmt, IF_COND (if_stmt)); | |
122 | else | |
123 | IF_COND (if_stmt) = cond; | |
124 | } | |
125 | else | |
126 | { | |
127 | emit_line_note (input_filename, lineno); | |
128 | expand_start_cond (condition_conversion (cond), 0); | |
129 | } | |
130 | } | |
131 | ||
132 | /* Finish the then-clause of an if-statement, which may be given by | |
133 | IF_STMT. */ | |
134 | ||
135 | tree | |
136 | finish_then_clause (if_stmt) | |
137 | tree if_stmt; | |
138 | { | |
139 | if (processing_template_decl) | |
140 | { | |
141 | RECHAIN_STMTS_FROM_CHAIN (if_stmt, | |
142 | THEN_CLAUSE (if_stmt)); | |
143 | last_tree = if_stmt; | |
144 | return if_stmt; | |
145 | } | |
146 | else | |
147 | return NULL_TREE; | |
148 | } | |
149 | ||
150 | /* Begin the else-clause of an if-statement. */ | |
151 | ||
152 | void | |
153 | begin_else_clause () | |
154 | { | |
155 | if (!processing_template_decl) | |
156 | expand_start_else (); | |
157 | } | |
158 | ||
159 | /* Finish the else-clause of an if-statement, which may be given by | |
160 | IF_STMT. */ | |
161 | ||
162 | void | |
163 | finish_else_clause (if_stmt) | |
164 | tree if_stmt; | |
165 | { | |
166 | if (processing_template_decl) | |
167 | RECHAIN_STMTS_FROM_CHAIN (if_stmt, ELSE_CLAUSE (if_stmt)); | |
168 | } | |
169 | ||
170 | /* Finsh an if-statement. */ | |
171 | ||
172 | void | |
173 | finish_if_stmt () | |
174 | { | |
175 | if (!processing_template_decl) | |
176 | expand_end_cond (); | |
177 | ||
178 | do_poplevel (); | |
179 | finish_stmt (); | |
180 | } | |
181 | ||
182 | /* Begin a while-statement. Returns a newly created WHILE_STMT if | |
183 | appropriate. */ | |
184 | ||
185 | tree | |
186 | begin_while_stmt () | |
187 | { | |
188 | tree r; | |
189 | ||
190 | if (processing_template_decl) | |
191 | { | |
192 | r = build_min_nt (WHILE_STMT, NULL_TREE, NULL_TREE); | |
193 | add_tree (r); | |
194 | } | |
195 | else | |
196 | { | |
197 | emit_nop (); | |
198 | emit_line_note (input_filename, lineno); | |
199 | expand_start_loop (1); | |
200 | r = NULL_TREE; | |
201 | } | |
202 | ||
203 | do_pushlevel (); | |
204 | ||
205 | return r; | |
206 | } | |
207 | ||
208 | /* Process the COND of an if-statement, which may be given by | |
209 | WHILE_STMT. */ | |
210 | ||
211 | void | |
212 | finish_while_stmt_cond (cond, while_stmt) | |
213 | tree cond; | |
214 | tree while_stmt; | |
215 | { | |
216 | if (processing_template_decl) | |
217 | { | |
218 | if (last_tree != while_stmt) | |
219 | RECHAIN_STMTS_FROM_LAST (while_stmt, | |
220 | WHILE_COND (while_stmt)); | |
221 | else | |
222 | TREE_OPERAND (while_stmt, 0) = cond; | |
223 | } | |
224 | else | |
225 | { | |
226 | emit_line_note (input_filename, lineno); | |
227 | expand_exit_loop_if_false (0, condition_conversion (cond)); | |
228 | } | |
229 | ||
230 | /* If COND wasn't a declaration, clear out the | |
231 | block we made for it and start a new one here so the | |
232 | optimization in expand_end_loop will work. */ | |
233 | if (getdecls () == NULL_TREE) | |
234 | { | |
235 | do_poplevel (); | |
236 | do_pushlevel (); | |
237 | } | |
238 | } | |
239 | ||
240 | /* Finish a while-statement, which may be given by WHILE_STMT. */ | |
241 | ||
242 | void | |
243 | finish_while_stmt (while_stmt) | |
244 | tree while_stmt; | |
245 | { | |
246 | do_poplevel (); | |
247 | ||
248 | if (processing_template_decl) | |
249 | RECHAIN_STMTS_FROM_CHAIN (while_stmt, WHILE_BODY (while_stmt)); | |
250 | else | |
251 | expand_end_loop (); | |
252 | finish_stmt (); | |
253 | } | |
254 | ||
255 | /* Begin a do-statement. Returns a newly created DO_STMT if | |
256 | appropriate. */ | |
257 | ||
258 | tree | |
259 | begin_do_stmt () | |
260 | { | |
261 | if (processing_template_decl) | |
262 | { | |
263 | tree r = build_min_nt (DO_STMT, NULL_TREE, NULL_TREE); | |
264 | add_tree (r); | |
265 | return r; | |
266 | } | |
267 | else | |
268 | { | |
269 | emit_nop (); | |
270 | emit_line_note (input_filename, lineno); | |
271 | expand_start_loop_continue_elsewhere (1); | |
272 | return NULL_TREE; | |
273 | } | |
274 | } | |
275 | ||
276 | /* Finish the body of a do-statement, which may be given by DO_STMT. */ | |
277 | ||
278 | void | |
279 | finish_do_body (do_stmt) | |
280 | tree do_stmt; | |
281 | { | |
282 | if (processing_template_decl) | |
283 | RECHAIN_STMTS_FROM_CHAIN (do_stmt, DO_BODY (do_stmt)); | |
284 | else | |
285 | expand_loop_continue_here (); | |
286 | } | |
287 | ||
288 | /* Finish a do-statement, which may be given by DO_STMT, and whose | |
289 | COND is as indicated. */ | |
290 | ||
291 | void | |
292 | finish_do_stmt (cond, do_stmt) | |
293 | tree cond; | |
294 | tree do_stmt; | |
295 | { | |
296 | if (processing_template_decl) | |
297 | DO_COND (do_stmt) = cond; | |
298 | else | |
299 | { | |
300 | emit_line_note (input_filename, lineno); | |
301 | expand_exit_loop_if_false (0, condition_conversion (cond)); | |
302 | expand_end_loop (); | |
303 | } | |
304 | ||
305 | clear_momentary (); | |
306 | finish_stmt (); | |
307 | } | |
308 | ||
309 | /* Finish a return-statement. The EXPRESSION returned, if any, is as | |
310 | indicated. */ | |
311 | ||
312 | void | |
313 | finish_return_stmt (expr) | |
314 | tree expr; | |
315 | { | |
316 | emit_line_note (input_filename, lineno); | |
317 | c_expand_return (expr); | |
318 | finish_stmt (); | |
319 | } | |
320 | ||
321 | /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */ | |
322 | ||
323 | tree | |
324 | begin_for_stmt () | |
325 | { | |
326 | tree r; | |
327 | ||
328 | if (processing_template_decl) | |
329 | { | |
330 | r = build_min_nt (FOR_STMT, NULL_TREE, NULL_TREE, | |
331 | NULL_TREE, NULL_TREE); | |
332 | add_tree (r); | |
333 | } | |
334 | else | |
335 | r = NULL_TREE; | |
336 | ||
337 | if (flag_new_for_scope > 0) | |
338 | { | |
339 | do_pushlevel (); | |
340 | note_level_for_for (); | |
341 | } | |
342 | ||
343 | return r; | |
344 | } | |
345 | ||
346 | /* Finish the for-init-statement of a for-statement, which may be | |
347 | given by FOR_STMT. */ | |
348 | ||
349 | void | |
350 | finish_for_init_stmt (for_stmt) | |
351 | tree for_stmt; | |
352 | { | |
353 | if (processing_template_decl) | |
354 | { | |
355 | if (last_tree != for_stmt) | |
356 | RECHAIN_STMTS_FROM_CHAIN (for_stmt, FOR_INIT_STMT (for_stmt)); | |
357 | } | |
358 | else | |
359 | { | |
360 | emit_nop (); | |
361 | emit_line_note (input_filename, lineno); | |
362 | expand_start_loop_continue_elsewhere (1); | |
363 | } | |
364 | ||
365 | do_pushlevel (); | |
366 | } | |
367 | ||
368 | /* Finish the COND of a for-statement, which may be given by | |
369 | FOR_STMT. */ | |
370 | ||
371 | void | |
372 | finish_for_cond (cond, for_stmt) | |
373 | tree cond; | |
374 | tree for_stmt; | |
375 | { | |
376 | if (processing_template_decl) | |
377 | { | |
378 | if (last_tree != for_stmt) | |
379 | RECHAIN_STMTS_FROM_LAST (for_stmt, FOR_COND (for_stmt)); | |
380 | else | |
381 | FOR_COND (for_stmt) = cond; | |
382 | } | |
383 | else | |
384 | { | |
385 | emit_line_note (input_filename, lineno); | |
1dcf683e MM |
386 | if (cond) |
387 | expand_exit_loop_if_false (0, condition_conversion (cond)); | |
ad321293 MM |
388 | } |
389 | ||
390 | /* If the cond wasn't a declaration, clear out the | |
391 | block we made for it and start a new one here so the | |
392 | optimization in expand_end_loop will work. */ | |
393 | if (getdecls () == NULL_TREE) | |
394 | { | |
395 | do_poplevel (); | |
396 | do_pushlevel (); | |
397 | } | |
398 | } | |
399 | ||
400 | /* Finish the increment-EXPRESSION in a for-statement, which may be | |
401 | given by FOR_STMT. */ | |
402 | ||
403 | void | |
404 | finish_for_expr (expr, for_stmt) | |
405 | tree expr; | |
406 | tree for_stmt; | |
407 | { | |
408 | if (processing_template_decl) | |
409 | FOR_EXPR (for_stmt) = expr; | |
410 | ||
411 | /* Don't let the tree nodes for EXPR be discarded | |
412 | by clear_momentary during the parsing of the next stmt. */ | |
413 | push_momentary (); | |
414 | } | |
415 | ||
416 | /* Finish the body of a for-statement, which may be given by | |
417 | FOR_STMT. The increment-EXPR for the loop must be | |
418 | provided. */ | |
419 | ||
420 | void | |
421 | finish_for_stmt (expr, for_stmt) | |
422 | tree expr; | |
423 | tree for_stmt; | |
424 | { | |
425 | /* Pop the scope for the body of the loop. */ | |
426 | do_poplevel (); | |
427 | ||
428 | if (processing_template_decl) | |
429 | RECHAIN_STMTS_FROM_CHAIN (for_stmt, FOR_BODY (for_stmt)); | |
430 | else | |
431 | { | |
432 | emit_line_note (input_filename, lineno); | |
433 | expand_loop_continue_here (); | |
434 | if (expr) | |
435 | cplus_expand_expr_stmt (expr); | |
436 | expand_end_loop (); | |
437 | } | |
438 | ||
439 | pop_momentary (); | |
440 | ||
441 | if (flag_new_for_scope > 0) | |
442 | do_poplevel (); | |
443 | ||
444 | finish_stmt (); | |
445 | } | |
446 | ||
447 | /* Finish a break-statement. */ | |
448 | ||
449 | void | |
450 | finish_break_stmt () | |
451 | { | |
452 | emit_line_note (input_filename, lineno); | |
453 | if (processing_template_decl) | |
454 | add_tree (build_min_nt (BREAK_STMT)); | |
455 | else if ( ! expand_exit_something ()) | |
8251199e | 456 | cp_error ("break statement not within loop or switch"); |
ad321293 MM |
457 | } |
458 | ||
459 | /* Finish a continue-statement. */ | |
460 | ||
461 | void | |
462 | finish_continue_stmt () | |
463 | { | |
464 | emit_line_note (input_filename, lineno); | |
465 | if (processing_template_decl) | |
466 | add_tree (build_min_nt (CONTINUE_STMT)); | |
467 | else if (! expand_continue_loop (0)) | |
8251199e | 468 | cp_error ("continue statement not within a loop"); |
ad321293 MM |
469 | } |
470 | ||
471 | /* Begin a switch-statement. */ | |
472 | ||
473 | void | |
474 | begin_switch_stmt () | |
475 | { | |
476 | do_pushlevel (); | |
477 | } | |
478 | ||
479 | /* Finish the cond of a switch-statement. Returns a new | |
480 | SWITCH_STMT if appropriate. */ | |
481 | ||
482 | tree | |
483 | finish_switch_cond (cond) | |
484 | tree cond; | |
485 | { | |
486 | tree r; | |
487 | ||
488 | if (processing_template_decl) | |
489 | { | |
490 | r = build_min_nt (SWITCH_STMT, cond, NULL_TREE); | |
491 | add_tree (r); | |
492 | } | |
493 | else | |
494 | { | |
495 | emit_line_note (input_filename, lineno); | |
496 | c_expand_start_case (cond); | |
497 | r = NULL_TREE; | |
498 | } | |
499 | push_switch (); | |
500 | ||
501 | /* Don't let the tree nodes for COND be discarded by | |
502 | clear_momentary during the parsing of the next stmt. */ | |
503 | push_momentary (); | |
504 | ||
505 | return r; | |
506 | } | |
507 | ||
508 | /* Finish the body of a switch-statement, which may be given by | |
509 | SWITCH_STMT. The COND to switch on is indicated. */ | |
510 | ||
511 | void | |
512 | finish_switch_stmt (cond, switch_stmt) | |
513 | tree cond; | |
514 | tree switch_stmt; | |
515 | { | |
516 | if (processing_template_decl) | |
517 | RECHAIN_STMTS_FROM_CHAIN (switch_stmt, SWITCH_BODY (switch_stmt)); | |
518 | else | |
519 | expand_end_case (cond); | |
520 | pop_momentary (); | |
521 | pop_switch (); | |
522 | do_poplevel (); | |
523 | finish_stmt (); | |
524 | } | |
525 | ||
526 | /* Finish a case-label. */ | |
527 | ||
528 | void | |
529 | finish_case_label (low_value, high_value) | |
530 | tree low_value; | |
531 | tree high_value; | |
532 | { | |
533 | do_case (low_value, high_value); | |
534 | } | |
535 | ||
536 | ||
537 | /* Finish a goto-statement. */ | |
538 | ||
539 | void | |
540 | finish_goto_stmt (destination) | |
541 | tree destination; | |
542 | { | |
543 | if (processing_template_decl) | |
544 | add_tree (build_min_nt (GOTO_STMT, destination)); | |
545 | else | |
546 | { | |
547 | emit_line_note (input_filename, lineno); | |
548 | ||
549 | if (TREE_CODE (destination) == IDENTIFIER_NODE) | |
550 | { | |
551 | tree decl = lookup_label (destination); | |
552 | TREE_USED (decl) = 1; | |
553 | expand_goto (decl); | |
554 | } | |
555 | else | |
556 | expand_computed_goto (destination); | |
557 | } | |
558 | } | |
559 | ||
560 | /* Begin a try-block. Returns a newly-created TRY_BLOCK if | |
561 | appropriate. */ | |
562 | ||
563 | tree | |
564 | begin_try_block () | |
565 | { | |
566 | if (processing_template_decl) | |
567 | { | |
568 | tree r = build_min_nt (TRY_BLOCK, NULL_TREE, | |
569 | NULL_TREE); | |
570 | add_tree (r); | |
571 | return r; | |
572 | } | |
573 | else | |
574 | { | |
575 | emit_line_note (input_filename, lineno); | |
576 | expand_start_try_stmts (); | |
577 | return NULL_TREE; | |
578 | } | |
579 | } | |
580 | ||
581 | /* Finish a try-block, which may be given by TRY_BLOCK. */ | |
582 | ||
583 | void | |
584 | finish_try_block (try_block) | |
585 | tree try_block; | |
586 | { | |
587 | if (processing_template_decl) | |
588 | RECHAIN_STMTS_FROM_LAST (try_block, TRY_STMTS (try_block)); | |
589 | else | |
9a0d1e1b AM |
590 | { |
591 | expand_start_all_catch (); | |
9a0d1e1b | 592 | } |
ad321293 MM |
593 | } |
594 | ||
595 | /* Finish a handler-sequence for a try-block, which may be given by | |
596 | TRY_BLOCK. */ | |
597 | ||
598 | void | |
599 | finish_handler_sequence (try_block) | |
600 | tree try_block; | |
601 | { | |
602 | if (processing_template_decl) | |
603 | RECHAIN_STMTS_FROM_CHAIN (try_block, TRY_HANDLERS (try_block)); | |
604 | else | |
9a0d1e1b | 605 | { |
9a0d1e1b AM |
606 | expand_end_all_catch (); |
607 | } | |
ad321293 MM |
608 | } |
609 | ||
610 | /* Begin a handler. Returns a HANDLER if appropriate. */ | |
611 | ||
612 | tree | |
613 | begin_handler () | |
614 | { | |
615 | tree r; | |
616 | ||
617 | if (processing_template_decl) | |
618 | { | |
619 | r = build_min_nt (HANDLER, NULL_TREE, NULL_TREE); | |
620 | add_tree (r); | |
621 | } | |
622 | else | |
623 | r = NULL_TREE; | |
624 | ||
625 | do_pushlevel (); | |
626 | ||
627 | return r; | |
628 | } | |
629 | ||
630 | /* Finish the handler-parameters for a handler, which may be given by | |
631 | HANDLER. */ | |
632 | ||
633 | void | |
634 | finish_handler_parms (handler) | |
635 | tree handler; | |
636 | { | |
637 | if (processing_template_decl) | |
638 | RECHAIN_STMTS_FROM_CHAIN (handler, HANDLER_PARMS (handler)); | |
639 | } | |
640 | ||
641 | /* Finish a handler, which may be given by HANDLER. */ | |
642 | ||
643 | void | |
644 | finish_handler (handler) | |
645 | tree handler; | |
646 | { | |
647 | if (processing_template_decl) | |
648 | RECHAIN_STMTS_FROM_CHAIN (handler, HANDLER_BODY (handler)); | |
649 | else | |
650 | expand_end_catch_block (); | |
651 | ||
652 | do_poplevel (); | |
653 | } | |
654 | ||
655 | /* Begin a compound-statement. If HAS_NO_SCOPE is non-zero, the | |
656 | compound-statement does not define a scope. Returns a new | |
657 | COMPOUND_STMT if appropriate. */ | |
658 | ||
659 | tree | |
660 | begin_compound_stmt (has_no_scope) | |
661 | int has_no_scope; | |
662 | { | |
663 | tree r; | |
664 | ||
665 | if (processing_template_decl) | |
666 | { | |
667 | r = build_min_nt (COMPOUND_STMT, NULL_TREE); | |
668 | add_tree (r); | |
669 | if (has_no_scope) | |
670 | COMPOUND_STMT_NO_SCOPE (r) = 1; | |
671 | } | |
672 | else | |
673 | r = NULL_TREE; | |
674 | ||
675 | if (!has_no_scope) | |
676 | do_pushlevel (); | |
677 | ||
678 | return r; | |
679 | } | |
680 | ||
681 | ||
682 | /* Finish a compound-statement, which may be given by COMPOUND_STMT. | |
683 | If HAS_NO_SCOPE is non-zero, the compound statement does not define | |
684 | a scope. */ | |
685 | ||
686 | tree | |
687 | finish_compound_stmt (has_no_scope, compound_stmt) | |
688 | int has_no_scope; | |
689 | tree compound_stmt; | |
690 | { | |
691 | tree r; | |
692 | ||
693 | if (!has_no_scope) | |
694 | r = do_poplevel (); | |
695 | else | |
696 | r = NULL_TREE; | |
697 | ||
698 | if (processing_template_decl) | |
699 | RECHAIN_STMTS_FROM_CHAIN (compound_stmt, | |
700 | COMPOUND_BODY (compound_stmt)); | |
701 | ||
702 | finish_stmt (); | |
703 | ||
704 | return r; | |
705 | } | |
706 | ||
707 | /* Finish an asm-statement, whose components are a CV_QUALIFIER, a | |
708 | STRING, some OUTPUT_OPERANDS, some INPUT_OPERANDS, and some | |
709 | CLOBBERS. */ | |
710 | ||
711 | void | |
712 | finish_asm_stmt (cv_qualifier, string, output_operands, | |
713 | input_operands, clobbers) | |
714 | tree cv_qualifier; | |
715 | tree string; | |
716 | tree output_operands; | |
717 | tree input_operands; | |
718 | tree clobbers; | |
719 | { | |
720 | if (TREE_CHAIN (string)) | |
e6f1275f | 721 | string = combine_strings (string); |
ad321293 MM |
722 | |
723 | if (processing_template_decl) | |
724 | { | |
725 | tree r = build_min_nt (ASM_STMT, cv_qualifier, string, | |
726 | output_operands, input_operands, | |
727 | clobbers); | |
728 | add_tree (r); | |
729 | } | |
730 | else | |
731 | { | |
732 | emit_line_note (input_filename, lineno); | |
6e9438cf AG |
733 | if (output_operands != NULL_TREE || input_operands != NULL_TREE |
734 | || clobbers != NULL_TREE) | |
735 | { | |
736 | if (cv_qualifier != NULL_TREE | |
737 | && cv_qualifier != ridpointers[(int) RID_VOLATILE]) | |
738 | cp_warning ("%s qualifier ignored on asm", | |
739 | IDENTIFIER_POINTER (cv_qualifier)); | |
740 | ||
741 | c_expand_asm_operands (string, output_operands, | |
742 | input_operands, | |
743 | clobbers, | |
744 | cv_qualifier | |
745 | == ridpointers[(int) RID_VOLATILE], | |
746 | input_filename, lineno); | |
747 | } | |
748 | else | |
749 | { | |
ad236eab JM |
750 | /* Don't warn about redundant specification of 'volatile' here. */ |
751 | if (cv_qualifier != NULL_TREE | |
752 | && cv_qualifier != ridpointers[(int) RID_VOLATILE]) | |
6e9438cf AG |
753 | cp_warning ("%s qualifier ignored on asm", |
754 | IDENTIFIER_POINTER (cv_qualifier)); | |
755 | expand_asm (string); | |
756 | } | |
a64c757e | 757 | |
ad321293 MM |
758 | finish_stmt (); |
759 | } | |
760 | } | |
b4c4a9ec MM |
761 | |
762 | /* Finish a parenthesized expression EXPR. */ | |
763 | ||
764 | tree | |
765 | finish_parenthesized_expr (expr) | |
766 | tree expr; | |
767 | { | |
768 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expr)))) | |
769 | /* This inhibits warnings in truthvalue_conversion. */ | |
770 | C_SET_EXP_ORIGINAL_CODE (expr, ERROR_MARK); | |
771 | ||
772 | return expr; | |
773 | } | |
774 | ||
b69b1501 MM |
775 | /* Begin a statement-expression. The value returned must be passed to |
776 | finish_stmt_expr. */ | |
b4c4a9ec MM |
777 | |
778 | tree | |
779 | begin_stmt_expr () | |
780 | { | |
781 | keep_next_level (); | |
b69b1501 MM |
782 | /* If we're processing_template_decl, then the upcoming compound |
783 | statement will be chained onto the tree structure, starting at | |
784 | last_tree. We return last_tree so that we can later unhook the | |
785 | compound statement. */ | |
786 | return processing_template_decl ? last_tree : expand_start_stmt_expr(); | |
b4c4a9ec MM |
787 | } |
788 | ||
789 | /* Finish a statement-expression. RTL_EXPR should be the value | |
790 | returned by the previous begin_stmt_expr; EXPR is the | |
791 | statement-expression. Returns an expression representing the | |
792 | statement-expression. */ | |
793 | ||
794 | tree | |
795 | finish_stmt_expr (rtl_expr, expr) | |
796 | tree rtl_expr; | |
797 | tree expr; | |
798 | { | |
799 | tree result; | |
800 | ||
801 | if (!processing_template_decl) | |
802 | { | |
803 | rtl_expr = expand_end_stmt_expr (rtl_expr); | |
804 | /* The statements have side effects, so the group does. */ | |
805 | TREE_SIDE_EFFECTS (rtl_expr) = 1; | |
806 | } | |
807 | ||
808 | if (TREE_CODE (expr) == BLOCK) | |
809 | { | |
810 | /* Make a BIND_EXPR for the BLOCK already made. */ | |
811 | if (processing_template_decl) | |
61cd552e MM |
812 | result = build_min_nt (BIND_EXPR, NULL_TREE, last_tree, |
813 | NULL_TREE); | |
b4c4a9ec MM |
814 | else |
815 | result = build (BIND_EXPR, TREE_TYPE (rtl_expr), | |
816 | NULL_TREE, rtl_expr, expr); | |
817 | ||
818 | /* Remove the block from the tree at this point. | |
819 | It gets put back at the proper place | |
820 | when the BIND_EXPR is expanded. */ | |
821 | delete_block (expr); | |
822 | } | |
823 | else | |
824 | result = expr; | |
b69b1501 MM |
825 | |
826 | if (processing_template_decl) | |
827 | { | |
828 | /* Remove the compound statement from the tree structure; it is | |
829 | now saved in the BIND_EXPR. */ | |
830 | last_tree = rtl_expr; | |
831 | TREE_CHAIN (last_tree) = NULL_TREE; | |
832 | } | |
b4c4a9ec MM |
833 | |
834 | return result; | |
835 | } | |
836 | ||
837 | /* Finish a call to FN with ARGS. Returns a representation of the | |
838 | call. */ | |
839 | ||
840 | tree | |
a759e627 | 841 | finish_call_expr (fn, args, koenig) |
b4c4a9ec MM |
842 | tree fn; |
843 | tree args; | |
a759e627 | 844 | int koenig; |
b4c4a9ec | 845 | { |
a759e627 ML |
846 | tree result; |
847 | ||
848 | if (koenig) | |
03d82991 JM |
849 | { |
850 | if (TREE_CODE (fn) == BIT_NOT_EXPR) | |
851 | fn = build_x_unary_op (BIT_NOT_EXPR, TREE_OPERAND (fn, 0)); | |
852 | else if (TREE_CODE (fn) != TEMPLATE_ID_EXPR) | |
e13a4123 | 853 | fn = do_identifier (fn, 2, args); |
03d82991 | 854 | } |
a759e627 | 855 | result = build_x_function_call (fn, args, current_class_ref); |
b4c4a9ec MM |
856 | |
857 | if (TREE_CODE (result) == CALL_EXPR | |
66543169 NS |
858 | && (! TREE_TYPE (result) |
859 | || TREE_CODE (TREE_TYPE (result)) != VOID_TYPE)) | |
b4c4a9ec MM |
860 | result = require_complete_type (result); |
861 | ||
862 | return result; | |
863 | } | |
864 | ||
865 | /* Finish a call to a postfix increment or decrement or EXPR. (Which | |
866 | is indicated by CODE, which should be POSTINCREMENT_EXPR or | |
867 | POSTDECREMENT_EXPR.) */ | |
868 | ||
869 | tree | |
870 | finish_increment_expr (expr, code) | |
871 | tree expr; | |
872 | enum tree_code code; | |
873 | { | |
874 | /* If we get an OFFSET_REF, turn it into what it really means (e.g., | |
875 | a COMPONENT_REF). This way if we've got, say, a reference to a | |
876 | static member that's being operated on, we don't end up trying to | |
877 | find a member operator for the class it's in. */ | |
878 | ||
879 | if (TREE_CODE (expr) == OFFSET_REF) | |
880 | expr = resolve_offset_ref (expr); | |
881 | return build_x_unary_op (code, expr); | |
882 | } | |
883 | ||
884 | /* Finish a use of `this'. Returns an expression for `this'. */ | |
885 | ||
886 | tree | |
887 | finish_this_expr () | |
888 | { | |
889 | tree result; | |
890 | ||
891 | if (current_class_ptr) | |
892 | { | |
893 | #ifdef WARNING_ABOUT_CCD | |
894 | TREE_USED (current_class_ptr) = 1; | |
895 | #endif | |
896 | result = current_class_ptr; | |
897 | } | |
898 | else if (current_function_decl | |
899 | && DECL_STATIC_FUNCTION_P (current_function_decl)) | |
900 | { | |
8251199e | 901 | error ("`this' is unavailable for static member functions"); |
b4c4a9ec MM |
902 | result = error_mark_node; |
903 | } | |
904 | else | |
905 | { | |
906 | if (current_function_decl) | |
8251199e | 907 | error ("invalid use of `this' in non-member function"); |
b4c4a9ec | 908 | else |
8251199e | 909 | error ("invalid use of `this' at top level"); |
b4c4a9ec MM |
910 | result = error_mark_node; |
911 | } | |
912 | ||
913 | return result; | |
914 | } | |
915 | ||
916 | /* Finish a member function call using OBJECT and ARGS as arguments to | |
917 | FN. Returns an expression for the call. */ | |
918 | ||
919 | tree | |
920 | finish_object_call_expr (fn, object, args) | |
921 | tree fn; | |
922 | tree object; | |
923 | tree args; | |
924 | { | |
925 | #if 0 | |
926 | /* This is a future direction of this code, but because | |
927 | build_x_function_call cannot always undo what is done in | |
928 | build_component_ref entirely yet, we cannot do this. */ | |
929 | ||
930 | tree real_fn = build_component_ref (object, fn, NULL_TREE, 1); | |
931 | return finish_call_expr (real_fn, args); | |
932 | #else | |
c68c56f7 MM |
933 | if (TREE_CODE (fn) == TYPE_DECL) |
934 | { | |
935 | if (processing_template_decl) | |
936 | /* This can happen on code like: | |
937 | ||
938 | class X; | |
939 | template <class T> void f(T t) { | |
940 | t.X(); | |
941 | } | |
942 | ||
943 | We just grab the underlying IDENTIFIER. */ | |
944 | fn = DECL_NAME (fn); | |
945 | else | |
946 | { | |
8251199e | 947 | cp_error ("calling type `%T' like a method", fn); |
c68c56f7 MM |
948 | return error_mark_node; |
949 | } | |
950 | } | |
951 | ||
b4c4a9ec MM |
952 | return build_method_call (object, fn, args, NULL_TREE, LOOKUP_NORMAL); |
953 | #endif | |
954 | } | |
955 | ||
956 | /* Finish a qualified member function call using OBJECT and ARGS as | |
957 | arguments to FN. Returns an expressino for the call. */ | |
958 | ||
959 | tree | |
960 | finish_qualified_object_call_expr (fn, object, args) | |
961 | tree fn; | |
962 | tree object; | |
963 | tree args; | |
964 | { | |
965 | if (IS_SIGNATURE (TREE_OPERAND (fn, 0))) | |
966 | { | |
8251199e | 967 | warning ("signature name in scope resolution ignored"); |
b4c4a9ec MM |
968 | return finish_object_call_expr (TREE_OPERAND (fn, 1), object, args); |
969 | } | |
970 | else | |
971 | return build_scoped_method_call (object, TREE_OPERAND (fn, 0), | |
972 | TREE_OPERAND (fn, 1), args); | |
973 | } | |
974 | ||
975 | /* Finish a pseudo-destructor call expression of OBJECT, with SCOPE | |
976 | being the scope, if any, of DESTRUCTOR. Returns an expression for | |
977 | the call. */ | |
978 | ||
979 | tree | |
980 | finish_pseudo_destructor_call_expr (object, scope, destructor) | |
981 | tree object; | |
982 | tree scope; | |
983 | tree destructor; | |
984 | { | |
985 | if (scope && scope != destructor) | |
8251199e | 986 | cp_error ("destructor specifier `%T::~%T()' must have matching names", |
b4c4a9ec MM |
987 | scope, destructor); |
988 | ||
989 | if ((scope == NULL_TREE || IDENTIFIER_GLOBAL_VALUE (destructor)) | |
990 | && (TREE_CODE (TREE_TYPE (object)) != | |
991 | TREE_CODE (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (destructor))))) | |
8251199e | 992 | cp_error ("`%E' is not of type `%T'", object, destructor); |
b4c4a9ec MM |
993 | |
994 | return cp_convert (void_type_node, object); | |
995 | } | |
996 | ||
997 | /* Finish a call to a globally qualified member function FN using | |
998 | ARGS. Returns an expression for the call. */ | |
999 | ||
1000 | tree | |
75d587eb | 1001 | finish_qualified_call_expr (fn, args) |
b4c4a9ec MM |
1002 | tree fn; |
1003 | tree args; | |
1004 | { | |
1005 | if (processing_template_decl) | |
1006 | return build_min_nt (CALL_EXPR, copy_to_permanent (fn), args, | |
1007 | NULL_TREE); | |
1008 | else | |
1009 | return build_member_call (TREE_OPERAND (fn, 0), | |
1010 | TREE_OPERAND (fn, 1), | |
1011 | args); | |
1012 | } | |
1013 | ||
1014 | /* Finish an expression taking the address of LABEL. Returns an | |
1015 | expression for the address. */ | |
1016 | ||
1017 | tree | |
1018 | finish_label_address_expr (label) | |
1019 | tree label; | |
1020 | { | |
1021 | tree result; | |
1022 | ||
1023 | label = lookup_label (label); | |
1024 | if (label == NULL_TREE) | |
1025 | result = null_pointer_node; | |
1026 | else | |
1027 | { | |
1028 | TREE_USED (label) = 1; | |
1029 | result = build1 (ADDR_EXPR, ptr_type_node, label); | |
1030 | TREE_CONSTANT (result) = 1; | |
1031 | } | |
1032 | ||
1033 | return result; | |
1034 | } | |
1035 | ||
ce4a0391 MM |
1036 | /* Finish an expression of the form CODE EXPR. */ |
1037 | ||
1038 | tree | |
1039 | finish_unary_op_expr (code, expr) | |
1040 | enum tree_code code; | |
1041 | tree expr; | |
1042 | { | |
1043 | tree result = build_x_unary_op (code, expr); | |
1044 | if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST) | |
1045 | TREE_NEGATED_INT (result) = 1; | |
1046 | overflow_warning (result); | |
1047 | return result; | |
1048 | } | |
1049 | ||
1050 | /* Finish an id-expression. */ | |
1051 | ||
1052 | tree | |
1053 | finish_id_expr (expr) | |
1054 | tree expr; | |
1055 | { | |
1056 | if (TREE_CODE (expr) == IDENTIFIER_NODE) | |
a759e627 | 1057 | expr = do_identifier (expr, 1, NULL_TREE); |
ce4a0391 MM |
1058 | |
1059 | return expr; | |
1060 | } | |
1061 | ||
1062 | /* Begin a new-placement. */ | |
1063 | ||
1064 | int | |
1065 | begin_new_placement () | |
1066 | { | |
1067 | /* The arguments to a placement new might be passed to a | |
1068 | deallocation function, in the event that the allocation throws an | |
1069 | exception. Since we don't expand exception handlers until the | |
1070 | end of a function, we must make sure the arguments stay around | |
1071 | that long. */ | |
1072 | return suspend_momentary (); | |
1073 | } | |
1074 | ||
1075 | /* Finish a new-placement. The ARGS are the placement arguments. The | |
1076 | COOKIE is the value returned by the previous call to | |
1077 | begin_new_placement. */ | |
1078 | ||
1079 | tree | |
1080 | finish_new_placement (args, cookie) | |
1081 | tree args; | |
1082 | int cookie; | |
1083 | { | |
1084 | resume_momentary (cookie); | |
1085 | return args; | |
1086 | } | |
1087 | ||
b4c4a9ec MM |
1088 | /* Begin a function defniition declared with DECL_SPECS and |
1089 | DECLARATOR. Returns non-zero if the function-declaration is | |
1090 | legal. */ | |
1091 | ||
1092 | int | |
1093 | begin_function_definition (decl_specs, declarator) | |
1094 | tree decl_specs; | |
1095 | tree declarator; | |
1096 | { | |
1097 | tree specs; | |
1098 | tree attrs; | |
1099 | split_specs_attrs (decl_specs, &specs, &attrs); | |
1100 | if (!start_function (specs, declarator, attrs, 0)) | |
1101 | return 0; | |
1102 | ||
1103 | reinit_parse_for_function (); | |
39c01e4c MM |
1104 | /* The things we're about to see are not directly qualified by any |
1105 | template headers we've seen thus far. */ | |
1106 | reset_specialization (); | |
1107 | ||
b4c4a9ec MM |
1108 | return 1; |
1109 | } | |
1110 | ||
1111 | /* Begin a constructor declarator of the form `SCOPE::NAME'. Returns | |
1112 | a SCOPE_REF. */ | |
1113 | ||
1114 | tree | |
1115 | begin_constructor_declarator (scope, name) | |
1116 | tree scope; | |
1117 | tree name; | |
1118 | { | |
1119 | tree result = build_parse_node (SCOPE_REF, scope, name); | |
830fcda8 | 1120 | enter_scope_of (result); |
b4c4a9ec MM |
1121 | return result; |
1122 | } | |
1123 | ||
ce4a0391 MM |
1124 | /* Finish an init-declarator. Returns a DECL. */ |
1125 | ||
1126 | tree | |
1127 | finish_declarator (declarator, declspecs, attributes, | |
1128 | prefix_attributes, initialized) | |
1129 | tree declarator; | |
1130 | tree declspecs; | |
1131 | tree attributes; | |
1132 | tree prefix_attributes; | |
1133 | int initialized; | |
1134 | { | |
1135 | return start_decl (declarator, declspecs, initialized, attributes, | |
1136 | prefix_attributes); | |
1137 | } | |
1138 | ||
8014a339 | 1139 | /* Finish a translation unit. */ |
ce4a0391 MM |
1140 | |
1141 | void | |
1142 | finish_translation_unit () | |
1143 | { | |
1144 | /* In case there were missing closebraces, | |
1145 | get us back to the global binding level. */ | |
1146 | while (! toplevel_bindings_p ()) | |
1147 | poplevel (0, 0, 0); | |
1148 | while (current_namespace != global_namespace) | |
1149 | pop_namespace (); | |
1150 | finish_file (); | |
1151 | } | |
1152 | ||
b4c4a9ec MM |
1153 | /* Finish a template type parameter, specified as AGGR IDENTIFIER. |
1154 | Returns the parameter. */ | |
1155 | ||
1156 | tree | |
1157 | finish_template_type_parm (aggr, identifier) | |
1158 | tree aggr; | |
1159 | tree identifier; | |
1160 | { | |
1161 | if (aggr == signature_type_node) | |
1162 | sorry ("signature as template type parameter"); | |
1163 | else if (aggr != class_type_node) | |
1164 | { | |
8251199e | 1165 | pedwarn ("template type parameters must use the keyword `class' or `typename'"); |
b4c4a9ec MM |
1166 | aggr = class_type_node; |
1167 | } | |
1168 | ||
1169 | return build_tree_list (aggr, identifier); | |
1170 | } | |
1171 | ||
1172 | /* Finish a template template parameter, specified as AGGR IDENTIFIER. | |
1173 | Returns the parameter. */ | |
1174 | ||
1175 | tree | |
1176 | finish_template_template_parm (aggr, identifier) | |
1177 | tree aggr; | |
1178 | tree identifier; | |
1179 | { | |
1180 | tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE); | |
1181 | tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE); | |
1182 | DECL_TEMPLATE_PARMS (tmpl) = current_template_parms; | |
1183 | DECL_TEMPLATE_RESULT (tmpl) = decl; | |
1184 | SET_DECL_ARTIFICIAL (decl); | |
1185 | end_template_decl (); | |
1186 | ||
1187 | return finish_template_type_parm (aggr, tmpl); | |
1188 | } | |
ce4a0391 MM |
1189 | |
1190 | /* Finish a parameter list, indicated by PARMS. If ELLIPSIS is | |
1191 | non-zero, the parameter list was terminated by a `...'. */ | |
1192 | ||
1193 | tree | |
1194 | finish_parmlist (parms, ellipsis) | |
1195 | tree parms; | |
1196 | int ellipsis; | |
1197 | { | |
1198 | if (!ellipsis) | |
1199 | chainon (parms, void_list_node); | |
1200 | /* We mark the PARMS as a parmlist so that declarator processing can | |
1201 | disambiguate certain constructs. */ | |
1202 | if (parms != NULL_TREE) | |
1203 | TREE_PARMLIST (parms) = 1; | |
1204 | ||
1205 | return parms; | |
1206 | } | |
1207 | ||
1208 | /* Begin a class definition, as indicated by T. */ | |
1209 | ||
1210 | tree | |
1211 | begin_class_definition (t) | |
1212 | tree t; | |
1213 | { | |
ce4a0391 MM |
1214 | push_obstacks_nochange (); |
1215 | end_temporary_allocation (); | |
1216 | ||
1217 | if (t == error_mark_node | |
1218 | || ! IS_AGGR_TYPE (t)) | |
1219 | { | |
830fcda8 | 1220 | t = make_lang_type (RECORD_TYPE); |
ce4a0391 MM |
1221 | pushtag (make_anon_name (), t, 0); |
1222 | } | |
830fcda8 JM |
1223 | |
1224 | /* In a definition of a member class template, we will get here with an | |
1225 | implicit typename, a TYPENAME_TYPE with a type. */ | |
1226 | if (TREE_CODE (t) == TYPENAME_TYPE) | |
1227 | t = TREE_TYPE (t); | |
4c571114 MM |
1228 | |
1229 | /* If we generated a partial instantiation of this type, but now | |
1230 | we're seeing a real definition, we're actually looking at a | |
1231 | partial specialization. Consider: | |
1232 | ||
1233 | template <class T, class U> | |
1234 | struct Y {}; | |
1235 | ||
1236 | template <class T> | |
1237 | struct X {}; | |
1238 | ||
1239 | template <class T, class U> | |
1240 | void f() | |
1241 | { | |
1242 | typename X<Y<T, U> >::A a; | |
1243 | } | |
1244 | ||
1245 | template <class T, class U> | |
1246 | struct X<Y<T, U> > | |
1247 | { | |
1248 | }; | |
1249 | ||
1250 | We have to undo the effects of the previous partial | |
1251 | instantiation. */ | |
1252 | if (PARTIAL_INSTANTIATION_P (t)) | |
1253 | { | |
1254 | if (!pedantic) | |
1255 | { | |
1256 | /* Unfortunately, when we're not in pedantic mode, we | |
1257 | attempt to actually fill in some of the fields of the | |
1258 | partial instantiation, in order to support the implicit | |
1259 | typename extension. Clear those fields now, in | |
1260 | preparation for the definition here. The fields cleared | |
1261 | here must match those set in instantiate_class_template. | |
1262 | Look for a comment mentioning begin_class_definition | |
1263 | there. */ | |
1264 | TYPE_BINFO_BASETYPES (t) = NULL_TREE; | |
1265 | TYPE_FIELDS (t) = NULL_TREE; | |
1266 | TYPE_METHODS (t) = NULL_TREE; | |
1267 | CLASSTYPE_TAGS (t) = NULL_TREE; | |
1268 | TYPE_SIZE (t) = NULL_TREE; | |
1269 | } | |
830fcda8 | 1270 | |
4c571114 MM |
1271 | /* This isn't a partial instantiation any more. */ |
1272 | PARTIAL_INSTANTIATION_P (t) = 0; | |
1273 | } | |
1274 | /* If this type was already complete, and we see another definition, | |
1275 | that's an error. */ | |
1276 | else if (TYPE_SIZE (t)) | |
ce4a0391 | 1277 | duplicate_tag_error (t); |
4c571114 MM |
1278 | |
1279 | if (TYPE_BEING_DEFINED (t)) | |
ce4a0391 MM |
1280 | { |
1281 | t = make_lang_type (TREE_CODE (t)); | |
1282 | pushtag (TYPE_IDENTIFIER (t), t, 0); | |
ce4a0391 | 1283 | } |
ff350acd JM |
1284 | maybe_process_partial_specialization (t); |
1285 | if (processing_template_decl | |
1286 | && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (t) | |
1287 | && TYPE_CONTEXT (t) && TYPE_P (TYPE_CONTEXT (t)) | |
ce4a0391 MM |
1288 | && ! current_class_type) |
1289 | push_template_decl (TYPE_STUB_DECL (t)); | |
1290 | pushclass (t, 0); | |
1291 | TYPE_BEING_DEFINED (t) = 1; | |
ce4a0391 MM |
1292 | /* Reset the interface data, at the earliest possible |
1293 | moment, as it might have been set via a class foo; | |
1294 | before. */ | |
1295 | /* Don't change signatures. */ | |
1296 | if (! IS_SIGNATURE (t)) | |
1297 | { | |
ce4a0391 MM |
1298 | int needs_writing; |
1299 | tree name = TYPE_IDENTIFIER (t); | |
1300 | ||
1301 | if (! ANON_AGGRNAME_P (name)) | |
1302 | { | |
1303 | CLASSTYPE_INTERFACE_ONLY (t) = interface_only; | |
1304 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X | |
1305 | (t, interface_unknown); | |
1306 | } | |
1307 | ||
1308 | /* Record how to set the access of this class's | |
56ae6d77 | 1309 | virtual functions. If write_virtuals == 3, then |
ce4a0391 | 1310 | inline virtuals are ``extern inline''. */ |
56ae6d77 JM |
1311 | if (write_virtuals == 3) |
1312 | needs_writing = ! CLASSTYPE_INTERFACE_ONLY (t) | |
1313 | && CLASSTYPE_INTERFACE_KNOWN (t); | |
1314 | else | |
1315 | needs_writing = 1; | |
ce4a0391 MM |
1316 | CLASSTYPE_VTABLE_NEEDS_WRITING (t) = needs_writing; |
1317 | } | |
1318 | #if 0 | |
830fcda8 JM |
1319 | tmp = TYPE_IDENTIFIER ($<ttype>0); |
1320 | if (tmp && IDENTIFIER_TEMPLATE (tmp)) | |
1321 | overload_template_name (tmp, 1); | |
ce4a0391 MM |
1322 | #endif |
1323 | reset_specialization(); | |
1324 | ||
1325 | /* In case this is a local class within a template | |
1326 | function, we save the current tree structure so | |
1327 | that we can get it back later. */ | |
1328 | begin_tree (); | |
1329 | ||
830fcda8 | 1330 | return t; |
ce4a0391 MM |
1331 | } |
1332 | ||
61a127b3 MM |
1333 | /* Finish the member declaration given by DECL. */ |
1334 | ||
1335 | void | |
1336 | finish_member_declaration (decl) | |
1337 | tree decl; | |
1338 | { | |
1339 | if (decl == error_mark_node || decl == NULL_TREE) | |
1340 | return; | |
1341 | ||
1342 | if (decl == void_type_node) | |
1343 | /* The COMPONENT was a friend, not a member, and so there's | |
1344 | nothing for us to do. */ | |
1345 | return; | |
1346 | ||
1347 | /* We should see only one DECL at a time. */ | |
1348 | my_friendly_assert (TREE_CHAIN (decl) == NULL_TREE, 0); | |
1349 | ||
1350 | /* Set up access control for DECL. */ | |
1351 | TREE_PRIVATE (decl) | |
1352 | = (current_access_specifier == access_private_node); | |
1353 | TREE_PROTECTED (decl) | |
1354 | = (current_access_specifier == access_protected_node); | |
1355 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
1356 | { | |
1357 | TREE_PRIVATE (DECL_RESULT (decl)) = TREE_PRIVATE (decl); | |
1358 | TREE_PROTECTED (DECL_RESULT (decl)) = TREE_PROTECTED (decl); | |
1359 | } | |
1360 | ||
1361 | /* Mark the DECL as a member of the current class. */ | |
1362 | if (TREE_CODE (decl) == FUNCTION_DECL | |
1363 | || DECL_FUNCTION_TEMPLATE_P (decl)) | |
1364 | /* Historically, DECL_CONTEXT was not set for a FUNCTION_DECL in | |
1365 | finish_struct. Presumably it is already set as the function is | |
1366 | parsed. Perhaps DECL_CLASS_CONTEXT is already set, too? */ | |
1367 | DECL_CLASS_CONTEXT (decl) = current_class_type; | |
1368 | else if (TREE_CODE (decl) == TYPE_DECL) | |
1369 | /* Historically, DECL_CONTEXT was not set for a TYPE_DECL in | |
1370 | finish_struct, so we do not do it here either. Perhaps we | |
1371 | should, though. */ | |
1372 | ; | |
1373 | else | |
1374 | DECL_CONTEXT (decl) = current_class_type; | |
1375 | ||
1376 | /* Put functions on the TYPE_METHODS list and everything else on the | |
1377 | TYPE_FIELDS list. Note that these are built up in reverse order. | |
1378 | We reverse them (to obtain declaration order) in finish_struct. */ | |
1379 | if (TREE_CODE (decl) == FUNCTION_DECL | |
1380 | || DECL_FUNCTION_TEMPLATE_P (decl)) | |
1381 | { | |
1382 | /* We also need to add this function to the | |
1383 | CLASSTYPE_METHOD_VEC. */ | |
1384 | add_method (current_class_type, 0, decl); | |
1385 | ||
1386 | TREE_CHAIN (decl) = TYPE_METHODS (current_class_type); | |
1387 | TYPE_METHODS (current_class_type) = decl; | |
1388 | } | |
1389 | else | |
1390 | { | |
1391 | /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields | |
1392 | go at the beginning. The reason is that lookup_field_1 | |
1393 | searches the list in order, and we want a field name to | |
1394 | override a type name so that the "struct stat hack" will | |
1395 | work. In particular: | |
1396 | ||
1397 | struct S { enum E { }; int E } s; | |
1398 | s.E = 3; | |
1399 | ||
1400 | is legal. In addition, the FIELD_DECLs must be maintained in | |
1401 | declaration order so that class layout works as expected. | |
1402 | However, we don't need that order until class layout, so we | |
1403 | save a little time by putting FIELD_DECLs on in reverse order | |
1404 | here, and then reversing them in finish_struct_1. (We could | |
1405 | also keep a pointer to the correct insertion points in the | |
1406 | list.) */ | |
1407 | ||
1408 | if (TREE_CODE (decl) == TYPE_DECL) | |
1409 | TYPE_FIELDS (current_class_type) | |
1410 | = chainon (TYPE_FIELDS (current_class_type), decl); | |
1411 | else | |
1412 | { | |
1413 | TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type); | |
1414 | TYPE_FIELDS (current_class_type) = decl; | |
1415 | } | |
1416 | } | |
1417 | } | |
1418 | ||
1419 | /* Finish a class definition T with the indicate ATTRIBUTES. If SEMI, | |
1420 | the definition is immediately followed by a semicolon. Returns the | |
1421 | type. */ | |
ce4a0391 MM |
1422 | |
1423 | tree | |
61a127b3 | 1424 | finish_class_definition (t, attributes, semi) |
ce4a0391 | 1425 | tree t; |
ce4a0391 MM |
1426 | tree attributes; |
1427 | int semi; | |
1428 | { | |
1429 | #if 0 | |
1430 | /* Need to rework class nesting in the presence of nested classes, | |
1431 | etc. */ | |
1432 | shadow_tag (CLASSTYPE_AS_LIST (t)); */ | |
1433 | #endif | |
1434 | ||
1435 | /* finish_struct nukes this anyway; if finish_exception does too, | |
1436 | then it can go. */ | |
1437 | if (semi) | |
1438 | note_got_semicolon (t); | |
1439 | ||
dc8263bc JM |
1440 | /* If we got any attributes in class_head, xref_tag will stick them in |
1441 | TREE_TYPE of the type. Grab them now. */ | |
1442 | attributes = chainon (TREE_TYPE (t), attributes); | |
1443 | TREE_TYPE (t) = NULL_TREE; | |
1444 | ||
ce4a0391 MM |
1445 | if (TREE_CODE (t) == ENUMERAL_TYPE) |
1446 | ; | |
1447 | else | |
1448 | { | |
61a127b3 | 1449 | t = finish_struct (t, attributes, semi); |
ce4a0391 MM |
1450 | if (semi) |
1451 | note_got_semicolon (t); | |
1452 | } | |
1453 | ||
1454 | pop_obstacks (); | |
1455 | ||
1456 | if (! semi) | |
1457 | check_for_missing_semicolon (t); | |
1458 | if (current_scope () == current_function_decl) | |
1459 | do_pending_defargs (); | |
1460 | ||
1461 | return t; | |
1462 | } | |
1463 | ||
1464 | /* Finish processing the default argument expressions cached during | |
1465 | the processing of a class definition. */ | |
1466 | ||
1467 | void | |
1468 | finish_default_args () | |
1469 | { | |
1470 | if (pending_inlines | |
1471 | && current_scope () == current_function_decl) | |
1472 | do_pending_inlines (); | |
1473 | } | |
1474 | ||
1475 | /* Finish processing the inline function definitions cached during the | |
1476 | processing of a class definition. */ | |
1477 | ||
1478 | void | |
1479 | begin_inline_definitions () | |
1480 | { | |
1481 | if (current_class_type == NULL_TREE) | |
1482 | clear_inline_text_obstack (); | |
1483 | ||
1484 | /* Undo the begin_tree in begin_class_definition. */ | |
1485 | end_tree (); | |
1486 | } | |
35acd3f2 MM |
1487 | |
1488 | /* Finish processing the declaration of a member class template | |
1489 | TYPES whose template parameters are given by PARMS. */ | |
1490 | ||
1491 | tree | |
61a127b3 | 1492 | finish_member_class_template (types) |
35acd3f2 MM |
1493 | tree types; |
1494 | { | |
36a117a5 MM |
1495 | tree t; |
1496 | ||
1497 | /* If there are declared, but undefined, partial specializations | |
1498 | mixed in with the typespecs they will not yet have passed through | |
1499 | maybe_process_partial_specialization, so we do that here. */ | |
1500 | for (t = types; t != NULL_TREE; t = TREE_CHAIN (t)) | |
1501 | if (IS_AGGR_TYPE_CODE (TREE_CODE (TREE_VALUE (t)))) | |
1502 | maybe_process_partial_specialization (TREE_VALUE (t)); | |
1503 | ||
35acd3f2 | 1504 | note_list_got_semicolon (types); |
61a127b3 | 1505 | grok_x_components (types); |
35acd3f2 MM |
1506 | if (TYPE_CONTEXT (TREE_VALUE (types)) != current_class_type) |
1507 | /* The component was in fact a friend declaration. We avoid | |
1508 | finish_member_template_decl performing certain checks by | |
1509 | unsetting TYPES. */ | |
1510 | types = NULL_TREE; | |
61a127b3 MM |
1511 | |
1512 | finish_member_template_decl (types); | |
1513 | ||
35acd3f2 MM |
1514 | /* As with other component type declarations, we do |
1515 | not store the new DECL on the list of | |
1516 | component_decls. */ | |
1517 | return NULL_TREE; | |
1518 | } | |
36a117a5 MM |
1519 | |
1520 | /* Finish processsing a complete template declaration. The PARMS are | |
1521 | the template parameters. */ | |
1522 | ||
1523 | void | |
1524 | finish_template_decl (parms) | |
1525 | tree parms; | |
1526 | { | |
1527 | if (parms) | |
1528 | end_template_decl (); | |
1529 | else | |
1530 | end_specialization (); | |
1531 | } | |
1532 | ||
1533 | /* Finish processing a a template-id (which names a type) of the form | |
1534 | NAME < ARGS >. Return the TYPE_DECL for the type named by the | |
1535 | template-id. If ENTERING_SCOPE is non-zero we are about to enter | |
1536 | the scope of template-id indicated. */ | |
1537 | ||
1538 | tree | |
1539 | finish_template_type (name, args, entering_scope) | |
1540 | tree name; | |
1541 | tree args; | |
1542 | int entering_scope; | |
1543 | { | |
1544 | tree decl; | |
1545 | ||
1546 | decl = lookup_template_class (name, args, | |
1547 | NULL_TREE, NULL_TREE, entering_scope); | |
1548 | if (decl != error_mark_node) | |
1549 | decl = TYPE_STUB_DECL (decl); | |
1550 | ||
1551 | return decl; | |
1552 | } | |
648f19f6 MM |
1553 | |
1554 | /* SR is a SCOPE_REF node. Enter the scope of SR, whether it is a | |
1555 | namespace scope or a class scope. */ | |
1556 | ||
1557 | void | |
1558 | enter_scope_of (sr) | |
1559 | tree sr; | |
1560 | { | |
1561 | tree scope = TREE_OPERAND (sr, 0); | |
1562 | ||
1563 | if (TREE_CODE (scope) == NAMESPACE_DECL) | |
1564 | { | |
1565 | push_decl_namespace (scope); | |
1566 | TREE_COMPLEXITY (sr) = -1; | |
1567 | } | |
1568 | else if (scope != current_class_type) | |
1569 | { | |
830fcda8 JM |
1570 | if (TREE_CODE (scope) == TYPENAME_TYPE) |
1571 | { | |
1572 | /* In a declarator for a template class member, the scope will | |
1573 | get here as an implicit typename, a TYPENAME_TYPE with a type. */ | |
1574 | scope = TREE_TYPE (scope); | |
1575 | TREE_OPERAND (sr, 0) = scope; | |
1576 | } | |
648f19f6 MM |
1577 | push_nested_class (scope, 3); |
1578 | TREE_COMPLEXITY (sr) = current_class_depth; | |
1579 | } | |
1580 | } | |
ea6021e8 MM |
1581 | |
1582 | /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER. | |
1583 | Return a TREE_LIST containing the ACCESS_SPECIFIER and the | |
1584 | BASE_CLASS, or NULL_TREE if an error occurred. The | |
1585 | ACCESSS_SPECIFIER is one of | |
1586 | access_{default,public,protected_private}[_virtual]_node.*/ | |
1587 | ||
1588 | tree | |
1589 | finish_base_specifier (access_specifier, base_class, | |
1590 | current_aggr_is_signature) | |
1591 | tree access_specifier; | |
1592 | tree base_class; | |
1593 | int current_aggr_is_signature; | |
1594 | { | |
1595 | tree type; | |
1596 | tree result; | |
1597 | ||
1598 | if (base_class == NULL_TREE) | |
1599 | { | |
8251199e | 1600 | error ("invalid base class"); |
ea6021e8 MM |
1601 | type = error_mark_node; |
1602 | } | |
1603 | else | |
1604 | type = TREE_TYPE (base_class); | |
1605 | if (current_aggr_is_signature && access_specifier) | |
8251199e | 1606 | error ("access and source specifiers not allowed in signature"); |
ea6021e8 MM |
1607 | if (! is_aggr_type (type, 1)) |
1608 | result = NULL_TREE; | |
1609 | else if (current_aggr_is_signature | |
1610 | && (! type) && (! IS_SIGNATURE (type))) | |
1611 | { | |
8251199e | 1612 | error ("class name not allowed as base signature"); |
ea6021e8 MM |
1613 | result = NULL_TREE; |
1614 | } | |
1615 | else if (current_aggr_is_signature) | |
1616 | { | |
1617 | sorry ("signature inheritance, base type `%s' ignored", | |
1618 | IDENTIFIER_POINTER (access_specifier)); | |
1619 | result = build_tree_list (access_public_node, type); | |
1620 | } | |
1621 | else if (type && IS_SIGNATURE (type)) | |
1622 | { | |
8251199e | 1623 | error ("signature name not allowed as base class"); |
ea6021e8 MM |
1624 | result = NULL_TREE; |
1625 | } | |
1626 | else | |
1627 | result = build_tree_list (access_specifier, type); | |
1628 | ||
1629 | return result; | |
1630 | } | |
61a127b3 MM |
1631 | |
1632 | /* Called when multiple declarators are processed. If that is not | |
1633 | premitted in this context, an error is issued. */ | |
1634 | ||
1635 | void | |
1636 | check_multiple_declarators () | |
1637 | { | |
1638 | /* [temp] | |
1639 | ||
1640 | In a template-declaration, explicit specialization, or explicit | |
1641 | instantiation the init-declarator-list in the declaration shall | |
1642 | contain at most one declarator. | |
1643 | ||
1644 | We don't just use PROCESSING_TEMPLATE_DECL for the first | |
1645 | condition since that would disallow the perfectly legal code, | |
1646 | like `template <class T> struct S { int i, j; };'. */ | |
1647 | tree scope = current_scope (); | |
1648 | ||
1649 | if (scope && TREE_CODE (scope) == FUNCTION_DECL) | |
1650 | /* It's OK to write `template <class T> void f() { int i, j;}'. */ | |
1651 | return; | |
1652 | ||
1653 | if (PROCESSING_REAL_TEMPLATE_DECL_P () | |
1654 | || processing_explicit_instantiation | |
1655 | || processing_specialization) | |
1656 | cp_error ("multiple declarators in template declaration"); | |
1657 | } | |
1658 | ||
b894fc05 JM |
1659 | tree |
1660 | finish_typeof (expr) | |
1661 | tree expr; | |
1662 | { | |
1663 | if (processing_template_decl) | |
1664 | { | |
1665 | tree t; | |
1666 | ||
1667 | push_obstacks_nochange (); | |
1668 | end_temporary_allocation (); | |
1669 | ||
1670 | t = make_lang_type (TYPEOF_TYPE); | |
b894fc05 JM |
1671 | TYPE_FIELDS (t) = expr; |
1672 | ||
1673 | pop_obstacks (); | |
1674 | ||
1675 | return t; | |
1676 | } | |
1677 | ||
1678 | return TREE_TYPE (expr); | |
1679 | } |