ehea_qmr.c 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032
  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. #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. struct ehea_bmap *ehea_bmap = NULL;
  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(nr_of_pages * sizeof(void *), GFP_KERNEL);
  60. if (!queue->queue_pages) {
  61. pr_err("no mem for queue_pages\n");
  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. pr_err("no mem for cq\n");
  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. pr_err("alloc_resource_cq failed\n");
  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. pr_err("hw_qpageit_get_inc failed\n");
  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. pr_err("register_rpage_cq failed ehea_cq=%p hret=%llx counter=%i act_pages=%i\n",
  147. cq, hret, counter, cq->attr.nr_pages);
  148. goto out_kill_hwq;
  149. }
  150. if (counter == (cq->attr.nr_pages - 1)) {
  151. vpage = hw_qpageit_get_inc(&cq->hw_queue);
  152. if ((hret != H_SUCCESS) || (vpage)) {
  153. pr_err("registration of pages not complete hret=%llx\n",
  154. hret);
  155. goto out_kill_hwq;
  156. }
  157. } else {
  158. if (hret != H_PAGE_REGISTERED) {
  159. pr_err("CQ: registration of page failed hret=%llx\n",
  160. hret);
  161. goto out_kill_hwq;
  162. }
  163. }
  164. }
  165. hw_qeit_reset(&cq->hw_queue);
  166. epa = cq->epas.kernel;
  167. ehea_reset_cq_ep(cq);
  168. ehea_reset_cq_n1(cq);
  169. return cq;
  170. out_kill_hwq:
  171. hw_queue_dtor(&cq->hw_queue);
  172. out_freeres:
  173. ehea_h_free_resource(adapter->handle, cq->fw_handle, FORCE_FREE);
  174. out_freemem:
  175. kfree(cq);
  176. out_nomem:
  177. return NULL;
  178. }
  179. u64 ehea_destroy_cq_res(struct ehea_cq *cq, u64 force)
  180. {
  181. u64 hret;
  182. u64 adapter_handle = cq->adapter->handle;
  183. /* deregister all previous registered pages */
  184. hret = ehea_h_free_resource(adapter_handle, cq->fw_handle, force);
  185. if (hret != H_SUCCESS)
  186. return hret;
  187. hw_queue_dtor(&cq->hw_queue);
  188. kfree(cq);
  189. return hret;
  190. }
  191. int ehea_destroy_cq(struct ehea_cq *cq)
  192. {
  193. u64 hret, aer, aerr;
  194. if (!cq)
  195. return 0;
  196. hcp_epas_dtor(&cq->epas);
  197. hret = ehea_destroy_cq_res(cq, NORMAL_FREE);
  198. if (hret == H_R_STATE) {
  199. ehea_error_data(cq->adapter, cq->fw_handle, &aer, &aerr);
  200. hret = ehea_destroy_cq_res(cq, FORCE_FREE);
  201. }
  202. if (hret != H_SUCCESS) {
  203. pr_err("destroy CQ failed\n");
  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. pr_err("no mem for eq\n");
  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. pr_err("alloc_resource_eq failed\n");
  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. pr_err("can't allocate eq pages\n");
  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. pr_err("hw_qpageit_get_inc failed\n");
  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. } else {
  255. if (hret != H_PAGE_REGISTERED)
  256. goto out_kill_hwq;
  257. }
  258. }
  259. hw_qeit_reset(&eq->hw_queue);
  260. return eq;
  261. out_kill_hwq:
  262. hw_queue_dtor(&eq->hw_queue);
  263. out_freeres:
  264. ehea_h_free_resource(adapter->handle, eq->fw_handle, FORCE_FREE);
  265. out_freemem:
  266. kfree(eq);
  267. return NULL;
  268. }
  269. struct ehea_eqe *ehea_poll_eq(struct ehea_eq *eq)
  270. {
  271. struct ehea_eqe *eqe;
  272. unsigned long flags;
  273. spin_lock_irqsave(&eq->spinlock, flags);
  274. eqe = (struct ehea_eqe *)hw_eqit_eq_get_inc_valid(&eq->hw_queue);
  275. spin_unlock_irqrestore(&eq->spinlock, flags);
  276. return eqe;
  277. }
  278. u64 ehea_destroy_eq_res(struct ehea_eq *eq, u64 force)
  279. {
  280. u64 hret;
  281. unsigned long flags;
  282. spin_lock_irqsave(&eq->spinlock, flags);
  283. hret = ehea_h_free_resource(eq->adapter->handle, eq->fw_handle, force);
  284. spin_unlock_irqrestore(&eq->spinlock, flags);
  285. if (hret != H_SUCCESS)
  286. return hret;
  287. hw_queue_dtor(&eq->hw_queue);
  288. kfree(eq);
  289. return hret;
  290. }
  291. int ehea_destroy_eq(struct ehea_eq *eq)
  292. {
  293. u64 hret, aer, aerr;
  294. if (!eq)
  295. return 0;
  296. hcp_epas_dtor(&eq->epas);
  297. hret = ehea_destroy_eq_res(eq, NORMAL_FREE);
  298. if (hret == H_R_STATE) {
  299. ehea_error_data(eq->adapter, eq->fw_handle, &aer, &aerr);
  300. hret = ehea_destroy_eq_res(eq, FORCE_FREE);
  301. }
  302. if (hret != H_SUCCESS) {
  303. pr_err("destroy EQ failed\n");
  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. pr_err("hw_qpageit_get_inc failed\n");
  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. pr_err("register_rpage_qp failed\n");
  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. pr_err("no mem for qp\n");
  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. pr_err("ehea_h_alloc_resource_qp failed\n");
  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. pr_err("can't register for sq ret=%x\n", 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. pr_err("can't register for rq1 ret=%x\n", 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. pr_err("can't register for rq2 ret=%x\n", 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. pr_err("can't register for rq3 ret=%x\n", 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, aer, aerr;
  444. if (!qp)
  445. return 0;
  446. hcp_epas_dtor(&qp->epas);
  447. hret = ehea_destroy_qp_res(qp, NORMAL_FREE);
  448. if (hret == H_R_STATE) {
  449. ehea_error_data(qp->adapter, qp->fw_handle, &aer, &aerr);
  450. hret = ehea_destroy_qp_res(qp, FORCE_FREE);
  451. }
  452. if (hret != H_SUCCESS) {
  453. pr_err("destroy QP failed\n");
  454. return -EIO;
  455. }
  456. return 0;
  457. }
  458. static inline int ehea_calc_index(unsigned long i, unsigned long s)
  459. {
  460. return (i >> s) & EHEA_INDEX_MASK;
  461. }
  462. static inline int ehea_init_top_bmap(struct ehea_top_bmap *ehea_top_bmap,
  463. int dir)
  464. {
  465. if (!ehea_top_bmap->dir[dir]) {
  466. ehea_top_bmap->dir[dir] =
  467. kzalloc(sizeof(struct ehea_dir_bmap), GFP_KERNEL);
  468. if (!ehea_top_bmap->dir[dir])
  469. return -ENOMEM;
  470. }
  471. return 0;
  472. }
  473. static inline int ehea_init_bmap(struct ehea_bmap *ehea_bmap, int top, int dir)
  474. {
  475. if (!ehea_bmap->top[top]) {
  476. ehea_bmap->top[top] =
  477. kzalloc(sizeof(struct ehea_top_bmap), GFP_KERNEL);
  478. if (!ehea_bmap->top[top])
  479. return -ENOMEM;
  480. }
  481. return ehea_init_top_bmap(ehea_bmap->top[top], dir);
  482. }
  483. static DEFINE_MUTEX(ehea_busmap_mutex);
  484. static unsigned long ehea_mr_len;
  485. #define EHEA_BUSMAP_ADD_SECT 1
  486. #define EHEA_BUSMAP_REM_SECT 0
  487. static void ehea_rebuild_busmap(void)
  488. {
  489. u64 vaddr = EHEA_BUSMAP_START;
  490. int top, dir, idx;
  491. for (top = 0; top < EHEA_MAP_ENTRIES; top++) {
  492. struct ehea_top_bmap *ehea_top;
  493. int valid_dir_entries = 0;
  494. if (!ehea_bmap->top[top])
  495. continue;
  496. ehea_top = ehea_bmap->top[top];
  497. for (dir = 0; dir < EHEA_MAP_ENTRIES; dir++) {
  498. struct ehea_dir_bmap *ehea_dir;
  499. int valid_entries = 0;
  500. if (!ehea_top->dir[dir])
  501. continue;
  502. valid_dir_entries++;
  503. ehea_dir = ehea_top->dir[dir];
  504. for (idx = 0; idx < EHEA_MAP_ENTRIES; idx++) {
  505. if (!ehea_dir->ent[idx])
  506. continue;
  507. valid_entries++;
  508. ehea_dir->ent[idx] = vaddr;
  509. vaddr += EHEA_SECTSIZE;
  510. }
  511. if (!valid_entries) {
  512. ehea_top->dir[dir] = NULL;
  513. kfree(ehea_dir);
  514. }
  515. }
  516. if (!valid_dir_entries) {
  517. ehea_bmap->top[top] = NULL;
  518. kfree(ehea_top);
  519. }
  520. }
  521. }
  522. static int ehea_update_busmap(unsigned long pfn, unsigned long nr_pages, int add)
  523. {
  524. unsigned long i, start_section, end_section;
  525. if (!nr_pages)
  526. return 0;
  527. if (!ehea_bmap) {
  528. ehea_bmap = kzalloc(sizeof(struct ehea_bmap), GFP_KERNEL);
  529. if (!ehea_bmap)
  530. return -ENOMEM;
  531. }
  532. start_section = (pfn * PAGE_SIZE) / EHEA_SECTSIZE;
  533. end_section = start_section + ((nr_pages * PAGE_SIZE) / EHEA_SECTSIZE);
  534. /* Mark entries as valid or invalid only; address is assigned later */
  535. for (i = start_section; i < end_section; i++) {
  536. u64 flag;
  537. int top = ehea_calc_index(i, EHEA_TOP_INDEX_SHIFT);
  538. int dir = ehea_calc_index(i, EHEA_DIR_INDEX_SHIFT);
  539. int idx = i & EHEA_INDEX_MASK;
  540. if (add) {
  541. int ret = ehea_init_bmap(ehea_bmap, top, dir);
  542. if (ret)
  543. return ret;
  544. flag = 1; /* valid */
  545. ehea_mr_len += EHEA_SECTSIZE;
  546. } else {
  547. if (!ehea_bmap->top[top])
  548. continue;
  549. if (!ehea_bmap->top[top]->dir[dir])
  550. continue;
  551. flag = 0; /* invalid */
  552. ehea_mr_len -= EHEA_SECTSIZE;
  553. }
  554. ehea_bmap->top[top]->dir[dir]->ent[idx] = flag;
  555. }
  556. ehea_rebuild_busmap(); /* Assign contiguous addresses for mr */
  557. return 0;
  558. }
  559. int ehea_add_sect_bmap(unsigned long pfn, unsigned long nr_pages)
  560. {
  561. int ret;
  562. mutex_lock(&ehea_busmap_mutex);
  563. ret = ehea_update_busmap(pfn, nr_pages, EHEA_BUSMAP_ADD_SECT);
  564. mutex_unlock(&ehea_busmap_mutex);
  565. return ret;
  566. }
  567. int ehea_rem_sect_bmap(unsigned long pfn, unsigned long nr_pages)
  568. {
  569. int ret;
  570. mutex_lock(&ehea_busmap_mutex);
  571. ret = ehea_update_busmap(pfn, nr_pages, EHEA_BUSMAP_REM_SECT);
  572. mutex_unlock(&ehea_busmap_mutex);
  573. return ret;
  574. }
  575. static int ehea_is_hugepage(unsigned long pfn)
  576. {
  577. int page_order;
  578. if (pfn & EHEA_HUGEPAGE_PFN_MASK)
  579. return 0;
  580. page_order = compound_order(pfn_to_page(pfn));
  581. if (page_order + PAGE_SHIFT != EHEA_HUGEPAGESHIFT)
  582. return 0;
  583. return 1;
  584. }
  585. static int ehea_create_busmap_callback(unsigned long initial_pfn,
  586. unsigned long total_nr_pages, void *arg)
  587. {
  588. int ret;
  589. unsigned long pfn, start_pfn, end_pfn, nr_pages;
  590. if ((total_nr_pages * PAGE_SIZE) < EHEA_HUGEPAGE_SIZE)
  591. return ehea_update_busmap(initial_pfn, total_nr_pages,
  592. EHEA_BUSMAP_ADD_SECT);
  593. /* Given chunk is >= 16GB -> check for hugepages */
  594. start_pfn = initial_pfn;
  595. end_pfn = initial_pfn + total_nr_pages;
  596. pfn = start_pfn;
  597. while (pfn < end_pfn) {
  598. if (ehea_is_hugepage(pfn)) {
  599. /* Add mem found in front of the hugepage */
  600. nr_pages = pfn - start_pfn;
  601. ret = ehea_update_busmap(start_pfn, nr_pages,
  602. EHEA_BUSMAP_ADD_SECT);
  603. if (ret)
  604. return ret;
  605. /* Skip the hugepage */
  606. pfn += (EHEA_HUGEPAGE_SIZE / PAGE_SIZE);
  607. start_pfn = pfn;
  608. } else
  609. pfn += (EHEA_SECTSIZE / PAGE_SIZE);
  610. }
  611. /* Add mem found behind the hugepage(s) */
  612. nr_pages = pfn - start_pfn;
  613. return ehea_update_busmap(start_pfn, nr_pages, EHEA_BUSMAP_ADD_SECT);
  614. }
  615. int ehea_create_busmap(void)
  616. {
  617. int ret;
  618. mutex_lock(&ehea_busmap_mutex);
  619. ehea_mr_len = 0;
  620. ret = walk_system_ram_range(0, 1ULL << MAX_PHYSMEM_BITS, NULL,
  621. ehea_create_busmap_callback);
  622. mutex_unlock(&ehea_busmap_mutex);
  623. return ret;
  624. }
  625. void ehea_destroy_busmap(void)
  626. {
  627. int top, dir;
  628. mutex_lock(&ehea_busmap_mutex);
  629. if (!ehea_bmap)
  630. goto out_destroy;
  631. for (top = 0; top < EHEA_MAP_ENTRIES; top++) {
  632. if (!ehea_bmap->top[top])
  633. continue;
  634. for (dir = 0; dir < EHEA_MAP_ENTRIES; dir++) {
  635. if (!ehea_bmap->top[top]->dir[dir])
  636. continue;
  637. kfree(ehea_bmap->top[top]->dir[dir]);
  638. }
  639. kfree(ehea_bmap->top[top]);
  640. }
  641. kfree(ehea_bmap);
  642. ehea_bmap = NULL;
  643. out_destroy:
  644. mutex_unlock(&ehea_busmap_mutex);
  645. }
  646. u64 ehea_map_vaddr(void *caddr)
  647. {
  648. int top, dir, idx;
  649. unsigned long index, offset;
  650. if (!ehea_bmap)
  651. return EHEA_INVAL_ADDR;
  652. index = virt_to_abs(caddr) >> SECTION_SIZE_BITS;
  653. top = (index >> EHEA_TOP_INDEX_SHIFT) & EHEA_INDEX_MASK;
  654. if (!ehea_bmap->top[top])
  655. return EHEA_INVAL_ADDR;
  656. dir = (index >> EHEA_DIR_INDEX_SHIFT) & EHEA_INDEX_MASK;
  657. if (!ehea_bmap->top[top]->dir[dir])
  658. return EHEA_INVAL_ADDR;
  659. idx = index & EHEA_INDEX_MASK;
  660. if (!ehea_bmap->top[top]->dir[dir]->ent[idx])
  661. return EHEA_INVAL_ADDR;
  662. offset = (unsigned long)caddr & (EHEA_SECTSIZE - 1);
  663. return ehea_bmap->top[top]->dir[dir]->ent[idx] | offset;
  664. }
  665. static inline void *ehea_calc_sectbase(int top, int dir, int idx)
  666. {
  667. unsigned long ret = idx;
  668. ret |= dir << EHEA_DIR_INDEX_SHIFT;
  669. ret |= top << EHEA_TOP_INDEX_SHIFT;
  670. return abs_to_virt(ret << SECTION_SIZE_BITS);
  671. }
  672. static u64 ehea_reg_mr_section(int top, int dir, int idx, u64 *pt,
  673. struct ehea_adapter *adapter,
  674. struct ehea_mr *mr)
  675. {
  676. void *pg;
  677. u64 j, m, hret;
  678. unsigned long k = 0;
  679. u64 pt_abs = virt_to_abs(pt);
  680. void *sectbase = ehea_calc_sectbase(top, dir, idx);
  681. for (j = 0; j < (EHEA_PAGES_PER_SECTION / EHEA_MAX_RPAGE); j++) {
  682. for (m = 0; m < EHEA_MAX_RPAGE; m++) {
  683. pg = sectbase + ((k++) * EHEA_PAGESIZE);
  684. pt[m] = virt_to_abs(pg);
  685. }
  686. hret = ehea_h_register_rpage_mr(adapter->handle, mr->handle, 0,
  687. 0, pt_abs, EHEA_MAX_RPAGE);
  688. if ((hret != H_SUCCESS) &&
  689. (hret != H_PAGE_REGISTERED)) {
  690. ehea_h_free_resource(adapter->handle, mr->handle,
  691. FORCE_FREE);
  692. pr_err("register_rpage_mr failed\n");
  693. return hret;
  694. }
  695. }
  696. return hret;
  697. }
  698. static u64 ehea_reg_mr_sections(int top, int dir, u64 *pt,
  699. struct ehea_adapter *adapter,
  700. struct ehea_mr *mr)
  701. {
  702. u64 hret = H_SUCCESS;
  703. int idx;
  704. for (idx = 0; idx < EHEA_MAP_ENTRIES; idx++) {
  705. if (!ehea_bmap->top[top]->dir[dir]->ent[idx])
  706. continue;
  707. hret = ehea_reg_mr_section(top, dir, idx, pt, adapter, mr);
  708. if ((hret != H_SUCCESS) && (hret != H_PAGE_REGISTERED))
  709. return hret;
  710. }
  711. return hret;
  712. }
  713. static u64 ehea_reg_mr_dir_sections(int top, u64 *pt,
  714. struct ehea_adapter *adapter,
  715. struct ehea_mr *mr)
  716. {
  717. u64 hret = H_SUCCESS;
  718. int dir;
  719. for (dir = 0; dir < EHEA_MAP_ENTRIES; dir++) {
  720. if (!ehea_bmap->top[top]->dir[dir])
  721. continue;
  722. hret = ehea_reg_mr_sections(top, dir, pt, adapter, mr);
  723. if ((hret != H_SUCCESS) && (hret != H_PAGE_REGISTERED))
  724. return hret;
  725. }
  726. return hret;
  727. }
  728. int ehea_reg_kernel_mr(struct ehea_adapter *adapter, struct ehea_mr *mr)
  729. {
  730. int ret;
  731. u64 *pt;
  732. u64 hret;
  733. u32 acc_ctrl = EHEA_MR_ACC_CTRL;
  734. unsigned long top;
  735. pt = (void *)get_zeroed_page(GFP_KERNEL);
  736. if (!pt) {
  737. pr_err("no mem\n");
  738. ret = -ENOMEM;
  739. goto out;
  740. }
  741. hret = ehea_h_alloc_resource_mr(adapter->handle, EHEA_BUSMAP_START,
  742. ehea_mr_len, acc_ctrl, adapter->pd,
  743. &mr->handle, &mr->lkey);
  744. if (hret != H_SUCCESS) {
  745. pr_err("alloc_resource_mr failed\n");
  746. ret = -EIO;
  747. goto out;
  748. }
  749. if (!ehea_bmap) {
  750. ehea_h_free_resource(adapter->handle, mr->handle, FORCE_FREE);
  751. pr_err("no busmap available\n");
  752. ret = -EIO;
  753. goto out;
  754. }
  755. for (top = 0; top < EHEA_MAP_ENTRIES; top++) {
  756. if (!ehea_bmap->top[top])
  757. continue;
  758. hret = ehea_reg_mr_dir_sections(top, pt, adapter, mr);
  759. if((hret != H_PAGE_REGISTERED) && (hret != H_SUCCESS))
  760. break;
  761. }
  762. if (hret != H_SUCCESS) {
  763. ehea_h_free_resource(adapter->handle, mr->handle, FORCE_FREE);
  764. pr_err("registering mr failed\n");
  765. ret = -EIO;
  766. goto out;
  767. }
  768. mr->vaddr = EHEA_BUSMAP_START;
  769. mr->adapter = adapter;
  770. ret = 0;
  771. out:
  772. free_page((unsigned long)pt);
  773. return ret;
  774. }
  775. int ehea_rem_mr(struct ehea_mr *mr)
  776. {
  777. u64 hret;
  778. if (!mr || !mr->adapter)
  779. return -EINVAL;
  780. hret = ehea_h_free_resource(mr->adapter->handle, mr->handle,
  781. FORCE_FREE);
  782. if (hret != H_SUCCESS) {
  783. pr_err("destroy MR failed\n");
  784. return -EIO;
  785. }
  786. return 0;
  787. }
  788. int ehea_gen_smr(struct ehea_adapter *adapter, struct ehea_mr *old_mr,
  789. struct ehea_mr *shared_mr)
  790. {
  791. u64 hret;
  792. hret = ehea_h_register_smr(adapter->handle, old_mr->handle,
  793. old_mr->vaddr, EHEA_MR_ACC_CTRL,
  794. adapter->pd, shared_mr);
  795. if (hret != H_SUCCESS)
  796. return -EIO;
  797. shared_mr->adapter = adapter;
  798. return 0;
  799. }
  800. void print_error_data(u64 *data)
  801. {
  802. int length;
  803. u64 type = EHEA_BMASK_GET(ERROR_DATA_TYPE, data[2]);
  804. u64 resource = data[1];
  805. length = EHEA_BMASK_GET(ERROR_DATA_LENGTH, data[0]);
  806. if (length > EHEA_PAGESIZE)
  807. length = EHEA_PAGESIZE;
  808. if (type == EHEA_AER_RESTYPE_QP)
  809. pr_err("QP (resource=%llX) state: AER=0x%llX, AERR=0x%llX, port=%llX\n",
  810. resource, data[6], data[12], data[22]);
  811. else if (type == EHEA_AER_RESTYPE_CQ)
  812. pr_err("CQ (resource=%llX) state: AER=0x%llX\n",
  813. resource, data[6]);
  814. else if (type == EHEA_AER_RESTYPE_EQ)
  815. pr_err("EQ (resource=%llX) state: AER=0x%llX\n",
  816. resource, data[6]);
  817. ehea_dump(data, length, "error data");
  818. }
  819. u64 ehea_error_data(struct ehea_adapter *adapter, u64 res_handle,
  820. u64 *aer, u64 *aerr)
  821. {
  822. unsigned long ret;
  823. u64 *rblock;
  824. u64 type = 0;
  825. rblock = (void *)get_zeroed_page(GFP_KERNEL);
  826. if (!rblock) {
  827. pr_err("Cannot allocate rblock memory\n");
  828. goto out;
  829. }
  830. ret = ehea_h_error_data(adapter->handle, res_handle, rblock);
  831. if (ret == H_SUCCESS) {
  832. type = EHEA_BMASK_GET(ERROR_DATA_TYPE, rblock[2]);
  833. *aer = rblock[6];
  834. *aerr = rblock[12];
  835. print_error_data(rblock);
  836. } else if (ret == H_R_STATE) {
  837. pr_err("No error data available: %llX\n", res_handle);
  838. } else
  839. pr_err("Error data could not be fetched: %llX\n", res_handle);
  840. free_page((unsigned long)rblock);
  841. out:
  842. return type;
  843. }