mr.c 44 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846
  1. /*
  2. * Copyright (c) 2013-2015, Mellanox Technologies. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. */
  32. #include <linux/kref.h>
  33. #include <linux/random.h>
  34. #include <linux/debugfs.h>
  35. #include <linux/export.h>
  36. #include <linux/delay.h>
  37. #include <rdma/ib_umem.h>
  38. #include <rdma/ib_umem_odp.h>
  39. #include <rdma/ib_verbs.h>
  40. #include "mlx5_ib.h"
  41. enum {
  42. MAX_PENDING_REG_MR = 8,
  43. };
  44. #define MLX5_UMR_ALIGN 2048
  45. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  46. static __be64 mlx5_ib_update_mtt_emergency_buffer[
  47. MLX5_UMR_MTT_MIN_CHUNK_SIZE/sizeof(__be64)]
  48. __aligned(MLX5_UMR_ALIGN);
  49. static DEFINE_MUTEX(mlx5_ib_update_mtt_emergency_buffer_mutex);
  50. #endif
  51. static int clean_mr(struct mlx5_ib_mr *mr);
  52. static int destroy_mkey(struct mlx5_ib_dev *dev, struct mlx5_ib_mr *mr)
  53. {
  54. int err = mlx5_core_destroy_mkey(dev->mdev, &mr->mmkey);
  55. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  56. /* Wait until all page fault handlers using the mr complete. */
  57. synchronize_srcu(&dev->mr_srcu);
  58. #endif
  59. return err;
  60. }
  61. static int order2idx(struct mlx5_ib_dev *dev, int order)
  62. {
  63. struct mlx5_mr_cache *cache = &dev->cache;
  64. if (order < cache->ent[0].order)
  65. return 0;
  66. else
  67. return order - cache->ent[0].order;
  68. }
  69. static bool use_umr_mtt_update(struct mlx5_ib_mr *mr, u64 start, u64 length)
  70. {
  71. return ((u64)1 << mr->order) * MLX5_ADAPTER_PAGE_SIZE >=
  72. length + (start & (MLX5_ADAPTER_PAGE_SIZE - 1));
  73. }
  74. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  75. static void update_odp_mr(struct mlx5_ib_mr *mr)
  76. {
  77. if (mr->umem->odp_data) {
  78. /*
  79. * This barrier prevents the compiler from moving the
  80. * setting of umem->odp_data->private to point to our
  81. * MR, before reg_umr finished, to ensure that the MR
  82. * initialization have finished before starting to
  83. * handle invalidations.
  84. */
  85. smp_wmb();
  86. mr->umem->odp_data->private = mr;
  87. /*
  88. * Make sure we will see the new
  89. * umem->odp_data->private value in the invalidation
  90. * routines, before we can get page faults on the
  91. * MR. Page faults can happen once we put the MR in
  92. * the tree, below this line. Without the barrier,
  93. * there can be a fault handling and an invalidation
  94. * before umem->odp_data->private == mr is visible to
  95. * the invalidation handler.
  96. */
  97. smp_wmb();
  98. }
  99. }
  100. #endif
  101. static void reg_mr_callback(int status, void *context)
  102. {
  103. struct mlx5_ib_mr *mr = context;
  104. struct mlx5_ib_dev *dev = mr->dev;
  105. struct mlx5_mr_cache *cache = &dev->cache;
  106. int c = order2idx(dev, mr->order);
  107. struct mlx5_cache_ent *ent = &cache->ent[c];
  108. u8 key;
  109. unsigned long flags;
  110. struct mlx5_mkey_table *table = &dev->mdev->priv.mkey_table;
  111. int err;
  112. spin_lock_irqsave(&ent->lock, flags);
  113. ent->pending--;
  114. spin_unlock_irqrestore(&ent->lock, flags);
  115. if (status) {
  116. mlx5_ib_warn(dev, "async reg mr failed. status %d\n", status);
  117. kfree(mr);
  118. dev->fill_delay = 1;
  119. mod_timer(&dev->delay_timer, jiffies + HZ);
  120. return;
  121. }
  122. spin_lock_irqsave(&dev->mdev->priv.mkey_lock, flags);
  123. key = dev->mdev->priv.mkey_key++;
  124. spin_unlock_irqrestore(&dev->mdev->priv.mkey_lock, flags);
  125. mr->mmkey.key = mlx5_idx_to_mkey(MLX5_GET(create_mkey_out, mr->out, mkey_index)) | key;
  126. cache->last_add = jiffies;
  127. spin_lock_irqsave(&ent->lock, flags);
  128. list_add_tail(&mr->list, &ent->head);
  129. ent->cur++;
  130. ent->size++;
  131. spin_unlock_irqrestore(&ent->lock, flags);
  132. write_lock_irqsave(&table->lock, flags);
  133. err = radix_tree_insert(&table->tree, mlx5_base_mkey(mr->mmkey.key),
  134. &mr->mmkey);
  135. if (err)
  136. pr_err("Error inserting to mkey tree. 0x%x\n", -err);
  137. write_unlock_irqrestore(&table->lock, flags);
  138. }
  139. static int add_keys(struct mlx5_ib_dev *dev, int c, int num)
  140. {
  141. struct mlx5_mr_cache *cache = &dev->cache;
  142. struct mlx5_cache_ent *ent = &cache->ent[c];
  143. int inlen = MLX5_ST_SZ_BYTES(create_mkey_in);
  144. struct mlx5_ib_mr *mr;
  145. int npages = 1 << ent->order;
  146. void *mkc;
  147. u32 *in;
  148. int err = 0;
  149. int i;
  150. in = kzalloc(inlen, GFP_KERNEL);
  151. if (!in)
  152. return -ENOMEM;
  153. mkc = MLX5_ADDR_OF(create_mkey_in, in, memory_key_mkey_entry);
  154. for (i = 0; i < num; i++) {
  155. if (ent->pending >= MAX_PENDING_REG_MR) {
  156. err = -EAGAIN;
  157. break;
  158. }
  159. mr = kzalloc(sizeof(*mr), GFP_KERNEL);
  160. if (!mr) {
  161. err = -ENOMEM;
  162. break;
  163. }
  164. mr->order = ent->order;
  165. mr->umred = 1;
  166. mr->dev = dev;
  167. MLX5_SET(mkc, mkc, free, 1);
  168. MLX5_SET(mkc, mkc, umr_en, 1);
  169. MLX5_SET(mkc, mkc, access_mode, MLX5_MKC_ACCESS_MODE_MTT);
  170. MLX5_SET(mkc, mkc, qpn, 0xffffff);
  171. MLX5_SET(mkc, mkc, translations_octword_size, (npages + 1) / 2);
  172. MLX5_SET(mkc, mkc, log_page_size, 12);
  173. spin_lock_irq(&ent->lock);
  174. ent->pending++;
  175. spin_unlock_irq(&ent->lock);
  176. err = mlx5_core_create_mkey_cb(dev->mdev, &mr->mmkey,
  177. in, inlen,
  178. mr->out, sizeof(mr->out),
  179. reg_mr_callback, mr);
  180. if (err) {
  181. spin_lock_irq(&ent->lock);
  182. ent->pending--;
  183. spin_unlock_irq(&ent->lock);
  184. mlx5_ib_warn(dev, "create mkey failed %d\n", err);
  185. kfree(mr);
  186. break;
  187. }
  188. }
  189. kfree(in);
  190. return err;
  191. }
  192. static void remove_keys(struct mlx5_ib_dev *dev, int c, int num)
  193. {
  194. struct mlx5_mr_cache *cache = &dev->cache;
  195. struct mlx5_cache_ent *ent = &cache->ent[c];
  196. struct mlx5_ib_mr *mr;
  197. int err;
  198. int i;
  199. for (i = 0; i < num; i++) {
  200. spin_lock_irq(&ent->lock);
  201. if (list_empty(&ent->head)) {
  202. spin_unlock_irq(&ent->lock);
  203. return;
  204. }
  205. mr = list_first_entry(&ent->head, struct mlx5_ib_mr, list);
  206. list_del(&mr->list);
  207. ent->cur--;
  208. ent->size--;
  209. spin_unlock_irq(&ent->lock);
  210. err = destroy_mkey(dev, mr);
  211. if (err)
  212. mlx5_ib_warn(dev, "failed destroy mkey\n");
  213. else
  214. kfree(mr);
  215. }
  216. }
  217. static ssize_t size_write(struct file *filp, const char __user *buf,
  218. size_t count, loff_t *pos)
  219. {
  220. struct mlx5_cache_ent *ent = filp->private_data;
  221. struct mlx5_ib_dev *dev = ent->dev;
  222. char lbuf[20];
  223. u32 var;
  224. int err;
  225. int c;
  226. if (copy_from_user(lbuf, buf, sizeof(lbuf)))
  227. return -EFAULT;
  228. c = order2idx(dev, ent->order);
  229. lbuf[sizeof(lbuf) - 1] = 0;
  230. if (sscanf(lbuf, "%u", &var) != 1)
  231. return -EINVAL;
  232. if (var < ent->limit)
  233. return -EINVAL;
  234. if (var > ent->size) {
  235. do {
  236. err = add_keys(dev, c, var - ent->size);
  237. if (err && err != -EAGAIN)
  238. return err;
  239. usleep_range(3000, 5000);
  240. } while (err);
  241. } else if (var < ent->size) {
  242. remove_keys(dev, c, ent->size - var);
  243. }
  244. return count;
  245. }
  246. static ssize_t size_read(struct file *filp, char __user *buf, size_t count,
  247. loff_t *pos)
  248. {
  249. struct mlx5_cache_ent *ent = filp->private_data;
  250. char lbuf[20];
  251. int err;
  252. if (*pos)
  253. return 0;
  254. err = snprintf(lbuf, sizeof(lbuf), "%d\n", ent->size);
  255. if (err < 0)
  256. return err;
  257. if (copy_to_user(buf, lbuf, err))
  258. return -EFAULT;
  259. *pos += err;
  260. return err;
  261. }
  262. static const struct file_operations size_fops = {
  263. .owner = THIS_MODULE,
  264. .open = simple_open,
  265. .write = size_write,
  266. .read = size_read,
  267. };
  268. static ssize_t limit_write(struct file *filp, const char __user *buf,
  269. size_t count, loff_t *pos)
  270. {
  271. struct mlx5_cache_ent *ent = filp->private_data;
  272. struct mlx5_ib_dev *dev = ent->dev;
  273. char lbuf[20];
  274. u32 var;
  275. int err;
  276. int c;
  277. if (copy_from_user(lbuf, buf, sizeof(lbuf)))
  278. return -EFAULT;
  279. c = order2idx(dev, ent->order);
  280. lbuf[sizeof(lbuf) - 1] = 0;
  281. if (sscanf(lbuf, "%u", &var) != 1)
  282. return -EINVAL;
  283. if (var > ent->size)
  284. return -EINVAL;
  285. ent->limit = var;
  286. if (ent->cur < ent->limit) {
  287. err = add_keys(dev, c, 2 * ent->limit - ent->cur);
  288. if (err)
  289. return err;
  290. }
  291. return count;
  292. }
  293. static ssize_t limit_read(struct file *filp, char __user *buf, size_t count,
  294. loff_t *pos)
  295. {
  296. struct mlx5_cache_ent *ent = filp->private_data;
  297. char lbuf[20];
  298. int err;
  299. if (*pos)
  300. return 0;
  301. err = snprintf(lbuf, sizeof(lbuf), "%d\n", ent->limit);
  302. if (err < 0)
  303. return err;
  304. if (copy_to_user(buf, lbuf, err))
  305. return -EFAULT;
  306. *pos += err;
  307. return err;
  308. }
  309. static const struct file_operations limit_fops = {
  310. .owner = THIS_MODULE,
  311. .open = simple_open,
  312. .write = limit_write,
  313. .read = limit_read,
  314. };
  315. static int someone_adding(struct mlx5_mr_cache *cache)
  316. {
  317. int i;
  318. for (i = 0; i < MAX_MR_CACHE_ENTRIES; i++) {
  319. if (cache->ent[i].cur < cache->ent[i].limit)
  320. return 1;
  321. }
  322. return 0;
  323. }
  324. static void __cache_work_func(struct mlx5_cache_ent *ent)
  325. {
  326. struct mlx5_ib_dev *dev = ent->dev;
  327. struct mlx5_mr_cache *cache = &dev->cache;
  328. int i = order2idx(dev, ent->order);
  329. int err;
  330. if (cache->stopped)
  331. return;
  332. ent = &dev->cache.ent[i];
  333. if (ent->cur < 2 * ent->limit && !dev->fill_delay) {
  334. err = add_keys(dev, i, 1);
  335. if (ent->cur < 2 * ent->limit) {
  336. if (err == -EAGAIN) {
  337. mlx5_ib_dbg(dev, "returned eagain, order %d\n",
  338. i + 2);
  339. queue_delayed_work(cache->wq, &ent->dwork,
  340. msecs_to_jiffies(3));
  341. } else if (err) {
  342. mlx5_ib_warn(dev, "command failed order %d, err %d\n",
  343. i + 2, err);
  344. queue_delayed_work(cache->wq, &ent->dwork,
  345. msecs_to_jiffies(1000));
  346. } else {
  347. queue_work(cache->wq, &ent->work);
  348. }
  349. }
  350. } else if (ent->cur > 2 * ent->limit) {
  351. /*
  352. * The remove_keys() logic is performed as garbage collection
  353. * task. Such task is intended to be run when no other active
  354. * processes are running.
  355. *
  356. * The need_resched() will return TRUE if there are user tasks
  357. * to be activated in near future.
  358. *
  359. * In such case, we don't execute remove_keys() and postpone
  360. * the garbage collection work to try to run in next cycle,
  361. * in order to free CPU resources to other tasks.
  362. */
  363. if (!need_resched() && !someone_adding(cache) &&
  364. time_after(jiffies, cache->last_add + 300 * HZ)) {
  365. remove_keys(dev, i, 1);
  366. if (ent->cur > ent->limit)
  367. queue_work(cache->wq, &ent->work);
  368. } else {
  369. queue_delayed_work(cache->wq, &ent->dwork, 300 * HZ);
  370. }
  371. }
  372. }
  373. static void delayed_cache_work_func(struct work_struct *work)
  374. {
  375. struct mlx5_cache_ent *ent;
  376. ent = container_of(work, struct mlx5_cache_ent, dwork.work);
  377. __cache_work_func(ent);
  378. }
  379. static void cache_work_func(struct work_struct *work)
  380. {
  381. struct mlx5_cache_ent *ent;
  382. ent = container_of(work, struct mlx5_cache_ent, work);
  383. __cache_work_func(ent);
  384. }
  385. static struct mlx5_ib_mr *alloc_cached_mr(struct mlx5_ib_dev *dev, int order)
  386. {
  387. struct mlx5_mr_cache *cache = &dev->cache;
  388. struct mlx5_ib_mr *mr = NULL;
  389. struct mlx5_cache_ent *ent;
  390. int c;
  391. int i;
  392. c = order2idx(dev, order);
  393. if (c < 0 || c >= MAX_MR_CACHE_ENTRIES) {
  394. mlx5_ib_warn(dev, "order %d, cache index %d\n", order, c);
  395. return NULL;
  396. }
  397. for (i = c; i < MAX_MR_CACHE_ENTRIES; i++) {
  398. ent = &cache->ent[i];
  399. mlx5_ib_dbg(dev, "order %d, cache index %d\n", ent->order, i);
  400. spin_lock_irq(&ent->lock);
  401. if (!list_empty(&ent->head)) {
  402. mr = list_first_entry(&ent->head, struct mlx5_ib_mr,
  403. list);
  404. list_del(&mr->list);
  405. ent->cur--;
  406. spin_unlock_irq(&ent->lock);
  407. if (ent->cur < ent->limit)
  408. queue_work(cache->wq, &ent->work);
  409. break;
  410. }
  411. spin_unlock_irq(&ent->lock);
  412. queue_work(cache->wq, &ent->work);
  413. }
  414. if (!mr)
  415. cache->ent[c].miss++;
  416. return mr;
  417. }
  418. static void free_cached_mr(struct mlx5_ib_dev *dev, struct mlx5_ib_mr *mr)
  419. {
  420. struct mlx5_mr_cache *cache = &dev->cache;
  421. struct mlx5_cache_ent *ent;
  422. int shrink = 0;
  423. int c;
  424. c = order2idx(dev, mr->order);
  425. if (c < 0 || c >= MAX_MR_CACHE_ENTRIES) {
  426. mlx5_ib_warn(dev, "order %d, cache index %d\n", mr->order, c);
  427. return;
  428. }
  429. ent = &cache->ent[c];
  430. spin_lock_irq(&ent->lock);
  431. list_add_tail(&mr->list, &ent->head);
  432. ent->cur++;
  433. if (ent->cur > 2 * ent->limit)
  434. shrink = 1;
  435. spin_unlock_irq(&ent->lock);
  436. if (shrink)
  437. queue_work(cache->wq, &ent->work);
  438. }
  439. static void clean_keys(struct mlx5_ib_dev *dev, int c)
  440. {
  441. struct mlx5_mr_cache *cache = &dev->cache;
  442. struct mlx5_cache_ent *ent = &cache->ent[c];
  443. struct mlx5_ib_mr *mr;
  444. int err;
  445. cancel_delayed_work(&ent->dwork);
  446. while (1) {
  447. spin_lock_irq(&ent->lock);
  448. if (list_empty(&ent->head)) {
  449. spin_unlock_irq(&ent->lock);
  450. return;
  451. }
  452. mr = list_first_entry(&ent->head, struct mlx5_ib_mr, list);
  453. list_del(&mr->list);
  454. ent->cur--;
  455. ent->size--;
  456. spin_unlock_irq(&ent->lock);
  457. err = destroy_mkey(dev, mr);
  458. if (err)
  459. mlx5_ib_warn(dev, "failed destroy mkey\n");
  460. else
  461. kfree(mr);
  462. }
  463. }
  464. static int mlx5_mr_cache_debugfs_init(struct mlx5_ib_dev *dev)
  465. {
  466. struct mlx5_mr_cache *cache = &dev->cache;
  467. struct mlx5_cache_ent *ent;
  468. int i;
  469. if (!mlx5_debugfs_root)
  470. return 0;
  471. cache->root = debugfs_create_dir("mr_cache", dev->mdev->priv.dbg_root);
  472. if (!cache->root)
  473. return -ENOMEM;
  474. for (i = 0; i < MAX_MR_CACHE_ENTRIES; i++) {
  475. ent = &cache->ent[i];
  476. sprintf(ent->name, "%d", ent->order);
  477. ent->dir = debugfs_create_dir(ent->name, cache->root);
  478. if (!ent->dir)
  479. return -ENOMEM;
  480. ent->fsize = debugfs_create_file("size", 0600, ent->dir, ent,
  481. &size_fops);
  482. if (!ent->fsize)
  483. return -ENOMEM;
  484. ent->flimit = debugfs_create_file("limit", 0600, ent->dir, ent,
  485. &limit_fops);
  486. if (!ent->flimit)
  487. return -ENOMEM;
  488. ent->fcur = debugfs_create_u32("cur", 0400, ent->dir,
  489. &ent->cur);
  490. if (!ent->fcur)
  491. return -ENOMEM;
  492. ent->fmiss = debugfs_create_u32("miss", 0600, ent->dir,
  493. &ent->miss);
  494. if (!ent->fmiss)
  495. return -ENOMEM;
  496. }
  497. return 0;
  498. }
  499. static void mlx5_mr_cache_debugfs_cleanup(struct mlx5_ib_dev *dev)
  500. {
  501. if (!mlx5_debugfs_root)
  502. return;
  503. debugfs_remove_recursive(dev->cache.root);
  504. }
  505. static void delay_time_func(unsigned long ctx)
  506. {
  507. struct mlx5_ib_dev *dev = (struct mlx5_ib_dev *)ctx;
  508. dev->fill_delay = 0;
  509. }
  510. int mlx5_mr_cache_init(struct mlx5_ib_dev *dev)
  511. {
  512. struct mlx5_mr_cache *cache = &dev->cache;
  513. struct mlx5_cache_ent *ent;
  514. int limit;
  515. int err;
  516. int i;
  517. cache->wq = alloc_ordered_workqueue("mkey_cache", WQ_MEM_RECLAIM);
  518. if (!cache->wq) {
  519. mlx5_ib_warn(dev, "failed to create work queue\n");
  520. return -ENOMEM;
  521. }
  522. setup_timer(&dev->delay_timer, delay_time_func, (unsigned long)dev);
  523. for (i = 0; i < MAX_MR_CACHE_ENTRIES; i++) {
  524. INIT_LIST_HEAD(&cache->ent[i].head);
  525. spin_lock_init(&cache->ent[i].lock);
  526. ent = &cache->ent[i];
  527. INIT_LIST_HEAD(&ent->head);
  528. spin_lock_init(&ent->lock);
  529. ent->order = i + 2;
  530. ent->dev = dev;
  531. if (dev->mdev->profile->mask & MLX5_PROF_MASK_MR_CACHE)
  532. limit = dev->mdev->profile->mr_cache[i].limit;
  533. else
  534. limit = 0;
  535. INIT_WORK(&ent->work, cache_work_func);
  536. INIT_DELAYED_WORK(&ent->dwork, delayed_cache_work_func);
  537. ent->limit = limit;
  538. queue_work(cache->wq, &ent->work);
  539. }
  540. err = mlx5_mr_cache_debugfs_init(dev);
  541. if (err)
  542. mlx5_ib_warn(dev, "cache debugfs failure\n");
  543. return 0;
  544. }
  545. int mlx5_mr_cache_cleanup(struct mlx5_ib_dev *dev)
  546. {
  547. int i;
  548. dev->cache.stopped = 1;
  549. flush_workqueue(dev->cache.wq);
  550. mlx5_mr_cache_debugfs_cleanup(dev);
  551. for (i = 0; i < MAX_MR_CACHE_ENTRIES; i++)
  552. clean_keys(dev, i);
  553. destroy_workqueue(dev->cache.wq);
  554. del_timer_sync(&dev->delay_timer);
  555. return 0;
  556. }
  557. struct ib_mr *mlx5_ib_get_dma_mr(struct ib_pd *pd, int acc)
  558. {
  559. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  560. int inlen = MLX5_ST_SZ_BYTES(create_mkey_in);
  561. struct mlx5_core_dev *mdev = dev->mdev;
  562. struct mlx5_ib_mr *mr;
  563. void *mkc;
  564. u32 *in;
  565. int err;
  566. mr = kzalloc(sizeof(*mr), GFP_KERNEL);
  567. if (!mr)
  568. return ERR_PTR(-ENOMEM);
  569. in = kzalloc(inlen, GFP_KERNEL);
  570. if (!in) {
  571. err = -ENOMEM;
  572. goto err_free;
  573. }
  574. mkc = MLX5_ADDR_OF(create_mkey_in, in, memory_key_mkey_entry);
  575. MLX5_SET(mkc, mkc, access_mode, MLX5_MKC_ACCESS_MODE_PA);
  576. MLX5_SET(mkc, mkc, a, !!(acc & IB_ACCESS_REMOTE_ATOMIC));
  577. MLX5_SET(mkc, mkc, rw, !!(acc & IB_ACCESS_REMOTE_WRITE));
  578. MLX5_SET(mkc, mkc, rr, !!(acc & IB_ACCESS_REMOTE_READ));
  579. MLX5_SET(mkc, mkc, lw, !!(acc & IB_ACCESS_LOCAL_WRITE));
  580. MLX5_SET(mkc, mkc, lr, 1);
  581. MLX5_SET(mkc, mkc, length64, 1);
  582. MLX5_SET(mkc, mkc, pd, to_mpd(pd)->pdn);
  583. MLX5_SET(mkc, mkc, qpn, 0xffffff);
  584. MLX5_SET64(mkc, mkc, start_addr, 0);
  585. err = mlx5_core_create_mkey(mdev, &mr->mmkey, in, inlen);
  586. if (err)
  587. goto err_in;
  588. kfree(in);
  589. mr->ibmr.lkey = mr->mmkey.key;
  590. mr->ibmr.rkey = mr->mmkey.key;
  591. mr->umem = NULL;
  592. return &mr->ibmr;
  593. err_in:
  594. kfree(in);
  595. err_free:
  596. kfree(mr);
  597. return ERR_PTR(err);
  598. }
  599. static int get_octo_len(u64 addr, u64 len, int page_size)
  600. {
  601. u64 offset;
  602. int npages;
  603. offset = addr & (page_size - 1);
  604. npages = ALIGN(len + offset, page_size) >> ilog2(page_size);
  605. return (npages + 1) / 2;
  606. }
  607. static int use_umr(int order)
  608. {
  609. return order <= MLX5_MAX_UMR_SHIFT;
  610. }
  611. static int dma_map_mr_pas(struct mlx5_ib_dev *dev, struct ib_umem *umem,
  612. int npages, int page_shift, int *size,
  613. __be64 **mr_pas, dma_addr_t *dma)
  614. {
  615. __be64 *pas;
  616. struct device *ddev = dev->ib_dev.dma_device;
  617. /*
  618. * UMR copies MTTs in units of MLX5_UMR_MTT_ALIGNMENT bytes.
  619. * To avoid copying garbage after the pas array, we allocate
  620. * a little more.
  621. */
  622. *size = ALIGN(sizeof(u64) * npages, MLX5_UMR_MTT_ALIGNMENT);
  623. *mr_pas = kmalloc(*size + MLX5_UMR_ALIGN - 1, GFP_KERNEL);
  624. if (!(*mr_pas))
  625. return -ENOMEM;
  626. pas = PTR_ALIGN(*mr_pas, MLX5_UMR_ALIGN);
  627. mlx5_ib_populate_pas(dev, umem, page_shift, pas, MLX5_IB_MTT_PRESENT);
  628. /* Clear padding after the actual pages. */
  629. memset(pas + npages, 0, *size - npages * sizeof(u64));
  630. *dma = dma_map_single(ddev, pas, *size, DMA_TO_DEVICE);
  631. if (dma_mapping_error(ddev, *dma)) {
  632. kfree(*mr_pas);
  633. return -ENOMEM;
  634. }
  635. return 0;
  636. }
  637. static void prep_umr_wqe_common(struct ib_pd *pd, struct ib_send_wr *wr,
  638. struct ib_sge *sg, u64 dma, int n, u32 key,
  639. int page_shift)
  640. {
  641. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  642. struct mlx5_umr_wr *umrwr = umr_wr(wr);
  643. sg->addr = dma;
  644. sg->length = ALIGN(sizeof(u64) * n, 64);
  645. sg->lkey = dev->umrc.pd->local_dma_lkey;
  646. wr->next = NULL;
  647. wr->sg_list = sg;
  648. if (n)
  649. wr->num_sge = 1;
  650. else
  651. wr->num_sge = 0;
  652. wr->opcode = MLX5_IB_WR_UMR;
  653. umrwr->npages = n;
  654. umrwr->page_shift = page_shift;
  655. umrwr->mkey = key;
  656. }
  657. static void prep_umr_reg_wqe(struct ib_pd *pd, struct ib_send_wr *wr,
  658. struct ib_sge *sg, u64 dma, int n, u32 key,
  659. int page_shift, u64 virt_addr, u64 len,
  660. int access_flags)
  661. {
  662. struct mlx5_umr_wr *umrwr = umr_wr(wr);
  663. prep_umr_wqe_common(pd, wr, sg, dma, n, key, page_shift);
  664. wr->send_flags = 0;
  665. umrwr->target.virt_addr = virt_addr;
  666. umrwr->length = len;
  667. umrwr->access_flags = access_flags;
  668. umrwr->pd = pd;
  669. }
  670. static void prep_umr_unreg_wqe(struct mlx5_ib_dev *dev,
  671. struct ib_send_wr *wr, u32 key)
  672. {
  673. struct mlx5_umr_wr *umrwr = umr_wr(wr);
  674. wr->send_flags = MLX5_IB_SEND_UMR_UNREG | MLX5_IB_SEND_UMR_FAIL_IF_FREE;
  675. wr->opcode = MLX5_IB_WR_UMR;
  676. umrwr->mkey = key;
  677. }
  678. static struct ib_umem *mr_umem_get(struct ib_pd *pd, u64 start, u64 length,
  679. int access_flags, int *npages,
  680. int *page_shift, int *ncont, int *order)
  681. {
  682. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  683. struct ib_umem *umem = ib_umem_get(pd->uobject->context, start, length,
  684. access_flags, 0);
  685. if (IS_ERR(umem)) {
  686. mlx5_ib_err(dev, "umem get failed (%ld)\n", PTR_ERR(umem));
  687. return (void *)umem;
  688. }
  689. mlx5_ib_cont_pages(umem, start, npages, page_shift, ncont, order);
  690. if (!*npages) {
  691. mlx5_ib_warn(dev, "avoid zero region\n");
  692. ib_umem_release(umem);
  693. return ERR_PTR(-EINVAL);
  694. }
  695. mlx5_ib_dbg(dev, "npages %d, ncont %d, order %d, page_shift %d\n",
  696. *npages, *ncont, *order, *page_shift);
  697. return umem;
  698. }
  699. static void mlx5_ib_umr_done(struct ib_cq *cq, struct ib_wc *wc)
  700. {
  701. struct mlx5_ib_umr_context *context =
  702. container_of(wc->wr_cqe, struct mlx5_ib_umr_context, cqe);
  703. context->status = wc->status;
  704. complete(&context->done);
  705. }
  706. static inline void mlx5_ib_init_umr_context(struct mlx5_ib_umr_context *context)
  707. {
  708. context->cqe.done = mlx5_ib_umr_done;
  709. context->status = -1;
  710. init_completion(&context->done);
  711. }
  712. static struct mlx5_ib_mr *reg_umr(struct ib_pd *pd, struct ib_umem *umem,
  713. u64 virt_addr, u64 len, int npages,
  714. int page_shift, int order, int access_flags)
  715. {
  716. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  717. struct device *ddev = dev->ib_dev.dma_device;
  718. struct umr_common *umrc = &dev->umrc;
  719. struct mlx5_ib_umr_context umr_context;
  720. struct mlx5_umr_wr umrwr = {};
  721. struct ib_send_wr *bad;
  722. struct mlx5_ib_mr *mr;
  723. struct ib_sge sg;
  724. int size;
  725. __be64 *mr_pas;
  726. dma_addr_t dma;
  727. int err = 0;
  728. int i;
  729. for (i = 0; i < 1; i++) {
  730. mr = alloc_cached_mr(dev, order);
  731. if (mr)
  732. break;
  733. err = add_keys(dev, order2idx(dev, order), 1);
  734. if (err && err != -EAGAIN) {
  735. mlx5_ib_warn(dev, "add_keys failed, err %d\n", err);
  736. break;
  737. }
  738. }
  739. if (!mr)
  740. return ERR_PTR(-EAGAIN);
  741. err = dma_map_mr_pas(dev, umem, npages, page_shift, &size, &mr_pas,
  742. &dma);
  743. if (err)
  744. goto free_mr;
  745. mlx5_ib_init_umr_context(&umr_context);
  746. umrwr.wr.wr_cqe = &umr_context.cqe;
  747. prep_umr_reg_wqe(pd, &umrwr.wr, &sg, dma, npages, mr->mmkey.key,
  748. page_shift, virt_addr, len, access_flags);
  749. down(&umrc->sem);
  750. err = ib_post_send(umrc->qp, &umrwr.wr, &bad);
  751. if (err) {
  752. mlx5_ib_warn(dev, "post send failed, err %d\n", err);
  753. goto unmap_dma;
  754. } else {
  755. wait_for_completion(&umr_context.done);
  756. if (umr_context.status != IB_WC_SUCCESS) {
  757. mlx5_ib_warn(dev, "reg umr failed\n");
  758. err = -EFAULT;
  759. }
  760. }
  761. mr->mmkey.iova = virt_addr;
  762. mr->mmkey.size = len;
  763. mr->mmkey.pd = to_mpd(pd)->pdn;
  764. mr->live = 1;
  765. unmap_dma:
  766. up(&umrc->sem);
  767. dma_unmap_single(ddev, dma, size, DMA_TO_DEVICE);
  768. kfree(mr_pas);
  769. free_mr:
  770. if (err) {
  771. free_cached_mr(dev, mr);
  772. return ERR_PTR(err);
  773. }
  774. return mr;
  775. }
  776. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  777. int mlx5_ib_update_mtt(struct mlx5_ib_mr *mr, u64 start_page_index, int npages,
  778. int zap)
  779. {
  780. struct mlx5_ib_dev *dev = mr->dev;
  781. struct device *ddev = dev->ib_dev.dma_device;
  782. struct umr_common *umrc = &dev->umrc;
  783. struct mlx5_ib_umr_context umr_context;
  784. struct ib_umem *umem = mr->umem;
  785. int size;
  786. __be64 *pas;
  787. dma_addr_t dma;
  788. struct ib_send_wr *bad;
  789. struct mlx5_umr_wr wr;
  790. struct ib_sge sg;
  791. int err = 0;
  792. const int page_index_alignment = MLX5_UMR_MTT_ALIGNMENT / sizeof(u64);
  793. const int page_index_mask = page_index_alignment - 1;
  794. size_t pages_mapped = 0;
  795. size_t pages_to_map = 0;
  796. size_t pages_iter = 0;
  797. int use_emergency_buf = 0;
  798. /* UMR copies MTTs in units of MLX5_UMR_MTT_ALIGNMENT bytes,
  799. * so we need to align the offset and length accordingly */
  800. if (start_page_index & page_index_mask) {
  801. npages += start_page_index & page_index_mask;
  802. start_page_index &= ~page_index_mask;
  803. }
  804. pages_to_map = ALIGN(npages, page_index_alignment);
  805. if (start_page_index + pages_to_map > MLX5_MAX_UMR_PAGES)
  806. return -EINVAL;
  807. size = sizeof(u64) * pages_to_map;
  808. size = min_t(int, PAGE_SIZE, size);
  809. /* We allocate with GFP_ATOMIC to avoid recursion into page-reclaim
  810. * code, when we are called from an invalidation. The pas buffer must
  811. * be 2k-aligned for Connect-IB. */
  812. pas = (__be64 *)get_zeroed_page(GFP_ATOMIC);
  813. if (!pas) {
  814. mlx5_ib_warn(dev, "unable to allocate memory during MTT update, falling back to slower chunked mechanism.\n");
  815. pas = mlx5_ib_update_mtt_emergency_buffer;
  816. size = MLX5_UMR_MTT_MIN_CHUNK_SIZE;
  817. use_emergency_buf = 1;
  818. mutex_lock(&mlx5_ib_update_mtt_emergency_buffer_mutex);
  819. memset(pas, 0, size);
  820. }
  821. pages_iter = size / sizeof(u64);
  822. dma = dma_map_single(ddev, pas, size, DMA_TO_DEVICE);
  823. if (dma_mapping_error(ddev, dma)) {
  824. mlx5_ib_err(dev, "unable to map DMA during MTT update.\n");
  825. err = -ENOMEM;
  826. goto free_pas;
  827. }
  828. for (pages_mapped = 0;
  829. pages_mapped < pages_to_map && !err;
  830. pages_mapped += pages_iter, start_page_index += pages_iter) {
  831. dma_sync_single_for_cpu(ddev, dma, size, DMA_TO_DEVICE);
  832. npages = min_t(size_t,
  833. pages_iter,
  834. ib_umem_num_pages(umem) - start_page_index);
  835. if (!zap) {
  836. __mlx5_ib_populate_pas(dev, umem, PAGE_SHIFT,
  837. start_page_index, npages, pas,
  838. MLX5_IB_MTT_PRESENT);
  839. /* Clear padding after the pages brought from the
  840. * umem. */
  841. memset(pas + npages, 0, size - npages * sizeof(u64));
  842. }
  843. dma_sync_single_for_device(ddev, dma, size, DMA_TO_DEVICE);
  844. mlx5_ib_init_umr_context(&umr_context);
  845. memset(&wr, 0, sizeof(wr));
  846. wr.wr.wr_cqe = &umr_context.cqe;
  847. sg.addr = dma;
  848. sg.length = ALIGN(npages * sizeof(u64),
  849. MLX5_UMR_MTT_ALIGNMENT);
  850. sg.lkey = dev->umrc.pd->local_dma_lkey;
  851. wr.wr.send_flags = MLX5_IB_SEND_UMR_FAIL_IF_FREE |
  852. MLX5_IB_SEND_UMR_UPDATE_MTT;
  853. wr.wr.sg_list = &sg;
  854. wr.wr.num_sge = 1;
  855. wr.wr.opcode = MLX5_IB_WR_UMR;
  856. wr.npages = sg.length / sizeof(u64);
  857. wr.page_shift = PAGE_SHIFT;
  858. wr.mkey = mr->mmkey.key;
  859. wr.target.offset = start_page_index;
  860. down(&umrc->sem);
  861. err = ib_post_send(umrc->qp, &wr.wr, &bad);
  862. if (err) {
  863. mlx5_ib_err(dev, "UMR post send failed, err %d\n", err);
  864. } else {
  865. wait_for_completion(&umr_context.done);
  866. if (umr_context.status != IB_WC_SUCCESS) {
  867. mlx5_ib_err(dev, "UMR completion failed, code %d\n",
  868. umr_context.status);
  869. err = -EFAULT;
  870. }
  871. }
  872. up(&umrc->sem);
  873. }
  874. dma_unmap_single(ddev, dma, size, DMA_TO_DEVICE);
  875. free_pas:
  876. if (!use_emergency_buf)
  877. free_page((unsigned long)pas);
  878. else
  879. mutex_unlock(&mlx5_ib_update_mtt_emergency_buffer_mutex);
  880. return err;
  881. }
  882. #endif
  883. /*
  884. * If ibmr is NULL it will be allocated by reg_create.
  885. * Else, the given ibmr will be used.
  886. */
  887. static struct mlx5_ib_mr *reg_create(struct ib_mr *ibmr, struct ib_pd *pd,
  888. u64 virt_addr, u64 length,
  889. struct ib_umem *umem, int npages,
  890. int page_shift, int access_flags)
  891. {
  892. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  893. struct mlx5_ib_mr *mr;
  894. __be64 *pas;
  895. void *mkc;
  896. int inlen;
  897. u32 *in;
  898. int err;
  899. bool pg_cap = !!(MLX5_CAP_GEN(dev->mdev, pg));
  900. mr = ibmr ? to_mmr(ibmr) : kzalloc(sizeof(*mr), GFP_KERNEL);
  901. if (!mr)
  902. return ERR_PTR(-ENOMEM);
  903. inlen = MLX5_ST_SZ_BYTES(create_mkey_in) +
  904. sizeof(*pas) * ((npages + 1) / 2) * 2;
  905. in = mlx5_vzalloc(inlen);
  906. if (!in) {
  907. err = -ENOMEM;
  908. goto err_1;
  909. }
  910. pas = (__be64 *)MLX5_ADDR_OF(create_mkey_in, in, klm_pas_mtt);
  911. mlx5_ib_populate_pas(dev, umem, page_shift, pas,
  912. pg_cap ? MLX5_IB_MTT_PRESENT : 0);
  913. /* The pg_access bit allows setting the access flags
  914. * in the page list submitted with the command. */
  915. MLX5_SET(create_mkey_in, in, pg_access, !!(pg_cap));
  916. mkc = MLX5_ADDR_OF(create_mkey_in, in, memory_key_mkey_entry);
  917. MLX5_SET(mkc, mkc, access_mode, MLX5_MKC_ACCESS_MODE_MTT);
  918. MLX5_SET(mkc, mkc, a, !!(access_flags & IB_ACCESS_REMOTE_ATOMIC));
  919. MLX5_SET(mkc, mkc, rw, !!(access_flags & IB_ACCESS_REMOTE_WRITE));
  920. MLX5_SET(mkc, mkc, rr, !!(access_flags & IB_ACCESS_REMOTE_READ));
  921. MLX5_SET(mkc, mkc, lw, !!(access_flags & IB_ACCESS_LOCAL_WRITE));
  922. MLX5_SET(mkc, mkc, lr, 1);
  923. MLX5_SET64(mkc, mkc, start_addr, virt_addr);
  924. MLX5_SET64(mkc, mkc, len, length);
  925. MLX5_SET(mkc, mkc, pd, to_mpd(pd)->pdn);
  926. MLX5_SET(mkc, mkc, bsf_octword_size, 0);
  927. MLX5_SET(mkc, mkc, translations_octword_size,
  928. get_octo_len(virt_addr, length, 1 << page_shift));
  929. MLX5_SET(mkc, mkc, log_page_size, page_shift);
  930. MLX5_SET(mkc, mkc, qpn, 0xffffff);
  931. MLX5_SET(create_mkey_in, in, translations_octword_actual_size,
  932. get_octo_len(virt_addr, length, 1 << page_shift));
  933. err = mlx5_core_create_mkey(dev->mdev, &mr->mmkey, in, inlen);
  934. if (err) {
  935. mlx5_ib_warn(dev, "create mkey failed\n");
  936. goto err_2;
  937. }
  938. mr->umem = umem;
  939. mr->dev = dev;
  940. mr->live = 1;
  941. kvfree(in);
  942. mlx5_ib_dbg(dev, "mkey = 0x%x\n", mr->mmkey.key);
  943. return mr;
  944. err_2:
  945. kvfree(in);
  946. err_1:
  947. if (!ibmr)
  948. kfree(mr);
  949. return ERR_PTR(err);
  950. }
  951. static void set_mr_fileds(struct mlx5_ib_dev *dev, struct mlx5_ib_mr *mr,
  952. int npages, u64 length, int access_flags)
  953. {
  954. mr->npages = npages;
  955. atomic_add(npages, &dev->mdev->priv.reg_pages);
  956. mr->ibmr.lkey = mr->mmkey.key;
  957. mr->ibmr.rkey = mr->mmkey.key;
  958. mr->ibmr.length = length;
  959. mr->access_flags = access_flags;
  960. }
  961. struct ib_mr *mlx5_ib_reg_user_mr(struct ib_pd *pd, u64 start, u64 length,
  962. u64 virt_addr, int access_flags,
  963. struct ib_udata *udata)
  964. {
  965. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  966. struct mlx5_ib_mr *mr = NULL;
  967. struct ib_umem *umem;
  968. int page_shift;
  969. int npages;
  970. int ncont;
  971. int order;
  972. int err;
  973. mlx5_ib_dbg(dev, "start 0x%llx, virt_addr 0x%llx, length 0x%llx, access_flags 0x%x\n",
  974. start, virt_addr, length, access_flags);
  975. umem = mr_umem_get(pd, start, length, access_flags, &npages,
  976. &page_shift, &ncont, &order);
  977. if (IS_ERR(umem))
  978. return (void *)umem;
  979. if (use_umr(order)) {
  980. mr = reg_umr(pd, umem, virt_addr, length, ncont, page_shift,
  981. order, access_flags);
  982. if (PTR_ERR(mr) == -EAGAIN) {
  983. mlx5_ib_dbg(dev, "cache empty for order %d", order);
  984. mr = NULL;
  985. }
  986. } else if (access_flags & IB_ACCESS_ON_DEMAND) {
  987. err = -EINVAL;
  988. pr_err("Got MR registration for ODP MR > 512MB, not supported for Connect-IB");
  989. goto error;
  990. }
  991. if (!mr)
  992. mr = reg_create(NULL, pd, virt_addr, length, umem, ncont,
  993. page_shift, access_flags);
  994. if (IS_ERR(mr)) {
  995. err = PTR_ERR(mr);
  996. goto error;
  997. }
  998. mlx5_ib_dbg(dev, "mkey 0x%x\n", mr->mmkey.key);
  999. mr->umem = umem;
  1000. set_mr_fileds(dev, mr, npages, length, access_flags);
  1001. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  1002. update_odp_mr(mr);
  1003. #endif
  1004. return &mr->ibmr;
  1005. error:
  1006. ib_umem_release(umem);
  1007. return ERR_PTR(err);
  1008. }
  1009. static int unreg_umr(struct mlx5_ib_dev *dev, struct mlx5_ib_mr *mr)
  1010. {
  1011. struct mlx5_core_dev *mdev = dev->mdev;
  1012. struct umr_common *umrc = &dev->umrc;
  1013. struct mlx5_ib_umr_context umr_context;
  1014. struct mlx5_umr_wr umrwr = {};
  1015. struct ib_send_wr *bad;
  1016. int err;
  1017. if (mdev->state == MLX5_DEVICE_STATE_INTERNAL_ERROR)
  1018. return 0;
  1019. mlx5_ib_init_umr_context(&umr_context);
  1020. umrwr.wr.wr_cqe = &umr_context.cqe;
  1021. prep_umr_unreg_wqe(dev, &umrwr.wr, mr->mmkey.key);
  1022. down(&umrc->sem);
  1023. err = ib_post_send(umrc->qp, &umrwr.wr, &bad);
  1024. if (err) {
  1025. up(&umrc->sem);
  1026. mlx5_ib_dbg(dev, "err %d\n", err);
  1027. goto error;
  1028. } else {
  1029. wait_for_completion(&umr_context.done);
  1030. up(&umrc->sem);
  1031. }
  1032. if (umr_context.status != IB_WC_SUCCESS) {
  1033. mlx5_ib_warn(dev, "unreg umr failed\n");
  1034. err = -EFAULT;
  1035. goto error;
  1036. }
  1037. return 0;
  1038. error:
  1039. return err;
  1040. }
  1041. static int rereg_umr(struct ib_pd *pd, struct mlx5_ib_mr *mr, u64 virt_addr,
  1042. u64 length, int npages, int page_shift, int order,
  1043. int access_flags, int flags)
  1044. {
  1045. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  1046. struct device *ddev = dev->ib_dev.dma_device;
  1047. struct mlx5_ib_umr_context umr_context;
  1048. struct ib_send_wr *bad;
  1049. struct mlx5_umr_wr umrwr = {};
  1050. struct ib_sge sg;
  1051. struct umr_common *umrc = &dev->umrc;
  1052. dma_addr_t dma = 0;
  1053. __be64 *mr_pas = NULL;
  1054. int size;
  1055. int err;
  1056. mlx5_ib_init_umr_context(&umr_context);
  1057. umrwr.wr.wr_cqe = &umr_context.cqe;
  1058. umrwr.wr.send_flags = MLX5_IB_SEND_UMR_FAIL_IF_FREE;
  1059. if (flags & IB_MR_REREG_TRANS) {
  1060. err = dma_map_mr_pas(dev, mr->umem, npages, page_shift, &size,
  1061. &mr_pas, &dma);
  1062. if (err)
  1063. return err;
  1064. umrwr.target.virt_addr = virt_addr;
  1065. umrwr.length = length;
  1066. umrwr.wr.send_flags |= MLX5_IB_SEND_UMR_UPDATE_TRANSLATION;
  1067. }
  1068. prep_umr_wqe_common(pd, &umrwr.wr, &sg, dma, npages, mr->mmkey.key,
  1069. page_shift);
  1070. if (flags & IB_MR_REREG_PD) {
  1071. umrwr.pd = pd;
  1072. umrwr.wr.send_flags |= MLX5_IB_SEND_UMR_UPDATE_PD;
  1073. }
  1074. if (flags & IB_MR_REREG_ACCESS) {
  1075. umrwr.access_flags = access_flags;
  1076. umrwr.wr.send_flags |= MLX5_IB_SEND_UMR_UPDATE_ACCESS;
  1077. }
  1078. /* post send request to UMR QP */
  1079. down(&umrc->sem);
  1080. err = ib_post_send(umrc->qp, &umrwr.wr, &bad);
  1081. if (err) {
  1082. mlx5_ib_warn(dev, "post send failed, err %d\n", err);
  1083. } else {
  1084. wait_for_completion(&umr_context.done);
  1085. if (umr_context.status != IB_WC_SUCCESS) {
  1086. mlx5_ib_warn(dev, "reg umr failed (%u)\n",
  1087. umr_context.status);
  1088. err = -EFAULT;
  1089. }
  1090. }
  1091. up(&umrc->sem);
  1092. if (flags & IB_MR_REREG_TRANS) {
  1093. dma_unmap_single(ddev, dma, size, DMA_TO_DEVICE);
  1094. kfree(mr_pas);
  1095. }
  1096. return err;
  1097. }
  1098. int mlx5_ib_rereg_user_mr(struct ib_mr *ib_mr, int flags, u64 start,
  1099. u64 length, u64 virt_addr, int new_access_flags,
  1100. struct ib_pd *new_pd, struct ib_udata *udata)
  1101. {
  1102. struct mlx5_ib_dev *dev = to_mdev(ib_mr->device);
  1103. struct mlx5_ib_mr *mr = to_mmr(ib_mr);
  1104. struct ib_pd *pd = (flags & IB_MR_REREG_PD) ? new_pd : ib_mr->pd;
  1105. int access_flags = flags & IB_MR_REREG_ACCESS ?
  1106. new_access_flags :
  1107. mr->access_flags;
  1108. u64 addr = (flags & IB_MR_REREG_TRANS) ? virt_addr : mr->umem->address;
  1109. u64 len = (flags & IB_MR_REREG_TRANS) ? length : mr->umem->length;
  1110. int page_shift = 0;
  1111. int npages = 0;
  1112. int ncont = 0;
  1113. int order = 0;
  1114. int err;
  1115. mlx5_ib_dbg(dev, "start 0x%llx, virt_addr 0x%llx, length 0x%llx, access_flags 0x%x\n",
  1116. start, virt_addr, length, access_flags);
  1117. if (flags != IB_MR_REREG_PD) {
  1118. /*
  1119. * Replace umem. This needs to be done whether or not UMR is
  1120. * used.
  1121. */
  1122. flags |= IB_MR_REREG_TRANS;
  1123. ib_umem_release(mr->umem);
  1124. mr->umem = mr_umem_get(pd, addr, len, access_flags, &npages,
  1125. &page_shift, &ncont, &order);
  1126. if (IS_ERR(mr->umem)) {
  1127. err = PTR_ERR(mr->umem);
  1128. mr->umem = NULL;
  1129. return err;
  1130. }
  1131. }
  1132. if (flags & IB_MR_REREG_TRANS && !use_umr_mtt_update(mr, addr, len)) {
  1133. /*
  1134. * UMR can't be used - MKey needs to be replaced.
  1135. */
  1136. if (mr->umred) {
  1137. err = unreg_umr(dev, mr);
  1138. if (err)
  1139. mlx5_ib_warn(dev, "Failed to unregister MR\n");
  1140. } else {
  1141. err = destroy_mkey(dev, mr);
  1142. if (err)
  1143. mlx5_ib_warn(dev, "Failed to destroy MKey\n");
  1144. }
  1145. if (err)
  1146. return err;
  1147. mr = reg_create(ib_mr, pd, addr, len, mr->umem, ncont,
  1148. page_shift, access_flags);
  1149. if (IS_ERR(mr))
  1150. return PTR_ERR(mr);
  1151. mr->umred = 0;
  1152. } else {
  1153. /*
  1154. * Send a UMR WQE
  1155. */
  1156. err = rereg_umr(pd, mr, addr, len, npages, page_shift,
  1157. order, access_flags, flags);
  1158. if (err) {
  1159. mlx5_ib_warn(dev, "Failed to rereg UMR\n");
  1160. return err;
  1161. }
  1162. }
  1163. if (flags & IB_MR_REREG_PD) {
  1164. ib_mr->pd = pd;
  1165. mr->mmkey.pd = to_mpd(pd)->pdn;
  1166. }
  1167. if (flags & IB_MR_REREG_ACCESS)
  1168. mr->access_flags = access_flags;
  1169. if (flags & IB_MR_REREG_TRANS) {
  1170. atomic_sub(mr->npages, &dev->mdev->priv.reg_pages);
  1171. set_mr_fileds(dev, mr, npages, len, access_flags);
  1172. mr->mmkey.iova = addr;
  1173. mr->mmkey.size = len;
  1174. }
  1175. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  1176. update_odp_mr(mr);
  1177. #endif
  1178. return 0;
  1179. }
  1180. static int
  1181. mlx5_alloc_priv_descs(struct ib_device *device,
  1182. struct mlx5_ib_mr *mr,
  1183. int ndescs,
  1184. int desc_size)
  1185. {
  1186. int size = ndescs * desc_size;
  1187. int add_size;
  1188. int ret;
  1189. add_size = max_t(int, MLX5_UMR_ALIGN - ARCH_KMALLOC_MINALIGN, 0);
  1190. mr->descs_alloc = kzalloc(size + add_size, GFP_KERNEL);
  1191. if (!mr->descs_alloc)
  1192. return -ENOMEM;
  1193. mr->descs = PTR_ALIGN(mr->descs_alloc, MLX5_UMR_ALIGN);
  1194. mr->desc_map = dma_map_single(device->dma_device, mr->descs,
  1195. size, DMA_TO_DEVICE);
  1196. if (dma_mapping_error(device->dma_device, mr->desc_map)) {
  1197. ret = -ENOMEM;
  1198. goto err;
  1199. }
  1200. return 0;
  1201. err:
  1202. kfree(mr->descs_alloc);
  1203. return ret;
  1204. }
  1205. static void
  1206. mlx5_free_priv_descs(struct mlx5_ib_mr *mr)
  1207. {
  1208. if (mr->descs) {
  1209. struct ib_device *device = mr->ibmr.device;
  1210. int size = mr->max_descs * mr->desc_size;
  1211. dma_unmap_single(device->dma_device, mr->desc_map,
  1212. size, DMA_TO_DEVICE);
  1213. kfree(mr->descs_alloc);
  1214. mr->descs = NULL;
  1215. }
  1216. }
  1217. static int clean_mr(struct mlx5_ib_mr *mr)
  1218. {
  1219. struct mlx5_ib_dev *dev = to_mdev(mr->ibmr.device);
  1220. int umred = mr->umred;
  1221. int err;
  1222. if (mr->sig) {
  1223. if (mlx5_core_destroy_psv(dev->mdev,
  1224. mr->sig->psv_memory.psv_idx))
  1225. mlx5_ib_warn(dev, "failed to destroy mem psv %d\n",
  1226. mr->sig->psv_memory.psv_idx);
  1227. if (mlx5_core_destroy_psv(dev->mdev,
  1228. mr->sig->psv_wire.psv_idx))
  1229. mlx5_ib_warn(dev, "failed to destroy wire psv %d\n",
  1230. mr->sig->psv_wire.psv_idx);
  1231. kfree(mr->sig);
  1232. mr->sig = NULL;
  1233. }
  1234. mlx5_free_priv_descs(mr);
  1235. if (!umred) {
  1236. err = destroy_mkey(dev, mr);
  1237. if (err) {
  1238. mlx5_ib_warn(dev, "failed to destroy mkey 0x%x (%d)\n",
  1239. mr->mmkey.key, err);
  1240. return err;
  1241. }
  1242. } else {
  1243. err = unreg_umr(dev, mr);
  1244. if (err) {
  1245. mlx5_ib_warn(dev, "failed unregister\n");
  1246. return err;
  1247. }
  1248. free_cached_mr(dev, mr);
  1249. }
  1250. if (!umred)
  1251. kfree(mr);
  1252. return 0;
  1253. }
  1254. int mlx5_ib_dereg_mr(struct ib_mr *ibmr)
  1255. {
  1256. struct mlx5_ib_dev *dev = to_mdev(ibmr->device);
  1257. struct mlx5_ib_mr *mr = to_mmr(ibmr);
  1258. int npages = mr->npages;
  1259. struct ib_umem *umem = mr->umem;
  1260. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  1261. if (umem && umem->odp_data) {
  1262. /* Prevent new page faults from succeeding */
  1263. mr->live = 0;
  1264. /* Wait for all running page-fault handlers to finish. */
  1265. synchronize_srcu(&dev->mr_srcu);
  1266. /* Destroy all page mappings */
  1267. mlx5_ib_invalidate_range(umem, ib_umem_start(umem),
  1268. ib_umem_end(umem));
  1269. /*
  1270. * We kill the umem before the MR for ODP,
  1271. * so that there will not be any invalidations in
  1272. * flight, looking at the *mr struct.
  1273. */
  1274. ib_umem_release(umem);
  1275. atomic_sub(npages, &dev->mdev->priv.reg_pages);
  1276. /* Avoid double-freeing the umem. */
  1277. umem = NULL;
  1278. }
  1279. #endif
  1280. clean_mr(mr);
  1281. if (umem) {
  1282. ib_umem_release(umem);
  1283. atomic_sub(npages, &dev->mdev->priv.reg_pages);
  1284. }
  1285. return 0;
  1286. }
  1287. struct ib_mr *mlx5_ib_alloc_mr(struct ib_pd *pd,
  1288. enum ib_mr_type mr_type,
  1289. u32 max_num_sg)
  1290. {
  1291. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  1292. int inlen = MLX5_ST_SZ_BYTES(create_mkey_in);
  1293. int ndescs = ALIGN(max_num_sg, 4);
  1294. struct mlx5_ib_mr *mr;
  1295. void *mkc;
  1296. u32 *in;
  1297. int err;
  1298. mr = kzalloc(sizeof(*mr), GFP_KERNEL);
  1299. if (!mr)
  1300. return ERR_PTR(-ENOMEM);
  1301. in = kzalloc(inlen, GFP_KERNEL);
  1302. if (!in) {
  1303. err = -ENOMEM;
  1304. goto err_free;
  1305. }
  1306. mkc = MLX5_ADDR_OF(create_mkey_in, in, memory_key_mkey_entry);
  1307. MLX5_SET(mkc, mkc, free, 1);
  1308. MLX5_SET(mkc, mkc, translations_octword_size, ndescs);
  1309. MLX5_SET(mkc, mkc, qpn, 0xffffff);
  1310. MLX5_SET(mkc, mkc, pd, to_mpd(pd)->pdn);
  1311. if (mr_type == IB_MR_TYPE_MEM_REG) {
  1312. mr->access_mode = MLX5_MKC_ACCESS_MODE_MTT;
  1313. MLX5_SET(mkc, mkc, log_page_size, PAGE_SHIFT);
  1314. err = mlx5_alloc_priv_descs(pd->device, mr,
  1315. ndescs, sizeof(u64));
  1316. if (err)
  1317. goto err_free_in;
  1318. mr->desc_size = sizeof(u64);
  1319. mr->max_descs = ndescs;
  1320. } else if (mr_type == IB_MR_TYPE_SG_GAPS) {
  1321. mr->access_mode = MLX5_MKC_ACCESS_MODE_KLMS;
  1322. err = mlx5_alloc_priv_descs(pd->device, mr,
  1323. ndescs, sizeof(struct mlx5_klm));
  1324. if (err)
  1325. goto err_free_in;
  1326. mr->desc_size = sizeof(struct mlx5_klm);
  1327. mr->max_descs = ndescs;
  1328. } else if (mr_type == IB_MR_TYPE_SIGNATURE) {
  1329. u32 psv_index[2];
  1330. MLX5_SET(mkc, mkc, bsf_en, 1);
  1331. MLX5_SET(mkc, mkc, bsf_octword_size, MLX5_MKEY_BSF_OCTO_SIZE);
  1332. mr->sig = kzalloc(sizeof(*mr->sig), GFP_KERNEL);
  1333. if (!mr->sig) {
  1334. err = -ENOMEM;
  1335. goto err_free_in;
  1336. }
  1337. /* create mem & wire PSVs */
  1338. err = mlx5_core_create_psv(dev->mdev, to_mpd(pd)->pdn,
  1339. 2, psv_index);
  1340. if (err)
  1341. goto err_free_sig;
  1342. mr->access_mode = MLX5_MKC_ACCESS_MODE_KLMS;
  1343. mr->sig->psv_memory.psv_idx = psv_index[0];
  1344. mr->sig->psv_wire.psv_idx = psv_index[1];
  1345. mr->sig->sig_status_checked = true;
  1346. mr->sig->sig_err_exists = false;
  1347. /* Next UMR, Arm SIGERR */
  1348. ++mr->sig->sigerr_count;
  1349. } else {
  1350. mlx5_ib_warn(dev, "Invalid mr type %d\n", mr_type);
  1351. err = -EINVAL;
  1352. goto err_free_in;
  1353. }
  1354. MLX5_SET(mkc, mkc, access_mode, mr->access_mode);
  1355. MLX5_SET(mkc, mkc, umr_en, 1);
  1356. err = mlx5_core_create_mkey(dev->mdev, &mr->mmkey, in, inlen);
  1357. if (err)
  1358. goto err_destroy_psv;
  1359. mr->ibmr.lkey = mr->mmkey.key;
  1360. mr->ibmr.rkey = mr->mmkey.key;
  1361. mr->umem = NULL;
  1362. kfree(in);
  1363. return &mr->ibmr;
  1364. err_destroy_psv:
  1365. if (mr->sig) {
  1366. if (mlx5_core_destroy_psv(dev->mdev,
  1367. mr->sig->psv_memory.psv_idx))
  1368. mlx5_ib_warn(dev, "failed to destroy mem psv %d\n",
  1369. mr->sig->psv_memory.psv_idx);
  1370. if (mlx5_core_destroy_psv(dev->mdev,
  1371. mr->sig->psv_wire.psv_idx))
  1372. mlx5_ib_warn(dev, "failed to destroy wire psv %d\n",
  1373. mr->sig->psv_wire.psv_idx);
  1374. }
  1375. mlx5_free_priv_descs(mr);
  1376. err_free_sig:
  1377. kfree(mr->sig);
  1378. err_free_in:
  1379. kfree(in);
  1380. err_free:
  1381. kfree(mr);
  1382. return ERR_PTR(err);
  1383. }
  1384. struct ib_mw *mlx5_ib_alloc_mw(struct ib_pd *pd, enum ib_mw_type type,
  1385. struct ib_udata *udata)
  1386. {
  1387. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  1388. int inlen = MLX5_ST_SZ_BYTES(create_mkey_in);
  1389. struct mlx5_ib_mw *mw = NULL;
  1390. u32 *in = NULL;
  1391. void *mkc;
  1392. int ndescs;
  1393. int err;
  1394. struct mlx5_ib_alloc_mw req = {};
  1395. struct {
  1396. __u32 comp_mask;
  1397. __u32 response_length;
  1398. } resp = {};
  1399. err = ib_copy_from_udata(&req, udata, min(udata->inlen, sizeof(req)));
  1400. if (err)
  1401. return ERR_PTR(err);
  1402. if (req.comp_mask || req.reserved1 || req.reserved2)
  1403. return ERR_PTR(-EOPNOTSUPP);
  1404. if (udata->inlen > sizeof(req) &&
  1405. !ib_is_udata_cleared(udata, sizeof(req),
  1406. udata->inlen - sizeof(req)))
  1407. return ERR_PTR(-EOPNOTSUPP);
  1408. ndescs = req.num_klms ? roundup(req.num_klms, 4) : roundup(1, 4);
  1409. mw = kzalloc(sizeof(*mw), GFP_KERNEL);
  1410. in = kzalloc(inlen, GFP_KERNEL);
  1411. if (!mw || !in) {
  1412. err = -ENOMEM;
  1413. goto free;
  1414. }
  1415. mkc = MLX5_ADDR_OF(create_mkey_in, in, memory_key_mkey_entry);
  1416. MLX5_SET(mkc, mkc, free, 1);
  1417. MLX5_SET(mkc, mkc, translations_octword_size, ndescs);
  1418. MLX5_SET(mkc, mkc, pd, to_mpd(pd)->pdn);
  1419. MLX5_SET(mkc, mkc, umr_en, 1);
  1420. MLX5_SET(mkc, mkc, lr, 1);
  1421. MLX5_SET(mkc, mkc, access_mode, MLX5_MKC_ACCESS_MODE_KLMS);
  1422. MLX5_SET(mkc, mkc, en_rinval, !!((type == IB_MW_TYPE_2)));
  1423. MLX5_SET(mkc, mkc, qpn, 0xffffff);
  1424. err = mlx5_core_create_mkey(dev->mdev, &mw->mmkey, in, inlen);
  1425. if (err)
  1426. goto free;
  1427. mw->ibmw.rkey = mw->mmkey.key;
  1428. resp.response_length = min(offsetof(typeof(resp), response_length) +
  1429. sizeof(resp.response_length), udata->outlen);
  1430. if (resp.response_length) {
  1431. err = ib_copy_to_udata(udata, &resp, resp.response_length);
  1432. if (err) {
  1433. mlx5_core_destroy_mkey(dev->mdev, &mw->mmkey);
  1434. goto free;
  1435. }
  1436. }
  1437. kfree(in);
  1438. return &mw->ibmw;
  1439. free:
  1440. kfree(mw);
  1441. kfree(in);
  1442. return ERR_PTR(err);
  1443. }
  1444. int mlx5_ib_dealloc_mw(struct ib_mw *mw)
  1445. {
  1446. struct mlx5_ib_mw *mmw = to_mmw(mw);
  1447. int err;
  1448. err = mlx5_core_destroy_mkey((to_mdev(mw->device))->mdev,
  1449. &mmw->mmkey);
  1450. if (!err)
  1451. kfree(mmw);
  1452. return err;
  1453. }
  1454. int mlx5_ib_check_mr_status(struct ib_mr *ibmr, u32 check_mask,
  1455. struct ib_mr_status *mr_status)
  1456. {
  1457. struct mlx5_ib_mr *mmr = to_mmr(ibmr);
  1458. int ret = 0;
  1459. if (check_mask & ~IB_MR_CHECK_SIG_STATUS) {
  1460. pr_err("Invalid status check mask\n");
  1461. ret = -EINVAL;
  1462. goto done;
  1463. }
  1464. mr_status->fail_status = 0;
  1465. if (check_mask & IB_MR_CHECK_SIG_STATUS) {
  1466. if (!mmr->sig) {
  1467. ret = -EINVAL;
  1468. pr_err("signature status check requested on a non-signature enabled MR\n");
  1469. goto done;
  1470. }
  1471. mmr->sig->sig_status_checked = true;
  1472. if (!mmr->sig->sig_err_exists)
  1473. goto done;
  1474. if (ibmr->lkey == mmr->sig->err_item.key)
  1475. memcpy(&mr_status->sig_err, &mmr->sig->err_item,
  1476. sizeof(mr_status->sig_err));
  1477. else {
  1478. mr_status->sig_err.err_type = IB_SIG_BAD_GUARD;
  1479. mr_status->sig_err.sig_err_offset = 0;
  1480. mr_status->sig_err.key = mmr->sig->err_item.key;
  1481. }
  1482. mmr->sig->sig_err_exists = false;
  1483. mr_status->fail_status |= IB_MR_CHECK_SIG_STATUS;
  1484. }
  1485. done:
  1486. return ret;
  1487. }
  1488. static int
  1489. mlx5_ib_sg_to_klms(struct mlx5_ib_mr *mr,
  1490. struct scatterlist *sgl,
  1491. unsigned short sg_nents,
  1492. unsigned int *sg_offset_p)
  1493. {
  1494. struct scatterlist *sg = sgl;
  1495. struct mlx5_klm *klms = mr->descs;
  1496. unsigned int sg_offset = sg_offset_p ? *sg_offset_p : 0;
  1497. u32 lkey = mr->ibmr.pd->local_dma_lkey;
  1498. int i;
  1499. mr->ibmr.iova = sg_dma_address(sg) + sg_offset;
  1500. mr->ibmr.length = 0;
  1501. mr->ndescs = sg_nents;
  1502. for_each_sg(sgl, sg, sg_nents, i) {
  1503. if (unlikely(i > mr->max_descs))
  1504. break;
  1505. klms[i].va = cpu_to_be64(sg_dma_address(sg) + sg_offset);
  1506. klms[i].bcount = cpu_to_be32(sg_dma_len(sg) - sg_offset);
  1507. klms[i].key = cpu_to_be32(lkey);
  1508. mr->ibmr.length += sg_dma_len(sg);
  1509. sg_offset = 0;
  1510. }
  1511. if (sg_offset_p)
  1512. *sg_offset_p = sg_offset;
  1513. return i;
  1514. }
  1515. static int mlx5_set_page(struct ib_mr *ibmr, u64 addr)
  1516. {
  1517. struct mlx5_ib_mr *mr = to_mmr(ibmr);
  1518. __be64 *descs;
  1519. if (unlikely(mr->ndescs == mr->max_descs))
  1520. return -ENOMEM;
  1521. descs = mr->descs;
  1522. descs[mr->ndescs++] = cpu_to_be64(addr | MLX5_EN_RD | MLX5_EN_WR);
  1523. return 0;
  1524. }
  1525. int mlx5_ib_map_mr_sg(struct ib_mr *ibmr, struct scatterlist *sg, int sg_nents,
  1526. unsigned int *sg_offset)
  1527. {
  1528. struct mlx5_ib_mr *mr = to_mmr(ibmr);
  1529. int n;
  1530. mr->ndescs = 0;
  1531. ib_dma_sync_single_for_cpu(ibmr->device, mr->desc_map,
  1532. mr->desc_size * mr->max_descs,
  1533. DMA_TO_DEVICE);
  1534. if (mr->access_mode == MLX5_MKC_ACCESS_MODE_KLMS)
  1535. n = mlx5_ib_sg_to_klms(mr, sg, sg_nents, sg_offset);
  1536. else
  1537. n = ib_sg_to_pages(ibmr, sg, sg_nents, sg_offset,
  1538. mlx5_set_page);
  1539. ib_dma_sync_single_for_device(ibmr->device, mr->desc_map,
  1540. mr->desc_size * mr->max_descs,
  1541. DMA_TO_DEVICE);
  1542. return n;
  1543. }