intel-svm.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694
  1. /*
  2. * Copyright © 2015 Intel Corporation.
  3. *
  4. * This program is free software; you can redistribute it and/or modify it
  5. * under the terms and conditions of the GNU General Public License,
  6. * version 2, as published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope it will be useful, but WITHOUT
  9. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  10. * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
  11. * more details.
  12. *
  13. * Authors: David Woodhouse <dwmw2@infradead.org>
  14. */
  15. #include <linux/intel-iommu.h>
  16. #include <linux/mmu_notifier.h>
  17. #include <linux/sched.h>
  18. #include <linux/sched/mm.h>
  19. #include <linux/slab.h>
  20. #include <linux/intel-svm.h>
  21. #include <linux/rculist.h>
  22. #include <linux/pci.h>
  23. #include <linux/pci-ats.h>
  24. #include <linux/dmar.h>
  25. #include <linux/interrupt.h>
  26. #include <asm/page.h>
  27. static irqreturn_t prq_event_thread(int irq, void *d);
  28. struct pasid_entry {
  29. u64 val;
  30. };
  31. struct pasid_state_entry {
  32. u64 val;
  33. };
  34. int intel_svm_alloc_pasid_tables(struct intel_iommu *iommu)
  35. {
  36. struct page *pages;
  37. int order;
  38. /* Start at 2 because it's defined as 2^(1+PSS) */
  39. iommu->pasid_max = 2 << ecap_pss(iommu->ecap);
  40. /* Eventually I'm promised we will get a multi-level PASID table
  41. * and it won't have to be physically contiguous. Until then,
  42. * limit the size because 8MiB contiguous allocations can be hard
  43. * to come by. The limit of 0x20000, which is 1MiB for each of
  44. * the PASID and PASID-state tables, is somewhat arbitrary. */
  45. if (iommu->pasid_max > 0x20000)
  46. iommu->pasid_max = 0x20000;
  47. order = get_order(sizeof(struct pasid_entry) * iommu->pasid_max);
  48. pages = alloc_pages(GFP_KERNEL | __GFP_ZERO, order);
  49. if (!pages) {
  50. pr_warn("IOMMU: %s: Failed to allocate PASID table\n",
  51. iommu->name);
  52. return -ENOMEM;
  53. }
  54. iommu->pasid_table = page_address(pages);
  55. pr_info("%s: Allocated order %d PASID table.\n", iommu->name, order);
  56. if (ecap_dis(iommu->ecap)) {
  57. /* Just making it explicit... */
  58. BUILD_BUG_ON(sizeof(struct pasid_entry) != sizeof(struct pasid_state_entry));
  59. pages = alloc_pages(GFP_KERNEL | __GFP_ZERO, order);
  60. if (pages)
  61. iommu->pasid_state_table = page_address(pages);
  62. else
  63. pr_warn("IOMMU: %s: Failed to allocate PASID state table\n",
  64. iommu->name);
  65. }
  66. idr_init(&iommu->pasid_idr);
  67. return 0;
  68. }
  69. int intel_svm_free_pasid_tables(struct intel_iommu *iommu)
  70. {
  71. int order = get_order(sizeof(struct pasid_entry) * iommu->pasid_max);
  72. if (iommu->pasid_table) {
  73. free_pages((unsigned long)iommu->pasid_table, order);
  74. iommu->pasid_table = NULL;
  75. }
  76. if (iommu->pasid_state_table) {
  77. free_pages((unsigned long)iommu->pasid_state_table, order);
  78. iommu->pasid_state_table = NULL;
  79. }
  80. idr_destroy(&iommu->pasid_idr);
  81. return 0;
  82. }
  83. #define PRQ_ORDER 0
  84. int intel_svm_enable_prq(struct intel_iommu *iommu)
  85. {
  86. struct page *pages;
  87. int irq, ret;
  88. pages = alloc_pages(GFP_KERNEL | __GFP_ZERO, PRQ_ORDER);
  89. if (!pages) {
  90. pr_warn("IOMMU: %s: Failed to allocate page request queue\n",
  91. iommu->name);
  92. return -ENOMEM;
  93. }
  94. iommu->prq = page_address(pages);
  95. irq = dmar_alloc_hwirq(DMAR_UNITS_SUPPORTED + iommu->seq_id, iommu->node, iommu);
  96. if (irq <= 0) {
  97. pr_err("IOMMU: %s: Failed to create IRQ vector for page request queue\n",
  98. iommu->name);
  99. ret = -EINVAL;
  100. err:
  101. free_pages((unsigned long)iommu->prq, PRQ_ORDER);
  102. iommu->prq = NULL;
  103. return ret;
  104. }
  105. iommu->pr_irq = irq;
  106. snprintf(iommu->prq_name, sizeof(iommu->prq_name), "dmar%d-prq", iommu->seq_id);
  107. ret = request_threaded_irq(irq, NULL, prq_event_thread, IRQF_ONESHOT,
  108. iommu->prq_name, iommu);
  109. if (ret) {
  110. pr_err("IOMMU: %s: Failed to request IRQ for page request queue\n",
  111. iommu->name);
  112. dmar_free_hwirq(irq);
  113. iommu->pr_irq = 0;
  114. goto err;
  115. }
  116. dmar_writeq(iommu->reg + DMAR_PQH_REG, 0ULL);
  117. dmar_writeq(iommu->reg + DMAR_PQT_REG, 0ULL);
  118. dmar_writeq(iommu->reg + DMAR_PQA_REG, virt_to_phys(iommu->prq) | PRQ_ORDER);
  119. return 0;
  120. }
  121. int intel_svm_finish_prq(struct intel_iommu *iommu)
  122. {
  123. dmar_writeq(iommu->reg + DMAR_PQH_REG, 0ULL);
  124. dmar_writeq(iommu->reg + DMAR_PQT_REG, 0ULL);
  125. dmar_writeq(iommu->reg + DMAR_PQA_REG, 0ULL);
  126. if (iommu->pr_irq) {
  127. free_irq(iommu->pr_irq, iommu);
  128. dmar_free_hwirq(iommu->pr_irq);
  129. iommu->pr_irq = 0;
  130. }
  131. free_pages((unsigned long)iommu->prq, PRQ_ORDER);
  132. iommu->prq = NULL;
  133. return 0;
  134. }
  135. static void intel_flush_svm_range_dev (struct intel_svm *svm, struct intel_svm_dev *sdev,
  136. unsigned long address, unsigned long pages, int ih, int gl)
  137. {
  138. struct qi_desc desc;
  139. if (pages == -1) {
  140. /* For global kernel pages we have to flush them in *all* PASIDs
  141. * because that's the only option the hardware gives us. Despite
  142. * the fact that they are actually only accessible through one. */
  143. if (gl)
  144. desc.low = QI_EIOTLB_PASID(svm->pasid) | QI_EIOTLB_DID(sdev->did) |
  145. QI_EIOTLB_GRAN(QI_GRAN_ALL_ALL) | QI_EIOTLB_TYPE;
  146. else
  147. desc.low = QI_EIOTLB_PASID(svm->pasid) | QI_EIOTLB_DID(sdev->did) |
  148. QI_EIOTLB_GRAN(QI_GRAN_NONG_PASID) | QI_EIOTLB_TYPE;
  149. desc.high = 0;
  150. } else {
  151. int mask = ilog2(__roundup_pow_of_two(pages));
  152. desc.low = QI_EIOTLB_PASID(svm->pasid) | QI_EIOTLB_DID(sdev->did) |
  153. QI_EIOTLB_GRAN(QI_GRAN_PSI_PASID) | QI_EIOTLB_TYPE;
  154. desc.high = QI_EIOTLB_ADDR(address) | QI_EIOTLB_GL(gl) |
  155. QI_EIOTLB_IH(ih) | QI_EIOTLB_AM(mask);
  156. }
  157. qi_submit_sync(&desc, svm->iommu);
  158. if (sdev->dev_iotlb) {
  159. desc.low = QI_DEV_EIOTLB_PASID(svm->pasid) | QI_DEV_EIOTLB_SID(sdev->sid) |
  160. QI_DEV_EIOTLB_QDEP(sdev->qdep) | QI_DEIOTLB_TYPE;
  161. if (pages == -1) {
  162. desc.high = QI_DEV_EIOTLB_ADDR(-1ULL >> 1) | QI_DEV_EIOTLB_SIZE;
  163. } else if (pages > 1) {
  164. /* The least significant zero bit indicates the size. So,
  165. * for example, an "address" value of 0x12345f000 will
  166. * flush from 0x123440000 to 0x12347ffff (256KiB). */
  167. unsigned long last = address + ((unsigned long)(pages - 1) << VTD_PAGE_SHIFT);
  168. unsigned long mask = __rounddown_pow_of_two(address ^ last);;
  169. desc.high = QI_DEV_EIOTLB_ADDR((address & ~mask) | (mask - 1)) | QI_DEV_EIOTLB_SIZE;
  170. } else {
  171. desc.high = QI_DEV_EIOTLB_ADDR(address);
  172. }
  173. qi_submit_sync(&desc, svm->iommu);
  174. }
  175. }
  176. static void intel_flush_svm_range(struct intel_svm *svm, unsigned long address,
  177. unsigned long pages, int ih, int gl)
  178. {
  179. struct intel_svm_dev *sdev;
  180. /* Try deferred invalidate if available */
  181. if (svm->iommu->pasid_state_table &&
  182. !cmpxchg64(&svm->iommu->pasid_state_table[svm->pasid].val, 0, 1ULL << 63))
  183. return;
  184. rcu_read_lock();
  185. list_for_each_entry_rcu(sdev, &svm->devs, list)
  186. intel_flush_svm_range_dev(svm, sdev, address, pages, ih, gl);
  187. rcu_read_unlock();
  188. }
  189. static void intel_change_pte(struct mmu_notifier *mn, struct mm_struct *mm,
  190. unsigned long address, pte_t pte)
  191. {
  192. struct intel_svm *svm = container_of(mn, struct intel_svm, notifier);
  193. intel_flush_svm_range(svm, address, 1, 1, 0);
  194. }
  195. /* Pages have been freed at this point */
  196. static void intel_invalidate_range(struct mmu_notifier *mn,
  197. struct mm_struct *mm,
  198. unsigned long start, unsigned long end)
  199. {
  200. struct intel_svm *svm = container_of(mn, struct intel_svm, notifier);
  201. intel_flush_svm_range(svm, start,
  202. (end - start + PAGE_SIZE - 1) >> VTD_PAGE_SHIFT, 0, 0);
  203. }
  204. static void intel_flush_pasid_dev(struct intel_svm *svm, struct intel_svm_dev *sdev, int pasid)
  205. {
  206. struct qi_desc desc;
  207. desc.high = 0;
  208. desc.low = QI_PC_TYPE | QI_PC_DID(sdev->did) | QI_PC_PASID_SEL | QI_PC_PASID(pasid);
  209. qi_submit_sync(&desc, svm->iommu);
  210. }
  211. static void intel_mm_release(struct mmu_notifier *mn, struct mm_struct *mm)
  212. {
  213. struct intel_svm *svm = container_of(mn, struct intel_svm, notifier);
  214. struct intel_svm_dev *sdev;
  215. /* This might end up being called from exit_mmap(), *before* the page
  216. * tables are cleared. And __mmu_notifier_release() will delete us from
  217. * the list of notifiers so that our invalidate_range() callback doesn't
  218. * get called when the page tables are cleared. So we need to protect
  219. * against hardware accessing those page tables.
  220. *
  221. * We do it by clearing the entry in the PASID table and then flushing
  222. * the IOTLB and the PASID table caches. This might upset hardware;
  223. * perhaps we'll want to point the PASID to a dummy PGD (like the zero
  224. * page) so that we end up taking a fault that the hardware really
  225. * *has* to handle gracefully without affecting other processes.
  226. */
  227. svm->iommu->pasid_table[svm->pasid].val = 0;
  228. wmb();
  229. rcu_read_lock();
  230. list_for_each_entry_rcu(sdev, &svm->devs, list) {
  231. intel_flush_pasid_dev(svm, sdev, svm->pasid);
  232. intel_flush_svm_range_dev(svm, sdev, 0, -1, 0, !svm->mm);
  233. }
  234. rcu_read_unlock();
  235. }
  236. static const struct mmu_notifier_ops intel_mmuops = {
  237. .release = intel_mm_release,
  238. .change_pte = intel_change_pte,
  239. .invalidate_range = intel_invalidate_range,
  240. };
  241. static DEFINE_MUTEX(pasid_mutex);
  242. int intel_svm_bind_mm(struct device *dev, int *pasid, int flags, struct svm_dev_ops *ops)
  243. {
  244. struct intel_iommu *iommu = intel_svm_device_to_iommu(dev);
  245. struct intel_svm_dev *sdev;
  246. struct intel_svm *svm = NULL;
  247. struct mm_struct *mm = NULL;
  248. int pasid_max;
  249. int ret;
  250. if (WARN_ON(!iommu || !iommu->pasid_table))
  251. return -EINVAL;
  252. if (dev_is_pci(dev)) {
  253. pasid_max = pci_max_pasids(to_pci_dev(dev));
  254. if (pasid_max < 0)
  255. return -EINVAL;
  256. } else
  257. pasid_max = 1 << 20;
  258. if ((flags & SVM_FLAG_SUPERVISOR_MODE)) {
  259. if (!ecap_srs(iommu->ecap))
  260. return -EINVAL;
  261. } else if (pasid) {
  262. mm = get_task_mm(current);
  263. BUG_ON(!mm);
  264. }
  265. mutex_lock(&pasid_mutex);
  266. if (pasid && !(flags & SVM_FLAG_PRIVATE_PASID)) {
  267. int i;
  268. idr_for_each_entry(&iommu->pasid_idr, svm, i) {
  269. if (svm->mm != mm ||
  270. (svm->flags & SVM_FLAG_PRIVATE_PASID))
  271. continue;
  272. if (svm->pasid >= pasid_max) {
  273. dev_warn(dev,
  274. "Limited PASID width. Cannot use existing PASID %d\n",
  275. svm->pasid);
  276. ret = -ENOSPC;
  277. goto out;
  278. }
  279. list_for_each_entry(sdev, &svm->devs, list) {
  280. if (dev == sdev->dev) {
  281. if (sdev->ops != ops) {
  282. ret = -EBUSY;
  283. goto out;
  284. }
  285. sdev->users++;
  286. goto success;
  287. }
  288. }
  289. break;
  290. }
  291. }
  292. sdev = kzalloc(sizeof(*sdev), GFP_KERNEL);
  293. if (!sdev) {
  294. ret = -ENOMEM;
  295. goto out;
  296. }
  297. sdev->dev = dev;
  298. ret = intel_iommu_enable_pasid(iommu, sdev);
  299. if (ret || !pasid) {
  300. /* If they don't actually want to assign a PASID, this is
  301. * just an enabling check/preparation. */
  302. kfree(sdev);
  303. goto out;
  304. }
  305. /* Finish the setup now we know we're keeping it */
  306. sdev->users = 1;
  307. sdev->ops = ops;
  308. init_rcu_head(&sdev->rcu);
  309. if (!svm) {
  310. svm = kzalloc(sizeof(*svm), GFP_KERNEL);
  311. if (!svm) {
  312. ret = -ENOMEM;
  313. kfree(sdev);
  314. goto out;
  315. }
  316. svm->iommu = iommu;
  317. if (pasid_max > iommu->pasid_max)
  318. pasid_max = iommu->pasid_max;
  319. /* Do not use PASID 0 in caching mode (virtualised IOMMU) */
  320. ret = idr_alloc(&iommu->pasid_idr, svm,
  321. !!cap_caching_mode(iommu->cap),
  322. pasid_max - 1, GFP_KERNEL);
  323. if (ret < 0) {
  324. kfree(svm);
  325. goto out;
  326. }
  327. svm->pasid = ret;
  328. svm->notifier.ops = &intel_mmuops;
  329. svm->mm = mm;
  330. svm->flags = flags;
  331. INIT_LIST_HEAD_RCU(&svm->devs);
  332. ret = -ENOMEM;
  333. if (mm) {
  334. ret = mmu_notifier_register(&svm->notifier, mm);
  335. if (ret) {
  336. idr_remove(&svm->iommu->pasid_idr, svm->pasid);
  337. kfree(svm);
  338. kfree(sdev);
  339. goto out;
  340. }
  341. iommu->pasid_table[svm->pasid].val = (u64)__pa(mm->pgd) | 1;
  342. } else
  343. iommu->pasid_table[svm->pasid].val = (u64)__pa(init_mm.pgd) | 1 | (1ULL << 11);
  344. wmb();
  345. /* In caching mode, we still have to flush with PASID 0 when
  346. * a PASID table entry becomes present. Not entirely clear
  347. * *why* that would be the case — surely we could just issue
  348. * a flush with the PASID value that we've changed? The PASID
  349. * is the index into the table, after all. It's not like domain
  350. * IDs in the case of the equivalent context-entry change in
  351. * caching mode. And for that matter it's not entirely clear why
  352. * a VMM would be in the business of caching the PASID table
  353. * anyway. Surely that can be left entirely to the guest? */
  354. if (cap_caching_mode(iommu->cap))
  355. intel_flush_pasid_dev(svm, sdev, 0);
  356. }
  357. list_add_rcu(&sdev->list, &svm->devs);
  358. success:
  359. *pasid = svm->pasid;
  360. ret = 0;
  361. out:
  362. mutex_unlock(&pasid_mutex);
  363. if (mm)
  364. mmput(mm);
  365. return ret;
  366. }
  367. EXPORT_SYMBOL_GPL(intel_svm_bind_mm);
  368. int intel_svm_unbind_mm(struct device *dev, int pasid)
  369. {
  370. struct intel_svm_dev *sdev;
  371. struct intel_iommu *iommu;
  372. struct intel_svm *svm;
  373. int ret = -EINVAL;
  374. mutex_lock(&pasid_mutex);
  375. iommu = intel_svm_device_to_iommu(dev);
  376. if (!iommu || !iommu->pasid_table)
  377. goto out;
  378. svm = idr_find(&iommu->pasid_idr, pasid);
  379. if (!svm)
  380. goto out;
  381. list_for_each_entry(sdev, &svm->devs, list) {
  382. if (dev == sdev->dev) {
  383. ret = 0;
  384. sdev->users--;
  385. if (!sdev->users) {
  386. list_del_rcu(&sdev->list);
  387. /* Flush the PASID cache and IOTLB for this device.
  388. * Note that we do depend on the hardware *not* using
  389. * the PASID any more. Just as we depend on other
  390. * devices never using PASIDs that they have no right
  391. * to use. We have a *shared* PASID table, because it's
  392. * large and has to be physically contiguous. So it's
  393. * hard to be as defensive as we might like. */
  394. intel_flush_pasid_dev(svm, sdev, svm->pasid);
  395. intel_flush_svm_range_dev(svm, sdev, 0, -1, 0, !svm->mm);
  396. kfree_rcu(sdev, rcu);
  397. if (list_empty(&svm->devs)) {
  398. svm->iommu->pasid_table[svm->pasid].val = 0;
  399. wmb();
  400. idr_remove(&svm->iommu->pasid_idr, svm->pasid);
  401. if (svm->mm)
  402. mmu_notifier_unregister(&svm->notifier, svm->mm);
  403. /* We mandate that no page faults may be outstanding
  404. * for the PASID when intel_svm_unbind_mm() is called.
  405. * If that is not obeyed, subtle errors will happen.
  406. * Let's make them less subtle... */
  407. memset(svm, 0x6b, sizeof(*svm));
  408. kfree(svm);
  409. }
  410. }
  411. break;
  412. }
  413. }
  414. out:
  415. mutex_unlock(&pasid_mutex);
  416. return ret;
  417. }
  418. EXPORT_SYMBOL_GPL(intel_svm_unbind_mm);
  419. int intel_svm_is_pasid_valid(struct device *dev, int pasid)
  420. {
  421. struct intel_iommu *iommu;
  422. struct intel_svm *svm;
  423. int ret = -EINVAL;
  424. mutex_lock(&pasid_mutex);
  425. iommu = intel_svm_device_to_iommu(dev);
  426. if (!iommu || !iommu->pasid_table)
  427. goto out;
  428. svm = idr_find(&iommu->pasid_idr, pasid);
  429. if (!svm)
  430. goto out;
  431. /* init_mm is used in this case */
  432. if (!svm->mm)
  433. ret = 1;
  434. else if (atomic_read(&svm->mm->mm_users) > 0)
  435. ret = 1;
  436. else
  437. ret = 0;
  438. out:
  439. mutex_unlock(&pasid_mutex);
  440. return ret;
  441. }
  442. EXPORT_SYMBOL_GPL(intel_svm_is_pasid_valid);
  443. /* Page request queue descriptor */
  444. struct page_req_dsc {
  445. u64 srr:1;
  446. u64 bof:1;
  447. u64 pasid_present:1;
  448. u64 lpig:1;
  449. u64 pasid:20;
  450. u64 bus:8;
  451. u64 private:23;
  452. u64 prg_index:9;
  453. u64 rd_req:1;
  454. u64 wr_req:1;
  455. u64 exe_req:1;
  456. u64 priv_req:1;
  457. u64 devfn:8;
  458. u64 addr:52;
  459. };
  460. #define PRQ_RING_MASK ((0x1000 << PRQ_ORDER) - 0x10)
  461. static bool access_error(struct vm_area_struct *vma, struct page_req_dsc *req)
  462. {
  463. unsigned long requested = 0;
  464. if (req->exe_req)
  465. requested |= VM_EXEC;
  466. if (req->rd_req)
  467. requested |= VM_READ;
  468. if (req->wr_req)
  469. requested |= VM_WRITE;
  470. return (requested & ~vma->vm_flags) != 0;
  471. }
  472. static bool is_canonical_address(u64 addr)
  473. {
  474. int shift = 64 - (__VIRTUAL_MASK_SHIFT + 1);
  475. long saddr = (long) addr;
  476. return (((saddr << shift) >> shift) == saddr);
  477. }
  478. static irqreturn_t prq_event_thread(int irq, void *d)
  479. {
  480. struct intel_iommu *iommu = d;
  481. struct intel_svm *svm = NULL;
  482. int head, tail, handled = 0;
  483. /* Clear PPR bit before reading head/tail registers, to
  484. * ensure that we get a new interrupt if needed. */
  485. writel(DMA_PRS_PPR, iommu->reg + DMAR_PRS_REG);
  486. tail = dmar_readq(iommu->reg + DMAR_PQT_REG) & PRQ_RING_MASK;
  487. head = dmar_readq(iommu->reg + DMAR_PQH_REG) & PRQ_RING_MASK;
  488. while (head != tail) {
  489. struct intel_svm_dev *sdev;
  490. struct vm_area_struct *vma;
  491. struct page_req_dsc *req;
  492. struct qi_desc resp;
  493. int ret, result;
  494. u64 address;
  495. handled = 1;
  496. req = &iommu->prq[head / sizeof(*req)];
  497. result = QI_RESP_FAILURE;
  498. address = (u64)req->addr << VTD_PAGE_SHIFT;
  499. if (!req->pasid_present) {
  500. pr_err("%s: Page request without PASID: %08llx %08llx\n",
  501. iommu->name, ((unsigned long long *)req)[0],
  502. ((unsigned long long *)req)[1]);
  503. goto bad_req;
  504. }
  505. if (!svm || svm->pasid != req->pasid) {
  506. rcu_read_lock();
  507. svm = idr_find(&iommu->pasid_idr, req->pasid);
  508. /* It *can't* go away, because the driver is not permitted
  509. * to unbind the mm while any page faults are outstanding.
  510. * So we only need RCU to protect the internal idr code. */
  511. rcu_read_unlock();
  512. if (!svm) {
  513. pr_err("%s: Page request for invalid PASID %d: %08llx %08llx\n",
  514. iommu->name, req->pasid, ((unsigned long long *)req)[0],
  515. ((unsigned long long *)req)[1]);
  516. goto no_pasid;
  517. }
  518. }
  519. result = QI_RESP_INVALID;
  520. /* Since we're using init_mm.pgd directly, we should never take
  521. * any faults on kernel addresses. */
  522. if (!svm->mm)
  523. goto bad_req;
  524. /* If the mm is already defunct, don't handle faults. */
  525. if (!mmget_not_zero(svm->mm))
  526. goto bad_req;
  527. /* If address is not canonical, return invalid response */
  528. if (!is_canonical_address(address))
  529. goto bad_req;
  530. down_read(&svm->mm->mmap_sem);
  531. vma = find_extend_vma(svm->mm, address);
  532. if (!vma || address < vma->vm_start)
  533. goto invalid;
  534. if (access_error(vma, req))
  535. goto invalid;
  536. ret = handle_mm_fault(vma, address,
  537. req->wr_req ? FAULT_FLAG_WRITE : 0);
  538. if (ret & VM_FAULT_ERROR)
  539. goto invalid;
  540. result = QI_RESP_SUCCESS;
  541. invalid:
  542. up_read(&svm->mm->mmap_sem);
  543. mmput(svm->mm);
  544. bad_req:
  545. /* Accounting for major/minor faults? */
  546. rcu_read_lock();
  547. list_for_each_entry_rcu(sdev, &svm->devs, list) {
  548. if (sdev->sid == PCI_DEVID(req->bus, req->devfn))
  549. break;
  550. }
  551. /* Other devices can go away, but the drivers are not permitted
  552. * to unbind while any page faults might be in flight. So it's
  553. * OK to drop the 'lock' here now we have it. */
  554. rcu_read_unlock();
  555. if (WARN_ON(&sdev->list == &svm->devs))
  556. sdev = NULL;
  557. if (sdev && sdev->ops && sdev->ops->fault_cb) {
  558. int rwxp = (req->rd_req << 3) | (req->wr_req << 2) |
  559. (req->exe_req << 1) | (req->priv_req);
  560. sdev->ops->fault_cb(sdev->dev, req->pasid, req->addr, req->private, rwxp, result);
  561. }
  562. /* We get here in the error case where the PASID lookup failed,
  563. and these can be NULL. Do not use them below this point! */
  564. sdev = NULL;
  565. svm = NULL;
  566. no_pasid:
  567. if (req->lpig) {
  568. /* Page Group Response */
  569. resp.low = QI_PGRP_PASID(req->pasid) |
  570. QI_PGRP_DID((req->bus << 8) | req->devfn) |
  571. QI_PGRP_PASID_P(req->pasid_present) |
  572. QI_PGRP_RESP_TYPE;
  573. resp.high = QI_PGRP_IDX(req->prg_index) |
  574. QI_PGRP_PRIV(req->private) | QI_PGRP_RESP_CODE(result);
  575. qi_submit_sync(&resp, iommu);
  576. } else if (req->srr) {
  577. /* Page Stream Response */
  578. resp.low = QI_PSTRM_IDX(req->prg_index) |
  579. QI_PSTRM_PRIV(req->private) | QI_PSTRM_BUS(req->bus) |
  580. QI_PSTRM_PASID(req->pasid) | QI_PSTRM_RESP_TYPE;
  581. resp.high = QI_PSTRM_ADDR(address) | QI_PSTRM_DEVFN(req->devfn) |
  582. QI_PSTRM_RESP_CODE(result);
  583. qi_submit_sync(&resp, iommu);
  584. }
  585. head = (head + sizeof(*req)) & PRQ_RING_MASK;
  586. }
  587. dmar_writeq(iommu->reg + DMAR_PQH_REG, tail);
  588. return IRQ_RETVAL(handled);
  589. }