coherency.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009-2015 Université de Bordeaux
  4. * Copyright (C) 2010, 2011, 2012, 2013, 2014, 2015 CNRS
  5. * Copyright (C) 2014-2015 Inria
  6. *
  7. * StarPU is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU Lesser General Public License as published by
  9. * the Free Software Foundation; either version 2.1 of the License, or (at
  10. * your option) any later version.
  11. *
  12. * StarPU is distributed in the hope that it will be useful, but
  13. * WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  15. *
  16. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  17. */
  18. #ifndef __COHERENCY__H__
  19. #define __COHERENCY__H__
  20. #include <starpu.h>
  21. #include <common/config.h>
  22. #include <common/starpu_spinlock.h>
  23. #include <common/rwlock.h>
  24. #include <common/timing.h>
  25. #include <common/fxt.h>
  26. #include <common/list.h>
  27. #include <datawizard/interfaces/data_interface.h>
  28. #include <datawizard/datastats.h>
  29. #include <datawizard/memstats.h>
  30. #include <datawizard/data_request.h>
  31. enum _starpu_cache_state
  32. {
  33. STARPU_OWNER,
  34. STARPU_SHARED,
  35. STARPU_INVALID
  36. };
  37. /* this should contain the information relative to a given data replicate */
  38. struct _starpu_data_replicate
  39. {
  40. starpu_data_handle_t handle;
  41. /* describe the actual data layout, as manipulated by data interfaces in *_interface.c */
  42. void *data_interface;
  43. unsigned memory_node;
  44. /* describes the state of the local data in term of coherency */
  45. enum _starpu_cache_state state;
  46. /* How many requests or tasks are currently working with this replicate */
  47. int refcnt;
  48. /* A buffer that is used for SCRATCH or reduction cannnot be used with
  49. * filters. */
  50. unsigned relaxed_coherency:2;
  51. /* We may need to initialize the replicate with some value before using it. */
  52. unsigned initialized:1;
  53. /* is the data locally allocated ? */
  54. unsigned allocated:1;
  55. /* was it automatically allocated ? (else it's the application-provided
  56. * buffer, don't ever try to free it!) */
  57. /* perhaps the allocation was perform higher in the hiearchy
  58. * for now this is just translated into !automatically_allocated
  59. * */
  60. unsigned automatically_allocated:1;
  61. /* Pointer to memchunk for LRU strategy */
  62. struct _starpu_mem_chunk * mc;
  63. /* To help the scheduling policies to make some decision, we
  64. may keep a track of the tasks that are likely to request
  65. this data on the current node.
  66. It is the responsability of the scheduling _policy_ to set that
  67. flag when it assigns a task to a queue, policies which do not
  68. use this hint can simply ignore it.
  69. */
  70. uint32_t requested;
  71. struct _starpu_data_request *request[STARPU_MAXNODES];
  72. };
  73. struct _starpu_data_requester_list;
  74. struct _starpu_jobid_list
  75. {
  76. unsigned long id;
  77. struct _starpu_jobid_list *next;
  78. };
  79. /* This structure describes a simply-linked list of task */
  80. struct _starpu_task_wrapper_list
  81. {
  82. struct starpu_task *task;
  83. struct _starpu_task_wrapper_list *next;
  84. };
  85. /* This structure describes a doubly-linked list of task */
  86. struct _starpu_task_wrapper_dlist
  87. {
  88. struct starpu_task *task;
  89. struct _starpu_task_wrapper_dlist *next;
  90. struct _starpu_task_wrapper_dlist *prev;
  91. };
  92. extern int _starpu_has_not_important_data;
  93. typedef void (*_starpu_data_handle_unregister_hook)(starpu_data_handle_t);
  94. struct _starpu_data_state
  95. {
  96. struct _starpu_data_requester_list req_list;
  97. /* the number of requests currently in the scheduling engine (not in
  98. * the req_list anymore), i.e. the number of holders of the
  99. * current_mode rwlock */
  100. unsigned refcnt;
  101. /* Current access mode. Is always either STARPU_R, STARPU_W,
  102. * STARPU_SCRATCH or STARPU_REDUX, but never a combination such as
  103. * STARPU_RW. */
  104. enum starpu_data_access_mode current_mode;
  105. /* protect meta data */
  106. struct _starpu_spinlock header_lock;
  107. /* Condition to make application wait for all transfers before freeing handle */
  108. /* busy_count is the number of handle->refcnt, handle->per_node[*]->refcnt, number of starpu_data_requesters, and number of tasks that have released it but are still registered on the implicit data dependency lists. */
  109. /* Core code which releases busy_count has to call
  110. * _starpu_data_check_not_busy to let starpu_data_unregister proceed */
  111. unsigned busy_count;
  112. /* Is starpu_data_unregister waiting for busy_count? */
  113. unsigned busy_waiting;
  114. starpu_pthread_mutex_t busy_mutex;
  115. starpu_pthread_cond_t busy_cond;
  116. /* In case we user filters, the handle may describe a sub-data */
  117. struct _starpu_data_state *root_handle; /* root of the tree */
  118. struct _starpu_data_state *father_handle; /* father of the node, NULL if the current node is the root */
  119. unsigned sibling_index; /* indicate which child this node is from the father's perpsective (if any) */
  120. unsigned depth; /* what's the depth of the tree ? */
  121. starpu_data_handle_t children;
  122. unsigned nchildren;
  123. /* describe the state of the data in term of coherency */
  124. struct _starpu_data_replicate per_node[STARPU_MAXNODES];
  125. struct _starpu_data_replicate per_worker[STARPU_NMAXWORKERS];
  126. struct starpu_data_interface_ops *ops;
  127. /* Footprint which identifies data layout */
  128. uint32_t footprint;
  129. /* where is the data home, i.e. which node it was registered from ? -1 if none yet */
  130. int home_node;
  131. /* what is the default write-through mask for that data ? */
  132. uint32_t wt_mask;
  133. /* allows special optimization */
  134. uint8_t is_readonly;
  135. /* in some case, the application may explicitly tell StarPU that a
  136. * piece of data is not likely to be used soon again */
  137. unsigned is_not_important;
  138. /* Does StarPU have to enforce some implicit data-dependencies ? */
  139. unsigned sequential_consistency;
  140. /* This lock should protect any operation to enforce
  141. * sequential_consistency */
  142. starpu_pthread_mutex_t sequential_consistency_mutex;
  143. /* The last submitted task (or application data request) that declared
  144. * it would modify the piece of data ? Any task accessing the data in a
  145. * read-only mode should depend on that task implicitely if the
  146. * sequential_consistency flag is enabled. */
  147. enum starpu_data_access_mode last_submitted_mode;
  148. struct starpu_task *last_sync_task;
  149. struct _starpu_task_wrapper_dlist last_submitted_accessors;
  150. /* If FxT is enabled, we keep track of "ghost dependencies": that is to
  151. * say the dependencies that are not needed anymore, but that should
  152. * appear in the post-mortem DAG. For instance if we have the sequence
  153. * f(Aw) g(Aw), and that g is submitted after the termination of f, we
  154. * want to have f->g appear in the DAG even if StarPU does not need to
  155. * enforce this dependency anymore.*/
  156. unsigned last_submitted_ghost_sync_id_is_valid;
  157. unsigned long last_submitted_ghost_sync_id;
  158. struct _starpu_jobid_list *last_submitted_ghost_accessors_id;
  159. /* protected by sequential_consistency_mutex */
  160. struct _starpu_task_wrapper_list *post_sync_tasks;
  161. unsigned post_sync_tasks_cnt;
  162. /*
  163. * Reductions
  164. */
  165. /* During reduction we need some specific methods: redux_func performs
  166. * the reduction of an interface into another one (eg. "+="), and init_func
  167. * initializes the data interface to a default value that is stable by
  168. * reduction (eg. 0 for +=). */
  169. struct starpu_codelet *redux_cl;
  170. struct starpu_codelet *init_cl;
  171. /* Are we currently performing a reduction on that handle ? If so the
  172. * reduction_refcnt should be non null until there are pending tasks
  173. * that are performing the reduction. */
  174. unsigned reduction_refcnt;
  175. /* List of requesters that are specific to the pending reduction. This
  176. * list is used when the requests in the req_list list are frozen until
  177. * the end of the reduction. */
  178. struct _starpu_data_requester_list reduction_req_list;
  179. starpu_data_handle_t *reduction_tmp_handles;
  180. unsigned lazy_unregister;
  181. #ifdef STARPU_OPENMP
  182. unsigned removed_from_context_hash;
  183. #endif
  184. /* Used for MPI */
  185. void *mpi_data;
  186. _starpu_memory_stats_t memory_stats;
  187. unsigned int mf_node; //XXX
  188. /* hook to be called when unregistering the data */
  189. _starpu_data_handle_unregister_hook unregister_hook;
  190. struct starpu_arbiter *arbiter;
  191. /* This is protected by the arbiter mutex */
  192. struct _starpu_data_requester_list arbitered_req_list;
  193. };
  194. void _starpu_display_msi_stats(void);
  195. /* This does not take a reference on the handle, the caller has to do it,
  196. * e.g. through _starpu_attempt_to_submit_data_request_from_apps()
  197. * detached means that the core is allowed to drop the request. The caller
  198. * should thus *not* take a reference since it can not know whether the request will complete
  199. * async means that _starpu_fetch_data_on_node will wait for completion of the request
  200. */
  201. int _starpu_fetch_data_on_node(starpu_data_handle_t handle, struct _starpu_data_replicate *replicate,
  202. enum starpu_data_access_mode mode, unsigned detached, unsigned is_prefetch, unsigned async,
  203. void (*callback_func)(void *), void *callback_arg);
  204. /* This releases a reference on the handle */
  205. void _starpu_release_data_on_node(struct _starpu_data_state *state, uint32_t default_wt_mask,
  206. struct _starpu_data_replicate *replicate);
  207. void _starpu_update_data_state(starpu_data_handle_t handle,
  208. struct _starpu_data_replicate *requesting_replicate,
  209. enum starpu_data_access_mode mode);
  210. uint32_t _starpu_get_data_refcnt(struct _starpu_data_state *state, unsigned node);
  211. size_t _starpu_data_get_size(starpu_data_handle_t handle);
  212. uint32_t _starpu_data_get_footprint(starpu_data_handle_t handle);
  213. void _starpu_push_task_output(struct _starpu_job *j);
  214. STARPU_ATTRIBUTE_WARN_UNUSED_RESULT
  215. int _starpu_fetch_task_input(struct _starpu_job *j);
  216. unsigned _starpu_is_data_present_or_requested(struct _starpu_data_state *state, unsigned node);
  217. int _starpu_select_src_node(struct _starpu_data_state *state, unsigned destination);
  218. /* is_prefetch is whether the DSM may drop the request (when there is not enough memory for instance
  219. * async is whether the caller wants a reference on the last request, to be
  220. * able to wait for it (which will release that reference).
  221. */
  222. struct _starpu_data_request *_starpu_create_request_to_fetch_data(starpu_data_handle_t handle,
  223. struct _starpu_data_replicate *dst_replicate,
  224. enum starpu_data_access_mode mode, unsigned is_prefetch,
  225. unsigned async,
  226. void (*callback_func)(void *), void *callback_arg);
  227. void _starpu_redux_init_data_replicate(starpu_data_handle_t handle, struct _starpu_data_replicate *replicate, int workerid);
  228. void _starpu_data_start_reduction_mode(starpu_data_handle_t handle);
  229. void _starpu_data_end_reduction_mode(starpu_data_handle_t handle);
  230. void _starpu_data_end_reduction_mode_terminate(starpu_data_handle_t handle);
  231. void _starpu_data_set_unregister_hook(starpu_data_handle_t handle, _starpu_data_handle_unregister_hook func);
  232. #endif // __COHERENCY__H__