MatCat.OpenSource/8sa1-gcc
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

ChangeLog.0, [...]: Fix spelling errors.

Browse Source 
* ChangeLog.0, ChangeLog.1, ChangeLog.2, ChangeLog.3, ChangeLog.4,
	ChangeLog.5, ChangeLog, FSFChangeLog.10, FSFChangeLog.11,
	c-common.c, c-common.h, c-parse.in, c-typeck.c, cfg.c, config.gcc,
	configure, configure.in, except.c, except.h, flow.c, function.c,
	gcc.c, gcse.c, genrecog.c, libgcc2.c, loop.c, loop.h, params.def,
	predict.def, predict.h, reg-stack.c, regmove.c, sched-deps.c,
	sched-int.h, sibcall.c, ssa.c, stringpool.c, toplev.c, tree.c,
	unroll.c: Fix spelling errors.

From-SVN: r46595
This commit is contained in:
Joseph Myers 2001-10-28 20:09:17 +00:00
parent 306ef64467
commit ff7cc30768
40 changed files with 89 additions and 80 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
gcc/ChangeLog
View File

@ -1,5 +1,14 @@
2001-10-28 Joseph S. Myers <jsm28@cam.ac.uk> 2001-10-28 Joseph S. Myers <jsm28@cam.ac.uk>
* ChangeLog.0, ChangeLog.1, ChangeLog.2, ChangeLog.3, ChangeLog.4,
ChangeLog.5, ChangeLog, FSFChangeLog.10, FSFChangeLog.11,
c-common.c, c-common.h, c-parse.in, c-typeck.c, cfg.c, config.gcc,
configure, configure.in, except.c, except.h, flow.c, function.c,
gcc.c, gcse.c, genrecog.c, libgcc2.c, loop.c, loop.h, params.def,
predict.def, predict.h, reg-stack.c, regmove.c, sched-deps.c,
sched-int.h, sibcall.c, ssa.c, stringpool.c, toplev.c, tree.c,
unroll.c: Fix spelling errors.
* doc/extend.texi, doc/invoke.texi: Fix spelling. * doc/extend.texi, doc/invoke.texi: Fix spelling.
* doc/gcc.texi: Document use of "dependent" and American spelling. * doc/gcc.texi: Document use of "dependent" and American spelling.
@ -717,7 +726,7 @@ Sat Oct 20 12:01:07 CEST 2001 Jan Hubicka <jh@suse.cz>
(c_expand_body): Measure time. (c_expand_body): Measure time.
* toplev.c (rest_of_compilation): Measure time of mode switching * toplev.c (rest_of_compilation): Measure time of mode switching
separately. separately.
* Makefile.in (c-decl.o, cfgcleanup.o): Add dependancy. * Makefile.in (c-decl.o, cfgcleanup.o): Add dependency.
* toplev.c (flag_asynchronous_unwind_tables): New global variable. * toplev.c (flag_asynchronous_unwind_tables): New global variable.
(lang_independent_options): Add asynchronous-unwind-tables (lang_independent_options): Add asynchronous-unwind-tables
@ -1131,7 +1140,7 @@ Wed Oct 17 00:01:02 CEST 2001 Jan Hubicka <jh@suse.cz>
64bit operations require split on 64bit machine. 64bit operations require split on 64bit machine.
(CONST_COST): Make large 64bit constants expensive on 64bit compilation. (CONST_COST): Make large 64bit constants expensive on 64bit compilation.
* i386.c (ix86_setup_incomming_varargs): Fix mode of PLUS. * i386.c (ix86_setup_incoming_varargs): Fix mode of PLUS.
(ix86_expand_move): Avoid pushes of memory if size does not match; (ix86_expand_move): Avoid pushes of memory if size does not match;
move long constants to register. move long constants to register.
(x86_initialize_trampoline): Fix mode. (x86_initialize_trampoline): Fix mode.
@ -4916,7 +4925,7 @@ Sun Sep 2 18:37:54 CEST 2001 Jan Hubicka <jh@suse.cz>
2001-08-31 Richard Henderson <rth@redhat.com> 2001-08-31 Richard Henderson <rth@redhat.com>
* sched-deps.c (add_dependence): Don't elide dependancy if the * sched-deps.c (add_dependence): Don't elide dependency if the
conditional used by insn is modified in elem. conditional used by insn is modified in elem.
2001-08-31 Nick Clifton <nickc@cambridge.redhat.com> 2001-08-31 Nick Clifton <nickc@cambridge.redhat.com>
@ -8922,7 +8931,7 @@ Thu Jul 26 14:04:03 EDT 2001 John Wehle (john@feith.com)
2001-07-26 Andrew MacLeod <amacleod@redhat.com> 2001-07-26 Andrew MacLeod <amacleod@redhat.com>
* params.def (PARAM_MAX_PENDING_LIST_LENGTH): Add parameter to * params.def (PARAM_MAX_PENDING_LIST_LENGTH): Add parameter to
limit length of dependancy flush list. limit length of dependency flush list.
* params.h (MAX_PENDING_LIST_LENGTH): Define. * params.h (MAX_PENDING_LIST_LENGTH): Define.
* sched-int.h (struct deps): Add pending_flush_length field. * sched-int.h (struct deps): Add pending_flush_length field.
* sched-deps.c (flush_pending_lists): Last_pending_memory_flush now * sched-deps.c (flush_pending_lists): Last_pending_memory_flush now

4
gcc/ChangeLog.0
View File

@ -5188,7 +5188,7 @@ Wed Apr 15 01:21:21 1998 Jeffrey A Law (law@cygnus.com)
Tue Apr 14 23:39:13 1998 Richard Henderson <rth@cygnus.com> Tue Apr 14 23:39:13 1998 Richard Henderson <rth@cygnus.com>
* alpha.md: Revert Oct 27 change, as it is superceded by Kenner's * alpha.md: Revert Oct 27 change, as it is superseded by Kenner's
Nov 8 find_replacement change. Move decls of get_unaligned_address Nov 8 find_replacement change. Move decls of get_unaligned_address
* alpha.h: ... here. * alpha.h: ... here.
@ -5370,7 +5370,7 @@ Wed Apr 8 12:51:19 1998 Jeffrey A Law (law@cygnus.com)
* invoke.texi: Add ARC options. * invoke.texi: Add ARC options.
* gcc.c (proces_command): Improve error message for -o with * gcc.c (process_command): Improve error message for -o with
either -c or -S. either -c or -S.
* i386/x-cygwin32 (CLIB): Link in advapi32. * i386/x-cygwin32 (CLIB): Link in advapi32.

4
gcc/ChangeLog.1
View File

@ -1423,7 +1423,7 @@ Fri Apr 12 15:00:52 1999 Stan Cox <scox@cygnus.com>
* cpphash.c (collect_expansion, macroexpand, * cpphash.c (collect_expansion, macroexpand,
push_macro_expansion): Make the escape character in macro push_macro_expansion): Make the escape character in macro
buffers '\r', not '@'. Remove code to protect literal buffers '\r', not '@'. Remove code to protect literal
occurences of the escape character; '\r' cannot appear occurrences of the escape character; '\r' cannot appear
in a macro buffer unless we put it there. in a macro buffer unless we put it there.
* cpplib.c (skip_comment, copy_comment, cpp_skip_hspace, * cpplib.c (skip_comment, copy_comment, cpp_skip_hspace,
copy_rest_of_line, cpp_get_token, parse_string, copy_rest_of_line, cpp_get_token, parse_string,
@ -12503,7 +12503,7 @@ Thu Oct 1 10:42:27 1998 Nick Clifton <nickc@cygnus.com>
* c-common.c (decl_attributes): Call PRAGMA_INSERT_ATTRIBUTES * c-common.c (decl_attributes): Call PRAGMA_INSERT_ATTRIBUTES
if it is defined. if it is defined.
* c-lex.c: Replace occurances of HANDLE_SYSV_PRAGMA with * c-lex.c: Replace occurrences of HANDLE_SYSV_PRAGMA with
HANDLE_GENERIC_PRAGMAS. HANDLE_GENERIC_PRAGMAS.
* varasm.c: Move definition of 'struct weak_syms' into * varasm.c: Move definition of 'struct weak_syms' into

8
gcc/ChangeLog.2
View File

@ -2889,7 +2889,7 @@ Tue Nov 9 14:55:44 1999 Nick Clifton <nickc@cygnus.com>
(reg_or_cmp_int16_operand): New predicate function. (reg_or_cmp_int16_operand): New predicate function.
(extend_operand): New predicate function. (extend_operand): New predicate function.
(m32r_adjust_code): New scheduling function. (m32r_adjust_code): New scheduling function.
(m32r_adjust_priorty): New scheduling function. (m32r_adjust_priority): New scheduling function.
(m32r_sched_init): New scheduling function. (m32r_sched_init): New scheduling function.
(m32r_sched_reorder): New scheduling function. (m32r_sched_reorder): New scheduling function.
(m32r_sched_variable_issue): New scheduling function. (m32r_sched_variable_issue): New scheduling function.
@ -4248,7 +4248,7 @@ Tue Oct 26 18:23:38 1999 Jan Hubicka <hubicka@freesoft.cz>
(record_reg_life_pat, record_reg_life, find_blocks): Remove. (record_reg_life_pat, record_reg_life, find_blocks): Remove.
(nan): New. (nan): New.
(goto_block_pat, print_blocks, dump_stack_info): Remove. (goto_block_pat, print_blocks, dump_stack_info): Remove.
(reg_to_stack): Simplified test for existance of fp code. Use (reg_to_stack): Simplified test for existence of fp code. Use
flow.c code. Call shorten_branches after cross-jump opt. flow.c code. Call shorten_branches after cross-jump opt.
(check_asm_stack_operands): Renamed from record_asm_reg_life. (check_asm_stack_operands): Renamed from record_asm_reg_life.
Return false if the asm doesn't use stack regs. Don't do life Return false if the asm doesn't use stack regs. Don't do life
@ -10124,7 +10124,7 @@ Wed Aug 25 13:41:47 EDT 1999 Andrew MacLeod <amacleod@cygnus.com>
prototypes. prototypes.
* toplev.c (rest_of_compilation): Initialize node cache. * toplev.c (rest_of_compilation): Initialize node cache.
* Makefile.in (OBJS): Add lists.o to list of object files. * Makefile.in (OBJS): Add lists.o to list of object files.
(lists.o): Add dependancies. (lists.o): Add dependencies.
Wed Aug 25 17:31:56 1999 Nick Clifton <nickc@cygnus.com> Wed Aug 25 17:31:56 1999 Nick Clifton <nickc@cygnus.com>
@ -13070,7 +13070,7 @@ Thu Jul 8 12:55:12 1999 Jeffrey A Law (law@cygnus.com)
Thu Jul 8 18:03:19 1999 J"orn Rennecke <amylaar@cygnus.co.uk> Thu Jul 8 18:03:19 1999 J"orn Rennecke <amylaar@cygnus.co.uk>
* reload1.c (choose_reload_regs): Never call remove_adress_replacements * reload1.c (choose_reload_regs): Never call remove_address_replacements
when reload_out equals reload_in. when reload_out equals reload_in.
Thu Jul 8 16:50:14 1999 Nick Clifton <nickc@cygnus.com> Thu Jul 8 16:50:14 1999 Nick Clifton <nickc@cygnus.com>

12
gcc/ChangeLog.3
View File

@ -40,7 +40,7 @@
(do_import): Likewise. (do_import): Likewise.
(do_include_next): Likewise. (do_include_next): Likewise.
(gcc_pragmas): Add dependency pragma. (gcc_pragmas): Add dependency pragma.
(do_pragma_dependancy): New pragma. (do_pragma_dependency): New pragma.
2000-06-29 Jason Merrill <jason@redhat.com> 2000-06-29 Jason Merrill <jason@redhat.com>
@ -2684,7 +2684,7 @@ Thu May 25 02:09:10 2000 J"orn Rennecke <amylaar@cygnus.co.uk>
* fold-const.c (extract_muldiv): When constructing a * fold-const.c (extract_muldiv): When constructing a
multiplier/divisor, do not expect const_binop to correctly multiplier/divisor, do not expect const_binop to correctly
determine if overflow has occured, so check explicitly. determine if overflow has occurred, so check explicitly.
2000-05-24 Alexandre Oliva <aoliva@cygnus.com> 2000-05-24 Alexandre Oliva <aoliva@cygnus.com>
@ -3799,7 +3799,7 @@ Wed May 10 21:31:44 2000 Jim Wilson <wilson@cygnus.com>
* Makefile.in (libgcc.a, stmp-multilib): Depend on FPBIT and DPBIT. * Makefile.in (libgcc.a, stmp-multilib): Depend on FPBIT and DPBIT.
* mklibgcc.in: Rewrite to not use functions. Don't shortcut * mklibgcc.in: Rewrite to not use functions. Don't shortcut
dependancies on FPBIT and DPBIT. dependencies on FPBIT and DPBIT.
2000-05-10 Nick Clifton <nickc@redhat.com> 2000-05-10 Nick Clifton <nickc@redhat.com>
@ -4065,7 +4065,7 @@ Mon May 8 17:16:48 2000 Jim Wilson <wilson@cygnus.com>
* config/ia64/ia64.h (predicate_operator): Declare. * config/ia64/ia64.h (predicate_operator): Declare.
* config/ia64/ia64.md (extendsfdf2): Split the nop case out * config/ia64/ia64.md (extendsfdf2): Split the nop case out
of existance. of existence.
* gensupport.c (process_rtx): Copy and post-process each member * gensupport.c (process_rtx): Copy and post-process each member
of the define_insn rtvec individually. of the define_insn rtvec individually.
@ -9830,7 +9830,7 @@ Fri Mar 17 08:09:14 2000 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise. (add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c. * dwarfout.c: Similar changes to dwarf2out.c.
* expr.c (expand_expr, case ARRAY_REF): Remove redundant code. * expr.c (expand_expr, case ARRAY_REF): Remove redundant code.
* genoutput.c (n_occurences): Return -1 for null string. * genoutput.c (n_occurrences): Return -1 for null string.
(strip_whitespace): Accept null string and make into function. (strip_whitespace): Accept null string and make into function.
(scan_operands): Reflect above changes. (scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst. * sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
@ -16497,7 +16497,7 @@ Thu Jan 6 13:44:59 CET 2000 Jan Hubicka <jh@suse.cz>
flag_data_sections or UNIQUE_SECTION_P are true. flag_data_sections or UNIQUE_SECTION_P are true.
* tm.texi (UNIQUE_SECTION): Document that it can be called for * tm.texi (UNIQUE_SECTION): Document that it can be called for
unitialised data decls. uninitialized data decls.
* config/i386/winnt.c (i386_pe_unique_section): Cope with * config/i386/winnt.c (i386_pe_unique_section): Cope with
being called for uninitialised data. being called for uninitialised data.

2
gcc/ChangeLog.4
View File

@ -5361,7 +5361,7 @@ Tue Oct 31 15:33:27 2000 J"orn Rennecke <amylaar@redhat.com>
* regrename.c: Rewrite to handle multi-register modes and * regrename.c: Rewrite to handle multi-register modes and
cond_exec instructions. cond_exec instructions.
* Makefile.in (regrename.o): Update dependancies. * Makefile.in (regrename.o): Update dependencies.
* recog.h (struct operand_alternative): Add is_address. * recog.h (struct operand_alternative): Add is_address.
* recog.c (preprocess_constraints) [case 'p']: Set it. * recog.c (preprocess_constraints) [case 'p']: Set it.

8
gcc/ChangeLog.5
View File

@ -1054,7 +1054,7 @@ Mon Jun 18 17:27:24 CEST 2001 Jan Hubicka <jh@suse.cz>
(unroll_loop): Drop prediction notes on preconditioning. (unroll_loop): Drop prediction notes on preconditioning.
* predict.def (PRED_LOOP_PRECONDITIONG, PRED_LOOP_CONDITION): * predict.def (PRED_LOOP_PRECONDITIONG, PRED_LOOP_CONDITION):
New; add comments on the others. New; add comments on the others.
* Makefile.in: (unroll.o): Add dependancy on predict.h. * Makefile.in: (unroll.o): Add dependency on predict.h.
* loop.c (strength_reduce): Fix branch prediction. * loop.c (strength_reduce): Fix branch prediction.
Mon Jun 18 17:26:56 CEST 2001 Jan Hubicka <jh@suse.cz> Mon Jun 18 17:26:56 CEST 2001 Jan Hubicka <jh@suse.cz>
@ -1363,7 +1363,7 @@ Tue Jun 12 12:20:12 CEST 2001 Jan Hubicka <jh@suse.cz>
(strength_reduce): Drop branch prediction note in case (strength_reduce): Drop branch prediction note in case
number of iterations is known. number of iterations is known.
* predict.def (PRED_LOOP_ITERATIONS): new. * predict.def (PRED_LOOP_ITERATIONS): new.
* Makefile.in (loop.o): Add dependancy on predict.h * Makefile.in (loop.o): Add dependency on predict.h
2001-06-12 Kaveh R. Ghazi <ghazi@caip.rutgers.edu> 2001-06-12 Kaveh R. Ghazi <ghazi@caip.rutgers.edu>
@ -1684,7 +1684,7 @@ Sun Jun 10 00:35:37 CEST 2001 Jan Hubicka <jh@suse.cz>
* jump.c: Include predict.h * jump.c: Include predict.h
(duplicate_loop_exit_test): Drop branch prediction notes. (duplicate_loop_exit_test): Drop branch prediction notes.
(invert_jump): Use invert_br_probabilities. (invert_jump): Use invert_br_probabilities.
* Makefile.in: Add dependancy on predict.h for jump and predict pass. * Makefile.in: Add dependency on predict.h for jump and predict pass.
* ifcvt.c (dead_or_predicable): Use invert_br_probabilities. * ifcvt.c (dead_or_predicable): Use invert_br_probabilities.
* combine.c (distribute_notes): Handle BR_PRED. * combine.c (distribute_notes): Handle BR_PRED.
@ -14214,7 +14214,7 @@ Wed Jan 3 08:53:50 2001 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
* c-common.h (ASM_INPUT_P): New. * c-common.h (ASM_INPUT_P): New.
* c-parse.in (asm): Set it when needed. * c-parse.in (asm): Set it when needed.
* c-semantics.c (genrtl_asm_stmt): Test it instead of the * c-semantics.c (genrtl_asm_stmt): Test it instead of the
existance of an operand. existence of an operand.
Tue Jan 2 20:27:07 MET 2001 Jan Hubicka <jh@suse.cz> Tue Jan 2 20:27:07 MET 2001 Jan Hubicka <jh@suse.cz>

2
gcc/FSFChangeLog.10
View File

@ -5807,7 +5807,7 @@ Fri Jul 28 08:47:51 1995 Jim Wilson <wilson@chestnut.cygnus.com>
(xcoffout_begin_function): Call dbxout_parms and (xcoffout_begin_function): Call dbxout_parms and
ASM_OUTPUT_SOURCE_LINE. ASM_OUTPUT_SOURCE_LINE.
* va-mips.h: Change every occurance of #if __mips>=3 to * va-mips.h: Change every occurrence of #if __mips>=3 to
#ifdef __mips64. #ifdef __mips64.
* mips/abi64.h (CPP_SPEC): Output -D__mips64 when -mips3, or -mips4, * mips/abi64.h (CPP_SPEC): Output -D__mips64 when -mips3, or -mips4,
or -mgp64. Output -U__mips64 when -mgp32. or -mgp64. Output -U__mips64 when -mgp32.

6
gcc/FSFChangeLog.11
View File

@ -492,7 +492,7 @@ Fri Nov 28 12:34:03 1997 Scott Christley <scottc@net-community.com>
* objc/Make-lang.in (runtime-info.h): Add comment in file. * objc/Make-lang.in (runtime-info.h): Add comment in file.
* objc/selector.c: Replace all occurences of sarray_get * objc/selector.c: Replace all occurrences of sarray_get
with sarray_get_safe. with sarray_get_safe.
* objc/sendmsg.c: Likewise. * objc/sendmsg.c: Likewise.
@ -7666,7 +7666,7 @@ Sun Feb 2 19:43:17 1997 Scott Christley <scottc@net-community.com>
(__alpha__): Remove unneeded code. (__alpha__): Remove unneeded code.
(objc_error): Allow user specified error handler function to (objc_error): Allow user specified error handler function to
trap and handle the objc error. Added an error code parameter trap and handle the objc error. Added an error code parameter
which indicates the specific error that occured. which indicates the specific error that occurred.
(objc_malloc, objc_atomic_malloc): Replace call to objc_fatal (objc_malloc, objc_atomic_malloc): Replace call to objc_fatal
function with call to objc_error function. function with call to objc_error function.
(objc_valloc, objc_realloc, objc_calloc): Likewise. (objc_valloc, objc_realloc, objc_calloc): Likewise.
@ -9480,7 +9480,7 @@ Sat Oct 26 14:04:09 1996 Ben Harris <bjh21@cam.ac.uk>
Sat Oct 26 13:59:05 1996 Richard Kenner (kenner@vlsi1.ultra.nyu.edu) Sat Oct 26 13:59:05 1996 Richard Kenner (kenner@vlsi1.ultra.nyu.edu)
* explow.c (allocate_dynamic_stack_space): Delete reference to * explow.c (allocate_dynamic_stack_space): Delete reference to
nonexistant macro ALLOCATE_OUTGOING_ARGS. nonexistent macro ALLOCATE_OUTGOING_ARGS.
* next.h (CPP_PREDEFINES): Add -D_NEXT_SOURCE. * next.h (CPP_PREDEFINES): Add -D_NEXT_SOURCE.

2
gcc/c-common.c
View File

@ -396,7 +396,7 @@ finish_fname_decls ()
if (body) if (body)
{ {
/* They were called into existance, so add to statement tree. */ /* They were called into existence, so add to statement tree. */
body = chainon (body, body = chainon (body,
TREE_CHAIN (DECL_SAVED_TREE (current_function_decl))); TREE_CHAIN (DECL_SAVED_TREE (current_function_decl)));
body = build_stmt (COMPOUND_STMT, body); body = build_stmt (COMPOUND_STMT, body);

6
gcc/c-common.h
View File

@ -555,14 +555,14 @@ extern tree strip_array_types PARAMS ((tree));
will always be false, since there are no destructors.) */ will always be false, since there are no destructors.) */
#define STMT_IS_FULL_EXPR_P(NODE) TREE_LANG_FLAG_1 ((NODE)) #define STMT_IS_FULL_EXPR_P(NODE) TREE_LANG_FLAG_1 ((NODE))
/* IF_STMT accessors. These give access to the condtion of the if /* IF_STMT accessors. These give access to the condition of the if
statement, the then block of the if statement, and the else block statement, the then block of the if statement, and the else block
of the if stsatement if it exists. */ of the if stsatement if it exists. */
#define IF_COND(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 0) #define IF_COND(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 0)
#define THEN_CLAUSE(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 1) #define THEN_CLAUSE(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 1)
#define ELSE_CLAUSE(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 2) #define ELSE_CLAUSE(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 2)
/* WHILE_STMT accessors. These give access to the condtion of the /* WHILE_STMT accessors. These give access to the condition of the
while statement and the body of the while statement, respectively. */ while statement and the body of the while statement, respectively. */
#define WHILE_COND(NODE) TREE_OPERAND (WHILE_STMT_CHECK (NODE), 0) #define WHILE_COND(NODE) TREE_OPERAND (WHILE_STMT_CHECK (NODE), 0)
#define WHILE_BODY(NODE) TREE_OPERAND (WHILE_STMT_CHECK (NODE), 1) #define WHILE_BODY(NODE) TREE_OPERAND (WHILE_STMT_CHECK (NODE), 1)
@ -648,7 +648,7 @@ extern tree strip_array_types PARAMS ((tree));
(SCOPE_STMT_BLOCK ((NODE)) == NULL_TREE) (SCOPE_STMT_BLOCK ((NODE)) == NULL_TREE)
/* Nonzero for a SCOPE_STMT which represents a lexical scope, but /* Nonzero for a SCOPE_STMT which represents a lexical scope, but
which should be treated as non-existant from the point of view of which should be treated as non-existent from the point of view of
running cleanup actions. */ running cleanup actions. */
#define SCOPE_NO_CLEANUPS_P(NODE) \ #define SCOPE_NO_CLEANUPS_P(NODE) \
(TREE_LANG_FLAG_3 (SCOPE_STMT_CHECK (NODE))) (TREE_LANG_FLAG_3 (SCOPE_STMT_CHECK (NODE)))

2
gcc/c-parse.in
View File

@ -2256,7 +2256,7 @@ lineno_stmt:
/* ??? We currently have no way of recording /* ??? We currently have no way of recording
the filename for a statement. This probably the filename for a statement. This probably
matters little in practice at the moment, matters little in practice at the moment,
but I suspect that problems will ocurr when but I suspect that problems will occur when
doing inlining at the tree level. */ doing inlining at the tree level. */
} }
} }

2
gcc/c-typeck.c
View File

@ -5451,7 +5451,7 @@ pop_init_level (implicit)
else if (pedantic) else if (pedantic)
pedwarn_init ("initialization of a flexible array member"); pedwarn_init ("initialization of a flexible array member");
/* We have already issued an error message for the existance /* We have already issued an error message for the existence
of a flexible array member not at the end of the structure. of a flexible array member not at the end of the structure.
Discard the initializer so that we do not abort later. */ Discard the initializer so that we do not abort later. */
if (TREE_CHAIN (constructor_fields) != NULL_TREE) if (TREE_CHAIN (constructor_fields) != NULL_TREE)

4
gcc/cfg.c
View File

@ -262,7 +262,7 @@ cached_make_edge (edge_cache, src, dst, flags)
switch (use_edge_cache) switch (use_edge_cache)
{ {
default: default:
/* Quick test for non-existance of the edge. */ /* Quick test for non-existence of the edge. */
if (! TEST_BIT (edge_cache[src->index], dst->index)) if (! TEST_BIT (edge_cache[src->index], dst->index))
break; break;
@ -569,7 +569,7 @@ dump_edge_info (file, e, do_succ)
} }
} }
/* Simple routies to easily allocate AUX fields of basic blocks. */ /* Simple routines to easily allocate AUX fields of basic blocks. */
static struct obstack block_aux_obstack; static struct obstack block_aux_obstack;
static void *first_block_aux_obj = 0; static void *first_block_aux_obj = 0;
static struct obstack edge_aux_obstack; static struct obstack edge_aux_obstack;

8
gcc/config.gcc
View File

@ -92,16 +92,16 @@
# #
# extra_programs Like extra_passes, but these are used when linking. # extra_programs Like extra_passes, but these are used when linking.
# #
# host_extra_objs List of extra host-dependant objects that should # host_extra_objs List of extra host-dependent objects that should
# be linked into the compiler proper. # be linked into the compiler proper.
# #
# host_extra_gcc_objs List of extra host-dependant objects that should # host_extra_gcc_objs List of extra host-dependent objects that should
# be linked into the gcc driver. # be linked into the gcc driver.
# #
# c_target_objs List of extra target-dependant objects that be # c_target_objs List of extra target-dependent objects that be
# linked into the C compiler only. # linked into the C compiler only.
# #
# cxx_target_objs List of extra target-dependant objects that be # cxx_target_objs List of extra target-dependent objects that be
# linked into the C++ compiler only. # linked into the C++ compiler only.
# #
# build_xm_defines List of macros to define when compiling for the # build_xm_defines List of macros to define when compiling for the

2
gcc/configure vendored
View File

@ -7911,7 +7911,7 @@ else
# -e 's|^\$(prefix)||' matches and eliminates 'prefix' from 'exec_prefix' # -e 's|^\$(prefix)||' matches and eliminates 'prefix' from 'exec_prefix'
# -e 's|/$||' match a trailing forward slash and eliminates it # -e 's|/$||' match a trailing forward slash and eliminates it
# -e 's|^[^/]|/|' forces the string to start with a forward slash (*) # -e 's|^[^/]|/|' forces the string to start with a forward slash (*)
# -e 's|/[^/]*|../|g' replaces each occurance of /<directory> with ../ # -e 's|/[^/]*|../|g' replaces each occurrence of /<directory> with ../
# #
# (*) Note this pattern overwrites the first character of the string # (*) Note this pattern overwrites the first character of the string
# with a forward slash if one is not already present. This is not a # with a forward slash if one is not already present. This is not a

2
gcc/configure.in
View File

@ -2030,7 +2030,7 @@ changequote(<<, >>)dnl
# -e 's|^\$(prefix)||' matches and eliminates 'prefix' from 'exec_prefix' # -e 's|^\$(prefix)||' matches and eliminates 'prefix' from 'exec_prefix'
# -e 's|/$||' match a trailing forward slash and eliminates it # -e 's|/$||' match a trailing forward slash and eliminates it
# -e 's|^[^/]|/|' forces the string to start with a forward slash (*) # -e 's|^[^/]|/|' forces the string to start with a forward slash (*)
# -e 's|/[^/]*|../|g' replaces each occurance of /<directory> with ../ # -e 's|/[^/]*|../|g' replaces each occurrence of /<directory> with ../
# #
# (*) Note this pattern overwrites the first character of the string # (*) Note this pattern overwrites the first character of the string
# with a forward slash if one is not already present. This is not a # with a forward slash if one is not already present. This is not a

2
gcc/except.c
View File

@ -834,7 +834,7 @@ expand_end_all_catch ()
/* End an exception region for an exception type filter. ALLOWED is a /* End an exception region for an exception type filter. ALLOWED is a
TREE_LIST of types to be matched by the runtime. FAILURE is an TREE_LIST of types to be matched by the runtime. FAILURE is an
expression to invoke if a mismatch ocurrs. expression to invoke if a mismatch occurs.
??? We could use these semantics for calls to rethrow, too; if we can ??? We could use these semantics for calls to rethrow, too; if we can
see the surrounding catch clause, we know that the exception we're see the surrounding catch clause, we know that the exception we're

2
gcc/except.h
View File

@ -72,7 +72,7 @@ extern void expand_end_all_catch PARAMS ((void));
/* End an exception region for an exception type filter. ALLOWED is a /* End an exception region for an exception type filter. ALLOWED is a
TREE_LIST of TREE_VALUE objects to be matched by the runtime. TREE_LIST of TREE_VALUE objects to be matched by the runtime.
FAILURE is a function to invoke if a mismatch ocurrs. */ FAILURE is a function to invoke if a mismatch occurs. */
extern void expand_eh_region_end_allowed PARAMS ((tree, tree)); extern void expand_eh_region_end_allowed PARAMS ((tree, tree));
/* End an exception region for a must-not-throw filter. FAILURE is a /* End an exception region for a must-not-throw filter. FAILURE is a

2
gcc/flow.c
View File

@ -2228,7 +2228,7 @@ invalidate_mems_from_autoinc (pbi, insn)
invalidate_mems_from_set (pbi, XEXP (note, 0)); invalidate_mems_from_set (pbi, XEXP (note, 0));
} }
/* EXP is a REG. Remove any dependant entries from pbi->mem_set_list. */ /* EXP is a REG. Remove any dependent entries from pbi->mem_set_list. */
static void static void
invalidate_mems_from_set (pbi, exp) invalidate_mems_from_set (pbi, exp)

2
gcc/function.c
View File

@ -7482,7 +7482,7 @@ epilogue_done:
rtx insn, next; rtx insn, next;
/* Similarly, move any line notes that appear after the epilogue. /* Similarly, move any line notes that appear after the epilogue.
There is no need, however, to be quite so anal about the existance There is no need, however, to be quite so anal about the existence
of such a note. */ of such a note. */
for (insn = epilogue_end; insn; insn = next) for (insn = epilogue_end; insn; insn = next)
{ {

8
gcc/gcc.c
View File

@ -459,7 +459,7 @@ or with constant text in a single argument.
specified to CC. Note that the tail part of the -S option specified to CC. Note that the tail part of the -S option
(i.e. the part matched by the `*') will be substituted for each (i.e. the part matched by the `*') will be substituted for each
occurrence of %* within X. occurrence of %* within X.
%{<S} remove all occurences of -S from the command line. %{<S} remove all occurrences of -S from the command line.
Note - this option is position dependent. % commands in the Note - this option is position dependent. % commands in the
spec string before this option will see -S, % commands in the spec string before this option will see -S, % commands in the
spec string after this option will not. spec string after this option will not.
@ -1458,7 +1458,7 @@ init_spec ()
(3) For each ET_DYN we're linking against (either through -lfoo (3) For each ET_DYN we're linking against (either through -lfoo
or /some/path/foo.so), check to see whether it or one of or /some/path/foo.so), check to see whether it or one of
its dependancies depends on a shared libgcc. its dependencies depends on a shared libgcc.
(4) If "-shared" (4) If "-shared"
@ -1666,7 +1666,7 @@ store_arg (arg, delete_always, delete_failure)
record_temp_file (arg, delete_always, delete_failure); record_temp_file (arg, delete_always, delete_failure);
} }
/* Load specs from a file name named FILENAME, replacing occurances of /* Load specs from a file name named FILENAME, replacing occurrences of
various different types of line-endings, \r\n, \n\r and just \r, with various different types of line-endings, \r\n, \n\r and just \r, with
a single \n. */ a single \n. */
@ -5559,7 +5559,7 @@ main (argc, argv)
xmalloc_set_program_name (programname); xmalloc_set_program_name (programname);
#ifdef GCC_DRIVER_HOST_INITIALIZATION #ifdef GCC_DRIVER_HOST_INITIALIZATION
/* Perform host dependant initialization when needed. */ /* Perform host dependent initialization when needed. */
GCC_DRIVER_HOST_INITIALIZATION; GCC_DRIVER_HOST_INITIALIZATION;
#endif #endif

14
gcc/gcse.c
View File

@ -4741,14 +4741,14 @@ pre_edge_insert (edge_list, index_map)
struct expr *expr = index_map[j]; struct expr *expr = index_map[j];
struct occr *occr; struct occr *occr;
/* Now look at each deleted occurence of this expression. */ /* Now look at each deleted occurrence of this expression. */
for (occr = expr->antic_occr; occr != NULL; occr = occr->next) for (occr = expr->antic_occr; occr != NULL; occr = occr->next)
{ {
if (! occr->deleted_p) if (! occr->deleted_p)
continue; continue;
/* Insert this expression on this edge if if it would /* Insert this expression on this edge if if it would
reach the deleted occurence in BB. */ reach the deleted occurrence in BB. */
if (!TEST_BIT (inserted[e], j)) if (!TEST_BIT (inserted[e], j))
{ {
rtx insn; rtx insn;
@ -5693,7 +5693,7 @@ hoist_code ()
hoistable++; hoistable++;
} }
/* If we found more than one hoistable occurence of this /* If we found more than one hoistable occurrence of this
expression, then note it in the bitmap of expressions to expression, then note it in the bitmap of expressions to
hoist. It makes no sense to hoist things which are computed hoist. It makes no sense to hoist things which are computed
in only one BB, and doing so tends to pessimize register in only one BB, and doing so tends to pessimize register
@ -5744,7 +5744,7 @@ hoist_code ()
/* The expression is computed in the dominated block and /* The expression is computed in the dominated block and
it would be safe to compute it at the start of the it would be safe to compute it at the start of the
dominated block. Now we have to determine if the dominated block. Now we have to determine if the
expresion would reach the dominated block if it was expression would reach the dominated block if it was
placed at the end of BB. */ placed at the end of BB. */
if (hoist_expr_reaches_here_p (BASIC_BLOCK (bb), i, if (hoist_expr_reaches_here_p (BASIC_BLOCK (bb), i,
BASIC_BLOCK (dominated), NULL)) BASIC_BLOCK (dominated), NULL))
@ -5754,7 +5754,7 @@ hoist_code ()
rtx insn; rtx insn;
rtx set; rtx set;
/* Find the right occurence of this expression. */ /* Find the right occurrence of this expression. */
while (BLOCK_NUM (occr->insn) != dominated && occr) while (BLOCK_NUM (occr->insn) != dominated && occr)
occr = occr->next; occr = occr->next;
@ -5856,7 +5856,7 @@ one_code_hoisting_pass ()
load towards the exit, and we end up with no loads or stores of 'i' load towards the exit, and we end up with no loads or stores of 'i'
in the loop. */ in the loop. */
/* This will search the ldst list for a matching expresion. If it /* This will search the ldst list for a matching expression. If it
doesn't find one, we create one and initialize it. */ doesn't find one, we create one and initialize it. */
static struct ls_expr * static struct ls_expr *
@ -6767,7 +6767,7 @@ insert_store (expr, e)
/* If we are inserting this expression on ALL predecessor edges of a BB, /* If we are inserting this expression on ALL predecessor edges of a BB,
insert it at the start of the BB, and reset the insert bits on the other insert it at the start of the BB, and reset the insert bits on the other
edges so we don;t try to insert it on the other edges. */ edges so we don't try to insert it on the other edges. */
bb = e->dest; bb = e->dest;
for (tmp = e->dest->pred; tmp ; tmp = tmp->pred_next) for (tmp = e->dest->pred; tmp ; tmp = tmp->pred_next)
{ {

2
gcc/genrecog.c
View File

@ -1200,7 +1200,7 @@ maybe_both_true_1 (d1, d2)
struct decision_test *t1, *t2; struct decision_test *t1, *t2;
/* A match_operand with no predicate can match anything. Recognize /* A match_operand with no predicate can match anything. Recognize
this by the existance of a lone DT_accept_op test. */ this by the existence of a lone DT_accept_op test. */
if (d1->type == DT_accept_op || d2->type == DT_accept_op) if (d1->type == DT_accept_op || d2->type == DT_accept_op)
return 1; return 1;

2
gcc/libgcc2.c
View File

@ -2080,7 +2080,7 @@ __bb_init_prg (void)
malloc (BB_BUCKETS * sizeof (struct bb_edge *)); malloc (BB_BUCKETS * sizeof (struct bb_edge *));
if (bb_hashbuckets) if (bb_hashbuckets)
/* Use a loop here rather than calling bzero to avoid having to /* Use a loop here rather than calling bzero to avoid having to
conditionalize its existance. */ conditionalize its existence. */
for (i = 0; i < BB_BUCKETS; i++) for (i = 0; i < BB_BUCKETS; i++)
bb_hashbuckets[i] = 0; bb_hashbuckets[i] = 0;
} }

8
gcc/loop.c
View File

@ -6480,7 +6480,7 @@ combine_givs_p (g1, g2)
{ {
rtx comb, ret; rtx comb, ret;
/* With the introduction of ext dependant givs, we must care for modes. /* With the introduction of ext dependent givs, we must care for modes.
G2 must not use a wider mode than G1. */ G2 must not use a wider mode than G1. */
if (GET_MODE_SIZE (g1->mode) < GET_MODE_SIZE (g2->mode)) if (GET_MODE_SIZE (g1->mode) < GET_MODE_SIZE (g2->mode))
return NULL_RTX; return NULL_RTX;
@ -6526,7 +6526,7 @@ combine_givs_p (g1, g2)
return NULL_RTX; return NULL_RTX;
} }
/* Check each extension dependant giv in this class to see if its /* Check each extension dependent giv in this class to see if its
root biv is safe from wrapping in the interior mode, which would root biv is safe from wrapping in the interior mode, which would
make the giv illegal. */ make the giv illegal. */
@ -6658,7 +6658,7 @@ check_ext_dependant_givs (bl, loop_info)
if (loop_dump_stream) if (loop_dump_stream)
{ {
fprintf (loop_dump_stream, fprintf (loop_dump_stream,
"Verified ext dependant giv at %d of reg %d\n", "Verified ext dependent giv at %d of reg %d\n",
INSN_UID (v->insn), bl->regno); INSN_UID (v->insn), bl->regno);
} }
} }
@ -6681,7 +6681,7 @@ check_ext_dependant_givs (bl, loop_info)
} }
fprintf (loop_dump_stream, fprintf (loop_dump_stream,
"Failed ext dependant giv at %d, %s\n", "Failed ext dependent giv at %d, %s\n",
INSN_UID (v->insn), why); INSN_UID (v->insn), why);
} }
v->ignore = 1; v->ignore = 1;

2
gcc/loop.h
View File

@ -136,7 +136,7 @@ struct induction
derives another. This occurs when the derives another. This occurs when the
giv spans a biv update by incrementation. */ giv spans a biv update by incrementation. */
rtx ext_dependant; /* If nonzero, is a sign or zero extension rtx ext_dependant; /* If nonzero, is a sign or zero extension
if a biv on which this giv is dependant. */ if a biv on which this giv is dependent. */
struct induction *next_iv; /* For givs, links together all givs that are struct induction *next_iv; /* For givs, links together all givs that are
based on the same biv. For bivs, links based on the same biv. For bivs, links
together all biv entries that refer to the together all biv entries that refer to the

4
gcc/params.def
View File

@ -69,9 +69,9 @@ DEFPARAM(PARAM_MAX_DELAY_SLOT_LIVE_SEARCH,
333) 333)
/* This parameter limits the number of branch elements that the /* This parameter limits the number of branch elements that the
scheduler will track anti-dependancies through without resetting scheduler will track anti-dependencies through without resetting
the tracking mechanism. Large functions with few calls or barriers the tracking mechanism. Large functions with few calls or barriers
can generate lists containing many 1000's of dependancies. Generally can generate lists containing many 1000's of dependencies. Generally
the compiler either uses all available memory, or runs for far too long. */ the compiler either uses all available memory, or runs for far too long. */
DEFPARAM(PARAM_MAX_PENDING_LIST_LENGTH, DEFPARAM(PARAM_MAX_PENDING_LIST_LENGTH,
"max-pending-list-length", "max-pending-list-length",

2
gcc/predict.def
View File

@ -46,7 +46,7 @@ DEF_PREDICTOR (PRED_DS_THEORY, "DS theory", PROB_ALWAYS, 0)
matching heuristics from this list. */ matching heuristics from this list. */
DEF_PREDICTOR (PRED_FIRST_MATCH, "first match", PROB_ALWAYS, 0) DEF_PREDICTOR (PRED_FIRST_MATCH, "first match", PROB_ALWAYS, 0)
/* Heuristic applying when no heuristic bellow applies. */ /* Heuristic applying when no heuristic below applies. */
DEF_PREDICTOR (PRED_NO_PREDICTION, "no prediction", PROB_ALWAYS, 0) DEF_PREDICTOR (PRED_NO_PREDICTION, "no prediction", PROB_ALWAYS, 0)
/* Mark unconditional jump as taken. */ /* Mark unconditional jump as taken. */

2
gcc/predict.h
View File

@ -38,7 +38,7 @@ extern void predict_insn_def PARAMS ((rtx, enum br_predictor,
enum prediction)); enum prediction));
extern void predict_insn PARAMS ((rtx, enum br_predictor, int)); extern void predict_insn PARAMS ((rtx, enum br_predictor, int));
/* Avoid unneeded dependancy on basic_block.h */ /* Avoid unneeded dependency on basic_block.h */
#ifdef BASIC_BLOCK #ifdef BASIC_BLOCK
extern void predict_edge PARAMS ((edge, enum br_predictor, int)); extern void predict_edge PARAMS ((edge, enum br_predictor, int));
extern void predict_edge_def PARAMS ((edge, enum br_predictor, extern void predict_edge_def PARAMS ((edge, enum br_predictor,

2
gcc/reg-stack.c
View File

@ -2626,7 +2626,7 @@ convert_regs_1 (file, block)
/* Find the edge we will copy stack from. It should be the most frequent /* Find the edge we will copy stack from. It should be the most frequent
one as it will get cheapest after compensation code is generated, one as it will get cheapest after compensation code is generated,
if multiple such exists, take one with largest count, preffer critical if multiple such exists, take one with largest count, prefer critical
one (as splitting critical edges is more expensive), or one with lowest one (as splitting critical edges is more expensive), or one with lowest
index, to avoid random changes with different orders of the edges. */ index, to avoid random changes with different orders of the edges. */
for (e = block->pred; e ; e = e->pred_next) for (e = block->pred; e ; e = e->pred_next)

2
gcc/regmove.c
View File

@ -2372,7 +2372,7 @@ combine_stack_adjustments_for_block (bb)
or a deallocation into the second insn. We can not or a deallocation into the second insn. We can not
combine an allocation followed by a deallocation. combine an allocation followed by a deallocation.
The only somewhat frequent ocurrence of the later is when The only somewhat frequent occurrence of the later is when
a function allocates a stack frame but does not use it. a function allocates a stack frame but does not use it.
For this case, we would need to analyze rtl stream to be For this case, we would need to analyze rtl stream to be
sure that allocated area is really unused. This means not sure that allocated area is really unused. This means not

2
gcc/sched-deps.c
View File

@ -1017,7 +1017,7 @@ sched_analyze_insn (deps, x, insn, loop_notes)
sched_analyze_2 (deps, COND_EXEC_TEST (x), insn); sched_analyze_2 (deps, COND_EXEC_TEST (x), insn);
/* ??? Should be recording conditions so we reduce the number of /* ??? Should be recording conditions so we reduce the number of
false dependancies. */ false dependencies. */
x = COND_EXEC_CODE (x); x = COND_EXEC_CODE (x);
code = GET_CODE (x); code = GET_CODE (x);
} }

2
gcc/sched-int.h
View File

@ -162,7 +162,7 @@ extern struct sched_info *current_sched_info;
struct haifa_insn_data struct haifa_insn_data
{ {
/* A list of insns which depend on the instruction. Unlike LOG_LINKS, /* A list of insns which depend on the instruction. Unlike LOG_LINKS,
it represents forward dependancies. */ it represents forward dependencies. */
rtx depend; rtx depend;
/* The line number note in effect for each insn. For line number /* The line number note in effect for each insn. For line number

2
gcc/sibcall.c
View File

@ -429,7 +429,7 @@ uses_addressof (x)
} }
/* Scan the sequence of insns in SEQ to see if any have an ADDRESSOF /* Scan the sequence of insns in SEQ to see if any have an ADDRESSOF
rtl expression or current_function_internal_arg_pointer occurences rtl expression or current_function_internal_arg_pointer occurrences
not enclosed within a MEM. If an ADDRESSOF expression or not enclosed within a MEM. If an ADDRESSOF expression or
current_function_internal_arg_pointer is found, return nonzero, otherwise current_function_internal_arg_pointer is found, return nonzero, otherwise
return zero. return zero.

2
gcc/ssa.c
View File

@ -1231,7 +1231,7 @@ ephi_add_node (reg, nodes, n_nodes)
/* Part one of the topological sort. This is a forward (downward) search /* Part one of the topological sort. This is a forward (downward) search
through the graph collecting a stack of nodes to process. Assuming no through the graph collecting a stack of nodes to process. Assuming no
cycles, the nodes at top of the stack when we are finished will have cycles, the nodes at top of the stack when we are finished will have
no other dependancies. */ no other dependencies. */
static int * static int *
ephi_forward (t, visited, succ, tstack) ephi_forward (t, visited, succ, tstack)

2
gcc/stringpool.c
View File

@ -18,7 +18,7 @@ along with GCC; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA Software Foundation, 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA. */ 02111-1307, USA. */
/* String text, identifer text and identifier node allocator. Strings /* String text, identifier text and identifier node allocator. Strings
allocated by ggc_alloc_string are stored in an obstack which is allocated by ggc_alloc_string are stored in an obstack which is
never shrunk. Identifiers are uniquely stored in a hash table. never shrunk. Identifiers are uniquely stored in a hash table.

6
gcc/toplev.c
View File

@ -1119,7 +1119,7 @@ lang_independent_options f_options[] =
{"rename-registers", &flag_rename_registers, 1, {"rename-registers", &flag_rename_registers, 1,
N_("Do the register renaming optimization pass") }, N_("Do the register renaming optimization pass") },
{"common", &flag_no_common, 0, {"common", &flag_no_common, 0,
N_("Do not put unitialised globals in the common section") }, N_("Do not put uninitialized globals in the common section") },
{"inhibit-size-directive", &flag_inhibit_size_directive, 1, {"inhibit-size-directive", &flag_inhibit_size_directive, 1,
N_("Do not generate .size directives") }, N_("Do not generate .size directives") },
{"function-sections", &flag_function_sections, 1, {"function-sections", &flag_function_sections, 1,
@ -1539,7 +1539,7 @@ lang_independent_options W_options[] =
{"unreachable-code", &warn_notreached, 1, {"unreachable-code", &warn_notreached, 1,
N_("Warn about code that will never be executed") }, N_("Warn about code that will never be executed") },
{"uninitialized", &warn_uninitialized, 1, {"uninitialized", &warn_uninitialized, 1,
N_("Warn about unitialized automatic variables") }, N_("Warn about uninitialized automatic variables") },
{"inline", &warn_inline, 1, {"inline", &warn_inline, 1,
N_("Warn when an inlined function cannot be inlined") }, N_("Warn when an inlined function cannot be inlined") },
{"packed", &warn_packed, 1, {"packed", &warn_packed, 1,
@ -1719,7 +1719,7 @@ set_float_handler (handler)
pointer FN, and one argument DATA. DATA is usually a struct which pointer FN, and one argument DATA. DATA is usually a struct which
contains the real input and output for function FN. This function contains the real input and output for function FN. This function
returns 0 (failure) if longjmp was called (i.e. an exception returns 0 (failure) if longjmp was called (i.e. an exception
occured.) It returns 1 (success) otherwise. */ occurred.) It returns 1 (success) otherwise. */
int int
do_float_handler (fn, data) do_float_handler (fn, data)

4
gcc/tree.c
View File

@ -2765,8 +2765,8 @@ is_attribute_p (attr, ident)
/* Given an attribute name and a list of attributes, return a pointer to the /* Given an attribute name and a list of attributes, return a pointer to the
attribute's list element if the attribute is part of the list, or NULL_TREE attribute's list element if the attribute is part of the list, or NULL_TREE
if not found. If the attribute appears more than once, this only if not found. If the attribute appears more than once, this only
returns the first occurance; the TREE_CHAIN of the return value should returns the first occurrence; the TREE_CHAIN of the return value should
be passed back in if further occurances are wanted. */ be passed back in if further occurrences are wanted. */
tree tree
lookup_attribute (attr_name, list) lookup_attribute (attr_name, list)

2
gcc/unroll.c
View File

@ -3669,7 +3669,7 @@ loop_iterations (loop)
increment = fold_rtx_mult_add (v->mult_val, increment = fold_rtx_mult_add (v->mult_val,
extend_value_for_giv (v, increment), extend_value_for_giv (v, increment),
const0_rtx, v->mode); const0_rtx, v->mode);
/* The caller assumes that one full increment has occured at the /* The caller assumes that one full increment has occurred at the
first loop test. But that's not true when the biv is incremented first loop test. But that's not true when the biv is incremented
after the giv is set (which is the usual case), e.g.: after the giv is set (which is the usual case), e.g.:
i = 6; do {;} while (i++ < 9) . i = 6; do {;} while (i++ < 9) .