This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
[tree-ssa] tree-*.[ch]: Fix comment typos.
- From: Kazu Hirata <kazu at cs dot umass dot edu>
- To: gcc-patches at gcc dot gnu dot org
- Date: Fri, 17 Oct 2003 23:10:00 -0400 (EDT)
- Subject: [tree-ssa] tree-*.[ch]: Fix comment typos.
Hi,
Attached is a patch to fix comment typos. Committed as obvious.
Kazu Hirata
2003-10-17 Kazu Hirata <kazu@cs.umass.edu>
* ChangeLog.tree-ssa: Fix typos.
* tree-alias-common.c: Fix comment typos.
* tree-cfg.c: Likewise.
* tree-dfa.c: Likewise.
* tree-eh.c: Likewise.
* tree-flow.h: Likewise.
* tree-iterator.h: Likewise.
* tree-mudflap.c: Likewise.
* tree-ssa-ccp.c: Likewise.
* tree-ssa-dce.c: Likewise.
* tree-ssa-dom.c: Likewise.
* tree-ssa-live.c: Likewise.
* tree-ssa-live.h: Likewise.
* tree-ssa-pre.c: Likewise.
* tree-ssa.c: Likewise.
Index: ChangeLog.tree-ssa
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/ChangeLog.tree-ssa,v
retrieving revision 1.1.2.757
diff -u -r1.1.2.757 ChangeLog.tree-ssa
--- ChangeLog.tree-ssa 17 Oct 2003 19:51:49 -0000 1.1.2.757
+++ ChangeLog.tree-ssa 18 Oct 2003 02:56:12 -0000
@@ -7394,7 +7394,7 @@
2002-11-24 Daniel Berlin <dberlin@dberlin.org>
* configure.in: Add --with-libbanshee, passed to us by toplevel if
- libbanshee was configured. Substitute approriate definitions for
+ libbanshee was configured. Substitute appropriate definitions for
Makefile (IE disabling tree-alias-ander building) if it wasn't.
* config.in: Regenerated.
* config.gcc: Rebuild libbanshee with stage1 on darwin to work
@@ -7777,7 +7777,7 @@
(decode_f_option): Allow selecting of points-to algorithm.
* tree-alias-common.c (varmap): Removed.
(alias_annot): Changed to a hash table. Update all functions
- approriately.
+ appropriately.
(FIELD_BASED): New macro, switches between field-based analysis,
and field-independent analysis (field-based isn't quite done yet).
(alias_annot_entry): New, used in hash table.
Index: tree-alias-common.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-alias-common.c,v
retrieving revision 1.1.2.39
diff -u -r1.1.2.39 tree-alias-common.c
--- tree-alias-common.c 14 Oct 2003 15:33:21 -0000 1.1.2.39
+++ tree-alias-common.c 18 Oct 2003 02:56:13 -0000
@@ -58,7 +58,7 @@
1. Keeps track of the PTA data for each variable (IE the data each
specific PTA implementation wants to keep associated with a
variable).
- 2. Walks the function trees, calling the approriate functions that
+ 2. Walks the function trees, calling the appropriate functions that
each PTA implementation has implemented.
In order to speed up PTA queries, the PTA specific data is stored
@@ -170,7 +170,7 @@
{
newvar = create_alias_var (decl);
/* Assign globals to global var for purposes of intraprocedural
- analyses. */
+ analysis. */
if ((DECL_CONTEXT (decl) == NULL || TREE_PUBLIC (decl)
|| decl_function_context (decl) == NULL) && decl != global_var)
current_alias_ops->addr_assign (current_alias_ops,
@@ -265,7 +265,7 @@
case FIX_ROUND_EXPR:
case ADDR_EXPR:
case INDIRECT_REF:
- /* If it's a ref or cast or conversion of sometmhing, get the
+ /* If it's a ref or cast or conversion of something, get the
alias var of the something. */
return get_alias_var (TREE_OPERAND (expr, 0));
break;
@@ -390,7 +390,7 @@
Returns NULL_TREE when we should stop.
This function is the main part of the aliasing infrastructure. It
- walks the trees, calling the approriate alias analyzer functions to process
+ walks the trees, calling the appropriate alias analyzer functions to process
various statements. */
static tree
Index: tree-cfg.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-cfg.c,v
retrieving revision 1.1.4.179
diff -u -r1.1.4.179 tree-cfg.c
--- tree-cfg.c 17 Oct 2003 19:47:37 -0000 1.1.4.179
+++ tree-cfg.c 18 Oct 2003 02:56:15 -0000
@@ -83,7 +83,7 @@
static tree factored_computed_goto_label;
/* The factored computed goto. We cache this so we can easily recover
- the destation of computed gotos when unfactoring them. */
+ the destination of computed gotos when unfactoring them. */
static tree factored_computed_goto;
/* Basic blocks and flowgraphs. */
@@ -2456,7 +2456,7 @@
}
/* If all the phi nodes in PHI have alternatives for BB1 and BB2 and
- those alterantives are equal in each of the PHI nodes, then return
+ those alternatives are equal in each of the PHI nodes, then return
nonzero, else return zero. */
static int
@@ -2469,7 +2469,7 @@
tree val1 = NULL;
tree val2 = NULL;
- /* Find the alterantive associated with BB1 and BB2. Quit when we
+ /* Find the alternative associated with BB1 and BB2. Quit when we
have found both or we exhaust the alternatives. */
for (i = 0; i < PHI_NUM_ARGS (phi); i++)
{
@@ -2482,7 +2482,7 @@
break;
}
- /* If we exhaused the alternatives or the alternatives found are
+ /* If we exhausted the alternatives or the alternatives found are
not equal, then return false. */
if (i == PHI_NUM_ARGS (phi)
|| ! operand_equal_p (val1, val2, 0))
@@ -3418,7 +3418,7 @@
iterator. If this cannot be done, a NULL iterator is returned. */
/* Note this routine is a bit ugly. Since BIND_EXPRs dont cause new block,
- the block iterator keeps a stack of BIND_EXPRs which have been decended
+ the block iterator keeps a stack of BIND_EXPRs which have been descended
into. In order to create this stack properly, this routine traverses
through the block until it finds the specified tsi stmt. */
@@ -3929,7 +3929,7 @@
So this is ugly. The edge may no longer be in the edge list we
have been traversing, so we have to start over. First attach any
pending insertions to the new edge. This is why we need to check
- for exisiting GOTO's to our label above. */
+ for existing GOTO's to our label above. */
if (new_bb)
{
#ifdef ENABLE_CHECKING
@@ -3947,7 +3947,7 @@
}
}
- /* Find the last case label. That will be where the code seperation
+ /* Find the last case label. That will be where the code separation
between bb_c and bb_a will be formed. Upon exit of the loop, bsi will
point to the first stmt in BB_a. */
@@ -4044,7 +4044,7 @@
switch (TREE_CODE (stmt))
{
case COND_EXPR:
- /* If the ELSE block is non-existant, and this is an edge from the
+ /* If the ELSE block is non-existent, and this is an edge from the
COND_EXPR to a block other than the THEN block, then we create
a new ELSE clause. */
if (bb_for_stmt (COND_EXPR_ELSE (stmt)) == NULL)
Index: tree-dfa.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-dfa.c,v
retrieving revision 1.1.4.172
diff -u -r1.1.4.172 tree-dfa.c
--- tree-dfa.c 16 Oct 2003 14:32:25 -0000 1.1.4.172
+++ tree-dfa.c 18 Oct 2003 02:56:16 -0000
@@ -111,7 +111,7 @@
/* Operand is the target of an assignment expression. */
static const int opf_is_def = 1 << 0;
-/* Consider the operand virtual, regardlessof aliasing information. */
+/* Consider the operand virtual, regardless of aliasing information. */
static const int opf_force_vop = 1 << 1;
/* Debugging dumps. */
@@ -398,7 +398,7 @@
}
/* This single case might not have been folded to an array reference
- if the immediate doesn't exactly divide the referencd type. This
+ if the immediate doesn't exactly divide the referenced type. This
case is likely to be undefined in C, but perhaps not others. */
else if (TREE_CODE (ptr) == PLUS_EXPR)
{
@@ -1159,7 +1159,7 @@
Dataflow analysis (DFA) routines
---------------------------------------------------------------------------*/
/* Compute immediate uses. The parameter calc_for is an option function
- pointer whichi indicates whether immediate uses information should be
+ pointer which indicates whether immediate uses information should be
calculated for a given SSA variable. If NULL, then information is computed
for all variables. */
@@ -2010,7 +2010,7 @@
are computed by get_memory_tag_for and their associated pointers are
added to the POINTERS array.
- 2- All the addressable variables in ADDRESABLE_VARS are compared against
+ 2- All the addressable variables in ADDRESSABLE_VARS are compared against
the pointers collected in step 1. If a pointer P may point to
variable V, then V is added to the list of may-aliases for P.
Index: tree-eh.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-eh.c,v
retrieving revision 1.1.2.5
diff -u -r1.1.2.5 tree-eh.c
--- tree-eh.c 19 Sep 2003 06:15:05 -0000 1.1.2.5
+++ tree-eh.c 18 Oct 2003 02:56:17 -0000
@@ -1,4 +1,4 @@
-/* Exception handling semantics and decompostition for trees.
+/* Exception handling semantics and decomposition for trees.
Copyright (C) 2003 Free Software Foundation, Inc.
This file is part of GCC.
@@ -1061,7 +1061,7 @@
last_case = NULL;
last_case_index = 0;
- /* Begin insertting code for getting to the finally block. Things
+ /* Begin inserting code for getting to the finally block. Things
are done in this order to correspond to the sequence the code is
layed out. */
Index: tree-flow.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-flow.h,v
retrieving revision 1.1.4.129
diff -u -r1.1.4.129 tree-flow.h
--- tree-flow.h 16 Oct 2003 14:32:26 -0000 1.1.4.129
+++ tree-flow.h 18 Oct 2003 02:56:18 -0000
@@ -332,7 +332,7 @@
typedef struct {
tree *tp;
- tree context; /* Stack for decending into BIND_EXPR's. */
+ tree context; /* Stack for descending into BIND_EXPR's. */
} block_stmt_iterator;
extern block_stmt_iterator bsi_start (basic_block);
Index: tree-iterator.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-iterator.h,v
retrieving revision 1.1.2.8
diff -u -r1.1.2.8 tree-iterator.h
--- tree-iterator.h 6 Sep 2003 17:13:03 -0000 1.1.2.8
+++ tree-iterator.h 18 Oct 2003 02:56:18 -0000
@@ -20,7 +20,7 @@
Boston, MA 02111-1307, USA. */
-/* This file is dependant upon the implementation of tree's. It provides an
+/* This file is dependent upon the implementation of tree's. It provides an
abstract interface to the tree objects such that if all tree creation and
manipulations are done through this interface, we can easily change the
implementation of tree's, and not impact other code.
Index: tree-mudflap.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-mudflap.c,v
retrieving revision 1.1.2.54
diff -u -r1.1.2.54 tree-mudflap.c
--- tree-mudflap.c 24 Sep 2003 21:43:04 -0000 1.1.2.54
+++ tree-mudflap.c 18 Oct 2003 02:56:18 -0000
@@ -973,7 +973,7 @@
tree_role, NULL_TREE,
last_filename, last_lineno);
/* Prevent this transform's reapplication to this tree node.
- Note that we do not prevent recusion in walk_tree toward
+ Note that we do not prevent recursion in walk_tree toward
subtrees of this node, in case of nested pointer expressions. */
mf_mark (*t);
break;
Index: tree-ssa-ccp.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-ssa-ccp.c,v
retrieving revision 1.1.2.102
diff -u -r1.1.2.102 tree-ssa-ccp.c
--- tree-ssa-ccp.c 13 Oct 2003 15:35:59 -0000 1.1.2.102
+++ tree-ssa-ccp.c 18 Oct 2003 02:56:19 -0000
@@ -137,7 +137,7 @@
the declaration for the function to optimize.
On exit, VARS_TO_RENAME will contain the symbols that have been exposed by
- the propagation of ADDR_EXPR expressions into pointer derferences and need
+ the propagation of ADDR_EXPR expressions into pointer dereferences and need
to be renamed into SSA.
PHASE indicates which dump file from the DUMP_FILES array to use when
@@ -570,7 +570,7 @@
/* If this statement is already in the worklist then "cancel" it. The
reevaluation implied by the worklist entry will produce the same
- value we generate here and thus reevaluting it again from the
+ value we generate here and thus reevaluating it again from the
worklist is pointless. */
if (ann->in_ccp_worklist)
ann->in_ccp_worklist = 0;
@@ -1243,7 +1243,7 @@
return bb;
}
-/* We have just definited a new value for VAR. Add all immediate uses
+/* We have just defined a new value for VAR. Add all immediate uses
of VAR to the ssa_edges worklist. */
static void
add_var_to_ssa_edges_worklist (tree var)
Index: tree-ssa-dce.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-ssa-dce.c,v
retrieving revision 1.1.2.60
diff -u -r1.1.2.60 tree-ssa-dce.c
--- tree-ssa-dce.c 17 Oct 2003 19:51:49 -0000 1.1.2.60
+++ tree-ssa-dce.c 18 Oct 2003 02:56:19 -0000
@@ -394,7 +394,7 @@
}
-/* Eliminate unnecessary instructions. Any instuction not marked as necessary
+/* Eliminate unnecessary instructions. Any instruction not marked as necessary
contributes nothing to the program, and can be deleted. */
static void
Index: tree-ssa-dom.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-ssa-dom.c,v
retrieving revision 1.1.2.62
diff -u -r1.1.2.62 tree-ssa-dom.c
--- tree-ssa-dom.c 16 Oct 2003 22:13:51 -0000 1.1.2.62
+++ tree-ssa-dom.c 18 Oct 2003 02:56:21 -0000
@@ -136,7 +136,7 @@
static varray_type edges_to_redirect;
static varray_type redirection_targets;
-/* A virtual array holding value range records for the variable indentified
+/* A virtual array holding value range records for the variable identified
by the index, SSA_VERSION. */
static varray_type vrp_data;
@@ -148,7 +148,7 @@
{
/* Array of all the expressions entered into the global expression
hash table by this block. During finalization we use this array to
- know what expressions to remove from the global expressio hash
+ know what expressions to remove from the global expression hash
table. */
varray_type avail_exprs;
@@ -482,7 +482,7 @@
}
/* Initialize local stacks for this optimizer and record equivalences
- upon entry to BB. Equivlances can come from the edge traversed to
+ upon entry to BB. Equivalences can come from the edge traversed to
reach BB or they may come from PHI nodes at the start of BB. */
static void
@@ -1291,7 +1291,7 @@
The low value for the merged range is the maximum of
the previous low value and the low value of this record.
- Simlarly the high value for the merged range is the
+ Similarly the high value for the merged range is the
minimum of the previous high value and the high value of
this record. */
low = fold (build (MAX_EXPR, TREE_TYPE (low),
@@ -2112,7 +2112,7 @@
record_range (tree cond, basic_block bb, varray_type *vrp_variables_p)
{
/* We explicitly ignore NE_EXPRs. They rarely allow for meaningful
- range optimizations and significantly compliciate the implementation. */
+ range optimizations and significantly complicate the implementation. */
if (TREE_CODE_CLASS (TREE_CODE (cond)) == '<'
&& TREE_CODE (cond) != NE_EXPR
&& TREE_CODE (TREE_TYPE (TREE_OPERAND (cond, 1))) == INTEGER_TYPE)
Index: tree-ssa-live.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-ssa-live.c,v
retrieving revision 1.1.2.21
diff -u -r1.1.2.21 tree-ssa-live.c
--- tree-ssa-live.c 13 Oct 2003 15:36:03 -0000 1.1.2.21
+++ tree-ssa-live.c 18 Oct 2003 02:56:21 -0000
@@ -137,7 +137,7 @@
tree root_var = NULL_TREE;
tree other_var = NULL_TREE;
- /* This is independant of partition_to_compact. If partition_to_compact is
+ /* This is independent of partition_to_compact. If partition_to_compact is
on, then whichever one of these partitions is absorbed will never have a
dereference into the partition_to_compact array any more. */
@@ -191,7 +191,7 @@
/* Compress the partition numbers such that they fall in the range
- 0..(num_partitions-1) instead of whereever they turned out during
+ 0..(num_partitions-1) instead of wherever they turned out during
the partitioning exercise. This removes any references to unused
partitions, thereby allowing bitmaps and other vectors to be much
denser.
@@ -203,7 +203,7 @@
still be members of the same partition group. This allows work on reduced
sets, and no lose of information when a larger set is desired.
- In partiticular, coalescing can work on partitions which have 2 or more
+ In particular, coalescing can work on partitions which have 2 or more
definitions, and then 'recompact' later to include all the single
definitions for assignment to program variables. */
Index: tree-ssa-live.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-ssa-live.h,v
retrieving revision 1.1.2.7
diff -u -r1.1.2.7 tree-ssa-live.h
--- tree-ssa-live.h 29 Jul 2003 04:45:59 -0000 1.1.2.7
+++ tree-ssa-live.h 18 Oct 2003 02:56:21 -0000
@@ -291,7 +291,7 @@
return tpa->num_trees;
}
-/* Retreive the tree node for a specified index. */
+/* Retrieve the tree node for a specified index. */
static inline tree
tpa_tree (tpa_p tpa, int i)
{
@@ -529,7 +529,7 @@
}
/* This set of routines implements a coalesce_list. This is an object which
- is used to track pairs of partitions which are desireable to coalesce
+ is used to track pairs of partitions which are desirable to coalesce
together at some point. Costs are associated with each pair, and when
all desired information has been collected, the object can be used to
order the pairs for processing. */
@@ -552,7 +552,7 @@
to be added in this mode.
When add_mode is false, the lists have all been merged into list[0]. The
rest of the lists are not used. list[0] is ordered from most desirable
- coalesce to least desirable. pop_best_coalesce() retreives the pairs
+ coalesce to least desirable. pop_best_coalesce() retrieves the pairs
one at a time. */
typedef struct coalesce_list_d
Index: tree-ssa-pre.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-ssa-pre.c,v
retrieving revision 1.1.4.90
diff -u -r1.1.4.90 tree-ssa-pre.c
--- tree-ssa-pre.c 13 Oct 2003 15:36:03 -0000 1.1.4.90
+++ tree-ssa-pre.c 18 Oct 2003 02:56:23 -0000
@@ -262,7 +262,7 @@
/* PRE dominance frontiers. */
static bitmap *pre_dfs;
-/* Number of redunancy classes. */
+/* Number of redundancy classes. */
static int class_count;
static int preorder_count;
@@ -3029,7 +3029,7 @@
build_dominator_tree (pre_idom);
currbbs = n_basic_blocks;
- /* Reompute dominance frontiers. */
+ /* Recompute dominance frontiers. */
pre_dfs = (bitmap *) xmalloc (sizeof (bitmap) * currbbs);
for (i = 0; i < currbbs; i++)
pre_dfs[i] = BITMAP_XMALLOC ();
Index: tree-ssa.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/Attic/tree-ssa.c,v
retrieving revision 1.1.4.137
diff -u -r1.1.4.137 tree-ssa.c
--- tree-ssa.c 16 Oct 2003 22:13:52 -0000 1.1.4.137
+++ tree-ssa.c 18 Oct 2003 02:56:23 -0000
@@ -329,7 +329,7 @@
/* Allocate memory for the GLOBALS bitmap which will indicate which
variables are live across basic block boundaries. Note that this
bitmap is indexed by variable UID, so it must always be large enough
- to accomodate all the variables referenced in the program, not just
+ to accommodate all the variables referenced in the program, not just
the ones we are renaming. */
globals = sbitmap_alloc (num_referenced_vars);
sbitmap_zero (globals);
@@ -498,7 +498,7 @@
sbitmap kills;
/* Notice that this bitmap is indexed using variable UIDs, so it must be
- large enough to accomodate all the variables referenced in the
+ large enough to accommodate all the variables referenced in the
function, not just the ones we are renaming. */
kills = sbitmap_alloc (num_referenced_vars);
@@ -1002,7 +1002,7 @@
}
}
-/* Build the auxillary graph. */
+/* Build the auxiliary graph. */
static int
eliminate_build (elim_graph g, basic_block B, int i)
@@ -1396,7 +1396,7 @@
if (dump_file && (dump_flags & TDF_DETAILS))
dump_var_map (dump_file, map);
- /* Coalesce partitions of a root variable whereever possible. */
+ /* Coalesce partitions of a root variable wherever possible. */
coalesce_tpa_members (rv, graph, map, NULL,
((dump_flags & TDF_DETAILS) ? dump_file : NULL));