coherency.c 44 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2008-2020 Université de Bordeaux, CNRS (LaBRI UMR 5800), Inria
  4. * Copyright (C) 2018 Federal University of Rio Grande do Sul (UFRGS)
  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 <limits.h>
  18. #include <math.h>
  19. #include <common/config.h>
  20. #include <datawizard/coherency.h>
  21. #include <datawizard/copy_driver.h>
  22. #include <datawizard/write_back.h>
  23. #include <datawizard/memory_nodes.h>
  24. #include <core/dependencies/data_concurrency.h>
  25. #include <core/disk.h>
  26. #include <profiling/profiling.h>
  27. #include <core/task.h>
  28. #include <starpu_scheduler.h>
  29. #include <core/workers.h>
  30. #ifdef STARPU_SIMGRID
  31. #include <core/simgrid.h>
  32. #endif
  33. static int link_supports_direct_transfers(starpu_data_handle_t handle, unsigned src_node, unsigned dst_node, unsigned *handling_node);
  34. int _starpu_select_src_node(starpu_data_handle_t handle, unsigned destination)
  35. {
  36. int src_node = -1;
  37. unsigned i;
  38. unsigned nnodes = starpu_memory_nodes_get_count();
  39. /* first find a valid copy, either a STARPU_OWNER or a STARPU_SHARED */
  40. unsigned node;
  41. size_t size = _starpu_data_get_size(handle);
  42. double cost = INFINITY;
  43. unsigned src_node_mask = 0;
  44. for (node = 0; node < nnodes; node++)
  45. {
  46. if (handle->per_node[node].state != STARPU_INVALID)
  47. {
  48. /* we found a copy ! */
  49. src_node_mask |= (1<<node);
  50. }
  51. }
  52. if (src_node_mask == 0 && handle->init_cl)
  53. {
  54. /* No copy yet, but applicationg told us how to build it. */
  55. return -1;
  56. }
  57. /* we should have found at least one copy ! */
  58. 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);
  59. /* Without knowing the size, we won't know the cost */
  60. if (!size)
  61. cost = 0;
  62. /* Check whether we have transfer cost for all nodes, if so, take the minimum */
  63. if (cost)
  64. for (i = 0; i < nnodes; i++)
  65. {
  66. if (src_node_mask & (1<<i))
  67. {
  68. double time = starpu_transfer_predict(i, destination, size);
  69. unsigned handling_node;
  70. /* Avoid indirect transfers */
  71. if (!link_supports_direct_transfers(handle, i, destination, &handling_node))
  72. continue;
  73. if (_STARPU_IS_ZERO(time))
  74. {
  75. /* No estimation, will have to revert to dumb strategy */
  76. cost = 0.0;
  77. break;
  78. }
  79. else if (time < cost)
  80. {
  81. cost = time;
  82. src_node = i;
  83. }
  84. }
  85. }
  86. if (cost && src_node != -1)
  87. {
  88. /* Could estimate through cost, return that */
  89. STARPU_ASSERT(handle->per_node[src_node].allocated);
  90. STARPU_ASSERT(handle->per_node[src_node].initialized);
  91. return src_node;
  92. }
  93. int i_ram = -1;
  94. int i_gpu = -1;
  95. int i_disk = -1;
  96. /* Revert to dumb strategy: take RAM unless only a GPU has it */
  97. for (i = 0; i < nnodes; i++)
  98. {
  99. if (src_node_mask & (1<<i))
  100. {
  101. int (*can_copy)(void *src_interface, unsigned src_node, void *dst_interface, unsigned dst_node, unsigned handling_node) = handle->ops->copy_methods->can_copy;
  102. /* Avoid transfers which the interface does not want */
  103. if (can_copy)
  104. {
  105. void *src_interface = handle->per_node[i].data_interface;
  106. void *dst_interface = handle->per_node[destination].data_interface;
  107. unsigned handling_node;
  108. if (!link_supports_direct_transfers(handle, i, destination, &handling_node))
  109. {
  110. /* Avoid through RAM if the interface does not want it */
  111. void *ram_interface = handle->per_node[STARPU_MAIN_RAM].data_interface;
  112. if ((!can_copy(src_interface, i, ram_interface, STARPU_MAIN_RAM, i)
  113. && !can_copy(src_interface, i, ram_interface, STARPU_MAIN_RAM, STARPU_MAIN_RAM))
  114. || (!can_copy(ram_interface, STARPU_MAIN_RAM, dst_interface, destination, STARPU_MAIN_RAM)
  115. && !can_copy(ram_interface, STARPU_MAIN_RAM, dst_interface, destination, destination)))
  116. continue;
  117. }
  118. }
  119. /* however GPU are expensive sources, really !
  120. * Unless peer transfer is supported (and it would then have been selected above).
  121. * Other should be ok */
  122. if (starpu_node_get_kind(i) == STARPU_CUDA_RAM ||
  123. starpu_node_get_kind(i) == STARPU_OPENCL_RAM ||
  124. starpu_node_get_kind(i) == STARPU_MIC_RAM)
  125. i_gpu = i;
  126. if (starpu_node_get_kind(i) == STARPU_CPU_RAM ||
  127. starpu_node_get_kind(i) == STARPU_MPI_MS_RAM)
  128. i_ram = i;
  129. if (starpu_node_get_kind(i) == STARPU_DISK_RAM)
  130. i_disk = i;
  131. }
  132. }
  133. /* we have to use cpu_ram in first */
  134. if (i_ram != -1)
  135. src_node = i_ram;
  136. /* no luck we have to use the disk memory */
  137. else if (i_gpu != -1)
  138. src_node = i_gpu;
  139. else
  140. src_node = i_disk;
  141. STARPU_ASSERT(src_node != -1);
  142. STARPU_ASSERT(handle->per_node[src_node].allocated);
  143. STARPU_ASSERT(handle->per_node[src_node].initialized);
  144. return src_node;
  145. }
  146. /* this may be called once the data is fetched with header and STARPU_RW-lock hold */
  147. void _starpu_update_data_state(starpu_data_handle_t handle,
  148. struct _starpu_data_replicate *requesting_replicate,
  149. enum starpu_data_access_mode mode)
  150. {
  151. /* There is nothing to do for relaxed coherency modes (scratch or
  152. * reductions) */
  153. if (!(mode & STARPU_RW))
  154. return;
  155. unsigned nnodes = starpu_memory_nodes_get_count();
  156. /* the data is present now */
  157. unsigned requesting_node = requesting_replicate->memory_node;
  158. requesting_replicate->requested &= ~(1UL << requesting_node);
  159. if (mode & STARPU_W)
  160. {
  161. /* the requesting node now has the only valid copy */
  162. unsigned node;
  163. for (node = 0; node < nnodes; node++)
  164. {
  165. _STARPU_TRACE_DATA_STATE_INVALID(handle, node);
  166. handle->per_node[node].state = STARPU_INVALID;
  167. }
  168. _STARPU_TRACE_DATA_STATE_OWNER(handle, requesting_node);
  169. requesting_replicate->state = STARPU_OWNER;
  170. if (handle->home_node != -1 && handle->per_node[handle->home_node].state == STARPU_INVALID)
  171. /* Notify that this MC is now dirty */
  172. _starpu_memchunk_dirty(requesting_replicate->mc, requesting_replicate->memory_node);
  173. }
  174. else
  175. {
  176. /* read only */
  177. if (requesting_replicate->state != STARPU_OWNER)
  178. {
  179. /* there was at least another copy of the data */
  180. unsigned node;
  181. for (node = 0; node < nnodes; node++)
  182. {
  183. struct _starpu_data_replicate *replicate = &handle->per_node[node];
  184. if (replicate->state != STARPU_INVALID)
  185. {
  186. _STARPU_TRACE_DATA_STATE_SHARED(handle, node);
  187. replicate->state = STARPU_SHARED;
  188. }
  189. }
  190. _STARPU_TRACE_DATA_STATE_SHARED(handle, requesting_node);
  191. requesting_replicate->state = STARPU_SHARED;
  192. }
  193. }
  194. }
  195. static int worker_supports_direct_access(unsigned node, unsigned handling_node)
  196. {
  197. if (node == handling_node)
  198. return 1;
  199. if (!_starpu_memory_node_get_nworkers(handling_node))
  200. /* No worker to process the request from that node */
  201. return 0;
  202. struct _starpu_node_ops *node_ops = _starpu_memory_node_get_node_ops(node);
  203. if (node_ops && node_ops->is_direct_access_supported)
  204. return node_ops->is_direct_access_supported(node, handling_node);
  205. else
  206. {
  207. STARPU_ABORT_MSG("Node %s does not define the operation 'is_direct_access_supported'", _starpu_node_get_prefix(starpu_node_get_kind(node)));
  208. return 1;
  209. }
  210. }
  211. static int link_supports_direct_transfers(starpu_data_handle_t handle, unsigned src_node, unsigned dst_node, unsigned *handling_node)
  212. {
  213. int (*can_copy)(void *src_interface, unsigned src_node, void *dst_interface, unsigned dst_node, unsigned handling_node) = handle->ops->copy_methods->can_copy;
  214. void *src_interface = handle->per_node[src_node].data_interface;
  215. void *dst_interface = handle->per_node[dst_node].data_interface;
  216. /* XXX That's a hack until we fix cudaMemcpy3DPeerAsync in the block interface
  217. * Perhaps not all data interface provide a direct GPU-GPU transfer
  218. * method ! */
  219. #if defined(STARPU_USE_CUDA) || defined(STARPU_SIMGRID)
  220. if (src_node != dst_node && starpu_node_get_kind(src_node) == STARPU_CUDA_RAM && starpu_node_get_kind(dst_node) == STARPU_CUDA_RAM)
  221. {
  222. const struct starpu_data_copy_methods *copy_methods = handle->ops->copy_methods;
  223. if (!copy_methods->cuda_to_cuda_async && !copy_methods->any_to_any)
  224. return 0;
  225. }
  226. #endif
  227. /* Note: with CUDA, performance seems a bit better when issuing the transfer from the destination (tested without GPUDirect, but GPUDirect probably behave the same) */
  228. if (worker_supports_direct_access(src_node, dst_node) && (!can_copy || can_copy(src_interface, src_node, dst_interface, dst_node, dst_node)))
  229. {
  230. *handling_node = dst_node;
  231. return 1;
  232. }
  233. if (worker_supports_direct_access(dst_node, src_node) && (!can_copy || can_copy(src_interface, src_node, dst_interface, dst_node, src_node)))
  234. {
  235. *handling_node = src_node;
  236. return 1;
  237. }
  238. return 0;
  239. }
  240. /* Now, we use slowness/bandwidth to compare numa nodes, is it better to use latency ? */
  241. static unsigned chose_best_numa_between_src_and_dest(int src, int dst)
  242. {
  243. double timing_best;
  244. int best_numa = -1;
  245. unsigned numa;
  246. const unsigned nb_numa_nodes = starpu_memory_nodes_get_numa_count();
  247. for(numa = 0; numa < nb_numa_nodes; numa++)
  248. {
  249. double actual = 1.0/starpu_transfer_bandwidth(src, numa) + 1.0/starpu_transfer_bandwidth(numa, dst);
  250. /* Compare slowness : take the lowest */
  251. if (best_numa < 0 || actual < timing_best)
  252. {
  253. best_numa = numa;
  254. timing_best = actual;
  255. }
  256. }
  257. STARPU_ASSERT(best_numa >= 0);
  258. return best_numa;
  259. }
  260. /* Determines the path of a request : each hop is defined by (src,dst) and the
  261. * node that handles the hop. The returned value indicates the number of hops,
  262. * and the max_len is the maximum number of hops (ie. the size of the
  263. * src_nodes, dst_nodes and handling_nodes arrays. */
  264. int _starpu_determine_request_path(starpu_data_handle_t handle,
  265. int src_node, int dst_node,
  266. enum starpu_data_access_mode mode, int max_len,
  267. unsigned *src_nodes, unsigned *dst_nodes,
  268. unsigned *handling_nodes, unsigned write_invalidation)
  269. {
  270. if (src_node == dst_node || !(mode & STARPU_R))
  271. {
  272. if (dst_node == -1 || starpu_node_get_kind(dst_node) == STARPU_DISK_RAM)
  273. handling_nodes[0] = src_node;
  274. else
  275. handling_nodes[0] = dst_node;
  276. if (write_invalidation)
  277. /* The invalidation request will be enough */
  278. return 0;
  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. return 1;
  284. }
  285. if (src_node < 0)
  286. {
  287. /* Will just initialize the destination */
  288. STARPU_ASSERT(max_len >= 1);
  289. src_nodes[0] = src_node; // ignored
  290. dst_nodes[0] = dst_node;
  291. return 1;
  292. }
  293. unsigned handling_node;
  294. int link_is_valid = link_supports_direct_transfers(handle, src_node, dst_node, &handling_node);
  295. if (!link_is_valid)
  296. {
  297. int (*can_copy)(void *, unsigned, void *, unsigned, unsigned) = handle->ops->copy_methods->can_copy;
  298. void *src_interface = handle->per_node[src_node].data_interface;
  299. void *dst_interface = handle->per_node[dst_node].data_interface;
  300. /* We need an intermediate hop to implement data staging
  301. * through main memory. */
  302. STARPU_ASSERT(max_len >= 2);
  303. STARPU_ASSERT(src_node >= 0);
  304. unsigned numa = chose_best_numa_between_src_and_dest(src_node, dst_node);
  305. /* GPU -> RAM */
  306. src_nodes[0] = src_node;
  307. dst_nodes[0] = numa;
  308. if (starpu_node_get_kind(src_node) == STARPU_DISK_RAM)
  309. /* Disks don't have their own driver thread */
  310. handling_nodes[0] = dst_node;
  311. else if (!can_copy || can_copy(src_interface, src_node, dst_interface, dst_node, src_node))
  312. {
  313. handling_nodes[0] = src_node;
  314. }
  315. else
  316. {
  317. STARPU_ASSERT_MSG(can_copy(src_interface, src_node, dst_interface, dst_node, dst_node), "interface %d refuses all kinds of transfers from node %d to node %d\n", handle->ops->interfaceid, src_node, dst_node);
  318. handling_nodes[0] = dst_node;
  319. }
  320. /* RAM -> GPU */
  321. src_nodes[1] = numa;
  322. dst_nodes[1] = dst_node;
  323. if (starpu_node_get_kind(dst_node) == STARPU_DISK_RAM)
  324. /* Disks don't have their own driver thread */
  325. handling_nodes[1] = src_node;
  326. else if (!can_copy || can_copy(src_interface, src_node, dst_interface, dst_node, dst_node))
  327. {
  328. handling_nodes[1] = dst_node;
  329. }
  330. else
  331. {
  332. STARPU_ASSERT_MSG(can_copy(src_interface, src_node, dst_interface, dst_node, src_node), "interface %d refuses all kinds of transfers from node %d to node %d\n", handle->ops->interfaceid, src_node, dst_node);
  333. handling_nodes[1] = src_node;
  334. }
  335. return 2;
  336. }
  337. else
  338. {
  339. STARPU_ASSERT(max_len >= 1);
  340. src_nodes[0] = src_node;
  341. dst_nodes[0] = dst_node;
  342. handling_nodes[0] = handling_node;
  343. #if !defined(STARPU_HAVE_CUDA_MEMCPY_PEER) && !defined(STARPU_SIMGRID)
  344. STARPU_ASSERT(!(mode & STARPU_R) || starpu_node_get_kind(src_node) != STARPU_CUDA_RAM || starpu_node_get_kind(dst_node) != STARPU_CUDA_RAM);
  345. #endif
  346. return 1;
  347. }
  348. }
  349. /* handle->lock should be taken. r is returned locked. The node parameter
  350. * indicate either the source of the request, or the destination for a
  351. * write-only request. */
  352. 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)
  353. {
  354. struct _starpu_data_request *r;
  355. r = replicate->request[node];
  356. if (r)
  357. {
  358. _starpu_spin_checklocked(&r->handle->header_lock);
  359. _starpu_spin_lock(&r->lock);
  360. /* perhaps we need to "upgrade" the request */
  361. if (is_prefetch < r->prefetch)
  362. _starpu_update_prefetch_status(r, is_prefetch);
  363. if (mode & STARPU_R)
  364. {
  365. /* in case the exisiting request did not imply a memory
  366. * transfer yet, we have to take a second refcnt now
  367. * for the source, in addition to the refcnt for the
  368. * destination
  369. * (so that the source remains valid) */
  370. if (!(r->mode & STARPU_R))
  371. {
  372. replicate->refcnt++;
  373. replicate->handle->busy_count++;
  374. }
  375. r->mode = (enum starpu_data_access_mode) ((int) r->mode | (int) STARPU_R);
  376. }
  377. if (mode & STARPU_W)
  378. r->mode = (enum starpu_data_access_mode) ((int) r->mode | (int) STARPU_W);
  379. }
  380. return r;
  381. }
  382. /*
  383. * This function is called when the data is needed on the local node, this
  384. * returns a pointer to the local copy
  385. *
  386. * R STARPU_W STARPU_RW
  387. * Owner OK OK OK
  388. * Shared OK 1 1
  389. * Invalid 2 3 4
  390. *
  391. * case 1 : shared + (read)write :
  392. * no data copy but shared->Invalid/Owner
  393. * case 2 : invalid + read :
  394. * data copy + invalid->shared + owner->shared (STARPU_ASSERT(there is a valid))
  395. * case 3 : invalid + write :
  396. * no data copy + invalid->owner + (owner,shared)->invalid
  397. * case 4 : invalid + R/STARPU_W :
  398. * data copy + if (STARPU_W) (invalid->owner + owner->invalid)
  399. * else (invalid,owner->shared)
  400. */
  401. struct _starpu_data_request *_starpu_create_request_to_fetch_data(starpu_data_handle_t handle,
  402. struct _starpu_data_replicate *dst_replicate,
  403. enum starpu_data_access_mode mode, unsigned is_prefetch,
  404. unsigned async,
  405. void (*callback_func)(void *), void *callback_arg, int prio, const char *origin)
  406. {
  407. /* We don't care about commuting for data requests, that was handled before. */
  408. mode &= ~STARPU_COMMUTE;
  409. /* This function is called with handle's header lock taken */
  410. _starpu_spin_checklocked(&handle->header_lock);
  411. int requesting_node = dst_replicate ? dst_replicate->memory_node : -1;
  412. unsigned nwait = 0;
  413. if (mode & STARPU_W)
  414. {
  415. /* We will write to the buffer. We will have to wait for all
  416. * existing requests before the last request which will
  417. * invalidate all their results (which were possibly spurious,
  418. * e.g. too aggressive eviction).
  419. */
  420. unsigned i, j;
  421. unsigned nnodes = starpu_memory_nodes_get_count();
  422. for (i = 0; i < nnodes; i++)
  423. for (j = 0; j < nnodes; j++)
  424. if (handle->per_node[i].request[j])
  425. nwait++;
  426. /* If the request is not detached (i.e. the caller really wants
  427. * proper ownership), no new requests will appear because a
  428. * reference will be kept on the dst replicate, which will
  429. * notably prevent data reclaiming.
  430. */
  431. }
  432. if ((!dst_replicate || dst_replicate->state != STARPU_INVALID) && (!nwait || is_prefetch))
  433. {
  434. if (dst_replicate)
  435. {
  436. #ifdef STARPU_MEMORY_STATS
  437. enum _starpu_cache_state old_state = dst_replicate->state;
  438. #endif
  439. /* the data is already available and we don't have to wait for
  440. * any request, so we can stop */
  441. _starpu_update_data_state(handle, dst_replicate, mode);
  442. _starpu_msi_cache_hit(requesting_node);
  443. #ifdef STARPU_MEMORY_STATS
  444. _starpu_memory_handle_stats_cache_hit(handle, requesting_node);
  445. /* XXX Broken ? */
  446. if (old_state == STARPU_SHARED
  447. && dst_replicate->state == STARPU_OWNER)
  448. _starpu_memory_handle_stats_shared_to_owner(handle, requesting_node);
  449. #endif
  450. if (dst_replicate->mc)
  451. _starpu_memchunk_recently_used(dst_replicate->mc, requesting_node);
  452. }
  453. _starpu_spin_unlock(&handle->header_lock);
  454. if (callback_func)
  455. callback_func(callback_arg);
  456. _STARPU_LOG_OUT_TAG("data available");
  457. return NULL;
  458. }
  459. if (dst_replicate)
  460. _starpu_msi_cache_miss(requesting_node);
  461. /* the only remaining situation is that the local copy was invalid */
  462. STARPU_ASSERT((dst_replicate && dst_replicate->state == STARPU_INVALID) || nwait);
  463. /* find someone who already has the data */
  464. int src_node = -1;
  465. if (dst_replicate && mode & STARPU_R)
  466. {
  467. if (dst_replicate->state == STARPU_INVALID)
  468. src_node = _starpu_select_src_node(handle, requesting_node);
  469. else
  470. src_node = requesting_node;
  471. if (src_node < 0)
  472. {
  473. /* We will create it, no need to read an existing value */
  474. mode &= ~STARPU_R;
  475. }
  476. }
  477. else if (dst_replicate)
  478. {
  479. /* 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 */
  480. if (mode & STARPU_W)
  481. dst_replicate->initialized = 1;
  482. if (starpu_node_get_kind(requesting_node) == STARPU_CPU_RAM && !nwait)
  483. {
  484. /* And this is the main RAM, really no need for a
  485. * request, just allocate */
  486. if (_starpu_allocate_memory_on_node(handle, dst_replicate, is_prefetch) == 0)
  487. {
  488. _starpu_update_data_state(handle, dst_replicate, mode);
  489. _starpu_spin_unlock(&handle->header_lock);
  490. if (callback_func)
  491. callback_func(callback_arg);
  492. _STARPU_LOG_OUT_TAG("data immediately allocated");
  493. return NULL;
  494. }
  495. }
  496. }
  497. #define MAX_REQUESTS 4
  498. /* We can safely assume that there won't be more than 2 hops in the
  499. * current implementation */
  500. unsigned src_nodes[MAX_REQUESTS], dst_nodes[MAX_REQUESTS], handling_nodes[MAX_REQUESTS];
  501. /* keep one slot for the last W request, if any */
  502. int write_invalidation = (mode & STARPU_W) && nwait && !is_prefetch;
  503. int nhops = _starpu_determine_request_path(handle, src_node, requesting_node, mode, MAX_REQUESTS,
  504. src_nodes, dst_nodes, handling_nodes, write_invalidation);
  505. STARPU_ASSERT(nhops >= 0 && nhops <= MAX_REQUESTS-1);
  506. struct _starpu_data_request *requests[nhops + write_invalidation];
  507. /* Did we reuse a request for that hop ? */
  508. int reused_requests[nhops + write_invalidation];
  509. /* Construct an array with a list of requests, possibly reusing existing requests */
  510. int hop;
  511. for (hop = 0; hop < nhops; hop++)
  512. {
  513. struct _starpu_data_request *r;
  514. unsigned hop_src_node = src_nodes[hop];
  515. unsigned hop_dst_node = dst_nodes[hop];
  516. unsigned hop_handling_node = handling_nodes[hop];
  517. struct _starpu_data_replicate *hop_src_replicate;
  518. struct _starpu_data_replicate *hop_dst_replicate;
  519. /* Only the first request is independant */
  520. unsigned ndeps = (hop == 0)?0:1;
  521. hop_src_replicate = &handle->per_node[hop_src_node];
  522. hop_dst_replicate = (hop != nhops - 1)?&handle->per_node[hop_dst_node]:dst_replicate;
  523. /* Try to reuse a request if possible */
  524. r = _starpu_search_existing_data_request(hop_dst_replicate,
  525. (mode & STARPU_R)?hop_src_node:hop_dst_node,
  526. mode, is_prefetch);
  527. reused_requests[hop] = !!r;
  528. if (!r)
  529. {
  530. /* Create a new request if there was no request to reuse */
  531. r = _starpu_create_data_request(handle, hop_src_replicate,
  532. hop_dst_replicate, hop_handling_node,
  533. mode, ndeps, is_prefetch, prio, 0, origin);
  534. nwait++;
  535. }
  536. requests[hop] = r;
  537. }
  538. /* Chain these requests */
  539. for (hop = 0; hop < nhops; hop++)
  540. {
  541. struct _starpu_data_request *r;
  542. r = requests[hop];
  543. if (hop != nhops - 1)
  544. {
  545. if (!reused_requests[hop + 1])
  546. {
  547. r->next_req[r->next_req_count++] = requests[hop + 1];
  548. STARPU_ASSERT(r->next_req_count <= STARPU_MAXNODES);
  549. }
  550. }
  551. else if (!write_invalidation)
  552. /* The last request will perform the callback after termination */
  553. _starpu_data_request_append_callback(r, callback_func, callback_arg);
  554. if (reused_requests[hop])
  555. _starpu_spin_unlock(&r->lock);
  556. }
  557. if (write_invalidation)
  558. {
  559. /* Some requests were still pending, we have to add yet another
  560. * request, depending on them, which will invalidate their
  561. * result.
  562. */
  563. struct _starpu_data_request *r = _starpu_create_data_request(handle, dst_replicate,
  564. dst_replicate, requesting_node,
  565. STARPU_W, nwait, is_prefetch, prio, 1, origin);
  566. /* and perform the callback after termination */
  567. _starpu_data_request_append_callback(r, callback_func, callback_arg);
  568. /* We will write to the buffer. We will have to wait for all
  569. * existing requests before the last request which will
  570. * invalidate all their results (which were possibly spurious,
  571. * e.g. too aggressive eviction).
  572. */
  573. unsigned i, j;
  574. unsigned nnodes = starpu_memory_nodes_get_count();
  575. for (i = 0; i < nnodes; i++)
  576. for (j = 0; j < nnodes; j++)
  577. {
  578. struct _starpu_data_request *r2 = handle->per_node[i].request[j];
  579. if (r2)
  580. {
  581. _starpu_spin_lock(&r2->lock);
  582. if (is_prefetch < r2->prefetch)
  583. /* Hasten the request we will have to wait for */
  584. _starpu_update_prefetch_status(r2, is_prefetch);
  585. r2->next_req[r2->next_req_count++] = r;
  586. STARPU_ASSERT(r2->next_req_count <= STARPU_MAXNODES + 1);
  587. _starpu_spin_unlock(&r2->lock);
  588. nwait--;
  589. }
  590. }
  591. STARPU_ASSERT(nwait == 0);
  592. nhops++;
  593. requests[nhops - 1] = r;
  594. /* existing requests will post this one */
  595. reused_requests[nhops - 1] = 1;
  596. }
  597. STARPU_ASSERT(nhops);
  598. if (!async)
  599. requests[nhops - 1]->refcnt++;
  600. /* we only submit the first request, the remaining will be
  601. * automatically submitted afterward */
  602. if (!reused_requests[0])
  603. _starpu_post_data_request(requests[0]);
  604. return requests[nhops - 1];
  605. }
  606. int _starpu_fetch_data_on_node(starpu_data_handle_t handle, int node, struct _starpu_data_replicate *dst_replicate,
  607. enum starpu_data_access_mode mode, unsigned detached, unsigned is_prefetch, unsigned async,
  608. void (*callback_func)(void *), void *callback_arg, int prio, const char *origin)
  609. {
  610. _STARPU_LOG_IN();
  611. int cpt = 0;
  612. while (cpt < STARPU_SPIN_MAXTRY && _starpu_spin_trylock(&handle->header_lock))
  613. {
  614. cpt++;
  615. _starpu_datawizard_progress(1);
  616. }
  617. if (cpt == STARPU_SPIN_MAXTRY)
  618. _starpu_spin_lock(&handle->header_lock);
  619. if (is_prefetch > 0)
  620. {
  621. unsigned src_node_mask = 0;
  622. unsigned nnodes = starpu_memory_nodes_get_count();
  623. unsigned n;
  624. for (n = 0; n < nnodes; n++)
  625. {
  626. if (handle->per_node[n].state != STARPU_INVALID)
  627. {
  628. /* we found a copy ! */
  629. src_node_mask |= (1<<n);
  630. }
  631. }
  632. if (src_node_mask == 0)
  633. {
  634. /* no valid copy, nothing to prefetch */
  635. _starpu_spin_unlock(&handle->header_lock);
  636. return 0;
  637. }
  638. }
  639. if (!detached)
  640. {
  641. /* Take references which will be released by _starpu_release_data_on_node */
  642. if (dst_replicate)
  643. dst_replicate->refcnt++;
  644. else if (node == STARPU_ACQUIRE_NO_NODE_LOCK_ALL)
  645. {
  646. int i;
  647. for (i = 0; i < STARPU_MAXNODES; i++)
  648. handle->per_node[i].refcnt++;
  649. }
  650. handle->busy_count++;
  651. }
  652. struct _starpu_data_request *r;
  653. r = _starpu_create_request_to_fetch_data(handle, dst_replicate, mode,
  654. is_prefetch, async, callback_func, callback_arg, prio, origin);
  655. /* If no request was created, the handle was already up-to-date on the
  656. * node. In this case, _starpu_create_request_to_fetch_data has already
  657. * unlocked the header. */
  658. if (!r)
  659. return 0;
  660. _starpu_spin_unlock(&handle->header_lock);
  661. int ret = async?0:_starpu_wait_data_request_completion(r, 1);
  662. _STARPU_LOG_OUT();
  663. return ret;
  664. }
  665. static int idle_prefetch_data_on_node(starpu_data_handle_t handle, int node, struct _starpu_data_replicate *replicate, enum starpu_data_access_mode mode, int prio)
  666. {
  667. return _starpu_fetch_data_on_node(handle, node, replicate, mode, 1, 2, 1, NULL, NULL, prio, "idle_prefetch_data_on_node");
  668. }
  669. static int prefetch_data_on_node(starpu_data_handle_t handle, int node, struct _starpu_data_replicate *replicate, enum starpu_data_access_mode mode, int prio)
  670. {
  671. return _starpu_fetch_data_on_node(handle, node, replicate, mode, 1, 1, 1, NULL, NULL, prio, "prefetch_data_on_node");
  672. }
  673. static int fetch_data(starpu_data_handle_t handle, int node, struct _starpu_data_replicate *replicate, enum starpu_data_access_mode mode, int prio)
  674. {
  675. return _starpu_fetch_data_on_node(handle, node, replicate, mode, 0, 0, 0, NULL, NULL, prio, "fetch_data");
  676. }
  677. uint32_t _starpu_get_data_refcnt(starpu_data_handle_t handle, unsigned node)
  678. {
  679. return handle->per_node[node].refcnt;
  680. }
  681. size_t _starpu_data_get_size(starpu_data_handle_t handle)
  682. {
  683. return handle->ops->get_size(handle);
  684. }
  685. size_t _starpu_data_get_alloc_size(starpu_data_handle_t handle)
  686. {
  687. if (handle->ops->get_alloc_size)
  688. return handle->ops->get_alloc_size(handle);
  689. else
  690. return handle->ops->get_size(handle);
  691. }
  692. starpu_ssize_t _starpu_data_get_max_size(starpu_data_handle_t handle)
  693. {
  694. if (handle->ops->get_max_size)
  695. return handle->ops->get_max_size(handle);
  696. else
  697. return -1;
  698. }
  699. uint32_t _starpu_data_get_footprint(starpu_data_handle_t handle)
  700. {
  701. return handle->footprint;
  702. }
  703. /* in case the data was accessed on a write mode, do not forget to
  704. * make it accessible again once it is possible ! */
  705. void _starpu_release_data_on_node(starpu_data_handle_t handle, uint32_t default_wt_mask, struct _starpu_data_replicate *replicate)
  706. {
  707. uint32_t wt_mask;
  708. wt_mask = default_wt_mask | handle->wt_mask;
  709. wt_mask &= (1<<starpu_memory_nodes_get_count())-1;
  710. /* Note that it is possible that there is no valid copy of the data (if
  711. * starpu_data_invalidate was called for instance). In that case, we do
  712. * not enforce any write-through mechanism. */
  713. unsigned memory_node = replicate->memory_node;
  714. if (replicate->state != STARPU_INVALID && handle->current_mode & STARPU_W)
  715. if (wt_mask & ~(1<<memory_node))
  716. _starpu_write_through_data(handle, memory_node, wt_mask);
  717. int cpt = 0;
  718. while (cpt < STARPU_SPIN_MAXTRY && _starpu_spin_trylock(&handle->header_lock))
  719. {
  720. cpt++;
  721. _starpu_datawizard_progress(1);
  722. }
  723. if (cpt == STARPU_SPIN_MAXTRY)
  724. _starpu_spin_lock(&handle->header_lock);
  725. /* Release refcnt taken by fetch_data_on_node */
  726. replicate->refcnt--;
  727. STARPU_ASSERT_MSG(replicate->refcnt >= 0, "handle %p released too many times", handle);
  728. STARPU_ASSERT_MSG(handle->busy_count > 0, "handle %p released too many times", handle);
  729. handle->busy_count--;
  730. if (!_starpu_notify_data_dependencies(handle))
  731. _starpu_spin_unlock(&handle->header_lock);
  732. }
  733. static void _starpu_set_data_requested_flag_if_needed(starpu_data_handle_t handle, struct _starpu_data_replicate *replicate)
  734. {
  735. int cpt = 0;
  736. while (cpt < STARPU_SPIN_MAXTRY && _starpu_spin_trylock(&handle->header_lock))
  737. {
  738. cpt++;
  739. _starpu_datawizard_progress(1);
  740. }
  741. if (cpt == STARPU_SPIN_MAXTRY)
  742. _starpu_spin_lock(&handle->header_lock);
  743. if (replicate->state == STARPU_INVALID)
  744. {
  745. unsigned dst_node = replicate->memory_node;
  746. replicate->requested |= 1UL << dst_node;
  747. }
  748. _starpu_spin_unlock(&handle->header_lock);
  749. }
  750. int starpu_prefetch_task_input_on_node_prio(struct starpu_task *task, unsigned target_node, int prio)
  751. {
  752. #ifdef STARPU_OPENMP
  753. struct _starpu_job *j = _starpu_get_job_associated_to_task(task);
  754. /* do not attempt to prefetch task input if this is an OpenMP task resuming after blocking */
  755. if (j->discontinuous != 0)
  756. return 0;
  757. #endif
  758. STARPU_ASSERT(!task->prefetched);
  759. unsigned nbuffers = STARPU_TASK_GET_NBUFFERS(task);
  760. unsigned index;
  761. for (index = 0; index < nbuffers; index++)
  762. {
  763. starpu_data_handle_t handle = STARPU_TASK_GET_HANDLE(task, index);
  764. enum starpu_data_access_mode mode = STARPU_TASK_GET_MODE(task, index);
  765. if (mode & (STARPU_SCRATCH|STARPU_REDUX))
  766. continue;
  767. if (!(mode & STARPU_R))
  768. /* Don't bother prefetching some data which will be overwritten */
  769. continue;
  770. int node = _starpu_task_data_get_node_on_node(task, index, target_node);
  771. struct _starpu_data_replicate *replicate = &handle->per_node[node];
  772. prefetch_data_on_node(handle, node, replicate, mode, prio);
  773. _starpu_set_data_requested_flag_if_needed(handle, replicate);
  774. }
  775. return 0;
  776. }
  777. int starpu_prefetch_task_input_on_node(struct starpu_task *task, unsigned node)
  778. {
  779. int prio = task->priority;
  780. if (task->workerorder)
  781. prio = INT_MAX - task->workerorder;
  782. return starpu_prefetch_task_input_on_node_prio(task, node, prio);
  783. }
  784. int starpu_idle_prefetch_task_input_on_node_prio(struct starpu_task *task, unsigned target_node, int prio)
  785. {
  786. unsigned nbuffers = STARPU_TASK_GET_NBUFFERS(task);
  787. unsigned index;
  788. for (index = 0; index < nbuffers; index++)
  789. {
  790. starpu_data_handle_t handle = STARPU_TASK_GET_HANDLE(task, index);
  791. enum starpu_data_access_mode mode = STARPU_TASK_GET_MODE(task, index);
  792. if (mode & (STARPU_SCRATCH|STARPU_REDUX))
  793. continue;
  794. if (!(mode & STARPU_R))
  795. /* Don't bother prefetching some data which will be overwritten */
  796. continue;
  797. int node = _starpu_task_data_get_node_on_node(task, index, target_node);
  798. struct _starpu_data_replicate *replicate = &handle->per_node[node];
  799. idle_prefetch_data_on_node(handle, node, replicate, mode, prio);
  800. }
  801. return 0;
  802. }
  803. int starpu_idle_prefetch_task_input_on_node(struct starpu_task *task, unsigned node)
  804. {
  805. int prio = task->priority;
  806. if (task->workerorder)
  807. prio = INT_MAX - task->workerorder;
  808. return starpu_idle_prefetch_task_input_on_node_prio(task, node, prio);
  809. }
  810. int starpu_prefetch_task_input_for_prio(struct starpu_task *task, unsigned worker, int prio)
  811. {
  812. #ifdef STARPU_OPENMP
  813. struct _starpu_job *j = _starpu_get_job_associated_to_task(task);
  814. /* do not attempt to prefetch task input if this is an OpenMP task resuming after blocking */
  815. if (j->discontinuous != 0)
  816. return 0;
  817. #endif
  818. STARPU_ASSERT(!task->prefetched);
  819. unsigned nbuffers = STARPU_TASK_GET_NBUFFERS(task);
  820. unsigned index;
  821. for (index = 0; index < nbuffers; index++)
  822. {
  823. starpu_data_handle_t handle = STARPU_TASK_GET_HANDLE(task, index);
  824. enum starpu_data_access_mode mode = STARPU_TASK_GET_MODE(task, index);
  825. if (mode & (STARPU_SCRATCH|STARPU_REDUX))
  826. continue;
  827. if (!(mode & STARPU_R))
  828. /* Don't bother prefetching some data which will be overwritten */
  829. continue;
  830. int node = _starpu_task_data_get_node_on_worker(task, index, worker);
  831. struct _starpu_data_replicate *replicate = &handle->per_node[node];
  832. prefetch_data_on_node(handle, node, replicate, mode, prio);
  833. _starpu_set_data_requested_flag_if_needed(handle, replicate);
  834. }
  835. return 0;
  836. }
  837. int starpu_prefetch_task_input_for(struct starpu_task *task, unsigned worker)
  838. {
  839. int prio = task->priority;
  840. if (task->workerorder)
  841. prio = INT_MAX - task->workerorder;
  842. return starpu_prefetch_task_input_for_prio(task, worker, prio);
  843. }
  844. int starpu_idle_prefetch_task_input_for_prio(struct starpu_task *task, unsigned worker, int prio)
  845. {
  846. unsigned nbuffers = STARPU_TASK_GET_NBUFFERS(task);
  847. unsigned index;
  848. for (index = 0; index < nbuffers; index++)
  849. {
  850. starpu_data_handle_t handle = STARPU_TASK_GET_HANDLE(task, index);
  851. enum starpu_data_access_mode mode = STARPU_TASK_GET_MODE(task, index);
  852. if (mode & (STARPU_SCRATCH|STARPU_REDUX))
  853. continue;
  854. if (!(mode & STARPU_R))
  855. /* Don't bother prefetching some data which will be overwritten */
  856. continue;
  857. int node = _starpu_task_data_get_node_on_worker(task, index, worker);
  858. struct _starpu_data_replicate *replicate = &handle->per_node[node];
  859. idle_prefetch_data_on_node(handle, node, replicate, mode, prio);
  860. }
  861. return 0;
  862. }
  863. int starpu_idle_prefetch_task_input_for(struct starpu_task *task, unsigned worker)
  864. {
  865. int prio = task->priority;
  866. if (task->workerorder)
  867. prio = INT_MAX - task->workerorder;
  868. return starpu_idle_prefetch_task_input_for_prio(task, worker, prio);
  869. }
  870. struct _starpu_data_replicate *get_replicate(starpu_data_handle_t handle, enum starpu_data_access_mode mode, int workerid, unsigned node)
  871. {
  872. if (mode & (STARPU_SCRATCH|STARPU_REDUX))
  873. {
  874. STARPU_ASSERT(workerid >= 0);
  875. if (!handle->per_worker)
  876. {
  877. _starpu_spin_lock(&handle->header_lock);
  878. if (!handle->per_worker)
  879. _starpu_data_initialize_per_worker(handle);
  880. _starpu_spin_unlock(&handle->header_lock);
  881. }
  882. return &handle->per_worker[workerid];
  883. }
  884. else
  885. /* That's a "normal" buffer (R/W) */
  886. return &handle->per_node[node];
  887. }
  888. /* Callback used when a buffer is send asynchronously to the sink */
  889. static void _starpu_fetch_task_input_cb(void *arg)
  890. {
  891. struct _starpu_worker * worker = (struct _starpu_worker *) arg;
  892. /* increase the number of buffer received */
  893. STARPU_WMB();
  894. (void)STARPU_ATOMIC_ADD(&worker->nb_buffers_transferred, 1);
  895. #ifdef STARPU_SIMGRID
  896. starpu_pthread_queue_broadcast(&_starpu_simgrid_transfer_queue[worker->memory_node]);
  897. #endif
  898. }
  899. /* Synchronously or asynchronously fetch data for a given task (if it's not there already)
  900. * Returns the number of data acquired here. */
  901. /* _starpu_fetch_task_input must be called before
  902. * executing the task. __starpu_push_task_output but be called after the
  903. * execution of the task. */
  904. /* The driver can either just call _starpu_fetch_task_input with async==0,
  905. * or to improve overlapping, it can call _starpu_fetch_task_input with
  906. * async==1, then wait for transfers to complete, then call
  907. * _starpu_fetch_task_input_tail to complete the fetch. */
  908. int _starpu_fetch_task_input(struct starpu_task *task, struct _starpu_job *j, int async)
  909. {
  910. struct _starpu_worker *worker = _starpu_get_local_worker_key();
  911. int workerid = worker->workerid;
  912. if (async)
  913. {
  914. worker->task_transferring = task;
  915. worker->nb_buffers_transferred = 0;
  916. if (worker->ntasks <= 1)
  917. _STARPU_TRACE_WORKER_START_FETCH_INPUT(NULL, workerid);
  918. }
  919. else
  920. _STARPU_TRACE_START_FETCH_INPUT(NULL);
  921. int profiling = starpu_profiling_status_get();
  922. if (profiling && task->profiling_info)
  923. _starpu_clock_gettime(&task->profiling_info->acquire_data_start_time);
  924. struct _starpu_data_descr *descrs = _STARPU_JOB_GET_ORDERED_BUFFERS(j);
  925. unsigned nbuffers = STARPU_TASK_GET_NBUFFERS(task);
  926. unsigned nacquires;
  927. unsigned index;
  928. nacquires = 0;
  929. for (index = 0; index < nbuffers; index++)
  930. {
  931. int ret;
  932. starpu_data_handle_t handle = descrs[index].handle;
  933. enum starpu_data_access_mode mode = descrs[index].mode;
  934. int node = _starpu_task_data_get_node_on_worker(task, descrs[index].index, workerid);
  935. /* We set this here for coherency with __starpu_push_task_output */
  936. descrs[index].node = node;
  937. if (mode == STARPU_NONE ||
  938. (mode & ((1<<STARPU_MODE_SHIFT) - 1)) >= STARPU_ACCESS_MODE_MAX ||
  939. (mode >> STARPU_MODE_SHIFT) >= (STARPU_SHIFTED_MODE_MAX >> STARPU_MODE_SHIFT))
  940. STARPU_ASSERT_MSG(0, "mode %d (0x%x) is bogus\n", mode, mode);
  941. struct _starpu_data_replicate *local_replicate;
  942. if (index && descrs[index-1].handle == descrs[index].handle)
  943. /* We have already took this data, skip it. This
  944. * depends on ordering putting writes before reads, see
  945. * _starpu_compar_handles */
  946. continue;
  947. local_replicate = get_replicate(handle, mode, workerid, node);
  948. if (async)
  949. {
  950. ret = _starpu_fetch_data_on_node(handle, node, local_replicate, mode, 0, 0, 1,
  951. _starpu_fetch_task_input_cb, worker, 0, "_starpu_fetch_task_input");
  952. #ifdef STARPU_SIMGRID
  953. if (_starpu_simgrid_fetching_input_cost())
  954. starpu_sleep(0.000001);
  955. #endif
  956. if (STARPU_UNLIKELY(ret))
  957. {
  958. /* Ooops, not enough memory, make worker wait for these for now, and the synchronous call will finish by forcing eviction*/
  959. worker->nb_buffers_totransfer = nacquires;
  960. _starpu_set_worker_status(worker, STATUS_WAITING);
  961. return 0;
  962. }
  963. }
  964. else
  965. {
  966. ret = fetch_data(handle, node, local_replicate, mode, 0);
  967. #ifdef STARPU_SIMGRID
  968. if (_starpu_simgrid_fetching_input_cost())
  969. starpu_sleep(0.000001);
  970. #endif
  971. if (STARPU_UNLIKELY(ret))
  972. goto enomem;
  973. }
  974. nacquires++;
  975. }
  976. if (async)
  977. {
  978. worker->nb_buffers_totransfer = nacquires;
  979. _starpu_set_worker_status(worker, STATUS_WAITING);
  980. return 0;
  981. }
  982. _starpu_fetch_task_input_tail(task, j, worker);
  983. return 0;
  984. enomem:
  985. _STARPU_TRACE_END_FETCH_INPUT(NULL);
  986. _STARPU_DISP("something went wrong with buffer %u\n", index);
  987. /* try to unreference all the input that were successfully taken */
  988. unsigned index2;
  989. for (index2 = 0; index2 < index; index2++)
  990. {
  991. starpu_data_handle_t handle = descrs[index2].handle;
  992. enum starpu_data_access_mode mode = descrs[index2].mode;
  993. int node = descrs[index].node;
  994. struct _starpu_data_replicate *local_replicate;
  995. if (index2 && descrs[index2-1].handle == descrs[index2].handle)
  996. /* We have already released this data, skip it. This
  997. * depends on ordering putting writes before reads, see
  998. * _starpu_compar_handles */
  999. continue;
  1000. local_replicate = get_replicate(handle, mode, workerid, node);
  1001. _starpu_release_data_on_node(handle, 0, local_replicate);
  1002. }
  1003. return -1;
  1004. }
  1005. /* Now that we have taken the data locks in locking order, fill the codelet interfaces in function order. */
  1006. void _starpu_fetch_task_input_tail(struct starpu_task *task, struct _starpu_job *j, struct _starpu_worker *worker)
  1007. {
  1008. int workerid = worker->workerid;
  1009. int profiling = starpu_profiling_status_get();
  1010. unsigned nbuffers = STARPU_TASK_GET_NBUFFERS(task);
  1011. struct _starpu_data_descr *descrs = _STARPU_JOB_GET_ORDERED_BUFFERS(j);
  1012. unsigned index;
  1013. unsigned long total_size = 0;
  1014. for (index = 0; index < nbuffers; index++)
  1015. {
  1016. starpu_data_handle_t handle = descrs[index].handle;
  1017. enum starpu_data_access_mode mode = descrs[index].mode;
  1018. int node = descrs[index].node;
  1019. struct _starpu_data_replicate *local_replicate;
  1020. local_replicate = get_replicate(handle, mode, workerid, node);
  1021. _starpu_spin_lock(&handle->header_lock);
  1022. if (local_replicate->mc)
  1023. local_replicate->mc->diduse = 1;
  1024. _starpu_spin_unlock(&handle->header_lock);
  1025. _STARPU_TASK_SET_INTERFACE(task , local_replicate->data_interface, descrs[index].index);
  1026. /* If the replicate was not initialized yet, we have to do it now */
  1027. if (!(mode & STARPU_SCRATCH) && !local_replicate->initialized)
  1028. _starpu_redux_init_data_replicate(handle, local_replicate, workerid);
  1029. #ifdef STARPU_USE_FXT
  1030. total_size += _starpu_data_get_size(handle);
  1031. #endif
  1032. }
  1033. _STARPU_TRACE_DATA_LOAD(workerid,total_size);
  1034. if (profiling && task->profiling_info)
  1035. _starpu_clock_gettime(&task->profiling_info->acquire_data_end_time);
  1036. _STARPU_TRACE_END_FETCH_INPUT(NULL);
  1037. }
  1038. /* Release task data dependencies */
  1039. void __starpu_push_task_output(struct _starpu_job *j)
  1040. {
  1041. #ifdef STARPU_OPENMP
  1042. STARPU_ASSERT(!j->continuation);
  1043. #endif
  1044. int profiling = starpu_profiling_status_get();
  1045. struct starpu_task *task = j->task;
  1046. if (profiling && task->profiling_info)
  1047. _starpu_clock_gettime(&task->profiling_info->release_data_start_time);
  1048. struct _starpu_data_descr *descrs = _STARPU_JOB_GET_ORDERED_BUFFERS(j);
  1049. unsigned nbuffers = STARPU_TASK_GET_NBUFFERS(task);
  1050. int workerid = starpu_worker_get_id();
  1051. unsigned index;
  1052. for (index = 0; index < nbuffers; index++)
  1053. {
  1054. starpu_data_handle_t handle = descrs[index].handle;
  1055. enum starpu_data_access_mode mode = descrs[index].mode;
  1056. int node = descrs[index].node;
  1057. struct _starpu_data_replicate *local_replicate = NULL;
  1058. if (index && descrs[index-1].handle == descrs[index].handle)
  1059. /* We have already released this data, skip it. This
  1060. * depends on ordering putting writes before reads, see
  1061. * _starpu_compar_handles */
  1062. continue;
  1063. if (node != -1)
  1064. local_replicate = get_replicate(handle, mode, workerid, node);
  1065. /* Keep a reference for future
  1066. * _starpu_release_task_enforce_sequential_consistency call */
  1067. _starpu_spin_lock(&handle->header_lock);
  1068. handle->busy_count++;
  1069. if (node == -1)
  1070. {
  1071. /* NOWHERE case, just notify dependencies */
  1072. if (!_starpu_notify_data_dependencies(handle))
  1073. _starpu_spin_unlock(&handle->header_lock);
  1074. }
  1075. else
  1076. {
  1077. _starpu_spin_unlock(&handle->header_lock);
  1078. _starpu_release_data_on_node(handle, 0, local_replicate);
  1079. }
  1080. }
  1081. if (profiling && task->profiling_info)
  1082. _starpu_clock_gettime(&task->profiling_info->release_data_end_time);
  1083. }
  1084. /* Version for a driver running on a worker: we show the driver state in the trace */
  1085. void _starpu_push_task_output(struct _starpu_job *j)
  1086. {
  1087. _STARPU_TRACE_START_PUSH_OUTPUT(NULL);
  1088. __starpu_push_task_output(j);
  1089. _STARPU_TRACE_END_PUSH_OUTPUT(NULL);
  1090. }
  1091. struct fetch_nowhere_wrapper
  1092. {
  1093. struct _starpu_job *j;
  1094. unsigned pending;
  1095. };
  1096. static void _starpu_fetch_nowhere_task_input_cb(void *arg);
  1097. /* Asynchronously fetch data for a task which will have no content */
  1098. void _starpu_fetch_nowhere_task_input(struct _starpu_job *j)
  1099. {
  1100. int profiling = starpu_profiling_status_get();
  1101. struct starpu_task *task = j->task;
  1102. if (profiling && task->profiling_info)
  1103. _starpu_clock_gettime(&task->profiling_info->acquire_data_start_time);
  1104. struct _starpu_data_descr *descrs = _STARPU_JOB_GET_ORDERED_BUFFERS(j);
  1105. unsigned nbuffers = STARPU_TASK_GET_NBUFFERS(task);
  1106. unsigned nfetchbuffers = 0;
  1107. struct fetch_nowhere_wrapper *wrapper;
  1108. unsigned index;
  1109. for (index = 0; index < nbuffers; index++)
  1110. {
  1111. /* Note here we just follow what was requested, and not use _starpu_task_data_get_node* */
  1112. int node = -1;
  1113. if (task->cl->specific_nodes)
  1114. node = STARPU_CODELET_GET_NODE(task->cl, descrs[index].index);
  1115. descrs[index].node = node;
  1116. if (node != -1)
  1117. nfetchbuffers++;
  1118. }
  1119. if (!nfetchbuffers)
  1120. {
  1121. /* Nothing to fetch actually, already finished! */
  1122. __starpu_push_task_output(j);
  1123. _starpu_handle_job_termination(j);
  1124. _STARPU_LOG_OUT_TAG("handle_job_termination");
  1125. return;
  1126. }
  1127. _STARPU_MALLOC(wrapper, (sizeof(*wrapper)));
  1128. wrapper->j = j;
  1129. /* +1 for the call below */
  1130. wrapper->pending = nfetchbuffers + 1;
  1131. for (index = 0; index < nbuffers; index++)
  1132. {
  1133. starpu_data_handle_t handle = descrs[index].handle;
  1134. enum starpu_data_access_mode mode = descrs[index].mode;
  1135. int node = descrs[index].node;
  1136. if (node == -1)
  1137. continue;
  1138. if (mode == STARPU_NONE ||
  1139. (mode & ((1<<STARPU_MODE_SHIFT) - 1)) >= STARPU_ACCESS_MODE_MAX ||
  1140. (mode >> STARPU_MODE_SHIFT) >= (STARPU_SHIFTED_MODE_MAX >> STARPU_MODE_SHIFT))
  1141. STARPU_ASSERT_MSG(0, "mode %d (0x%x) is bogus\n", mode, mode);
  1142. STARPU_ASSERT(mode != STARPU_SCRATCH && mode != STARPU_REDUX);
  1143. struct _starpu_data_replicate *local_replicate;
  1144. local_replicate = get_replicate(handle, mode, -1, node);
  1145. _starpu_fetch_data_on_node(handle, node, local_replicate, mode, 0, 0, 1, _starpu_fetch_nowhere_task_input_cb, wrapper, 0, "_starpu_fetch_nowhere_task_input");
  1146. }
  1147. if (profiling && task->profiling_info)
  1148. _starpu_clock_gettime(&task->profiling_info->acquire_data_end_time);
  1149. /* Finished working with the task, release our reference */
  1150. _starpu_fetch_nowhere_task_input_cb(wrapper);
  1151. }
  1152. static void _starpu_fetch_nowhere_task_input_cb(void *arg)
  1153. {
  1154. /* One more transfer finished */
  1155. struct fetch_nowhere_wrapper *wrapper = arg;
  1156. unsigned pending = STARPU_ATOMIC_ADD(&wrapper->pending, -1);
  1157. ANNOTATE_HAPPENS_BEFORE(&wrapper->pending);
  1158. if (pending == 0)
  1159. {
  1160. ANNOTATE_HAPPENS_AFTER(&wrapper->pending);
  1161. /* Finished transferring, task is over */
  1162. struct _starpu_job *j = wrapper->j;
  1163. free(wrapper);
  1164. __starpu_push_task_output(j);
  1165. _starpu_handle_job_termination(j);
  1166. _STARPU_LOG_OUT_TAG("handle_job_termination");
  1167. }
  1168. }
  1169. /* NB : this value can only be an indication of the status of a data
  1170. at some point, but there is no strong garantee ! */
  1171. unsigned starpu_data_is_on_node(starpu_data_handle_t handle, unsigned node)
  1172. {
  1173. unsigned ret = 0;
  1174. // XXX : this is just a hint, so we don't take the lock ...
  1175. // STARPU_PTHREAD_SPIN_LOCK(&handle->header_lock);
  1176. if (handle->per_node[node].state != STARPU_INVALID)
  1177. {
  1178. ret = 1;
  1179. }
  1180. else
  1181. {
  1182. unsigned i;
  1183. unsigned nnodes = starpu_memory_nodes_get_count();
  1184. for (i = 0; i < nnodes; i++)
  1185. {
  1186. if ((handle->per_node[node].requested & (1UL << i)) || handle->per_node[node].request[i])
  1187. ret = 1;
  1188. }
  1189. }
  1190. // STARPU_PTHREAD_SPIN_UNLOCK(&handle->header_lock);
  1191. return ret;
  1192. }