mr.c 48 KB

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