ehea_qmr.c 13 KB

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