data_request.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446
  1. /*
  2. * StarPU
  3. * Copyright (C) Université Bordeaux 1, CNRS 2008-2010 (see AUTHORS file)
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU Lesser General Public License as published by
  7. * the Free Software Foundation; either version 2.1 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  13. *
  14. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  15. */
  16. #include <starpu.h>
  17. #include <common/config.h>
  18. #include <datawizard/datawizard.h>
  19. /* requests that have not been treated at all */
  20. static starpu_data_request_list_t data_requests[STARPU_MAXNODES];
  21. static pthread_cond_t data_requests_list_cond[STARPU_MAXNODES];
  22. static pthread_mutex_t data_requests_list_mutex[STARPU_MAXNODES];
  23. /* requests that are not terminated (eg. async transfers) */
  24. static starpu_data_request_list_t data_requests_pending[STARPU_MAXNODES];
  25. static pthread_cond_t data_requests_pending_list_cond[STARPU_MAXNODES];
  26. static pthread_mutex_t data_requests_pending_list_mutex[STARPU_MAXNODES];
  27. void _starpu_init_data_request_lists(void)
  28. {
  29. unsigned i;
  30. for (i = 0; i < STARPU_MAXNODES; i++)
  31. {
  32. data_requests[i] = starpu_data_request_list_new();
  33. PTHREAD_MUTEX_INIT(&data_requests_list_mutex[i], NULL);
  34. PTHREAD_COND_INIT(&data_requests_list_cond[i], NULL);
  35. data_requests_pending[i] = starpu_data_request_list_new();
  36. PTHREAD_MUTEX_INIT(&data_requests_pending_list_mutex[i], NULL);
  37. PTHREAD_COND_INIT(&data_requests_pending_list_cond[i], NULL);
  38. }
  39. }
  40. void _starpu_deinit_data_request_lists(void)
  41. {
  42. unsigned i;
  43. for (i = 0; i < STARPU_MAXNODES; i++)
  44. {
  45. PTHREAD_COND_DESTROY(&data_requests_pending_list_cond[i]);
  46. PTHREAD_MUTEX_DESTROY(&data_requests_pending_list_mutex[i]);
  47. starpu_data_request_list_delete(data_requests_pending[i]);
  48. PTHREAD_COND_DESTROY(&data_requests_list_cond[i]);
  49. PTHREAD_MUTEX_DESTROY(&data_requests_list_mutex[i]);
  50. starpu_data_request_list_delete(data_requests[i]);
  51. }
  52. }
  53. /* this should be called with the lock r->handle->header_lock taken */
  54. static void starpu_data_request_destroy(starpu_data_request_t r)
  55. {
  56. r->dst_replicate->request = NULL;
  57. starpu_data_request_delete(r);
  58. }
  59. /* handle->lock should already be taken ! */
  60. starpu_data_request_t _starpu_create_data_request(starpu_data_handle handle,
  61. struct starpu_data_replicate_s *src_replicate,
  62. struct starpu_data_replicate_s *dst_replicate,
  63. uint32_t handling_node,
  64. starpu_access_mode mode,
  65. unsigned is_prefetch)
  66. {
  67. starpu_data_request_t r = starpu_data_request_new();
  68. _starpu_spin_init(&r->lock);
  69. r->handle = handle;
  70. r->src_replicate = src_replicate;
  71. r->dst_replicate = dst_replicate;
  72. r->mode = mode;
  73. r->handling_node = handling_node;
  74. r->completed = 0;
  75. r->retval = -1;
  76. r->next_req_count = 0;
  77. r->callbacks = NULL;
  78. r->is_a_prefetch_request = is_prefetch;
  79. /* associate that request with the handle so that further similar
  80. * requests will reuse that one */
  81. _starpu_spin_lock(&r->lock);
  82. dst_replicate->request = r;
  83. dst_replicate->refcnt++;
  84. if (mode & STARPU_R)
  85. src_replicate->refcnt++;
  86. r->refcnt = 1;
  87. _starpu_spin_unlock(&r->lock);
  88. return r;
  89. }
  90. /* handle->lock should be taken. r is returned locked */
  91. starpu_data_request_t _starpu_search_existing_data_request(struct starpu_data_replicate_s *replicate, starpu_access_mode mode)
  92. {
  93. starpu_data_request_t r = replicate->request;
  94. if (r)
  95. {
  96. _starpu_spin_lock(&r->lock);
  97. /* perhaps we need to "upgrade" the request */
  98. if (mode & STARPU_R)
  99. {
  100. /* in case the exisiting request did not imply a memory
  101. * transfer yet, we have to increment the refcnt now
  102. * (so that the source remains valid) */
  103. if (!(r->mode & STARPU_R))
  104. replicate->refcnt++;
  105. r->mode |= STARPU_R;
  106. }
  107. if (mode & STARPU_W)
  108. r->mode |= STARPU_W;
  109. }
  110. return r;
  111. }
  112. int _starpu_wait_data_request_completion(starpu_data_request_t r, unsigned may_alloc)
  113. {
  114. int retval;
  115. int do_delete = 0;
  116. uint32_t local_node = _starpu_get_local_memory_node();
  117. do {
  118. _starpu_spin_lock(&r->lock);
  119. if (r->completed)
  120. break;
  121. _starpu_spin_unlock(&r->lock);
  122. #ifndef STARPU_NON_BLOCKING_DRIVERS
  123. _starpu_wake_all_blocked_workers_on_node(r->handling_node);
  124. #endif
  125. _starpu_datawizard_progress(local_node, may_alloc);
  126. } while (1);
  127. retval = r->retval;
  128. if (retval)
  129. _STARPU_DISP("REQUEST %p COMPLETED (retval %d) !\n", r, r->retval);
  130. r->refcnt--;
  131. /* if nobody is waiting on that request, we can get rid of it */
  132. if (r->refcnt == 0)
  133. do_delete = 1;
  134. _starpu_spin_unlock(&r->lock);
  135. if (do_delete)
  136. starpu_data_request_destroy(r);
  137. return retval;
  138. }
  139. /* this is non blocking */
  140. void _starpu_post_data_request(starpu_data_request_t r, uint32_t handling_node)
  141. {
  142. // _STARPU_DEBUG("POST REQUEST\n");
  143. if (r->mode & STARPU_R)
  144. {
  145. STARPU_ASSERT(r->src_replicate->allocated);
  146. STARPU_ASSERT(r->src_replicate->refcnt);
  147. }
  148. /* insert the request in the proper list */
  149. PTHREAD_MUTEX_LOCK(&data_requests_list_mutex[handling_node]);
  150. starpu_data_request_list_push_front(data_requests[handling_node], r);
  151. PTHREAD_MUTEX_UNLOCK(&data_requests_list_mutex[handling_node]);
  152. #ifndef STARPU_NON_BLOCKING_DRIVERS
  153. _starpu_wake_all_blocked_workers_on_node(handling_node);
  154. #endif
  155. }
  156. /* We assume that r->lock is taken by the caller */
  157. void _starpu_data_request_append_callback(starpu_data_request_t r, void (*callback_func)(void *), void *callback_arg)
  158. {
  159. STARPU_ASSERT(r);
  160. if (callback_func)
  161. {
  162. struct callback_list *link = malloc(sizeof(struct callback_list));
  163. STARPU_ASSERT(link);
  164. link->callback_func = callback_func;
  165. link->callback_arg = callback_arg;
  166. link->next = r->callbacks;
  167. r->callbacks = link;
  168. }
  169. }
  170. static void starpu_handle_data_request_completion(starpu_data_request_t r)
  171. {
  172. unsigned do_delete = 0;
  173. starpu_data_handle handle = r->handle;
  174. uint32_t src_node = r->src_replicate->memory_node;
  175. uint32_t dst_node = r->dst_replicate->memory_node;
  176. _starpu_update_data_state(handle, dst_node, r->mode);
  177. #ifdef STARPU_USE_FXT
  178. size_t size = _starpu_data_get_size(handle);
  179. STARPU_TRACE_END_DRIVER_COPY(src_node, dst_node, size, r->com_id);
  180. #endif
  181. unsigned chained_req;
  182. for (chained_req = 0; chained_req < r->next_req_count; chained_req++)
  183. {
  184. _starpu_post_data_request(r->next_req[chained_req], r->next_req[chained_req]->handling_node);
  185. }
  186. r->completed = 1;
  187. r->dst_replicate->refcnt--;
  188. if (r->mode & STARPU_R)
  189. r->src_replicate->refcnt--;
  190. r->refcnt--;
  191. /* if nobody is waiting on that request, we can get rid of it */
  192. if (r->refcnt == 0)
  193. do_delete = 1;
  194. r->retval = 0;
  195. /* In case there are one or multiple callbacks, we execute them now. */
  196. struct callback_list *callbacks = r->callbacks;
  197. _starpu_spin_unlock(&r->lock);
  198. if (do_delete)
  199. starpu_data_request_destroy(r);
  200. _starpu_spin_unlock(&handle->header_lock);
  201. /* We do the callback once the lock is released so that they can do
  202. * blocking operations with the handle (eg. release it) */
  203. while (callbacks)
  204. {
  205. callbacks->callback_func(callbacks->callback_arg);
  206. struct callback_list *next = callbacks->next;
  207. free(callbacks);
  208. callbacks = next;
  209. }
  210. }
  211. /* TODO : accounting to see how much time was spent working for other people ... */
  212. static int starpu_handle_data_request(starpu_data_request_t r, unsigned may_alloc)
  213. {
  214. starpu_data_handle handle = r->handle;
  215. _starpu_spin_lock(&handle->header_lock);
  216. _starpu_spin_lock(&r->lock);
  217. if (r->mode & STARPU_R)
  218. {
  219. STARPU_ASSERT(r->src_replicate->allocated);
  220. STARPU_ASSERT(r->src_replicate->refcnt);
  221. }
  222. /* perform the transfer */
  223. /* the header of the data must be locked by the worker that submitted the request */
  224. r->retval = _starpu_driver_copy_data_1_to_1(handle, r->src_replicate,
  225. r->dst_replicate, !(r->mode & STARPU_R), r, may_alloc);
  226. if (r->retval == -ENOMEM)
  227. {
  228. _starpu_spin_unlock(&r->lock);
  229. _starpu_spin_unlock(&handle->header_lock);
  230. return -ENOMEM;
  231. }
  232. if (r->retval == -EAGAIN)
  233. {
  234. _starpu_spin_unlock(&r->lock);
  235. _starpu_spin_unlock(&handle->header_lock);
  236. /* the request is pending and we put it in the corresponding queue */
  237. PTHREAD_MUTEX_LOCK(&data_requests_pending_list_mutex[r->handling_node]);
  238. starpu_data_request_list_push_front(data_requests_pending[r->handling_node], r);
  239. PTHREAD_MUTEX_UNLOCK(&data_requests_pending_list_mutex[r->handling_node]);
  240. return -EAGAIN;
  241. }
  242. /* the request has been handled */
  243. starpu_handle_data_request_completion(r);
  244. return 0;
  245. }
  246. void _starpu_handle_node_data_requests(uint32_t src_node, unsigned may_alloc)
  247. {
  248. /* for all entries of the list */
  249. starpu_data_request_t r;
  250. /* take all the entries from the request list */
  251. PTHREAD_MUTEX_LOCK(&data_requests_list_mutex[src_node]);
  252. starpu_data_request_list_t local_list = data_requests[src_node];
  253. if (starpu_data_request_list_empty(local_list))
  254. {
  255. /* there is no request */
  256. PTHREAD_MUTEX_UNLOCK(&data_requests_list_mutex[src_node]);
  257. return;
  258. }
  259. data_requests[src_node] = starpu_data_request_list_new();
  260. PTHREAD_MUTEX_UNLOCK(&data_requests_list_mutex[src_node]);
  261. while (!starpu_data_request_list_empty(local_list))
  262. {
  263. int res;
  264. r = starpu_data_request_list_pop_back(local_list);
  265. res = starpu_handle_data_request(r, may_alloc);
  266. if (res == -ENOMEM)
  267. {
  268. PTHREAD_MUTEX_LOCK(&data_requests_list_mutex[src_node]);
  269. starpu_data_request_list_push_front(data_requests[src_node], r);
  270. PTHREAD_MUTEX_UNLOCK(&data_requests_list_mutex[src_node]);
  271. }
  272. /* wake the requesting worker up */
  273. // if we do not progress ..
  274. // pthread_cond_broadcast(&data_requests_list_cond[src_node]);
  275. }
  276. starpu_data_request_list_delete(local_list);
  277. }
  278. static void _handle_pending_node_data_requests(uint32_t src_node, unsigned force)
  279. {
  280. // _STARPU_DEBUG("_starpu_handle_pending_node_data_requests ...\n");
  281. PTHREAD_MUTEX_LOCK(&data_requests_pending_list_mutex[src_node]);
  282. /* for all entries of the list */
  283. starpu_data_request_list_t local_list = data_requests_pending[src_node];
  284. data_requests_pending[src_node] = starpu_data_request_list_new();
  285. PTHREAD_MUTEX_UNLOCK(&data_requests_pending_list_mutex[src_node]);
  286. while (!starpu_data_request_list_empty(local_list))
  287. {
  288. starpu_data_request_t r;
  289. r = starpu_data_request_list_pop_back(local_list);
  290. starpu_data_handle handle = r->handle;
  291. _starpu_spin_lock(&handle->header_lock);
  292. _starpu_spin_lock(&r->lock);
  293. /* wait until the transfer is terminated */
  294. if (force)
  295. {
  296. _starpu_driver_wait_request_completion(&r->async_channel, src_node);
  297. starpu_handle_data_request_completion(r);
  298. }
  299. else {
  300. if (_starpu_driver_test_request_completion(&r->async_channel, src_node))
  301. {
  302. starpu_handle_data_request_completion(r);
  303. }
  304. else {
  305. _starpu_spin_unlock(&r->lock);
  306. _starpu_spin_unlock(&handle->header_lock);
  307. /* wake the requesting worker up */
  308. PTHREAD_MUTEX_LOCK(&data_requests_pending_list_mutex[src_node]);
  309. starpu_data_request_list_push_front(data_requests_pending[src_node], r);
  310. PTHREAD_MUTEX_UNLOCK(&data_requests_pending_list_mutex[src_node]);
  311. }
  312. }
  313. }
  314. starpu_data_request_list_delete(local_list);
  315. }
  316. void _starpu_handle_pending_node_data_requests(uint32_t src_node)
  317. {
  318. _handle_pending_node_data_requests(src_node, 0);
  319. }
  320. void _starpu_handle_all_pending_node_data_requests(uint32_t src_node)
  321. {
  322. _handle_pending_node_data_requests(src_node, 1);
  323. }
  324. int _starpu_check_that_no_data_request_exists(uint32_t node)
  325. {
  326. /* XXX lock that !!! that's a quick'n'dirty test */
  327. int no_request = starpu_data_request_list_empty(data_requests[node]);
  328. int no_pending = starpu_data_request_list_empty(data_requests_pending[node]);
  329. return (no_request && no_pending);
  330. }