diff options
author | Kazu Hirata <kazu@codesourcery.com> | 2005-07-26 13:53:54 +0000 |
---|---|---|
committer | Kazu Hirata <kazu@gcc.gnu.org> | 2005-07-26 13:53:54 +0000 |
commit | a4174ebf41fcfc398b6868b1c71f3172993f76da (patch) | |
tree | 83ff3048fa7a8e7cb36c934689aa6162ade2a096 | |
parent | 783455db8ddf91d0777657edea22b3d285425e59 (diff) | |
download | gcc-a4174ebf41fcfc398b6868b1c71f3172993f76da.zip gcc-a4174ebf41fcfc398b6868b1c71f3172993f76da.tar.gz gcc-a4174ebf41fcfc398b6868b1c71f3172993f76da.tar.bz2 |
calls.c, [...]: Fix comment typos.
* calls.c, fold-const.c, ipa-reference.c, ipa-type-escape.c,
tree-ssa-reassoc.c, tree-ssa-structalias.c, vec.h,
config/crx/crx.c, config/m32c/m32c.c, config/m32c/m32c.h: Fix
comment typos.
* doc/c-tree.texi, doc/tree-ssa.texi: Fix typos.
From-SVN: r102385
-rw-r--r-- | gcc/ChangeLog | 6 | ||||
-rw-r--r-- | gcc/calls.c | 2 | ||||
-rw-r--r-- | gcc/config/crx/crx.c | 2 | ||||
-rw-r--r-- | gcc/config/m32c/m32c.c | 2 | ||||
-rw-r--r-- | gcc/config/m32c/m32c.h | 2 | ||||
-rw-r--r-- | gcc/doc/c-tree.texi | 10 | ||||
-rw-r--r-- | gcc/doc/tree-ssa.texi | 2 | ||||
-rw-r--r-- | gcc/fold-const.c | 2 | ||||
-rw-r--r-- | gcc/ipa-reference.c | 2 | ||||
-rw-r--r-- | gcc/ipa-type-escape.c | 6 | ||||
-rw-r--r-- | gcc/tree-ssa-reassoc.c | 2 | ||||
-rw-r--r-- | gcc/tree-ssa-structalias.c | 4 | ||||
-rw-r--r-- | gcc/vec.h | 2 |
13 files changed, 25 insertions, 19 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 598d309..feeaab3 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -6,6 +6,12 @@ config/crx/crx.c, config/crx/crx.h, config/crx/crx.md: Update FSF address. + * calls.c, fold-const.c, ipa-reference.c, ipa-type-escape.c, + tree-ssa-reassoc.c, tree-ssa-structalias.c, vec.h, + config/crx/crx.c, config/m32c/m32c.c, config/m32c/m32c.h: Fix + comment typos. + * doc/c-tree.texi, doc/tree-ssa.texi: Fix typos. + 2005-07-26 Richard Guenther <rguenther@suse.de> PR tree-optimization/22486 diff --git a/gcc/calls.c b/gcc/calls.c index 08d73a6..d51fbf6 100644 --- a/gcc/calls.c +++ b/gcc/calls.c @@ -3634,7 +3634,7 @@ emit_library_call_value_1 (int retval, rtx orgfun, rtx value, use = plus_constant (argblock, argvec[argnum].locate.offset.constant); else - /* When arguemnts are pushed, trying to tell alias.c where + /* When arguments are pushed, trying to tell alias.c where exactly this argument is won't work, because the auto-increment causes confusion. So we merely indicate that we access something with a known mode somewhere on diff --git a/gcc/config/crx/crx.c b/gcc/config/crx/crx.c index 3ff42b5..32b147d 100644 --- a/gcc/config/crx/crx.c +++ b/gcc/config/crx/crx.c @@ -1409,7 +1409,7 @@ crx_prepare_push_pop_string (int push_or_pop) | | (alloca, variable deallocated Stack | length arrays). grows +-------------------- Fp(x) - down| | Local vaiables of X + down| | Local variables of X ward| +-------------------- | | Regs saved for X-1 | +==================== Sp(x-1)=Ap(x) diff --git a/gcc/config/m32c/m32c.c b/gcc/config/m32c/m32c.c index bc4727e..a04d829 100644 --- a/gcc/config/m32c/m32c.c +++ b/gcc/config/m32c/m32c.c @@ -1978,7 +1978,7 @@ m32c_asm_integer (rtx x, unsigned int size, int aligned_p) /* Output of Assembler Instructions */ -/* We use a lookup table because the addressing modes are non-orthagonal. */ +/* We use a lookup table because the addressing modes are non-orthogonal. */ static struct { diff --git a/gcc/config/m32c/m32c.h b/gcc/config/m32c/m32c.h index cc73852..fae6c5c 100644 --- a/gcc/config/m32c/m32c.h +++ b/gcc/config/m32c/m32c.h @@ -353,7 +353,7 @@ enum reg_class #define BASE_REG_CLASS A_REGS #define INDEX_REG_CLASS NO_REGS -/* We primarily use the new "long" constraint names, with the intial +/* We primarily use the new "long" constraint names, with the initial letter classifying the constraint type and following letters specifying which. The types are: diff --git a/gcc/doc/c-tree.texi b/gcc/doc/c-tree.texi index fc00d82..0163c5e 100644 --- a/gcc/doc/c-tree.texi +++ b/gcc/doc/c-tree.texi @@ -1108,7 +1108,7 @@ For garbage collection and dynamic checking purposes, each @code{DECL} node structure type is required to have a unique enumerator value specified with it. For language specific @code{DECL} nodes, this new enumerator value -should go in the approriate @file{.def} file. +should go in the appropriate @file{.def} file. For @code{DECL} nodes that are part of the middle-end, the enumerator values are specified in @file{treestruct.def}. @@ -1116,7 +1116,7 @@ values are specified in @file{treestruct.def}. In order to make your new structure type usable, it must be added to @code{union tree_node}. For language specific @code{DECL} nodes, a new entry should be added -to the approriate @file{.h} file of the form +to the appropriate @file{.h} file of the form @smallexample struct tree_foo_decl GTY ((tag ("TS_VAR_DECL"))) foo_decl; @end smallexample @@ -1130,10 +1130,10 @@ contains one of the enumerated @code{DECL} node structures in the hierarchy, a simple lookup table is used. This lookup table needs to be kept up to date with the tree structure hierarchy, or else checking and containment macros will fail -inapproriately. +inappropriately. For language specific @code{DECL} nodes, their is an @code{init_ts} -function in an approriate @file{.c} file, which initializes the lookup +function in an appropriate @file{.c} file, which initializes the lookup table. Code setting up the table for new @code{DECL} nodes should be added there. @@ -1155,7 +1155,7 @@ goes into @file{tree.c}. @item Add macros to access any new fields and flags Each added field or flag should have a macro that is used to access -it, that performs approriate checking to ensure only the right type of +it, that performs appropriate checking to ensure only the right type of @code{DECL} nodes access the field. These macros generally take the following form diff --git a/gcc/doc/tree-ssa.texi b/gcc/doc/tree-ssa.texi index 42d7c43..cbc08a1 100644 --- a/gcc/doc/tree-ssa.texi +++ b/gcc/doc/tree-ssa.texi @@ -436,7 +436,7 @@ the compiler does not know whether such a goto statement exits the first sequence or not, so we assume that it doesn't). After the second sequence is executed, if it completes normally by -falling off the end, execution continues whereever the first sequence +falling off the end, execution continues wherever the first sequence would have continued, by falling off the end, or doing a goto, etc. @code{TRY_FINALLY_EXPR} complicates the flow graph, since the cleanup diff --git a/gcc/fold-const.c b/gcc/fold-const.c index bdda6001..a2d6250 100644 --- a/gcc/fold-const.c +++ b/gcc/fold-const.c @@ -6712,7 +6712,7 @@ fold_unary (enum tree_code code, tree type, tree op0) } /* Handle (T *)&A.B.C for A being of type T and B and C - living at offset zero. This occours frequently in + living at offset zero. This occurs frequently in C++ upcasting and then accessing the base. */ if (TREE_CODE (op0) == ADDR_EXPR && POINTER_TYPE_P (type) diff --git a/gcc/ipa-reference.c b/gcc/ipa-reference.c index d38f7ba..f2f9252 100644 --- a/gcc/ipa-reference.c +++ b/gcc/ipa-reference.c @@ -592,7 +592,7 @@ get_static_decl (int index) } /* Lookup the tree node for the static variable that has UID and - conver the name to a string for debugging. */ + convert the name to a string for debugging. */ static const char * get_static_name (int index) diff --git a/gcc/ipa-type-escape.c b/gcc/ipa-type-escape.c index 4e057ad..19a2a1e 100644 --- a/gcc/ipa-type-escape.c +++ b/gcc/ipa-type-escape.c @@ -487,7 +487,7 @@ mark_type (tree type, enum escape_t escape_status) bitmap_set_bit (map, uid); if (escape_status == FULL_ESCAPE) { - /* Effeciency hack. When things are bad, do not mess around + /* Efficiency hack. When things are bad, do not mess around with this type anymore. */ bitmap_set_bit (global_types_exposed_parameter, uid); } @@ -1461,7 +1461,7 @@ close_type_seen (tree type) return; bitmap_set_bit (been_there_done_that, uid); - /* If we are doing a language with a type heirarchy, mark all of + /* If we are doing a language with a type hierarchy, mark all of the superclasses. */ if (TYPE_BINFO (type)) for (binfo = TYPE_BINFO (type), i = 0; @@ -1568,7 +1568,7 @@ close_type_full_escape (tree type) subtype_map = subtype_map_for_uid (uid, false); - /* If we are doing a language with a type heirarchy, mark all of + /* If we are doing a language with a type hierarchy, mark all of the superclasses. */ if (TYPE_BINFO (type)) for (binfo = TYPE_BINFO (type), i = 0; diff --git a/gcc/tree-ssa-reassoc.c b/gcc/tree-ssa-reassoc.c index e0d4561..5514c3d 100644 --- a/gcc/tree-ssa-reassoc.c +++ b/gcc/tree-ssa-reassoc.c @@ -435,7 +435,7 @@ reassociate_expr (tree bexpr, block_stmt_iterator *currbsi) unsigned int lhsrank = get_rank (lhs); unsigned int rhsrank = get_rank (rhs); - /* If unsafe math optimizations we can do reassociation for non integal + /* If unsafe math optimizations we can do reassociation for non-integral types. */ if ((!INTEGRAL_TYPE_P (TREE_TYPE (lhs)) || !INTEGRAL_TYPE_P (TREE_TYPE (rhs))) diff --git a/gcc/tree-ssa-structalias.c b/gcc/tree-ssa-structalias.c index 2a10a8d..76ce7ab 100644 --- a/gcc/tree-ssa-structalias.c +++ b/gcc/tree-ssa-structalias.c @@ -2718,7 +2718,7 @@ update_alias_info (tree stmt, struct alias_info *ai) 1- If the constraint for PTR is ADDRESSOF for a non-structure variable, then we can use it directly because adding or subtracting a constant may not alter the original ADDRESSOF - constraing (i.e., pointer arithmetic may not legally go outside + constraint (i.e., pointer arithmetic may not legally go outside an object's boundaries). 2- If the constraint for PTR is ADDRESSOF for a structure variable, @@ -3324,7 +3324,7 @@ find_what_p_points_to (tree p) if (vi->is_artificial_var) { /* FIXME. READONLY should be handled better so that - flow insensitive aliasing can disregard writeable + flow insensitive aliasing can disregard writable aliases. */ if (vi->id == nothing_id) pi->pt_null = 1; @@ -218,7 +218,7 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA VEC(T,A) *VEC_T_A_copy(VEC(T) *); Copy the live elements of a vector into a new vector. The new and - old vectors need not be allocated by the same mechanim. */ + old vectors need not be allocated by the same mechanism. */ #define VEC_copy(T,A,V) (VEC_OP(T,A,copy)(VEC_BASE(V) MEM_STAT_INFO)) |