ehea_qmr.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784
  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. hcp_epas_dtor(&cq->epas);
  199. if ((hret = ehea_destroy_cq_res(cq, NORMAL_FREE)) == H_R_STATE) {
  200. ehea_error_data(cq->adapter, cq->fw_handle);
  201. hret = ehea_destroy_cq_res(cq, FORCE_FREE);
  202. }
  203. if (hret != H_SUCCESS) {
  204. ehea_error("destroy CQ failed");
  205. return -EIO;
  206. }
  207. return 0;
  208. }
  209. struct ehea_eq *ehea_create_eq(struct ehea_adapter *adapter,
  210. const enum ehea_eq_type type,
  211. const u32 max_nr_of_eqes, const u8 eqe_gen)
  212. {
  213. int ret, i;
  214. u64 hret, rpage;
  215. void *vpage;
  216. struct ehea_eq *eq;
  217. eq = kzalloc(sizeof(*eq), GFP_KERNEL);
  218. if (!eq) {
  219. ehea_error("no mem for eq");
  220. return NULL;
  221. }
  222. eq->adapter = adapter;
  223. eq->attr.type = type;
  224. eq->attr.max_nr_of_eqes = max_nr_of_eqes;
  225. eq->attr.eqe_gen = eqe_gen;
  226. spin_lock_init(&eq->spinlock);
  227. hret = ehea_h_alloc_resource_eq(adapter->handle,
  228. &eq->attr, &eq->fw_handle);
  229. if (hret != H_SUCCESS) {
  230. ehea_error("alloc_resource_eq failed");
  231. goto out_freemem;
  232. }
  233. ret = hw_queue_ctor(&eq->hw_queue, eq->attr.nr_pages,
  234. EHEA_PAGESIZE, sizeof(struct ehea_eqe));
  235. if (ret) {
  236. ehea_error("can't allocate eq pages");
  237. goto out_freeres;
  238. }
  239. for (i = 0; i < eq->attr.nr_pages; i++) {
  240. vpage = hw_qpageit_get_inc(&eq->hw_queue);
  241. if (!vpage) {
  242. ehea_error("hw_qpageit_get_inc failed");
  243. hret = H_RESOURCE;
  244. goto out_kill_hwq;
  245. }
  246. rpage = virt_to_abs(vpage);
  247. hret = ehea_h_register_rpage(adapter->handle, 0,
  248. EHEA_EQ_REGISTER_ORIG,
  249. eq->fw_handle, rpage, 1);
  250. if (i == (eq->attr.nr_pages - 1)) {
  251. /* last page */
  252. vpage = hw_qpageit_get_inc(&eq->hw_queue);
  253. if ((hret != H_SUCCESS) || (vpage)) {
  254. goto out_kill_hwq;
  255. }
  256. } else {
  257. if ((hret != H_PAGE_REGISTERED) || (!vpage)) {
  258. goto out_kill_hwq;
  259. }
  260. }
  261. }
  262. hw_qeit_reset(&eq->hw_queue);
  263. return eq;
  264. out_kill_hwq:
  265. hw_queue_dtor(&eq->hw_queue);
  266. out_freeres:
  267. ehea_h_free_resource(adapter->handle, eq->fw_handle, FORCE_FREE);
  268. out_freemem:
  269. kfree(eq);
  270. return NULL;
  271. }
  272. struct ehea_eqe *ehea_poll_eq(struct ehea_eq *eq)
  273. {
  274. struct ehea_eqe *eqe;
  275. unsigned long flags;
  276. spin_lock_irqsave(&eq->spinlock, flags);
  277. eqe = (struct ehea_eqe*)hw_eqit_eq_get_inc_valid(&eq->hw_queue);
  278. spin_unlock_irqrestore(&eq->spinlock, flags);
  279. return eqe;
  280. }
  281. u64 ehea_destroy_eq_res(struct ehea_eq *eq, u64 force)
  282. {
  283. u64 hret;
  284. unsigned long flags;
  285. spin_lock_irqsave(&eq->spinlock, flags);
  286. hret = ehea_h_free_resource(eq->adapter->handle, eq->fw_handle, force);
  287. spin_unlock_irqrestore(&eq->spinlock, flags);
  288. if (hret != H_SUCCESS)
  289. return hret;
  290. hw_queue_dtor(&eq->hw_queue);
  291. kfree(eq);
  292. return hret;
  293. }
  294. int ehea_destroy_eq(struct ehea_eq *eq)
  295. {
  296. u64 hret;
  297. if (!eq)
  298. return 0;
  299. hcp_epas_dtor(&eq->epas);
  300. if ((hret = ehea_destroy_eq_res(eq, NORMAL_FREE)) == H_R_STATE) {
  301. ehea_error_data(eq->adapter, eq->fw_handle);
  302. hret = ehea_destroy_eq_res(eq, FORCE_FREE);
  303. }
  304. if (hret != H_SUCCESS) {
  305. ehea_error("destroy EQ failed");
  306. return -EIO;
  307. }
  308. return 0;
  309. }
  310. /**
  311. * allocates memory for a queue and registers pages in phyp
  312. */
  313. int ehea_qp_alloc_register(struct ehea_qp *qp, struct hw_queue *hw_queue,
  314. int nr_pages, int wqe_size, int act_nr_sges,
  315. struct ehea_adapter *adapter, int h_call_q_selector)
  316. {
  317. u64 hret, rpage;
  318. int ret, cnt;
  319. void *vpage;
  320. ret = hw_queue_ctor(hw_queue, nr_pages, EHEA_PAGESIZE, wqe_size);
  321. if (ret)
  322. return ret;
  323. for (cnt = 0; cnt < nr_pages; cnt++) {
  324. vpage = hw_qpageit_get_inc(hw_queue);
  325. if (!vpage) {
  326. ehea_error("hw_qpageit_get_inc failed");
  327. goto out_kill_hwq;
  328. }
  329. rpage = virt_to_abs(vpage);
  330. hret = ehea_h_register_rpage(adapter->handle,
  331. 0, h_call_q_selector,
  332. qp->fw_handle, rpage, 1);
  333. if (hret < H_SUCCESS) {
  334. ehea_error("register_rpage_qp failed");
  335. goto out_kill_hwq;
  336. }
  337. }
  338. hw_qeit_reset(hw_queue);
  339. return 0;
  340. out_kill_hwq:
  341. hw_queue_dtor(hw_queue);
  342. return -EIO;
  343. }
  344. static inline u32 map_wqe_size(u8 wqe_enc_size)
  345. {
  346. return 128 << wqe_enc_size;
  347. }
  348. struct ehea_qp *ehea_create_qp(struct ehea_adapter *adapter,
  349. u32 pd, struct ehea_qp_init_attr *init_attr)
  350. {
  351. int ret;
  352. u64 hret;
  353. struct ehea_qp *qp;
  354. u32 wqe_size_in_bytes_sq, wqe_size_in_bytes_rq1;
  355. u32 wqe_size_in_bytes_rq2, wqe_size_in_bytes_rq3;
  356. qp = kzalloc(sizeof(*qp), GFP_KERNEL);
  357. if (!qp) {
  358. ehea_error("no mem for qp");
  359. return NULL;
  360. }
  361. qp->adapter = adapter;
  362. hret = ehea_h_alloc_resource_qp(adapter->handle, init_attr, pd,
  363. &qp->fw_handle, &qp->epas);
  364. if (hret != H_SUCCESS) {
  365. ehea_error("ehea_h_alloc_resource_qp failed");
  366. goto out_freemem;
  367. }
  368. wqe_size_in_bytes_sq = map_wqe_size(init_attr->act_wqe_size_enc_sq);
  369. wqe_size_in_bytes_rq1 = map_wqe_size(init_attr->act_wqe_size_enc_rq1);
  370. wqe_size_in_bytes_rq2 = map_wqe_size(init_attr->act_wqe_size_enc_rq2);
  371. wqe_size_in_bytes_rq3 = map_wqe_size(init_attr->act_wqe_size_enc_rq3);
  372. ret = ehea_qp_alloc_register(qp, &qp->hw_squeue, init_attr->nr_sq_pages,
  373. wqe_size_in_bytes_sq,
  374. init_attr->act_wqe_size_enc_sq, adapter,
  375. 0);
  376. if (ret) {
  377. ehea_error("can't register for sq ret=%x", ret);
  378. goto out_freeres;
  379. }
  380. ret = ehea_qp_alloc_register(qp, &qp->hw_rqueue1,
  381. init_attr->nr_rq1_pages,
  382. wqe_size_in_bytes_rq1,
  383. init_attr->act_wqe_size_enc_rq1,
  384. adapter, 1);
  385. if (ret) {
  386. ehea_error("can't register for rq1 ret=%x", ret);
  387. goto out_kill_hwsq;
  388. }
  389. if (init_attr->rq_count > 1) {
  390. ret = ehea_qp_alloc_register(qp, &qp->hw_rqueue2,
  391. init_attr->nr_rq2_pages,
  392. wqe_size_in_bytes_rq2,
  393. init_attr->act_wqe_size_enc_rq2,
  394. adapter, 2);
  395. if (ret) {
  396. ehea_error("can't register for rq2 ret=%x", ret);
  397. goto out_kill_hwr1q;
  398. }
  399. }
  400. if (init_attr->rq_count > 2) {
  401. ret = ehea_qp_alloc_register(qp, &qp->hw_rqueue3,
  402. init_attr->nr_rq3_pages,
  403. wqe_size_in_bytes_rq3,
  404. init_attr->act_wqe_size_enc_rq3,
  405. adapter, 3);
  406. if (ret) {
  407. ehea_error("can't register for rq3 ret=%x", ret);
  408. goto out_kill_hwr2q;
  409. }
  410. }
  411. qp->init_attr = *init_attr;
  412. return qp;
  413. out_kill_hwr2q:
  414. hw_queue_dtor(&qp->hw_rqueue2);
  415. out_kill_hwr1q:
  416. hw_queue_dtor(&qp->hw_rqueue1);
  417. out_kill_hwsq:
  418. hw_queue_dtor(&qp->hw_squeue);
  419. out_freeres:
  420. ehea_h_disable_and_get_hea(adapter->handle, qp->fw_handle);
  421. ehea_h_free_resource(adapter->handle, qp->fw_handle, FORCE_FREE);
  422. out_freemem:
  423. kfree(qp);
  424. return NULL;
  425. }
  426. u64 ehea_destroy_qp_res(struct ehea_qp *qp, u64 force)
  427. {
  428. u64 hret;
  429. struct ehea_qp_init_attr *qp_attr = &qp->init_attr;
  430. ehea_h_disable_and_get_hea(qp->adapter->handle, qp->fw_handle);
  431. hret = ehea_h_free_resource(qp->adapter->handle, qp->fw_handle, force);
  432. if (hret != H_SUCCESS)
  433. return hret;
  434. hw_queue_dtor(&qp->hw_squeue);
  435. hw_queue_dtor(&qp->hw_rqueue1);
  436. if (qp_attr->rq_count > 1)
  437. hw_queue_dtor(&qp->hw_rqueue2);
  438. if (qp_attr->rq_count > 2)
  439. hw_queue_dtor(&qp->hw_rqueue3);
  440. kfree(qp);
  441. return hret;
  442. }
  443. int ehea_destroy_qp(struct ehea_qp *qp)
  444. {
  445. u64 hret;
  446. if (!qp)
  447. return 0;
  448. hcp_epas_dtor(&qp->epas);
  449. if ((hret = ehea_destroy_qp_res(qp, NORMAL_FREE)) == H_R_STATE) {
  450. ehea_error_data(qp->adapter, qp->fw_handle);
  451. hret = ehea_destroy_qp_res(qp, FORCE_FREE);
  452. }
  453. if (hret != H_SUCCESS) {
  454. ehea_error("destroy QP failed");
  455. return -EIO;
  456. }
  457. return 0;
  458. }
  459. int ehea_create_busmap( void )
  460. {
  461. u64 vaddr = EHEA_BUSMAP_START;
  462. unsigned long abs_max_pfn = 0;
  463. unsigned long sec_max_pfn;
  464. int i;
  465. /*
  466. * Sections are not in ascending order -> Loop over all sections and
  467. * find the highest PFN to compute the required map size.
  468. */
  469. ehea_bmap.valid_sections = 0;
  470. for (i = 0; i < NR_MEM_SECTIONS; i++)
  471. if (valid_section_nr(i)) {
  472. sec_max_pfn = section_nr_to_pfn(i);
  473. if (sec_max_pfn > abs_max_pfn)
  474. abs_max_pfn = sec_max_pfn;
  475. ehea_bmap.valid_sections++;
  476. }
  477. ehea_bmap.entries = abs_max_pfn / EHEA_PAGES_PER_SECTION + 1;
  478. ehea_bmap.vaddr = vmalloc(ehea_bmap.entries * sizeof(*ehea_bmap.vaddr));
  479. if (!ehea_bmap.vaddr)
  480. return -ENOMEM;
  481. for (i = 0 ; i < ehea_bmap.entries; i++) {
  482. unsigned long pfn = section_nr_to_pfn(i);
  483. if (pfn_valid(pfn)) {
  484. ehea_bmap.vaddr[i] = vaddr;
  485. vaddr += EHEA_SECTSIZE;
  486. } else
  487. ehea_bmap.vaddr[i] = 0;
  488. }
  489. return 0;
  490. }
  491. void ehea_destroy_busmap( void )
  492. {
  493. vfree(ehea_bmap.vaddr);
  494. }
  495. u64 ehea_map_vaddr(void *caddr)
  496. {
  497. u64 mapped_addr;
  498. unsigned long index = __pa(caddr) >> SECTION_SIZE_BITS;
  499. if (likely(index < ehea_bmap.entries)) {
  500. mapped_addr = ehea_bmap.vaddr[index];
  501. if (likely(mapped_addr))
  502. mapped_addr |= (((unsigned long)caddr)
  503. & (EHEA_SECTSIZE - 1));
  504. else
  505. mapped_addr = -1;
  506. } else
  507. mapped_addr = -1;
  508. if (unlikely(mapped_addr == -1))
  509. if (!test_and_set_bit(__EHEA_STOP_XFER, &ehea_driver_flags))
  510. queue_work(ehea_driver_wq, &ehea_rereg_mr_task);
  511. return mapped_addr;
  512. }
  513. int ehea_reg_kernel_mr(struct ehea_adapter *adapter, struct ehea_mr *mr)
  514. {
  515. int ret;
  516. u64 *pt;
  517. void *pg;
  518. u64 hret, pt_abs, i, j, m, mr_len;
  519. u32 acc_ctrl = EHEA_MR_ACC_CTRL;
  520. mr_len = ehea_bmap.valid_sections * EHEA_SECTSIZE;
  521. pt = kzalloc(EHEA_MAX_RPAGE * sizeof(u64), GFP_KERNEL);
  522. if (!pt) {
  523. ehea_error("no mem");
  524. ret = -ENOMEM;
  525. goto out;
  526. }
  527. pt_abs = virt_to_abs(pt);
  528. hret = ehea_h_alloc_resource_mr(adapter->handle,
  529. EHEA_BUSMAP_START, mr_len,
  530. acc_ctrl, adapter->pd,
  531. &mr->handle, &mr->lkey);
  532. if (hret != H_SUCCESS) {
  533. ehea_error("alloc_resource_mr failed");
  534. ret = -EIO;
  535. goto out;
  536. }
  537. for (i = 0 ; i < ehea_bmap.entries; i++)
  538. if (ehea_bmap.vaddr[i]) {
  539. void *sectbase = __va(i << SECTION_SIZE_BITS);
  540. unsigned long k = 0;
  541. for (j = 0; j < (PAGES_PER_SECTION / EHEA_MAX_RPAGE);
  542. j++) {
  543. for (m = 0; m < EHEA_MAX_RPAGE; m++) {
  544. pg = sectbase + ((k++) * EHEA_PAGESIZE);
  545. pt[m] = virt_to_abs(pg);
  546. }
  547. hret = ehea_h_register_rpage_mr(adapter->handle,
  548. mr->handle,
  549. 0, 0, pt_abs,
  550. EHEA_MAX_RPAGE);
  551. if ((hret != H_SUCCESS)
  552. && (hret != H_PAGE_REGISTERED)) {
  553. ehea_h_free_resource(adapter->handle,
  554. mr->handle,
  555. FORCE_FREE);
  556. ehea_error("register_rpage_mr failed");
  557. ret = -EIO;
  558. goto out;
  559. }
  560. }
  561. }
  562. if (hret != H_SUCCESS) {
  563. ehea_h_free_resource(adapter->handle, mr->handle, FORCE_FREE);
  564. ehea_error("registering mr failed");
  565. ret = -EIO;
  566. goto out;
  567. }
  568. mr->vaddr = EHEA_BUSMAP_START;
  569. mr->adapter = adapter;
  570. ret = 0;
  571. out:
  572. kfree(pt);
  573. return ret;
  574. }
  575. int ehea_rem_mr(struct ehea_mr *mr)
  576. {
  577. u64 hret;
  578. if (!mr || !mr->adapter)
  579. return -EINVAL;
  580. hret = ehea_h_free_resource(mr->adapter->handle, mr->handle,
  581. FORCE_FREE);
  582. if (hret != H_SUCCESS) {
  583. ehea_error("destroy MR failed");
  584. return -EIO;
  585. }
  586. return 0;
  587. }
  588. int ehea_gen_smr(struct ehea_adapter *adapter, struct ehea_mr *old_mr,
  589. struct ehea_mr *shared_mr)
  590. {
  591. u64 hret;
  592. hret = ehea_h_register_smr(adapter->handle, old_mr->handle,
  593. old_mr->vaddr, EHEA_MR_ACC_CTRL,
  594. adapter->pd, shared_mr);
  595. if (hret != H_SUCCESS)
  596. return -EIO;
  597. shared_mr->adapter = adapter;
  598. return 0;
  599. }
  600. void print_error_data(u64 *data)
  601. {
  602. int length;
  603. u64 type = EHEA_BMASK_GET(ERROR_DATA_TYPE, data[2]);
  604. u64 resource = data[1];
  605. length = EHEA_BMASK_GET(ERROR_DATA_LENGTH, data[0]);
  606. if (length > EHEA_PAGESIZE)
  607. length = EHEA_PAGESIZE;
  608. if (type == 0x8) /* Queue Pair */
  609. ehea_error("QP (resource=%lX) state: AER=0x%lX, AERR=0x%lX, "
  610. "port=%lX", resource, data[6], data[12], data[22]);
  611. if (type == 0x4) /* Completion Queue */
  612. ehea_error("CQ (resource=%lX) state: AER=0x%lX", resource,
  613. data[6]);
  614. if (type == 0x3) /* Event Queue */
  615. ehea_error("EQ (resource=%lX) state: AER=0x%lX", resource,
  616. data[6]);
  617. ehea_dump(data, length, "error data");
  618. }
  619. void ehea_error_data(struct ehea_adapter *adapter, u64 res_handle)
  620. {
  621. unsigned long ret;
  622. u64 *rblock;
  623. rblock = kzalloc(PAGE_SIZE, GFP_KERNEL);
  624. if (!rblock) {
  625. ehea_error("Cannot allocate rblock memory.");
  626. return;
  627. }
  628. ret = ehea_h_error_data(adapter->handle,
  629. res_handle,
  630. rblock);
  631. if (ret == H_R_STATE)
  632. ehea_error("No error data is available: %lX.", res_handle);
  633. else if (ret == H_SUCCESS)
  634. print_error_data(rblock);
  635. else
  636. ehea_error("Error data could not be fetched: %lX", res_handle);
  637. kfree(rblock);
  638. }