Commit cc9795d4 by Kazu Hirata Committed by Kazu Hirata

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
parent cb275d32
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> 2005-05-29 Roger Sayle <roger@eyesopen.com>
Richard Henderson <rth@redhat.com> Richard Henderson <rth@redhat.com>
......
...@@ -610,7 +610,7 @@ verify_cgraph_node (struct cgraph_node *node) ...@@ -610,7 +610,7 @@ verify_cgraph_node (struct cgraph_node *node)
} }
if (node->global.inlined_to == node) if (node->global.inlined_to == node)
{ {
error ("Inlined_to pointer reffers to itself"); error ("Inlined_to pointer refers to itself");
error_found = true; error_found = true;
} }
......
...@@ -630,7 +630,7 @@ cgraph_decide_inlining_of_small_functions (void) ...@@ -630,7 +630,7 @@ cgraph_decide_inlining_of_small_functions (void)
edge->inline_failed edge->inline_failed
= (edge->callee->local.disregard_inline_limits ? N_("recursive inlining") : ""); = (edge->callee->local.disregard_inline_limits ? N_("recursive inlining") : "");
if (dump_file) 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; continue;
} }
} }
......
...@@ -844,7 +844,7 @@ iv_analyze_biv (rtx def, struct rtx_iv *iv) ...@@ -844,7 +844,7 @@ iv_analyze_biv (rtx def, struct rtx_iv *iv)
if (dump_file) if (dump_file)
{ {
fprintf (dump_file, "Analysing "); fprintf (dump_file, "Analyzing ");
print_rtl (dump_file, def); print_rtl (dump_file, def);
fprintf (dump_file, " for bivness.\n"); fprintf (dump_file, " for bivness.\n");
} }
...@@ -927,7 +927,7 @@ iv_analyze_op (rtx insn, rtx op, struct rtx_iv *iv) ...@@ -927,7 +927,7 @@ iv_analyze_op (rtx insn, rtx op, struct rtx_iv *iv)
if (dump_file) if (dump_file)
{ {
fprintf (dump_file, "Analysing operand "); fprintf (dump_file, "Analyzing operand ");
print_rtl (dump_file, op); print_rtl (dump_file, op);
fprintf (dump_file, " of insn "); fprintf (dump_file, " of insn ");
print_rtl_single (dump_file, insn); print_rtl_single (dump_file, insn);
...@@ -1012,7 +1012,7 @@ iv_analyze (rtx insn, rtx def, struct rtx_iv *iv) ...@@ -1012,7 +1012,7 @@ iv_analyze (rtx insn, rtx def, struct rtx_iv *iv)
if (dump_file) if (dump_file)
{ {
fprintf (dump_file, "Analysing def of "); fprintf (dump_file, "Analyzing def of ");
print_rtl (dump_file, def); print_rtl (dump_file, def);
fprintf (dump_file, " in insn "); fprintf (dump_file, " in insn ");
print_rtl_single (dump_file, insn); print_rtl_single (dump_file, insn);
......
...@@ -1283,7 +1283,7 @@ sms_schedule (FILE *dump_file) ...@@ -1283,7 +1283,7 @@ sms_schedule (FILE *dump_file)
/* SMS is not profitable so undo the permutation and reg move generation /* SMS is not profitable so undo the permutation and reg move generation
and return the kernel to its original state. */ and return the kernel to its original state. */
if (dump_file) 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 else
......
...@@ -927,7 +927,7 @@ common_handle_option (size_t scode, const char *arg, int value) ...@@ -927,7 +927,7 @@ common_handle_option (size_t scode, const char *arg, int value)
else if (!strcmp(arg, "protected")) else if (!strcmp(arg, "protected"))
default_visibility = VISIBILITY_PROTECTED; default_visibility = VISIBILITY_PROTECTED;
else else
error ("unrecognised visibility value \"%s\"", arg); error ("unrecognized visibility value \"%s\"", arg);
} }
break; break;
......
...@@ -439,7 +439,7 @@ dump_hash_table_entry (void **slot, void *filep) ...@@ -439,7 +439,7 @@ dump_hash_table_entry (void **slot, void *filep)
fprintf (file, "expr: "); fprintf (file, "expr: ");
print_rtl (file, expr->expr); print_rtl (file, expr->expr);
fprintf (file,"\nhashcode: %u\n", expr->hash); fprintf (file,"\nhashcode: %u\n", expr->hash);
fprintf (file,"list of occurences:\n"); fprintf (file,"list of occurrences:\n");
occr = expr->avail_occr; occr = expr->avail_occr;
while (occr) while (occr)
{ {
......
...@@ -33,7 +33,7 @@ DEFTBCODE (TB_UPDATE_UP, "update", "Update information about parent expre ...@@ -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).") DEFTBCODE (TB_VERBOSE, "verbose", "Sets/unsets verbose mode (default is on).")
/* Walking commands. */ /* 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_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_PREV, "pr", "Go to the previous expression in a BIND_EXPR.")
DEFTBCODE (TB_UP, "up", "Go to the parent tree node.") DEFTBCODE (TB_UP, "up", "Go to the parent tree node.")
......
...@@ -1826,7 +1826,7 @@ verify_eh_edges (tree stmt) ...@@ -1826,7 +1826,7 @@ verify_eh_edges (tree stmt)
{ {
if ((e->flags & EDGE_EH) && !e->aux) 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; mark_eh_edge_found_error = true;
return true; return true;
} }
......
...@@ -253,7 +253,7 @@ copy_rename_partition_coalesce (var_map map, tree var1, tree var2, FILE *debug) ...@@ -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)))) != get_alias_set (TREE_TYPE (TREE_TYPE (root2))))
{ {
if (debug) if (debug)
fprintf (debug, " : 2 different alasing sets. No coalesce.\n"); fprintf (debug, " : 2 different aliasing sets. No coalesce.\n");
return; return;
} }
......
...@@ -2466,7 +2466,7 @@ vect_analyze_loop_form (struct loop *loop) ...@@ -2466,7 +2466,7 @@ vect_analyze_loop_form (struct loop *loop)
if (!empty_block_p (loop->latch)) if (!empty_block_p (loop->latch))
{ {
if (vect_print_dump_info (REPORT_BAD_FORM_LOOPS, loop_loc)) 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; return NULL;
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment