aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-ssa-threadupdate.c
diff options
context:
space:
mode:
authorKazu Hirata <kazu@cs.umass.edu>2004-11-20 12:48:15 +0000
committerKazu Hirata <kazu@gcc.gnu.org>2004-11-20 12:48:15 +0000
commite7a531ae616ec482c38d8749d5e2f672fe2022ac (patch)
treef97e652167bbb5013f18a7eded4bd5d837950d60 /gcc/tree-ssa-threadupdate.c
parent2075b05db6dbd95bd334cd9a8f1bc085aef642aa (diff)
downloadgcc-e7a531ae616ec482c38d8749d5e2f672fe2022ac.zip
gcc-e7a531ae616ec482c38d8749d5e2f672fe2022ac.tar.gz
gcc-e7a531ae616ec482c38d8749d5e2f672fe2022ac.tar.bz2
tree-ssa-threadupdate.c, [...]: Fix comment typos.
* tree-ssa-threadupdate.c, tree-vectorizer.c: Fix comment typos. * config/arm/arm.c: Follow spelling conventions. From-SVN: r90963
Diffstat (limited to 'gcc/tree-ssa-threadupdate.c')
-rw-r--r--gcc/tree-ssa-threadupdate.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/tree-ssa-threadupdate.c b/gcc/tree-ssa-threadupdate.c
index d252196..8d205fd 100644
--- a/gcc/tree-ssa-threadupdate.c
+++ b/gcc/tree-ssa-threadupdate.c
@@ -106,7 +106,7 @@ struct el
/* We need to efficiently record the unique thread destinations of this
block and specific information associated with those destinations. We
may have many incoming edges threaded to the same outgoing edge. This
- can be naturaly implemented with a hash table. */
+ can be naturally implemented with a hash table. */
struct redirection_data
{
@@ -467,7 +467,7 @@ thread_block (basic_block bb)
bool all = true;
/* To avoid scanning a linear array for the element we need we instead
- use a hash table. For normal code there should be no noticable
+ use a hash table. For normal code there should be no noticeable
difference. However, if we have a block with a large number of
incoming and outgoing edges such linear searches can get expensive. */
redirection_data = htab_create (EDGE_COUNT (bb->succs),