xref: /dpdk/lib/sched/rte_red.c (revision 99a2dd955fba6e4cc23b77d590a033650ced9c45)
1*99a2dd95SBruce Richardson /* SPDX-License-Identifier: BSD-3-Clause
2*99a2dd95SBruce Richardson  * Copyright(c) 2010-2014 Intel Corporation
3*99a2dd95SBruce Richardson  */
4*99a2dd95SBruce Richardson 
5*99a2dd95SBruce Richardson #include <math.h>
6*99a2dd95SBruce Richardson #include "rte_red.h"
7*99a2dd95SBruce Richardson #include <rte_random.h>
8*99a2dd95SBruce Richardson #include <rte_common.h>
9*99a2dd95SBruce Richardson 
10*99a2dd95SBruce Richardson #ifdef __INTEL_COMPILER
11*99a2dd95SBruce Richardson #pragma warning(disable:2259) /* conversion may lose significant bits */
12*99a2dd95SBruce Richardson #endif
13*99a2dd95SBruce Richardson 
14*99a2dd95SBruce Richardson static int rte_red_init_done = 0;     /**< Flag to indicate that global initialisation is done */
15*99a2dd95SBruce Richardson uint32_t rte_red_rand_val = 0;        /**< Random value cache */
16*99a2dd95SBruce Richardson uint32_t rte_red_rand_seed = 0;       /**< Seed for random number generation */
17*99a2dd95SBruce Richardson 
18*99a2dd95SBruce Richardson /**
19*99a2dd95SBruce Richardson  * table[i] = log2(1-Wq) * Scale * -1
20*99a2dd95SBruce Richardson  *       Wq = 1/(2^i)
21*99a2dd95SBruce Richardson  */
22*99a2dd95SBruce Richardson uint16_t rte_red_log2_1_minus_Wq[RTE_RED_WQ_LOG2_NUM];
23*99a2dd95SBruce Richardson 
24*99a2dd95SBruce Richardson /**
25*99a2dd95SBruce Richardson  * table[i] = 2^(i/16) * Scale
26*99a2dd95SBruce Richardson  */
27*99a2dd95SBruce Richardson uint16_t rte_red_pow2_frac_inv[16];
28*99a2dd95SBruce Richardson 
29*99a2dd95SBruce Richardson /**
30*99a2dd95SBruce Richardson  * @brief Initialize tables used to compute average
31*99a2dd95SBruce Richardson  *        queue size when queue is empty.
32*99a2dd95SBruce Richardson  */
33*99a2dd95SBruce Richardson static void
__rte_red_init_tables(void)34*99a2dd95SBruce Richardson __rte_red_init_tables(void)
35*99a2dd95SBruce Richardson {
36*99a2dd95SBruce Richardson 	uint32_t i = 0;
37*99a2dd95SBruce Richardson 	double scale = 0.0;
38*99a2dd95SBruce Richardson 	double table_size = 0.0;
39*99a2dd95SBruce Richardson 
40*99a2dd95SBruce Richardson 	scale = (double)(1 << RTE_RED_SCALING);
41*99a2dd95SBruce Richardson 	table_size = (double)(RTE_DIM(rte_red_pow2_frac_inv));
42*99a2dd95SBruce Richardson 
43*99a2dd95SBruce Richardson 	for (i = 0; i < RTE_DIM(rte_red_pow2_frac_inv); i++) {
44*99a2dd95SBruce Richardson 		double m = (double)i;
45*99a2dd95SBruce Richardson 
46*99a2dd95SBruce Richardson 		rte_red_pow2_frac_inv[i] = (uint16_t) round(scale / pow(2, m / table_size));
47*99a2dd95SBruce Richardson 	}
48*99a2dd95SBruce Richardson 
49*99a2dd95SBruce Richardson 	scale = 1024.0;
50*99a2dd95SBruce Richardson 
51*99a2dd95SBruce Richardson 	RTE_ASSERT(RTE_RED_WQ_LOG2_NUM == RTE_DIM(rte_red_log2_1_minus_Wq));
52*99a2dd95SBruce Richardson 
53*99a2dd95SBruce Richardson 	for (i = RTE_RED_WQ_LOG2_MIN; i <= RTE_RED_WQ_LOG2_MAX; i++) {
54*99a2dd95SBruce Richardson 		double n = (double)i;
55*99a2dd95SBruce Richardson 		double Wq = pow(2, -n);
56*99a2dd95SBruce Richardson 		uint32_t index = i - RTE_RED_WQ_LOG2_MIN;
57*99a2dd95SBruce Richardson 
58*99a2dd95SBruce Richardson 		rte_red_log2_1_minus_Wq[index] = (uint16_t) round(-1.0 * scale * log2(1.0 - Wq));
59*99a2dd95SBruce Richardson 		/**
60*99a2dd95SBruce Richardson 		* Table entry of zero, corresponds to a Wq of zero
61*99a2dd95SBruce Richardson 		* which is not valid (avg would remain constant no
62*99a2dd95SBruce Richardson 		* matter how long the queue is empty). So we have
63*99a2dd95SBruce Richardson 		* to check for zero and round up to one.
64*99a2dd95SBruce Richardson 		*/
65*99a2dd95SBruce Richardson 		if (rte_red_log2_1_minus_Wq[index] == 0) {
66*99a2dd95SBruce Richardson 			rte_red_log2_1_minus_Wq[index] = 1;
67*99a2dd95SBruce Richardson 		}
68*99a2dd95SBruce Richardson 	}
69*99a2dd95SBruce Richardson }
70*99a2dd95SBruce Richardson 
71*99a2dd95SBruce Richardson int
rte_red_rt_data_init(struct rte_red * red)72*99a2dd95SBruce Richardson rte_red_rt_data_init(struct rte_red *red)
73*99a2dd95SBruce Richardson {
74*99a2dd95SBruce Richardson 	if (red == NULL)
75*99a2dd95SBruce Richardson 		return -1;
76*99a2dd95SBruce Richardson 
77*99a2dd95SBruce Richardson 	red->avg = 0;
78*99a2dd95SBruce Richardson 	red->count = 0;
79*99a2dd95SBruce Richardson 	red->q_time = 0;
80*99a2dd95SBruce Richardson 	return 0;
81*99a2dd95SBruce Richardson }
82*99a2dd95SBruce Richardson 
83*99a2dd95SBruce Richardson int
rte_red_config_init(struct rte_red_config * red_cfg,const uint16_t wq_log2,const uint16_t min_th,const uint16_t max_th,const uint16_t maxp_inv)84*99a2dd95SBruce Richardson rte_red_config_init(struct rte_red_config *red_cfg,
85*99a2dd95SBruce Richardson 	const uint16_t wq_log2,
86*99a2dd95SBruce Richardson 	const uint16_t min_th,
87*99a2dd95SBruce Richardson 	const uint16_t max_th,
88*99a2dd95SBruce Richardson 	const uint16_t maxp_inv)
89*99a2dd95SBruce Richardson {
90*99a2dd95SBruce Richardson 	if (red_cfg == NULL) {
91*99a2dd95SBruce Richardson 		return -1;
92*99a2dd95SBruce Richardson 	}
93*99a2dd95SBruce Richardson 	if (max_th > RTE_RED_MAX_TH_MAX) {
94*99a2dd95SBruce Richardson 		return -2;
95*99a2dd95SBruce Richardson 	}
96*99a2dd95SBruce Richardson 	if (min_th >= max_th) {
97*99a2dd95SBruce Richardson 		return -3;
98*99a2dd95SBruce Richardson 	}
99*99a2dd95SBruce Richardson 	if (wq_log2 > RTE_RED_WQ_LOG2_MAX) {
100*99a2dd95SBruce Richardson 		return -4;
101*99a2dd95SBruce Richardson 	}
102*99a2dd95SBruce Richardson 	if (wq_log2 < RTE_RED_WQ_LOG2_MIN) {
103*99a2dd95SBruce Richardson 		return -5;
104*99a2dd95SBruce Richardson 	}
105*99a2dd95SBruce Richardson 	if (maxp_inv < RTE_RED_MAXP_INV_MIN) {
106*99a2dd95SBruce Richardson 		return -6;
107*99a2dd95SBruce Richardson 	}
108*99a2dd95SBruce Richardson 	if (maxp_inv > RTE_RED_MAXP_INV_MAX) {
109*99a2dd95SBruce Richardson 		return -7;
110*99a2dd95SBruce Richardson 	}
111*99a2dd95SBruce Richardson 
112*99a2dd95SBruce Richardson 	/**
113*99a2dd95SBruce Richardson 	 *  Initialize the RED module if not already done
114*99a2dd95SBruce Richardson 	 */
115*99a2dd95SBruce Richardson 	if (!rte_red_init_done) {
116*99a2dd95SBruce Richardson 		rte_red_rand_seed = rte_rand();
117*99a2dd95SBruce Richardson 		rte_red_rand_val = rte_fast_rand();
118*99a2dd95SBruce Richardson 		__rte_red_init_tables();
119*99a2dd95SBruce Richardson 		rte_red_init_done = 1;
120*99a2dd95SBruce Richardson 	}
121*99a2dd95SBruce Richardson 
122*99a2dd95SBruce Richardson 	red_cfg->min_th = ((uint32_t) min_th) << (wq_log2 + RTE_RED_SCALING);
123*99a2dd95SBruce Richardson 	red_cfg->max_th = ((uint32_t) max_th) << (wq_log2 + RTE_RED_SCALING);
124*99a2dd95SBruce Richardson 	red_cfg->pa_const = (2 * (max_th - min_th) * maxp_inv) << RTE_RED_SCALING;
125*99a2dd95SBruce Richardson 	red_cfg->maxp_inv = maxp_inv;
126*99a2dd95SBruce Richardson 	red_cfg->wq_log2 = wq_log2;
127*99a2dd95SBruce Richardson 
128*99a2dd95SBruce Richardson 	return 0;
129*99a2dd95SBruce Richardson }
130