FreeChainXenon/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

alias.c, [...]: Fix comment typos.

Browse source 
* alias.c, c-common.h, c-incpath.c, c-incpath.h, expr.c,
	fold-const.c, gimplify.c, params.h, tree-data-ref.c,
	tree-if-conv.c, tree-nested.c, tree-outof-ssa.c,
	tree-ssa-dom.c, tree-vectorizer.c, tree.def, config/darwin.c,
	config/freebsd-spec.h, config/arm/arm.h,
	config/h8300/h8300.md, config/i386/i386.md,
	config/i386/predicates.md, config/i386/sse.md,
	config/ia64/ia64.c, config/ip2k/ip2k.c, config/s390/s390.c,
	config/vax/vax.md: Fix comment typos.  Follow spelling
	conventions.

From-SVN: r94112
This commit is contained in:
Kazu Hirata 2005-01-23 15:05:49 +00:00 • committed by Kazu Hirata
parent e7dc5b4f22
commit 35fd3193de
27 changed files with 55 additions and 41 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
gcc/ChangeLog
View file

@ -1,3 +1,16 @@
2005-01-23 Kazu Hirata <kazu@cs.umass.edu>
* alias.c, c-common.h, c-incpath.c, c-incpath.h, expr.c,
fold-const.c, gimplify.c, params.h, tree-data-ref.c,
tree-if-conv.c, tree-nested.c, tree-outof-ssa.c,
tree-ssa-dom.c, tree-vectorizer.c, tree.def, config/darwin.c,
config/freebsd-spec.h, config/arm/arm.h,
config/h8300/h8300.md, config/i386/i386.md,
config/i386/predicates.md, config/i386/sse.md,
config/ia64/ia64.c, config/ip2k/ip2k.c, config/s390/s390.c,
config/vax/vax.md: Fix comment typos. Follow spelling
conventions.
2005-01-23 Steven Bosscher <stevenb@suse.de>
* gengtype.c (walk_type): Produce `not equal to' compares for loop

4
gcc/alias.c
View file

@ -1,5 +1,5 @@
/* Alias analysis for GNU C
Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004
Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
Free Software Foundation, Inc.
Contributed by John Carr (jfc@mit.edu).
@ -1882,7 +1882,7 @@ static int
aliases_everything_p (rtx mem)
{
if (GET_CODE (XEXP (mem, 0)) == AND)
/* If the address is an AND, its very hard to know at what it is
/* If the address is an AND, it's very hard to know at what it is
actually pointing. */
return 1;

8
gcc/c-common.h
View file

@ -1,6 +1,6 @@
/* Definitions for c-common.c.
Copyright (C) 1987, 1993, 1994, 1995, 1997, 1998,
1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
This file is part of GCC.
@ -241,7 +241,7 @@ extern c_language_kind c_language;
/* Information about a statement tree. */
struct stmt_tree_s GTY(()) {
/* The current statment list being collected. */
/* The current statement list being collected. */
tree x_cur_stmt_list;
/* In C++, Nonzero if we should treat statements as full
@ -272,9 +272,9 @@ struct c_language_function GTY(()) {
struct stmt_tree_s x_stmt_tree;
};
/* When building a statement-tree, this is the current statment list
/* When building a statement-tree, this is the current statement list
being collected. It's TREE_CHAIN is a back-pointer to the previous
statment list. */
statement list. */
#define cur_stmt_list (current_stmt_tree ()->x_cur_stmt_list)

4
gcc/c-incpath.c
View file

@ -1,6 +1,6 @@
/* Set up combined include path chain for the preprocessor.
Copyright (C) 1986, 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
Broken out of cppinit.c and cppfiles.c and rewritten Mar 2003.
@ -332,7 +332,7 @@ add_path (char *path, int chain, int cxx_aware, bool user_supplied_p)
#if defined (HAVE_DOS_BASED_FILE_SYSTEM)
/* Convert all backslashes to slashes. The native CRT stat()
function does not recognise a directory that ends in a backslash
function does not recognize a directory that ends in a backslash
(unless it is a drive root dir, such "c:\"). Forward slashes,
trailing or otherwise, cause no problems for stat(). */
char* c;

2
gcc/c-incpath.h
View file

@ -1,5 +1,5 @@
/* Set up combined include path for the preprocessor.
Copyright (C) 2003, 2004 Free Software Foundation, Inc.
Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the

2
gcc/config/arm/arm.h
View file

@ -26,7 +26,7 @@
#ifndef GCC_ARM_H
#define GCC_ARM_H
/* The archetecture define. */
/* The architecture define. */
extern char arm_arch_name[];
/* Target CPU builtins. */

2
gcc/config/darwin.c
View file

@ -142,7 +142,7 @@ machopic_classify_symbol (rtx sym_ref)
/* Indicate when fix-and-continue style code generation is being used
and when a reference to data should be indirected so that it can be
rebound in a new translation unit to refernce the original instance
rebound in a new translation unit to reference the original instance
of that data. Symbol names that are for code generation local to
the translation unit are bound to the new translation unit;
currently this means symbols that begin with L or _OBJC_;

2
gcc/config/freebsd-spec.h
View file

@ -118,7 +118,7 @@ Boston, MA 02111-1307, USA. */
/* Provide a LIB_SPEC appropriate for FreeBSD. Just select the appropriate
libc, depending on whether we're doing profiling or need threads support.
(simular to the default, except no -lg, and no -p). */
(similar to the default, except no -lg, and no -p). */
#ifdef FBSD_NO_THREADS
#define FBSD_LIB_SPEC " \

4
gcc/config/h8300/h8300.md
View file

@ -1,6 +1,6 @@
;; GCC machine description for Renesas H8/300
;; Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
;; 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
;; 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
;; Contributed by Steve Chamberlain (sac@cygnus.com),
;; Jim Wilson (wilson@cygnus.com), and Doug Evans (dje@cygnus.com).
@ -158,7 +158,7 @@
(const_string "yes")))
;; Only allow jumps to have a delay slot if we think they might
;; be short enough. This is just an optimisation: we don't know
;; be short enough. This is just an optimization: we don't know
;; for certain whether they will be or not.
(define_delay (and (eq_attr "delay_slot" "jump")
(eq (symbol_ref "get_attr_length (insn)") (const_int 2)))

6
gcc/config/i386/i386.md
View file

@ -17424,7 +17424,7 @@
"(TARGET_80387 && TARGET_CMOVE) || TARGET_SSE_MATH"
"if (! ix86_expand_fp_movcc (operands)) FAIL; DONE;")
;; These versions of min/max are aware of the instruction's behaviour
;; These versions of min/max are aware of the instruction's behavior
;; wrt -0.0 and NaN inputs. If we don't care about either, then we
;; should have used the smin/smax expanders in the first place.
(define_insn "*movsfcc_1_sse_min"
@ -17493,7 +17493,7 @@
"(TARGET_80387 && TARGET_CMOVE) || (TARGET_SSE2 && TARGET_SSE_MATH)"
"if (! ix86_expand_fp_movcc (operands)) FAIL; DONE;")
;; These versions of min/max are aware of the instruction's behaviour
;; These versions of min/max are aware of the instruction's behavior
;; wrt -0.0 and NaN inputs. If we don't care about either, then we
;; should have used the smin/smax expanders in the first place.
(define_insn "*movdfcc_1_sse_min"
@ -17612,7 +17612,7 @@
(set_attr "mode" "XF")])
;; These versions of the min/max patterns are intentionally ignorant of
;; their behaviour wrt -0.0 and NaN (via the commutative operand mark).
;; their behavior wrt -0.0 and NaN (via the commutative operand mark).
;; Since both the tree-level MAX_EXPR and the rtl-level SMAX operator
;; are undefined in this condition, we're certain this is correct.

2
gcc/config/i386/predicates.md
View file

@ -492,7 +492,7 @@
(ior (match_operand 0 "register_no_elim_operand")
(match_operand 0 "memory_operand"))))
;; Simiarly, but for tail calls, in which we cannot allow memory references.
;; Similarly, but for tail calls, in which we cannot allow memory references.
(define_predicate "sibcall_insn_operand"
(ior (match_operand 0 "constant_call_address_operand")
(match_operand 0 "register_no_elim_operand")))

2
gcc/config/i386/sse.md
View file

@ -3199,7 +3199,7 @@
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;
;; Miscelaneous
;; Miscellaneous
;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;

2
gcc/config/ia64/ia64.c
View file

@ -5851,7 +5851,7 @@ static const char *bundle_name [NR_BUNDLES] =
int ia64_final_schedule = 0;
/* Codes of the corresponding quieryied units: */
/* Codes of the corresponding queried units: */
static int _0mii_, _0mmi_, _0mfi_, _0mmf_;
static int _0bbb_, _0mbb_, _0mib_, _0mmb_, _0mfb_, _0mlx_;

5
gcc/config/ip2k/ip2k.c
View file

@ -1,6 +1,7 @@
/* Subroutines used for code generation on Ubicom IP2022
Communications Controller.
Copyright (C) 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005
Free Software Foundation, Inc.
Contributed by Red Hat, Inc and Ubicom, Inc.
This file is part of GCC.
@ -5245,7 +5246,7 @@ mdr_try_wreg_elim (first_insn)
#endif /* IP2K_MD_REORG_PASS */
/* We perform a lot of untangling of the RTL within the reorg pass since
the IP2k requires some really bizarre (and really undesireable) things
the IP2k requires some really bizarre (and really undesirable) things
to happen in order to guarantee not aborting. This pass causes several
earlier passes to be re-run as it progressively transforms things,
making the subsequent runs continue to win. */

2
gcc/config/s390/s390.c
View file

@ -600,7 +600,7 @@ s390_select_ccmode (enum rtx_code code, rtx op0, rtx op1)
/* If constants are involved in an add instruction it is possible to use
the resulting cc for comparisons with zero. Knowing the sign of the
constant the overflow behaviour gets predictable. e.g.:
constant the overflow behavior gets predictable. e.g.:
int a, b; if ((b = a + c) > 0)
with c as a constant value: c < 0 -> CCAN and c >= 0 -> CCAP */
if (GET_CODE (op0) == PLUS && GET_CODE (XEXP (op0, 1)) == CONST_INT

4
gcc/config/vax/vax.md
View file

@ -1,6 +1,6 @@
;; Machine description for GNU compiler, VAX Version
;; Copyright (C) 1987, 1988, 1991, 1994, 1995, 1996, 1998, 1999, 2000, 2001,
;; 2002, 2004 Free Software Foundation, Inc.
;; 2002, 2004, 2005 Free Software Foundation, Inc.
;; This file is part of GCC.
@ -2007,7 +2007,7 @@
})
;; This insn is a bit of a lier. It actually falls through if no case
;; matches. But, we prevent that from ever happening by emiting a jump
;; matches. But, we prevent that from ever happening by emitting a jump
;; before this, see the define_expand above.
(define_insn "casesi1"
[(match_operand:SI 1 "const_int_operand" "n")

4
gcc/expr.c
View file

@ -2732,7 +2732,7 @@ emit_move_change_mode (enum machine_mode new_mode,
}
else
{
/* Note that we do want simplify_subreg's behaviour of validating
/* Note that we do want simplify_subreg's behavior of validating
that the new mode is ok for a hard register. If we were to use
simplify_gen_subreg, we would create the subreg, but would
probably run into the target not being able to implement it. */
@ -2877,7 +2877,7 @@ emit_move_complex (enum machine_mode mode, rtx x, rtx y)
if (push_operand (x, mode))
return emit_move_complex_push (mode, x, y);
/* For memory to memory moves, optimial behaviour can be had with the
/* For memory to memory moves, optimal behavior can be had with the
existing block move logic. */
if (MEM_P (x) && MEM_P (y))
{

2
gcc/fold-const.c
View file

@ -5392,7 +5392,7 @@ fold_binary_op_with_conditional_arg (enum tree_code code, tree type,
tree rhs = NULL_TREE;
/* This transformation is only worthwhile if we don't have to wrap
arg in a SAVE_EXPR, and the operation can be simplified on atleast
arg in a SAVE_EXPR, and the operation can be simplified on at least
one of the branches once its pushed inside the COND_EXPR. */
if (!TREE_CONSTANT (arg))
return NULL_TREE;

2
gcc/gimplify.c
View file

@ -4243,7 +4243,7 @@ gimplify_type_sizes (tree type, tree *list_p)
tree field, t;
/* Note that we do not check for TYPE_SIZES_GIMPLIFIED already set because
that's not supposed to happen on types where gimplifcation does anything.
that's not supposed to happen on types where gimplification does anything.
We should assert that it isn't set, but we can indeed be called multiple
times on pointers. Unfortunately, this includes fat pointers which we
can't easily test for. We could pass TYPE down to gimplify_one_sizepos

2
gcc/params.h
View file

@ -52,7 +52,7 @@ typedef struct param_info
/* Minimum acceptable value. */
int min_value;
/* Maxiumum acceptable value, if greater than minimum */
/* Maximum acceptable value, if greater than minimum */
int max_value;
/* A short description of the option. */

2
gcc/tree-data-ref.c
View file

@ -1111,7 +1111,7 @@ compute_overlap_steps_for_affine_univar (int niter, int step_a, int step_b,
| y (t, u, v) = {{0, +, 1336}_u, +, 1}_v
| z (t, u, v) = {{{0, +, 1}_t, +, 1335}_u, +, 1}_v
FORNOW: This is a specialized implementation for a case occuring in
FORNOW: This is a specialized implementation for a case occurring in
a common benchmark. Implement the general algorithm. */
static void

2
gcc/tree-if-conv.c
View file

@ -974,7 +974,7 @@ ifc_temp_var (tree type, tree exp)
stmt = build (MODIFY_EXPR, type, var, exp);
/* Get SSA name for the new variable and set make new statement
its definition statment. */
its definition statement. */
new_name = make_ssa_name (var, stmt);
TREE_OPERAND (stmt, 0) = new_name;
SSA_NAME_DEF_STMT (new_name) = stmt;

4
gcc/tree-nested.c
View file

@ -1,5 +1,5 @@
/* Nested function decomposition for trees.
Copyright (C) 2004 Free Software Foundation, Inc.
Copyright (C) 2004, 2005 Free Software Foundation, Inc.
This file is part of GCC.
@ -636,7 +636,7 @@ walk_all_functions (walk_tree_fn callback, struct nesting_info *root)
while (root);
}
/* We have to check for a fairly pathalogical case. The operands of function
/* We have to check for a fairly pathological case. The operands of function
nested function are to be interpreted in the context of the enclosing
function. So if any are variably-sized, they will get remapped when the
enclosing function is inlined. But that remapping would also have to be

2
gcc/tree-outof-ssa.c
View file

@ -2417,7 +2417,7 @@ insert_backedge_copies (void)
start of a loop should be with a COND_EXPR or GOTO_EXPR.
However, better safe than sorry.
If the block ends with a control statment or
If the block ends with a control statement or
something that might throw, then we have to
insert this assignment before the last
statement. Else insert it after the last statement. */

4
gcc/tree-ssa-dom.c
View file

@ -246,7 +246,7 @@ struct vrp_hash_elt
in this basic block. We use this during finalization to know
which variables need their VRP data updated. */
/* Stack of SSA_NAMEs which had their values constrainted by operations
/* Stack of SSA_NAMEs which had their values constrained by operations
in this basic block. During finalization of this block we use this
list to determine which variables need their VRP data updated.
@ -1255,7 +1255,7 @@ record_equivalences_from_incoming_edge (basic_block bb)
basic_block parent;
struct edge_info *edge_info;
/* If our parent block ended with a control statment, then we may be
/* If our parent block ended with a control statement, then we may be
able to record some equivalences based on which outgoing edge from
the parent was followed. */
parent = get_immediate_dominator (CDI_DOMINATORS, bb);

6
gcc/tree-vectorizer.c
View file

@ -2494,7 +2494,7 @@ vectorizable_assignment (tree stmt, block_stmt_iterator *bsi, tree *vec_stmt)
return true;
}
/** Trasform. **/
/** Transform. **/
if (vect_debug_details (NULL))
fprintf (dump_file, "transform assignment.");
@ -2685,7 +2685,7 @@ vectorizable_store (tree stmt, block_stmt_iterator *bsi, tree *vec_stmt)
return true;
}
/** Trasform. **/
/** Transform. **/
if (vect_debug_details (NULL))
fprintf (dump_file, "transform store");
@ -2772,7 +2772,7 @@ vectorizable_load (tree stmt, block_stmt_iterator *bsi, tree *vec_stmt)
return true;
}
/** Trasform. **/
/** Transform. **/
if (vect_debug_details (NULL))
fprintf (dump_file, "transform load.");

2
gcc/tree.def
View file

@ -487,7 +487,7 @@ DEFTREECODE (TARGET_EXPR, "target_expr", tcc_expression, 4)
have VOID_TYPE. The same constraints apply to operand 2. */
DEFTREECODE (COND_EXPR, "cond_expr", tcc_expression, 3)
/* Vector conditional expresion. It is like COND_EXPR, but with
/* Vector conditional expression. It is like COND_EXPR, but with
vector operands.
A = VEC_COND_EXPR ( X < Y, B, C)