public inbox for gcc-cvs@sourceware.org
help / color / mirror / Atom feed
* [gcc r13-3150] Fix comment typos
@ 2022-10-07 7:10 Jakub Jelinek
0 siblings, 0 replies; only message in thread
From: Jakub Jelinek @ 2022-10-07 7:10 UTC (permalink / raw)
To: gcc-cvs
https://gcc.gnu.org/g:e66236c6e9eb83730dde15f359f2a21cb603887b
commit r13-3150-ge66236c6e9eb83730dde15f359f2a21cb603887b
Author: Jakub Jelinek <jakub@redhat.com>
Date: Fri Oct 7 09:08:46 2022 +0200
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.
Diff:
---
gcc/gimple-predicate-analysis.cc | 2 +-
gcc/ipa-prop.h | 2 +-
gcc/tree-inline.cc | 2 +-
gcc/value-range.cc | 2 +-
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 bc9ed847267..5013a4447d6 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 8811e0ea987..e54842de9a3 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 043e1d5987a..01d47000763 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 87239fafa77..727ca7dea2c 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 e6f5ef4d5e1..1ee6da199f2 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))
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2022-10-07 7:10 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2022-10-07 7:10 [gcc r13-3150] Fix comment typos Jakub Jelinek
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).