ehea_qmr.c 23 KB

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