4 * Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * * Neither the name of Intel Corporation nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
27 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
34 #ifndef __INCLUDE_RTE_SCHED_H__
35 #define __INCLUDE_RTE_SCHED_H__
43 * RTE Hierarchical Scheduler
45 * The hierarchical scheduler prioritizes the transmission of packets from different
46 * users and traffic classes according to the Service Level Agreements (SLAs) defined
47 * for the current network node.
49 * The scheduler supports thousands of packet queues grouped under a 5-level hierarchy:
51 * - Typical usage: output Ethernet port;
52 * - Multiple ports are scheduled in round robin order with equal priority;
54 * - Typical usage: group of users;
55 * - Traffic shaping using the token bucket algorithm (one bucket per subport);
56 * - Upper limit enforced per traffic class at subport level;
57 * - Lower priority traffic classes able to reuse subport bandwidth currently
58 * unused by higher priority traffic classes of the same subport;
59 * - When any subport traffic class is oversubscribed (configuration time
60 * event), the usage of subport member pipes with high demand for that
61 * traffic class pipes is truncated to a dynamically adjusted value with no
62 * impact to low demand pipes;
64 * - Typical usage: individual user/subscriber;
65 * - Traffic shaping using the token bucket algorithm (one bucket per pipe);
67 * - Traffic classes of the same pipe handled in strict priority order;
68 * - Upper limit enforced per traffic class at the pipe level;
69 * - Lower priority traffic classes able to reuse pipe bandwidth currently
70 * unused by higher priority traffic classes of the same pipe;
72 * - Typical usage: queue hosting packets from one or multiple connections
73 * of same traffic class belonging to the same user;
74 * - Weighted Round Robin (WRR) is used to service the queues within same
79 #include <sys/types.h>
81 #include <rte_meter.h>
83 /** Random Early Detection (RED) */
88 /** Number of traffic classes per pipe (as well as subport). Cannot be changed. */
89 #define RTE_SCHED_TRAFFIC_CLASSES_PER_PIPE 4
91 /** Number of queues per pipe traffic class. Cannot be changed. */
92 #define RTE_SCHED_QUEUES_PER_TRAFFIC_CLASS 4
94 /** Number of queues per pipe. */
95 #define RTE_SCHED_QUEUES_PER_PIPE \
96 (RTE_SCHED_TRAFFIC_CLASSES_PER_PIPE * \
97 RTE_SCHED_QUEUES_PER_TRAFFIC_CLASS)
99 /** Maximum number of pipe profiles that can be defined per port. Compile-time configurable.*/
100 #ifndef RTE_SCHED_PIPE_PROFILES_PER_PORT
101 #define RTE_SCHED_PIPE_PROFILES_PER_PORT 256
104 /** Ethernet framing overhead. Overhead fields per Ethernet frame:
105 1. Preamble: 7 bytes;
106 2. Start of Frame Delimiter (SFD): 1 byte;
107 3. Frame Check Sequence (FCS): 4 bytes;
108 4. Inter Frame Gap (IFG): 12 bytes.
109 The FCS is considered overhead only if not included in the packet length (field pkt_len
110 of struct rte_mbuf). */
111 #ifndef RTE_SCHED_FRAME_OVERHEAD_DEFAULT
112 #define RTE_SCHED_FRAME_OVERHEAD_DEFAULT 24
115 /** Subport configuration parameters. The period and credits_per_period parameters are measured
116 in bytes, with one byte meaning the time duration associated with the transmission of one byte
117 on the physical medium of the output port, with pipe or pipe traffic class rate (measured as
118 percentage of output port rate) determined as credits_per_period divided by period. One credit
119 represents one byte. */
120 struct rte_sched_subport_params {
121 /* Subport token bucket */
122 uint32_t tb_rate; /**< Subport token bucket rate (measured in bytes per second) */
123 uint32_t tb_size; /**< Subport token bucket size (measured in credits) */
125 /* Subport traffic classes */
126 uint32_t tc_rate[RTE_SCHED_TRAFFIC_CLASSES_PER_PIPE]; /**< Subport traffic class rates (measured in bytes per second) */
127 uint32_t tc_period; /**< Enforcement period for traffic class rates (measured in milliseconds) */
130 /** Subport statistics */
131 struct rte_sched_subport_stats {
133 uint32_t n_pkts_tc[RTE_SCHED_TRAFFIC_CLASSES_PER_PIPE]; /**< Number of packets successfully written to current
134 subport for each traffic class */
135 uint32_t n_pkts_tc_dropped[RTE_SCHED_TRAFFIC_CLASSES_PER_PIPE]; /**< Number of packets dropped by the current
136 subport for each traffic class due to subport queues being full or congested*/
139 uint32_t n_bytes_tc[RTE_SCHED_TRAFFIC_CLASSES_PER_PIPE]; /**< Number of bytes successfully written to current
140 subport for each traffic class*/
141 uint32_t n_bytes_tc_dropped[RTE_SCHED_TRAFFIC_CLASSES_PER_PIPE]; /**< Number of bytes dropped by the current
142 subport for each traffic class due to subport queues being full or congested */
145 /** Pipe configuration parameters. The period and credits_per_period parameters are measured
146 in bytes, with one byte meaning the time duration associated with the transmission of one byte
147 on the physical medium of the output port, with pipe or pipe traffic class rate (measured as
148 percentage of output port rate) determined as credits_per_period divided by period. One credit
149 represents one byte. */
150 struct rte_sched_pipe_params {
151 /* Pipe token bucket */
152 uint32_t tb_rate; /**< Pipe token bucket rate (measured in bytes per second) */
153 uint32_t tb_size; /**< Pipe token bucket size (measured in credits) */
155 /* Pipe traffic classes */
156 uint32_t tc_rate[RTE_SCHED_TRAFFIC_CLASSES_PER_PIPE]; /**< Pipe traffic class rates (measured in bytes per second) */
157 uint32_t tc_period; /**< Enforcement period for pipe traffic class rates (measured in milliseconds) */
158 #ifdef RTE_SCHED_SUBPORT_TC_OV
159 uint8_t tc_ov_weight; /**< Weight for the current pipe in the event of subport traffic class 3 oversubscription */
163 uint8_t wrr_weights[RTE_SCHED_QUEUES_PER_PIPE]; /**< WRR weights for the queues of the current pipe */
166 /** Queue statistics */
167 struct rte_sched_queue_stats {
169 uint32_t n_pkts; /**< Number of packets successfully written to current queue */
170 uint32_t n_pkts_dropped; /**< Number of packets dropped due to current queue being full or congested */
173 uint32_t n_bytes; /**< Number of bytes successfully written to current queue */
174 uint32_t n_bytes_dropped; /**< Number of bytes dropped due to current queue being full or congested */
177 /** Port configuration parameters. */
178 struct rte_sched_port_params {
179 const char *name; /**< Literal string to be associated to the current port scheduler instance */
180 int socket; /**< CPU socket ID where the memory for port scheduler should be allocated */
181 uint32_t rate; /**< Output port rate (measured in bytes per second) */
182 uint32_t mtu; /**< Maximum Ethernet frame size (measured in bytes). Should not include the framing overhead. */
183 uint32_t frame_overhead; /**< Framing overhead per packet (measured in bytes) */
184 uint32_t n_subports_per_port; /**< Number of subports for the current port scheduler instance*/
185 uint32_t n_pipes_per_subport; /**< Number of pipes for each port scheduler subport */
186 uint16_t qsize[RTE_SCHED_TRAFFIC_CLASSES_PER_PIPE]; /**< Packet queue size for each traffic class. All queues
187 within the same pipe traffic class have the same size. Queues from
188 different pipes serving the same traffic class have the same size. */
189 struct rte_sched_pipe_params *pipe_profiles; /**< Pipe profile table defined for current port scheduler instance.
190 Every pipe of the current port scheduler is configured using one of the
191 profiles from this table. */
192 uint32_t n_pipe_profiles; /**< Number of profiles in the pipe profile table */
194 struct rte_red_params red_params[RTE_SCHED_TRAFFIC_CLASSES_PER_PIPE][e_RTE_METER_COLORS]; /**< RED parameters */
198 /** Path through the scheduler hierarchy used by the scheduler enqueue operation to
199 identify the destination queue for the current packet. Stored in the field hash.sched
200 of struct rte_mbuf of each packet, typically written by the classification stage and read by
202 struct rte_sched_port_hierarchy {
203 uint32_t queue:2; /**< Queue ID (0 .. 3) */
204 uint32_t traffic_class:2; /**< Traffic class ID (0 .. 3)*/
205 uint32_t pipe:20; /**< Pipe ID */
206 uint32_t subport:6; /**< Subport ID */
207 uint32_t color:2; /**< Color */
216 * Hierarchical scheduler port configuration
219 * Port scheduler configuration parameter structure
221 * Handle to port scheduler instance upon success or NULL otherwise.
223 struct rte_sched_port *
224 rte_sched_port_config(struct rte_sched_port_params *params);
227 * Hierarchical scheduler port free
230 * Handle to port scheduler instance
233 rte_sched_port_free(struct rte_sched_port *port);
236 * Hierarchical scheduler subport configuration
239 * Handle to port scheduler instance
243 * Subport configuration parameters
245 * 0 upon success, error code otherwise
248 rte_sched_subport_config(struct rte_sched_port *port,
250 struct rte_sched_subport_params *params);
253 * Hierarchical scheduler pipe configuration
256 * Handle to port scheduler instance
260 * Pipe ID within subport
261 * @param pipe_profile
262 * ID of port-level pre-configured pipe profile
264 * 0 upon success, error code otherwise
267 rte_sched_pipe_config(struct rte_sched_port *port,
270 int32_t pipe_profile);
273 * Hierarchical scheduler memory footprint size per port
276 * Port scheduler configuration parameter structure
278 * Memory footprint size in bytes upon success, 0 otherwise
281 rte_sched_port_get_memory_footprint(struct rte_sched_port_params *params);
289 * Hierarchical scheduler subport statistics read
292 * Handle to port scheduler instance
296 * Pointer to pre-allocated subport statistics structure where the statistics
297 * counters should be stored
299 * Pointer to pre-allocated 4-entry array where the oversubscription status for
300 * each of the 4 subport traffic classes should be stored.
302 * 0 upon success, error code otherwise
305 rte_sched_subport_read_stats(struct rte_sched_port *port,
307 struct rte_sched_subport_stats *stats,
311 * Hierarchical scheduler queue statistics read
314 * Handle to port scheduler instance
316 * Queue ID within port scheduler
318 * Pointer to pre-allocated subport statistics structure where the statistics
319 * counters should be stored
321 * Pointer to pre-allocated variable where the current queue length should be stored.
323 * 0 upon success, error code otherwise
326 rte_sched_queue_read_stats(struct rte_sched_port *port,
328 struct rte_sched_queue_stats *stats,
337 * Scheduler hierarchy path write to packet descriptor. Typically called by the
338 * packet classification stage.
341 * Packet descriptor handle
345 * Pipe ID within subport
346 * @param traffic_class
347 * Traffic class ID within pipe (0 .. 3)
349 * Queue ID within pipe traffic class (0 .. 3)
352 rte_sched_port_pkt_write(struct rte_mbuf *pkt,
353 uint32_t subport, uint32_t pipe, uint32_t traffic_class, uint32_t queue, enum rte_meter_color color)
355 struct rte_sched_port_hierarchy *sched = (struct rte_sched_port_hierarchy *) &pkt->hash.sched;
357 sched->color = (uint32_t) color;
358 sched->subport = subport;
360 sched->traffic_class = traffic_class;
361 sched->queue = queue;
365 * Scheduler hierarchy path read from packet descriptor (struct rte_mbuf). Typically
366 * called as part of the hierarchical scheduler enqueue operation. The subport,
367 * pipe, traffic class and queue parameters need to be pre-allocated by the caller.
370 * Packet descriptor handle
374 * Pipe ID within subport
375 * @param traffic_class
376 * Traffic class ID within pipe (0 .. 3)
378 * Queue ID within pipe traffic class (0 .. 3)
382 rte_sched_port_pkt_read_tree_path(struct rte_mbuf *pkt, uint32_t *subport, uint32_t *pipe, uint32_t *traffic_class, uint32_t *queue)
384 struct rte_sched_port_hierarchy *sched = (struct rte_sched_port_hierarchy *) &pkt->hash.sched;
386 *subport = sched->subport;
388 *traffic_class = sched->traffic_class;
389 *queue = sched->queue;
392 static inline enum rte_meter_color
393 rte_sched_port_pkt_read_color(struct rte_mbuf *pkt)
395 struct rte_sched_port_hierarchy *sched = (struct rte_sched_port_hierarchy *) &pkt->hash.sched;
397 return (enum rte_meter_color) sched->color;
401 * Hierarchical scheduler port enqueue. Writes up to n_pkts to port scheduler and
402 * returns the number of packets actually written. For each packet, the port scheduler
403 * queue to write the packet to is identified by reading the hierarchy path from the
404 * packet descriptor; if the queue is full or congested and the packet is not written
405 * to the queue, then the packet is automatically dropped without any action required
409 * Handle to port scheduler instance
411 * Array storing the packet descriptor handles
413 * Number of packets to enqueue from the pkts array into the port scheduler
415 * Number of packets successfully enqueued
418 rte_sched_port_enqueue(struct rte_sched_port *port, struct rte_mbuf **pkts, uint32_t n_pkts);
421 * Hierarchical scheduler port dequeue. Reads up to n_pkts from the port scheduler
422 * and stores them in the pkts array and returns the number of packets actually read.
423 * The pkts array needs to be pre-allocated by the caller with at least n_pkts entries.
426 * Handle to port scheduler instance
428 * Pre-allocated packet descriptor array where the packets dequeued from the port
429 * scheduler should be stored
431 * Number of packets to dequeue from the port scheduler
433 * Number of packets successfully dequeued and placed in the pkts array
436 rte_sched_port_dequeue(struct rte_sched_port *port, struct rte_mbuf **pkts, uint32_t n_pkts);
442 #endif /* __INCLUDE_RTE_SCHED_H__ */