1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright(C) 2021 Marvell.
9 nix_tm_shaper2regval(struct nix_tm_shaper_data *shaper)
13 if (roc_model_is_cn9k()) {
14 regval = (shaper->burst_exponent << 37);
15 regval |= (shaper->burst_mantissa << 29);
16 regval |= (shaper->div_exp << 13);
17 regval |= (shaper->exponent << 9);
18 regval |= (shaper->mantissa << 1);
22 regval = (shaper->burst_exponent << 44);
23 regval |= (shaper->burst_mantissa << 29);
24 regval |= (shaper->div_exp << 13);
25 regval |= (shaper->exponent << 9);
26 regval |= (shaper->mantissa << 1);
31 nix_tm_lvl2nix_tl1_root(uint32_t lvl)
35 return NIX_TXSCH_LVL_TL1;
37 return NIX_TXSCH_LVL_TL2;
39 return NIX_TXSCH_LVL_TL3;
41 return NIX_TXSCH_LVL_TL4;
43 return NIX_TXSCH_LVL_SMQ;
45 return NIX_TXSCH_LVL_CNT;
50 nix_tm_lvl2nix_tl2_root(uint32_t lvl)
54 return NIX_TXSCH_LVL_TL2;
56 return NIX_TXSCH_LVL_TL3;
58 return NIX_TXSCH_LVL_TL4;
60 return NIX_TXSCH_LVL_SMQ;
62 return NIX_TXSCH_LVL_CNT;
67 nix_tm_lvl2nix(struct nix *nix, uint32_t lvl)
69 if (nix_tm_have_tl1_access(nix))
70 return nix_tm_lvl2nix_tl1_root(lvl);
72 return nix_tm_lvl2nix_tl2_root(lvl);
76 nix_tm_relchan_get(struct nix *nix)
78 return nix->tx_chan_base & 0xff;
82 nix_tm_find_prio_anchor(struct nix *nix, uint32_t node_id,
83 enum roc_nix_tm_tree tree)
85 struct nix_tm_node *child_node;
86 struct nix_tm_node_list *list;
88 list = nix_tm_node_list(nix, tree);
90 TAILQ_FOREACH(child_node, list, node) {
91 if (!child_node->parent)
93 if (!(child_node->parent->id == node_id))
95 if (child_node->priority == child_node->parent->rr_prio)
97 return child_node->hw_id - child_node->priority;
102 struct nix_tm_shaper_profile *
103 nix_tm_shaper_profile_search(struct nix *nix, uint32_t id)
105 struct nix_tm_shaper_profile *profile;
107 TAILQ_FOREACH(profile, &nix->shaper_profile_list, shaper) {
108 if (profile->id == id)
115 nix_tm_node_search(struct nix *nix, uint32_t node_id, enum roc_nix_tm_tree tree)
117 struct nix_tm_node_list *list;
118 struct nix_tm_node *node;
120 list = nix_tm_node_list(nix, tree);
121 TAILQ_FOREACH(node, list, node) {
122 if (node->id == node_id)
129 nix_tm_shaper_rate_conv_floor(uint64_t value, uint64_t *exponent_p,
130 uint64_t *mantissa_p, uint64_t *div_exp_p)
132 uint64_t div_exp, exponent, mantissa;
134 /* Boundary checks */
135 if (value < NIX_TM_MIN_SHAPER_RATE || value > NIX_TM_MAX_SHAPER_RATE)
138 if (value <= NIX_TM_SHAPER_RATE(0, 0, 0)) {
139 /* Calculate rate div_exp and mantissa using
140 * the following formula:
142 * value = (2E6 * (256 + mantissa)
143 * / ((1 << div_exp) * 256))
147 mantissa = NIX_TM_MAX_RATE_MANTISSA;
149 while (value <= (NIX_TM_SHAPER_RATE_CONST / (1 << div_exp)))
152 while (value <= ((NIX_TM_SHAPER_RATE_CONST * (256 + mantissa)) /
153 ((1 << div_exp) * 256)))
156 /* Calculate rate exponent and mantissa using
157 * the following formula:
159 * value = (2E6 * ((256 + mantissa) << exponent)) / 256
163 exponent = NIX_TM_MAX_RATE_EXPONENT;
164 mantissa = NIX_TM_MAX_RATE_MANTISSA;
166 while (value <= (NIX_TM_SHAPER_RATE_CONST * (1 << exponent)))
169 while (value <= ((NIX_TM_SHAPER_RATE_CONST *
170 ((256 + mantissa) << exponent)) /
175 if (div_exp > NIX_TM_MAX_RATE_DIV_EXP ||
176 exponent > NIX_TM_MAX_RATE_EXPONENT ||
177 mantissa > NIX_TM_MAX_RATE_MANTISSA)
181 *div_exp_p = div_exp;
183 *exponent_p = exponent;
185 *mantissa_p = mantissa;
187 /* Calculate real rate value */
188 return NIX_TM_SHAPER_RATE(exponent, mantissa, div_exp);
192 nix_tm_shaper_rate_conv_exact(uint64_t value, uint64_t *exponent_p,
193 uint64_t *mantissa_p, uint64_t *div_exp_p)
195 uint64_t div_exp, exponent, mantissa;
197 /* Boundary checks */
198 if (value < NIX_TM_MIN_SHAPER_RATE || value > NIX_TM_MAX_SHAPER_RATE)
201 if (value <= NIX_TM_SHAPER_RATE(0, 0, 0)) {
202 /* Calculate rate div_exp and mantissa using
203 * the following formula:
205 * value = (2E6 * (256 + mantissa)
206 * / ((1 << div_exp) * 256))
210 mantissa = NIX_TM_MAX_RATE_MANTISSA;
212 while (value < (NIX_TM_SHAPER_RATE_CONST / (1 << div_exp)))
215 while (value < ((NIX_TM_SHAPER_RATE_CONST * (256 + mantissa)) /
216 ((1 << div_exp) * 256)))
219 /* Calculate rate exponent and mantissa using
220 * the following formula:
222 * value = (2E6 * ((256 + mantissa) << exponent)) / 256
226 exponent = NIX_TM_MAX_RATE_EXPONENT;
227 mantissa = NIX_TM_MAX_RATE_MANTISSA;
229 while (value < (NIX_TM_SHAPER_RATE_CONST * (1 << exponent)))
232 while (value < ((NIX_TM_SHAPER_RATE_CONST *
233 ((256 + mantissa) << exponent)) /
238 if (div_exp > NIX_TM_MAX_RATE_DIV_EXP ||
239 exponent > NIX_TM_MAX_RATE_EXPONENT ||
240 mantissa > NIX_TM_MAX_RATE_MANTISSA)
244 *div_exp_p = div_exp;
246 *exponent_p = exponent;
248 *mantissa_p = mantissa;
250 /* Calculate real rate value */
251 return NIX_TM_SHAPER_RATE(exponent, mantissa, div_exp);
254 /* With zero accuracy we will tune parameters as defined by HW,
255 * non zero accuracy will keep the parameters close to lower values
256 * and make sure long-term shaper rate will not exceed the requested rate.
259 nix_tm_shaper_rate_conv(uint64_t value, uint64_t *exponent_p,
260 uint64_t *mantissa_p, uint64_t *div_exp_p,
264 return nix_tm_shaper_rate_conv_exact(value, exponent_p,
265 mantissa_p, div_exp_p);
267 return nix_tm_shaper_rate_conv_floor(value, exponent_p, mantissa_p,
272 nix_tm_shaper_burst_conv(uint64_t value, uint64_t *exponent_p,
273 uint64_t *mantissa_p)
275 uint64_t min_burst, max_burst;
276 uint64_t exponent, mantissa;
277 uint32_t max_mantissa;
279 min_burst = NIX_TM_MIN_SHAPER_BURST;
280 max_burst = roc_nix_tm_max_shaper_burst_get();
282 if (value < min_burst || value > max_burst)
285 max_mantissa = (roc_model_is_cn9k() ? NIX_CN9K_TM_MAX_BURST_MANTISSA :
286 NIX_TM_MAX_BURST_MANTISSA);
287 /* Calculate burst exponent and mantissa using
288 * the following formula:
290 * value = (((256 + mantissa) << (exponent + 1) / 256)
293 exponent = NIX_TM_MAX_BURST_EXPONENT;
294 mantissa = max_mantissa;
296 while (value < (1ull << (exponent + 1)))
299 while (value < ((256 + mantissa) << (exponent + 1)) / 256)
302 if (exponent > NIX_TM_MAX_BURST_EXPONENT || mantissa > max_mantissa)
306 *exponent_p = exponent;
308 *mantissa_p = mantissa;
310 return NIX_TM_SHAPER_BURST(exponent, mantissa);
314 nix_tm_shaper_conf_get(struct nix_tm_shaper_profile *profile,
315 struct nix_tm_shaper_data *cir,
316 struct nix_tm_shaper_data *pir)
318 memset(cir, 0, sizeof(*cir));
319 memset(pir, 0, sizeof(*pir));
324 /* Calculate CIR exponent and mantissa */
325 if (profile->commit.rate)
326 cir->rate = nix_tm_shaper_rate_conv(
327 profile->commit.rate, &cir->exponent, &cir->mantissa,
328 &cir->div_exp, profile->accuracy);
330 /* Calculate PIR exponent and mantissa */
331 if (profile->peak.rate)
332 pir->rate = nix_tm_shaper_rate_conv(
333 profile->peak.rate, &pir->exponent, &pir->mantissa,
334 &pir->div_exp, profile->accuracy);
336 /* Calculate CIR burst exponent and mantissa */
337 if (profile->commit.size)
338 cir->burst = nix_tm_shaper_burst_conv(profile->commit.size,
339 &cir->burst_exponent,
340 &cir->burst_mantissa);
342 /* Calculate PIR burst exponent and mantissa */
343 if (profile->peak.size)
344 pir->burst = nix_tm_shaper_burst_conv(profile->peak.size,
345 &pir->burst_exponent,
346 &pir->burst_mantissa);
350 nix_tm_check_rr(struct nix *nix, uint32_t parent_id, enum roc_nix_tm_tree tree,
351 uint32_t *rr_prio, uint32_t *max_prio)
353 uint32_t node_cnt[NIX_TM_TLX_SP_PRIO_MAX];
354 struct nix_tm_node_list *list;
355 struct nix_tm_node *node;
356 uint32_t rr_num = 0, i;
357 uint32_t children = 0;
360 memset(node_cnt, 0, sizeof(node_cnt));
362 *max_prio = UINT32_MAX;
364 list = nix_tm_node_list(nix, tree);
365 TAILQ_FOREACH(node, list, node) {
369 if (!(node->parent->id == parent_id))
372 priority = node->priority;
373 node_cnt[priority]++;
377 for (i = 0; i < NIX_TM_TLX_SP_PRIO_MAX; i++) {
381 if (node_cnt[i] > rr_num) {
383 rr_num = node_cnt[i];
387 /* RR group of single RR child is considered as SP */
393 /* Max prio will be returned only when we have non zero prio
394 * or if a parent has single child.
396 if (i > 1 || (children == 1))
402 nix_tm_max_prio(struct nix *nix, uint16_t hw_lvl)
404 if (hw_lvl >= NIX_TXSCH_LVL_CNT)
407 /* MDQ does not support SP */
408 if (hw_lvl == NIX_TXSCH_LVL_MDQ)
411 /* PF's TL1 with VF's enabled does not support SP */
412 if (hw_lvl == NIX_TXSCH_LVL_TL1 && (!nix_tm_have_tl1_access(nix) ||
413 (nix->tm_flags & NIX_TM_TL1_NO_SP)))
416 return NIX_TM_TLX_SP_PRIO_MAX - 1;
420 nix_tm_validate_prio(struct nix *nix, uint32_t lvl, uint32_t parent_id,
421 uint32_t priority, enum roc_nix_tm_tree tree)
423 uint8_t priorities[NIX_TM_TLX_SP_PRIO_MAX];
424 struct nix_tm_node_list *list;
425 struct nix_tm_node *node;
429 list = nix_tm_node_list(nix, tree);
430 /* Validate priority against max */
431 if (priority > nix_tm_max_prio(nix, nix_tm_lvl2nix(nix, lvl - 1)))
432 return NIX_ERR_TM_PRIO_EXCEEDED;
434 if (parent_id == ROC_NIX_TM_NODE_ID_INVALID)
437 memset(priorities, 0, sizeof(priorities));
438 priorities[priority] = 1;
440 TAILQ_FOREACH(node, list, node) {
444 if (node->parent->id != parent_id)
447 priorities[node->priority]++;
450 for (i = 0; i < NIX_TM_TLX_SP_PRIO_MAX; i++)
451 if (priorities[i] > 1)
454 /* At max, one rr groups per parent */
456 return NIX_ERR_TM_MULTIPLE_RR_GROUPS;
458 /* Check for previous priority to avoid holes in priorities */
459 if (priority && !priorities[priority - 1])
460 return NIX_ERR_TM_PRIO_ORDER;
466 nix_tm_child_res_valid(struct nix_tm_node_list *list,
467 struct nix_tm_node *parent)
469 struct nix_tm_node *child;
471 TAILQ_FOREACH(child, list, node) {
472 if (child->parent != parent)
474 if (!(child->flags & NIX_TM_NODE_HWRES))
481 nix_tm_tl1_default_prep(struct nix *nix, uint32_t schq, volatile uint64_t *reg,
482 volatile uint64_t *regval)
487 * Default config for TL1.
488 * For VF this is always ignored.
490 plt_tm_dbg("Default config for main root %s(%u)",
491 nix_tm_hwlvl2str(NIX_TXSCH_LVL_TL1), schq);
493 /* Set DWRR quantum */
494 reg[k] = NIX_AF_TL1X_SCHEDULE(schq);
495 regval[k] = NIX_TM_TL1_DFLT_RR_QTM;
498 reg[k] = NIX_AF_TL1X_TOPOLOGY(schq);
499 regval[k] = (nix->tm_aggr_lvl_rr_prio << 1);
502 reg[k] = NIX_AF_TL1X_CIR(schq);
510 nix_tm_topology_reg_prep(struct nix *nix, struct nix_tm_node *node,
511 volatile uint64_t *reg, volatile uint64_t *regval,
512 volatile uint64_t *regval_mask)
514 struct roc_nix *roc_nix = nix_priv_to_roc_nix(nix);
515 uint8_t k = 0, hw_lvl, parent_lvl;
516 uint64_t parent = 0, child = 0;
517 enum roc_nix_tm_tree tree;
518 uint32_t rr_prio, schq;
519 uint16_t link, relchan;
523 hw_lvl = node->hw_lvl;
524 parent_lvl = hw_lvl + 1;
525 rr_prio = node->rr_prio;
527 /* Root node will not have a parent node */
528 if (hw_lvl == nix->tm_root_lvl)
529 parent = node->parent_hw_id;
531 parent = node->parent->hw_id;
534 relchan = nix_tm_relchan_get(nix);
536 if (hw_lvl != NIX_TXSCH_LVL_SMQ)
537 child = nix_tm_find_prio_anchor(nix, node->id, tree);
539 /* Override default rr_prio when TL1
540 * Static Priority is disabled
542 if (hw_lvl == NIX_TXSCH_LVL_TL1 && nix->tm_flags & NIX_TM_TL1_NO_SP) {
543 rr_prio = nix->tm_aggr_lvl_rr_prio;
547 plt_tm_dbg("Topology config node %s(%u)->%s(%" PRIu64 ") lvl %u, id %u"
548 " prio_anchor %" PRIu64 " rr_prio %u (%p)",
549 nix_tm_hwlvl2str(hw_lvl), schq, nix_tm_hwlvl2str(parent_lvl),
550 parent, node->lvl, node->id, child, rr_prio, node);
552 /* Prepare Topology and Link config */
554 case NIX_TXSCH_LVL_SMQ:
556 /* Set xoff which will be cleared later */
557 reg[k] = NIX_AF_SMQX_CFG(schq);
558 regval[k] = (BIT_ULL(50) | NIX_MIN_HW_FRS |
559 ((nix->mtu & 0xFFFF) << 8));
560 /* Maximum Vtag insertion size as a multiple of four bytes */
561 if (roc_nix->hw_vlan_ins)
562 regval[k] |= (0x2ULL << 36);
563 regval_mask[k] = ~(BIT_ULL(50) | GENMASK_ULL(6, 0) |
564 GENMASK_ULL(23, 8) | GENMASK_ULL(38, 36));
567 /* Parent and schedule conf */
568 reg[k] = NIX_AF_MDQX_PARENT(schq);
569 regval[k] = parent << 16;
573 case NIX_TXSCH_LVL_TL4:
574 /* Parent and schedule conf */
575 reg[k] = NIX_AF_TL4X_PARENT(schq);
576 regval[k] = parent << 16;
579 reg[k] = NIX_AF_TL4X_TOPOLOGY(schq);
580 regval[k] = (child << 32) | (rr_prio << 1);
583 /* Configure TL4 to send to SDP channel instead of CGX/LBK */
585 reg[k] = NIX_AF_TL4X_SDP_LINK_CFG(schq);
586 regval[k] = BIT_ULL(12);
590 case NIX_TXSCH_LVL_TL3:
591 /* Parent and schedule conf */
592 reg[k] = NIX_AF_TL3X_PARENT(schq);
593 regval[k] = parent << 16;
596 reg[k] = NIX_AF_TL3X_TOPOLOGY(schq);
597 regval[k] = (child << 32) | (rr_prio << 1);
600 /* Link configuration */
601 if (!nix->sdp_link &&
602 nix->tm_link_cfg_lvl == NIX_TXSCH_LVL_TL3) {
603 reg[k] = NIX_AF_TL3_TL2X_LINKX_CFG(schq, link);
604 regval[k] = BIT_ULL(12) | relchan;
605 /* Enable BP if node is BP capable and rx_pause is set
607 if (nix->rx_pause && node->bp_capa)
608 regval[k] |= BIT_ULL(13);
613 case NIX_TXSCH_LVL_TL2:
614 /* Parent and schedule conf */
615 reg[k] = NIX_AF_TL2X_PARENT(schq);
616 regval[k] = parent << 16;
619 reg[k] = NIX_AF_TL2X_TOPOLOGY(schq);
620 regval[k] = (child << 32) | (rr_prio << 1);
623 /* Link configuration */
624 if (!nix->sdp_link &&
625 nix->tm_link_cfg_lvl == NIX_TXSCH_LVL_TL2) {
626 reg[k] = NIX_AF_TL3_TL2X_LINKX_CFG(schq, link);
627 regval[k] = BIT_ULL(12) | relchan;
628 /* Enable BP if node is BP capable and rx_pause is set
630 if (nix->rx_pause && node->bp_capa)
631 regval[k] |= BIT_ULL(13);
636 case NIX_TXSCH_LVL_TL1:
637 reg[k] = NIX_AF_TL1X_TOPOLOGY(schq);
638 regval[k] = (child << 32) | (rr_prio << 1 /*RR_PRIO*/);
648 nix_tm_sched_reg_prep(struct nix *nix, struct nix_tm_node *node,
649 volatile uint64_t *reg, volatile uint64_t *regval)
651 uint64_t strict_prio = node->priority;
652 uint32_t hw_lvl = node->hw_lvl;
653 uint32_t schq = node->hw_id;
657 /* For CN9K, weight needs to be converted to quantum */
658 rr_quantum = nix_tm_weight_to_rr_quantum(node->weight);
660 /* For children to root, strict prio is default if either
661 * device root is TL2 or TL1 Static Priority is disabled.
663 if (hw_lvl == NIX_TXSCH_LVL_TL2 &&
664 (!nix_tm_have_tl1_access(nix) || nix->tm_flags & NIX_TM_TL1_NO_SP))
665 strict_prio = nix->tm_aggr_lvl_rr_prio;
667 plt_tm_dbg("Schedule config node %s(%u) lvl %u id %u, "
668 "prio 0x%" PRIx64 ", rr_quantum/rr_wt 0x%" PRIx64 " (%p)",
669 nix_tm_hwlvl2str(node->hw_lvl), schq, node->lvl, node->id,
670 strict_prio, rr_quantum, node);
673 case NIX_TXSCH_LVL_SMQ:
674 reg[k] = NIX_AF_MDQX_SCHEDULE(schq);
675 regval[k] = (strict_prio << 24) | rr_quantum;
679 case NIX_TXSCH_LVL_TL4:
680 reg[k] = NIX_AF_TL4X_SCHEDULE(schq);
681 regval[k] = (strict_prio << 24) | rr_quantum;
685 case NIX_TXSCH_LVL_TL3:
686 reg[k] = NIX_AF_TL3X_SCHEDULE(schq);
687 regval[k] = (strict_prio << 24) | rr_quantum;
691 case NIX_TXSCH_LVL_TL2:
692 reg[k] = NIX_AF_TL2X_SCHEDULE(schq);
693 regval[k] = (strict_prio << 24) | rr_quantum;
697 case NIX_TXSCH_LVL_TL1:
698 reg[k] = NIX_AF_TL1X_SCHEDULE(schq);
699 regval[k] = rr_quantum;
709 nix_tm_shaper_reg_prep(struct nix_tm_node *node,
710 struct nix_tm_shaper_profile *profile,
711 volatile uint64_t *reg, volatile uint64_t *regval)
713 struct nix_tm_shaper_data cir, pir;
714 uint32_t schq = node->hw_id;
718 nix_tm_shaper_conf_get(profile, &cir, &pir);
720 if (profile && node->pkt_mode)
721 adjust = profile->pkt_mode_adj;
723 adjust = profile->pkt_len_adj;
726 plt_tm_dbg("Shaper config node %s(%u) lvl %u id %u, "
727 "pir %" PRIu64 "(%" PRIu64 "B),"
728 " cir %" PRIu64 "(%" PRIu64 "B)"
729 "adjust 0x%" PRIx64 "(pktmode %u) (%p)",
730 nix_tm_hwlvl2str(node->hw_lvl), schq, node->lvl, node->id,
731 pir.rate, pir.burst, cir.rate, cir.burst, adjust,
732 node->pkt_mode, node);
734 switch (node->hw_lvl) {
735 case NIX_TXSCH_LVL_SMQ:
736 /* Configure PIR, CIR */
737 reg[k] = NIX_AF_MDQX_PIR(schq);
738 regval[k] = (pir.rate && pir.burst) ?
739 (nix_tm_shaper2regval(&pir) | 1) :
743 reg[k] = NIX_AF_MDQX_CIR(schq);
744 regval[k] = (cir.rate && cir.burst) ?
745 (nix_tm_shaper2regval(&cir) | 1) :
749 /* Configure RED ALG */
750 reg[k] = NIX_AF_MDQX_SHAPE(schq);
751 regval[k] = (adjust | (uint64_t)node->red_algo << 9 |
752 (uint64_t)node->pkt_mode << 24);
755 case NIX_TXSCH_LVL_TL4:
756 /* Configure PIR, CIR */
757 reg[k] = NIX_AF_TL4X_PIR(schq);
758 regval[k] = (pir.rate && pir.burst) ?
759 (nix_tm_shaper2regval(&pir) | 1) :
763 reg[k] = NIX_AF_TL4X_CIR(schq);
764 regval[k] = (cir.rate && cir.burst) ?
765 (nix_tm_shaper2regval(&cir) | 1) :
769 /* Configure RED algo */
770 reg[k] = NIX_AF_TL4X_SHAPE(schq);
771 regval[k] = (adjust | (uint64_t)node->red_algo << 9 |
772 (uint64_t)node->pkt_mode << 24);
775 case NIX_TXSCH_LVL_TL3:
776 /* Configure PIR, CIR */
777 reg[k] = NIX_AF_TL3X_PIR(schq);
778 regval[k] = (pir.rate && pir.burst) ?
779 (nix_tm_shaper2regval(&pir) | 1) :
783 reg[k] = NIX_AF_TL3X_CIR(schq);
784 regval[k] = (cir.rate && cir.burst) ?
785 (nix_tm_shaper2regval(&cir) | 1) :
789 /* Configure RED algo */
790 reg[k] = NIX_AF_TL3X_SHAPE(schq);
791 regval[k] = (adjust | (uint64_t)node->red_algo << 9 |
792 (uint64_t)node->pkt_mode << 24);
796 case NIX_TXSCH_LVL_TL2:
797 /* Configure PIR, CIR */
798 reg[k] = NIX_AF_TL2X_PIR(schq);
799 regval[k] = (pir.rate && pir.burst) ?
800 (nix_tm_shaper2regval(&pir) | 1) :
804 reg[k] = NIX_AF_TL2X_CIR(schq);
805 regval[k] = (cir.rate && cir.burst) ?
806 (nix_tm_shaper2regval(&cir) | 1) :
810 /* Configure RED algo */
811 reg[k] = NIX_AF_TL2X_SHAPE(schq);
812 regval[k] = (adjust | (uint64_t)node->red_algo << 9 |
813 (uint64_t)node->pkt_mode << 24);
817 case NIX_TXSCH_LVL_TL1:
819 reg[k] = NIX_AF_TL1X_CIR(schq);
820 regval[k] = (cir.rate && cir.burst) ?
821 (nix_tm_shaper2regval(&cir) | 1) :
825 /* Configure length disable and adjust */
826 reg[k] = NIX_AF_TL1X_SHAPE(schq);
827 regval[k] = (adjust | (uint64_t)node->pkt_mode << 24);
836 nix_tm_sw_xoff_prep(struct nix_tm_node *node, bool enable,
837 volatile uint64_t *reg, volatile uint64_t *regval)
839 uint32_t hw_lvl = node->hw_lvl;
840 uint32_t schq = node->hw_id;
843 plt_tm_dbg("sw xoff config node %s(%u) lvl %u id %u, enable %u (%p)",
844 nix_tm_hwlvl2str(hw_lvl), schq, node->lvl, node->id, enable,
850 case NIX_TXSCH_LVL_MDQ:
851 reg[k] = NIX_AF_MDQX_SW_XOFF(schq);
854 case NIX_TXSCH_LVL_TL4:
855 reg[k] = NIX_AF_TL4X_SW_XOFF(schq);
858 case NIX_TXSCH_LVL_TL3:
859 reg[k] = NIX_AF_TL3X_SW_XOFF(schq);
862 case NIX_TXSCH_LVL_TL2:
863 reg[k] = NIX_AF_TL2X_SW_XOFF(schq);
866 case NIX_TXSCH_LVL_TL1:
867 reg[k] = NIX_AF_TL1X_SW_XOFF(schq);
877 /* Search for min rate in topology */
879 nix_tm_shaper_profile_rate_min(struct nix *nix)
881 struct nix_tm_shaper_profile *profile;
882 uint64_t rate_min = 1E9; /* 1 Gbps */
884 TAILQ_FOREACH(profile, &nix->shaper_profile_list, shaper) {
885 if (profile->peak.rate && profile->peak.rate < rate_min)
886 rate_min = profile->peak.rate;
888 if (profile->commit.rate && profile->commit.rate < rate_min)
889 rate_min = profile->commit.rate;
895 nix_tm_resource_avail(struct nix *nix, uint8_t hw_lvl, bool contig)
897 uint32_t pos = 0, start_pos = 0;
898 struct plt_bitmap *bmp;
902 bmp = contig ? nix->schq_contig_bmp[hw_lvl] : nix->schq_bmp[hw_lvl];
903 plt_bitmap_scan_init(bmp);
905 if (!plt_bitmap_scan(bmp, &pos, &slab))
911 count += __builtin_popcountll(slab);
912 if (!plt_bitmap_scan(bmp, &pos, &slab))
914 } while (pos != start_pos);
920 nix_tm_resource_estimate(struct nix *nix, uint16_t *schq_contig, uint16_t *schq,
921 enum roc_nix_tm_tree tree)
923 struct nix_tm_node_list *list;
924 uint8_t contig_cnt, hw_lvl;
925 struct nix_tm_node *parent;
926 uint16_t cnt = 0, avail;
928 list = nix_tm_node_list(nix, tree);
929 /* Walk through parents from TL1..TL4 */
930 for (hw_lvl = NIX_TXSCH_LVL_TL1; hw_lvl > 0; hw_lvl--) {
931 TAILQ_FOREACH(parent, list, node) {
932 if (hw_lvl != parent->hw_lvl)
935 /* Skip accounting for children whose
936 * parent does not indicate so.
938 if (!parent->child_realloc)
941 /* Count children needed */
942 schq[hw_lvl - 1] += parent->rr_num;
943 if (parent->max_prio != UINT32_MAX) {
944 contig_cnt = parent->max_prio + 1;
945 schq_contig[hw_lvl - 1] += contig_cnt;
946 /* When we have SP + DWRR at a parent,
947 * we will always have a spare schq at rr prio
948 * location in contiguous queues. Hence reduce
949 * discontiguous count by 1.
951 if (parent->max_prio > 0 && parent->rr_num)
952 schq[hw_lvl - 1] -= 1;
957 schq[nix->tm_root_lvl] = 1;
958 if (!nix_tm_have_tl1_access(nix))
959 schq[NIX_TXSCH_LVL_TL1] = 1;
961 /* Now check for existing resources */
962 for (hw_lvl = 0; hw_lvl < NIX_TXSCH_LVL_CNT; hw_lvl++) {
963 avail = nix_tm_resource_avail(nix, hw_lvl, false);
964 if (schq[hw_lvl] <= avail)
967 schq[hw_lvl] -= avail;
969 /* For contiguous queues, realloc everything */
970 avail = nix_tm_resource_avail(nix, hw_lvl, true);
971 if (schq_contig[hw_lvl] <= avail)
972 schq_contig[hw_lvl] = 0;
975 cnt += schq_contig[hw_lvl];
977 plt_tm_dbg("Estimate resources needed for %s: dis %u cont %u",
978 nix_tm_hwlvl2str(hw_lvl), schq[hw_lvl],
979 schq_contig[hw_lvl]);
986 roc_nix_tm_leaf_cnt(struct roc_nix *roc_nix)
988 struct nix *nix = roc_nix_to_nix_priv(roc_nix);
989 struct nix_tm_node_list *list;
990 struct nix_tm_node *node;
991 uint16_t leaf_cnt = 0;
993 /* Count leafs only in user list */
994 list = nix_tm_node_list(nix, ROC_NIX_TM_USER);
995 TAILQ_FOREACH(node, list, node) {
996 if (node->id < nix->nb_tx_queues)
1004 roc_nix_tm_node_lvl(struct roc_nix *roc_nix, uint32_t node_id)
1006 struct nix *nix = roc_nix_to_nix_priv(roc_nix);
1007 struct nix_tm_node *node;
1009 node = nix_tm_node_search(nix, node_id, ROC_NIX_TM_USER);
1011 return NIX_ERR_TM_INVALID_NODE;
1016 struct roc_nix_tm_node *
1017 roc_nix_tm_node_get(struct roc_nix *roc_nix, uint32_t node_id)
1019 struct nix *nix = roc_nix_to_nix_priv(roc_nix);
1020 struct nix_tm_node *node;
1022 node = nix_tm_node_search(nix, node_id, ROC_NIX_TM_USER);
1023 return (struct roc_nix_tm_node *)node;
1026 struct roc_nix_tm_node *
1027 roc_nix_tm_node_next(struct roc_nix *roc_nix, struct roc_nix_tm_node *__prev)
1029 struct nix_tm_node *prev = (struct nix_tm_node *)__prev;
1030 struct nix *nix = roc_nix_to_nix_priv(roc_nix);
1031 struct nix_tm_node_list *list;
1033 list = nix_tm_node_list(nix, ROC_NIX_TM_USER);
1035 /* HEAD of the list */
1037 return (struct roc_nix_tm_node *)TAILQ_FIRST(list);
1040 if (prev->tree != ROC_NIX_TM_USER)
1043 return (struct roc_nix_tm_node *)TAILQ_NEXT(prev, node);
1046 struct roc_nix_tm_shaper_profile *
1047 roc_nix_tm_shaper_profile_get(struct roc_nix *roc_nix, uint32_t profile_id)
1049 struct nix *nix = roc_nix_to_nix_priv(roc_nix);
1050 struct nix_tm_shaper_profile *profile;
1052 profile = nix_tm_shaper_profile_search(nix, profile_id);
1053 return (struct roc_nix_tm_shaper_profile *)profile;
1056 struct roc_nix_tm_shaper_profile *
1057 roc_nix_tm_shaper_profile_next(struct roc_nix *roc_nix,
1058 struct roc_nix_tm_shaper_profile *__prev)
1060 struct nix *nix = roc_nix_to_nix_priv(roc_nix);
1061 struct nix_tm_shaper_profile_list *list;
1062 struct nix_tm_shaper_profile *prev;
1064 prev = (struct nix_tm_shaper_profile *)__prev;
1065 list = &nix->shaper_profile_list;
1067 /* HEAD of the list */
1069 return (struct roc_nix_tm_shaper_profile *)TAILQ_FIRST(list);
1071 return (struct roc_nix_tm_shaper_profile *)TAILQ_NEXT(prev, shaper);
1074 struct nix_tm_node *
1075 nix_tm_node_alloc(void)
1077 struct nix_tm_node *node;
1079 node = plt_zmalloc(sizeof(struct nix_tm_node), 0);
1083 node->free_fn = plt_free;
1088 nix_tm_node_free(struct nix_tm_node *node)
1090 if (!node || node->free_fn == NULL)
1093 (node->free_fn)(node);
1096 struct nix_tm_shaper_profile *
1097 nix_tm_shaper_profile_alloc(void)
1099 struct nix_tm_shaper_profile *profile;
1101 profile = plt_zmalloc(sizeof(struct nix_tm_shaper_profile), 0);
1105 profile->free_fn = plt_free;
1110 nix_tm_shaper_profile_free(struct nix_tm_shaper_profile *profile)
1112 if (!profile || !profile->free_fn)
1115 (profile->free_fn)(profile);
1119 roc_nix_tm_node_stats_get(struct roc_nix *roc_nix, uint32_t node_id, bool clear,
1120 struct roc_nix_tm_node_stats *n_stats)
1122 struct nix *nix = roc_nix_to_nix_priv(roc_nix);
1123 struct mbox *mbox = (&nix->dev)->mbox;
1124 struct nix_txschq_config *req, *rsp;
1125 struct nix_tm_node *node;
1129 node = nix_tm_node_search(nix, node_id, ROC_NIX_TM_USER);
1131 return NIX_ERR_TM_INVALID_NODE;
1133 if (node->hw_lvl != NIX_TXSCH_LVL_TL1)
1134 return NIX_ERR_OP_NOTSUP;
1136 /* Check if node has HW resource */
1137 if (!(node->flags & NIX_TM_NODE_HWRES))
1141 /* Skip fetch if not requested */
1145 memset(n_stats, 0, sizeof(struct roc_nix_tm_node_stats));
1147 req = mbox_alloc_msg_nix_txschq_cfg(mbox);
1149 req->lvl = NIX_TXSCH_LVL_TL1;
1152 req->reg[i++] = NIX_AF_TL1X_DROPPED_PACKETS(schq);
1153 req->reg[i++] = NIX_AF_TL1X_DROPPED_BYTES(schq);
1154 req->reg[i++] = NIX_AF_TL1X_GREEN_PACKETS(schq);
1155 req->reg[i++] = NIX_AF_TL1X_GREEN_BYTES(schq);
1156 req->reg[i++] = NIX_AF_TL1X_YELLOW_PACKETS(schq);
1157 req->reg[i++] = NIX_AF_TL1X_YELLOW_BYTES(schq);
1158 req->reg[i++] = NIX_AF_TL1X_RED_PACKETS(schq);
1159 req->reg[i++] = NIX_AF_TL1X_RED_BYTES(schq);
1162 rc = mbox_process_msg(mbox, (void **)&rsp);
1167 n_stats->stats[ROC_NIX_TM_NODE_PKTS_DROPPED] = rsp->regval[0];
1168 n_stats->stats[ROC_NIX_TM_NODE_BYTES_DROPPED] = rsp->regval[1];
1169 n_stats->stats[ROC_NIX_TM_NODE_GREEN_PKTS] = rsp->regval[2];
1170 n_stats->stats[ROC_NIX_TM_NODE_GREEN_BYTES] = rsp->regval[3];
1171 n_stats->stats[ROC_NIX_TM_NODE_YELLOW_PKTS] = rsp->regval[4];
1172 n_stats->stats[ROC_NIX_TM_NODE_YELLOW_BYTES] = rsp->regval[5];
1173 n_stats->stats[ROC_NIX_TM_NODE_RED_PKTS] = rsp->regval[6];
1174 n_stats->stats[ROC_NIX_TM_NODE_RED_BYTES] = rsp->regval[7];
1180 /* Clear all the stats */
1181 req = mbox_alloc_msg_nix_txschq_cfg(mbox);
1182 req->lvl = NIX_TXSCH_LVL_TL1;
1184 req->reg[i++] = NIX_AF_TL1X_DROPPED_PACKETS(schq);
1185 req->reg[i++] = NIX_AF_TL1X_DROPPED_BYTES(schq);
1186 req->reg[i++] = NIX_AF_TL1X_GREEN_PACKETS(schq);
1187 req->reg[i++] = NIX_AF_TL1X_GREEN_BYTES(schq);
1188 req->reg[i++] = NIX_AF_TL1X_YELLOW_PACKETS(schq);
1189 req->reg[i++] = NIX_AF_TL1X_YELLOW_BYTES(schq);
1190 req->reg[i++] = NIX_AF_TL1X_RED_PACKETS(schq);
1191 req->reg[i++] = NIX_AF_TL1X_RED_BYTES(schq);
1194 return mbox_process_msg(mbox, (void **)&rsp);
1198 roc_nix_tm_is_user_hierarchy_enabled(struct roc_nix *roc_nix)
1200 struct nix *nix = roc_nix_to_nix_priv(roc_nix);
1202 if ((nix->tm_flags & NIX_TM_HIERARCHY_ENA) &&
1203 (nix->tm_tree == ROC_NIX_TM_USER))
1209 roc_nix_tm_tree_type_get(struct roc_nix *roc_nix)
1211 struct nix *nix = roc_nix_to_nix_priv(roc_nix);
1213 return nix->tm_tree;
1217 roc_nix_tm_max_prio(struct roc_nix *roc_nix, int lvl)
1219 struct nix *nix = roc_nix_to_nix_priv(roc_nix);
1220 int hw_lvl = nix_tm_lvl2nix(nix, lvl);
1222 return nix_tm_max_prio(nix, hw_lvl);
1226 roc_nix_tm_lvl_is_leaf(struct roc_nix *roc_nix, int lvl)
1228 return nix_tm_is_leaf(roc_nix_to_nix_priv(roc_nix), lvl);
1232 roc_nix_tm_shaper_default_red_algo(struct roc_nix_tm_node *node,
1233 struct roc_nix_tm_shaper_profile *roc_prof)
1235 struct nix_tm_node *tm_node = (struct nix_tm_node *)node;
1236 struct nix_tm_shaper_profile *profile;
1237 struct nix_tm_shaper_data cir, pir;
1239 profile = (struct nix_tm_shaper_profile *)roc_prof->reserved;
1240 tm_node->red_algo = NIX_REDALG_STD;
1242 /* C0 doesn't support STALL when both PIR & CIR are enabled */
1243 if (profile && roc_model_is_cn96_cx()) {
1244 nix_tm_shaper_conf_get(profile, &cir, &pir);
1246 if (pir.rate && cir.rate)
1247 tm_node->red_algo = NIX_REDALG_DISCARD;
1252 roc_nix_tm_lvl_cnt_get(struct roc_nix *roc_nix)
1254 if (nix_tm_have_tl1_access(roc_nix_to_nix_priv(roc_nix)))
1255 return NIX_TXSCH_LVL_CNT;
1257 return (NIX_TXSCH_LVL_CNT - 1);
1261 roc_nix_tm_lvl_have_link_access(struct roc_nix *roc_nix, int lvl)
1263 struct nix *nix = roc_nix_to_nix_priv(roc_nix);
1265 if (nix_tm_lvl2nix(nix, lvl) == NIX_TXSCH_LVL_TL1)