mr.c 48 KB

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