diff --git a/src/runner.c b/src/runner.c
index 07f360520ac3036a1232ab309ef7acfefedebdb8..22e47c84afe162cc46e6dac8a699ec76d178ef5e 100644
--- a/src/runner.c
+++ b/src/runner.c
@@ -612,7 +612,7 @@ void runner_do_sort_ascending(struct entry *sort, int N) {
 }
 
 #ifdef SWIFT_DEBUG_CHECKS
-#define RUNNER_CHECK_SORTS(TYPE)   
+#define RUNNER_CHECK_SORTS(TYPE)
 /**
  * @brief Recursively checks that the flags are consistent in a cell hierarchy.
  *
@@ -620,15 +620,15 @@ void runner_do_sort_ascending(struct entry *sort, int N) {
  *
  * @param c The #cell to check.
  * @param flags The sorting flags to check.
- */                                            \
-  void runner_check_sorts_##TYPE(struct cell *c, int flags) {                  \
-                                                                               \
-    if (flags & ~c->TYPE.sorted) error("Inconsistent sort flags (downward)!"); \
-    if (c->split)                                                              \
-      for (int k = 0; k < 8; k++)                                              \
-        if (c->progeny[k] != NULL && c->progeny[k]->TYPE.count > 0)            \
-          runner_check_sorts_##TYPE(c->progeny[k], c->TYPE.sorted);            \
-  }
+ */
+void runner_check_sorts_##TYPE(struct cell *c, int flags) {
+
+  if (flags & ~c->TYPE.sorted) error("Inconsistent sort flags (downward)!");
+  if (c->split)
+    for (int k = 0; k < 8; k++)
+      if (c->progeny[k] != NULL && c->progeny[k]->TYPE.count > 0)
+        runner_check_sorts_##TYPE(c->progeny[k], c->TYPE.sorted);
+}
 #else
 #define RUNNER_CHECK_SORTS(TYPE)                                       \
   void runner_check_sorts_##TYPE(struct cell *c, int flags) {          \
@@ -709,9 +709,9 @@ void runner_do_hydro_sort(struct runner *r, struct cell *c, int flags,
       if (c->progeny[k] != NULL && c->progeny[k]->hydro.count > 0) {
         /* Only propagate cleanup if the progeny is stale. */
         runner_do_hydro_sort(r, c->progeny[k], flags,
-                       cleanup && (c->progeny[k]->hydro.dx_max_sort_old >
-                                   space_maxreldx * c->progeny[k]->dmin),
-                       0);
+                             cleanup && (c->progeny[k]->hydro.dx_max_sort_old >
+                                         space_maxreldx * c->progeny[k]->dmin),
+                             0);
         dx_max_sort = max(dx_max_sort, c->progeny[k]->hydro.dx_max_sort);
         dx_max_sort_old =
             max(dx_max_sort_old, c->progeny[k]->hydro.dx_max_sort_old);