coherency.c 30 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures. *
  2. * Copyright (C) 2009-2015 Université de Bordeaux
  3. * Copyright (C) 2010, 2011, 2012, 2013, 2014, 2015 Centre National de la Recherche Scientifique
  4. * Copyright (C) 2014 Inria
  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 <datawizard/coherency.h>
  19. #include <datawizard/copy_driver.h>
  20. #include <datawizard/write_back.h>
  21. #include <core/dependencies/data_concurrency.h>
  22. #include <core/disk.h>
  23. #include <profiling/profiling.h>
  24. #include <math.h>
  25. #include <core/task.h>
  26. #include <starpu_scheduler.h>
  27. #include <core/workers.h>
  28. #ifdef STARPU_SIMGRID
  29. #include <msg/msg.h>
  30. #include <core/simgrid.h>
  31. #endif
  32. static int link_supports_direct_transfers(starpu_data_handle_t handle, unsigned src_node, unsigned dst_node, unsigned *handling_node);
  33. int _starpu_select_src_node(starpu_data_handle_t handle, unsigned destination)
  34. {
  35. int src_node = -1;
  36. unsigned i;
  37. unsigned nnodes = starpu_memory_nodes_get_count();
  38. /* first find a valid copy, either a STARPU_OWNER or a STARPU_SHARED */
  39. unsigned node;
  40. size_t size = _starpu_data_get_size(handle);
  41. double cost = INFINITY;
  42. unsigned src_node_mask = 0;
  43. for (node = 0; node < nnodes; node++)
  44. {
  45. if (handle->per_node[node].state != STARPU_INVALID)
  46. {
  47. /* we found a copy ! */
  48. src_node_mask |= (1<<node);
  49. }
  50. }
  51. if (src_node_mask == 0 && handle->init_cl)
  52. {
  53. /* No copy yet, but applicationg told us how to build it. */
  54. return -1;
  55. }
  56. /* we should have found at least one copy ! */
  57. STARPU_ASSERT_MSG(src_node_mask != 0, "The data for the handle %p is requested, but the handle does not have a valid value. Perhaps some initialization task is missing?", handle);
  58. /* Without knowing the size, we won't know the cost */
  59. if (!size)
  60. cost = 0;
  61. /* Check whether we have transfer cost for all nodes, if so, take the minimum */
  62. if (cost)
  63. for (i = 0; i < nnodes; i++)
  64. {
  65. if (src_node_mask & (1<<i))
  66. {
  67. double time = starpu_transfer_predict(i, destination, size);
  68. unsigned handling_node;
  69. /* Avoid indirect transfers */
  70. if (!link_supports_direct_transfers(handle, i, destination, &handling_node))
  71. continue;
  72. if (_STARPU_IS_ZERO(time))
  73. {
  74. /* No estimation, will have to revert to dumb strategy */
  75. cost = 0.0;
  76. break;
  77. }
  78. else if (time < cost)
  79. {
  80. cost = time;
  81. src_node = i;
  82. }
  83. }
  84. }
  85. if (cost && src_node != -1)
  86. /* Could estimate through cost, return that */
  87. return src_node;
  88. int i_ram = -1;
  89. int i_gpu = -1;
  90. int i_disk = -1;
  91. /* Revert to dumb strategy: take RAM unless only a GPU has it */
  92. for (i = 0; i < nnodes; i++)
  93. {
  94. if (src_node_mask & (1<<i))
  95. {
  96. int (*can_copy)(void *src_interface, unsigned src_node, void *dst_interface, unsigned dst_node, unsigned handling_node) = handle->ops->copy_methods->can_copy;
  97. /* Avoid transfers which the interface does not want */
  98. if (can_copy)
  99. {
  100. void *src_interface = handle->per_node[i].data_interface;
  101. void *dst_interface = handle->per_node[destination].data_interface;
  102. unsigned handling_node;
  103. if (!link_supports_direct_transfers(handle, i, destination, &handling_node))
  104. {
  105. /* Avoid through RAM if the interface does not want it */
  106. void *ram_interface = handle->per_node[STARPU_MAIN_RAM].data_interface;
  107. if ((!can_copy(src_interface, i, ram_interface, STARPU_MAIN_RAM, i)
  108. && !can_copy(src_interface, i, ram_interface, STARPU_MAIN_RAM, STARPU_MAIN_RAM))
  109. || (!can_copy(ram_interface, STARPU_MAIN_RAM, dst_interface, destination, STARPU_MAIN_RAM)
  110. && !can_copy(ram_interface, STARPU_MAIN_RAM, dst_interface, destination, destination)))
  111. continue;
  112. }
  113. }
  114. /* however GPU are expensive sources, really !
  115. * Unless peer transfer is supported (and it would then have been selected above).
  116. * Other should be ok */
  117. if (starpu_node_get_kind(i) == STARPU_CUDA_RAM ||
  118. starpu_node_get_kind(i) == STARPU_OPENCL_RAM ||
  119. starpu_node_get_kind(i) == STARPU_MIC_RAM)
  120. i_gpu = i;
  121. if (starpu_node_get_kind(i) == STARPU_CPU_RAM ||
  122. starpu_node_get_kind(i) == STARPU_SCC_RAM ||
  123. starpu_node_get_kind(i) == STARPU_SCC_SHM)
  124. i_ram = i;
  125. if (starpu_node_get_kind(i) == STARPU_DISK_RAM)
  126. i_disk = i;
  127. }
  128. }
  129. /* we have to use cpu_ram in first */
  130. if (i_ram != -1)
  131. src_node = i_ram;
  132. /* no luck we have to use the disk memory */
  133. else if (i_gpu != -1)
  134. src_node = i_gpu;
  135. else
  136. src_node = i_disk;
  137. STARPU_ASSERT(src_node != -1);
  138. return src_node;
  139. }
  140. /* this may be called once the data is fetched with header and STARPU_RW-lock hold */
  141. void _starpu_update_data_state(starpu_data_handle_t handle,
  142. struct _starpu_data_replicate *requesting_replicate,
  143. enum starpu_data_access_mode mode)
  144. {
  145. /* There is nothing to do for relaxed coherency modes (scratch or
  146. * reductions) */
  147. if (!(mode & STARPU_RW))
  148. return;
  149. unsigned nnodes = starpu_memory_nodes_get_count();
  150. /* the data is present now */
  151. unsigned requesting_node = requesting_replicate->memory_node;
  152. requesting_replicate->requested &= ~(1UL << requesting_node);
  153. if (mode & STARPU_W)
  154. {
  155. /* the requesting node now has the only valid copy */
  156. unsigned node;
  157. for (node = 0; node < nnodes; node++)
  158. handle->per_node[node].state = STARPU_INVALID;
  159. requesting_replicate->state = STARPU_OWNER;
  160. }
  161. else
  162. { /* read only */
  163. if (requesting_replicate->state != STARPU_OWNER)
  164. {
  165. /* there was at least another copy of the data */
  166. unsigned node;
  167. for (node = 0; node < nnodes; node++)
  168. {
  169. struct _starpu_data_replicate *replicate = &handle->per_node[node];
  170. if (replicate->state != STARPU_INVALID)
  171. replicate->state = STARPU_SHARED;
  172. }
  173. requesting_replicate->state = STARPU_SHARED;
  174. }
  175. }
  176. }
  177. static int worker_supports_direct_access(unsigned node, unsigned handling_node)
  178. {
  179. /* only support disk <-> ram and disk <-> disk */
  180. if (starpu_node_get_kind(node) == STARPU_DISK_RAM || starpu_node_get_kind(handling_node) == STARPU_DISK_RAM)
  181. return 0;
  182. if (node == handling_node)
  183. return 1;
  184. if (!_starpu_memory_node_get_nworkers(handling_node))
  185. /* No worker to process the request from that node */
  186. return 0;
  187. int type = starpu_node_get_kind(node);
  188. switch (type)
  189. {
  190. case STARPU_CUDA_RAM:
  191. {
  192. /* GPUs not always allow direct remote access: if CUDA4
  193. * is enabled, we allow two CUDA devices to communicate. */
  194. #ifdef STARPU_SIMGRID
  195. if (starpu_node_get_kind(handling_node) == STARPU_CUDA_RAM)
  196. {
  197. char name[16];
  198. msg_host_t host;
  199. const char* cuda_memcpy_peer;
  200. snprintf(name, sizeof(name), "CUDA%d", _starpu_memory_node_get_devid(handling_node));
  201. host = _starpu_simgrid_get_host_by_name(name);
  202. cuda_memcpy_peer = MSG_host_get_property_value(host, "memcpy_peer");
  203. return cuda_memcpy_peer && atoll(cuda_memcpy_peer);
  204. }
  205. else
  206. return 0;
  207. #elif defined(HAVE_CUDA_MEMCPY_PEER)
  208. /* simgrid */
  209. enum starpu_node_kind kind = starpu_node_get_kind(handling_node);
  210. return kind == STARPU_CUDA_RAM;
  211. #else /* HAVE_CUDA_MEMCPY_PEER */
  212. /* Direct GPU-GPU transfers are not allowed in general */
  213. return 0;
  214. #endif /* HAVE_CUDA_MEMCPY_PEER */
  215. }
  216. case STARPU_OPENCL_RAM:
  217. return 0;
  218. case STARPU_MIC_RAM:
  219. /* We don't handle direct MIC-MIC transfers yet */
  220. return 0;
  221. case STARPU_SCC_RAM:
  222. return 1;
  223. default:
  224. return 1;
  225. }
  226. }
  227. static int link_supports_direct_transfers(starpu_data_handle_t handle, unsigned src_node, unsigned dst_node, unsigned *handling_node)
  228. {
  229. int (*can_copy)(void *src_interface, unsigned src_node, void *dst_interface, unsigned dst_node, unsigned handling_node) = handle->ops->copy_methods->can_copy;
  230. void *src_interface = handle->per_node[src_node].data_interface;
  231. void *dst_interface = handle->per_node[dst_node].data_interface;
  232. /* XXX That's a hack until we fix cudaMemcpy3DPeerAsync in the block interface
  233. * Perhaps not all data interface provide a direct GPU-GPU transfer
  234. * method ! */
  235. #if defined(STARPU_USE_CUDA) || defined(STARPU_SIMGRID)
  236. if (src_node != dst_node && starpu_node_get_kind(src_node) == STARPU_CUDA_RAM && starpu_node_get_kind(dst_node) == STARPU_CUDA_RAM)
  237. {
  238. const struct starpu_data_copy_methods *copy_methods = handle->ops->copy_methods;
  239. if (!copy_methods->cuda_to_cuda_async && !copy_methods->any_to_any)
  240. return 0;
  241. }
  242. #endif
  243. /* Note: with CUDA, performance seems a bit better when issuing the transfer from the destination (tested without GPUDirect, but GPUDirect probably behave the same) */
  244. if (worker_supports_direct_access(src_node, dst_node) && (!can_copy || can_copy(src_interface, src_node, dst_interface, dst_node, dst_node)))
  245. {
  246. *handling_node = dst_node;
  247. return 1;
  248. }
  249. if (worker_supports_direct_access(dst_node, src_node) && (!can_copy || can_copy(src_interface, src_node, dst_interface, dst_node, src_node)))
  250. {
  251. *handling_node = src_node;
  252. return 1;
  253. }
  254. /* Link between disk and ram */
  255. if ((starpu_node_get_kind(src_node) == STARPU_DISK_RAM && starpu_node_get_kind(dst_node) == STARPU_CPU_RAM) ||
  256. (starpu_node_get_kind(src_node) == STARPU_CPU_RAM && starpu_node_get_kind(dst_node) == STARPU_DISK_RAM))
  257. {
  258. /* FIXME: not necessarily a worker :/ */
  259. *handling_node = STARPU_MAIN_RAM;
  260. return 1;
  261. }
  262. /* link between disk and disk, and they have the same kind */
  263. if (_starpu_is_same_kind_disk(src_node, dst_node))
  264. return 1;
  265. return 0;
  266. }
  267. /* Determines the path of a request : each hop is defined by (src,dst) and the
  268. * node that handles the hop. The returned value indicates the number of hops,
  269. * and the max_len is the maximum number of hops (ie. the size of the
  270. * src_nodes, dst_nodes and handling_nodes arrays. */
  271. static int determine_request_path(starpu_data_handle_t handle,
  272. unsigned src_node, unsigned dst_node,
  273. enum starpu_data_access_mode mode, int max_len,
  274. unsigned *src_nodes, unsigned *dst_nodes,
  275. unsigned *handling_nodes)
  276. {
  277. if (!(mode & STARPU_R))
  278. {
  279. /* The destination node should only allocate the data, no transfer is required */
  280. STARPU_ASSERT(max_len >= 1);
  281. src_nodes[0] = STARPU_MAIN_RAM; // ignored
  282. dst_nodes[0] = dst_node;
  283. handling_nodes[0] = dst_node;
  284. return 1;
  285. }
  286. unsigned handling_node;
  287. int link_is_valid = link_supports_direct_transfers(handle, src_node, dst_node, &handling_node);
  288. if (!link_is_valid)
  289. {
  290. int (*can_copy)(void *src_interface, unsigned src_node, void *dst_interface, unsigned dst_node, unsigned handling_node) = handle->ops->copy_methods->can_copy;
  291. void *src_interface = handle->per_node[src_node].data_interface;
  292. void *dst_interface = handle->per_node[dst_node].data_interface;
  293. /* We need an intermediate hop to implement data staging
  294. * through main memory. */
  295. STARPU_ASSERT(max_len >= 2);
  296. /* GPU -> RAM */
  297. src_nodes[0] = src_node;
  298. dst_nodes[0] = STARPU_MAIN_RAM;
  299. if (starpu_node_get_kind(src_node) == STARPU_DISK_RAM)
  300. /* Disks don't have their own driver thread */
  301. handling_nodes[0] = dst_node;
  302. else if (!can_copy || can_copy(src_interface, src_node, dst_interface, dst_node, src_node))
  303. {
  304. handling_nodes[0] = src_node;
  305. }
  306. else
  307. {
  308. STARPU_ASSERT_MSG(can_copy(src_interface, src_node, dst_interface, dst_node, dst_node), "interface %d refuses all kinds of transfers from node %u to node %u\n", handle->ops->interfaceid, src_node, dst_node);
  309. handling_nodes[0] = dst_node;
  310. }
  311. /* RAM -> GPU */
  312. src_nodes[1] = STARPU_MAIN_RAM;
  313. dst_nodes[1] = dst_node;
  314. if (starpu_node_get_kind(dst_node) == STARPU_DISK_RAM)
  315. /* Disks don't have their own driver thread */
  316. handling_nodes[1] = src_node;
  317. else if (!can_copy || can_copy(src_interface, src_node, dst_interface, dst_node, dst_node))
  318. {
  319. handling_nodes[1] = dst_node;
  320. }
  321. else
  322. {
  323. STARPU_ASSERT_MSG(can_copy(src_interface, src_node, dst_interface, dst_node, src_node), "interface %d refuses all kinds of transfers from node %u to node %u\n", handle->ops->interfaceid, src_node, dst_node);
  324. handling_nodes[1] = src_node;
  325. }
  326. return 2;
  327. }
  328. else
  329. {
  330. STARPU_ASSERT(max_len >= 1);
  331. src_nodes[0] = src_node;
  332. dst_nodes[0] = dst_node;
  333. handling_nodes[0] = handling_node;
  334. #if !defined(HAVE_CUDA_MEMCPY_PEER) && !defined(STARPU_SIMGRID)
  335. STARPU_ASSERT(!(mode & STARPU_R) || starpu_node_get_kind(src_node) != STARPU_CUDA_RAM || starpu_node_get_kind(dst_node) != STARPU_CUDA_RAM);
  336. #endif
  337. return 1;
  338. }
  339. }
  340. /* handle->lock should be taken. r is returned locked. The node parameter
  341. * indicate either the source of the request, or the destination for a
  342. * write-only request. */
  343. static struct _starpu_data_request *_starpu_search_existing_data_request(struct _starpu_data_replicate *replicate, unsigned node, enum starpu_data_access_mode mode, unsigned is_prefetch)
  344. {
  345. struct _starpu_data_request *r;
  346. r = replicate->request[node];
  347. if (r)
  348. {
  349. _starpu_spin_checklocked(&r->handle->header_lock);
  350. _starpu_spin_lock(&r->lock);
  351. /* perhaps we need to "upgrade" the request */
  352. if (is_prefetch < r->prefetch)
  353. _starpu_update_prefetch_status(r);
  354. if (mode & STARPU_R)
  355. {
  356. /* in case the exisiting request did not imply a memory
  357. * transfer yet, we have to take a second refcnt now
  358. * for the source, in addition to the refcnt for the
  359. * destination
  360. * (so that the source remains valid) */
  361. if (!(r->mode & STARPU_R))
  362. {
  363. replicate->refcnt++;
  364. replicate->handle->busy_count++;
  365. }
  366. r->mode = (enum starpu_data_access_mode) ((int) r->mode | (int) STARPU_R);
  367. }
  368. if (mode & STARPU_W)
  369. r->mode = (enum starpu_data_access_mode) ((int) r->mode | (int) STARPU_W);
  370. }
  371. return r;
  372. }
  373. /*
  374. * This function is called when the data is needed on the local node, this
  375. * returns a pointer to the local copy
  376. *
  377. * R STARPU_W STARPU_RW
  378. * Owner OK OK OK
  379. * Shared OK 1 1
  380. * Invalid 2 3 4
  381. *
  382. * case 1 : shared + (read)write :
  383. * no data copy but shared->Invalid/Owner
  384. * case 2 : invalid + read :
  385. * data copy + invalid->shared + owner->shared (STARPU_ASSERT(there is a valid))
  386. * case 3 : invalid + write :
  387. * no data copy + invalid->owner + (owner,shared)->invalid
  388. * case 4 : invalid + R/STARPU_W :
  389. * data copy + if (STARPU_W) (invalid->owner + owner->invalid)
  390. * else (invalid,owner->shared)
  391. */
  392. struct _starpu_data_request *_starpu_create_request_to_fetch_data(starpu_data_handle_t handle,
  393. struct _starpu_data_replicate *dst_replicate,
  394. enum starpu_data_access_mode mode, unsigned is_prefetch,
  395. unsigned async,
  396. void (*callback_func)(void *), void *callback_arg)
  397. {
  398. /* We don't care about commuting for data requests, that was handled before. */
  399. mode &= ~STARPU_COMMUTE;
  400. /* This function is called with handle's header lock taken */
  401. _starpu_spin_checklocked(&handle->header_lock);
  402. unsigned requesting_node = dst_replicate->memory_node;
  403. if (dst_replicate->state != STARPU_INVALID)
  404. {
  405. #ifdef STARPU_MEMORY_STATS
  406. enum _starpu_cache_state old_state = dst_replicate->state;
  407. #endif
  408. /* the data is already available so we can stop */
  409. _starpu_update_data_state(handle, dst_replicate, mode);
  410. _starpu_msi_cache_hit(requesting_node);
  411. #ifdef STARPU_MEMORY_STATS
  412. _starpu_memory_handle_stats_cache_hit(handle, requesting_node);
  413. /* XXX Broken ? */
  414. if (old_state == STARPU_SHARED
  415. && dst_replicate->state == STARPU_OWNER)
  416. _starpu_memory_handle_stats_shared_to_owner(handle, requesting_node);
  417. #endif
  418. _starpu_memchunk_recently_used(dst_replicate->mc, requesting_node);
  419. _starpu_spin_unlock(&handle->header_lock);
  420. if (callback_func)
  421. callback_func(callback_arg);
  422. _STARPU_LOG_OUT_TAG("data available");
  423. return NULL;
  424. }
  425. _starpu_msi_cache_miss(requesting_node);
  426. /* the only remaining situation is that the local copy was invalid */
  427. STARPU_ASSERT(dst_replicate->state == STARPU_INVALID);
  428. /* find someone who already has the data */
  429. int src_node = 0;
  430. if (mode & STARPU_R)
  431. {
  432. src_node = _starpu_select_src_node(handle, requesting_node);
  433. STARPU_ASSERT(src_node != (int) requesting_node);
  434. if (src_node < 0)
  435. {
  436. /* We will create it, no need to read an existing value */
  437. mode &= ~STARPU_R;
  438. }
  439. }
  440. else
  441. {
  442. /* if the data is in write only mode (and not SCRATCH or REDUX), there is no need for a source, data will be initialized by the task itself */
  443. if (mode & STARPU_W)
  444. dst_replicate->initialized = 1;
  445. if (requesting_node == STARPU_MAIN_RAM) {
  446. /* And this is the main RAM, really no need for a
  447. * request, just allocate */
  448. if (_starpu_allocate_memory_on_node(handle, dst_replicate, is_prefetch) == 0)
  449. {
  450. _starpu_update_data_state(handle, dst_replicate, mode);
  451. _starpu_spin_unlock(&handle->header_lock);
  452. if (callback_func)
  453. callback_func(callback_arg);
  454. _STARPU_LOG_OUT_TAG("data immediately allocated");
  455. return NULL;
  456. }
  457. }
  458. }
  459. /* We can safely assume that there won't be more than 2 hops in the
  460. * current implementation */
  461. unsigned src_nodes[4], dst_nodes[4], handling_nodes[4];
  462. int nhops = determine_request_path(handle, src_node, requesting_node, mode, 4,
  463. src_nodes, dst_nodes, handling_nodes);
  464. STARPU_ASSERT(nhops >= 1 && nhops <= 4);
  465. struct _starpu_data_request *requests[nhops];
  466. /* Did we reuse a request for that hop ? */
  467. int reused_requests[nhops];
  468. /* Construct an array with a list of requests, possibly reusing existing requests */
  469. int hop;
  470. for (hop = 0; hop < nhops; hop++)
  471. {
  472. struct _starpu_data_request *r;
  473. unsigned hop_src_node = src_nodes[hop];
  474. unsigned hop_dst_node = dst_nodes[hop];
  475. unsigned hop_handling_node = handling_nodes[hop];
  476. struct _starpu_data_replicate *hop_src_replicate;
  477. struct _starpu_data_replicate *hop_dst_replicate;
  478. /* Only the first request is independant */
  479. unsigned ndeps = (hop == 0)?0:1;
  480. hop_src_replicate = &handle->per_node[hop_src_node];
  481. hop_dst_replicate = (hop != nhops - 1)?&handle->per_node[hop_dst_node]:dst_replicate;
  482. /* Try to reuse a request if possible */
  483. r = _starpu_search_existing_data_request(hop_dst_replicate,
  484. (mode & STARPU_R)?hop_src_node:hop_dst_node,
  485. mode, is_prefetch);
  486. reused_requests[hop] = !!r;
  487. if (!r)
  488. {
  489. /* Create a new request if there was no request to reuse */
  490. r = _starpu_create_data_request(handle, hop_src_replicate,
  491. hop_dst_replicate, hop_handling_node,
  492. mode, ndeps, is_prefetch);
  493. }
  494. requests[hop] = r;
  495. }
  496. /* Chain these requests */
  497. for (hop = 0; hop < nhops; hop++)
  498. {
  499. struct _starpu_data_request *r;
  500. r = requests[hop];
  501. if (hop != nhops - 1)
  502. {
  503. if (!reused_requests[hop + 1])
  504. {
  505. r->next_req[r->next_req_count++] = requests[hop + 1];
  506. STARPU_ASSERT(r->next_req_count <= STARPU_MAXNODES);
  507. }
  508. }
  509. else
  510. /* The last request will perform the callback after termination */
  511. _starpu_data_request_append_callback(r, callback_func, callback_arg);
  512. if (reused_requests[hop])
  513. _starpu_spin_unlock(&r->lock);
  514. }
  515. if (!async)
  516. requests[nhops - 1]->refcnt++;
  517. /* we only submit the first request, the remaining will be
  518. * automatically submitted afterward */
  519. if (!reused_requests[0])
  520. _starpu_post_data_request(requests[0], handling_nodes[0]);
  521. return requests[nhops - 1];
  522. }
  523. int _starpu_fetch_data_on_node(starpu_data_handle_t handle, struct _starpu_data_replicate *dst_replicate,
  524. enum starpu_data_access_mode mode, unsigned detached, unsigned async,
  525. void (*callback_func)(void *), void *callback_arg)
  526. {
  527. unsigned local_node = _starpu_memory_node_get_local_key();
  528. _STARPU_LOG_IN();
  529. int cpt = 0;
  530. while (cpt < STARPU_SPIN_MAXTRY && _starpu_spin_trylock(&handle->header_lock))
  531. {
  532. cpt++;
  533. _starpu_datawizard_progress(local_node, 1);
  534. }
  535. if (cpt == STARPU_SPIN_MAXTRY)
  536. _starpu_spin_lock(&handle->header_lock);
  537. if (!detached)
  538. {
  539. /* Take a reference which will be released by _starpu_release_data_on_node */
  540. dst_replicate->refcnt++;
  541. dst_replicate->handle->busy_count++;
  542. }
  543. struct _starpu_data_request *r;
  544. r = _starpu_create_request_to_fetch_data(handle, dst_replicate, mode,
  545. detached, async, callback_func, callback_arg);
  546. /* If no request was created, the handle was already up-to-date on the
  547. * node. In this case, _starpu_create_request_to_fetch_data has already
  548. * unlocked the header. */
  549. if (!r)
  550. return 0;
  551. _starpu_spin_unlock(&handle->header_lock);
  552. int ret = async?0:_starpu_wait_data_request_completion(r, 1);
  553. _STARPU_LOG_OUT();
  554. return ret;
  555. }
  556. static int prefetch_data_on_node(starpu_data_handle_t handle, struct _starpu_data_replicate *replicate, enum starpu_data_access_mode mode)
  557. {
  558. return _starpu_fetch_data_on_node(handle, replicate, mode, 1, 1, NULL, NULL);
  559. }
  560. static int fetch_data(starpu_data_handle_t handle, struct _starpu_data_replicate *replicate, enum starpu_data_access_mode mode)
  561. {
  562. return _starpu_fetch_data_on_node(handle, replicate, mode, 0, 0, NULL, NULL);
  563. }
  564. uint32_t _starpu_get_data_refcnt(starpu_data_handle_t handle, unsigned node)
  565. {
  566. return handle->per_node[node].refcnt;
  567. }
  568. size_t _starpu_data_get_size(starpu_data_handle_t handle)
  569. {
  570. return handle->ops->get_size(handle);
  571. }
  572. uint32_t _starpu_data_get_footprint(starpu_data_handle_t handle)
  573. {
  574. return handle->footprint;
  575. }
  576. /* in case the data was accessed on a write mode, do not forget to
  577. * make it accessible again once it is possible ! */
  578. void _starpu_release_data_on_node(starpu_data_handle_t handle, uint32_t default_wt_mask, struct _starpu_data_replicate *replicate)
  579. {
  580. uint32_t wt_mask;
  581. wt_mask = default_wt_mask | handle->wt_mask;
  582. wt_mask &= (1<<starpu_memory_nodes_get_count())-1;
  583. /* Note that it is possible that there is no valid copy of the data (if
  584. * starpu_data_invalidate was called for instance). In that case, we do
  585. * not enforce any write-through mechanism. */
  586. unsigned memory_node = replicate->memory_node;
  587. if (replicate->state != STARPU_INVALID && handle->current_mode & STARPU_W)
  588. if ((wt_mask & ~(1<<memory_node)))
  589. _starpu_write_through_data(handle, memory_node, wt_mask);
  590. unsigned local_node = _starpu_memory_node_get_local_key();
  591. int cpt = 0;
  592. while (cpt < STARPU_SPIN_MAXTRY && _starpu_spin_trylock(&handle->header_lock))
  593. {
  594. cpt++;
  595. _starpu_datawizard_progress(local_node, 1);
  596. }
  597. if (cpt == STARPU_SPIN_MAXTRY)
  598. _starpu_spin_lock(&handle->header_lock);
  599. /* Release refcnt taken by fetch_data_on_node */
  600. replicate->refcnt--;
  601. STARPU_ASSERT_MSG(replicate->refcnt >= 0, "handle %p released too many times", handle);
  602. STARPU_ASSERT_MSG(handle->busy_count > 0, "handle %p released too many times", handle);
  603. handle->busy_count--;
  604. if (!_starpu_notify_data_dependencies(handle))
  605. _starpu_spin_unlock(&handle->header_lock);
  606. }
  607. static void _starpu_set_data_requested_flag_if_needed(starpu_data_handle_t handle, struct _starpu_data_replicate *replicate)
  608. {
  609. unsigned local_node = _starpu_memory_node_get_local_key();
  610. int cpt = 0;
  611. while (cpt < STARPU_SPIN_MAXTRY && _starpu_spin_trylock(&handle->header_lock))
  612. {
  613. cpt++;
  614. _starpu_datawizard_progress(local_node, 1);
  615. }
  616. if (cpt == STARPU_SPIN_MAXTRY)
  617. _starpu_spin_lock(&handle->header_lock);
  618. if (replicate->state == STARPU_INVALID)
  619. {
  620. unsigned dst_node = replicate->memory_node;
  621. replicate->requested |= 1UL << dst_node;
  622. }
  623. _starpu_spin_unlock(&handle->header_lock);
  624. }
  625. int starpu_prefetch_task_input_on_node(struct starpu_task *task, unsigned node)
  626. {
  627. STARPU_ASSERT(!task->prefetched);
  628. unsigned nbuffers = STARPU_TASK_GET_NBUFFERS(task);
  629. unsigned index;
  630. for (index = 0; index < nbuffers; index++)
  631. {
  632. starpu_data_handle_t handle = STARPU_TASK_GET_HANDLE(task, index);
  633. enum starpu_data_access_mode mode = STARPU_TASK_GET_MODE(task, index);
  634. if (mode & (STARPU_SCRATCH|STARPU_REDUX))
  635. continue;
  636. struct _starpu_data_replicate *replicate = &handle->per_node[node];
  637. prefetch_data_on_node(handle, replicate, mode);
  638. _starpu_set_data_requested_flag_if_needed(handle, replicate);
  639. }
  640. return 0;
  641. }
  642. static struct _starpu_data_replicate *get_replicate(starpu_data_handle_t handle, enum starpu_data_access_mode mode, int workerid, unsigned node)
  643. {
  644. if (mode & (STARPU_SCRATCH|STARPU_REDUX))
  645. return &handle->per_worker[workerid];
  646. else
  647. /* That's a "normal" buffer (R/W) */
  648. return &handle->per_node[node];
  649. }
  650. int _starpu_fetch_task_input(struct _starpu_job *j)
  651. {
  652. _STARPU_TRACE_START_FETCH_INPUT(NULL);
  653. int profiling = starpu_profiling_status_get();
  654. struct starpu_task *task = j->task;
  655. if (profiling && task->profiling_info)
  656. _starpu_clock_gettime(&task->profiling_info->acquire_data_start_time);
  657. struct _starpu_data_descr *descrs = _STARPU_JOB_GET_ORDERED_BUFFERS(j);
  658. unsigned nbuffers = STARPU_TASK_GET_NBUFFERS(task);
  659. unsigned local_memory_node = _starpu_memory_node_get_local_key();
  660. int workerid = starpu_worker_get_id();
  661. #ifdef STARPU_USE_FXT
  662. unsigned long total_size = 0;
  663. #endif
  664. unsigned index;
  665. for (index = 0; index < nbuffers; index++)
  666. {
  667. int ret;
  668. starpu_data_handle_t handle = descrs[index].handle;
  669. enum starpu_data_access_mode mode = descrs[index].mode;
  670. int node = descrs[index].node;
  671. if (node == -1)
  672. node = local_memory_node;
  673. if (mode == STARPU_NONE ||
  674. (mode & ((1<<STARPU_MODE_SHIFT) - 1)) >= STARPU_ACCESS_MODE_MAX ||
  675. (mode >> STARPU_MODE_SHIFT) >= STARPU_SHIFTED_MODE_MAX)
  676. STARPU_ASSERT_MSG(0, "mode %d (0x%x) is bogus\n", mode, mode);
  677. struct _starpu_data_replicate *local_replicate;
  678. if (index && descrs[index-1].handle == descrs[index].handle)
  679. /* We have already took this data, skip it. This
  680. * depends on ordering putting writes before reads, see
  681. * _starpu_compar_handles */
  682. continue;
  683. local_replicate = get_replicate(handle, mode, workerid, node);
  684. ret = fetch_data(handle, local_replicate, mode);
  685. if (STARPU_UNLIKELY(ret))
  686. goto enomem;
  687. #ifdef STARPU_USE_FXT
  688. total_size += _starpu_data_get_size(handle);
  689. #endif
  690. }
  691. _STARPU_TRACE_DATA_LOAD(workerid,total_size);
  692. /* Now that we have taken the data locks in locking order, fill the codelet interfaces in function order. */
  693. for (index = 0; index < nbuffers; index++)
  694. {
  695. starpu_data_handle_t handle = STARPU_TASK_GET_HANDLE(task, index);
  696. enum starpu_data_access_mode mode = STARPU_TASK_GET_MODE(task, index);
  697. int node = descrs[index].node;
  698. if (node == -1)
  699. node = local_memory_node;
  700. struct _starpu_data_replicate *local_replicate;
  701. local_replicate = get_replicate(handle, mode, workerid, node);
  702. _STARPU_TASK_SET_INTERFACE(task , local_replicate->data_interface, index);
  703. /* If the replicate was not initialized yet, we have to do it now */
  704. if (!(mode & STARPU_SCRATCH) && !local_replicate->initialized)
  705. _starpu_redux_init_data_replicate(handle, local_replicate, workerid);
  706. }
  707. if (profiling && task->profiling_info)
  708. _starpu_clock_gettime(&task->profiling_info->acquire_data_end_time);
  709. _STARPU_TRACE_END_FETCH_INPUT(NULL);
  710. return 0;
  711. enomem:
  712. _STARPU_TRACE_END_FETCH_INPUT(NULL);
  713. _STARPU_DISP("something went wrong with buffer %u\n", index);
  714. /* try to unreference all the input that were successfully taken */
  715. unsigned index2;
  716. for (index2 = 0; index2 < index; index2++)
  717. {
  718. starpu_data_handle_t handle = descrs[index2].handle;
  719. enum starpu_data_access_mode mode = descrs[index2].mode;
  720. int node = descrs[index].node;
  721. if (node == -1)
  722. node = local_memory_node;
  723. struct _starpu_data_replicate *local_replicate;
  724. if (index2 && descrs[index2-1].handle == descrs[index2].handle)
  725. /* We have already released this data, skip it. This
  726. * depends on ordering putting writes before reads, see
  727. * _starpu_compar_handles */
  728. continue;
  729. local_replicate = get_replicate(handle, mode, workerid, node);
  730. _starpu_release_data_on_node(handle, 0, local_replicate);
  731. }
  732. return -1;
  733. }
  734. void _starpu_push_task_output(struct _starpu_job *j)
  735. {
  736. #ifdef STARPU_OPENMP
  737. STARPU_ASSERT(!j->continuation);
  738. #endif
  739. _STARPU_TRACE_START_PUSH_OUTPUT(NULL);
  740. int profiling = starpu_profiling_status_get();
  741. struct starpu_task *task = j->task;
  742. if (profiling && task->profiling_info)
  743. _starpu_clock_gettime(&task->profiling_info->release_data_start_time);
  744. struct _starpu_data_descr *descrs = _STARPU_JOB_GET_ORDERED_BUFFERS(j);
  745. unsigned nbuffers = STARPU_TASK_GET_NBUFFERS(task);
  746. int workerid = starpu_worker_get_id();
  747. unsigned local_memory_node = _starpu_memory_node_get_local_key();
  748. unsigned index;
  749. for (index = 0; index < nbuffers; index++)
  750. {
  751. starpu_data_handle_t handle = descrs[index].handle;
  752. enum starpu_data_access_mode mode = descrs[index].mode;
  753. int node = descrs[index].node;
  754. if (node == -1)
  755. node = local_memory_node;
  756. struct _starpu_data_replicate *local_replicate;
  757. if (index && descrs[index-1].handle == descrs[index].handle)
  758. /* We have already released this data, skip it. This
  759. * depends on ordering putting writes before reads, see
  760. * _starpu_compar_handles */
  761. continue;
  762. local_replicate = get_replicate(handle, mode, workerid, node);
  763. /* Keep a reference for future
  764. * _starpu_release_task_enforce_sequential_consistency call */
  765. _starpu_spin_lock(&handle->header_lock);
  766. handle->busy_count++;
  767. _starpu_spin_unlock(&handle->header_lock);
  768. _starpu_release_data_on_node(handle, 0, local_replicate);
  769. }
  770. if (profiling && task->profiling_info)
  771. _starpu_clock_gettime(&task->profiling_info->release_data_end_time);
  772. _STARPU_TRACE_END_PUSH_OUTPUT(NULL);
  773. }
  774. /* NB : this value can only be an indication of the status of a data
  775. at some point, but there is no strong garantee ! */
  776. unsigned _starpu_is_data_present_or_requested(starpu_data_handle_t handle, unsigned node)
  777. {
  778. unsigned ret = 0;
  779. // XXX : this is just a hint, so we don't take the lock ...
  780. // STARPU_PTHREAD_SPIN_LOCK(&handle->header_lock);
  781. if (handle->per_node[node].state != STARPU_INVALID)
  782. {
  783. ret = 1;
  784. }
  785. else
  786. {
  787. unsigned i;
  788. unsigned nnodes = starpu_memory_nodes_get_count();
  789. for (i = 0; i < nnodes; i++)
  790. {
  791. if ((handle->per_node[node].requested & (1UL << i)) || handle->per_node[node].request[i])
  792. ret = 1;
  793. }
  794. }
  795. // STARPU_PTHREAD_SPIN_UNLOCK(&handle->header_lock);
  796. return ret;
  797. }
  798. void _starpu_data_set_unregister_hook(starpu_data_handle_t handle, _starpu_data_handle_unregister_hook func)
  799. {
  800. handle->unregister_hook = func;
  801. }