bb-reorder.c, [...]: Fix comment typos.

* bb-reorder.c, c-common.c, c-incpath.c, c-typeck.c,
	genrecog.c, lambda-code.c, mips-tdump.c, mips-tfile.c,
	passes.c, tree-data-ref.c, tree-data-ref.h, tree-mudflap.c,
	tree-scalar-evolution.c, tree-ssa-copyrename.c,
	tree-ssa-live.c, tree-ssa-live.h: Fix comment typos.

From-SVN: r87302

gcc/ChangeLog

@@ -1,3 +1,11 @@
+2004-09-10  Kazu Hirata  <kazu@cs.umass.edu>
+
+	* bb-reorder.c, c-common.c, c-incpath.c, c-typeck.c,
+	genrecog.c, lambda-code.c, mips-tdump.c, mips-tfile.c,
+	passes.c, tree-data-ref.c, tree-data-ref.h, tree-mudflap.c,
+	tree-scalar-evolution.c, tree-ssa-copyrename.c,
+	tree-ssa-live.c, tree-ssa-live.h: Fix comment typos.
+
 2004-09-10  Richard Sandiford  <rsandifo@redhat.com>
 
 	* config/frv/frv.md (UNSPEC_MASACCS, UNSPEC_MDASACCS): New constants.

gcc/bb-reorder.c

@@ -517,7 +517,7 @@ find_traces_1_round (int branch_th, int exec_th, gcov_type count_th,
 	      freq = EDGE_FREQUENCY (e);
 
 	      /* Edge that cannot be fallthru or improbable or infrequent
-		 successor (ie. it is unsuitable successor).  */
+		 successor (i.e. it is unsuitable successor).  */
 	      if (!(e->flags & EDGE_CAN_FALLTHRU) || (e->flags & EDGE_COMPLEX)
 		  || prob < branch_th || freq < exec_th || e->count < count_th)
 		continue;

gcc/c-common.c

@@ -1441,14 +1441,14 @@ check_case_value (tree value)
 }
 
 /* See if the case values LOW and HIGH are in the range of the original
-   type (ie. before the default conversion to int) of the switch testing
+   type (i.e. before the default conversion to int) of the switch testing
    expression.
    TYPE is the promoted type of the testing expression, and ORIG_TYPE is
    the type before promoting it.  CASE_LOW_P is a pointer to the lower
    bound of the case label, and CASE_HIGH_P is the upper bound or NULL
    if the case is not a case range.
    The caller has to make sure that we are not called with NULL for
-   CASE_LOW_P (ie. the default case).
+   CASE_LOW_P (i.e. the default case).
    Returns true if the case label is in range of ORIG_TYPE (satured or
    untouched) or false if the label is out of range.  */
 

gcc/c-incpath.c

@@ -128,7 +128,7 @@ add_standard_paths (const char *sysroot, const char *iprefix, int cxx_stdinc)
   if (iprefix && (len = cpp_GCC_INCLUDE_DIR_len) != 0)
     {
       /* Look for directories that start with the standard prefix.
-	 "Translate" them, ie. replace /usr/local/lib/gcc... with
+	 "Translate" them, i.e. replace /usr/local/lib/gcc... with
 	 IPREFIX and search them first.  */
       for (p = cpp_include_defaults; p->fname; p++)
 	{

gcc/c-typeck.c

@@ -6409,7 +6409,7 @@ struct c_switch {
   /* The SWITCH_STMT being built.  */
   tree switch_stmt;
 
-  /* The original type of the testing expression, ie. before the
+  /* The original type of the testing expression, i.e. before the
      default conversion is applied.  */
   tree orig_type;
 

gcc/genrecog.c

@@ -992,7 +992,7 @@ add_to_sequence (rtx pattern, struct decision_head *last, const char *position,
 	if (allows_const_int)
 	  mode = VOIDmode;
 
-	/* Accept the operand, ie. record it in `operands'.  */
+	/* Accept the operand, i.e. record it in `operands'.  */
 	test = new_decision_test (DT_accept_op, &place);
 	test->u.opno = XINT (pattern, 0);
 

gcc/lambda-code.c

@@ -1931,7 +1931,7 @@ lambda_vector_lexico_pos (lambda_vector v, unsigned n)
    matrix T is legal when applied to a loop nest with a set of
    lexicographically non-negative distance vectors RDG if and only if
    for each vector d in RDG, (T.d >= 0) is lexicographically positive.
-   ie.: if and only if it transforms the lexicographically positive
+   i.e.: if and only if it transforms the lexicographically positive
    distance vectors to lexicographically positive vectors.  Note that
    a unimodular matrix must transform the zero vector (and only it) to
    the zero vector." S.Muchnick.  */

gcc/mips-tdump.c

@@ -122,7 +122,7 @@ typedef enum st {
   st_Enum	= stEnum,	/* enum */
 #endif
   st_Str	= stStr,	/* string */
-  st_Number	= stNumber,	/* pure number (ie. 4 NOR 2+2) */
+  st_Number	= stNumber,	/* pure number (i.e. 4 NOR 2+2) */
   st_Expr	= stExpr,	/* 2+2 vs. 4 */
   st_Type	= stType,	/* post-coercion SER */
   st_Max	= stMax		/* max type+1 */

gcc/mips-tfile.c

@@ -737,7 +737,7 @@ typedef enum st {
   st_StaticProc	= stStaticProc,	/* load time only static procs */
   st_Constant	= stConstant,	/* const */
   st_Str	= stStr,	/* string */
-  st_Number	= stNumber,	/* pure number (ie. 4 NOR 2+2) */
+  st_Number	= stNumber,	/* pure number (i.e. 4 NOR 2+2) */
   st_Expr	= stExpr,	/* 2+2 vs. 4 */
   st_Type	= stType,	/* post-coercion SER */
   st_Max	= stMax		/* max type+1 */

gcc/passes.c

@@ -407,7 +407,7 @@ rest_of_handle_stack_regs (void)
 }
 #endif
 
-/* Track the variables, ie. compute where the variable is stored at each position in function.  */
+/* Track the variables, i.e. compute where the variable is stored at each position in function.  */
 static void
 rest_of_handle_variable_tracking (void)
 {
@@ -1570,7 +1570,7 @@ rest_of_clean_state (void)
    after all tree passes have finished for a single function, and we
    have expanded the function body from trees to RTL.
    Once we are here, we have decided that we're supposed to output
-   that function, ie. that we should write assembler code for it.
+   that function, i.e. that we should write assembler code for it.
 
    We run a series of low-level passes here on the function's RTL
    representation.  Each pass is called via a rest_of_* function.  */

gcc/tree-data-ref.c

@@ -492,8 +492,8 @@ dump_data_dependence_direction (FILE *file,
 
 /* Given an ARRAY_REF node REF, records its access functions.
    Example: given A[i][3], record in ACCESS_FNS the opnd1 function,
-   ie. the constant "3", then recursively call the function on opnd0,
-   ie. the ARRAY_REF "A[i]".  The function returns the base name:
+   i.e. the constant "3", then recursively call the function on opnd0,
+   i.e. the ARRAY_REF "A[i]".  The function returns the base name:
    "A".  */
 
 static tree
@@ -958,7 +958,7 @@ analyze_subscript_affine_affine (tree chrec_a,
      For answering to the question: "Is there a dependence?" we have
      to prove that there exists a solution to the Diophantine
      equation, and that the solution is in the iteration domain,
-     ie. the solution is positive or zero, and that the solution
+     i.e. the solution is positive or zero, and that the solution
      happens before the upper bound loop.nb_iterations.  Otherwise
      there is no dependence.  This function outputs a description of
      the iterations that hold the intersections.  */
@@ -1049,7 +1049,7 @@ analyze_subscript_affine_affine (tree chrec_a,
       if (!tree_fold_divides_p (integer_type_node, gcd_alpha_beta, gamma))
 	{
 	  /* The "gcd-test" has determined that there is no integer
-	     solution, ie. there is no dependence.  */
+	     solution, i.e. there is no dependence.  */
 	  *overlaps_a = chrec_known;
 	  *overlaps_b = chrec_known;
 	}
@@ -1717,7 +1717,7 @@ compute_affine_dependence (struct data_dependence_relation *ddr)
 
 /* Compute a subset of the data dependence relation graph.  Don't
    compute read-read relations, and avoid the computation of the
-   opposite relation, ie. when AB has been computed, don't compute BA.
+   opposite relation, i.e. when AB has been computed, don't compute BA.
    DATAREFS contains a list of data references, and the result is set
    in DEPENDENCE_RELATIONS.  */
 

gcc/tree-data-ref.h

@@ -86,7 +86,7 @@ struct subscript
   
   /* Distance from the iteration that access a conflicting element in
      A to the iteration that access this same conflicting element in
-     B.  The distance is a tree scalar expression, ie. a constant or a
+     B.  The distance is a tree scalar expression, i.e. a constant or a
      symbolic expression, but certainly not a chrec function.  */
   tree distance;
 };

gcc/tree-mudflap.c

@@ -634,7 +634,7 @@ mf_build_check_statement_for (tree addr, tree size,
      The lowered GIMPLE tree representing this code is in the statement
      list starting at 'head'.
 
-     We can insert this now in the current basic block, ie. the one that
+     We can insert this now in the current basic block, i.e. the one that
      the statement we're instrumenting was originally in.  */
   bsi = bsi_last (cond_bb);
   for (tsi = head; ! tsi_end_p (tsi); tsi_next (&tsi))

gcc/tree-scalar-evolution.c

@@ -1367,7 +1367,7 @@ follow_ssa_edge_in_condition_phi_branch (int i,
     }
 
   /* This case occurs when one of the condition branches sets 
-     the variable to a constant: ie. a phi-node like
+     the variable to a constant: i.e. a phi-node like
      "a_2 = PHI <a_7(5), 2(6)>;".  
 	 
      FIXME:  This case have to be refined correctly: 
@@ -1491,7 +1491,7 @@ follow_ssa_edge (struct loop *loop,
 	return true;
 	  
       /* Otherwise, the evolution of the HALTING_PHI depends
-	 on the evolution of another loop-phi-node, ie. the
+	 on the evolution of another loop-phi-node, i.e. the
 	 evolution function is a higher degree polynomial.  */
       if (def_loop == loop)
 	return false;
@@ -1564,7 +1564,7 @@ analyze_evolution_in_loop (tree loop_phi_node,
 	      
       /* When it is impossible to go back on the same
 	 loop_phi_node by following the ssa edges, the
-	 evolution is represented by a peeled chrec, ie. the
+	 evolution is represented by a peeled chrec, i.e. the
 	 first iteration, EV_FN has the value INIT_COND, then
 	 all the other iterations it has the value of ARG.  
 	 For the moment, PEELED_CHREC nodes are not built.  */

gcc/tree-ssa-copyrename.c

@@ -48,7 +48,7 @@ extern void rename_ssa_copies (void);
 
    Each copy is examined to determine if it is possible to rename the base
    variable of one of the operands to the same variable as the other operand.
-   ie.
+   i.e.
    T.3_5 = <blah>
    a_1 = T.3_5
 

gcc/tree-ssa-live.c

@@ -133,7 +133,7 @@ var_union (var_map map, tree var1, tree var2)
       if (map->compact_to_partition)
         p2 = map->compact_to_partition[p2];
 
-      /* If there is no root_var set, or its not a user variable, set the
+      /* If there is no root_var set, or it's not a user variable, set the
 	 root_var to this one.  */
       if (!root_var || (DECL_P (root_var) && DECL_IGNORED_P (root_var)))
         {

gcc/tree-ssa-live.h

@@ -130,7 +130,7 @@ static inline tree version_to_var (var_map map, int version)
  
 
 /* Given VAR, return the partition number in MAP which contains it.  
-   NO_PARTITION is returned if its not in any partition.  */
+   NO_PARTITION is returned if it's not in any partition.  */
 
 static inline int
 var_to_partition (var_map map, tree var)