ehea_qmr.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779
  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. struct ehea_busmap ehea_bmap = { 0, 0, NULL };
  33. extern u64 ehea_driver_flags;
  34. extern struct work_struct ehea_rereg_mr_task;
  35. static void *hw_qpageit_get_inc(struct hw_queue *queue)
  36. {
  37. void *retvalue = hw_qeit_get(queue);
  38. queue->current_q_offset += queue->pagesize;
  39. if (queue->current_q_offset > queue->queue_length) {
  40. queue->current_q_offset -= queue->pagesize;
  41. retvalue = NULL;
  42. } else if (((u64) retvalue) & (EHEA_PAGESIZE-1)) {
  43. ehea_error("not on pageboundary");
  44. retvalue = NULL;
  45. }
  46. return retvalue;
  47. }
  48. static int hw_queue_ctor(struct hw_queue *queue, const u32 nr_of_pages,
  49. const u32 pagesize, const u32 qe_size)
  50. {
  51. int pages_per_kpage = PAGE_SIZE / pagesize;
  52. int i, k;
  53. if ((pagesize > PAGE_SIZE) || (!pages_per_kpage)) {
  54. ehea_error("pagesize conflict! kernel pagesize=%d, "
  55. "ehea pagesize=%d", (int)PAGE_SIZE, (int)pagesize);
  56. return -EINVAL;
  57. }
  58. queue->queue_length = nr_of_pages * pagesize;
  59. queue->queue_pages = kmalloc(nr_of_pages * sizeof(void*), GFP_KERNEL);
  60. if (!queue->queue_pages) {
  61. ehea_error("no mem for queue_pages");
  62. return -ENOMEM;
  63. }
  64. /*
  65. * allocate pages for queue:
  66. * outer loop allocates whole kernel pages (page aligned) and
  67. * inner loop divides a kernel page into smaller hea queue pages
  68. */
  69. i = 0;
  70. while (i < nr_of_pages) {
  71. u8 *kpage = (u8*)get_zeroed_page(GFP_KERNEL);
  72. if (!kpage)
  73. goto out_nomem;
  74. for (k = 0; k < pages_per_kpage && i < nr_of_pages; k++) {
  75. (queue->queue_pages)[i] = (struct ehea_page*)kpage;
  76. kpage += pagesize;
  77. i++;
  78. }
  79. }
  80. queue->current_q_offset = 0;
  81. queue->qe_size = qe_size;
  82. queue->pagesize = pagesize;
  83. queue->toggle_state = 1;
  84. return 0;
  85. out_nomem:
  86. for (i = 0; i < nr_of_pages; i += pages_per_kpage) {
  87. if (!(queue->queue_pages)[i])
  88. break;
  89. free_page((unsigned long)(queue->queue_pages)[i]);
  90. }
  91. return -ENOMEM;
  92. }
  93. static void hw_queue_dtor(struct hw_queue *queue)
  94. {
  95. int pages_per_kpage = PAGE_SIZE / queue->pagesize;
  96. int i, nr_pages;
  97. if (!queue || !queue->queue_pages)
  98. return;
  99. nr_pages = queue->queue_length / queue->pagesize;
  100. for (i = 0; i < nr_pages; i += pages_per_kpage)
  101. free_page((unsigned long)(queue->queue_pages)[i]);
  102. kfree(queue->queue_pages);
  103. }
  104. struct ehea_cq *ehea_create_cq(struct ehea_adapter *adapter,
  105. int nr_of_cqe, u64 eq_handle, u32 cq_token)
  106. {
  107. struct ehea_cq *cq;
  108. struct h_epa epa;
  109. u64 *cq_handle_ref, hret, rpage;
  110. u32 act_nr_of_entries, act_pages, counter;
  111. int ret;
  112. void *vpage;
  113. cq = kzalloc(sizeof(*cq), GFP_KERNEL);
  114. if (!cq) {
  115. ehea_error("no mem for cq");
  116. goto out_nomem;
  117. }
  118. cq->attr.max_nr_of_cqes = nr_of_cqe;
  119. cq->attr.cq_token = cq_token;
  120. cq->attr.eq_handle = eq_handle;
  121. cq->adapter = adapter;
  122. cq_handle_ref = &cq->fw_handle;
  123. act_nr_of_entries = 0;
  124. act_pages = 0;
  125. hret = ehea_h_alloc_resource_cq(adapter->handle, &cq->attr,
  126. &cq->fw_handle, &cq->epas);
  127. if (hret != H_SUCCESS) {
  128. ehea_error("alloc_resource_cq failed");
  129. goto out_freemem;
  130. }
  131. ret = hw_queue_ctor(&cq->hw_queue, cq->attr.nr_pages,
  132. EHEA_PAGESIZE, sizeof(struct ehea_cqe));
  133. if (ret)
  134. goto out_freeres;
  135. for (counter = 0; counter < cq->attr.nr_pages; counter++) {
  136. vpage = hw_qpageit_get_inc(&cq->hw_queue);
  137. if (!vpage) {
  138. ehea_error("hw_qpageit_get_inc failed");
  139. goto out_kill_hwq;
  140. }
  141. rpage = virt_to_abs(vpage);
  142. hret = ehea_h_register_rpage(adapter->handle,
  143. 0, EHEA_CQ_REGISTER_ORIG,
  144. cq->fw_handle, rpage, 1);
  145. if (hret < H_SUCCESS) {
  146. ehea_error("register_rpage_cq failed ehea_cq=%p "
  147. "hret=%lx counter=%i act_pages=%i",
  148. cq, hret, counter, cq->attr.nr_pages);
  149. goto out_kill_hwq;
  150. }
  151. if (counter == (cq->attr.nr_pages - 1)) {
  152. vpage = hw_qpageit_get_inc(&cq->hw_queue);
  153. if ((hret != H_SUCCESS) || (vpage)) {
  154. ehea_error("registration of pages not "
  155. "complete hret=%lx\n", hret);
  156. goto out_kill_hwq;
  157. }
  158. } else {
  159. if ((hret != H_PAGE_REGISTERED) || (!vpage)) {
  160. ehea_error("CQ: registration of page failed "
  161. "hret=%lx\n", hret);
  162. goto out_kill_hwq;
  163. }
  164. }
  165. }
  166. hw_qeit_reset(&cq->hw_queue);
  167. epa = cq->epas.kernel;
  168. ehea_reset_cq_ep(cq);
  169. ehea_reset_cq_n1(cq);
  170. return cq;
  171. out_kill_hwq:
  172. hw_queue_dtor(&cq->hw_queue);
  173. out_freeres:
  174. ehea_h_free_resource(adapter->handle, cq->fw_handle, FORCE_FREE);
  175. out_freemem:
  176. kfree(cq);
  177. out_nomem:
  178. return NULL;
  179. }
  180. u64 ehea_destroy_cq_res(struct ehea_cq *cq, u64 force)
  181. {
  182. u64 hret;
  183. u64 adapter_handle = cq->adapter->handle;
  184. /* deregister all previous registered pages */
  185. hret = ehea_h_free_resource(adapter_handle, cq->fw_handle, force);
  186. if (hret != H_SUCCESS)
  187. return hret;
  188. hw_queue_dtor(&cq->hw_queue);
  189. kfree(cq);
  190. return hret;
  191. }
  192. int ehea_destroy_cq(struct ehea_cq *cq)
  193. {
  194. u64 hret;
  195. if (!cq)
  196. return 0;
  197. hcp_epas_dtor(&cq->epas);
  198. if ((hret = ehea_destroy_cq_res(cq, NORMAL_FREE)) == H_R_STATE) {
  199. ehea_error_data(cq->adapter, cq->fw_handle);
  200. hret = ehea_destroy_cq_res(cq, FORCE_FREE);
  201. }
  202. if (hret != H_SUCCESS) {
  203. ehea_error("destroy CQ failed");
  204. return -EIO;
  205. }
  206. return 0;
  207. }
  208. struct ehea_eq *ehea_create_eq(struct ehea_adapter *adapter,
  209. const enum ehea_eq_type type,
  210. const u32 max_nr_of_eqes, const u8 eqe_gen)
  211. {
  212. int ret, i;
  213. u64 hret, rpage;
  214. void *vpage;
  215. struct ehea_eq *eq;
  216. eq = kzalloc(sizeof(*eq), GFP_KERNEL);
  217. if (!eq) {
  218. ehea_error("no mem for eq");
  219. return NULL;
  220. }
  221. eq->adapter = adapter;
  222. eq->attr.type = type;
  223. eq->attr.max_nr_of_eqes = max_nr_of_eqes;
  224. eq->attr.eqe_gen = eqe_gen;
  225. spin_lock_init(&eq->spinlock);
  226. hret = ehea_h_alloc_resource_eq(adapter->handle,
  227. &eq->attr, &eq->fw_handle);
  228. if (hret != H_SUCCESS) {
  229. ehea_error("alloc_resource_eq failed");
  230. goto out_freemem;
  231. }
  232. ret = hw_queue_ctor(&eq->hw_queue, eq->attr.nr_pages,
  233. EHEA_PAGESIZE, sizeof(struct ehea_eqe));
  234. if (ret) {
  235. ehea_error("can't allocate eq pages");
  236. goto out_freeres;
  237. }
  238. for (i = 0; i < eq->attr.nr_pages; i++) {
  239. vpage = hw_qpageit_get_inc(&eq->hw_queue);
  240. if (!vpage) {
  241. ehea_error("hw_qpageit_get_inc failed");
  242. hret = H_RESOURCE;
  243. goto out_kill_hwq;
  244. }
  245. rpage = virt_to_abs(vpage);
  246. hret = ehea_h_register_rpage(adapter->handle, 0,
  247. EHEA_EQ_REGISTER_ORIG,
  248. eq->fw_handle, rpage, 1);
  249. if (i == (eq->attr.nr_pages - 1)) {
  250. /* last page */
  251. vpage = hw_qpageit_get_inc(&eq->hw_queue);
  252. if ((hret != H_SUCCESS) || (vpage)) {
  253. goto out_kill_hwq;
  254. }
  255. } else {
  256. if ((hret != H_PAGE_REGISTERED) || (!vpage)) {
  257. goto out_kill_hwq;
  258. }
  259. }
  260. }
  261. hw_qeit_reset(&eq->hw_queue);
  262. return eq;
  263. out_kill_hwq:
  264. hw_queue_dtor(&eq->hw_queue);
  265. out_freeres:
  266. ehea_h_free_resource(adapter->handle, eq->fw_handle, FORCE_FREE);
  267. out_freemem:
  268. kfree(eq);
  269. return NULL;
  270. }
  271. struct ehea_eqe *ehea_poll_eq(struct ehea_eq *eq)
  272. {
  273. struct ehea_eqe *eqe;
  274. unsigned long flags;
  275. spin_lock_irqsave(&eq->spinlock, flags);
  276. eqe = (struct ehea_eqe*)hw_eqit_eq_get_inc_valid(&eq->hw_queue);
  277. spin_unlock_irqrestore(&eq->spinlock, flags);
  278. return eqe;
  279. }
  280. u64 ehea_destroy_eq_res(struct ehea_eq *eq, u64 force)
  281. {
  282. u64 hret;
  283. unsigned long flags;
  284. spin_lock_irqsave(&eq->spinlock, flags);
  285. hret = ehea_h_free_resource(eq->adapter->handle, eq->fw_handle, force);
  286. spin_unlock_irqrestore(&eq->spinlock, flags);
  287. if (hret != H_SUCCESS)
  288. return hret;
  289. hw_queue_dtor(&eq->hw_queue);
  290. kfree(eq);
  291. return hret;
  292. }
  293. int ehea_destroy_eq(struct ehea_eq *eq)
  294. {
  295. u64 hret;
  296. if (!eq)
  297. return 0;
  298. hcp_epas_dtor(&eq->epas);
  299. if ((hret = ehea_destroy_eq_res(eq, NORMAL_FREE)) == H_R_STATE) {
  300. ehea_error_data(eq->adapter, eq->fw_handle);
  301. hret = ehea_destroy_eq_res(eq, FORCE_FREE);
  302. }
  303. if (hret != H_SUCCESS) {
  304. ehea_error("destroy EQ failed");
  305. return -EIO;
  306. }
  307. return 0;
  308. }
  309. /**
  310. * allocates memory for a queue and registers pages in phyp
  311. */
  312. int ehea_qp_alloc_register(struct ehea_qp *qp, struct hw_queue *hw_queue,
  313. int nr_pages, int wqe_size, int act_nr_sges,
  314. struct ehea_adapter *adapter, int h_call_q_selector)
  315. {
  316. u64 hret, rpage;
  317. int ret, cnt;
  318. void *vpage;
  319. ret = hw_queue_ctor(hw_queue, nr_pages, EHEA_PAGESIZE, wqe_size);
  320. if (ret)
  321. return ret;
  322. for (cnt = 0; cnt < nr_pages; cnt++) {
  323. vpage = hw_qpageit_get_inc(hw_queue);
  324. if (!vpage) {
  325. ehea_error("hw_qpageit_get_inc failed");
  326. goto out_kill_hwq;
  327. }
  328. rpage = virt_to_abs(vpage);
  329. hret = ehea_h_register_rpage(adapter->handle,
  330. 0, h_call_q_selector,
  331. qp->fw_handle, rpage, 1);
  332. if (hret < H_SUCCESS) {
  333. ehea_error("register_rpage_qp failed");
  334. goto out_kill_hwq;
  335. }
  336. }
  337. hw_qeit_reset(hw_queue);
  338. return 0;
  339. out_kill_hwq:
  340. hw_queue_dtor(hw_queue);
  341. return -EIO;
  342. }
  343. static inline u32 map_wqe_size(u8 wqe_enc_size)
  344. {
  345. return 128 << wqe_enc_size;
  346. }
  347. struct ehea_qp *ehea_create_qp(struct ehea_adapter *adapter,
  348. u32 pd, struct ehea_qp_init_attr *init_attr)
  349. {
  350. int ret;
  351. u64 hret;
  352. struct ehea_qp *qp;
  353. u32 wqe_size_in_bytes_sq, wqe_size_in_bytes_rq1;
  354. u32 wqe_size_in_bytes_rq2, wqe_size_in_bytes_rq3;
  355. qp = kzalloc(sizeof(*qp), GFP_KERNEL);
  356. if (!qp) {
  357. ehea_error("no mem for qp");
  358. return NULL;
  359. }
  360. qp->adapter = adapter;
  361. hret = ehea_h_alloc_resource_qp(adapter->handle, init_attr, pd,
  362. &qp->fw_handle, &qp->epas);
  363. if (hret != H_SUCCESS) {
  364. ehea_error("ehea_h_alloc_resource_qp failed");
  365. goto out_freemem;
  366. }
  367. wqe_size_in_bytes_sq = map_wqe_size(init_attr->act_wqe_size_enc_sq);
  368. wqe_size_in_bytes_rq1 = map_wqe_size(init_attr->act_wqe_size_enc_rq1);
  369. wqe_size_in_bytes_rq2 = map_wqe_size(init_attr->act_wqe_size_enc_rq2);
  370. wqe_size_in_bytes_rq3 = map_wqe_size(init_attr->act_wqe_size_enc_rq3);
  371. ret = ehea_qp_alloc_register(qp, &qp->hw_squeue, init_attr->nr_sq_pages,
  372. wqe_size_in_bytes_sq,
  373. init_attr->act_wqe_size_enc_sq, adapter,
  374. 0);
  375. if (ret) {
  376. ehea_error("can't register for sq ret=%x", ret);
  377. goto out_freeres;
  378. }
  379. ret = ehea_qp_alloc_register(qp, &qp->hw_rqueue1,
  380. init_attr->nr_rq1_pages,
  381. wqe_size_in_bytes_rq1,
  382. init_attr->act_wqe_size_enc_rq1,
  383. adapter, 1);
  384. if (ret) {
  385. ehea_error("can't register for rq1 ret=%x", ret);
  386. goto out_kill_hwsq;
  387. }
  388. if (init_attr->rq_count > 1) {
  389. ret = ehea_qp_alloc_register(qp, &qp->hw_rqueue2,
  390. init_attr->nr_rq2_pages,
  391. wqe_size_in_bytes_rq2,
  392. init_attr->act_wqe_size_enc_rq2,
  393. adapter, 2);
  394. if (ret) {
  395. ehea_error("can't register for rq2 ret=%x", ret);
  396. goto out_kill_hwr1q;
  397. }
  398. }
  399. if (init_attr->rq_count > 2) {
  400. ret = ehea_qp_alloc_register(qp, &qp->hw_rqueue3,
  401. init_attr->nr_rq3_pages,
  402. wqe_size_in_bytes_rq3,
  403. init_attr->act_wqe_size_enc_rq3,
  404. adapter, 3);
  405. if (ret) {
  406. ehea_error("can't register for rq3 ret=%x", ret);
  407. goto out_kill_hwr2q;
  408. }
  409. }
  410. qp->init_attr = *init_attr;
  411. return qp;
  412. out_kill_hwr2q:
  413. hw_queue_dtor(&qp->hw_rqueue2);
  414. out_kill_hwr1q:
  415. hw_queue_dtor(&qp->hw_rqueue1);
  416. out_kill_hwsq:
  417. hw_queue_dtor(&qp->hw_squeue);
  418. out_freeres:
  419. ehea_h_disable_and_get_hea(adapter->handle, qp->fw_handle);
  420. ehea_h_free_resource(adapter->handle, qp->fw_handle, FORCE_FREE);
  421. out_freemem:
  422. kfree(qp);
  423. return NULL;
  424. }
  425. u64 ehea_destroy_qp_res(struct ehea_qp *qp, u64 force)
  426. {
  427. u64 hret;
  428. struct ehea_qp_init_attr *qp_attr = &qp->init_attr;
  429. ehea_h_disable_and_get_hea(qp->adapter->handle, qp->fw_handle);
  430. hret = ehea_h_free_resource(qp->adapter->handle, qp->fw_handle, force);
  431. if (hret != H_SUCCESS)
  432. return hret;
  433. hw_queue_dtor(&qp->hw_squeue);
  434. hw_queue_dtor(&qp->hw_rqueue1);
  435. if (qp_attr->rq_count > 1)
  436. hw_queue_dtor(&qp->hw_rqueue2);
  437. if (qp_attr->rq_count > 2)
  438. hw_queue_dtor(&qp->hw_rqueue3);
  439. kfree(qp);
  440. return hret;
  441. }
  442. int ehea_destroy_qp(struct ehea_qp *qp)
  443. {
  444. u64 hret;
  445. if (!qp)
  446. return 0;
  447. hcp_epas_dtor(&qp->epas);
  448. if ((hret = ehea_destroy_qp_res(qp, NORMAL_FREE)) == H_R_STATE) {
  449. ehea_error_data(qp->adapter, qp->fw_handle);
  450. hret = ehea_destroy_qp_res(qp, FORCE_FREE);
  451. }
  452. if (hret != H_SUCCESS) {
  453. ehea_error("destroy QP failed");
  454. return -EIO;
  455. }
  456. return 0;
  457. }
  458. int ehea_create_busmap( void )
  459. {
  460. u64 vaddr = EHEA_BUSMAP_START;
  461. unsigned long high_section_index = 0;
  462. int i;
  463. /*
  464. * Sections are not in ascending order -> Loop over all sections and
  465. * find the highest PFN to compute the required map size.
  466. */
  467. ehea_bmap.valid_sections = 0;
  468. for (i = 0; i < NR_MEM_SECTIONS; i++)
  469. if (valid_section_nr(i))
  470. high_section_index = i;
  471. ehea_bmap.entries = high_section_index + 1;
  472. ehea_bmap.vaddr = vmalloc(ehea_bmap.entries * sizeof(*ehea_bmap.vaddr));
  473. if (!ehea_bmap.vaddr)
  474. return -ENOMEM;
  475. for (i = 0 ; i < ehea_bmap.entries; i++) {
  476. unsigned long pfn = section_nr_to_pfn(i);
  477. if (pfn_valid(pfn)) {
  478. ehea_bmap.vaddr[i] = vaddr;
  479. vaddr += EHEA_SECTSIZE;
  480. ehea_bmap.valid_sections++;
  481. } else
  482. ehea_bmap.vaddr[i] = 0;
  483. }
  484. return 0;
  485. }
  486. void ehea_destroy_busmap( void )
  487. {
  488. vfree(ehea_bmap.vaddr);
  489. }
  490. u64 ehea_map_vaddr(void *caddr)
  491. {
  492. u64 mapped_addr;
  493. unsigned long index = __pa(caddr) >> SECTION_SIZE_BITS;
  494. if (likely(index < ehea_bmap.entries)) {
  495. mapped_addr = ehea_bmap.vaddr[index];
  496. if (likely(mapped_addr))
  497. mapped_addr |= (((unsigned long)caddr)
  498. & (EHEA_SECTSIZE - 1));
  499. else
  500. mapped_addr = -1;
  501. } else
  502. mapped_addr = -1;
  503. if (unlikely(mapped_addr == -1))
  504. if (!test_and_set_bit(__EHEA_STOP_XFER, &ehea_driver_flags))
  505. schedule_work(&ehea_rereg_mr_task);
  506. return mapped_addr;
  507. }
  508. int ehea_reg_kernel_mr(struct ehea_adapter *adapter, struct ehea_mr *mr)
  509. {
  510. int ret;
  511. u64 *pt;
  512. void *pg;
  513. u64 hret, pt_abs, i, j, m, mr_len;
  514. u32 acc_ctrl = EHEA_MR_ACC_CTRL;
  515. mr_len = ehea_bmap.valid_sections * EHEA_SECTSIZE;
  516. pt = kzalloc(PAGE_SIZE, GFP_KERNEL);
  517. if (!pt) {
  518. ehea_error("no mem");
  519. ret = -ENOMEM;
  520. goto out;
  521. }
  522. pt_abs = virt_to_abs(pt);
  523. hret = ehea_h_alloc_resource_mr(adapter->handle,
  524. EHEA_BUSMAP_START, mr_len,
  525. acc_ctrl, adapter->pd,
  526. &mr->handle, &mr->lkey);
  527. if (hret != H_SUCCESS) {
  528. ehea_error("alloc_resource_mr failed");
  529. ret = -EIO;
  530. goto out;
  531. }
  532. for (i = 0 ; i < ehea_bmap.entries; i++)
  533. if (ehea_bmap.vaddr[i]) {
  534. void *sectbase = __va(i << SECTION_SIZE_BITS);
  535. unsigned long k = 0;
  536. for (j = 0; j < (EHEA_PAGES_PER_SECTION /
  537. EHEA_MAX_RPAGE); j++) {
  538. for (m = 0; m < EHEA_MAX_RPAGE; m++) {
  539. pg = sectbase + ((k++) * EHEA_PAGESIZE);
  540. pt[m] = virt_to_abs(pg);
  541. }
  542. hret = ehea_h_register_rpage_mr(adapter->handle,
  543. mr->handle,
  544. 0, 0, pt_abs,
  545. EHEA_MAX_RPAGE);
  546. if ((hret != H_SUCCESS)
  547. && (hret != H_PAGE_REGISTERED)) {
  548. ehea_h_free_resource(adapter->handle,
  549. mr->handle,
  550. FORCE_FREE);
  551. ehea_error("register_rpage_mr failed");
  552. ret = -EIO;
  553. goto out;
  554. }
  555. }
  556. }
  557. if (hret != H_SUCCESS) {
  558. ehea_h_free_resource(adapter->handle, mr->handle, FORCE_FREE);
  559. ehea_error("registering mr failed");
  560. ret = -EIO;
  561. goto out;
  562. }
  563. mr->vaddr = EHEA_BUSMAP_START;
  564. mr->adapter = adapter;
  565. ret = 0;
  566. out:
  567. kfree(pt);
  568. return ret;
  569. }
  570. int ehea_rem_mr(struct ehea_mr *mr)
  571. {
  572. u64 hret;
  573. if (!mr || !mr->adapter)
  574. return -EINVAL;
  575. hret = ehea_h_free_resource(mr->adapter->handle, mr->handle,
  576. FORCE_FREE);
  577. if (hret != H_SUCCESS) {
  578. ehea_error("destroy MR failed");
  579. return -EIO;
  580. }
  581. return 0;
  582. }
  583. int ehea_gen_smr(struct ehea_adapter *adapter, struct ehea_mr *old_mr,
  584. struct ehea_mr *shared_mr)
  585. {
  586. u64 hret;
  587. hret = ehea_h_register_smr(adapter->handle, old_mr->handle,
  588. old_mr->vaddr, EHEA_MR_ACC_CTRL,
  589. adapter->pd, shared_mr);
  590. if (hret != H_SUCCESS)
  591. return -EIO;
  592. shared_mr->adapter = adapter;
  593. return 0;
  594. }
  595. void print_error_data(u64 *data)
  596. {
  597. int length;
  598. u64 type = EHEA_BMASK_GET(ERROR_DATA_TYPE, data[2]);
  599. u64 resource = data[1];
  600. length = EHEA_BMASK_GET(ERROR_DATA_LENGTH, data[0]);
  601. if (length > EHEA_PAGESIZE)
  602. length = EHEA_PAGESIZE;
  603. if (type == 0x8) /* Queue Pair */
  604. ehea_error("QP (resource=%lX) state: AER=0x%lX, AERR=0x%lX, "
  605. "port=%lX", resource, data[6], data[12], data[22]);
  606. if (type == 0x4) /* Completion Queue */
  607. ehea_error("CQ (resource=%lX) state: AER=0x%lX", resource,
  608. data[6]);
  609. if (type == 0x3) /* Event Queue */
  610. ehea_error("EQ (resource=%lX) state: AER=0x%lX", resource,
  611. data[6]);
  612. ehea_dump(data, length, "error data");
  613. }
  614. void ehea_error_data(struct ehea_adapter *adapter, u64 res_handle)
  615. {
  616. unsigned long ret;
  617. u64 *rblock;
  618. rblock = kzalloc(PAGE_SIZE, GFP_KERNEL);
  619. if (!rblock) {
  620. ehea_error("Cannot allocate rblock memory.");
  621. return;
  622. }
  623. ret = ehea_h_error_data(adapter->handle,
  624. res_handle,
  625. rblock);
  626. if (ret == H_R_STATE)
  627. ehea_error("No error data is available: %lX.", res_handle);
  628. else if (ret == H_SUCCESS)
  629. print_error_data(rblock);
  630. else
  631. ehea_error("Error data could not be fetched: %lX", res_handle);
  632. kfree(rblock);
  633. }