The following patch fixes various comment typos.
2025-09-30 Jakub Jelinek <jakub@redhat.com>
gcc/
* auto-profile.h (maybe_hot_afdo_count_p): Fix comment typos,
possiby -> possibly and ture -> true.
* gimplify.cc (build_asan_poison_call_expr): Change "of a for"
to "memory of the" in a comment.
* ipa-devirt.cc (add_type_duplicate): Fix comment typo,
mangles -> mangled.
* auto-profile.cc: Fix comment typo, -fauto-profile-inlinig
-> -fauto-profile-inlining.
(maybe_hot_afdo_count_p): Fix comment typos, possiby -> possibly
and ture -> true.
(function_instance::removed_icall_target): Fix comment typo,
Reutrn -> Return.
(function_instance::in_worklist_): Fix comment typo, Ture -> True.
(function_instance::offline): Fix comment typo, tolevel -> toplevel.
(function_instance::match): Fix comment typo, craeate_gcov ->
create_gcov.
(autofdo_source_profile::offline_external_functions): Fix comment
typos, tolevel -> toplevel and porfile -> profile.
(autofdo_source_profile::get_function_instance_by_inline_stack): Fix
comment typo, chekcing -> checking.
(struct scale): Fix comment typo, scalle -> scale.
* gimple.h (currently_expanding_gimple_stmt): Fix comment typo,
comminucating -> communicating.
* tree.h (canonical_type_used_p): Fix comment typo, ture -> true.
* tree-ssa-alias.cc (types_equal_for_same_type_for_tbaa_p): Likewise.
* ipa-profile.cc (contains_hot_call_p): Likewise.
* cfgexpand.cc (add_scope_conflicts_2): Fix comment typos,
Querry -> Query, referendd -> referenced and Querrying -> Querying.
* ipa-param-manipulation.cc (currently_expanding_gimple_stmt): Fix
comment typo, comminucating -> communicating.
* ipa-prop.cc (ipa_cst_ref_desc::refcount): Fix comment typo,
if -> is.
* tree-if-conv.cc (version_loop_for_if_conversion): Fix comment typos,
porfile -> profile and confistency -> consistency.
* fold-const.cc: Change size_int_wide in comment to size_int as
size_int_wide doesn't exit for 21 years.
gcc/testsuite/
* gcc.dg/vect/tsvc/vect-tsvc-s1244.c (s1244): Fix comment typo,
ture -> true.
* gcc.dg/vect/tsvc/vect-tsvc-s2244.c (s2244): Likewise.
significantly form one inline instance to another and from the
offline version.
- This is controlled by -fauto-profile-inlinig and is independent
+ This is controlled by -fauto-profile-inlining and is independent
of -fearly-inlining.
Phase 4: In AFDO pass.
considered cols. */
gcov_type afdo_hot_bb_threshod = -1;
-/* Return ture if COUNT is possiby hot. */
+/* Return true if COUNT is possibly hot. */
bool
maybe_hot_afdo_count_p (profile_count count)
{
removed_icall_target_ = true;
}
- /* Reutrn true if function is removed from indir target list. */
+ /* Return true if function is removed from indir target list. */
bool
removed_icall_target ()
{
to it. */
bool realized_;
- /* Ture if function is in worklist for merging/offlining. */
+ /* True if function is in worklist for merging/offlining. */
bool in_worklist_;
/* Pointer to outer function instance or NULL if this
}
/* Make inline function FN offline.
- If tolevel function of same name already exists, then merge profiles.
+ If toplevel function of same name already exists, then merge profiles.
Otherwise turn FN toplevel. Return true if new toplevel function
was introduced.
If new toplevel functions are created and NEW_FUNCTIONS != NULL,
unsigned int start_location = get_combined_location
(DECL_STRUCT_FUNCTION (node->decl)->function_start_locus, node->decl);
/* When outputting code to builtins location we use line number 0.
- craeate_gcov is stupid and hapilly computes offsets across files.
+ create_gcov is stupid and happily computes offsets across files.
Silently ignore it. */
unsigned int zero_location
= ((unsigned)(1-DECL_SOURCE_LINE (node->decl))) << 16;
seen.add (iter.first);
}
- /* Now process all tolevel (offline) function instances.
+ /* Now process all toplevel (offline) function instances.
If instance has no definition in this translation unit,
first offline all inlined functions which are defined here
- (so we do not lose porfile due to cross-module inlining
+ (so we do not lose profile due to cross-module inlining
done by link-time optimizers).
If instance has a definition, look into all inlined functions
if (s == NULL)
{
/* afdo inliner extends the stack by last entry with unknown
- location while chekcing if function was inlined during train run.
+ location while checking if function was inlined during train run.
We do not want to print diagnostics about every function
which is not inlined. */
if (s && dump_enabled_p () && stack[i].location != UNKNOWN_LOCATION)
return 0;
}
-/* To scalle a connected component of graph we collect desired scales of
+/* To scale a connected component of graph we collect desired scales of
basic blocks on the boundary and then compute a robust average. */
struct scale
considered cols. */
extern gcov_type afdo_hot_bb_threshold;
-/* Return ture if COUNT is possiby hot. */
+/* Return true if COUNT is possibly hot. */
extern bool maybe_hot_afdo_count_p (profile_count count);
#endif /* AUTO_PROFILE_H */
struct ssaexpand SA;
/* This variable holds the currently expanded gimple statement for purposes
- of comminucating the profile info to the builtin expanders. */
+ of communicating the profile info to the builtin expanders. */
gimple *currently_expanding_gimple_stmt;
static rtx expand_debug_expr (tree);
{
gcc_assert (TREE_CODE (name) == SSA_NAME);
- /* Querry the cache for the mapping of addresses that are referendd by
- ssa name NAME. Querrying it will fill in it. */
+ /* Query the cache for the mapping of addresses that are referenced by
+ ssa name NAME. Querying it will fill in it. */
bitmap_iterator bi;
unsigned i;
const_bitmap bmap = cache (name);
@@ This would also make life easier when this technology is used
@@ for cross-compilers. */
-/* The entry points in this file are fold, size_int_wide and size_binop.
+/* The entry points in this file are fold, size_int and size_binop.
fold takes a tree as argument and returns a simplified tree.
extern enum gimple_statement_structure_enum const gss_for_code_[];
/* This variable holds the currently expanded gimple statement for purposes
- of comminucating the profile info to the builtin expanders. */
+ of communicating the profile info to the builtin expanders. */
extern gimple *currently_expanding_gimple_stmt;
size_t gimple_size (enum gimple_code code, unsigned num_ops = 0);
1, tmp_var);
}
-/* Generate IFN_ASAN_MARK call that poisons shadow of a for DECL variable. */
+/* Generate IFN_ASAN_MARK call that poisons shadow memory of the DECL
+ variable. */
static tree
build_asan_poison_call_expr (tree decl)
before we can pass them to odr_types_equivalent_p (PR lto/83121). */
if (lto_location_cache::current_cache)
lto_location_cache::current_cache->apply_location_cache ();
- /* As a special case we stream mangles names of integer types so we can see
+ /* As a special case we stream mangled names of integer types so we can see
if they are believed to be same even though they have different
representation. Avoid bogus warning on mismatches in these. */
if (TREE_CODE (type) != INTEGER_TYPE
in ADJUSTMENTS. FNDECL designates the new function clone which is being
modified. OLD_FNDECL is the function of which FNDECL is a clone (and which
at the time of invocation still share DECL_ARGUMENTS). ID is the
- copy_body_data structure driving the wholy body copying process. VARS is a
+ copy_body_data structure driving the whole body copying process. VARS is a
pointer to the head of the list of new local variables, TREE_MAP is the map
that drives tree substitution in the cloning process. */
return edge != NULL;
}
-/* Return ture if NODE contains hot calls. */
+/* Return true if NODE contains hot calls. */
bool
contains_hot_call_p (struct cgraph_node *node)
/* Linked list of duplicates created when call graph edges are cloned. */
struct ipa_cst_ref_desc *next_duplicate;
/* Number of references in IPA structures, IPA_UNDESCRIBED_USE if the value
- if out of control. */
+ is out of control. */
int refcount;
};
real_t s1244(struct args_t * func_args)
{
// node splitting
-// cycle with ture and anti dependency
+// cycle with true and anti dependency
initialise_arrays(__func__);
real_t s2244(struct args_t * func_args)
{
// node splitting
-// cycle with ture and anti dependency
+// cycle with true and anti dependency
initialise_arrays(__func__);
}
initialize_original_copy_tables ();
- /* At this point we invalidate porfile confistency until IFN_LOOP_VECTORIZED
+ /* At this point we invalidate profile consistency until IFN_LOOP_VECTORIZED
is re-merged in the vectorizer. */
new_loop = loop_version (loop, cond, &cond_bb,
profile_probability::always (),
}
}
-/* Return ture if TYPE1 and TYPE2 will always give the same answer
+/* Return true if TYPE1 and TYPE2 will always give the same answer
when compared with other types using same_type_for_tbaa. */
static bool
return TYPE_CANONICAL (type1) == TYPE_CANONICAL (type2);
}
-/* Return ture if TYPE1 and TYPE2 will always give the same answer
+/* Return true if TYPE1 and TYPE2 will always give the same answer
when compared with other types using same_type_for_tbaa. */
bool
return code;
}
-/* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
+/* Return true if get_alias_set care about TYPE_CANONICAL of given type.
We don't define the types for pointers, arrays and vectors. The reason is
that pointers are handled specially: ptr_type_node accesses conflict with
accesses to all other pointers. This is done by alias.cc.