mr.c 46 KB

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