ehea_qmr.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710
  1. /*
  2. * linux/drivers/net/ehea/ehea_qmr.c
  3. *
  4. * eHEA ethernet device driver for IBM eServer System p
  5. *
  6. * (C) Copyright IBM Corp. 2006
  7. *
  8. * Authors:
  9. * Christoph Raisch <raisch@de.ibm.com>
  10. * Jan-Bernd Themann <themann@de.ibm.com>
  11. * Thomas Klein <tklein@de.ibm.com>
  12. *
  13. *
  14. * This program is free software; you can redistribute it and/or modify
  15. * it under the terms of the GNU General Public License as published by
  16. * the Free Software Foundation; either version 2, or (at your option)
  17. * any later version.
  18. *
  19. * This program is distributed in the hope that it will be useful,
  20. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  21. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  22. * GNU General Public License for more details.
  23. *
  24. * You should have received a copy of the GNU General Public License
  25. * along with this program; if not, write to the Free Software
  26. * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  27. */
  28. #include <linux/mm.h>
  29. #include "ehea.h"
  30. #include "ehea_phyp.h"
  31. #include "ehea_qmr.h"
  32. static void *hw_qpageit_get_inc(struct hw_queue *queue)
  33. {
  34. void *retvalue = hw_qeit_get(queue);
  35. queue->current_q_offset += queue->pagesize;
  36. if (queue->current_q_offset > queue->queue_length) {
  37. queue->current_q_offset -= queue->pagesize;
  38. retvalue = NULL;
  39. } else if (((u64) retvalue) & (EHEA_PAGESIZE-1)) {
  40. ehea_error("not on pageboundary");
  41. retvalue = NULL;
  42. }
  43. return retvalue;
  44. }
  45. static int hw_queue_ctor(struct hw_queue *queue, const u32 nr_of_pages,
  46. const u32 pagesize, const u32 qe_size)
  47. {
  48. int pages_per_kpage = PAGE_SIZE / pagesize;
  49. int i, k;
  50. if ((pagesize > PAGE_SIZE) || (!pages_per_kpage)) {
  51. ehea_error("pagesize conflict! kernel pagesize=%d, "
  52. "ehea pagesize=%d", (int)PAGE_SIZE, (int)pagesize);
  53. return -EINVAL;
  54. }
  55. queue->queue_length = nr_of_pages * pagesize;
  56. queue->queue_pages = kmalloc(nr_of_pages * sizeof(void*), GFP_KERNEL);
  57. if (!queue->queue_pages) {
  58. ehea_error("no mem for queue_pages");
  59. return -ENOMEM;
  60. }
  61. /*
  62. * allocate pages for queue:
  63. * outer loop allocates whole kernel pages (page aligned) and
  64. * inner loop divides a kernel page into smaller hea queue pages
  65. */
  66. i = 0;
  67. while (i < nr_of_pages) {
  68. u8 *kpage = (u8*)get_zeroed_page(GFP_KERNEL);
  69. if (!kpage)
  70. goto out_nomem;
  71. for (k = 0; k < pages_per_kpage && i < nr_of_pages; k++) {
  72. (queue->queue_pages)[i] = (struct ehea_page*)kpage;
  73. kpage += pagesize;
  74. i++;
  75. }
  76. }
  77. queue->current_q_offset = 0;
  78. queue->qe_size = qe_size;
  79. queue->pagesize = pagesize;
  80. queue->toggle_state = 1;
  81. return 0;
  82. out_nomem:
  83. for (i = 0; i < nr_of_pages; i += pages_per_kpage) {
  84. if (!(queue->queue_pages)[i])
  85. break;
  86. free_page((unsigned long)(queue->queue_pages)[i]);
  87. }
  88. return -ENOMEM;
  89. }
  90. static void hw_queue_dtor(struct hw_queue *queue)
  91. {
  92. int pages_per_kpage = PAGE_SIZE / queue->pagesize;
  93. int i, nr_pages;
  94. if (!queue || !queue->queue_pages)
  95. return;
  96. nr_pages = queue->queue_length / queue->pagesize;
  97. for (i = 0; i < nr_pages; i += pages_per_kpage)
  98. free_page((unsigned long)(queue->queue_pages)[i]);
  99. kfree(queue->queue_pages);
  100. }
  101. struct ehea_cq *ehea_create_cq(struct ehea_adapter *adapter,
  102. int nr_of_cqe, u64 eq_handle, u32 cq_token)
  103. {
  104. struct ehea_cq *cq;
  105. struct h_epa epa;
  106. u64 *cq_handle_ref, hret, rpage;
  107. u32 act_nr_of_entries, act_pages, counter;
  108. int ret;
  109. void *vpage;
  110. cq = kzalloc(sizeof(*cq), GFP_KERNEL);
  111. if (!cq) {
  112. ehea_error("no mem for cq");
  113. goto out_nomem;
  114. }
  115. cq->attr.max_nr_of_cqes = nr_of_cqe;
  116. cq->attr.cq_token = cq_token;
  117. cq->attr.eq_handle = eq_handle;
  118. cq->adapter = adapter;
  119. cq_handle_ref = &cq->fw_handle;
  120. act_nr_of_entries = 0;
  121. act_pages = 0;
  122. hret = ehea_h_alloc_resource_cq(adapter->handle, &cq->attr,
  123. &cq->fw_handle, &cq->epas);
  124. if (hret != H_SUCCESS) {
  125. ehea_error("alloc_resource_cq failed");
  126. goto out_freemem;
  127. }
  128. ret = hw_queue_ctor(&cq->hw_queue, cq->attr.nr_pages,
  129. EHEA_PAGESIZE, sizeof(struct ehea_cqe));
  130. if (ret)
  131. goto out_freeres;
  132. for (counter = 0; counter < cq->attr.nr_pages; counter++) {
  133. vpage = hw_qpageit_get_inc(&cq->hw_queue);
  134. if (!vpage) {
  135. ehea_error("hw_qpageit_get_inc failed");
  136. goto out_kill_hwq;
  137. }
  138. rpage = virt_to_abs(vpage);
  139. hret = ehea_h_register_rpage(adapter->handle,
  140. 0, EHEA_CQ_REGISTER_ORIG,
  141. cq->fw_handle, rpage, 1);
  142. if (hret < H_SUCCESS) {
  143. ehea_error("register_rpage_cq failed ehea_cq=%p "
  144. "hret=%lx counter=%i act_pages=%i",
  145. cq, hret, counter, cq->attr.nr_pages);
  146. goto out_kill_hwq;
  147. }
  148. if (counter == (cq->attr.nr_pages - 1)) {
  149. vpage = hw_qpageit_get_inc(&cq->hw_queue);
  150. if ((hret != H_SUCCESS) || (vpage)) {
  151. ehea_error("registration of pages not "
  152. "complete hret=%lx\n", hret);
  153. goto out_kill_hwq;
  154. }
  155. } else {
  156. if ((hret != H_PAGE_REGISTERED) || (!vpage)) {
  157. ehea_error("CQ: registration of page failed "
  158. "hret=%lx\n", hret);
  159. goto out_kill_hwq;
  160. }
  161. }
  162. }
  163. hw_qeit_reset(&cq->hw_queue);
  164. epa = cq->epas.kernel;
  165. ehea_reset_cq_ep(cq);
  166. ehea_reset_cq_n1(cq);
  167. return cq;
  168. out_kill_hwq:
  169. hw_queue_dtor(&cq->hw_queue);
  170. out_freeres:
  171. ehea_h_free_resource(adapter->handle, cq->fw_handle, FORCE_FREE);
  172. out_freemem:
  173. kfree(cq);
  174. out_nomem:
  175. return NULL;
  176. }
  177. u64 ehea_destroy_cq_res(struct ehea_cq *cq, u64 force)
  178. {
  179. u64 hret;
  180. u64 adapter_handle = cq->adapter->handle;
  181. /* deregister all previous registered pages */
  182. hret = ehea_h_free_resource(adapter_handle, cq->fw_handle, force);
  183. if (hret != H_SUCCESS)
  184. return hret;
  185. hw_queue_dtor(&cq->hw_queue);
  186. kfree(cq);
  187. return hret;
  188. }
  189. int ehea_destroy_cq(struct ehea_cq *cq)
  190. {
  191. u64 hret;
  192. if (!cq)
  193. return 0;
  194. if ((hret = ehea_destroy_cq_res(cq, NORMAL_FREE)) == H_R_STATE) {
  195. ehea_error_data(cq->adapter, cq->fw_handle);
  196. hret = ehea_destroy_cq_res(cq, FORCE_FREE);
  197. }
  198. if (hret != H_SUCCESS) {
  199. ehea_error("destroy CQ failed");
  200. return -EIO;
  201. }
  202. return 0;
  203. }
  204. struct ehea_eq *ehea_create_eq(struct ehea_adapter *adapter,
  205. const enum ehea_eq_type type,
  206. const u32 max_nr_of_eqes, const u8 eqe_gen)
  207. {
  208. int ret, i;
  209. u64 hret, rpage;
  210. void *vpage;
  211. struct ehea_eq *eq;
  212. eq = kzalloc(sizeof(*eq), GFP_KERNEL);
  213. if (!eq) {
  214. ehea_error("no mem for eq");
  215. return NULL;
  216. }
  217. eq->adapter = adapter;
  218. eq->attr.type = type;
  219. eq->attr.max_nr_of_eqes = max_nr_of_eqes;
  220. eq->attr.eqe_gen = eqe_gen;
  221. spin_lock_init(&eq->spinlock);
  222. hret = ehea_h_alloc_resource_eq(adapter->handle,
  223. &eq->attr, &eq->fw_handle);
  224. if (hret != H_SUCCESS) {
  225. ehea_error("alloc_resource_eq failed");
  226. goto out_freemem;
  227. }
  228. ret = hw_queue_ctor(&eq->hw_queue, eq->attr.nr_pages,
  229. EHEA_PAGESIZE, sizeof(struct ehea_eqe));
  230. if (ret) {
  231. ehea_error("can't allocate eq pages");
  232. goto out_freeres;
  233. }
  234. for (i = 0; i < eq->attr.nr_pages; i++) {
  235. vpage = hw_qpageit_get_inc(&eq->hw_queue);
  236. if (!vpage) {
  237. ehea_error("hw_qpageit_get_inc failed");
  238. hret = H_RESOURCE;
  239. goto out_kill_hwq;
  240. }
  241. rpage = virt_to_abs(vpage);
  242. hret = ehea_h_register_rpage(adapter->handle, 0,
  243. EHEA_EQ_REGISTER_ORIG,
  244. eq->fw_handle, rpage, 1);
  245. if (i == (eq->attr.nr_pages - 1)) {
  246. /* last page */
  247. vpage = hw_qpageit_get_inc(&eq->hw_queue);
  248. if ((hret != H_SUCCESS) || (vpage)) {
  249. goto out_kill_hwq;
  250. }
  251. } else {
  252. if ((hret != H_PAGE_REGISTERED) || (!vpage)) {
  253. goto out_kill_hwq;
  254. }
  255. }
  256. }
  257. hw_qeit_reset(&eq->hw_queue);
  258. return eq;
  259. out_kill_hwq:
  260. hw_queue_dtor(&eq->hw_queue);
  261. out_freeres:
  262. ehea_h_free_resource(adapter->handle, eq->fw_handle, FORCE_FREE);
  263. out_freemem:
  264. kfree(eq);
  265. return NULL;
  266. }
  267. struct ehea_eqe *ehea_poll_eq(struct ehea_eq *eq)
  268. {
  269. struct ehea_eqe *eqe;
  270. unsigned long flags;
  271. spin_lock_irqsave(&eq->spinlock, flags);
  272. eqe = (struct ehea_eqe*)hw_eqit_eq_get_inc_valid(&eq->hw_queue);
  273. spin_unlock_irqrestore(&eq->spinlock, flags);
  274. return eqe;
  275. }
  276. u64 ehea_destroy_eq_res(struct ehea_eq *eq, u64 force)
  277. {
  278. u64 hret;
  279. unsigned long flags;
  280. spin_lock_irqsave(&eq->spinlock, flags);
  281. hret = ehea_h_free_resource(eq->adapter->handle, eq->fw_handle, force);
  282. spin_unlock_irqrestore(&eq->spinlock, flags);
  283. if (hret != H_SUCCESS)
  284. return hret;
  285. hw_queue_dtor(&eq->hw_queue);
  286. kfree(eq);
  287. return hret;
  288. }
  289. int ehea_destroy_eq(struct ehea_eq *eq)
  290. {
  291. u64 hret;
  292. if (!eq)
  293. return 0;
  294. if ((hret = ehea_destroy_eq_res(eq, NORMAL_FREE)) == H_R_STATE) {
  295. ehea_error_data(eq->adapter, eq->fw_handle);
  296. hret = ehea_destroy_eq_res(eq, FORCE_FREE);
  297. }
  298. if (hret != H_SUCCESS) {
  299. ehea_error("destroy EQ failed");
  300. return -EIO;
  301. }
  302. return 0;
  303. }
  304. /**
  305. * allocates memory for a queue and registers pages in phyp
  306. */
  307. int ehea_qp_alloc_register(struct ehea_qp *qp, struct hw_queue *hw_queue,
  308. int nr_pages, int wqe_size, int act_nr_sges,
  309. struct ehea_adapter *adapter, int h_call_q_selector)
  310. {
  311. u64 hret, rpage;
  312. int ret, cnt;
  313. void *vpage;
  314. ret = hw_queue_ctor(hw_queue, nr_pages, EHEA_PAGESIZE, wqe_size);
  315. if (ret)
  316. return ret;
  317. for (cnt = 0; cnt < nr_pages; cnt++) {
  318. vpage = hw_qpageit_get_inc(hw_queue);
  319. if (!vpage) {
  320. ehea_error("hw_qpageit_get_inc failed");
  321. goto out_kill_hwq;
  322. }
  323. rpage = virt_to_abs(vpage);
  324. hret = ehea_h_register_rpage(adapter->handle,
  325. 0, h_call_q_selector,
  326. qp->fw_handle, rpage, 1);
  327. if (hret < H_SUCCESS) {
  328. ehea_error("register_rpage_qp failed");
  329. goto out_kill_hwq;
  330. }
  331. }
  332. hw_qeit_reset(hw_queue);
  333. return 0;
  334. out_kill_hwq:
  335. hw_queue_dtor(hw_queue);
  336. return -EIO;
  337. }
  338. static inline u32 map_wqe_size(u8 wqe_enc_size)
  339. {
  340. return 128 << wqe_enc_size;
  341. }
  342. struct ehea_qp *ehea_create_qp(struct ehea_adapter *adapter,
  343. u32 pd, struct ehea_qp_init_attr *init_attr)
  344. {
  345. int ret;
  346. u64 hret;
  347. struct ehea_qp *qp;
  348. u32 wqe_size_in_bytes_sq, wqe_size_in_bytes_rq1;
  349. u32 wqe_size_in_bytes_rq2, wqe_size_in_bytes_rq3;
  350. qp = kzalloc(sizeof(*qp), GFP_KERNEL);
  351. if (!qp) {
  352. ehea_error("no mem for qp");
  353. return NULL;
  354. }
  355. qp->adapter = adapter;
  356. hret = ehea_h_alloc_resource_qp(adapter->handle, init_attr, pd,
  357. &qp->fw_handle, &qp->epas);
  358. if (hret != H_SUCCESS) {
  359. ehea_error("ehea_h_alloc_resource_qp failed");
  360. goto out_freemem;
  361. }
  362. wqe_size_in_bytes_sq = map_wqe_size(init_attr->act_wqe_size_enc_sq);
  363. wqe_size_in_bytes_rq1 = map_wqe_size(init_attr->act_wqe_size_enc_rq1);
  364. wqe_size_in_bytes_rq2 = map_wqe_size(init_attr->act_wqe_size_enc_rq2);
  365. wqe_size_in_bytes_rq3 = map_wqe_size(init_attr->act_wqe_size_enc_rq3);
  366. ret = ehea_qp_alloc_register(qp, &qp->hw_squeue, init_attr->nr_sq_pages,
  367. wqe_size_in_bytes_sq,
  368. init_attr->act_wqe_size_enc_sq, adapter,
  369. 0);
  370. if (ret) {
  371. ehea_error("can't register for sq ret=%x", ret);
  372. goto out_freeres;
  373. }
  374. ret = ehea_qp_alloc_register(qp, &qp->hw_rqueue1,
  375. init_attr->nr_rq1_pages,
  376. wqe_size_in_bytes_rq1,
  377. init_attr->act_wqe_size_enc_rq1,
  378. adapter, 1);
  379. if (ret) {
  380. ehea_error("can't register for rq1 ret=%x", ret);
  381. goto out_kill_hwsq;
  382. }
  383. if (init_attr->rq_count > 1) {
  384. ret = ehea_qp_alloc_register(qp, &qp->hw_rqueue2,
  385. init_attr->nr_rq2_pages,
  386. wqe_size_in_bytes_rq2,
  387. init_attr->act_wqe_size_enc_rq2,
  388. adapter, 2);
  389. if (ret) {
  390. ehea_error("can't register for rq2 ret=%x", ret);
  391. goto out_kill_hwr1q;
  392. }
  393. }
  394. if (init_attr->rq_count > 2) {
  395. ret = ehea_qp_alloc_register(qp, &qp->hw_rqueue3,
  396. init_attr->nr_rq3_pages,
  397. wqe_size_in_bytes_rq3,
  398. init_attr->act_wqe_size_enc_rq3,
  399. adapter, 3);
  400. if (ret) {
  401. ehea_error("can't register for rq3 ret=%x", ret);
  402. goto out_kill_hwr2q;
  403. }
  404. }
  405. qp->init_attr = *init_attr;
  406. return qp;
  407. out_kill_hwr2q:
  408. hw_queue_dtor(&qp->hw_rqueue2);
  409. out_kill_hwr1q:
  410. hw_queue_dtor(&qp->hw_rqueue1);
  411. out_kill_hwsq:
  412. hw_queue_dtor(&qp->hw_squeue);
  413. out_freeres:
  414. ehea_h_disable_and_get_hea(adapter->handle, qp->fw_handle);
  415. ehea_h_free_resource(adapter->handle, qp->fw_handle, FORCE_FREE);
  416. out_freemem:
  417. kfree(qp);
  418. return NULL;
  419. }
  420. u64 ehea_destroy_qp_res(struct ehea_qp *qp, u64 force)
  421. {
  422. u64 hret;
  423. struct ehea_qp_init_attr *qp_attr = &qp->init_attr;
  424. ehea_h_disable_and_get_hea(qp->adapter->handle, qp->fw_handle);
  425. hret = ehea_h_free_resource(qp->adapter->handle, qp->fw_handle, force);
  426. if (hret != H_SUCCESS)
  427. return hret;
  428. hw_queue_dtor(&qp->hw_squeue);
  429. hw_queue_dtor(&qp->hw_rqueue1);
  430. if (qp_attr->rq_count > 1)
  431. hw_queue_dtor(&qp->hw_rqueue2);
  432. if (qp_attr->rq_count > 2)
  433. hw_queue_dtor(&qp->hw_rqueue3);
  434. kfree(qp);
  435. return hret;
  436. }
  437. int ehea_destroy_qp(struct ehea_qp *qp)
  438. {
  439. u64 hret;
  440. if (!qp)
  441. return 0;
  442. if ((hret = ehea_destroy_qp_res(qp, NORMAL_FREE)) == H_R_STATE) {
  443. ehea_error_data(qp->adapter, qp->fw_handle);
  444. hret = ehea_destroy_qp_res(qp, FORCE_FREE);
  445. }
  446. if (hret != H_SUCCESS) {
  447. ehea_error("destroy QP failed");
  448. return -EIO;
  449. }
  450. return 0;
  451. }
  452. int ehea_reg_kernel_mr(struct ehea_adapter *adapter, struct ehea_mr *mr)
  453. {
  454. int i, k, ret;
  455. u64 hret, pt_abs, start, end, nr_pages;
  456. u32 acc_ctrl = EHEA_MR_ACC_CTRL;
  457. u64 *pt;
  458. start = KERNELBASE;
  459. end = (u64)high_memory;
  460. nr_pages = (end - start) / EHEA_PAGESIZE;
  461. pt = kzalloc(PAGE_SIZE, GFP_KERNEL);
  462. if (!pt) {
  463. ehea_error("no mem");
  464. ret = -ENOMEM;
  465. goto out;
  466. }
  467. pt_abs = virt_to_abs(pt);
  468. hret = ehea_h_alloc_resource_mr(adapter->handle, start, end - start,
  469. acc_ctrl, adapter->pd,
  470. &mr->handle, &mr->lkey);
  471. if (hret != H_SUCCESS) {
  472. ehea_error("alloc_resource_mr failed");
  473. ret = -EIO;
  474. goto out;
  475. }
  476. mr->vaddr = KERNELBASE;
  477. k = 0;
  478. while (nr_pages > 0) {
  479. if (nr_pages > 1) {
  480. u64 num_pages = min(nr_pages, (u64)512);
  481. for (i = 0; i < num_pages; i++)
  482. pt[i] = virt_to_abs((void*)(((u64)start) +
  483. ((k++) *
  484. EHEA_PAGESIZE)));
  485. hret = ehea_h_register_rpage_mr(adapter->handle,
  486. mr->handle, 0,
  487. 0, (u64)pt_abs,
  488. num_pages);
  489. nr_pages -= num_pages;
  490. } else {
  491. u64 abs_adr = virt_to_abs((void*)(((u64)start) +
  492. (k * EHEA_PAGESIZE)));
  493. hret = ehea_h_register_rpage_mr(adapter->handle,
  494. mr->handle, 0,
  495. 0, abs_adr,1);
  496. nr_pages--;
  497. }
  498. if ((hret != H_SUCCESS) && (hret != H_PAGE_REGISTERED)) {
  499. ehea_h_free_resource(adapter->handle,
  500. mr->handle, FORCE_FREE);
  501. ehea_error("register_rpage_mr failed");
  502. ret = -EIO;
  503. goto out;
  504. }
  505. }
  506. if (hret != H_SUCCESS) {
  507. ehea_h_free_resource(adapter->handle, mr->handle,
  508. FORCE_FREE);
  509. ehea_error("register_rpage failed for last page");
  510. ret = -EIO;
  511. goto out;
  512. }
  513. mr->adapter = adapter;
  514. ret = 0;
  515. out:
  516. kfree(pt);
  517. return ret;
  518. }
  519. int ehea_rem_mr(struct ehea_mr *mr)
  520. {
  521. u64 hret;
  522. if (!mr || !mr->adapter)
  523. return -EINVAL;
  524. hret = ehea_h_free_resource(mr->adapter->handle, mr->handle,
  525. FORCE_FREE);
  526. if (hret != H_SUCCESS) {
  527. ehea_error("destroy MR failed");
  528. return -EIO;
  529. }
  530. return 0;
  531. }
  532. int ehea_gen_smr(struct ehea_adapter *adapter, struct ehea_mr *old_mr,
  533. struct ehea_mr *shared_mr)
  534. {
  535. u64 hret;
  536. hret = ehea_h_register_smr(adapter->handle, old_mr->handle,
  537. old_mr->vaddr, EHEA_MR_ACC_CTRL,
  538. adapter->pd, shared_mr);
  539. if (hret != H_SUCCESS)
  540. return -EIO;
  541. shared_mr->adapter = adapter;
  542. return 0;
  543. }
  544. void print_error_data(u64 *data)
  545. {
  546. int length;
  547. u64 type = EHEA_BMASK_GET(ERROR_DATA_TYPE, data[2]);
  548. u64 resource = data[1];
  549. length = EHEA_BMASK_GET(ERROR_DATA_LENGTH, data[0]);
  550. if (length > EHEA_PAGESIZE)
  551. length = EHEA_PAGESIZE;
  552. if (type == 0x8) /* Queue Pair */
  553. ehea_error("QP (resource=%lX) state: AER=0x%lX, AERR=0x%lX, "
  554. "port=%lX", resource, data[6], data[12], data[22]);
  555. if (type == 0x4) /* Completion Queue */
  556. ehea_error("CQ (resource=%lX) state: AER=0x%lX", resource,
  557. data[6]);
  558. if (type == 0x3) /* Event Queue */
  559. ehea_error("EQ (resource=%lX) state: AER=0x%lX", resource,
  560. data[6]);
  561. ehea_dump(data, length, "error data");
  562. }
  563. void ehea_error_data(struct ehea_adapter *adapter, u64 res_handle)
  564. {
  565. unsigned long ret;
  566. u64 *rblock;
  567. rblock = kzalloc(PAGE_SIZE, GFP_KERNEL);
  568. if (!rblock) {
  569. ehea_error("Cannot allocate rblock memory.");
  570. return;
  571. }
  572. ret = ehea_h_error_data(adapter->handle,
  573. res_handle,
  574. rblock);
  575. if (ret == H_R_STATE)
  576. ehea_error("No error data is available: %lX.", res_handle);
  577. else if (ret == H_SUCCESS)
  578. print_error_data(rblock);
  579. else
  580. ehea_error("Error data could not be fetched: %lX", res_handle);
  581. kfree(rblock);
  582. }