ChangeLog.2, [...]: Fix spelling errors and typos.
* ChangeLog.2, ChangeLog.3, ChangeLog.4, FSFChangeLog.10, FSFChangeLog.11, c-common.c, c-common.def, c-common.h, c-decl.c, c-dump.c, c-typeck.c, except.c, sdbout.c, simplify-rtx.c, timevar.h, tree.h, varasm.c: Fix spelling errors and typos. From-SVN: r46621
This commit is contained in:
Joseph Myers
parent
affd4f3309
commit
684d9f3beb
|
|
@ -1,5 +1,10 @@
|
|||
2001-10-29 Joseph S. Myers <jsm28@cam.ac.uk>
|
||||
|
||||
* ChangeLog.2, ChangeLog.3, ChangeLog.4, FSFChangeLog.10,
|
||||
FSFChangeLog.11, c-common.c, c-common.def, c-common.h, c-decl.c,
|
||||
c-dump.c, c-typeck.c, except.c, sdbout.c, simplify-rtx.c,
|
||||
timevar.h, tree.h, varasm.c: Fix spelling errors and typos.
|
||||
|
||||
* loop.h (struct induction): Rename ext_dependant to
|
||||
ext_dependent.
|
||||
* loop.c: Change all uses.
|
||||
|
|
|
|||
|
|
@ -10720,7 +10720,7 @@ Fri Aug 20 22:32:17 1999 Michael Hayes <m.hayes@elec.canterbury.ac.nz>
|
|||
Thu Aug 19 14:42:38 1999 Mike Stump <mrs@wrs.com>
|
||||
Mark Mitchell <mark@codesourcery.com>
|
||||
|
||||
* c-common.c (c_get_alias_set): Fix support for poitners and
|
||||
* c-common.c (c_get_alias_set): Fix support for pointers and
|
||||
references.
|
||||
|
||||
Thu Aug 19 11:51:22 EDT 1999 John Wehle (john@feith.com)
|
||||
|
|
|
|||
|
|
@ -8772,7 +8772,7 @@ Tue Mar 28 11:55:48 2000 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
|
|||
|
||||
Tue Mar 28 08:29:46 2000 Jan Hubicka <jh@suse.cz>
|
||||
|
||||
* sibcall.c (indentify_call_return_value): Find last call in the chain;
|
||||
* sibcall.c (identify_call_return_value): Find last call in the chain;
|
||||
Allow stack adjustment after function call.
|
||||
|
||||
* regmove.c (struct csa_memlist): Make mem field rtx *.
|
||||
|
|
|
|||
|
|
@ -8208,7 +8208,7 @@ Sun Sep 17 10:46:17 2000 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
|
|||
(struct language_function): Add x_scope_stmt_stack and
|
||||
x_function_name_declared_p.
|
||||
(RECHAIN_STMTS): Move definition.
|
||||
(lang_statment_code_p): Likewise.
|
||||
(lang_statement_code_p): Likewise.
|
||||
(lang_expand_stmt): Likewise.
|
||||
(lang_expand_decl_stmt): New variable.
|
||||
(lang_expand_function_end): Likewise.
|
||||
|
|
@ -14103,7 +14103,7 @@ Fri Jul 14 10:25:53 2000 Clinton Popetz <cpopetz@cygnus.com>
|
|||
|
||||
2000-07-14 Neil Booth <NeilB@earthling.net>
|
||||
|
||||
* cpplex.c (adjust_column): New funcion.
|
||||
* cpplex.c (adjust_column): New function.
|
||||
(skip_whitespace): Use it.
|
||||
(skip_block_comment): Use it, and warn about /*/* with
|
||||
-Wcomments.
|
||||
|
|
|
|||
|
|
@ -3880,7 +3880,7 @@ Wed Dec 6 06:58:23 1995 Richard Earnshaw (rearnsha@armltd.co.uk)
|
|||
using prog_mode attribute.
|
||||
(function units "write_buf", "write_blockage"): Model the write buffer
|
||||
as two function units, so that conflicts are avoided more often.
|
||||
(funcion unit "core"): New function unit, so that elapsed cycles can
|
||||
(function unit "core"): New function unit, so that elapsed cycles can
|
||||
be more accurately determined.
|
||||
(all anonymous patterns): Add names.
|
||||
(mulsidi3, umulsidi3): New patterns available with fast multiply
|
||||
|
|
|
|||
|
|
@ -4070,7 +4070,7 @@ Sat Aug 2 13:25:33 1997 Tristan Gingold (gingold@email.enst.fr)
|
|||
* stmt.c (expand_computed_goto): If -fcheck-memory-usage, check that
|
||||
computed address of a goto is executable.
|
||||
(expand_asm, expand_asm_operands): If -fcheck-memory-usage,
|
||||
disallow asm statments.
|
||||
disallow asm statements.
|
||||
* toplev.c (flag_check_memory_usage, flag_prefix_function_name): New
|
||||
variable.
|
||||
(f_options): Add `check-memory-usage' and `prefix_function_name'.
|
||||
|
|
|
|||
|
|
@ -157,12 +157,12 @@ cpp_reader *parse_in; /* Declared in c-lex.h. */
|
|||
|
||||
tree void_list_node;
|
||||
|
||||
The lazily created VAR_DECLS for __FUNCTION__, __PRETTY_FUNCTION__,
|
||||
The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
|
||||
and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
|
||||
VAR_DECLS, but C++ does.)
|
||||
|
||||
tree function_name_decl_node;
|
||||
tree pretty_function_name_declnode;
|
||||
tree pretty_function_name_decl_node;
|
||||
tree c99_function_name_decl_node;
|
||||
|
||||
Stack of nested function name VAR_DECLs.
|
||||
|
|
@ -924,7 +924,7 @@ warn_for_collisions (list)
|
|||
}
|
||||
}
|
||||
|
||||
/* Return nonzero if X is a tree that can be verified by the sequence poitn
|
||||
/* Return nonzero if X is a tree that can be verified by the sequence point
|
||||
warnings. */
|
||||
static int
|
||||
warning_candidate_p (x)
|
||||
|
|
@ -2201,7 +2201,7 @@ c_common_get_alias_set (t)
|
|||
|
||||
Technically, this approach is actually more conservative that
|
||||
it needs to be. In particular, `const int *' and `int *'
|
||||
chould be in different alias sets, according to the C and C++
|
||||
should be in different alias sets, according to the C and C++
|
||||
standard, since their types are not the same, and so,
|
||||
technically, an `int **' and `const int **' cannot point at
|
||||
the same thing.
|
||||
|
|
|
|||
|
|
@ -22,7 +22,7 @@ along with GCC; see the file COPYING. If not, write to the Free
|
|||
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
|
||||
02111-1307, USA. */
|
||||
|
||||
/* Tree nodes relevent to both C and C++. These were originally in
|
||||
/* Tree nodes relevant to both C and C++. These were originally in
|
||||
cp-tree.def in the cp subdir. */
|
||||
|
||||
/* A node to remember a source position. */
|
||||
|
|
|
|||
|
|
@ -459,7 +459,7 @@ extern int warn_long_long;
|
|||
|
||||
/* Return the qualifiers that apply to this type. In C++, that means
|
||||
descending through array types. Note that this macro evaluates its
|
||||
arguments mor than once. */
|
||||
arguments more than once. */
|
||||
#define C_TYPE_QUALS(TYPE) \
|
||||
(TYPE_QUALS ((TREE_CODE (TYPE) == ARRAY_TYPE \
|
||||
&& c_language == clk_cplusplus) \
|
||||
|
|
@ -557,7 +557,7 @@ extern tree strip_array_types PARAMS ((tree));
|
|||
|
||||
/* IF_STMT accessors. These give access to the condition of the if
|
||||
statement, the then block of the if statement, and the else block
|
||||
of the if stsatement if it exists. */
|
||||
of the if statement if it exists. */
|
||||
#define IF_COND(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 0)
|
||||
#define THEN_CLAUSE(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 1)
|
||||
#define ELSE_CLAUSE(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 2)
|
||||
|
|
@ -605,8 +605,8 @@ extern tree strip_array_types PARAMS ((tree));
|
|||
#define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_STMT_CHECK (NODE), 0)
|
||||
|
||||
/* COMPOUND_STMT accessor. This gives access to the TREE_LIST of
|
||||
statements assocated with a compound statement. The result is the
|
||||
first statement in the list. Succeeding nodes can be acccessed by
|
||||
statements associated with a compound statement. The result is the
|
||||
first statement in the list. Succeeding nodes can be accessed by
|
||||
calling TREE_CHAIN on a node in the list. */
|
||||
#define COMPOUND_BODY(NODE) TREE_OPERAND (COMPOUND_STMT_CHECK (NODE), 0)
|
||||
|
||||
|
|
@ -823,7 +823,7 @@ extern int c_unsafe_for_reeval PARAMS ((tree));
|
|||
enum tree_dump_index
|
||||
{
|
||||
TDI_all, /* dump the whole translation unit */
|
||||
TDI_class, /* dump class heirarchy */
|
||||
TDI_class, /* dump class hierarchy */
|
||||
TDI_original, /* dump each function before optimizing it */
|
||||
TDI_optimized, /* dump each function after optimizing it */
|
||||
TDI_inlined, /* dump each function after inlining
|
||||
|
|
|
|||
|
|
@ -4748,7 +4748,7 @@ grokdeclarator (declarator, declspecs, decl_context, initialized)
|
|||
&& TREE_OVERFLOW (TYPE_SIZE (type)))
|
||||
{
|
||||
error ("size of array `%s' is too large", name);
|
||||
/* If we proceed with the array type as it is, we'll eventully
|
||||
/* If we proceed with the array type as it is, we'll eventually
|
||||
crash in tree_low_cst(). */
|
||||
type = error_mark_node;
|
||||
}
|
||||
|
|
@ -7109,7 +7109,7 @@ mark_c_function_context (f)
|
|||
mark_binding_level (&p->binding_level);
|
||||
}
|
||||
|
||||
/* Copy the DECL_LANG_SEPECIFIC data associated with NODE. */
|
||||
/* Copy the DECL_LANG_SPECIFIC data associated with NODE. */
|
||||
|
||||
void
|
||||
copy_lang_decl (decl)
|
||||
|
|
|
|||
|
|
@ -545,7 +545,7 @@ dequeue_and_dump (di)
|
|||
break;
|
||||
|
||||
case CASE_LABEL:
|
||||
/* Note that a case label is not like other statments; there is
|
||||
/* Note that a case label is not like other statements; there is
|
||||
no way to get the line-number of a case label. */
|
||||
dump_child ("low", CASE_LOW (t));
|
||||
dump_child ("high", CASE_HIGH (t));
|
||||
|
|
|
|||
|
|
@ -3820,7 +3820,7 @@ build_c_cast (type, expr)
|
|||
}
|
||||
}
|
||||
|
||||
/* Pedantically, don't ley (void *) (FOO *) 0 be a null pointer constant. */
|
||||
/* Pedantically, don't let (void *) (FOO *) 0 be a null pointer constant. */
|
||||
if (pedantic && TREE_CODE (value) == INTEGER_CST
|
||||
&& TREE_CODE (expr) == INTEGER_CST
|
||||
&& TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE)
|
||||
|
|
@ -5762,7 +5762,7 @@ set_init_label (fieldname)
|
|||
}
|
||||
|
||||
/* Add a new initializer to the tree of pending initializers. PURPOSE
|
||||
indentifies the initializer, either array index or field in a structure.
|
||||
identifies the initializer, either array index or field in a structure.
|
||||
VALUE is the value of that index or field. */
|
||||
|
||||
static void
|
||||
|
|
|
|||
|
|
@ -2629,7 +2629,7 @@ reachable_next_level (region, type_thrown, info)
|
|||
region->u.allowed.type_list,
|
||||
info->types_allowed);
|
||||
|
||||
/* If we have definitive information about the type heirarchy,
|
||||
/* If we have definitive information about the type hierarchy,
|
||||
then we can tell if the thrown type will pass through the
|
||||
filter. */
|
||||
if (type_thrown && lang_eh_type_covers)
|
||||
|
|
|
|||
|
|
@ -1182,7 +1182,7 @@ sdbout_one_type (type)
|
|||
|
||||
/* Print out the base class information with fields
|
||||
named after the types they hold. */
|
||||
/* This is only relevent to aggregate types. TYPE_BINFO is used
|
||||
/* This is only relevant to aggregate types. TYPE_BINFO is used
|
||||
for other purposes in an ENUMERAL_TYPE, so we must exclude that
|
||||
case. */
|
||||
if (TREE_CODE (type) != ENUMERAL_TYPE)
|
||||
|
|
|
|||
|
|
@ -2617,7 +2617,7 @@ simplify_subreg (outermode, op, innermode, byte)
|
|||
res = simplify_subreg (outermode, part, GET_MODE (part), final_offset);
|
||||
if (res)
|
||||
return res;
|
||||
/* We can at least simplify it by referring directly to the relevent part. */
|
||||
/* We can at least simplify it by referring directly to the relevant part. */
|
||||
return gen_rtx_SUBREG (outermode, part, final_offset);
|
||||
}
|
||||
|
||||
|
|
|
|||
|
|
@ -63,7 +63,7 @@ struct timevar_time_def
|
|||
float wall;
|
||||
};
|
||||
|
||||
/* An enumeration of timing variable indentifiers. Constructed from
|
||||
/* An enumeration of timing variable identifiers. Constructed from
|
||||
the contents of timevar.def. */
|
||||
|
||||
#define DEFTIMEVAR(identifier__, name__) \
|
||||
|
|
|
|||
|
|
@ -1556,7 +1556,7 @@ struct tree_type
|
|||
be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
|
||||
#define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
|
||||
|
||||
/* List of FUNCION_DECLs inlined into this function's body. */
|
||||
/* List of FUNCTION_DECLs inlined into this function's body. */
|
||||
#define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
|
||||
|
||||
/* Nonzero in a FUNCTION_DECL means this is a built-in function
|
||||
|
|
|
|||
|
|
@ -5325,7 +5325,7 @@ assemble_vtable_entry (symbol, offset)
|
|||
fputc ('\n', asm_out_file);
|
||||
}
|
||||
|
||||
/* Used for vtable gc in GNU binutils. Record the class heirarchy by noting
|
||||
/* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
|
||||
that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
|
||||
|
||||
void
|
||||
|
|
|
|||
Loading…
Reference in New Issue