mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-02-12 12:00:23 +08:00
Code Issues Packages Projects Releases Wiki Activity

c-common.h: Fix comment typos.

Browse Source 
* 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
This commit is contained in:
Kazu Hirata 2004-01-25 03:52:42 +00:00 committed by Kazu Hirata
parent 56ae131655
commit 1f52178b3a
13 changed files with 31 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
gcc/ChangeLog
View File

@ -1,3 +1,18 @@
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.

2
gcc/c-common.h
View File

@ -206,7 +206,7 @@ struct c_common_identifier GTY(())
#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_uinteger_type_node c_global_trees[CTI_G77_UINTEGER_TYPE]
#define g77_longint_type_node c_global_trees[CTI_G77_LONGINT_TYPE]

2
gcc/c-decl.c
View File

@ -792,7 +792,7 @@ match_builtin_function_types (tree newtype, tree 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
diagnostics. */
static void

2
gcc/cgraphunit.c
View File

@ -844,7 +844,7 @@ cgraph_remove_unreachable_nodes (void)
/* Remove unreachable nodes. Extern inline functions need special care;
Unreachable extern inline functions shall be removed.
Reachable extern inline functions we never inlined shall get their bodies
elliminated
eliminated.
Reachable extern inline functions we sometimes inlined will be turned into
unanalyzed nodes so they look like for true extern functions to the rest
of code. */

2
gcc/combine.c
View File

@ -2467,7 +2467,7 @@ try_combine (rtx i3, rtx i2, rtx i1, int *new_direct_jump_p)
undobuf.other_insn, NULL_RTX);
}
#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. */
{
rtx p = prev_nonnote_insn (i3);

10
gcc/et-forest.c
View File

@ -37,7 +37,7 @@ Boston, MA 02111-1307, USA.
#include "basic-block.h"
#endif
/* The occurence of a node in the et tree. */
/* The occurrence of a node in the et tree. */
struct et_occ
{
struct et_node *of; /* The node. */
@ -51,7 +51,7 @@ struct et_occ
int min; /* The minimum value of the depth in the subtree
is obtained by adding sum of depth fields
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. */
};
@ -112,7 +112,7 @@ set_next (struct et_occ *occ, struct et_occ *t)
t->parent = occ;
}
/* Recompute minimum for occurence OCC. */
/* Recompute minimum for occurrence OCC. */
static inline void
et_recomp_min (struct et_occ *occ)
@ -310,7 +310,7 @@ check_path_after (struct et_occ *occ)
#endif
/* Splay the occurence OCC to the root of the tree. */
/* Splay the occurrence OCC to the root of the tree. */
static void
et_splay (struct et_occ *occ)
@ -452,7 +452,7 @@ et_splay (struct et_occ *occ)
#endif
}
/* Create a new et tree occurence of NODE. */
/* Create a new et tree occurrence of NODE. */
static struct et_occ *
et_new_occ (struct et_node *node)

2
gcc/flow.c
View File

@ -468,7 +468,7 @@ life_analysis (rtx f, FILE *file, int flags)
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 ();
}

2
gcc/function.c
View File

@ -269,7 +269,7 @@ static tree blocks_nreverse (tree);
static int all_blocks (tree, tree *);
static tree *get_block_vector (tree, int *);
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'. */
static void record_insns (rtx, varray_type *) ATTRIBUTE_UNUSED;
static int contains (rtx, varray_type);

2
gcc/ifcvt.c
View File

@ -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;")
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. */
if (! set_b
&& GET_CODE (orig_x) == MEM

2
gcc/integrate.c
View File

@ -191,7 +191,7 @@ function_cannot_inline_p (tree fndecl)
if (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)
return N_("function too large to be inline");

2
gcc/jump.c
View File

@ -1051,7 +1051,7 @@ simplejump_p (rtx insn)
/* Return nonzero if INSN is a (possibly) conditional jump
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. */
int

2
gcc/postreload.c
View File

@ -410,7 +410,7 @@ reload_cse_simplify_operands (rtx insn, rtx testreg)
{
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. */
if (! set)
continue;

2
gcc/varray.c
View File

@ -33,7 +33,7 @@
#ifdef GATHER_STATISTICS
/* Store infromation about each particular varray. */
/* Store information about each particular varray. */
struct varray_descriptor
{
const char *name;