From 4d542bc7eafadb16b845cf05d1eb4988eb55ed0f Mon Sep 17 00:00:00 2001
From: Bernhard Schommer <bernhardschommer@gmail.com>
Date: Tue, 20 Oct 2015 13:32:18 +0200
Subject: Updated PR by removing whitespaces. Bug 17450.

---
 backend/IRC.ml | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

(limited to 'backend/IRC.ml')

diff --git a/backend/IRC.ml b/backend/IRC.ml
index dcd8624a..eb677069 100644
--- a/backend/IRC.ml
+++ b/backend/IRC.ml
@@ -163,7 +163,7 @@ module DLinkMove = struct
   type t = move
   let make state =
     let rec empty =
-      { src = DLinkNode.dummy; dst = DLinkNode.dummy; 
+      { src = DLinkNode.dummy; dst = DLinkNode.dummy;
         mstate = state; mprev = empty; mnext = empty }
     in empty
   let dummy = make CoalescedMoves
@@ -301,7 +301,7 @@ let init costs =
     worklistMoves = DLinkMove.make WorklistMoves;
     activeMoves = DLinkMove.make ActiveMoves
   }
-  
+
 (* Create nodes corresponding to XTL variables *)
 
 let weightedSpillCost st =
@@ -312,7 +312,7 @@ let weightedSpillCost st =
 let newNodeOfReg g r ty =
   let st = g.stats_of_reg r in
   g.nextIdent <- g.nextIdent + 1;
-  { ident = g.nextIdent; typ = ty; 
+  { ident = g.nextIdent; typ = ty;
     var = V(r, ty);
     regclass = if st.cost >= 0 then class_of_type ty else no_spill_class;
     accesses = st.usedefs;
@@ -328,7 +328,7 @@ let newNodeOfReg g r ty =
 let newNodeOfLoc g l =
   let ty = Loc.coq_type l in
   g.nextIdent <- g.nextIdent + 1;
-  { ident = g.nextIdent; typ = ty; 
+  { ident = g.nextIdent; typ = ty;
     var = L l; regclass = class_of_type ty;
     accesses = 0; spillcost = 0.0;
     adjlist = []; degree = 0; movelist = []; extra_adj = []; extra_pref = [];
@@ -608,9 +608,9 @@ let canCoalesceGeorge g u v =
 -  If [u] is precolored, use George's criterion.
 -  If [u] is not precolored, use Briggs's criterion.
 
-   As noted by Hailperin, for non-precolored nodes, George's criterion 
+   As noted by Hailperin, for non-precolored nodes, George's criterion
    is incomparable with Briggs's: there are cases where G says yes
-   and B says no.  Typically, [u] is a long-lived variable with many 
+   and B says no.  Typically, [u] is a long-lived variable with many
    interferences, and [v] is a short-lived temporary copy of [u]
    that has no more interferences than [u].  Coalescing [u] and [v]
    is "weakly safe" in Hailperin's terminology: [u] is no harder to color,
@@ -690,7 +690,7 @@ let coalesce g =
     combine g u v;
     addWorkList g u
   end else begin
-    DLinkMove.insert m g.activeMoves    
+    DLinkMove.insert m g.activeMoves
   end
 
 (* Freeze moves associated with node [u] *)
-- 
cgit