dp_tx_desc.c 15 KB

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