mr.c 45 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881
  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. mutex_init(&dev->slow_path_mutex);
  518. cache->wq = alloc_ordered_workqueue("mkey_cache", WQ_MEM_RECLAIM);
  519. if (!cache->wq) {
  520. mlx5_ib_warn(dev, "failed to create work queue\n");
  521. return -ENOMEM;
  522. }
  523. setup_timer(&dev->delay_timer, delay_time_func, (unsigned long)dev);
  524. for (i = 0; i < MAX_MR_CACHE_ENTRIES; i++) {
  525. INIT_LIST_HEAD(&cache->ent[i].head);
  526. spin_lock_init(&cache->ent[i].lock);
  527. ent = &cache->ent[i];
  528. INIT_LIST_HEAD(&ent->head);
  529. spin_lock_init(&ent->lock);
  530. ent->order = i + 2;
  531. ent->dev = dev;
  532. if ((dev->mdev->profile->mask & MLX5_PROF_MASK_MR_CACHE) &&
  533. (mlx5_core_is_pf(dev->mdev)))
  534. limit = dev->mdev->profile->mr_cache[i].limit;
  535. else
  536. limit = 0;
  537. INIT_WORK(&ent->work, cache_work_func);
  538. INIT_DELAYED_WORK(&ent->dwork, delayed_cache_work_func);
  539. ent->limit = limit;
  540. queue_work(cache->wq, &ent->work);
  541. }
  542. err = mlx5_mr_cache_debugfs_init(dev);
  543. if (err)
  544. mlx5_ib_warn(dev, "cache debugfs failure\n");
  545. return 0;
  546. }
  547. static void wait_for_async_commands(struct mlx5_ib_dev *dev)
  548. {
  549. struct mlx5_mr_cache *cache = &dev->cache;
  550. struct mlx5_cache_ent *ent;
  551. int total = 0;
  552. int i;
  553. int j;
  554. for (i = 0; i < MAX_MR_CACHE_ENTRIES; i++) {
  555. ent = &cache->ent[i];
  556. for (j = 0 ; j < 1000; j++) {
  557. if (!ent->pending)
  558. break;
  559. msleep(50);
  560. }
  561. }
  562. for (i = 0; i < MAX_MR_CACHE_ENTRIES; i++) {
  563. ent = &cache->ent[i];
  564. total += ent->pending;
  565. }
  566. if (total)
  567. mlx5_ib_warn(dev, "aborted while there are %d pending mr requests\n", total);
  568. else
  569. mlx5_ib_warn(dev, "done with all pending requests\n");
  570. }
  571. int mlx5_mr_cache_cleanup(struct mlx5_ib_dev *dev)
  572. {
  573. int i;
  574. dev->cache.stopped = 1;
  575. flush_workqueue(dev->cache.wq);
  576. mlx5_mr_cache_debugfs_cleanup(dev);
  577. for (i = 0; i < MAX_MR_CACHE_ENTRIES; i++)
  578. clean_keys(dev, i);
  579. destroy_workqueue(dev->cache.wq);
  580. wait_for_async_commands(dev);
  581. del_timer_sync(&dev->delay_timer);
  582. return 0;
  583. }
  584. struct ib_mr *mlx5_ib_get_dma_mr(struct ib_pd *pd, int acc)
  585. {
  586. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  587. int inlen = MLX5_ST_SZ_BYTES(create_mkey_in);
  588. struct mlx5_core_dev *mdev = dev->mdev;
  589. struct mlx5_ib_mr *mr;
  590. void *mkc;
  591. u32 *in;
  592. int err;
  593. mr = kzalloc(sizeof(*mr), GFP_KERNEL);
  594. if (!mr)
  595. return ERR_PTR(-ENOMEM);
  596. in = kzalloc(inlen, GFP_KERNEL);
  597. if (!in) {
  598. err = -ENOMEM;
  599. goto err_free;
  600. }
  601. mkc = MLX5_ADDR_OF(create_mkey_in, in, memory_key_mkey_entry);
  602. MLX5_SET(mkc, mkc, access_mode, MLX5_MKC_ACCESS_MODE_PA);
  603. MLX5_SET(mkc, mkc, a, !!(acc & IB_ACCESS_REMOTE_ATOMIC));
  604. MLX5_SET(mkc, mkc, rw, !!(acc & IB_ACCESS_REMOTE_WRITE));
  605. MLX5_SET(mkc, mkc, rr, !!(acc & IB_ACCESS_REMOTE_READ));
  606. MLX5_SET(mkc, mkc, lw, !!(acc & IB_ACCESS_LOCAL_WRITE));
  607. MLX5_SET(mkc, mkc, lr, 1);
  608. MLX5_SET(mkc, mkc, length64, 1);
  609. MLX5_SET(mkc, mkc, pd, to_mpd(pd)->pdn);
  610. MLX5_SET(mkc, mkc, qpn, 0xffffff);
  611. MLX5_SET64(mkc, mkc, start_addr, 0);
  612. err = mlx5_core_create_mkey(mdev, &mr->mmkey, in, inlen);
  613. if (err)
  614. goto err_in;
  615. kfree(in);
  616. mr->ibmr.lkey = mr->mmkey.key;
  617. mr->ibmr.rkey = mr->mmkey.key;
  618. mr->umem = NULL;
  619. return &mr->ibmr;
  620. err_in:
  621. kfree(in);
  622. err_free:
  623. kfree(mr);
  624. return ERR_PTR(err);
  625. }
  626. static int get_octo_len(u64 addr, u64 len, int page_size)
  627. {
  628. u64 offset;
  629. int npages;
  630. offset = addr & (page_size - 1);
  631. npages = ALIGN(len + offset, page_size) >> ilog2(page_size);
  632. return (npages + 1) / 2;
  633. }
  634. static int use_umr(int order)
  635. {
  636. return order <= MLX5_MAX_UMR_SHIFT;
  637. }
  638. static int dma_map_mr_pas(struct mlx5_ib_dev *dev, struct ib_umem *umem,
  639. int npages, int page_shift, int *size,
  640. __be64 **mr_pas, dma_addr_t *dma)
  641. {
  642. __be64 *pas;
  643. struct device *ddev = dev->ib_dev.dma_device;
  644. /*
  645. * UMR copies MTTs in units of MLX5_UMR_MTT_ALIGNMENT bytes.
  646. * To avoid copying garbage after the pas array, we allocate
  647. * a little more.
  648. */
  649. *size = ALIGN(sizeof(u64) * npages, MLX5_UMR_MTT_ALIGNMENT);
  650. *mr_pas = kmalloc(*size + MLX5_UMR_ALIGN - 1, GFP_KERNEL);
  651. if (!(*mr_pas))
  652. return -ENOMEM;
  653. pas = PTR_ALIGN(*mr_pas, MLX5_UMR_ALIGN);
  654. mlx5_ib_populate_pas(dev, umem, page_shift, pas, MLX5_IB_MTT_PRESENT);
  655. /* Clear padding after the actual pages. */
  656. memset(pas + npages, 0, *size - npages * sizeof(u64));
  657. *dma = dma_map_single(ddev, pas, *size, DMA_TO_DEVICE);
  658. if (dma_mapping_error(ddev, *dma)) {
  659. kfree(*mr_pas);
  660. return -ENOMEM;
  661. }
  662. return 0;
  663. }
  664. static void prep_umr_wqe_common(struct ib_pd *pd, struct ib_send_wr *wr,
  665. struct ib_sge *sg, u64 dma, int n, u32 key,
  666. int page_shift)
  667. {
  668. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  669. struct mlx5_umr_wr *umrwr = umr_wr(wr);
  670. sg->addr = dma;
  671. sg->length = ALIGN(sizeof(u64) * n, 64);
  672. sg->lkey = dev->umrc.pd->local_dma_lkey;
  673. wr->next = NULL;
  674. wr->sg_list = sg;
  675. if (n)
  676. wr->num_sge = 1;
  677. else
  678. wr->num_sge = 0;
  679. wr->opcode = MLX5_IB_WR_UMR;
  680. umrwr->npages = n;
  681. umrwr->page_shift = page_shift;
  682. umrwr->mkey = key;
  683. }
  684. static void prep_umr_reg_wqe(struct ib_pd *pd, struct ib_send_wr *wr,
  685. struct ib_sge *sg, u64 dma, int n, u32 key,
  686. int page_shift, u64 virt_addr, u64 len,
  687. int access_flags)
  688. {
  689. struct mlx5_umr_wr *umrwr = umr_wr(wr);
  690. prep_umr_wqe_common(pd, wr, sg, dma, n, key, page_shift);
  691. wr->send_flags = 0;
  692. umrwr->target.virt_addr = virt_addr;
  693. umrwr->length = len;
  694. umrwr->access_flags = access_flags;
  695. umrwr->pd = pd;
  696. }
  697. static void prep_umr_unreg_wqe(struct mlx5_ib_dev *dev,
  698. struct ib_send_wr *wr, u32 key)
  699. {
  700. struct mlx5_umr_wr *umrwr = umr_wr(wr);
  701. wr->send_flags = MLX5_IB_SEND_UMR_UNREG | MLX5_IB_SEND_UMR_FAIL_IF_FREE;
  702. wr->opcode = MLX5_IB_WR_UMR;
  703. umrwr->mkey = key;
  704. }
  705. static struct ib_umem *mr_umem_get(struct ib_pd *pd, u64 start, u64 length,
  706. int access_flags, int *npages,
  707. int *page_shift, int *ncont, int *order)
  708. {
  709. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  710. struct ib_umem *umem = ib_umem_get(pd->uobject->context, start, length,
  711. access_flags, 0);
  712. if (IS_ERR(umem)) {
  713. mlx5_ib_err(dev, "umem get failed (%ld)\n", PTR_ERR(umem));
  714. return (void *)umem;
  715. }
  716. mlx5_ib_cont_pages(umem, start, npages, page_shift, ncont, order);
  717. if (!*npages) {
  718. mlx5_ib_warn(dev, "avoid zero region\n");
  719. ib_umem_release(umem);
  720. return ERR_PTR(-EINVAL);
  721. }
  722. mlx5_ib_dbg(dev, "npages %d, ncont %d, order %d, page_shift %d\n",
  723. *npages, *ncont, *order, *page_shift);
  724. return umem;
  725. }
  726. static void mlx5_ib_umr_done(struct ib_cq *cq, struct ib_wc *wc)
  727. {
  728. struct mlx5_ib_umr_context *context =
  729. container_of(wc->wr_cqe, struct mlx5_ib_umr_context, cqe);
  730. context->status = wc->status;
  731. complete(&context->done);
  732. }
  733. static inline void mlx5_ib_init_umr_context(struct mlx5_ib_umr_context *context)
  734. {
  735. context->cqe.done = mlx5_ib_umr_done;
  736. context->status = -1;
  737. init_completion(&context->done);
  738. }
  739. static struct mlx5_ib_mr *reg_umr(struct ib_pd *pd, struct ib_umem *umem,
  740. u64 virt_addr, u64 len, int npages,
  741. int page_shift, int order, int access_flags)
  742. {
  743. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  744. struct device *ddev = dev->ib_dev.dma_device;
  745. struct umr_common *umrc = &dev->umrc;
  746. struct mlx5_ib_umr_context umr_context;
  747. struct mlx5_umr_wr umrwr = {};
  748. struct ib_send_wr *bad;
  749. struct mlx5_ib_mr *mr;
  750. struct ib_sge sg;
  751. int size;
  752. __be64 *mr_pas;
  753. dma_addr_t dma;
  754. int err = 0;
  755. int i;
  756. for (i = 0; i < 1; i++) {
  757. mr = alloc_cached_mr(dev, order);
  758. if (mr)
  759. break;
  760. err = add_keys(dev, order2idx(dev, order), 1);
  761. if (err && err != -EAGAIN) {
  762. mlx5_ib_warn(dev, "add_keys failed, err %d\n", err);
  763. break;
  764. }
  765. }
  766. if (!mr)
  767. return ERR_PTR(-EAGAIN);
  768. err = dma_map_mr_pas(dev, umem, npages, page_shift, &size, &mr_pas,
  769. &dma);
  770. if (err)
  771. goto free_mr;
  772. mlx5_ib_init_umr_context(&umr_context);
  773. umrwr.wr.wr_cqe = &umr_context.cqe;
  774. prep_umr_reg_wqe(pd, &umrwr.wr, &sg, dma, npages, mr->mmkey.key,
  775. page_shift, virt_addr, len, access_flags);
  776. down(&umrc->sem);
  777. err = ib_post_send(umrc->qp, &umrwr.wr, &bad);
  778. if (err) {
  779. mlx5_ib_warn(dev, "post send failed, err %d\n", err);
  780. goto unmap_dma;
  781. } else {
  782. wait_for_completion(&umr_context.done);
  783. if (umr_context.status != IB_WC_SUCCESS) {
  784. mlx5_ib_warn(dev, "reg umr failed\n");
  785. err = -EFAULT;
  786. }
  787. }
  788. mr->mmkey.iova = virt_addr;
  789. mr->mmkey.size = len;
  790. mr->mmkey.pd = to_mpd(pd)->pdn;
  791. mr->live = 1;
  792. unmap_dma:
  793. up(&umrc->sem);
  794. dma_unmap_single(ddev, dma, size, DMA_TO_DEVICE);
  795. kfree(mr_pas);
  796. free_mr:
  797. if (err) {
  798. free_cached_mr(dev, mr);
  799. return ERR_PTR(err);
  800. }
  801. return mr;
  802. }
  803. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  804. int mlx5_ib_update_mtt(struct mlx5_ib_mr *mr, u64 start_page_index, int npages,
  805. int zap)
  806. {
  807. struct mlx5_ib_dev *dev = mr->dev;
  808. struct device *ddev = dev->ib_dev.dma_device;
  809. struct umr_common *umrc = &dev->umrc;
  810. struct mlx5_ib_umr_context umr_context;
  811. struct ib_umem *umem = mr->umem;
  812. int size;
  813. __be64 *pas;
  814. dma_addr_t dma;
  815. struct ib_send_wr *bad;
  816. struct mlx5_umr_wr wr;
  817. struct ib_sge sg;
  818. int err = 0;
  819. const int page_index_alignment = MLX5_UMR_MTT_ALIGNMENT / sizeof(u64);
  820. const int page_index_mask = page_index_alignment - 1;
  821. size_t pages_mapped = 0;
  822. size_t pages_to_map = 0;
  823. size_t pages_iter = 0;
  824. int use_emergency_buf = 0;
  825. /* UMR copies MTTs in units of MLX5_UMR_MTT_ALIGNMENT bytes,
  826. * so we need to align the offset and length accordingly */
  827. if (start_page_index & page_index_mask) {
  828. npages += start_page_index & page_index_mask;
  829. start_page_index &= ~page_index_mask;
  830. }
  831. pages_to_map = ALIGN(npages, page_index_alignment);
  832. if (start_page_index + pages_to_map > MLX5_MAX_UMR_PAGES)
  833. return -EINVAL;
  834. size = sizeof(u64) * pages_to_map;
  835. size = min_t(int, PAGE_SIZE, size);
  836. /* We allocate with GFP_ATOMIC to avoid recursion into page-reclaim
  837. * code, when we are called from an invalidation. The pas buffer must
  838. * be 2k-aligned for Connect-IB. */
  839. pas = (__be64 *)get_zeroed_page(GFP_ATOMIC);
  840. if (!pas) {
  841. mlx5_ib_warn(dev, "unable to allocate memory during MTT update, falling back to slower chunked mechanism.\n");
  842. pas = mlx5_ib_update_mtt_emergency_buffer;
  843. size = MLX5_UMR_MTT_MIN_CHUNK_SIZE;
  844. use_emergency_buf = 1;
  845. mutex_lock(&mlx5_ib_update_mtt_emergency_buffer_mutex);
  846. memset(pas, 0, size);
  847. }
  848. pages_iter = size / sizeof(u64);
  849. dma = dma_map_single(ddev, pas, size, DMA_TO_DEVICE);
  850. if (dma_mapping_error(ddev, dma)) {
  851. mlx5_ib_err(dev, "unable to map DMA during MTT update.\n");
  852. err = -ENOMEM;
  853. goto free_pas;
  854. }
  855. for (pages_mapped = 0;
  856. pages_mapped < pages_to_map && !err;
  857. pages_mapped += pages_iter, start_page_index += pages_iter) {
  858. dma_sync_single_for_cpu(ddev, dma, size, DMA_TO_DEVICE);
  859. npages = min_t(size_t,
  860. pages_iter,
  861. ib_umem_num_pages(umem) - start_page_index);
  862. if (!zap) {
  863. __mlx5_ib_populate_pas(dev, umem, PAGE_SHIFT,
  864. start_page_index, npages, pas,
  865. MLX5_IB_MTT_PRESENT);
  866. /* Clear padding after the pages brought from the
  867. * umem. */
  868. memset(pas + npages, 0, size - npages * sizeof(u64));
  869. }
  870. dma_sync_single_for_device(ddev, dma, size, DMA_TO_DEVICE);
  871. mlx5_ib_init_umr_context(&umr_context);
  872. memset(&wr, 0, sizeof(wr));
  873. wr.wr.wr_cqe = &umr_context.cqe;
  874. sg.addr = dma;
  875. sg.length = ALIGN(npages * sizeof(u64),
  876. MLX5_UMR_MTT_ALIGNMENT);
  877. sg.lkey = dev->umrc.pd->local_dma_lkey;
  878. wr.wr.send_flags = MLX5_IB_SEND_UMR_FAIL_IF_FREE |
  879. MLX5_IB_SEND_UMR_UPDATE_MTT;
  880. wr.wr.sg_list = &sg;
  881. wr.wr.num_sge = 1;
  882. wr.wr.opcode = MLX5_IB_WR_UMR;
  883. wr.npages = sg.length / sizeof(u64);
  884. wr.page_shift = PAGE_SHIFT;
  885. wr.mkey = mr->mmkey.key;
  886. wr.target.offset = start_page_index;
  887. down(&umrc->sem);
  888. err = ib_post_send(umrc->qp, &wr.wr, &bad);
  889. if (err) {
  890. mlx5_ib_err(dev, "UMR post send failed, err %d\n", err);
  891. } else {
  892. wait_for_completion(&umr_context.done);
  893. if (umr_context.status != IB_WC_SUCCESS) {
  894. mlx5_ib_err(dev, "UMR completion failed, code %d\n",
  895. umr_context.status);
  896. err = -EFAULT;
  897. }
  898. }
  899. up(&umrc->sem);
  900. }
  901. dma_unmap_single(ddev, dma, size, DMA_TO_DEVICE);
  902. free_pas:
  903. if (!use_emergency_buf)
  904. free_page((unsigned long)pas);
  905. else
  906. mutex_unlock(&mlx5_ib_update_mtt_emergency_buffer_mutex);
  907. return err;
  908. }
  909. #endif
  910. /*
  911. * If ibmr is NULL it will be allocated by reg_create.
  912. * Else, the given ibmr will be used.
  913. */
  914. static struct mlx5_ib_mr *reg_create(struct ib_mr *ibmr, struct ib_pd *pd,
  915. u64 virt_addr, u64 length,
  916. struct ib_umem *umem, int npages,
  917. int page_shift, int access_flags)
  918. {
  919. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  920. struct mlx5_ib_mr *mr;
  921. __be64 *pas;
  922. void *mkc;
  923. int inlen;
  924. u32 *in;
  925. int err;
  926. bool pg_cap = !!(MLX5_CAP_GEN(dev->mdev, pg));
  927. mr = ibmr ? to_mmr(ibmr) : kzalloc(sizeof(*mr), GFP_KERNEL);
  928. if (!mr)
  929. return ERR_PTR(-ENOMEM);
  930. inlen = MLX5_ST_SZ_BYTES(create_mkey_in) +
  931. sizeof(*pas) * ((npages + 1) / 2) * 2;
  932. in = mlx5_vzalloc(inlen);
  933. if (!in) {
  934. err = -ENOMEM;
  935. goto err_1;
  936. }
  937. pas = (__be64 *)MLX5_ADDR_OF(create_mkey_in, in, klm_pas_mtt);
  938. mlx5_ib_populate_pas(dev, umem, page_shift, pas,
  939. pg_cap ? MLX5_IB_MTT_PRESENT : 0);
  940. /* The pg_access bit allows setting the access flags
  941. * in the page list submitted with the command. */
  942. MLX5_SET(create_mkey_in, in, pg_access, !!(pg_cap));
  943. mkc = MLX5_ADDR_OF(create_mkey_in, in, memory_key_mkey_entry);
  944. MLX5_SET(mkc, mkc, access_mode, MLX5_MKC_ACCESS_MODE_MTT);
  945. MLX5_SET(mkc, mkc, a, !!(access_flags & IB_ACCESS_REMOTE_ATOMIC));
  946. MLX5_SET(mkc, mkc, rw, !!(access_flags & IB_ACCESS_REMOTE_WRITE));
  947. MLX5_SET(mkc, mkc, rr, !!(access_flags & IB_ACCESS_REMOTE_READ));
  948. MLX5_SET(mkc, mkc, lw, !!(access_flags & IB_ACCESS_LOCAL_WRITE));
  949. MLX5_SET(mkc, mkc, lr, 1);
  950. MLX5_SET64(mkc, mkc, start_addr, virt_addr);
  951. MLX5_SET64(mkc, mkc, len, length);
  952. MLX5_SET(mkc, mkc, pd, to_mpd(pd)->pdn);
  953. MLX5_SET(mkc, mkc, bsf_octword_size, 0);
  954. MLX5_SET(mkc, mkc, translations_octword_size,
  955. get_octo_len(virt_addr, length, 1 << page_shift));
  956. MLX5_SET(mkc, mkc, log_page_size, page_shift);
  957. MLX5_SET(mkc, mkc, qpn, 0xffffff);
  958. MLX5_SET(create_mkey_in, in, translations_octword_actual_size,
  959. get_octo_len(virt_addr, length, 1 << page_shift));
  960. err = mlx5_core_create_mkey(dev->mdev, &mr->mmkey, in, inlen);
  961. if (err) {
  962. mlx5_ib_warn(dev, "create mkey failed\n");
  963. goto err_2;
  964. }
  965. mr->umem = umem;
  966. mr->dev = dev;
  967. mr->live = 1;
  968. kvfree(in);
  969. mlx5_ib_dbg(dev, "mkey = 0x%x\n", mr->mmkey.key);
  970. return mr;
  971. err_2:
  972. kvfree(in);
  973. err_1:
  974. if (!ibmr)
  975. kfree(mr);
  976. return ERR_PTR(err);
  977. }
  978. static void set_mr_fileds(struct mlx5_ib_dev *dev, struct mlx5_ib_mr *mr,
  979. int npages, u64 length, int access_flags)
  980. {
  981. mr->npages = npages;
  982. atomic_add(npages, &dev->mdev->priv.reg_pages);
  983. mr->ibmr.lkey = mr->mmkey.key;
  984. mr->ibmr.rkey = mr->mmkey.key;
  985. mr->ibmr.length = length;
  986. mr->access_flags = access_flags;
  987. }
  988. struct ib_mr *mlx5_ib_reg_user_mr(struct ib_pd *pd, u64 start, u64 length,
  989. u64 virt_addr, int access_flags,
  990. struct ib_udata *udata)
  991. {
  992. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  993. struct mlx5_ib_mr *mr = NULL;
  994. struct ib_umem *umem;
  995. int page_shift;
  996. int npages;
  997. int ncont;
  998. int order;
  999. int err;
  1000. mlx5_ib_dbg(dev, "start 0x%llx, virt_addr 0x%llx, length 0x%llx, access_flags 0x%x\n",
  1001. start, virt_addr, length, access_flags);
  1002. umem = mr_umem_get(pd, start, length, access_flags, &npages,
  1003. &page_shift, &ncont, &order);
  1004. if (IS_ERR(umem))
  1005. return (void *)umem;
  1006. if (use_umr(order)) {
  1007. mr = reg_umr(pd, umem, virt_addr, length, ncont, page_shift,
  1008. order, access_flags);
  1009. if (PTR_ERR(mr) == -EAGAIN) {
  1010. mlx5_ib_dbg(dev, "cache empty for order %d", order);
  1011. mr = NULL;
  1012. }
  1013. } else if (access_flags & IB_ACCESS_ON_DEMAND) {
  1014. err = -EINVAL;
  1015. pr_err("Got MR registration for ODP MR > 512MB, not supported for Connect-IB");
  1016. goto error;
  1017. }
  1018. if (!mr) {
  1019. mutex_lock(&dev->slow_path_mutex);
  1020. mr = reg_create(NULL, pd, virt_addr, length, umem, ncont,
  1021. page_shift, access_flags);
  1022. mutex_unlock(&dev->slow_path_mutex);
  1023. }
  1024. if (IS_ERR(mr)) {
  1025. err = PTR_ERR(mr);
  1026. goto error;
  1027. }
  1028. mlx5_ib_dbg(dev, "mkey 0x%x\n", mr->mmkey.key);
  1029. mr->umem = umem;
  1030. set_mr_fileds(dev, mr, npages, length, access_flags);
  1031. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  1032. update_odp_mr(mr);
  1033. #endif
  1034. return &mr->ibmr;
  1035. error:
  1036. ib_umem_release(umem);
  1037. return ERR_PTR(err);
  1038. }
  1039. static int unreg_umr(struct mlx5_ib_dev *dev, struct mlx5_ib_mr *mr)
  1040. {
  1041. struct mlx5_core_dev *mdev = dev->mdev;
  1042. struct umr_common *umrc = &dev->umrc;
  1043. struct mlx5_ib_umr_context umr_context;
  1044. struct mlx5_umr_wr umrwr = {};
  1045. struct ib_send_wr *bad;
  1046. int err;
  1047. if (mdev->state == MLX5_DEVICE_STATE_INTERNAL_ERROR)
  1048. return 0;
  1049. mlx5_ib_init_umr_context(&umr_context);
  1050. umrwr.wr.wr_cqe = &umr_context.cqe;
  1051. prep_umr_unreg_wqe(dev, &umrwr.wr, mr->mmkey.key);
  1052. down(&umrc->sem);
  1053. err = ib_post_send(umrc->qp, &umrwr.wr, &bad);
  1054. if (err) {
  1055. up(&umrc->sem);
  1056. mlx5_ib_dbg(dev, "err %d\n", err);
  1057. goto error;
  1058. } else {
  1059. wait_for_completion(&umr_context.done);
  1060. up(&umrc->sem);
  1061. }
  1062. if (umr_context.status != IB_WC_SUCCESS) {
  1063. mlx5_ib_warn(dev, "unreg umr failed\n");
  1064. err = -EFAULT;
  1065. goto error;
  1066. }
  1067. return 0;
  1068. error:
  1069. return err;
  1070. }
  1071. static int rereg_umr(struct ib_pd *pd, struct mlx5_ib_mr *mr, u64 virt_addr,
  1072. u64 length, int npages, int page_shift, int order,
  1073. int access_flags, int flags)
  1074. {
  1075. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  1076. struct device *ddev = dev->ib_dev.dma_device;
  1077. struct mlx5_ib_umr_context umr_context;
  1078. struct ib_send_wr *bad;
  1079. struct mlx5_umr_wr umrwr = {};
  1080. struct ib_sge sg;
  1081. struct umr_common *umrc = &dev->umrc;
  1082. dma_addr_t dma = 0;
  1083. __be64 *mr_pas = NULL;
  1084. int size;
  1085. int err;
  1086. mlx5_ib_init_umr_context(&umr_context);
  1087. umrwr.wr.wr_cqe = &umr_context.cqe;
  1088. umrwr.wr.send_flags = MLX5_IB_SEND_UMR_FAIL_IF_FREE;
  1089. if (flags & IB_MR_REREG_TRANS) {
  1090. err = dma_map_mr_pas(dev, mr->umem, npages, page_shift, &size,
  1091. &mr_pas, &dma);
  1092. if (err)
  1093. return err;
  1094. umrwr.target.virt_addr = virt_addr;
  1095. umrwr.length = length;
  1096. umrwr.wr.send_flags |= MLX5_IB_SEND_UMR_UPDATE_TRANSLATION;
  1097. }
  1098. prep_umr_wqe_common(pd, &umrwr.wr, &sg, dma, npages, mr->mmkey.key,
  1099. page_shift);
  1100. if (flags & IB_MR_REREG_PD) {
  1101. umrwr.pd = pd;
  1102. umrwr.wr.send_flags |= MLX5_IB_SEND_UMR_UPDATE_PD;
  1103. }
  1104. if (flags & IB_MR_REREG_ACCESS) {
  1105. umrwr.access_flags = access_flags;
  1106. umrwr.wr.send_flags |= MLX5_IB_SEND_UMR_UPDATE_ACCESS;
  1107. }
  1108. /* post send request to UMR QP */
  1109. down(&umrc->sem);
  1110. err = ib_post_send(umrc->qp, &umrwr.wr, &bad);
  1111. if (err) {
  1112. mlx5_ib_warn(dev, "post send failed, err %d\n", err);
  1113. } else {
  1114. wait_for_completion(&umr_context.done);
  1115. if (umr_context.status != IB_WC_SUCCESS) {
  1116. mlx5_ib_warn(dev, "reg umr failed (%u)\n",
  1117. umr_context.status);
  1118. err = -EFAULT;
  1119. }
  1120. }
  1121. up(&umrc->sem);
  1122. if (flags & IB_MR_REREG_TRANS) {
  1123. dma_unmap_single(ddev, dma, size, DMA_TO_DEVICE);
  1124. kfree(mr_pas);
  1125. }
  1126. return err;
  1127. }
  1128. int mlx5_ib_rereg_user_mr(struct ib_mr *ib_mr, int flags, u64 start,
  1129. u64 length, u64 virt_addr, int new_access_flags,
  1130. struct ib_pd *new_pd, struct ib_udata *udata)
  1131. {
  1132. struct mlx5_ib_dev *dev = to_mdev(ib_mr->device);
  1133. struct mlx5_ib_mr *mr = to_mmr(ib_mr);
  1134. struct ib_pd *pd = (flags & IB_MR_REREG_PD) ? new_pd : ib_mr->pd;
  1135. int access_flags = flags & IB_MR_REREG_ACCESS ?
  1136. new_access_flags :
  1137. mr->access_flags;
  1138. u64 addr = (flags & IB_MR_REREG_TRANS) ? virt_addr : mr->umem->address;
  1139. u64 len = (flags & IB_MR_REREG_TRANS) ? length : mr->umem->length;
  1140. int page_shift = 0;
  1141. int npages = 0;
  1142. int ncont = 0;
  1143. int order = 0;
  1144. int err;
  1145. mlx5_ib_dbg(dev, "start 0x%llx, virt_addr 0x%llx, length 0x%llx, access_flags 0x%x\n",
  1146. start, virt_addr, length, access_flags);
  1147. if (flags != IB_MR_REREG_PD) {
  1148. /*
  1149. * Replace umem. This needs to be done whether or not UMR is
  1150. * used.
  1151. */
  1152. flags |= IB_MR_REREG_TRANS;
  1153. ib_umem_release(mr->umem);
  1154. mr->umem = mr_umem_get(pd, addr, len, access_flags, &npages,
  1155. &page_shift, &ncont, &order);
  1156. if (IS_ERR(mr->umem)) {
  1157. err = PTR_ERR(mr->umem);
  1158. mr->umem = NULL;
  1159. return err;
  1160. }
  1161. }
  1162. if (flags & IB_MR_REREG_TRANS && !use_umr_mtt_update(mr, addr, len)) {
  1163. /*
  1164. * UMR can't be used - MKey needs to be replaced.
  1165. */
  1166. if (mr->umred) {
  1167. err = unreg_umr(dev, mr);
  1168. if (err)
  1169. mlx5_ib_warn(dev, "Failed to unregister MR\n");
  1170. } else {
  1171. err = destroy_mkey(dev, mr);
  1172. if (err)
  1173. mlx5_ib_warn(dev, "Failed to destroy MKey\n");
  1174. }
  1175. if (err)
  1176. return err;
  1177. mr = reg_create(ib_mr, pd, addr, len, mr->umem, ncont,
  1178. page_shift, access_flags);
  1179. if (IS_ERR(mr))
  1180. return PTR_ERR(mr);
  1181. mr->umred = 0;
  1182. } else {
  1183. /*
  1184. * Send a UMR WQE
  1185. */
  1186. err = rereg_umr(pd, mr, addr, len, npages, page_shift,
  1187. order, access_flags, flags);
  1188. if (err) {
  1189. mlx5_ib_warn(dev, "Failed to rereg UMR\n");
  1190. return err;
  1191. }
  1192. }
  1193. if (flags & IB_MR_REREG_PD) {
  1194. ib_mr->pd = pd;
  1195. mr->mmkey.pd = to_mpd(pd)->pdn;
  1196. }
  1197. if (flags & IB_MR_REREG_ACCESS)
  1198. mr->access_flags = access_flags;
  1199. if (flags & IB_MR_REREG_TRANS) {
  1200. atomic_sub(mr->npages, &dev->mdev->priv.reg_pages);
  1201. set_mr_fileds(dev, mr, npages, len, access_flags);
  1202. mr->mmkey.iova = addr;
  1203. mr->mmkey.size = len;
  1204. }
  1205. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  1206. update_odp_mr(mr);
  1207. #endif
  1208. return 0;
  1209. }
  1210. static int
  1211. mlx5_alloc_priv_descs(struct ib_device *device,
  1212. struct mlx5_ib_mr *mr,
  1213. int ndescs,
  1214. int desc_size)
  1215. {
  1216. int size = ndescs * desc_size;
  1217. int add_size;
  1218. int ret;
  1219. add_size = max_t(int, MLX5_UMR_ALIGN - ARCH_KMALLOC_MINALIGN, 0);
  1220. mr->descs_alloc = kzalloc(size + add_size, GFP_KERNEL);
  1221. if (!mr->descs_alloc)
  1222. return -ENOMEM;
  1223. mr->descs = PTR_ALIGN(mr->descs_alloc, MLX5_UMR_ALIGN);
  1224. mr->desc_map = dma_map_single(device->dma_device, mr->descs,
  1225. size, DMA_TO_DEVICE);
  1226. if (dma_mapping_error(device->dma_device, mr->desc_map)) {
  1227. ret = -ENOMEM;
  1228. goto err;
  1229. }
  1230. return 0;
  1231. err:
  1232. kfree(mr->descs_alloc);
  1233. return ret;
  1234. }
  1235. static void
  1236. mlx5_free_priv_descs(struct mlx5_ib_mr *mr)
  1237. {
  1238. if (mr->descs) {
  1239. struct ib_device *device = mr->ibmr.device;
  1240. int size = mr->max_descs * mr->desc_size;
  1241. dma_unmap_single(device->dma_device, mr->desc_map,
  1242. size, DMA_TO_DEVICE);
  1243. kfree(mr->descs_alloc);
  1244. mr->descs = NULL;
  1245. }
  1246. }
  1247. static int clean_mr(struct mlx5_ib_mr *mr)
  1248. {
  1249. struct mlx5_ib_dev *dev = to_mdev(mr->ibmr.device);
  1250. int umred = mr->umred;
  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 (!umred) {
  1266. err = destroy_mkey(dev, mr);
  1267. if (err) {
  1268. mlx5_ib_warn(dev, "failed to destroy mkey 0x%x (%d)\n",
  1269. mr->mmkey.key, err);
  1270. return err;
  1271. }
  1272. } else {
  1273. err = unreg_umr(dev, mr);
  1274. if (err) {
  1275. mlx5_ib_warn(dev, "failed unregister\n");
  1276. return err;
  1277. }
  1278. free_cached_mr(dev, mr);
  1279. }
  1280. if (!umred)
  1281. kfree(mr);
  1282. return 0;
  1283. }
  1284. int mlx5_ib_dereg_mr(struct ib_mr *ibmr)
  1285. {
  1286. struct mlx5_ib_dev *dev = to_mdev(ibmr->device);
  1287. struct mlx5_ib_mr *mr = to_mmr(ibmr);
  1288. int npages = mr->npages;
  1289. struct ib_umem *umem = mr->umem;
  1290. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  1291. if (umem && umem->odp_data) {
  1292. /* Prevent new page faults from succeeding */
  1293. mr->live = 0;
  1294. /* Wait for all running page-fault handlers to finish. */
  1295. synchronize_srcu(&dev->mr_srcu);
  1296. /* Destroy all page mappings */
  1297. mlx5_ib_invalidate_range(umem, ib_umem_start(umem),
  1298. ib_umem_end(umem));
  1299. /*
  1300. * We kill the umem before the MR for ODP,
  1301. * so that there will not be any invalidations in
  1302. * flight, looking at the *mr struct.
  1303. */
  1304. ib_umem_release(umem);
  1305. atomic_sub(npages, &dev->mdev->priv.reg_pages);
  1306. /* Avoid double-freeing the umem. */
  1307. umem = NULL;
  1308. }
  1309. #endif
  1310. clean_mr(mr);
  1311. if (umem) {
  1312. ib_umem_release(umem);
  1313. atomic_sub(npages, &dev->mdev->priv.reg_pages);
  1314. }
  1315. return 0;
  1316. }
  1317. struct ib_mr *mlx5_ib_alloc_mr(struct ib_pd *pd,
  1318. enum ib_mr_type mr_type,
  1319. u32 max_num_sg)
  1320. {
  1321. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  1322. int inlen = MLX5_ST_SZ_BYTES(create_mkey_in);
  1323. int ndescs = ALIGN(max_num_sg, 4);
  1324. struct mlx5_ib_mr *mr;
  1325. void *mkc;
  1326. u32 *in;
  1327. int err;
  1328. mr = kzalloc(sizeof(*mr), GFP_KERNEL);
  1329. if (!mr)
  1330. return ERR_PTR(-ENOMEM);
  1331. in = kzalloc(inlen, GFP_KERNEL);
  1332. if (!in) {
  1333. err = -ENOMEM;
  1334. goto err_free;
  1335. }
  1336. mkc = MLX5_ADDR_OF(create_mkey_in, in, memory_key_mkey_entry);
  1337. MLX5_SET(mkc, mkc, free, 1);
  1338. MLX5_SET(mkc, mkc, translations_octword_size, ndescs);
  1339. MLX5_SET(mkc, mkc, qpn, 0xffffff);
  1340. MLX5_SET(mkc, mkc, pd, to_mpd(pd)->pdn);
  1341. if (mr_type == IB_MR_TYPE_MEM_REG) {
  1342. mr->access_mode = MLX5_MKC_ACCESS_MODE_MTT;
  1343. MLX5_SET(mkc, mkc, log_page_size, PAGE_SHIFT);
  1344. err = mlx5_alloc_priv_descs(pd->device, mr,
  1345. ndescs, sizeof(u64));
  1346. if (err)
  1347. goto err_free_in;
  1348. mr->desc_size = sizeof(u64);
  1349. mr->max_descs = ndescs;
  1350. } else if (mr_type == IB_MR_TYPE_SG_GAPS) {
  1351. mr->access_mode = MLX5_MKC_ACCESS_MODE_KLMS;
  1352. err = mlx5_alloc_priv_descs(pd->device, mr,
  1353. ndescs, sizeof(struct mlx5_klm));
  1354. if (err)
  1355. goto err_free_in;
  1356. mr->desc_size = sizeof(struct mlx5_klm);
  1357. mr->max_descs = ndescs;
  1358. } else if (mr_type == IB_MR_TYPE_SIGNATURE) {
  1359. u32 psv_index[2];
  1360. MLX5_SET(mkc, mkc, bsf_en, 1);
  1361. MLX5_SET(mkc, mkc, bsf_octword_size, MLX5_MKEY_BSF_OCTO_SIZE);
  1362. mr->sig = kzalloc(sizeof(*mr->sig), GFP_KERNEL);
  1363. if (!mr->sig) {
  1364. err = -ENOMEM;
  1365. goto err_free_in;
  1366. }
  1367. /* create mem & wire PSVs */
  1368. err = mlx5_core_create_psv(dev->mdev, to_mpd(pd)->pdn,
  1369. 2, psv_index);
  1370. if (err)
  1371. goto err_free_sig;
  1372. mr->access_mode = MLX5_MKC_ACCESS_MODE_KLMS;
  1373. mr->sig->psv_memory.psv_idx = psv_index[0];
  1374. mr->sig->psv_wire.psv_idx = psv_index[1];
  1375. mr->sig->sig_status_checked = true;
  1376. mr->sig->sig_err_exists = false;
  1377. /* Next UMR, Arm SIGERR */
  1378. ++mr->sig->sigerr_count;
  1379. } else {
  1380. mlx5_ib_warn(dev, "Invalid mr type %d\n", mr_type);
  1381. err = -EINVAL;
  1382. goto err_free_in;
  1383. }
  1384. MLX5_SET(mkc, mkc, access_mode, mr->access_mode);
  1385. MLX5_SET(mkc, mkc, umr_en, 1);
  1386. mr->ibmr.device = pd->device;
  1387. err = mlx5_core_create_mkey(dev->mdev, &mr->mmkey, in, inlen);
  1388. if (err)
  1389. goto err_destroy_psv;
  1390. mr->ibmr.lkey = mr->mmkey.key;
  1391. mr->ibmr.rkey = mr->mmkey.key;
  1392. mr->umem = NULL;
  1393. kfree(in);
  1394. return &mr->ibmr;
  1395. err_destroy_psv:
  1396. if (mr->sig) {
  1397. if (mlx5_core_destroy_psv(dev->mdev,
  1398. mr->sig->psv_memory.psv_idx))
  1399. mlx5_ib_warn(dev, "failed to destroy mem psv %d\n",
  1400. mr->sig->psv_memory.psv_idx);
  1401. if (mlx5_core_destroy_psv(dev->mdev,
  1402. mr->sig->psv_wire.psv_idx))
  1403. mlx5_ib_warn(dev, "failed to destroy wire psv %d\n",
  1404. mr->sig->psv_wire.psv_idx);
  1405. }
  1406. mlx5_free_priv_descs(mr);
  1407. err_free_sig:
  1408. kfree(mr->sig);
  1409. err_free_in:
  1410. kfree(in);
  1411. err_free:
  1412. kfree(mr);
  1413. return ERR_PTR(err);
  1414. }
  1415. struct ib_mw *mlx5_ib_alloc_mw(struct ib_pd *pd, enum ib_mw_type type,
  1416. struct ib_udata *udata)
  1417. {
  1418. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  1419. int inlen = MLX5_ST_SZ_BYTES(create_mkey_in);
  1420. struct mlx5_ib_mw *mw = NULL;
  1421. u32 *in = NULL;
  1422. void *mkc;
  1423. int ndescs;
  1424. int err;
  1425. struct mlx5_ib_alloc_mw req = {};
  1426. struct {
  1427. __u32 comp_mask;
  1428. __u32 response_length;
  1429. } resp = {};
  1430. err = ib_copy_from_udata(&req, udata, min(udata->inlen, sizeof(req)));
  1431. if (err)
  1432. return ERR_PTR(err);
  1433. if (req.comp_mask || req.reserved1 || req.reserved2)
  1434. return ERR_PTR(-EOPNOTSUPP);
  1435. if (udata->inlen > sizeof(req) &&
  1436. !ib_is_udata_cleared(udata, sizeof(req),
  1437. udata->inlen - sizeof(req)))
  1438. return ERR_PTR(-EOPNOTSUPP);
  1439. ndescs = req.num_klms ? roundup(req.num_klms, 4) : roundup(1, 4);
  1440. mw = kzalloc(sizeof(*mw), GFP_KERNEL);
  1441. in = kzalloc(inlen, GFP_KERNEL);
  1442. if (!mw || !in) {
  1443. err = -ENOMEM;
  1444. goto free;
  1445. }
  1446. mkc = MLX5_ADDR_OF(create_mkey_in, in, memory_key_mkey_entry);
  1447. MLX5_SET(mkc, mkc, free, 1);
  1448. MLX5_SET(mkc, mkc, translations_octword_size, ndescs);
  1449. MLX5_SET(mkc, mkc, pd, to_mpd(pd)->pdn);
  1450. MLX5_SET(mkc, mkc, umr_en, 1);
  1451. MLX5_SET(mkc, mkc, lr, 1);
  1452. MLX5_SET(mkc, mkc, access_mode, MLX5_MKC_ACCESS_MODE_KLMS);
  1453. MLX5_SET(mkc, mkc, en_rinval, !!((type == IB_MW_TYPE_2)));
  1454. MLX5_SET(mkc, mkc, qpn, 0xffffff);
  1455. err = mlx5_core_create_mkey(dev->mdev, &mw->mmkey, in, inlen);
  1456. if (err)
  1457. goto free;
  1458. mw->ibmw.rkey = mw->mmkey.key;
  1459. resp.response_length = min(offsetof(typeof(resp), response_length) +
  1460. sizeof(resp.response_length), udata->outlen);
  1461. if (resp.response_length) {
  1462. err = ib_copy_to_udata(udata, &resp, resp.response_length);
  1463. if (err) {
  1464. mlx5_core_destroy_mkey(dev->mdev, &mw->mmkey);
  1465. goto free;
  1466. }
  1467. }
  1468. kfree(in);
  1469. return &mw->ibmw;
  1470. free:
  1471. kfree(mw);
  1472. kfree(in);
  1473. return ERR_PTR(err);
  1474. }
  1475. int mlx5_ib_dealloc_mw(struct ib_mw *mw)
  1476. {
  1477. struct mlx5_ib_mw *mmw = to_mmw(mw);
  1478. int err;
  1479. err = mlx5_core_destroy_mkey((to_mdev(mw->device))->mdev,
  1480. &mmw->mmkey);
  1481. if (!err)
  1482. kfree(mmw);
  1483. return err;
  1484. }
  1485. int mlx5_ib_check_mr_status(struct ib_mr *ibmr, u32 check_mask,
  1486. struct ib_mr_status *mr_status)
  1487. {
  1488. struct mlx5_ib_mr *mmr = to_mmr(ibmr);
  1489. int ret = 0;
  1490. if (check_mask & ~IB_MR_CHECK_SIG_STATUS) {
  1491. pr_err("Invalid status check mask\n");
  1492. ret = -EINVAL;
  1493. goto done;
  1494. }
  1495. mr_status->fail_status = 0;
  1496. if (check_mask & IB_MR_CHECK_SIG_STATUS) {
  1497. if (!mmr->sig) {
  1498. ret = -EINVAL;
  1499. pr_err("signature status check requested on a non-signature enabled MR\n");
  1500. goto done;
  1501. }
  1502. mmr->sig->sig_status_checked = true;
  1503. if (!mmr->sig->sig_err_exists)
  1504. goto done;
  1505. if (ibmr->lkey == mmr->sig->err_item.key)
  1506. memcpy(&mr_status->sig_err, &mmr->sig->err_item,
  1507. sizeof(mr_status->sig_err));
  1508. else {
  1509. mr_status->sig_err.err_type = IB_SIG_BAD_GUARD;
  1510. mr_status->sig_err.sig_err_offset = 0;
  1511. mr_status->sig_err.key = mmr->sig->err_item.key;
  1512. }
  1513. mmr->sig->sig_err_exists = false;
  1514. mr_status->fail_status |= IB_MR_CHECK_SIG_STATUS;
  1515. }
  1516. done:
  1517. return ret;
  1518. }
  1519. static int
  1520. mlx5_ib_sg_to_klms(struct mlx5_ib_mr *mr,
  1521. struct scatterlist *sgl,
  1522. unsigned short sg_nents,
  1523. unsigned int *sg_offset_p)
  1524. {
  1525. struct scatterlist *sg = sgl;
  1526. struct mlx5_klm *klms = mr->descs;
  1527. unsigned int sg_offset = sg_offset_p ? *sg_offset_p : 0;
  1528. u32 lkey = mr->ibmr.pd->local_dma_lkey;
  1529. int i;
  1530. mr->ibmr.iova = sg_dma_address(sg) + sg_offset;
  1531. mr->ibmr.length = 0;
  1532. for_each_sg(sgl, sg, sg_nents, i) {
  1533. if (unlikely(i >= mr->max_descs))
  1534. break;
  1535. klms[i].va = cpu_to_be64(sg_dma_address(sg) + sg_offset);
  1536. klms[i].bcount = cpu_to_be32(sg_dma_len(sg) - sg_offset);
  1537. klms[i].key = cpu_to_be32(lkey);
  1538. mr->ibmr.length += sg_dma_len(sg) - sg_offset;
  1539. sg_offset = 0;
  1540. }
  1541. mr->ndescs = i;
  1542. if (sg_offset_p)
  1543. *sg_offset_p = sg_offset;
  1544. return i;
  1545. }
  1546. static int mlx5_set_page(struct ib_mr *ibmr, u64 addr)
  1547. {
  1548. struct mlx5_ib_mr *mr = to_mmr(ibmr);
  1549. __be64 *descs;
  1550. if (unlikely(mr->ndescs == mr->max_descs))
  1551. return -ENOMEM;
  1552. descs = mr->descs;
  1553. descs[mr->ndescs++] = cpu_to_be64(addr | MLX5_EN_RD | MLX5_EN_WR);
  1554. return 0;
  1555. }
  1556. int mlx5_ib_map_mr_sg(struct ib_mr *ibmr, struct scatterlist *sg, int sg_nents,
  1557. unsigned int *sg_offset)
  1558. {
  1559. struct mlx5_ib_mr *mr = to_mmr(ibmr);
  1560. int n;
  1561. mr->ndescs = 0;
  1562. ib_dma_sync_single_for_cpu(ibmr->device, mr->desc_map,
  1563. mr->desc_size * mr->max_descs,
  1564. DMA_TO_DEVICE);
  1565. if (mr->access_mode == MLX5_MKC_ACCESS_MODE_KLMS)
  1566. n = mlx5_ib_sg_to_klms(mr, sg, sg_nents, sg_offset);
  1567. else
  1568. n = ib_sg_to_pages(ibmr, sg, sg_nents, sg_offset,
  1569. mlx5_set_page);
  1570. ib_dma_sync_single_for_device(ibmr->device, mr->desc_map,
  1571. mr->desc_size * mr->max_descs,
  1572. DMA_TO_DEVICE);
  1573. return n;
  1574. }