mirror of
git://gcc.gnu.org/git/gcc.git
synced 2025-03-28 16:01:00 +08:00
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
This commit is contained in:
parent
cb275d32f7
commit
cc9795d4aa
@ -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>
|
||||
|
||||
|
@ -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;
|
||||
}
|
||||
|
||||
|
@ -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;
|
||||
}
|
||||
}
|
||||
|
@ -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);
|
||||
|
@ -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
|
||||
|
@ -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;
|
||||
|
||||
|
@ -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)
|
||||
{
|
||||
|
@ -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.")
|
||||
|
@ -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;
|
||||
}
|
||||
|
@ -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;
|
||||
}
|
||||
|
||||
|
@ -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;
|
||||
}
|
||||
|
||||
|
Loading…
x
Reference in New Issue
Block a user