sched_ctx.c 81 KB

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