1 /* Code translation -- generate GCC trees from gfc_code.
2 Copyright (C) 2002, 2003, 2004, 2005, 2006 Free Software Foundation,
4 Contributed by Paul Brook
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
25 #include "coretypes.h"
27 #include "tree-gimple.h"
34 #include "trans-stmt.h"
35 #include "trans-array.h"
36 #include "trans-types.h"
37 #include "trans-const.h"
39 /* Naming convention for backend interface code:
41 gfc_trans_* translate gfc_code into STMT trees.
43 gfc_conv_* expression conversion
45 gfc_get_* get a backend tree representation of a decl or type */
47 static gfc_file *gfc_current_backend_file;
49 char gfc_msg_bounds[] = N_("Array bound mismatch");
50 char gfc_msg_fault[] = N_("Array reference out of bounds");
51 char gfc_msg_wrong_return[] = N_("Incorrect function return value");
54 /* Advance along TREE_CHAIN n times. */
57 gfc_advance_chain (tree t, int n)
61 gcc_assert (t != NULL_TREE);
68 /* Wrap a node in a TREE_LIST node and add it to the end of a list. */
71 gfc_chainon_list (tree list, tree add)
75 l = tree_cons (NULL_TREE, add, NULL_TREE);
77 return chainon (list, l);
81 /* Strip off a legitimate source ending from the input
82 string NAME of length LEN. */
85 remove_suffix (char *name, int len)
89 for (i = 2; i < 8 && len > i; i++)
91 if (name[len - i] == '.')
100 /* Creates a variable declaration with a given TYPE. */
103 gfc_create_var_np (tree type, const char *prefix)
105 return create_tmp_var_raw (type, prefix);
109 /* Like above, but also adds it to the current scope. */
112 gfc_create_var (tree type, const char *prefix)
116 tmp = gfc_create_var_np (type, prefix);
124 /* If the an expression is not constant, evaluate it now. We assign the
125 result of the expression to an artificially created variable VAR, and
126 return a pointer to the VAR_DECL node for this variable. */
129 gfc_evaluate_now (tree expr, stmtblock_t * pblock)
133 if (CONSTANT_CLASS_P (expr))
136 var = gfc_create_var (TREE_TYPE (expr), NULL);
137 gfc_add_modify_expr (pblock, var, expr);
143 /* Build a MODIFY_EXPR node and add it to a given statement block PBLOCK.
144 A MODIFY_EXPR is an assignment: LHS <- RHS. */
147 gfc_add_modify_expr (stmtblock_t * pblock, tree lhs, tree rhs)
151 #ifdef ENABLE_CHECKING
152 /* Make sure that the types of the rhs and the lhs are the same
153 for scalar assignments. We should probably have something
154 similar for aggregates, but right now removing that check just
155 breaks everything. */
156 gcc_assert (TREE_TYPE (rhs) == TREE_TYPE (lhs)
157 || AGGREGATE_TYPE_P (TREE_TYPE (lhs)));
160 tmp = fold_build2 (MODIFY_EXPR, void_type_node, lhs, rhs);
161 gfc_add_expr_to_block (pblock, tmp);
165 /* Create a new scope/binding level and initialize a block. Care must be
166 taken when translating expressions as any temporaries will be placed in
167 the innermost scope. */
170 gfc_start_block (stmtblock_t * block)
172 /* Start a new binding level. */
174 block->has_scope = 1;
176 /* The block is empty. */
177 block->head = NULL_TREE;
181 /* Initialize a block without creating a new scope. */
184 gfc_init_block (stmtblock_t * block)
186 block->head = NULL_TREE;
187 block->has_scope = 0;
191 /* Sometimes we create a scope but it turns out that we don't actually
192 need it. This function merges the scope of BLOCK with its parent.
193 Only variable decls will be merged, you still need to add the code. */
196 gfc_merge_block_scope (stmtblock_t * block)
201 gcc_assert (block->has_scope);
202 block->has_scope = 0;
204 /* Remember the decls in this scope. */
208 /* Add them to the parent scope. */
209 while (decl != NULL_TREE)
211 next = TREE_CHAIN (decl);
212 TREE_CHAIN (decl) = NULL_TREE;
220 /* Finish a scope containing a block of statements. */
223 gfc_finish_block (stmtblock_t * stmtblock)
229 expr = stmtblock->head;
231 expr = build_empty_stmt ();
233 stmtblock->head = NULL_TREE;
235 if (stmtblock->has_scope)
241 block = poplevel (1, 0, 0);
242 expr = build3_v (BIND_EXPR, decl, expr, block);
252 /* Build an ADDR_EXPR and cast the result to TYPE. If TYPE is NULL, the
253 natural type is used. */
256 gfc_build_addr_expr (tree type, tree t)
258 tree base_type = TREE_TYPE (t);
261 if (type && POINTER_TYPE_P (type)
262 && TREE_CODE (base_type) == ARRAY_TYPE
263 && TYPE_MAIN_VARIANT (TREE_TYPE (type))
264 == TYPE_MAIN_VARIANT (TREE_TYPE (base_type)))
267 natural_type = build_pointer_type (base_type);
269 if (TREE_CODE (t) == INDIRECT_REF)
273 t = TREE_OPERAND (t, 0);
274 natural_type = TREE_TYPE (t);
279 TREE_ADDRESSABLE (t) = 1;
280 t = build1 (ADDR_EXPR, natural_type, t);
283 if (type && natural_type != type)
284 t = convert (type, t);
290 /* Build an ARRAY_REF with its natural type. */
293 gfc_build_array_ref (tree base, tree offset)
295 tree type = TREE_TYPE (base);
296 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
297 type = TREE_TYPE (type);
300 TREE_ADDRESSABLE (base) = 1;
302 return build4 (ARRAY_REF, type, base, offset, NULL_TREE, NULL_TREE);
306 /* Generate a runtime error if COND is true. */
309 gfc_trans_runtime_check (tree cond, const char * msgid, stmtblock_t * pblock,
319 if (integer_zerop (cond))
322 /* The code to generate the error. */
323 gfc_start_block (&block);
327 #ifdef USE_MAPPED_LOCATION
328 line = LOCATION_LINE (where->lb->location);
330 line = where->lb->linenum;
332 asprintf (&message, "%s (in file '%s', at line %d)", _(msgid),
333 where->lb->file->filename, line);
336 asprintf (&message, "%s (in file '%s', around line %d)", _(msgid),
337 gfc_source_file, input_line + 1);
339 tmp = gfc_build_addr_expr (pchar_type_node, gfc_build_cstring_const(message));
341 args = gfc_chainon_list (NULL_TREE, tmp);
343 tmp = build_function_call_expr (gfor_fndecl_runtime_error, args);
344 gfc_add_expr_to_block (&block, tmp);
346 body = gfc_finish_block (&block);
348 if (integer_onep (cond))
350 gfc_add_expr_to_block (pblock, body);
354 /* Tell the compiler that this isn't likely. */
355 cond = fold_convert (long_integer_type_node, cond);
356 tmp = gfc_chainon_list (NULL_TREE, cond);
357 tmp = gfc_chainon_list (tmp, build_int_cst (long_integer_type_node, 0));
358 cond = build_function_call_expr (built_in_decls[BUILT_IN_EXPECT], tmp);
359 cond = fold_convert (boolean_type_node, cond);
361 tmp = build3_v (COND_EXPR, cond, body, build_empty_stmt ());
362 gfc_add_expr_to_block (pblock, tmp);
367 /* Add a statement to a block. */
370 gfc_add_expr_to_block (stmtblock_t * block, tree expr)
374 if (expr == NULL_TREE || IS_EMPTY_STMT (expr))
379 if (TREE_CODE (block->head) != STATEMENT_LIST)
384 block->head = NULL_TREE;
385 append_to_statement_list (tmp, &block->head);
387 append_to_statement_list (expr, &block->head);
390 /* Don't bother creating a list if we only have a single statement. */
395 /* Add a block the end of a block. */
398 gfc_add_block_to_block (stmtblock_t * block, stmtblock_t * append)
401 gcc_assert (!append->has_scope);
403 gfc_add_expr_to_block (block, append->head);
404 append->head = NULL_TREE;
408 /* Get the current locus. The structure may not be complete, and should
409 only be used with gfc_set_backend_locus. */
412 gfc_get_backend_locus (locus * loc)
414 loc->lb = gfc_getmem (sizeof (gfc_linebuf));
415 #ifdef USE_MAPPED_LOCATION
416 loc->lb->location = input_location;
418 loc->lb->linenum = input_line;
420 loc->lb->file = gfc_current_backend_file;
424 /* Set the current locus. */
427 gfc_set_backend_locus (locus * loc)
429 gfc_current_backend_file = loc->lb->file;
430 #ifdef USE_MAPPED_LOCATION
431 input_location = loc->lb->location;
433 input_line = loc->lb->linenum;
434 input_filename = loc->lb->file->filename;
439 /* Translate an executable statement. */
442 gfc_trans_code (gfc_code * code)
448 return build_empty_stmt ();
450 gfc_start_block (&block);
452 /* Translate statements one by one to GIMPLE trees until we reach
453 the end of this gfc_code branch. */
454 for (; code; code = code->next)
458 res = gfc_trans_label_here (code);
459 gfc_add_expr_to_block (&block, res);
469 res = gfc_trans_assign (code);
472 case EXEC_LABEL_ASSIGN:
473 res = gfc_trans_label_assign (code);
476 case EXEC_POINTER_ASSIGN:
477 res = gfc_trans_pointer_assign (code);
480 case EXEC_INIT_ASSIGN:
481 res = gfc_trans_init_assign (code);
489 res = gfc_trans_cycle (code);
493 res = gfc_trans_exit (code);
497 res = gfc_trans_goto (code);
501 res = gfc_trans_entry (code);
505 res = gfc_trans_pause (code);
509 res = gfc_trans_stop (code);
513 res = gfc_trans_call (code, false);
516 case EXEC_ASSIGN_CALL:
517 res = gfc_trans_call (code, true);
521 res = gfc_trans_return (code);
525 res = gfc_trans_if (code);
528 case EXEC_ARITHMETIC_IF:
529 res = gfc_trans_arithmetic_if (code);
533 res = gfc_trans_do (code);
537 res = gfc_trans_do_while (code);
541 res = gfc_trans_select (code);
545 res = gfc_trans_flush (code);
549 res = gfc_trans_forall (code);
553 res = gfc_trans_where (code);
557 res = gfc_trans_allocate (code);
560 case EXEC_DEALLOCATE:
561 res = gfc_trans_deallocate (code);
565 res = gfc_trans_open (code);
569 res = gfc_trans_close (code);
573 res = gfc_trans_read (code);
577 res = gfc_trans_write (code);
581 res = gfc_trans_iolength (code);
585 res = gfc_trans_backspace (code);
589 res = gfc_trans_endfile (code);
593 res = gfc_trans_inquire (code);
597 res = gfc_trans_rewind (code);
601 res = gfc_trans_transfer (code);
605 res = gfc_trans_dt_end (code);
608 case EXEC_OMP_ATOMIC:
609 case EXEC_OMP_BARRIER:
610 case EXEC_OMP_CRITICAL:
613 case EXEC_OMP_MASTER:
614 case EXEC_OMP_ORDERED:
615 case EXEC_OMP_PARALLEL:
616 case EXEC_OMP_PARALLEL_DO:
617 case EXEC_OMP_PARALLEL_SECTIONS:
618 case EXEC_OMP_PARALLEL_WORKSHARE:
619 case EXEC_OMP_SECTIONS:
620 case EXEC_OMP_SINGLE:
621 case EXEC_OMP_WORKSHARE:
622 res = gfc_trans_omp_directive (code);
626 internal_error ("gfc_trans_code(): Bad statement code");
629 gfc_set_backend_locus (&code->loc);
631 if (res != NULL_TREE && ! IS_EMPTY_STMT (res))
633 if (TREE_CODE (res) == STATEMENT_LIST)
634 annotate_all_with_locus (&res, input_location);
636 SET_EXPR_LOCATION (res, input_location);
638 /* Add the new statement to the block. */
639 gfc_add_expr_to_block (&block, res);
643 /* Return the finished block. */
644 return gfc_finish_block (&block);
648 /* This function is called after a complete program unit has been parsed
652 gfc_generate_code (gfc_namespace * ns)
654 if (ns->is_block_data)
656 gfc_generate_block_data (ns);
660 gfc_generate_function_code (ns);
664 /* This function is called after a complete module has been parsed
668 gfc_generate_module_code (gfc_namespace * ns)
672 gfc_generate_module_vars (ns);
674 /* We need to generate all module function prototypes first, to allow
676 for (n = ns->contained; n; n = n->sibling)
681 gfc_create_function_decl (n);
684 for (n = ns->contained; n; n = n->sibling)
689 gfc_generate_function_code (n);