tree-ssa-forwprop.c (simplify_bitwise_binary_boolean): Fix typo in comment.
authorJeff Law <law@redhat.com>
Wed, 19 Jun 2013 17:09:10 +0000 (11:09 -0600)
committerJeff Law <law@gcc.gnu.org>
Wed, 19 Jun 2013 17:09:10 +0000 (11:09 -0600)
        * tree-ssa-forwprop.c (simplify_bitwise_binary_boolean): Fix typo
        in comment.

From-SVN: r200208

gcc/ChangeLog
gcc/tree-ssa-forwprop.c

index 0ecf5ba5ccb5ec6fd43030aa177f7c68422928cb..bd60452a5c7de30d52166e6ebdd5700e6ca3c3b5 100644 (file)
@@ -1,5 +1,8 @@
 2013-06-19  Jeff Law  <law@redhat.com>
 
+       * tree-ssa-forwprop.c (simplify_bitwise_binary_boolean): Fix typo
+       in comment.
+
        * tree-ssa-forwprop.c (simplify_bitwise_binary_boolean): New function.
        (simplify_bitwise_binary): Use it to simpify certain binary ops on
        booleans.
index 29a0bb722831fee5780eb134026d3d27b326ef3a..df192952a1d75649554a4d77df63c87b485efdfc 100644 (file)
@@ -1881,7 +1881,7 @@ hoist_conversion_for_bitop_p (tree to, tree from)
    then we can simplify the two statements into a single LT_EXPR or LE_EXPR
    when code is BIT_AND_EXPR and BIT_IOR_EXPR respectively.
 
-   If a simplification is mode, return TRUE, else return FALSE.  */
+   If a simplification is made, return TRUE, else return FALSE.  */
 static bool
 simplify_bitwise_binary_boolean (gimple_stmt_iterator *gsi,
                                 enum tree_code code,