diff options
| author | Jakub Jelinek <jakub@redhat.com> | 2022-10-07 09:08:46 +0200 |
|---|---|---|
| committer | Jakub Jelinek <jakub@redhat.com> | 2022-10-07 09:08:46 +0200 |
| commit | e66236c6e9eb83730dde15f359f2a21cb603887b (patch) | |
| tree | 7593038711f21bce00e300f543bfbfb3af55325d /gcc | |
| parent | 88f04e90f63f08620cc9cd2f059a1315b70bed3b (diff) | |
| download | gcc-e66236c6e9eb83730dde15f359f2a21cb603887b.zip gcc-e66236c6e9eb83730dde15f359f2a21cb603887b.tar.gz gcc-e66236c6e9eb83730dde15f359f2a21cb603887b.tar.bz2 | |
Fix comment typos
When looking at tree-inline.cc I've noticed a comment typo and grepped
for similar typos elsewhere.
2022-10-07 Jakub Jelinek <jakub@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.
Diffstat (limited to 'gcc')
| -rw-r--r-- | gcc/gimple-predicate-analysis.cc | 2 | ||||
| -rw-r--r-- | gcc/ipa-prop.h | 2 | ||||
| -rw-r--r-- | gcc/tree-inline.cc | 2 | ||||
| -rw-r--r-- | gcc/value-range.cc | 2 | ||||
| -rw-r--r-- | gcc/value-relation.cc | 2 |
5 files changed, 5 insertions, 5 deletions
diff --git a/gcc/gimple-predicate-analysis.cc b/gcc/gimple-predicate-analysis.cc index bc9ed84..5013a44 100644 --- a/gcc/gimple-predicate-analysis.cc +++ b/gcc/gimple-predicate-analysis.cc @@ -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 () diff --git a/gcc/ipa-prop.h b/gcc/ipa-prop.h index 8811e0e..e54842d 100644 --- a/gcc/ipa-prop.h +++ b/gcc/ipa-prop.h @@ -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; diff --git a/gcc/tree-inline.cc b/gcc/tree-inline.cc index 043e1d5..01d4700 100644 --- a/gcc/tree-inline.cc +++ b/gcc/tree-inline.cc @@ -171,7 +171,7 @@ remap_ssa_name (tree name, copy_body_data *id) 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. */ diff --git a/gcc/value-range.cc b/gcc/value-range.cc index 87239fa..727ca7d 100644 --- a/gcc/value-range.cc +++ b/gcc/value-range.cc @@ -2508,7 +2508,7 @@ irange::irange_contains_p (const irange &r) const // 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]; diff --git a/gcc/value-relation.cc b/gcc/value-relation.cc index e6f5ef4..1ee6da1 100644 --- a/gcc/value-relation.cc +++ b/gcc/value-relation.cc @@ -955,7 +955,7 @@ dom_oracle::set_one_relation (basic_block bb, relation_kind k, tree op1, 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)) |