user_interactions.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009-2013 Université de Bordeaux 1
  4. * Copyright (C) 2010, 2011, 2012, 2013 Centre National de la Recherche Scientifique
  5. *
  6. * StarPU is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU Lesser General Public License as published by
  8. * the Free Software Foundation; either version 2.1 of the License, or (at
  9. * your option) any later version.
  10. *
  11. * StarPU is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  14. *
  15. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  16. */
  17. #include <common/config.h>
  18. #include <common/utils.h>
  19. #include <core/task.h>
  20. #include <datawizard/coherency.h>
  21. #include <datawizard/copy_driver.h>
  22. #include <datawizard/write_back.h>
  23. #include <core/dependencies/data_concurrency.h>
  24. #include <core/sched_policy.h>
  25. /* Explicitly ask StarPU to allocate room for a piece of data on the specified
  26. * memory node. */
  27. int starpu_data_request_allocation(starpu_data_handle_t handle, unsigned node)
  28. {
  29. struct _starpu_data_request *r;
  30. STARPU_ASSERT(handle);
  31. _starpu_spin_lock(&handle->header_lock);
  32. r = _starpu_create_data_request(handle, NULL, &handle->per_node[node], node, STARPU_NONE, 0, 1);
  33. /* we do not increase the refcnt associated to the request since we are
  34. * not waiting for its termination */
  35. _starpu_post_data_request(r, node);
  36. _starpu_spin_unlock(&handle->header_lock);
  37. return 0;
  38. }
  39. struct user_interaction_wrapper
  40. {
  41. starpu_data_handle_t handle;
  42. enum starpu_data_access_mode mode;
  43. unsigned node;
  44. starpu_pthread_cond_t cond;
  45. starpu_pthread_mutex_t lock;
  46. unsigned finished;
  47. unsigned async;
  48. void (*callback)(void *);
  49. void (*callback_fetch_data)(void *); // called after fetch_data
  50. void *callback_arg;
  51. struct starpu_task *pre_sync_task;
  52. struct starpu_task *post_sync_task;
  53. };
  54. /*
  55. * Non Blocking data request from application
  56. */
  57. /* put the current value of the data into RAM */
  58. static void _starpu_data_acquire_fetch_data_callback(void *arg)
  59. {
  60. struct user_interaction_wrapper *wrapper = (struct user_interaction_wrapper *) arg;
  61. starpu_data_handle_t handle = wrapper->handle;
  62. /* At that moment, the caller holds a reference to the piece of data.
  63. * We enqueue the "post" sync task in the list associated to the handle
  64. * so that it is submitted by the starpu_data_release
  65. * function. */
  66. if (wrapper->post_sync_task)
  67. _starpu_add_post_sync_tasks(wrapper->post_sync_task, handle);
  68. wrapper->callback(wrapper->callback_arg);
  69. free(wrapper);
  70. }
  71. static void _starpu_data_acquire_continuation_non_blocking(void *arg)
  72. {
  73. int ret;
  74. struct user_interaction_wrapper *wrapper = (struct user_interaction_wrapper *) arg;
  75. starpu_data_handle_t handle = wrapper->handle;
  76. STARPU_ASSERT(handle);
  77. struct _starpu_data_replicate *replicate = &handle->per_node[wrapper->node];
  78. ret = _starpu_fetch_data_on_node(handle, replicate, wrapper->mode, 0, 1,
  79. _starpu_data_acquire_fetch_data_callback, wrapper);
  80. STARPU_ASSERT(!ret);
  81. }
  82. static void starpu_data_acquire_cb_pre_sync_callback(void *arg)
  83. {
  84. struct user_interaction_wrapper *wrapper = (struct user_interaction_wrapper *) arg;
  85. /* we try to get the data, if we do not succeed immediately, we set a
  86. * callback function that will be executed automatically when the data is
  87. * available again, otherwise we fetch the data directly */
  88. if (!_starpu_attempt_to_submit_data_request_from_apps(wrapper->handle, wrapper->mode,
  89. _starpu_data_acquire_continuation_non_blocking, wrapper))
  90. {
  91. /* no one has locked this data yet, so we proceed immediately */
  92. _starpu_data_acquire_continuation_non_blocking(wrapper);
  93. }
  94. }
  95. /* The data must be released by calling starpu_data_release later on */
  96. int starpu_data_acquire_on_node_cb_sequential_consistency(starpu_data_handle_t handle, unsigned node,
  97. enum starpu_data_access_mode mode, void (*callback)(void *), void *arg,
  98. int sequential_consistency)
  99. {
  100. STARPU_ASSERT(handle);
  101. STARPU_ASSERT_MSG(handle->nchildren == 0, "Acquiring a partitioned data (%p) is not possible", handle);
  102. _STARPU_LOG_IN();
  103. struct user_interaction_wrapper *wrapper = (struct user_interaction_wrapper *) malloc(sizeof(struct user_interaction_wrapper));
  104. STARPU_ASSERT(wrapper);
  105. wrapper->handle = handle;
  106. wrapper->node = node;
  107. wrapper->mode = mode;
  108. wrapper->callback = callback;
  109. wrapper->callback_arg = arg;
  110. STARPU_PTHREAD_COND_INIT(&wrapper->cond, NULL);
  111. STARPU_PTHREAD_MUTEX_INIT(&wrapper->lock, NULL);
  112. wrapper->finished = 0;
  113. wrapper->pre_sync_task = NULL;
  114. wrapper->post_sync_task = NULL;
  115. STARPU_PTHREAD_MUTEX_LOCK(&handle->sequential_consistency_mutex);
  116. int handle_sequential_consistency = handle->sequential_consistency;
  117. if (handle_sequential_consistency && sequential_consistency)
  118. {
  119. struct starpu_task *new_task;
  120. wrapper->pre_sync_task = starpu_task_create();
  121. wrapper->pre_sync_task->name = "acquire_cb_pre";
  122. wrapper->pre_sync_task->detach = 1;
  123. wrapper->pre_sync_task->callback_func = starpu_data_acquire_cb_pre_sync_callback;
  124. wrapper->pre_sync_task->callback_arg = wrapper;
  125. wrapper->post_sync_task = starpu_task_create();
  126. wrapper->post_sync_task->name = "acquire_cb_post";
  127. wrapper->post_sync_task->detach = 1;
  128. new_task = _starpu_detect_implicit_data_deps_with_handle(wrapper->pre_sync_task, wrapper->post_sync_task, handle, mode);
  129. STARPU_PTHREAD_MUTEX_UNLOCK(&handle->sequential_consistency_mutex);
  130. if (new_task)
  131. {
  132. int ret = _starpu_task_submit_internally(new_task);
  133. STARPU_ASSERT(!ret);
  134. }
  135. /* TODO detect if this is superflous */
  136. int ret = _starpu_task_submit_internally(wrapper->pre_sync_task);
  137. STARPU_ASSERT(!ret);
  138. }
  139. else
  140. {
  141. STARPU_PTHREAD_MUTEX_UNLOCK(&handle->sequential_consistency_mutex);
  142. starpu_data_acquire_cb_pre_sync_callback(wrapper);
  143. }
  144. _STARPU_LOG_OUT();
  145. return 0;
  146. }
  147. int starpu_data_acquire_on_node_cb(starpu_data_handle_t handle, unsigned node,
  148. enum starpu_data_access_mode mode, void (*callback)(void *), void *arg)
  149. {
  150. return starpu_data_acquire_on_node_cb_sequential_consistency(handle, node, mode, callback, arg, 1);
  151. }
  152. int starpu_data_acquire_cb(starpu_data_handle_t handle,
  153. enum starpu_data_access_mode mode, void (*callback)(void *), void *arg)
  154. {
  155. return starpu_data_acquire_on_node_cb(handle, STARPU_MAIN_RAM, mode, callback, arg);
  156. }
  157. int starpu_data_acquire_cb_sequential_consistency(starpu_data_handle_t handle,
  158. enum starpu_data_access_mode mode, void (*callback)(void *), void *arg, int sequential_consistency)
  159. {
  160. return starpu_data_acquire_on_node_cb_sequential_consistency(handle, STARPU_MAIN_RAM, mode, callback, arg, sequential_consistency);
  161. }
  162. /*
  163. * Block data request from application
  164. */
  165. static inline void _starpu_data_acquire_continuation(void *arg)
  166. {
  167. struct user_interaction_wrapper *wrapper = (struct user_interaction_wrapper *) arg;
  168. starpu_data_handle_t handle = wrapper->handle;
  169. STARPU_ASSERT(handle);
  170. struct _starpu_data_replicate *replicate = &handle->per_node[wrapper->node];
  171. _starpu_fetch_data_on_node(handle, replicate, wrapper->mode, 0, 0, NULL, NULL);
  172. /* continuation of starpu_data_acquire */
  173. STARPU_PTHREAD_MUTEX_LOCK(&wrapper->lock);
  174. wrapper->finished = 1;
  175. STARPU_PTHREAD_COND_SIGNAL(&wrapper->cond);
  176. STARPU_PTHREAD_MUTEX_UNLOCK(&wrapper->lock);
  177. }
  178. /* The data must be released by calling starpu_data_release later on */
  179. int starpu_data_acquire_on_node(starpu_data_handle_t handle, unsigned node, enum starpu_data_access_mode mode)
  180. {
  181. STARPU_ASSERT(handle);
  182. STARPU_ASSERT_MSG(handle->nchildren == 0, "Acquiring a partitioned data is not possible");
  183. _STARPU_LOG_IN();
  184. /* unless asynchronous, it is forbidden to call this function from a callback or a codelet */
  185. STARPU_ASSERT_MSG(_starpu_worker_may_perform_blocking_calls(), "Acquiring a data synchronously is not possible from a codelet or from a task callback, use starpu_data_acquire_cb instead.");
  186. if (_starpu_data_is_multiformat_handle(handle) &&
  187. _starpu_handle_needs_conversion_task(handle, 0))
  188. {
  189. struct starpu_task *task = _starpu_create_conversion_task(handle, 0);
  190. int ret;
  191. _starpu_spin_lock(&handle->header_lock);
  192. handle->refcnt--;
  193. handle->busy_count--;
  194. handle->mf_node = 0;
  195. _starpu_spin_unlock(&handle->header_lock);
  196. task->synchronous = 1;
  197. ret = _starpu_task_submit_internally(task);
  198. STARPU_ASSERT(!ret);
  199. }
  200. struct user_interaction_wrapper wrapper =
  201. {
  202. .handle = handle,
  203. .mode = mode,
  204. .node = node,
  205. .finished = 0
  206. };
  207. STARPU_PTHREAD_COND_INIT(&wrapper.cond, NULL);
  208. STARPU_PTHREAD_MUTEX_INIT(&wrapper.lock, NULL);
  209. // _STARPU_DEBUG("TAKE sequential_consistency_mutex starpu_data_acquire\n");
  210. STARPU_PTHREAD_MUTEX_LOCK(&handle->sequential_consistency_mutex);
  211. int sequential_consistency = handle->sequential_consistency;
  212. if (sequential_consistency)
  213. {
  214. struct starpu_task *new_task;
  215. wrapper.pre_sync_task = starpu_task_create();
  216. wrapper.pre_sync_task->name = "acquire_pre";
  217. wrapper.pre_sync_task->detach = 0;
  218. wrapper.post_sync_task = starpu_task_create();
  219. wrapper.post_sync_task->name = "acquire_post";
  220. wrapper.post_sync_task->detach = 1;
  221. new_task = _starpu_detect_implicit_data_deps_with_handle(wrapper.pre_sync_task, wrapper.post_sync_task, handle, mode);
  222. STARPU_PTHREAD_MUTEX_UNLOCK(&handle->sequential_consistency_mutex);
  223. if (new_task)
  224. {
  225. int ret = _starpu_task_submit_internally(new_task);
  226. STARPU_ASSERT(!ret);
  227. }
  228. /* TODO detect if this is superflous */
  229. wrapper.pre_sync_task->synchronous = 1;
  230. int ret = _starpu_task_submit_internally(wrapper.pre_sync_task);
  231. STARPU_ASSERT(!ret);
  232. }
  233. else
  234. {
  235. STARPU_PTHREAD_MUTEX_UNLOCK(&handle->sequential_consistency_mutex);
  236. }
  237. /* we try to get the data, if we do not succeed immediately, we set a
  238. * callback function that will be executed automatically when the data is
  239. * available again, otherwise we fetch the data directly */
  240. if (!_starpu_attempt_to_submit_data_request_from_apps(handle, mode, _starpu_data_acquire_continuation, &wrapper))
  241. {
  242. /* no one has locked this data yet, so we proceed immediately */
  243. struct _starpu_data_replicate *replicate = &handle->per_node[node];
  244. int ret = _starpu_fetch_data_on_node(handle, replicate, mode, 0, 0, NULL, NULL);
  245. STARPU_ASSERT(!ret);
  246. }
  247. else
  248. {
  249. STARPU_PTHREAD_MUTEX_LOCK(&wrapper.lock);
  250. while (!wrapper.finished)
  251. STARPU_PTHREAD_COND_WAIT(&wrapper.cond, &wrapper.lock);
  252. STARPU_PTHREAD_MUTEX_UNLOCK(&wrapper.lock);
  253. }
  254. STARPU_PTHREAD_COND_DESTROY(&wrapper.cond);
  255. STARPU_PTHREAD_MUTEX_DESTROY(&wrapper.lock);
  256. /* At that moment, the caller holds a reference to the piece of data.
  257. * We enqueue the "post" sync task in the list associated to the handle
  258. * so that it is submitted by the starpu_data_release
  259. * function. */
  260. _starpu_add_post_sync_tasks(wrapper.post_sync_task, handle);
  261. _STARPU_LOG_OUT();
  262. return 0;
  263. }
  264. int starpu_data_acquire(starpu_data_handle_t handle, enum starpu_data_access_mode mode)
  265. {
  266. return starpu_data_acquire_on_node(handle, STARPU_MAIN_RAM, mode);
  267. }
  268. /* This function must be called after starpu_data_acquire so that the
  269. * application release the data */
  270. void starpu_data_release_on_node(starpu_data_handle_t handle, unsigned node)
  271. {
  272. STARPU_ASSERT(handle);
  273. /* In case there are some implicit dependencies, unlock the "post sync" tasks */
  274. _starpu_unlock_post_sync_tasks(handle);
  275. /* The application can now release the rw-lock */
  276. _starpu_release_data_on_node(handle, 0, &handle->per_node[node]);
  277. }
  278. void starpu_data_release(starpu_data_handle_t handle)
  279. {
  280. starpu_data_release_on_node(handle, 0);
  281. }
  282. static void _prefetch_data_on_node(void *arg)
  283. {
  284. struct user_interaction_wrapper *wrapper = (struct user_interaction_wrapper *) arg;
  285. starpu_data_handle_t handle = wrapper->handle;
  286. int ret;
  287. struct _starpu_data_replicate *replicate = &handle->per_node[wrapper->node];
  288. ret = _starpu_fetch_data_on_node(handle, replicate, STARPU_R, wrapper->async, wrapper->async, NULL, NULL);
  289. STARPU_ASSERT(!ret);
  290. if (wrapper->async)
  291. free(wrapper);
  292. else
  293. {
  294. STARPU_PTHREAD_MUTEX_LOCK(&wrapper->lock);
  295. wrapper->finished = 1;
  296. STARPU_PTHREAD_COND_SIGNAL(&wrapper->cond);
  297. STARPU_PTHREAD_MUTEX_UNLOCK(&wrapper->lock);
  298. }
  299. _starpu_spin_lock(&handle->header_lock);
  300. if (!_starpu_notify_data_dependencies(handle))
  301. _starpu_spin_unlock(&handle->header_lock);
  302. }
  303. static
  304. int _starpu_prefetch_data_on_node_with_mode(starpu_data_handle_t handle, unsigned node, unsigned async, enum starpu_data_access_mode mode)
  305. {
  306. STARPU_ASSERT(handle);
  307. /* it is forbidden to call this function from a callback or a codelet */
  308. STARPU_ASSERT_MSG(async || _starpu_worker_may_perform_blocking_calls(), "Synchronous prefetch is not possible from a task or a callback");
  309. struct user_interaction_wrapper *wrapper = (struct user_interaction_wrapper *) malloc(sizeof(*wrapper));
  310. wrapper->handle = handle;
  311. wrapper->node = node;
  312. wrapper->async = async;
  313. STARPU_PTHREAD_COND_INIT(&wrapper->cond, NULL);
  314. STARPU_PTHREAD_MUTEX_INIT(&wrapper->lock, NULL);
  315. wrapper->finished = 0;
  316. if (!_starpu_attempt_to_submit_data_request_from_apps(handle, mode, _prefetch_data_on_node, wrapper))
  317. {
  318. /* we can immediately proceed */
  319. struct _starpu_data_replicate *replicate = &handle->per_node[node];
  320. STARPU_PTHREAD_COND_DESTROY(&wrapper->cond);
  321. STARPU_PTHREAD_MUTEX_DESTROY(&wrapper->lock);
  322. free(wrapper);
  323. _starpu_fetch_data_on_node(handle, replicate, mode, async, async, NULL, NULL);
  324. /* remove the "lock"/reference */
  325. _starpu_spin_lock(&handle->header_lock);
  326. if (!async)
  327. {
  328. /* Release our refcnt, like _starpu_release_data_on_node would do */
  329. replicate->refcnt--;
  330. STARPU_ASSERT(replicate->refcnt >= 0);
  331. STARPU_ASSERT(handle->busy_count > 0);
  332. handle->busy_count--;
  333. }
  334. /* In case there was a temporary handle (eg. used for reduction), this
  335. * handle may have requested to be destroyed when the data is released
  336. * */
  337. if (!_starpu_notify_data_dependencies(handle))
  338. _starpu_spin_unlock(&handle->header_lock);
  339. }
  340. else if (!async)
  341. {
  342. STARPU_PTHREAD_MUTEX_LOCK(&wrapper->lock);
  343. while (!wrapper->finished)
  344. STARPU_PTHREAD_COND_WAIT(&wrapper->cond, &wrapper->lock);
  345. STARPU_PTHREAD_MUTEX_UNLOCK(&wrapper->lock);
  346. STARPU_PTHREAD_COND_DESTROY(&wrapper->cond);
  347. STARPU_PTHREAD_MUTEX_DESTROY(&wrapper->lock);
  348. free(wrapper);
  349. }
  350. return 0;
  351. }
  352. int starpu_data_prefetch_on_node(starpu_data_handle_t handle, unsigned node, unsigned async)
  353. {
  354. return _starpu_prefetch_data_on_node_with_mode(handle, node, async, STARPU_R);
  355. }
  356. /*
  357. * It is possible to specify that a piece of data can be discarded without
  358. * impacting the application.
  359. */
  360. int _starpu_has_not_important_data;
  361. void starpu_data_advise_as_important(starpu_data_handle_t handle, unsigned is_important)
  362. {
  363. if (!is_important)
  364. _starpu_has_not_important_data = 1;
  365. _starpu_spin_lock(&handle->header_lock);
  366. /* first take all the children lock (in order !) */
  367. unsigned child;
  368. for (child = 0; child < handle->nchildren; child++)
  369. {
  370. /* make sure the intermediate children is advised as well */
  371. starpu_data_handle_t child_handle = starpu_data_get_child(handle, child);
  372. if (child_handle->nchildren > 0)
  373. starpu_data_advise_as_important(child_handle, is_important);
  374. }
  375. handle->is_not_important = !is_important;
  376. /* now the parent may be used again so we release the lock */
  377. _starpu_spin_unlock(&handle->header_lock);
  378. }
  379. void starpu_data_set_sequential_consistency_flag(starpu_data_handle_t handle, unsigned flag)
  380. {
  381. _starpu_spin_lock(&handle->header_lock);
  382. unsigned child;
  383. for (child = 0; child < handle->nchildren; child++)
  384. {
  385. /* make sure that the flags are applied to the children as well */
  386. starpu_data_handle_t child_handle = starpu_data_get_child(handle, child);
  387. if (child_handle->nchildren > 0)
  388. starpu_data_set_sequential_consistency_flag(child_handle, flag);
  389. }
  390. STARPU_PTHREAD_MUTEX_LOCK(&handle->sequential_consistency_mutex);
  391. handle->sequential_consistency = flag;
  392. STARPU_PTHREAD_MUTEX_UNLOCK(&handle->sequential_consistency_mutex);
  393. _starpu_spin_unlock(&handle->header_lock);
  394. }
  395. unsigned starpu_data_get_sequential_consistency_flag(starpu_data_handle_t handle)
  396. {
  397. return handle->sequential_consistency;
  398. }
  399. /* By default, sequential consistency is enabled */
  400. static unsigned default_sequential_consistency_flag = 1;
  401. unsigned starpu_data_get_default_sequential_consistency_flag(void)
  402. {
  403. return default_sequential_consistency_flag;
  404. }
  405. void starpu_data_set_default_sequential_consistency_flag(unsigned flag)
  406. {
  407. default_sequential_consistency_flag = flag;
  408. }
  409. /* Query the status of the handle on the specified memory node. */
  410. void starpu_data_query_status(starpu_data_handle_t handle, int memory_node, int *is_allocated, int *is_valid, int *is_requested)
  411. {
  412. #ifdef STARPU_DEVEL
  413. #warning FIXME
  414. #endif
  415. // _starpu_spin_lock(&handle->header_lock);
  416. if (is_allocated)
  417. *is_allocated = handle->per_node[memory_node].allocated;
  418. if (is_valid)
  419. *is_valid = (handle->per_node[memory_node].state != STARPU_INVALID);
  420. if (is_requested)
  421. {
  422. int requested = 0;
  423. unsigned node;
  424. for (node = 0; node < STARPU_MAXNODES; node++)
  425. {
  426. if (handle->per_node[memory_node].requested[node])
  427. {
  428. requested = 1;
  429. break;
  430. }
  431. }
  432. *is_requested = requested;
  433. }
  434. // _starpu_spin_unlock(&handle->header_lock);
  435. }