Mercurial > hg > CbC > CbC_gcc
diff gcc/ddg.c @ 67:f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
author | nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp> |
---|---|
date | Tue, 22 Mar 2011 17:18:12 +0900 |
parents | 77e2b8dfacca |
children | 04ced10e8804 |
line wrap: on
line diff
--- a/gcc/ddg.c Tue May 25 18:58:51 2010 +0900 +++ b/gcc/ddg.c Tue Mar 22 17:18:12 2011 +0900 @@ -1,5 +1,5 @@ /* DDG - Data Dependence Graph implementation. - Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 + Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Free Software Foundation, Inc. Contributed by Ayal Zaks and Mustafa Hagog <zaks,mustafa@il.ibm.com> @@ -24,7 +24,7 @@ #include "system.h" #include "coretypes.h" #include "tm.h" -#include "toplev.h" +#include "diagnostic-core.h" #include "rtl.h" #include "tm_p.h" #include "hard-reg-set.h" @@ -192,7 +192,7 @@ first_def = df_bb_regno_first_def_find (g->bb, regno); gcc_assert (first_def); - if (bitmap_bit_p (bb_info->gen, DF_REF_ID (first_def))) + if (bitmap_bit_p (&bb_info->gen, DF_REF_ID (first_def))) return; } } @@ -263,7 +263,8 @@ #ifdef ENABLE_CHECKING if (DF_REF_ID (last_def) != DF_REF_ID (first_def)) - gcc_assert (!bitmap_bit_p (bb_info->gen, DF_REF_ID (first_def))); + gcc_assert (!bitmap_bit_p (&bb_info->gen, + DF_REF_ID (first_def))); #endif /* Create inter-loop true dependences and anti dependences. */ @@ -338,7 +339,7 @@ rd_bb_info = DF_RD_BB_INFO (g->bb); /* Find inter-loop register output, true and anti deps. */ - EXECUTE_IF_SET_IN_BITMAP (rd_bb_info->gen, 0, rd_num, bi) + EXECUTE_IF_SET_IN_BITMAP (&rd_bb_info->gen, 0, rd_num, bi) { df_ref rd = DF_DEFS_GET (rd_num); @@ -347,12 +348,49 @@ } +static int +walk_mems_2 (rtx *x, rtx mem) +{ + if (MEM_P (*x)) + { + if (may_alias_p (*x, mem)) + return 1; + + return -1; + } + return 0; +} + +static int +walk_mems_1 (rtx *x, rtx *pat) +{ + if (MEM_P (*x)) + { + /* Visit all MEMs in *PAT and check indepedence. */ + if (for_each_rtx (pat, (rtx_function) walk_mems_2, *x)) + /* Indicate that dependence was determined and stop traversal. */ + return 1; + + return -1; + } + return 0; +} + +/* Return 1 if two specified instructions have mem expr with conflict alias sets*/ +static int +insns_may_alias_p (rtx insn1, rtx insn2) +{ + /* For each pair of MEMs in INSN1 and INSN2 check their independence. */ + return for_each_rtx (&PATTERN (insn1), (rtx_function) walk_mems_1, + &PATTERN (insn2)); +} + /* Given two nodes, analyze their RTL insns and add inter-loop mem deps to ddg G. */ static void add_inter_loop_mem_dep (ddg_ptr g, ddg_node_ptr from, ddg_node_ptr to) { - if (!insn_alias_sets_conflict_p (from->insn, to->insn)) + if (!insns_may_alias_p (from->insn, to->insn)) /* Do not create edge if memory references have disjoint alias sets. */ return; @@ -390,7 +428,7 @@ { int i; /* Hold the dependency analysis state during dependency calculations. */ - struct deps tmp_deps; + struct deps_desc tmp_deps; rtx head, tail; /* Build the dependence information, using the sched_analyze function. */ @@ -487,7 +525,7 @@ } /* There is nothing to do for this BB. */ - if (num_nodes <= 1) + if ((num_nodes - g->num_debug) <= 1) { free (g); return NULL;