cgraphunit.c, [...]: Fix typos and follow spelling conventions in error/dump messages.

	* cgraphunit.c, ipa-inline.c, loop-iv.c, modulo-sched.c,
	opts.c, postreload-gcse.c, tree-browser.def, tree-eh.c,
	tree-ssa-copyrename.c, tree-vect-analyze.c: Fix typos and
	follow spelling conventions in error/dump messages.

From-SVN: r100330

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 33df7c513db4beb8fe6f02342e36d891b1e94809..773b2d57a560f846d281d66d959efe570db76b87 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,10 @@
+2005-05-29  Kazu Hirata  <kazu@cs.umass.edu>
+
+       * cgraphunit.c, ipa-inline.c, loop-iv.c, modulo-sched.c,
+       opts.c, postreload-gcse.c, tree-browser.def, tree-eh.c,
+       tree-ssa-copyrename.c, tree-vect-analyze.c: Fix typos and
+       follow spelling conventions in error/dump messages.
+
 2005-05-29  Roger Sayle  <roger@eyesopen.com>
            Richard Henderson  <rth@redhat.com>
 

diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c
index 81436aab2ff04e1099d35d9f297ee4fc83d47213..67c3c22118d67392deb67789e526c50653a73cc4 100644 (file)
--- a/gcc/cgraphunit.c
+++ b/gcc/cgraphunit.c
@@ -610,7 +610,7 @@ verify_cgraph_node (struct cgraph_node *node)
     }
   if (node->global.inlined_to == node)
     {
-      error ("Inlined_to pointer reffers to itself");
+      error ("Inlined_to pointer refers to itself");
       error_found = true;
     }
 

diff --git a/gcc/ipa-inline.c b/gcc/ipa-inline.c
index fbda466e558c58313916881a11800646d600f79c..e58ac0f0cfa6cde08f954109c052c6fde0460b63 100644 (file)
--- a/gcc/ipa-inline.c
+++ b/gcc/ipa-inline.c
@@ -630,7 +630,7 @@ cgraph_decide_inlining_of_small_functions (void)
              edge->inline_failed
                = (edge->callee->local.disregard_inline_limits ? N_("recursive inlining") : "");
              if (dump_file)
-               fprintf (dump_file, " inline_failed:Recursive inlining perfomed only for function itself.\n");
+               fprintf (dump_file, " inline_failed:Recursive inlining performed only for function itself.\n");
              continue;
            }
        }

diff --git a/gcc/loop-iv.c b/gcc/loop-iv.c
index bacf8382b7f9440937419d84c74b7847b109c5d0..ba0d64c78f34e2214cd62f1df8f1271fb7766569 100644 (file)
--- a/gcc/loop-iv.c
+++ b/gcc/loop-iv.c
@@ -844,7 +844,7 @@ iv_analyze_biv (rtx def, struct rtx_iv *iv)
 
   if (dump_file)
     {
-      fprintf (dump_file, "Analysing ");
+      fprintf (dump_file, "Analyzing ");
       print_rtl (dump_file, def);
       fprintf (dump_file, " for bivness.\n");
     }
@@ -927,7 +927,7 @@ iv_analyze_op (rtx insn, rtx op, struct rtx_iv *iv)
 
   if (dump_file)
     {
-      fprintf (dump_file, "Analysing operand ");
+      fprintf (dump_file, "Analyzing operand ");
       print_rtl (dump_file, op);
       fprintf (dump_file, " of insn ");
       print_rtl_single (dump_file, insn);
@@ -1012,7 +1012,7 @@ iv_analyze (rtx insn, rtx def, struct rtx_iv *iv)
 
   if (dump_file)
     {
-      fprintf (dump_file, "Analysing def of ");
+      fprintf (dump_file, "Analyzing def of ");
       print_rtl (dump_file, def);
       fprintf (dump_file, " in insn ");
       print_rtl_single (dump_file, insn);

diff --git a/gcc/modulo-sched.c b/gcc/modulo-sched.c
index 2dffc3170a116f88c9dca2420e2022c8a60c043d..4fc57c546f75ca7f9b2177dd81175bb1b2c46e8b 100644 (file)
--- a/gcc/modulo-sched.c
+++ b/gcc/modulo-sched.c
@@ -1283,7 +1283,7 @@ sms_schedule (FILE *dump_file)
              /* SMS is not profitable so undo the permutation and reg move generation
                 and return the kernel to its original state.  */
              if (dump_file)
-               fprintf (dump_file, "Undoing SMS becuase it is not profitable.\n");
+               fprintf (dump_file, "Undoing SMS because it is not profitable.\n");
 
            }
          else

diff --git a/gcc/opts.c b/gcc/opts.c
index 36d272c4097760db959f1a7086c3914a51638bd3..44ed37bad4c919cf7f287769fb623ae9f8a41d31 100644 (file)
--- a/gcc/opts.c
+++ b/gcc/opts.c
@@ -927,7 +927,7 @@ common_handle_option (size_t scode, const char *arg, int value)
         else if (!strcmp(arg, "protected"))
           default_visibility = VISIBILITY_PROTECTED;
         else
-          error ("unrecognised visibility value \"%s\"", arg);
+          error ("unrecognized visibility value \"%s\"", arg);
       }
       break;
 

diff --git a/gcc/postreload-gcse.c b/gcc/postreload-gcse.c
index 3734ed1c6090297102692dd9d6bb40b8610c3b7a..b821db1a122a48472102e95e68d58ca7711587bf 100644 (file)
--- a/gcc/postreload-gcse.c
+++ b/gcc/postreload-gcse.c
@@ -439,7 +439,7 @@ dump_hash_table_entry (void **slot, void *filep)
   fprintf (file, "expr: ");
   print_rtl (file, expr->expr);
   fprintf (file,"\nhashcode: %u\n", expr->hash);
-  fprintf (file,"list of occurences:\n");
+  fprintf (file,"list of occurrences:\n");
   occr = expr->avail_occr;
   while (occr)
     {

diff --git a/gcc/tree-browser.def b/gcc/tree-browser.def
index 57fb1df804486bc893bbeaa6d688c226aa89cf98..ef14492d83f5381823fcc731aa0461ad2e5dc072 100644 (file)
--- a/gcc/tree-browser.def
+++ b/gcc/tree-browser.def
@@ -33,7 +33,7 @@ DEFTBCODE (TB_UPDATE_UP,        "update", "Update information about parent expre
 DEFTBCODE (TB_VERBOSE,          "verbose", "Sets/unsets verbose mode (default is on).")
 
 /* Walking commands.  */
-DEFTBCODE (TB_FUN,             "fun",  "Go to the curent function declaration.")
+DEFTBCODE (TB_FUN,             "fun",  "Go to the current function declaration.")
 DEFTBCODE (TB_NEXT,            "nx",   "Go to the next expression in a BIND_EXPR.")
 DEFTBCODE (TB_PREV,            "pr",   "Go to the previous expression in a BIND_EXPR.")
 DEFTBCODE (TB_UP,              "up",   "Go to the parent tree node.")

diff --git a/gcc/tree-eh.c b/gcc/tree-eh.c
index 294e309458b17ea9f52e610a916e2b158aaf8184..573a5ddf9d5728721a5997e00ea36d0f2e4879be 100644 (file)
--- a/gcc/tree-eh.c
+++ b/gcc/tree-eh.c
@@ -1826,7 +1826,7 @@ verify_eh_edges (tree stmt)
     {
       if ((e->flags & EDGE_EH) && !e->aux)
        {
-         error ("Unnecesary EH edge %i->%i", bb->index, e->dest->index);
+         error ("Unnecessary EH edge %i->%i", bb->index, e->dest->index);
          mark_eh_edge_found_error = true;
          return true;
        }

diff --git a/gcc/tree-ssa-copyrename.c b/gcc/tree-ssa-copyrename.c
index 393bfb600c6b196110b8e5ab5f0a5b58559722e8..6656e6ee54321d8f2a9a523782f1adcd860917dc 100644 (file)
--- a/gcc/tree-ssa-copyrename.c
+++ b/gcc/tree-ssa-copyrename.c
@@ -253,7 +253,7 @@ copy_rename_partition_coalesce (var_map map, tree var1, tree var2, FILE *debug)
           != get_alias_set (TREE_TYPE (TREE_TYPE (root2))))
     {
       if (debug)
-       fprintf (debug, " : 2 different alasing sets. No coalesce.\n");
+       fprintf (debug, " : 2 different aliasing sets. No coalesce.\n");
       return;
     }
 

diff --git a/gcc/tree-vect-analyze.c b/gcc/tree-vect-analyze.c
index 9e7918bf0b7b58136dc88a63a58ad0f1b7558f88..7128c491132ba8e9e635d02ffe8e8bb5f08e1690 100644 (file)
--- a/gcc/tree-vect-analyze.c
+++ b/gcc/tree-vect-analyze.c
@@ -2466,7 +2466,7 @@ vect_analyze_loop_form (struct loop *loop)
   if (!empty_block_p (loop->latch))
     {
       if (vect_print_dump_info (REPORT_BAD_FORM_LOOPS, loop_loc))
-        fprintf (vect_dump, "not vectorized: unexpectd loop form.");
+        fprintf (vect_dump, "not vectorized: unexpected loop form.");
       return NULL;
     }