dp_tx_desc.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505
  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. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  106. "Multi page alloc fail, tx desc");
  107. goto fail_exit;
  108. }
  109. num_desc_per_page =
  110. tx_desc_pool->desc_pages.num_element_per_page;
  111. tx_desc_pool->freelist = (struct dp_tx_desc_s *)
  112. *tx_desc_pool->desc_pages.cacheable_pages;
  113. if (qdf_mem_multi_page_link(soc->osdev,
  114. &tx_desc_pool->desc_pages,
  115. desc_size, num_elem, true)) {
  116. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  117. "invalid tx desc allocation - overflow num link");
  118. goto free_tx_desc;
  119. }
  120. /* Set unique IDs for each Tx descriptor */
  121. tx_desc_elem = tx_desc_pool->freelist;
  122. count = 0;
  123. pool_id_32 = (uint32_t)pool_id;
  124. while (tx_desc_elem) {
  125. page_id = count / num_desc_per_page;
  126. offset = count % num_desc_per_page;
  127. id = ((pool_id_32 << DP_TX_DESC_ID_POOL_OS) |
  128. (page_id << DP_TX_DESC_ID_PAGE_OS) | offset);
  129. tx_desc_elem->id = id;
  130. tx_desc_elem->pool_id = pool_id;
  131. tx_desc_elem = tx_desc_elem->next;
  132. count++;
  133. }
  134. dp_tx_desc_pool_counter_initialize(tx_desc_pool, num_elem);
  135. TX_DESC_LOCK_CREATE(&tx_desc_pool->lock);
  136. return QDF_STATUS_SUCCESS;
  137. free_tx_desc:
  138. qdf_mem_multi_pages_free(soc->osdev,
  139. &tx_desc_pool->desc_pages, 0, true);
  140. fail_exit:
  141. return QDF_STATUS_E_FAULT;
  142. }
  143. /**
  144. * dp_tx_desc_pool_free() - Free the memory pool allocated for Tx Descriptors
  145. *
  146. * @soc Handle to DP SoC structure
  147. * @pool_id
  148. *
  149. * Return:
  150. */
  151. QDF_STATUS dp_tx_desc_pool_free(struct dp_soc *soc, uint8_t pool_id)
  152. {
  153. struct dp_tx_desc_pool_s *tx_desc_pool =
  154. &((soc)->tx_desc[(pool_id)]);
  155. qdf_mem_multi_pages_free(soc->osdev,
  156. &tx_desc_pool->desc_pages, 0, true);
  157. TX_DESC_LOCK_DESTROY(&tx_desc_pool->lock);
  158. TX_DESC_POOL_MEMBER_CLEAN(tx_desc_pool);
  159. return QDF_STATUS_SUCCESS;
  160. }
  161. /**
  162. * dp_tx_ext_desc_pool_alloc() - Allocate tx ext descriptor pool
  163. * @soc Handle to DP SoC structure
  164. * @pool_id
  165. *
  166. * Return: NONE
  167. */
  168. QDF_STATUS dp_tx_ext_desc_pool_alloc(struct dp_soc *soc, uint8_t pool_id,
  169. uint16_t num_elem)
  170. {
  171. uint16_t num_page;
  172. uint32_t count;
  173. struct dp_tx_ext_desc_elem_s *c_elem, *p_elem;
  174. struct qdf_mem_dma_page_t *page_info;
  175. struct qdf_mem_multi_page_t *pages;
  176. QDF_STATUS status;
  177. qdf_dma_context_t memctx = 0;
  178. /* Coherent tx extension descriptor alloc */
  179. soc->tx_ext_desc[pool_id].elem_size = HAL_TX_EXT_DESC_WITH_META_DATA;
  180. soc->tx_ext_desc[pool_id].elem_count = num_elem;
  181. memctx = qdf_get_dma_mem_context((&soc->tx_ext_desc[pool_id]), memctx);
  182. if (!dp_is_soc_reinit(soc)) {
  183. qdf_mem_multi_pages_alloc(soc->osdev,
  184. &soc->tx_ext_desc[pool_id].
  185. desc_pages,
  186. soc->tx_ext_desc[pool_id].elem_size,
  187. soc->tx_ext_desc[pool_id].elem_count,
  188. memctx, false);
  189. }
  190. if (!soc->tx_ext_desc[pool_id].desc_pages.num_pages) {
  191. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  192. "ext desc page alloc fail");
  193. status = QDF_STATUS_E_NOMEM;
  194. goto fail_exit;
  195. }
  196. num_page = soc->tx_ext_desc[pool_id].desc_pages.num_pages;
  197. /*
  198. * Cacheable ext descriptor link alloc
  199. * This structure also large size already
  200. * single element is 24bytes, 2K elements are 48Kbytes
  201. * Have to alloc multi page cacheable memory
  202. */
  203. soc->tx_ext_desc[pool_id].link_elem_size =
  204. sizeof(struct dp_tx_ext_desc_elem_s);
  205. if (!dp_is_soc_reinit(soc)) {
  206. qdf_mem_multi_pages_alloc(soc->osdev,
  207. &soc->tx_ext_desc[pool_id].
  208. desc_link_pages,
  209. soc->tx_ext_desc[pool_id].
  210. link_elem_size,
  211. soc->tx_ext_desc[pool_id].
  212. elem_count,
  213. 0, true);
  214. }
  215. if (!soc->tx_ext_desc[pool_id].desc_link_pages.num_pages) {
  216. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  217. "ext link desc page alloc fail");
  218. status = QDF_STATUS_E_NOMEM;
  219. goto free_ext_desc_page;
  220. }
  221. /* link tx descriptors into a freelist */
  222. soc->tx_ext_desc[pool_id].freelist = (struct dp_tx_ext_desc_elem_s *)
  223. *soc->tx_ext_desc[pool_id].desc_link_pages.cacheable_pages;
  224. if (qdf_mem_multi_page_link(soc->osdev,
  225. &soc->tx_ext_desc[pool_id].desc_link_pages,
  226. soc->tx_ext_desc[pool_id].link_elem_size,
  227. soc->tx_ext_desc[pool_id].elem_count, true)) {
  228. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  229. "ext link desc page linking fail");
  230. status = QDF_STATUS_E_FAULT;
  231. goto free_ext_link_desc_page;
  232. }
  233. /* Assign coherent memory pointer into linked free list */
  234. pages = &soc->tx_ext_desc[pool_id].desc_pages;
  235. page_info = soc->tx_ext_desc[pool_id].desc_pages.dma_pages;
  236. c_elem = soc->tx_ext_desc[pool_id].freelist;
  237. p_elem = c_elem;
  238. for (count = 0; count < soc->tx_ext_desc[pool_id].elem_count; count++) {
  239. if (!(count % pages->num_element_per_page)) {
  240. /**
  241. * First element for new page,
  242. * should point next page
  243. */
  244. if (!pages->dma_pages->page_v_addr_start) {
  245. QDF_TRACE(QDF_MODULE_ID_DP,
  246. QDF_TRACE_LEVEL_ERROR,
  247. "link over flow");
  248. status = QDF_STATUS_E_FAULT;
  249. goto free_ext_link_desc_page;
  250. }
  251. c_elem->vaddr = (void *)page_info->page_v_addr_start;
  252. c_elem->paddr = page_info->page_p_addr;
  253. page_info++;
  254. } else {
  255. c_elem->vaddr = (void *)(p_elem->vaddr +
  256. soc->tx_ext_desc[pool_id].elem_size);
  257. c_elem->paddr = (p_elem->paddr +
  258. soc->tx_ext_desc[pool_id].elem_size);
  259. }
  260. p_elem = c_elem;
  261. c_elem = c_elem->next;
  262. if (!c_elem)
  263. break;
  264. }
  265. soc->tx_ext_desc[pool_id].num_free = num_elem;
  266. qdf_spinlock_create(&soc->tx_ext_desc[pool_id].lock);
  267. return QDF_STATUS_SUCCESS;
  268. free_ext_link_desc_page:
  269. qdf_mem_multi_pages_free(soc->osdev,
  270. &soc->tx_ext_desc[pool_id].desc_link_pages, 0, true);
  271. free_ext_desc_page:
  272. qdf_mem_multi_pages_free(soc->osdev,
  273. &soc->tx_ext_desc[pool_id].desc_pages,
  274. qdf_get_dma_mem_context((&soc->tx_ext_desc[pool_id]), memctx),
  275. false);
  276. fail_exit:
  277. return status;
  278. }
  279. /**
  280. * dp_tx_ext_desc_pool_free() - free tx ext descriptor pool
  281. * @soc: Handle to DP SoC structure
  282. * @pool_id: extension descriptor pool id
  283. *
  284. * Return: NONE
  285. */
  286. QDF_STATUS dp_tx_ext_desc_pool_free(struct dp_soc *soc, uint8_t pool_id)
  287. {
  288. qdf_mem_multi_pages_free(soc->osdev,
  289. &soc->tx_ext_desc[pool_id].desc_link_pages, 0, true);
  290. qdf_mem_multi_pages_free(soc->osdev,
  291. &soc->tx_ext_desc[pool_id].desc_pages,
  292. qdf_get_dma_mem_context((&soc->tx_ext_desc[pool_id]), memctx),
  293. false);
  294. qdf_spinlock_destroy(&soc->tx_ext_desc[pool_id].lock);
  295. return QDF_STATUS_SUCCESS;
  296. }
  297. /**
  298. * dp_tx_tso_desc_pool_alloc() - allocate tx tso descriptor pool
  299. * @soc: Handle to DP SoC structure
  300. * @pool_id: tso descriptor pool id
  301. * @num_elem: number of element
  302. *
  303. * Return: QDF_STATUS_SUCCESS
  304. */
  305. #if defined(FEATURE_TSO)
  306. QDF_STATUS dp_tx_tso_desc_pool_alloc(struct dp_soc *soc, uint8_t pool_id,
  307. uint16_t num_elem)
  308. {
  309. struct dp_tx_tso_seg_pool_s *tso_desc_pool;
  310. uint32_t desc_size;
  311. tso_desc_pool = &soc->tx_tso_desc[pool_id];
  312. tso_desc_pool->num_free = 0;
  313. desc_size = DP_TX_DESC_SIZE(sizeof(struct qdf_tso_seg_elem_t));
  314. if (!dp_is_soc_reinit(soc))
  315. qdf_mem_multi_pages_alloc(soc->osdev,
  316. &tso_desc_pool->desc_pages,
  317. desc_size,
  318. num_elem, 0, true);
  319. if (!tso_desc_pool->desc_pages.num_pages) {
  320. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  321. FL("Alloc Failed %pK pool_id %d"),
  322. soc, pool_id);
  323. return QDF_STATUS_E_NOMEM;
  324. }
  325. tso_desc_pool->freelist = (struct qdf_tso_seg_elem_t *)
  326. *tso_desc_pool->desc_pages.cacheable_pages;
  327. tso_desc_pool->num_free = num_elem;
  328. if (qdf_mem_multi_page_link(soc->osdev,
  329. &tso_desc_pool->desc_pages,
  330. desc_size,
  331. num_elem, true)) {
  332. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  333. "invalid tso desc allocation - overflow num link");
  334. goto free_tso_desc;
  335. }
  336. TSO_DEBUG("Number of free descriptors: %u\n", tso_desc_pool->num_free);
  337. tso_desc_pool->pool_size = num_elem;
  338. qdf_spinlock_create(&tso_desc_pool->lock);
  339. return QDF_STATUS_SUCCESS;
  340. free_tso_desc:
  341. qdf_mem_multi_pages_free(soc->osdev,
  342. &tso_desc_pool->desc_pages, 0, true);
  343. return QDF_STATUS_E_FAULT;
  344. }
  345. /**
  346. * dp_tx_tso_desc_pool_free() - free tx tso descriptor pool
  347. * @soc: Handle to DP SoC structure
  348. * @pool_id: extension descriptor pool id
  349. *
  350. * Return: NONE
  351. */
  352. void dp_tx_tso_desc_pool_free(struct dp_soc *soc, uint8_t pool_id)
  353. {
  354. struct dp_tx_tso_seg_pool_s *tso_desc_pool;
  355. tso_desc_pool = &soc->tx_tso_desc[pool_id];
  356. qdf_spin_lock_bh(&tso_desc_pool->lock);
  357. qdf_mem_multi_pages_free(soc->osdev,
  358. &tso_desc_pool->desc_pages, 0, true);
  359. tso_desc_pool->freelist = NULL;
  360. tso_desc_pool->num_free = 0;
  361. tso_desc_pool->pool_size = 0;
  362. qdf_spin_unlock_bh(&tso_desc_pool->lock);
  363. qdf_spinlock_destroy(&tso_desc_pool->lock);
  364. return;
  365. }
  366. /**
  367. * dp_tx_tso_num_seg_pool_alloc() - Allocate descriptors that tracks the
  368. * fragments in each tso segment
  369. *
  370. * @soc: handle to dp soc structure
  371. * @pool_id: descriptor pool id
  372. * @num_elem: total number of descriptors to be allocated
  373. */
  374. QDF_STATUS dp_tx_tso_num_seg_pool_alloc(struct dp_soc *soc, uint8_t pool_id,
  375. uint16_t num_elem)
  376. {
  377. struct dp_tx_tso_num_seg_pool_s *tso_num_seg_pool;
  378. uint32_t desc_size;
  379. tso_num_seg_pool = &soc->tx_tso_num_seg[pool_id];
  380. tso_num_seg_pool->num_free = 0;
  381. desc_size = DP_TX_DESC_SIZE(sizeof(struct qdf_tso_num_seg_elem_t));
  382. if (!dp_is_soc_reinit(soc))
  383. qdf_mem_multi_pages_alloc(soc->osdev,
  384. &tso_num_seg_pool->desc_pages,
  385. desc_size,
  386. num_elem, 0, true);
  387. if (!tso_num_seg_pool->desc_pages.num_pages) {
  388. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  389. FL("Alloc Failed %pK pool_id %d"),
  390. soc, pool_id);
  391. return QDF_STATUS_E_NOMEM;
  392. }
  393. if (qdf_mem_multi_page_link(soc->osdev,
  394. &tso_num_seg_pool->desc_pages,
  395. desc_size,
  396. num_elem, true)) {
  397. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  398. "invalid tso desc allocation - overflow num link");
  399. goto fail;
  400. }
  401. tso_num_seg_pool->freelist = (struct qdf_tso_num_seg_elem_t *)
  402. *tso_num_seg_pool->desc_pages.cacheable_pages;
  403. tso_num_seg_pool->num_free = num_elem;
  404. tso_num_seg_pool->num_seg_pool_size = num_elem;
  405. qdf_spinlock_create(&tso_num_seg_pool->lock);
  406. return QDF_STATUS_SUCCESS;
  407. fail:
  408. qdf_mem_multi_pages_free(soc->osdev,
  409. &tso_num_seg_pool->desc_pages, 0, true);
  410. return QDF_STATUS_E_NOMEM;
  411. }
  412. /**
  413. * dp_tx_tso_num_seg_pool_free() - free pool of descriptors that tracks
  414. * the fragments in tso segment
  415. *
  416. *
  417. * @soc: handle to dp soc structure
  418. * @pool_id: descriptor pool_id
  419. */
  420. void dp_tx_tso_num_seg_pool_free(struct dp_soc *soc, uint8_t pool_id)
  421. {
  422. struct dp_tx_tso_num_seg_pool_s *tso_num_seg_pool;
  423. tso_num_seg_pool = &soc->tx_tso_num_seg[pool_id];
  424. qdf_spin_lock_bh(&tso_num_seg_pool->lock);
  425. qdf_mem_multi_pages_free(soc->osdev,
  426. &tso_num_seg_pool->desc_pages, 0, true);
  427. tso_num_seg_pool->freelist = NULL;
  428. tso_num_seg_pool->num_free = 0;
  429. tso_num_seg_pool->num_seg_pool_size = 0;
  430. qdf_spin_unlock_bh(&tso_num_seg_pool->lock);
  431. qdf_spinlock_destroy(&tso_num_seg_pool->lock);
  432. return;
  433. }
  434. #else
  435. QDF_STATUS dp_tx_tso_desc_pool_alloc(struct dp_soc *soc, uint8_t pool_id,
  436. uint16_t num_elem)
  437. {
  438. return QDF_STATUS_SUCCESS;
  439. }
  440. void dp_tx_tso_desc_pool_free(struct dp_soc *soc, uint8_t pool_id)
  441. {
  442. return;
  443. }
  444. QDF_STATUS dp_tx_tso_num_seg_pool_alloc(struct dp_soc *soc, uint8_t pool_id,
  445. uint16_t num_elem)
  446. {
  447. return QDF_STATUS_SUCCESS;
  448. }
  449. void dp_tx_tso_num_seg_pool_free(struct dp_soc *soc, uint8_t pool_id)
  450. {
  451. return;
  452. }
  453. #endif