sched_policy.c 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291
  1. /*
  2. * Copyright(c) 2011-2016 Intel Corporation. All rights reserved.
  3. *
  4. * Permission is hereby granted, free of charge, to any person obtaining a
  5. * copy of this software and associated documentation files (the "Software"),
  6. * to deal in the Software without restriction, including without limitation
  7. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  8. * and/or sell copies of the Software, and to permit persons to whom the
  9. * Software is furnished to do so, subject to the following conditions:
  10. *
  11. * The above copyright notice and this permission notice (including the next
  12. * paragraph) shall be included in all copies or substantial portions of the
  13. * Software.
  14. *
  15. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  18. * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  19. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  20. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  21. * SOFTWARE.
  22. *
  23. * Authors:
  24. * Anhua Xu
  25. * Kevin Tian <kevin.tian@intel.com>
  26. *
  27. * Contributors:
  28. * Min He <min.he@intel.com>
  29. * Bing Niu <bing.niu@intel.com>
  30. * Zhi Wang <zhi.a.wang@intel.com>
  31. *
  32. */
  33. #include "i915_drv.h"
  34. #include "gvt.h"
  35. static bool vgpu_has_pending_workload(struct intel_vgpu *vgpu)
  36. {
  37. enum intel_engine_id i;
  38. struct intel_engine_cs *engine;
  39. for_each_engine(engine, vgpu->gvt->dev_priv, i) {
  40. if (!list_empty(workload_q_head(vgpu, i)))
  41. return true;
  42. }
  43. return false;
  44. }
  45. static void try_to_schedule_next_vgpu(struct intel_gvt *gvt)
  46. {
  47. struct intel_gvt_workload_scheduler *scheduler = &gvt->scheduler;
  48. enum intel_engine_id i;
  49. struct intel_engine_cs *engine;
  50. /* no target to schedule */
  51. if (!scheduler->next_vgpu)
  52. return;
  53. gvt_dbg_sched("try to schedule next vgpu %d\n",
  54. scheduler->next_vgpu->id);
  55. /*
  56. * after the flag is set, workload dispatch thread will
  57. * stop dispatching workload for current vgpu
  58. */
  59. scheduler->need_reschedule = true;
  60. /* still have uncompleted workload? */
  61. for_each_engine(engine, gvt->dev_priv, i) {
  62. if (scheduler->current_workload[i]) {
  63. gvt_dbg_sched("still have running workload\n");
  64. return;
  65. }
  66. }
  67. gvt_dbg_sched("switch to next vgpu %d\n",
  68. scheduler->next_vgpu->id);
  69. /* switch current vgpu */
  70. scheduler->current_vgpu = scheduler->next_vgpu;
  71. scheduler->next_vgpu = NULL;
  72. scheduler->need_reschedule = false;
  73. /* wake up workload dispatch thread */
  74. for_each_engine(engine, gvt->dev_priv, i)
  75. wake_up(&scheduler->waitq[i]);
  76. }
  77. struct tbs_vgpu_data {
  78. struct list_head list;
  79. struct intel_vgpu *vgpu;
  80. /* put some per-vgpu sched stats here */
  81. };
  82. struct tbs_sched_data {
  83. struct intel_gvt *gvt;
  84. struct delayed_work work;
  85. unsigned long period;
  86. struct list_head runq_head;
  87. };
  88. #define GVT_DEFAULT_TIME_SLICE (msecs_to_jiffies(1))
  89. static void tbs_sched_func(struct work_struct *work)
  90. {
  91. struct tbs_sched_data *sched_data = container_of(work,
  92. struct tbs_sched_data, work.work);
  93. struct tbs_vgpu_data *vgpu_data;
  94. struct intel_gvt *gvt = sched_data->gvt;
  95. struct intel_gvt_workload_scheduler *scheduler = &gvt->scheduler;
  96. struct intel_vgpu *vgpu = NULL;
  97. struct list_head *pos, *head;
  98. mutex_lock(&gvt->lock);
  99. /* no vgpu or has already had a target */
  100. if (list_empty(&sched_data->runq_head) || scheduler->next_vgpu)
  101. goto out;
  102. if (scheduler->current_vgpu) {
  103. vgpu_data = scheduler->current_vgpu->sched_data;
  104. head = &vgpu_data->list;
  105. } else {
  106. head = &sched_data->runq_head;
  107. }
  108. /* search a vgpu with pending workload */
  109. list_for_each(pos, head) {
  110. if (pos == &sched_data->runq_head)
  111. continue;
  112. vgpu_data = container_of(pos, struct tbs_vgpu_data, list);
  113. if (!vgpu_has_pending_workload(vgpu_data->vgpu))
  114. continue;
  115. vgpu = vgpu_data->vgpu;
  116. break;
  117. }
  118. if (vgpu) {
  119. scheduler->next_vgpu = vgpu;
  120. gvt_dbg_sched("pick next vgpu %d\n", vgpu->id);
  121. }
  122. out:
  123. if (scheduler->next_vgpu) {
  124. gvt_dbg_sched("try to schedule next vgpu %d\n",
  125. scheduler->next_vgpu->id);
  126. try_to_schedule_next_vgpu(gvt);
  127. }
  128. /*
  129. * still have vgpu on runq
  130. * or last schedule haven't finished due to running workload
  131. */
  132. if (!list_empty(&sched_data->runq_head) || scheduler->next_vgpu)
  133. schedule_delayed_work(&sched_data->work, sched_data->period);
  134. mutex_unlock(&gvt->lock);
  135. }
  136. static int tbs_sched_init(struct intel_gvt *gvt)
  137. {
  138. struct intel_gvt_workload_scheduler *scheduler =
  139. &gvt->scheduler;
  140. struct tbs_sched_data *data;
  141. data = kzalloc(sizeof(*data), GFP_KERNEL);
  142. if (!data)
  143. return -ENOMEM;
  144. INIT_LIST_HEAD(&data->runq_head);
  145. INIT_DELAYED_WORK(&data->work, tbs_sched_func);
  146. data->period = GVT_DEFAULT_TIME_SLICE;
  147. data->gvt = gvt;
  148. scheduler->sched_data = data;
  149. return 0;
  150. }
  151. static void tbs_sched_clean(struct intel_gvt *gvt)
  152. {
  153. struct intel_gvt_workload_scheduler *scheduler =
  154. &gvt->scheduler;
  155. struct tbs_sched_data *data = scheduler->sched_data;
  156. cancel_delayed_work(&data->work);
  157. kfree(data);
  158. scheduler->sched_data = NULL;
  159. }
  160. static int tbs_sched_init_vgpu(struct intel_vgpu *vgpu)
  161. {
  162. struct tbs_vgpu_data *data;
  163. data = kzalloc(sizeof(*data), GFP_KERNEL);
  164. if (!data)
  165. return -ENOMEM;
  166. data->vgpu = vgpu;
  167. INIT_LIST_HEAD(&data->list);
  168. vgpu->sched_data = data;
  169. return 0;
  170. }
  171. static void tbs_sched_clean_vgpu(struct intel_vgpu *vgpu)
  172. {
  173. kfree(vgpu->sched_data);
  174. vgpu->sched_data = NULL;
  175. }
  176. static void tbs_sched_start_schedule(struct intel_vgpu *vgpu)
  177. {
  178. struct tbs_sched_data *sched_data = vgpu->gvt->scheduler.sched_data;
  179. struct tbs_vgpu_data *vgpu_data = vgpu->sched_data;
  180. if (!list_empty(&vgpu_data->list))
  181. return;
  182. list_add_tail(&vgpu_data->list, &sched_data->runq_head);
  183. schedule_delayed_work(&sched_data->work, 0);
  184. }
  185. static void tbs_sched_stop_schedule(struct intel_vgpu *vgpu)
  186. {
  187. struct tbs_vgpu_data *vgpu_data = vgpu->sched_data;
  188. list_del_init(&vgpu_data->list);
  189. }
  190. static struct intel_gvt_sched_policy_ops tbs_schedule_ops = {
  191. .init = tbs_sched_init,
  192. .clean = tbs_sched_clean,
  193. .init_vgpu = tbs_sched_init_vgpu,
  194. .clean_vgpu = tbs_sched_clean_vgpu,
  195. .start_schedule = tbs_sched_start_schedule,
  196. .stop_schedule = tbs_sched_stop_schedule,
  197. };
  198. int intel_gvt_init_sched_policy(struct intel_gvt *gvt)
  199. {
  200. gvt->scheduler.sched_ops = &tbs_schedule_ops;
  201. return gvt->scheduler.sched_ops->init(gvt);
  202. }
  203. void intel_gvt_clean_sched_policy(struct intel_gvt *gvt)
  204. {
  205. gvt->scheduler.sched_ops->clean(gvt);
  206. }
  207. int intel_vgpu_init_sched_policy(struct intel_vgpu *vgpu)
  208. {
  209. return vgpu->gvt->scheduler.sched_ops->init_vgpu(vgpu);
  210. }
  211. void intel_vgpu_clean_sched_policy(struct intel_vgpu *vgpu)
  212. {
  213. vgpu->gvt->scheduler.sched_ops->clean_vgpu(vgpu);
  214. }
  215. void intel_vgpu_start_schedule(struct intel_vgpu *vgpu)
  216. {
  217. gvt_dbg_core("vgpu%d: start schedule\n", vgpu->id);
  218. vgpu->gvt->scheduler.sched_ops->start_schedule(vgpu);
  219. }
  220. void intel_vgpu_stop_schedule(struct intel_vgpu *vgpu)
  221. {
  222. struct intel_gvt_workload_scheduler *scheduler =
  223. &vgpu->gvt->scheduler;
  224. gvt_dbg_core("vgpu%d: stop schedule\n", vgpu->id);
  225. scheduler->sched_ops->stop_schedule(vgpu);
  226. if (scheduler->next_vgpu == vgpu)
  227. scheduler->next_vgpu = NULL;
  228. if (scheduler->current_vgpu == vgpu) {
  229. /* stop workload dispatching */
  230. scheduler->need_reschedule = true;
  231. scheduler->current_vgpu = NULL;
  232. }
  233. }