From ecdbf306757a1c18e29a2920470438453dafe8f8 Mon Sep 17 00:00:00 2001 From: Jeff Law Date: Wed, 19 Jun 2013 11:09:10 -0600 Subject: [PATCH] tree-ssa-forwprop.c (simplify_bitwise_binary_boolean): Fix typo in comment. * tree-ssa-forwprop.c (simplify_bitwise_binary_boolean): Fix typo in comment. From-SVN: r200208 --- gcc/ChangeLog | 3 +++ gcc/tree-ssa-forwprop.c | 2 +- 2 files changed, 4 insertions(+), 1 deletion(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 0ecf5ba5ccb..bd60452a5c7 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,5 +1,8 @@ 2013-06-19 Jeff Law + * 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. diff --git a/gcc/tree-ssa-forwprop.c b/gcc/tree-ssa-forwprop.c index 29a0bb72283..df192952a1d 100644 --- a/gcc/tree-ssa-forwprop.c +++ b/gcc/tree-ssa-forwprop.c @@ -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, -- 2.30.2