Skip to content

R
riscv-gcc-1
Commit 56ae04af by Kazu Hirata Committed by Kazu Hirata
Options

c-objc-common.c (): Fix a typo in a warning. 

	* c-objc-common.c (): Fix a typo in a warning.
	* cse.c (preferrable): Change to preferable. Update all of its
	callers.
	* genautomata.c (ainsn): Change
	first_ainsn_with_given_equialence_num to
	first_ainsn_with_given_equivalence_num.  Update all of its
	references.

From-SVN: r77497
parent 517b3f9f
Showing with 41 additions and 31 deletions
gcc/ChangeLog
2004-02-08 Kazu Hirata <kazu@cs.umass.edu>
* c-objc-common.c (): Fix a typo in a warning.
* cse.c (preferrable): Change to preferable. Update all of its
callers.
* genautomata.c (ainsn): Change
first_ainsn_with_given_equialence_num to
first_ainsn_with_given_equivalence_num. Update all of its
references.
2004-02-08 Jan Hubicka <jh@suse.cz>
* schedule-ebb.c (schedule_ebbs): Do not allocate reg life data.
......
gcc/c-objc-common.c
......@@ -80,7 +80,7 @@ c_cannot_inline_tree_fn (tree *fnp)
{
if (do_warning)
warning ("%Jfunction '%F' can never be inlined because it "
"is supressed using -fno-inline", fn, fn);
"is suppressed using -fno-inline", fn, fn);
goto cannot_inline;
}
......
gcc/cse.c
......@@ -601,7 +601,7 @@ static bool fixed_base_plus_p (rtx x);
static int notreg_cost (rtx, enum rtx_code);
static int approx_reg_cost_1 (rtx *, void *);
static int approx_reg_cost (rtx);
static int preferrable (int, int, int, int);
static int preferable (int, int, int, int);
static void new_basic_block (void);
static void make_new_qty (unsigned int, enum machine_mode);
static void make_regs_eqv (unsigned int, unsigned int);
......@@ -761,7 +761,7 @@ approx_reg_cost (rtx x)
Return a positive value if A is less desirable, or 0 if the two are
equally good. */
static int
preferrable (int cost_a, int regcost_a, int cost_b, int regcost_b)
preferable (int cost_a, int regcost_a, int cost_b, int regcost_b)
{
/* First, get rid of cases involving expressions that are entirely
unwanted. */
......@@ -1513,7 +1513,7 @@ lookup_as_function (rtx x, enum rtx_code code)
If necessary, update table showing constant values of quantities. */
#define CHEAPER(X, Y) \
(preferrable ((X)->cost, (X)->regcost, (Y)->cost, (Y)->regcost) < 0)
(preferable ((X)->cost, (X)->regcost, (Y)->cost, (Y)->regcost) < 0)
static struct table_elt *
insert (rtx x, struct table_elt *classp, unsigned int hash, enum machine_mode mode)
......@@ -5424,14 +5424,14 @@ cse_insn (rtx insn, rtx libcall_insn)
of equal cost, use this order:
src_folded, src, src_eqv, src_related and hash table entry. */
if (src_folded
&& preferrable (src_folded_cost, src_folded_regcost,
src_cost, src_regcost) <= 0
&& preferrable (src_folded_cost, src_folded_regcost,
src_eqv_cost, src_eqv_regcost) <= 0
&& preferrable (src_folded_cost, src_folded_regcost,
src_related_cost, src_related_regcost) <= 0
&& preferrable (src_folded_cost, src_folded_regcost,
src_elt_cost, src_elt_regcost) <= 0)
&& preferable (src_folded_cost, src_folded_regcost,
src_cost, src_regcost) <= 0
&& preferable (src_folded_cost, src_folded_regcost,
src_eqv_cost, src_eqv_regcost) <= 0
&& preferable (src_folded_cost, src_folded_regcost,
src_related_cost, src_related_regcost) <= 0
&& preferable (src_folded_cost, src_folded_regcost,
src_elt_cost, src_elt_regcost) <= 0)
{
trial = src_folded, src_folded_cost = MAX_COST;
if (src_folded_force_flag)
......@@ -5442,22 +5442,22 @@ cse_insn (rtx insn, rtx libcall_insn)
}
}
else if (src
&& preferrable (src_cost, src_regcost,
src_eqv_cost, src_eqv_regcost) <= 0
&& preferrable (src_cost, src_regcost,
src_related_cost, src_related_regcost) <= 0
&& preferrable (src_cost, src_regcost,
src_elt_cost, src_elt_regcost) <= 0)
&& preferable (src_cost, src_regcost,
src_eqv_cost, src_eqv_regcost) <= 0
&& preferable (src_cost, src_regcost,
src_related_cost, src_related_regcost) <= 0
&& preferable (src_cost, src_regcost,
src_elt_cost, src_elt_regcost) <= 0)
trial = src, src_cost = MAX_COST;
else if (src_eqv_here
&& preferrable (src_eqv_cost, src_eqv_regcost,
src_related_cost, src_related_regcost) <= 0
&& preferrable (src_eqv_cost, src_eqv_regcost,
src_elt_cost, src_elt_regcost) <= 0)
&& preferable (src_eqv_cost, src_eqv_regcost,
src_related_cost, src_related_regcost) <= 0
&& preferable (src_eqv_cost, src_eqv_regcost,
src_elt_cost, src_elt_regcost) <= 0)
trial = copy_rtx (src_eqv_here), src_eqv_cost = MAX_COST;
else if (src_related
&& preferrable (src_related_cost, src_related_regcost,
src_elt_cost, src_elt_regcost) <= 0)
&& preferable (src_related_cost, src_related_regcost,
src_elt_cost, src_elt_regcost) <= 0)
trial = copy_rtx (src_related), src_related_cost = MAX_COST;
else
{
......
gcc/genautomata.c
......@@ -1209,7 +1209,7 @@ struct ainsn
ainsn_t next_equiv_class_insn;
/* The following field value is nonzero if the insn declaration is
the first insn declaration with given equivalence number. */
char first_ainsn_with_given_equialence_num;
char first_ainsn_with_given_equivalence_num;
/* The following field is number of class of equivalence of insns.
It is necessary because many insns may be equivalent with the
point of view of pipeline hazards. */
......@@ -6610,7 +6610,7 @@ set_insn_equiv_classes (automaton_t automaton)
first_insn = ainsn;
if (!first_insn->first_insn_with_same_reservs)
abort ();
first_insn->first_ainsn_with_given_equialence_num = 1;
first_insn->first_ainsn_with_given_equivalence_num = 1;
curr_insn = first_insn;
do
{
......@@ -7673,7 +7673,7 @@ out_state_arcs_num (state_t state)
{
if (arc->insn == NULL)
abort ();
if (arc->insn->first_ainsn_with_given_equialence_num)
if (arc->insn->first_ainsn_with_given_equivalence_num)
result++;
}
return result;
......@@ -7756,7 +7756,7 @@ output_trans_table (automaton_t automaton)
{
if (arc->insn == NULL)
abort ();
if (arc->insn->first_ainsn_with_given_equialence_num)
if (arc->insn->first_ainsn_with_given_equivalence_num)
add_vect_el (&transition_vect, arc->insn,
arc->to_state->order_state_num);
}
......@@ -7805,7 +7805,7 @@ output_state_alts_table (automaton_t automaton)
{
if (arc->insn == NULL)
abort ();
if (arc->insn->first_ainsn_with_given_equialence_num)
if (arc->insn->first_ainsn_with_given_equivalence_num)
add_vect_el (&state_alts_vect, arc->insn, arc->state_alts);
}
add_vect (automaton->state_alts_table, (*state_ptr)->order_state_num,
......@@ -7914,7 +7914,7 @@ output_min_issue_delay_table (automaton_t automaton)
VLA_HWINT (min_issue_delay_vect, i) = 0;
automaton->max_min_delay = 0;
for (ainsn = automaton->ainsn_list; ainsn != NULL; ainsn = ainsn->next_ainsn)
if (ainsn->first_ainsn_with_given_equialence_num)
if (ainsn->first_ainsn_with_given_equivalence_num)
{
for (state_ptr = VLA_PTR_BEGIN (output_states_vect);
state_ptr <= (state_t *) VLA_PTR_LAST (output_states_vect);
......@@ -9117,7 +9117,7 @@ output_automaton_units (automaton_t automaton)
int there_is_an_automaton_unit;
int i;
fprintf (output_description_file, "\n Coresponding units:\n");
fprintf (output_description_file, "\n Corresponding units:\n");
fprintf (output_description_file, " ");
curr_line_length = 4;
there_is_an_automaton_unit = 0;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment