Remove trailing white spaces.

2009-11-25  H.J. Lu  <hongjiu.lu@intel.com>

	* alias.c: Remove trailing white spaces.
	* alloc-pool.c: Likewise.
	* alloc-pool.h: Likewise.
	* attribs.c: Likewise.
	* auto-inc-dec.c: Likewise.
	* basic-block.h: Likewise.
	* bb-reorder.c: Likewise.
	* bt-load.c: Likewise.
	* builtins.c: Likewise.
	* builtins.def: Likewise.
	* c-common.c: Likewise.
	* c-common.h: Likewise.
	* c-cppbuiltin.c: Likewise.
	* c-decl.c: Likewise.
	* c-format.c: Likewise.
	* c-lex.c: Likewise.
	* c-omp.c: Likewise.
	* c-opts.c: Likewise.
	* c-parser.c: Likewise.
	* c-pretty-print.c: Likewise.
	* c-tree.h: Likewise.
	* c-typeck.c: Likewise.
	* caller-save.c: Likewise.
	* calls.c: Likewise.
	* cfg.c: Likewise.
	* cfganal.c: Likewise.
	* cfgexpand.c: Likewise.
	* cfghooks.c: Likewise.
	* cfghooks.h: Likewise.
	* cfglayout.c: Likewise.
	* cfgloop.c: Likewise.
	* cfgloop.h: Likewise.
	* cfgloopmanip.c: Likewise.
	* cfgrtl.c: Likewise.
	* cgraph.c: Likewise.
	* cgraph.h: Likewise.
	* cgraphbuild.c: Likewise.
	* cgraphunit.c: Likewise.
	* cif-code.def: Likewise.
	* collect2.c: Likewise.
	* combine.c: Likewise.
	* convert.c: Likewise.
	* coverage.c: Likewise.
	* crtstuff.c: Likewise.
	* cse.c: Likewise.
	* cselib.c: Likewise.
	* dbgcnt.c: Likewise.
	* dbgcnt.def: Likewise.
	* dbgcnt.h: Likewise.
	* dbxout.c: Likewise.
	* dce.c: Likewise.
	* ddg.c: Likewise.
	* ddg.h: Likewise.
	* defaults.h: Likewise.
	* df-byte-scan.c: Likewise.
	* df-core.c: Likewise.
	* df-problems.c: Likewise.
	* df-scan.c: Likewise.
	* df.h: Likewise.
	* dfp.c: Likewise.
	* diagnostic.c: Likewise.
	* diagnostic.h: Likewise.
	* dominance.c: Likewise.
	* domwalk.c: Likewise.
	* double-int.c: Likewise.
	* double-int.h: Likewise.
	* dse.c: Likewise.
	* dwarf2asm.c: Likewise.
	* dwarf2asm.h: Likewise.
	* dwarf2out.c: Likewise.
	* ebitmap.c: Likewise.
	* ebitmap.h: Likewise.
	* emit-rtl.c: Likewise.
	* et-forest.c: Likewise.
	* except.c: Likewise.
	* except.h: Likewise.
	* expmed.c: Likewise.
	* expr.c: Likewise.
	* expr.h: Likewise.
	* final.c: Likewise.
	* flags.h: Likewise.
	* fold-const.c: Likewise.
	* function.c: Likewise.
	* function.h: Likewise.
	* fwprop.c: Likewise.
	* gcc.c: Likewise.
	* gcov-dump.c: Likewise.
	* gcov-io.c: Likewise.
	* gcov-io.h: Likewise.
	* gcov.c: Likewise.
	* gcse.c: Likewise.
	* genattr.c: Likewise.
	* genattrtab.c: Likewise.
	* genautomata.c: Likewise.
	* genchecksum.c: Likewise.
	* genconfig.c: Likewise.
	* genflags.c: Likewise.
	* gengtype-parse.c: Likewise.
	* gengtype.c: Likewise.
	* gengtype.h: Likewise.
	* genmddeps.c: Likewise.
	* genmodes.c: Likewise.
	* genopinit.c: Likewise.
	* genpreds.c: Likewise.
	* gensupport.c: Likewise.
	* ggc-common.c: Likewise.
	* ggc-page.c: Likewise.
	* ggc-zone.c: Likewise.
	* ggc.h: Likewise.
	* gimple-iterator.c: Likewise.
	* gimple-low.c: Likewise.
	* gimple-pretty-print.c: Likewise.
	* gimple.c: Likewise.
	* gimple.def: Likewise.
	* gimple.h: Likewise.
	* gimplify.c: Likewise.
	* graphds.c: Likewise.
	* graphite-clast-to-gimple.c: Likewise.
	* gthr-nks.h: Likewise.
	* gthr-posix.c: Likewise.
	* gthr-posix.h: Likewise.
	* gthr-posix95.h: Likewise.
	* gthr-single.h: Likewise.
	* gthr-tpf.h: Likewise.
	* gthr-vxworks.h: Likewise.
	* gthr.h: Likewise.
	* haifa-sched.c: Likewise.
	* hard-reg-set.h: Likewise.
	* hooks.c: Likewise.
	* hooks.h: Likewise.
	* hosthooks.h: Likewise.
	* hwint.h: Likewise.
	* ifcvt.c: Likewise.
	* incpath.c: Likewise.
	* init-regs.c: Likewise.
	* integrate.c: Likewise.
	* ipa-cp.c: Likewise.
	* ipa-inline.c: Likewise.
	* ipa-prop.c: Likewise.
	* ipa-pure-const.c: Likewise.
	* ipa-reference.c: Likewise.
	* ipa-struct-reorg.c: Likewise.
	* ipa-struct-reorg.h: Likewise.
	* ipa-type-escape.c: Likewise.
	* ipa-type-escape.h: Likewise.
	* ipa-utils.c: Likewise.
	* ipa-utils.h: Likewise.
	* ipa.c: Likewise.
	* ira-build.c: Likewise.
	* ira-color.c: Likewise.
	* ira-conflicts.c: Likewise.
	* ira-costs.c: Likewise.
	* ira-emit.c: Likewise.
	* ira-int.h: Likewise.
	* ira-lives.c: Likewise.
	* ira.c: Likewise.
	* jump.c: Likewise.
	* lambda-code.c: Likewise.
	* lambda-mat.c: Likewise.
	* lambda-trans.c: Likewise.
	* lambda.h: Likewise.
	* langhooks.c: Likewise.
	* lcm.c: Likewise.
	* libgcov.c: Likewise.
	* lists.c: Likewise.
	* loop-doloop.c: Likewise.
	* loop-init.c: Likewise.
	* loop-invariant.c: Likewise.
	* loop-iv.c: Likewise.
	* loop-unroll.c: Likewise.
	* lower-subreg.c: Likewise.
	* lto-cgraph.c: Likewise.
	* lto-compress.c: Likewise.
	* lto-opts.c: Likewise.
	* lto-section-in.c: Likewise.
	* lto-section-out.c: Likewise.
	* lto-streamer-in.c: Likewise.
	* lto-streamer-out.c: Likewise.
	* lto-streamer.c: Likewise.
	* lto-streamer.h: Likewise.
	* lto-symtab.c: Likewise.
	* lto-wpa-fixup.c: Likewise.
	* matrix-reorg.c: Likewise.
	* mcf.c: Likewise.
	* mode-switching.c: Likewise.
	* modulo-sched.c: Likewise.
	* omega.c: Likewise.
	* omega.h: Likewise.
	* omp-low.c: Likewise.
	* optabs.c: Likewise.
	* optabs.h: Likewise.
	* opts-common.c: Likewise.
	* opts.c: Likewise.
	* params.def: Likewise.
	* params.h: Likewise.
	* passes.c: Likewise.
	* plugin.c: Likewise.
	* postreload-gcse.c: Likewise.
	* postreload.c: Likewise.
	* predict.c: Likewise.
	* predict.def: Likewise.
	* pretty-print.c: Likewise.
	* pretty-print.h: Likewise.
	* print-rtl.c: Likewise.
	* print-tree.c: Likewise.
	* profile.c: Likewise.
	* read-rtl.c: Likewise.
	* real.c: Likewise.
	* recog.c: Likewise.
	* reg-stack.c: Likewise.
	* regcprop.c: Likewise.
	* reginfo.c: Likewise.
	* regmove.c: Likewise.
	* regrename.c: Likewise.
	* regs.h: Likewise.
	* regstat.c: Likewise.
	* reload.c: Likewise.
	* reload1.c: Likewise.
	* resource.c: Likewise.
	* rtl.c: Likewise.
	* rtl.def: Likewise.
	* rtl.h: Likewise.
	* rtlanal.c: Likewise.
	* sbitmap.c: Likewise.
	* sched-deps.c: Likewise.
	* sched-ebb.c: Likewise.
	* sched-int.h: Likewise.
	* sched-rgn.c: Likewise.
	* sched-vis.c: Likewise.
	* sdbout.c: Likewise.
	* sel-sched-dump.c: Likewise.
	* sel-sched-dump.h: Likewise.
	* sel-sched-ir.c: Likewise.
	* sel-sched-ir.h: Likewise.
	* sel-sched.c: Likewise.
	* sel-sched.h: Likewise.
	* sese.c: Likewise.
	* sese.h: Likewise.
	* simplify-rtx.c: Likewise.
	* stack-ptr-mod.c: Likewise.
	* stmt.c: Likewise.
	* stor-layout.c: Likewise.
	* store-motion.c: Likewise.
	* stringpool.c: Likewise.
	* stub-objc.c: Likewise.
	* sync-builtins.def: Likewise.
	* target-def.h: Likewise.
	* target.h: Likewise.
	* targhooks.c: Likewise.
	* targhooks.h: Likewise.
	* timevar.c: Likewise.
	* tlink.c: Likewise.
	* toplev.c: Likewise.
	* toplev.h: Likewise.
	* tracer.c: Likewise.
	* tree-affine.c: Likewise.
	* tree-affine.h: Likewise.
	* tree-browser.def: Likewise.
	* tree-call-cdce.c: Likewise.
	* tree-cfg.c: Likewise.
	* tree-cfgcleanup.c: Likewise.
	* tree-chrec.c: Likewise.
	* tree-chrec.h: Likewise.
	* tree-complex.c: Likewise.
	* tree-data-ref.c: Likewise.
	* tree-data-ref.h: Likewise.
	* tree-dfa.c: Likewise.
	* tree-dump.c: Likewise.
	* tree-dump.h: Likewise.
	* tree-eh.c: Likewise.
	* tree-flow-inline.h: Likewise.
	* tree-flow.h: Likewise.
	* tree-if-conv.c: Likewise.
	* tree-inline.c: Likewise.
	* tree-into-ssa.c: Likewise.
	* tree-loop-distribution.c: Likewise.
	* tree-loop-linear.c: Likewise.
	* tree-mudflap.c: Likewise.
	* tree-nested.c: Likewise.
	* tree-nomudflap.c: Likewise.
	* tree-nrv.c: Likewise.
	* tree-object-size.c: Likewise.
	* tree-optimize.c: Likewise.
	* tree-outof-ssa.c: Likewise.
	* tree-parloops.c: Likewise.
	* tree-pass.h: Likewise.
	* tree-phinodes.c: Likewise.
	* tree-predcom.c: Likewise.
	* tree-pretty-print.c: Likewise.
	* tree-profile.c: Likewise.
	* tree-scalar-evolution.c: Likewise.
	* tree-ssa-address.c: Likewise.
	* tree-ssa-alias.c: Likewise.
	* tree-ssa-ccp.c: Likewise.
	* tree-ssa-coalesce.c: Likewise.
	* tree-ssa-copy.c: Likewise.
	* tree-ssa-copyrename.c: Likewise.
	* tree-ssa-dce.c: Likewise.
	* tree-ssa-dom.c: Likewise.
	* tree-ssa-dse.c: Likewise.
	* tree-ssa-forwprop.c: Likewise.
	* tree-ssa-ifcombine.c: Likewise.
	* tree-ssa-live.c: Likewise.
	* tree-ssa-live.h: Likewise.
	* tree-ssa-loop-ch.c: Likewise.
	* tree-ssa-loop-im.c: Likewise.
	* tree-ssa-loop-ivcanon.c: Likewise.
	* tree-ssa-loop-ivopts.c: Likewise.
	* tree-ssa-loop-manip.c: Likewise.
	* tree-ssa-loop-niter.c: Likewise.
	* tree-ssa-loop-prefetch.c: Likewise.
	* tree-ssa-loop-unswitch.c: Likewise.
	* tree-ssa-loop.c: Likewise.
	* tree-ssa-math-opts.c: Likewise.
	* tree-ssa-operands.c: Likewise.
	* tree-ssa-operands.h: Likewise.
	* tree-ssa-phiopt.c: Likewise.
	* tree-ssa-phiprop.c: Likewise.
	* tree-ssa-pre.c: Likewise.
	* tree-ssa-propagate.c: Likewise.
	* tree-ssa-reassoc.c: Likewise.
	* tree-ssa-sccvn.c: Likewise.
	* tree-ssa-sink.c: Likewise.
	* tree-ssa-structalias.c: Likewise.
	* tree-ssa-ter.c: Likewise.
	* tree-ssa-threadedge.c: Likewise.
	* tree-ssa-threadupdate.c: Likewise.
	* tree-ssa-uncprop.c: Likewise.
	* tree-ssa.c: Likewise.
	* tree-ssanames.c: Likewise.
	* tree-switch-conversion.c: Likewise.
	* tree-tailcall.c: Likewise.
	* tree-vect-data-refs.c: Likewise.
	* tree-vect-generic.c: Likewise.
	* tree-vect-loop-manip.c: Likewise.
	* tree-vect-loop.c: Likewise.
	* tree-vect-patterns.c: Likewise.
	* tree-vect-slp.c: Likewise.
	* tree-vect-stmts.c: Likewise.
	* tree-vectorizer.c: Likewise.
	* tree-vectorizer.h: Likewise.
	* tree-vrp.c: Likewise.
	* tree.c: Likewise.
	* tree.def: Likewise.
	* tree.h: Likewise.
	* treestruct.def: Likewise.
	* unwind-compat.c: Likewise.
	* unwind-dw2-fde-glibc.c: Likewise.
	* unwind-dw2.c: Likewise.
	* value-prof.c: Likewise.
	* value-prof.h: Likewise.
	* var-tracking.c: Likewise.
	* varasm.c: Likewise.
	* varpool.c: Likewise.
	* vec.c: Likewise.
	* vec.h: Likewise.
	* vmsdbgout.c: Likewise.
	* web.c: Likewise.
	* xcoffout.c: Likewise.

From-SVN: r154645

1 files changed, 43 insertions, 43 deletions

diff --git a/gcc/omega.c b/gcc/omega.c
index e307ba2..ff7da4e 100644
--- a/gcc/omega.c
+++ b/gcc/omega.c
@@ -1,5 +1,5 @@
-/* Source code for an implementation of the Omega test, an integer 
-   programming algorithm for dependence analysis, by William Pugh, 
+/* Source code for an implementation of the Omega test, an integer
+   programming algorithm for dependence analysis, by William Pugh,
    appeared in Supercomputing '91 and CACM Aug 92.
 
    This code has no license restrictions, and is considered public
@@ -507,7 +507,7 @@ omega_pretty_print_problem (FILE *file, omega_pb pb)
     none, le, lt
   } partial_order_type;
 
-  partial_order_type **po = XNEWVEC (partial_order_type *, 
+  partial_order_type **po = XNEWVEC (partial_order_type *,
 				     OMEGA_MAX_VARS * OMEGA_MAX_VARS);
   int **po_eq = XNEWVEC (int *, OMEGA_MAX_VARS * OMEGA_MAX_VARS);
   int *last_links = XNEWVEC (int, OMEGA_MAX_VARS);
@@ -673,7 +673,7 @@ omega_pretty_print_problem (FILE *file, omega_pb pb)
 	    }
 
 	  fprintf (file, "%s", omega_variable_to_str (pb, chain[0]));
-	  
+
 	  for (multiprint = false, i = 1; i < m; i++)
 	    {
 	      v = chain[i - 1];
@@ -1310,7 +1310,7 @@ verify_omega_pb (omega_pb pb)
   omega_copy_problem (tmp_problem, pb);
   tmp_problem->safe_vars = 0;
   tmp_problem->num_subs = 0;
-  
+
   for (e = pb->num_geqs - 1; e >= 0; e--)
     if (pb->geqs[e].color == omega_red)
       {
@@ -1358,7 +1358,7 @@ verify_omega_pb (omega_pb pb)
 static void
 adding_equality_constraint (omega_pb pb, int e)
 {
-  if (original_problem != no_problem 
+  if (original_problem != no_problem
       && original_problem != pb
       && !conservative)
     {
@@ -1525,7 +1525,7 @@ normalize_omega_problem (omega_pb pb)
 		    {
 		      i = packing[i0];
 		      pb->geqs[e].coef[i] = pb->geqs[e].coef[i] / g;
-		      hashCode = hashCode * hash_key_multiplier * (i + 3) 
+		      hashCode = hashCode * hash_key_multiplier * (i + 3)
 			+ pb->geqs[e].coef[i];
 		    }
 		}
@@ -1643,7 +1643,7 @@ normalize_omega_problem (omega_pb pb)
 		  }
 
 		if (pb->geqs[e2].coef[0] == -cTerm
-		    && (create_color 
+		    && (create_color
 			|| pb->geqs[e].color == omega_black))
 		  {
 		    omega_copy_eqn (&pb->eqs[pb->num_eqs], &pb->geqs[e],
@@ -1685,7 +1685,7 @@ normalize_omega_problem (omega_pb pb)
 
 	    e2 = fast_lookup[MAX_KEYS + eKey];
 
-	    if (e2 < e && pb->geqs[e2].key == eKey 
+	    if (e2 < e && pb->geqs[e2].key == eKey
 		&& pb->geqs[e2].color == omega_black)
 	      {
 		if (pb->geqs[e2].coef[0] > cTerm)
@@ -1834,7 +1834,7 @@ cleanout_wildcards (omega_pb pb)
 	      for (e2 = pb->num_eqs - 1; e2 >= 0; e2--)
 		if (e != e2 && pb->eqs[e2].coef[i]
 		    && (pb->eqs[e2].color == omega_red
-			|| (pb->eqs[e2].color == omega_black 
+			|| (pb->eqs[e2].color == omega_black
 			    && pb->eqs[e].color == omega_black)))
 		  {
 		    eqn eqn = &(pb->eqs[e2]);
@@ -1853,9 +1853,9 @@ cleanout_wildcards (omega_pb pb)
 		  }
 
 	      for (e2 = pb->num_geqs - 1; e2 >= 0; e2--)
-		if (pb->geqs[e2].coef[i] 
+		if (pb->geqs[e2].coef[i]
 		    && (pb->geqs[e2].color == omega_red
-			|| (pb->eqs[e].color == omega_black 
+			|| (pb->eqs[e].color == omega_black
 			    && pb->geqs[e2].color == omega_black)))
 		  {
 		    eqn eqn = &(pb->geqs[e2]);
@@ -1875,9 +1875,9 @@ cleanout_wildcards (omega_pb pb)
 		  }
 
 	      for (e2 = pb->num_subs - 1; e2 >= 0; e2--)
-		if (pb->subs[e2].coef[i] 
+		if (pb->subs[e2].coef[i]
 		    && (pb->subs[e2].color == omega_red
-			|| (pb->subs[e2].color == omega_black 
+			|| (pb->subs[e2].color == omega_black
 			    && pb->eqs[e].color == omega_black)))
 		  {
 		    eqn eqn = &(pb->subs[e2]);
@@ -1975,7 +1975,7 @@ omega_unprotect_1 (omega_pb pb, int *idx, bool *unprotect)
 static void
 resurrect_subs (omega_pb pb)
 {
-  if (pb->num_subs > 0 
+  if (pb->num_subs > 0
       && please_no_equalities_in_simplified_problems == 0)
     {
       int i, e, n, m;
@@ -2132,7 +2132,7 @@ omega_eliminate_redundant (omega_pb pb, bool expensive)
 	    continue;
 
 	  foundPQ:
-	    pz = ((zeqs[e1] & zeqs[e2]) | (peqs[e1] & neqs[e2]) 
+	    pz = ((zeqs[e1] & zeqs[e2]) | (peqs[e1] & neqs[e2])
 		  | (neqs[e1] & peqs[e2]));
 	    pp = peqs[e1] | peqs[e2];
 	    pn = neqs[e1] | neqs[e2];
@@ -2162,7 +2162,7 @@ omega_eliminate_redundant (omega_pb pb, bool expensive)
 		  if (alpha3 > 0)
 		    {
 		      /* Trying to prove e3 is redundant.  */
-		      if (!implies (peqs[e3], pp) 
+		      if (!implies (peqs[e3], pp)
 			  || !implies (neqs[e3], pn))
 			goto nextE3;
 
@@ -2206,7 +2206,7 @@ omega_eliminate_redundant (omega_pb pb, bool expensive)
 		      /* Trying to prove e3 <= 0 and therefore e3 = 0,
 		        or trying to prove e3 < 0, and therefore the
 		        problem has no solutions.  */
-		      if (!implies (peqs[e3], pn) 
+		      if (!implies (peqs[e3], pn)
 			  || !implies (neqs[e3], pp))
 			goto nextE3;
 
@@ -2267,7 +2267,7 @@ omega_eliminate_redundant (omega_pb pb, bool expensive)
 			      fprintf (dump_file, "\n\n");
 			    }
 
-			  omega_copy_eqn (&pb->eqs[pb->num_eqs++], 
+			  omega_copy_eqn (&pb->eqs[pb->num_eqs++],
 					  &pb->geqs[e3], pb->num_vars);
 			  gcc_assert (pb->num_eqs <= OMEGA_MAX_EQS);
 			  adding_equality_constraint (pb, pb->num_eqs - 1);
@@ -2469,12 +2469,12 @@ coalesce (omega_pb pb)
     is_dead[e] = false;
 
   for (e = 0; e < pb->num_geqs; e++)
-    if (pb->geqs[e].color == omega_red 
+    if (pb->geqs[e].color == omega_red
 	&& !pb->geqs[e].touched)
       for (e2 = e + 1; e2 < pb->num_geqs; e2++)
-	if (!pb->geqs[e2].touched 
+	if (!pb->geqs[e2].touched
 	    && pb->geqs[e].key == -pb->geqs[e2].key
-	    && pb->geqs[e].coef[0] == -pb->geqs[e2].coef[0] 
+	    && pb->geqs[e].coef[0] == -pb->geqs[e2].coef[0]
 	    && pb->geqs[e2].color == omega_red)
 	  {
 	    omega_copy_eqn (&pb->eqs[pb->num_eqs++], &pb->geqs[e],
@@ -2527,7 +2527,7 @@ omega_eliminate_red (omega_pb pb, bool eliminate_all)
   for (e = pb->num_geqs - 1; e >= 0; e--)
     if (pb->geqs[e].color == omega_black && !is_dead[e])
       for (e2 = e - 1; e2 >= 0; e2--)
-	if (pb->geqs[e2].color == omega_black 
+	if (pb->geqs[e2].color == omega_black
 	    && !is_dead[e2])
 	  {
 	    a = 0;
@@ -2557,7 +2557,7 @@ omega_eliminate_red (omega_pb pb, bool eliminate_all)
 	    for (e3 = pb->num_geqs - 1; e3 >= 0; e3--)
 	      if (pb->geqs[e3].color == omega_red)
 		{
-		  alpha1 = (pb->geqs[e2].coef[j] * pb->geqs[e3].coef[i] 
+		  alpha1 = (pb->geqs[e2].coef[j] * pb->geqs[e3].coef[i]
 			    - pb->geqs[e2].coef[i] * pb->geqs[e3].coef[j]);
 		  alpha2 = -(pb->geqs[e].coef[j] * pb->geqs[e3].coef[i]
 			     - pb->geqs[e].coef[i] * pb->geqs[e3].coef[j]);
@@ -2577,7 +2577,7 @@ omega_eliminate_red (omega_pb pb, bool eliminate_all)
 
 		      for (k = pb->num_vars; k >= 0; k--)
 			{
-			  c = (alpha1 * pb->geqs[e].coef[k] 
+			  c = (alpha1 * pb->geqs[e].coef[k]
 			       + alpha2 * pb->geqs[e2].coef[k]);
 
 			  if (c != a * pb->geqs[e3].coef[k])
@@ -2743,7 +2743,7 @@ static void
 omega_problem_reduced (omega_pb pb)
 {
   if (omega_verify_simplification
-      && !in_approximate_mode 
+      && !in_approximate_mode
       && verify_omega_pb (pb) == omega_false)
     return;
 
@@ -2756,7 +2756,7 @@ omega_problem_reduced (omega_pb pb)
   if (!please_no_equalities_in_simplified_problems)
     coalesce (pb);
 
-  if (omega_reduce_with_subs 
+  if (omega_reduce_with_subs
       || please_no_equalities_in_simplified_problems)
     chain_unprotect (pb);
   else
@@ -3448,7 +3448,7 @@ omega_solve_eq (omega_pb pb, enum omega_result desired_res)
 
 	      j = 0;
 	      for (i = pb->num_vars; i != sv; i--)
-		if (pb->eqs[e].coef[i] != 0 
+		if (pb->eqs[e].coef[i] != 0
 		    && factor > abs (pb->eqs[e].coef[i]) + 1)
 		  {
 		    factor = abs (pb->eqs[e].coef[i]) + 1;
@@ -3591,7 +3591,7 @@ omega_solve_geq (omega_pb pb, enum omega_result desired_res)
 		  c = int_div (c, -a);
 
 		if (upper_bound > c
-		    || (upper_bound == c 
+		    || (upper_bound == c
 			&& !omega_eqn_is_red (&pb->geqs[e], desired_res)))
 		  {
 		    upper_bound = c;
@@ -3857,9 +3857,9 @@ omega_solve_geq (omega_pb pb, enum omega_result desired_res)
 	      lucky = (diff >= (Uc - 1) * (Lc - 1));
 	    }
 
-	  if (maxC == 1 
-	      || minC == -1 
-	      || lucky 
+	  if (maxC == 1
+	      || minC == -1
+	      || lucky
 	      || in_approximate_mode)
 	    {
 	      neweqns = score = upper_bound_count * lower_bound_count;
@@ -3870,7 +3870,7 @@ omega_solve_geq (omega_pb pb, enum omega_result desired_res)
 			 "\nlucky = %d, in_approximate_mode=%d \n",
 			 omega_variable_to_str (pb, i),
 			 upper_bound_count,
-			 lower_bound_count, minC, maxC, lucky, 
+			 lower_bound_count, minC, maxC, lucky,
 			 in_approximate_mode);
 
 	      if (!exact
@@ -4163,9 +4163,9 @@ omega_solve_geq (omega_pb pb, enum omega_result desired_res)
 			  {
 			    constantTerm = -int_div (constantTerm, coefficient);
 
-			    if (constantTerm > lower_bound 
-				|| (constantTerm == lower_bound 
-				    && (desired_res != omega_simplify 
+			    if (constantTerm > lower_bound
+				|| (constantTerm == lower_bound
+				    && (desired_res != omega_simplify
 					|| (pb->geqs[Ue].color == omega_black
 					    && pb->geqs[Le].color == omega_black))))
 			      {
@@ -4285,7 +4285,7 @@ omega_solve_geq (omega_pb pb, enum omega_result desired_res)
 		}
 	      else
 		{
-		  if (!conservative 
+		  if (!conservative
 		      && (desired_res != omega_simplify
 			  || (lb_color == omega_black
 			      && ub_color == omega_black))
@@ -4415,7 +4415,7 @@ omega_solve_geq (omega_pb pb, enum omega_result desired_res)
 			      pb->geqs[e2].coef[n_vars + 1] = 0;
 			      pb->geqs[e2].touched = 1;
 
-			      if (pb->geqs[Ue].color == omega_red 
+			      if (pb->geqs[Ue].color == omega_red
 				  || pb->geqs[Le].color == omega_red)
 				pb->geqs[e2].color = omega_red;
 			      else
@@ -4803,7 +4803,7 @@ omega_solve_problem (omega_pb pb, enum omega_result desired_res)
     {
       if (dump_file && (dump_flags & TDF_DETAILS))
 	{
-	  fprintf (dump_file, 
+	  fprintf (dump_file,
 		   "Solve depth = %d, in_approximate_mode = %d, aborting\n",
 		   omega_solve_depth, in_approximate_mode);
 	  omega_print_problem (dump_file, pb);
@@ -4831,7 +4831,7 @@ omega_solve_problem (omega_pb pb, enum omega_result desired_res)
   if (!omega_reduce_with_subs)
     {
       resurrect_subs (pb);
-      gcc_assert (please_no_equalities_in_simplified_problems 
+      gcc_assert (please_no_equalities_in_simplified_problems
 		  || !result || pb->num_subs == 0);
     }
 
@@ -5117,7 +5117,7 @@ omega_unprotect_variable (omega_pb pb, int var)
 	      {
 		for (e = pb->num_geqs - 1; e >= 0; e--)
 		  {
-		    pb->geqs[e].coef[pb->num_vars] = 
+		    pb->geqs[e].coef[pb->num_vars] =
 		      pb->geqs[e].coef[pb->safe_vars];
 
 		    pb->geqs[e].coef[pb->safe_vars] = 0;
@@ -5310,7 +5310,7 @@ omega_query_variable (omega_pb pb, int i, int *lower_bound, int *upper_bound)
 	  continue;
 	else
 	  {
-	    *lower_bound = *upper_bound = 
+	    *lower_bound = *upper_bound =
 	      -pb->eqs[e].coef[i] * pb->eqs[e].coef[0];
 	    return false;
 	  }
@@ -5425,7 +5425,7 @@ omega_query_variable_bounds (omega_pb pb, int i, int *l, int *u)
       || (pb->num_vars == 1 && pb->forwarding_address[i] == 1))
     return false;
 
-  if (abs (pb->forwarding_address[i]) == 1 
+  if (abs (pb->forwarding_address[i]) == 1
       && pb->num_vars + pb->num_subs == 2
       && pb->num_eqs + pb->num_subs == 1)
     {