Commit 1f52178b by Kazu Hirata Committed by Kazu Hirata

c-common.h: Fix comment typos.

	* c-common.h: Fix comment typos.
	* c-decl.c: Likewise.
	* cgraphunit.c: Likewise.
	* combine.c: Likewise.
	* et-forest.c: Likewise.
	* flow.c: Likewise.
	* function.c: Likewise.
	* ifcvt.c: Likewise.
	* integrate.c: Likewise.
	* jump.c: Likewise.
	* postreload.c: Likewise.
	* varray.c: Likewise.

From-SVN: r76539
parent 56ae1316
2004-01-24 Kazu Hirata <kazu@cs.umass.edu> 2004-01-24 Kazu Hirata <kazu@cs.umass.edu>
* c-common.h: Fix comment typos.
* c-decl.c: Likewise.
* cgraphunit.c: Likewise.
* combine.c: Likewise.
* et-forest.c: Likewise.
* flow.c: Likewise.
* function.c: Likewise.
* ifcvt.c: Likewise.
* integrate.c: Likewise.
* jump.c: Likewise.
* postreload.c: Likewise.
* varray.c: Likewise.
2004-01-24 Kazu Hirata <kazu@cs.umass.edu>
* doc/frontends.texi: Update copyright. * doc/frontends.texi: Update copyright.
* doc/gcov.texi: Likewise. * doc/gcov.texi: Likewise.
* doc/gty.texi: Likewise. * doc/gty.texi: Likewise.
......
...@@ -206,7 +206,7 @@ struct c_common_identifier GTY(()) ...@@ -206,7 +206,7 @@ struct c_common_identifier GTY(())
#define default_function_type c_global_trees[CTI_DEFAULT_FUNCTION_TYPE] #define default_function_type c_global_trees[CTI_DEFAULT_FUNCTION_TYPE]
/* g77 integer types, which which must be kept in sync with f/com.h */ /* g77 integer types, which must be kept in sync with f/com.h */
#define g77_integer_type_node c_global_trees[CTI_G77_INTEGER_TYPE] #define g77_integer_type_node c_global_trees[CTI_G77_INTEGER_TYPE]
#define g77_uinteger_type_node c_global_trees[CTI_G77_UINTEGER_TYPE] #define g77_uinteger_type_node c_global_trees[CTI_G77_UINTEGER_TYPE]
#define g77_longint_type_node c_global_trees[CTI_G77_LONGINT_TYPE] #define g77_longint_type_node c_global_trees[CTI_G77_LONGINT_TYPE]
......
...@@ -792,7 +792,7 @@ match_builtin_function_types (tree newtype, tree oldtype) ...@@ -792,7 +792,7 @@ match_builtin_function_types (tree newtype, tree oldtype)
return build_type_attribute_variant (trytype, TYPE_ATTRIBUTES (oldtype)); return build_type_attribute_variant (trytype, TYPE_ATTRIBUTES (oldtype));
} }
/* Subroutine of diagnose_mismathed_decls. Check for function type /* Subroutine of diagnose_mismatched_decls. Check for function type
mismatch involving an empty arglist vs a nonempty one and give clearer mismatch involving an empty arglist vs a nonempty one and give clearer
diagnostics. */ diagnostics. */
static void static void
......
...@@ -844,7 +844,7 @@ cgraph_remove_unreachable_nodes (void) ...@@ -844,7 +844,7 @@ cgraph_remove_unreachable_nodes (void)
/* Remove unreachable nodes. Extern inline functions need special care; /* Remove unreachable nodes. Extern inline functions need special care;
Unreachable extern inline functions shall be removed. Unreachable extern inline functions shall be removed.
Reachable extern inline functions we never inlined shall get their bodies Reachable extern inline functions we never inlined shall get their bodies
elliminated eliminated.
Reachable extern inline functions we sometimes inlined will be turned into Reachable extern inline functions we sometimes inlined will be turned into
unanalyzed nodes so they look like for true extern functions to the rest unanalyzed nodes so they look like for true extern functions to the rest
of code. */ of code. */
......
...@@ -2467,7 +2467,7 @@ try_combine (rtx i3, rtx i2, rtx i1, int *new_direct_jump_p) ...@@ -2467,7 +2467,7 @@ try_combine (rtx i3, rtx i2, rtx i1, int *new_direct_jump_p)
undobuf.other_insn, NULL_RTX); undobuf.other_insn, NULL_RTX);
} }
#ifdef HAVE_cc0 #ifdef HAVE_cc0
/* If I2 is the setter CC0 and I3 is the user CC0 then check whether /* If I2 is the CC0 setter and I3 is the CC0 user then check whether
they are adjacent to each other or not. */ they are adjacent to each other or not. */
{ {
rtx p = prev_nonnote_insn (i3); rtx p = prev_nonnote_insn (i3);
......
...@@ -37,7 +37,7 @@ Boston, MA 02111-1307, USA. ...@@ -37,7 +37,7 @@ Boston, MA 02111-1307, USA.
#include "basic-block.h" #include "basic-block.h"
#endif #endif
/* The occurence of a node in the et tree. */ /* The occurrence of a node in the et tree. */
struct et_occ struct et_occ
{ {
struct et_node *of; /* The node. */ struct et_node *of; /* The node. */
...@@ -51,7 +51,7 @@ struct et_occ ...@@ -51,7 +51,7 @@ struct et_occ
int min; /* The minimum value of the depth in the subtree int min; /* The minimum value of the depth in the subtree
is obtained by adding sum of depth fields is obtained by adding sum of depth fields
on the path to the root. */ on the path to the root. */
struct et_occ *min_occ; /* The occurence in the subtree with the minimal struct et_occ *min_occ; /* The occurrence in the subtree with the minimal
depth. */ depth. */
}; };
...@@ -112,7 +112,7 @@ set_next (struct et_occ *occ, struct et_occ *t) ...@@ -112,7 +112,7 @@ set_next (struct et_occ *occ, struct et_occ *t)
t->parent = occ; t->parent = occ;
} }
/* Recompute minimum for occurence OCC. */ /* Recompute minimum for occurrence OCC. */
static inline void static inline void
et_recomp_min (struct et_occ *occ) et_recomp_min (struct et_occ *occ)
...@@ -310,7 +310,7 @@ check_path_after (struct et_occ *occ) ...@@ -310,7 +310,7 @@ check_path_after (struct et_occ *occ)
#endif #endif
/* Splay the occurence OCC to the root of the tree. */ /* Splay the occurrence OCC to the root of the tree. */
static void static void
et_splay (struct et_occ *occ) et_splay (struct et_occ *occ)
...@@ -452,7 +452,7 @@ et_splay (struct et_occ *occ) ...@@ -452,7 +452,7 @@ et_splay (struct et_occ *occ)
#endif #endif
} }
/* Create a new et tree occurence of NODE. */ /* Create a new et tree occurrence of NODE. */
static struct et_occ * static struct et_occ *
et_new_occ (struct et_node *node) et_new_occ (struct et_node *node)
......
...@@ -468,7 +468,7 @@ life_analysis (rtx f, FILE *file, int flags) ...@@ -468,7 +468,7 @@ life_analysis (rtx f, FILE *file, int flags)
free_basic_block_vars (1); free_basic_block_vars (1);
/* Removing dead insns should've made jumptables really dead. */ /* Removing dead insns should have made jumptables really dead. */
delete_dead_jumptables (); delete_dead_jumptables ();
} }
......
...@@ -269,7 +269,7 @@ static tree blocks_nreverse (tree); ...@@ -269,7 +269,7 @@ static tree blocks_nreverse (tree);
static int all_blocks (tree, tree *); static int all_blocks (tree, tree *);
static tree *get_block_vector (tree, int *); static tree *get_block_vector (tree, int *);
extern tree debug_find_var_in_block_tree (tree, tree); extern tree debug_find_var_in_block_tree (tree, tree);
/* We always define `record_insns' even if its not used so that we /* We always define `record_insns' even if it's not used so that we
can always export `prologue_epilogue_contains'. */ can always export `prologue_epilogue_contains'. */
static void record_insns (rtx, varray_type *) ATTRIBUTE_UNUSED; static void record_insns (rtx, varray_type *) ATTRIBUTE_UNUSED;
static int contains (rtx, varray_type); static int contains (rtx, varray_type);
......
...@@ -1964,7 +1964,7 @@ noce_process_if_block (struct ce_if_block * ce_info) ...@@ -1964,7 +1964,7 @@ noce_process_if_block (struct ce_if_block * ce_info)
} }
/* Disallow the "if (...) x = a;" form (with an implicit "else x = x;") /* Disallow the "if (...) x = a;" form (with an implicit "else x = x;")
for most optimizations if writing to x may trap, i.e. its a memory for most optimizations if writing to x may trap, i.e. it's a memory
other than a static var or a stack slot. */ other than a static var or a stack slot. */
if (! set_b if (! set_b
&& GET_CODE (orig_x) == MEM && GET_CODE (orig_x) == MEM
......
...@@ -191,7 +191,7 @@ function_cannot_inline_p (tree fndecl) ...@@ -191,7 +191,7 @@ function_cannot_inline_p (tree fndecl)
if (current_function_cannot_inline) if (current_function_cannot_inline)
return current_function_cannot_inline; return current_function_cannot_inline;
/* If its not even close, don't even look. */ /* If it's not even close, don't even look. */
if (get_max_uid () > 3 * max_insns) if (get_max_uid () > 3 * max_insns)
return N_("function too large to be inline"); return N_("function too large to be inline");
......
...@@ -1051,7 +1051,7 @@ simplejump_p (rtx insn) ...@@ -1051,7 +1051,7 @@ simplejump_p (rtx insn)
/* Return nonzero if INSN is a (possibly) conditional jump /* Return nonzero if INSN is a (possibly) conditional jump
and nothing more. and nothing more.
Use this function is deprecated, since we need to support combined Use of this function is deprecated, since we need to support combined
branch and compare insns. Use any_condjump_p instead whenever possible. */ branch and compare insns. Use any_condjump_p instead whenever possible. */
int int
......
...@@ -410,7 +410,7 @@ reload_cse_simplify_operands (rtx insn, rtx testreg) ...@@ -410,7 +410,7 @@ reload_cse_simplify_operands (rtx insn, rtx testreg)
{ {
rtx set = single_set (insn); rtx set = single_set (insn);
/* We might have multiple sets, some of which do implict /* We might have multiple sets, some of which do implicit
extension. Punt on this for now. */ extension. Punt on this for now. */
if (! set) if (! set)
continue; continue;
......
...@@ -33,7 +33,7 @@ ...@@ -33,7 +33,7 @@
#ifdef GATHER_STATISTICS #ifdef GATHER_STATISTICS
/* Store infromation about each particular varray. */ /* Store information about each particular varray. */
struct varray_descriptor struct varray_descriptor
{ {
const char *name; const char *name;
......
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