cfghooks.c, [...]: Fix comment typos.

	* cfghooks.c, cfgrtl.c, modulo-sched.c, config/i386/winnt.c:
	Fix comment typos.

From-SVN: r97490

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index fad5db2d89ba609589c07478aab123b397706967..4c971bdfa203c5a3d442f101e06f5822afca88be 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+2005-04-03  Kazu Hirata  <kazu@cs.umass.edu>
+
+       * cfghooks.c, cfgrtl.c, modulo-sched.c, config/i386/winnt.c:
+       Fix comment typos.
+
 2005-04-03  Steven Bosscher  <stevenb@suse.de>
 
        PR middle-end/20648

diff --git a/gcc/cfghooks.c b/gcc/cfghooks.c
index eb21afe6fa1aab94c91d29cfe6ec7c975eec8cf0..bf7921806b25b8a75d424d51e12dfd0b1ec8885f 100644 (file)
--- 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 d0a50e46a8e03ab0fdab0fdd7dfd9b1339c383fc..ea7d1ba9b623f2b82c32729757ef1b7d51794677 100644 (file)
--- 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 ebd8db7525273d3fa17bbc8e773db6267ff4b957..cfab2270b68a86d2f3ea9ea96838df05638226e7 100644 (file)
--- 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 a2443c1748030c0378d49f313180ebd876573880..2a7beee065e687ec08f82f802f6dd9fbe904f89e 100644 (file)
--- 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)