redundant end-of-line spacing

4 files changed, 16 insertions, 16 deletions

diff --git a/generic/tclCmdAH.c b/generic/tclCmdAH.c
index 6d66a32..a48dfc7 100644
--- a/generic/tclCmdAH.c
+++ b/generic/tclCmdAH.c
@@ -748,8 +748,8 @@ EncodingConvertfromObjCmd(
 	return TCL_ERROR;
     }
 
-    /* 
-     * Convert the string into a byte array in 'ds' 
+    /*
+     * Convert the string into a byte array in 'ds'
      */
     bytesPtr = (char *) Tcl_GetByteArrayFromObj(data, &length);
     Tcl_ExternalToUtfDString(encoding, bytesPtr, length, &ds);
@@ -811,18 +811,18 @@ EncodingConverttoObjCmd(
 	Tcl_WrongNumArgs(interp, 1, objv, "?encoding? data");
 	return TCL_ERROR;
     }
-    
+
     /*
      * Convert the string to a byte array in 'ds'
      */
-    
+
     stringPtr = TclGetStringFromObj(data, &length);
     Tcl_UtfToExternalDString(encoding, stringPtr, length, &ds);
-    Tcl_SetObjResult(interp, 
+    Tcl_SetObjResult(interp,
 		     Tcl_NewByteArrayObj((unsigned char*) Tcl_DStringValue(&ds),
 					 Tcl_DStringLength(&ds)));
     Tcl_DStringFree(&ds);
-    
+
     /*
      * We're done with the encoding
      */
@@ -933,7 +933,7 @@ EncodingSystemObjCmd(ClientData dummy,      /* Unused */
 	return TCL_ERROR;
     }
     if (objc == 1) {
-	Tcl_SetObjResult(interp, 
+	Tcl_SetObjResult(interp,
 			 Tcl_NewStringObj(Tcl_GetEncodingName(NULL), -1));
     } else {
 	return Tcl_SetSystemEncoding(interp, TclGetString(objv[1]));
diff --git a/generic/tclCompCmds.c b/generic/tclCompCmds.c
index 635447c..c2b4bdb 100644
--- a/generic/tclCompCmds.c
+++ b/generic/tclCompCmds.c
@@ -778,11 +778,11 @@ TclCompileClockClicksCmd(
 	    || tokenPtr[1].size < 4
 	    || tokenPtr[1].size > 13) {
 	    return TCL_ERROR;
-	} else if (!strncmp(tokenPtr[1].start, "-microseconds", 
+	} else if (!strncmp(tokenPtr[1].start, "-microseconds",
 			    tokenPtr[1].size)) {
 	    TclEmitInstInt1(INST_CLOCK_READ, 1, envPtr);
 	    break;
-	} else if (!strncmp(tokenPtr[1].start, "-milliseconds", 
+	} else if (!strncmp(tokenPtr[1].start, "-milliseconds",
 			    tokenPtr[1].size)) {
 	    TclEmitInstInt1(INST_CLOCK_READ, 2, envPtr);
 	    break;
diff --git a/generic/tclExecute.c b/generic/tclExecute.c
index 4250958..cb4e6dc 100644
--- a/generic/tclExecute.c
+++ b/generic/tclExecute.c
@@ -7845,7 +7845,7 @@ TEBCresume(
 	    Tcl_WideInt wval;
 	    Tcl_Time now;
 	    switch(TclGetUInt1AtPtr(pc+1)) {
-	    case 0:		/* clicks */ 
+	    case 0:		/* clicks */
 #ifdef TCL_WIDE_CLICKS
 		wval = TclpGetWideClicks();
 #else
diff --git a/generic/tclTomMath.h b/generic/tclTomMath.h
index c1d83c4..41512f0 100644
--- a/generic/tclTomMath.h
+++ b/generic/tclTomMath.h
@@ -87,7 +87,7 @@ extern "C" {
 #  define DIGIT_BIT          60
 #else
    /* this is the default case, 28-bit digits */
-   
+
    /* this is to make porting into LibTomCrypt easier :-) */
 #ifndef CRYPT
 #  if defined(_MSC_VER) || defined(__BORLANDC__)
@@ -105,14 +105,14 @@ extern "C" {
 #endif
    typedef ulong64            mp_word;
 
-#ifdef MP_31BIT   
+#ifdef MP_31BIT
    /* this is an extension that uses 31-bit digits */
 #  define DIGIT_BIT          31
 #else
    /* default case is 28-bit digits, defines MP_28BIT as a handy macro to test */
 #  define DIGIT_BIT          28
 #  define MP_28BIT
-#endif   
+#endif
 #endif
 
 /* define heap macros */
@@ -646,7 +646,7 @@ int mp_prime_miller_rabin(mp_int *a, mp_int *b, int *result);
 */
 
 /* This gives [for a given bit size] the number of trials required
- * such that Miller-Rabin gives a prob of failure lower than 2^-96 
+ * such that Miller-Rabin gives a prob of failure lower than 2^-96
  */
 /*
 int mp_prime_rabin_miller_trials(int size);
@@ -673,7 +673,7 @@ int mp_prime_next_prime(mp_int *a, int t, int bbs_style);
 */
 
 /* makes a truly random prime of a given size (bytes),
- * call with bbs = 1 if you want it to be congruent to 3 mod 4 
+ * call with bbs = 1 if you want it to be congruent to 3 mod 4
  *
  * You have to supply a callback which fills in a buffer with random bytes.  "dat" is a parameter you can
  * have passed to the callback (e.g. a state or something).  This function doesn't use "dat" itself
@@ -686,7 +686,7 @@ int mp_prime_next_prime(mp_int *a, int t, int bbs_style);
 /* makes a truly random prime of a given size (bits),
  *
  * Flags are as follows:
- * 
+ *
  *   LTM_PRIME_BBS      - make prime congruent to 3 mod 4
  *   LTM_PRIME_SAFE     - make sure (p-1)/2 is prime as well (implies LTM_PRIME_BBS)
  *   LTM_PRIME_2MSB_OFF - make the 2nd highest bit zero