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/gcc.texi: Document use of "dependent" and American spelling.
(c_expand_body): Measure time.
* toplev.c (rest_of_compilation): Measure time of mode switching
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.
(lang_independent_options): Add asynchronous-unwind-tables
64bit operations require split on 64bit machine.
(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;
move long constants to register.
(x86_initialize_trampoline): Fix mode.
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.
2001-08-31 Nick Clifton <nickc@cambridge.redhat.com>
2001-07-26 Andrew MacLeod <amacleod@redhat.com>
* 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.
* sched-int.h (struct deps): Add pending_flush_length field.
* sched-deps.c (flush_pending_lists): Last_pending_memory_flush now
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
* alpha.h: ... here.
* 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.
* i386/x-cygwin32 (CLIB): Link in advapi32.
* cpphash.c (collect_expansion, macroexpand,
push_macro_expansion): Make the escape character in macro
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.
* cpplib.c (skip_comment, copy_comment, cpp_skip_hspace,
copy_rest_of_line, cpp_get_token, parse_string,
* c-common.c (decl_attributes): Call PRAGMA_INSERT_ATTRIBUTES
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.
* varasm.c: Move definition of 'struct weak_syms' into
(reg_or_cmp_int16_operand): New predicate function.
(extend_operand): New predicate 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_reorder): New scheduling function.
(m32r_sched_variable_issue): New scheduling function.
(record_reg_life_pat, record_reg_life, find_blocks): Remove.
(nan): New.
(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.
(check_asm_stack_operands): Renamed from record_asm_reg_life.
Return false if the asm doesn't use stack regs. Don't do life
prototypes.
* toplev.c (rest_of_compilation): Initialize node cache.
* 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>
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.
Thu Jul 8 16:50:14 1999 Nick Clifton <nickc@cygnus.com>
(do_import): Likewise.
(do_include_next): Likewise.
(gcc_pragmas): Add dependency pragma.
- (do_pragma_dependancy): New pragma.
+ (do_pragma_dependency): New pragma.
2000-06-29 Jason Merrill <jason@redhat.com>
* fold-const.c (extract_muldiv): When constructing a
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>
* Makefile.in (libgcc.a, stmp-multilib): Depend on FPBIT and DPBIT.
* 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>
* config/ia64/ia64.h (predicate_operator): Declare.
* config/ia64/ia64.md (extendsfdf2): Split the nop case out
- of existance.
+ of existence.
* gensupport.c (process_rtx): Copy and post-process each member
of the define_insn rtvec individually.
(add_pure_or_virtual_attribute, gen_enumeration_type_die): Likewise.
* dwarfout.c: Similar changes to dwarf2out.c.
* 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.
(scan_operands): Reflect above changes.
* sdbout.c (plain_type_1): Use host_integerp and tree_low_cst.
flag_data_sections or UNIQUE_SECTION_P are true.
* 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
being called for uninitialised data.
* regrename.c: Rewrite to handle multi-register modes and
cond_exec instructions.
- * Makefile.in (regrename.o): Update dependancies.
+ * Makefile.in (regrename.o): Update dependencies.
* recog.h (struct operand_alternative): Add is_address.
* recog.c (preprocess_constraints) [case 'p']: Set it.
(unroll_loop): Drop prediction notes on preconditioning.
* predict.def (PRED_LOOP_PRECONDITIONG, PRED_LOOP_CONDITION):
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.
Mon Jun 18 17:26:56 CEST 2001 Jan Hubicka <jh@suse.cz>
(strength_reduce): Drop branch prediction note in case
number of iterations is known.
* 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>
* jump.c: Include predict.h
(duplicate_loop_exit_test): Drop branch prediction notes.
(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.
* combine.c (distribute_notes): Handle BR_PRED.
* c-common.h (ASM_INPUT_P): New.
* c-parse.in (asm): Set it when needed.
* 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>
(xcoffout_begin_function): Call dbxout_parms and
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.
* mips/abi64.h (CPP_SPEC): Output -D__mips64 when -mips3, or -mips4,
or -mgp64. Output -U__mips64 when -mgp32.
* 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.
* objc/sendmsg.c: Likewise.
(__alpha__): Remove unneeded code.
(objc_error): Allow user specified error handler function to
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
function with call to objc_error function.
(objc_valloc, objc_realloc, objc_calloc): Likewise.
Sat Oct 26 13:59:05 1996 Richard Kenner (kenner@vlsi1.ultra.nyu.edu)
* 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.
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,
TREE_CHAIN (DECL_SAVED_TREE (current_function_decl)));
body = build_stmt (COMPOUND_STMT, body);
will always be false, since there are no destructors.) */
#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
of the if stsatement 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)
-/* 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. */
#define WHILE_COND(NODE) TREE_OPERAND (WHILE_STMT_CHECK (NODE), 0)
#define WHILE_BODY(NODE) TREE_OPERAND (WHILE_STMT_CHECK (NODE), 1)
(SCOPE_STMT_BLOCK ((NODE)) == NULL_TREE)
/* 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. */
#define SCOPE_NO_CLEANUPS_P(NODE) \
(TREE_LANG_FLAG_3 (SCOPE_STMT_CHECK (NODE)))
/* ??? We currently have no way of recording
the filename for a statement. This probably
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. */
}
}
else if (pedantic)
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.
Discard the initializer so that we do not abort later. */
if (TREE_CHAIN (constructor_fields) != NULL_TREE)
switch (use_edge_cache)
{
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))
break;
}
}
\f
-/* 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 void *first_block_aux_obj = 0;
static struct obstack edge_aux_obstack;
#
# 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.
#
-# 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.
#
-# 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.
#
-# 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.
#
# build_xm_defines List of macros to define when compiling for the
# -e 's|^\$(prefix)||' matches and eliminates 'prefix' from 'exec_prefix'
# -e 's|/$||' match a trailing forward slash and eliminates it
# -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
# with a forward slash if one is not already present. This is not a
# -e 's|^\$(prefix)||' matches and eliminates 'prefix' from 'exec_prefix'
# -e 's|/$||' match a trailing forward slash and eliminates it
# -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
# with a forward slash if one is not already present. This is not 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
- 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
see the surrounding catch clause, we know that the exception we're
/* End an exception region for an exception type filter. ALLOWED is a
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));
/* End an exception region for a must-not-throw filter. FAILURE is a
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
invalidate_mems_from_set (pbi, exp)
rtx insn, next;
/* 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. */
for (insn = epilogue_end; insn; insn = next)
{
specified to CC. Note that the tail part of the -S option
(i.e. the part matched by the `*') will be substituted for each
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
spec string before this option will see -S, % commands in the
spec string after this option will not.
(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
- its dependancies depends on a shared libgcc.
+ its dependencies depends on a shared libgcc.
(4) If "-shared"
record_temp_file (arg, delete_always, delete_failure);
}
\f
-/* 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
a single \n. */
xmalloc_set_program_name (programname);
#ifdef GCC_DRIVER_HOST_INITIALIZATION
- /* Perform host dependant initialization when needed. */
+ /* Perform host dependent initialization when needed. */
GCC_DRIVER_HOST_INITIALIZATION;
#endif
struct expr *expr = index_map[j];
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)
{
if (! occr->deleted_p)
continue;
/* 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))
{
rtx insn;
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
hoist. It makes no sense to hoist things which are computed
in only one BB, and doing so tends to pessimize register
/* The expression is computed in the dominated block and
it would be safe to compute it at the start of 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. */
if (hoist_expr_reaches_here_p (BASIC_BLOCK (bb), i,
BASIC_BLOCK (dominated), NULL))
rtx insn;
rtx set;
- /* Find the right occurence of this expression. */
+ /* Find the right occurrence of this expression. */
while (BLOCK_NUM (occr->insn) != dominated && occr)
occr = occr->next;
load towards the exit, and we end up with no loads or stores of 'i'
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. */
static struct ls_expr *
/* 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
- 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;
for (tmp = e->dest->pred; tmp ; tmp = tmp->pred_next)
{
struct decision_test *t1, *t2;
/* 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)
return 1;
malloc (BB_BUCKETS * sizeof (struct bb_edge *));
if (bb_hashbuckets)
/* 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++)
bb_hashbuckets[i] = 0;
}
{
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. */
if (GET_MODE_SIZE (g1->mode) < GET_MODE_SIZE (g2->mode))
return NULL_RTX;
return NULL_RTX;
}
\f
-/* 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
make the giv illegal. */
if (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);
}
}
}
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);
}
v->ignore = 1;
derives another. This occurs when the
giv spans a biv update by incrementation. */
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
based on the same biv. For bivs, links
together all biv entries that refer to the
333)
/* 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
- 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. */
DEFPARAM(PARAM_MAX_PENDING_LIST_LENGTH,
"max-pending-list-length",
matching heuristics from this list. */
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)
/* Mark unconditional jump as taken. */
enum prediction));
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
extern void predict_edge PARAMS ((edge, enum br_predictor, int));
extern void predict_edge_def PARAMS ((edge, enum br_predictor,
/* 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,
- 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
index, to avoid random changes with different orders of the edges. */
for (e = block->pred; e ; e = e->pred_next)
or a deallocation into the second insn. We can not
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.
For this case, we would need to analyze rtl stream to be
sure that allocated area is really unused. This means not
sched_analyze_2 (deps, COND_EXEC_TEST (x), insn);
/* ??? Should be recording conditions so we reduce the number of
- false dependancies. */
+ false dependencies. */
x = COND_EXEC_CODE (x);
code = GET_CODE (x);
}
struct haifa_insn_data
{
/* A list of insns which depend on the instruction. Unlike LOG_LINKS,
- it represents forward dependancies. */
+ it represents forward dependencies. */
rtx depend;
/* The line number note in effect for each insn. For line number
}
/* 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
current_function_internal_arg_pointer is found, return nonzero, otherwise
return zero.
/* Part one of the topological sort. This is a forward (downward) search
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
- no other dependancies. */
+ no other dependencies. */
static int *
ephi_forward (t, visited, succ, tstack)
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
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
never shrunk. Identifiers are uniquely stored in a hash table.
{"rename-registers", &flag_rename_registers, 1,
N_("Do the register renaming optimization pass") },
{"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,
N_("Do not generate .size directives") },
{"function-sections", &flag_function_sections, 1,
{"unreachable-code", &warn_notreached, 1,
N_("Warn about code that will never be executed") },
{"uninitialized", &warn_uninitialized, 1,
- N_("Warn about unitialized automatic variables") },
+ N_("Warn about uninitialized automatic variables") },
{"inline", &warn_inline, 1,
N_("Warn when an inlined function cannot be inlined") },
{"packed", &warn_packed, 1,
pointer FN, and one argument DATA. DATA is usually a struct which
contains the real input and output for function FN. This function
returns 0 (failure) if longjmp was called (i.e. an exception
- occured.) It returns 1 (success) otherwise. */
+ occurred.) It returns 1 (success) otherwise. */
int
do_float_handler (fn, data)
/* 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
if not found. If the attribute appears more than once, this only
- returns the first occurance; the TREE_CHAIN of the return value should
- be passed back in if further occurances are wanted. */
+ returns the first occurrence; the TREE_CHAIN of the return value should
+ be passed back in if further occurrences are wanted. */
tree
lookup_attribute (attr_name, list)
increment = fold_rtx_mult_add (v->mult_val,
extend_value_for_giv (v, increment),
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
after the giv is set (which is the usual case), e.g.:
i = 6; do {;} while (i++ < 9) .
projects / thirdparty / gcc.git / commitdiff
