sched_ctx.c 80 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011, 2013 INRIA
  4. * Copyright (C) 2016 Uppsala University
  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 <core/sched_policy.h>
  18. #include <core/sched_ctx.h>
  19. #include <common/utils.h>
  20. #include <stdarg.h>
  21. #include <core/task.h>
  22. static starpu_pthread_mutex_t sched_ctx_manag = STARPU_PTHREAD_MUTEX_INITIALIZER;
  23. static starpu_pthread_mutex_t finished_submit_mutex = STARPU_PTHREAD_MUTEX_INITIALIZER;
  24. static struct starpu_task stop_submission_task = STARPU_TASK_INITIALIZER;
  25. starpu_pthread_key_t sched_ctx_key;
  26. static unsigned with_hypervisor = 0;
  27. static double hyp_start_sample[STARPU_NMAX_SCHED_CTXS];
  28. static double hyp_start_allow_sample[STARPU_NMAX_SCHED_CTXS];
  29. static double flops[STARPU_NMAX_SCHED_CTXS][STARPU_NMAXWORKERS];
  30. static size_t data_size[STARPU_NMAX_SCHED_CTXS][STARPU_NMAXWORKERS];
  31. static double hyp_actual_start_sample[STARPU_NMAX_SCHED_CTXS];
  32. static double window_size;
  33. static int nobind;
  34. static int occupied_sms = 0;
  35. static unsigned _starpu_get_first_free_sched_ctx(struct _starpu_machine_config *config);
  36. static void _starpu_sched_ctx_put_new_master(unsigned sched_ctx_id);
  37. static void _starpu_sched_ctx_block_workers_in_parallel(unsigned sched_ctx_id, unsigned all);
  38. static void _starpu_sched_ctx_unblock_workers_in_parallel(unsigned sched_ctx_id, unsigned all);
  39. static void _starpu_sched_ctx_update_parallel_workers_with(unsigned sched_ctx_id);
  40. static void _starpu_sched_ctx_update_parallel_workers_without(unsigned sched_ctx_id);
  41. static void set_priority_on_notified_workers(int *workers, int nworkers, unsigned sched_ctx_id, unsigned priority);
  42. static void set_priority_hierarchically_on_notified_workers(int* workers_to_add, unsigned nworkers_to_add, unsigned sched_ctx, unsigned priority);
  43. static void fetch_tasks_from_empty_ctx_list(struct _starpu_sched_ctx *sched_ctx);
  44. static void add_notified_workers(int *workers_to_add, int nworkers_to_add, unsigned sched_ctx_id);
  45. static void notify_workers_about_changing_ctx_pending(const unsigned nworkers, const int * const workerids)
  46. {
  47. unsigned i;
  48. for (i=0; i<nworkers; i++)
  49. {
  50. struct _starpu_worker *worker = _starpu_get_worker_struct(workerids[i]);
  51. STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex);
  52. _starpu_worker_enter_changing_ctx_op(worker);
  53. STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex);
  54. }
  55. }
  56. static void notify_workers_about_changing_ctx_done(const unsigned nworkers, const int * const workerids)
  57. {
  58. unsigned i;
  59. for (i=0; i<nworkers; i++)
  60. {
  61. struct _starpu_worker *worker = _starpu_get_worker_struct(workerids[i]);
  62. STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex);
  63. _starpu_worker_leave_changing_ctx_op(worker);
  64. STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex);
  65. }
  66. }
  67. static void _starpu_worker_gets_into_ctx(unsigned sched_ctx_id, struct _starpu_worker *worker)
  68. {
  69. unsigned ret_sched_ctx = _starpu_sched_ctx_elt_exists(worker->sched_ctx_list, sched_ctx_id);
  70. /* the worker was planning to go away in another ctx but finally he changed his mind &
  71. he's staying */
  72. if (!ret_sched_ctx)
  73. {
  74. /* add context to worker */
  75. _starpu_sched_ctx_list_add(&worker->sched_ctx_list, sched_ctx_id);
  76. worker->nsched_ctxs++;
  77. }
  78. worker->removed_from_ctx[sched_ctx_id] = 0;
  79. if(worker->tmp_sched_ctx == (int) sched_ctx_id)
  80. worker->tmp_sched_ctx = -1;
  81. return;
  82. }
  83. void _starpu_worker_gets_out_of_ctx(unsigned sched_ctx_id, struct _starpu_worker *worker)
  84. {
  85. unsigned ret_sched_ctx = _starpu_sched_ctx_elt_exists(worker->sched_ctx_list, sched_ctx_id);
  86. /* remove context from worker */
  87. if(ret_sched_ctx)
  88. {
  89. /* don't remove scheduling data here, there might be tasks running and when post_exec
  90. executes scheduling data is not there any more, do it when deleting context, then
  91. we really won't need it anymore */
  92. /* struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id); */
  93. /* if(sched_ctx && sched_ctx->sched_policy && sched_ctx->sched_policy->remove_workers) */
  94. /* { */
  95. /* _STARPU_SCHED_BEGIN; */
  96. /* sched_ctx->sched_policy->remove_workers(sched_ctx_id, &worker->workerid, 1); */
  97. /* _STARPU_SCHED_END; */
  98. /* } */
  99. if (!_starpu_sched_ctx_list_remove(&worker->sched_ctx_list, sched_ctx_id))
  100. worker->nsched_ctxs--;
  101. }
  102. return;
  103. }
  104. static void _starpu_update_workers_with_ctx(int *workerids, int nworkers, int sched_ctx_id)
  105. {
  106. int i;
  107. struct _starpu_worker *worker = NULL;
  108. for(i = 0; i < nworkers; i++)
  109. {
  110. worker = _starpu_get_worker_struct(workerids[i]);
  111. STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex);
  112. _starpu_worker_gets_into_ctx(sched_ctx_id, worker);
  113. STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex);
  114. }
  115. return;
  116. }
  117. static void _starpu_update_notified_workers_with_ctx(int *workerids, int nworkers, int sched_ctx_id)
  118. {
  119. int i;
  120. struct _starpu_worker *worker = NULL;
  121. for(i = 0; i < nworkers; i++)
  122. {
  123. worker = _starpu_get_worker_struct(workerids[i]);
  124. _starpu_worker_gets_into_ctx(sched_ctx_id, worker);
  125. }
  126. return;
  127. }
  128. static void _starpu_update_workers_without_ctx(int *workerids, int nworkers, int sched_ctx_id, unsigned now)
  129. {
  130. int i;
  131. struct _starpu_worker *worker = NULL;
  132. for(i = 0; i < nworkers; i++)
  133. {
  134. worker = _starpu_get_worker_struct(workerids[i]);
  135. if(now)
  136. {
  137. STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex);
  138. _starpu_worker_gets_out_of_ctx(sched_ctx_id, worker);
  139. STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex);
  140. }
  141. else
  142. {
  143. STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex);
  144. worker->removed_from_ctx[sched_ctx_id] = 1;
  145. STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex);
  146. }
  147. }
  148. return;
  149. }
  150. static void _starpu_update_notified_workers_without_ctx(int *workerids, int nworkers, int sched_ctx_id, unsigned now)
  151. {
  152. int i;
  153. struct _starpu_worker *worker = NULL;
  154. for(i = 0; i < nworkers; i++)
  155. {
  156. worker = _starpu_get_worker_struct(workerids[i]);
  157. if(now)
  158. {
  159. _starpu_worker_gets_out_of_ctx(sched_ctx_id, worker);
  160. }
  161. else
  162. {
  163. worker->removed_from_ctx[sched_ctx_id] = 1;
  164. }
  165. }
  166. return;
  167. }
  168. void starpu_sched_ctx_stop_task_submission()
  169. {
  170. _starpu_exclude_task_from_dag(&stop_submission_task);
  171. int ret = _starpu_task_submit_internally(&stop_submission_task);
  172. STARPU_ASSERT(!ret);
  173. }
  174. /* must be called with sched_mutex locked */
  175. void starpu_sched_ctx_worker_shares_tasks_lists(int workerid, int sched_ctx_id)
  176. {
  177. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  178. worker->shares_tasks_lists[sched_ctx_id] = 1;
  179. }
  180. static void _do_add_notified_workers(struct _starpu_sched_ctx *sched_ctx, int *workerids, int nworkers)
  181. {
  182. int ndevices = 0;
  183. struct starpu_perfmodel_device devices[nworkers];
  184. int i = 0;
  185. for(i = 0; i < nworkers; i++)
  186. {
  187. int workerid = workerids[i];
  188. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  189. int dev1, dev2;
  190. unsigned found = 0;
  191. for(dev1 = 0; dev1 < worker->perf_arch.ndevices; dev1++)
  192. {
  193. for(dev2 = 0; dev2 < ndevices; dev2++)
  194. {
  195. if(devices[dev2].type == worker->perf_arch.devices[dev1].type &&
  196. devices[dev2].devid == worker->perf_arch.devices[dev1].devid)
  197. {
  198. devices[dev2].ncores += worker->perf_arch.devices[dev1].ncores;
  199. found = 1;
  200. break;
  201. }
  202. }
  203. if(!found)
  204. {
  205. devices[ndevices].type = worker->perf_arch.devices[dev1].type;
  206. devices[ndevices].devid = worker->perf_arch.devices[dev1].devid;
  207. devices[ndevices].ncores = worker->perf_arch.devices[dev1].ncores;
  208. ndevices++;
  209. }
  210. else
  211. found = 0;
  212. }
  213. }
  214. if(ndevices > 0)
  215. {
  216. if(sched_ctx->perf_arch.devices == NULL)
  217. {
  218. _STARPU_MALLOC(sched_ctx->perf_arch.devices, ndevices*sizeof(struct starpu_perfmodel_device));
  219. }
  220. else
  221. {
  222. int nfinal_devices = 0;
  223. int dev1, dev2;
  224. unsigned found = 0;
  225. for(dev1 = 0; dev1 < ndevices; dev1++)
  226. {
  227. for(dev2 = 0; dev2 < sched_ctx->perf_arch.ndevices; dev2++)
  228. {
  229. if(sched_ctx->perf_arch.devices[dev2].type == devices[dev1].type && sched_ctx->perf_arch.devices[dev2].devid == devices[dev1].devid)
  230. found = 1;
  231. }
  232. if(!found)
  233. {
  234. nfinal_devices++;
  235. }
  236. else
  237. found = 0;
  238. }
  239. int nsize = (sched_ctx->perf_arch.ndevices+nfinal_devices);
  240. _STARPU_REALLOC(sched_ctx->perf_arch.devices, nsize*sizeof(struct starpu_perfmodel_device));
  241. }
  242. int dev1, dev2;
  243. unsigned found = 0;
  244. for(dev1 = 0; dev1 < ndevices; dev1++)
  245. {
  246. for(dev2 = 0; dev2 < sched_ctx->perf_arch.ndevices; dev2++)
  247. {
  248. if(sched_ctx->perf_arch.devices[dev2].type == devices[dev1].type && sched_ctx->perf_arch.devices[dev2].devid == devices[dev1].devid)
  249. {
  250. if(sched_ctx->perf_arch.devices[dev2].type == STARPU_CPU_WORKER)
  251. sched_ctx->perf_arch.devices[dev2].ncores += devices[dev1].ncores;
  252. found = 1;
  253. }
  254. }
  255. if(!found)
  256. {
  257. sched_ctx->perf_arch.devices[sched_ctx->perf_arch.ndevices].type = devices[dev1].type;
  258. sched_ctx->perf_arch.devices[sched_ctx->perf_arch.ndevices].devid = devices[dev1].devid;
  259. if (sched_ctx->stream_worker != -1)
  260. sched_ctx->perf_arch.devices[sched_ctx->perf_arch.ndevices].ncores = sched_ctx->nsms;
  261. else
  262. sched_ctx->perf_arch.devices[sched_ctx->perf_arch.ndevices].ncores = devices[dev1].ncores;
  263. sched_ctx->perf_arch.ndevices++;
  264. }
  265. else
  266. found = 0;
  267. }
  268. }
  269. _starpu_sched_ctx_update_parallel_workers_with(sched_ctx->id);
  270. }
  271. static void _starpu_add_workers_to_new_sched_ctx(struct _starpu_sched_ctx *sched_ctx, int *workerids, int nworkers)
  272. {
  273. struct starpu_worker_collection *workers = sched_ctx->workers;
  274. struct _starpu_machine_config *config = _starpu_get_machine_config();
  275. if (nworkers == -1)
  276. nworkers = config->topology.nworkers;
  277. if (!nworkers)
  278. return;
  279. int _workerids[nworkers];
  280. int i;
  281. if (workerids == NULL)
  282. {
  283. for(i = 0; i < nworkers; i++)
  284. _workerids[i] = i;
  285. workerids = _workerids;
  286. }
  287. for(i = 0; i < nworkers; i++)
  288. {
  289. int workerid = workerids[i];
  290. {
  291. int _workerid = workers->add(workers, workerid);
  292. STARPU_ASSERT(_workerid >= 0);
  293. (void)_workerid;
  294. }
  295. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  296. STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex);
  297. worker->tmp_sched_ctx = (int)sched_ctx->id;
  298. STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex);
  299. }
  300. notify_workers_about_changing_ctx_pending(nworkers, workerids);
  301. _do_add_notified_workers(sched_ctx, workerids, nworkers);
  302. notify_workers_about_changing_ctx_done(nworkers, workerids);
  303. if(sched_ctx->sched_policy && sched_ctx->sched_policy->add_workers)
  304. {
  305. _STARPU_SCHED_BEGIN;
  306. sched_ctx->sched_policy->add_workers(sched_ctx->id, workerids, nworkers);
  307. _STARPU_SCHED_END;
  308. }
  309. }
  310. static void _starpu_remove_workers_from_sched_ctx(struct _starpu_sched_ctx *sched_ctx, int *workerids,
  311. int nworkers, int *removed_workers, int *n_removed_workers)
  312. {
  313. struct starpu_worker_collection *workers = sched_ctx->workers;
  314. struct starpu_perfmodel_device devices[workers->nworkers];
  315. int ndevices = 0;
  316. int i = 0;
  317. for(i = 0; i < nworkers; i++)
  318. {
  319. if(workers->nworkers > 0)
  320. {
  321. if(_starpu_worker_belongs_to_a_sched_ctx(workerids[i], sched_ctx->id))
  322. {
  323. int worker = workers->remove(workers, workerids[i]);
  324. if(worker >= 0)
  325. removed_workers[(*n_removed_workers)++] = worker;
  326. }
  327. }
  328. }
  329. unsigned found = 0;
  330. int dev;
  331. struct starpu_sched_ctx_iterator it;
  332. if(workers->init_iterator)
  333. workers->init_iterator(workers, &it);
  334. while(workers->has_next(workers, &it))
  335. {
  336. int worker = workers->get_next(workers, &it);
  337. struct _starpu_worker *str_worker = _starpu_get_worker_struct(worker);
  338. for(dev = 0; dev < str_worker->perf_arch.ndevices; dev++)
  339. {
  340. int dev2;
  341. for(dev2 = 0; dev2 < ndevices; dev2++)
  342. {
  343. if(devices[dev2].type == str_worker->perf_arch.devices[dev].type &&
  344. devices[dev2].devid == str_worker->perf_arch.devices[dev].devid)
  345. {
  346. if(devices[dev2].type == STARPU_CPU_WORKER)
  347. devices[dev2].ncores += str_worker->perf_arch.devices[dev].ncores;
  348. }
  349. found = 1;
  350. }
  351. if(!found)
  352. {
  353. devices[ndevices].type = str_worker->perf_arch.devices[dev].type;
  354. devices[ndevices].devid = str_worker->perf_arch.devices[dev].devid;
  355. devices[ndevices].ncores = str_worker->perf_arch.devices[dev].ncores;
  356. ndevices++;
  357. }
  358. else
  359. found = 0;
  360. }
  361. found = 0;
  362. }
  363. sched_ctx->perf_arch.ndevices = ndevices;
  364. for(dev = 0; dev < ndevices; dev++)
  365. {
  366. sched_ctx->perf_arch.devices[dev].type = devices[dev].type;
  367. sched_ctx->perf_arch.devices[dev].devid = devices[dev].devid;
  368. sched_ctx->perf_arch.devices[dev].ncores = devices[dev].ncores;
  369. }
  370. _starpu_sched_ctx_update_parallel_workers_without(sched_ctx->id);
  371. return;
  372. }
  373. static void _starpu_sched_ctx_free_scheduling_data(struct _starpu_sched_ctx *sched_ctx)
  374. {
  375. if(sched_ctx->sched_policy && sched_ctx->sched_policy->remove_workers)
  376. {
  377. int *workerids = NULL;
  378. unsigned nworkers_ctx = starpu_sched_ctx_get_workers_list(sched_ctx->id, &workerids);
  379. if(nworkers_ctx > 0)
  380. {
  381. _STARPU_SCHED_BEGIN;
  382. sched_ctx->sched_policy->remove_workers(sched_ctx->id, workerids, nworkers_ctx);
  383. _STARPU_SCHED_END;
  384. }
  385. free(workerids);
  386. }
  387. return;
  388. }
  389. #ifdef STARPU_HAVE_HWLOC
  390. static void _starpu_sched_ctx_create_hwloc_tree(struct _starpu_sched_ctx *sched_ctx)
  391. {
  392. sched_ctx->hwloc_workers_set = hwloc_bitmap_alloc();
  393. struct starpu_worker_collection *workers = sched_ctx->workers;
  394. struct _starpu_worker *worker;
  395. struct starpu_sched_ctx_iterator it;
  396. workers->init_iterator(workers, &it);
  397. while(workers->has_next(workers, &it))
  398. {
  399. unsigned workerid = workers->get_next(workers, &it);
  400. if(!starpu_worker_is_combined_worker(workerid))
  401. {
  402. worker = _starpu_get_worker_struct(workerid);
  403. hwloc_bitmap_or(sched_ctx->hwloc_workers_set,
  404. sched_ctx->hwloc_workers_set,
  405. worker->hwloc_cpu_set);
  406. }
  407. }
  408. return;
  409. }
  410. #endif
  411. struct _starpu_sched_ctx* _starpu_create_sched_ctx(struct starpu_sched_policy *policy, int *workerids,
  412. int nworkers_ctx, unsigned is_initial_sched,
  413. const char *sched_ctx_name,
  414. int min_prio_set, int min_prio,
  415. int max_prio_set, int max_prio,
  416. unsigned awake_workers,
  417. void (*sched_policy_init)(unsigned),
  418. void * user_data,
  419. int nsub_ctxs, int *sub_ctxs, int nsms)
  420. {
  421. struct _starpu_machine_config *config = _starpu_get_machine_config();
  422. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx_manag);
  423. STARPU_ASSERT(config->topology.nsched_ctxs < STARPU_NMAX_SCHED_CTXS);
  424. unsigned id = _starpu_get_first_free_sched_ctx(config);
  425. struct _starpu_sched_ctx *sched_ctx = &config->sched_ctxs[id];
  426. sched_ctx->id = id;
  427. config->topology.nsched_ctxs++;
  428. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx_manag);
  429. int nworkers = config->topology.nworkers;
  430. int i;
  431. STARPU_ASSERT(nworkers_ctx <= nworkers);
  432. starpu_task_list_init(&sched_ctx->empty_ctx_tasks);
  433. starpu_task_list_init(&sched_ctx->waiting_tasks);
  434. if (policy)
  435. {
  436. _STARPU_MALLOC(sched_ctx->sched_policy, sizeof(struct starpu_sched_policy));
  437. }
  438. else
  439. {
  440. sched_ctx->sched_policy = NULL;
  441. }
  442. sched_ctx->is_initial_sched = is_initial_sched;
  443. sched_ctx->name = sched_ctx_name;
  444. sched_ctx->inheritor = STARPU_NMAX_SCHED_CTXS;
  445. sched_ctx->finished_submit = 0;
  446. sched_ctx->min_priority_is_set = min_prio_set;
  447. if (sched_ctx->min_priority_is_set)
  448. sched_ctx->min_priority = min_prio;
  449. else
  450. sched_ctx->min_priority = 0;
  451. sched_ctx->max_priority_is_set = max_prio_set;
  452. if (sched_ctx->max_priority_is_set)
  453. sched_ctx->max_priority = max_prio;
  454. else
  455. sched_ctx->max_priority = 0;
  456. _starpu_barrier_counter_init(&sched_ctx->tasks_barrier, 0);
  457. _starpu_barrier_counter_init(&sched_ctx->ready_tasks_barrier, 0);
  458. sched_ctx->ready_flops = 0.0;
  459. for (i = 0; i < (int) (sizeof(sched_ctx->iterations)/sizeof(sched_ctx->iterations[0])); i++)
  460. sched_ctx->iterations[i] = -1;
  461. sched_ctx->iteration_level = 0;
  462. sched_ctx->main_master = -1;
  463. sched_ctx->perf_arch.devices = NULL;
  464. sched_ctx->perf_arch.ndevices = 0;
  465. sched_ctx->init_sched = sched_policy_init;
  466. sched_ctx->user_data = user_data;
  467. sched_ctx->sms_start_idx = 0;
  468. sched_ctx->sms_end_idx = STARPU_NMAXSMS;
  469. sched_ctx->nsms = nsms;
  470. sched_ctx->stream_worker = -1;
  471. memset(&sched_ctx->lock_write_owner, 0, sizeof(sched_ctx->lock_write_owner));
  472. STARPU_PTHREAD_RWLOCK_INIT(&sched_ctx->rwlock, NULL);
  473. if(nsms > 0)
  474. {
  475. STARPU_ASSERT_MSG(workerids, "workerids is needed when setting nsms");
  476. sched_ctx->sms_start_idx = occupied_sms;
  477. sched_ctx->sms_end_idx = occupied_sms+nsms;
  478. occupied_sms += nsms;
  479. _STARPU_DEBUG("ctx %d: stream worker %d nsms %d ocupied sms %d\n", sched_ctx->id, workerids[0], nsms, occupied_sms);
  480. STARPU_ASSERT_MSG(occupied_sms <= STARPU_NMAXSMS , "STARPU:requested more sms than available");
  481. _starpu_worker_set_stream_ctx(workerids[0], sched_ctx);
  482. sched_ctx->stream_worker = workerids[0];
  483. }
  484. sched_ctx->nsub_ctxs = 0;
  485. sched_ctx->parallel_view = 0;
  486. /*init the strategy structs and the worker_collection of the ressources of the context */
  487. if(policy)
  488. {
  489. _starpu_init_sched_policy(config, sched_ctx, policy);
  490. sched_ctx->awake_workers = 1;
  491. }
  492. else
  493. {
  494. sched_ctx->awake_workers = awake_workers;
  495. starpu_sched_ctx_create_worker_collection(sched_ctx->id, STARPU_WORKER_LIST);
  496. }
  497. /*add sub_ctxs before add workers, in order to be able to associate them if necessary */
  498. if(nsub_ctxs != 0)
  499. {
  500. for(i = 0; i < nsub_ctxs; i++)
  501. sched_ctx->sub_ctxs[i] = sub_ctxs[i];
  502. sched_ctx->nsub_ctxs = nsub_ctxs;
  503. }
  504. _starpu_add_workers_to_new_sched_ctx(sched_ctx, workerids, nworkers_ctx);
  505. #ifdef STARPU_HAVE_HWLOC
  506. /* build hwloc tree of the context */
  507. _starpu_sched_ctx_create_hwloc_tree(sched_ctx);
  508. #endif //STARPU_HAVE_HWLOC
  509. /* if we create the initial big sched ctx we can update workers' status here
  510. because they haven't been launched yet */
  511. if(is_initial_sched)
  512. {
  513. for(i = 0; i < nworkers; i++)
  514. {
  515. struct _starpu_worker *worker = _starpu_get_worker_struct(i);
  516. if(!_starpu_sched_ctx_list_add(&worker->sched_ctx_list, sched_ctx->id))
  517. worker->nsched_ctxs++;
  518. }
  519. }
  520. return sched_ctx;
  521. }
  522. static void _get_workers(int min, int max, int *workers, int *nw, enum starpu_worker_archtype arch, unsigned allow_overlap)
  523. {
  524. int pus[max];
  525. int npus = 0;
  526. int i;
  527. struct _starpu_machine_config *config = _starpu_get_machine_config();
  528. if(config->topology.nsched_ctxs == 1)
  529. {
  530. /*we have all available resources */
  531. npus = starpu_worker_get_nids_by_type(arch, pus, max);
  532. /*TODO: hierarchical ctxs: get max good workers: close one to another */
  533. for(i = 0; i < npus; i++)
  534. workers[(*nw)++] = pus[i];
  535. }
  536. else
  537. {
  538. unsigned enough_ressources = 0;
  539. npus = starpu_worker_get_nids_ctx_free_by_type(arch, pus, max);
  540. for(i = 0; i < npus; i++)
  541. workers[(*nw)++] = pus[i];
  542. if(npus == max)
  543. /*we have enough available resources */
  544. enough_ressources = 1;
  545. if(!enough_ressources && npus >= min)
  546. /*we have enough available resources */
  547. enough_ressources = 1;
  548. if(!enough_ressources)
  549. {
  550. /* try to get ressources from ctx who have more than the min of workers they need */
  551. int s;
  552. for(s = 1; s < STARPU_NMAX_SCHED_CTXS; s++)
  553. {
  554. if(config->sched_ctxs[s].id != STARPU_NMAX_SCHED_CTXS)
  555. {
  556. int _npus = 0;
  557. int _pus[STARPU_NMAXWORKERS];
  558. _npus = _starpu_get_workers_of_sched_ctx(config->sched_ctxs[s].id, _pus, arch);
  559. int ctx_min = arch == STARPU_CPU_WORKER ? config->sched_ctxs[s].min_ncpus : config->sched_ctxs[s].min_ngpus;
  560. if(_npus > ctx_min)
  561. {
  562. int n=0;
  563. if(npus < min)
  564. {
  565. n = (_npus - ctx_min) > (min - npus) ? min - npus : (_npus - ctx_min);
  566. npus += n;
  567. }
  568. /*TODO: hierarchical ctxs: get n good workers: close to the other ones I already assigned to the ctx */
  569. for(i = 0; i < n; i++)
  570. workers[(*nw)++] = _pus[i];
  571. starpu_sched_ctx_remove_workers(_pus, n, config->sched_ctxs[s].id);
  572. }
  573. }
  574. }
  575. if(npus >= min)
  576. enough_ressources = 1;
  577. }
  578. if(!enough_ressources)
  579. {
  580. /* if there is no available workers to satisfy the minimum required
  581. give them workers proportional to their requirements*/
  582. int global_npus = starpu_worker_get_count_by_type(arch);
  583. int req_npus = 0;
  584. int s;
  585. for(s = 1; s < STARPU_NMAX_SCHED_CTXS; s++)
  586. if(config->sched_ctxs[s].id != STARPU_NMAX_SCHED_CTXS)
  587. req_npus += arch == STARPU_CPU_WORKER ? config->sched_ctxs[s].min_ncpus : config->sched_ctxs[s].min_ngpus;
  588. req_npus += min;
  589. for(s = 1; s < STARPU_NMAX_SCHED_CTXS; s++)
  590. {
  591. if(config->sched_ctxs[s].id != STARPU_NMAX_SCHED_CTXS)
  592. {
  593. int ctx_min = arch == STARPU_CPU_WORKER ? config->sched_ctxs[s].min_ncpus : config->sched_ctxs[s].min_ngpus;
  594. double needed_npus = ((double)ctx_min * (double)global_npus) / (double)req_npus;
  595. int _npus = 0;
  596. int _pus[STARPU_NMAXWORKERS];
  597. _npus = _starpu_get_workers_of_sched_ctx(config->sched_ctxs[s].id, _pus, arch);
  598. if(needed_npus < (double)_npus)
  599. {
  600. double npus_to_rem = (double)_npus - needed_npus;
  601. int x = floor(npus_to_rem);
  602. double x_double = (double)x;
  603. double diff = npus_to_rem - x_double;
  604. int npus_to_remove = diff >= 0.5 ? x+1 : x;
  605. int pus_to_remove[npus_to_remove];
  606. int c = 0;
  607. /*TODO: hierarchical ctxs: get npus_to_remove good workers: close to the other ones I already assigned to the ctx */
  608. for(i = _npus-1; i >= (_npus - npus_to_remove); i--)
  609. {
  610. workers[(*nw)++] = _pus[i];
  611. pus_to_remove[c++] = _pus[i];
  612. }
  613. if(!allow_overlap)
  614. starpu_sched_ctx_remove_workers(pus_to_remove, npus_to_remove, config->sched_ctxs[s].id);
  615. }
  616. }
  617. }
  618. }
  619. }
  620. }
  621. unsigned starpu_sched_ctx_create_inside_interval(const char *policy_name, const char *sched_ctx_name,
  622. int min_ncpus, int max_ncpus, int min_ngpus, int max_ngpus,
  623. unsigned allow_overlap)
  624. {
  625. struct _starpu_machine_config *config = _starpu_get_machine_config();
  626. struct starpu_sched_policy *selected_policy = _starpu_select_sched_policy(config, policy_name);
  627. struct _starpu_sched_ctx *sched_ctx = NULL;
  628. int workers[max_ncpus + max_ngpus];
  629. int nw = 0;
  630. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx_manag);
  631. _get_workers(min_ncpus, max_ncpus, workers, &nw, STARPU_CPU_WORKER, allow_overlap);
  632. _get_workers(min_ngpus, max_ngpus, workers, &nw, STARPU_CUDA_WORKER, allow_overlap);
  633. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx_manag);
  634. int i;
  635. printf("%d: ", nw);
  636. for(i = 0; i < nw; i++)
  637. printf("%d ", workers[i]);
  638. printf("\n");
  639. sched_ctx = _starpu_create_sched_ctx(selected_policy, workers, nw, 0, sched_ctx_name, 0, 0, 0, 0, 1, NULL, NULL,0, NULL, 0);
  640. sched_ctx->min_ncpus = min_ncpus;
  641. sched_ctx->max_ncpus = max_ncpus;
  642. sched_ctx->min_ngpus = min_ngpus;
  643. sched_ctx->max_ngpus = max_ngpus;
  644. int *added_workerids;
  645. unsigned nw_ctx = starpu_sched_ctx_get_workers_list(sched_ctx->id, &added_workerids);
  646. _starpu_update_workers_without_ctx(added_workerids, nw_ctx, sched_ctx->id, 0);
  647. free(added_workerids);
  648. #ifdef STARPU_USE_SC_HYPERVISOR
  649. sched_ctx->perf_counters = NULL;
  650. #endif
  651. return sched_ctx->id;
  652. }
  653. int starpu_sched_ctx_get_nsms(unsigned sched_ctx)
  654. {
  655. struct _starpu_sched_ctx *sc = _starpu_get_sched_ctx_struct(sched_ctx);
  656. return sc->nsms;
  657. }
  658. void starpu_sched_ctx_get_sms_interval(int stream_workerid, int *start, int *end)
  659. {
  660. struct _starpu_sched_ctx *sc = _starpu_worker_get_ctx_stream(stream_workerid);
  661. *start = sc->sms_start_idx;
  662. *end = sc->sms_end_idx;
  663. }
  664. int starpu_sched_ctx_get_sub_ctxs(unsigned sched_ctx, int *ctxs)
  665. {
  666. struct _starpu_sched_ctx *sc = _starpu_get_sched_ctx_struct(sched_ctx);
  667. int i;
  668. for(i = 0; i < sc->nsub_ctxs; i++)
  669. ctxs[i] = sc->sub_ctxs[i];
  670. return sc->nsub_ctxs;
  671. }
  672. int starpu_sched_ctx_get_stream_worker(unsigned sub_ctx)
  673. {
  674. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sub_ctx);
  675. struct starpu_worker_collection *workers = sched_ctx->workers;
  676. struct starpu_sched_ctx_iterator it;
  677. int worker = -1;
  678. workers->init_iterator(workers, &it);
  679. if(workers->has_next(workers, &it))
  680. {
  681. worker = workers->get_next(workers, &it);
  682. }
  683. return worker;
  684. }
  685. unsigned starpu_sched_ctx_create(int *workerids, int nworkers, const char *sched_ctx_name, ...)
  686. {
  687. va_list varg_list;
  688. int arg_type;
  689. int min_prio_set = 0;
  690. int max_prio_set = 0;
  691. int min_prio = 0;
  692. int max_prio = 0;
  693. int nsms = 0;
  694. int *sub_ctxs = NULL;
  695. int nsub_ctxs = 0;
  696. void *user_data = NULL;
  697. struct starpu_sched_policy *sched_policy = NULL;
  698. unsigned hierarchy_level = 0;
  699. unsigned nesting_sched_ctx = STARPU_NMAX_SCHED_CTXS;
  700. unsigned awake_workers = 0;
  701. void (*init_sched)(unsigned) = NULL;
  702. va_start(varg_list, sched_ctx_name);
  703. while ((arg_type = va_arg(varg_list, int)) != 0)
  704. {
  705. if (arg_type == STARPU_SCHED_CTX_POLICY_NAME)
  706. {
  707. char *policy_name = va_arg(varg_list, char *);
  708. struct _starpu_machine_config *config = _starpu_get_machine_config();
  709. sched_policy = _starpu_select_sched_policy(config, policy_name);
  710. }
  711. else if (arg_type == STARPU_SCHED_CTX_POLICY_STRUCT)
  712. {
  713. sched_policy = va_arg(varg_list, struct starpu_sched_policy *);
  714. }
  715. else if (arg_type == STARPU_SCHED_CTX_POLICY_MIN_PRIO)
  716. {
  717. min_prio = va_arg(varg_list, int);
  718. min_prio_set = 1;
  719. }
  720. else if (arg_type == STARPU_SCHED_CTX_POLICY_MAX_PRIO)
  721. {
  722. max_prio = va_arg(varg_list, int);
  723. max_prio_set = 1;
  724. }
  725. else if (arg_type == STARPU_SCHED_CTX_HIERARCHY_LEVEL)
  726. {
  727. hierarchy_level = va_arg(varg_list, unsigned);
  728. }
  729. else if (arg_type == STARPU_SCHED_CTX_NESTED)
  730. {
  731. nesting_sched_ctx = va_arg(varg_list, unsigned);
  732. }
  733. else if (arg_type == STARPU_SCHED_CTX_AWAKE_WORKERS)
  734. {
  735. awake_workers = 1;
  736. }
  737. else if (arg_type == STARPU_SCHED_CTX_POLICY_INIT)
  738. {
  739. init_sched = va_arg(varg_list, void(*)(unsigned));
  740. }
  741. else if (arg_type == STARPU_SCHED_CTX_USER_DATA)
  742. {
  743. user_data = va_arg(varg_list, void *);
  744. }
  745. else if (arg_type == STARPU_SCHED_CTX_SUB_CTXS)
  746. {
  747. sub_ctxs = va_arg(varg_list, int*);
  748. nsub_ctxs = va_arg(varg_list, int);
  749. }
  750. else if (arg_type == STARPU_SCHED_CTX_CUDA_NSMS)
  751. {
  752. nsms = va_arg(varg_list, int);
  753. }
  754. else
  755. {
  756. STARPU_ABORT_MSG("Unrecognized argument %d\n", arg_type);
  757. }
  758. }
  759. va_end(varg_list);
  760. if (workerids && nworkers != -1)
  761. {
  762. /* Make sure the user doesn't use invalid worker IDs. */
  763. int num_workers = starpu_worker_get_count();
  764. int i;
  765. for (i = 0; i < nworkers; i++)
  766. {
  767. if (workerids[i] < 0 || workerids[i] >= num_workers)
  768. {
  769. _STARPU_ERROR("Invalid worker ID (%d) specified!\n", workerids[i]);
  770. return STARPU_NMAX_SCHED_CTXS;
  771. }
  772. }
  773. }
  774. struct _starpu_sched_ctx *sched_ctx = NULL;
  775. sched_ctx = _starpu_create_sched_ctx(sched_policy, workerids, nworkers, 0, sched_ctx_name, min_prio_set, min_prio, max_prio_set, max_prio, awake_workers, init_sched, user_data, nsub_ctxs, sub_ctxs, nsms);
  776. sched_ctx->hierarchy_level = hierarchy_level;
  777. sched_ctx->nesting_sched_ctx = nesting_sched_ctx;
  778. int *added_workerids;
  779. unsigned nw_ctx = starpu_sched_ctx_get_workers_list(sched_ctx->id, &added_workerids);
  780. _starpu_update_workers_with_ctx(added_workerids, nw_ctx, sched_ctx->id);
  781. free(added_workerids);
  782. #ifdef STARPU_USE_SC_HYPERVISOR
  783. sched_ctx->perf_counters = NULL;
  784. #endif
  785. return sched_ctx->id;
  786. }
  787. int fstarpu_sched_ctx_create(int *workerids, int nworkers, const char *sched_ctx_name, void ***_arglist)
  788. {
  789. void **arglist = *_arglist;
  790. int arg_i = 0;
  791. int min_prio_set = 0;
  792. int max_prio_set = 0;
  793. int min_prio = 0;
  794. int max_prio = 0;
  795. int nsms = 0;
  796. int *sub_ctxs = NULL;
  797. int nsub_ctxs = 0;
  798. void *user_data = NULL;
  799. struct starpu_sched_policy *sched_policy = NULL;
  800. unsigned hierarchy_level = 0;
  801. unsigned nesting_sched_ctx = STARPU_NMAX_SCHED_CTXS;
  802. unsigned awake_workers = 0;
  803. void (*init_sched)(unsigned) = NULL;
  804. while (arglist[arg_i] != NULL)
  805. {
  806. const int arg_type = (int)(intptr_t)arglist[arg_i];
  807. if (arg_type == STARPU_SCHED_CTX_POLICY_NAME)
  808. {
  809. arg_i++;
  810. char *policy_name = arglist[arg_i];
  811. struct _starpu_machine_config *config = _starpu_get_machine_config();
  812. sched_policy = _starpu_select_sched_policy(config, policy_name);
  813. }
  814. else if (arg_type == STARPU_SCHED_CTX_POLICY_STRUCT)
  815. {
  816. arg_i++;
  817. sched_policy = arglist[arg_i];
  818. }
  819. else if (arg_type == STARPU_SCHED_CTX_POLICY_MIN_PRIO)
  820. {
  821. arg_i++;
  822. min_prio = *(int *)arglist[arg_i];
  823. min_prio_set = 1;
  824. }
  825. else if (arg_type == STARPU_SCHED_CTX_POLICY_MAX_PRIO)
  826. {
  827. arg_i++;
  828. max_prio = *(int *)arglist[arg_i];
  829. max_prio_set = 1;
  830. }
  831. else if (arg_type == STARPU_SCHED_CTX_HIERARCHY_LEVEL)
  832. {
  833. arg_i++;
  834. int val = *(int *)arglist[arg_i];
  835. STARPU_ASSERT(val >= 0);
  836. hierarchy_level = (unsigned)val;
  837. }
  838. else if (arg_type == STARPU_SCHED_CTX_NESTED)
  839. {
  840. arg_i++;
  841. int val = *(int *)arglist[arg_i];
  842. STARPU_ASSERT(val >= 0);
  843. nesting_sched_ctx = (unsigned)val;
  844. }
  845. else if (arg_type == STARPU_SCHED_CTX_AWAKE_WORKERS)
  846. {
  847. awake_workers = 1;
  848. }
  849. else if (arg_type == STARPU_SCHED_CTX_POLICY_INIT)
  850. {
  851. arg_i++;
  852. init_sched = arglist[arg_i];
  853. }
  854. else if (arg_type == STARPU_SCHED_CTX_USER_DATA)
  855. {
  856. arg_i++;
  857. user_data = arglist[arg_i];
  858. }
  859. else if (arg_type == STARPU_SCHED_CTX_SUB_CTXS)
  860. {
  861. arg_i++;
  862. sub_ctxs = (int*)arglist[arg_i];
  863. arg_i++;
  864. nsub_ctxs = *(int*)arglist[arg_i];
  865. }
  866. else if (arg_type == STARPU_SCHED_CTX_CUDA_NSMS)
  867. {
  868. arg_i++;
  869. nsms = *(int*)arglist[arg_i];
  870. }
  871. else
  872. {
  873. STARPU_ABORT_MSG("Unrecognized argument %d\n", arg_type);
  874. }
  875. arg_i++;
  876. }
  877. if (workerids && nworkers != -1)
  878. {
  879. /* Make sure the user doesn't use invalid worker IDs. */
  880. int num_workers = starpu_worker_get_count();
  881. int i;
  882. for (i = 0; i < nworkers; i++)
  883. {
  884. if (workerids[i] < 0 || workerids[i] >= num_workers)
  885. {
  886. _STARPU_ERROR("Invalid worker ID (%d) specified!\n", workerids[i]);
  887. return STARPU_NMAX_SCHED_CTXS;
  888. }
  889. }
  890. }
  891. struct _starpu_sched_ctx *sched_ctx = NULL;
  892. sched_ctx = _starpu_create_sched_ctx(sched_policy, workerids, nworkers, 0, sched_ctx_name, min_prio_set, min_prio, max_prio_set, max_prio, awake_workers, init_sched, user_data, nsub_ctxs, sub_ctxs, nsms);
  893. sched_ctx->hierarchy_level = hierarchy_level;
  894. sched_ctx->nesting_sched_ctx = nesting_sched_ctx;
  895. int *added_workerids;
  896. unsigned nw_ctx = starpu_sched_ctx_get_workers_list(sched_ctx->id, &added_workerids);
  897. _starpu_update_workers_with_ctx(added_workerids, nw_ctx, sched_ctx->id);
  898. free(added_workerids);
  899. #ifdef STARPU_USE_SC_HYPERVISOR
  900. sched_ctx->perf_counters = NULL;
  901. #endif
  902. return (int)sched_ctx->id;
  903. }
  904. void starpu_sched_ctx_register_close_callback(unsigned sched_ctx_id, void (*close_callback)(unsigned sched_ctx_id, void* args), void *args)
  905. {
  906. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  907. sched_ctx->close_callback = close_callback;
  908. sched_ctx->close_args = args;
  909. return;
  910. }
  911. #ifdef STARPU_USE_SC_HYPERVISOR
  912. void starpu_sched_ctx_set_perf_counters(unsigned sched_ctx_id, void* perf_counters)
  913. {
  914. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  915. sched_ctx->perf_counters = (struct starpu_sched_ctx_performance_counters *)perf_counters;
  916. return;
  917. }
  918. #endif
  919. /* free all structures for the context */
  920. static void _starpu_delete_sched_ctx(struct _starpu_sched_ctx *sched_ctx)
  921. {
  922. STARPU_ASSERT(sched_ctx->id != STARPU_NMAX_SCHED_CTXS);
  923. struct _starpu_machine_config *config = _starpu_get_machine_config();
  924. if(sched_ctx->sched_policy)
  925. {
  926. _starpu_deinit_sched_policy(sched_ctx);
  927. free(sched_ctx->sched_policy);
  928. sched_ctx->sched_policy = NULL;
  929. }
  930. else
  931. {
  932. starpu_sched_ctx_delete_worker_collection(sched_ctx->id);
  933. }
  934. if (sched_ctx->perf_arch.devices)
  935. {
  936. free(sched_ctx->perf_arch.devices);
  937. sched_ctx->perf_arch.devices = NULL;
  938. }
  939. sched_ctx->min_priority_is_set = 0;
  940. sched_ctx->max_priority_is_set = 0;
  941. sched_ctx->id = STARPU_NMAX_SCHED_CTXS;
  942. #ifdef STARPU_HAVE_HWLOC
  943. hwloc_bitmap_free(sched_ctx->hwloc_workers_set);
  944. #endif //STARPU_HAVE_HWLOC
  945. STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx_manag);
  946. config->topology.nsched_ctxs--;
  947. STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx_manag);
  948. }
  949. void starpu_sched_ctx_delete(unsigned sched_ctx_id)
  950. {
  951. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  952. STARPU_ASSERT(sched_ctx);
  953. #ifdef STARPU_USE_SC_HYPERVISOR
  954. if (sched_ctx_id != 0 && sched_ctx_id != STARPU_NMAX_SCHED_CTXS && sched_ctx->perf_counters != NULL)
  955. {
  956. _STARPU_TRACE_HYPERVISOR_BEGIN();
  957. sched_ctx->perf_counters->notify_delete_context(sched_ctx_id);
  958. _STARPU_TRACE_HYPERVISOR_END();
  959. }
  960. #endif //STARPU_USE_SC_HYPERVISOR
  961. _starpu_sched_ctx_lock_write(sched_ctx_id);
  962. unsigned inheritor_sched_ctx_id = sched_ctx->inheritor;
  963. struct _starpu_sched_ctx *inheritor_sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx->inheritor);
  964. STARPU_ASSERT(sched_ctx->id != STARPU_NMAX_SCHED_CTXS);
  965. int *workerids;
  966. unsigned nworkers_ctx = starpu_sched_ctx_get_workers_list(sched_ctx->id, &workerids);
  967. int backup_workerids[nworkers_ctx];
  968. memcpy(backup_workerids, workerids, nworkers_ctx*sizeof(backup_workerids[0]));
  969. notify_workers_about_changing_ctx_pending(nworkers_ctx, backup_workerids);
  970. /*if both of them have all the ressources is pointless*/
  971. /*trying to transfer ressources from one ctx to the other*/
  972. struct _starpu_machine_config *config = _starpu_get_machine_config();
  973. unsigned nworkers = config->topology.nworkers;
  974. if(nworkers_ctx > 0 && inheritor_sched_ctx && inheritor_sched_ctx->id != STARPU_NMAX_SCHED_CTXS &&
  975. !(nworkers_ctx == nworkers && nworkers_ctx == inheritor_sched_ctx->workers->nworkers))
  976. {
  977. add_notified_workers(workerids, nworkers_ctx, inheritor_sched_ctx_id);
  978. starpu_sched_ctx_set_priority_on_level(workerids, nworkers_ctx, inheritor_sched_ctx_id, 1);
  979. }
  980. if(!_starpu_wait_for_all_tasks_of_sched_ctx(sched_ctx_id))
  981. {
  982. if(!sched_ctx->sched_policy)
  983. _starpu_sched_ctx_unblock_workers_in_parallel(sched_ctx_id, 0);
  984. /*if btw the mutex release & the mutex lock the context has changed take care to free all
  985. scheduling data before deleting the context */
  986. /* announce upcoming context changes, then wait for sched_op operations to
  987. * complete before altering the sched_ctx under sched_mutex protection */
  988. _starpu_update_notified_workers_without_ctx(workerids, nworkers_ctx, sched_ctx_id, 1);
  989. _starpu_sched_ctx_free_scheduling_data(sched_ctx);
  990. _starpu_delete_sched_ctx(sched_ctx);
  991. }
  992. notify_workers_about_changing_ctx_done(nworkers_ctx, backup_workerids);
  993. _starpu_sched_ctx_unlock_write(sched_ctx_id);
  994. /* workerids is malloc-ed in starpu_sched_ctx_get_workers_list, don't forget to free it when
  995. you don't use it anymore */
  996. free(workerids);
  997. occupied_sms -= sched_ctx->nsms;
  998. return;
  999. }
  1000. /* called after the workers are terminated so we don't have anything else to do but free the memory*/
  1001. void _starpu_delete_all_sched_ctxs()
  1002. {
  1003. unsigned i;
  1004. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  1005. {
  1006. _starpu_sched_ctx_lock_write(i);
  1007. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(i);
  1008. if(sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  1009. {
  1010. _starpu_sched_ctx_free_scheduling_data(sched_ctx);
  1011. _starpu_barrier_counter_destroy(&sched_ctx->tasks_barrier);
  1012. _starpu_barrier_counter_destroy(&sched_ctx->ready_tasks_barrier);
  1013. _starpu_sched_ctx_unlock_write(i);
  1014. STARPU_PTHREAD_RWLOCK_DESTROY(&sched_ctx->rwlock);
  1015. _starpu_delete_sched_ctx(sched_ctx);
  1016. }
  1017. else
  1018. {
  1019. _starpu_sched_ctx_unlock_write(i);
  1020. STARPU_PTHREAD_RWLOCK_DESTROY(&sched_ctx->rwlock);
  1021. }
  1022. }
  1023. STARPU_PTHREAD_KEY_DELETE(sched_ctx_key);
  1024. return;
  1025. }
  1026. static void _starpu_check_workers(int *workerids, int nworkers)
  1027. {
  1028. struct _starpu_machine_config *config = _starpu_get_machine_config();
  1029. int nworkers_conf = config->topology.nworkers;
  1030. int i;
  1031. for(i = 0; i < nworkers; i++)
  1032. {
  1033. /* take care the user does not ask for a resource that does not exist */
  1034. STARPU_ASSERT_MSG(workerids[i] >= 0 && workerids[i] <= nworkers_conf, "requested to add workerid = %d, but that is beyond the range 0 to %d", workerids[i], nworkers_conf);
  1035. }
  1036. }
  1037. /* ctx_mutex must be held when calling this function */
  1038. static void fetch_tasks_from_empty_ctx_list(struct _starpu_sched_ctx *sched_ctx)
  1039. {
  1040. while(!starpu_task_list_empty(&sched_ctx->empty_ctx_tasks))
  1041. {
  1042. struct starpu_task *old_task = starpu_task_list_pop_back(&sched_ctx->empty_ctx_tasks);
  1043. if(old_task == &stop_submission_task)
  1044. break;
  1045. /* if no workers are able to execute the task, it will be put
  1046. * in the empty_ctx_tasks list forever again */
  1047. unsigned nworkers = _starpu_nworkers_able_to_execute_task(old_task, sched_ctx);
  1048. STARPU_ASSERT(nworkers > 0);
  1049. int ret = _starpu_push_task_to_workers(old_task);
  1050. /* if we should stop poping from empty ctx tasks */
  1051. if(ret == -EAGAIN) break;
  1052. }
  1053. }
  1054. unsigned _starpu_can_push_task(struct _starpu_sched_ctx *sched_ctx, struct starpu_task *task)
  1055. {
  1056. if(sched_ctx->sched_policy && sched_ctx->sched_policy->simulate_push_task)
  1057. {
  1058. if (window_size == 0.0) return 1;
  1059. _starpu_sched_ctx_lock_read(sched_ctx->id);
  1060. double expected_end = sched_ctx->sched_policy->simulate_push_task(task);
  1061. _starpu_sched_ctx_unlock_read(sched_ctx->id);
  1062. double expected_len = 0.0;
  1063. if(hyp_actual_start_sample[sched_ctx->id] != 0.0)
  1064. expected_len = expected_end - hyp_actual_start_sample[sched_ctx->id] ;
  1065. else
  1066. {
  1067. printf("%d: sc start is 0.0\n", sched_ctx->id);
  1068. expected_len = expected_end - starpu_timing_now();
  1069. }
  1070. if(expected_len < 0.0)
  1071. printf("exp len negative %lf \n", expected_len);
  1072. expected_len /= 1000000.0;
  1073. // printf("exp_end %lf start %lf expected_len %lf \n", expected_end, hyp_actual_start_sample[sched_ctx->id], expected_len);
  1074. if(expected_len > (window_size + 0.2*window_size))
  1075. return 0;
  1076. }
  1077. return 1;
  1078. }
  1079. void _starpu_fetch_task_from_waiting_list(struct _starpu_sched_ctx *sched_ctx)
  1080. {
  1081. if(starpu_task_list_empty(&sched_ctx->waiting_tasks))
  1082. return;
  1083. struct starpu_task *old_task = starpu_task_list_back(&sched_ctx->waiting_tasks);
  1084. if(_starpu_can_push_task(sched_ctx, old_task))
  1085. {
  1086. old_task = starpu_task_list_pop_back(&sched_ctx->waiting_tasks);
  1087. _starpu_push_task_to_workers(old_task);
  1088. }
  1089. return;
  1090. }
  1091. void _starpu_push_task_to_waiting_list(struct _starpu_sched_ctx *sched_ctx, struct starpu_task *task)
  1092. {
  1093. starpu_task_list_push_front(&sched_ctx->waiting_tasks, task);
  1094. return;
  1095. }
  1096. static void set_priority_on_level_on_notified_workers(int* workers_to_add, unsigned nworkers_to_add, unsigned sched_ctx, unsigned priority)
  1097. {
  1098. (void) workers_to_add;
  1099. (void) nworkers_to_add;
  1100. (void) sched_ctx;
  1101. (void) priority;
  1102. }
  1103. void starpu_sched_ctx_set_priority_on_level(int* workers_to_add, unsigned nworkers_to_add, unsigned sched_ctx, unsigned priority)
  1104. {
  1105. (void) workers_to_add;
  1106. (void) nworkers_to_add;
  1107. (void) sched_ctx;
  1108. (void) priority;
  1109. /* int w; */
  1110. /* struct _starpu_worker *worker = NULL; */
  1111. /* for(w = 0; w < nworkers_to_add; w++) */
  1112. /* { */
  1113. /* worker = _starpu_get_worker_struct(workers_to_add[w]); */
  1114. /* STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex); */
  1115. /* struct _starpu_sched_ctx_list *l = NULL; */
  1116. /* for (l = worker->sched_ctx_list; l; l = l->next) */
  1117. /* { */
  1118. /* if(l->sched_ctx != STARPU_NMAX_SCHED_CTXS && l->sched_ctx != sched_ctx && */
  1119. /* starpu_sched_ctx_get_hierarchy_level(l->sched_ctx) == starpu_sched_ctx_get_hierarchy_level(sched_ctx)) */
  1120. /* { */
  1121. /* /\* the lock is taken inside the func *\/ */
  1122. /* STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex); */
  1123. /* starpu_sched_ctx_set_priority(&workers_to_add[w], 1, l->sched_ctx, priority); */
  1124. /* STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex); */
  1125. /* } */
  1126. /* } */
  1127. /* STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex); */
  1128. /* } */
  1129. /* return; */
  1130. }
  1131. static void set_priority_hierarchically_on_notified_workers(int* workers_to_add, unsigned nworkers_to_add, unsigned sched_ctx, unsigned priority)
  1132. {
  1133. if(starpu_sched_ctx_get_hierarchy_level(sched_ctx) > 0)
  1134. {
  1135. unsigned father = starpu_sched_ctx_get_inheritor(sched_ctx);
  1136. set_priority_on_notified_workers(workers_to_add, nworkers_to_add, father, priority);
  1137. set_priority_on_level_on_notified_workers(workers_to_add, nworkers_to_add, father, priority);
  1138. set_priority_hierarchically_on_notified_workers(workers_to_add, nworkers_to_add, father, priority);
  1139. }
  1140. return;
  1141. }
  1142. static void add_notified_workers(int *workerids, int nworkers, unsigned sched_ctx_id)
  1143. {
  1144. if (!nworkers)
  1145. return;
  1146. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1147. /* if the context has not already been deleted */
  1148. if(sched_ctx->id == STARPU_NMAX_SCHED_CTXS)
  1149. return;
  1150. int added_workers[nworkers];
  1151. int n_added_workers = 0;
  1152. {
  1153. struct starpu_worker_collection *workers = sched_ctx->workers;
  1154. int i = 0;
  1155. for(i = 0; i < nworkers; i++)
  1156. {
  1157. int workerid = workers->add(workers, workerids[i]);
  1158. if(workerid >= 0)
  1159. {
  1160. added_workers[n_added_workers] = workerid;
  1161. n_added_workers++;
  1162. }
  1163. else
  1164. {
  1165. struct _starpu_worker *worker = _starpu_get_worker_struct(workerids[i]);
  1166. worker->removed_from_ctx[sched_ctx->id] = 0;
  1167. }
  1168. }
  1169. }
  1170. _do_add_notified_workers(sched_ctx, workerids, nworkers);
  1171. if(n_added_workers > 0)
  1172. {
  1173. if(sched_ctx->sched_policy && sched_ctx->sched_policy->add_workers)
  1174. {
  1175. _STARPU_SCHED_BEGIN;
  1176. sched_ctx->sched_policy->add_workers(sched_ctx->id, added_workers, n_added_workers);
  1177. _STARPU_SCHED_END;
  1178. }
  1179. _starpu_update_notified_workers_with_ctx(added_workers, n_added_workers, sched_ctx->id);
  1180. }
  1181. set_priority_on_notified_workers(workerids, nworkers, sched_ctx_id, 1);
  1182. set_priority_hierarchically_on_notified_workers(workerids, nworkers, sched_ctx_id, 0);
  1183. fetch_tasks_from_empty_ctx_list(sched_ctx);
  1184. }
  1185. void starpu_sched_ctx_add_workers(int *workers_to_add, int nworkers_to_add, unsigned sched_ctx_id)
  1186. {
  1187. STARPU_ASSERT(workers_to_add != NULL && nworkers_to_add > 0);
  1188. _starpu_check_workers(workers_to_add, nworkers_to_add);
  1189. _starpu_sched_ctx_lock_write(sched_ctx_id);
  1190. notify_workers_about_changing_ctx_pending(nworkers_to_add, workers_to_add);
  1191. add_notified_workers(workers_to_add, nworkers_to_add, sched_ctx_id);
  1192. notify_workers_about_changing_ctx_done(nworkers_to_add, workers_to_add);
  1193. _starpu_sched_ctx_unlock_write(sched_ctx_id);
  1194. }
  1195. void starpu_sched_ctx_remove_workers(int *workers_to_remove, int nworkers_to_remove, unsigned sched_ctx_id)
  1196. {
  1197. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1198. _starpu_check_workers(workers_to_remove, nworkers_to_remove);
  1199. _starpu_sched_ctx_lock_write(sched_ctx_id);
  1200. /* if the context has not already been deleted */
  1201. if(sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  1202. {
  1203. int removed_workers[sched_ctx->workers->nworkers];
  1204. int n_removed_workers = 0;
  1205. notify_workers_about_changing_ctx_pending(nworkers_to_remove, workers_to_remove);
  1206. _starpu_remove_workers_from_sched_ctx(sched_ctx, workers_to_remove, nworkers_to_remove, removed_workers, &n_removed_workers);
  1207. if(n_removed_workers > 0)
  1208. {
  1209. _starpu_update_notified_workers_without_ctx(removed_workers, n_removed_workers, sched_ctx_id, 0);
  1210. set_priority_on_notified_workers(removed_workers, n_removed_workers, sched_ctx_id, 1);
  1211. }
  1212. notify_workers_about_changing_ctx_done(nworkers_to_remove, workers_to_remove);
  1213. }
  1214. _starpu_sched_ctx_unlock_write(sched_ctx_id);
  1215. return;
  1216. }
  1217. int _starpu_nworkers_able_to_execute_task(struct starpu_task *task, struct _starpu_sched_ctx *sched_ctx)
  1218. {
  1219. unsigned nworkers = 0;
  1220. _starpu_sched_ctx_lock_read(sched_ctx->id);
  1221. struct starpu_worker_collection *workers = sched_ctx->workers;
  1222. struct starpu_sched_ctx_iterator it;
  1223. workers->init_iterator_for_parallel_tasks(workers, &it, task);
  1224. while(workers->has_next(workers, &it))
  1225. {
  1226. unsigned worker = workers->get_next(workers, &it);
  1227. STARPU_ASSERT_MSG(worker < STARPU_NMAXWORKERS, "worker id %d", worker);
  1228. if (starpu_worker_can_execute_task_first_impl(worker, task, NULL))
  1229. nworkers++;
  1230. }
  1231. _starpu_sched_ctx_unlock_read(sched_ctx->id);
  1232. return nworkers;
  1233. }
  1234. /* unused sched_ctx have the id STARPU_NMAX_SCHED_CTXS */
  1235. void _starpu_init_all_sched_ctxs(struct _starpu_machine_config *config)
  1236. {
  1237. STARPU_PTHREAD_KEY_CREATE(&sched_ctx_key, NULL);
  1238. window_size = starpu_get_env_float_default("STARPU_WINDOW_TIME_SIZE", 0.0);
  1239. nobind = starpu_get_env_number("STARPU_WORKERS_NOBIND");
  1240. unsigned i;
  1241. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  1242. config->sched_ctxs[i].id = STARPU_NMAX_SCHED_CTXS;
  1243. return;
  1244. }
  1245. /* sched_ctx aren't necessarly one next to another */
  1246. /* for eg when we remove one its place is free */
  1247. /* when we add new one we reuse its place */
  1248. static unsigned _starpu_get_first_free_sched_ctx(struct _starpu_machine_config *config)
  1249. {
  1250. unsigned i;
  1251. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  1252. if(config->sched_ctxs[i].id == STARPU_NMAX_SCHED_CTXS)
  1253. return i;
  1254. STARPU_ASSERT(0);
  1255. return STARPU_NMAX_SCHED_CTXS;
  1256. }
  1257. int _starpu_wait_for_all_tasks_of_sched_ctx(unsigned sched_ctx_id)
  1258. {
  1259. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1260. STARPU_ASSERT_MSG(_starpu_worker_may_perform_blocking_calls(), "starpu_task_wait_for_all must not be called from a task or callback");
  1261. _starpu_barrier_counter_wait_for_empty_counter(&sched_ctx->tasks_barrier);
  1262. return 0;
  1263. }
  1264. int _starpu_wait_for_n_submitted_tasks_of_sched_ctx(unsigned sched_ctx_id, unsigned n)
  1265. {
  1266. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1267. STARPU_ASSERT_MSG(_starpu_worker_may_perform_blocking_calls(), "starpu_task_wait_for_n_submitted_tasks must not be called from a task or callback");
  1268. return _starpu_barrier_counter_wait_until_counter_reaches_down_to_n(&sched_ctx->tasks_barrier, n);
  1269. }
  1270. void _starpu_decrement_nsubmitted_tasks_of_sched_ctx(unsigned sched_ctx_id)
  1271. {
  1272. struct _starpu_machine_config *config = _starpu_get_machine_config();
  1273. #ifndef STARPU_SANITIZE_THREAD
  1274. if (!config->watchdog_ok)
  1275. config->watchdog_ok = 1;
  1276. #endif
  1277. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1278. int reached = _starpu_barrier_counter_get_reached_start(&sched_ctx->tasks_barrier);
  1279. int finished = reached == 1;
  1280. /* when finished decrementing the tasks if the user signaled he will not submit tasks anymore
  1281. we can move all its workers to the inheritor context */
  1282. if(finished && sched_ctx->inheritor != STARPU_NMAX_SCHED_CTXS)
  1283. {
  1284. STARPU_PTHREAD_MUTEX_LOCK(&finished_submit_mutex);
  1285. if(sched_ctx->finished_submit)
  1286. {
  1287. STARPU_PTHREAD_MUTEX_UNLOCK(&finished_submit_mutex);
  1288. if(sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  1289. {
  1290. if(sched_ctx->close_callback)
  1291. sched_ctx->close_callback(sched_ctx->id, sched_ctx->close_args);
  1292. int *workerids = NULL;
  1293. unsigned nworkers = starpu_sched_ctx_get_workers_list(sched_ctx->id, &workerids);
  1294. if(nworkers > 0)
  1295. {
  1296. starpu_sched_ctx_add_workers(workerids, nworkers, sched_ctx->inheritor);
  1297. free(workerids);
  1298. }
  1299. }
  1300. _starpu_barrier_counter_decrement_until_empty_counter(&sched_ctx->tasks_barrier, 0.0);
  1301. return;
  1302. }
  1303. STARPU_PTHREAD_MUTEX_UNLOCK(&finished_submit_mutex);
  1304. }
  1305. /* We also need to check for config->submitting = 0 (i.e. the
  1306. * user calle starpu_drivers_request_termination()), in which
  1307. * case we need to set config->running to 0 and wake workers,
  1308. * so they can terminate, just like
  1309. * starpu_drivers_request_termination() does.
  1310. */
  1311. STARPU_PTHREAD_MUTEX_LOCK(&config->submitted_mutex);
  1312. if(config->submitting == 0)
  1313. {
  1314. if(sched_ctx->id != STARPU_NMAX_SCHED_CTXS)
  1315. {
  1316. if(sched_ctx->close_callback)
  1317. sched_ctx->close_callback(sched_ctx->id, sched_ctx->close_args);
  1318. }
  1319. ANNOTATE_HAPPENS_AFTER(&config->running);
  1320. config->running = 0;
  1321. ANNOTATE_HAPPENS_BEFORE(&config->running);
  1322. int s;
  1323. for(s = 0; s < STARPU_NMAX_SCHED_CTXS; s++)
  1324. {
  1325. if(config->sched_ctxs[s].id != STARPU_NMAX_SCHED_CTXS)
  1326. {
  1327. _starpu_check_nsubmitted_tasks_of_sched_ctx(config->sched_ctxs[s].id);
  1328. }
  1329. }
  1330. }
  1331. STARPU_PTHREAD_MUTEX_UNLOCK(&config->submitted_mutex);
  1332. _starpu_barrier_counter_decrement_until_empty_counter(&sched_ctx->tasks_barrier, 0.0);
  1333. return;
  1334. }
  1335. void _starpu_increment_nsubmitted_tasks_of_sched_ctx(unsigned sched_ctx_id)
  1336. {
  1337. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1338. _starpu_barrier_counter_increment(&sched_ctx->tasks_barrier, 0.0);
  1339. }
  1340. int _starpu_get_nsubmitted_tasks_of_sched_ctx(unsigned sched_ctx_id)
  1341. {
  1342. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1343. return _starpu_barrier_counter_get_reached_start(&sched_ctx->tasks_barrier);
  1344. }
  1345. int _starpu_check_nsubmitted_tasks_of_sched_ctx(unsigned sched_ctx_id)
  1346. {
  1347. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1348. return _starpu_barrier_counter_check(&sched_ctx->tasks_barrier);
  1349. }
  1350. unsigned _starpu_increment_nready_tasks_of_sched_ctx(unsigned sched_ctx_id, double ready_flops, struct starpu_task *task)
  1351. {
  1352. unsigned ret = 1;
  1353. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1354. if(!sched_ctx->is_initial_sched)
  1355. {
  1356. _starpu_sched_ctx_lock_write(sched_ctx->id);
  1357. }
  1358. _starpu_barrier_counter_increment(&sched_ctx->ready_tasks_barrier, ready_flops);
  1359. if(!sched_ctx->is_initial_sched)
  1360. {
  1361. if(!_starpu_can_push_task(sched_ctx, task))
  1362. {
  1363. _starpu_push_task_to_waiting_list(sched_ctx, task);
  1364. ret = 0;
  1365. }
  1366. _starpu_sched_ctx_unlock_write(sched_ctx->id);
  1367. }
  1368. return ret;
  1369. }
  1370. void _starpu_decrement_nready_tasks_of_sched_ctx_locked(unsigned sched_ctx_id, double ready_flops)
  1371. {
  1372. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1373. _starpu_barrier_counter_decrement_until_empty_counter(&sched_ctx->ready_tasks_barrier, ready_flops);
  1374. }
  1375. void _starpu_decrement_nready_tasks_of_sched_ctx(unsigned sched_ctx_id, double ready_flops)
  1376. {
  1377. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1378. if(!sched_ctx->is_initial_sched)
  1379. {
  1380. _starpu_sched_ctx_lock_write(sched_ctx->id);
  1381. }
  1382. _starpu_barrier_counter_decrement_until_empty_counter(&sched_ctx->ready_tasks_barrier, ready_flops);
  1383. if(!sched_ctx->is_initial_sched)
  1384. {
  1385. _starpu_fetch_task_from_waiting_list(sched_ctx);
  1386. _starpu_sched_ctx_unlock_write(sched_ctx->id);
  1387. }
  1388. }
  1389. int starpu_sched_ctx_get_nready_tasks(unsigned sched_ctx_id)
  1390. {
  1391. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1392. return _starpu_barrier_counter_get_reached_start(&sched_ctx->ready_tasks_barrier);
  1393. }
  1394. double starpu_sched_ctx_get_nready_flops(unsigned sched_ctx_id)
  1395. {
  1396. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1397. return _starpu_barrier_counter_get_reached_flops(&sched_ctx->ready_tasks_barrier);
  1398. }
  1399. int _starpu_wait_for_no_ready_of_sched_ctx(unsigned sched_ctx_id)
  1400. {
  1401. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1402. _starpu_barrier_counter_wait_for_empty_counter(&sched_ctx->ready_tasks_barrier);
  1403. return 0;
  1404. }
  1405. void starpu_sched_ctx_set_context(unsigned *sched_ctx)
  1406. {
  1407. starpu_pthread_setspecific(sched_ctx_key, (void*)sched_ctx);
  1408. }
  1409. unsigned starpu_sched_ctx_get_context()
  1410. {
  1411. unsigned *sched_ctx = (unsigned*)starpu_pthread_getspecific(sched_ctx_key);
  1412. if(sched_ctx == NULL)
  1413. return STARPU_NMAX_SCHED_CTXS;
  1414. STARPU_ASSERT(*sched_ctx < STARPU_NMAX_SCHED_CTXS);
  1415. return *sched_ctx;
  1416. }
  1417. unsigned _starpu_sched_ctx_get_current_context()
  1418. {
  1419. unsigned sched_ctx = starpu_sched_ctx_get_context();
  1420. if (sched_ctx == STARPU_NMAX_SCHED_CTXS)
  1421. return _starpu_get_initial_sched_ctx()->id;
  1422. else
  1423. return sched_ctx;
  1424. }
  1425. void starpu_sched_ctx_notify_hypervisor_exists()
  1426. {
  1427. with_hypervisor = 1;
  1428. int i, j;
  1429. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  1430. {
  1431. hyp_start_sample[i] = starpu_timing_now();
  1432. hyp_start_allow_sample[i] = 0.0;
  1433. for(j = 0; j < STARPU_NMAXWORKERS; j++)
  1434. {
  1435. flops[i][j] = 0.0;
  1436. data_size[i][j] = 0;
  1437. }
  1438. hyp_actual_start_sample[i] = 0.0;
  1439. }
  1440. }
  1441. unsigned starpu_sched_ctx_check_if_hypervisor_exists()
  1442. {
  1443. return with_hypervisor;
  1444. }
  1445. void starpu_sched_ctx_update_start_resizing_sample(unsigned sched_ctx_id, double start_sample)
  1446. {
  1447. hyp_actual_start_sample[sched_ctx_id] = start_sample;
  1448. }
  1449. unsigned _starpu_sched_ctx_allow_hypervisor(unsigned sched_ctx_id)
  1450. {
  1451. (void) sched_ctx_id;
  1452. return 1;
  1453. #if 0
  1454. double now = starpu_timing_now();
  1455. if(hyp_start_allow_sample[sched_ctx_id] > 0.0)
  1456. {
  1457. double allow_sample = (now - hyp_start_allow_sample[sched_ctx_id]) / 1000000.0;
  1458. if(allow_sample < 0.001)
  1459. return 1;
  1460. else
  1461. {
  1462. hyp_start_allow_sample[sched_ctx_id] = 0.0;
  1463. hyp_start_sample[sched_ctx_id] = starpu_timing_now();
  1464. return 0;
  1465. }
  1466. }
  1467. double forbid_sample = (now - hyp_start_sample[sched_ctx_id]) / 1000000.0;
  1468. if(forbid_sample > 0.01)
  1469. {
  1470. // hyp_start_sample[sched_ctx_id] = starpu_timing_now();
  1471. hyp_start_allow_sample[sched_ctx_id] = starpu_timing_now();
  1472. return 1;
  1473. }
  1474. return 0;
  1475. #endif
  1476. }
  1477. void starpu_sched_ctx_set_policy_data(unsigned sched_ctx_id, void* policy_data)
  1478. {
  1479. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1480. sched_ctx->policy_data = policy_data;
  1481. }
  1482. void* starpu_sched_ctx_get_policy_data(unsigned sched_ctx_id)
  1483. {
  1484. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1485. return sched_ctx->policy_data;
  1486. }
  1487. struct starpu_sched_policy *starpu_sched_ctx_get_sched_policy(unsigned sched_ctx_id)
  1488. {
  1489. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1490. return sched_ctx->sched_policy;
  1491. }
  1492. struct starpu_worker_collection* starpu_sched_ctx_create_worker_collection(unsigned sched_ctx_id, enum starpu_worker_collection_type worker_collection_type)
  1493. {
  1494. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1495. _STARPU_MALLOC(sched_ctx->workers, sizeof(struct starpu_worker_collection));
  1496. switch(worker_collection_type)
  1497. {
  1498. #ifdef STARPU_HAVE_HWLOC
  1499. case STARPU_WORKER_TREE:
  1500. sched_ctx->workers->has_next = worker_tree.has_next;
  1501. sched_ctx->workers->get_next = worker_tree.get_next;
  1502. sched_ctx->workers->add = worker_tree.add;
  1503. sched_ctx->workers->remove = worker_tree.remove;
  1504. sched_ctx->workers->init = worker_tree.init;
  1505. sched_ctx->workers->deinit = worker_tree.deinit;
  1506. sched_ctx->workers->init_iterator = worker_tree.init_iterator;
  1507. sched_ctx->workers->init_iterator_for_parallel_tasks = worker_tree.init_iterator_for_parallel_tasks;
  1508. sched_ctx->workers->type = STARPU_WORKER_TREE;
  1509. break;
  1510. #endif
  1511. // case STARPU_WORKER_LIST:
  1512. default:
  1513. sched_ctx->workers->has_next = worker_list.has_next;
  1514. sched_ctx->workers->get_next = worker_list.get_next;
  1515. sched_ctx->workers->add = worker_list.add;
  1516. sched_ctx->workers->remove = worker_list.remove;
  1517. sched_ctx->workers->init = worker_list.init;
  1518. sched_ctx->workers->deinit = worker_list.deinit;
  1519. sched_ctx->workers->init_iterator = worker_list.init_iterator;
  1520. sched_ctx->workers->init_iterator_for_parallel_tasks = worker_list.init_iterator_for_parallel_tasks;
  1521. sched_ctx->workers->type = STARPU_WORKER_LIST;
  1522. break;
  1523. }
  1524. /* construct the collection of workers(list/tree/etc.) */
  1525. sched_ctx->workers->init(sched_ctx->workers);
  1526. return sched_ctx->workers;
  1527. }
  1528. void starpu_sched_ctx_display_workers(unsigned sched_ctx_id, FILE *f)
  1529. {
  1530. int *workerids = NULL;
  1531. unsigned nworkers;
  1532. unsigned i;
  1533. nworkers = starpu_sched_ctx_get_workers_list(sched_ctx_id, &workerids);
  1534. fprintf(f, "[sched_ctx %u]: %u worker%s\n", sched_ctx_id, nworkers, nworkers>1?"s":"");
  1535. for (i = 0; i < nworkers; i++)
  1536. {
  1537. char name[256];
  1538. starpu_worker_get_name(workerids[i], name, 256);
  1539. fprintf(f, "\t\t%s\n", name);
  1540. }
  1541. free(workerids);
  1542. }
  1543. unsigned starpu_sched_ctx_get_workers_list_raw(unsigned sched_ctx_id, int **workerids)
  1544. {
  1545. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1546. *workerids = sched_ctx->workers->workerids;
  1547. return sched_ctx->workers->nworkers;
  1548. }
  1549. unsigned starpu_sched_ctx_get_workers_list(unsigned sched_ctx_id, int **workerids)
  1550. {
  1551. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1552. struct starpu_worker_collection *workers = sched_ctx->workers;
  1553. unsigned nworkers = 0;
  1554. struct starpu_sched_ctx_iterator it;
  1555. if(!workers) return 0;
  1556. _STARPU_MALLOC(*workerids, workers->nworkers*sizeof(int));
  1557. workers->init_iterator(workers, &it);
  1558. while(workers->has_next(workers, &it))
  1559. {
  1560. int worker = workers->get_next(workers, &it);
  1561. (*workerids)[nworkers++] = worker;
  1562. }
  1563. return nworkers;
  1564. }
  1565. void starpu_sched_ctx_delete_worker_collection(unsigned sched_ctx_id)
  1566. {
  1567. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1568. sched_ctx->workers->deinit(sched_ctx->workers);
  1569. free(sched_ctx->workers);
  1570. sched_ctx->workers = NULL;
  1571. }
  1572. struct starpu_worker_collection* starpu_sched_ctx_get_worker_collection(unsigned sched_ctx_id)
  1573. {
  1574. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1575. return sched_ctx->workers;
  1576. }
  1577. int _starpu_get_workers_of_sched_ctx(unsigned sched_ctx_id, int *pus, enum starpu_worker_archtype arch)
  1578. {
  1579. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1580. struct starpu_worker_collection *workers = sched_ctx->workers;
  1581. int npus = 0;
  1582. struct starpu_sched_ctx_iterator it;
  1583. workers->init_iterator(workers, &it);
  1584. while(workers->has_next(workers, &it))
  1585. {
  1586. int worker = workers->get_next(workers, &it);
  1587. enum starpu_worker_archtype curr_arch = starpu_worker_get_type(worker);
  1588. if(curr_arch == arch || arch == STARPU_ANY_WORKER)
  1589. pus[npus++] = worker;
  1590. }
  1591. return npus;
  1592. }
  1593. unsigned starpu_sched_ctx_get_nworkers(unsigned sched_ctx_id)
  1594. {
  1595. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1596. if(sched_ctx != NULL)
  1597. return sched_ctx->workers->nworkers;
  1598. else
  1599. return 0;
  1600. }
  1601. unsigned starpu_sched_ctx_get_nshared_workers(unsigned sched_ctx_id, unsigned sched_ctx_id2)
  1602. {
  1603. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1604. struct _starpu_sched_ctx *sched_ctx2 = _starpu_get_sched_ctx_struct(sched_ctx_id2);
  1605. struct starpu_worker_collection *workers = sched_ctx->workers;
  1606. struct starpu_worker_collection *workers2 = sched_ctx2->workers;
  1607. int shared_workers = 0;
  1608. struct starpu_sched_ctx_iterator it1, it2;
  1609. workers->init_iterator(workers, &it1);
  1610. workers2->init_iterator(workers2, &it2);
  1611. while(workers->has_next(workers, &it1))
  1612. {
  1613. int worker = workers->get_next(workers, &it1);
  1614. while(workers2->has_next(workers2, &it2))
  1615. {
  1616. int worker2 = workers2->get_next(workers2, &it2);
  1617. if(worker == worker2)
  1618. shared_workers++;
  1619. }
  1620. }
  1621. return shared_workers;
  1622. }
  1623. unsigned starpu_sched_ctx_contains_worker(int workerid, unsigned sched_ctx_id)
  1624. {
  1625. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1626. struct starpu_worker_collection *workers = sched_ctx->workers;
  1627. if(workers)
  1628. {
  1629. unsigned i;
  1630. for (i = 0; i < workers->nworkers; i++)
  1631. if (workerid == workers->workerids[i])
  1632. return 1;
  1633. }
  1634. return 0;
  1635. }
  1636. unsigned starpu_sched_ctx_contains_type_of_worker(enum starpu_worker_archtype arch, unsigned sched_ctx_id)
  1637. {
  1638. struct starpu_worker_collection *workers = starpu_sched_ctx_get_worker_collection(sched_ctx_id);
  1639. unsigned i;
  1640. for (i = 0; i < workers->nworkers; i++)
  1641. {
  1642. int worker = workers->workerids[i];
  1643. enum starpu_worker_archtype curr_arch = starpu_worker_get_type(worker);
  1644. if(curr_arch == arch)
  1645. return 1;
  1646. }
  1647. return 0;
  1648. }
  1649. unsigned _starpu_worker_belongs_to_a_sched_ctx(int workerid, unsigned sched_ctx_id)
  1650. {
  1651. struct _starpu_machine_config *config = _starpu_get_machine_config();
  1652. int i;
  1653. for(i = 0; i < STARPU_NMAX_SCHED_CTXS; i++)
  1654. {
  1655. struct _starpu_sched_ctx *sched_ctx = &config->sched_ctxs[i];
  1656. if(sched_ctx && sched_ctx->id != STARPU_NMAX_SCHED_CTXS && sched_ctx->id != sched_ctx_id)
  1657. if(starpu_sched_ctx_contains_worker(workerid, sched_ctx->id))
  1658. return 1;
  1659. }
  1660. return 0;
  1661. }
  1662. unsigned starpu_sched_ctx_worker_get_id(unsigned sched_ctx_id)
  1663. {
  1664. int workerid = starpu_worker_get_id();
  1665. if(workerid != -1)
  1666. if(starpu_sched_ctx_contains_worker(workerid, sched_ctx_id))
  1667. return workerid;
  1668. return -1;
  1669. }
  1670. unsigned starpu_sched_ctx_get_ctx_for_task(struct starpu_task *task)
  1671. {
  1672. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(task->sched_ctx);
  1673. unsigned ret_sched_ctx = task->sched_ctx;
  1674. if (task->possibly_parallel && !sched_ctx->sched_policy
  1675. && sched_ctx->nesting_sched_ctx != STARPU_NMAX_SCHED_CTXS)
  1676. ret_sched_ctx = sched_ctx->nesting_sched_ctx;
  1677. return ret_sched_ctx;
  1678. }
  1679. unsigned starpu_sched_ctx_overlapping_ctxs_on_worker(int workerid)
  1680. {
  1681. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  1682. return worker->nsched_ctxs > 1;
  1683. }
  1684. void starpu_sched_ctx_set_inheritor(unsigned sched_ctx_id, unsigned inheritor)
  1685. {
  1686. STARPU_ASSERT(sched_ctx_id < STARPU_NMAX_SCHED_CTXS);
  1687. STARPU_ASSERT(inheritor < STARPU_NMAX_SCHED_CTXS);
  1688. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1689. sched_ctx->inheritor = inheritor;
  1690. return;
  1691. }
  1692. unsigned starpu_sched_ctx_get_inheritor(unsigned sched_ctx_id)
  1693. {
  1694. STARPU_ASSERT(sched_ctx_id < STARPU_NMAX_SCHED_CTXS);
  1695. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1696. return sched_ctx->inheritor;
  1697. }
  1698. unsigned starpu_sched_ctx_get_hierarchy_level(unsigned sched_ctx_id)
  1699. {
  1700. STARPU_ASSERT(sched_ctx_id < STARPU_NMAX_SCHED_CTXS);
  1701. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1702. return sched_ctx->hierarchy_level;
  1703. }
  1704. void starpu_sched_ctx_finished_submit(unsigned sched_ctx_id)
  1705. {
  1706. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1707. STARPU_PTHREAD_MUTEX_LOCK(&finished_submit_mutex);
  1708. sched_ctx->finished_submit = 1;
  1709. STARPU_PTHREAD_MUTEX_UNLOCK(&finished_submit_mutex);
  1710. return;
  1711. }
  1712. #ifdef STARPU_USE_SC_HYPERVISOR
  1713. void _starpu_sched_ctx_post_exec_task_cb(int workerid, struct starpu_task *task, size_t data_size2, uint32_t footprint)
  1714. {
  1715. if (workerid < 0)
  1716. return;
  1717. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(task->sched_ctx);
  1718. if(sched_ctx != NULL && task->sched_ctx != _starpu_get_initial_sched_ctx()->id &&
  1719. task->sched_ctx != STARPU_NMAX_SCHED_CTXS && sched_ctx->perf_counters != NULL)
  1720. {
  1721. flops[task->sched_ctx][workerid] += task->flops;
  1722. data_size[task->sched_ctx][workerid] += data_size2;
  1723. if(_starpu_sched_ctx_allow_hypervisor(sched_ctx->id) || task->hypervisor_tag > 0)
  1724. {
  1725. _STARPU_TRACE_HYPERVISOR_BEGIN();
  1726. sched_ctx->perf_counters->notify_post_exec_task(task, data_size[task->sched_ctx][workerid], footprint,
  1727. task->hypervisor_tag, flops[task->sched_ctx][workerid]);
  1728. _STARPU_TRACE_HYPERVISOR_END();
  1729. flops[task->sched_ctx][workerid] = 0.0;
  1730. data_size[task->sched_ctx][workerid] = 0;
  1731. }
  1732. }
  1733. }
  1734. void starpu_sched_ctx_call_pushed_task_cb(int workerid, unsigned sched_ctx_id)
  1735. {
  1736. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1737. if(sched_ctx != NULL && sched_ctx_id != _starpu_get_initial_sched_ctx()->id && sched_ctx_id != STARPU_NMAX_SCHED_CTXS
  1738. && sched_ctx->perf_counters != NULL && _starpu_sched_ctx_allow_hypervisor(sched_ctx_id))
  1739. {
  1740. _STARPU_TRACE_HYPERVISOR_BEGIN();
  1741. sched_ctx->perf_counters->notify_pushed_task(sched_ctx_id, workerid);
  1742. _STARPU_TRACE_HYPERVISOR_END();
  1743. }
  1744. }
  1745. #endif //STARPU_USE_SC_HYPERVISOR
  1746. int starpu_sched_get_min_priority(void)
  1747. {
  1748. return starpu_sched_ctx_get_min_priority(_starpu_sched_ctx_get_current_context());
  1749. }
  1750. int starpu_sched_get_max_priority(void)
  1751. {
  1752. return starpu_sched_ctx_get_max_priority(_starpu_sched_ctx_get_current_context());
  1753. }
  1754. int starpu_sched_set_min_priority(int min_prio)
  1755. {
  1756. return starpu_sched_ctx_set_min_priority(_starpu_sched_ctx_get_current_context(), min_prio);
  1757. }
  1758. int starpu_sched_set_max_priority(int max_prio)
  1759. {
  1760. return starpu_sched_ctx_set_max_priority(_starpu_sched_ctx_get_current_context(), max_prio);
  1761. }
  1762. int starpu_sched_ctx_get_min_priority(unsigned sched_ctx_id)
  1763. {
  1764. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1765. return sched_ctx->min_priority;
  1766. }
  1767. int starpu_sched_ctx_get_max_priority(unsigned sched_ctx_id)
  1768. {
  1769. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1770. return sched_ctx->max_priority;
  1771. }
  1772. int starpu_sched_ctx_set_min_priority(unsigned sched_ctx_id, int min_prio)
  1773. {
  1774. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1775. sched_ctx->min_priority = min_prio;
  1776. return 0;
  1777. }
  1778. int starpu_sched_ctx_set_max_priority(unsigned sched_ctx_id, int max_prio)
  1779. {
  1780. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1781. sched_ctx->max_priority = max_prio;
  1782. return 0;
  1783. }
  1784. int starpu_sched_ctx_min_priority_is_set(unsigned sched_ctx_id)
  1785. {
  1786. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1787. return sched_ctx->min_priority_is_set;
  1788. }
  1789. int starpu_sched_ctx_max_priority_is_set(unsigned sched_ctx_id)
  1790. {
  1791. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  1792. return sched_ctx->max_priority_is_set;
  1793. }
  1794. static void set_priority_on_notified_workers(int *workers, int nworkers, unsigned sched_ctx_id, unsigned priority)
  1795. {
  1796. if(nworkers != -1)
  1797. {
  1798. int w;
  1799. struct _starpu_worker *worker = NULL;
  1800. for(w = 0; w < nworkers; w++)
  1801. {
  1802. worker = _starpu_get_worker_struct(workers[w]);
  1803. _starpu_sched_ctx_list_move(&worker->sched_ctx_list, sched_ctx_id, priority);
  1804. }
  1805. }
  1806. }
  1807. void starpu_sched_ctx_set_priority(int *workers, int nworkers, unsigned sched_ctx_id, unsigned priority)
  1808. {
  1809. if(nworkers != -1)
  1810. {
  1811. int w;
  1812. struct _starpu_worker *worker = NULL;
  1813. for(w = 0; w < nworkers; w++)
  1814. {
  1815. worker = _starpu_get_worker_struct(workers[w]);
  1816. STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex);
  1817. _starpu_sched_ctx_list_move(&worker->sched_ctx_list, sched_ctx_id, priority);
  1818. STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex);
  1819. }
  1820. }
  1821. return;
  1822. }
  1823. unsigned starpu_sched_ctx_get_priority(int workerid, unsigned sched_ctx_id)
  1824. {
  1825. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  1826. return _starpu_sched_ctx_elt_get_priority(worker->sched_ctx_list, sched_ctx_id);
  1827. }
  1828. unsigned _starpu_sched_ctx_last_worker_awake(struct _starpu_worker *worker)
  1829. {
  1830. struct _starpu_sched_ctx_list_iterator list_it;
  1831. _starpu_sched_ctx_list_iterator_init(worker->sched_ctx_list, &list_it);
  1832. while (_starpu_sched_ctx_list_iterator_has_next(&list_it))
  1833. {
  1834. struct _starpu_sched_ctx_elt *e = _starpu_sched_ctx_list_iterator_get_next(&list_it);
  1835. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(e->sched_ctx);
  1836. unsigned last_worker_awake = 1;
  1837. struct starpu_worker_collection *workers = sched_ctx->workers;
  1838. struct starpu_sched_ctx_iterator it;
  1839. workers->init_iterator(workers, &it);
  1840. while(workers->has_next(workers, &it))
  1841. {
  1842. int workerid = workers->get_next(workers, &it);
  1843. if(workerid != worker->workerid && _starpu_worker_get_status(workerid) != STATUS_SLEEPING)
  1844. {
  1845. last_worker_awake = 0;
  1846. break;
  1847. }
  1848. }
  1849. if(last_worker_awake)
  1850. return 1;
  1851. }
  1852. return 0;
  1853. }
  1854. void starpu_sched_ctx_bind_current_thread_to_cpuid(unsigned cpuid)
  1855. {
  1856. _starpu_bind_thread_on_cpu(_starpu_get_machine_config(), cpuid, STARPU_NOWORKERID);
  1857. }
  1858. unsigned starpu_sched_ctx_worker_is_master_for_child_ctx(int workerid, unsigned sched_ctx_id)
  1859. {
  1860. if (_starpu_get_nsched_ctxs() <= 1)
  1861. return STARPU_NMAX_SCHED_CTXS;
  1862. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  1863. struct _starpu_sched_ctx_list_iterator list_it;
  1864. _starpu_sched_ctx_list_iterator_init(worker->sched_ctx_list, &list_it);
  1865. while (_starpu_sched_ctx_list_iterator_has_next(&list_it))
  1866. {
  1867. struct _starpu_sched_ctx_elt *e = _starpu_sched_ctx_list_iterator_get_next(&list_it);
  1868. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(e->sched_ctx);
  1869. if(sched_ctx-> main_master == workerid && sched_ctx->nesting_sched_ctx == sched_ctx_id)
  1870. return sched_ctx->id;
  1871. }
  1872. return STARPU_NMAX_SCHED_CTXS;
  1873. }
  1874. unsigned starpu_sched_ctx_master_get_context(int masterid)
  1875. {
  1876. struct _starpu_worker *worker = _starpu_get_worker_struct(masterid);
  1877. struct _starpu_sched_ctx_list_iterator list_it;
  1878. _starpu_sched_ctx_list_iterator_init(worker->sched_ctx_list, &list_it);
  1879. while (_starpu_sched_ctx_list_iterator_has_next(&list_it))
  1880. {
  1881. struct _starpu_sched_ctx_elt *e = _starpu_sched_ctx_list_iterator_get_next(&list_it);
  1882. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(e->sched_ctx);
  1883. if(sched_ctx->main_master == masterid)
  1884. return sched_ctx->id;
  1885. }
  1886. return STARPU_NMAX_SCHED_CTXS;
  1887. }
  1888. struct _starpu_sched_ctx *__starpu_sched_ctx_get_sched_ctx_for_worker_and_job(struct _starpu_worker *worker, struct _starpu_job *j)
  1889. {
  1890. struct _starpu_sched_ctx_list_iterator list_it;
  1891. struct _starpu_sched_ctx *ret = NULL;
  1892. STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex);
  1893. _starpu_sched_ctx_list_iterator_init(worker->sched_ctx_list, &list_it);
  1894. while (_starpu_sched_ctx_list_iterator_has_next(&list_it))
  1895. {
  1896. struct _starpu_sched_ctx_elt *e = _starpu_sched_ctx_list_iterator_get_next(&list_it);
  1897. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(e->sched_ctx);
  1898. if (j->task->sched_ctx == sched_ctx->id)
  1899. {
  1900. ret = sched_ctx;
  1901. break;
  1902. }
  1903. }
  1904. STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex);
  1905. return ret;
  1906. }
  1907. void starpu_sched_ctx_revert_task_counters_ctx_locked(unsigned sched_ctx_id, double ready_flops)
  1908. {
  1909. _starpu_decrement_nsubmitted_tasks_of_sched_ctx(sched_ctx_id);
  1910. _starpu_decrement_nready_tasks_of_sched_ctx_locked(sched_ctx_id, ready_flops);
  1911. }
  1912. void starpu_sched_ctx_revert_task_counters(unsigned sched_ctx_id, double ready_flops)
  1913. {
  1914. _starpu_decrement_nsubmitted_tasks_of_sched_ctx(sched_ctx_id);
  1915. _starpu_decrement_nready_tasks_of_sched_ctx(sched_ctx_id, ready_flops);
  1916. }
  1917. void starpu_sched_ctx_move_task_to_ctx_locked(struct starpu_task *task, unsigned sched_ctx, unsigned with_repush)
  1918. {
  1919. /* TODO: make something cleaner which differentiates between calls
  1920. from push or pop (have mutex or not) and from another worker or not */
  1921. task->sched_ctx = sched_ctx;
  1922. struct _starpu_job *j = _starpu_get_job_associated_to_task(task);
  1923. _starpu_increment_nsubmitted_tasks_of_sched_ctx(j->task->sched_ctx);
  1924. if(with_repush)
  1925. _starpu_repush_task(j);
  1926. else
  1927. _starpu_increment_nready_tasks_of_sched_ctx(j->task->sched_ctx, j->task->flops, j->task);
  1928. }
  1929. void starpu_sched_ctx_move_task_to_ctx(struct starpu_task *task, unsigned sched_ctx, unsigned manage_mutex,
  1930. unsigned with_repush)
  1931. {
  1932. /* TODO: make something cleaner which differentiates between calls
  1933. from push or pop (have mutex or not) and from another worker or not */
  1934. int workerid = starpu_worker_get_id();
  1935. struct _starpu_worker *worker = NULL;
  1936. if(workerid != -1 && manage_mutex)
  1937. {
  1938. worker = _starpu_get_worker_struct(workerid);
  1939. STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex);
  1940. }
  1941. task->sched_ctx = sched_ctx;
  1942. struct _starpu_job *j = _starpu_get_job_associated_to_task(task);
  1943. _starpu_increment_nsubmitted_tasks_of_sched_ctx(j->task->sched_ctx);
  1944. if(with_repush)
  1945. _starpu_repush_task(j);
  1946. else
  1947. _starpu_increment_nready_tasks_of_sched_ctx(j->task->sched_ctx, j->task->flops, j->task);
  1948. if(workerid != -1 && manage_mutex)
  1949. STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex);
  1950. }
  1951. void starpu_sched_ctx_list_task_counters_increment(unsigned sched_ctx_id, int workerid)
  1952. {
  1953. /* Note : often we don't have any sched_mutex taken here but we
  1954. should, so take it */
  1955. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  1956. if (worker->nsched_ctxs > 1)
  1957. {
  1958. STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex);
  1959. _starpu_sched_ctx_list_push_event(worker->sched_ctx_list, sched_ctx_id);
  1960. STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex);
  1961. }
  1962. }
  1963. void starpu_sched_ctx_list_task_counters_decrement(unsigned sched_ctx_id, int workerid)
  1964. {
  1965. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  1966. if (worker->nsched_ctxs > 1)
  1967. _starpu_sched_ctx_list_pop_event(worker->sched_ctx_list, sched_ctx_id);
  1968. }
  1969. void starpu_sched_ctx_list_task_counters_reset(unsigned sched_ctx_id, int workerid)
  1970. {
  1971. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  1972. if (worker->nsched_ctxs > 1)
  1973. _starpu_sched_ctx_list_pop_all_event(worker->sched_ctx_list, sched_ctx_id);
  1974. }
  1975. void starpu_sched_ctx_list_task_counters_increment_all(struct starpu_task *task, unsigned sched_ctx_id)
  1976. {
  1977. /* TODO: add proper, but light-enough locking to sched_ctx counters */
  1978. /* Note that with 1 ctx we will default to the global context,
  1979. hence our counters are useless */
  1980. if (_starpu_get_nsched_ctxs() > 1)
  1981. {
  1982. struct starpu_worker_collection *workers = starpu_sched_ctx_get_worker_collection(sched_ctx_id);
  1983. struct starpu_sched_ctx_iterator it;
  1984. _starpu_sched_ctx_lock_write(sched_ctx_id);
  1985. workers->init_iterator_for_parallel_tasks(workers, &it, task);
  1986. while(workers->has_next(workers, &it))
  1987. {
  1988. int worker = workers->get_next(workers, &it);
  1989. starpu_sched_ctx_list_task_counters_increment(sched_ctx_id, worker);
  1990. }
  1991. _starpu_sched_ctx_unlock_write(sched_ctx_id);
  1992. }
  1993. }
  1994. void starpu_sched_ctx_list_task_counters_decrement_all_ctx_locked(struct starpu_task *task, unsigned sched_ctx_id)
  1995. {
  1996. if (_starpu_get_nsched_ctxs() > 1)
  1997. {
  1998. struct starpu_worker_collection *workers = starpu_sched_ctx_get_worker_collection(sched_ctx_id);
  1999. struct starpu_sched_ctx_iterator it;
  2000. workers->init_iterator_for_parallel_tasks(workers, &it, task);
  2001. while(workers->has_next(workers, &it))
  2002. {
  2003. int workerid = workers->get_next(workers, &it);
  2004. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  2005. if (worker->nsched_ctxs > 1)
  2006. {
  2007. _starpu_worker_lock_for_observation_relax(workerid);
  2008. starpu_sched_ctx_list_task_counters_decrement(sched_ctx_id, workerid);
  2009. _starpu_worker_unlock_for_observation(workerid);
  2010. }
  2011. }
  2012. }
  2013. }
  2014. void starpu_sched_ctx_list_task_counters_decrement_all(struct starpu_task *task, unsigned sched_ctx_id)
  2015. {
  2016. if (_starpu_get_nsched_ctxs() > 1)
  2017. {
  2018. struct starpu_worker_collection *workers = starpu_sched_ctx_get_worker_collection(sched_ctx_id);
  2019. struct starpu_sched_ctx_iterator it;
  2020. _starpu_sched_ctx_lock_write(sched_ctx_id);
  2021. workers->init_iterator_for_parallel_tasks(workers, &it, task);
  2022. while(workers->has_next(workers, &it))
  2023. {
  2024. int workerid = workers->get_next(workers, &it);
  2025. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  2026. if (worker->nsched_ctxs > 1)
  2027. {
  2028. _starpu_worker_lock_for_observation_relax(workerid);
  2029. starpu_sched_ctx_list_task_counters_decrement(sched_ctx_id, workerid);
  2030. _starpu_worker_unlock_for_observation(workerid);
  2031. }
  2032. }
  2033. _starpu_sched_ctx_unlock_write(sched_ctx_id);
  2034. }
  2035. }
  2036. void starpu_sched_ctx_list_task_counters_reset_all(struct starpu_task *task, unsigned sched_ctx_id)
  2037. {
  2038. if (_starpu_get_nsched_ctxs() > 1)
  2039. {
  2040. _starpu_sched_ctx_lock_write(sched_ctx_id);
  2041. struct starpu_worker_collection *workers = starpu_sched_ctx_get_worker_collection(sched_ctx_id);
  2042. struct starpu_sched_ctx_iterator it;
  2043. workers->init_iterator_for_parallel_tasks(workers, &it, task);
  2044. while(workers->has_next(workers, &it))
  2045. {
  2046. int workerid = workers->get_next(workers, &it);
  2047. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  2048. if (worker->nsched_ctxs > 1)
  2049. {
  2050. _starpu_worker_lock_for_observation_relax(workerid);
  2051. starpu_sched_ctx_list_task_counters_reset(sched_ctx_id, workerid);
  2052. _starpu_worker_unlock_for_observation(workerid);
  2053. }
  2054. }
  2055. _starpu_sched_ctx_unlock_write(sched_ctx_id);
  2056. }
  2057. }
  2058. static void _starpu_sched_ctx_block_workers_in_parallel(unsigned sched_ctx_id, unsigned all)
  2059. {
  2060. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  2061. int current_worker_id = starpu_worker_get_id();
  2062. int master, temp_master = 0;
  2063. struct starpu_worker_collection *workers = sched_ctx->workers;
  2064. struct starpu_sched_ctx_iterator it;
  2065. int workers_count = 0;
  2066. /* temporarily put a master if needed */
  2067. if (sched_ctx->main_master == -1)
  2068. {
  2069. _starpu_sched_ctx_put_new_master(sched_ctx_id);
  2070. temp_master = 1;
  2071. }
  2072. master = sched_ctx->main_master;
  2073. workers_count = 0;
  2074. workers->init_iterator(workers, &it);
  2075. while(workers->has_next(workers, &it))
  2076. {
  2077. int workerid = workers->get_next(workers, &it);
  2078. if(starpu_worker_get_type(workerid) == STARPU_CPU_WORKER
  2079. && (workerid != master || all)
  2080. && (current_worker_id == -1 || workerid != current_worker_id))
  2081. {
  2082. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  2083. STARPU_PTHREAD_MUTEX_LOCK_SCHED(&worker->sched_mutex);
  2084. _starpu_worker_request_blocking_in_parallel(worker);
  2085. STARPU_PTHREAD_MUTEX_UNLOCK_SCHED(&worker->sched_mutex);
  2086. }
  2087. workers_count++;
  2088. }
  2089. if (temp_master)
  2090. sched_ctx->main_master = -1;
  2091. }
  2092. static void _starpu_sched_ctx_unblock_workers_in_parallel(unsigned sched_ctx_id, unsigned all)
  2093. {
  2094. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  2095. int current_worker_id = starpu_worker_get_id();
  2096. int master, temp_master = 0;
  2097. struct starpu_worker_collection *workers = sched_ctx->workers;
  2098. struct starpu_sched_ctx_iterator it;
  2099. /* temporarily put a master if needed */
  2100. if (sched_ctx->main_master == -1)
  2101. {
  2102. _starpu_sched_ctx_put_new_master(sched_ctx_id);
  2103. temp_master = 1;
  2104. }
  2105. master = sched_ctx->main_master;
  2106. workers->init_iterator(workers, &it);
  2107. while(workers->has_next(workers, &it))
  2108. {
  2109. int workerid = workers->get_next(workers, &it);
  2110. if(starpu_worker_get_type(workerid) == STARPU_CPU_WORKER
  2111. && (workerid != master || all))
  2112. {
  2113. if((current_worker_id == -1 || workerid != current_worker_id))
  2114. {
  2115. struct _starpu_worker *worker = _starpu_get_worker_struct(workerid);
  2116. STARPU_PTHREAD_MUTEX_LOCK(&worker->sched_mutex);
  2117. _starpu_worker_request_unblocking_in_parallel(worker);
  2118. STARPU_PTHREAD_MUTEX_UNLOCK(&worker->sched_mutex);
  2119. }
  2120. }
  2121. }
  2122. if (temp_master)
  2123. sched_ctx->main_master = -1;
  2124. return;
  2125. }
  2126. void* starpu_sched_ctx_exec_parallel_code(void* (*func)(void*), void* param, unsigned sched_ctx_id)
  2127. {
  2128. _starpu_sched_ctx_block_workers_in_parallel(sched_ctx_id, 1);
  2129. /* execute parallel code */
  2130. void* ret = func(param);
  2131. /* wake up starpu workers */
  2132. _starpu_sched_ctx_unblock_workers_in_parallel(sched_ctx_id, 1);
  2133. return ret;
  2134. }
  2135. static void _starpu_sched_ctx_update_parallel_workers_with(unsigned sched_ctx_id)
  2136. {
  2137. struct _starpu_sched_ctx * sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  2138. if(sched_ctx->sched_policy)
  2139. return;
  2140. _starpu_sched_ctx_put_new_master(sched_ctx_id);
  2141. if(!sched_ctx->awake_workers)
  2142. {
  2143. _starpu_sched_ctx_block_workers_in_parallel(sched_ctx_id, 0);
  2144. }
  2145. }
  2146. static void _starpu_sched_ctx_update_parallel_workers_without(unsigned sched_ctx_id)
  2147. {
  2148. struct _starpu_sched_ctx * sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  2149. if(sched_ctx->sched_policy)
  2150. return;
  2151. _starpu_sched_ctx_put_new_master(sched_ctx_id);
  2152. if(!sched_ctx->awake_workers)
  2153. {
  2154. _starpu_sched_ctx_unblock_workers_in_parallel(sched_ctx_id, 0);
  2155. }
  2156. }
  2157. void starpu_sched_ctx_get_available_cpuids(unsigned sched_ctx_id, int **cpuids, int *ncpuids)
  2158. {
  2159. int current_worker_id = starpu_worker_get_id();
  2160. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  2161. struct starpu_worker_collection *workers = sched_ctx->workers;
  2162. _STARPU_MALLOC((*cpuids), workers->nworkers*sizeof(int));
  2163. int w = 0;
  2164. struct starpu_sched_ctx_iterator it;
  2165. workers->init_iterator(workers, &it);
  2166. while(workers->has_next(workers, &it))
  2167. {
  2168. int workerid = workers->get_next(workers, &it);
  2169. int master = sched_ctx->main_master;
  2170. if(master == current_worker_id || workerid == current_worker_id || current_worker_id == -1)
  2171. {
  2172. (*cpuids)[w++] = starpu_worker_get_bindid(workerid);
  2173. }
  2174. }
  2175. *ncpuids = w;
  2176. return;
  2177. }
  2178. static void _starpu_sched_ctx_put_new_master(unsigned sched_ctx_id)
  2179. {
  2180. int *workerids;
  2181. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  2182. unsigned nworkers = starpu_sched_ctx_get_workers_list_raw(sched_ctx_id, &workerids);
  2183. unsigned i;
  2184. for (i=0; i<nworkers; i++)
  2185. {
  2186. if (starpu_worker_get_type(workerids[i]) == STARPU_CPU_WORKER)
  2187. {
  2188. sched_ctx->main_master = workerids[i];
  2189. break;
  2190. }
  2191. }
  2192. STARPU_ASSERT(i<nworkers);
  2193. }
  2194. struct starpu_perfmodel_arch * _starpu_sched_ctx_get_perf_archtype(unsigned sched_ctx_id)
  2195. {
  2196. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  2197. return &sched_ctx->perf_arch;
  2198. }
  2199. int starpu_sched_ctx_get_worker_rank(unsigned sched_ctx_id)
  2200. {
  2201. int idx = 0;
  2202. int curr_workerid = starpu_worker_get_id();
  2203. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  2204. if(sched_ctx->sched_policy || !sched_ctx->awake_workers)
  2205. return -1;
  2206. struct starpu_worker_collection *workers = sched_ctx->workers;
  2207. struct starpu_sched_ctx_iterator it;
  2208. workers->init_iterator(workers, &it);
  2209. while(workers->has_next(workers, &it))
  2210. {
  2211. int worker = workers->get_next(workers, &it);
  2212. if(worker == curr_workerid)
  2213. return idx;
  2214. idx++;
  2215. }
  2216. return -1;
  2217. }
  2218. void (*starpu_sched_ctx_get_sched_policy_init(unsigned sched_ctx_id))(unsigned)
  2219. {
  2220. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  2221. return sched_ctx->init_sched;
  2222. }
  2223. unsigned starpu_sched_ctx_has_starpu_scheduler(unsigned sched_ctx_id, unsigned *awake_workers)
  2224. {
  2225. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  2226. *awake_workers = sched_ctx->awake_workers;
  2227. return sched_ctx->sched_policy != NULL;
  2228. }
  2229. void *starpu_sched_ctx_get_user_data(unsigned sched_ctx_id)
  2230. {
  2231. struct _starpu_sched_ctx *sched_ctx = _starpu_get_sched_ctx_struct(sched_ctx_id);
  2232. STARPU_ASSERT(sched_ctx != NULL);
  2233. return sched_ctx->user_data;
  2234. }