Hi!
When looking at tree-inline.cc I've noticed a comment typo and grepped
for similar typos elsewhere.
Bootstrapped/regtested on x86_64-linux and i686-linux, committed to trunk
as obvious.
2022-10-07 Jakub Jelinek <ja...@redhat.com>
* ipa-prop.h (ipa_constant_data): Fix comment typo.
* value-range.cc (irange::irange_contains_p): Likewise.
* value-relation.cc (dom_oracle::set_one_relation): Likewise.
* gimple-predicate-analysis.cc (predicate::simplify_4): Likewise.
* tree-inline.cc (remap_ssa_name): Likewise.
--- gcc/ipa-prop.h.jj 2022-05-25 11:07:29.516188277 +0200
+++ gcc/ipa-prop.h 2022-10-06 16:12:52.157055672 +0200
@@ -78,7 +78,7 @@ struct ipa_cst_ref_desc;
/* Structure holding data required to describe a constant jump function. */
struct GTY(()) ipa_constant_data
{
- /* THe value of the constant. */
+ /* The value of the constant. */
tree value;
/* Pointer to the structure that describes the reference. */
struct ipa_cst_ref_desc GTY((skip)) *rdesc;
--- gcc/value-range.cc.jj 2022-10-06 08:55:02.668291942 +0200
+++ gcc/value-range.cc 2022-10-06 16:12:17.161531334 +0200
@@ -2508,7 +2508,7 @@ irange::irange_contains_p (const irange
// Otherwise, check if this's pair occurs before R's.
if (wi::lt_p (wi::to_wide (u), wi::to_wide (rl), sign))
{
- // THere's still at leats one pair of R left.
+ // There's still at leats one pair of R left.
if (++i >= num_pairs ())
return false;
l = m_base[i * 2];
--- gcc/value-relation.cc.jj 2022-09-30 14:12:44.654058401 +0200
+++ gcc/value-relation.cc 2022-10-06 16:12:34.527295298 +0200
@@ -955,7 +955,7 @@ dom_oracle::set_one_relation (basic_bloc
ptr->dump (dump_file);
}
// Check into whether we can simply replace the relation rather than
- // intersecting it. THis may help with some optimistic iterative
+ // intersecting it. This may help with some optimistic iterative
// updating algorithms.
bool new_rel = ptr->intersect (vr);
if (dump_file && (dump_flags & TDF_DETAILS))
--- gcc/gimple-predicate-analysis.cc.jj 2022-09-09 12:27:28.259668112 +0200
+++ gcc/gimple-predicate-analysis.cc 2022-10-06 16:11:36.676081607 +0200
@@ -1369,7 +1369,7 @@ predicate::simplify_3 ()
/* Implement rule 4 for the OR predicate PREDS:
2) ((x AND y) != 0) OR (x != 0 AND y != 0) is equivalent to
- (x != 0 ANd y != 0). */
+ (x != 0 AND y != 0). */
bool
predicate::simplify_4 ()
--- gcc/tree-inline.cc.jj 2022-05-30 14:07:02.191304381 +0200
+++ gcc/tree-inline.cc 2022-10-06 16:11:57.455799164 +0200
@@ -171,7 +171,7 @@ remap_ssa_name (tree name, copy_body_dat
n = id->decl_map->get (name);
if (n)
{
- /* WHen we perform edge redirection as part of CFG copy, IPA-SRA can
+ /* When we perform edge redirection as part of CFG copy, IPA-SRA can
remove an unused LHS from a call statement. Such LHS can however
still appear in debug statements, but their value is lost in this
function and we do not want to map them. */
Jakub
