cgraphunit.c, [...]: Fix comment typos.
* cgraphunit.c, dbxout.c, flow.c, gcse.c, gimplify.c, lambda-code.c, loop.c, machmode.def, mips-tfile.c, modulo-sched.c, passes.c, postreload-gcse.c, tree-eh.c, tree-ssa-ccp.c, varasm.c, config/frv/frv.c, config/frv/frv.h, config/frv/frv.md, config/i386/i386.c, config/i386/i386.h, config/i386/i386.md, config/rs6000/predicates.md, config/rs6000/rs6000.c, config/s390/fixdfdi.h, config/s390/s390.c, config/stormy16/stormy16.c, config/stormy16/stormy16.md, config/vax/vax.md: Fix comment typos. From-SVN: r97362
This commit is contained in:
parent
59cffcf69a
commit
aabcd30904
29 changed files with 54 additions and 41 deletions
|
@ -1,3 +1,16 @@
|
|||
2005-04-01 Kazu Hirata <kazu@cs.umass.edu>
|
||||
|
||||
* cgraphunit.c, dbxout.c, flow.c, gcse.c, gimplify.c,
|
||||
lambda-code.c, loop.c, machmode.def, mips-tfile.c,
|
||||
modulo-sched.c, passes.c, postreload-gcse.c, tree-eh.c,
|
||||
tree-ssa-ccp.c, varasm.c, config/frv/frv.c, config/frv/frv.h,
|
||||
config/frv/frv.md, config/i386/i386.c, config/i386/i386.h,
|
||||
config/i386/i386.md, config/rs6000/predicates.md,
|
||||
config/rs6000/rs6000.c, config/s390/fixdfdi.h,
|
||||
config/s390/s390.c, config/stormy16/stormy16.c,
|
||||
config/stormy16/stormy16.md, config/vax/vax.md: Fix comment
|
||||
typos.
|
||||
|
||||
2005-04-01 Joseph S. Myers <joseph@codesourcery.com>
|
||||
|
||||
PR c/17855
|
||||
|
|
|
@ -282,8 +282,8 @@ decide_is_function_needed (struct cgraph_node *node, tree decl)
|
|||
return false;
|
||||
}
|
||||
|
||||
/* Walk the decls we marked as neccesary and see if they reference new variables
|
||||
or functions and add them into the worklists. */
|
||||
/* Walk the decls we marked as necessary and see if they reference new
|
||||
variables or functions and add them into the worklists. */
|
||||
static bool
|
||||
cgraph_varpool_analyze_pending_decls (void)
|
||||
{
|
||||
|
@ -307,10 +307,10 @@ cgraph_varpool_analyze_pending_decls (void)
|
|||
}
|
||||
|
||||
/* Optimization of function bodies might've rendered some variables as
|
||||
unnecesary so we want to avoid these from being compiled.
|
||||
unnecessary so we want to avoid these from being compiled.
|
||||
|
||||
This is done by prunning the queue and keeping only the variables that
|
||||
really appear needed (ie thery are either externally visible or referenced
|
||||
really appear needed (ie they are either externally visible or referenced
|
||||
by compiled function). Re-doing the reachability analysis on variables
|
||||
brings back the remaining variables referenced by these. */
|
||||
static void
|
||||
|
@ -772,7 +772,7 @@ cgraph_finalize_compilation_unit (void)
|
|||
{
|
||||
struct cgraph_node *node;
|
||||
/* Keep track of already processed nodes when called multiple times for
|
||||
intermodule optmization. */
|
||||
intermodule optimization. */
|
||||
static struct cgraph_node *first_analyzed;
|
||||
|
||||
finish_aliases_1 ();
|
||||
|
|
|
@ -781,7 +781,7 @@ frv_override_options (void)
|
|||
|
||||
You should not use this macro to change options that are not
|
||||
machine-specific. These should uniformly selected by the same optimization
|
||||
level on all supported machines. Use this macro to enable machbine-specific
|
||||
level on all supported machines. Use this macro to enable machine-specific
|
||||
optimizations.
|
||||
|
||||
*Do not examine `write_symbols' in this macro!* The debugging options are
|
||||
|
|
|
@ -351,7 +351,7 @@
|
|||
|
||||
You should not use this macro to change options that are not
|
||||
machine-specific. These should uniformly selected by the same optimization
|
||||
level on all supported machines. Use this macro to enable machbine-specific
|
||||
level on all supported machines. Use this macro to enable machine-specific
|
||||
optimizations.
|
||||
|
||||
*Do not examine `write_symbols' in this macro!* The debugging options are
|
||||
|
|
|
@ -1206,7 +1206,7 @@
|
|||
(eq_attr "type" "sqrt_single"))
|
||||
"(f1|f0) + fr550_float")
|
||||
|
||||
;; Synthetic units for enforcing media issue restructions. Certain types
|
||||
;; Synthetic units for enforcing media issue restrictions. Certain types
|
||||
;; of insn in M2 conflict with certain types in M0:
|
||||
;;
|
||||
;; M2
|
||||
|
@ -5913,7 +5913,7 @@
|
|||
;; Called after register allocation to add any instructions needed for the
|
||||
;; epilogue. Using an epilogue insn is favored compared to putting all of the
|
||||
;; instructions in the FUNCTION_EPILOGUE macro, since it allows the scheduler
|
||||
;; to intermix instructions with the restires of the caller saved registers.
|
||||
;; to intermix instructions with the restores of the caller saved registers.
|
||||
;; In some cases, it might be necessary to emit a barrier instruction as the
|
||||
;; first insn to prevent such scheduling.
|
||||
(define_expand "epilogue"
|
||||
|
|
|
@ -4112,7 +4112,7 @@ ix86_compute_frame_layout (struct ix86_frame *frame)
|
|||
|
||||
/* During reload iteration the amount of registers saved can change.
|
||||
Recompute the value as needed. Do not recompute when amount of registers
|
||||
didn't change as reload does mutiple calls to the function and does not
|
||||
didn't change as reload does multiple calls to the function and does not
|
||||
expect the decision to change within single iteration. */
|
||||
if (!optimize_size
|
||||
&& cfun->machine->use_fast_prologue_epilogue_nregs != frame->nregs)
|
||||
|
@ -6030,7 +6030,7 @@ i386_output_dwarf_dtprel (FILE *file, int size, rtx x)
|
|||
}
|
||||
|
||||
/* In the name of slightly smaller debug output, and to cater to
|
||||
general assembler losage, recognize PIC+GOTOFF and turn it back
|
||||
general assembler lossage, recognize PIC+GOTOFF and turn it back
|
||||
into a direct symbol reference. */
|
||||
|
||||
static rtx
|
||||
|
@ -6137,8 +6137,8 @@ put_condition_code (enum rtx_code code, enum machine_mode mode, int reverse,
|
|||
suffix = "g";
|
||||
break;
|
||||
case GTU:
|
||||
/* ??? Use "nbe" instead of "a" for fcmov losage on some assemblers.
|
||||
Those same assemblers have the same but opposite losage on cmov. */
|
||||
/* ??? Use "nbe" instead of "a" for fcmov lossage on some assemblers.
|
||||
Those same assemblers have the same but opposite lossage on cmov. */
|
||||
if (mode != CCmode)
|
||||
abort ();
|
||||
suffix = fp ? "nbe" : "a";
|
||||
|
|
|
@ -1183,7 +1183,7 @@ do { \
|
|||
This is computed in `reload', in reload1.c. */
|
||||
#define FRAME_POINTER_REQUIRED ix86_frame_pointer_required ()
|
||||
|
||||
/* Override this in other tm.h files to cope with various OS losage
|
||||
/* Override this in other tm.h files to cope with various OS lossage
|
||||
requiring a frame pointer. */
|
||||
#ifndef SUBTARGET_FRAME_POINTER_REQUIRED
|
||||
#define SUBTARGET_FRAME_POINTER_REQUIRED 0
|
||||
|
|
|
@ -19357,7 +19357,7 @@
|
|||
abort ();
|
||||
|
||||
/* Use 3dNOW prefetch in case we are asking for write prefetch not
|
||||
suported by SSE counterpart or the SSE prefetch is not available
|
||||
supported by SSE counterpart or the SSE prefetch is not available
|
||||
(K6 machines). Otherwise use SSE prefetch as it allows specifying
|
||||
of locality. */
|
||||
if (TARGET_3DNOW && (!TARGET_PREFETCH_SSE || rw))
|
||||
|
|
|
@ -593,7 +593,7 @@
|
|||
(match_code "symbol_ref,const,label_ref"))
|
||||
|
||||
;; Return 1 if op is a simple reference that can be loaded via the GOT,
|
||||
;; exclusing labels involving addition.
|
||||
;; excluding labels involving addition.
|
||||
(define_predicate "got_no_const_operand"
|
||||
(match_code "symbol_ref,label_ref"))
|
||||
|
||||
|
|
|
@ -227,7 +227,7 @@ const char *rs6000_debug_name;
|
|||
int rs6000_debug_stack; /* debug stack applications */
|
||||
int rs6000_debug_arg; /* debug argument handling */
|
||||
|
||||
/* Value is TRUE if register/mode pair is accepatable. */
|
||||
/* Value is TRUE if register/mode pair is acceptable. */
|
||||
bool rs6000_hard_regno_mode_ok_p[NUM_MACHINE_MODES][FIRST_PSEUDO_REGISTER];
|
||||
|
||||
/* Opaque types. */
|
||||
|
@ -15249,7 +15249,7 @@ static bool
|
|||
rs6000_is_costly_dependence (rtx insn, rtx next, rtx link, int cost,
|
||||
int distance)
|
||||
{
|
||||
/* If the flag is not enbled - no dependence is considered costly;
|
||||
/* If the flag is not enabled - no dependence is considered costly;
|
||||
allow all dependent insns in the same group.
|
||||
This is the most aggressive option. */
|
||||
if (rs6000_sched_costly_dep == no_dep_costly)
|
||||
|
|
|
@ -55,7 +55,7 @@ __fixunsdfdi (double a1)
|
|||
|
||||
dl1.d = a1;
|
||||
|
||||
/* +/- 0, denormalized, negativ */
|
||||
/* +/- 0, denormalized, negative */
|
||||
|
||||
if (!EXPD (dl1) || SIGND(dl1))
|
||||
return 0;
|
||||
|
@ -199,7 +199,7 @@ __fixunssfdi (float a1)
|
|||
|
||||
fl1.f = a1;
|
||||
|
||||
/* +/- 0, denormalized, negativ */
|
||||
/* +/- 0, denormalized, negative */
|
||||
|
||||
if (!EXP (fl1) || SIGN(fl1))
|
||||
return 0;
|
||||
|
|
|
@ -4130,7 +4130,7 @@ s390_output_dwarf_dtprel (FILE *file, int size, rtx x)
|
|||
}
|
||||
|
||||
/* In the name of slightly smaller debug output, and to cater to
|
||||
general assembler losage, recognize various UNSPEC sequences
|
||||
general assembler lossage, recognize various UNSPEC sequences
|
||||
and turn them back into a direct symbol reference. */
|
||||
|
||||
static rtx
|
||||
|
|
|
@ -2658,7 +2658,7 @@ combine_bnp (rtx insn)
|
|||
|
||||
if (and)
|
||||
{
|
||||
/* Some mis-optimisations by GCC can generate a RIGHT-SHIFT
|
||||
/* Some mis-optimizations by GCC can generate a RIGHT-SHIFT
|
||||
followed by an AND like this:
|
||||
|
||||
(parallel [(set (reg:HI r7) (lshiftrt:HI (reg:HI r7) (const_int 3)))
|
||||
|
|
|
@ -1104,7 +1104,7 @@
|
|||
;; the epilogue. Using an epilogue insn is favored compared to putting
|
||||
;; all of the instructions in the TARGET_ASM_FUNCTION_EPILOGUE macro,
|
||||
;; since it allows the scheduler to intermix instructions with the
|
||||
;; restires of the caller saved registers. In some cases, it might be
|
||||
;; restores of the caller saved registers. In some cases, it might be
|
||||
;; necessary to emit a barrier instruction as the first insn to
|
||||
;; prevent such scheduling.
|
||||
(define_expand "epilogue"
|
||||
|
|
|
@ -37,7 +37,7 @@
|
|||
]
|
||||
)
|
||||
|
||||
;; Integer modes supported on VAX, withd a mapping from machine mode
|
||||
;; Integer modes supported on VAX, with a mapping from machine mode
|
||||
;; to mnemonic suffix. DImode is always a special case.
|
||||
(define_mode_macro VAXint [QI HI SI])
|
||||
(define_mode_attr isfx [(QI "b") (HI "w") (SI "l")])
|
||||
|
|
|
@ -2360,7 +2360,7 @@ dbxout_symbol (tree decl, int local ATTRIBUTE_UNUSED)
|
|||
DBXOUT_DECR_NESTING_AND_RETURN (0);
|
||||
|
||||
/* If we are to generate only the symbols actually used then such
|
||||
symbol nodees are flagged with TREE_USED. Ignore any that
|
||||
symbol nodes are flagged with TREE_USED. Ignore any that
|
||||
aren't flaged as TREE_USED. */
|
||||
|
||||
if (flag_debug_only_used_symbols
|
||||
|
|
|
@ -273,7 +273,7 @@ static int ndead;
|
|||
(remember, we are walking backward). This can be computed as current
|
||||
pbi->insn_num - reg_deaths[regno].
|
||||
At the end of processing each basic block, the remaining live registers
|
||||
are inspected and liferanges are increased same way so liverange of global
|
||||
are inspected and live ranges are increased same way so liverange of global
|
||||
registers are computed correctly.
|
||||
|
||||
The array is maintained clear for dead registers, so it can be safely reused
|
||||
|
|
|
@ -3260,7 +3260,7 @@ cprop (int alter_jumps)
|
|||
settle for the condition variable in the jump instruction being integral.
|
||||
We prefer to be able to record the value of a user variable, rather than
|
||||
the value of a temporary used in a condition. This could be solved by
|
||||
recording the value of *every* register scaned by canonicalize_condition,
|
||||
recording the value of *every* register scanned by canonicalize_condition,
|
||||
but this would require some code reorganization. */
|
||||
|
||||
rtx
|
||||
|
|
|
@ -4428,7 +4428,7 @@ gimplify_one_sizepos (tree *expr_p, tree *stmt_p)
|
|||
{
|
||||
/* We don't do anything if the value isn't there, is constant, or contains
|
||||
A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
|
||||
a VAR_DECL. If it's a VAR_DECL from another function, the gimplfier
|
||||
a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
|
||||
will want to replace it with a new variable, but that will cause problems
|
||||
if this type is from outside the function. It's OK to have that here. */
|
||||
if (*expr_p == NULL_TREE || TREE_CONSTANT (*expr_p)
|
||||
|
|
|
@ -489,7 +489,7 @@ lcm (int a, int b)
|
|||
}
|
||||
|
||||
/* Perform Fourier-Motzkin elimination to calculate the bounds of the
|
||||
auxillary nest.
|
||||
auxiliary nest.
|
||||
Fourier-Motzkin is a way of reducing systems of linear inequalities so that
|
||||
it is easy to calculate the answer and bounds.
|
||||
A sketch of how it works:
|
||||
|
@ -800,7 +800,7 @@ lambda_compute_auxillary_space (lambda_loopnest nest,
|
|||
/* Compute the loop bounds for the target space, using the bounds of
|
||||
the auxiliary nest AUXILLARY_NEST, and the triangular matrix H.
|
||||
The target space loop bounds are computed by multiplying the triangular
|
||||
matrix H by the auxillary nest, to get the new loop bounds. The sign of
|
||||
matrix H by the auxiliary nest, to get the new loop bounds. The sign of
|
||||
the loop steps (positive or negative) is then used to swap the bounds if
|
||||
the loop counts downwards.
|
||||
Return the target loopnest. */
|
||||
|
@ -1057,8 +1057,8 @@ lambda_compute_step_signs (lambda_trans_matrix trans, lambda_vector stepsigns)
|
|||
2. Composing the dense base with the specified transformation (TRANS)
|
||||
3. Decomposing the combined transformation into a lower triangular portion,
|
||||
and a unimodular portion.
|
||||
4. Computing the auxillary nest using the unimodular portion.
|
||||
5. Computing the target nest using the auxillary nest and the lower
|
||||
4. Computing the auxiliary nest using the unimodular portion.
|
||||
5. Computing the target nest using the auxiliary nest and the lower
|
||||
triangular portion. */
|
||||
|
||||
lambda_loopnest
|
||||
|
|
|
@ -8904,7 +8904,7 @@ combine_givs (struct loop_regs *regs, struct iv_class *bl)
|
|||
/* If a DEST_REG GIV is used only once, do not allow it to combine
|
||||
with anything, for in doing so we will gain nothing that cannot
|
||||
be had by simply letting the GIV with which we would have combined
|
||||
to be reduced on its own. The losage shows up in particular with
|
||||
to be reduced on its own. The lossage shows up in particular with
|
||||
DEST_ADDR targets on hosts with reg+reg addressing, though it can
|
||||
be seen elsewhere as well. */
|
||||
if (g1->giv_type == DEST_REG
|
||||
|
|
|
@ -41,7 +41,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
|
|||
|
||||
A CLASS argument must be one of the constants defined in
|
||||
mode-classes.def, less the leading MODE_ prefix; some statements
|
||||
that take CLASS arguments have restructions on which classes are
|
||||
that take CLASS arguments have restrictions on which classes are
|
||||
acceptable. For instance, INT.
|
||||
|
||||
A MODE argument must be the printable name of a machine mode,
|
||||
|
|
|
@ -1746,7 +1746,7 @@ add_string (varray_t *vp, shash_t **hash_tbl, const char *start,
|
|||
|
||||
|
||||
/* Add a local symbol. The symbol string starts at STR_START and the
|
||||
first byte after it is makred by STR_END_P1. The symbol has type
|
||||
first byte after it is marked by STR_END_P1. The symbol has type
|
||||
TYPE and storage class STORAGE and value VALUE. INDX is an index
|
||||
to local/aux. symbols. */
|
||||
|
||||
|
|
|
@ -455,7 +455,7 @@ calculate_maxii (ddg_ptr g)
|
|||
true-dependence of distance 1): SCHED_TIME (def) < SCHED_TIME (use) and
|
||||
if so generate a register move. The number of such moves is equal to:
|
||||
SCHED_TIME (use) - SCHED_TIME (def) { 0 broken
|
||||
nreg_moves = ----------------------------------- + 1 - { dependecnce.
|
||||
nreg_moves = ----------------------------------- + 1 - { dependence.
|
||||
ii { 1 if not.
|
||||
*/
|
||||
static void
|
||||
|
|
|
@ -252,7 +252,7 @@ rest_of_decl_compilation (tree decl,
|
|||
timevar_pop (TV_SYMOUT);
|
||||
}
|
||||
|
||||
/* Let cgraph know about the existance of variables. */
|
||||
/* Let cgraph know about the existence of variables. */
|
||||
if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
|
||||
cgraph_varpool_node (decl);
|
||||
}
|
||||
|
|
|
@ -300,7 +300,7 @@ hash_expr_for_htab (const void *expp)
|
|||
return exp->hash;
|
||||
}
|
||||
|
||||
/* Callbach for hashtab.
|
||||
/* Callback for hashtab.
|
||||
Return nonzero if exp1 is equivalent to exp2. */
|
||||
|
||||
static int
|
||||
|
|
|
@ -50,7 +50,7 @@ using_eh_for_cleanups (void)
|
|||
/* Misc functions used in this file. */
|
||||
|
||||
/* Compare and hash for any structure which begins with a canonical
|
||||
pointer. Assumes all pointers are interchangable, which is sort
|
||||
pointer. Assumes all pointers are interchangeable, which is sort
|
||||
of already assumed by gcc elsewhere IIRC. */
|
||||
|
||||
static int
|
||||
|
|
|
@ -1582,7 +1582,7 @@ maybe_fold_stmt_indirect (tree expr, tree base, tree offset)
|
|||
/* We can get here for out-of-range string constant accesses,
|
||||
such as "_"[3]. Bail out of the entire substitution search
|
||||
and arrange for the entire statement to be replaced by a
|
||||
call to __builtin_trap. In all likelyhood this will all be
|
||||
call to __builtin_trap. In all likelihood this will all be
|
||||
constant-folded away, but in the meantime we can't leave with
|
||||
something that get_expr_operands can't understand. */
|
||||
|
||||
|
|
|
@ -4421,7 +4421,7 @@ globalize_decl (tree decl)
|
|||
|
||||
/* We have to be able to tell cgraph about the needed-ness of the target
|
||||
of an alias. This requires that the decl have been defined. Aliases
|
||||
that preceed their definition have to be queued for later processing. */
|
||||
that precede their definition have to be queued for later processing. */
|
||||
|
||||
struct alias_pair GTY(())
|
||||
{
|
||||
|
|
Loading…
Add table
Reference in a new issue