diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2003-01-17 14:24:24 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2003-01-17 14:24:24 +0000 |
| commit | fbe5a4a607f0dcb330bbb63e041c1dfaf63c883b (patch) | |
| tree | 2cb49286c2dc56eb4c87f9c8f6bf3d0ed54ea367 /gcc/et-forest.c | |
| parent | 095f90933f648fbf24528d7a7aecf76399f3e743 (diff) | |
| download | gcc-fbe5a4a607f0dcb330bbb63e041c1dfaf63c883b.zip gcc-fbe5a4a607f0dcb330bbb63e041c1dfaf63c883b.tar.gz gcc-fbe5a4a607f0dcb330bbb63e041c1dfaf63c883b.tar.bz2 | |
et-forest.c: Fix comment typos.
* et-forest.c: Fix comment typos.
* et-forest.h: Likewise.
* except.c: Likewise.
* expr.c: Likewise.
* flags.h: Likewise.
* flow.c: Likewise.
* gcc.c: Likewise.
* gcse.c: Likewise.
* genattrtab.c: Likewise.
* genautomata.c: Likewise.
* gengtype.c: Likewise.
* genrecog.c: Likewise.
* global.c: Likewise.
* gthr-rtems.h: Likewise.
From-SVN: r61443
Diffstat (limited to 'gcc/et-forest.c')
| -rw-r--r-- | gcc/et-forest.c | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/gcc/et-forest.c b/gcc/et-forest.c index 99653ce..b54f3f7 100644 --- a/gcc/et-forest.c +++ b/gcc/et-forest.c @@ -105,7 +105,7 @@ find_rightmost_node (occ) } -/* Operation splay for splay tree structure representing ocuurences. */ +/* Operation splay for splay tree structure representing occurrences. */ static et_forest_occurrence_t splay (node) et_forest_occurrence_t node; @@ -337,7 +337,7 @@ splay (node) return node; } -/* Remove all occurences of the given node before destroying the node. */ +/* Remove all occurrences of the given node before destroying the node. */ static void remove_all_occurrences (forest, forest_node) et_forest_t forest; @@ -371,7 +371,7 @@ remove_all_occurrences (forest, forest_node) prev_node = splay (find_rightmost_node (first->left)); next_node = splay (find_leftmost_node (last->right)); - /* prev_node and next_node are consecutive occurencies + /* prev_node and next_node are consecutive occurrences of the same node. */ if (prev_node->next != next_node) abort (); @@ -487,7 +487,7 @@ et_forest_add_node (forest, value) return node; } -/* Add new edge to the tree, return 1 if succesfull. +/* Add new edge to the tree, return 1 if successful. 0 indicates that creation of the edge will close the cycle in graph. */ int et_forest_add_edge (forest, parent_node, child_node) @@ -545,7 +545,7 @@ et_forest_remove_node (forest, node) pool_free (forest->node_pool, node); } -/* Remove edge from the tree, return 1 if sucesfull, +/* Remove edge from the tree, return 1 if successful, 0 indicates nonexisting edge. */ int et_forest_remove_edge (forest, parent_node, child_node) @@ -672,7 +672,7 @@ et_forest_enumerate_sons (forest, node, array) et_forest_occurrence_t occ = node->first, stop = node->last, occ1; /* Parent is the rightmost node of the left successor. - Look for all occurences having no right succesor + Look for all occurrences having no right successor and lookup the sons. */ while (occ != stop) { |