From d90dbd3e0fa581d5f1ce9aa57f70a5a693cf9905 Mon Sep 17 00:00:00 2001 From: kazu Date: Sun, 3 Apr 2005 14:09:57 +0000 Subject: [PATCH] * cfghooks.c, cfgrtl.c, modulo-sched.c, config/i386/winnt.c: Fix comment typos. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@97490 138bc75d-0d04-0410-961f-82ee72b054a4 --- gcc/ChangeLog | 5 +++++ gcc/cfghooks.c | 2 +- gcc/cfgrtl.c | 2 +- gcc/config/i386/winnt.c | 2 +- gcc/modulo-sched.c | 10 +++++----- 5 files changed, 13 insertions(+), 8 deletions(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index fad5db2..4c971bd 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,8 @@ +2005-04-03 Kazu Hirata + + * cfghooks.c, cfgrtl.c, modulo-sched.c, config/i386/winnt.c: + Fix comment typos. + 2005-04-03 Steven Bosscher PR middle-end/20648 diff --git a/gcc/cfghooks.c b/gcc/cfghooks.c index eb21afe..bf79218 100644 --- a/gcc/cfghooks.c +++ b/gcc/cfghooks.c @@ -867,7 +867,7 @@ extract_cond_bb_edges (basic_block b, edge *e1, edge *e2) } /* Responsible for updating the ssa info (PHI nodes) on the - new conidtion basic block that guargs the versioned loop. */ + new condition basic block that guards the versioned loop. */ void lv_adjust_loop_header_phi (basic_block first, basic_block second, basic_block new, edge e) diff --git a/gcc/cfgrtl.c b/gcc/cfgrtl.c index d0a50e4..ea7d1ba 100644 --- a/gcc/cfgrtl.c +++ b/gcc/cfgrtl.c @@ -2998,7 +2998,7 @@ rtl_flow_call_edges_add (sbitmap blocks) } /* Add COMP_RTX as a condition at end of COND_BB. FIRST_HEAD is - the conditional branch traget, SECOND_HEAD should be the fall-thru + the conditional branch target, SECOND_HEAD should be the fall-thru there is no need to handle this here the loop versioning code handles this. the reason for SECON_HEAD is that it is needed for condition in trees, and this should be of the same type since it is a hook. */ diff --git a/gcc/config/i386/winnt.c b/gcc/config/i386/winnt.c index ebd8db7..cfab227 100644 --- a/gcc/config/i386/winnt.c +++ b/gcc/config/i386/winnt.c @@ -681,7 +681,7 @@ i386_pe_asm_named_section (const char *name, unsigned int flags, /* Functions may have been compiled at various levels of optimization so we can't use `same_size' here. Instead, have the linker pick one, without warning. - If 'selectany' attibute has been specified, MS compiler + If 'selectany' attribute has been specified, MS compiler sets 'discard' characteristic, rather than telling linker to warn of size or content mismatch, so do the same. */ bool discard = (flags & SECTION_CODE) diff --git a/gcc/modulo-sched.c b/gcc/modulo-sched.c index a2443c1..2a7beee 100644 --- a/gcc/modulo-sched.c +++ b/gcc/modulo-sched.c @@ -934,7 +934,7 @@ canon_loop (struct loop *loop) /* Build the loop information without loop canonization, the loop canonization will - be perfromed if the loop is SMSable. */ + be performed if the loop is SMSable. */ static struct loops * build_loops_structure (FILE *dumpfile) { @@ -1417,11 +1417,11 @@ sms_schedule (FILE *dump_file) #define DFA_HISTORY SMS_DFA_HISTORY /* Given the partial schedule PS, this function calculates and returns the - cycles in wich we can schedule the node with the given index I. + cycles in which we can schedule the node with the given index I. NOTE: Here we do the backtracking in SMS, in some special cases. We have noticed that there are several cases in which we fail to SMS the loop because the sched window of a node is empty due to tight data-deps. In - such cases we want to unschedule some of the predecssors/successors + such cases we want to unschedule some of the predecessors/successors until we get non-empty scheduling window. It returns -1 if the scheduling window is empty and zero otherwise. */ @@ -2535,8 +2535,8 @@ rotate_partial_schedule (partial_schedule_ptr ps, int start_cycle) ps->min_cycle -= start_cycle; } -/* Remove the node N from the partial schedule PS; becuase we restart the DFA - each time we want to check for resuorce conflicts; this is equivalent to +/* Remove the node N from the partial schedule PS; because we restart the DFA + each time we want to check for resource conflicts; this is equivalent to unscheduling the node N. */ static bool ps_unschedule_node (partial_schedule_ptr ps, ddg_node_ptr n) -- 2.7.4