sde_vm_common.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Copyright (c) 2020-2021, The Linux Foundation. All rights reserved.
  4. */
  5. #define pr_fmt(fmt) "[drm:%s:%d] " fmt, __func__, __LINE__
  6. #include <linux/list_sort.h>
  7. #include "linux/sde_rsc.h"
  8. #include "dsi/dsi_display.h"
  9. #include "dp/dp_display.h"
  10. #include "sde_kms.h"
  11. #include "sde_vm_common.h"
  12. #include "sde_crtc.h"
  13. #include "sde_vm_msgq.h"
  14. struct gh_notify_vmid_desc *sde_vm_populate_vmid(gh_vmid_t vmid)
  15. {
  16. struct gh_notify_vmid_desc *vmid_desc;
  17. vmid_desc = kzalloc(offsetof(struct gh_notify_vmid_desc,
  18. vmid_entries[1]), GFP_KERNEL);
  19. if (!vmid_desc)
  20. return ERR_PTR(ENOMEM);
  21. vmid_desc->n_vmid_entries = 1;
  22. vmid_desc->vmid_entries[0].vmid = vmid;
  23. return vmid_desc;
  24. }
  25. struct gh_acl_desc *sde_vm_populate_acl(enum gh_vm_names vm_name)
  26. {
  27. struct gh_acl_desc *acl_desc;
  28. gh_vmid_t vmid;
  29. gh_rm_get_vmid(vm_name, &vmid);
  30. acl_desc = kzalloc(offsetof(struct gh_acl_desc, acl_entries[1]),
  31. GFP_KERNEL);
  32. if (!acl_desc)
  33. return ERR_PTR(ENOMEM);
  34. acl_desc->n_acl_entries = 1;
  35. acl_desc->acl_entries[0].vmid = vmid;
  36. acl_desc->acl_entries[0].perms = GH_RM_ACL_R | GH_RM_ACL_W;
  37. return acl_desc;
  38. }
  39. #if (LINUX_VERSION_CODE >= KERNEL_VERSION(5, 15, 0))
  40. int __mem_sort_cmp(void *priv, const struct list_head *a, const struct list_head *b)
  41. {
  42. const struct msm_io_mem_entry *left =
  43. container_of(a, struct msm_io_mem_entry, list);
  44. const struct msm_io_mem_entry *right =
  45. container_of(b, struct msm_io_mem_entry, list);
  46. return (left->base - right->base);
  47. }
  48. #else
  49. int __mem_sort_cmp(void *priv, struct list_head *a, struct list_head *b)
  50. {
  51. struct msm_io_mem_entry *left =
  52. container_of(a, struct msm_io_mem_entry, list);
  53. struct msm_io_mem_entry *right =
  54. container_of(b, struct msm_io_mem_entry, list);
  55. return (left->base - right->base);
  56. }
  57. #endif
  58. bool __merge_on_overlap(struct msm_io_mem_entry *res,
  59. const struct msm_io_mem_entry *left,
  60. const struct msm_io_mem_entry *right)
  61. {
  62. phys_addr_t l_s = left->base;
  63. phys_addr_t l_e = left->base + left->size;
  64. phys_addr_t r_s = right->base;
  65. phys_addr_t r_e = right->base + right->size;
  66. memset(res, 0, sizeof(*res));
  67. if (r_s <= l_e) {
  68. res->base = min(l_s, r_s);
  69. res->size = max(l_e, r_e) - res->base;
  70. return true;
  71. }
  72. return false;
  73. }
  74. void _sde_vm_sort_and_align(struct list_head *mem)
  75. {
  76. struct msm_io_mem_entry *entry, *tmp, *prev = NULL;
  77. struct msm_io_mem_entry merged_entry;
  78. list_for_each_entry(entry, mem, list) {
  79. entry->base = ALIGN_DOWN(entry->base, PAGE_SIZE);
  80. entry->size = ALIGN(entry->size, PAGE_SIZE);
  81. }
  82. list_sort(NULL, mem, __mem_sort_cmp);
  83. list_for_each_entry_safe(entry, tmp, mem, list) {
  84. if (prev && __merge_on_overlap(&merged_entry, prev, entry)) {
  85. prev->base = merged_entry.base;
  86. prev->size = merged_entry.size;
  87. list_del(&entry->list);
  88. entry = prev;
  89. }
  90. prev = entry;
  91. }
  92. list_for_each_entry(entry, mem, list)
  93. SDE_DEBUG("base: 0x%llx - size: 0x%llx\n",
  94. entry->base, entry->size);
  95. }
  96. struct gh_sgl_desc *sde_vm_populate_sgl(struct msm_io_res *io_res)
  97. {
  98. struct gh_sgl_desc *sgl_desc;
  99. struct msm_io_mem_entry *mem;
  100. u32 i = 0, num_mem_entry = 0;
  101. _sde_vm_sort_and_align(&io_res->mem);
  102. list_for_each_entry(mem, &io_res->mem, list)
  103. num_mem_entry++;
  104. sgl_desc = kzalloc(offsetof(struct gh_sgl_desc,
  105. sgl_entries[num_mem_entry]), GFP_KERNEL);
  106. if (!sgl_desc)
  107. return ERR_PTR(ENOMEM);
  108. sgl_desc->n_sgl_entries = num_mem_entry;
  109. list_for_each_entry(mem, &io_res->mem, list) {
  110. sgl_desc->sgl_entries[i].ipa_base = mem->base;
  111. sgl_desc->sgl_entries[i].size = mem->size;
  112. i++;
  113. }
  114. msm_dss_clean_io_mem(&io_res->mem);
  115. return sgl_desc;
  116. }
  117. struct sde_vm_irq_desc *sde_vm_populate_irq(struct msm_io_res *io_res)
  118. {
  119. struct msm_io_irq_entry *irq;
  120. u32 i = 0, num_irq = 0;
  121. struct sde_vm_irq_desc *irq_desc;
  122. list_for_each_entry(irq, &io_res->irq, list)
  123. num_irq++;
  124. irq_desc = kzalloc(sizeof(*irq_desc), GFP_KERNEL);
  125. if (!irq_desc)
  126. return ERR_PTR(ENOMEM);
  127. irq_desc->irq_entries = kcalloc(num_irq,
  128. sizeof(struct sde_vm_irq_entry),
  129. GFP_KERNEL);
  130. if (!irq_desc->irq_entries) {
  131. sde_vm_free_irq(irq_desc);
  132. return ERR_PTR(ENOMEM);
  133. }
  134. list_for_each_entry(irq, &io_res->irq, list) {
  135. struct sde_vm_irq_entry *entry = &irq_desc->irq_entries[i];
  136. entry->irq = irq->irq_num;
  137. entry->label = irq->label;
  138. i++;
  139. }
  140. irq_desc->n_irq = num_irq;
  141. msm_dss_clean_io_irq(&io_res->irq);
  142. return irq_desc;
  143. }
  144. void sde_vm_free_irq(struct sde_vm_irq_desc *irq_desc)
  145. {
  146. if (irq_desc && irq_desc->irq_entries)
  147. kfree(irq_desc->irq_entries);
  148. kfree(irq_desc);
  149. }
  150. int sde_vm_get_resources(struct sde_kms *sde_kms, struct msm_io_res *io_res)
  151. {
  152. struct msm_drm_private *priv = sde_kms->dev->dev_private;
  153. struct msm_vm_client_entry *entry;
  154. int rc = 0;
  155. rc = sde_kms_get_io_resources(sde_kms, io_res);
  156. if (rc)
  157. goto fail_get_res;
  158. list_for_each_entry(entry, &priv->vm_client_list, list) {
  159. if (!entry->ops.vm_get_io_resources)
  160. continue;
  161. rc = entry->ops.vm_get_io_resources(io_res, entry->data);
  162. if (rc) {
  163. SDE_ERROR("get_io_resources failed for device: %d\n",
  164. entry->dev->id);
  165. goto fail_get_res;
  166. }
  167. }
  168. return rc;
  169. fail_get_res:
  170. msm_dss_clean_io_mem(&io_res->mem);
  171. msm_dss_clean_io_irq(&io_res->irq);
  172. return rc;
  173. }
  174. void sde_vm_free_resources(struct msm_io_res *io_res)
  175. {
  176. msm_dss_clean_io_mem(&io_res->mem);
  177. msm_dss_clean_io_irq(&io_res->irq);
  178. }
  179. int sde_vm_post_acquire(struct sde_kms *kms)
  180. {
  181. struct msm_drm_private *priv = kms->dev->dev_private;
  182. struct msm_vm_client_entry *entry;
  183. int rc = 0;
  184. list_for_each_entry(entry, &priv->vm_client_list, list) {
  185. if (!entry->ops.vm_post_hw_acquire)
  186. continue;
  187. rc = entry->ops.vm_post_hw_acquire(entry->data);
  188. if (rc) {
  189. SDE_ERROR("post_acquire failed for device: %d\n",
  190. entry->dev->id);
  191. goto post_acquire_rollback;
  192. }
  193. }
  194. return rc;
  195. post_acquire_rollback:
  196. list_for_each_entry_continue_reverse(entry, &priv->vm_client_list,
  197. list) {
  198. if (!entry->ops.vm_pre_hw_release)
  199. continue;
  200. rc = entry->ops.vm_pre_hw_release(entry->data);
  201. if (rc) {
  202. SDE_ERROR(
  203. "post_acquire failed during rollback for device: %d\n",
  204. entry->dev->id);
  205. break;
  206. }
  207. }
  208. return rc;
  209. }
  210. int sde_vm_pre_release(struct sde_kms *kms)
  211. {
  212. struct msm_drm_private *priv = kms->dev->dev_private;
  213. struct msm_vm_client_entry *entry;
  214. int rc = 0;
  215. list_for_each_entry(entry, &priv->vm_client_list, list) {
  216. if (!entry->ops.vm_pre_hw_release)
  217. continue;
  218. rc = entry->ops.vm_pre_hw_release(entry->data);
  219. if (rc) {
  220. SDE_ERROR("pre_release failed for device: %d\n",
  221. entry->dev->id);
  222. goto pre_release_rollback;
  223. }
  224. }
  225. return rc;
  226. pre_release_rollback:
  227. list_for_each_entry_continue_reverse(entry, &priv->vm_client_list,
  228. list) {
  229. if (!entry->ops.vm_post_hw_acquire)
  230. continue;
  231. rc = entry->ops.vm_post_hw_acquire(entry->data);
  232. if (rc) {
  233. SDE_ERROR(
  234. "post_acquire failed during rollback for device: %d\n",
  235. entry->dev->id);
  236. break;
  237. }
  238. }
  239. return rc;
  240. }
  241. int sde_vm_request_valid(struct sde_kms *sde_kms,
  242. enum sde_crtc_vm_req old_state,
  243. enum sde_crtc_vm_req new_state)
  244. {
  245. int rc = 0;
  246. bool vm_owns_hw = sde_vm_owns_hw(sde_kms);
  247. switch (new_state) {
  248. case VM_REQ_RELEASE:
  249. case VM_REQ_NONE:
  250. if ((old_state == VM_REQ_RELEASE) || !vm_owns_hw)
  251. rc = -EINVAL;
  252. break;
  253. case VM_REQ_ACQUIRE:
  254. if (old_state != VM_REQ_RELEASE)
  255. rc = -EINVAL;
  256. break;
  257. default:
  258. SDE_ERROR("invalid vm request\n");
  259. rc = -EINVAL;
  260. };
  261. SDE_DEBUG("old req: %d new req: %d owns_hw: %d, rc: %d\n",
  262. old_state, new_state, vm_owns_hw, rc);
  263. SDE_EVT32(old_state, new_state, vm_owns_hw, rc);
  264. return rc;
  265. }
  266. int sde_vm_msg_send(struct sde_vm *sde_vm, void *msg, size_t msg_size)
  267. {
  268. if (!sde_vm)
  269. return -EINVAL;
  270. return sde_vm_msgq_send(sde_vm, msg, msg_size);
  271. }