formatting.

src/engine.c

@@ -644,12 +644,12 @@ void engine_exchange_strays(struct engine *e, size_t offset_parts,
           s->parts[offset_parts + k].x[0], s->parts[offset_parts + k].x[1],
           s->parts[offset_parts + k].x[2]);
     }
-    
+
     /* Re-link the associated gpart with the buffer offset of the part. */
     if (s->parts[offset_parts + k].gpart != NULL) {
       s->parts[offset_parts + k].gpart->id = e->proxies[pid].nr_parts_in;
     }
-    
+
     /* Load the part and xpart into the proxy. */
     proxy_parts_load(&e->proxies[pid], &s->parts[offset_parts + k],
                      &s->xparts[offset_parts + k], 1);
@@ -778,7 +778,7 @@ void engine_exchange_strays(struct engine *e, size_t offset_parts,
     if (pid == MPI_UNDEFINED) break;
     // message( "request from proxy %i has arrived." , pid / 3 );
     pid = 3 * (pid / 3);
-    
+
     /* If all the requests for a given proxy have arrived... */
     if (reqs_in[pid + 0] == MPI_REQUEST_NULL &&
         reqs_in[pid + 1] == MPI_REQUEST_NULL &&
@@ -796,7 +796,7 @@ void engine_exchange_strays(struct engine *e, size_t offset_parts,
             "received particle %lli, x=[%.3e %.3e %.3e], h=%.3e, from node %i.",
             s->parts[k].id, s->parts[k].x[0], s->parts[k].x[1],
             s->parts[k].x[2], s->parts[k].h, p->nodeID); */
-            
+
       /* Re-link the gparts. */
       for (int k = 0; k < p->nr_gparts_in; k++) {
         struct gpart *gp = &s->gparts[offset_gparts + count_gparts + k];
@@ -806,7 +806,7 @@ void engine_exchange_strays(struct engine *e, size_t offset_parts,
           p->gpart = gp;
         }
       }
-      
+
       /* Advance the counters. */
       count_parts += p->nr_parts_in;
       count_gparts += p->nr_gparts_in;
@@ -837,7 +837,7 @@ void engine_exchange_strays(struct engine *e, size_t offset_parts,
  *neighbours
  *
  * Here we construct all the tasks for all possible neighbouring non-empty
- * local cells in the hierarchy. No dependencies are being added thus far. 
+ * local cells in the hierarchy. No dependencies are being added thus far.
  * Additional loop over neighbours can later be added by simply duplicating
  * all the tasks created by this function.
  *