Ticket #1935: gcc-4.1.1-fixes-1.patch

gcc-4.1.1/gcc/Makefile.in

@@ -3146 +3209 @@
 macro_list: s-macro_list; @true
 s-macro_list : $(GCC_PASSES) 
         echo | $(GCC_FOR_TARGET) -E -dM - | \
-          sed -n 's/^#define \([^_][a-zA-Z0-9_]*\).*/\1/p ; \
-                s/^#define \(_[^_A-Z][a-zA-Z0-9_]*\).*/\1/p' | \
+          sed -n -e 's/^#define \([^_][a-zA-Z0-9_]*\).*/\1/p' \
+                 -e 's/^#define \(_[^_A-Z][a-zA-Z0-9_]*\).*/\1/p' | \
           sort -u > tmp-macro_list
         $(SHELL) $(srcdir)/../move-if-change tmp-macro_list macro_list
         $(STAMP) s-macro_list

gcc-4.1.1/gcc/config/i386/i386.c

@@ -1502 +1502 @@
     }
 
   /* Validate -mpreferred-stack-boundary= value, or provide default.
-     The default of 128 bits is for Pentium III's SSE __m128, but we
-     don't want additional code to keep the stack aligned when
-     optimizing for code size.  */
-  ix86_preferred_stack_boundary = (optimize_size
-                                   ? TARGET_64BIT ? 128 : 32
-                                   : 128);
+     The default of 128 bits is for Pentium III's SSE __m128, We can't
+     change it because of optimize_size.  Otherwise, we can't mix object
+     files compiled with -Os and -On.  */
+  ix86_preferred_stack_boundary = 128;
   if (ix86_preferred_stack_boundary_string)
     {
       i = atoi (ix86_preferred_stack_boundary_string);

gcc-4.1.1/gcc/cse.c

@@ -528 +528 @@
 
 static struct table_elt *table[HASH_SIZE];
 
+/* Number of elements in the hash table.  */
+
+static unsigned int table_size;
+
 /* Chain of `struct table_elt's made so far for this function
    but currently removed from the table.  */
 
@@ -962 +966 @@
         }
     }
 
+  table_size = 0;
+
 #ifdef HAVE_cc0
   prev_insn = 0;
   prev_insn_cc0 = 0;
@@ -1372 +1378 @@
   /* Now add it to the free element chain.  */
   elt->next_same_hash = free_element_chain;
   free_element_chain = elt;
+
+  table_size--;
 }
 
 /* Look up X in the hash table and return its table element,
@@ -1649 +1657 @@
         }
     }
 
+  table_size++;
+
   return elt;
 }
 

gcc-4.1.1/gcc/tree-ssa-alias.c

@@ -766 +766 @@
       struct alias_map_d *p_map = ai->pointers[i];
       tree tag = var_ann (p_map->var)->type_mem_tag;
       var_ann_t tag_ann = var_ann (tag);
+      tree var;
 
       p_map->total_alias_vops = 0;
       p_map->may_aliases = BITMAP_ALLOC (&alias_obstack);
 
+      /* Add any pre-existing may_aliases to the bitmap used to represent
+         TAG's alias set in case we need to group aliases.  */
+      if (tag_ann->may_aliases)
+        for (j = 0; j < VARRAY_ACTIVE_SIZE (tag_ann->may_aliases); ++j)
+          bitmap_set_bit (p_map->may_aliases,
+                          DECL_UID (VARRAY_TREE (tag_ann->may_aliases, j)));
+
       for (j = 0; j < ai->num_addressable_vars; j++)
         {
           struct alias_map_d *v_map;
           var_ann_t v_ann;
-          tree var;
           bool tag_stored_p, var_stored_p;
           
           v_map = ai->addressable_vars[j];

gcc-4.1.1/gcc/loop.c

@@ -8824 +8824 @@
 }
 
 
-/* Return false iff it is provable that biv BL plus BIAS will not wrap
-   at any point in its update sequence.  Note that at the rtl level we
-   may not have information about the signedness of BL; in that case,
-   check for both signed and unsigned overflow.  */
+/* Return false iff it is provable that biv BL will not wrap at any point
+   in its update sequence.  Note that at the RTL level we may not have
+   information about the signedness of BL; in that case, check for both
+   signed and unsigned overflow.  */
 
 static bool
-biased_biv_may_wrap_p (const struct loop *loop, struct iv_class *bl,
-                       unsigned HOST_WIDE_INT bias)
+biv_may_wrap_p (const struct loop *loop, struct iv_class *bl)
 {
   HOST_WIDE_INT incr;
   bool check_signed, check_unsigned;
@@ -8867 +8866 @@
   mode = GET_MODE (bl->biv->src_reg);
 
   if (check_unsigned
-      && !biased_biv_fits_mode_p (loop, bl, incr, mode, bias))
+      && !biased_biv_fits_mode_p (loop, bl, incr, mode, 0))
     return true;
 
   if (check_signed)
     {
-      bias += (GET_MODE_MASK (mode) >> 1) + 1;
+      unsigned HOST_WIDE_INT bias = (GET_MODE_MASK (mode) >> 1) + 1;
       if (!biased_biv_fits_mode_p (loop, bl, incr, mode, bias))
         return true;
     }
@@ -10306 +10305 @@
          valid programs.  */
       /* Without lifetime analysis, we don't know how COMPARE will be
          used, so we must assume the worst.  */
-      if (code != EQ && code != NE
-          && biased_biv_may_wrap_p (loop, bl, INTVAL (arg)))
+      if (code != EQ && code != NE && biv_may_wrap_p (loop, bl))
         return 0;
 
       /* Try to replace with any giv that has constant positive mult_val