<[email protected]> writes:
> From: Dhruv Chawla <[email protected]>
>
> Signed-off-by: Dhruv Chawla <[email protected]>
>
> gcc/ChangeLog:
>
> * genattrtab.cc (min_fn): Fix typos.
> (get_attr_order): Likewise.
> (optimize_attrs): Likewise.
> * genautomata.cc (struct unit_usage): Likewise.
> * gengtype-state.cc (s_expr_writer::write_any_indent): Likewise.
> (write_state): Likewise.
> * gengtype.cc (struct file_rule_st): Likewise.
> (walk_type): Likewise.
> (write_roots): Likewise.
> * genmatch.cc (expr::gen_transform): Likewise.
> (usage): Likewise.
> * genopinit.cc (open_outfile): Likewise.
> (handle_overloaded_code_for): Likewise.
> (main): Likewise.
> * genoutput.cc (operand_data_hasher::equal): Likewise.
> * genpreds.cc (FOR_ALL_CONSTRAINTS): Likewise.
> * genrecog.cc (prune_invalid_results): Likewise.
> (split_out_patterns): Likewise.
> * gensupport.cc (parse_section): Likewise.
> (convert_syntax): Likewise.
> (mark_operands_from_match_dup): Likewise.
OK, thanks.
Richard
> ---
> gcc/genattrtab.cc | 6 +++---
> gcc/genautomata.cc | 2 +-
> gcc/gengtype-state.cc | 4 ++--
> gcc/gengtype.cc | 6 +++---
> gcc/genmatch.cc | 6 +++---
> gcc/genopinit.cc | 6 +++---
> gcc/genoutput.cc | 4 ++--
> gcc/genpreds.cc | 2 +-
> gcc/genrecog.cc | 6 +++---
> gcc/gensupport.cc | 6 +++---
> 10 files changed, 24 insertions(+), 24 deletions(-)
>
> diff --git a/gcc/genattrtab.cc b/gcc/genattrtab.cc
> index 1c73be7ab48..a2cf08d5305 100644
> --- a/gcc/genattrtab.cc
> +++ b/gcc/genattrtab.cc
> @@ -305,7 +305,7 @@ static rtx min_fn (rtx);
> functions and tables. This made insn-attrtab.cc _the_ bottle-neck in
> a parallel build, and even made it impossible to build GCC on machines
> with relatively small RAM space (PR other/29442). Therefore, the
> - atrribute functions/tables are now written out to three separate
> + attribute functions/tables are now written out to three separate
> files: all "*insn_default_latency" functions go to LATENCY_FILE_NAME,
> all "*internal_dfa_insn_code" functions go to DFA_FILE_NAME, and the
> rest goes to ATTR_FILE_NAME. */
> @@ -2852,7 +2852,7 @@ get_attr_order (class attr_desc ***ret)
> }
> if (k == num)
> {
> - /* Nothing in I depended on anything intersting, so
> + /* Nothing in I depended on anything interesting, so
> it's done. */
> handled[i] = 1;
> sorted[j++] = all[i];
> @@ -2918,7 +2918,7 @@ optimize_attrs (int num_insn_codes)
>
> iv = ivbuf = XNEWVEC (struct attr_value_list, num_insn_ents);
>
> - /* Create the chain of insn*attr values such that we see dependend
> + /* Create the chain of insn*attr values such that we see dependent
> attributes after their dependencies. As we use a stack via the
> next pointers start from the end of the topological order. */
> topnum = get_attr_order (&topsort);
> diff --git a/gcc/genautomata.cc b/gcc/genautomata.cc
> index a7e1fa2f6a5..befa48ec11a 100644
> --- a/gcc/genautomata.cc
> +++ b/gcc/genautomata.cc
> @@ -5029,7 +5029,7 @@ struct unit_usage
> {
> unit_decl_t unit_decl;
> /* The following forms a list of units used on the same cycle in the
> - same alternative. The list is ordered by the correspdoning unit
> + same alternative. The list is ordered by the corresponding unit
> declarations and there is no unit declaration duplication in the
> list. */
> struct unit_usage *next;
> diff --git a/gcc/gengtype-state.cc b/gcc/gengtype-state.cc
> index 4f69bae3620..896db22e1d0 100644
> --- a/gcc/gengtype-state.cc
> +++ b/gcc/gengtype-state.cc
> @@ -240,7 +240,7 @@ s_expr_writer::write_any_indent (int leading_spaces)
> m_had_recent_newline = 0;
> }
>
> -/* Write the beginning of a new s-expresion e.g. "(!foo "
> +/* Write the beginning of a new s-expression e.g. "(!foo "
> The writer automatically adds whitespace to show the hierarchical
> structure of the expressions, so each one starts on a new line,
> and any within it will be at an increased indentation level. */
> @@ -1368,7 +1368,7 @@ write_state (const char *state_path)
> fprintf (state_file,
> ";;; The format of this file is tied to a particular version of
> GCC.\n");
> fprintf (state_file,
> - ";;; Don't parse this file wihout knowing GCC gengtype
> internals.\n");
> + ";;; Don't parse this file without knowing GCC gengtype
> internals.\n");
> fprintf (state_file,
> ";;; This file should be parsed by the same %s which wrote it.\n",
> progname);
> diff --git a/gcc/gengtype.cc b/gcc/gengtype.cc
> index 5860f9875ed..06116239344 100644
> --- a/gcc/gengtype.cc
> +++ b/gcc/gengtype.cc
> @@ -1912,7 +1912,7 @@ struct file_rule_st {
> * the output_name, with $1 ... $9 for
> * subpatterns and $0 for the whole
> * matched filename. */
> - const char* frul_tr_for; /* Tranformation string for making the
> + const char* frul_tr_for; /* Transformation string for making the
> for_name. */
> frul_actionrout_t* frul_action; /* The action, if non null, is
> * called once the rule matches, on
> @@ -2974,7 +2974,7 @@ walk_type (type_p t, struct walk_type_data *d)
> This organization requires the base class to have a case in
> the switch statement, and hence a tag value is mandatory
> for the base class. This restriction could be removed, but
> - it would require some restructing of this code. */
> + it would require some restructuring of this code. */
> if (!type_tag)
> {
> error_at_line (d->line,
> @@ -4728,7 +4728,7 @@ write_roots (pair_p variables, bool emit_pch)
> "gt_pch_scalar_rtab");
> }
>
> -/* Prints not-as-ugly version of a typename of T to OF. Trades the uniquness
> +/* Prints not-as-ugly version of a typename of T to OF. Trades the
> uniqueness
> guarantee for somewhat increased readability. If name conflicts do
> happen,
> this function will have to be adjusted to be more like
> output_mangled_typename. */
> diff --git a/gcc/genmatch.cc b/gcc/genmatch.cc
> index 6c267ca8dc2..8ee7ae66e46 100644
> --- a/gcc/genmatch.cc
> +++ b/gcc/genmatch.cc
> @@ -3185,7 +3185,7 @@ capture_info::walk_c_expr (c_expr *e)
> code generation. */
> static char *fail_label;
>
> -/* Code generation off the decision tree and the refered AST nodes. */
> +/* Code generation off the decision tree and the referred AST nodes. */
>
> bool
> is_conversion (id_base *op)
> @@ -3418,7 +3418,7 @@ expr::gen_transform (FILE *f, int indent, const char
> *dest, bool gimple,
> indent += 4;
> }
> /* ??? Building a stmt can fail for various reasons here, seq being
> - NULL or the stmt referencing SSA names occuring in abnormal PHIs.
> + NULL or the stmt referencing SSA names occurring in abnormal PHIs.
> So if we fail here we should continue matching other patterns. */
> fprintf_indent (f, indent, "gimple_match_op tem_op "
> "(res_op->cond.any_else (), %s, %s", opr_name, type);
> @@ -6275,7 +6275,7 @@ usage ()
> fprintf (stderr, usage, progname, progname);
> }
>
> -/* Write out the correct include to the match-head fle containing the helper
> +/* Write out the correct include to the match-head file containing the helper
> files. */
>
> static void
> diff --git a/gcc/genopinit.cc b/gcc/genopinit.cc
> index 5f9bcc5ccb9..62eaf5bd378 100644
> --- a/gcc/genopinit.cc
> +++ b/gcc/genopinit.cc
> @@ -105,7 +105,7 @@ open_outfile (const char *file_name)
> }
>
> /* Declare the maybe_code_for_* function for ONAME, and provide
> - an inline definition of the assserting code_for_* wrapper. */
> + an inline definition of the asserting code_for_* wrapper. */
>
> static void
> handle_overloaded_code_for (FILE *file, overloaded_name *oname)
> @@ -129,7 +129,7 @@ handle_overloaded_code_for (FILE *file, overloaded_name
> *oname)
> }
>
> /* Declare the maybe_gen_* function for ONAME, and provide
> - an inline definition of the assserting gen_* wrapper. */
> + an inline definition of the asserting gen_* wrapper. */
>
> static void
> handle_overloaded_gen (FILE *file, overloaded_name *oname)
> @@ -487,7 +487,7 @@ main (int argc, const char **argv)
> "}\n\n");
>
> /* C++ (even G++) does not support (non-trivial) designated initializers.
> - To work around that, generate these arrays programatically rather than
> + To work around that, generate these arrays programmatically rather than
> by our traditional multiple inclusion of def files. */
>
> fprintf (s_file,
> diff --git a/gcc/genoutput.cc b/gcc/genoutput.cc
> index cab03964885..7396da659db 100644
> --- a/gcc/genoutput.cc
> +++ b/gcc/genoutput.cc
> @@ -168,7 +168,7 @@ public:
> static class data *idata;
>
> /* This variable points to the end of the insn chain. This is where
> - everything relevant from the machien description is appended to. */
> + everything relevant from the machine description is appended to. */
> static class data **idata_end;
>
>
> @@ -609,7 +609,7 @@ operand_data_hasher::equal (const operand_data * op_info1,
> return compare_operands (op_info1, op_info2);
> }
>
> -/* Hashtable of konwn pattern operands. */
> +/* Hashtable of known pattern operands. */
> static hash_table<operand_data_hasher> *operand_datas;
>
> /* Scan the list of operands we've already committed to output and either
> diff --git a/gcc/genpreds.cc b/gcc/genpreds.cc
> index b98fbab08ef..61d39063f37 100644
> --- a/gcc/genpreds.cc
> +++ b/gcc/genpreds.cc
> @@ -703,7 +703,7 @@ static class constraint_data **last_constraint_ptr =
> &first_constraint;
> #define FOR_ALL_CONSTRAINTS(iter_) \
> for (iter_ = first_constraint; iter_; iter_ = iter_->next_textual)
>
> -/* Contraint letters that have a special meaning and that cannot be used
> +/* Constraint letters that have a special meaning and that cannot be used
> in define*_constraints. */
> static const char generic_constraint_letters[] = "g";
>
> diff --git a/gcc/genrecog.cc b/gcc/genrecog.cc
> index b428c595417..663620224ab 100644
> --- a/gcc/genrecog.cc
> +++ b/gcc/genrecog.cc
> @@ -1784,7 +1784,7 @@ public:
> /* Index N says whether operands[N] has been set. */
> auto_vec <bool> set_operands;
>
> - /* A guranteed lower bound on the value of peep2_current_count. */
> + /* A guaranteed lower bound on the value of peep2_current_count. */
> int peep2_count;
> };
>
> @@ -2454,7 +2454,7 @@ prune_invalid_results (merge_state_info *sinfo)
> }
> }
>
> -/* Return true if PAT represents the biggest posssible match for SINFO;
> +/* Return true if PAT represents the biggest possible match for SINFO;
> that is, if the next action of SINFO's state on return from PAT will
> be something that cannot be merged with any other state. */
>
> @@ -3175,7 +3175,7 @@ split_out_patterns (vec <merge_state_info> &states)
> The non-leaf patterns that we try are as deep as possible
> and are an extension of the state's previous best candidate match (PB).
> We need only consider states whose current potential match is also PB;
> - any states that don't match as much as PB cannnot match the new pattern,
> + any states that don't match as much as PB cannot match the new pattern,
> while any states that already match more than PB must be different from
> the new pattern. */
> for (unsigned int i2 = states.length (); i2-- > 0; )
> diff --git a/gcc/gensupport.cc b/gcc/gensupport.cc
> index 35b78044390..cebb976273d 100644
> --- a/gcc/gensupport.cc
> +++ b/gcc/gensupport.cc
> @@ -888,7 +888,7 @@ parse_section (const char **templ, unsigned int n_elems,
> unsigned int alt_no,
> list[i].add (',');
> }
>
> -/* The compact syntax has more convience syntaxes. As such we post process
> +/* The compact syntax has more convenience syntaxes. As such we post process
> the lines to get them back to something the normal syntax understands. */
>
> static void
> @@ -946,7 +946,7 @@ convert_syntax (rtx x, file_location loc)
> skip_spaces (&templ);
>
> if (!expect_char (&templ, '['))
> - fatal_at (loc, "expecing `[' to begin section list");
> + fatal_at (loc, "expecting `[' to begin section list");
>
> skip_spaces (&templ);
>
> @@ -2566,7 +2566,7 @@ mark_operands_from_match_dup (rtx pattern)
> /* This is a subroutine of adjust_operands_numbers.
> It goes through all expressions in PATTERN and when MATCH_DUP is
> met, all MATCH_OPERANDs inside it is marked as occupied. The
> - process of marking is done by routin mark_operands_from_match_dup. */
> + process of marking is done by routine mark_operands_from_match_dup. */
> static void
> mark_operands_used_in_match_dup (rtx pattern)
> {
