Skip to content

R
riscv-gcc-1
Commit d1c78882 by Eric Christopher
Options

decl.c: Fix typo in function name. 

2006-04-21  Eric Christopher  <echristo@apple.com>

	* decl.c: Fix typo in function name.

2006-04-21  Eric Christopher  <echristo@apple.com>

	* df-core.c, tree-outof-ssa.c, config/i386/i386.c: Fix typos
	in comments and function names.

From-SVN: r113167
parent 37073529
Showing with 17 additions and 17 deletions
gcc/config/i386/i386.c
...@@ -1083,8 +1083,8 @@ static rtx get_thread_pointer (int); ...@@ -1083,8 +1083,8 @@ static rtx get_thread_pointer (int);
static rtx legitimize_tls_address (rtx, enum tls_model, int); static rtx legitimize_tls_address (rtx, enum tls_model, int);
static void get_pc_thunk_name (char [32], unsigned int); static void get_pc_thunk_name (char [32], unsigned int);
static rtx gen_push (rtx); static rtx gen_push (rtx);
static int ix86_flags_dependant (rtx, rtx, enum attr_type); static int ix86_flags_dependent (rtx, rtx, enum attr_type);
static int ix86_agi_dependant (rtx, rtx, enum attr_type); static int ix86_agi_dependent (rtx, rtx, enum attr_type);
static struct machine_function * ix86_init_machine_status (void); static struct machine_function * ix86_init_machine_status (void);
static int ix86_split_to_parts (rtx, rtx *, enum machine_mode); static int ix86_split_to_parts (rtx, rtx *, enum machine_mode);
static int ix86_nsaved_regs (void); static int ix86_nsaved_regs (void);
...@@ -13432,7 +13432,7 @@ ix86_issue_rate (void) ...@@ -13432,7 +13432,7 @@ ix86_issue_rate (void)
by DEP_INSN and nothing set by DEP_INSN. */ by DEP_INSN and nothing set by DEP_INSN. */
static int static int
ix86_flags_dependant (rtx insn, rtx dep_insn, enum attr_type insn_type) ix86_flags_dependent (rtx insn, rtx dep_insn, enum attr_type insn_type)
{ {
rtx set, set2; rtx set, set2;
...@@ -13477,7 +13477,7 @@ ix86_flags_dependant (rtx insn, rtx dep_insn, enum attr_type insn_type) ...@@ -13477,7 +13477,7 @@ ix86_flags_dependant (rtx insn, rtx dep_insn, enum attr_type insn_type)
address with operands set by DEP_INSN. */ address with operands set by DEP_INSN. */
static int static int
ix86_agi_dependant (rtx insn, rtx dep_insn, enum attr_type insn_type) ix86_agi_dependent (rtx insn, rtx dep_insn, enum attr_type insn_type)
{ {
rtx addr; rtx addr;
...@@ -13535,17 +13535,17 @@ ix86_adjust_cost (rtx insn, rtx link, rtx dep_insn, int cost) ...@@ -13535,17 +13535,17 @@ ix86_adjust_cost (rtx insn, rtx link, rtx dep_insn, int cost)
{ {
case PROCESSOR_PENTIUM: case PROCESSOR_PENTIUM:
/* Address Generation Interlock adds a cycle of latency. */ /* Address Generation Interlock adds a cycle of latency. */
if (ix86_agi_dependant (insn, dep_insn, insn_type)) if (ix86_agi_dependent (insn, dep_insn, insn_type))
cost += 1; cost += 1;
/* ??? Compares pair with jump/setcc. */ /* ??? Compares pair with jump/setcc. */
if (ix86_flags_dependant (insn, dep_insn, insn_type)) if (ix86_flags_dependent (insn, dep_insn, insn_type))
cost = 0; cost = 0;
/* Floating point stores require value to be ready one cycle earlier. */ /* Floating point stores require value to be ready one cycle earlier. */
if (insn_type == TYPE_FMOV if (insn_type == TYPE_FMOV
&& get_attr_memory (insn) == MEMORY_STORE && get_attr_memory (insn) == MEMORY_STORE
&& !ix86_agi_dependant (insn, dep_insn, insn_type)) && !ix86_agi_dependent (insn, dep_insn, insn_type))
cost += 1; cost += 1;
break; break;
...@@ -13568,7 +13568,7 @@ ix86_adjust_cost (rtx insn, rtx link, rtx dep_insn, int cost) ...@@ -13568,7 +13568,7 @@ ix86_adjust_cost (rtx insn, rtx link, rtx dep_insn, int cost)
in parallel with previous instruction in case in parallel with previous instruction in case
previous instruction is not needed to compute the address. */ previous instruction is not needed to compute the address. */
if ((memory == MEMORY_LOAD || memory == MEMORY_BOTH) if ((memory == MEMORY_LOAD || memory == MEMORY_BOTH)
&& !ix86_agi_dependant (insn, dep_insn, insn_type)) && !ix86_agi_dependent (insn, dep_insn, insn_type))
{ {
/* Claim moves to take one cycle, as core can issue one load /* Claim moves to take one cycle, as core can issue one load
at time and the next load can start cycle later. */ at time and the next load can start cycle later. */
...@@ -13597,7 +13597,7 @@ ix86_adjust_cost (rtx insn, rtx link, rtx dep_insn, int cost) ...@@ -13597,7 +13597,7 @@ ix86_adjust_cost (rtx insn, rtx link, rtx dep_insn, int cost)
in parallel with previous instruction in case in parallel with previous instruction in case
previous instruction is not needed to compute the address. */ previous instruction is not needed to compute the address. */
if ((memory == MEMORY_LOAD || memory == MEMORY_BOTH) if ((memory == MEMORY_LOAD || memory == MEMORY_BOTH)
&& !ix86_agi_dependant (insn, dep_insn, insn_type)) && !ix86_agi_dependent (insn, dep_insn, insn_type))
{ {
/* Claim moves to take one cycle, as core can issue one load /* Claim moves to take one cycle, as core can issue one load
at time and the next load can start cycle later. */ at time and the next load can start cycle later. */
...@@ -13621,7 +13621,7 @@ ix86_adjust_cost (rtx insn, rtx link, rtx dep_insn, int cost) ...@@ -13621,7 +13621,7 @@ ix86_adjust_cost (rtx insn, rtx link, rtx dep_insn, int cost)
in parallel with previous instruction in case in parallel with previous instruction in case
previous instruction is not needed to compute the address. */ previous instruction is not needed to compute the address. */
if ((memory == MEMORY_LOAD || memory == MEMORY_BOTH) if ((memory == MEMORY_LOAD || memory == MEMORY_BOTH)
&& !ix86_agi_dependant (insn, dep_insn, insn_type)) && !ix86_agi_dependent (insn, dep_insn, insn_type))
{ {
enum attr_unit unit = get_attr_unit (insn); enum attr_unit unit = get_attr_unit (insn);
int loadcost = 3; int loadcost = 3;
......
gcc/cp/decl.c
...@@ -6770,7 +6770,7 @@ grokdeclarator (const cp_declarator *declarator, ...@@ -6770,7 +6770,7 @@ grokdeclarator (const cp_declarator *declarator,
int explicit_int = 0; int explicit_int = 0;
int explicit_char = 0; int explicit_char = 0;
int defaulted_int = 0; int defaulted_int = 0;
tree dependant_name = NULL_TREE; tree dependent_name = NULL_TREE;
tree typedef_decl = NULL_TREE; tree typedef_decl = NULL_TREE;
const char *name = NULL; const char *name = NULL;
...@@ -7250,9 +7250,9 @@ grokdeclarator (const cp_declarator *declarator, ...@@ -7250,9 +7250,9 @@ grokdeclarator (const cp_declarator *declarator,
} }
friendp = !! declspecs->specs[(int)ds_friend]; friendp = !! declspecs->specs[(int)ds_friend];
if (dependant_name && !friendp) if (dependent_name && !friendp)
{ {
error ("%<%T::%D%> is not a valid declarator", ctype, dependant_name); error ("%<%T::%D%> is not a valid declarator", ctype, dependent_name);
return void_type_node; return void_type_node;
} }
......
gcc/df-core.c
...@@ -84,7 +84,7 @@ convenience functions named DF_*_ADD_PROBLEM. ...@@ -84,7 +84,7 @@ convenience functions named DF_*_ADD_PROBLEM.
Problems can be dependent on other problems. For instance, solving Problems can be dependent on other problems. For instance, solving
def-use or use-def chains is dependant on solving reaching def-use or use-def chains is dependent on solving reaching
definitions. As long as these dependencies are listed in the problem definitions. As long as these dependencies are listed in the problem
definition, the order of adding the problems is not material. definition, the order of adding the problems is not material.
Otherwise, the problems will be solved in the order of calls to Otherwise, the problems will be solved in the order of calls to
......
gcc/tree-outof-ssa.c
...@@ -1321,7 +1321,7 @@ static inline void add_value_to_list (temp_expr_table_p, value_expr_p *, int); ...@@ -1321,7 +1321,7 @@ static inline void add_value_to_list (temp_expr_table_p, value_expr_p *, int);
static inline void add_info_to_list (temp_expr_table_p, value_expr_p *, static inline void add_info_to_list (temp_expr_table_p, value_expr_p *,
value_expr_p); value_expr_p);
static value_expr_p remove_value_from_list (value_expr_p *, int); static value_expr_p remove_value_from_list (value_expr_p *, int);
static void add_dependance (temp_expr_table_p, int, tree); static void add_dependence (temp_expr_table_p, int, tree);
static bool check_replaceable (temp_expr_table_p, tree); static bool check_replaceable (temp_expr_table_p, tree);
static void finish_expr (temp_expr_table_p, int, bool); static void finish_expr (temp_expr_table_p, int, bool);
static void mark_replaceable (temp_expr_table_p, tree); static void mark_replaceable (temp_expr_table_p, tree);
...@@ -1510,7 +1510,7 @@ remove_value_from_list (value_expr_p *list, int value) ...@@ -1510,7 +1510,7 @@ remove_value_from_list (value_expr_p *list, int value)
expression table. */ expression table. */
static void static void
add_dependance (temp_expr_table_p tab, int version, tree var) add_dependence (temp_expr_table_p tab, int version, tree var)
{ {
int i, x; int i, x;
value_expr_p info; value_expr_p info;
...@@ -1593,7 +1593,7 @@ check_replaceable (temp_expr_table_p tab, tree stmt) ...@@ -1593,7 +1593,7 @@ check_replaceable (temp_expr_table_p tab, tree stmt)
/* Add this expression to the dependency list for each use partition. */ /* Add this expression to the dependency list for each use partition. */
FOR_EACH_SSA_TREE_OPERAND (var, stmt, iter, SSA_OP_USE) FOR_EACH_SSA_TREE_OPERAND (var, stmt, iter, SSA_OP_USE)
{ {
add_dependance (tab, version, var); add_dependence (tab, version, var);
use_vars = tab->expr_vars[SSA_NAME_VERSION (var)]; use_vars = tab->expr_vars[SSA_NAME_VERSION (var)];
if (use_vars) if (use_vars)
......
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