* c-pretty-print.c: Fix comment typos.
* c-pretty-print.h: Likewise.
* calls.c: Likewise.
* cfgloopmanip.c: Likewise.
* cgraphunit.c: Likewise.
* cppfiles.c: Likewise.
* final.c: Likewise.
* function.c: Likewise.
* gcov-io.h: Likewise.
* gcse.c: Likewise.
* genoutput.c: Likewise.
* loop.c: Likewise.
* postreload.c: Likewise.
* reg-stack.c: Likewise.
* regmove.c: Likewise.
* sched-int.h: Likewise.
* sched-rgn.c: Likewise.
* simplify-rtx.c: Likewise.
* tree-inline.c: Likewise.
* config/m68hc11/m68hc11.h: Likewise.
* config/mmix/mmix.c: Likewise.
* config/mn10300/mn10300.md: Likewise.
* config/sh/sh.h: Likewise.
From-SVN: r72118
+2003-10-05 Kazu Hirata <kazu@cs.umass.edu>
+
+ * c-pretty-print.c: Fix comment typos.
+ * c-pretty-print.h: Likewise.
+ * calls.c: Likewise.
+ * cfgloopmanip.c: Likewise.
+ * cgraphunit.c: Likewise.
+ * cppfiles.c: Likewise.
+ * final.c: Likewise.
+ * function.c: Likewise.
+ * gcov-io.h: Likewise.
+ * gcse.c: Likewise.
+ * genoutput.c: Likewise.
+ * loop.c: Likewise.
+ * postreload.c: Likewise.
+ * reg-stack.c: Likewise.
+ * regmove.c: Likewise.
+ * sched-int.h: Likewise.
+ * sched-rgn.c: Likewise.
+ * simplify-rtx.c: Likewise.
+ * tree-inline.c: Likewise.
+ * config/m68hc11/m68hc11.h: Likewise.
+ * config/mmix/mmix.c: Likewise.
+ * config/mn10300/mn10300.md: Likewise.
+ * config/sh/sh.h: Likewise.
+
2003-10-05 Richard Henderson <rth@redhat.com>
* tree-inline.c (remap_type): New.
( declarator )
direct-declarator [ type-qualifier-list(opt) assignment-expression(opt) ]
direct-declarator [ static type-qualifier-list(opt) assignment-expression(opt)]
- direct-declarator [ type-qualifier-list static assignment-exression ]
+ direct-declarator [ type-qualifier-list static assignment-expression ]
direct-declarator [ type-qualifier-list * ]
direct-declaratpr ( parameter-type-list )
direct-declarator ( identifier-list(opt) ) */
integer-constant
floating-constant
enumeration-constant
- chatracter-constant */
+ character-constant */
void
pp_c_constant (c_pretty_printer *pp, tree e)
language using C/c++ syntax can derive from this datatype and reuse
facilities provided here. It can do so by having a subobject of type
c_pretty_printer and override the macro pp_c_base to return a pointer
- to that subobject. Such a pretty-printer has the responsability to
+ to that subobject. Such a pretty-printer has the responsibility to
initialize the pp_base() part, then call pp_c_pretty_printer_init
to set up the components that are specific to the C pretty-printer.
A derived pretty-printer can override any function listed in the
/* Start updating where the next arg would go.
- On some machines (such as the PA) indirect calls have a difuferent
+ On some machines (such as the PA) indirect calls have a different
calling convention than normal calls. The last argument in
INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
or not. */
}
/* Fix placement of LOOP inside loop tree, i.e. find the innermost superloop
- FATHER of LOOP such that all of the edges comming out of LOOP belong to
+ FATHER of LOOP such that all of the edges coming out of LOOP belong to
FATHER, and set it as outer loop of LOOP. Return 1 if placement of
LOOP changed. */
int
/* "extern inline" functions are never output locally. */
if (DECL_EXTERNAL (decl))
return false;
- /* We want to emit COMDAT functions only when absolutely neccesary. */
+ /* We want to emit COMDAT functions only when absolutely necessary. */
if (DECL_COMDAT (decl))
return false;
if (!DECL_INLINE (decl)
inlined in others.
??? It may make more sense to use one body for inlining and other
- body for expanding the function but this is dificult to do. */
+ body for expanding the function but this is difficult to do. */
/* If node->output is set, then this is a unit-at-a-time compilation
and we have already begun whole-unit analysis. This is *not*
followed by "to". Eliminations of the same "from" register are listed
in order of preference.
- We have two registers that are eliminated on the 6811. The psuedo arg
+ We have two registers that are eliminated on the 6811. The pseudo arg
pointer and pseudo frame pointer registers can always be eliminated;
they are replaced with either the stack or the real frame pointer. */
(perhaps any insn). But regs_ever_live is up-to-date when
leaf_function_p () isn't, so we "or" them together to get accurate
information. FIXME: Some tweak to leaf_function_p might be
- preferrable. */
+ preferable. */
#define MMIX_CFUN_NEEDS_SAVED_EH_RETURN_ADDRESS \
(flag_exceptions \
&& ((reload_completed && regs_ever_live[MMIX_rJ_REGNUM]) \
;; but will have the proper effect on cc0. Using d0 is arbitrary; any
;; data register would work.)
-;; Even though the first alternative would be preferrable if it can
+;; Even though the first alternative would be preferable if it can
;; possibly match, reload must not be given the opportunity to attempt
;; to use it. It assumes that such matches can only occur when one of
;; the operands is used for input and the other for output. Since
#define MAX_FIXED_MODE_SIZE (TARGET_SH5 ? 128 : 64)
/* ??? Define ACCUMULATE_OUTGOING_ARGS? This is more efficient than pushing
- and poping arguments. However, we do have push/pop instructions, and
+ and popping arguments. However, we do have push/pop instructions, and
rather limited offsets (4 bits) in load/store instructions, so it isn't
clear if this would give better code. If implemented, should check for
compatibility problems. */
}
/* Return the directory from which searching for FNAME should start,
- condiering the directive TYPE and ANGLE_BRACKETS. If there is
+ considering the directive TYPE and ANGLE_BRACKETS. If there is
nothing left in the path, returns NULL. */
static struct cpp_dir *
search_path_head (cpp_reader *pfile, const char *fname, int angle_brackets,
extract_insn_cached (insn);
for (i = 0; i < recog_data.n_operands; i++)
{
- /* The following test cannot use recog_data.operand when tesing
+ /* The following test cannot use recog_data.operand when testing
for a SUBREG: the underlying object might have been changed
already if we are inside a match_operator expression that
matches the else clause. Instead we test the underlying
}
/* Reset cfun, and other non-struct-function variables to defaults as
- appropriate for emiiting rtl at the start of a function. */
+ appropriate for emitting rtl at the start of a function. */
static void
prepare_function_start (tree fndecl)
program. The checksum is used for whole program summaries, and
disambiguates different programs which include the same
instrumented object file. There may be several program summaries,
- each with a unique checksum. The object summary's checkum is zero.
+ each with a unique checksum. The object summary's checksum is zero.
Note that the data file might contain information from several runs
concatenated, or the data might be merged.
reaching_reg <- expr
old_reg <- reaching_reg
because this way copy propagation can discover additional PRE
- opportunuties. But if this fails, we try the old way. */
+ opportunities. But if this fails, we try the old way. */
static void
pre_insert_copy_insn (struct expr *expr, rtx insn)
check that fails if the value is not the expected one... */
if (DEFAULT_CONSTRAINT_LEN (*p, p) != 1)
abort ();
- /* And now a comile-time check that should give a diagnostic if the
+ /* And now a compile-time check that should give a diagnostic if the
definition doesn't exactly match. */
#define DEFAULT_CONSTRAINT_LEN(C,STR) 1
/* Now re-define DEFAULT_CONSTRAINT_LEN so that we can verify it is
arg1)),
ext_val, benefit);
}
- /* Propagate the MULT expressions to the intermost nodes. */
+ /* Propagate the MULT expressions to the innermost nodes. */
else if (GET_CODE (arg0) == PLUS)
{
/* (invar_0 + invar_1) * invar_2. Distribute. */
else
{
/* Otherwise, look for a free index register. Since we have
- checked above that neiter REG nor BASE are index registers,
+ checked above that neither REG nor BASE are index registers,
if we find anything at all, it will be different from these
two registers. */
for (i = first_index_reg; i <= last_index_reg; i++)
some dead EH outgoing edge after the possible deletion of the
trapping insn inside the block. Since the number of predecessors of
"block"'s successors has been computed based on the initial edge set,
- we check for the possiblity to process some of these successors
+ we check for the possibility to process some of these successors
before such an edge deletion may happen. */
for (e = block->succ; e ; e = e->succ_next)
if (! (e->flags & EDGE_DFS_BACK))
if (! INSN_P (p))
continue;
- /* Make a tenative change. */
+ /* Make a tentative change. */
validate_replace_rtx_group (src_reg, subreg, p);
}
scheduling is done. */
rtx sched_before_next_call;
- /* Used to keep post-call psuedo/hard reg movements together with
+ /* Used to keep post-call pseudo/hard reg movements together with
the call. */
bool in_post_call_group_p;
}
else
{
- /* Check for psuedo registers. */
+ /* Check for pseudo registers. */
for (i = 0; i < candidate_table[src].split_bbs.nr_members; i++)
{
int b = candidate_table[src].split_bbs.first_member[i];
&& width <= 2*HOST_BITS_PER_WIDE_INT && width > 0)
{
/* Although the overflow semantics of RTL's FIX and UNSIGNED_FIX
- operators are intentionally left unspecified (to ease implemention
+ operators are intentionally left unspecified (to ease implementation
by target backends), for consistency, this routine implements the
same semantics for constant folding as used by the middle-end. */
case BLOCK:
case RECORD_TYPE:
case CHAR_TYPE:
- /* None of thse have subtrees other than those already walked
+ /* None of these have subtrees other than those already walked
above. */
break;
projects / gcc.git / commitdiff