ehea_qmr.c 17 KB

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