From b82a8ab4ccb21eef0aa5a1e92569f6ec3ff2e587 Mon Sep 17 00:00:00 2001
From: Pedro Gonnet <gonnet@google.com>
Date: Fri, 28 Jul 2017 10:19:46 +0200
Subject: [PATCH] get rid of engine_check_sort_tasks, which is not needed in
the new sorting scheme.
---
src/engine.c | 18 ------------------
1 file changed, 18 deletions(-)
diff --git a/src/engine.c b/src/engine.c
index ee48d6565d..db62604ae9 100644
--- a/src/engine.c
+++ b/src/engine.c
@@ -2402,21 +2402,6 @@ void engine_make_gravityrecursive_tasks(struct engine *e) {
/* } */
}
-void engine_check_sort_tasks(struct engine *e, struct cell *c) {
-
- /* Find the parent sort task, if any, and copy its flags. */
- if (c->sorts != NULL) {
- struct cell *parent = c->parent;
- while (parent != NULL && parent->sorts == NULL) parent = parent->parent;
- if (parent != NULL) c->sorts->flags |= parent->sorts->flags;
- }
-
- /* Recurse? */
- if (c->split)
- for (int k = 0; k < 8; k++)
- if (c->progeny[k] != NULL) engine_check_sort_tasks(e, c->progeny[k]);
-}
-
/**
* @brief Fill the #space's task list.
*
@@ -2495,9 +2480,6 @@ void engine_maketasks(struct engine *e) {
for (int k = 0; k < nr_cells; k++)
engine_make_hierarchical_tasks(e, &cells[k]);
- /* Append hierarchical tasks to each cell. */
- for (int k = 0; k < nr_cells; k++) engine_check_sort_tasks(e, &cells[k]);
-
/* Run through the tasks and make force tasks for each density task.
Each force task depends on the cell ghosts and unlocks the kick task
of its super-cell. */
--
GitLab