Hi! This patch attempts to fix various comment typos (inspired by Gemini AI on dwarf2out.cc, gimplify.cc and combine.cc files producing list of typos, then manual grep for all the occurrences and changing them case by case (e.g. there was one correct recourse use elsewhere I believe).
I plan to commit this tonight as obvious, posting now so that people can look for issues in there or typos in adjecent words etc. 2025-12-19 Jakub Jelinek <[email protected]> gcc/ * alias.cc (alias_set_subset_of): Fix comment typo, explicitely -> explicitly. * builtins.cc (get_object_alignment_2): Likewise. * combine.cc (make_extraction): Fix comment typos, potentionally -> potentially and implicitely -> implicitly. (simplify_comparison): Fix comment typo, outmost -> outermost. (record_truncated_values): Fix comment typo, truning -> turning. (distribute_notes): Fix comment typo, recourse -> recurse. * config/avr/avr.md (*<extend_u>maddqihi4_split): Fix comment typo, explicitely -> explicitly. (*mulu<mode>si3): Likewise. Fix comment typo, implicitely -> implicitly. * config/i386/i386.cc (ix86_get_drap_rtx): Fix comment typo, statment -> statement. * config/rs6000/rs6000.h (TARGET_DIRECT_MOVE_64BIT): Fix comment typo, transfered -> transferred. * config/s390/s390.cc (s390_encode_section_info): Fix comment typo, catched -> caught. * dwarf2out.cc (dwarf_proc_stack_usage_map): Fix comment typo, invokation -> invocation. (dwarf2out_die_ref_for_decl): Fix comment typo, refering -> referring. (loc_list_from_tree_1): Fix message typo, INDCREMENT -> INCREMENT. (field_byte_offset): Fix comment typo, simplier -> simpler. (add_data_member_location_attribute): Fix comment typo, catched -> caught. (gen_lexical_block_die): Fix comment typo, conrecte -> concrete. (analyze_variants_discr): Fix comment typo, consistant -> consistent. (gen_decl_die): Fix comment typo, prunning -> pruning. (resolve_variable_values): Fix comment typo, refering -> referring. * genmatch.cc (expr::expr_type): Fix comment typo, explicitely -> explicitly. * gimple-range-phi.cc (phi_group::is_modifier_p): Fix comment typo, statment -> statement. * gimple-ssa-store-merging.cc (pass_optimize_bswap::execute): Fix comment typo, invokation -> invocation. Add second space after dot. * gimple-walk.cc (walk_gimple_op): Fix comment typo, explicitely -> explicitly. * gimplify.cc (mostly_copy_tree_r): Fix comment typo, gimplication -> gimplification. (var_needs_auto_init_p): Fix comment typo, automaticly -> automatically. (gimplify_decl_expr): Fix comment typos, varaible -> variable and compatiple -> compatible. (emit_warn_switch_unreachable): Fix comment typo, statment -> statement. (should_warn_for_implicit_fallthrough): Fix comment typo, fallthough -> fallthrough. (modify_call_for_omp_dispatch): Fix comment typo, interobject -> interop. (oacc_default_clause): Fix comment typo, tranfered -> transferred. (omp_notice_variable): Likewise. * graphite-isl-ast-to-gimple.cc (binary_op_to_tree): Fix comment typo, explicitely -> explicitly. * ipa-param-manipulation.cc (push_function_arg_decls): Likewise. * ipa-prop.cc (ipa_make_edge_direct_to_target): Likewise. * ipa-prop.h (ipa_node_params::node_within_scc): Fix comment typo, potentionally -> potentially. * loop-init.cc (fix_loop_structure): Fix comment typo, refering -> referring. * match.pd (1 / X -> X == 1): Fix comment typo, simplier -> simpler. * opts.cc (global_options): Fix comment typo, explicitely -> explicitly. * sanopt.cc (sanopt_optimize_walker): Fix comment typo, potentionally -> potentially. * tree.cc (variably_modified_type_p): Fix comment typo, refering -> referring. * tree-cfg.cc (group_case_labels_stmt): Likewise. (dump_function_to_file): Fix comment typo, explicitely -> explicitly. (make_forwarders_with_degenerate_phis): Likewise. * tree-inline.cc (replace_locals_op): Likewise. * tree-loop-distribution.cc (loop_distribution::execute): Fix comment typo, refering -> referring. * tree-sra.cc (generate_subtree_deferred_init): Fix comment typo, statment -> statement. * tree-ssa-alias.cc (ptrs_compare_unequal): Fix comment typo, explicitely -> explicitly. * tree-ssa-forwprop.cc (_vec_perm_simplify_seq::stmt): Fix comment typo, statment -> statement. (narrow_vec_perm_simplify_seq): Fix message typo, statment -> statement. (blend_vec_perm_simplify_seqs): Likewise. * tree-ssa-pre.cc (compute_antic_aux): Fix comment typo, explicitely -> explicitly. * tree-vect-loop-manip.cc (vect_do_peeling): Fix comment typo, refering -> referring. * tree-vect-patterns.cc: Fix comment typo, transfered -> transferred. * tree-vect-slp.cc (vect_build_slp_tree_2): Fix comment typo, explicitely -> explicitly. (vect_build_slp_instance): Fix comment typo, transfered -> transferred. (vect_optimize_slp_pass::build_vertices): Fix comment typo, explicitely -> explicitly. (vect_slp_analyze_node_operations): Likewise. Fix comment typo, refering -> referring. * tree-vect-stmts.cc (vectorizable_store): Fix comment typo, catched -> caught. * vec.h (auto_vec::auto_vec): Fix comment typo, refering -> referring. gcc/ada/ * sem_attr.adb (Set_Bounds): Fix comment typo, transfered -> transferred. * sem_ch6.adb (Analyze_Expression_Function): Likewise. * sysdep.c (__gnat_get_task_options): Fix comment typo, explicitely -> explicitly. algol68/ * a68-low-decls.cc (a68_lower_variable_declaration): Fix comment typo, varaible -> variable. gcc/c/ * gimple-parser.cc (c_parser_gimple_switch_stmt): Fix comment typo, statment -> statement. cobol/ * lexio.cc (parse_replace_pairs): Fix comment typo, statment -> statement. (cdftext::free_form_reference_format): Likewise. gcc/fortran/ * gfortran.texi: Fix typo, transfered -> transferred. * resolve.cc (resolve_where): Fix comment typo, outmost -> outermost. gcc/lto/ * lto-common.cc (lto_resolution_read): Fix comment typo, explicitely -> explicitly. m2/ * gm2-compiler/FilterError.mod: Fix comment typo, refering -> referring. * gm2-compiler/M2Batch.mod (LookupOuterModule): Likewise. gcc/testsuite/ * gcc.c-torture/compile/20030323-1.c: Fix comment typo, statment -> statement. * gcc.dg/tree-ssa/pr96779.c: Fix comment typo, transfered -> transferred. * gcc.dg/tree-ssa/pr96779-disabled.c: Likewise. * gcc.dg/tree-ssa/ssa-thread-16.c (foo): Fix comment typo, catched -> caught. * gcc.target/s390/larl-1.c: Fix comment typo, explicitely -> explicitly. * g++.dg/tree-ssa/pr44706.C: Fix comment typo, invokation -> invocation. * g++.dg/tree-ssa/pr87502.C: Fix comment typo, explicitely -> explicitly. * gfortran.dg/bound_8.f90: Likewise. * gfortran.dg/coarray_14.f90: Fix comment typo, statment -> statement. --- gcc/alias.cc.jj 2025-11-25 10:09:48.642216813 +0100 +++ gcc/alias.cc 2025-12-19 15:51:39.599079548 +0100 @@ -442,7 +442,7 @@ alias_set_subset_of (alias_set_type set1 *ptr2 = ... Additionally if a set contains universal pointer, we consider every pointer - to be a subset of it, but we do not represent this explicitely - doing so + to be a subset of it, but we do not represent this explicitly - doing so would require us to update transitive closure each time we introduce new pointer type. This makes aliasing_component_refs_p to return true on the following testcase: --- gcc/builtins.cc.jj 2025-11-11 07:21:30.338268454 +0100 +++ gcc/builtins.cc 2025-12-19 15:51:51.143880186 +0100 @@ -288,7 +288,7 @@ get_object_alignment_2 (tree exp, unsign unsigned HOST_WIDE_INT ptr_bitpos; unsigned HOST_WIDE_INT ptr_bitmask = ~0; - /* If the address is explicitely aligned, handle that. */ + /* If the address is explicitly aligned, handle that. */ if (TREE_CODE (addr) == BIT_AND_EXPR && TREE_CODE (TREE_OPERAND (addr, 1)) == INTEGER_CST) { --- gcc/combine.cc.jj 2025-11-20 07:44:57.871966289 +0100 +++ gcc/combine.cc 2025-12-19 15:51:06.057658748 +0100 @@ -7615,7 +7615,7 @@ make_extraction (machine_mode mode, rtx if (GET_CODE (inner) == SUBREG && subreg_lowpart_p (inner) && (paradoxical_subreg_p (inner) - /* If trying or potentionally trying to extract + /* If trying or potentially trying to extract bits outside of is_mode, don't look through non-paradoxical SUBREGs. See PR82192. */ || (pos_rtx == NULL_RTX @@ -7664,7 +7664,7 @@ make_extraction (machine_mode mode, rtx } } else if (GET_CODE (inner) == TRUNCATE - /* If trying or potentionally trying to extract + /* If trying or potentially trying to extract bits outside of is_mode, don't look through TRUNCATE. See PR82192. */ && pos_rtx == NULL_RTX @@ -7929,7 +7929,7 @@ make_extraction (machine_mode mode, rtx mode. */ else if (!MEM_P (inner)) { - /* On the LHS, don't create paradoxical subregs implicitely truncating + /* On the LHS, don't create paradoxical subregs implicitly truncating the register unless TARGET_TRULY_NOOP_TRUNCATION. */ if (in_dest && !TRULY_NOOP_TRUNCATION_MODES_P (GET_MODE (inner), @@ -13131,7 +13131,7 @@ simplify_comparison (enum rtx_code code, } /* Now make any compound operations involved in this comparison. Then, - check for an outmost SUBREG on OP0 that is not doing anything or is + check for an outermost SUBREG on OP0 that is not doing anything or is paradoxical. The latter transformation must only be performed when it is known that the "extra" bits will be the same in op0 and op1 or that they don't matter. There are three cases to consider: @@ -13779,7 +13779,7 @@ record_truncated_value (rtx x) } /* Callback for note_uses. Find hardregs and subregs of pseudos and - the modes they are used in. This can help truning TRUNCATEs into + the modes they are used in. This can help turning TRUNCATEs into SUBREGs. */ static void @@ -14919,7 +14919,7 @@ distribute_notes (rtx notes, rtx_insn *f that is unused, we must arrange for an appropriate REG_DEAD note to be added for it. However, we can't just emit a USE and tag the note to it, since the register might actually - be dead; so we recourse, and the recursive call then finds + be dead; so we recurse, and the recursive call then finds the previous insn that used this register. */ if (place && REG_NREGS (XEXP (note, 0)) > 1) --- gcc/config/avr/avr.md.jj 2025-11-07 10:35:06.961574763 +0100 +++ gcc/config/avr/avr.md 2025-12-19 15:52:14.012485286 +0100 @@ -2565,7 +2565,7 @@ (define_insn_and_split "*msubqi4.const" ;; return aInt[3*z+2]; ;; } ;; -;; because the constant +4 then is added explicitely instead of consuming it +;; because the constant +4 then is added explicitly instead of consuming it ;; with the aInt symbol. Therefore, we rely on insn combine which takes costs ;; into account more accurately and doesn't do burte-force multiply-add/sub. ;; The implementational effort is the same so we are fine with that approach. @@ -3384,8 +3384,8 @@ (define_insn_and_split "*mulu<mode>si3" (set (match_dup 0) (reg:SI 22))] { - // Do the QI -> HI extension explicitely before the multiplication. - // Do the HI -> SI extension implicitely and after the multiplication. + // Do the QI -> HI extension explicitly before the multiplication. + // Do the HI -> SI extension implicitly and after the multiplication. if (QImode == <MODE>mode) operands[1] = gen_rtx_ZERO_EXTEND (HImode, operands[1]); --- gcc/config/i386/i386.cc.jj 2025-12-17 09:11:52.559563092 +0100 +++ gcc/config/i386/i386.cc 2025-12-19 15:37:45.758496935 +0100 @@ -8047,7 +8047,7 @@ static rtx ix86_get_drap_rtx (void) { /* We must use DRAP if there are outgoing arguments on stack or - the stack pointer register is clobbered by asm statment and + the stack pointer register is clobbered by asm statement and ACCUMULATE_OUTGOING_ARGS is false. */ if (ix86_force_drap || ((cfun->machine->outgoing_args_on_stack --- gcc/config/rs6000/rs6000.h.jj 2025-04-08 14:08:49.883300910 +0200 +++ gcc/config/rs6000/rs6000.h 2025-12-19 15:42:28.151607643 +0100 @@ -550,7 +550,7 @@ extern int rs6000_vector_align[]; && (TARGET_PPC_GFXOPT || VECTOR_UNIT_VSX_P (DFmode))) /* Macro to say whether we can do optimizations where we need to do parts of - the calculation in 64-bit GPRs and then is transfered to the vector + the calculation in 64-bit GPRs and then is transferred to the vector registers. */ #define TARGET_DIRECT_MOVE_64BIT (TARGET_DIRECT_MOVE \ && TARGET_POWERPC64) --- gcc/config/s390/s390.cc.jj 2025-12-13 09:54:13.104394424 +0100 +++ gcc/config/s390/s390.cc 2025-12-19 15:23:37.456179082 +0100 @@ -14273,7 +14273,7 @@ s390_encode_section_info (tree decl, rtx -munaligned-symbols switch. For all external symbols without explicit alignment DECL_ALIGN is already trimmed down to 8, however for weak - symbols this does not happen. These cases are catched by the + symbols this does not happen. These cases are caught by the type size check. */ const_tree size = TYPE_SIZE (TREE_TYPE (decl)); unsigned HOST_WIDE_INT size_num = (tree_fits_uhwi_p (size) --- gcc/dwarf2out.cc.jj 2025-12-19 11:12:14.154494764 +0100 +++ gcc/dwarf2out.cc 2025-12-19 15:29:15.062339013 +0100 @@ -3618,7 +3618,7 @@ static GTY(()) vec<dw_die_ref, va_gc> *a /* A hash map to remember the stack usage for DWARF procedures. The value stored is the stack size difference between before the DWARF procedure - invokation and after it returned. In other words, for a DWARF procedure + invocation and after it returned. In other words, for a DWARF procedure that consumes N stack slots and that pushes M ones, this stores M - N. */ static hash_map<dw_die_ref, int> *dwarf_proc_stack_usage_map; @@ -6034,7 +6034,7 @@ equate_block_to_die (tree block, dw_die_ /* For DECL which might have early dwarf output query a SYMBOL + OFFSET - style reference. Return true if we found one refering to a DIE for + style reference. Return true if we found one referring to a DIE for DECL, otherwise return false. */ static bool @@ -19156,7 +19156,7 @@ loc_list_from_tree_1 (tree loc, int want case PREDECREMENT_EXPR: case POSTINCREMENT_EXPR: case POSTDECREMENT_EXPR: - expansion_failed (loc, NULL_RTX, "PRE/POST INDCREMENT/DECREMENT"); + expansion_failed (loc, NULL_RTX, "PRE/POST INCREMENT/DECREMENT"); /* There are no opcodes for these operations. */ return 0; @@ -20325,7 +20325,7 @@ field_byte_offset (const_tree decl, stru tree_result = fold_build2 (PLUS_EXPR, TREE_TYPE (tree_result), ctx->variant_part_offset, tree_result); - /* If the byte offset is a constant, it's simplier to handle a native + /* If the byte offset is a constant, it's simpler to handle a native constant rather than a DWARF expression. */ if (TREE_CODE (tree_result) == INTEGER_CST) { @@ -20506,7 +20506,7 @@ add_data_member_location_attribute (dw_d /* While DW_AT_data_bit_offset has been added already in DWARF4, e.g. GDB only added support to it in November 2016. For DWARF5 we need newer debug info consumers anyway. We might change this - to dwarf_version >= 4 once most consumers catched up. */ + to dwarf_version >= 4 once most consumers caught up. */ if (dwarf_version >= 5 && TREE_CODE (decl) == FIELD_DECL && DECL_BIT_FIELD_TYPE (decl) @@ -25479,7 +25479,7 @@ gen_lexical_block_die (tree stmt, dw_die if (BLOCK_ABSTRACT_ORIGIN (stmt)) { - /* If this is an inlined or conrecte instance, create a new lexical + /* If this is an inlined or concrete instance, create a new lexical die for anything below to attach DW_AT_abstract_origin to. */ if (old_die) stmt_die = new_die (DW_TAG_lexical_block, context_die, stmt); @@ -26107,7 +26107,7 @@ analyze_variants_discr (tree variant_par goto abort; /* Extract the discriminant from the first operand and check it - is consistant with the same analysis in the second + is consistent with the same analysis in the second operand. */ candidate_discr_1 = analyze_discr_in_predicate (TREE_OPERAND (lower_op, 0), @@ -26163,7 +26163,7 @@ analyze_variants_discr (tree variant_par matching discriminant values. Abort everything. */ goto abort; - /* If the discriminant info is not consistant with what we saw so + /* If the discriminant info is not consistent with what we saw so far, consider the analysis failed and abort everything. */ if (candidate_discr == NULL_TREE || (*discr_decl != NULL_TREE && candidate_discr != *discr_decl)) @@ -27634,7 +27634,7 @@ gen_decl_die (tree decl, tree origin, st DW_TAG_union_type, or DW_TAG_enumeration_type DIE here. But nothing should be actually referencing those DIEs, as variable DIEs with that type would be emitted already in the abstract origin, so it was always - removed during unused type prunning. Don't add anything in this + removed during unused type pruning. Don't add anything in this case. */ if (TYPE_DECL_IS_STUB (decl) && decl_ultimate_origin (decl) != NULL_TREE) break; @@ -33454,7 +33454,7 @@ resolve_variable_value (dw_die_ref die) } } -/* Attempt to optimize DW_OP_GNU_variable_value refering to +/* Attempt to optimize DW_OP_GNU_variable_value referring to temporaries in the current function. */ static void --- gcc/genmatch.cc.jj 2025-05-01 08:25:45.186922375 +0200 +++ gcc/genmatch.cc 2025-12-19 15:52:44.255963032 +0100 @@ -1520,7 +1520,7 @@ public: /* The operator and its operands. */ id_base *operation; vec<operand *> ops; - /* An explicitely specified type - used exclusively for conversions. */ + /* An explicitly specified type - used exclusively for conversions. */ const char *expr_type; /* Whether the operation is to be applied commutatively. This is later lowered to two separate patterns. */ --- gcc/gimple-range-phi.cc.jj 2025-11-21 07:12:17.468787577 +0100 +++ gcc/gimple-range-phi.cc 2025-12-19 15:38:23.186848907 +0100 @@ -82,7 +82,7 @@ phi_group::phi_group (bitmap bm, irange m_vr.set_varying (init_range.type ()); } -// Return 0 if S is not a modifier statment for group members BM. +// Return 0 if S is not a modifier statement for group members BM. // If it could be a modifier, return which operand position (1 or 2) // the phi member occurs in. unsigned --- gcc/gimple-ssa-store-merging.cc.jj 2025-08-01 08:41:46.011385604 +0200 +++ gcc/gimple-ssa-store-merging.cc 2025-12-19 15:20:26.310484164 +0100 @@ -1534,8 +1534,8 @@ maybe_optimize_vector_constructor (gimpl } /* Find manual byte swap implementations as well as load in a given - endianness. Byte swaps are turned into a bswap builtin invokation - while endian loads are converted to bswap builtin invokation or + endianness. Byte swaps are turned into a bswap builtin invocation + while endian loads are converted to bswap builtin invocation or simple load according to the target endianness. */ unsigned int --- gcc/gimple-walk.cc.jj 2025-07-27 23:31:10.242000270 +0200 +++ gcc/gimple-walk.cc 2025-12-19 15:52:57.277738169 +0100 @@ -535,7 +535,7 @@ walk_gimple_op (gimple *stmt, walk_tree_ break; case GIMPLE_PHI: - /* PHIs are not GSS_WITH_OPS so we need to handle them explicitely. */ + /* PHIs are not GSS_WITH_OPS so we need to handle them explicitly. */ { gphi *phi = as_a <gphi *> (stmt); if (wi) --- gcc/gimplify.cc.jj 2025-12-18 15:04:20.321831765 +0100 +++ gcc/gimplify.cc 2025-12-19 15:45:07.198855616 +0100 @@ -901,7 +901,7 @@ gimple_add_tmp_var (tree tmp) /* This page contains routines to unshare tree nodes, i.e. to duplicate tree nodes that are referenced more than once in GENERIC functions. This is necessary because gimplification (translation into GIMPLE) is performed - by modifying tree nodes in-place, so gimplication of a shared node in a + by modifying tree nodes in-place, so gimplification of a shared node in a first context could generate an invalid GIMPLE form in a second context. This is achieved with a simple mark/copy/unmark algorithm that walks the @@ -2101,7 +2101,7 @@ gimple_add_padding_init_for_auto_var (tr gimplify_seq_add_stmt (seq_p, call); } -/* Return true if the DECL need to be automaticly initialized by the +/* Return true if the DECL need to be automatically initialized by the compiler. */ static bool var_needs_auto_init_p (tree decl) @@ -2158,7 +2158,7 @@ gimplify_decl_expr (tree *stmt_p, gimple /* Check whether a decl has FE created VALUE_EXPR here BEFORE gimplify_vla_decl creates VALUE_EXPR for a vla decl. If the decl has VALUE_EXPR that was created by FE (usually - C++FE), it's a proxy varaible, and FE already initialized + C++FE), it's a proxy variable, and FE already initialized the VALUE_EXPR of it, we should not initialize it anymore. */ bool decl_had_value_expr_p = DECL_HAS_VALUE_EXPR_P (decl); @@ -2236,7 +2236,7 @@ gimplify_decl_expr (tree *stmt_p, gimple pattern initialization. In order to make the paddings as zeroes for pattern init, We should add a call to __builtin_clear_padding to clear the - paddings to zero in compatiple with CLANG. + paddings to zero in compatible with CLANG. We cannot insert this call if the variable is a gimple register since __builtin_clear_padding will take the address of the variable. As a result, if a long double/_Complex long double @@ -2305,7 +2305,7 @@ gimplify_statement_list (tree *expr_p, g } -/* Emit warning for the unreachable statment STMT if needed. +/* Emit warning for the unreachable statement STMT if needed. Return the gimple itself when the warning is emitted, otherwise return NULL. */ static gimple * @@ -2711,7 +2711,7 @@ collect_fallthrough_labels (gimple_stmt_ return prev; } -/* Return true if the switch fallthough warning should occur. LABEL is +/* Return true if the switch fallthrough warning should occur. LABEL is the label statement that we're falling through to. */ static bool @@ -4095,7 +4095,7 @@ modify_call_for_omp_dispatch (tree expr, } /* Initialize the arrays, generating temp vars and clobbers for - the interobject objects. (The constructed array holding the + the interop objects. (The constructed array holding the pointers to these objects shouldn't need clobbering as there's no reason for GOMP_interop to modify its contents.) */ for (j = ninterop, a = apparg; j < nappend; j++, a = TREE_CHAIN (a)) @@ -9181,7 +9181,7 @@ oacc_default_clause (struct gimplify_omp type = TREE_TYPE (type); /* For Fortran COMMON blocks, only used variables in those blocks are - transfered and remapped. The block itself will have a private clause to + transferred and remapped. The block itself will have a private clause to avoid transfering the data twice. The hook evaluates to false by default. For a variable in Fortran's COMMON or EQUIVALENCE block, returns 'true' (as we have shared=false) - as only @@ -9303,8 +9303,8 @@ omp_notice_variable (struct gimplify_omp { if (ctx->region_type & ORT_ACC) /* For OpenACC, defer expansion of value to avoid transfering - privatized common block data instead of im-/explicitly transfered - variables which are in common blocks. */ + privatized common block data instead of im-/explicitly + transferred variables which are in common blocks. */ ; else { --- gcc/graphite-isl-ast-to-gimple.cc.jj 2025-04-08 14:08:51.800274223 +0200 +++ gcc/graphite-isl-ast-to-gimple.cc 2025-12-19 15:53:11.328495538 +0100 @@ -319,7 +319,7 @@ binary_op_to_tree (tree type, __isl_take isl_ast_expr_free (expr); /* From our constraint generation we may get modulo operations that - we cannot represent explicitely but that are no-ops for TYPE. + we cannot represent explicitly but that are no-ops for TYPE. Elide those. */ if ((expr_type == isl_ast_op_pdiv_r || expr_type == isl_ast_op_zdiv_r --- gcc/ipa-param-manipulation.cc.jj 2025-11-14 16:32:39.798788977 +0100 +++ gcc/ipa-param-manipulation.cc 2025-12-19 15:53:21.363322255 +0100 @@ -155,7 +155,7 @@ push_function_arg_decls (vec<tree> *args /* Safety check that we do not attempt to use the function in WPA, except when the function is a thunk and then we have DECL_ARGUMENTS or when we - have already explicitely loaded its body. */ + have already explicitly loaded its body. */ gcc_assert (!flag_wpa || DECL_ARGUMENTS (fndecl) || gimple_has_body_p (fndecl)); --- gcc/ipa-prop.cc.jj 2025-12-16 22:40:41.475372307 +0100 +++ gcc/ipa-prop.cc 2025-12-19 15:53:33.340115437 +0100 @@ -4032,7 +4032,7 @@ ipa_make_edge_direct_to_target (struct c else callee = cgraph_node::get (target); - /* Because may-edges are not explicitely represented and vtable may be external, + /* Because may-edges are not explicitly represented and vtable may be external, we may create the first reference to the object in the unit. */ if (!callee || callee->inlined_to) { --- gcc/ipa-prop.h.jj 2025-12-16 22:40:41.475372307 +0100 +++ gcc/ipa-prop.h 2025-12-19 15:46:40.508244327 +0100 @@ -666,7 +666,7 @@ public: /* Node has been completely replaced by clones and will be removed after ipa-cp is finished. */ unsigned node_dead : 1; - /* Node is involved in a recursion, potentionally indirect. */ + /* Node is involved in a recursion, potentially indirect. */ unsigned node_within_scc : 1; /* Node contains only direct recursion. */ unsigned node_is_self_scc : 1; --- gcc/loop-init.cc.jj 2025-04-08 14:08:51.956272051 +0200 +++ gcc/loop-init.cc 2025-12-19 15:29:39.944908201 +0100 @@ -314,7 +314,7 @@ fix_loop_structure (bitmap changed_bbs) n_deleted++; } - /* If we deleted loops then the cached scalar evolutions refering to + /* If we deleted loops then the cached scalar evolutions referring to those loops become invalid. */ if (n_deleted > 0 && scev_initialized_p ()) scev_reset_htab (); --- gcc/match.pd.jj 2025-12-15 11:11:59.012050391 +0100 +++ gcc/match.pd 2025-12-19 15:21:42.404168434 +0100 @@ -598,7 +598,7 @@ (define_operator_list SYNC_FETCH_AND_AND But not for 1 / 0 so that we can get proper warnings and errors, and not for 1-bit integers as they are edge cases better handled elsewhere. Delay the conversion of the signed division until late - because `1 / X` is simplier to handle than the resulting COND_EXPR. */ + because `1 / X` is simpler to handle than the resulting COND_EXPR. */ (simplify (trunc_div integer_onep@0 @1) (if (INTEGRAL_TYPE_P (type) --- gcc/opts.cc.jj 2025-12-16 22:40:41.545371075 +0100 +++ gcc/opts.cc 2025-12-19 15:54:15.860381183 +0100 @@ -190,7 +190,7 @@ bool dwarf_based_debuginfo_p () || (write_symbols & CODEVIEW_DEBUG)); } -/* All flag uses below need to explicitely reference the option sets +/* All flag uses below need to explicitly reference the option sets to operate on. */ #define global_options DO_NOT_USE #define global_options_set DO_NOT_USE --- gcc/sanopt.cc.jj 2025-12-16 22:40:41.554370917 +0100 +++ gcc/sanopt.cc 2025-12-19 15:46:55.963977435 +0100 @@ -814,7 +814,7 @@ sanopt_optimize_walker (basic_block bb, if (!is_gimple_call (stmt)) { /* Handle asm volatile or asm with "memory" clobber - the same as potentionally freeing call. */ + the same as potentially freeing call. */ gasm *asm_stmt = dyn_cast <gasm *> (stmt); if (asm_stmt && asan_check_optimize --- gcc/tree.cc.jj 2025-12-13 09:54:13.761383090 +0100 +++ gcc/tree.cc 2025-12-19 15:34:24.745977218 +0100 @@ -8605,7 +8605,7 @@ variably_modified_type_p (tree type, tre case POINTER_TYPE: case REFERENCE_TYPE: case VECTOR_TYPE: - /* Ada can have pointer types refering to themselves indirectly. */ + /* Ada can have pointer types referring to themselves indirectly. */ if (TREE_VISITED (type)) return false; TREE_VISITED (type) = true; --- gcc/tree-cfg.cc.jj 2025-12-16 22:40:41.641369386 +0100 +++ gcc/tree-cfg.cc 2025-12-19 15:55:15.988342877 +0100 @@ -1795,7 +1795,7 @@ group_case_labels_stmt (gswitch *stmt) but they will be moved to some neighbouring basic block. If some later case label refers to one of those labels, we should throw that case away rather - than keeping it around and refering to some random + than keeping it around and referring to some random other basic block without an edge to it. */ if (removed_labels == NULL) removed_labels = new hash_set<tree>; @@ -8413,7 +8413,7 @@ dump_function_to_file (tree fndecl, FILE { if (!SSA_NAME_VAR (name) /* SSA name with decls without a name still get - dumped as _N, list those explicitely as well even + dumped as _N, list those explicitly as well even though we've dumped the decl declaration as D.xxx above. */ || !SSA_NAME_IDENTIFIER (name)) @@ -10277,7 +10277,7 @@ make_forwarders_with_degenerate_phis (fu continue; /* Do not touch loop headers or blocks with abnormal predecessors. ??? This is to avoid creating valid loops here, see PR103458. - We might want to improve things to either explicitely add those + We might want to improve things to either explicitly add those loops or at least consider blocks with no backedges. */ if (bb->loop_father->header == bb || bb_has_abnormal_pred (bb)) --- gcc/tree-inline.cc.jj 2025-10-21 11:27:05.818870007 +0200 +++ gcc/tree-inline.cc 2025-12-19 15:55:28.254131067 +0100 @@ -5892,7 +5892,7 @@ replace_locals_op (tree *tp, int *walk_s /* Before the omplower pass completes, some OMP clauses can contain sequences that are neither copied by gimple_seq_copy nor walked by walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even - in those situations, we have to copy and process them explicitely. */ + in those situations, we have to copy and process them explicitly. */ if (OMP_CLAUSE_CODE (expr) == OMP_CLAUSE_LASTPRIVATE) { --- gcc/tree-loop-distribution.cc.jj 2025-12-13 09:54:13.760383107 +0100 +++ gcc/tree-loop-distribution.cc 2025-12-19 15:32:03.801417504 +0100 @@ -3967,7 +3967,8 @@ loop_distribution::execute (function *fu if (changed) { /* Destroy loop bodies that could not be reused. Do this late as we - otherwise can end up refering to stale data in control dependences. */ + otherwise can end up referring to stale data in control + dependences. */ unsigned i; class loop *loop; FOR_EACH_VEC_ELT (loops_to_be_destroyed, i, loop) --- gcc/tree-sra.cc.jj 2025-09-23 10:26:43.434772460 +0200 +++ gcc/tree-sra.cc 2025-12-19 15:39:35.418598303 +0100 @@ -4614,7 +4614,7 @@ generate_subtree_deferred_init (struct a there is one, also replace the RHS call to a call to .DEFERRED_INIT of the corresponding scalar relacement variable. Examine the subtree and do the scalar replacements in the subtree too. STMT is the call, GSI is - the statment iterator to place newly created statement. */ + the statement iterator to place newly created statement. */ static enum assignment_mod_result sra_modify_deferred_init (gimple *stmt, gimple_stmt_iterator *gsi) --- gcc/tree-ssa-alias.cc.jj 2025-09-30 16:11:53.617561475 +0200 +++ gcc/tree-ssa-alias.cc 2025-12-19 15:55:41.574901043 +0100 @@ -423,7 +423,7 @@ bool ptrs_compare_unequal (tree ptr1, tree ptr2) { /* First resolve the pointers down to a SSA name pointer base or - a VAR_DECL, PARM_DECL or RESULT_DECL. This explicitely does + a VAR_DECL, PARM_DECL or RESULT_DECL. This explicitly does not yet try to handle LABEL_DECLs, FUNCTION_DECLs, CONST_DECLs or STRING_CSTs which needs points-to adjustments to track them in the points-to sets. */ --- gcc/tree-ssa-forwprop.cc.jj 2025-11-27 19:04:29.272271837 +0100 +++ gcc/tree-ssa-forwprop.cc 2025-12-19 15:39:58.075206031 +0100 @@ -195,7 +195,7 @@ struct _vec_perm_simplify_seq gassign *v_2_stmt; gassign *v_x_stmt; gassign *v_y_stmt; - /* Final permute statment. */ + /* Final permute statement. */ gassign *stmt; /* New selector indices for stmt. */ tree new_sel; @@ -4709,7 +4709,7 @@ narrow_vec_perm_simplify_seq (const vec_ gassign *stmt = seq->stmt; if (dump_file && (dump_flags & TDF_DETAILS)) { - fprintf (dump_file, "Updating VEC_PERM statment:\n"); + fprintf (dump_file, "Updating VEC_PERM statement:\n"); fprintf (dump_file, "Old stmt: "); print_gimple_stmt (dump_file, stmt, 0); } @@ -4955,7 +4955,7 @@ blend_vec_perm_simplify_seqs (vec_perm_s /* Adjust seq2->stmt: copy RHS1/RHS2 from seq1->stmt and set new sel. */ if (dump_file && (dump_flags & TDF_DETAILS)) { - fprintf (dump_file, "Updating VEC_PERM statment:\n"); + fprintf (dump_file, "Updating VEC_PERM statement:\n"); fprintf (dump_file, "Old stmt: "); print_gimple_stmt (dump_file, seq2->stmt, 0); } @@ -4976,7 +4976,7 @@ blend_vec_perm_simplify_seqs (vec_perm_s /* Adjust seq1->v_1_stmt: copy RHS2 from seq2->v_1_stmt and set new sel. */ if (dump_file && (dump_flags & TDF_DETAILS)) { - fprintf (dump_file, "Updating VEC_PERM statment:\n"); + fprintf (dump_file, "Updating VEC_PERM statement:\n"); fprintf (dump_file, "Old stmt: "); print_gimple_stmt (dump_file, seq1->v_1_stmt, 0); } @@ -4996,7 +4996,7 @@ blend_vec_perm_simplify_seqs (vec_perm_s /* Adjust seq1->v_2_stmt: copy RHS2 from seq2->v_2_stmt and set new sel. */ if (dump_file && (dump_flags & TDF_DETAILS)) { - fprintf (dump_file, "Updating VEC_PERM statment:\n"); + fprintf (dump_file, "Updating VEC_PERM statement:\n"); fprintf (dump_file, "Old stmt: "); print_gimple_stmt (dump_file, seq1->v_2_stmt, 0); } --- gcc/tree-ssa-pre.cc.jj 2025-10-03 10:05:56.220892735 +0200 +++ gcc/tree-ssa-pre.cc 2025-12-19 15:55:54.175683447 +0100 @@ -2131,7 +2131,7 @@ compute_antic_aux (basic_block block, bo /* Unvisited successors get their ANTIC_IN replaced by the maximal set to arrive at a maximum ANTIC_IN solution. We can ignore them in the intersection operation and thus - need not explicitely represent that maximum solution. */ + need not explicitly represent that maximum solution. */ any_max_on_edge = true; if (dump_file && (dump_flags & TDF_DETAILS)) fprintf (dump_file, "ANTIC_IN is MAX on %d->%d\n", --- gcc/tree-vect-loop-manip.cc.jj 2025-12-18 15:04:20.327831677 +0100 +++ gcc/tree-vect-loop-manip.cc 2025-12-19 15:32:18.095170026 +0100 @@ -3267,7 +3267,7 @@ vect_do_peeling (loop_vec_info loop_vinf return NULL; /* Before doing any peeling make sure to reset debug binds outside of - the loop refering to defs not in LC SSA. */ + the loop referring to defs not in LC SSA. */ class loop *loop = LOOP_VINFO_LOOP (loop_vinfo); for (unsigned i = 0; i < loop->num_nodes; ++i) { --- gcc/tree-vect-patterns.cc.jj 2025-12-09 10:18:55.670225338 +0100 +++ gcc/tree-vect-patterns.cc 2025-12-19 15:44:19.215684702 +0100 @@ -59,7 +59,7 @@ along with GCC; see the file COPYING3. /* TODO: Note the vectorizer still builds COND_EXPRs with GENERIC compares in the first operand. Disentangling this is future work, the - IL is properly transfered to VEC_COND_EXPRs with separate compares. */ + IL is properly transferred to VEC_COND_EXPRs with separate compares. */ /* Return true if we have a useful VR_RANGE range for VAR, storing it --- gcc/tree-vect-slp.cc.jj 2025-12-11 19:34:17.399255819 +0100 +++ gcc/tree-vect-slp.cc 2025-12-19 15:56:07.844447412 +0100 @@ -2037,7 +2037,7 @@ vect_build_slp_tree_2 (vec_info *vinfo, all_same = false; } class loop *loop = LOOP_VINFO_LOOP (loop_vinfo); - /* Reduction initial values are not explicitely represented. */ + /* Reduction initial values are not explicitly represented. */ if (def_type != vect_first_order_recurrence && gimple_bb (stmt_info->stmt) == loop->header) skip_args[loop_preheader_edge (loop)->dest_idx] = true; @@ -4068,7 +4068,7 @@ vect_build_slp_store_interleaving (vec<s /* Analyze an SLP instance starting from SCALAR_STMTS which are a group of KIND. Return true if successful. SCALAR_STMTS is owned by this - function, REMAIN and ROOT_STMT_INFOS ownership is transfered back to + function, REMAIN and ROOT_STMT_INFOS ownership is transferred back to the caller upon failure. */ static bool @@ -6555,7 +6555,7 @@ vect_optimize_slp_pass::build_vertices ( force_leaf = true; /* Since SLP discovery works along use-def edges all cycles have an entry - but there's the exception of cycles where we do not handle - the entry explicitely (but with a NULL SLP node), like some reductions + the entry explicitly (but with a NULL SLP node), like some reductions and inductions. Force those SLP PHIs to act as leafs to make them backwards reachable. */ if (leaf || force_leaf) @@ -8819,7 +8819,7 @@ vect_slp_analyze_node_operations (vec_in } /* When the node can be vectorized cost invariant nodes it references. - This is not done in DFS order to allow the refering node + This is not done in DFS order to allow the referring node vectorizable_* calls to nail down the invariant nodes vector type and possibly unshare it if it needs a different vector type than other referrers. */ @@ -8854,7 +8854,7 @@ vect_slp_analyze_node_operations (vec_in /* For shifts with a scalar argument we don't need to cost or code-generate anything. - ??? Represent this more explicitely. */ + ??? Represent this more explicitly. */ gcc_assert (SLP_TREE_TYPE (node) == shift_vec_info_type && j == 1); continue; --- gcc/tree-vect-stmts.cc.jj 2025-12-09 10:18:55.688225029 +0100 +++ gcc/tree-vect-stmts.cc 2025-12-19 15:25:22.955354907 +0100 @@ -8875,7 +8875,7 @@ vectorizable_store (vec_info *vinfo, vec_oprnd = (*gvec_oprnds[0])[j]; if (mask_node) vec_mask = vec_masks[j]; - /* We should have catched mismatched types earlier. */ + /* We should have caught mismatched types earlier. */ gcc_assert (ls.ls_type || useless_type_conversion_p (vectype, TREE_TYPE (vec_oprnd))); @@ -9230,7 +9230,7 @@ vectorizable_store (vec_info *vinfo, } } - /* We should have catched mismatched types earlier. */ + /* We should have caught mismatched types earlier. */ gcc_assert (costing_p || useless_type_conversion_p (vectype, TREE_TYPE (vec_oprnd))); bool simd_lane_access_p --- gcc/vec.h.jj 2025-07-29 13:42:16.240346593 +0200 +++ gcc/vec.h 2025-12-19 15:34:37.827750723 +0100 @@ -1670,7 +1670,7 @@ public: { m_auto.embedded_init (N, 0, 1); /* ??? Instead of initializing m_vec from &m_auto directly use an - expression that avoids refering to a specific member of 'this' + expression that avoids referring to a specific member of 'this' to derail the -Wstringop-overflow diagnostic code, avoiding the impression that data accesses are supposed to be to the m_auto member storage. */ --- gcc/ada/sem_attr.adb.jj 2025-12-16 22:40:40.789384375 +0100 +++ gcc/ada/sem_attr.adb 2025-12-19 15:41:58.135127340 +0100 @@ -8199,7 +8199,7 @@ package body Sem_Attr is -- subtype indication. This is syntactically a pain, but should -- not propagate to the entity for the corresponding index subtype. -- After checking that the subtype indication is legal, the range - -- of the subtype indication should be transfered to the entity. + -- of the subtype indication should be transferred to the entity. -- The attributes for the bounds should remain the simple retrievals -- that they are now. --- gcc/ada/sem_ch6.adb.jj 2025-11-27 15:06:51.786676366 +0100 +++ gcc/ada/sem_ch6.adb 2025-12-19 15:42:13.074868675 +0100 @@ -464,7 +464,7 @@ package body Sem_Ch6 is -- Propagate any pragmas that apply to expression function to the -- proper body when the expression function acts as a completion. - -- Aspects are automatically transfered because of node rewriting. + -- Aspects are automatically transferred because of node rewriting. Relocate_Pragmas_To_Body (N); Analyze (N); --- gcc/ada/sysdep.c.jj 2025-07-27 23:31:08.895017689 +0200 +++ gcc/ada/sysdep.c 2025-12-19 15:51:26.412307260 +0100 @@ -907,7 +907,7 @@ __gnat_get_task_options (void) Note that the same error occurs in both RTP and Kernel mode, but VX_DEALLOC_TCB is not defined in the RTP headers, so we need to - explicitely check if VX_PRIVATE_UMASK has value 0x8000 + explicitly check if VX_PRIVATE_UMASK has value 0x8000 */ # if defined (VX_PRIVATE_UMASK) && (0x8000 == VX_PRIVATE_UMASK) options &= ~VX_PRIVATE_UMASK; --- gcc/algol68/a68-low-decls.cc.jj 2025-11-30 15:52:11.631875234 +0100 +++ gcc/algol68/a68-low-decls.cc 2025-12-19 15:36:03.190272773 +0100 @@ -209,7 +209,7 @@ a68_lower_variable_declaration (NODE_T * pointer as the initial of the var_decl because the bouns in the actual declarer shall be elaborated at the point of the code where the declaration appears, not at the beginning of its reach. Note that the - mode of the declarer will be always a REF, since this is a varaible + mode of the declarer will be always a REF, since this is a variable declaration: the referred mode is what we pass to the a68_low_generator. If the STATIC generator is used, the var_decl created above is not a --- gcc/c/gimple-parser.cc.jj 2025-12-05 11:50:08.738463919 +0100 +++ gcc/c/gimple-parser.cc 2025-12-19 15:36:56.009358278 +0100 @@ -2482,7 +2482,7 @@ c_parser_gimple_if_stmt (gimple_parser & gimple-case-statement: gimple-case-statement - gimple-label-statement : gimple-goto-statment + gimple-label-statement : gimple-goto-statement */ static void --- gcc/cobol/lexio.cc.jj 2025-12-11 19:34:17.397112368 +0100 +++ gcc/cobol/lexio.cc 2025-12-19 15:37:22.429900837 +0100 @@ -899,7 +899,7 @@ parse_replace_pairs( const char *stmt, c gcc_assert(!before.has_nul()); pairs.push_back( replace_t( output.before, output.after ) ); - // COPY REPLACING matches end-of-statment here + // COPY REPLACING matches end-of-statement here // REPLACE matched end-of-statement in caller, and estmt[-1] == '.' if( is_copy_stmt && parsed.stmt.pend[-1] == '.' ) break; } @@ -1864,7 +1864,7 @@ cdftext::free_form_reference_format( int * denoting the source filename. As far as the lexer is concerned, * there's only ever one file: the name passed to lex_open() when we * kicked things off. But messages and the debugger need to know - * which file and line each statment appeared in. + * which file and line each statement appeared in. * * The lexer uses the input stack to keep track of names and * numbers. The top of the input file stack is the current file --- gcc/fortran/gfortran.texi.jj 2025-12-11 19:33:57.556489256 +0100 +++ gcc/fortran/gfortran.texi 2025-12-19 15:43:09.526891280 +0100 @@ -4892,7 +4892,7 @@ then this needs to be set to the byte si a @code{CHARACTER (KIND=4)} string. The length of the string is then given in @code{opt_src_charlen} and @code{opt_dst_charlen} (also for string arrays). @item @var{scalar_transfer} @tab intent(in) Is set to true when the data to be -transfered between the two images is not an array with a descriptor. +transferred between the two images is not an array with a descriptor. @item @var{dst_stat} @tab intent(out) When non-@code{NULL} give the result of the operation on the receiving side, i.e., zero on success and non-zero on error. When @code{NULL} and an error occurs, then an error message is printed --- gcc/fortran/resolve.cc.jj 2025-12-11 19:33:57.673487243 +0100 +++ gcc/fortran/resolve.cc 2025-12-19 15:48:19.243539335 +0100 @@ -12173,7 +12173,7 @@ over: /* Check whether a WHERE assignment target or a WHERE mask expression - has the same shape as the outmost WHERE mask expression. */ + has the same shape as the outermost WHERE mask expression. */ static void resolve_where (gfc_code *code, gfc_expr *mask) @@ -12185,8 +12185,8 @@ resolve_where (gfc_code *code, gfc_expr cblock = code->block; /* Store the first WHERE mask-expr of the WHERE statement or construct. - In case of nested WHERE, only the outmost one is stored. */ - if (mask == NULL) /* outmost WHERE */ + In case of nested WHERE, only the outermost one is stored. */ + if (mask == NULL) /* outermost WHERE */ e = cblock->expr1; else /* inner WHERE */ e = mask; @@ -12196,7 +12196,7 @@ resolve_where (gfc_code *code, gfc_expr if (cblock->expr1) { /* Check if the mask-expr has a consistent shape with the - outmost WHERE mask-expr. */ + outermost WHERE mask-expr. */ if (!resolve_where_shape (cblock->expr1, e)) gfc_error ("WHERE mask at %L has inconsistent shape", &cblock->expr1->where); --- gcc/lto/lto-common.cc.jj 2025-11-25 19:29:48.997354000 +0100 +++ gcc/lto/lto-common.cc 2025-12-19 15:53:57.151704248 +0100 @@ -2141,7 +2141,7 @@ lto_resolution_read (splay_tree file_ids somewhat contradictionary (as the point of incremental linking is to allow re-linking with more symbols later) but it is used to build LTO kernel. We want to hide all symbols that - are not explicitely marked as exported and thus turn + are not explicitly marked as exported and thus turn LDPR_PREVAILING_DEF_IRONLY_EXP to LDPR_PREVAILING_DEF_IRONLY. */ if (flag_whole_program --- gcc/m2/gm2-compiler/FilterError.mod.jj 2025-10-27 17:37:59.376207403 +0100 +++ gcc/m2/gm2-compiler/FilterError.mod 2025-12-19 15:31:05.771422220 +0100 @@ -22,7 +22,7 @@ along with GNU Modula-2; see the file CO IMPLEMENTATION MODULE FilterError ; (* The purpose of this module is to be able to filter out multiple error - reports refering to the same symbol and token. This is achieved by + reports referring to the same symbol and token. This is achieved by maintaining a dictionary of symbols each pointing to a dictionary of tokens. *) --- gcc/m2/gm2-compiler/M2Batch.mod.jj 2025-04-08 14:08:52.011271285 +0200 +++ gcc/m2/gm2-compiler/M2Batch.mod 2025-12-19 15:31:28.731024702 +0100 @@ -461,7 +461,7 @@ BEGIN END ; IF sym = NulSym THEN - (* not a local module, so it must be refering to a definition module. *) + (* not a local module, so it must be referring to a definition module. *) sym := MakeDefinitionSource (tok, n) END END ; --- gcc/testsuite/gcc.c-torture/compile/20030323-1.c.jj 2020-01-11 16:31:54.961294605 +0100 +++ gcc/testsuite/gcc.c-torture/compile/20030323-1.c 2025-12-19 15:38:58.045245377 +0100 @@ -1,5 +1,5 @@ /* PR c/10178. The following code would ICE because we didn't check for - overflow when computing the range of the switch-statment, and therefore + overflow when computing the range of the switch-statement, and therefore decided it could be implemented using bit-tests. */ int --- gcc/testsuite/gcc.dg/tree-ssa/pr96779.c.jj 2023-05-25 09:42:28.182694650 +0200 +++ gcc/testsuite/gcc.dg/tree-ssa/pr96779.c 2025-12-19 15:44:04.241943953 +0100 @@ -76,5 +76,5 @@ main (void) return 0; } -/* Verify that we transfered to "= -" pattern from "_2 = -_1;". */ +/* Verify that we transferred to "= -" pattern from "_2 = -_1;". */ /* { dg-final { scan-tree-dump-not "= -" "optimized" } } */ --- gcc/testsuite/gcc.dg/tree-ssa/pr96779-disabled.c.jj 2023-05-25 09:42:28.182694650 +0200 +++ gcc/testsuite/gcc.dg/tree-ssa/pr96779-disabled.c 2025-12-19 15:43:50.858175680 +0100 @@ -81,5 +81,5 @@ main (void) return 0; } -/* Verify that we have *not* transfered "= -" pattern in any of those functions. */ +/* Verify that we have *not* transferred "= -" pattern in any of those functions. */ /* { dg-final { scan-tree-dump-times "= -" 4 "optimized" } } */ --- gcc/testsuite/gcc.dg/tree-ssa/ssa-thread-16.c.jj 2022-08-10 09:06:52.977213236 +0200 +++ gcc/testsuite/gcc.dg/tree-ssa/ssa-thread-16.c 2025-12-19 15:24:38.960115623 +0100 @@ -12,7 +12,7 @@ void foo (int a, int b, int c, int d, in res = 7; if (d < 2) res = 9; - /* Accounting whoes makes this not catched. */ + /* Accounting whoes makes this not caught. */ #if 0 if (e != 37) res = 11; --- gcc/testsuite/gcc.target/s390/larl-1.c.jj 2023-07-11 13:40:39.851437322 +0200 +++ gcc/testsuite/gcc.target/s390/larl-1.c 2025-12-19 15:54:49.315803464 +0100 @@ -3,7 +3,7 @@ /* { dg-do compile { target { s390*-*-* } } } */ /* { dg-options "-O2 -march=z10 -mzarch -fno-section-anchors" } */ -/* An explicitely misaligned symbol. This symbol is NOT aligned as +/* An explicitly misaligned symbol. This symbol is NOT aligned as mandated by our ABI. However, the back-end needs to handle that in order to make things like __attribute__((packed)) work. The symbol address is expected to be loaded from literal pool. */ --- gcc/testsuite/g++.dg/tree-ssa/pr44706.C.jj 2020-01-12 11:54:37.273400434 +0100 +++ gcc/testsuite/g++.dg/tree-ssa/pr44706.C 2025-12-19 15:20:55.864973140 +0100 @@ -41,5 +41,5 @@ XMLExcepts::AttrList_BadIndex, getMemory } /* Mistake in branch prediction caused us to split away real body of the function keeping - only throw () invokation. This is bad idea. */ + only throw () invocation. This is bad idea. */ /* { dg-final { scan-tree-dump-not "Splitting function" "fnsplit"} } */ --- gcc/testsuite/g++.dg/tree-ssa/pr87502.C.jj 2025-04-08 14:09:01.711136251 +0200 +++ gcc/testsuite/g++.dg/tree-ssa/pr87502.C 2025-12-19 15:54:35.143048202 +0100 @@ -11,5 +11,5 @@ bar () { return foo ("abc") + foo (std::string("abc")); } -// We used to add terminating zero explicitely instead of using fact +// We used to add terminating zero explicitly instead of using fact // that memcpy source is already 0 terminated. --- gcc/testsuite/gfortran.dg/bound_8.f90.jj 2020-01-12 11:54:38.187386644 +0100 +++ gcc/testsuite/gfortran.dg/bound_8.f90 2025-12-19 15:55:04.961533288 +0100 @@ -11,7 +11,7 @@ PROGRAM main IMPLICIT NONE - ! Some explicitely shaped arrays and allocatable ones. + ! Some explicitly shaped arrays and allocatable ones. INTEGER :: a(2, 3), b(0:1, 4:6) INTEGER, ALLOCATABLE :: x(:, :), y(:, :) --- gcc/testsuite/gfortran.dg/coarray_14.f90.jj 2020-01-12 11:54:38.201386433 +0100 +++ gcc/testsuite/gfortran.dg/coarray_14.f90 2025-12-19 15:39:14.487960691 +0100 @@ -43,7 +43,7 @@ end subroutine test ! Check for C617: "... a data-ref shall not be a polymorphic subobject of a ! coindexed object or ..." -! Before, the second allocate statment was failing - though it is no subobject. +! Before, the second allocate statement was failing - though it is no subobject. program myTest type t end type t Jakub
