dp_tx_desc.c 15 KB

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