]> git.ipfire.org Git - thirdparty/gcc.git/commitdiff
tree-flow.h (tree_ssa_useless_type_conversion_1): Rename to ...
authorRichard Guenther <rguenther@suse.de>
Mon, 2 Jul 2007 09:18:14 +0000 (09:18 +0000)
committerRichard Biener <rguenth@gcc.gnu.org>
Mon, 2 Jul 2007 09:18:14 +0000 (09:18 +0000)
2007-07-02  Richard Guenther  <rguenther@suse.de>

* tree-flow.h (tree_ssa_useless_type_conversion_1): Rename to ...
(useless_type_conversion_p): ... this.
* tree-ssa.c (tree_ssa_useless_type_conversion_1): Rename to ...
(useless_type_conversion_p): ... this.
* builtins.c (fold_builtin_memory_op): Rename
tree_ssa_useless_type_conversion_1 to useless_type_conversion_p.
* tree-cfg.c (verify_expr): Likewise.
* tree-ssa-address.c (tree_ssa_useless_type_conversion_1): Likewise.
* tree-ssa-ccp.c (ccp_fold): Likewise.
* tree-ssa-copy.c (may_propagate_copy): Likewise.
* tree-ssa-dom.c (eliminate_redundant_computations): Likewise.
* tree-ssa-forwprop.c (forward_propagate_addr_expr_1): Likewise.
* tree-ssa-loop-niter.c (refine_bounds_using_guard): Likewise.
* tree-ssa-pre.c (eliminate): Likewise.
* tree-ssa.c (delete_tree_ssa): Likewise.
(tree_ssa_useless_type_conversion): Likewise.
* tree.c (build2_stat): Likewise.

From-SVN: r126194

14 files changed:
gcc/ChangeLog
gcc/builtins.c
gcc/tree-cfg.c
gcc/tree-flow.h
gcc/tree-predcom.c
gcc/tree-ssa-address.c
gcc/tree-ssa-ccp.c
gcc/tree-ssa-copy.c
gcc/tree-ssa-dom.c
gcc/tree-ssa-forwprop.c
gcc/tree-ssa-loop-niter.c
gcc/tree-ssa-pre.c
gcc/tree-ssa.c
gcc/tree.c

index 8c642d7c8791a5fe9174e87ee91b40cd876f5298..31e1b425bea975f91a8d22127784451518d946e1 100644 (file)
@@ -1,3 +1,23 @@
+2007-07-02  Richard Guenther  <rguenther@suse.de>
+
+       * tree-flow.h (tree_ssa_useless_type_conversion_1): Rename to ...
+       (useless_type_conversion_p): ... this.
+       * tree-ssa.c (tree_ssa_useless_type_conversion_1): Rename to ...
+       (useless_type_conversion_p): ... this.
+       * builtins.c (fold_builtin_memory_op): Rename
+       tree_ssa_useless_type_conversion_1 to useless_type_conversion_p.
+       * tree-cfg.c (verify_expr): Likewise.
+       * tree-ssa-address.c (tree_ssa_useless_type_conversion_1): Likewise.
+       * tree-ssa-ccp.c (ccp_fold): Likewise.
+       * tree-ssa-copy.c (may_propagate_copy): Likewise.
+       * tree-ssa-dom.c (eliminate_redundant_computations): Likewise.
+       * tree-ssa-forwprop.c (forward_propagate_addr_expr_1): Likewise.
+       * tree-ssa-loop-niter.c (refine_bounds_using_guard): Likewise.
+       * tree-ssa-pre.c (eliminate): Likewise.
+       * tree-ssa.c (delete_tree_ssa): Likewise.
+       (tree_ssa_useless_type_conversion): Likewise.
+       * tree.c (build2_stat): Likewise.
+
 2007-07-01  Daniel Berlin  <dberlin@dberlin.org>
 
        Fix PR tree-optimization/32571
index 222993921dc83545a31015ec0c43efbbaf15bcfa..cf1d743b30e107306df166fb22fe178927959ef7 100644 (file)
@@ -8584,7 +8584,7 @@ fold_builtin_memory_op (tree dest, tree src, tree len, tree type, bool ignore, i
 
       if (srctype == desttype
          || (gimple_in_ssa_p (cfun)
-             && tree_ssa_useless_type_conversion_1 (desttype, srctype)))
+             && useless_type_conversion_p (desttype, srctype)))
        expr = srcvar;
       else if ((INTEGRAL_TYPE_P (TREE_TYPE (srcvar))
           || POINTER_TYPE_P (TREE_TYPE (srcvar)))
index 3fd57720150a5fc86e0ea5d78218043ec2431a18..09fe7ebbe10b7d9482f028e07d925fbf2fe46b85 100644 (file)
@@ -3287,8 +3287,8 @@ verify_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
        }
       /* Check to make sure the second operand is an integer with type of
         sizetype.  */
-      if (!tree_ssa_useless_type_conversion_1 (sizetype,
-                                              TREE_TYPE (TREE_OPERAND (t, 1))))
+      if (!useless_type_conversion_p (sizetype,
+                                    TREE_TYPE (TREE_OPERAND (t, 1))))
        {
          error ("invalid operand to pointer plus, second operand is not an "
                 "integer with type of sizetype.");
index 76378699706d84cc320725876f8bda700c9d4349..375b1786165f670ff56626f605b45096a8ecb8ac 100644 (file)
@@ -868,7 +868,7 @@ extern void init_tree_ssa (void);
 extern edge ssa_redirect_edge (edge, basic_block);
 extern void flush_pending_stmts (edge);
 extern bool tree_ssa_useless_type_conversion (tree);
-extern bool tree_ssa_useless_type_conversion_1 (tree, tree);
+extern bool useless_type_conversion_p (tree, tree);
 extern void verify_ssa (bool);
 extern void delete_tree_ssa (void);
 extern void walk_use_def_chains (tree, walk_use_def_chains_fn, void *, bool);
index db9a8d509f09626cc29aab41926c3fbda85bfa91..7e8d4615a7b2fb6c4638bd88883b83054b7dd7a7 100644 (file)
@@ -633,7 +633,7 @@ determine_offset (struct data_reference *a, struct data_reference *b,
   /* Check that both the references access the location in the same type.  */
   typea = TREE_TYPE (DR_REF (a));
   typeb = TREE_TYPE (DR_REF (b));
-  if (!tree_ssa_useless_type_conversion_1 (typeb, typea))
+  if (!useless_type_conversion_p (typeb, typea))
     return false;
 
   /* Check whether the base address and the step of both references is the
index 5606dca89ea278fc6bbc62720c14dd8b6b268160..cbd9355c22722aeb4379911199ce28eaf56449fb 100644 (file)
@@ -604,7 +604,7 @@ create_mem_ref (block_stmt_iterator *bsi, tree type, aff_tree *addr)
       /* Add the symbol to base, eventually forcing it to register.  */
       if (parts.base)
        {
-         gcc_assert (tree_ssa_useless_type_conversion_1
+         gcc_assert (useless_type_conversion_p
                                (sizetype, TREE_TYPE (parts.base)));
 
          if (parts.index)
index 0ea8675ae6b7deccc7a9e7293cd793cf502e3cdc..1188f86484a4296fccb86a0794903e2533bedb37 100644 (file)
@@ -899,8 +899,7 @@ ccp_fold (tree stmt)
        }
 
       if ((code == NOP_EXPR || code == CONVERT_EXPR)
-         && tree_ssa_useless_type_conversion_1 (TREE_TYPE (rhs),
-                                                TREE_TYPE (op0)))
+         && useless_type_conversion_p (TREE_TYPE (rhs), TREE_TYPE (op0)))
        return op0;
       return fold_unary (code, TREE_TYPE (rhs), op0);
     }
index 97c4c03343c908e4165bd1bb8ff3743f2105d184..b44db5238b7e043b6fef5ee2a4fed676544ff45b 100644 (file)
@@ -82,7 +82,7 @@ may_propagate_copy (tree dest, tree orig)
                                 DECL_UID (SSA_NAME_VAR (dest)))));
   
   /* Do not copy between types for which we *do* need a conversion.  */
-  if (!tree_ssa_useless_type_conversion_1 (type_d, type_o))
+  if (!useless_type_conversion_p (type_d, type_o))
     return false;
 
   /* FIXME.  GIMPLE is allowing pointer assignments and comparisons of
index 0241155de0fe4b33c1c38e6a84a57f05e332067d..3b7bacd9660f39a4ad1f21b9751c3ae30bfb333c 100644 (file)
@@ -1515,8 +1515,8 @@ eliminate_redundant_computations (tree stmt)
   if (cached_lhs
       && ((TREE_CODE (cached_lhs) != SSA_NAME
           && (modify_expr_p
-              || tree_ssa_useless_type_conversion_1 (TREE_TYPE (*expr_p),
-                                                     TREE_TYPE (cached_lhs))))
+              || useless_type_conversion_p (TREE_TYPE (*expr_p),
+                                           TREE_TYPE (cached_lhs))))
          || may_propagate_copy (*expr_p, cached_lhs)))
     {
       if (dump_file && (dump_flags & TDF_DETAILS))
@@ -1541,8 +1541,8 @@ eliminate_redundant_computations (tree stmt)
        retval = true;
       
       if (modify_expr_p
-         && !tree_ssa_useless_type_conversion_1 (TREE_TYPE (*expr_p),
-                                                 TREE_TYPE (cached_lhs)))
+         && !useless_type_conversion_p (TREE_TYPE (*expr_p),
+                                       TREE_TYPE (cached_lhs)))
        cached_lhs = fold_convert (TREE_TYPE (*expr_p), cached_lhs);
 
       propagate_tree_value (expr_p, cached_lhs);
index 29ee8887230f1864fc4cec19215dd3052124a08a..07d682fba09c386e8fb76e6d4515a01d7f7af95e 100644 (file)
@@ -601,8 +601,8 @@ forward_propagate_addr_expr_1 (tree name, tree def_rhs, tree use_stmt,
            && rhs == name)
           || ((TREE_CODE (rhs) == NOP_EXPR
                || TREE_CODE (rhs) == CONVERT_EXPR)
-              && tree_ssa_useless_type_conversion_1 (TREE_TYPE (rhs),
-                                                     TREE_TYPE (def_rhs))))
+              && useless_type_conversion_p (TREE_TYPE (rhs),
+                                           TREE_TYPE (def_rhs))))
     return forward_propagate_addr_expr (lhs, def_rhs);
 
   /* Strip away any outer COMPONENT_REF, ARRAY_REF or ADDR_EXPR
index 966e52b06b395282881e6a02e1dce12d51a9b9bb..e209f732a3b1a29cdd1fdbd6edbb39cdd9a58b00 100644 (file)
@@ -213,7 +213,7 @@ refine_bounds_using_guard (tree type, tree varx, mpz_t offx,
       STRIP_SIGN_NOPS (c0);
       STRIP_SIGN_NOPS (c1);
       ctype = TREE_TYPE (c0);
-      if (!tree_ssa_useless_type_conversion_1 (ctype, type))
+      if (!useless_type_conversion_p (ctype, type))
        return;
 
       break;
index b971de4498aa34cbb2c99292a67e228e36b32655..913cd7def9df069a93dccbdb7a19a298904b0ebf 100644 (file)
@@ -3698,8 +3698,8 @@ eliminate (void)
                     which may require adding a simple cast, which fold_convert
                     will do for us.  */
                  if (TREE_CODE (*rhs_p) != SSA_NAME
-                     && !tree_ssa_useless_type_conversion_1 (TREE_TYPE (*rhs_p),
-                                                             TREE_TYPE (sprime)))
+                     && !useless_type_conversion_p (TREE_TYPE (*rhs_p),
+                                                   TREE_TYPE (sprime)))
                    sprime = fold_convert (TREE_TYPE (*rhs_p), sprime);
 
                  pre_stats.eliminations++;
index 9c9206deb5a84cf9c9bd545ff12f5e4b9e63ca18..b6ac9c68ba86519888424dbc68df2db47ed7165b 100644 (file)
@@ -891,7 +891,7 @@ delete_tree_ssa (void)
    useless type conversion, otherwise return false.  */
 
 bool
-tree_ssa_useless_type_conversion_1 (tree outer_type, tree inner_type)
+useless_type_conversion_p (tree outer_type, tree inner_type)
 {
   if (inner_type == outer_type)
     return true;
@@ -964,7 +964,7 @@ tree_ssa_useless_type_conversion_1 (tree outer_type, tree inner_type)
   /* Recurse for complex types.  */
   else if (TREE_CODE (inner_type) == COMPLEX_TYPE
           && TREE_CODE (outer_type) == COMPLEX_TYPE
-          && tree_ssa_useless_type_conversion_1 (TREE_TYPE (outer_type),
+          && useless_type_conversion_p (TREE_TYPE (outer_type),
                                                  TREE_TYPE (inner_type)))
     return true;
 
@@ -987,7 +987,7 @@ tree_ssa_useless_type_conversion (tree expr)
     /* FIXME: Use of GENERIC_TREE_TYPE here is a temporary measure to work
        around known bugs with GIMPLE_MODIFY_STMTs appearing in places
        they shouldn't.  See PR 30391.  */
-    return tree_ssa_useless_type_conversion_1
+    return useless_type_conversion_p
       (TREE_TYPE (expr),
        GENERIC_TREE_TYPE (TREE_OPERAND (expr, 0)));
 
index f70a3073a21d5e227979ceb5ba2946ec56885017..9bf7d4889727dc5509178f5017fecd53e4203dd0 100644 (file)
@@ -3076,8 +3076,7 @@ build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
   if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
     gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
                && TREE_CODE (TREE_TYPE (arg1)) == INTEGER_TYPE
-               && tree_ssa_useless_type_conversion_1 (sizetype,
-                                                      TREE_TYPE (arg1)));
+               && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
 
   t = make_node_stat (code PASS_MEM_STAT);
   TREE_TYPE (t) = tt;