dp_tx_desc.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503
  1. /*
  2. * Copyright (c) 2016-2019 The Linux Foundation. All rights reserved.
  3. *
  4. * Permission to use, copy, modify, and/or distribute this software for
  5. * any purpose with or without fee is hereby granted, provided that the
  6. * above copyright notice and this permission notice appear in all
  7. * copies.
  8. *
  9. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
  10. * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
  11. * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
  12. * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  13. * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  14. * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
  15. * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
  16. * PERFORMANCE OF THIS SOFTWARE.
  17. */
  18. #include "hal_hw_headers.h"
  19. #include "dp_types.h"
  20. #include "dp_tx_desc.h"
  21. #ifndef DESC_PARTITION
  22. #define DP_TX_DESC_SIZE(a) qdf_get_pwr2(a)
  23. #define DP_TX_DESC_PAGE_DIVIDER(soc, num_desc_per_page, pool_id) \
  24. do { \
  25. uint8_t sig_bit; \
  26. soc->tx_desc[pool_id].offset_filter = num_desc_per_page - 1; \
  27. /* Calculate page divider to find page number */ \
  28. sig_bit = 0; \
  29. while (num_desc_per_page) { \
  30. sig_bit++; \
  31. num_desc_per_page = num_desc_per_page >> 1; \
  32. } \
  33. soc->tx_desc[pool_id].page_divider = (sig_bit - 1); \
  34. } while (0)
  35. #else
  36. #define DP_TX_DESC_SIZE(a) a
  37. #define DP_TX_DESC_PAGE_DIVIDER(soc, num_desc_per_page, pool_id) {}
  38. #endif /* DESC_PARTITION */
  39. /**
  40. * dp_tx_desc_pool_counter_initialize() - Initialize counters
  41. * @tx_desc_pool Handle to DP tx_desc_pool structure
  42. * @num_elem Number of descriptor elements per pool
  43. *
  44. * Return: None
  45. */
  46. #ifdef QCA_LL_TX_FLOW_CONTROL_V2
  47. static void
  48. dp_tx_desc_pool_counter_initialize(struct dp_tx_desc_pool_s *tx_desc_pool,
  49. uint16_t num_elem)
  50. {
  51. }
  52. #else
  53. static void
  54. dp_tx_desc_pool_counter_initialize(struct dp_tx_desc_pool_s *tx_desc_pool,
  55. uint16_t num_elem)
  56. {
  57. tx_desc_pool->num_free = num_elem;
  58. tx_desc_pool->num_allocated = 0;
  59. }
  60. #endif
  61. /**
  62. * dp_tx_desc_pool_alloc() - Allocate Tx Descriptor pool(s)
  63. * @soc Handle to DP SoC structure
  64. * @num_pool Number of pools to allocate
  65. * @num_elem Number of descriptor elements per pool
  66. *
  67. * This function allocates memory for SW tx descriptors
  68. * (used within host for tx data path).
  69. * The number of tx descriptors required will be large
  70. * since based on number of clients (1024 clients x 3 radios),
  71. * outstanding MSDUs stored in TQM queues and LMAC queues will be significantly
  72. * large.
  73. *
  74. * To avoid allocating a large contiguous memory, it uses multi_page_alloc qdf
  75. * function to allocate memory
  76. * in multiple pages. It then iterates through the memory allocated across pages
  77. * and links each descriptor
  78. * to next descriptor, taking care of page boundaries.
  79. *
  80. * Since WiFi 3.0 HW supports multiple Tx rings, multiple pools are allocated,
  81. * one for each ring;
  82. * This minimizes lock contention when hard_start_xmit is called
  83. * from multiple CPUs.
  84. * Alternately, multiple pools can be used for multiple VDEVs for VDEV level
  85. * flow control.
  86. *
  87. * Return: Status code. 0 for success.
  88. */
  89. QDF_STATUS dp_tx_desc_pool_alloc(struct dp_soc *soc, uint8_t pool_id,
  90. uint16_t num_elem)
  91. {
  92. uint32_t id, count, page_id, offset, pool_id_32;
  93. uint16_t num_desc_per_page;
  94. struct dp_tx_desc_s *tx_desc_elem;
  95. uint32_t desc_size;
  96. struct dp_tx_desc_pool_s *tx_desc_pool = &((soc)->tx_desc[(pool_id)]);
  97. desc_size = DP_TX_DESC_SIZE(sizeof(*tx_desc_elem));
  98. tx_desc_pool->elem_size = desc_size;
  99. if (!dp_is_soc_reinit(soc))
  100. qdf_mem_multi_pages_alloc(soc->osdev,
  101. &tx_desc_pool->desc_pages,
  102. desc_size, num_elem,
  103. 0, true);
  104. if (!tx_desc_pool->desc_pages.num_pages) {
  105. dp_err("Multi page alloc fail, tx desc");
  106. goto fail_exit;
  107. }
  108. num_desc_per_page =
  109. tx_desc_pool->desc_pages.num_element_per_page;
  110. tx_desc_pool->freelist = (struct dp_tx_desc_s *)
  111. *tx_desc_pool->desc_pages.cacheable_pages;
  112. if (qdf_mem_multi_page_link(soc->osdev,
  113. &tx_desc_pool->desc_pages,
  114. desc_size, num_elem, true)) {
  115. dp_err("invalid tx desc allocation - overflow num link");
  116. goto free_tx_desc;
  117. }
  118. /* Set unique IDs for each Tx descriptor */
  119. tx_desc_elem = tx_desc_pool->freelist;
  120. count = 0;
  121. pool_id_32 = (uint32_t)pool_id;
  122. while (tx_desc_elem) {
  123. page_id = count / num_desc_per_page;
  124. offset = count % num_desc_per_page;
  125. id = ((pool_id_32 << DP_TX_DESC_ID_POOL_OS) |
  126. (page_id << DP_TX_DESC_ID_PAGE_OS) | offset);
  127. tx_desc_elem->id = id;
  128. tx_desc_elem->pool_id = pool_id;
  129. tx_desc_elem = tx_desc_elem->next;
  130. count++;
  131. }
  132. dp_tx_desc_pool_counter_initialize(tx_desc_pool, num_elem);
  133. TX_DESC_LOCK_CREATE(&tx_desc_pool->lock);
  134. return QDF_STATUS_SUCCESS;
  135. free_tx_desc:
  136. qdf_mem_multi_pages_free(soc->osdev,
  137. &tx_desc_pool->desc_pages, 0, true);
  138. fail_exit:
  139. return QDF_STATUS_E_FAULT;
  140. }
  141. /**
  142. * dp_tx_desc_pool_free() - Free the memory pool allocated for Tx Descriptors
  143. *
  144. * @soc Handle to DP SoC structure
  145. * @pool_id
  146. *
  147. * Return:
  148. */
  149. QDF_STATUS dp_tx_desc_pool_free(struct dp_soc *soc, uint8_t pool_id)
  150. {
  151. struct dp_tx_desc_pool_s *tx_desc_pool =
  152. &((soc)->tx_desc[(pool_id)]);
  153. qdf_mem_multi_pages_free(soc->osdev,
  154. &tx_desc_pool->desc_pages, 0, true);
  155. TX_DESC_LOCK_DESTROY(&tx_desc_pool->lock);
  156. TX_DESC_POOL_MEMBER_CLEAN(tx_desc_pool);
  157. return QDF_STATUS_SUCCESS;
  158. }
  159. /**
  160. * dp_tx_ext_desc_pool_alloc() - Allocate tx ext descriptor pool
  161. * @soc Handle to DP SoC structure
  162. * @pool_id
  163. *
  164. * Return: NONE
  165. */
  166. QDF_STATUS dp_tx_ext_desc_pool_alloc(struct dp_soc *soc, uint8_t pool_id,
  167. uint16_t num_elem)
  168. {
  169. uint16_t num_page;
  170. uint32_t count;
  171. struct dp_tx_ext_desc_elem_s *c_elem, *p_elem;
  172. struct qdf_mem_dma_page_t *page_info;
  173. struct qdf_mem_multi_page_t *pages;
  174. QDF_STATUS status;
  175. qdf_dma_context_t memctx = 0;
  176. /* Coherent tx extension descriptor alloc */
  177. soc->tx_ext_desc[pool_id].elem_size = HAL_TX_EXT_DESC_WITH_META_DATA;
  178. soc->tx_ext_desc[pool_id].elem_count = num_elem;
  179. memctx = qdf_get_dma_mem_context((&soc->tx_ext_desc[pool_id]), memctx);
  180. if (!dp_is_soc_reinit(soc)) {
  181. qdf_mem_multi_pages_alloc(soc->osdev,
  182. &soc->tx_ext_desc[pool_id].
  183. desc_pages,
  184. soc->tx_ext_desc[pool_id].elem_size,
  185. soc->tx_ext_desc[pool_id].elem_count,
  186. memctx, false);
  187. }
  188. if (!soc->tx_ext_desc[pool_id].desc_pages.num_pages) {
  189. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  190. "ext desc page alloc fail");
  191. status = QDF_STATUS_E_NOMEM;
  192. goto fail_exit;
  193. }
  194. num_page = soc->tx_ext_desc[pool_id].desc_pages.num_pages;
  195. /*
  196. * Cacheable ext descriptor link alloc
  197. * This structure also large size already
  198. * single element is 24bytes, 2K elements are 48Kbytes
  199. * Have to alloc multi page cacheable memory
  200. */
  201. soc->tx_ext_desc[pool_id].link_elem_size =
  202. sizeof(struct dp_tx_ext_desc_elem_s);
  203. if (!dp_is_soc_reinit(soc)) {
  204. qdf_mem_multi_pages_alloc(soc->osdev,
  205. &soc->tx_ext_desc[pool_id].
  206. desc_link_pages,
  207. soc->tx_ext_desc[pool_id].
  208. link_elem_size,
  209. soc->tx_ext_desc[pool_id].
  210. elem_count,
  211. 0, true);
  212. }
  213. if (!soc->tx_ext_desc[pool_id].desc_link_pages.num_pages) {
  214. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  215. "ext link desc page alloc fail");
  216. status = QDF_STATUS_E_NOMEM;
  217. goto free_ext_desc_page;
  218. }
  219. /* link tx descriptors into a freelist */
  220. soc->tx_ext_desc[pool_id].freelist = (struct dp_tx_ext_desc_elem_s *)
  221. *soc->tx_ext_desc[pool_id].desc_link_pages.cacheable_pages;
  222. if (qdf_mem_multi_page_link(soc->osdev,
  223. &soc->tx_ext_desc[pool_id].desc_link_pages,
  224. soc->tx_ext_desc[pool_id].link_elem_size,
  225. soc->tx_ext_desc[pool_id].elem_count, true)) {
  226. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  227. "ext link desc page linking fail");
  228. status = QDF_STATUS_E_FAULT;
  229. goto free_ext_link_desc_page;
  230. }
  231. /* Assign coherent memory pointer into linked free list */
  232. pages = &soc->tx_ext_desc[pool_id].desc_pages;
  233. page_info = soc->tx_ext_desc[pool_id].desc_pages.dma_pages;
  234. c_elem = soc->tx_ext_desc[pool_id].freelist;
  235. p_elem = c_elem;
  236. for (count = 0; count < soc->tx_ext_desc[pool_id].elem_count; count++) {
  237. if (!(count % pages->num_element_per_page)) {
  238. /**
  239. * First element for new page,
  240. * should point next page
  241. */
  242. if (!pages->dma_pages->page_v_addr_start) {
  243. QDF_TRACE(QDF_MODULE_ID_DP,
  244. QDF_TRACE_LEVEL_ERROR,
  245. "link over flow");
  246. status = QDF_STATUS_E_FAULT;
  247. goto free_ext_link_desc_page;
  248. }
  249. c_elem->vaddr = (void *)page_info->page_v_addr_start;
  250. c_elem->paddr = page_info->page_p_addr;
  251. page_info++;
  252. } else {
  253. c_elem->vaddr = (void *)(p_elem->vaddr +
  254. soc->tx_ext_desc[pool_id].elem_size);
  255. c_elem->paddr = (p_elem->paddr +
  256. soc->tx_ext_desc[pool_id].elem_size);
  257. }
  258. p_elem = c_elem;
  259. c_elem = c_elem->next;
  260. if (!c_elem)
  261. break;
  262. }
  263. soc->tx_ext_desc[pool_id].num_free = num_elem;
  264. qdf_spinlock_create(&soc->tx_ext_desc[pool_id].lock);
  265. return QDF_STATUS_SUCCESS;
  266. free_ext_link_desc_page:
  267. qdf_mem_multi_pages_free(soc->osdev,
  268. &soc->tx_ext_desc[pool_id].desc_link_pages, 0, true);
  269. free_ext_desc_page:
  270. qdf_mem_multi_pages_free(soc->osdev,
  271. &soc->tx_ext_desc[pool_id].desc_pages,
  272. qdf_get_dma_mem_context((&soc->tx_ext_desc[pool_id]), memctx),
  273. false);
  274. fail_exit:
  275. return status;
  276. }
  277. /**
  278. * dp_tx_ext_desc_pool_free() - free tx ext descriptor pool
  279. * @soc: Handle to DP SoC structure
  280. * @pool_id: extension descriptor pool id
  281. *
  282. * Return: NONE
  283. */
  284. QDF_STATUS dp_tx_ext_desc_pool_free(struct dp_soc *soc, uint8_t pool_id)
  285. {
  286. qdf_mem_multi_pages_free(soc->osdev,
  287. &soc->tx_ext_desc[pool_id].desc_link_pages, 0, true);
  288. qdf_mem_multi_pages_free(soc->osdev,
  289. &soc->tx_ext_desc[pool_id].desc_pages,
  290. qdf_get_dma_mem_context((&soc->tx_ext_desc[pool_id]), memctx),
  291. false);
  292. qdf_spinlock_destroy(&soc->tx_ext_desc[pool_id].lock);
  293. return QDF_STATUS_SUCCESS;
  294. }
  295. /**
  296. * dp_tx_tso_desc_pool_alloc() - allocate tx tso descriptor pool
  297. * @soc: Handle to DP SoC structure
  298. * @pool_id: tso descriptor pool id
  299. * @num_elem: number of element
  300. *
  301. * Return: QDF_STATUS_SUCCESS
  302. */
  303. #if defined(FEATURE_TSO)
  304. QDF_STATUS dp_tx_tso_desc_pool_alloc(struct dp_soc *soc, uint8_t pool_id,
  305. uint16_t num_elem)
  306. {
  307. struct dp_tx_tso_seg_pool_s *tso_desc_pool;
  308. uint32_t desc_size;
  309. tso_desc_pool = &soc->tx_tso_desc[pool_id];
  310. tso_desc_pool->num_free = 0;
  311. desc_size = DP_TX_DESC_SIZE(sizeof(struct qdf_tso_seg_elem_t));
  312. if (!dp_is_soc_reinit(soc))
  313. qdf_mem_multi_pages_alloc(soc->osdev,
  314. &tso_desc_pool->desc_pages,
  315. desc_size,
  316. num_elem, 0, true);
  317. if (!tso_desc_pool->desc_pages.num_pages) {
  318. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  319. FL("Alloc Failed %pK pool_id %d"),
  320. soc, pool_id);
  321. return QDF_STATUS_E_NOMEM;
  322. }
  323. tso_desc_pool->freelist = (struct qdf_tso_seg_elem_t *)
  324. *tso_desc_pool->desc_pages.cacheable_pages;
  325. tso_desc_pool->num_free = num_elem;
  326. if (qdf_mem_multi_page_link(soc->osdev,
  327. &tso_desc_pool->desc_pages,
  328. desc_size,
  329. num_elem, true)) {
  330. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  331. "invalid tso desc allocation - overflow num link");
  332. goto free_tso_desc;
  333. }
  334. TSO_DEBUG("Number of free descriptors: %u\n", tso_desc_pool->num_free);
  335. tso_desc_pool->pool_size = num_elem;
  336. qdf_spinlock_create(&tso_desc_pool->lock);
  337. return QDF_STATUS_SUCCESS;
  338. free_tso_desc:
  339. qdf_mem_multi_pages_free(soc->osdev,
  340. &tso_desc_pool->desc_pages, 0, true);
  341. return QDF_STATUS_E_FAULT;
  342. }
  343. /**
  344. * dp_tx_tso_desc_pool_free() - free tx tso descriptor pool
  345. * @soc: Handle to DP SoC structure
  346. * @pool_id: extension descriptor pool id
  347. *
  348. * Return: NONE
  349. */
  350. void dp_tx_tso_desc_pool_free(struct dp_soc *soc, uint8_t pool_id)
  351. {
  352. struct dp_tx_tso_seg_pool_s *tso_desc_pool;
  353. tso_desc_pool = &soc->tx_tso_desc[pool_id];
  354. qdf_spin_lock_bh(&tso_desc_pool->lock);
  355. qdf_mem_multi_pages_free(soc->osdev,
  356. &tso_desc_pool->desc_pages, 0, true);
  357. tso_desc_pool->freelist = NULL;
  358. tso_desc_pool->num_free = 0;
  359. tso_desc_pool->pool_size = 0;
  360. qdf_spin_unlock_bh(&tso_desc_pool->lock);
  361. qdf_spinlock_destroy(&tso_desc_pool->lock);
  362. return;
  363. }
  364. /**
  365. * dp_tx_tso_num_seg_pool_alloc() - Allocate descriptors that tracks the
  366. * fragments in each tso segment
  367. *
  368. * @soc: handle to dp soc structure
  369. * @pool_id: descriptor pool id
  370. * @num_elem: total number of descriptors to be allocated
  371. */
  372. QDF_STATUS dp_tx_tso_num_seg_pool_alloc(struct dp_soc *soc, uint8_t pool_id,
  373. uint16_t num_elem)
  374. {
  375. struct dp_tx_tso_num_seg_pool_s *tso_num_seg_pool;
  376. uint32_t desc_size;
  377. tso_num_seg_pool = &soc->tx_tso_num_seg[pool_id];
  378. tso_num_seg_pool->num_free = 0;
  379. desc_size = DP_TX_DESC_SIZE(sizeof(struct qdf_tso_num_seg_elem_t));
  380. if (!dp_is_soc_reinit(soc))
  381. qdf_mem_multi_pages_alloc(soc->osdev,
  382. &tso_num_seg_pool->desc_pages,
  383. desc_size,
  384. num_elem, 0, true);
  385. if (!tso_num_seg_pool->desc_pages.num_pages) {
  386. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  387. FL("Alloc Failed %pK pool_id %d"),
  388. soc, pool_id);
  389. return QDF_STATUS_E_NOMEM;
  390. }
  391. if (qdf_mem_multi_page_link(soc->osdev,
  392. &tso_num_seg_pool->desc_pages,
  393. desc_size,
  394. num_elem, true)) {
  395. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  396. "invalid tso desc allocation - overflow num link");
  397. goto fail;
  398. }
  399. tso_num_seg_pool->freelist = (struct qdf_tso_num_seg_elem_t *)
  400. *tso_num_seg_pool->desc_pages.cacheable_pages;
  401. tso_num_seg_pool->num_free = num_elem;
  402. tso_num_seg_pool->num_seg_pool_size = num_elem;
  403. qdf_spinlock_create(&tso_num_seg_pool->lock);
  404. return QDF_STATUS_SUCCESS;
  405. fail:
  406. qdf_mem_multi_pages_free(soc->osdev,
  407. &tso_num_seg_pool->desc_pages, 0, true);
  408. return QDF_STATUS_E_NOMEM;
  409. }
  410. /**
  411. * dp_tx_tso_num_seg_pool_free() - free pool of descriptors that tracks
  412. * the fragments in tso segment
  413. *
  414. *
  415. * @soc: handle to dp soc structure
  416. * @pool_id: descriptor pool_id
  417. */
  418. void dp_tx_tso_num_seg_pool_free(struct dp_soc *soc, uint8_t pool_id)
  419. {
  420. struct dp_tx_tso_num_seg_pool_s *tso_num_seg_pool;
  421. tso_num_seg_pool = &soc->tx_tso_num_seg[pool_id];
  422. qdf_spin_lock_bh(&tso_num_seg_pool->lock);
  423. qdf_mem_multi_pages_free(soc->osdev,
  424. &tso_num_seg_pool->desc_pages, 0, true);
  425. tso_num_seg_pool->freelist = NULL;
  426. tso_num_seg_pool->num_free = 0;
  427. tso_num_seg_pool->num_seg_pool_size = 0;
  428. qdf_spin_unlock_bh(&tso_num_seg_pool->lock);
  429. qdf_spinlock_destroy(&tso_num_seg_pool->lock);
  430. return;
  431. }
  432. #else
  433. QDF_STATUS dp_tx_tso_desc_pool_alloc(struct dp_soc *soc, uint8_t pool_id,
  434. uint16_t num_elem)
  435. {
  436. return QDF_STATUS_SUCCESS;
  437. }
  438. void dp_tx_tso_desc_pool_free(struct dp_soc *soc, uint8_t pool_id)
  439. {
  440. return;
  441. }
  442. QDF_STATUS dp_tx_tso_num_seg_pool_alloc(struct dp_soc *soc, uint8_t pool_id,
  443. uint16_t num_elem)
  444. {
  445. return QDF_STATUS_SUCCESS;
  446. }
  447. void dp_tx_tso_num_seg_pool_free(struct dp_soc *soc, uint8_t pool_id)
  448. {
  449. return;
  450. }
  451. #endif