2008-12-12 Benjamin Kosnik <bkoz@redhat.com>

[pf3gnuchains/gcc-fork.git] / gcc / gcse.c

diff --git a/gcc/gcse.c b/gcc/gcse.c
index b18d17a..ee2d31e 100644 (file)
--- a/gcc/gcse.c
+++ b/gcc/gcse.c
@@ -1,13 +1,13 @@
 /* Global common subexpression elimination/Partial redundancy elimination
    and global constant/copy propagation for GNU compiler.
    Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
 /* Global common subexpression elimination/Partial redundancy elimination
    and global constant/copy propagation for GNU compiler.
    Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,

-   2006, 2007 Free Software Foundation, Inc.
+   2006, 2007, 2008 Free Software Foundation, Inc.

 
 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
 
 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
 version.
 
 GCC is distributed in the hope that it will be useful, but WITHOUT ANY


@@ -16,9 +16,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
 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
+<http://www.gnu.org/licenses/>.  */

 
 /* TODO
    - reordering of memory allocation and freeing to be more space efficient
 
 /* TODO
    - reordering of memory allocation and freeing to be more space efficient


@@ -171,6 +170,8 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
 #include "timevar.h"
 #include "tree-pass.h"
 #include "hashtab.h"
 #include "timevar.h"
 #include "tree-pass.h"
 #include "hashtab.h"

+#include "df.h"
+#include "dbgcnt.h"

 
 /* Propagate flow information through back edges and thus enable PRE's
    moving loop invariant calculations out of loops.
 
 /* Propagate flow information through back edges and thus enable PRE's
    moving loop invariant calculations out of loops.


@@ -379,12 +380,6 @@ static int max_uid;
 /* Number of cuids.  */
 static int max_cuid;
 
 /* Number of cuids.  */
 static int max_cuid;
 

-/* Mapping of cuids to insns.  */
-static rtx *cuid_insn;
-
-/* Get insn from cuid.  */
-#define CUID_INSN(CUID) (cuid_insn[CUID])
-

 /* Maximum register number in function prior to doing gcse + 1.
    Registers created during this pass have regno >= max_gcse_regno.
    This is named with "gcse" to not collide with global of same name.  */
 /* Maximum register number in function prior to doing gcse + 1.
    Registers created during this pass have regno >= max_gcse_regno.
    This is named with "gcse" to not collide with global of same name.  */


@@ -522,27 +517,27 @@ static void free_gcse_mem (void);
 static void alloc_reg_set_mem (int);
 static void free_reg_set_mem (void);
 static void record_one_set (int, rtx);
 static void alloc_reg_set_mem (int);
 static void free_reg_set_mem (void);
 static void record_one_set (int, rtx);

-static void record_set_info (rtx, rtx, void *);
+static void record_set_info (rtx, const_rtx, void *);

 static void compute_sets (void);
 static void compute_sets (void);

-static void hash_scan_insn (rtx, struct hash_table *, int);
+static void hash_scan_insn (rtx, struct hash_table *);

 static void hash_scan_set (rtx, rtx, struct hash_table *);
 static void hash_scan_clobber (rtx, rtx, struct hash_table *);
 static void hash_scan_call (rtx, rtx, struct hash_table *);
 static int want_to_gcse_p (rtx);
 static bool can_assign_to_reg_p (rtx);
 static void hash_scan_set (rtx, rtx, struct hash_table *);
 static void hash_scan_clobber (rtx, rtx, struct hash_table *);
 static void hash_scan_call (rtx, rtx, struct hash_table *);
 static int want_to_gcse_p (rtx);
 static bool can_assign_to_reg_p (rtx);

-static bool gcse_constant_p (rtx);
-static int oprs_unchanged_p (rtx, rtx, int);
-static int oprs_anticipatable_p (rtx, rtx);
-static int oprs_available_p (rtx, rtx);
+static bool gcse_constant_p (const_rtx);
+static int oprs_unchanged_p (const_rtx, const_rtx, int);
+static int oprs_anticipatable_p (const_rtx, const_rtx);
+static int oprs_available_p (const_rtx, const_rtx);

 static void insert_expr_in_table (rtx, enum machine_mode, rtx, int, int,
                                  struct hash_table *);
 static void insert_set_in_table (rtx, rtx, struct hash_table *);
 static void insert_expr_in_table (rtx, enum machine_mode, rtx, int, int,
                                  struct hash_table *);
 static void insert_set_in_table (rtx, rtx, struct hash_table *);

-static unsigned int hash_expr (rtx, enum machine_mode, int *, int);
+static unsigned int hash_expr (const_rtx, enum machine_mode, int *, int);

 static unsigned int hash_set (int, int);
 static unsigned int hash_set (int, int);

-static int expr_equiv_p (rtx, rtx);
+static int expr_equiv_p (const_rtx, const_rtx);

 static void record_last_reg_set_info (rtx, int);
 static void record_last_mem_set_info (rtx);
 static void record_last_reg_set_info (rtx, int);
 static void record_last_mem_set_info (rtx);

-static void record_last_set_info (rtx, rtx, void *);
+static void record_last_set_info (rtx, const_rtx, void *);

 static void compute_hash_table (struct hash_table *);
 static void alloc_hash_table (int, struct hash_table *, int);
 static void free_hash_table (struct hash_table *);
 static void compute_hash_table (struct hash_table *);
 static void alloc_hash_table (int, struct hash_table *, int);
 static void free_hash_table (struct hash_table *);


@@ -551,14 +546,14 @@ static void dump_hash_table (FILE *, const char *, struct hash_table *);
 static struct expr *lookup_set (unsigned int, struct hash_table *);
 static struct expr *next_set (unsigned int, struct expr *);
 static void reset_opr_set_tables (void);
 static struct expr *lookup_set (unsigned int, struct hash_table *);
 static struct expr *next_set (unsigned int, struct expr *);
 static void reset_opr_set_tables (void);

-static int oprs_not_set_p (rtx, rtx);
+static int oprs_not_set_p (const_rtx, const_rtx);

 static void mark_call (rtx);
 static void mark_set (rtx, rtx);
 static void mark_clobber (rtx, rtx);
 static void mark_oprs_set (rtx);
 static void alloc_cprop_mem (int, int);
 static void free_cprop_mem (void);
 static void mark_call (rtx);
 static void mark_set (rtx, rtx);
 static void mark_clobber (rtx, rtx);
 static void mark_oprs_set (rtx);
 static void alloc_cprop_mem (int, int);
 static void free_cprop_mem (void);

-static void compute_transp (rtx, int, sbitmap *, int);
+static void compute_transp (const_rtx, int, sbitmap *, int);

 static void compute_transpout (void);
 static void compute_local_properties (sbitmap *, sbitmap *, sbitmap *,
                                      struct hash_table *);
 static void compute_transpout (void);
 static void compute_local_properties (sbitmap *, sbitmap *, sbitmap *,
                                      struct hash_table *);


@@ -567,16 +562,16 @@ static void find_used_regs (rtx *, void *);
 static int try_replace_reg (rtx, rtx, rtx);
 static struct expr *find_avail_set (int, rtx);
 static int cprop_jump (basic_block, rtx, rtx, rtx, rtx);
 static int try_replace_reg (rtx, rtx, rtx);
 static struct expr *find_avail_set (int, rtx);
 static int cprop_jump (basic_block, rtx, rtx, rtx, rtx);

-static void mems_conflict_for_gcse_p (rtx, rtx, void *);
-static int load_killed_in_block_p (basic_block, int, rtx, int);
-static void canon_list_insert (rtx, rtx, void *);
+static void mems_conflict_for_gcse_p (rtx, const_rtx, void *);
+static int load_killed_in_block_p (const_basic_block, int, const_rtx, int);
+static void canon_list_insert (rtx, const_rtx, void *);

 static int cprop_insn (rtx, int);
 static int cprop (int);
 static void find_implicit_sets (void);
 static int one_cprop_pass (int, bool, bool);
 static bool constprop_register (rtx, rtx, rtx, bool);
 static struct expr *find_bypass_set (int, int);
 static int cprop_insn (rtx, int);
 static int cprop (int);
 static void find_implicit_sets (void);
 static int one_cprop_pass (int, bool, bool);
 static bool constprop_register (rtx, rtx, rtx, bool);
 static struct expr *find_bypass_set (int, int);

-static bool reg_killed_on_edge (rtx, edge);
+static bool reg_killed_on_edge (const_rtx, const_edge);

 static int bypass_block (basic_block, rtx, rtx);
 static int bypass_conditional_jumps (void);
 static void alloc_pre_mem (int, int);
 static int bypass_block (basic_block, rtx, rtx);
 static int bypass_conditional_jumps (void);
 static void alloc_pre_mem (int, int);


@@ -584,7 +579,7 @@ static void free_pre_mem (void);
 static void compute_pre_data (void);
 static int pre_expr_reaches_here_p (basic_block, struct expr *,
                                    basic_block);
 static void compute_pre_data (void);
 static int pre_expr_reaches_here_p (basic_block, struct expr *,
                                    basic_block);

-static void insert_insn_end_bb (struct expr *, basic_block, int);
+static void insert_insn_end_basic_block (struct expr *, basic_block, int);

 static void pre_insert_copy_insn (struct expr *, rtx);
 static void pre_insert_copies (void);
 static int pre_delete (void);
 static void pre_insert_copy_insn (struct expr *, rtx);
 static void pre_insert_copies (void);
 static int pre_delete (void);


@@ -610,25 +605,25 @@ static struct ls_expr * find_rtx_in_ldst (rtx);
 static int enumerate_ldsts (void);
 static inline struct ls_expr * first_ls_expr (void);
 static inline struct ls_expr * next_ls_expr (struct ls_expr *);
 static int enumerate_ldsts (void);
 static inline struct ls_expr * first_ls_expr (void);
 static inline struct ls_expr * next_ls_expr (struct ls_expr *);

-static int simple_mem (rtx);
+static int simple_mem (const_rtx);

 static void invalidate_any_buried_refs (rtx);
 static void compute_ld_motion_mems (void);
 static void trim_ld_motion_mems (void);
 static void update_ld_motion_stores (struct expr *);
 static void invalidate_any_buried_refs (rtx);
 static void compute_ld_motion_mems (void);
 static void trim_ld_motion_mems (void);
 static void update_ld_motion_stores (struct expr *);

-static void reg_set_info (rtx, rtx, void *);
-static void reg_clear_last_set (rtx, rtx, void *);
-static bool store_ops_ok (rtx, int *);
+static void reg_set_info (rtx, const_rtx, void *);
+static void reg_clear_last_set (rtx, const_rtx, void *);
+static bool store_ops_ok (const_rtx, int *);

 static rtx extract_mentioned_regs (rtx);
 static rtx extract_mentioned_regs_helper (rtx, rtx);
 static void find_moveable_store (rtx, int *, int *);
 static int compute_store_table (void);
 static rtx extract_mentioned_regs (rtx);
 static rtx extract_mentioned_regs_helper (rtx, rtx);
 static void find_moveable_store (rtx, int *, int *);
 static int compute_store_table (void);

-static bool load_kills_store (rtx, rtx, int);
-static bool find_loads (rtx, rtx, int);
-static bool store_killed_in_insn (rtx, rtx, rtx, int);
-static bool store_killed_after (rtx, rtx, rtx, basic_block, int *, rtx *);
-static bool store_killed_before (rtx, rtx, rtx, basic_block, int *);
+static bool load_kills_store (const_rtx, const_rtx, int);
+static bool find_loads (const_rtx, const_rtx, int);
+static bool store_killed_in_insn (const_rtx, const_rtx, const_rtx, int);
+static bool store_killed_after (const_rtx, const_rtx, const_rtx, const_basic_block, int *, rtx *);
+static bool store_killed_before (const_rtx, const_rtx, const_rtx, const_basic_block, int *);

 static void build_store_vectors (void);
 static void build_store_vectors (void);

-static void insert_insn_start_bb (rtx, basic_block);
+static void insert_insn_start_basic_block (rtx, basic_block);

 static int insert_store (struct ls_expr *, edge);
 static void remove_reachable_equiv_notes (basic_block, struct ls_expr *);
 static void replace_store_insn (rtx, rtx, basic_block, struct ls_expr *);
 static int insert_store (struct ls_expr *, edge);
 static void remove_reachable_equiv_notes (basic_block, struct ls_expr *);
 static void replace_store_insn (rtx, rtx, basic_block, struct ls_expr *);


@@ -640,10 +635,23 @@ static void clear_modify_mem_tables (void);
 static void free_modify_mem_tables (void);
 static rtx gcse_emit_move_after (rtx, rtx, rtx);
 static void local_cprop_find_used_regs (rtx *, void *);
 static void free_modify_mem_tables (void);
 static rtx gcse_emit_move_after (rtx, rtx, rtx);
 static void local_cprop_find_used_regs (rtx *, void *);

-static bool do_local_cprop (rtx, rtx, bool, rtx*);
-static bool adjust_libcall_notes (rtx, rtx, rtx, rtx*);
+static bool do_local_cprop (rtx, rtx, bool);

 static void local_cprop_pass (bool);
 static bool is_too_expensive (const char *);
 static void local_cprop_pass (bool);
 static bool is_too_expensive (const char *);

+
+#define GNEW(T)                        ((T *) gmalloc (sizeof (T)))
+#define GCNEW(T)               ((T *) gcalloc (1, sizeof (T)))
+
+#define GNEWVEC(T, N)          ((T *) gmalloc (sizeof (T) * (N)))
+#define GCNEWVEC(T, N)         ((T *) gcalloc ((N), sizeof (T)))
+#define GRESIZEVEC(T, P, N)    ((T *) grealloc ((void *) (P), sizeof (T) * (N)))
+
+#define GNEWVAR(T, S)          ((T *) gmalloc ((S)))
+#define GCNEWVAR(T, S)         ((T *) gcalloc (1, (S)))
+#define GRESIZEVAR(T, P, S)    ((T *) grealloc ((P), (S)))
+
+#define GOBNEW(T)              ((T *) gcse_alloc (sizeof (T)))
+#define GOBNEWVAR(T, S)                ((T *) gcse_alloc ((S)))

 \f
 
 /* Entry point for global common subexpression elimination.
 \f
 
 /* Entry point for global common subexpression elimination.


@@ -663,7 +671,7 @@ gcse_main (rtx f ATTRIBUTE_UNUSED)
 
   /* We do not construct an accurate cfg in functions which call
      setjmp, so just punt to be safe.  */
 
   /* We do not construct an accurate cfg in functions which call
      setjmp, so just punt to be safe.  */

-  if (current_function_calls_setjmp)
+  if (cfun->calls_setjmp)

     return 0;
 
   /* Assume that we do not need to run jump optimizations after gcse.  */
     return 0;
 
   /* Assume that we do not need to run jump optimizations after gcse.  */


@@ -673,6 +681,9 @@ gcse_main (rtx f ATTRIBUTE_UNUSED)
      successors and predecessors.  */
   max_gcse_regno = max_reg_num ();
 
      successors and predecessors.  */
   max_gcse_regno = max_reg_num ();
 

+  df_note_add_problem ();
+  df_analyze ();
+

   if (dump_file)
     dump_flow_info (dump_file, dump_flags);
 
   if (dump_file)
     dump_flow_info (dump_file, dump_flags);
 


@@ -701,7 +712,7 @@ gcse_main (rtx f ATTRIBUTE_UNUSED)
   pass = 0;
   initial_bytes_used = bytes_used;
   max_pass_bytes = 0;
   pass = 0;
   initial_bytes_used = bytes_used;
   max_pass_bytes = 0;

-  gcse_obstack_bottom = gcse_alloc (1);
+  gcse_obstack_bottom = GOBNEWVAR (char, 1);

   changed = 1;
   while (changed && pass < MAX_GCSE_PASSES)
     {
   changed = 1;
   while (changed && pass < MAX_GCSE_PASSES)
     {


@@ -720,13 +731,14 @@ gcse_main (rtx f ATTRIBUTE_UNUSED)
 
       /* Don't allow constant propagation to modify jumps
         during this pass.  */
 
       /* Don't allow constant propagation to modify jumps
         during this pass.  */

-      timevar_push (TV_CPROP1);
-      changed = one_cprop_pass (pass + 1, false, false);
-      timevar_pop (TV_CPROP1);
+      if (dbg_cnt (cprop1))
+       {
+         timevar_push (TV_CPROP1);
+         changed = one_cprop_pass (pass + 1, false, false);
+         timevar_pop (TV_CPROP1);
+       }

 
 

-      if (optimize_size)
-       /* Do nothing.  */ ;
-      else
+      if (optimize_function_for_speed_p (cfun))

        {
          timevar_push (TV_PRE);
          changed |= one_pre_gcse_pass (pass + 1);
        {
          timevar_push (TV_PRE);
          changed |= one_pre_gcse_pass (pass + 1);


@@ -736,8 +748,8 @@ gcse_main (rtx f ATTRIBUTE_UNUSED)
          if (changed)
            {
              free_modify_mem_tables ();
          if (changed)
            {
              free_modify_mem_tables ();

-             modify_mem_list = gcalloc (last_basic_block, sizeof (rtx));
-             canon_modify_mem_list = gcalloc (last_basic_block, sizeof (rtx));
+             modify_mem_list = GCNEWVEC (rtx, last_basic_block);
+             canon_modify_mem_list = GCNEWVEC (rtx, last_basic_block);

            }
          free_reg_set_mem ();
          alloc_reg_set_mem (max_reg_num ());
            }
          free_reg_set_mem ();
          alloc_reg_set_mem (max_reg_num ());


@@ -759,7 +771,7 @@ gcse_main (rtx f ATTRIBUTE_UNUSED)
         for code size -- it rarely makes programs faster, and can make
         them bigger if we did partial redundancy elimination (when optimizing
         for space, we don't run the partial redundancy algorithms).  */
         for code size -- it rarely makes programs faster, and can make
         them bigger if we did partial redundancy elimination (when optimizing
         for space, we don't run the partial redundancy algorithms).  */

-      if (optimize_size)
+      if (optimize_function_for_size_p (cfun))

        {
          timevar_push (TV_HOIST);
          max_gcse_regno = max_reg_num ();
        {
          timevar_push (TV_HOIST);
          max_gcse_regno = max_reg_num ();


@@ -785,13 +797,17 @@ gcse_main (rtx f ATTRIBUTE_UNUSED)
   /* Do one last pass of copy propagation, including cprop into
      conditional jumps.  */
 
   /* Do one last pass of copy propagation, including cprop into
      conditional jumps.  */
 

-  max_gcse_regno = max_reg_num ();
-  alloc_gcse_mem ();
-  /* This time, go ahead and allow cprop to alter jumps.  */
-  timevar_push (TV_CPROP2);
-  one_cprop_pass (pass + 1, true, true);
-  timevar_pop (TV_CPROP2);
-  free_gcse_mem ();
+  if (dbg_cnt (cprop2))
+    {
+      max_gcse_regno = max_reg_num ();
+      alloc_gcse_mem ();
+
+      /* This time, go ahead and allow cprop to alter jumps.  */
+      timevar_push (TV_CPROP2);
+      one_cprop_pass (pass + 1, true, true);
+      timevar_pop (TV_CPROP2);
+      free_gcse_mem ();
+    }

 
   if (dump_file)
     {
 
   if (dump_file)
     {


@@ -806,9 +822,8 @@ gcse_main (rtx f ATTRIBUTE_UNUSED)
 
   /* We are finished with alias.  */
   end_alias_analysis ();
 
   /* We are finished with alias.  */
   end_alias_analysis ();

-  allocate_reg_info (max_reg_num (), FALSE, FALSE);

 
 

-  if (!optimize_size && flag_gcse_sm)
+  if (optimize_function_for_speed_p (cfun) && flag_gcse_sm)

     {
       timevar_push (TV_LSM);
       store_motion ();
     {
       timevar_push (TV_LSM);
       store_motion ();


@@ -928,7 +943,7 @@ alloc_gcse_mem (void)
      but we should never see those anyway, so this is OK.)  */
 
   max_uid = get_max_uid ();
      but we should never see those anyway, so this is OK.)  */
 
   max_uid = get_max_uid ();

-  uid_cuid = gcalloc (max_uid + 1, sizeof (int));
+  uid_cuid = GCNEWVEC (int, max_uid + 1);

   i = 0;
   FOR_EACH_BB (bb)
     FOR_BB_INSNS (bb, insn)
   i = 0;
   FOR_EACH_BB (bb)
     FOR_BB_INSNS (bb, insn)


@@ -939,15 +954,7 @@ alloc_gcse_mem (void)
          uid_cuid[INSN_UID (insn)] = i;
       }
 
          uid_cuid[INSN_UID (insn)] = i;
       }
 

-  /* Create a table mapping cuids to insns.  */
-

   max_cuid = i;
   max_cuid = i;

-  cuid_insn = gcalloc (max_cuid + 1, sizeof (rtx));
-  i = 0;
-  FOR_EACH_BB (bb)
-    FOR_BB_INSNS (bb, insn)
-      if (INSN_P (insn))
-       CUID_INSN (i++) = insn;

 
   /* Allocate vars to track sets of regs.  */
   reg_set_bitmap = BITMAP_ALLOC (NULL);
 
   /* Allocate vars to track sets of regs.  */
   reg_set_bitmap = BITMAP_ALLOC (NULL);


@@ -956,8 +963,8 @@ alloc_gcse_mem (void)
   reg_set_in_block = sbitmap_vector_alloc (last_basic_block, max_gcse_regno);
   /* Allocate array to keep a list of insns which modify memory in each
      basic block.  */
   reg_set_in_block = sbitmap_vector_alloc (last_basic_block, max_gcse_regno);
   /* Allocate array to keep a list of insns which modify memory in each
      basic block.  */

-  modify_mem_list = gcalloc (last_basic_block, sizeof (rtx));
-  canon_modify_mem_list = gcalloc (last_basic_block, sizeof (rtx));
+  modify_mem_list = GCNEWVEC (rtx, last_basic_block);
+  canon_modify_mem_list = GCNEWVEC (rtx, last_basic_block);

   modify_mem_list_set = BITMAP_ALLOC (NULL);
   blocks_with_calls = BITMAP_ALLOC (NULL);
 }
   modify_mem_list_set = BITMAP_ALLOC (NULL);
   blocks_with_calls = BITMAP_ALLOC (NULL);
 }


@@ -968,7 +975,6 @@ static void
 free_gcse_mem (void)
 {
   free (uid_cuid);
 free_gcse_mem (void)
 {
   free (uid_cuid);

-  free (cuid_insn);

 
   BITMAP_FREE (reg_set_bitmap);
 
 
   BITMAP_FREE (reg_set_bitmap);
 


@@ -1082,7 +1088,7 @@ static void
 alloc_reg_set_mem (int n_regs)
 {
   reg_set_table_size = n_regs + REG_SET_TABLE_SLOP;
 alloc_reg_set_mem (int n_regs)
 {
   reg_set_table_size = n_regs + REG_SET_TABLE_SLOP;

-  reg_set_table = gcalloc (reg_set_table_size, sizeof (struct reg_set *));
+  reg_set_table = GCNEWVEC (struct reg_set *, reg_set_table_size);

 
   gcc_obstack_init (&reg_set_obstack);
 }
 
   gcc_obstack_init (&reg_set_obstack);
 }


@@ -1107,14 +1113,13 @@ record_one_set (int regno, rtx insn)
     {
       int new_size = regno + REG_SET_TABLE_SLOP;
 
     {
       int new_size = regno + REG_SET_TABLE_SLOP;
 

-      reg_set_table = grealloc (reg_set_table,
-                               new_size * sizeof (struct reg_set *));
+      reg_set_table = GRESIZEVEC (struct reg_set *, reg_set_table, new_size);

       memset (reg_set_table + reg_set_table_size, 0,
              (new_size - reg_set_table_size) * sizeof (struct reg_set *));
       reg_set_table_size = new_size;
     }
 
       memset (reg_set_table + reg_set_table_size, 0,
              (new_size - reg_set_table_size) * sizeof (struct reg_set *));
       reg_set_table_size = new_size;
     }
 

-  new_reg_info = obstack_alloc (&reg_set_obstack, sizeof (struct reg_set));
+  new_reg_info = XOBNEW (&reg_set_obstack, struct reg_set);

   bytes_used += sizeof (struct reg_set);
   new_reg_info->bb_index = BLOCK_NUM (insn);
   new_reg_info->next = reg_set_table[regno];
   bytes_used += sizeof (struct reg_set);
   new_reg_info->bb_index = BLOCK_NUM (insn);
   new_reg_info->next = reg_set_table[regno];


@@ -1126,7 +1131,7 @@ record_one_set (int regno, rtx insn)
    occurring.  */
 
 static void
    occurring.  */
 
 static void

-record_set_info (rtx dest, rtx setter ATTRIBUTE_UNUSED, void *data)
+record_set_info (rtx dest, const_rtx setter ATTRIBUTE_UNUSED, void *data)

 {
   rtx record_set_insn = (rtx) data;
 
 {
   rtx record_set_insn = (rtx) data;
 


@@ -1184,6 +1189,7 @@ want_to_gcse_p (rtx x)
     case SUBREG:
     case CONST_INT:
     case CONST_DOUBLE:
     case SUBREG:
     case CONST_INT:
     case CONST_DOUBLE:

+    case CONST_FIXED:

     case CONST_VECTOR:
     case CALL:
       return 0;
     case CONST_VECTOR:
     case CALL:
       return 0;


@@ -1236,7 +1242,7 @@ can_assign_to_reg_p (rtx x)
    or from INSN to the end of INSN's basic block (if AVAIL_P != 0).  */
 
 static int
    or from INSN to the end of INSN's basic block (if AVAIL_P != 0).  */
 
 static int

-oprs_unchanged_p (rtx x, rtx insn, int avail_p)
+oprs_unchanged_p (const_rtx x, const_rtx insn, int avail_p)

 {
   int i, j;
   enum rtx_code code;
 {
   int i, j;
   enum rtx_code code;


@@ -1280,6 +1286,7 @@ oprs_unchanged_p (rtx x, rtx insn, int avail_p)
     case CONST:
     case CONST_INT:
     case CONST_DOUBLE:
     case CONST:
     case CONST_INT:
     case CONST_DOUBLE:

+    case CONST_FIXED:

     case CONST_VECTOR:
     case SYMBOL_REF:
     case LABEL_REF:
     case CONST_VECTOR:
     case SYMBOL_REF:
     case LABEL_REF:


@@ -1322,14 +1329,14 @@ static int gcse_mems_conflict_p;
    load_killed_in_block_p.  A memory reference for a load instruction,
    mems_conflict_for_gcse_p will see if a memory store conflicts with
    this memory load.  */
    load_killed_in_block_p.  A memory reference for a load instruction,
    mems_conflict_for_gcse_p will see if a memory store conflicts with
    this memory load.  */

-static rtx gcse_mem_operand;
+static const_rtx gcse_mem_operand;

 
 /* DEST is the output of an instruction.  If it is a memory reference, and
    possibly conflicts with the load found in gcse_mem_operand, then set
    gcse_mems_conflict_p to a nonzero value.  */
 
 static void
 
 /* DEST is the output of an instruction.  If it is a memory reference, and
    possibly conflicts with the load found in gcse_mem_operand, then set
    gcse_mems_conflict_p to a nonzero value.  */
 
 static void

-mems_conflict_for_gcse_p (rtx dest, rtx setter ATTRIBUTE_UNUSED,
+mems_conflict_for_gcse_p (rtx dest, const_rtx setter ATTRIBUTE_UNUSED,

                          void *data ATTRIBUTE_UNUSED)
 {
   while (GET_CODE (dest) == SUBREG
                          void *data ATTRIBUTE_UNUSED)
 {
   while (GET_CODE (dest) == SUBREG


@@ -1367,7 +1374,7 @@ mems_conflict_for_gcse_p (rtx dest, rtx setter ATTRIBUTE_UNUSED,
    AVAIL_P to 0.  */
 
 static int
    AVAIL_P to 0.  */
 
 static int

-load_killed_in_block_p (basic_block bb, int uid_limit, rtx x, int avail_p)
+load_killed_in_block_p (const_basic_block bb, int uid_limit, const_rtx x, int avail_p)

 {
   rtx list_entry = modify_mem_list[bb->index];
 
 {
   rtx list_entry = modify_mem_list[bb->index];
 


@@ -1415,7 +1422,7 @@ load_killed_in_block_p (basic_block bb, int uid_limit, rtx x, int avail_p)
    the start of INSN's basic block up to but not including INSN.  */
 
 static int
    the start of INSN's basic block up to but not including INSN.  */
 
 static int

-oprs_anticipatable_p (rtx x, rtx insn)
+oprs_anticipatable_p (const_rtx x, const_rtx insn)

 {
   return oprs_unchanged_p (x, insn, 0);
 }
 {
   return oprs_unchanged_p (x, insn, 0);
 }


@@ -1424,7 +1431,7 @@ oprs_anticipatable_p (rtx x, rtx insn)
    INSN to the end of INSN's basic block.  */
 
 static int
    INSN to the end of INSN's basic block.  */
 
 static int

-oprs_available_p (rtx x, rtx insn)
+oprs_available_p (const_rtx x, const_rtx insn)

 {
   return oprs_unchanged_p (x, insn, 1);
 }
 {
   return oprs_unchanged_p (x, insn, 1);
 }


@@ -1437,7 +1444,7 @@ oprs_available_p (rtx x, rtx insn)
    the current size of the hash table to be probed.  */
 
 static unsigned int
    the current size of the hash table to be probed.  */
 
 static unsigned int

-hash_expr (rtx x, enum machine_mode mode, int *do_not_record_p,
+hash_expr (const_rtx x, enum machine_mode mode, int *do_not_record_p,

           int hash_table_size)
 {
   unsigned int hash;
           int hash_table_size)
 {
   unsigned int hash;


@@ -1468,7 +1475,7 @@ hash_set (int regno, int hash_table_size)
 /* Return nonzero if exp1 is equivalent to exp2.  */
 
 static int
 /* Return nonzero if exp1 is equivalent to exp2.  */
 
 static int

-expr_equiv_p (rtx x, rtx y)
+expr_equiv_p (const_rtx x, const_rtx y)

 {
   return exp_equiv_p (x, y, 0, true);
 }
 {
   return exp_equiv_p (x, y, 0, true);
 }


@@ -1513,7 +1520,7 @@ insert_expr_in_table (rtx x, enum machine_mode mode, rtx insn, int antic_p,
 
   if (! found)
     {
 
   if (! found)
     {

-      cur_expr = gcse_alloc (sizeof (struct expr));
+      cur_expr = GOBNEW (struct expr);

       bytes_used += sizeof (struct expr);
       if (table->table[hash] == NULL)
        /* This is the first pattern that hashed to this index.  */
       bytes_used += sizeof (struct expr);
       if (table->table[hash] == NULL)
        /* This is the first pattern that hashed to this index.  */


@@ -1546,7 +1553,7 @@ insert_expr_in_table (rtx x, enum machine_mode mode, rtx insn, int antic_p,
       else
        {
          /* First occurrence of this expression in this basic block.  */
       else
        {
          /* First occurrence of this expression in this basic block.  */

-         antic_occr = gcse_alloc (sizeof (struct occr));
+         antic_occr = GOBNEW (struct occr);

          bytes_used += sizeof (struct occr);
          antic_occr->insn = insn;
          antic_occr->next = cur_expr->antic_occr;
          bytes_used += sizeof (struct occr);
          antic_occr->insn = insn;
          antic_occr->next = cur_expr->antic_occr;


@@ -1570,7 +1577,7 @@ insert_expr_in_table (rtx x, enum machine_mode mode, rtx insn, int antic_p,
       else
        {
          /* First occurrence of this expression in this basic block.  */
       else
        {
          /* First occurrence of this expression in this basic block.  */

-         avail_occr = gcse_alloc (sizeof (struct occr));
+         avail_occr = GOBNEW (struct occr);

          bytes_used += sizeof (struct occr);
          avail_occr->insn = insn;
          avail_occr->next = cur_expr->avail_occr;
          bytes_used += sizeof (struct occr);
          avail_occr->insn = insn;
          avail_occr->next = cur_expr->avail_occr;


@@ -1610,7 +1617,7 @@ insert_set_in_table (rtx x, rtx insn, struct hash_table *table)
 
   if (! found)
     {
 
   if (! found)
     {

-      cur_expr = gcse_alloc (sizeof (struct expr));
+      cur_expr = GOBNEW (struct expr);

       bytes_used += sizeof (struct expr);
       if (table->table[hash] == NULL)
        /* This is the first pattern that hashed to this index.  */
       bytes_used += sizeof (struct expr);
       if (table->table[hash] == NULL)
        /* This is the first pattern that hashed to this index.  */


@@ -1643,7 +1650,7 @@ insert_set_in_table (rtx x, rtx insn, struct hash_table *table)
   else
     {
       /* First occurrence of this expression in this basic block.  */
   else
     {
       /* First occurrence of this expression in this basic block.  */

-      cur_occr = gcse_alloc (sizeof (struct occr));
+      cur_occr = GOBNEW (struct occr);

       bytes_used += sizeof (struct occr);
 
          cur_occr->insn = insn;
       bytes_used += sizeof (struct occr);
 
          cur_occr->insn = insn;


@@ -1657,7 +1664,7 @@ insert_set_in_table (rtx x, rtx insn, struct hash_table *table)
    the purposes of GCSE's constant propagation.  */
 
 static bool
    the purposes of GCSE's constant propagation.  */
 
 static bool

-gcse_constant_p (rtx x)
+gcse_constant_p (const_rtx x)

 {
   /* Consider a COMPARE of two integers constant.  */
   if (GET_CODE (x) == COMPARE
 {
   /* Consider a COMPARE of two integers constant.  */
   if (GET_CODE (x) == COMPARE


@@ -1695,12 +1702,25 @@ hash_scan_set (rtx pat, rtx insn, struct hash_table *table)
       unsigned int regno = REGNO (dest);
       rtx tmp;
 
       unsigned int regno = REGNO (dest);
       rtx tmp;
 

-      /* See if a REG_NOTE shows this equivalent to a simpler expression.
+      /* See if a REG_EQUAL note shows this equivalent to a simpler expression.
+

         This allows us to do a single GCSE pass and still eliminate
         redundant constants, addresses or other expressions that are
         This allows us to do a single GCSE pass and still eliminate
         redundant constants, addresses or other expressions that are

-        constructed with multiple instructions.  */
+        constructed with multiple instructions.
+
+        However, keep the original SRC if INSN is a simple reg-reg move.  In
+        In this case, there will almost always be a REG_EQUAL note on the
+        insn that sets SRC.  By recording the REG_EQUAL value here as SRC
+        for INSN, we miss copy propagation opportunities and we perform the
+        same PRE GCSE operation repeatedly on the same REG_EQUAL value if we
+        do more than one PRE GCSE pass.
+
+        Note that this does not impede profitable constant propagations.  We
+        "look through" reg-reg sets in lookup_avail_set.  */

       note = find_reg_equal_equiv_note (insn);
       if (note != 0
       note = find_reg_equal_equiv_note (insn);
       if (note != 0

+         && REG_NOTE_KIND (note) == REG_EQUAL
+         && !REG_P (src)

          && (table->set_p
              ? gcse_constant_p (XEXP (note, 0))
              : want_to_gcse_p (XEXP (note, 0))))
          && (table->set_p
              ? gcse_constant_p (XEXP (note, 0))
              : want_to_gcse_p (XEXP (note, 0))))


@@ -1728,8 +1748,11 @@ hash_scan_set (rtx pat, rtx insn, struct hash_table *table)
        {
          /* An expression is not anticipatable if its operands are
             modified before this insn or if this is not the only SET in
        {
          /* An expression is not anticipatable if its operands are
             modified before this insn or if this is not the only SET in

-            this insn.  */
-         int antic_p = oprs_anticipatable_p (src, insn) && single_set (insn);
+            this insn.  The latter condition does not have to mean that
+            SRC itself is not anticipatable, but we just will not be
+            able to handle code motion of insns with multiple sets.  */
+         int antic_p = oprs_anticipatable_p (src, insn)
+                       && !multiple_sets (insn);

          /* An expression is not available if its operands are
             subsequently modified, including this insn.  It's also not
             available if this is a branch, because we can't insert
          /* An expression is not available if its operands are
             subsequently modified, including this insn.  It's also not
             available if this is a branch, because we can't insert


@@ -1752,8 +1775,9 @@ hash_scan_set (rtx pat, rtx insn, struct hash_table *table)
                  modified.  Here we want to search from INSN+1 on, but
                  oprs_available_p searches from INSN on.  */
               && (insn == BB_END (BLOCK_FOR_INSN (insn))
                  modified.  Here we want to search from INSN+1 on, but
                  oprs_available_p searches from INSN on.  */
               && (insn == BB_END (BLOCK_FOR_INSN (insn))

-                  || ((tmp = next_nonnote_insn (insn)) != NULL_RTX
-                      && oprs_available_p (pat, tmp))))
+                  || (tmp = next_nonnote_insn (insn)) == NULL_RTX
+                  || BLOCK_FOR_INSN (tmp) != BLOCK_FOR_INSN (insn)
+                  || oprs_available_p (pat, tmp)))

        insert_set_in_table (pat, insn, table);
     }
   /* In case of store we want to consider the memory value as available in
        insert_set_in_table (pat, insn, table);
     }
   /* In case of store we want to consider the memory value as available in


@@ -1824,19 +1848,14 @@ hash_scan_call (rtx x ATTRIBUTE_UNUSED, rtx insn ATTRIBUTE_UNUSED,
    are also in the PARALLEL.  Later.
 
    If SET_P is nonzero, this is for the assignment hash table,
    are also in the PARALLEL.  Later.
 
    If SET_P is nonzero, this is for the assignment hash table,

-   otherwise it is for the expression hash table.
-   If IN_LIBCALL_BLOCK nonzero, we are in a libcall block, and should
-   not record any expressions.  */
+   otherwise it is for the expression hash table.  */

 
 static void
 
 static void

-hash_scan_insn (rtx insn, struct hash_table *table, int in_libcall_block)
+hash_scan_insn (rtx insn, struct hash_table *table)

 {
   rtx pat = PATTERN (insn);
   int i;
 
 {
   rtx pat = PATTERN (insn);
   int i;
 

-  if (in_libcall_block)
-    return;
-

   /* Pick out the sets of INSN and for other forms of instructions record
      what's been modified.  */
 
   /* Pick out the sets of INSN and for other forms of instructions record
      what's been modified.  */
 


@@ -1870,8 +1889,8 @@ dump_hash_table (FILE *file, const char *name, struct hash_table *table)
   unsigned int *hash_val;
   struct expr *expr;
 
   unsigned int *hash_val;
   struct expr *expr;
 

-  flat_table = xcalloc (table->n_elems, sizeof (struct expr *));
-  hash_val = xmalloc (table->n_elems * sizeof (unsigned int));
+  flat_table = XCNEWVEC (struct expr *, table->n_elems);
+  hash_val = XNEWVEC (unsigned int, table->n_elems);

 
   for (i = 0; i < (int) table->size; i++)
     for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
 
   for (i = 0; i < (int) table->size; i++)
     for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)


@@ -1934,7 +1953,7 @@ record_last_reg_set_info (rtx insn, int regno)
    taken off pairwise.  */
 
 static void
    taken off pairwise.  */
 
 static void

-canon_list_insert (rtx dest ATTRIBUTE_UNUSED, rtx unused1 ATTRIBUTE_UNUSED,
+canon_list_insert (rtx dest ATTRIBUTE_UNUSED, const_rtx unused1 ATTRIBUTE_UNUSED,

                   void * v_insn)
 {
   rtx dest_addr, insn;
                   void * v_insn)
 {
   rtx dest_addr, insn;


@@ -1995,7 +2014,7 @@ record_last_mem_set_info (rtx insn)
    the SET is taking place.  */
 
 static void
    the SET is taking place.  */
 
 static void

-record_last_set_info (rtx dest, rtx setter ATTRIBUTE_UNUSED, void *data)
+record_last_set_info (rtx dest, const_rtx setter ATTRIBUTE_UNUSED, void *data)

 {
   rtx last_set_insn = (rtx) data;
 
 {
   rtx last_set_insn = (rtx) data;
 


@@ -2040,7 +2059,7 @@ compute_hash_table_work (struct hash_table *table)
   /* re-Cache any INSN_LIST nodes we have allocated.  */
   clear_modify_mem_tables ();
   /* Some working arrays used to track first and last set in each block.  */
   /* re-Cache any INSN_LIST nodes we have allocated.  */
   clear_modify_mem_tables ();
   /* Some working arrays used to track first and last set in each block.  */

-  reg_avail_info = gmalloc (max_gcse_regno * sizeof (struct reg_avail_info));
+  reg_avail_info = GNEWVEC (struct reg_avail_info, max_gcse_regno);

 
   for (i = 0; i < max_gcse_regno; ++i)
     reg_avail_info[i].last_bb = NULL;
 
   for (i = 0; i < max_gcse_regno; ++i)
     reg_avail_info[i].last_bb = NULL;


@@ -2049,7 +2068,6 @@ compute_hash_table_work (struct hash_table *table)
     {
       rtx insn;
       unsigned int regno;
     {
       rtx insn;
       unsigned int regno;

-      int in_libcall_block;

 
       /* First pass over the instructions records information used to
         determine when registers and memory are first and last set.
 
       /* First pass over the instructions records information used to
         determine when registers and memory are first and last set.


@@ -2080,18 +2098,9 @@ compute_hash_table_work (struct hash_table *table)
                       BB_HEAD (current_bb), table);
 
       /* The next pass builds the hash table.  */
                       BB_HEAD (current_bb), table);
 
       /* The next pass builds the hash table.  */

-      in_libcall_block = 0;

       FOR_BB_INSNS (current_bb, insn)
        if (INSN_P (insn))
       FOR_BB_INSNS (current_bb, insn)
        if (INSN_P (insn))

-         {
-           if (find_reg_note (insn, REG_LIBCALL, NULL_RTX))
-             in_libcall_block = 1;
-           else if (table->set_p && find_reg_note (insn, REG_RETVAL, NULL_RTX))
-             in_libcall_block = 0;
-           hash_scan_insn (insn, table, in_libcall_block);
-           if (!table->set_p && find_reg_note (insn, REG_RETVAL, NULL_RTX))
-             in_libcall_block = 0;
-         }
+         hash_scan_insn (insn, table);

     }
 
   free (reg_avail_info);
     }
 
   free (reg_avail_info);


@@ -2118,7 +2127,7 @@ alloc_hash_table (int n_insns, struct hash_table *table, int set_p)
      ??? Later take some measurements.  */
   table->size |= 1;
   n = table->size * sizeof (struct expr *);
      ??? Later take some measurements.  */
   table->size |= 1;
   n = table->size * sizeof (struct expr *);

-  table->table = gmalloc (n);
+  table->table = GNEWVAR (struct expr *, n);

   table->set_p = set_p;
 }
 
   table->set_p = set_p;
 }
 


@@ -2242,7 +2251,7 @@ reset_opr_set_tables (void)
    INSN's basic block.  */
 
 static int
    INSN's basic block.  */
 
 static int

-oprs_not_set_p (rtx x, rtx insn)
+oprs_not_set_p (const_rtx x, const_rtx insn)

 {
   int i, j;
   enum rtx_code code;
 {
   int i, j;
   enum rtx_code code;


@@ -2259,6 +2268,7 @@ oprs_not_set_p (rtx x, rtx insn)
     case CONST:
     case CONST_INT:
     case CONST_DOUBLE:
     case CONST:
     case CONST_INT:
     case CONST_DOUBLE:

+    case CONST_FIXED:

     case CONST_VECTOR:
     case SYMBOL_REF:
     case LABEL_REF:
     case CONST_VECTOR:
     case SYMBOL_REF:
     case LABEL_REF:


@@ -2307,7 +2317,7 @@ oprs_not_set_p (rtx x, rtx insn)
 static void
 mark_call (rtx insn)
 {
 static void
 mark_call (rtx insn)
 {

-  if (! CONST_OR_PURE_CALL_P (insn))
+  if (! RTL_CONST_OR_PURE_CALL_P (insn))

     record_last_mem_set_info (insn);
 }
 
     record_last_mem_set_info (insn);
 }
 


@@ -2420,7 +2430,7 @@ free_cprop_mem (void)
    bit in BMAP.  */
 
 static void
    bit in BMAP.  */
 
 static void

-compute_transp (rtx x, int indx, sbitmap *bmap, int set_p)
+compute_transp (const_rtx x, int indx, sbitmap *bmap, int set_p)

 {
   int i, j;
   basic_block bb;
 {
   int i, j;
   basic_block bb;


@@ -2527,6 +2537,7 @@ compute_transp (rtx x, int indx, sbitmap *bmap, int set_p)
     case CONST:
     case CONST_INT:
     case CONST_DOUBLE:
     case CONST:
     case CONST_INT:
     case CONST_DOUBLE:

+    case CONST_FIXED:

     case CONST_VECTOR:
     case SYMBOL_REF:
     case LABEL_REF:
     case CONST_VECTOR:
     case SYMBOL_REF:
     case LABEL_REF:


@@ -2669,8 +2680,8 @@ try_replace_reg (rtx from, rtx to, rtx insn)
      with our replacement.  */
   if (note != 0 && REG_NOTE_KIND (note) == REG_EQUAL)
     set_unique_reg_note (insn, REG_EQUAL,
      with our replacement.  */
   if (note != 0 && REG_NOTE_KIND (note) == REG_EQUAL)
     set_unique_reg_note (insn, REG_EQUAL,

-                        simplify_replace_rtx (XEXP (note, 0), from, to));
-
+                        simplify_replace_rtx (XEXP (note, 0), from,
+                        copy_rtx (to)));

   if (!success && set && reg_mentioned_p (from, SET_SRC (set)))
     {
       /* If above failed and this is a single set, try to simplify the source of
   if (!success && set && reg_mentioned_p (from, SET_SRC (set)))
     {
       /* If above failed and this is a single set, try to simplify the source of


@@ -2778,7 +2789,7 @@ find_avail_set (int regno, rtx insn)
 static int
 cprop_jump (basic_block bb, rtx setcc, rtx jump, rtx from, rtx src)
 {
 static int
 cprop_jump (basic_block bb, rtx setcc, rtx jump, rtx from, rtx src)
 {

-  rtx new, set_src, note_src;
+  rtx new_rtx, set_src, note_src;

   rtx set = pc_set (jump);
   rtx note = find_reg_equal_equiv_note (jump);
 
   rtx set = pc_set (jump);
   rtx note = find_reg_equal_equiv_note (jump);
 


@@ -2810,22 +2821,22 @@ cprop_jump (basic_block bb, rtx setcc, rtx jump, rtx from, rtx src)
   else
     setcc = NULL_RTX;
 
   else
     setcc = NULL_RTX;
 

-  new = simplify_replace_rtx (set_src, from, src);
+  new_rtx = simplify_replace_rtx (set_src, from, src);

 
   /* If no simplification can be made, then try the next register.  */
 
   /* If no simplification can be made, then try the next register.  */

-  if (rtx_equal_p (new, SET_SRC (set)))
+  if (rtx_equal_p (new_rtx, SET_SRC (set)))

     return 0;
 
   /* If this is now a no-op delete it, otherwise this must be a valid insn.  */
     return 0;
 
   /* If this is now a no-op delete it, otherwise this must be a valid insn.  */

-  if (new == pc_rtx)
+  if (new_rtx == pc_rtx)

     delete_insn (jump);
   else
     {
       /* Ensure the value computed inside the jump insn to be equivalent
          to one computed by setcc.  */
     delete_insn (jump);
   else
     {
       /* Ensure the value computed inside the jump insn to be equivalent
          to one computed by setcc.  */

-      if (setcc && modified_in_p (new, setcc))
+      if (setcc && modified_in_p (new_rtx, setcc))

        return 0;
        return 0;

-      if (! validate_change (jump, &SET_SRC (set), new, 0))
+      if (! validate_unshare_change (jump, &SET_SRC (set), new_rtx, 0))

        {
          /* When (some) constants are not valid in a comparison, and there
             are two registers to be replaced by constants before the entire
        {
          /* When (some) constants are not valid in a comparison, and there
             are two registers to be replaced by constants before the entire


@@ -2836,20 +2847,14 @@ cprop_jump (basic_block bb, rtx setcc, rtx jump, rtx from, rtx src)
             we need to attach a note to the branch itself to make this
             optimization work.  */
 
             we need to attach a note to the branch itself to make this
             optimization work.  */
 

-         if (!rtx_equal_p (new, note_src))
-           set_unique_reg_note (jump, REG_EQUAL, copy_rtx (new));
+         if (!rtx_equal_p (new_rtx, note_src))
+           set_unique_reg_note (jump, REG_EQUAL, copy_rtx (new_rtx));

          return 0;
        }
 
       /* Remove REG_EQUAL note after simplification.  */
       if (note_src)
        remove_note (jump, note);
          return 0;
        }
 
       /* Remove REG_EQUAL note after simplification.  */
       if (note_src)
        remove_note (jump, note);

-
-      /* If this has turned into an unconditional jump,
-        then put a barrier after it so that the unreachable
-        code will be deleted.  */
-      if (GET_CODE (SET_SRC (set)) == LABEL_REF)
-       emit_barrier_after (jump);

      }
 
 #ifdef HAVE_cc0
      }
 
 #ifdef HAVE_cc0


@@ -2871,6 +2876,24 @@ cprop_jump (basic_block bb, rtx setcc, rtx jump, rtx from, rtx src)
     }
   purge_dead_edges (bb);
 
     }
   purge_dead_edges (bb);
 

+  /* If a conditional jump has been changed into unconditional jump, remove
+     the jump and make the edge fallthru - this is always called in
+     cfglayout mode.  */
+  if (new_rtx != pc_rtx && simplejump_p (jump))
+    {
+      edge e;
+      edge_iterator ei;
+
+      for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ei_next (&ei))
+       if (e->dest != EXIT_BLOCK_PTR
+           && BB_HEAD (e->dest) == JUMP_LABEL (jump))
+         {
+           e->flags |= EDGE_FALLTHRU;
+           break;
+         }
+      delete_insn (jump);
+    }
+

   return 1;
 }
 
   return 1;
 }
 


@@ -3049,11 +3072,11 @@ local_cprop_find_used_regs (rtx *xptr, void *data)
   find_used_regs (xptr, data);
 }
 
   find_used_regs (xptr, data);
 }
 

-/* LIBCALL_SP is a zero-terminated array of insns at the end of a libcall;
-   their REG_EQUAL notes need updating.  */
+/* Try to perform local const/copy propagation on X in INSN.
+   If ALTER_JUMPS is false, changing jump insns is not allowed.  */

 
 static bool
 
 static bool

-do_local_cprop (rtx x, rtx insn, bool alter_jumps, rtx *libcall_sp)
+do_local_cprop (rtx x, rtx insn, bool alter_jumps)

 {
   rtx newreg = NULL, newcnst = NULL;
 
 {
   rtx newreg = NULL, newcnst = NULL;
 


@@ -3074,10 +3097,6 @@ do_local_cprop (rtx x, rtx insn, bool alter_jumps, rtx *libcall_sp)
          rtx this_rtx = l->loc;
          rtx note;
 
          rtx this_rtx = l->loc;
          rtx note;
 

-         /* Don't CSE non-constant values out of libcall blocks.  */
-         if (l->in_libcall && ! CONSTANT_P (this_rtx))
-           continue;
-

          if (gcse_constant_p (this_rtx))
            newcnst = this_rtx;
          if (REG_P (this_rtx) && REGNO (this_rtx) >= FIRST_PSEUDO_REGISTER
          if (gcse_constant_p (this_rtx))
            newcnst = this_rtx;
          if (REG_P (this_rtx) && REGNO (this_rtx) >= FIRST_PSEUDO_REGISTER


@@ -3092,16 +3111,6 @@ do_local_cprop (rtx x, rtx insn, bool alter_jumps, rtx *libcall_sp)
        }
       if (newcnst && constprop_register (insn, x, newcnst, alter_jumps))
        {
        }
       if (newcnst && constprop_register (insn, x, newcnst, alter_jumps))
        {

-         /* If we find a case where we can't fix the retval REG_EQUAL notes
-            match the new register, we either have to abandon this replacement
-            or fix delete_trivially_dead_insns to preserve the setting insn,
-            or make it delete the REG_EUAQL note, and fix up all passes that
-            require the REG_EQUAL note there.  */
-         bool adjusted;
-
-         adjusted = adjust_libcall_notes (x, newcnst, insn, libcall_sp);
-         gcc_assert (adjusted);
-         

          if (dump_file != NULL)
            {
              fprintf (dump_file, "LOCAL CONST-PROP: Replacing reg %d in ",
          if (dump_file != NULL)
            {
              fprintf (dump_file, "LOCAL CONST-PROP: Replacing reg %d in ",


@@ -3116,7 +3125,6 @@ do_local_cprop (rtx x, rtx insn, bool alter_jumps, rtx *libcall_sp)
        }
       else if (newreg && newreg != x && try_replace_reg (x, newreg, insn))
        {
        }
       else if (newreg && newreg != x && try_replace_reg (x, newreg, insn))
        {

-         adjust_libcall_notes (x, newreg, insn, libcall_sp);

          if (dump_file != NULL)
            {
              fprintf (dump_file,
          if (dump_file != NULL)
            {
              fprintf (dump_file,


@@ -3131,46 +3139,6 @@ do_local_cprop (rtx x, rtx insn, bool alter_jumps, rtx *libcall_sp)
   return false;
 }
 
   return false;
 }
 

-/* LIBCALL_SP is a zero-terminated array of insns at the end of a libcall;
-   their REG_EQUAL notes need updating to reflect that OLDREG has been
-   replaced with NEWVAL in INSN.  Return true if all substitutions could
-   be made.  */
-static bool
-adjust_libcall_notes (rtx oldreg, rtx newval, rtx insn, rtx *libcall_sp)
-{
-  rtx end;
-
-  while ((end = *libcall_sp++))
-    {
-      rtx note = find_reg_equal_equiv_note (end);
-
-      if (! note)
-       continue;
-
-      if (REG_P (newval))
-       {
-         if (reg_set_between_p (newval, PREV_INSN (insn), end))
-           {
-             do
-               {
-                 note = find_reg_equal_equiv_note (end);
-                 if (! note)
-                   continue;
-                 if (reg_mentioned_p (newval, XEXP (note, 0)))
-                   return false;
-               }
-             while ((end = *libcall_sp++));
-             return true;
-           }
-       }
-      XEXP (note, 0) = simplify_replace_rtx (XEXP (note, 0), oldreg, newval);
-      insn = end;
-    }
-  return true;
-}
-
-#define MAX_NESTED_LIBCALLS 9
-

 /* Do local const/copy propagation (i.e. within each basic block).
    If ALTER_JUMPS is true, allow propagating into jump insns, which
    could modify the CFG.  */
 /* Do local const/copy propagation (i.e. within each basic block).
    If ALTER_JUMPS is true, allow propagating into jump insns, which
    could modify the CFG.  */


@@ -3181,29 +3149,16 @@ local_cprop_pass (bool alter_jumps)
   basic_block bb;
   rtx insn;
   struct reg_use *reg_used;
   basic_block bb;
   rtx insn;
   struct reg_use *reg_used;

-  rtx libcall_stack[MAX_NESTED_LIBCALLS + 1], *libcall_sp;

   bool changed = false;
 
   cselib_init (false);
   bool changed = false;
 
   cselib_init (false);

-  libcall_sp = &libcall_stack[MAX_NESTED_LIBCALLS];
-  *libcall_sp = 0;

   FOR_EACH_BB (bb)
     {
       FOR_BB_INSNS (bb, insn)
        {
          if (INSN_P (insn))
            {
   FOR_EACH_BB (bb)
     {
       FOR_BB_INSNS (bb, insn)
        {
          if (INSN_P (insn))
            {

-             rtx note = find_reg_note (insn, REG_LIBCALL, NULL_RTX);
-
-             if (note)
-               {
-                 gcc_assert (libcall_sp != libcall_stack);
-                 *--libcall_sp = XEXP (note, 0);
-               }
-             note = find_reg_note (insn, REG_RETVAL, NULL_RTX);
-             if (note)
-               libcall_sp++;
-             note = find_reg_equal_equiv_note (insn);
+             rtx note = find_reg_equal_equiv_note (insn);

              do
                {
                  reg_use_count = 0;
              do
                {
                  reg_use_count = 0;


@@ -3214,12 +3169,13 @@ local_cprop_pass (bool alter_jumps)
 
                  for (reg_used = &reg_use_table[0]; reg_use_count > 0;
                       reg_used++, reg_use_count--)
 
                  for (reg_used = &reg_use_table[0]; reg_use_count > 0;
                       reg_used++, reg_use_count--)

-                   if (do_local_cprop (reg_used->reg_rtx, insn, alter_jumps,
-                       libcall_sp))
-                     {
-                       changed = true;
-                       break;
-                     }
+                   {
+                     if (do_local_cprop (reg_used->reg_rtx, insn, alter_jumps))
+                       {
+                         changed = true;
+                         break;
+                       }
+                   }

                  if (INSN_DELETED_P (insn))
                    break;
                }
                  if (INSN_DELETED_P (insn))
                    break;
                }


@@ -3228,10 +3184,8 @@ local_cprop_pass (bool alter_jumps)
          cselib_process_insn (insn);
        }
 
          cselib_process_insn (insn);
        }
 

-      /* Forget everything at the end of a basic block.  Make sure we are
-        not inside a libcall, they should never cross basic blocks.  */
+      /* Forget everything at the end of a basic block.  */

       cselib_clear_table ();
       cselib_clear_table ();

-      gcc_assert (libcall_sp == &libcall_stack[MAX_NESTED_LIBCALLS]);

     }
 
   cselib_finish ();
     }
 
   cselib_finish ();


@@ -3310,10 +3264,10 @@ fis_get_condition (rtx jump)
    it.  COND is either an EQ or NE comparison.  */
 
 static bool
    it.  COND is either an EQ or NE comparison.  */
 
 static bool

-implicit_set_cond_p (rtx cond)
+implicit_set_cond_p (const_rtx cond)

 {
 {

-  enum machine_mode mode = GET_MODE (XEXP (cond, 0));
-  rtx cst = XEXP (cond, 1);
+  const enum machine_mode mode = GET_MODE (XEXP (cond, 0));
+  const_rtx cst = XEXP (cond, 1);

 
   /* We can't perform this optimization if either operand might be or might
      contain a signed zero.  */
 
   /* We can't perform this optimization if either operand might be or might
      contain a signed zero.  */


@@ -3350,7 +3304,7 @@ find_implicit_sets (void)
 {
   basic_block bb, dest;
   unsigned int count;
 {
   basic_block bb, dest;
   unsigned int count;

-  rtx cond, new;
+  rtx cond, new_rtx;

 
   count = 0;
   FOR_EACH_BB (bb)
 
   count = 0;
   FOR_EACH_BB (bb)


@@ -3371,9 +3325,9 @@ find_implicit_sets (void)
            if (dest && single_pred_p (dest)
                && dest != EXIT_BLOCK_PTR)
              {
            if (dest && single_pred_p (dest)
                && dest != EXIT_BLOCK_PTR)
              {

-               new = gen_rtx_SET (VOIDmode, XEXP (cond, 0),
+               new_rtx = gen_rtx_SET (VOIDmode, XEXP (cond, 0),

                                             XEXP (cond, 1));
                                             XEXP (cond, 1));

-               implicit_sets[dest->index] = new;
+               implicit_sets[dest->index] = new_rtx;

                if (dump_file)
                  {
                    fprintf(dump_file, "Implicit set of reg %d in ",
                if (dump_file)
                  {
                    fprintf(dump_file, "Implicit set of reg %d in ",


@@ -3501,7 +3455,7 @@ find_bypass_set (int regno, int bb)
    valid prior to commit_edge_insertions.  */
 
 static bool
    valid prior to commit_edge_insertions.  */
 
 static bool

-reg_killed_on_edge (rtx reg, edge e)
+reg_killed_on_edge (const_rtx reg, const_edge e)

 {
   rtx insn;
 
 {
   rtx insn;
 


@@ -3583,7 +3537,7 @@ bypass_block (basic_block bb, rtx setcc, rtx jump)
          unsigned int regno = REGNO (reg_used->reg_rtx);
          basic_block dest, old_dest;
          struct expr *set;
          unsigned int regno = REGNO (reg_used->reg_rtx);
          basic_block dest, old_dest;
          struct expr *set;

-         rtx src, new;
+         rtx src, new_rtx;

 
          if (regno >= max_gcse_regno)
            continue;
 
          if (regno >= max_gcse_regno)
            continue;


@@ -3604,7 +3558,7 @@ bypass_block (basic_block bb, rtx setcc, rtx jump)
                                          SET_DEST (PATTERN (setcc)),
                                          SET_SRC (PATTERN (setcc)));
 
                                          SET_DEST (PATTERN (setcc)),
                                          SET_SRC (PATTERN (setcc)));
 

-         new = simplify_replace_rtx (src, reg_used->reg_rtx,
+         new_rtx = simplify_replace_rtx (src, reg_used->reg_rtx,

                                      SET_SRC (set->expr));
 
          /* Jump bypassing may have already placed instructions on
                                      SET_SRC (set->expr));
 
          /* Jump bypassing may have already placed instructions on


@@ -3612,14 +3566,14 @@ bypass_block (basic_block bb, rtx setcc, rtx jump)
             has instructions associated with it, as these insns won't
             get executed if the incoming edge is redirected.  */
 
             has instructions associated with it, as these insns won't
             get executed if the incoming edge is redirected.  */
 

-         if (new == pc_rtx)
+         if (new_rtx == pc_rtx)

            {
              edest = FALLTHRU_EDGE (bb);
              dest = edest->insns.r ? NULL : edest->dest;
            }
            {
              edest = FALLTHRU_EDGE (bb);
              dest = edest->insns.r ? NULL : edest->dest;
            }

-         else if (GET_CODE (new) == LABEL_REF)
+         else if (GET_CODE (new_rtx) == LABEL_REF)

            {
            {

-             dest = BLOCK_FOR_INSN (XEXP (new, 0));
+             dest = BLOCK_FOR_INSN (XEXP (new_rtx, 0));

              /* Don't bypass edges containing instructions.  */
              edest = find_edge (bb, dest);
              if (edest && edest->insns.r)
              /* Don't bypass edges containing instructions.  */
              edest = find_edge (bb, dest);
              if (edest && edest->insns.r)


@@ -3991,7 +3945,7 @@ process_insert_insn (struct expr *expr)
    no sense for code hoisting.  */
 
 static void
    no sense for code hoisting.  */
 
 static void

-insert_insn_end_bb (struct expr *expr, basic_block bb, int pre)
+insert_insn_end_basic_block (struct expr *expr, basic_block bb, int pre)

 {
   rtx insn = BB_END (bb);
   rtx new_insn;
 {
   rtx insn = BB_END (bb);
   rtx new_insn;


@@ -4048,7 +4002,7 @@ insert_insn_end_bb (struct expr *expr, basic_block bb, int pre)
        }
 #endif
       /* FIXME: What if something in cc0/jump uses value set in new insn?  */
        }
 #endif
       /* FIXME: What if something in cc0/jump uses value set in new insn?  */

-      new_insn = emit_insn_before_noloc (pat, insn);
+      new_insn = emit_insn_before_noloc (pat, insn, bb);

     }
 
   /* Likewise if the last insn is a call, as will happen in the presence
     }
 
   /* Likewise if the last insn is a call, as will happen in the presence


@@ -4087,10 +4041,10 @@ insert_insn_end_bb (struct expr *expr, basic_block bb, int pre)
             || NOTE_INSN_BASIC_BLOCK_P (insn))
        insn = NEXT_INSN (insn);
 
             || NOTE_INSN_BASIC_BLOCK_P (insn))
        insn = NEXT_INSN (insn);
 

-      new_insn = emit_insn_before_noloc (pat, insn);
+      new_insn = emit_insn_before_noloc (pat, insn, bb);

     }
   else
     }
   else

-    new_insn = emit_insn_after_noloc (pat, insn);
+    new_insn = emit_insn_after_noloc (pat, insn, bb);

 
   while (1)
     {
 
   while (1)
     {


@@ -4168,7 +4122,7 @@ pre_edge_insert (struct edge_list *edge_list, struct expr **index_map)
                           now.  */
 
                        if (eg->flags & EDGE_ABNORMAL)
                           now.  */
 
                        if (eg->flags & EDGE_ABNORMAL)

-                         insert_insn_end_bb (index_map[j], bb, 0);
+                         insert_insn_end_basic_block (index_map[j], bb, 0);

                        else
                          {
                            insn = process_insert_insn (index_map[j]);
                        else
                          {
                            insn = process_insert_insn (index_map[j]);


@@ -4380,7 +4334,7 @@ pre_insert_copies (void)
 static rtx
 gcse_emit_move_after (rtx src, rtx dest, rtx insn)
 {
 static rtx
 gcse_emit_move_after (rtx src, rtx dest, rtx insn)
 {

-  rtx new;
+  rtx new_rtx;

   rtx set = single_set (insn), set2;
   rtx note;
   rtx eqv;
   rtx set = single_set (insn), set2;
   rtx note;
   rtx eqv;


@@ -4388,20 +4342,20 @@ gcse_emit_move_after (rtx src, rtx dest, rtx insn)
   /* This should never fail since we're creating a reg->reg copy
      we've verified to be valid.  */
 
   /* This should never fail since we're creating a reg->reg copy
      we've verified to be valid.  */
 

-  new = emit_insn_after (gen_move_insn (dest, src), insn);
+  new_rtx = emit_insn_after (gen_move_insn (dest, src), insn);

 
   /* Note the equivalence for local CSE pass.  */
 
   /* Note the equivalence for local CSE pass.  */

-  set2 = single_set (new);
+  set2 = single_set (new_rtx);

   if (!set2 || !rtx_equal_p (SET_DEST (set2), dest))
   if (!set2 || !rtx_equal_p (SET_DEST (set2), dest))

-    return new;
+    return new_rtx;

   if ((note = find_reg_equal_equiv_note (insn)))
     eqv = XEXP (note, 0);
   else
     eqv = SET_SRC (set);
 
   if ((note = find_reg_equal_equiv_note (insn)))
     eqv = XEXP (note, 0);
   else
     eqv = SET_SRC (set);
 

-  set_unique_reg_note (new, REG_EQUAL, copy_insn_1 (eqv));
+  set_unique_reg_note (new_rtx, REG_EQUAL, copy_insn_1 (eqv));

 
 

-  return new;
+  return new_rtx;

 }
 
 /* Delete redundant computations.
 }
 
 /* Delete redundant computations.


@@ -4438,14 +4392,14 @@ pre_delete (void)
 
            /* We only delete insns that have a single_set.  */
            if (TEST_BIT (pre_delete_map[bb->index], indx)
 
            /* We only delete insns that have a single_set.  */
            if (TEST_BIT (pre_delete_map[bb->index], indx)

-               && (set = single_set (insn)) != 0)
+               && (set = single_set (insn)) != 0
+                && dbg_cnt (pre_insn))

              {
                /* Create a pseudo-reg to store the result of reaching
                   expressions into.  Get the mode for the new pseudo from
                   the mode of the original destination pseudo.  */
                if (expr->reaching_reg == NULL)
              {
                /* Create a pseudo-reg to store the result of reaching
                   expressions into.  Get the mode for the new pseudo from
                   the mode of the original destination pseudo.  */
                if (expr->reaching_reg == NULL)

-                 expr->reaching_reg
-                   = gen_reg_rtx (GET_MODE (SET_DEST (set)));
+                 expr->reaching_reg = gen_reg_rtx_and_attrs (SET_DEST (set));

 
                gcse_emit_move_after (expr->reaching_reg, SET_DEST (set), insn);
                delete_insn (insn);
 
                gcse_emit_move_after (expr->reaching_reg, SET_DEST (set), insn);
                delete_insn (insn);


@@ -4515,7 +4469,6 @@ pre_gcse (void)
      - we know which insns are redundant when we go to create copies  */
 
   changed = pre_delete ();
      - we know which insns are redundant when we go to create copies  */
 
   changed = pre_delete ();

-

   did_insert = pre_edge_insert (edge_list, index_map);
 
   /* In other places with reaching expressions, copy the expression to the
   did_insert = pre_edge_insert (edge_list, index_map);
 
   /* In other places with reaching expressions, copy the expression to the


@@ -4578,14 +4531,15 @@ one_pre_gcse_pass (int pass)
   return changed;
 }
 \f
   return changed;
 }
 \f

-/* If X contains any LABEL_REF's, add REG_LABEL notes for them to INSN.
-   If notes are added to an insn which references a CODE_LABEL, the
-   LABEL_NUSES count is incremented.  We have to add REG_LABEL notes,
-   because the following loop optimization pass requires them.  */
+/* If X contains any LABEL_REF's, add REG_LABEL_OPERAND notes for them
+   to INSN.  If such notes are added to an insn which references a
+   CODE_LABEL, the LABEL_NUSES count is incremented.  We have to add
+   that note, because the following loop optimization pass requires
+   them.  */

 
 /* ??? If there was a jump optimization pass after gcse and before loop,
    then we would not need to do this here, because jump would add the
 
 /* ??? If there was a jump optimization pass after gcse and before loop,
    then we would not need to do this here, because jump would add the

-   necessary REG_LABEL notes.  */
+   necessary REG_LABEL_OPERAND and REG_LABEL_TARGET notes.  */

 
 static void
 add_label_notes (rtx x, rtx insn)
 
 static void
 add_label_notes (rtx x, rtx insn)


@@ -4602,10 +4556,15 @@ add_label_notes (rtx x, rtx insn)
         We no longer ignore such label references (see LABEL_REF handling in
         mark_jump_label for additional information).  */
 
         We no longer ignore such label references (see LABEL_REF handling in
         mark_jump_label for additional information).  */
 

-      REG_NOTES (insn) = gen_rtx_INSN_LIST (REG_LABEL, XEXP (x, 0),
-                                           REG_NOTES (insn));
+      /* There's no reason for current users to emit jump-insns with
+        such a LABEL_REF, so we don't have to handle REG_LABEL_TARGET
+        notes.  */
+      gcc_assert (!JUMP_P (insn));
+      add_reg_note (insn, REG_LABEL_OPERAND, XEXP (x, 0));
+

       if (LABEL_P (XEXP (x, 0)))
        LABEL_NUSES (XEXP (x, 0))++;
       if (LABEL_P (XEXP (x, 0)))
        LABEL_NUSES (XEXP (x, 0))++;

+

       return;
     }
 
       return;
     }
 


@@ -4643,7 +4602,7 @@ compute_transpout (void)
 
   FOR_EACH_BB (bb)
     {
 
   FOR_EACH_BB (bb)
     {

-      /* Note that flow inserted a nop a the end of basic blocks that
+      /* Note that flow inserted a nop at the end of basic blocks that

         end in call instructions for reasons other than abnormal
         control flow.  */
       if (! CALL_P (BB_END (bb)))
         end in call instructions for reasons other than abnormal
         control flow.  */
       if (! CALL_P (BB_END (bb)))


@@ -4738,10 +4697,14 @@ compute_code_hoist_vbeinout (void)
         the convergence.  */
       FOR_EACH_BB_REVERSE (bb)
        {
         the convergence.  */
       FOR_EACH_BB_REVERSE (bb)
        {

-         changed |= sbitmap_a_or_b_and_c_cg (hoist_vbein[bb->index], antloc[bb->index],
-                                             hoist_vbeout[bb->index], transp[bb->index]);

          if (bb->next_bb != EXIT_BLOCK_PTR)
          if (bb->next_bb != EXIT_BLOCK_PTR)

-           sbitmap_intersection_of_succs (hoist_vbeout[bb->index], hoist_vbein, bb->index);
+           sbitmap_intersection_of_succs (hoist_vbeout[bb->index],
+                                          hoist_vbein, bb->index);
+
+         changed |= sbitmap_a_or_b_and_c_cg (hoist_vbein[bb->index],
+                                             antloc[bb->index],
+                                             hoist_vbeout[bb->index],
+                                             transp[bb->index]);

        }
 
       passes++;
        }
 
       passes++;


@@ -4829,8 +4792,7 @@ static void
 hoist_code (void)
 {
   basic_block bb, dominated;
 hoist_code (void)
 {
   basic_block bb, dominated;

-  basic_block *domby;
-  unsigned int domby_len;
+  VEC (basic_block, heap) *domby;

   unsigned int i,j;
   struct expr **index_map;
   struct expr *expr;
   unsigned int i,j;
   struct expr **index_map;
   struct expr *expr;


@@ -4852,7 +4814,7 @@ hoist_code (void)
       int found = 0;
       int insn_inserted_p;
 
       int found = 0;
       int insn_inserted_p;
 

-      domby_len = get_dominated_by (CDI_DOMINATORS, bb, &domby);
+      domby = get_dominated_by (CDI_DOMINATORS, bb);

       /* Examine each expression that is very busy at the exit of this
         block.  These are the potentially hoistable expressions.  */
       for (i = 0; i < hoist_vbeout[bb->index]->n_bits; i++)
       /* Examine each expression that is very busy at the exit of this
         block.  These are the potentially hoistable expressions.  */
       for (i = 0; i < hoist_vbeout[bb->index]->n_bits; i++)


@@ -4865,9 +4827,8 @@ hoist_code (void)
              /* We've found a potentially hoistable expression, now
                 we look at every block BB dominates to see if it
                 computes the expression.  */
              /* We've found a potentially hoistable expression, now
                 we look at every block BB dominates to see if it
                 computes the expression.  */

-             for (j = 0; j < domby_len; j++)
+             for (j = 0; VEC_iterate (basic_block, domby, j, dominated); j++)

                {
                {

-                 dominated = domby[j];

                  /* Ignore self dominance.  */
                  if (bb == dominated)
                    continue;
                  /* Ignore self dominance.  */
                  if (bb == dominated)
                    continue;


@@ -4906,8 +4867,8 @@ hoist_code (void)
       /* If we found nothing to hoist, then quit now.  */
       if (! found)
         {
       /* If we found nothing to hoist, then quit now.  */
       if (! found)
         {

-         free (domby);
-       continue;
+         VEC_free (basic_block, heap, domby);
+         continue;

        }
 
       /* Loop over all the hoistable expressions.  */
        }
 
       /* Loop over all the hoistable expressions.  */


@@ -4923,9 +4884,8 @@ hoist_code (void)
              /* We've found a potentially hoistable expression, now
                 we look at every block BB dominates to see if it
                 computes the expression.  */
              /* We've found a potentially hoistable expression, now
                 we look at every block BB dominates to see if it
                 computes the expression.  */

-             for (j = 0; j < domby_len; j++)
+             for (j = 0; VEC_iterate (basic_block, domby, j, dominated); j++)

                {
                {

-                 dominated = domby[j];

                  /* Ignore self dominance.  */
                  if (bb == dominated)
                    continue;
                  /* Ignore self dominance.  */
                  if (bb == dominated)
                    continue;


@@ -4962,21 +4922,21 @@ hoist_code (void)
                         from the mode of the original destination pseudo.  */
                      if (expr->reaching_reg == NULL)
                        expr->reaching_reg
                         from the mode of the original destination pseudo.  */
                      if (expr->reaching_reg == NULL)
                        expr->reaching_reg

-                         = gen_reg_rtx (GET_MODE (SET_DEST (set)));
+                         = gen_reg_rtx_and_attrs (SET_DEST (set));

 
                      gcse_emit_move_after (expr->reaching_reg, SET_DEST (set), insn);
                      delete_insn (insn);
                      occr->deleted_p = 1;
                      if (!insn_inserted_p)
                        {
 
                      gcse_emit_move_after (expr->reaching_reg, SET_DEST (set), insn);
                      delete_insn (insn);
                      occr->deleted_p = 1;
                      if (!insn_inserted_p)
                        {

-                         insert_insn_end_bb (index_map[i], bb, 0);
+                         insert_insn_end_basic_block (index_map[i], bb, 0);

                          insn_inserted_p = 1;
                        }
                    }
                }
            }
        }
                          insn_inserted_p = 1;
                        }
                    }
                }
            }
        }

-      free (domby);
+      VEC_free (basic_block, heap, domby);

     }
 
   free (index_map);
     }
 
   free (index_map);


@@ -5038,14 +4998,15 @@ static hashval_t
 pre_ldst_expr_hash (const void *p)
 {
   int do_not_record_p = 0;
 pre_ldst_expr_hash (const void *p)
 {
   int do_not_record_p = 0;

-  const struct ls_expr *x = p;
+  const struct ls_expr *const x = (const struct ls_expr *) p;

   return hash_rtx (x->pattern, GET_MODE (x->pattern), &do_not_record_p, NULL, false);
 }
 
 static int
 pre_ldst_expr_eq (const void *p1, const void *p2)
 {
   return hash_rtx (x->pattern, GET_MODE (x->pattern), &do_not_record_p, NULL, false);
 }
 
 static int
 pre_ldst_expr_eq (const void *p1, const void *p2)
 {

-  const struct ls_expr *ptr1 = p1, *ptr2 = p2;
+  const struct ls_expr *const ptr1 = (const struct ls_expr *) p1,
+    *const ptr2 = (const struct ls_expr *) p2;

   return expr_equiv_p (ptr1->pattern, ptr2->pattern);
 }
 
   return expr_equiv_p (ptr1->pattern, ptr2->pattern);
 }
 


@@ -5167,7 +5128,7 @@ find_rtx_in_ldst (rtx x)
   slot = htab_find_slot (pre_ldst_table, &e, NO_INSERT);
   if (!slot || ((struct ls_expr *)*slot)->invalid)
     return NULL;
   slot = htab_find_slot (pre_ldst_table, &e, NO_INSERT);
   if (!slot || ((struct ls_expr *)*slot)->invalid)
     return NULL;

-  return *slot;
+  return (struct ls_expr *) *slot;

 }
 
 /* Assign each element of the list of mems a monotonically increasing value.  */
 }
 
 /* Assign each element of the list of mems a monotonically increasing value.  */


@@ -5207,7 +5168,7 @@ next_ls_expr (struct ls_expr * ptr)
    ld_motion list, otherwise we let the usual aliasing take care of it.  */
 
 static int
    ld_motion list, otherwise we let the usual aliasing take care of it.  */
 
 static int

-simple_mem (rtx x)
+simple_mem (const_rtx x)

 {
   if (! MEM_P (x))
     return 0;
 {
   if (! MEM_P (x))
     return 0;


@@ -5421,7 +5382,7 @@ update_ld_motion_stores (struct expr * expr)
          rtx pat = PATTERN (insn);
          rtx src = SET_SRC (pat);
          rtx reg = expr->reaching_reg;
          rtx pat = PATTERN (insn);
          rtx src = SET_SRC (pat);
          rtx reg = expr->reaching_reg;

-         rtx copy, new;
+         rtx copy, new_rtx;

 
          /* If we've already copied it, continue.  */
          if (expr->reaching_reg == src)
 
          /* If we've already copied it, continue.  */
          if (expr->reaching_reg == src)


@@ -5437,9 +5398,10 @@ update_ld_motion_stores (struct expr * expr)
            }
 
          copy = gen_move_insn ( reg, copy_rtx (SET_SRC (pat)));
            }
 
          copy = gen_move_insn ( reg, copy_rtx (SET_SRC (pat)));

-         new = emit_insn_before (copy, insn);
-         record_one_set (REGNO (reg), new);
+         new_rtx = emit_insn_before (copy, insn);
+         record_one_set (REGNO (reg), new_rtx);

          SET_SRC (pat) = reg;
          SET_SRC (pat) = reg;

+         df_insn_rescan (insn);

 
          /* un-recognize this pattern since it's probably different now.  */
          INSN_CODE (insn) = -1;
 
          /* un-recognize this pattern since it's probably different now.  */
          INSN_CODE (insn) = -1;


@@ -5471,10 +5433,10 @@ static int num_stores;
    note_stores.  */
 
 static void
    note_stores.  */
 
 static void

-reg_set_info (rtx dest, rtx setter ATTRIBUTE_UNUSED,
+reg_set_info (rtx dest, const_rtx setter ATTRIBUTE_UNUSED,

              void *data)
 {
              void *data)
 {

-  sbitmap bb_reg = data;
+  sbitmap bb_reg = (sbitmap) data;

 
   if (GET_CODE (dest) == SUBREG)
     dest = SUBREG_REG (dest);
 
   if (GET_CODE (dest) == SUBREG)
     dest = SUBREG_REG (dest);


@@ -5491,10 +5453,10 @@ reg_set_info (rtx dest, rtx setter ATTRIBUTE_UNUSED,
    note_stores.  */
 
 static void
    note_stores.  */
 
 static void

-reg_clear_last_set (rtx dest, rtx setter ATTRIBUTE_UNUSED,
+reg_clear_last_set (rtx dest, const_rtx setter ATTRIBUTE_UNUSED,

              void *data)
 {
              void *data)
 {

-  int *dead_vec = data;
+  int *dead_vec = (int *) data;

 
   if (GET_CODE (dest) == SUBREG)
     dest = SUBREG_REG (dest);
 
   if (GET_CODE (dest) == SUBREG)
     dest = SUBREG_REG (dest);


@@ -5508,9 +5470,9 @@ reg_clear_last_set (rtx dest, rtx setter ATTRIBUTE_UNUSED,
    due to set of registers in bitmap REGS_SET.  */
 
 static bool
    due to set of registers in bitmap REGS_SET.  */
 
 static bool

-store_ops_ok (rtx x, int *regs_set)
+store_ops_ok (const_rtx x, int *regs_set)

 {
 {

-  rtx reg;
+  const_rtx reg;

 
   for (; x; x = XEXP (x, 1))
     {
 
   for (; x; x = XEXP (x, 1))
     {


@@ -5556,8 +5518,10 @@ extract_mentioned_regs_helper (rtx x, rtx accum)
 
     case PRE_DEC:
     case PRE_INC:
 
     case PRE_DEC:
     case PRE_INC:

+    case PRE_MODIFY:

     case POST_DEC:
     case POST_INC:
     case POST_DEC:
     case POST_INC:

+    case POST_MODIFY:

       /* We do not run this function with arguments having side effects.  */
       gcc_unreachable ();
 
       /* We do not run this function with arguments having side effects.  */
       gcc_unreachable ();
 


@@ -5566,6 +5530,7 @@ extract_mentioned_regs_helper (rtx x, rtx accum)
     case CONST:
     case CONST_INT:
     case CONST_DOUBLE:
     case CONST:
     case CONST_INT:
     case CONST_DOUBLE:

+    case CONST_FIXED:

     case CONST_VECTOR:
     case SYMBOL_REF:
     case LABEL_REF:
     case CONST_VECTOR:
     case SYMBOL_REF:
     case LABEL_REF:


@@ -5862,7 +5827,7 @@ compute_store_table (void)
    after the X.  */
 
 static bool
    after the X.  */
 
 static bool

-load_kills_store (rtx x, rtx store_pattern, int after)
+load_kills_store (const_rtx x, const_rtx store_pattern, int after)

 {
   if (after)
     return anti_dependence (x, store_pattern);
 {
   if (after)
     return anti_dependence (x, store_pattern);


@@ -5877,7 +5842,7 @@ load_kills_store (rtx x, rtx store_pattern, int after)
    after the insn X.  */
 
 static bool
    after the insn X.  */
 
 static bool

-find_loads (rtx x, rtx store_pattern, int after)
+find_loads (const_rtx x, const_rtx store_pattern, int after)

 {
   const char * fmt;
   int i, j;
 {
   const char * fmt;
   int i, j;


@@ -5910,7 +5875,7 @@ find_loads (rtx x, rtx store_pattern, int after)
 }
 
 static inline bool
 }
 
 static inline bool

-store_killed_in_pat (rtx x, rtx pat, int after)
+store_killed_in_pat (const_rtx x, const_rtx pat, int after)

 {
   if (GET_CODE (pat) == SET)
     {
 {
   if (GET_CODE (pat) == SET)
     {


@@ -5947,9 +5912,9 @@ store_killed_in_pat (rtx x, rtx pat, int after)
    after the insn.  Return true if it does.  */
 
 static bool
    after the insn.  Return true if it does.  */
 
 static bool

-store_killed_in_insn (rtx x, rtx x_regs, rtx insn, int after)
+store_killed_in_insn (const_rtx x, const_rtx x_regs, const_rtx insn, int after)

 {
 {

-  rtx reg, base, note, pat;
+  const_rtx reg, base, note, pat;

 
   if (!INSN_P (insn))
     return false;
 
   if (!INSN_P (insn))
     return false;


@@ -5958,7 +5923,7 @@ store_killed_in_insn (rtx x, rtx x_regs, rtx insn, int after)
     {
       /* A normal or pure call might read from pattern,
         but a const call will not.  */
     {
       /* A normal or pure call might read from pattern,
         but a const call will not.  */

-      if (! CONST_OR_PURE_CALL_P (insn) || pure_call_p (insn))
+      if (!RTL_CONST_CALL_P (insn))

        return true;
 
       /* But even a const call reads its parameters.  Check whether the
        return true;
 
       /* But even a const call reads its parameters.  Check whether the


@@ -6015,7 +5980,7 @@ store_killed_in_insn (rtx x, rtx x_regs, rtx insn, int after)
    is killed, return the last insn in that it occurs in FAIL_INSN.  */
 
 static bool
    is killed, return the last insn in that it occurs in FAIL_INSN.  */
 
 static bool

-store_killed_after (rtx x, rtx x_regs, rtx insn, basic_block bb,
+store_killed_after (const_rtx x, const_rtx x_regs, const_rtx insn, const_basic_block bb,

                    int *regs_set_after, rtx *fail_insn)
 {
   rtx last = BB_END (bb), act;
                    int *regs_set_after, rtx *fail_insn)
 {
   rtx last = BB_END (bb), act;


@@ -6044,7 +6009,7 @@ store_killed_after (rtx x, rtx x_regs, rtx insn, basic_block bb,
    within basic block BB. X_REGS is list of registers mentioned in X.
    REGS_SET_BEFORE is bitmap of registers set before or in this insn.  */
 static bool
    within basic block BB. X_REGS is list of registers mentioned in X.
    REGS_SET_BEFORE is bitmap of registers set before or in this insn.  */
 static bool

-store_killed_before (rtx x, rtx x_regs, rtx insn, basic_block bb,
+store_killed_before (const_rtx x, const_rtx x_regs, const_rtx insn, const_basic_block bb,

                     int *regs_set_before)
 {
   rtx first = BB_HEAD (bb);
                     int *regs_set_before)
 {
   rtx first = BB_HEAD (bb);


@@ -6091,7 +6056,7 @@ build_store_vectors (void)
             are any side effects.  */
          if (TEST_BIT (ae_gen[bb->index], ptr->index))
            {
             are any side effects.  */
          if (TEST_BIT (ae_gen[bb->index], ptr->index))
            {

-             rtx r = gen_reg_rtx (GET_MODE (ptr->pattern));
+             rtx r = gen_reg_rtx_and_attrs (ptr->pattern);

              if (dump_file)
                fprintf (dump_file, "Removing redundant store:\n");
              replace_store_insn (r, XEXP (st, 0), bb, ptr);
              if (dump_file)
                fprintf (dump_file, "Removing redundant store:\n");
              replace_store_insn (r, XEXP (st, 0), bb, ptr);


@@ -6151,7 +6116,7 @@ build_store_vectors (void)
    the BB_HEAD if needed.  */
 
 static void
    the BB_HEAD if needed.  */
 
 static void

-insert_insn_start_bb (rtx insn, basic_block bb)
+insert_insn_start_basic_block (rtx insn, basic_block bb)

 {
   /* Insert at start of successor block.  */
   rtx prev = PREV_INSN (BB_HEAD (bb));
 {
   /* Insert at start of successor block.  */
   rtx prev = PREV_INSN (BB_HEAD (bb));


@@ -6159,8 +6124,7 @@ insert_insn_start_bb (rtx insn, basic_block bb)
   while (before != 0)
     {
       if (! LABEL_P (before)
   while (before != 0)
     {
       if (! LABEL_P (before)

-         && (! NOTE_P (before)
-             || NOTE_LINE_NUMBER (before) != NOTE_INSN_BASIC_BLOCK))
+         && !NOTE_INSN_BASIC_BLOCK_P (before))

        break;
       prev = before;
       if (prev == BB_END (bb))
        break;
       prev = before;
       if (prev == BB_END (bb))


@@ -6168,7 +6132,7 @@ insert_insn_start_bb (rtx insn, basic_block bb)
       before = NEXT_INSN (before);
     }
 
       before = NEXT_INSN (before);
     }
 

-  insn = emit_insn_after_noloc (insn, prev);
+  insn = emit_insn_after_noloc (insn, prev, bb);

 
   if (dump_file)
     {
 
   if (dump_file)
     {


@@ -6225,7 +6189,7 @@ insert_store (struct ls_expr * expr, edge e)
          int index = EDGE_INDEX (edge_list, tmp->src, tmp->dest);
          RESET_BIT (pre_insert_map[index], expr->index);
        }
          int index = EDGE_INDEX (edge_list, tmp->src, tmp->dest);
          RESET_BIT (pre_insert_map[index], expr->index);
        }

-      insert_insn_start_bb (insn, bb);
+      insert_insn_start_basic_block (insn, bb);

       return 0;
     }
 
       return 0;
     }
 


@@ -6335,21 +6299,10 @@ remove_reachable_equiv_notes (basic_block bb, struct ls_expr *smexpr)
 static void
 replace_store_insn (rtx reg, rtx del, basic_block bb, struct ls_expr *smexpr)
 {
 static void
 replace_store_insn (rtx reg, rtx del, basic_block bb, struct ls_expr *smexpr)
 {

-  rtx insn, mem, note, set, ptr, pair;
+  rtx insn, mem, note, set, ptr;

 
   mem = smexpr->pattern;
   insn = gen_move_insn (reg, SET_SRC (single_set (del)));
 
   mem = smexpr->pattern;
   insn = gen_move_insn (reg, SET_SRC (single_set (del)));

-  insn = emit_insn_after (insn, del);
-
-  if (dump_file)
-    {
-      fprintf (dump_file,
-              "STORE_MOTION  delete insn in BB %d:\n      ", bb->index);
-      print_inline_rtx (dump_file, del, 6);
-      fprintf (dump_file, "\nSTORE MOTION  replaced with insn:\n      ");
-      print_inline_rtx (dump_file, insn, 6);
-      fprintf (dump_file, "\n");
-    }

 
   for (ptr = ANTIC_STORE_LIST (smexpr); ptr; ptr = XEXP (ptr, 1))
     if (XEXP (ptr, 0) == del)
 
   for (ptr = ANTIC_STORE_LIST (smexpr); ptr; ptr = XEXP (ptr, 1))
     if (XEXP (ptr, 0) == del)


@@ -6358,23 +6311,21 @@ replace_store_insn (rtx reg, rtx del, basic_block bb, struct ls_expr *smexpr)
        break;
       }
 
        break;
       }
 

-  /* Move the notes from the deleted insn to its replacement, and patch
-     up the LIBCALL notes.  */
+  /* Move the notes from the deleted insn to its replacement.  */

   REG_NOTES (insn) = REG_NOTES (del);
 
   REG_NOTES (insn) = REG_NOTES (del);
 

-  note = find_reg_note (insn, REG_RETVAL, NULL_RTX);
-  if (note)
-    {
-      pair = XEXP (note, 0);
-      note = find_reg_note (pair, REG_LIBCALL, NULL_RTX);
-      XEXP (note, 0) = insn;
-    }
-  note = find_reg_note (insn, REG_LIBCALL, NULL_RTX);
-  if (note)
+  /* Emit the insn AFTER all the notes are transferred.
+     This is cheaper since we avoid df rescanning for the note change.  */
+  insn = emit_insn_after (insn, del);
+
+  if (dump_file)

     {
     {

-      pair = XEXP (note, 0);
-      note = find_reg_note (pair, REG_RETVAL, NULL_RTX);
-      XEXP (note, 0) = insn;
+      fprintf (dump_file,
+              "STORE_MOTION  delete insn in BB %d:\n      ", bb->index);
+      print_inline_rtx (dump_file, del, 6);
+      fprintf (dump_file, "\nSTORE MOTION  replaced with insn:\n      ");
+      print_inline_rtx (dump_file, insn, 6);
+      fprintf (dump_file, "\n");

     }
 
   delete_insn (del);
     }
 
   delete_insn (del);


@@ -6412,7 +6363,7 @@ delete_store (struct ls_expr * expr, basic_block bb)
   rtx reg, i, del;
 
   if (expr->reaching_reg == NULL_RTX)
   rtx reg, i, del;
 
   if (expr->reaching_reg == NULL_RTX)

-    expr->reaching_reg = gen_reg_rtx (GET_MODE (expr->pattern));
+    expr->reaching_reg = gen_reg_rtx_and_attrs (expr->pattern);

 
   reg = expr->reaching_reg;
 
 
   reg = expr->reaching_reg;
 


@@ -6544,7 +6495,7 @@ bypass_jumps (void)
 
   /* We do not construct an accurate cfg in functions which call
      setjmp, so just punt to be safe.  */
 
   /* We do not construct an accurate cfg in functions which call
      setjmp, so just punt to be safe.  */

-  if (current_function_calls_setjmp)
+  if (cfun->calls_setjmp)

     return 0;
 
   /* Identify the basic block information for this function, including
     return 0;
 
   /* Identify the basic block information for this function, including


@@ -6594,7 +6545,6 @@ bypass_jumps (void)
 
   /* We are finished with alias.  */
   end_alias_analysis ();
 
   /* We are finished with alias.  */
   end_alias_analysis ();

-  allocate_reg_info (max_reg_num (), FALSE, FALSE);

 
   return changed;
 }
 
   return changed;
 }


@@ -6642,27 +6592,28 @@ is_too_expensive (const char *pass)
 static bool
 gate_handle_jump_bypass (void)
 {
 static bool
 gate_handle_jump_bypass (void)
 {

-  return optimize > 0 && flag_gcse;
+  return optimize > 0 && flag_gcse
+    && dbg_cnt (jump_bypass);

 }
 
 /* Perform jump bypassing and control flow optimizations.  */
 static unsigned int
 rest_of_handle_jump_bypass (void)
 {
 }
 
 /* Perform jump bypassing and control flow optimizations.  */
 static unsigned int
 rest_of_handle_jump_bypass (void)
 {

-  cleanup_cfg (CLEANUP_EXPENSIVE);
-  reg_scan (get_insns (), max_reg_num ());
-
+  delete_unreachable_blocks ();

   if (bypass_jumps ())
     {
   if (bypass_jumps ())
     {

-      rebuild_jump_labels (get_insns ());
-      cleanup_cfg (CLEANUP_EXPENSIVE);

       delete_trivially_dead_insns (get_insns (), max_reg_num ());
       delete_trivially_dead_insns (get_insns (), max_reg_num ());

+      rebuild_jump_labels (get_insns ());
+      cleanup_cfg (0);

     }
   return 0;
 }
 
     }
   return 0;
 }
 

-struct tree_opt_pass pass_jump_bypass =
+struct rtl_opt_pass pass_jump_bypass =

 {
 {

+ {
+  RTL_PASS,

   "bypass",                             /* name */
   gate_handle_jump_bypass,              /* gate */   
   rest_of_handle_jump_bypass,           /* execute */       
   "bypass",                             /* name */
   gate_handle_jump_bypass,              /* gate */   
   rest_of_handle_jump_bypass,           /* execute */       


@@ -6675,15 +6626,16 @@ struct tree_opt_pass pass_jump_bypass =
   0,                                    /* properties_destroyed */
   0,                                    /* todo_flags_start */
   TODO_dump_func |
   0,                                    /* properties_destroyed */
   0,                                    /* todo_flags_start */
   TODO_dump_func |

-  TODO_ggc_collect | TODO_verify_flow,  /* todo_flags_finish */
-  'G'                                   /* letter */
+  TODO_ggc_collect | TODO_verify_flow   /* todo_flags_finish */
+ }

 };
 
 
 static bool
 gate_handle_gcse (void)
 {
 };
 
 
 static bool
 gate_handle_gcse (void)
 {

-  return optimize > 0 && flag_gcse;
+  return optimize > 0 && flag_gcse
+    && dbg_cnt (gcse);

 }
 
 
 }
 
 


@@ -6692,11 +6644,9 @@ rest_of_handle_gcse (void)
 {
   int save_csb, save_cfj;
   int tem2 = 0, tem;
 {
   int save_csb, save_cfj;
   int tem2 = 0, tem;

-

   tem = gcse_main (get_insns ());
   tem = gcse_main (get_insns ());

-  rebuild_jump_labels (get_insns ());

   delete_trivially_dead_insns (get_insns (), max_reg_num ());
   delete_trivially_dead_insns (get_insns (), max_reg_num ());

-
+  rebuild_jump_labels (get_insns ());

   save_csb = flag_cse_skip_blocks;
   save_cfj = flag_cse_follow_jumps;
   flag_cse_skip_blocks = flag_cse_follow_jumps = 0;
   save_csb = flag_cse_skip_blocks;
   save_cfj = flag_cse_follow_jumps;
   flag_cse_skip_blocks = flag_cse_follow_jumps = 0;


@@ -6706,8 +6656,8 @@ rest_of_handle_gcse (void)
   if (flag_expensive_optimizations)
     {
       timevar_push (TV_CSE);
   if (flag_expensive_optimizations)
     {
       timevar_push (TV_CSE);

-      reg_scan (get_insns (), max_reg_num ());

       tem2 = cse_main (get_insns (), max_reg_num ());
       tem2 = cse_main (get_insns (), max_reg_num ());

+      df_finish_pass (false);

       purge_all_dead_edges ();
       delete_trivially_dead_insns (get_insns (), max_reg_num ());
       timevar_pop (TV_CSE);
       purge_all_dead_edges ();
       delete_trivially_dead_insns (get_insns (), max_reg_num ());
       timevar_pop (TV_CSE);


@@ -6716,22 +6666,25 @@ rest_of_handle_gcse (void)
 
   /* If gcse or cse altered any jumps, rerun jump optimizations to clean
      things up.  */
 
   /* If gcse or cse altered any jumps, rerun jump optimizations to clean
      things up.  */

-  if (tem || tem2)
+  if (tem || tem2 == 2)

     {
       timevar_push (TV_JUMP);
       rebuild_jump_labels (get_insns ());
     {
       timevar_push (TV_JUMP);
       rebuild_jump_labels (get_insns ());

-      delete_dead_jumptables ();
-      cleanup_cfg (CLEANUP_EXPENSIVE);
+      cleanup_cfg (0);

       timevar_pop (TV_JUMP);
     }
       timevar_pop (TV_JUMP);
     }

+  else if (tem2 == 1)
+    cleanup_cfg (0);

 
   flag_cse_skip_blocks = save_csb;
   flag_cse_follow_jumps = save_cfj;
   return 0;
 }
 
 
   flag_cse_skip_blocks = save_csb;
   flag_cse_follow_jumps = save_cfj;
   return 0;
 }
 

-struct tree_opt_pass pass_gcse =
+struct rtl_opt_pass pass_gcse =

 {
 {

+ {
+  RTL_PASS,

   "gcse1",                              /* name */
   gate_handle_gcse,                     /* gate */   
   rest_of_handle_gcse,                 /* execute */       
   "gcse1",                              /* name */
   gate_handle_gcse,                     /* gate */   
   rest_of_handle_gcse,                 /* execute */       


@@ -6743,9 +6696,10 @@ struct tree_opt_pass pass_gcse =
   0,                                    /* properties_provided */
   0,                                    /* properties_destroyed */
   0,                                    /* todo_flags_start */
   0,                                    /* properties_provided */
   0,                                    /* properties_destroyed */
   0,                                    /* todo_flags_start */

+  TODO_df_finish | TODO_verify_rtl_sharing |

   TODO_dump_func |
   TODO_dump_func |

-  TODO_verify_flow | TODO_ggc_collect,  /* todo_flags_finish */
-  'G'                                   /* letter */
+  TODO_verify_flow | TODO_ggc_collect   /* todo_flags_finish */
+ }

 };
 
 
 };