mr.c 44 KB

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