user_interactions.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543
  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->detach = 1;
  122. wrapper->pre_sync_task->callback_func = starpu_data_acquire_cb_pre_sync_callback;
  123. wrapper->pre_sync_task->callback_arg = wrapper;
  124. wrapper->post_sync_task = starpu_task_create();
  125. wrapper->post_sync_task->detach = 1;
  126. #ifdef STARPU_USE_FXT
  127. struct _starpu_job *job = _starpu_get_job_associated_to_task(wrapper->pre_sync_task);
  128. job->model_name = "acquire_cb_pre";
  129. job = _starpu_get_job_associated_to_task(wrapper->post_sync_task);
  130. job->model_name = "acquire_cb_post";
  131. #endif
  132. new_task = _starpu_detect_implicit_data_deps_with_handle(wrapper->pre_sync_task, wrapper->post_sync_task, handle, mode);
  133. STARPU_PTHREAD_MUTEX_UNLOCK(&handle->sequential_consistency_mutex);
  134. if (new_task)
  135. {
  136. int ret = _starpu_task_submit_internally(new_task);
  137. STARPU_ASSERT(!ret);
  138. }
  139. /* TODO detect if this is superflous */
  140. int ret = _starpu_task_submit_internally(wrapper->pre_sync_task);
  141. STARPU_ASSERT(!ret);
  142. }
  143. else
  144. {
  145. STARPU_PTHREAD_MUTEX_UNLOCK(&handle->sequential_consistency_mutex);
  146. starpu_data_acquire_cb_pre_sync_callback(wrapper);
  147. }
  148. _STARPU_LOG_OUT();
  149. return 0;
  150. }
  151. int starpu_data_acquire_on_node_cb(starpu_data_handle_t handle, unsigned node,
  152. enum starpu_data_access_mode mode, void (*callback)(void *), void *arg)
  153. {
  154. return starpu_data_acquire_on_node_cb_sequential_consistency(handle, node, mode, callback, arg, 1);
  155. }
  156. int starpu_data_acquire_cb(starpu_data_handle_t handle,
  157. enum starpu_data_access_mode mode, void (*callback)(void *), void *arg)
  158. {
  159. return starpu_data_acquire_on_node_cb(handle, 0, mode, callback, arg);
  160. }
  161. int starpu_data_acquire_cb_sequential_consistency(starpu_data_handle_t handle,
  162. enum starpu_data_access_mode mode, void (*callback)(void *), void *arg, int sequential_consistency)
  163. {
  164. return starpu_data_acquire_on_node_cb_sequential_consistency(handle, 0, mode, callback, arg, sequential_consistency);
  165. }
  166. /*
  167. * Block data request from application
  168. */
  169. static inline void _starpu_data_acquire_continuation(void *arg)
  170. {
  171. struct user_interaction_wrapper *wrapper = (struct user_interaction_wrapper *) arg;
  172. starpu_data_handle_t handle = wrapper->handle;
  173. STARPU_ASSERT(handle);
  174. struct _starpu_data_replicate *replicate = &handle->per_node[wrapper->node];
  175. _starpu_fetch_data_on_node(handle, replicate, wrapper->mode, 0, 0, NULL, NULL);
  176. /* continuation of starpu_data_acquire */
  177. STARPU_PTHREAD_MUTEX_LOCK(&wrapper->lock);
  178. wrapper->finished = 1;
  179. STARPU_PTHREAD_COND_SIGNAL(&wrapper->cond);
  180. STARPU_PTHREAD_MUTEX_UNLOCK(&wrapper->lock);
  181. }
  182. /* The data must be released by calling starpu_data_release later on */
  183. int starpu_data_acquire_on_node(starpu_data_handle_t handle, unsigned node, enum starpu_data_access_mode mode)
  184. {
  185. STARPU_ASSERT(handle);
  186. STARPU_ASSERT_MSG(handle->nchildren == 0, "Acquiring a partitioned data is not possible");
  187. _STARPU_LOG_IN();
  188. /* unless asynchronous, it is forbidden to call this function from a callback or a codelet */
  189. if (STARPU_UNLIKELY(!_starpu_worker_may_perform_blocking_calls()))
  190. {
  191. _STARPU_LOG_OUT_TAG("EDEADLK");
  192. return -EDEADLK;
  193. }
  194. if (_starpu_data_is_multiformat_handle(handle) &&
  195. _starpu_handle_needs_conversion_task(handle, 0))
  196. {
  197. struct starpu_task *task = _starpu_create_conversion_task(handle, 0);
  198. int ret;
  199. _starpu_spin_lock(&handle->header_lock);
  200. handle->refcnt--;
  201. handle->busy_count--;
  202. handle->mf_node = 0;
  203. _starpu_spin_unlock(&handle->header_lock);
  204. task->synchronous = 1;
  205. ret = _starpu_task_submit_internally(task);
  206. STARPU_ASSERT(!ret);
  207. }
  208. struct user_interaction_wrapper wrapper =
  209. {
  210. .handle = handle,
  211. .mode = mode,
  212. .node = node,
  213. .finished = 0
  214. };
  215. STARPU_PTHREAD_COND_INIT(&wrapper.cond, NULL);
  216. STARPU_PTHREAD_MUTEX_INIT(&wrapper.lock, NULL);
  217. // _STARPU_DEBUG("TAKE sequential_consistency_mutex starpu_data_acquire\n");
  218. STARPU_PTHREAD_MUTEX_LOCK(&handle->sequential_consistency_mutex);
  219. int sequential_consistency = handle->sequential_consistency;
  220. if (sequential_consistency)
  221. {
  222. struct starpu_task *new_task;
  223. wrapper.pre_sync_task = starpu_task_create();
  224. wrapper.pre_sync_task->detach = 0;
  225. wrapper.post_sync_task = starpu_task_create();
  226. wrapper.post_sync_task->detach = 1;
  227. #ifdef STARPU_USE_FXT
  228. struct _starpu_job *job = _starpu_get_job_associated_to_task(wrapper.pre_sync_task);
  229. job->model_name = "acquire_pre";
  230. job = _starpu_get_job_associated_to_task(wrapper.post_sync_task);
  231. job->model_name = "acquire_post";
  232. #endif
  233. new_task = _starpu_detect_implicit_data_deps_with_handle(wrapper.pre_sync_task, wrapper.post_sync_task, handle, mode);
  234. STARPU_PTHREAD_MUTEX_UNLOCK(&handle->sequential_consistency_mutex);
  235. if (new_task)
  236. {
  237. int ret = _starpu_task_submit_internally(new_task);
  238. STARPU_ASSERT(!ret);
  239. }
  240. /* TODO detect if this is superflous */
  241. wrapper.pre_sync_task->synchronous = 1;
  242. int ret = _starpu_task_submit_internally(wrapper.pre_sync_task);
  243. STARPU_ASSERT(!ret);
  244. }
  245. else
  246. {
  247. STARPU_PTHREAD_MUTEX_UNLOCK(&handle->sequential_consistency_mutex);
  248. }
  249. /* we try to get the data, if we do not succeed immediately, we set a
  250. * callback function that will be executed automatically when the data is
  251. * available again, otherwise we fetch the data directly */
  252. if (!_starpu_attempt_to_submit_data_request_from_apps(handle, mode, _starpu_data_acquire_continuation, &wrapper))
  253. {
  254. /* no one has locked this data yet, so we proceed immediately */
  255. struct _starpu_data_replicate *replicate = &handle->per_node[node];
  256. int ret = _starpu_fetch_data_on_node(handle, replicate, mode, 0, 0, NULL, NULL);
  257. STARPU_ASSERT(!ret);
  258. }
  259. else
  260. {
  261. STARPU_PTHREAD_MUTEX_LOCK(&wrapper.lock);
  262. while (!wrapper.finished)
  263. STARPU_PTHREAD_COND_WAIT(&wrapper.cond, &wrapper.lock);
  264. STARPU_PTHREAD_MUTEX_UNLOCK(&wrapper.lock);
  265. }
  266. STARPU_PTHREAD_COND_DESTROY(&wrapper.cond);
  267. STARPU_PTHREAD_MUTEX_DESTROY(&wrapper.lock);
  268. /* At that moment, the caller holds a reference to the piece of data.
  269. * We enqueue the "post" sync task in the list associated to the handle
  270. * so that it is submitted by the starpu_data_release
  271. * function. */
  272. _starpu_add_post_sync_tasks(wrapper.post_sync_task, handle);
  273. _STARPU_LOG_OUT();
  274. return 0;
  275. }
  276. int starpu_data_acquire(starpu_data_handle_t handle, enum starpu_data_access_mode mode)
  277. {
  278. return starpu_data_acquire_on_node(handle, 0, mode);
  279. }
  280. /* This function must be called after starpu_data_acquire so that the
  281. * application release the data */
  282. void starpu_data_release_on_node(starpu_data_handle_t handle, unsigned node)
  283. {
  284. STARPU_ASSERT(handle);
  285. /* In case there are some implicit dependencies, unlock the "post sync" tasks */
  286. _starpu_unlock_post_sync_tasks(handle);
  287. /* The application can now release the rw-lock */
  288. _starpu_release_data_on_node(handle, 0, &handle->per_node[node]);
  289. }
  290. void starpu_data_release(starpu_data_handle_t handle)
  291. {
  292. starpu_data_release_on_node(handle, 0);
  293. }
  294. static void _prefetch_data_on_node(void *arg)
  295. {
  296. struct user_interaction_wrapper *wrapper = (struct user_interaction_wrapper *) arg;
  297. starpu_data_handle_t handle = wrapper->handle;
  298. int ret;
  299. struct _starpu_data_replicate *replicate = &handle->per_node[wrapper->node];
  300. ret = _starpu_fetch_data_on_node(handle, replicate, STARPU_R, wrapper->async, wrapper->async, NULL, NULL);
  301. STARPU_ASSERT(!ret);
  302. if (wrapper->async)
  303. free(wrapper);
  304. else
  305. {
  306. STARPU_PTHREAD_MUTEX_LOCK(&wrapper->lock);
  307. wrapper->finished = 1;
  308. STARPU_PTHREAD_COND_SIGNAL(&wrapper->cond);
  309. STARPU_PTHREAD_MUTEX_UNLOCK(&wrapper->lock);
  310. }
  311. _starpu_spin_lock(&handle->header_lock);
  312. if (!_starpu_notify_data_dependencies(handle))
  313. _starpu_spin_unlock(&handle->header_lock);
  314. }
  315. static
  316. int _starpu_prefetch_data_on_node_with_mode(starpu_data_handle_t handle, unsigned node, unsigned async, enum starpu_data_access_mode mode)
  317. {
  318. STARPU_ASSERT(handle);
  319. /* it is forbidden to call this function from a callback or a codelet */
  320. if (STARPU_UNLIKELY(!async && !_starpu_worker_may_perform_blocking_calls()))
  321. return -EDEADLK;
  322. struct user_interaction_wrapper *wrapper = (struct user_interaction_wrapper *) malloc(sizeof(*wrapper));
  323. wrapper->handle = handle;
  324. wrapper->node = node;
  325. wrapper->async = async;
  326. STARPU_PTHREAD_COND_INIT(&wrapper->cond, NULL);
  327. STARPU_PTHREAD_MUTEX_INIT(&wrapper->lock, NULL);
  328. wrapper->finished = 0;
  329. if (!_starpu_attempt_to_submit_data_request_from_apps(handle, mode, _prefetch_data_on_node, wrapper))
  330. {
  331. /* we can immediately proceed */
  332. struct _starpu_data_replicate *replicate = &handle->per_node[node];
  333. STARPU_PTHREAD_COND_DESTROY(&wrapper->cond);
  334. STARPU_PTHREAD_MUTEX_DESTROY(&wrapper->lock);
  335. free(wrapper);
  336. _starpu_fetch_data_on_node(handle, replicate, mode, async, async, NULL, NULL);
  337. /* remove the "lock"/reference */
  338. _starpu_spin_lock(&handle->header_lock);
  339. if (!async)
  340. {
  341. /* Release our refcnt, like _starpu_release_data_on_node would do */
  342. replicate->refcnt--;
  343. STARPU_ASSERT(replicate->refcnt >= 0);
  344. STARPU_ASSERT(handle->busy_count > 0);
  345. handle->busy_count--;
  346. }
  347. /* In case there was a temporary handle (eg. used for reduction), this
  348. * handle may have requested to be destroyed when the data is released
  349. * */
  350. if (!_starpu_notify_data_dependencies(handle))
  351. _starpu_spin_unlock(&handle->header_lock);
  352. }
  353. else if (!async)
  354. {
  355. STARPU_PTHREAD_MUTEX_LOCK(&wrapper->lock);
  356. while (!wrapper->finished)
  357. STARPU_PTHREAD_COND_WAIT(&wrapper->cond, &wrapper->lock);
  358. STARPU_PTHREAD_MUTEX_UNLOCK(&wrapper->lock);
  359. STARPU_PTHREAD_COND_DESTROY(&wrapper->cond);
  360. STARPU_PTHREAD_MUTEX_DESTROY(&wrapper->lock);
  361. free(wrapper);
  362. }
  363. return 0;
  364. }
  365. int starpu_data_prefetch_on_node(starpu_data_handle_t handle, unsigned node, unsigned async)
  366. {
  367. return _starpu_prefetch_data_on_node_with_mode(handle, node, async, STARPU_R);
  368. }
  369. /*
  370. * It is possible to specify that a piece of data can be discarded without
  371. * impacting the application.
  372. */
  373. void starpu_data_advise_as_important(starpu_data_handle_t handle, unsigned is_important)
  374. {
  375. _starpu_spin_lock(&handle->header_lock);
  376. /* first take all the children lock (in order !) */
  377. unsigned child;
  378. for (child = 0; child < handle->nchildren; child++)
  379. {
  380. /* make sure the intermediate children is advised as well */
  381. starpu_data_handle_t child_handle = starpu_data_get_child(handle, child);
  382. if (child_handle->nchildren > 0)
  383. starpu_data_advise_as_important(child_handle, is_important);
  384. }
  385. handle->is_not_important = !is_important;
  386. /* now the parent may be used again so we release the lock */
  387. _starpu_spin_unlock(&handle->header_lock);
  388. }
  389. void starpu_data_set_sequential_consistency_flag(starpu_data_handle_t handle, unsigned flag)
  390. {
  391. _starpu_spin_lock(&handle->header_lock);
  392. unsigned child;
  393. for (child = 0; child < handle->nchildren; child++)
  394. {
  395. /* make sure that the flags are applied to the children as well */
  396. starpu_data_handle_t child_handle = starpu_data_get_child(handle, child);
  397. if (child_handle->nchildren > 0)
  398. starpu_data_set_sequential_consistency_flag(child_handle, flag);
  399. }
  400. STARPU_PTHREAD_MUTEX_LOCK(&handle->sequential_consistency_mutex);
  401. handle->sequential_consistency = flag;
  402. STARPU_PTHREAD_MUTEX_UNLOCK(&handle->sequential_consistency_mutex);
  403. _starpu_spin_unlock(&handle->header_lock);
  404. }
  405. unsigned starpu_data_get_sequential_consistency_flag(starpu_data_handle_t handle)
  406. {
  407. return handle->sequential_consistency;
  408. }
  409. /* By default, sequential consistency is enabled */
  410. static unsigned default_sequential_consistency_flag = 1;
  411. unsigned starpu_data_get_default_sequential_consistency_flag(void)
  412. {
  413. return default_sequential_consistency_flag;
  414. }
  415. void starpu_data_set_default_sequential_consistency_flag(unsigned flag)
  416. {
  417. default_sequential_consistency_flag = flag;
  418. }
  419. /* Query the status of the handle on the specified memory node. */
  420. void starpu_data_query_status(starpu_data_handle_t handle, int memory_node, int *is_allocated, int *is_valid, int *is_requested)
  421. {
  422. #ifdef STARPU_DEVEL
  423. #warning FIXME
  424. #endif
  425. // _starpu_spin_lock(&handle->header_lock);
  426. if (is_allocated)
  427. *is_allocated = handle->per_node[memory_node].allocated;
  428. if (is_valid)
  429. *is_valid = (handle->per_node[memory_node].state != STARPU_INVALID);
  430. if (is_requested)
  431. {
  432. int requested = 0;
  433. unsigned node;
  434. for (node = 0; node < STARPU_MAXNODES; node++)
  435. {
  436. if (handle->per_node[memory_node].requested[node])
  437. {
  438. requested = 1;
  439. break;
  440. }
  441. }
  442. *is_requested = requested;
  443. }
  444. // _starpu_spin_unlock(&handle->header_lock);
  445. }