1 /* Code translation -- generate GCC trees from gfc_code.
2 Copyright (C) 2002, 2003, 2004 Free Software Foundation, Inc.
3 Contributed by Paul Brook
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
26 #include "tree-gimple.h"
36 #include "trans-stmt.h"
37 #include "trans-array.h"
38 #include "trans-types.h"
39 #include "trans-const.h"
41 /* Naming convention for backend interface code:
43 gfc_trans_* translate gfc_code into STMT trees.
45 gfc_conv_* expression conversion
47 gfc_get_* get a backend tree representation of a decl or type */
49 static gfc_file *gfc_current_backend_file;
52 /* Advance along TREE_CHAIN n times. */
55 gfc_advance_chain (tree t, int n)
59 assert (t != NULL_TREE);
66 /* Wrap a node in a TREE_LIST node and add it to the end of a list. */
69 gfc_chainon_list (tree list, tree add)
73 l = tree_cons (NULL_TREE, add, NULL_TREE);
75 return chainon (list, l);
79 /* Strip off a legitimate source ending from the input
80 string NAME of length LEN. */
83 remove_suffix (char *name, int len)
87 for (i = 2; i < 8 && len > i; i++)
89 if (name[len - i] == '.')
98 /* Creates a variable declaration with a given TYPE. */
101 gfc_create_var_np (tree type, const char *prefix)
103 return create_tmp_var_raw (type, prefix);
107 /* Like above, but also adds it to the current scope. */
110 gfc_create_var (tree type, const char *prefix)
114 tmp = gfc_create_var_np (type, prefix);
122 /* If the an expression is not constant, evaluate it now. We assign the
123 result of the expression to an artificially created variable VAR, and
124 return a pointer to the VAR_DECL node for this variable. */
127 gfc_evaluate_now (tree expr, stmtblock_t * pblock)
131 if (TREE_CODE_CLASS (TREE_CODE (expr)) == 'c')
134 var = gfc_create_var (TREE_TYPE (expr), NULL);
135 gfc_add_modify_expr (pblock, var, expr);
141 /* Build a MODIFY_EXPR node and add it to a given statement block PBLOCK.
142 A MODIFY_EXPR is an assignment: LHS <- RHS. */
145 gfc_add_modify_expr (stmtblock_t * pblock, tree lhs, tree rhs)
149 #ifdef ENABLE_CHECKING
150 /* Make sure that the types of the rhs and the lhs are the same
151 for scalar assignments. We should probably have something
152 similar for aggregates, but right now removing that check just
153 breaks everything. */
154 if (TREE_TYPE (rhs) != TREE_TYPE (lhs)
155 && !AGGREGATE_TYPE_P (TREE_TYPE (lhs)))
159 tmp = fold (build_v (MODIFY_EXPR, lhs, rhs));
160 gfc_add_expr_to_block (pblock, tmp);
164 /* Create a new scope/binding level and initialize a block. Care must be
165 taken when translating expessions as any temporaries will be placed in
166 the innermost scope. */
169 gfc_start_block (stmtblock_t * block)
171 /* Start a new binding level. */
173 block->has_scope = 1;
175 /* The block is empty. */
176 block->head = NULL_TREE;
180 /* Initialize a block without creating a new scope. */
183 gfc_init_block (stmtblock_t * block)
185 block->head = NULL_TREE;
186 block->has_scope = 0;
190 /* Sometimes we create a scope but it turns out that we don't actually
191 need it. This function merges the scope of BLOCK with its parent.
192 Only variable decls will be merged, you still need to add the code. */
195 gfc_merge_block_scope (stmtblock_t * block)
200 assert (block->has_scope);
201 block->has_scope = 0;
203 /* Remember the decls in this scope. */
207 /* Add them to the parent scope. */
208 while (decl != NULL_TREE)
210 next = TREE_CHAIN (decl);
211 TREE_CHAIN (decl) = NULL_TREE;
219 /* Finish a scope containing a block of statements. */
222 gfc_finish_block (stmtblock_t * stmtblock)
228 expr = stmtblock->head;
230 expr = build_empty_stmt ();
232 stmtblock->head = NULL_TREE;
234 if (stmtblock->has_scope)
240 block = poplevel (1, 0, 0);
241 expr = build_v (BIND_EXPR, decl, expr, block);
251 /* Build an ADDR_EXPR and cast the result to TYPE. If TYPE is NULL, the
252 natural type is used. */
255 gfc_build_addr_expr (tree type, tree t)
257 tree base_type = TREE_TYPE (t);
260 if (type && POINTER_TYPE_P (type)
261 && TREE_CODE (base_type) == ARRAY_TYPE
262 && TYPE_MAIN_VARIANT (TREE_TYPE (type))
263 == TYPE_MAIN_VARIANT (TREE_TYPE (base_type)))
266 natural_type = build_pointer_type (base_type);
268 if (TREE_CODE (t) == INDIRECT_REF)
272 t = TREE_OPERAND (t, 0);
273 natural_type = TREE_TYPE (t);
278 TREE_ADDRESSABLE (t) = 1;
279 t = build1 (ADDR_EXPR, natural_type, t);
282 if (type && natural_type != type)
283 t = convert (type, t);
289 /* Build an INDIRECT_REF with its natural type. */
292 gfc_build_indirect_ref (tree t)
294 tree type = TREE_TYPE (t);
295 if (!POINTER_TYPE_P (type))
297 type = TREE_TYPE (type);
299 if (TREE_CODE (t) == ADDR_EXPR)
300 return TREE_OPERAND (t, 0);
302 return build1 (INDIRECT_REF, type, t);
306 /* Build an ARRAY_REF with its natural type. */
309 gfc_build_array_ref (tree base, tree offset)
311 tree type = TREE_TYPE (base);
312 if (TREE_CODE (type) != ARRAY_TYPE)
314 type = TREE_TYPE (type);
317 TREE_ADDRESSABLE (base) = 1;
319 return build (ARRAY_REF, type, base, offset, NULL_TREE, NULL_TREE);
323 /* Given a funcion declaration FNDECL and an argument list ARGLIST,
324 build a CALL_EXPR. */
327 gfc_build_function_call (tree fndecl, tree arglist)
332 fn = gfc_build_addr_expr (NULL, fndecl);
333 call = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (fndecl)), fn, arglist, NULL);
334 TREE_SIDE_EFFECTS (call) = 1;
340 /* Generate a runtime error if COND is true. */
343 gfc_trans_runtime_check (tree cond, tree msg, stmtblock_t * pblock)
352 if (integer_zerop (cond))
355 /* The code to generate the error. */
356 gfc_start_block (&block);
358 assert (TREE_CODE (msg) == STRING_CST);
362 tmp = gfc_build_addr_expr (pchar_type_node, msg);
363 args = gfc_chainon_list (NULL_TREE, tmp);
365 tmp = gfc_build_addr_expr (pchar_type_node, gfc_strconst_current_filename);
366 args = gfc_chainon_list (args, tmp);
368 tmp = build_int_cst (NULL_TREE, input_line, 0);
369 args = gfc_chainon_list (args, tmp);
371 tmp = gfc_build_function_call (gfor_fndecl_runtime_error, args);
372 gfc_add_expr_to_block (&block, tmp);
374 body = gfc_finish_block (&block);
376 if (integer_onep (cond))
378 gfc_add_expr_to_block (pblock, body);
382 /* Tell the compiler that this isn't likely. */
383 tmp = gfc_chainon_list (NULL_TREE, cond);
384 tmp = gfc_chainon_list (tmp, integer_zero_node);
385 cond = gfc_build_function_call (built_in_decls[BUILT_IN_EXPECT], tmp);
387 tmp = build_v (COND_EXPR, cond, body, build_empty_stmt ());
388 gfc_add_expr_to_block (pblock, tmp);
393 /* Add a statement to a block. */
396 gfc_add_expr_to_block (stmtblock_t * block, tree expr)
400 if (expr == NULL_TREE || IS_EMPTY_STMT (expr))
403 if (TREE_CODE (expr) != STATEMENT_LIST)
408 if (TREE_CODE (block->head) != STATEMENT_LIST)
413 block->head = NULL_TREE;
414 append_to_statement_list (tmp, &block->head);
416 append_to_statement_list (expr, &block->head);
419 /* Don't bother creating a list if we only have a single statement. */
424 /* Add a block the end of a block. */
427 gfc_add_block_to_block (stmtblock_t * block, stmtblock_t * append)
430 assert (!append->has_scope);
432 gfc_add_expr_to_block (block, append->head);
433 append->head = NULL_TREE;
437 /* Get the current locus. The structure may not be complete, and should
438 only be used with gfc_set_backend_locus. */
441 gfc_get_backend_locus (locus * loc)
443 loc->lb = gfc_getmem (sizeof (gfc_linebuf));
444 loc->lb->linenum = input_line - 1;
445 loc->lb->file = gfc_current_backend_file;
449 /* Set the current locus. */
452 gfc_set_backend_locus (locus * loc)
454 input_line = loc->lb->linenum;
455 gfc_current_backend_file = loc->lb->file;
456 input_filename = loc->lb->file->filename;
460 /* Translate an executable statement. */
463 gfc_trans_code (gfc_code * code)
469 return build_empty_stmt ();
471 gfc_start_block (&block);
473 /* Translate statements one by one to GIMPLE trees until we reach
474 the end of this gfc_code branch. */
475 for (; code; code = code->next)
477 gfc_set_backend_locus (&code->loc);
481 res = gfc_trans_label_here (code);
482 gfc_add_expr_to_block (&block, res);
492 res = gfc_trans_assign (code);
495 case EXEC_LABEL_ASSIGN:
496 res = gfc_trans_label_assign (code);
499 case EXEC_POINTER_ASSIGN:
500 res = gfc_trans_pointer_assign (code);
508 res = gfc_trans_cycle (code);
512 res = gfc_trans_exit (code);
516 res = gfc_trans_goto (code);
520 res = gfc_trans_entry (code);
524 res = gfc_trans_pause (code);
528 res = gfc_trans_stop (code);
532 res = gfc_trans_call (code);
536 res = gfc_trans_return (code);
540 res = gfc_trans_if (code);
543 case EXEC_ARITHMETIC_IF:
544 res = gfc_trans_arithmetic_if (code);
548 res = gfc_trans_do (code);
552 res = gfc_trans_do_while (code);
556 res = gfc_trans_select (code);
560 res = gfc_trans_forall (code);
564 res = gfc_trans_where (code);
568 res = gfc_trans_allocate (code);
571 case EXEC_DEALLOCATE:
572 res = gfc_trans_deallocate (code);
576 res = gfc_trans_open (code);
580 res = gfc_trans_close (code);
584 res = gfc_trans_read (code);
588 res = gfc_trans_write (code);
592 res = gfc_trans_iolength (code);
596 res = gfc_trans_backspace (code);
600 res = gfc_trans_endfile (code);
604 res = gfc_trans_inquire (code);
608 res = gfc_trans_rewind (code);
612 res = gfc_trans_transfer (code);
616 res = gfc_trans_dt_end (code);
620 internal_error ("gfc_trans_code(): Bad statement code");
623 if (res != NULL_TREE && ! IS_EMPTY_STMT (res))
625 if (TREE_CODE (res) == STATEMENT_LIST)
626 annotate_all_with_locus (&res, input_location);
628 annotate_with_locus (res, input_location);
630 /* Add the new statemment to the block. */
631 gfc_add_expr_to_block (&block, res);
635 /* Return the finished block. */
636 return gfc_finish_block (&block);
640 /* This function is called after a complete program unit has been parsed
644 gfc_generate_code (gfc_namespace * ns)
646 gfc_symbol *main_program = NULL;
647 symbol_attribute attr;
649 /* Main program subroutine. */
652 /* Lots of things get upset if a subroutine doesn't have a symbol, so we
653 make one now. Hopefully we've set all the required fields. */
654 gfc_get_symbol ("MAIN__", ns, &main_program);
655 gfc_clear_attr (&attr);
656 attr.flavor = FL_PROCEDURE;
657 attr.proc = PROC_UNKNOWN;
659 attr.access = ACCESS_PUBLIC;
660 main_program->attr = attr;
661 ns->proc_name = main_program;
662 gfc_commit_symbols ();
665 gfc_generate_function_code (ns);
669 /* This function is called after a complete module has been parsed
673 gfc_generate_module_code (gfc_namespace * ns)
677 gfc_generate_module_vars (ns);
679 /* We need to generate all module function prototypes first, to allow
681 for (n = ns->contained; n; n = n->sibling)
686 gfc_create_function_decl (n);
689 for (n = ns->contained; n; n = n->sibling)
694 gfc_generate_function_code (n);