base.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543
  1. /*
  2. * Copyright 2010 Red Hat Inc.
  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 shall be included in
  12. * all copies or substantial portions of the Software.
  13. *
  14. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  17. * THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
  18. * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
  19. * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
  20. * OTHER DEALINGS IN THE SOFTWARE.
  21. *
  22. * Authors: Ben Skeggs
  23. */
  24. #include "priv.h"
  25. #include <core/gpuobj.h>
  26. #include <subdev/fb.h>
  27. void
  28. nvkm_vm_map_at(struct nvkm_vma *vma, u64 delta, struct nvkm_mem *node)
  29. {
  30. struct nvkm_vm *vm = vma->vm;
  31. struct nvkm_mmu *mmu = vm->mmu;
  32. struct nvkm_mm_node *r = node->mem;
  33. int big = vma->node->type != mmu->func->spg_shift;
  34. u32 offset = vma->node->offset + (delta >> 12);
  35. u32 bits = vma->node->type - 12;
  36. u32 pde = (offset >> mmu->func->pgt_bits) - vm->fpde;
  37. u32 pte = (offset & ((1 << mmu->func->pgt_bits) - 1)) >> bits;
  38. u32 max = 1 << (mmu->func->pgt_bits - bits);
  39. u32 end, len;
  40. delta = 0;
  41. while (r) {
  42. u64 phys = (u64)r->offset << 12;
  43. u32 num = r->length >> bits;
  44. while (num) {
  45. struct nvkm_memory *pgt = vm->pgt[pde].mem[big];
  46. end = (pte + num);
  47. if (unlikely(end >= max))
  48. end = max;
  49. len = end - pte;
  50. mmu->func->map(vma, pgt, node, pte, len, phys, delta);
  51. num -= len;
  52. pte += len;
  53. if (unlikely(end >= max)) {
  54. phys += len << (bits + 12);
  55. pde++;
  56. pte = 0;
  57. }
  58. delta += (u64)len << vma->node->type;
  59. }
  60. r = r->next;
  61. };
  62. mmu->func->flush(vm);
  63. }
  64. static void
  65. nvkm_vm_map_sg_table(struct nvkm_vma *vma, u64 delta, u64 length,
  66. struct nvkm_mem *mem)
  67. {
  68. struct nvkm_vm *vm = vma->vm;
  69. struct nvkm_mmu *mmu = vm->mmu;
  70. int big = vma->node->type != mmu->func->spg_shift;
  71. u32 offset = vma->node->offset + (delta >> 12);
  72. u32 bits = vma->node->type - 12;
  73. u32 num = length >> vma->node->type;
  74. u32 pde = (offset >> mmu->func->pgt_bits) - vm->fpde;
  75. u32 pte = (offset & ((1 << mmu->func->pgt_bits) - 1)) >> bits;
  76. u32 max = 1 << (mmu->func->pgt_bits - bits);
  77. unsigned m, sglen;
  78. u32 end, len;
  79. int i;
  80. struct scatterlist *sg;
  81. for_each_sg(mem->sg->sgl, sg, mem->sg->nents, i) {
  82. struct nvkm_memory *pgt = vm->pgt[pde].mem[big];
  83. sglen = sg_dma_len(sg) >> PAGE_SHIFT;
  84. end = pte + sglen;
  85. if (unlikely(end >= max))
  86. end = max;
  87. len = end - pte;
  88. for (m = 0; m < len; m++) {
  89. dma_addr_t addr = sg_dma_address(sg) + (m << PAGE_SHIFT);
  90. mmu->func->map_sg(vma, pgt, mem, pte, 1, &addr);
  91. num--;
  92. pte++;
  93. if (num == 0)
  94. goto finish;
  95. }
  96. if (unlikely(end >= max)) {
  97. pde++;
  98. pte = 0;
  99. }
  100. if (m < sglen) {
  101. for (; m < sglen; m++) {
  102. dma_addr_t addr = sg_dma_address(sg) + (m << PAGE_SHIFT);
  103. mmu->func->map_sg(vma, pgt, mem, pte, 1, &addr);
  104. num--;
  105. pte++;
  106. if (num == 0)
  107. goto finish;
  108. }
  109. }
  110. }
  111. finish:
  112. mmu->func->flush(vm);
  113. }
  114. static void
  115. nvkm_vm_map_sg(struct nvkm_vma *vma, u64 delta, u64 length,
  116. struct nvkm_mem *mem)
  117. {
  118. struct nvkm_vm *vm = vma->vm;
  119. struct nvkm_mmu *mmu = vm->mmu;
  120. dma_addr_t *list = mem->pages;
  121. int big = vma->node->type != mmu->func->spg_shift;
  122. u32 offset = vma->node->offset + (delta >> 12);
  123. u32 bits = vma->node->type - 12;
  124. u32 num = length >> vma->node->type;
  125. u32 pde = (offset >> mmu->func->pgt_bits) - vm->fpde;
  126. u32 pte = (offset & ((1 << mmu->func->pgt_bits) - 1)) >> bits;
  127. u32 max = 1 << (mmu->func->pgt_bits - bits);
  128. u32 end, len;
  129. while (num) {
  130. struct nvkm_memory *pgt = vm->pgt[pde].mem[big];
  131. end = (pte + num);
  132. if (unlikely(end >= max))
  133. end = max;
  134. len = end - pte;
  135. mmu->func->map_sg(vma, pgt, mem, pte, len, list);
  136. num -= len;
  137. pte += len;
  138. list += len;
  139. if (unlikely(end >= max)) {
  140. pde++;
  141. pte = 0;
  142. }
  143. }
  144. mmu->func->flush(vm);
  145. }
  146. void
  147. nvkm_vm_map(struct nvkm_vma *vma, struct nvkm_mem *node)
  148. {
  149. if (node->sg)
  150. nvkm_vm_map_sg_table(vma, 0, node->size << 12, node);
  151. else
  152. if (node->pages)
  153. nvkm_vm_map_sg(vma, 0, node->size << 12, node);
  154. else
  155. nvkm_vm_map_at(vma, 0, node);
  156. }
  157. void
  158. nvkm_vm_unmap_at(struct nvkm_vma *vma, u64 delta, u64 length)
  159. {
  160. struct nvkm_vm *vm = vma->vm;
  161. struct nvkm_mmu *mmu = vm->mmu;
  162. int big = vma->node->type != mmu->func->spg_shift;
  163. u32 offset = vma->node->offset + (delta >> 12);
  164. u32 bits = vma->node->type - 12;
  165. u32 num = length >> vma->node->type;
  166. u32 pde = (offset >> mmu->func->pgt_bits) - vm->fpde;
  167. u32 pte = (offset & ((1 << mmu->func->pgt_bits) - 1)) >> bits;
  168. u32 max = 1 << (mmu->func->pgt_bits - bits);
  169. u32 end, len;
  170. while (num) {
  171. struct nvkm_memory *pgt = vm->pgt[pde].mem[big];
  172. end = (pte + num);
  173. if (unlikely(end >= max))
  174. end = max;
  175. len = end - pte;
  176. mmu->func->unmap(vma, pgt, pte, len);
  177. num -= len;
  178. pte += len;
  179. if (unlikely(end >= max)) {
  180. pde++;
  181. pte = 0;
  182. }
  183. }
  184. mmu->func->flush(vm);
  185. }
  186. void
  187. nvkm_vm_unmap(struct nvkm_vma *vma)
  188. {
  189. nvkm_vm_unmap_at(vma, 0, (u64)vma->node->length << 12);
  190. }
  191. static void
  192. nvkm_vm_unmap_pgt(struct nvkm_vm *vm, int big, u32 fpde, u32 lpde)
  193. {
  194. struct nvkm_mmu *mmu = vm->mmu;
  195. struct nvkm_vm_pgd *vpgd;
  196. struct nvkm_vm_pgt *vpgt;
  197. struct nvkm_memory *pgt;
  198. u32 pde;
  199. for (pde = fpde; pde <= lpde; pde++) {
  200. vpgt = &vm->pgt[pde - vm->fpde];
  201. if (--vpgt->refcount[big])
  202. continue;
  203. pgt = vpgt->mem[big];
  204. vpgt->mem[big] = NULL;
  205. list_for_each_entry(vpgd, &vm->pgd_list, head) {
  206. mmu->func->map_pgt(vpgd->obj, pde, vpgt->mem);
  207. }
  208. nvkm_memory_del(&pgt);
  209. }
  210. }
  211. static int
  212. nvkm_vm_map_pgt(struct nvkm_vm *vm, u32 pde, u32 type)
  213. {
  214. struct nvkm_mmu *mmu = vm->mmu;
  215. struct nvkm_vm_pgt *vpgt = &vm->pgt[pde - vm->fpde];
  216. struct nvkm_vm_pgd *vpgd;
  217. int big = (type != mmu->func->spg_shift);
  218. u32 pgt_size;
  219. int ret;
  220. pgt_size = (1 << (mmu->func->pgt_bits + 12)) >> type;
  221. pgt_size *= 8;
  222. ret = nvkm_memory_new(mmu->subdev.device, NVKM_MEM_TARGET_INST,
  223. pgt_size, 0x1000, true, &vpgt->mem[big]);
  224. if (unlikely(ret))
  225. return ret;
  226. list_for_each_entry(vpgd, &vm->pgd_list, head) {
  227. mmu->func->map_pgt(vpgd->obj, pde, vpgt->mem);
  228. }
  229. vpgt->refcount[big]++;
  230. return 0;
  231. }
  232. int
  233. nvkm_vm_get(struct nvkm_vm *vm, u64 size, u32 page_shift, u32 access,
  234. struct nvkm_vma *vma)
  235. {
  236. struct nvkm_mmu *mmu = vm->mmu;
  237. u32 align = (1 << page_shift) >> 12;
  238. u32 msize = size >> 12;
  239. u32 fpde, lpde, pde;
  240. int ret;
  241. mutex_lock(&vm->mutex);
  242. ret = nvkm_mm_head(&vm->mm, 0, page_shift, msize, msize, align,
  243. &vma->node);
  244. if (unlikely(ret != 0)) {
  245. mutex_unlock(&vm->mutex);
  246. return ret;
  247. }
  248. fpde = (vma->node->offset >> mmu->func->pgt_bits);
  249. lpde = (vma->node->offset + vma->node->length - 1) >> mmu->func->pgt_bits;
  250. for (pde = fpde; pde <= lpde; pde++) {
  251. struct nvkm_vm_pgt *vpgt = &vm->pgt[pde - vm->fpde];
  252. int big = (vma->node->type != mmu->func->spg_shift);
  253. if (likely(vpgt->refcount[big])) {
  254. vpgt->refcount[big]++;
  255. continue;
  256. }
  257. ret = nvkm_vm_map_pgt(vm, pde, vma->node->type);
  258. if (ret) {
  259. if (pde != fpde)
  260. nvkm_vm_unmap_pgt(vm, big, fpde, pde - 1);
  261. nvkm_mm_free(&vm->mm, &vma->node);
  262. mutex_unlock(&vm->mutex);
  263. return ret;
  264. }
  265. }
  266. mutex_unlock(&vm->mutex);
  267. vma->vm = NULL;
  268. nvkm_vm_ref(vm, &vma->vm, NULL);
  269. vma->offset = (u64)vma->node->offset << 12;
  270. vma->access = access;
  271. return 0;
  272. }
  273. void
  274. nvkm_vm_put(struct nvkm_vma *vma)
  275. {
  276. struct nvkm_mmu *mmu;
  277. struct nvkm_vm *vm;
  278. u32 fpde, lpde;
  279. if (unlikely(vma->node == NULL))
  280. return;
  281. vm = vma->vm;
  282. mmu = vm->mmu;
  283. fpde = (vma->node->offset >> mmu->func->pgt_bits);
  284. lpde = (vma->node->offset + vma->node->length - 1) >> mmu->func->pgt_bits;
  285. mutex_lock(&vm->mutex);
  286. nvkm_vm_unmap_pgt(vm, vma->node->type != mmu->func->spg_shift, fpde, lpde);
  287. nvkm_mm_free(&vm->mm, &vma->node);
  288. mutex_unlock(&vm->mutex);
  289. nvkm_vm_ref(NULL, &vma->vm, NULL);
  290. }
  291. int
  292. nvkm_vm_boot(struct nvkm_vm *vm, u64 size)
  293. {
  294. struct nvkm_mmu *mmu = vm->mmu;
  295. struct nvkm_memory *pgt;
  296. int ret;
  297. ret = nvkm_memory_new(mmu->subdev.device, NVKM_MEM_TARGET_INST,
  298. (size >> mmu->func->spg_shift) * 8, 0x1000, true, &pgt);
  299. if (ret == 0) {
  300. vm->pgt[0].refcount[0] = 1;
  301. vm->pgt[0].mem[0] = pgt;
  302. nvkm_memory_boot(pgt, vm);
  303. }
  304. return ret;
  305. }
  306. int
  307. nvkm_vm_create(struct nvkm_mmu *mmu, u64 offset, u64 length, u64 mm_offset,
  308. u32 block, struct lock_class_key *key, struct nvkm_vm **pvm)
  309. {
  310. static struct lock_class_key _key;
  311. struct nvkm_vm *vm;
  312. u64 mm_length = (offset + length) - mm_offset;
  313. int ret;
  314. vm = kzalloc(sizeof(*vm), GFP_KERNEL);
  315. if (!vm)
  316. return -ENOMEM;
  317. __mutex_init(&vm->mutex, "&vm->mutex", key ? key : &_key);
  318. INIT_LIST_HEAD(&vm->pgd_list);
  319. vm->mmu = mmu;
  320. kref_init(&vm->refcount);
  321. vm->fpde = offset >> (mmu->func->pgt_bits + 12);
  322. vm->lpde = (offset + length - 1) >> (mmu->func->pgt_bits + 12);
  323. vm->pgt = vzalloc((vm->lpde - vm->fpde + 1) * sizeof(*vm->pgt));
  324. if (!vm->pgt) {
  325. kfree(vm);
  326. return -ENOMEM;
  327. }
  328. ret = nvkm_mm_init(&vm->mm, mm_offset >> 12, mm_length >> 12,
  329. block >> 12);
  330. if (ret) {
  331. vfree(vm->pgt);
  332. kfree(vm);
  333. return ret;
  334. }
  335. *pvm = vm;
  336. return 0;
  337. }
  338. int
  339. nvkm_vm_new(struct nvkm_device *device, u64 offset, u64 length, u64 mm_offset,
  340. struct lock_class_key *key, struct nvkm_vm **pvm)
  341. {
  342. struct nvkm_mmu *mmu = device->mmu;
  343. if (!mmu->func->create)
  344. return -EINVAL;
  345. return mmu->func->create(mmu, offset, length, mm_offset, key, pvm);
  346. }
  347. static int
  348. nvkm_vm_link(struct nvkm_vm *vm, struct nvkm_gpuobj *pgd)
  349. {
  350. struct nvkm_mmu *mmu = vm->mmu;
  351. struct nvkm_vm_pgd *vpgd;
  352. int i;
  353. if (!pgd)
  354. return 0;
  355. vpgd = kzalloc(sizeof(*vpgd), GFP_KERNEL);
  356. if (!vpgd)
  357. return -ENOMEM;
  358. vpgd->obj = pgd;
  359. mutex_lock(&vm->mutex);
  360. for (i = vm->fpde; i <= vm->lpde; i++)
  361. mmu->func->map_pgt(pgd, i, vm->pgt[i - vm->fpde].mem);
  362. list_add(&vpgd->head, &vm->pgd_list);
  363. mutex_unlock(&vm->mutex);
  364. return 0;
  365. }
  366. static void
  367. nvkm_vm_unlink(struct nvkm_vm *vm, struct nvkm_gpuobj *mpgd)
  368. {
  369. struct nvkm_vm_pgd *vpgd, *tmp;
  370. if (!mpgd)
  371. return;
  372. mutex_lock(&vm->mutex);
  373. list_for_each_entry_safe(vpgd, tmp, &vm->pgd_list, head) {
  374. if (vpgd->obj == mpgd) {
  375. list_del(&vpgd->head);
  376. kfree(vpgd);
  377. break;
  378. }
  379. }
  380. mutex_unlock(&vm->mutex);
  381. }
  382. static void
  383. nvkm_vm_del(struct kref *kref)
  384. {
  385. struct nvkm_vm *vm = container_of(kref, typeof(*vm), refcount);
  386. struct nvkm_vm_pgd *vpgd, *tmp;
  387. list_for_each_entry_safe(vpgd, tmp, &vm->pgd_list, head) {
  388. nvkm_vm_unlink(vm, vpgd->obj);
  389. }
  390. nvkm_mm_fini(&vm->mm);
  391. vfree(vm->pgt);
  392. kfree(vm);
  393. }
  394. int
  395. nvkm_vm_ref(struct nvkm_vm *ref, struct nvkm_vm **ptr, struct nvkm_gpuobj *pgd)
  396. {
  397. if (ref) {
  398. int ret = nvkm_vm_link(ref, pgd);
  399. if (ret)
  400. return ret;
  401. kref_get(&ref->refcount);
  402. }
  403. if (*ptr) {
  404. nvkm_vm_unlink(*ptr, pgd);
  405. kref_put(&(*ptr)->refcount, nvkm_vm_del);
  406. }
  407. *ptr = ref;
  408. return 0;
  409. }
  410. static int
  411. nvkm_mmu_oneinit(struct nvkm_subdev *subdev)
  412. {
  413. struct nvkm_mmu *mmu = nvkm_mmu(subdev);
  414. if (mmu->func->oneinit)
  415. return mmu->func->oneinit(mmu);
  416. return 0;
  417. }
  418. static int
  419. nvkm_mmu_init(struct nvkm_subdev *subdev)
  420. {
  421. struct nvkm_mmu *mmu = nvkm_mmu(subdev);
  422. if (mmu->func->init)
  423. mmu->func->init(mmu);
  424. return 0;
  425. }
  426. static void *
  427. nvkm_mmu_dtor(struct nvkm_subdev *subdev)
  428. {
  429. struct nvkm_mmu *mmu = nvkm_mmu(subdev);
  430. if (mmu->func->dtor)
  431. return mmu->func->dtor(mmu);
  432. return mmu;
  433. }
  434. static const struct nvkm_subdev_func
  435. nvkm_mmu = {
  436. .dtor = nvkm_mmu_dtor,
  437. .oneinit = nvkm_mmu_oneinit,
  438. .init = nvkm_mmu_init,
  439. };
  440. void
  441. nvkm_mmu_ctor(const struct nvkm_mmu_func *func, struct nvkm_device *device,
  442. int index, struct nvkm_mmu *mmu)
  443. {
  444. nvkm_subdev_ctor(&nvkm_mmu, device, index, &mmu->subdev);
  445. mmu->func = func;
  446. mmu->limit = func->limit;
  447. mmu->dma_bits = func->dma_bits;
  448. mmu->lpg_shift = func->lpg_shift;
  449. }
  450. int
  451. nvkm_mmu_new_(const struct nvkm_mmu_func *func, struct nvkm_device *device,
  452. int index, struct nvkm_mmu **pmmu)
  453. {
  454. if (!(*pmmu = kzalloc(sizeof(**pmmu), GFP_KERNEL)))
  455. return -ENOMEM;
  456. nvkm_mmu_ctor(func, device, index, *pmmu);
  457. return 0;
  458. }