mr.c 45 KB

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