task.c 6.44 KB
Newer Older
1
/*******************************************************************************
2
 * This file is part of SWIFT.
3
 * Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
4
5
6
7
 *                    Matthieu Schaller (matthieu.schaller@durham.ac.uk)
 *               2015 Peter W. Draper (p.w.draper@durham.ac.uk)
 *               2016 John A. Regan (john.a.regan@durham.ac.uk)
 *                    Tom Theuns (tom.theuns@durham.ac.uk)
8
 *
9
10
11
12
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published
 * by the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
13
 *
14
15
16
17
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
18
 *
19
20
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
21
 *
22
23
24
25
26
27
28
29
30
 ******************************************************************************/

/* Config parameters. */
#include "../config.h"

/* Some standard headers. */
#include <float.h>
#include <limits.h>
#include <sched.h>
31
32
33
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
34

35
36
/* MPI headers. */
#ifdef WITH_MPI
37
#include <mpi.h>
38
39
#endif

40
41
42
/* This object's header. */
#include "task.h"

43
/* Local headers. */
Pedro Gonnet's avatar
Pedro Gonnet committed
44
#include "atomic.h"
45
#include "error.h"
46
#include "lock.h"
47
48

/* Task type names. */
49
const char *taskID_names[task_type_count] = {
Pedro Gonnet's avatar
Pedro Gonnet committed
50
51
    "none",      "sort",          "self",     "pair",    "sub_self",
    "sub_pair",  "init",          "ghost",    "kick",    "kick_fixdt",
52
    "send",      "recv",          "grav_pp",  "grav_mm", "grav_up",
53
    "grav_down", "grav_external"};
54

55
const char *subtaskID_names[task_type_count] = {"none", "density", "force",
56
                                                "grav", "t_end"};
57

58
59
60
/**
 * @brief Computes the overlap between the parts array of two given cells.
 */
61

62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
size_t task_cell_overlap(const struct cell *ci, const struct cell *cj) {
  if (ci == NULL || cj == NULL) return 0;
  if (ci->parts <= cj->parts &&
      ci->parts + ci->count >= cj->parts + cj->count) {
    return cj->count;
  } else if (cj->parts <= ci->parts &&
             cj->parts + cj->count >= ci->parts + ci->count) {
    return ci->count;
  }
  return 0;
}

/**
 * @brief Compute the Jaccard similarity of the data used by two
 *        different tasks.
 *
 * @param ta The first #task.
 * @param tb The second #task.
 */

float task_overlap(const struct task *ta, const struct task *tb) {
  /* First check if any of the two tasks are of a type that don't
     use cells. */
85
  if (ta == NULL || tb == NULL || ta->type == task_type_none ||
86
      tb->type == task_type_none)
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
    return 0.0f;

  /* Compute the union of the cell data. */
  size_t size_union = 0;
  if (ta->ci != NULL) size_union += ta->ci->count;
  if (ta->cj != NULL) size_union += ta->cj->count;
  if (tb->ci != NULL) size_union += tb->ci->count;
  if (tb->cj != NULL) size_union += tb->cj->count;

  /* Compute the intersection of the cell data. */
  const size_t size_intersect =
      task_cell_overlap(ta->ci, tb->ci) + task_cell_overlap(ta->ci, tb->cj) +
      task_cell_overlap(ta->cj, tb->ci) + task_cell_overlap(ta->cj, tb->cj);

  return ((float)size_intersect) / (size_union - size_intersect);
}
103

104
105
/**
 * @brief Unlock the cell held by this task.
106
 *
107
108
109
 * @param t The #task.
 */

110
111
112
113
114
void task_unlock(struct task *t) {

  /* Act based on task type. */
  switch (t->type) {
    case task_type_self:
115
    case task_type_sub_self:
116
117
118
119
    case task_type_sort:
      cell_unlocktree(t->ci);
      break;
    case task_type_pair:
120
    case task_type_sub_pair:
121
      cell_unlocktree(t->ci);
122
      cell_unlocktree(t->cj);
123
124
125
126
127
128
129
130
131
132
133
      break;
    case task_type_grav_pp:
    case task_type_grav_mm:
    case task_type_grav_down:
      cell_gunlocktree(t->ci);
      if (t->cj != NULL) cell_gunlocktree(t->cj);
      break;
    default:
      break;
  }
}
134
135
136
137
138
139

/**
 * @brief Try to lock the cells associated with this task.
 *
 * @param t the #task.
 */
140
141
142

int task_lock(struct task *t) {

143
144
  const int type = t->type;
  const int subtype = t->subtype;
145
  struct cell *ci = t->ci, *cj = t->cj;
146
147
148
149
#ifdef WITH_MPI
  int res = 0, err = 0;
  MPI_Status stat;
#endif
150

151
  switch (type) {
152

153
154
155
    /* Communication task? */
    case task_type_recv:
    case task_type_send:
156
#ifdef WITH_MPI
157
158
159
160
161
162
163
164
165
      /* Check the status of the MPI request. */
      if ((err = MPI_Test(&t->req, &res, &stat)) != MPI_SUCCESS) {
        char buff[MPI_MAX_ERROR_STRING];
        int len;
        MPI_Error_string(err, buff, &len);
        error("Failed to test request on send/recv task (tag=%i, %s).",
              t->flags, buff);
      }
      return res;
166
#else
167
      error("SWIFT was not compiled with MPI support.");
168
#endif
169
      break;
170

171
172
173
    case task_type_sort:
      if (cell_locktree(ci) != 0) return 0;
      break;
174

175
176
177
178
179
180
181
182
    case task_type_self:
    case task_type_sub_self:
      if (subtype == task_subtype_grav) {
        if (cell_glocktree(ci) != 0) return 0;
      } else {
        if (cell_locktree(ci) != 0) return 0;
      }
      break;
183

184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
    case task_type_pair:
    case task_type_sub_pair:
      if (subtype == task_subtype_grav) {
        if (ci->ghold || cj->ghold) return 0;
        if (cell_glocktree(ci) != 0) return 0;
        if (cell_glocktree(cj) != 0) {
          cell_gunlocktree(ci);
          return 0;
        }
      } else {
        if (ci->hold || cj->hold) return 0;
        if (cell_locktree(ci) != 0) return 0;
        if (cell_locktree(cj) != 0) {
          cell_unlocktree(ci);
          return 0;
        }
      }
      break;
202

203
204
    default:
      break;
205
206
207
208
209
  }

  /* If we made it this far, we've got a lock. */
  return 1;
}
210

211
212
213
/**
 * @brief Prints the list of tasks contained in a given mask
 *
214
 * @param mask The mask to analyse
215
216
217
218
219
220
221
222
223
224
225
226
 */
void task_print_mask(unsigned int mask) {

  printf("task_print_mask: The tasks to run are [");
  for (int k = 1; k < task_type_count; k++)
    printf(" %s=%s", taskID_names[k], (mask & (1 << k)) ? "yes" : "no");
  printf(" ]\n");
}

/**
 * @brief Prints the list of subtasks contained in a given submask
 *
227
 * @param submask The submask to analyse
228
229
230
231
232
233
234
235
 */
void task_print_submask(unsigned int submask) {

  printf("task_print_submask: The subtasks to run are [");
  for (int k = 1; k < task_subtype_count; k++)
    printf(" %s=%s", subtaskID_names[k], (submask & (1 << k)) ? "yes" : "no");
  printf(" ]\n");
}