diff --git a/Modules/_decimal/libmpdec/fourstep.c b/Modules/_decimal/libmpdec/fourstep.c
index 91a1b279c2b..aa32c0d5cf2 100644
--- a/Modules/_decimal/libmpdec/fourstep.c
+++ b/Modules/_decimal/libmpdec/fourstep.c
@@ -184,7 +184,8 @@ four_step_fnt(mpd_uint_t *a, mpd_size_t n, int modnum)
         }
     }
 
-#if 0    /* An unordered transform is sufficient for convolution. */
+#if 0
+    /* An unordered transform is sufficient for convolution. */
     /* Transpose the matrix. */
     transpose_3xpow2(a, R, C);
 #endif
@@ -213,7 +214,8 @@ inv_four_step_fnt(mpd_uint_t *a, mpd_size_t n, int modnum)
     assert(n <= 3*MPD_MAXTRANSFORM_2N);
 
 
-#if 0    /* An unordered transform is sufficient for convolution. */
+#if 0
+    /* An unordered transform is sufficient for convolution. */
     /* Transpose the matrix, producing an R*C matrix. */
     transpose_3xpow2(a, C, R);
 #endif
diff --git a/Modules/_decimal/libmpdec/sixstep.c b/Modules/_decimal/libmpdec/sixstep.c
index f757814dccd..7d0542d641d 100644
--- a/Modules/_decimal/libmpdec/sixstep.c
+++ b/Modules/_decimal/libmpdec/sixstep.c
@@ -115,7 +115,8 @@ six_step_fnt(mpd_uint_t *a, mpd_size_t n, int modnum)
     }
     mpd_free(tparams);
 
-#if 0    /* An unordered transform is sufficient for convolution. */
+#if 0
+    /* An unordered transform is sufficient for convolution. */
     /* Transpose the matrix. */
     if (!transpose_pow2(a, R, C)) {
         return 0;
@@ -151,7 +152,8 @@ inv_six_step_fnt(mpd_uint_t *a, mpd_size_t n, int modnum)
     R = ((mpd_size_t)1) << (log2n - (log2n / 2)); /* number of rows */
 
 
-#if 0    /* An unordered transform is sufficient for convolution. */
+#if 0
+    /* An unordered transform is sufficient for convolution. */
     /* Transpose the matrix, producing an R*C matrix. */
     if (!transpose_pow2(a, C, R)) {
         return 0;