rts: detabify/dewhitespace Apply.cmm

Signed-off-by: Austin Seipp <austin@well-typed.com>

1 files changed, 33 insertions, 33 deletions

diff --git a/rts/Apply.cmm b/rts/Apply.cmm
index b89abeaff2..9d18e95524 100644
--- a/rts/Apply.cmm
+++ b/rts/Apply.cmm
@@ -22,7 +22,7 @@
 STRING(stg_ap_0_ret_str,"stg_ap_0_ret... ")
 
 stg_ap_0_fast ( P_ fun )
-{ 
+{
     IF_DEBUG(apply,
         ccall debugBelch(stg_ap_0_ret_str);
         ccall printClosure(R1 "ptr"));
@@ -55,12 +55,12 @@ stg_ap_0_fast ( P_ fun )
 
 INFO_TABLE(stg_PAP,/*special layout*/0,0,PAP,"PAP","PAP")
 {  ccall barf("PAP object entered!") never returns; }
-    
+
 stg_PAP_apply /* no args => explicit stack */
 {
   W_ Words;
   W_ pap;
-    
+
   pap = R1;
 
   Words = TO_W_(StgPAP_n_args(pap));
@@ -74,7 +74,7 @@ stg_PAP_apply /* no args => explicit stack */
       // there is a return address in R2 in the event of a
       // stack check failure.  The various stg_apply functions arrange
       // this before calling stg_PAP_entry.
-      Sp_adj(-1); 
+      Sp_adj(-1);
       Sp(0) = R2;
       jump stg_gc_unpt_r1 [R1];
   }
@@ -87,7 +87,7 @@ stg_PAP_apply /* no args => explicit stack */
   ccall enterFunCCS(BaseReg "ptr", StgHeader_ccs(pap) "ptr");
 #endif
 
-  // Reload the stack 
+  // Reload the stack
   W_ i;
   W_ p;
   p = pap + SIZEOF_StgHeader + OFFSET_StgPAP_payload;
@@ -105,18 +105,18 @@ for:
 /* DEBUGGING CODE, ensures that arity 1 and 2 functions are entered tagged
   if (TO_W_(StgFunInfoExtra_arity(%FUN_INFO(%INFO_PTR(UNTAG(R1))))) == 1 ) {
     if (GETTAG(R1)!=1) {
-	W_[0]=1;
+        W_[0]=1;
     }
   }
 
   if (TO_W_(StgFunInfoExtra_arity(%FUN_INFO(%INFO_PTR(UNTAG(R1))))) == 2 ) {
     if (GETTAG(R1)!=2) {
-	W_[0]=1;
+        W_[0]=1;
     }
   }
 */
 
-  // Off we go! 
+  // Off we go!
   TICK_ENT_VIA_NODE();
 
 #ifdef NO_ARG_REGS
@@ -133,12 +133,12 @@ for:
           jump StgFunInfoExtra_slow_apply(info) [R1];
       }
       if (type == ARG_BCO) {
-	  Sp_adj(-2);
-	  Sp(1) = R1;
-	  Sp(0) = stg_apply_interp_info;
+          Sp_adj(-2);
+          Sp(1) = R1;
+          Sp(0) = stg_apply_interp_info;
           jump stg_yield_to_interpreter [];
       }
-      jump W_[stg_ap_stack_entries + 
+      jump W_[stg_ap_stack_entries +
                 WDS(TO_W_(StgFunInfoExtra_fun_type(info)))] [R1];
 #endif
 }
@@ -157,12 +157,12 @@ INFO_TABLE(stg_AP,/*special layout*/0,0,AP,"AP","AP")
 {
   W_ Words;
   W_ ap;
-    
+
   ap = R1;
-  
+
   Words = TO_W_(StgAP_n_args(ap));
 
-  /* 
+  /*
    * Check for stack overflow.  IMPORTANT: use a _ENTER check here,
    * because if the check fails, we might end up blackholing this very
    * closure, in which case we must enter the blackhole on return rather
@@ -192,7 +192,7 @@ for:
 
   R1 = StgAP_fun(ap);
 
-  // Off we go! 
+  // Off we go!
   TICK_ENT_VIA_NODE();
 
 #ifdef NO_ARG_REGS
@@ -209,18 +209,18 @@ for:
           jump StgFunInfoExtra_slow_apply(info) [R1];
       }
       if (type == ARG_BCO) {
-	  Sp_adj(-2);
-	  Sp(1) = R1;
-	  Sp(0) = stg_apply_interp_info;
+          Sp_adj(-2);
+          Sp(1) = R1;
+          Sp(0) = stg_apply_interp_info;
           jump stg_yield_to_interpreter [];
       }
-      jump W_[stg_ap_stack_entries + 
+      jump W_[stg_ap_stack_entries +
                 WDS(TO_W_(StgFunInfoExtra_fun_type(info)))] [R1];
 #endif
 }
 
 /* AP_NOUPD is exactly like AP, except that no update frame is pushed.
-   Use for thunks that are guaranteed to be entered once only, such as 
+   Use for thunks that are guaranteed to be entered once only, such as
    those generated by the byte-code compiler for inserting breakpoints. */
 
 INFO_TABLE(stg_AP_NOUPD,/*special layout*/0,0,AP,"AP_NOUPD","AP_NOUPD")
@@ -228,12 +228,12 @@ INFO_TABLE(stg_AP_NOUPD,/*special layout*/0,0,AP,"AP_NOUPD","AP_NOUPD")
 {
   W_ Words;
   W_ ap;
-    
+
   ap = R1;
-  
+
   Words = TO_W_(StgAP_n_args(ap));
 
-  /* 
+  /*
    * Check for stack overflow.  IMPORTANT: use a _ENTER check here,
    * because if the check fails, we might end up blackholing this very
    * closure, in which case we must enter the blackhole on return rather
@@ -261,7 +261,7 @@ for:
 
   R1 = StgAP_fun(ap);
 
-  // Off we go! 
+  // Off we go!
   TICK_ENT_VIA_NODE();
 
 #ifdef NO_ARG_REGS
@@ -278,12 +278,12 @@ for:
           jump StgFunInfoExtra_slow_apply(info) [R1];
       }
       if (type == ARG_BCO) {
-	  Sp_adj(-2);
-	  Sp(1) = R1;
-	  Sp(0) = stg_apply_interp_info;
+          Sp_adj(-2);
+          Sp(1) = R1;
+          Sp(0) = stg_apply_interp_info;
           jump stg_yield_to_interpreter [];
       }
-      jump W_[stg_ap_stack_entries + 
+      jump W_[stg_ap_stack_entries +
                 WDS(TO_W_(StgFunInfoExtra_fun_type(info)))] [R1];
 #endif
 }
@@ -306,10 +306,10 @@ INFO_TABLE(stg_AP_STACK,/*special layout*/0,0,AP_STACK,"AP_STACK","AP_STACK")
   W_ ap;
 
   ap = R1;
-  
+
   Words = StgAP_STACK_size(ap);
 
-  /* 
+  /*
    * Check for stack overflow.  IMPORTANT: use a _ENTER check here,
    * because if the check fails, we might end up blackholing this very
    * closure, in which case we must enter the blackhole on return rather
@@ -359,10 +359,10 @@ INFO_TABLE(stg_AP_STACK_NOUPD,/*special layout*/0,0,AP_STACK,
   W_ ap;
 
   ap = R1;
-  
+
   Words = StgAP_STACK_size(ap);
 
-  /* 
+  /*
    * Check for stack overflow.  IMPORTANT: use a _NP check here,
    * because if the check fails, we might end up blackholing this very
    * closure, in which case we must enter the blackhole on return rather