Commit ff5c4582 by Kazu Hirata Committed by Kazu Hirata

cgraph.c, [...]: Fix comment typos.

	* cgraph.c, cgraphunit.c, config/mips/mips.c: Fix comment
	typos.

From-SVN: r100538
parent 88fbbf4b
2005-06-03 Kazu Hirata <kazu@codesourcery.com>
* cgraph.c, cgraphunit.c, config/mips/mips.c: Fix comment
typos.
2005-06-03 Joseph S. Myers <joseph@codesourcery.com> 2005-06-03 Joseph S. Myers <joseph@codesourcery.com>
* collect2.c (maybe_unlink): Use unlink_if_ordinary. * collect2.c (maybe_unlink): Use unlink_if_ordinary.
......
...@@ -860,7 +860,7 @@ cgraph_varpool_finalize_decl (tree decl) ...@@ -860,7 +860,7 @@ cgraph_varpool_finalize_decl (tree decl)
if (decide_is_variable_needed (node, decl)) if (decide_is_variable_needed (node, decl))
cgraph_varpool_mark_needed_node (node); cgraph_varpool_mark_needed_node (node);
/* Since we reclaim unrechable nodes at the end of every language /* Since we reclaim unreachable nodes at the end of every language
level unit, we need to be conservative about possible entry points level unit, we need to be conservative about possible entry points
there. */ there. */
if (TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl)) if (TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl))
...@@ -987,12 +987,12 @@ cgraph_function_body_availability (struct cgraph_node *node) ...@@ -987,12 +987,12 @@ cgraph_function_body_availability (struct cgraph_node *node)
care at least of two notable extensions - the COMDAT functions care at least of two notable extensions - the COMDAT functions
used to share template instantiations in C++ (this is symmetric used to share template instantiations in C++ (this is symmetric
to code cp_cannot_inline_tree_fn and probably shall be shared and to code cp_cannot_inline_tree_fn and probably shall be shared and
the inlinability hooks completelly elliminated). the inlinability hooks completely eliminated).
??? Does the C++ one definition rule allow us to always return ??? Does the C++ one definition rule allow us to always return
AVAIL_AVAILABLE here? That would be good reason to preserve this AVAIL_AVAILABLE here? That would be good reason to preserve this
hook Similarly deal with extern inline functions - this is again hook Similarly deal with extern inline functions - this is again
neccesary to get C++ shared functions having keyed templates necessary to get C++ shared functions having keyed templates
right and in the C extension documentation we probably should right and in the C extension documentation we probably should
document the requirement of both versions of function (extern document the requirement of both versions of function (extern
inline and offline) having same side effect characteristics as inline and offline) having same side effect characteristics as
...@@ -1016,7 +1016,7 @@ cgraph_variable_initializer_availability (struct cgraph_varpool_node *node) ...@@ -1016,7 +1016,7 @@ cgraph_variable_initializer_availability (struct cgraph_varpool_node *node)
return AVAIL_NOT_AVAILABLE; return AVAIL_NOT_AVAILABLE;
if (!TREE_PUBLIC (node->decl)) if (!TREE_PUBLIC (node->decl))
return AVAIL_AVAILABLE; return AVAIL_AVAILABLE;
/* If the variable can be overwritted, return OVERWRITABLE. Takes /* If the variable can be overwritten, return OVERWRITABLE. Takes
care of at least two notable extensions - the COMDAT variables care of at least two notable extensions - the COMDAT variables
used to share template instantiations in C++. */ used to share template instantiations in C++. */
if (!(*targetm.binds_local_p) (node->decl) && !DECL_COMDAT (node->decl)) if (!(*targetm.binds_local_p) (node->decl) && !DECL_COMDAT (node->decl))
......
...@@ -421,7 +421,7 @@ cgraph_finalize_function (tree decl, bool nested) ...@@ -421,7 +421,7 @@ cgraph_finalize_function (tree decl, bool nested)
if (decide_is_function_needed (node, decl)) if (decide_is_function_needed (node, decl))
cgraph_mark_needed_node (node); cgraph_mark_needed_node (node);
/* Since we reclaim unrechable nodes at the end of every language /* Since we reclaim unreachable nodes at the end of every language
level unit, we need to be conservative about possible entry points level unit, we need to be conservative about possible entry points
there. */ there. */
if (TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl)) if (TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl))
......
...@@ -713,7 +713,7 @@ const struct mips_cpu_info mips_cpu_info_table[] = { ...@@ -713,7 +713,7 @@ const struct mips_cpu_info mips_cpu_info_table[] = {
}; };
/* Default costs. If these are used for a processor we should look /* Default costs. If these are used for a processor we should look
up the acutal costs. */ up the actual costs. */
#define DEFAULT_COSTS COSTS_N_INSNS (6), /* fp_add */ \ #define DEFAULT_COSTS COSTS_N_INSNS (6), /* fp_add */ \
COSTS_N_INSNS (7), /* fp_mult_sf */ \ COSTS_N_INSNS (7), /* fp_mult_sf */ \
COSTS_N_INSNS (8), /* fp_mult_df */ \ COSTS_N_INSNS (8), /* fp_mult_df */ \
...@@ -2361,7 +2361,8 @@ mips_rtx_costs (rtx x, int code, int outer_code, int *total) ...@@ -2361,7 +2361,8 @@ mips_rtx_costs (rtx x, int code, int outer_code, int *total)
Given the choice between "li R1,0...255" and "move R1,R2" Given the choice between "li R1,0...255" and "move R1,R2"
(where R2 is a known constant), it is usually better to use "li", (where R2 is a known constant), it is usually better to use "li",
since we do not want to unnessarily extend the lifetime of R2. */ since we do not want to unnecessarily extend the lifetime
of R2. */
if (outer_code == SET if (outer_code == SET
&& INTVAL (x) >= 0 && INTVAL (x) >= 0
&& INTVAL (x) < 256) && INTVAL (x) < 256)
......
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