https://gcc.gnu.org/g:0931cea0e3a67e6a17790aeb676c793bccb2039a
commit r16-2161-g0931cea0e3a67e6a17790aeb676c793bccb2039a
Author: Jakub Jelinek <ja...@redhat.com>
Date: Thu Jul 10 10:16:43 2025 +0200
Change bellow in comments to below
While I'm not a native English speaker, I believe all the uses
of bellow (roar/bark/...) in comments in gcc are meant to be
below (beneath/under/...).
2025-07-10 Jakub Jelinek <ja...@redhat.com>
gcc/
* tree-vect-loop.cc (scale_profile_for_vect_loop): Comment
spelling fix: bellow -> below.
* ipa-polymorphic-call.cc (record_known_type): Likewise.
* config/i386/x86-tune.def: Likewise.
* config/riscv/vector.md (*vsetvldi_no_side_effects_si_extend):
Likewise.
* tree-scalar-evolution.cc (iv_can_overflow_p): Likewise.
* ipa-devirt.cc (add_type_duplicate): Likewise.
* tree-ssa-loop-niter.cc (maybe_lower_iteration_bound): Likewise.
* gimple-ssa-sccopy.cc: Likewise.
* cgraphunit.cc: Likewise.
* graphite.h (struct poly_dr): Likewise.
* ipa-reference.cc (ignore_edge_p): Likewise.
* tree-ssa-alias.cc (ao_compare::compare_ao_refs): Likewise.
* profile-count.h (profile_probability::probably_reliable_p):
Likewise.
* ipa-inline-transform.cc (inline_call): Likewise.
gcc/ada/
* par-load.adb: Comment spelling fix: bellow -> below.
* libgnarl/s-taskin.ads: Likewise.
gcc/testsuite/
* gfortran.dg/g77/980310-3.f: Comment spelling fix: bellow -> below.
* jit.dg/test-debuginfo.c: Likewise.
libstdc++-v3/
* testsuite/22_locale/codecvt/codecvt_unicode.h
(ucs2_to_utf8_out_error): Comment spelling fix: bellow -> below.
(utf16_to_ucs2_in_error): Likewise.
Diff:
---
gcc/ada/libgnarl/s-taskin.ads | 2 +-
gcc/ada/par-load.adb | 2 +-
gcc/cgraphunit.cc | 2 +-
gcc/config/i386/x86-tune.def | 2 +-
gcc/config/riscv/vector.md | 2 +-
gcc/gimple-ssa-sccopy.cc | 2 +-
gcc/graphite.h | 2 +-
gcc/ipa-devirt.cc | 2 +-
gcc/ipa-inline-transform.cc | 2 +-
gcc/ipa-polymorphic-call.cc | 2 +-
gcc/ipa-reference.cc | 2 +-
gcc/profile-count.h | 2 +-
gcc/testsuite/gfortran.dg/g77/980310-3.f | 2 +-
gcc/testsuite/jit.dg/test-debuginfo.c | 2 +-
gcc/tree-scalar-evolution.cc | 2 +-
gcc/tree-ssa-alias.cc | 2 +-
gcc/tree-ssa-loop-niter.cc | 2 +-
gcc/tree-vect-loop.cc | 2 +-
libstdc++-v3/testsuite/22_locale/codecvt/codecvt_unicode.h | 4 ++--
19 files changed, 20 insertions(+), 20 deletions(-)
diff --git a/gcc/ada/libgnarl/s-taskin.ads b/gcc/ada/libgnarl/s-taskin.ads
index d68e199e6262..dbf2e7bf91ec 100644
--- a/gcc/ada/libgnarl/s-taskin.ads
+++ b/gcc/ada/libgnarl/s-taskin.ads
@@ -390,7 +390,7 @@ package System.Tasking is
System_Domain : Dispatching_Domain_Access;
-- All processors belong to default system dispatching domain at start up.
-- We use a pointer which creates the actual variable for the reasons
- -- explained bellow in Dispatching_Domain_Tasks.
+ -- explained below in Dispatching_Domain_Tasks.
Dispatching_Domains_Frozen : Boolean := False;
-- True when the main procedure has been called. Hence, no new dispatching
diff --git a/gcc/ada/par-load.adb b/gcc/ada/par-load.adb
index 96fa7e85938d..4a97f14ffb51 100644
--- a/gcc/ada/par-load.adb
+++ b/gcc/ada/par-load.adb
@@ -83,7 +83,7 @@ procedure Load is
-- withed units and the second round handles Ada 2005 limited-withed units.
-- This is required to allow the low-level circuitry that detects circular
-- dependencies of units the correct notification of errors (see comment
- -- bellow). This variable is used to indicate that the second round is
+ -- below). This variable is used to indicate that the second round is
-- required.
function Same_File_Name_Except_For_Case
diff --git a/gcc/cgraphunit.cc b/gcc/cgraphunit.cc
index fa54a59d02b8..8e8d85562b03 100644
--- a/gcc/cgraphunit.cc
+++ b/gcc/cgraphunit.cc
@@ -63,7 +63,7 @@ along with GCC; see the file COPYING3. If not see
final assembler is generated. This is done in the following way. Note
that with link time optimization the process is split into three
stages (compile time, linktime analysis and parallel linktime as
- indicated bellow).
+ indicated below).
Compile time:
diff --git a/gcc/config/i386/x86-tune.def b/gcc/config/i386/x86-tune.def
index 4773e5dd5ad1..a039db3cfced 100644
--- a/gcc/config/i386/x86-tune.def
+++ b/gcc/config/i386/x86-tune.def
@@ -31,7 +31,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively. If
not, see
- Updating ix86_issue_rate and ix86_adjust_cost in i386.md
- possibly updating ia32_multipass_dfa_lookahead, ix86_sched_reorder
and ix86_sched_init_global if those tricks are needed.
- - Tunning the flags bellow. Those are split into sections and each
+ - Tunning the flags below. Those are split into sections and each
section is very roughly ordered by importance. */
/*****************************************************************************/
diff --git a/gcc/config/riscv/vector.md b/gcc/config/riscv/vector.md
index 6753b01db599..2046f04a02c5 100644
--- a/gcc/config/riscv/vector.md
+++ b/gcc/config/riscv/vector.md
@@ -1783,7 +1783,7 @@
[(set_attr "type" "vsetvl")
(set_attr "mode" "SI")])
-;; This pattern use to combine bellow two insns and then further remove
+;; This pattern use to combine below two insns and then further remove
;; unnecessary sign_extend operations:
;; (set (reg:DI 134 [ _1 ])
;; (unspec:DI [
diff --git a/gcc/gimple-ssa-sccopy.cc b/gcc/gimple-ssa-sccopy.cc
index 341bae46080b..e65f532db612 100644
--- a/gcc/gimple-ssa-sccopy.cc
+++ b/gcc/gimple-ssa-sccopy.cc
@@ -78,7 +78,7 @@ along with GCC; see the file COPYING3. If not see
To find all three types of copy statements we use an algorithm based on
strongly-connected components (SCCs) in dataflow graph. The algorithm was
- introduced in an article from 2013[1]. We describe the algorithm bellow.
+ introduced in an article from 2013[1]. We describe the algorithm below.
To identify SCCs we implement the Robert Tarjan's SCC algorithm. For the
SCC computation we wrap potential copy statements in the 'vertex' struct.
diff --git a/gcc/graphite.h b/gcc/graphite.h
index 66d4db691ac0..9cb35137e59d 100644
--- a/gcc/graphite.h
+++ b/gcc/graphite.h
@@ -155,7 +155,7 @@ struct poly_dr
The OpenScop access function is printed as follows:
| 1 # The number of disjunct components in a union of access functions.
- | R C O I L P # Described bellow.
+ | R C O I L P # Described below.
| a s0 s1 i j k 1
| 1 0 0 0 0 0 -5 = 0
| 0 1 0 -1 0 0 0 = 0
diff --git a/gcc/ipa-devirt.cc b/gcc/ipa-devirt.cc
index 532e25e87c60..18cb5a821953 100644
--- a/gcc/ipa-devirt.cc
+++ b/gcc/ipa-devirt.cc
@@ -1763,7 +1763,7 @@ add_type_duplicate (odr_type val, tree type)
}
/* One base is polymorphic and the other not.
This ought to be diagnosed earlier, but do not ICE in the
- checking bellow. */
+ checking below. */
else if (TYPE_BINFO (type1)
&& polymorphic_type_binfo_p (TYPE_BINFO (type1))
!= polymorphic_type_binfo_p (TYPE_BINFO (type2)))
diff --git a/gcc/ipa-inline-transform.cc b/gcc/ipa-inline-transform.cc
index 07a102440022..9d759d218b56 100644
--- a/gcc/ipa-inline-transform.cc
+++ b/gcc/ipa-inline-transform.cc
@@ -331,7 +331,7 @@ inline_call (struct cgraph_edge *e, bool update_original,
int estimated_growth = 0;
if (! update_overall_summary)
estimated_growth = estimate_edge_growth (e);
- /* This is used only for assert bellow. */
+ /* This is used only for assert below. */
#if 0
bool predicated = inline_edge_summary (e)->predicate != NULL;
#endif
diff --git a/gcc/ipa-polymorphic-call.cc b/gcc/ipa-polymorphic-call.cc
index 7b105f112b2c..09316de0e6ba 100644
--- a/gcc/ipa-polymorphic-call.cc
+++ b/gcc/ipa-polymorphic-call.cc
@@ -1353,7 +1353,7 @@ record_known_type (struct type_change_info *tci, tree
type, HOST_WIDE_INT offset
/* If we found a constructor of type that is not polymorphic or
that may contain the type in question as a field (not as base),
- restrict to the inner class first to make type matching bellow
+ restrict to the inner class first to make type matching below
happier. */
if (type
&& (offset
diff --git a/gcc/ipa-reference.cc b/gcc/ipa-reference.cc
index 2d8e62fb0c64..975341c9f6f3 100644
--- a/gcc/ipa-reference.cc
+++ b/gcc/ipa-reference.cc
@@ -732,7 +732,7 @@ get_read_write_all_from_node (struct cgraph_node *node,
/* Skip edges from and to nodes without ipa_reference enabled.
Ignore not available symbols. This leave
them out of strongly connected components and makes them easy to skip in the
- propagation loop bellow. */
+ propagation loop below. */
static bool
ignore_edge_p (cgraph_edge *e)
diff --git a/gcc/profile-count.h b/gcc/profile-count.h
index 20c03a292382..c893aec577c1 100644
--- a/gcc/profile-count.h
+++ b/gcc/profile-count.h
@@ -597,7 +597,7 @@ public:
There are two exceptions - edges leading to noreturn edges and edges
predicted by number of iterations heuristics are predicted well. This
macro
should be able to distinguish those, but at the moment it simply check for
- noreturn heuristic that is only one giving probability over 99% or bellow
+ noreturn heuristic that is only one giving probability over 99% or below
1%. In future we might want to propagate reliability information across
the
CFG if we find this information useful on multiple places. */
bool probably_reliable_p () const
diff --git a/gcc/testsuite/gfortran.dg/g77/980310-3.f
b/gcc/testsuite/gfortran.dg/g77/980310-3.f
index 39bd86c80365..4bf4d91092f3 100644
--- a/gcc/testsuite/gfortran.dg/g77/980310-3.f
+++ b/gcc/testsuite/gfortran.dg/g77/980310-3.f
@@ -12,7 +12,7 @@ C Date: Wed, 17 Dec 1997 23:20:29 +0000
C From: Joao Cardoso <jcard...@inescn.pt>
C To: egcs-b...@cygnus.com
C Subject: egcs-1.0 f77 bug on OSR5
-C When trying to compile the Fortran file that I enclose bellow,
+C When trying to compile the Fortran file that I enclose below,
C I got an assembler error:
C
C ./g77 -B./ -fpic -O -c scaleg.f
diff --git a/gcc/testsuite/jit.dg/test-debuginfo.c
b/gcc/testsuite/jit.dg/test-debuginfo.c
index 49e8834a0ba1..e0d6f2df0240 100644
--- a/gcc/testsuite/jit.dg/test-debuginfo.c
+++ b/gcc/testsuite/jit.dg/test-debuginfo.c
@@ -1,5 +1,5 @@
/* Essentially this test checks that debug info are generated for globals
- locals and functions, including type info. The comment bellow is used
+ locals and functions, including type info. The comment below is used
as fake code (does not affect the test, use for manual debugging). */
/*
int a_global_for_test_debuginfo;
diff --git a/gcc/tree-scalar-evolution.cc b/gcc/tree-scalar-evolution.cc
index 43311e52f94c..413ca49cb926 100644
--- a/gcc/tree-scalar-evolution.cc
+++ b/gcc/tree-scalar-evolution.cc
@@ -3088,7 +3088,7 @@ iv_can_overflow_p (class loop *loop, tree type, tree
base, tree step)
type_max = wi::max_value (type);
/* Just sanity check that we don't see values out of the range of the type.
- In this case the arithmetics bellow would overflow. */
+ In this case the arithmetics below would overflow. */
gcc_checking_assert (wi::ge_p (base_min, type_min, sgn)
&& wi::le_p (base_max, type_max, sgn));
diff --git a/gcc/tree-ssa-alias.cc b/gcc/tree-ssa-alias.cc
index 9dd1780867d4..41193432cc10 100644
--- a/gcc/tree-ssa-alias.cc
+++ b/gcc/tree-ssa-alias.cc
@@ -4376,7 +4376,7 @@ ao_compare::compare_ao_refs (ao_ref *ref1, ao_ref *ref2,
i++;
}
- /* For variable accesses we can not rely on offset match bellow.
+ /* For variable accesses we can not rely on offset match below.
We know that paths are struturally same, so only check that
starts of TBAA paths did not diverge. */
if (!known_eq (ref1->size, ref1->max_size)
diff --git a/gcc/tree-ssa-loop-niter.cc b/gcc/tree-ssa-loop-niter.cc
index 9ce881344142..6e1308625491 100644
--- a/gcc/tree-ssa-loop-niter.cc
+++ b/gcc/tree-ssa-loop-niter.cc
@@ -4701,7 +4701,7 @@ maybe_lower_iteration_bound (class loop *loop)
TODO: Due to the way record_estimate choose estimates to store, the bounds
will be always nb_iterations_upper_bound-1. We can change this to record
- also statements not dominating the loop latch and update the walk bellow
+ also statements not dominating the loop latch and update the walk below
to the shortest path algorithm. */
for (elt = loop->bounds; elt; elt = elt->next)
{
diff --git a/gcc/tree-vect-loop.cc b/gcc/tree-vect-loop.cc
index 2d5ea414559f..6f9765b54594 100644
--- a/gcc/tree-vect-loop.cc
+++ b/gcc/tree-vect-loop.cc
@@ -11141,7 +11141,7 @@ scale_profile_for_vect_loop (class loop *loop, edge
exit_e, unsigned vf, bool fl
profile_count entry_count = loop_preheader_edge (loop)->count ();
/* If we have unreliable loop profile avoid dropping entry
- count bellow header count. This can happen since loops
+ count below header count. This can happen since loops
has unrealistically low trip counts. */
while (vf > 1
&& loop->header->count > entry_count
diff --git a/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_unicode.h
b/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_unicode.h
index 9fe9ac87a3b8..2ba23bfc8d68 100644
--- a/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_unicode.h
+++ b/libstdc++-v3/testsuite/22_locale/codecvt/codecvt_unicode.h
@@ -1439,7 +1439,7 @@ ucs2_to_utf8_out_error (const std::codecvt<InternT,
ExternT, mbstate_t> &cvt)
// make the trailing surrogate a BMP char
{5, 10, 3, 6, u'z', 4},
- // don't replace anything in the test cases bellow, just show the surrogate
+ // don't replace anything in the test cases below, just show the surrogate
// pair (fourth CP) fully or partially
{5, 10, 3, 6, u'b', 0},
{5, 7, 3, 6, u'b', 0}, // no space for fourth CP
@@ -2072,7 +2072,7 @@ utf16_to_ucs2_in_error (const std::codecvt<InternT, char,
mbstate_t> &cvt,
// make the trailing surrogate a BMP char
{10, 5, 6, 3, u'z', 4},
- // don't replace anything in the test cases bellow, just show the surrogate
+ // don't replace anything in the test cases below, just show the surrogate
// pair (fourth CP) fully or partially (just the first surrogate)
{10, 5, 6, 3, u'b', 0},
{8, 5, 6, 3, u'b', 0},
