PageRenderTime 56ms CodeModel.GetById 22ms RepoModel.GetById 0ms app.codeStats 0ms

/drivers/net/ethernet/ibm/ehea/ehea_qmr.c

https://bitbucket.org/advance38/linux
C | 1020 lines | 794 code | 186 blank | 40 comment | 167 complexity | 7d689c0b6940067cd6a6c89147d345ab MD5 | raw file
Possible License(s): GPL-2.0, LGPL-2.0, AGPL-1.0
  1. /*
  2. * linux/drivers/net/ethernet/ibm/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. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  29. #include <linux/mm.h>
  30. #include <linux/slab.h>
  31. #include "ehea.h"
  32. #include "ehea_phyp.h"
  33. #include "ehea_qmr.h"
  34. static struct ehea_bmap *ehea_bmap;
  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. pr_err("not on pageboundary\n");
  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. pr_err("pagesize conflict! kernel pagesize=%d, ehea pagesize=%d\n",
  55. (int)PAGE_SIZE, (int)pagesize);
  56. return -EINVAL;
  57. }
  58. queue->queue_length = nr_of_pages * pagesize;
  59. queue->queue_pages = kmalloc_array(nr_of_pages, sizeof(void *),
  60. GFP_KERNEL);
  61. if (!queue->queue_pages)
  62. return -ENOMEM;
  63. /*
  64. * allocate pages for queue:
  65. * outer loop allocates whole kernel pages (page aligned) and
  66. * inner loop divides a kernel page into smaller hea queue pages
  67. */
  68. i = 0;
  69. while (i < nr_of_pages) {
  70. u8 *kpage = (u8 *)get_zeroed_page(GFP_KERNEL);
  71. if (!kpage)
  72. goto out_nomem;
  73. for (k = 0; k < pages_per_kpage && i < nr_of_pages; k++) {
  74. (queue->queue_pages)[i] = (struct ehea_page *)kpage;
  75. kpage += pagesize;
  76. i++;
  77. }
  78. }
  79. queue->current_q_offset = 0;
  80. queue->qe_size = qe_size;
  81. queue->pagesize = pagesize;
  82. queue->toggle_state = 1;
  83. return 0;
  84. out_nomem:
  85. for (i = 0; i < nr_of_pages; i += pages_per_kpage) {
  86. if (!(queue->queue_pages)[i])
  87. break;
  88. free_page((unsigned long)(queue->queue_pages)[i]);
  89. }
  90. return -ENOMEM;
  91. }
  92. static void hw_queue_dtor(struct hw_queue *queue)
  93. {
  94. int pages_per_kpage = PAGE_SIZE / queue->pagesize;
  95. int i, nr_pages;
  96. if (!queue || !queue->queue_pages)
  97. return;
  98. nr_pages = queue->queue_length / queue->pagesize;
  99. for (i = 0; i < nr_pages; i += pages_per_kpage)
  100. free_page((unsigned long)(queue->queue_pages)[i]);
  101. kfree(queue->queue_pages);
  102. }
  103. struct ehea_cq *ehea_create_cq(struct ehea_adapter *adapter,
  104. int nr_of_cqe, u64 eq_handle, u32 cq_token)
  105. {
  106. struct ehea_cq *cq;
  107. struct h_epa epa;
  108. u64 *cq_handle_ref, hret, rpage;
  109. u32 act_nr_of_entries, act_pages, counter;
  110. int ret;
  111. void *vpage;
  112. cq = kzalloc(sizeof(*cq), GFP_KERNEL);
  113. if (!cq)
  114. goto out_nomem;
  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. pr_err("alloc_resource_cq failed\n");
  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. pr_err("hw_qpageit_get_inc failed\n");
  136. goto out_kill_hwq;
  137. }
  138. rpage = __pa(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. pr_err("register_rpage_cq failed ehea_cq=%p hret=%llx counter=%i act_pages=%i\n",
  144. cq, hret, counter, cq->attr.nr_pages);
  145. goto out_kill_hwq;
  146. }
  147. if (counter == (cq->attr.nr_pages - 1)) {
  148. vpage = hw_qpageit_get_inc(&cq->hw_queue);
  149. if ((hret != H_SUCCESS) || (vpage)) {
  150. pr_err("registration of pages not complete hret=%llx\n",
  151. hret);
  152. goto out_kill_hwq;
  153. }
  154. } else {
  155. if (hret != H_PAGE_REGISTERED) {
  156. pr_err("CQ: registration of page failed hret=%llx\n",
  157. hret);
  158. goto out_kill_hwq;
  159. }
  160. }
  161. }
  162. hw_qeit_reset(&cq->hw_queue);
  163. epa = cq->epas.kernel;
  164. ehea_reset_cq_ep(cq);
  165. ehea_reset_cq_n1(cq);
  166. return cq;
  167. out_kill_hwq:
  168. hw_queue_dtor(&cq->hw_queue);
  169. out_freeres:
  170. ehea_h_free_resource(adapter->handle, cq->fw_handle, FORCE_FREE);
  171. out_freemem:
  172. kfree(cq);
  173. out_nomem:
  174. return NULL;
  175. }
  176. static u64 ehea_destroy_cq_res(struct ehea_cq *cq, u64 force)
  177. {
  178. u64 hret;
  179. u64 adapter_handle = cq->adapter->handle;
  180. /* deregister all previous registered pages */
  181. hret = ehea_h_free_resource(adapter_handle, cq->fw_handle, force);
  182. if (hret != H_SUCCESS)
  183. return hret;
  184. hw_queue_dtor(&cq->hw_queue);
  185. kfree(cq);
  186. return hret;
  187. }
  188. int ehea_destroy_cq(struct ehea_cq *cq)
  189. {
  190. u64 hret, aer, aerr;
  191. if (!cq)
  192. return 0;
  193. hcp_epas_dtor(&cq->epas);
  194. hret = ehea_destroy_cq_res(cq, NORMAL_FREE);
  195. if (hret == H_R_STATE) {
  196. ehea_error_data(cq->adapter, cq->fw_handle, &aer, &aerr);
  197. hret = ehea_destroy_cq_res(cq, FORCE_FREE);
  198. }
  199. if (hret != H_SUCCESS) {
  200. pr_err("destroy CQ failed\n");
  201. return -EIO;
  202. }
  203. return 0;
  204. }
  205. struct ehea_eq *ehea_create_eq(struct ehea_adapter *adapter,
  206. const enum ehea_eq_type type,
  207. const u32 max_nr_of_eqes, const u8 eqe_gen)
  208. {
  209. int ret, i;
  210. u64 hret, rpage;
  211. void *vpage;
  212. struct ehea_eq *eq;
  213. eq = kzalloc(sizeof(*eq), GFP_KERNEL);
  214. if (!eq)
  215. return NULL;
  216. eq->adapter = adapter;
  217. eq->attr.type = type;
  218. eq->attr.max_nr_of_eqes = max_nr_of_eqes;
  219. eq->attr.eqe_gen = eqe_gen;
  220. spin_lock_init(&eq->spinlock);
  221. hret = ehea_h_alloc_resource_eq(adapter->handle,
  222. &eq->attr, &eq->fw_handle);
  223. if (hret != H_SUCCESS) {
  224. pr_err("alloc_resource_eq failed\n");
  225. goto out_freemem;
  226. }
  227. ret = hw_queue_ctor(&eq->hw_queue, eq->attr.nr_pages,
  228. EHEA_PAGESIZE, sizeof(struct ehea_eqe));
  229. if (ret) {
  230. pr_err("can't allocate eq pages\n");
  231. goto out_freeres;
  232. }
  233. for (i = 0; i < eq->attr.nr_pages; i++) {
  234. vpage = hw_qpageit_get_inc(&eq->hw_queue);
  235. if (!vpage) {
  236. pr_err("hw_qpageit_get_inc failed\n");
  237. hret = H_RESOURCE;
  238. goto out_kill_hwq;
  239. }
  240. rpage = __pa(vpage);
  241. hret = ehea_h_register_rpage(adapter->handle, 0,
  242. EHEA_EQ_REGISTER_ORIG,
  243. eq->fw_handle, rpage, 1);
  244. if (i == (eq->attr.nr_pages - 1)) {
  245. /* last page */
  246. vpage = hw_qpageit_get_inc(&eq->hw_queue);
  247. if ((hret != H_SUCCESS) || (vpage))
  248. goto out_kill_hwq;
  249. } else {
  250. if (hret != H_PAGE_REGISTERED)
  251. goto out_kill_hwq;
  252. }
  253. }
  254. hw_qeit_reset(&eq->hw_queue);
  255. return eq;
  256. out_kill_hwq:
  257. hw_queue_dtor(&eq->hw_queue);
  258. out_freeres:
  259. ehea_h_free_resource(adapter->handle, eq->fw_handle, FORCE_FREE);
  260. out_freemem:
  261. kfree(eq);
  262. return NULL;
  263. }
  264. struct ehea_eqe *ehea_poll_eq(struct ehea_eq *eq)
  265. {
  266. struct ehea_eqe *eqe;
  267. unsigned long flags;
  268. spin_lock_irqsave(&eq->spinlock, flags);
  269. eqe = hw_eqit_eq_get_inc_valid(&eq->hw_queue);
  270. spin_unlock_irqrestore(&eq->spinlock, flags);
  271. return eqe;
  272. }
  273. static u64 ehea_destroy_eq_res(struct ehea_eq *eq, u64 force)
  274. {
  275. u64 hret;
  276. unsigned long flags;
  277. spin_lock_irqsave(&eq->spinlock, flags);
  278. hret = ehea_h_free_resource(eq->adapter->handle, eq->fw_handle, force);
  279. spin_unlock_irqrestore(&eq->spinlock, flags);
  280. if (hret != H_SUCCESS)
  281. return hret;
  282. hw_queue_dtor(&eq->hw_queue);
  283. kfree(eq);
  284. return hret;
  285. }
  286. int ehea_destroy_eq(struct ehea_eq *eq)
  287. {
  288. u64 hret, aer, aerr;
  289. if (!eq)
  290. return 0;
  291. hcp_epas_dtor(&eq->epas);
  292. hret = ehea_destroy_eq_res(eq, NORMAL_FREE);
  293. if (hret == H_R_STATE) {
  294. ehea_error_data(eq->adapter, eq->fw_handle, &aer, &aerr);
  295. hret = ehea_destroy_eq_res(eq, FORCE_FREE);
  296. }
  297. if (hret != H_SUCCESS) {
  298. pr_err("destroy EQ failed\n");
  299. return -EIO;
  300. }
  301. return 0;
  302. }
  303. /* allocates memory for a queue and registers pages in phyp */
  304. static int ehea_qp_alloc_register(struct ehea_qp *qp, struct hw_queue *hw_queue,
  305. int nr_pages, int wqe_size, int act_nr_sges,
  306. struct ehea_adapter *adapter, int h_call_q_selector)
  307. {
  308. u64 hret, rpage;
  309. int ret, cnt;
  310. void *vpage;
  311. ret = hw_queue_ctor(hw_queue, nr_pages, EHEA_PAGESIZE, wqe_size);
  312. if (ret)
  313. return ret;
  314. for (cnt = 0; cnt < nr_pages; cnt++) {
  315. vpage = hw_qpageit_get_inc(hw_queue);
  316. if (!vpage) {
  317. pr_err("hw_qpageit_get_inc failed\n");
  318. goto out_kill_hwq;
  319. }
  320. rpage = __pa(vpage);
  321. hret = ehea_h_register_rpage(adapter->handle,
  322. 0, h_call_q_selector,
  323. qp->fw_handle, rpage, 1);
  324. if (hret < H_SUCCESS) {
  325. pr_err("register_rpage_qp failed\n");
  326. goto out_kill_hwq;
  327. }
  328. }
  329. hw_qeit_reset(hw_queue);
  330. return 0;
  331. out_kill_hwq:
  332. hw_queue_dtor(hw_queue);
  333. return -EIO;
  334. }
  335. static inline u32 map_wqe_size(u8 wqe_enc_size)
  336. {
  337. return 128 << wqe_enc_size;
  338. }
  339. struct ehea_qp *ehea_create_qp(struct ehea_adapter *adapter,
  340. u32 pd, struct ehea_qp_init_attr *init_attr)
  341. {
  342. int ret;
  343. u64 hret;
  344. struct ehea_qp *qp;
  345. u32 wqe_size_in_bytes_sq, wqe_size_in_bytes_rq1;
  346. u32 wqe_size_in_bytes_rq2, wqe_size_in_bytes_rq3;
  347. qp = kzalloc(sizeof(*qp), GFP_KERNEL);
  348. if (!qp)
  349. return NULL;
  350. qp->adapter = adapter;
  351. hret = ehea_h_alloc_resource_qp(adapter->handle, init_attr, pd,
  352. &qp->fw_handle, &qp->epas);
  353. if (hret != H_SUCCESS) {
  354. pr_err("ehea_h_alloc_resource_qp failed\n");
  355. goto out_freemem;
  356. }
  357. wqe_size_in_bytes_sq = map_wqe_size(init_attr->act_wqe_size_enc_sq);
  358. wqe_size_in_bytes_rq1 = map_wqe_size(init_attr->act_wqe_size_enc_rq1);
  359. wqe_size_in_bytes_rq2 = map_wqe_size(init_attr->act_wqe_size_enc_rq2);
  360. wqe_size_in_bytes_rq3 = map_wqe_size(init_attr->act_wqe_size_enc_rq3);
  361. ret = ehea_qp_alloc_register(qp, &qp->hw_squeue, init_attr->nr_sq_pages,
  362. wqe_size_in_bytes_sq,
  363. init_attr->act_wqe_size_enc_sq, adapter,
  364. 0);
  365. if (ret) {
  366. pr_err("can't register for sq ret=%x\n", ret);
  367. goto out_freeres;
  368. }
  369. ret = ehea_qp_alloc_register(qp, &qp->hw_rqueue1,
  370. init_attr->nr_rq1_pages,
  371. wqe_size_in_bytes_rq1,
  372. init_attr->act_wqe_size_enc_rq1,
  373. adapter, 1);
  374. if (ret) {
  375. pr_err("can't register for rq1 ret=%x\n", ret);
  376. goto out_kill_hwsq;
  377. }
  378. if (init_attr->rq_count > 1) {
  379. ret = ehea_qp_alloc_register(qp, &qp->hw_rqueue2,
  380. init_attr->nr_rq2_pages,
  381. wqe_size_in_bytes_rq2,
  382. init_attr->act_wqe_size_enc_rq2,
  383. adapter, 2);
  384. if (ret) {
  385. pr_err("can't register for rq2 ret=%x\n", ret);
  386. goto out_kill_hwr1q;
  387. }
  388. }
  389. if (init_attr->rq_count > 2) {
  390. ret = ehea_qp_alloc_register(qp, &qp->hw_rqueue3,
  391. init_attr->nr_rq3_pages,
  392. wqe_size_in_bytes_rq3,
  393. init_attr->act_wqe_size_enc_rq3,
  394. adapter, 3);
  395. if (ret) {
  396. pr_err("can't register for rq3 ret=%x\n", ret);
  397. goto out_kill_hwr2q;
  398. }
  399. }
  400. qp->init_attr = *init_attr;
  401. return qp;
  402. out_kill_hwr2q:
  403. hw_queue_dtor(&qp->hw_rqueue2);
  404. out_kill_hwr1q:
  405. hw_queue_dtor(&qp->hw_rqueue1);
  406. out_kill_hwsq:
  407. hw_queue_dtor(&qp->hw_squeue);
  408. out_freeres:
  409. ehea_h_disable_and_get_hea(adapter->handle, qp->fw_handle);
  410. ehea_h_free_resource(adapter->handle, qp->fw_handle, FORCE_FREE);
  411. out_freemem:
  412. kfree(qp);
  413. return NULL;
  414. }
  415. static u64 ehea_destroy_qp_res(struct ehea_qp *qp, u64 force)
  416. {
  417. u64 hret;
  418. struct ehea_qp_init_attr *qp_attr = &qp->init_attr;
  419. ehea_h_disable_and_get_hea(qp->adapter->handle, qp->fw_handle);
  420. hret = ehea_h_free_resource(qp->adapter->handle, qp->fw_handle, force);
  421. if (hret != H_SUCCESS)
  422. return hret;
  423. hw_queue_dtor(&qp->hw_squeue);
  424. hw_queue_dtor(&qp->hw_rqueue1);
  425. if (qp_attr->rq_count > 1)
  426. hw_queue_dtor(&qp->hw_rqueue2);
  427. if (qp_attr->rq_count > 2)
  428. hw_queue_dtor(&qp->hw_rqueue3);
  429. kfree(qp);
  430. return hret;
  431. }
  432. int ehea_destroy_qp(struct ehea_qp *qp)
  433. {
  434. u64 hret, aer, aerr;
  435. if (!qp)
  436. return 0;
  437. hcp_epas_dtor(&qp->epas);
  438. hret = ehea_destroy_qp_res(qp, NORMAL_FREE);
  439. if (hret == H_R_STATE) {
  440. ehea_error_data(qp->adapter, qp->fw_handle, &aer, &aerr);
  441. hret = ehea_destroy_qp_res(qp, FORCE_FREE);
  442. }
  443. if (hret != H_SUCCESS) {
  444. pr_err("destroy QP failed\n");
  445. return -EIO;
  446. }
  447. return 0;
  448. }
  449. static inline int ehea_calc_index(unsigned long i, unsigned long s)
  450. {
  451. return (i >> s) & EHEA_INDEX_MASK;
  452. }
  453. static inline int ehea_init_top_bmap(struct ehea_top_bmap *ehea_top_bmap,
  454. int dir)
  455. {
  456. if (!ehea_top_bmap->dir[dir]) {
  457. ehea_top_bmap->dir[dir] =
  458. kzalloc(sizeof(struct ehea_dir_bmap), GFP_KERNEL);
  459. if (!ehea_top_bmap->dir[dir])
  460. return -ENOMEM;
  461. }
  462. return 0;
  463. }
  464. static inline int ehea_init_bmap(struct ehea_bmap *ehea_bmap, int top, int dir)
  465. {
  466. if (!ehea_bmap->top[top]) {
  467. ehea_bmap->top[top] =
  468. kzalloc(sizeof(struct ehea_top_bmap), GFP_KERNEL);
  469. if (!ehea_bmap->top[top])
  470. return -ENOMEM;
  471. }
  472. return ehea_init_top_bmap(ehea_bmap->top[top], dir);
  473. }
  474. static DEFINE_MUTEX(ehea_busmap_mutex);
  475. static unsigned long ehea_mr_len;
  476. #define EHEA_BUSMAP_ADD_SECT 1
  477. #define EHEA_BUSMAP_REM_SECT 0
  478. static void ehea_rebuild_busmap(void)
  479. {
  480. u64 vaddr = EHEA_BUSMAP_START;
  481. int top, dir, idx;
  482. for (top = 0; top < EHEA_MAP_ENTRIES; top++) {
  483. struct ehea_top_bmap *ehea_top;
  484. int valid_dir_entries = 0;
  485. if (!ehea_bmap->top[top])
  486. continue;
  487. ehea_top = ehea_bmap->top[top];
  488. for (dir = 0; dir < EHEA_MAP_ENTRIES; dir++) {
  489. struct ehea_dir_bmap *ehea_dir;
  490. int valid_entries = 0;
  491. if (!ehea_top->dir[dir])
  492. continue;
  493. valid_dir_entries++;
  494. ehea_dir = ehea_top->dir[dir];
  495. for (idx = 0; idx < EHEA_MAP_ENTRIES; idx++) {
  496. if (!ehea_dir->ent[idx])
  497. continue;
  498. valid_entries++;
  499. ehea_dir->ent[idx] = vaddr;
  500. vaddr += EHEA_SECTSIZE;
  501. }
  502. if (!valid_entries) {
  503. ehea_top->dir[dir] = NULL;
  504. kfree(ehea_dir);
  505. }
  506. }
  507. if (!valid_dir_entries) {
  508. ehea_bmap->top[top] = NULL;
  509. kfree(ehea_top);
  510. }
  511. }
  512. }
  513. static int ehea_update_busmap(unsigned long pfn, unsigned long nr_pages, int add)
  514. {
  515. unsigned long i, start_section, end_section;
  516. if (!nr_pages)
  517. return 0;
  518. if (!ehea_bmap) {
  519. ehea_bmap = kzalloc(sizeof(struct ehea_bmap), GFP_KERNEL);
  520. if (!ehea_bmap)
  521. return -ENOMEM;
  522. }
  523. start_section = (pfn * PAGE_SIZE) / EHEA_SECTSIZE;
  524. end_section = start_section + ((nr_pages * PAGE_SIZE) / EHEA_SECTSIZE);
  525. /* Mark entries as valid or invalid only; address is assigned later */
  526. for (i = start_section; i < end_section; i++) {
  527. u64 flag;
  528. int top = ehea_calc_index(i, EHEA_TOP_INDEX_SHIFT);
  529. int dir = ehea_calc_index(i, EHEA_DIR_INDEX_SHIFT);
  530. int idx = i & EHEA_INDEX_MASK;
  531. if (add) {
  532. int ret = ehea_init_bmap(ehea_bmap, top, dir);
  533. if (ret)
  534. return ret;
  535. flag = 1; /* valid */
  536. ehea_mr_len += EHEA_SECTSIZE;
  537. } else {
  538. if (!ehea_bmap->top[top])
  539. continue;
  540. if (!ehea_bmap->top[top]->dir[dir])
  541. continue;
  542. flag = 0; /* invalid */
  543. ehea_mr_len -= EHEA_SECTSIZE;
  544. }
  545. ehea_bmap->top[top]->dir[dir]->ent[idx] = flag;
  546. }
  547. ehea_rebuild_busmap(); /* Assign contiguous addresses for mr */
  548. return 0;
  549. }
  550. int ehea_add_sect_bmap(unsigned long pfn, unsigned long nr_pages)
  551. {
  552. int ret;
  553. mutex_lock(&ehea_busmap_mutex);
  554. ret = ehea_update_busmap(pfn, nr_pages, EHEA_BUSMAP_ADD_SECT);
  555. mutex_unlock(&ehea_busmap_mutex);
  556. return ret;
  557. }
  558. int ehea_rem_sect_bmap(unsigned long pfn, unsigned long nr_pages)
  559. {
  560. int ret;
  561. mutex_lock(&ehea_busmap_mutex);
  562. ret = ehea_update_busmap(pfn, nr_pages, EHEA_BUSMAP_REM_SECT);
  563. mutex_unlock(&ehea_busmap_mutex);
  564. return ret;
  565. }
  566. static int ehea_is_hugepage(unsigned long pfn)
  567. {
  568. int page_order;
  569. if (pfn & EHEA_HUGEPAGE_PFN_MASK)
  570. return 0;
  571. page_order = compound_order(pfn_to_page(pfn));
  572. if (page_order + PAGE_SHIFT != EHEA_HUGEPAGESHIFT)
  573. return 0;
  574. return 1;
  575. }
  576. static int ehea_create_busmap_callback(unsigned long initial_pfn,
  577. unsigned long total_nr_pages, void *arg)
  578. {
  579. int ret;
  580. unsigned long pfn, start_pfn, end_pfn, nr_pages;
  581. if ((total_nr_pages * PAGE_SIZE) < EHEA_HUGEPAGE_SIZE)
  582. return ehea_update_busmap(initial_pfn, total_nr_pages,
  583. EHEA_BUSMAP_ADD_SECT);
  584. /* Given chunk is >= 16GB -> check for hugepages */
  585. start_pfn = initial_pfn;
  586. end_pfn = initial_pfn + total_nr_pages;
  587. pfn = start_pfn;
  588. while (pfn < end_pfn) {
  589. if (ehea_is_hugepage(pfn)) {
  590. /* Add mem found in front of the hugepage */
  591. nr_pages = pfn - start_pfn;
  592. ret = ehea_update_busmap(start_pfn, nr_pages,
  593. EHEA_BUSMAP_ADD_SECT);
  594. if (ret)
  595. return ret;
  596. /* Skip the hugepage */
  597. pfn += (EHEA_HUGEPAGE_SIZE / PAGE_SIZE);
  598. start_pfn = pfn;
  599. } else
  600. pfn += (EHEA_SECTSIZE / PAGE_SIZE);
  601. }
  602. /* Add mem found behind the hugepage(s) */
  603. nr_pages = pfn - start_pfn;
  604. return ehea_update_busmap(start_pfn, nr_pages, EHEA_BUSMAP_ADD_SECT);
  605. }
  606. int ehea_create_busmap(void)
  607. {
  608. int ret;
  609. mutex_lock(&ehea_busmap_mutex);
  610. ehea_mr_len = 0;
  611. ret = walk_system_ram_range(0, 1ULL << MAX_PHYSMEM_BITS, NULL,
  612. ehea_create_busmap_callback);
  613. mutex_unlock(&ehea_busmap_mutex);
  614. return ret;
  615. }
  616. void ehea_destroy_busmap(void)
  617. {
  618. int top, dir;
  619. mutex_lock(&ehea_busmap_mutex);
  620. if (!ehea_bmap)
  621. goto out_destroy;
  622. for (top = 0; top < EHEA_MAP_ENTRIES; top++) {
  623. if (!ehea_bmap->top[top])
  624. continue;
  625. for (dir = 0; dir < EHEA_MAP_ENTRIES; dir++) {
  626. if (!ehea_bmap->top[top]->dir[dir])
  627. continue;
  628. kfree(ehea_bmap->top[top]->dir[dir]);
  629. }
  630. kfree(ehea_bmap->top[top]);
  631. }
  632. kfree(ehea_bmap);
  633. ehea_bmap = NULL;
  634. out_destroy:
  635. mutex_unlock(&ehea_busmap_mutex);
  636. }
  637. u64 ehea_map_vaddr(void *caddr)
  638. {
  639. int top, dir, idx;
  640. unsigned long index, offset;
  641. if (!ehea_bmap)
  642. return EHEA_INVAL_ADDR;
  643. index = __pa(caddr) >> SECTION_SIZE_BITS;
  644. top = (index >> EHEA_TOP_INDEX_SHIFT) & EHEA_INDEX_MASK;
  645. if (!ehea_bmap->top[top])
  646. return EHEA_INVAL_ADDR;
  647. dir = (index >> EHEA_DIR_INDEX_SHIFT) & EHEA_INDEX_MASK;
  648. if (!ehea_bmap->top[top]->dir[dir])
  649. return EHEA_INVAL_ADDR;
  650. idx = index & EHEA_INDEX_MASK;
  651. if (!ehea_bmap->top[top]->dir[dir]->ent[idx])
  652. return EHEA_INVAL_ADDR;
  653. offset = (unsigned long)caddr & (EHEA_SECTSIZE - 1);
  654. return ehea_bmap->top[top]->dir[dir]->ent[idx] | offset;
  655. }
  656. static inline void *ehea_calc_sectbase(int top, int dir, int idx)
  657. {
  658. unsigned long ret = idx;
  659. ret |= dir << EHEA_DIR_INDEX_SHIFT;
  660. ret |= top << EHEA_TOP_INDEX_SHIFT;
  661. return __va(ret << SECTION_SIZE_BITS);
  662. }
  663. static u64 ehea_reg_mr_section(int top, int dir, int idx, u64 *pt,
  664. struct ehea_adapter *adapter,
  665. struct ehea_mr *mr)
  666. {
  667. void *pg;
  668. u64 j, m, hret;
  669. unsigned long k = 0;
  670. u64 pt_abs = __pa(pt);
  671. void *sectbase = ehea_calc_sectbase(top, dir, idx);
  672. for (j = 0; j < (EHEA_PAGES_PER_SECTION / EHEA_MAX_RPAGE); j++) {
  673. for (m = 0; m < EHEA_MAX_RPAGE; m++) {
  674. pg = sectbase + ((k++) * EHEA_PAGESIZE);
  675. pt[m] = __pa(pg);
  676. }
  677. hret = ehea_h_register_rpage_mr(adapter->handle, mr->handle, 0,
  678. 0, pt_abs, EHEA_MAX_RPAGE);
  679. if ((hret != H_SUCCESS) &&
  680. (hret != H_PAGE_REGISTERED)) {
  681. ehea_h_free_resource(adapter->handle, mr->handle,
  682. FORCE_FREE);
  683. pr_err("register_rpage_mr failed\n");
  684. return hret;
  685. }
  686. }
  687. return hret;
  688. }
  689. static u64 ehea_reg_mr_sections(int top, int dir, u64 *pt,
  690. struct ehea_adapter *adapter,
  691. struct ehea_mr *mr)
  692. {
  693. u64 hret = H_SUCCESS;
  694. int idx;
  695. for (idx = 0; idx < EHEA_MAP_ENTRIES; idx++) {
  696. if (!ehea_bmap->top[top]->dir[dir]->ent[idx])
  697. continue;
  698. hret = ehea_reg_mr_section(top, dir, idx, pt, adapter, mr);
  699. if ((hret != H_SUCCESS) && (hret != H_PAGE_REGISTERED))
  700. return hret;
  701. }
  702. return hret;
  703. }
  704. static u64 ehea_reg_mr_dir_sections(int top, u64 *pt,
  705. struct ehea_adapter *adapter,
  706. struct ehea_mr *mr)
  707. {
  708. u64 hret = H_SUCCESS;
  709. int dir;
  710. for (dir = 0; dir < EHEA_MAP_ENTRIES; dir++) {
  711. if (!ehea_bmap->top[top]->dir[dir])
  712. continue;
  713. hret = ehea_reg_mr_sections(top, dir, pt, adapter, mr);
  714. if ((hret != H_SUCCESS) && (hret != H_PAGE_REGISTERED))
  715. return hret;
  716. }
  717. return hret;
  718. }
  719. int ehea_reg_kernel_mr(struct ehea_adapter *adapter, struct ehea_mr *mr)
  720. {
  721. int ret;
  722. u64 *pt;
  723. u64 hret;
  724. u32 acc_ctrl = EHEA_MR_ACC_CTRL;
  725. unsigned long top;
  726. pt = (void *)get_zeroed_page(GFP_KERNEL);
  727. if (!pt) {
  728. pr_err("no mem\n");
  729. ret = -ENOMEM;
  730. goto out;
  731. }
  732. hret = ehea_h_alloc_resource_mr(adapter->handle, EHEA_BUSMAP_START,
  733. ehea_mr_len, acc_ctrl, adapter->pd,
  734. &mr->handle, &mr->lkey);
  735. if (hret != H_SUCCESS) {
  736. pr_err("alloc_resource_mr failed\n");
  737. ret = -EIO;
  738. goto out;
  739. }
  740. if (!ehea_bmap) {
  741. ehea_h_free_resource(adapter->handle, mr->handle, FORCE_FREE);
  742. pr_err("no busmap available\n");
  743. ret = -EIO;
  744. goto out;
  745. }
  746. for (top = 0; top < EHEA_MAP_ENTRIES; top++) {
  747. if (!ehea_bmap->top[top])
  748. continue;
  749. hret = ehea_reg_mr_dir_sections(top, pt, adapter, mr);
  750. if((hret != H_PAGE_REGISTERED) && (hret != H_SUCCESS))
  751. break;
  752. }
  753. if (hret != H_SUCCESS) {
  754. ehea_h_free_resource(adapter->handle, mr->handle, FORCE_FREE);
  755. pr_err("registering mr failed\n");
  756. ret = -EIO;
  757. goto out;
  758. }
  759. mr->vaddr = EHEA_BUSMAP_START;
  760. mr->adapter = adapter;
  761. ret = 0;
  762. out:
  763. free_page((unsigned long)pt);
  764. return ret;
  765. }
  766. int ehea_rem_mr(struct ehea_mr *mr)
  767. {
  768. u64 hret;
  769. if (!mr || !mr->adapter)
  770. return -EINVAL;
  771. hret = ehea_h_free_resource(mr->adapter->handle, mr->handle,
  772. FORCE_FREE);
  773. if (hret != H_SUCCESS) {
  774. pr_err("destroy MR failed\n");
  775. return -EIO;
  776. }
  777. return 0;
  778. }
  779. int ehea_gen_smr(struct ehea_adapter *adapter, struct ehea_mr *old_mr,
  780. struct ehea_mr *shared_mr)
  781. {
  782. u64 hret;
  783. hret = ehea_h_register_smr(adapter->handle, old_mr->handle,
  784. old_mr->vaddr, EHEA_MR_ACC_CTRL,
  785. adapter->pd, shared_mr);
  786. if (hret != H_SUCCESS)
  787. return -EIO;
  788. shared_mr->adapter = adapter;
  789. return 0;
  790. }
  791. static void print_error_data(u64 *data)
  792. {
  793. int length;
  794. u64 type = EHEA_BMASK_GET(ERROR_DATA_TYPE, data[2]);
  795. u64 resource = data[1];
  796. length = EHEA_BMASK_GET(ERROR_DATA_LENGTH, data[0]);
  797. if (length > EHEA_PAGESIZE)
  798. length = EHEA_PAGESIZE;
  799. if (type == EHEA_AER_RESTYPE_QP)
  800. pr_err("QP (resource=%llX) state: AER=0x%llX, AERR=0x%llX, port=%llX\n",
  801. resource, data[6], data[12], data[22]);
  802. else if (type == EHEA_AER_RESTYPE_CQ)
  803. pr_err("CQ (resource=%llX) state: AER=0x%llX\n",
  804. resource, data[6]);
  805. else if (type == EHEA_AER_RESTYPE_EQ)
  806. pr_err("EQ (resource=%llX) state: AER=0x%llX\n",
  807. resource, data[6]);
  808. ehea_dump(data, length, "error data");
  809. }
  810. u64 ehea_error_data(struct ehea_adapter *adapter, u64 res_handle,
  811. u64 *aer, u64 *aerr)
  812. {
  813. unsigned long ret;
  814. u64 *rblock;
  815. u64 type = 0;
  816. rblock = (void *)get_zeroed_page(GFP_KERNEL);
  817. if (!rblock) {
  818. pr_err("Cannot allocate rblock memory\n");
  819. goto out;
  820. }
  821. ret = ehea_h_error_data(adapter->handle, res_handle, rblock);
  822. if (ret == H_SUCCESS) {
  823. type = EHEA_BMASK_GET(ERROR_DATA_TYPE, rblock[2]);
  824. *aer = rblock[6];
  825. *aerr = rblock[12];
  826. print_error_data(rblock);
  827. } else if (ret == H_R_STATE) {
  828. pr_err("No error data available: %llX\n", res_handle);
  829. } else
  830. pr_err("Error data could not be fetched: %llX\n", res_handle);
  831. free_page((unsigned long)rblock);
  832. out:
  833. return type;
  834. }