X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Fipa-pure-const.c;h=d3b880adc83f85561170977c051f14b02b47596f;hb=c761351cc4891e38cf3ef25fd03b59e6c3901d61;hp=0b659a0aee66bafbe59623c864a9ab01d6400bc5;hpb=2c59de14657e9d6b1994cb7308b31b490c0be514;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/ipa-pure-const.c b/gcc/ipa-pure-const.c index 0b659a0aee6..d3b880adc83 100644 --- a/gcc/ipa-pure-const.c +++ b/gcc/ipa-pure-const.c @@ -1,12 +1,12 @@ /* Callgraph based analysis of static variables. - Copyright (C) 2004, 2005 Free Software Foundation, Inc. + Copyright (C) 2004, 2005, 2007 Free Software Foundation, Inc. Contributed by Kenneth Zadeck This file is part of GCC. GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free -Software Foundation; either version 2, or (at your option) any later +Software Foundation; either version 3, or (at your option) any later version. GCC is distributed in the hope that it will be useful, but WITHOUT ANY @@ -15,9 +15,8 @@ FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License -along with GCC; see the file COPYING. If not, write to the Free -Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA -02110-1301, USA. */ +along with GCC; see the file COPYING3. If not see +. */ /* This file mark functions as being either const (TREE_READONLY) or pure (DECL_IS_PURE). @@ -51,6 +50,7 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA #include "timevar.h" #include "diagnostic.h" #include "langhooks.h" +#include "target.h" static struct pointer_set_t *visited_nodes; @@ -79,8 +79,8 @@ typedef struct funct_state_d * funct_state; static inline funct_state get_function_state (struct cgraph_node *node) { - struct ipa_dfs_info * info = node->aux; - return info->aux; + struct ipa_dfs_info * info = (struct ipa_dfs_info *) node->aux; + return (funct_state) info->aux; } /* Check to see if the use (or definition when CHECHING_WRITE is true) @@ -114,7 +114,10 @@ check_decl (funct_state local, are CHECKING_WRITE, this cannot be a pure or constant function. */ if (checking_write) - local->pure_const_state = IPA_NEITHER; + { + local->pure_const_state = IPA_NEITHER; + return; + } if (DECL_EXTERNAL (t) || TREE_PUBLIC (t)) { @@ -162,9 +165,18 @@ check_operand (funct_state local, static void check_tree (funct_state local, tree t, bool checking_write) { - if ((TREE_CODE (t) == EXC_PTR_EXPR) || (TREE_CODE (t) == FILTER_EXPR)) + if ((TREE_CODE (t) == EXC_PTR_EXPR) || (TREE_CODE (t) == FILTER_EXPR) + || TREE_CODE (t) == SSA_NAME) return; + /* Any tree which is volatile disqualifies thie function from being + const or pure. */ + if (TREE_THIS_VOLATILE (t)) + { + local->pure_const_state = IPA_NEITHER; + return; + } + while (TREE_CODE (t) == REALPART_EXPR || TREE_CODE (t) == IMAGPART_EXPR || handled_component_p (t)) @@ -182,13 +194,15 @@ check_tree (funct_state local, tree t, bool checking_write) /* Any indirect reference that occurs on the lhs disqualifies the function from being pure or const. Any - indirect reference that occurs on the rhs disqualifies - the function from being const. */ + indirect reference that occurs on the rhs disqualifies the + function from being const. */ if (checking_write) - local->pure_const_state = IPA_NEITHER; - else - if (local->pure_const_state == IPA_CONST) - local->pure_const_state = IPA_PURE; + { + local->pure_const_state = IPA_NEITHER; + return; + } + else if (local->pure_const_state == IPA_CONST) + local->pure_const_state = IPA_PURE; } if (SSA_VAR_P (t)) @@ -304,20 +318,15 @@ get_asm_expr_operands (funct_state local, tree stmt) static void check_call (funct_state local, tree call_expr) { - int flags = call_expr_flags(call_expr); - tree operand_list = TREE_OPERAND (call_expr, 1); + int flags = call_expr_flags (call_expr); tree operand; + call_expr_arg_iterator iter; tree callee_t = get_callee_fndecl (call_expr); struct cgraph_node* callee; enum availability avail = AVAIL_NOT_AVAILABLE; - for (operand = operand_list; - operand != NULL_TREE; - operand = TREE_CHAIN (operand)) - { - tree argument = TREE_VALUE (operand); - check_rhs_var (local, argument); - } + FOR_EACH_CALL_EXPR_ARG (operand, iter, call_expr) + check_rhs_var (local, operand); /* The const and pure flags are set by a variety of places in the compiler (including here). If someone has already set the flags @@ -389,7 +398,7 @@ scan_function (tree *tp, int *walk_subtrees, void *data) { - struct cgraph_node *fn = data; + struct cgraph_node *fn = (struct cgraph_node *) data; tree t = *tp; funct_state local = get_function_state (fn); @@ -401,11 +410,11 @@ scan_function (tree *tp, *walk_subtrees = 0; break; - case MODIFY_EXPR: + case GIMPLE_MODIFY_STMT: { /* First look on the lhs and see what variable is stored to */ - tree lhs = TREE_OPERAND (t, 0); - tree rhs = TREE_OPERAND (t, 1); + tree lhs = GIMPLE_STMT_OPERAND (t, 0); + tree rhs = GIMPLE_STMT_OPERAND (t, 1); check_lhs_var (local, lhs); /* For the purposes of figuring out what the cast affects */ @@ -440,7 +449,14 @@ scan_function (tree *tp, case ADDR_EXPR: check_rhs_var (local, rhs); break; - case CALL_EXPR: + default: + break; + } + break; + case tcc_vl_exp: + switch (TREE_CODE (rhs)) + { + case CALL_EXPR: check_call (local, rhs); break; default: @@ -489,18 +505,20 @@ scan_function (tree *tp, static void analyze_function (struct cgraph_node *fn) { - funct_state l = xcalloc (1, sizeof (struct funct_state_d)); + funct_state l = XCNEW (struct funct_state_d); tree decl = fn->decl; - struct ipa_dfs_info * w_info = fn->aux; + struct ipa_dfs_info * w_info = (struct ipa_dfs_info *) fn->aux; w_info->aux = l; l->pure_const_state = IPA_CONST; l->state_set_in_source = false; - /* If this is a volatile function, do not touch this unless it has - been marked as const or pure by the front end. */ - if (TREE_THIS_VOLATILE (decl)) + /* If this function does not return normally or does not bind local, + do not touch this unless it has been marked as const or pure by the + front end. */ + if (TREE_THIS_VOLATILE (decl) + || !targetm.binds_local_p (decl)) { l->pure_const_state = IPA_NEITHER; return; @@ -537,7 +555,7 @@ analyze_function (struct cgraph_node *fn) walk_tree (bsi_stmt_ptr (bsi), scan_function, fn, visited_nodes); if (l->pure_const_state == IPA_NEITHER) - return; + goto end; } } @@ -564,6 +582,14 @@ analyze_function (struct cgraph_node *fn) pop_cfun (); } } + +end: + if (dump_file) + { + fprintf (dump_file, "after local analysis of %s with initial value = %d\n ", + cgraph_node_name (fn), + l->pure_const_state); + } } @@ -571,14 +597,14 @@ analyze_function (struct cgraph_node *fn) on the local information that was produced by ipa_analyze_function and ipa_analyze_variable. */ -static void +static unsigned int static_execute (void) { struct cgraph_node *node; struct cgraph_node *w; struct cgraph_node **order = - xcalloc (cgraph_n_nodes, sizeof (struct cgraph_node *)); - int order_pos = order_pos = ipa_utils_reduced_inorder (order, true, false); + XCNEWVEC (struct cgraph_node *, cgraph_n_nodes); + int order_pos = ipa_utils_reduced_inorder (order, true, false); int i; struct ipa_dfs_info * w_info; @@ -649,7 +675,7 @@ static_execute (void) } } } - w_info = w->aux; + w_info = (struct ipa_dfs_info *) w->aux; w = w_info->next_cycle; } @@ -684,7 +710,7 @@ static_execute (void) break; } } - w_info = w->aux; + w_info = (struct ipa_dfs_info *) w->aux; w = w_info->next_cycle; } } @@ -694,11 +720,15 @@ static_execute (void) /* Get rid of the aux information. */ if (node->aux) { + w_info = (struct ipa_dfs_info *) node->aux; + if (w_info->aux) + free (w_info->aux); free (node->aux); node->aux = NULL; } free (order); + return 0; } static bool @@ -711,7 +741,7 @@ gate_pure_const (void) struct tree_opt_pass pass_ipa_pure_const = { - "ipa-pure-const", /* name */ + "pure-const", /* name */ gate_pure_const, /* gate */ static_execute, /* execute */ NULL, /* sub */