+2001-11-11 Joseph S. Myers <jsm28@cam.ac.uk>
+
+ * ChangeLog.2, ChangeLog.3, ChangeLog.4, ChangeLog.5, ChangeLog,
+ cfg.c, cfganal.c, cfgcleanup.c, cfglayout.c, cfgloop.c, cfgrtl.c,
+ collect2.c, combine.c, config.in, configure, configure.in,
+ conflict.c, dwarf2out.c, dwarfout.c, except.c, final.c, flow.c,
+ genattrtab.c, ggc-page.c, jump.c, lcm.c, predict.c, reg-stack.c,
+ reload1.c, rtlanal.c, sched-rgn.c, toplev.c, unwind-dw2-fde.h: Fix
+ spelling errors.
+
Sun Nov 11 05:56:01 2001 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
* config/rs6000/rs6000.c (rs6000_hash_constant, toc_hash_eq):
Mon Nov 5 16:15:25 CET 2001 Jan Hubicka <jh@suse.cz>
- * Makefile.in (bb-reoder.o): Add depdendency on cfglayout.h;
- remove unneded depdendencies;
+ * Makefile.in (bb-reoder.o): Add dependency on cfglayout.h;
+ remove unneeded dependencies;
(cfglayout.o): New.
* cfglayout.c, cfglayout.h: New files; break out from ...
* bb-reorder.c: ... here; Remove unneeded includes;
2001-10-26 Christopher Faylor <cgf@redhat.com>
- * config/i386/cygwin.h: Search target specfic include directory, if
+ * config/i386/cygwin.h: Search target specific include directory, if
appropriate.
2001-10-25 Kaveh R. Ghazi <ghazi@caip.rutgers.edu>
* alias.c (loop_p): Remove.
(mark_constant_function): Use mark_dfs_back_edges.
- * reg-stack.c (block_info_def): Add predecesors counter and stack_out.
- (reg_to_stack): Call mark_dfs_back_edges; count the predecesors.
+ * reg-stack.c (block_info_def): Add predecessors counter and stack_out.
+ (reg_to_stack): Call mark_dfs_back_edges; count the predecessors.
(compensate_edge): Break out from ...
(convert_regs_1): ... here; do smart choosing of stack_out to copy.
(convert_regs_2): Set block_done once block is really done;
- Do updating of the predecesors counts.
+ Do updating of the predecessors counts.
* toplev.c (rest_of_compilation): Recompute block_for_insn
before post-reload cfg_cleanup.
* toplev.c (rest_of_compilation): Conditionally call purge_all_dead_edges
after combine.
* gcse.c (cprop_cc0_jump, cprop_insn): New argument "basic_block".
- (cprop_jump): Likewise; call purge_dead_edges if substitution suceeded.
+ (cprop_jump): Likewise; call purge_dead_edges if substitution succeeded.
2001-07-23 Hans-Peter Nilsson <hp@bitrange.com>
redirect_edge_and_branch, block_label, forwarder_block_p): Make global.
(redirect_edge_and_branch_force): Fix copying of lifeness information.
(block_label): Handle EXIT_BLOCK_PTR by returning NULL.
- * ifcvt.c (dead_or_predictable): Take BB as an new destionation
+ * ifcvt.c (dead_or_predictable): Take BB as an new destination
instead of label; update CFG after transformation.
(find_if_case_1): Update call, use redirect_edge_and_branch_force
for finishing the transformation; handle even case where ELSE
* dwarf2out.c (DWARF2_ASM_LINE_DEBUG_INFO): Add default definition.
(debug_dwarf): Add DWARF2_ASM_LINE_DEBUG_INFO support.
(dwarf2out_line, dwarf2out_finish): Likewise.
- * tm.texi (DWARF2_ASM_LINE_DEBUG_INFO): Add documetation.
+ * tm.texi (DWARF2_ASM_LINE_DEBUG_INFO): Add documentation.
Thu Aug 26 16:10:56 1999 Gavin Romig-Koch <gavin@cygnus.com>
* i960.h (BUILD_VA_LIST_TYPE): New.
(EXPAND_BUILTIN_VA_START): New.
(EXPAND_BUILTIN_VA_ARG): New.
- * i960.md (store_multiple): Use change_address on individul mems.
+ * i960.md (store_multiple): Use change_address on individual mems.
Mon Jul 26 22:43:12 1999 Richard Henderson <rth@cygnus.com>
(rtx_needs_barrier): Handle COND_EXEC.
* config/ia64/ia64.h (BRANCH_COST): Define.
(PREDICATE_CODES): Update.
- * config/ia64/ia64.md: Docuement used unspec values.
+ * config/ia64/ia64.md: Document used unspec values.
(attr predicable): New.
(movxf, movxf_internal): New.
(extendsfdf2): Don't comment out nop.
(diagnostic.h): #include.
(struct output_buffer): Move into diagnostic.h.
(get_output_prefix): Rename to output_get_prefix. Export.
- (init_output_buffer): Export. Break out. Ajust intialization.
+ (init_output_buffer): Export. Break out. Adjust initialization.
(output_space_left, output_append): Export.
(output_newline): Rename to output_add_newline. Export.
(output_clear): Nullify additional output_buffer fields.
(vline_wrapper_message_with_location): Ditto.
(v_message_with_decl): Ditto. Adjust call to output_puts
and get_output_prefix.
- (default_print_error_function): Adjust buffer intialization.
+ (default_print_error_function): Adjust buffer initialization.
Sat Apr 22 06:45:04 2000 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
Mon Apr 17 14:59:36 MET DST 2000 Jan Hubicka <jh@suse.cz>
- * cse.c (struct check_depdendence_data): New.
+ * cse.c (struct check_dependence_data): New.
(check_dependence): New function.
(invalidate): Use check_depdenence.
message in quotes. Otherwise, IBM's make program treats the '#' as the
start of a comment and ignores the remainder of the line.
- * c-lex.c (yylex): Change for EBCDIC, lower case characters preceed
+ * c-lex.c (yylex): Change for EBCDIC, lower case characters precede
upper case.
* cccp.c (initialize_char_syntax): Allow for holes in EBCDIC.
* cexp.y (initialize_random_junk): Likewise.
(real_hex_to_f): Use it.
* real.c (CHARMASK): New.
(etoasc, asctoeg): Use it.
- (asctoeg): EBCDIC lower case characters preceed upper case.
+ (asctoeg): EBCDIC lower case characters precede upper case.
* i370.c (mvs_add_label): Change spacing for coding conventions.
* i370.h (ASM_OUTPUT_CASE_LABEL): Change to the data CSECT for the
(compute_coalesced_reg_partition): New function.
(coalesce_regs_in_copies): Likewise.
(coalesce_reg_in_phi): Likewise.
- (coalesce_regs_in_sucessor_phi_nodes): Likewise.
+ (coalesce_regs_in_successor_phi_nodes): Likewise.
(for_each_successor_phi): Likewise.
(rename_context): New struct.
(rename_block): Use a rename_context with rename_insn_1. When
* function.c (assign_parms): Make thisparm_boundary unsigned.
* genrecog.c (write_switch): Cast XWINT result to int.
* lcm.c: Many static fcns and vars now #ifdef OPTIMIZE_MODE_SWITCHING.
- * mips-tfile.c (init_file): Make two versions of FDR intializer:
+ * mips-tfile.c (init_file): Make two versions of FDR initializer:
one for MIPS and one for Alpha.
(get_tag, copy_object): Add casts to avoid warnings.
* optabs.c (init_one_libfunc): Cast NAME to (char *).
* genrecog.c (add_to_sequence): Remove special case for
const_int_operand.
(maybe_both_true): Return 1 when falling out of sequence when
- trying to find common possition in the pattern.
+ trying to find common position in the pattern.
Fri Dec 15 14:44:51 MET 2000 Jan Hubicka <jh@suse.cz>
(lang_diagnostic_starter, lang_diagnostic_finalizer): New objects.
(error_module_changed, record_last_error_module,
error_function_changed, record_last_error_function): New functions.
- (initialize_diagnostics): Default intialize
+ (initialize_diagnostics): Default initialize
lang_diagnostic_starter, lang_diagnostic_finalizer.
(init_output_buffer): Tweak.
(file_name_as_prefix): New function.
(and?i splitters): Use ext_register_operands.
(test?i peep2): Remove ignored constraints.
* i386.c (ext_register_operand): Check that operand is
- eighter pseudo or hard or 'Q' register.
+ either pseudo or hard or 'Q' register.
Sat Jun 2 06:53:50 2001 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
Fri May 18 22:42:04 CEST 2001 Jan Hubicka <jh@suse.cz>
* combine.c (combine_simplify_rtx): Clear op0_mode if simplification
- suceeded.
+ succeeded.
Fri May 18 07:26:34 2001 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
DJ Delorie <dj@redhat.com>
* jump.c (jump_optimize_1): When we delete a conditional jump
- preceeding a non-conditional jump to effectively the same place,
+ preceding a non-conditional jump to effectively the same place,
make sure that the combined jump skips any clobber insns between
the two labels.
* i386.c (ix86_comparison_operator, fcmov_comparison_operator,
put_condition_code): Convert fp comparison codes to integer
before handling.
- (ix86_expand_fp_compare): Postnote the fp comparison code converison
+ (ix86_expand_fp_compare): Postnote the fp comparison code conversion
to final.
* i386.c (unsigned_comparison, no_comparison_operator): Kill.
make_edge, make_single_succ_edge, cached_make_edge, remove_edge
- Low level edge redirection (without updating instruction chain)
redirect_edge_succ, redirect_edge_succ_nodup, redirect_edge_pred
- - Dumpipng and debugging
+ - Dumping and debugging
dump_flow_info, debug_flow_info, dump_edge_info
- Allocation of AUX fields for basic blocks
alloc_aux_for_blocks, free_aux_for_blocks, alloc_aux_for_block
void debug_flow_info PARAMS ((void));
static void free_edge PARAMS ((edge));
\f
-/* Called once at intialization time. */
+/* Called once at initialization time. */
void
init_flow ()
return cached_make_edge (NULL, src, dest, flags);
}
-/* Create an edge connecting SRC to DEST and set probability by knowling
+/* Create an edge connecting SRC to DEST and set probability by knowing
that it is the single edge leaving SRC. */
edge
e->dest = new_succ;
}
-/* Like previous but avoid possible dupplicate edge. */
+/* Like previous but avoid possible duplicate edge. */
edge
redirect_edge_succ_nodup (e, new_succ)
/* Add fake edges to the function exit for any non constant and non noreturn
calls, volatile inline assembly in the bitmap of blocks specified by
- BLOCKS or to the whole CFG if BLOCKS is zero. Return the nuber of blocks
+ BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks
that were split.
The goal is to expose cases in which entering a basic block does not imply
basic_block *bbs;
bool check_last_block = false;
- /* Map bb indicies into basic block pointers since split_block
+ /* Map bb indices into basic block pointers since split_block
will renumber the basic blocks. */
bbs = xmalloc (n_basic_blocks * sizeof (*bbs));
{
edge e;
- /* The above condition should be enought to verify that there is
+ /* The above condition should be enough to verify that there is
no edge to the exit block in CFG already. Calling make_edge in
such case would make us to mark that edge as fake and remove it
later. */
BASIC_BLOCK (i)->flags &= ~BB_REACHABLE;
/* Add our starting points to the worklist. Almost always there will
- be only one. It isn't inconcievable that we might one day directly
+ be only one. It isn't inconceivable that we might one day directly
support Fortran alternate entry points. */
for (e = ENTRY_BLOCK_PTR->succ; e; e = e->succ_next)
- Unreachable blocks removal
- Edge forwarding (edge to the forwarder block is forwarded to it's
- succesor. Simplification of the branch instruction is performed by
+ successor. Simplification of the branch instruction is performed by
underlying infrastructure so branch can be converted to simplejump or
eliminated).
- Cross jumping (tail merging)
}
\f
/* Attempt to forward edges leaving basic block B.
- Return true if sucessful. */
+ Return true if successful. */
static bool
try_forward_edges (mode, b)
/* Skip complex edges because we don't know how to update them.
- Still handle fallthru edges, as we can suceed to forward fallthru
+ Still handle fallthru edges, as we can succeed to forward fallthru
edge to the same place as the branch edge of conditional branch
- and turn conditional branch to an unconditonal branch. */
+ and turn conditional branch to an unconditional branch. */
if (e->flags & EDGE_COMPLEX)
continue;
counter = 0;
/* Look for the real destination of the jump.
- Avoid inifinite loop in the infinite empty loop by counting
+ Avoid infinite loop in the infinite empty loop by counting
up to n_basic_blocks. */
while (FORWARDER_BLOCK_P (target)
&& target->succ->dest != EXIT_BLOCK_PTR
}
#endif
- /* Include preceeding notes and labels in the cross-jump. One,
+ /* Include preceding notes and labels in the cross-jump. One,
this may bring us to the head of the blocks as requested above.
Two, it keeps line number notes as matched as may be. */
if (ninsns)
/* Holds the interesting trailing notes for the function. */
static rtx function_tail_eff_head;
-/* The scope forst of current function. */
+/* The scope forest of current function. */
static scope_forest_info forest;
static rtx skip_insns_after_block PARAMS ((basic_block));
}
/* Compute the loop nesting depth and enclosed loop level for the loop
- hierarchy tree specfied by LOOPS. Return the maximum enclosed loop
+ hierarchy tree specified by LOOPS. Return the maximum enclosed loop
level. */
static int
redirect_edge_and_branch_force, tidy_fallthru_edge, force_nonfallthru
- Edge splitting and commiting to edges
split_edge, insert_insn_on_edge, commit_edge_insertions
- - Dumpipng and debugging
+ - Dumping and debugging
print_rtl_with_bb, dump_bb, debug_bb, debug_bb_n
- Consistency checking
verify_flow_info
}
/* Create new basic block consisting of instructions in between HEAD and
- END and place it to the BB chain at possition INDEX.
+ END and place it to the BB chain at position INDEX.
END can be NULL in to create new empty basic block before HEAD.
Both END and HEAD can be NULL to create basic block at the end of
INSN chain. */
fprintf (rtl_dump_file, "Removing jump %i.\n", INSN_UID (insn));
fallthru = 1;
- /* Selectivly unlink whole insn chain. */
+ /* Selectively unlink whole insn chain. */
delete_insn_chain (kill_from, PREV_INSN (target->head));
}
/* If this already is simplejump, redirect it. */
/* Return last loop_beg note appearing after INSN, before start of next
basic block. Return INSN if there are no such notes.
- When emmiting jump to redirect an fallthru edge, it should always
+ When emitting jump to redirect an fallthru edge, it should always
appear after the LOOP_BEG notes, as loop optimizer expect loop to
- eighter start by fallthru edge or jump following the LOOP_BEG note
+ either start by fallthru edge or jump following the LOOP_BEG note
jumping to the loop exit test. */
static rtx
Don't do that on expense of adding new instructions or reordering
basic blocks.
- Function can be also called with edge destionation equivalent to the
+ Function can be also called with edge destination equivalent to the
TARGET. Then it should try the simplifications and do nothing if
none is possible.
- Return true if transformation suceeded. We still return flase in case
+ Return true if transformation succeeded. We still return false in case
E already destinated TARGET and we didn't managed to simplify instruction
stream. */
/* Redirect edge even at the expense of creating new jump insn or
basic block. Return new basic block if created, NULL otherwise.
- Abort if converison is impossible. */
+ Abort if conversion is impossible. */
basic_block
redirect_edge_and_branch_force (e, target)
abort ();
/* We are going to place the new block in front of edge destination.
- Avoid existence of fallthru predecesors. */
+ Avoid existence of fallthru predecessors. */
if ((edge_in->flags & EDGE_FALLTHRU) == 0)
{
edge e;
free (edge_checksum);
}
\f
-/* Assume that the preceeding pass has possibly eliminated jump instructions
+/* Assume that the preceding pass has possibly eliminated jump instructions
or converted the unconditional jumps. Eliminate the edges from CFG.
Return true if any edges are eliminated. */
return purged;
}
-/* Search all basic blocks for potentionally dead edges and purge them.
+/* Search all basic blocks for potentially dead edges and purge them.
Return true iff some edge has been eliminated.
*/
static struct path_prefix libpath_lib_dirs; /* directories in LIBPATH */
static struct path_prefix *libpaths[3] = {&cmdline_lib_dirs,
&libpath_lib_dirs, NULL};
-static const char *const libexts[3] = {"a", "so", NULL}; /* possible library extentions */
+static const char *const libexts[3] = {"a", "so", NULL}; /* possible library extensions */
#endif
static void handler PARAMS ((int));
dup2 (stdout_save, STDOUT_FILENO);
dup2 (stderr_save, STDERR_FILENO);
- /* Close reponse file. */
+ /* Close response file. */
close (redir_handle);
}
rtx link = XEXP (links, 0);
/* If the linked insn has been replaced by a note, then there
- is no point in persuing this chain any further. */
+ is no point in pursuing this chain any further. */
if (GET_CODE (link) == NOTE)
break;
We depend here on combinable_i3_pat to reject them. */
/* The code below this loop only verifies that the inputs of
the SET in INSN do not change. We call reg_set_between_p
- to verify that the REG in the USE does not change betweeen
+ to verify that the REG in the USE does not change between
I3 and INSN.
If the USE in INSN was for a pseudo register, the matching
insn pattern will likely match any register; combining this
with any other USE would only be safe if we knew that the
used registers have identical values, or if there was
something to tell them apart, e.g. different modes. For
- now, we forgo such compilcated tests and simply disallow
+ now, we forgo such complicated tests and simply disallow
combining of USES of pseudo registers with any other USE. */
if (GET_CODE (XEXP (elt, 0)) == REG
&& GET_CODE (PATTERN (i3)) == PARALLEL)
rtx temp = gen_rtx_ZERO_EXTEND (pos_mode, pos_rtx);
/* If we know that no extraneous bits are set, and that the high
- bit is not set, convert extraction to cheaper one - eighter
+ bit is not set, convert extraction to cheaper one - either
SIGN_EXTENSION or ZERO_EXTENSION, that are equivalent in these
cases. */
if (flag_expensive_optimizations
NULL_RTX, 0);
/* If we have something other than a SUBREG, we might have
- done an expansion, so rerun outselves. */
+ done an expansion, so rerun ourselves. */
if (GET_CODE (newer) != SUBREG)
newer = make_compound_operation (newer, in_code);
}
}
- /* Similarly for MULT, AND and UMIN, execpt that for these the result
+ /* Similarly for MULT, AND and UMIN, except that for these the result
is always zero. */
if ((STORE_FLAG_VALUE == 1 || STORE_FLAG_VALUE == -1)
&& (code == MULT || code == AND || code == UMIN)
return num_sign_bit_copies (XEXP (x, 0), mode);
case UMOD:
- /* The result must be <= the scond operand. */
+ /* The result must be <= the second operand. */
return num_sign_bit_copies (XEXP (x, 1), mode);
case DIV:
it's either a hard register, set more than once, or it's a live
at the beginning of the function, return 0.
- Because if it's not live at the beginnning of the function then the reg
+ Because if it's not live at the beginning of the function then the reg
is always set before being used (is never used without being set).
And, if it's set only once, and it's always set before use, then all
uses must have the same last value, even if it's not from this basic
#undef HAVE_AS_GOTOFF_IN_DATA
/* Define if your assembler supports dwarf2 .file/.loc directives,
- and preserves file table indicies exactly as given. */
+ and preserves file table indices exactly as given. */
#undef HAVE_AS_DWARF2_DEBUG_LINE
/* Define 0/1 to force the choice for exception handling model. */
if $gcc_cv_as -o conftest.o conftest.s > /dev/null 2>&1 \
&& grep debug_line conftest.o > /dev/null 2>&1 ; then
# The .debug_line file table must be in the exact order that
- # we specified the files, since these indicies are also used
+ # we specified the files, since these indices are also used
# by DW_AT_decl_file. Approximate this test by testing if
# the assembler bitches if the same index is assigned twice.
echo ' .file 1 "foo.s"' > conftest.s
if $gcc_cv_as -o conftest.o conftest.s > /dev/null 2>&1 \
&& grep debug_line conftest.o > /dev/null 2>&1 ; then
# The .debug_line file table must be in the exact order that
- # we specified the files, since these indicies are also used
+ # we specified the files, since these indices are also used
# by DW_AT_decl_file. Approximate this test by testing if
# the assembler bitches if the same index is assigned twice.
echo ' .file 1 "foo.s"' > conftest.s
if test x"$gcc_cv_as_dwarf2_debug_line" = xyes; then
AC_DEFINE(HAVE_AS_DWARF2_DEBUG_LINE, 1,
[Define if your assembler supports dwarf2 .file/.loc directives,
- and preserves file table indicies exactly as given.])
+ and preserves file table indices exactly as given.])
fi
AC_MSG_RESULT($gcc_cv_as_dwarf2_debug_line)
{
/* Determine which regs are set in this insn. Since
we're in SSA form, if a reg is set here it isn't set
- anywhere elso, so this insn is where the reg is born. */
+ anywhere else, so this insn is where the reg is born. */
CLEAR_REG_SET (born);
note_stores (PATTERN (insn), mark_reg, born);
AND_REG_SET (born, regs);
members of this record or union type, we will also be trying to output
DIEs to represent the *types* of those members. However the `type'
function (above) will specifically avoid generating type DIEs for member
- types *within* the list of member DIEs for this (containing) type execpt
+ types *within* the list of member DIEs for this (containing) type except
for those types (of members) which are explicitly marked as also being
members of this (containing) type themselves. The g++ front- end can
force any given type to be treated as a member of some other
struct s { my_type f; };
- Since we may be stuck here without enought information to do exactly
+ Since we may be stuck here without enough information to do exactly
what is called for in the Dwarf draft specification, we do the best
that we can under the circumstances and always use the "plain" integral
fundamental type codes for int, short, and long types. That's probably
to output DIEs to represent the *types* of those members.
However the `output_type' function (above) will specifically
avoid generating type DIEs for member types *within* the list
- of member DIEs for this (containing) type execpt for those
+ of member DIEs for this (containing) type except for those
types (of members) which are explicitly marked as also being
members of this (containing) type themselves. The g++ front-
end can force any given type to be treated as a member of some
ERT_FIXUP
} type;
- /* Holds the action to perform based on the preceeding type. */
+ /* Holds the action to perform based on the preceding type. */
union {
/* A list of catch blocks, a surrounding try block,
and the label for continuing after a catch. */
A region receives a dispatch index if it is directly reachable
and requires in-function processing. Regions that share post-landing
- pads may share dispatch indicies. */
+ pads may share dispatch indices. */
/* ??? Post-landing pad sharing doesn't actually happen at the moment
(see build_post_landing_pads) so we don't bother checking for it. */
}
\f
/* In the following functions, we represent entries in the action table
- as 1-based indicies. Special cases are:
+ as 1-based indices. Special cases are:
0: null action record, non-null landing pad; implies cleanups
-1: null action record, null landing pad; implies no action
/* The filter value goes in untouched. The link to the next
record is a "self-relative" byte offset, or zero to indicate
that there is no next record. So convert the absolute 1 based
- indicies we've been carrying around into a displacement. */
+ indices we've been carrying around into a displacement. */
push_sleb128 (&cfun->eh->action_record_data, filter);
if (next)
We to catch first case, we align frequently executed blocks.
To catch the second, we align blocks that are executed more frequently
- than the predecesor and the predecesor is likely to not be executed
+ than the predecessor and the predecessor is likely to not be executed
when function is called. */
if (!has_fallthru
}
/* Delete any jump tables never referenced. We can't delete them at the
- time of removing tablejump insn as they are referenced by the preceeding
+ time of removing tablejump insn as they are referenced by the preceding
insns computing the destination, so we delay deleting and garbagecollect
them once life information is computed. */
static void
return exp;
}
/* Compute approximate cost of the expression. Used to decide whether
- expression is cheap enought for inline. */
+ expression is cheap enough for inline. */
static int
attr_rtx_cost (x)
rtx x;
base = &table->table[0];
#endif
- /* Extract the level 1 and 2 indicies. */
+ /* Extract the level 1 and 2 indices. */
L1 = LOOKUP_L1 (p);
L2 = LOOKUP_L2 (p);
base = &table->table[0];
#endif
- /* Extract the level 1 and 2 indicies. */
+ /* Extract the level 1 and 2 indices. */
L1 = LOOKUP_L1 (p);
L2 = LOOKUP_L2 (p);
base = &table->table[0];
#endif
- /* Extract the level 1 and 2 indicies. */
+ /* Extract the level 1 and 2 indices. */
L1 = LOOKUP_L1 (p);
L2 = LOOKUP_L2 (p);
|| GET_CODE (PATTERN (lab_next)) == ADDR_DIFF_VEC))
{
/* If we're deleting the tablejump, delete the dispatch table.
- We may not be able to kill the label immediately preceeding
+ We may not be able to kill the label immediately preceding
just yet, as it might be referenced in code leading up to
the tablejump. */
delete_related_insns (lab_next);
/* Ideally we'd figure out what blocks were affected and start from
there, but this is enormously complicated by commit_edge_insertions,
- which would screw up any indicies we'd collected, and also need to
+ which would screw up any indices we'd collected, and also need to
be involved in the update. Bail and recompute global life info for
everything. */
rtx cond, earliest;
edge e;
- /* If block has no sucessor, predict all possible paths to
+ /* If block has no successor, predict all possible paths to
it as improbable, as the block contains a call to a noreturn
function and thus can be executed only once. */
if (bb->succ == NULL && !found_noreturn)
/* True if block needs to be visited in prop_freqency. */
int tovisit:1;
- /* Number of predecesors we need to visit first. */
+ /* Number of predecessors we need to visit first. */
int npredecesors;
} *block_info;
basic_block nextbb;
int n;
- /* For each basic block we need to visit count number of his predecesors
+ /* For each basic block we need to visit count number of his predecessors
we need to visit first. */
for (n = 0; n < n_basic_blocks; n++)
{
if (threshold > BB_FREQ_MAX)
abort ();
- /* Frequencies are out of range. This eighter means that function contains
+ /* Frequencies are out of range. This either means that function contains
internal loop executing more than BB_FREQ_MAX times or profile feedback
is available and function has not been executed at all. */
if (ENTRY_BLOCK_PTR->frequency == 0)
struct stack_def stack_out; /* Output stack configuration. */
HARD_REG_SET out_reg_set; /* Stack regs live on output. */
int done; /* True if block already converted. */
- int predecesors; /* Number of predecesors that needs
+ int predecesors; /* Number of predecessors that needs
to be visited. */
} *block_info;
A special case are auto_inc expressions; even if the input is
inherited, we still need the address for the output. We can
recognize them because they have RELOAD_OUT set to RELOAD_IN.
- If we suceeded removing some reload and we are doing a preliminary
+ If we succeeded removing some reload and we are doing a preliminary
pass just to remove such reloads, make another pass, since the
removal of one reload might allow us to inherit another one. */
else if (rld[r].in
}
/* Give an INSN, return a SET or CLOBBER expression that does modify PAT
- (eighter directly or via STRICT_LOW_PART and similar modifiers). */
+ (either directly or via STRICT_LOW_PART and similar modifiers). */
rtx
set_of (pat, insn)
rtx pat, insn;
/* Our caller needs either ensure that we will find all sets
(in case code has not been optimized yet), or take care
- for possible labels in a way by setting boundary to preceeding
+ for possible labels in a way by setting boundary to preceding
CODE_LABEL. */
if (GET_CODE (before) == CODE_LABEL)
{
fst_in_edge = nxt_in_edge = IN_EDGES (BB_TO_BLOCK (bb));
- /* Intialize dom[bb] to '111..1'. */
+ /* Initialize dom[bb] to '111..1'. */
sbitmap_ones (dom[bb]);
do
{"ssa", &flag_ssa, 1,
N_("Enable SSA optimizations") },
{"ssa-ccp", &flag_ssa_ccp, 1,
- N_("Enable SSA conditonal constant propagation") },
+ N_("Enable SSA conditional constant propagation") },
{"ssa-dce", &flag_ssa_dce, 1,
N_("Enable aggressive SSA dead code elimination") },
{"leading-underscore", &flag_leading_underscore, 1,
/* Register the language-independent parameters. */
add_params (lang_independent_params, LAST_PARAM);
- /* Perform language-specific options intialization. */
+ /* Perform language-specific options initialization. */
(*lang_hooks.init_options) ();
/* Scan to see what optimization level has been specified. That will
is located, and what the register lifetimes and stack layout are
within the function.
- The data structures are defined in the DWARF specfication, although
+ The data structures are defined in the DWARF specification, although
not in a very readable way (see LITERATURE).
Every time an exception is thrown, the code needs to locate the FDE
projects / gcc.git / commitdiff