1 // SPDX-License-Identifier: GPL-2.0
2
3 /* net/sched/sch_taprio.c Time Aware Priority Scheduler
4 *
5 * Authors: Vinicius Costa Gomes <vinicius.gomes@intel.com>
6 *
7 */
8
9 #include <linux/ethtool.h>
10 #include <linux/ethtool_netlink.h>
11 #include <linux/types.h>
12 #include <linux/slab.h>
13 #include <linux/kernel.h>
14 #include <linux/string.h>
15 #include <linux/list.h>
16 #include <linux/errno.h>
17 #include <linux/skbuff.h>
18 #include <linux/math64.h>
19 #include <linux/module.h>
20 #include <linux/spinlock.h>
21 #include <linux/rcupdate.h>
22 #include <linux/time.h>
23 #include <net/gso.h>
24 #include <net/netlink.h>
25 #include <net/pkt_sched.h>
26 #include <net/pkt_cls.h>
27 #include <net/sch_generic.h>
28 #include <net/sock.h>
29 #include <net/tcp.h>
30
31 #define TAPRIO_STAT_NOT_SET (~0ULL)
32
33 #include "sch_mqprio_lib.h"
34
35 static LIST_HEAD(taprio_list);
36 static struct static_key_false taprio_have_broken_mqprio;
37 static struct static_key_false taprio_have_working_mqprio;
38
39 #define TAPRIO_ALL_GATES_OPEN -1
40
41 #define TXTIME_ASSIST_IS_ENABLED(flags) ((flags) & TCA_TAPRIO_ATTR_FLAG_TXTIME_ASSIST)
42 #define FULL_OFFLOAD_IS_ENABLED(flags) ((flags) & TCA_TAPRIO_ATTR_FLAG_FULL_OFFLOAD)
43 #define TAPRIO_SUPPORTED_FLAGS \
44 (TCA_TAPRIO_ATTR_FLAG_TXTIME_ASSIST | TCA_TAPRIO_ATTR_FLAG_FULL_OFFLOAD)
45 #define TAPRIO_FLAGS_INVALID U32_MAX
46 /* Minimum value for picos_per_byte to ensure non-zero duration
47 * for minimum-sized Ethernet frames (ETH_ZLEN = 60).
48 * 60 * 17 > PSEC_PER_NSEC (1000)
49 */
50 #define TAPRIO_PICOS_PER_BYTE_MIN 17
51
52 struct sched_entry {
53 /* Durations between this GCL entry and the GCL entry where the
54 * respective traffic class gate closes
55 */
56 u64 gate_duration[TC_MAX_QUEUE];
57 atomic_t budget[TC_MAX_QUEUE];
58 /* The qdisc makes some effort so that no packet leaves
59 * after this time
60 */
61 ktime_t gate_close_time[TC_MAX_QUEUE];
62 struct list_head list;
63 /* Used to calculate when to advance the schedule */
64 ktime_t end_time;
65 ktime_t next_txtime;
66 int index;
67 u32 gate_mask;
68 u32 interval;
69 u8 command;
70 };
71
72 struct sched_gate_list {
73 /* Longest non-zero contiguous gate durations per traffic class,
74 * or 0 if a traffic class gate never opens during the schedule.
75 */
76 u64 max_open_gate_duration[TC_MAX_QUEUE];
77 u32 max_frm_len[TC_MAX_QUEUE]; /* for the fast path */
78 u32 max_sdu[TC_MAX_QUEUE]; /* for dump */
79 struct rcu_head rcu;
80 struct list_head entries;
81 size_t num_entries;
82 ktime_t cycle_end_time;
83 s64 cycle_time;
84 s64 cycle_time_extension;
85 s64 base_time;
86 };
87
88 struct taprio_sched {
89 struct Qdisc **qdiscs;
90 struct Qdisc *root;
91 u32 flags;
92 enum tk_offsets tk_offset;
93 int clockid;
94 bool offloaded;
95 bool detected_mqprio;
96 bool broken_mqprio;
97 atomic64_t picos_per_byte; /* Using picoseconds because for 10Gbps+
98 * speeds it's sub-nanoseconds per byte
99 */
100
101 /* Protects the update side of the RCU protected current_entry */
102 spinlock_t current_entry_lock;
103 struct sched_entry __rcu *current_entry;
104 struct sched_gate_list __rcu *oper_sched;
105 struct sched_gate_list __rcu *admin_sched;
106 struct hrtimer advance_timer;
107 struct list_head taprio_list;
108 int cur_txq[TC_MAX_QUEUE];
109 u32 max_sdu[TC_MAX_QUEUE]; /* save info from the user */
110 u32 fp[TC_QOPT_MAX_QUEUE]; /* only for dump and offloading */
111 u32 txtime_delay;
112 };
113
114 struct __tc_taprio_qopt_offload {
115 refcount_t users;
116 struct tc_taprio_qopt_offload offload;
117 };
118
taprio_calculate_gate_durations(struct taprio_sched * q,struct sched_gate_list * sched)119 static void taprio_calculate_gate_durations(struct taprio_sched *q,
120 struct sched_gate_list *sched)
121 {
122 struct net_device *dev = qdisc_dev(q->root);
123 int num_tc = netdev_get_num_tc(dev);
124 struct sched_entry *entry, *cur;
125 int tc;
126
127 list_for_each_entry(entry, &sched->entries, list) {
128 u32 gates_still_open = entry->gate_mask;
129
130 /* For each traffic class, calculate each open gate duration,
131 * starting at this schedule entry and ending at the schedule
132 * entry containing a gate close event for that TC.
133 */
134 cur = entry;
135
136 do {
137 if (!gates_still_open)
138 break;
139
140 for (tc = 0; tc < num_tc; tc++) {
141 if (!(gates_still_open & BIT(tc)))
142 continue;
143
144 if (cur->gate_mask & BIT(tc))
145 entry->gate_duration[tc] += cur->interval;
146 else
147 gates_still_open &= ~BIT(tc);
148 }
149
150 cur = list_next_entry_circular(cur, &sched->entries, list);
151 } while (cur != entry);
152
153 /* Keep track of the maximum gate duration for each traffic
154 * class, taking care to not confuse a traffic class which is
155 * temporarily closed with one that is always closed.
156 */
157 for (tc = 0; tc < num_tc; tc++)
158 if (entry->gate_duration[tc] &&
159 sched->max_open_gate_duration[tc] < entry->gate_duration[tc])
160 sched->max_open_gate_duration[tc] = entry->gate_duration[tc];
161 }
162 }
163
taprio_entry_allows_tx(ktime_t skb_end_time,struct sched_entry * entry,int tc)164 static bool taprio_entry_allows_tx(ktime_t skb_end_time,
165 struct sched_entry *entry, int tc)
166 {
167 return ktime_before(skb_end_time, entry->gate_close_time[tc]);
168 }
169
sched_base_time(const struct sched_gate_list * sched)170 static ktime_t sched_base_time(const struct sched_gate_list *sched)
171 {
172 if (!sched)
173 return KTIME_MAX;
174
175 return ns_to_ktime(sched->base_time);
176 }
177
taprio_mono_to_any(const struct taprio_sched * q,ktime_t mono)178 static ktime_t taprio_mono_to_any(const struct taprio_sched *q, ktime_t mono)
179 {
180 /* This pairs with WRITE_ONCE() in taprio_parse_clockid() */
181 enum tk_offsets tk_offset = READ_ONCE(q->tk_offset);
182
183 switch (tk_offset) {
184 case TK_OFFS_MAX:
185 return mono;
186 default:
187 return ktime_mono_to_any(mono, tk_offset);
188 }
189 }
190
taprio_get_time(const struct taprio_sched * q)191 static ktime_t taprio_get_time(const struct taprio_sched *q)
192 {
193 return taprio_mono_to_any(q, ktime_get());
194 }
195
taprio_free_sched_cb(struct rcu_head * head)196 static void taprio_free_sched_cb(struct rcu_head *head)
197 {
198 struct sched_gate_list *sched = container_of(head, struct sched_gate_list, rcu);
199 struct sched_entry *entry, *n;
200
201 list_for_each_entry_safe(entry, n, &sched->entries, list) {
202 list_del(&entry->list);
203 kfree(entry);
204 }
205
206 kfree(sched);
207 }
208
switch_schedules(struct taprio_sched * q,struct sched_gate_list ** admin,struct sched_gate_list ** oper)209 static void switch_schedules(struct taprio_sched *q,
210 struct sched_gate_list **admin,
211 struct sched_gate_list **oper)
212 {
213 rcu_assign_pointer(q->oper_sched, *admin);
214 rcu_assign_pointer(q->admin_sched, NULL);
215
216 if (*oper)
217 call_rcu(&(*oper)->rcu, taprio_free_sched_cb);
218
219 *oper = *admin;
220 *admin = NULL;
221 }
222
223 /* Get how much time has been already elapsed in the current cycle. */
get_cycle_time_elapsed(struct sched_gate_list * sched,ktime_t time)224 static s32 get_cycle_time_elapsed(struct sched_gate_list *sched, ktime_t time)
225 {
226 ktime_t time_since_sched_start;
227 s32 time_elapsed;
228
229 time_since_sched_start = ktime_sub(time, sched->base_time);
230 div_s64_rem(time_since_sched_start, sched->cycle_time, &time_elapsed);
231
232 return time_elapsed;
233 }
234
get_interval_end_time(struct sched_gate_list * sched,struct sched_gate_list * admin,struct sched_entry * entry,ktime_t intv_start)235 static ktime_t get_interval_end_time(struct sched_gate_list *sched,
236 struct sched_gate_list *admin,
237 struct sched_entry *entry,
238 ktime_t intv_start)
239 {
240 s32 cycle_elapsed = get_cycle_time_elapsed(sched, intv_start);
241 ktime_t intv_end, cycle_ext_end, cycle_end;
242
243 cycle_end = ktime_add_ns(intv_start, sched->cycle_time - cycle_elapsed);
244 intv_end = ktime_add_ns(intv_start, entry->interval);
245 cycle_ext_end = ktime_add(cycle_end, sched->cycle_time_extension);
246
247 if (ktime_before(intv_end, cycle_end))
248 return intv_end;
249 else if (admin && admin != sched &&
250 ktime_after(admin->base_time, cycle_end) &&
251 ktime_before(admin->base_time, cycle_ext_end))
252 return admin->base_time;
253 else
254 return cycle_end;
255 }
256
length_to_duration(struct taprio_sched * q,int len)257 static int length_to_duration(struct taprio_sched *q, int len)
258 {
259 return div_u64(len * atomic64_read(&q->picos_per_byte), PSEC_PER_NSEC);
260 }
261
duration_to_length(struct taprio_sched * q,u64 duration)262 static int duration_to_length(struct taprio_sched *q, u64 duration)
263 {
264 return div_u64(duration * PSEC_PER_NSEC, atomic64_read(&q->picos_per_byte));
265 }
266
267 /* Sets sched->max_sdu[] and sched->max_frm_len[] to the minimum between the
268 * q->max_sdu[] requested by the user and the max_sdu dynamically determined by
269 * the maximum open gate durations at the given link speed.
270 */
taprio_update_queue_max_sdu(struct taprio_sched * q,struct sched_gate_list * sched,struct qdisc_size_table * stab)271 static void taprio_update_queue_max_sdu(struct taprio_sched *q,
272 struct sched_gate_list *sched,
273 struct qdisc_size_table *stab)
274 {
275 struct net_device *dev = qdisc_dev(q->root);
276 int num_tc = netdev_get_num_tc(dev);
277 u32 max_sdu_from_user;
278 u32 max_sdu_dynamic;
279 u32 max_sdu;
280 int tc;
281
282 for (tc = 0; tc < num_tc; tc++) {
283 max_sdu_from_user = q->max_sdu[tc] ?: U32_MAX;
284
285 /* TC gate never closes => keep the queueMaxSDU
286 * selected by the user
287 */
288 if (sched->max_open_gate_duration[tc] == sched->cycle_time) {
289 max_sdu_dynamic = U32_MAX;
290 } else {
291 u32 max_frm_len;
292
293 max_frm_len = duration_to_length(q, sched->max_open_gate_duration[tc]);
294 /* Compensate for L1 overhead from size table,
295 * but don't let the frame size go negative
296 */
297 if (stab) {
298 max_frm_len -= stab->szopts.overhead;
299 max_frm_len = max_t(int, max_frm_len,
300 dev->hard_header_len + 1);
301 }
302 max_sdu_dynamic = max_frm_len - dev->hard_header_len;
303 if (max_sdu_dynamic > dev->max_mtu)
304 max_sdu_dynamic = U32_MAX;
305 }
306
307 max_sdu = min(max_sdu_dynamic, max_sdu_from_user);
308
309 if (max_sdu != U32_MAX) {
310 sched->max_frm_len[tc] = max_sdu + dev->hard_header_len;
311 sched->max_sdu[tc] = max_sdu;
312 } else {
313 sched->max_frm_len[tc] = U32_MAX; /* never oversized */
314 sched->max_sdu[tc] = 0;
315 }
316 }
317 }
318
319 /* Returns the entry corresponding to next available interval. If
320 * validate_interval is set, it only validates whether the timestamp occurs
321 * when the gate corresponding to the skb's traffic class is open.
322 */
find_entry_to_transmit(struct sk_buff * skb,struct Qdisc * sch,struct sched_gate_list * sched,struct sched_gate_list * admin,ktime_t time,ktime_t * interval_start,ktime_t * interval_end,bool validate_interval)323 static struct sched_entry *find_entry_to_transmit(struct sk_buff *skb,
324 struct Qdisc *sch,
325 struct sched_gate_list *sched,
326 struct sched_gate_list *admin,
327 ktime_t time,
328 ktime_t *interval_start,
329 ktime_t *interval_end,
330 bool validate_interval)
331 {
332 ktime_t curr_intv_start, curr_intv_end, cycle_end, packet_transmit_time;
333 ktime_t earliest_txtime = KTIME_MAX, txtime, cycle, transmit_end_time;
334 struct sched_entry *entry = NULL, *entry_found = NULL;
335 struct taprio_sched *q = qdisc_priv(sch);
336 struct net_device *dev = qdisc_dev(sch);
337 bool entry_available = false;
338 s32 cycle_elapsed;
339 int tc, n;
340
341 tc = netdev_get_prio_tc_map(dev, skb->priority);
342 packet_transmit_time = length_to_duration(q, qdisc_pkt_len(skb));
343
344 *interval_start = 0;
345 *interval_end = 0;
346
347 if (!sched)
348 return NULL;
349
350 cycle = sched->cycle_time;
351 cycle_elapsed = get_cycle_time_elapsed(sched, time);
352 curr_intv_end = ktime_sub_ns(time, cycle_elapsed);
353 cycle_end = ktime_add_ns(curr_intv_end, cycle);
354
355 list_for_each_entry(entry, &sched->entries, list) {
356 curr_intv_start = curr_intv_end;
357 curr_intv_end = get_interval_end_time(sched, admin, entry,
358 curr_intv_start);
359
360 if (ktime_after(curr_intv_start, cycle_end))
361 break;
362
363 if (!(entry->gate_mask & BIT(tc)) ||
364 packet_transmit_time > entry->interval)
365 continue;
366
367 txtime = entry->next_txtime;
368
369 if (ktime_before(txtime, time) || validate_interval) {
370 transmit_end_time = ktime_add_ns(time, packet_transmit_time);
371 if ((ktime_before(curr_intv_start, time) &&
372 ktime_before(transmit_end_time, curr_intv_end)) ||
373 (ktime_after(curr_intv_start, time) && !validate_interval)) {
374 entry_found = entry;
375 *interval_start = curr_intv_start;
376 *interval_end = curr_intv_end;
377 break;
378 } else if (!entry_available && !validate_interval) {
379 /* Here, we are just trying to find out the
380 * first available interval in the next cycle.
381 */
382 entry_available = true;
383 entry_found = entry;
384 *interval_start = ktime_add_ns(curr_intv_start, cycle);
385 *interval_end = ktime_add_ns(curr_intv_end, cycle);
386 }
387 } else if (ktime_before(txtime, earliest_txtime) &&
388 !entry_available) {
389 earliest_txtime = txtime;
390 entry_found = entry;
391 n = div_s64(ktime_sub(txtime, curr_intv_start), cycle);
392 *interval_start = ktime_add(curr_intv_start, n * cycle);
393 *interval_end = ktime_add(curr_intv_end, n * cycle);
394 }
395 }
396
397 return entry_found;
398 }
399
is_valid_interval(struct sk_buff * skb,struct Qdisc * sch)400 static bool is_valid_interval(struct sk_buff *skb, struct Qdisc *sch)
401 {
402 struct taprio_sched *q = qdisc_priv(sch);
403 struct sched_gate_list *sched, *admin;
404 ktime_t interval_start, interval_end;
405 struct sched_entry *entry;
406
407 rcu_read_lock();
408 sched = rcu_dereference(q->oper_sched);
409 admin = rcu_dereference(q->admin_sched);
410
411 entry = find_entry_to_transmit(skb, sch, sched, admin, skb->tstamp,
412 &interval_start, &interval_end, true);
413 rcu_read_unlock();
414
415 return entry;
416 }
417
418 /* This returns the tstamp value set by TCP in terms of the set clock. */
get_tcp_tstamp(struct taprio_sched * q,struct sk_buff * skb)419 static ktime_t get_tcp_tstamp(struct taprio_sched *q, struct sk_buff *skb)
420 {
421 unsigned int offset = skb_network_offset(skb);
422 const struct ipv6hdr *ipv6h;
423 const struct iphdr *iph;
424 struct ipv6hdr _ipv6h;
425
426 ipv6h = skb_header_pointer(skb, offset, sizeof(_ipv6h), &_ipv6h);
427 if (!ipv6h)
428 return 0;
429
430 if (ipv6h->version == 4) {
431 iph = (struct iphdr *)ipv6h;
432 offset += iph->ihl * 4;
433
434 /* special-case 6in4 tunnelling, as that is a common way to get
435 * v6 connectivity in the home
436 */
437 if (iph->protocol == IPPROTO_IPV6) {
438 ipv6h = skb_header_pointer(skb, offset,
439 sizeof(_ipv6h), &_ipv6h);
440
441 if (!ipv6h || ipv6h->nexthdr != IPPROTO_TCP)
442 return 0;
443 } else if (iph->protocol != IPPROTO_TCP) {
444 return 0;
445 }
446 } else if (ipv6h->version == 6 && ipv6h->nexthdr != IPPROTO_TCP) {
447 return 0;
448 }
449
450 return taprio_mono_to_any(q, skb->skb_mstamp_ns);
451 }
452
453 /* There are a few scenarios where we will have to modify the txtime from
454 * what is read from next_txtime in sched_entry. They are:
455 * 1. If txtime is in the past,
456 * a. The gate for the traffic class is currently open and packet can be
457 * transmitted before it closes, schedule the packet right away.
458 * b. If the gate corresponding to the traffic class is going to open later
459 * in the cycle, set the txtime of packet to the interval start.
460 * 2. If txtime is in the future, there are packets corresponding to the
461 * current traffic class waiting to be transmitted. So, the following
462 * possibilities exist:
463 * a. We can transmit the packet before the window containing the txtime
464 * closes.
465 * b. The window might close before the transmission can be completed
466 * successfully. So, schedule the packet in the next open window.
467 */
get_packet_txtime(struct sk_buff * skb,struct Qdisc * sch)468 static long get_packet_txtime(struct sk_buff *skb, struct Qdisc *sch)
469 {
470 ktime_t transmit_end_time, interval_end, interval_start, tcp_tstamp;
471 struct taprio_sched *q = qdisc_priv(sch);
472 struct sched_gate_list *sched, *admin;
473 ktime_t minimum_time, now, txtime;
474 int len, packet_transmit_time;
475 struct sched_entry *entry;
476 bool sched_changed;
477
478 now = taprio_get_time(q);
479 minimum_time = ktime_add_ns(now, q->txtime_delay);
480
481 tcp_tstamp = get_tcp_tstamp(q, skb);
482 minimum_time = max_t(ktime_t, minimum_time, tcp_tstamp);
483
484 rcu_read_lock();
485 admin = rcu_dereference(q->admin_sched);
486 sched = rcu_dereference(q->oper_sched);
487 if (admin && ktime_after(minimum_time, admin->base_time))
488 switch_schedules(q, &admin, &sched);
489
490 /* Until the schedule starts, all the queues are open */
491 if (!sched || ktime_before(minimum_time, sched->base_time)) {
492 txtime = minimum_time;
493 goto done;
494 }
495
496 len = qdisc_pkt_len(skb);
497 packet_transmit_time = length_to_duration(q, len);
498
499 do {
500 sched_changed = false;
501
502 entry = find_entry_to_transmit(skb, sch, sched, admin,
503 minimum_time,
504 &interval_start, &interval_end,
505 false);
506 if (!entry) {
507 txtime = 0;
508 goto done;
509 }
510
511 txtime = entry->next_txtime;
512 txtime = max_t(ktime_t, txtime, minimum_time);
513 txtime = max_t(ktime_t, txtime, interval_start);
514
515 if (admin && admin != sched &&
516 ktime_after(txtime, admin->base_time)) {
517 sched = admin;
518 sched_changed = true;
519 continue;
520 }
521
522 transmit_end_time = ktime_add(txtime, packet_transmit_time);
523 minimum_time = transmit_end_time;
524
525 /* Update the txtime of current entry to the next time it's
526 * interval starts.
527 */
528 if (ktime_after(transmit_end_time, interval_end))
529 entry->next_txtime = ktime_add(interval_start, sched->cycle_time);
530 } while (sched_changed || ktime_after(transmit_end_time, interval_end));
531
532 entry->next_txtime = transmit_end_time;
533
534 done:
535 rcu_read_unlock();
536 return txtime;
537 }
538
539 /* Devices with full offload are expected to honor this in hardware */
taprio_skb_exceeds_queue_max_sdu(struct Qdisc * sch,struct sk_buff * skb)540 static bool taprio_skb_exceeds_queue_max_sdu(struct Qdisc *sch,
541 struct sk_buff *skb)
542 {
543 struct taprio_sched *q = qdisc_priv(sch);
544 struct net_device *dev = qdisc_dev(sch);
545 struct sched_gate_list *sched;
546 int prio = skb->priority;
547 bool exceeds = false;
548 u8 tc;
549
550 tc = netdev_get_prio_tc_map(dev, prio);
551
552 rcu_read_lock();
553 sched = rcu_dereference(q->oper_sched);
554 if (sched && skb->len > sched->max_frm_len[tc])
555 exceeds = true;
556 rcu_read_unlock();
557
558 return exceeds;
559 }
560
taprio_enqueue_one(struct sk_buff * skb,struct Qdisc * sch,struct Qdisc * child,struct sk_buff ** to_free)561 static int taprio_enqueue_one(struct sk_buff *skb, struct Qdisc *sch,
562 struct Qdisc *child, struct sk_buff **to_free)
563 {
564 struct taprio_sched *q = qdisc_priv(sch);
565
566 /* sk_flags are only safe to use on full sockets. */
567 if (skb->sk && sk_fullsock(skb->sk) && sock_flag(skb->sk, SOCK_TXTIME)) {
568 if (!is_valid_interval(skb, sch))
569 return qdisc_drop(skb, sch, to_free);
570 } else if (TXTIME_ASSIST_IS_ENABLED(q->flags)) {
571 skb->tstamp = get_packet_txtime(skb, sch);
572 if (!skb->tstamp)
573 return qdisc_drop(skb, sch, to_free);
574 }
575
576 qdisc_qstats_backlog_inc(sch, skb);
577 sch->q.qlen++;
578
579 return qdisc_enqueue(skb, child, to_free);
580 }
581
taprio_enqueue_segmented(struct sk_buff * skb,struct Qdisc * sch,struct Qdisc * child,struct sk_buff ** to_free)582 static int taprio_enqueue_segmented(struct sk_buff *skb, struct Qdisc *sch,
583 struct Qdisc *child,
584 struct sk_buff **to_free)
585 {
586 unsigned int slen = 0, numsegs = 0, len = qdisc_pkt_len(skb);
587 netdev_features_t features = netif_skb_features(skb);
588 struct sk_buff *segs, *nskb;
589 int ret;
590
591 segs = skb_gso_segment(skb, features & ~NETIF_F_GSO_MASK);
592 if (IS_ERR_OR_NULL(segs))
593 return qdisc_drop(skb, sch, to_free);
594
595 skb_list_walk_safe(segs, segs, nskb) {
596 skb_mark_not_on_list(segs);
597 qdisc_skb_cb(segs)->pkt_len = segs->len;
598 qdisc_skb_cb(segs)->pkt_segs = 1;
599 slen += segs->len;
600
601 /* FIXME: we should be segmenting to a smaller size
602 * rather than dropping these
603 */
604 if (taprio_skb_exceeds_queue_max_sdu(sch, segs))
605 ret = qdisc_drop(segs, sch, to_free);
606 else
607 ret = taprio_enqueue_one(segs, sch, child, to_free);
608
609 if (ret != NET_XMIT_SUCCESS) {
610 if (net_xmit_drop_count(ret))
611 qdisc_qstats_drop(sch);
612 } else {
613 numsegs++;
614 }
615 }
616
617 if (numsegs > 1)
618 qdisc_tree_reduce_backlog(sch, 1 - numsegs, len - slen);
619 consume_skb(skb);
620
621 return numsegs > 0 ? NET_XMIT_SUCCESS : NET_XMIT_DROP;
622 }
623
624 /* Will not be called in the full offload case, since the TX queues are
625 * attached to the Qdisc created using qdisc_create_dflt()
626 */
taprio_enqueue(struct sk_buff * skb,struct Qdisc * sch,struct sk_buff ** to_free)627 static int taprio_enqueue(struct sk_buff *skb, struct Qdisc *sch,
628 struct sk_buff **to_free)
629 {
630 struct taprio_sched *q = qdisc_priv(sch);
631 struct Qdisc *child;
632 int queue;
633
634 queue = skb_get_queue_mapping(skb);
635
636 child = q->qdiscs[queue];
637 if (unlikely(!child))
638 return qdisc_drop(skb, sch, to_free);
639
640 if (taprio_skb_exceeds_queue_max_sdu(sch, skb)) {
641 /* Large packets might not be transmitted when the transmission
642 * duration exceeds any configured interval. Therefore, segment
643 * the skb into smaller chunks. Drivers with full offload are
644 * expected to handle this in hardware.
645 */
646 if (skb_is_gso(skb))
647 return taprio_enqueue_segmented(skb, sch, child,
648 to_free);
649
650 return qdisc_drop(skb, sch, to_free);
651 }
652
653 return taprio_enqueue_one(skb, sch, child, to_free);
654 }
655
taprio_peek(struct Qdisc * sch)656 static struct sk_buff *taprio_peek(struct Qdisc *sch)
657 {
658 WARN_ONCE(1, "taprio only supports operating as root qdisc, peek() not implemented");
659 return NULL;
660 }
661
taprio_set_budgets(struct taprio_sched * q,struct sched_gate_list * sched,struct sched_entry * entry)662 static void taprio_set_budgets(struct taprio_sched *q,
663 struct sched_gate_list *sched,
664 struct sched_entry *entry)
665 {
666 struct net_device *dev = qdisc_dev(q->root);
667 int num_tc = netdev_get_num_tc(dev);
668 int tc, budget;
669
670 for (tc = 0; tc < num_tc; tc++) {
671 /* Traffic classes which never close have infinite budget */
672 if (entry->gate_duration[tc] == sched->cycle_time)
673 budget = INT_MAX;
674 else
675 budget = div64_u64((u64)entry->gate_duration[tc] * PSEC_PER_NSEC,
676 atomic64_read(&q->picos_per_byte));
677
678 atomic_set(&entry->budget[tc], budget);
679 }
680 }
681
682 /* When an skb is sent, it consumes from the budget of all traffic classes */
taprio_update_budgets(struct sched_entry * entry,size_t len,int tc_consumed,int num_tc)683 static int taprio_update_budgets(struct sched_entry *entry, size_t len,
684 int tc_consumed, int num_tc)
685 {
686 int tc, budget, new_budget = 0;
687
688 for (tc = 0; tc < num_tc; tc++) {
689 budget = atomic_read(&entry->budget[tc]);
690 /* Don't consume from infinite budget */
691 if (budget == INT_MAX) {
692 if (tc == tc_consumed)
693 new_budget = budget;
694 continue;
695 }
696
697 if (tc == tc_consumed)
698 new_budget = atomic_sub_return(len, &entry->budget[tc]);
699 else
700 atomic_sub(len, &entry->budget[tc]);
701 }
702
703 return new_budget;
704 }
705
taprio_dequeue_from_txq(struct Qdisc * sch,int txq,struct sched_entry * entry,u32 gate_mask)706 static struct sk_buff *taprio_dequeue_from_txq(struct Qdisc *sch, int txq,
707 struct sched_entry *entry,
708 u32 gate_mask)
709 {
710 struct taprio_sched *q = qdisc_priv(sch);
711 struct net_device *dev = qdisc_dev(sch);
712 struct Qdisc *child = q->qdiscs[txq];
713 int num_tc = netdev_get_num_tc(dev);
714 struct sk_buff *skb;
715 ktime_t guard;
716 int prio;
717 int len;
718 u8 tc;
719
720 if (unlikely(!child))
721 return NULL;
722
723 if (TXTIME_ASSIST_IS_ENABLED(q->flags))
724 goto skip_peek_checks;
725
726 skb = child->ops->peek(child);
727 if (!skb)
728 return NULL;
729
730 prio = skb->priority;
731 tc = netdev_get_prio_tc_map(dev, prio);
732
733 if (!(gate_mask & BIT(tc)))
734 return NULL;
735
736 len = qdisc_pkt_len(skb);
737 guard = ktime_add_ns(taprio_get_time(q), length_to_duration(q, len));
738
739 /* In the case that there's no gate entry, there's no
740 * guard band ...
741 */
742 if (gate_mask != TAPRIO_ALL_GATES_OPEN &&
743 !taprio_entry_allows_tx(guard, entry, tc))
744 return NULL;
745
746 /* ... and no budget. */
747 if (gate_mask != TAPRIO_ALL_GATES_OPEN &&
748 taprio_update_budgets(entry, len, tc, num_tc) < 0)
749 return NULL;
750
751 skip_peek_checks:
752 skb = child->ops->dequeue(child);
753 if (unlikely(!skb))
754 return NULL;
755
756 qdisc_bstats_update(sch, skb);
757 qdisc_qstats_backlog_dec(sch, skb);
758 sch->q.qlen--;
759
760 return skb;
761 }
762
taprio_next_tc_txq(struct net_device * dev,int tc,int * txq)763 static void taprio_next_tc_txq(struct net_device *dev, int tc, int *txq)
764 {
765 int offset = dev->tc_to_txq[tc].offset;
766 int count = dev->tc_to_txq[tc].count;
767
768 (*txq)++;
769 if (*txq == offset + count)
770 *txq = offset;
771 }
772
773 /* Prioritize higher traffic classes, and select among TXQs belonging to the
774 * same TC using round robin
775 */
taprio_dequeue_tc_priority(struct Qdisc * sch,struct sched_entry * entry,u32 gate_mask)776 static struct sk_buff *taprio_dequeue_tc_priority(struct Qdisc *sch,
777 struct sched_entry *entry,
778 u32 gate_mask)
779 {
780 struct taprio_sched *q = qdisc_priv(sch);
781 struct net_device *dev = qdisc_dev(sch);
782 int num_tc = netdev_get_num_tc(dev);
783 struct sk_buff *skb;
784 int tc;
785
786 for (tc = num_tc - 1; tc >= 0; tc--) {
787 int first_txq = q->cur_txq[tc];
788
789 if (!(gate_mask & BIT(tc)))
790 continue;
791
792 do {
793 skb = taprio_dequeue_from_txq(sch, q->cur_txq[tc],
794 entry, gate_mask);
795
796 taprio_next_tc_txq(dev, tc, &q->cur_txq[tc]);
797
798 if (q->cur_txq[tc] >= dev->num_tx_queues)
799 q->cur_txq[tc] = first_txq;
800
801 if (skb)
802 return skb;
803 } while (q->cur_txq[tc] != first_txq);
804 }
805
806 return NULL;
807 }
808
809 /* Broken way of prioritizing smaller TXQ indices and ignoring the traffic
810 * class other than to determine whether the gate is open or not
811 */
taprio_dequeue_txq_priority(struct Qdisc * sch,struct sched_entry * entry,u32 gate_mask)812 static struct sk_buff *taprio_dequeue_txq_priority(struct Qdisc *sch,
813 struct sched_entry *entry,
814 u32 gate_mask)
815 {
816 struct net_device *dev = qdisc_dev(sch);
817 struct sk_buff *skb;
818 int i;
819
820 for (i = 0; i < dev->num_tx_queues; i++) {
821 skb = taprio_dequeue_from_txq(sch, i, entry, gate_mask);
822 if (skb)
823 return skb;
824 }
825
826 return NULL;
827 }
828
829 /* Will not be called in the full offload case, since the TX queues are
830 * attached to the Qdisc created using qdisc_create_dflt()
831 */
taprio_dequeue(struct Qdisc * sch)832 static struct sk_buff *taprio_dequeue(struct Qdisc *sch)
833 {
834 struct taprio_sched *q = qdisc_priv(sch);
835 struct sk_buff *skb = NULL;
836 struct sched_entry *entry;
837 u32 gate_mask;
838
839 rcu_read_lock();
840 entry = rcu_dereference(q->current_entry);
841 /* if there's no entry, it means that the schedule didn't
842 * start yet, so force all gates to be open, this is in
843 * accordance to IEEE 802.1Qbv-2015 Section 8.6.9.4.5
844 * "AdminGateStates"
845 */
846 gate_mask = entry ? entry->gate_mask : TAPRIO_ALL_GATES_OPEN;
847 if (!gate_mask)
848 goto done;
849
850 if (static_branch_unlikely(&taprio_have_broken_mqprio) &&
851 !static_branch_likely(&taprio_have_working_mqprio)) {
852 /* Single NIC kind which is broken */
853 skb = taprio_dequeue_txq_priority(sch, entry, gate_mask);
854 } else if (static_branch_likely(&taprio_have_working_mqprio) &&
855 !static_branch_unlikely(&taprio_have_broken_mqprio)) {
856 /* Single NIC kind which prioritizes properly */
857 skb = taprio_dequeue_tc_priority(sch, entry, gate_mask);
858 } else {
859 /* Mixed NIC kinds present in system, need dynamic testing */
860 if (q->broken_mqprio)
861 skb = taprio_dequeue_txq_priority(sch, entry, gate_mask);
862 else
863 skb = taprio_dequeue_tc_priority(sch, entry, gate_mask);
864 }
865
866 done:
867 rcu_read_unlock();
868
869 return skb;
870 }
871
should_restart_cycle(const struct sched_gate_list * oper,const struct sched_entry * entry)872 static bool should_restart_cycle(const struct sched_gate_list *oper,
873 const struct sched_entry *entry)
874 {
875 if (list_is_last(&entry->list, &oper->entries))
876 return true;
877
878 if (ktime_compare(entry->end_time, oper->cycle_end_time) == 0)
879 return true;
880
881 return false;
882 }
883
should_change_schedules(const struct sched_gate_list * admin,const struct sched_gate_list * oper,ktime_t end_time)884 static bool should_change_schedules(const struct sched_gate_list *admin,
885 const struct sched_gate_list *oper,
886 ktime_t end_time)
887 {
888 ktime_t next_base_time, extension_time;
889
890 if (!admin)
891 return false;
892
893 next_base_time = sched_base_time(admin);
894
895 /* This is the simple case, the end_time would fall after
896 * the next schedule base_time.
897 */
898 if (ktime_compare(next_base_time, end_time) <= 0)
899 return true;
900
901 /* This is the cycle_time_extension case, if the end_time
902 * plus the amount that can be extended would fall after the
903 * next schedule base_time, we can extend the current schedule
904 * for that amount.
905 */
906 extension_time = ktime_add_ns(end_time, oper->cycle_time_extension);
907
908 /* FIXME: the IEEE 802.1Q-2018 Specification isn't clear about
909 * how precisely the extension should be made. So after
910 * conformance testing, this logic may change.
911 */
912 if (ktime_compare(next_base_time, extension_time) <= 0)
913 return true;
914
915 return false;
916 }
917
advance_sched(struct hrtimer * timer)918 static enum hrtimer_restart advance_sched(struct hrtimer *timer)
919 {
920 struct taprio_sched *q = container_of(timer, struct taprio_sched,
921 advance_timer);
922 struct net_device *dev = qdisc_dev(q->root);
923 struct sched_gate_list *oper, *admin;
924 int num_tc = netdev_get_num_tc(dev);
925 struct sched_entry *entry, *next;
926 struct Qdisc *sch = q->root;
927 ktime_t end_time;
928 int tc;
929
930 spin_lock(&q->current_entry_lock);
931 entry = rcu_dereference_protected(q->current_entry,
932 lockdep_is_held(&q->current_entry_lock));
933 oper = rcu_dereference_protected(q->oper_sched,
934 lockdep_is_held(&q->current_entry_lock));
935 admin = rcu_dereference_protected(q->admin_sched,
936 lockdep_is_held(&q->current_entry_lock));
937
938 if (!oper)
939 switch_schedules(q, &admin, &oper);
940
941 /* This can happen in two cases: 1. this is the very first run
942 * of this function (i.e. we weren't running any schedule
943 * previously); 2. The previous schedule just ended. The first
944 * entry of all schedules are pre-calculated during the
945 * schedule initialization.
946 */
947 if (unlikely(!entry || entry->end_time == oper->base_time)) {
948 next = list_first_entry(&oper->entries, struct sched_entry,
949 list);
950 end_time = next->end_time;
951 goto first_run;
952 }
953
954 if (should_restart_cycle(oper, entry)) {
955 next = list_first_entry(&oper->entries, struct sched_entry,
956 list);
957 oper->cycle_end_time = ktime_add_ns(oper->cycle_end_time,
958 oper->cycle_time);
959 } else {
960 next = list_next_entry(entry, list);
961 }
962
963 end_time = ktime_add_ns(entry->end_time, next->interval);
964 end_time = min_t(ktime_t, end_time, oper->cycle_end_time);
965
966 for (tc = 0; tc < num_tc; tc++) {
967 if (next->gate_duration[tc] == oper->cycle_time)
968 next->gate_close_time[tc] = KTIME_MAX;
969 else
970 next->gate_close_time[tc] = ktime_add_ns(entry->end_time,
971 next->gate_duration[tc]);
972 }
973
974 if (should_change_schedules(admin, oper, end_time)) {
975 /* Set things so the next time this runs, the new
976 * schedule runs.
977 */
978 end_time = sched_base_time(admin);
979 switch_schedules(q, &admin, &oper);
980 }
981
982 next->end_time = end_time;
983 taprio_set_budgets(q, oper, next);
984
985 first_run:
986 rcu_assign_pointer(q->current_entry, next);
987 spin_unlock(&q->current_entry_lock);
988
989 hrtimer_set_expires(&q->advance_timer, end_time);
990
991 rcu_read_lock();
992 __netif_schedule(sch);
993 rcu_read_unlock();
994
995 return HRTIMER_RESTART;
996 }
997
998 static const struct nla_policy entry_policy[TCA_TAPRIO_SCHED_ENTRY_MAX + 1] = {
999 [TCA_TAPRIO_SCHED_ENTRY_INDEX] = { .type = NLA_U32 },
1000 [TCA_TAPRIO_SCHED_ENTRY_CMD] = { .type = NLA_U8 },
1001 [TCA_TAPRIO_SCHED_ENTRY_GATE_MASK] = { .type = NLA_U32 },
1002 [TCA_TAPRIO_SCHED_ENTRY_INTERVAL] = { .type = NLA_U32 },
1003 };
1004
1005 static const struct nla_policy taprio_tc_policy[TCA_TAPRIO_TC_ENTRY_MAX + 1] = {
1006 [TCA_TAPRIO_TC_ENTRY_INDEX] = NLA_POLICY_MAX(NLA_U32,
1007 TC_QOPT_MAX_QUEUE - 1),
1008 [TCA_TAPRIO_TC_ENTRY_MAX_SDU] = { .type = NLA_U32 },
1009 [TCA_TAPRIO_TC_ENTRY_FP] = NLA_POLICY_RANGE(NLA_U32,
1010 TC_FP_EXPRESS,
1011 TC_FP_PREEMPTIBLE),
1012 };
1013
1014 static const struct netlink_range_validation_signed taprio_cycle_time_range = {
1015 .min = 0,
1016 .max = INT_MAX,
1017 };
1018
1019 static const struct nla_policy taprio_policy[TCA_TAPRIO_ATTR_MAX + 1] = {
1020 [TCA_TAPRIO_ATTR_PRIOMAP] = {
1021 .len = sizeof(struct tc_mqprio_qopt)
1022 },
1023 [TCA_TAPRIO_ATTR_SCHED_ENTRY_LIST] = { .type = NLA_NESTED },
1024 [TCA_TAPRIO_ATTR_SCHED_BASE_TIME] = { .type = NLA_S64 },
1025 [TCA_TAPRIO_ATTR_SCHED_SINGLE_ENTRY] = { .type = NLA_NESTED },
1026 [TCA_TAPRIO_ATTR_SCHED_CLOCKID] = { .type = NLA_S32 },
1027 [TCA_TAPRIO_ATTR_SCHED_CYCLE_TIME] =
1028 NLA_POLICY_FULL_RANGE_SIGNED(NLA_S64, &taprio_cycle_time_range),
1029 [TCA_TAPRIO_ATTR_SCHED_CYCLE_TIME_EXTENSION] = { .type = NLA_S64 },
1030 [TCA_TAPRIO_ATTR_FLAGS] =
1031 NLA_POLICY_MASK(NLA_U32, TAPRIO_SUPPORTED_FLAGS),
1032 [TCA_TAPRIO_ATTR_TXTIME_DELAY] = { .type = NLA_U32 },
1033 [TCA_TAPRIO_ATTR_TC_ENTRY] = { .type = NLA_NESTED },
1034 };
1035
fill_sched_entry(struct taprio_sched * q,struct nlattr ** tb,struct sched_entry * entry,struct netlink_ext_ack * extack)1036 static int fill_sched_entry(struct taprio_sched *q, struct nlattr **tb,
1037 struct sched_entry *entry,
1038 struct netlink_ext_ack *extack)
1039 {
1040 int min_duration = length_to_duration(q, ETH_ZLEN);
1041 u32 interval = 0;
1042
1043 if (tb[TCA_TAPRIO_SCHED_ENTRY_CMD])
1044 entry->command = nla_get_u8(
1045 tb[TCA_TAPRIO_SCHED_ENTRY_CMD]);
1046
1047 if (tb[TCA_TAPRIO_SCHED_ENTRY_GATE_MASK])
1048 entry->gate_mask = nla_get_u32(
1049 tb[TCA_TAPRIO_SCHED_ENTRY_GATE_MASK]);
1050
1051 if (tb[TCA_TAPRIO_SCHED_ENTRY_INTERVAL])
1052 interval = nla_get_u32(
1053 tb[TCA_TAPRIO_SCHED_ENTRY_INTERVAL]);
1054
1055 /* The interval should allow at least the minimum ethernet
1056 * frame to go out.
1057 */
1058 if (interval < min_duration) {
1059 NL_SET_ERR_MSG(extack, "Invalid interval for schedule entry");
1060 return -EINVAL;
1061 }
1062
1063 entry->interval = interval;
1064
1065 return 0;
1066 }
1067
parse_sched_entry(struct taprio_sched * q,struct nlattr * n,struct sched_entry * entry,int index,struct netlink_ext_ack * extack)1068 static int parse_sched_entry(struct taprio_sched *q, struct nlattr *n,
1069 struct sched_entry *entry, int index,
1070 struct netlink_ext_ack *extack)
1071 {
1072 struct nlattr *tb[TCA_TAPRIO_SCHED_ENTRY_MAX + 1] = { };
1073 int err;
1074
1075 err = nla_parse_nested_deprecated(tb, TCA_TAPRIO_SCHED_ENTRY_MAX, n,
1076 entry_policy, NULL);
1077 if (err < 0) {
1078 NL_SET_ERR_MSG(extack, "Could not parse nested entry");
1079 return -EINVAL;
1080 }
1081
1082 entry->index = index;
1083
1084 return fill_sched_entry(q, tb, entry, extack);
1085 }
1086
parse_sched_list(struct taprio_sched * q,struct nlattr * list,struct sched_gate_list * sched,struct netlink_ext_ack * extack)1087 static int parse_sched_list(struct taprio_sched *q, struct nlattr *list,
1088 struct sched_gate_list *sched,
1089 struct netlink_ext_ack *extack)
1090 {
1091 struct nlattr *n;
1092 int err, rem;
1093 int i = 0;
1094
1095 if (!list)
1096 return -EINVAL;
1097
1098 nla_for_each_nested(n, list, rem) {
1099 struct sched_entry *entry;
1100
1101 if (nla_type(n) != TCA_TAPRIO_SCHED_ENTRY) {
1102 NL_SET_ERR_MSG(extack, "Attribute is not of type 'entry'");
1103 continue;
1104 }
1105
1106 entry = kzalloc_obj(*entry);
1107 if (!entry) {
1108 NL_SET_ERR_MSG(extack, "Not enough memory for entry");
1109 return -ENOMEM;
1110 }
1111
1112 err = parse_sched_entry(q, n, entry, i, extack);
1113 if (err < 0) {
1114 kfree(entry);
1115 return err;
1116 }
1117
1118 list_add_tail(&entry->list, &sched->entries);
1119 i++;
1120 }
1121
1122 sched->num_entries = i;
1123
1124 return i;
1125 }
1126
parse_taprio_schedule(struct taprio_sched * q,struct nlattr ** tb,struct sched_gate_list * new,struct netlink_ext_ack * extack)1127 static int parse_taprio_schedule(struct taprio_sched *q, struct nlattr **tb,
1128 struct sched_gate_list *new,
1129 struct netlink_ext_ack *extack)
1130 {
1131 int err = 0;
1132
1133 if (tb[TCA_TAPRIO_ATTR_SCHED_SINGLE_ENTRY]) {
1134 NL_SET_ERR_MSG(extack, "Adding a single entry is not supported");
1135 return -ENOTSUPP;
1136 }
1137
1138 if (tb[TCA_TAPRIO_ATTR_SCHED_BASE_TIME])
1139 new->base_time = nla_get_s64(tb[TCA_TAPRIO_ATTR_SCHED_BASE_TIME]);
1140
1141 if (tb[TCA_TAPRIO_ATTR_SCHED_CYCLE_TIME_EXTENSION])
1142 new->cycle_time_extension = nla_get_s64(tb[TCA_TAPRIO_ATTR_SCHED_CYCLE_TIME_EXTENSION]);
1143
1144 if (tb[TCA_TAPRIO_ATTR_SCHED_CYCLE_TIME])
1145 new->cycle_time = nla_get_s64(tb[TCA_TAPRIO_ATTR_SCHED_CYCLE_TIME]);
1146
1147 if (tb[TCA_TAPRIO_ATTR_SCHED_ENTRY_LIST])
1148 err = parse_sched_list(q, tb[TCA_TAPRIO_ATTR_SCHED_ENTRY_LIST],
1149 new, extack);
1150 if (err < 0)
1151 return err;
1152
1153 if (!new->cycle_time) {
1154 struct sched_entry *entry;
1155 ktime_t cycle = 0;
1156
1157 list_for_each_entry(entry, &new->entries, list)
1158 cycle = ktime_add_ns(cycle, entry->interval);
1159
1160 if (cycle < 0 || cycle > INT_MAX) {
1161 NL_SET_ERR_MSG(extack, "'cycle_time' is too big");
1162 return -EINVAL;
1163 }
1164
1165 new->cycle_time = cycle;
1166 }
1167
1168 if (new->cycle_time < new->num_entries * length_to_duration(q, ETH_ZLEN)) {
1169 NL_SET_ERR_MSG(extack, "'cycle_time' is too small");
1170 return -EINVAL;
1171 }
1172
1173 taprio_calculate_gate_durations(q, new);
1174
1175 return 0;
1176 }
1177
taprio_parse_mqprio_opt(struct net_device * dev,struct tc_mqprio_qopt * qopt,struct netlink_ext_ack * extack,u32 taprio_flags)1178 static int taprio_parse_mqprio_opt(struct net_device *dev,
1179 struct tc_mqprio_qopt *qopt,
1180 struct netlink_ext_ack *extack,
1181 u32 taprio_flags)
1182 {
1183 bool allow_overlapping_txqs = TXTIME_ASSIST_IS_ENABLED(taprio_flags);
1184
1185 if (!qopt) {
1186 if (!dev->num_tc) {
1187 NL_SET_ERR_MSG(extack, "'mqprio' configuration is necessary");
1188 return -EINVAL;
1189 }
1190 return 0;
1191 }
1192
1193 /* taprio imposes that traffic classes map 1:n to tx queues */
1194 if (qopt->num_tc > dev->num_tx_queues) {
1195 NL_SET_ERR_MSG(extack, "Number of traffic classes is greater than number of HW queues");
1196 return -EINVAL;
1197 }
1198
1199 /* For some reason, in txtime-assist mode, we allow TXQ ranges for
1200 * different TCs to overlap, and just validate the TXQ ranges.
1201 */
1202 return mqprio_validate_qopt(dev, qopt, true, allow_overlapping_txqs,
1203 extack);
1204 }
1205
taprio_get_start_time(struct Qdisc * sch,struct sched_gate_list * sched,ktime_t * start)1206 static int taprio_get_start_time(struct Qdisc *sch,
1207 struct sched_gate_list *sched,
1208 ktime_t *start)
1209 {
1210 struct taprio_sched *q = qdisc_priv(sch);
1211 ktime_t now, base, cycle;
1212 s64 n;
1213
1214 base = sched_base_time(sched);
1215 now = taprio_get_time(q);
1216
1217 if (ktime_after(base, now)) {
1218 *start = base;
1219 return 0;
1220 }
1221
1222 cycle = sched->cycle_time;
1223
1224 /* The qdisc is expected to have at least one sched_entry. Moreover,
1225 * any entry must have 'interval' > 0. Thus if the cycle time is zero,
1226 * something went really wrong. In that case, we should warn about this
1227 * inconsistent state and return error.
1228 */
1229 if (WARN_ON(!cycle))
1230 return -EFAULT;
1231
1232 /* Schedule the start time for the beginning of the next
1233 * cycle.
1234 */
1235 n = div64_s64(ktime_sub_ns(now, base), cycle);
1236 *start = ktime_add_ns(base, (n + 1) * cycle);
1237 return 0;
1238 }
1239
setup_first_end_time(struct taprio_sched * q,struct sched_gate_list * sched,ktime_t base)1240 static void setup_first_end_time(struct taprio_sched *q,
1241 struct sched_gate_list *sched, ktime_t base)
1242 {
1243 struct net_device *dev = qdisc_dev(q->root);
1244 int num_tc = netdev_get_num_tc(dev);
1245 struct sched_entry *first;
1246 ktime_t cycle;
1247 int tc;
1248
1249 first = list_first_entry(&sched->entries,
1250 struct sched_entry, list);
1251
1252 cycle = sched->cycle_time;
1253
1254 /* FIXME: find a better place to do this */
1255 sched->cycle_end_time = ktime_add_ns(base, cycle);
1256
1257 first->end_time = ktime_add_ns(base, first->interval);
1258 taprio_set_budgets(q, sched, first);
1259
1260 for (tc = 0; tc < num_tc; tc++) {
1261 if (first->gate_duration[tc] == sched->cycle_time)
1262 first->gate_close_time[tc] = KTIME_MAX;
1263 else
1264 first->gate_close_time[tc] = ktime_add_ns(base, first->gate_duration[tc]);
1265 }
1266
1267 rcu_assign_pointer(q->current_entry, NULL);
1268 }
1269
taprio_start_sched(struct Qdisc * sch,ktime_t start,struct sched_gate_list * new)1270 static void taprio_start_sched(struct Qdisc *sch,
1271 ktime_t start, struct sched_gate_list *new)
1272 {
1273 struct taprio_sched *q = qdisc_priv(sch);
1274 ktime_t expires;
1275
1276 if (FULL_OFFLOAD_IS_ENABLED(q->flags))
1277 return;
1278
1279 expires = hrtimer_get_expires(&q->advance_timer);
1280 if (expires == 0)
1281 expires = KTIME_MAX;
1282
1283 /* If the new schedule starts before the next expiration, we
1284 * reprogram it to the earliest one, so we change the admin
1285 * schedule to the operational one at the right time.
1286 */
1287 start = min_t(ktime_t, start, expires);
1288
1289 hrtimer_start(&q->advance_timer, start, HRTIMER_MODE_ABS);
1290 }
1291
taprio_set_picos_per_byte(struct net_device * dev,struct taprio_sched * q,struct netlink_ext_ack * extack)1292 static void taprio_set_picos_per_byte(struct net_device *dev,
1293 struct taprio_sched *q,
1294 struct netlink_ext_ack *extack)
1295 {
1296 struct ethtool_link_ksettings ecmd;
1297 int speed = SPEED_10;
1298 int picos_per_byte;
1299 int err;
1300
1301 err = __ethtool_get_link_ksettings(dev, &ecmd);
1302 if (err < 0)
1303 goto skip;
1304
1305 if (ecmd.base.speed && ecmd.base.speed != SPEED_UNKNOWN)
1306 speed = ecmd.base.speed;
1307
1308 skip:
1309 picos_per_byte = (USEC_PER_SEC * 8) / speed;
1310 if (picos_per_byte < TAPRIO_PICOS_PER_BYTE_MIN) {
1311 if (!extack)
1312 pr_warn("Link speed %d is too high. Schedule may be inaccurate.\n",
1313 speed);
1314 NL_SET_ERR_MSG_FMT_MOD(extack,
1315 "Link speed %d is too high. Schedule may be inaccurate.",
1316 speed);
1317 picos_per_byte = TAPRIO_PICOS_PER_BYTE_MIN;
1318 }
1319
1320 atomic64_set(&q->picos_per_byte, picos_per_byte);
1321 netdev_dbg(dev, "taprio: set %s's picos_per_byte to: %lld, linkspeed: %d\n",
1322 dev->name, (long long)atomic64_read(&q->picos_per_byte),
1323 ecmd.base.speed);
1324 }
1325
taprio_dev_notifier(struct notifier_block * nb,unsigned long event,void * ptr)1326 static int taprio_dev_notifier(struct notifier_block *nb, unsigned long event,
1327 void *ptr)
1328 {
1329 struct net_device *dev = netdev_notifier_info_to_dev(ptr);
1330 struct sched_gate_list *oper, *admin;
1331 struct qdisc_size_table *stab;
1332 struct taprio_sched *q;
1333
1334 ASSERT_RTNL();
1335
1336 if (event != NETDEV_UP && event != NETDEV_CHANGE)
1337 return NOTIFY_DONE;
1338
1339 list_for_each_entry(q, &taprio_list, taprio_list) {
1340 if (dev != qdisc_dev(q->root))
1341 continue;
1342
1343 taprio_set_picos_per_byte(dev, q, NULL);
1344
1345 stab = rtnl_dereference(q->root->stab);
1346
1347 rcu_read_lock();
1348 oper = rcu_dereference(q->oper_sched);
1349 if (oper)
1350 taprio_update_queue_max_sdu(q, oper, stab);
1351
1352 admin = rcu_dereference(q->admin_sched);
1353 if (admin)
1354 taprio_update_queue_max_sdu(q, admin, stab);
1355 rcu_read_unlock();
1356
1357 break;
1358 }
1359
1360 return NOTIFY_DONE;
1361 }
1362
setup_txtime(struct taprio_sched * q,struct sched_gate_list * sched,ktime_t base)1363 static void setup_txtime(struct taprio_sched *q,
1364 struct sched_gate_list *sched, ktime_t base)
1365 {
1366 struct sched_entry *entry;
1367 u64 interval = 0;
1368
1369 list_for_each_entry(entry, &sched->entries, list) {
1370 entry->next_txtime = ktime_add_ns(base, interval);
1371 interval += entry->interval;
1372 }
1373 }
1374
taprio_offload_alloc(int num_entries)1375 static struct tc_taprio_qopt_offload *taprio_offload_alloc(int num_entries)
1376 {
1377 struct __tc_taprio_qopt_offload *__offload;
1378
1379 __offload = kzalloc_flex(*__offload, offload.entries, num_entries);
1380 if (!__offload)
1381 return NULL;
1382
1383 refcount_set(&__offload->users, 1);
1384
1385 return &__offload->offload;
1386 }
1387
taprio_offload_get(struct tc_taprio_qopt_offload * offload)1388 struct tc_taprio_qopt_offload *taprio_offload_get(struct tc_taprio_qopt_offload
1389 *offload)
1390 {
1391 struct __tc_taprio_qopt_offload *__offload;
1392
1393 __offload = container_of(offload, struct __tc_taprio_qopt_offload,
1394 offload);
1395
1396 refcount_inc(&__offload->users);
1397
1398 return offload;
1399 }
1400 EXPORT_SYMBOL_GPL(taprio_offload_get);
1401
taprio_offload_free(struct tc_taprio_qopt_offload * offload)1402 void taprio_offload_free(struct tc_taprio_qopt_offload *offload)
1403 {
1404 struct __tc_taprio_qopt_offload *__offload;
1405
1406 __offload = container_of(offload, struct __tc_taprio_qopt_offload,
1407 offload);
1408
1409 if (!refcount_dec_and_test(&__offload->users))
1410 return;
1411
1412 kfree(__offload);
1413 }
1414 EXPORT_SYMBOL_GPL(taprio_offload_free);
1415
1416 /* The function will only serve to keep the pointers to the "oper" and "admin"
1417 * schedules valid in relation to their base times, so when calling dump() the
1418 * users looks at the right schedules.
1419 * When using full offload, the admin configuration is promoted to oper at the
1420 * base_time in the PHC time domain. But because the system time is not
1421 * necessarily in sync with that, we can't just trigger a hrtimer to call
1422 * switch_schedules at the right hardware time.
1423 * At the moment we call this by hand right away from taprio, but in the future
1424 * it will be useful to create a mechanism for drivers to notify taprio of the
1425 * offload state (PENDING, ACTIVE, INACTIVE) so it can be visible in dump().
1426 * This is left as TODO.
1427 */
taprio_offload_config_changed(struct taprio_sched * q)1428 static void taprio_offload_config_changed(struct taprio_sched *q)
1429 {
1430 struct sched_gate_list *oper, *admin;
1431
1432 oper = rtnl_dereference(q->oper_sched);
1433 admin = rtnl_dereference(q->admin_sched);
1434
1435 switch_schedules(q, &admin, &oper);
1436 }
1437
tc_map_to_queue_mask(struct net_device * dev,u32 tc_mask)1438 static u32 tc_map_to_queue_mask(struct net_device *dev, u32 tc_mask)
1439 {
1440 u32 i, queue_mask = 0;
1441
1442 for (i = 0; i < dev->num_tc; i++) {
1443 u32 offset, count;
1444
1445 if (!(tc_mask & BIT(i)))
1446 continue;
1447
1448 offset = dev->tc_to_txq[i].offset;
1449 count = dev->tc_to_txq[i].count;
1450
1451 queue_mask |= GENMASK(offset + count - 1, offset);
1452 }
1453
1454 return queue_mask;
1455 }
1456
taprio_sched_to_offload(struct net_device * dev,struct sched_gate_list * sched,struct tc_taprio_qopt_offload * offload,const struct tc_taprio_caps * caps)1457 static void taprio_sched_to_offload(struct net_device *dev,
1458 struct sched_gate_list *sched,
1459 struct tc_taprio_qopt_offload *offload,
1460 const struct tc_taprio_caps *caps)
1461 {
1462 struct sched_entry *entry;
1463 int i = 0;
1464
1465 offload->base_time = sched->base_time;
1466 offload->cycle_time = sched->cycle_time;
1467 offload->cycle_time_extension = sched->cycle_time_extension;
1468
1469 list_for_each_entry(entry, &sched->entries, list) {
1470 struct tc_taprio_sched_entry *e = &offload->entries[i];
1471
1472 e->command = entry->command;
1473 e->interval = entry->interval;
1474 if (caps->gate_mask_per_txq)
1475 e->gate_mask = tc_map_to_queue_mask(dev,
1476 entry->gate_mask);
1477 else
1478 e->gate_mask = entry->gate_mask;
1479
1480 i++;
1481 }
1482
1483 offload->num_entries = i;
1484 }
1485
taprio_detect_broken_mqprio(struct taprio_sched * q)1486 static void taprio_detect_broken_mqprio(struct taprio_sched *q)
1487 {
1488 struct net_device *dev = qdisc_dev(q->root);
1489 struct tc_taprio_caps caps;
1490
1491 qdisc_offload_query_caps(dev, TC_SETUP_QDISC_TAPRIO,
1492 &caps, sizeof(caps));
1493
1494 q->broken_mqprio = caps.broken_mqprio;
1495 if (q->broken_mqprio)
1496 static_branch_inc(&taprio_have_broken_mqprio);
1497 else
1498 static_branch_inc(&taprio_have_working_mqprio);
1499
1500 q->detected_mqprio = true;
1501 }
1502
taprio_cleanup_broken_mqprio(struct taprio_sched * q)1503 static void taprio_cleanup_broken_mqprio(struct taprio_sched *q)
1504 {
1505 if (!q->detected_mqprio)
1506 return;
1507
1508 if (q->broken_mqprio)
1509 static_branch_dec(&taprio_have_broken_mqprio);
1510 else
1511 static_branch_dec(&taprio_have_working_mqprio);
1512 }
1513
taprio_enable_offload(struct net_device * dev,struct taprio_sched * q,struct sched_gate_list * sched,struct netlink_ext_ack * extack)1514 static int taprio_enable_offload(struct net_device *dev,
1515 struct taprio_sched *q,
1516 struct sched_gate_list *sched,
1517 struct netlink_ext_ack *extack)
1518 {
1519 const struct net_device_ops *ops = dev->netdev_ops;
1520 struct tc_taprio_qopt_offload *offload;
1521 struct tc_taprio_caps caps;
1522 int tc, err = 0;
1523
1524 if (!ops->ndo_setup_tc) {
1525 NL_SET_ERR_MSG(extack,
1526 "Device does not support taprio offload");
1527 return -EOPNOTSUPP;
1528 }
1529
1530 qdisc_offload_query_caps(dev, TC_SETUP_QDISC_TAPRIO,
1531 &caps, sizeof(caps));
1532
1533 if (!caps.supports_queue_max_sdu) {
1534 for (tc = 0; tc < TC_MAX_QUEUE; tc++) {
1535 if (q->max_sdu[tc]) {
1536 NL_SET_ERR_MSG_MOD(extack,
1537 "Device does not handle queueMaxSDU");
1538 return -EOPNOTSUPP;
1539 }
1540 }
1541 }
1542
1543 offload = taprio_offload_alloc(sched->num_entries);
1544 if (!offload) {
1545 NL_SET_ERR_MSG(extack,
1546 "Not enough memory for enabling offload mode");
1547 return -ENOMEM;
1548 }
1549 offload->cmd = TAPRIO_CMD_REPLACE;
1550 offload->extack = extack;
1551 mqprio_qopt_reconstruct(dev, &offload->mqprio.qopt);
1552 offload->mqprio.extack = extack;
1553 taprio_sched_to_offload(dev, sched, offload, &caps);
1554 mqprio_fp_to_offload(q->fp, &offload->mqprio);
1555
1556 for (tc = 0; tc < TC_MAX_QUEUE; tc++)
1557 offload->max_sdu[tc] = q->max_sdu[tc];
1558
1559 err = ops->ndo_setup_tc(dev, TC_SETUP_QDISC_TAPRIO, offload);
1560 if (err < 0) {
1561 NL_SET_ERR_MSG_WEAK(extack,
1562 "Device failed to setup taprio offload");
1563 goto done;
1564 }
1565
1566 q->offloaded = true;
1567
1568 done:
1569 /* The offload structure may linger around via a reference taken by the
1570 * device driver, so clear up the netlink extack pointer so that the
1571 * driver isn't tempted to dereference data which stopped being valid
1572 */
1573 offload->extack = NULL;
1574 offload->mqprio.extack = NULL;
1575 taprio_offload_free(offload);
1576
1577 return err;
1578 }
1579
taprio_disable_offload(struct net_device * dev,struct taprio_sched * q,struct netlink_ext_ack * extack)1580 static int taprio_disable_offload(struct net_device *dev,
1581 struct taprio_sched *q,
1582 struct netlink_ext_ack *extack)
1583 {
1584 const struct net_device_ops *ops = dev->netdev_ops;
1585 struct tc_taprio_qopt_offload *offload;
1586 int err;
1587
1588 if (!q->offloaded)
1589 return 0;
1590
1591 offload = taprio_offload_alloc(0);
1592 if (!offload) {
1593 NL_SET_ERR_MSG(extack,
1594 "Not enough memory to disable offload mode");
1595 return -ENOMEM;
1596 }
1597 offload->cmd = TAPRIO_CMD_DESTROY;
1598
1599 err = ops->ndo_setup_tc(dev, TC_SETUP_QDISC_TAPRIO, offload);
1600 if (err < 0) {
1601 NL_SET_ERR_MSG(extack,
1602 "Device failed to disable offload");
1603 goto out;
1604 }
1605
1606 q->offloaded = false;
1607
1608 out:
1609 taprio_offload_free(offload);
1610
1611 return err;
1612 }
1613
1614 /* If full offload is enabled, the only possible clockid is the net device's
1615 * PHC. For that reason, specifying a clockid through netlink is incorrect.
1616 * For txtime-assist, it is implicitly assumed that the device's PHC is kept
1617 * in sync with the specified clockid via a user space daemon such as phc2sys.
1618 * For both software taprio and txtime-assist, the clockid is used for the
1619 * hrtimer that advances the schedule and hence mandatory.
1620 */
taprio_parse_clockid(struct Qdisc * sch,struct nlattr ** tb,struct netlink_ext_ack * extack)1621 static int taprio_parse_clockid(struct Qdisc *sch, struct nlattr **tb,
1622 struct netlink_ext_ack *extack)
1623 {
1624 struct taprio_sched *q = qdisc_priv(sch);
1625 struct net_device *dev = qdisc_dev(sch);
1626 int err = -EINVAL;
1627
1628 if (FULL_OFFLOAD_IS_ENABLED(q->flags)) {
1629 const struct ethtool_ops *ops = dev->ethtool_ops;
1630 struct kernel_ethtool_ts_info info = {
1631 .cmd = ETHTOOL_GET_TS_INFO,
1632 .phc_index = -1,
1633 };
1634
1635 if (tb[TCA_TAPRIO_ATTR_SCHED_CLOCKID]) {
1636 NL_SET_ERR_MSG(extack,
1637 "The 'clockid' cannot be specified for full offload");
1638 goto out;
1639 }
1640
1641 if (ops && ops->get_ts_info)
1642 err = ops->get_ts_info(dev, &info);
1643
1644 if (err || info.phc_index < 0) {
1645 NL_SET_ERR_MSG(extack,
1646 "Device does not have a PTP clock");
1647 err = -ENOTSUPP;
1648 goto out;
1649 }
1650 } else if (tb[TCA_TAPRIO_ATTR_SCHED_CLOCKID]) {
1651 int clockid = nla_get_s32(tb[TCA_TAPRIO_ATTR_SCHED_CLOCKID]);
1652 enum tk_offsets tk_offset;
1653
1654 /* We only support static clockids and we don't allow
1655 * for it to be modified after the first init.
1656 */
1657 if (clockid < 0 ||
1658 (q->clockid != -1 && q->clockid != clockid)) {
1659 NL_SET_ERR_MSG(extack,
1660 "Changing the 'clockid' of a running schedule is not supported");
1661 err = -ENOTSUPP;
1662 goto out;
1663 }
1664
1665 switch (clockid) {
1666 case CLOCK_REALTIME:
1667 tk_offset = TK_OFFS_REAL;
1668 break;
1669 case CLOCK_MONOTONIC:
1670 tk_offset = TK_OFFS_MAX;
1671 break;
1672 case CLOCK_BOOTTIME:
1673 tk_offset = TK_OFFS_BOOT;
1674 break;
1675 case CLOCK_TAI:
1676 tk_offset = TK_OFFS_TAI;
1677 break;
1678 default:
1679 NL_SET_ERR_MSG(extack, "Invalid 'clockid'");
1680 err = -EINVAL;
1681 goto out;
1682 }
1683 /* This pairs with READ_ONCE() in taprio_mono_to_any */
1684 WRITE_ONCE(q->tk_offset, tk_offset);
1685
1686 q->clockid = clockid;
1687 } else {
1688 NL_SET_ERR_MSG(extack, "Specifying a 'clockid' is mandatory");
1689 goto out;
1690 }
1691
1692 /* Everything went ok, return success. */
1693 err = 0;
1694
1695 out:
1696 return err;
1697 }
1698
taprio_parse_tc_entry(struct Qdisc * sch,struct nlattr * opt,u32 max_sdu[TC_QOPT_MAX_QUEUE],u32 fp[TC_QOPT_MAX_QUEUE],unsigned long * seen_tcs,struct netlink_ext_ack * extack)1699 static int taprio_parse_tc_entry(struct Qdisc *sch,
1700 struct nlattr *opt,
1701 u32 max_sdu[TC_QOPT_MAX_QUEUE],
1702 u32 fp[TC_QOPT_MAX_QUEUE],
1703 unsigned long *seen_tcs,
1704 struct netlink_ext_ack *extack)
1705 {
1706 struct nlattr *tb[TCA_TAPRIO_TC_ENTRY_MAX + 1] = { };
1707 struct net_device *dev = qdisc_dev(sch);
1708 int err, tc;
1709 u32 val;
1710
1711 err = nla_parse_nested(tb, TCA_TAPRIO_TC_ENTRY_MAX, opt,
1712 taprio_tc_policy, extack);
1713 if (err < 0)
1714 return err;
1715
1716 if (NL_REQ_ATTR_CHECK(extack, opt, tb, TCA_TAPRIO_TC_ENTRY_INDEX)) {
1717 NL_SET_ERR_MSG_MOD(extack, "TC entry index missing");
1718 return -EINVAL;
1719 }
1720
1721 tc = nla_get_u32(tb[TCA_TAPRIO_TC_ENTRY_INDEX]);
1722 if (*seen_tcs & BIT(tc)) {
1723 NL_SET_ERR_MSG_ATTR(extack, tb[TCA_TAPRIO_TC_ENTRY_INDEX],
1724 "Duplicate tc entry");
1725 return -EINVAL;
1726 }
1727
1728 *seen_tcs |= BIT(tc);
1729
1730 if (tb[TCA_TAPRIO_TC_ENTRY_MAX_SDU]) {
1731 val = nla_get_u32(tb[TCA_TAPRIO_TC_ENTRY_MAX_SDU]);
1732 if (val > dev->max_mtu) {
1733 NL_SET_ERR_MSG_MOD(extack, "TC max SDU exceeds device max MTU");
1734 return -ERANGE;
1735 }
1736
1737 max_sdu[tc] = val;
1738 }
1739
1740 if (tb[TCA_TAPRIO_TC_ENTRY_FP])
1741 fp[tc] = nla_get_u32(tb[TCA_TAPRIO_TC_ENTRY_FP]);
1742
1743 return 0;
1744 }
1745
taprio_parse_tc_entries(struct Qdisc * sch,struct nlattr * opt,struct netlink_ext_ack * extack)1746 static int taprio_parse_tc_entries(struct Qdisc *sch,
1747 struct nlattr *opt,
1748 struct netlink_ext_ack *extack)
1749 {
1750 struct taprio_sched *q = qdisc_priv(sch);
1751 struct net_device *dev = qdisc_dev(sch);
1752 u32 max_sdu[TC_QOPT_MAX_QUEUE];
1753 bool have_preemption = false;
1754 unsigned long seen_tcs = 0;
1755 u32 fp[TC_QOPT_MAX_QUEUE];
1756 struct nlattr *n;
1757 int tc, rem;
1758 int err = 0;
1759
1760 for (tc = 0; tc < TC_QOPT_MAX_QUEUE; tc++) {
1761 max_sdu[tc] = q->max_sdu[tc];
1762 fp[tc] = q->fp[tc];
1763 }
1764
1765 nla_for_each_nested_type(n, TCA_TAPRIO_ATTR_TC_ENTRY, opt, rem) {
1766 err = taprio_parse_tc_entry(sch, n, max_sdu, fp, &seen_tcs,
1767 extack);
1768 if (err)
1769 return err;
1770 }
1771
1772 for (tc = 0; tc < TC_QOPT_MAX_QUEUE; tc++) {
1773 q->max_sdu[tc] = max_sdu[tc];
1774 q->fp[tc] = fp[tc];
1775 if (fp[tc] != TC_FP_EXPRESS)
1776 have_preemption = true;
1777 }
1778
1779 if (have_preemption) {
1780 if (!FULL_OFFLOAD_IS_ENABLED(q->flags)) {
1781 NL_SET_ERR_MSG(extack,
1782 "Preemption only supported with full offload");
1783 return -EOPNOTSUPP;
1784 }
1785
1786 if (!ethtool_dev_mm_supported(dev)) {
1787 NL_SET_ERR_MSG(extack,
1788 "Device does not support preemption");
1789 return -EOPNOTSUPP;
1790 }
1791 }
1792
1793 return err;
1794 }
1795
taprio_mqprio_cmp(const struct net_device * dev,const struct tc_mqprio_qopt * mqprio)1796 static int taprio_mqprio_cmp(const struct net_device *dev,
1797 const struct tc_mqprio_qopt *mqprio)
1798 {
1799 int i;
1800
1801 if (!mqprio || mqprio->num_tc != dev->num_tc)
1802 return -1;
1803
1804 for (i = 0; i < mqprio->num_tc; i++)
1805 if (dev->tc_to_txq[i].count != mqprio->count[i] ||
1806 dev->tc_to_txq[i].offset != mqprio->offset[i])
1807 return -1;
1808
1809 for (i = 0; i <= TC_BITMASK; i++)
1810 if (dev->prio_tc_map[i] != mqprio->prio_tc_map[i])
1811 return -1;
1812
1813 return 0;
1814 }
1815
taprio_change(struct Qdisc * sch,struct nlattr * opt,struct netlink_ext_ack * extack)1816 static int taprio_change(struct Qdisc *sch, struct nlattr *opt,
1817 struct netlink_ext_ack *extack)
1818 {
1819 struct qdisc_size_table *stab = rtnl_dereference(sch->stab);
1820 struct nlattr *tb[TCA_TAPRIO_ATTR_MAX + 1] = { };
1821 struct sched_gate_list *oper, *admin, *new_admin;
1822 struct taprio_sched *q = qdisc_priv(sch);
1823 struct net_device *dev = qdisc_dev(sch);
1824 struct tc_mqprio_qopt *mqprio = NULL;
1825 unsigned long flags;
1826 u32 taprio_flags;
1827 ktime_t start;
1828 int i, err;
1829
1830 err = nla_parse_nested_deprecated(tb, TCA_TAPRIO_ATTR_MAX, opt,
1831 taprio_policy, extack);
1832 if (err < 0)
1833 return err;
1834
1835 if (tb[TCA_TAPRIO_ATTR_PRIOMAP])
1836 mqprio = nla_data(tb[TCA_TAPRIO_ATTR_PRIOMAP]);
1837
1838 /* The semantics of the 'flags' argument in relation to 'change()'
1839 * requests, are interpreted following two rules (which are applied in
1840 * this order): (1) an omitted 'flags' argument is interpreted as
1841 * zero; (2) the 'flags' of a "running" taprio instance cannot be
1842 * changed.
1843 */
1844 taprio_flags = nla_get_u32_default(tb[TCA_TAPRIO_ATTR_FLAGS], 0);
1845
1846 /* txtime-assist and full offload are mutually exclusive */
1847 if ((taprio_flags & TCA_TAPRIO_ATTR_FLAG_TXTIME_ASSIST) &&
1848 (taprio_flags & TCA_TAPRIO_ATTR_FLAG_FULL_OFFLOAD)) {
1849 NL_SET_ERR_MSG_ATTR(extack, tb[TCA_TAPRIO_ATTR_FLAGS],
1850 "TXTIME_ASSIST and FULL_OFFLOAD are mutually exclusive");
1851 return -EINVAL;
1852 }
1853
1854 if (q->flags != TAPRIO_FLAGS_INVALID && q->flags != taprio_flags) {
1855 NL_SET_ERR_MSG_MOD(extack,
1856 "Changing 'flags' of a running schedule is not supported");
1857 return -EOPNOTSUPP;
1858 }
1859 q->flags = taprio_flags;
1860
1861 /* Needed for length_to_duration() during netlink attribute parsing */
1862 taprio_set_picos_per_byte(dev, q, extack);
1863
1864 err = taprio_parse_mqprio_opt(dev, mqprio, extack, q->flags);
1865 if (err < 0)
1866 return err;
1867
1868 err = taprio_parse_tc_entries(sch, opt, extack);
1869 if (err)
1870 return err;
1871
1872 new_admin = kzalloc_obj(*new_admin);
1873 if (!new_admin) {
1874 NL_SET_ERR_MSG(extack, "Not enough memory for a new schedule");
1875 return -ENOMEM;
1876 }
1877 INIT_LIST_HEAD(&new_admin->entries);
1878
1879 oper = rtnl_dereference(q->oper_sched);
1880 admin = rtnl_dereference(q->admin_sched);
1881
1882 /* no changes - no new mqprio settings */
1883 if (!taprio_mqprio_cmp(dev, mqprio))
1884 mqprio = NULL;
1885
1886 if (mqprio && (oper || admin)) {
1887 NL_SET_ERR_MSG(extack, "Changing the traffic mapping of a running schedule is not supported");
1888 err = -ENOTSUPP;
1889 goto free_sched;
1890 }
1891
1892 if (mqprio) {
1893 err = netdev_set_num_tc(dev, mqprio->num_tc);
1894 if (err)
1895 goto free_sched;
1896 for (i = 0; i < mqprio->num_tc; i++) {
1897 netdev_set_tc_queue(dev, i,
1898 mqprio->count[i],
1899 mqprio->offset[i]);
1900 q->cur_txq[i] = mqprio->offset[i];
1901 }
1902
1903 /* Always use supplied priority mappings */
1904 for (i = 0; i <= TC_BITMASK; i++)
1905 netdev_set_prio_tc_map(dev, i,
1906 mqprio->prio_tc_map[i]);
1907 }
1908
1909 err = parse_taprio_schedule(q, tb, new_admin, extack);
1910 if (err < 0)
1911 goto free_sched;
1912
1913 if (new_admin->num_entries == 0) {
1914 NL_SET_ERR_MSG(extack, "There should be at least one entry in the schedule");
1915 err = -EINVAL;
1916 goto free_sched;
1917 }
1918
1919 err = taprio_parse_clockid(sch, tb, extack);
1920 if (err < 0)
1921 goto free_sched;
1922
1923 taprio_update_queue_max_sdu(q, new_admin, stab);
1924
1925 if (FULL_OFFLOAD_IS_ENABLED(q->flags))
1926 err = taprio_enable_offload(dev, q, new_admin, extack);
1927 else
1928 err = taprio_disable_offload(dev, q, extack);
1929 if (err)
1930 goto free_sched;
1931
1932 /* Protects against enqueue()/dequeue() */
1933 spin_lock_bh(qdisc_lock(sch));
1934
1935 if (tb[TCA_TAPRIO_ATTR_TXTIME_DELAY]) {
1936 if (!TXTIME_ASSIST_IS_ENABLED(q->flags)) {
1937 NL_SET_ERR_MSG_MOD(extack, "txtime-delay can only be set when txtime-assist mode is enabled");
1938 err = -EINVAL;
1939 goto unlock;
1940 }
1941
1942 q->txtime_delay = nla_get_u32(tb[TCA_TAPRIO_ATTR_TXTIME_DELAY]);
1943 }
1944
1945 if (!TXTIME_ASSIST_IS_ENABLED(q->flags) &&
1946 !FULL_OFFLOAD_IS_ENABLED(q->flags) &&
1947 !hrtimer_active(&q->advance_timer)) {
1948 hrtimer_setup(&q->advance_timer, advance_sched, q->clockid, HRTIMER_MODE_ABS);
1949 }
1950
1951 err = taprio_get_start_time(sch, new_admin, &start);
1952 if (err < 0) {
1953 NL_SET_ERR_MSG(extack, "Internal error: failed get start time");
1954 goto unlock;
1955 }
1956
1957 setup_txtime(q, new_admin, start);
1958
1959 if (TXTIME_ASSIST_IS_ENABLED(q->flags)) {
1960 if (!oper) {
1961 rcu_assign_pointer(q->oper_sched, new_admin);
1962 err = 0;
1963 new_admin = NULL;
1964 goto unlock;
1965 }
1966
1967 /* Not going to race against advance_sched(), but still */
1968 admin = rcu_replace_pointer(q->admin_sched, new_admin,
1969 lockdep_rtnl_is_held());
1970 if (admin)
1971 call_rcu(&admin->rcu, taprio_free_sched_cb);
1972 } else {
1973 setup_first_end_time(q, new_admin, start);
1974
1975 /* Protects against advance_sched() */
1976 spin_lock_irqsave(&q->current_entry_lock, flags);
1977
1978 taprio_start_sched(sch, start, new_admin);
1979
1980 admin = rcu_replace_pointer(q->admin_sched, new_admin,
1981 lockdep_rtnl_is_held());
1982 if (admin)
1983 call_rcu(&admin->rcu, taprio_free_sched_cb);
1984
1985 spin_unlock_irqrestore(&q->current_entry_lock, flags);
1986
1987 if (FULL_OFFLOAD_IS_ENABLED(q->flags))
1988 taprio_offload_config_changed(q);
1989 }
1990
1991 new_admin = NULL;
1992 err = 0;
1993
1994 if (!stab)
1995 NL_SET_ERR_MSG_MOD(extack,
1996 "Size table not specified, frame length estimations may be inaccurate");
1997
1998 unlock:
1999 spin_unlock_bh(qdisc_lock(sch));
2000
2001 free_sched:
2002 if (new_admin)
2003 call_rcu(&new_admin->rcu, taprio_free_sched_cb);
2004
2005 return err;
2006 }
2007
taprio_reset(struct Qdisc * sch)2008 static void taprio_reset(struct Qdisc *sch)
2009 {
2010 struct taprio_sched *q = qdisc_priv(sch);
2011 struct net_device *dev = qdisc_dev(sch);
2012 int i;
2013
2014 hrtimer_cancel(&q->advance_timer);
2015
2016 if (q->qdiscs) {
2017 for (i = 0; i < dev->num_tx_queues; i++)
2018 if (q->qdiscs[i])
2019 qdisc_reset(q->qdiscs[i]);
2020 }
2021 }
2022
taprio_destroy(struct Qdisc * sch)2023 static void taprio_destroy(struct Qdisc *sch)
2024 {
2025 struct taprio_sched *q = qdisc_priv(sch);
2026 struct net_device *dev = qdisc_dev(sch);
2027 struct sched_gate_list *oper, *admin;
2028 unsigned int i;
2029
2030 list_del(&q->taprio_list);
2031
2032 /* Note that taprio_reset() might not be called if an error
2033 * happens in qdisc_create(), after taprio_init() has been called.
2034 */
2035 hrtimer_cancel(&q->advance_timer);
2036 qdisc_synchronize(sch);
2037
2038 taprio_disable_offload(dev, q, NULL);
2039
2040 if (q->qdiscs) {
2041 for (i = 0; i < dev->num_tx_queues; i++)
2042 qdisc_put(q->qdiscs[i]);
2043
2044 kfree(q->qdiscs);
2045 }
2046 q->qdiscs = NULL;
2047
2048 netdev_reset_tc(dev);
2049
2050 oper = rtnl_dereference(q->oper_sched);
2051 admin = rtnl_dereference(q->admin_sched);
2052
2053 if (oper)
2054 call_rcu(&oper->rcu, taprio_free_sched_cb);
2055
2056 if (admin)
2057 call_rcu(&admin->rcu, taprio_free_sched_cb);
2058
2059 taprio_cleanup_broken_mqprio(q);
2060 }
2061
taprio_init(struct Qdisc * sch,struct nlattr * opt,struct netlink_ext_ack * extack)2062 static int taprio_init(struct Qdisc *sch, struct nlattr *opt,
2063 struct netlink_ext_ack *extack)
2064 {
2065 struct taprio_sched *q = qdisc_priv(sch);
2066 struct net_device *dev = qdisc_dev(sch);
2067 int i, tc;
2068
2069 spin_lock_init(&q->current_entry_lock);
2070
2071 hrtimer_setup(&q->advance_timer, advance_sched, CLOCK_TAI, HRTIMER_MODE_ABS);
2072
2073 q->root = sch;
2074
2075 /* We only support static clockids. Use an invalid value as default
2076 * and get the valid one on taprio_change().
2077 */
2078 q->clockid = -1;
2079 q->flags = TAPRIO_FLAGS_INVALID;
2080
2081 list_add(&q->taprio_list, &taprio_list);
2082
2083 if (sch->parent != TC_H_ROOT) {
2084 NL_SET_ERR_MSG_MOD(extack, "Can only be attached as root qdisc");
2085 return -EOPNOTSUPP;
2086 }
2087
2088 if (!netif_is_multiqueue(dev)) {
2089 NL_SET_ERR_MSG_MOD(extack, "Multi-queue device is required");
2090 return -EOPNOTSUPP;
2091 }
2092
2093 q->qdiscs = kzalloc_objs(q->qdiscs[0], dev->num_tx_queues);
2094 if (!q->qdiscs)
2095 return -ENOMEM;
2096
2097 if (!opt)
2098 return -EINVAL;
2099
2100 for (i = 0; i < dev->num_tx_queues; i++) {
2101 struct netdev_queue *dev_queue;
2102 struct Qdisc *qdisc;
2103
2104 dev_queue = netdev_get_tx_queue(dev, i);
2105 qdisc = qdisc_create_dflt(dev_queue,
2106 &pfifo_qdisc_ops,
2107 TC_H_MAKE(TC_H_MAJ(sch->handle),
2108 TC_H_MIN(i + 1)),
2109 extack);
2110 if (!qdisc)
2111 return -ENOMEM;
2112
2113 if (i < dev->real_num_tx_queues)
2114 qdisc_hash_add(qdisc, false);
2115
2116 q->qdiscs[i] = qdisc;
2117 }
2118
2119 for (tc = 0; tc < TC_QOPT_MAX_QUEUE; tc++)
2120 q->fp[tc] = TC_FP_EXPRESS;
2121
2122 taprio_detect_broken_mqprio(q);
2123
2124 return taprio_change(sch, opt, extack);
2125 }
2126
taprio_attach(struct Qdisc * sch)2127 static void taprio_attach(struct Qdisc *sch)
2128 {
2129 struct taprio_sched *q = qdisc_priv(sch);
2130 struct net_device *dev = qdisc_dev(sch);
2131 unsigned int ntx;
2132
2133 /* Attach underlying qdisc */
2134 for (ntx = 0; ntx < dev->num_tx_queues; ntx++) {
2135 struct netdev_queue *dev_queue = netdev_get_tx_queue(dev, ntx);
2136 struct Qdisc *old, *dev_queue_qdisc;
2137
2138 if (FULL_OFFLOAD_IS_ENABLED(q->flags)) {
2139 struct Qdisc *qdisc = q->qdiscs[ntx];
2140
2141 /* In offload mode, the root taprio qdisc is bypassed
2142 * and the netdev TX queues see the children directly
2143 */
2144 qdisc->flags |= TCQ_F_ONETXQUEUE | TCQ_F_NOPARENT;
2145 dev_queue_qdisc = qdisc;
2146 } else {
2147 /* In software mode, attach the root taprio qdisc
2148 * to all netdev TX queues, so that dev_qdisc_enqueue()
2149 * goes through taprio_enqueue().
2150 */
2151 dev_queue_qdisc = sch;
2152 }
2153 old = dev_graft_qdisc(dev_queue, dev_queue_qdisc);
2154 /* The qdisc's refcount requires to be elevated once
2155 * for each netdev TX queue it is grafted onto
2156 */
2157 qdisc_refcount_inc(dev_queue_qdisc);
2158 if (old)
2159 qdisc_put(old);
2160 }
2161 }
2162
taprio_queue_get(struct Qdisc * sch,unsigned long cl)2163 static struct netdev_queue *taprio_queue_get(struct Qdisc *sch,
2164 unsigned long cl)
2165 {
2166 struct net_device *dev = qdisc_dev(sch);
2167 unsigned long ntx = cl - 1;
2168
2169 if (ntx >= dev->num_tx_queues)
2170 return NULL;
2171
2172 return netdev_get_tx_queue(dev, ntx);
2173 }
2174
taprio_graft(struct Qdisc * sch,unsigned long cl,struct Qdisc * new,struct Qdisc ** old,struct netlink_ext_ack * extack)2175 static int taprio_graft(struct Qdisc *sch, unsigned long cl,
2176 struct Qdisc *new, struct Qdisc **old,
2177 struct netlink_ext_ack *extack)
2178 {
2179 struct taprio_sched *q = qdisc_priv(sch);
2180 struct net_device *dev = qdisc_dev(sch);
2181 struct netdev_queue *dev_queue = taprio_queue_get(sch, cl);
2182
2183 if (!dev_queue)
2184 return -EINVAL;
2185
2186 if (dev->flags & IFF_UP)
2187 dev_deactivate(dev);
2188
2189 /* In offload mode, the child Qdisc is directly attached to the netdev
2190 * TX queue, and thus, we need to keep its refcount elevated in order
2191 * to counteract qdisc_graft()'s call to qdisc_put() once per TX queue.
2192 * However, save the reference to the new qdisc in the private array in
2193 * both software and offload cases, to have an up-to-date reference to
2194 * our children.
2195 */
2196 *old = q->qdiscs[cl - 1];
2197 if (FULL_OFFLOAD_IS_ENABLED(q->flags)) {
2198 WARN_ON_ONCE(dev_graft_qdisc(dev_queue, new) != *old);
2199 if (new)
2200 qdisc_refcount_inc(new);
2201 if (*old)
2202 qdisc_put(*old);
2203 }
2204
2205 q->qdiscs[cl - 1] = new;
2206 if (new)
2207 new->flags |= TCQ_F_ONETXQUEUE | TCQ_F_NOPARENT;
2208
2209 if (dev->flags & IFF_UP)
2210 dev_activate(dev);
2211
2212 return 0;
2213 }
2214
dump_entry(struct sk_buff * msg,const struct sched_entry * entry)2215 static int dump_entry(struct sk_buff *msg,
2216 const struct sched_entry *entry)
2217 {
2218 struct nlattr *item;
2219
2220 item = nla_nest_start_noflag(msg, TCA_TAPRIO_SCHED_ENTRY);
2221 if (!item)
2222 return -ENOSPC;
2223
2224 if (nla_put_u32(msg, TCA_TAPRIO_SCHED_ENTRY_INDEX, entry->index))
2225 goto nla_put_failure;
2226
2227 if (nla_put_u8(msg, TCA_TAPRIO_SCHED_ENTRY_CMD, entry->command))
2228 goto nla_put_failure;
2229
2230 if (nla_put_u32(msg, TCA_TAPRIO_SCHED_ENTRY_GATE_MASK,
2231 entry->gate_mask))
2232 goto nla_put_failure;
2233
2234 if (nla_put_u32(msg, TCA_TAPRIO_SCHED_ENTRY_INTERVAL,
2235 entry->interval))
2236 goto nla_put_failure;
2237
2238 return nla_nest_end(msg, item);
2239
2240 nla_put_failure:
2241 nla_nest_cancel(msg, item);
2242 return -1;
2243 }
2244
dump_schedule(struct sk_buff * msg,const struct sched_gate_list * root)2245 static int dump_schedule(struct sk_buff *msg,
2246 const struct sched_gate_list *root)
2247 {
2248 struct nlattr *entry_list;
2249 struct sched_entry *entry;
2250
2251 if (nla_put_s64(msg, TCA_TAPRIO_ATTR_SCHED_BASE_TIME,
2252 root->base_time, TCA_TAPRIO_PAD))
2253 return -1;
2254
2255 if (nla_put_s64(msg, TCA_TAPRIO_ATTR_SCHED_CYCLE_TIME,
2256 root->cycle_time, TCA_TAPRIO_PAD))
2257 return -1;
2258
2259 if (nla_put_s64(msg, TCA_TAPRIO_ATTR_SCHED_CYCLE_TIME_EXTENSION,
2260 root->cycle_time_extension, TCA_TAPRIO_PAD))
2261 return -1;
2262
2263 entry_list = nla_nest_start_noflag(msg,
2264 TCA_TAPRIO_ATTR_SCHED_ENTRY_LIST);
2265 if (!entry_list)
2266 goto error_nest;
2267
2268 list_for_each_entry(entry, &root->entries, list) {
2269 if (dump_entry(msg, entry) < 0)
2270 goto error_nest;
2271 }
2272
2273 nla_nest_end(msg, entry_list);
2274 return 0;
2275
2276 error_nest:
2277 nla_nest_cancel(msg, entry_list);
2278 return -1;
2279 }
2280
taprio_dump_tc_entries(struct sk_buff * skb,struct taprio_sched * q,struct sched_gate_list * sched)2281 static int taprio_dump_tc_entries(struct sk_buff *skb,
2282 struct taprio_sched *q,
2283 struct sched_gate_list *sched)
2284 {
2285 struct nlattr *n;
2286 int tc;
2287
2288 for (tc = 0; tc < TC_MAX_QUEUE; tc++) {
2289 n = nla_nest_start(skb, TCA_TAPRIO_ATTR_TC_ENTRY);
2290 if (!n)
2291 return -EMSGSIZE;
2292
2293 if (nla_put_u32(skb, TCA_TAPRIO_TC_ENTRY_INDEX, tc))
2294 goto nla_put_failure;
2295
2296 if (nla_put_u32(skb, TCA_TAPRIO_TC_ENTRY_MAX_SDU,
2297 sched->max_sdu[tc]))
2298 goto nla_put_failure;
2299
2300 if (nla_put_u32(skb, TCA_TAPRIO_TC_ENTRY_FP, q->fp[tc]))
2301 goto nla_put_failure;
2302
2303 nla_nest_end(skb, n);
2304 }
2305
2306 return 0;
2307
2308 nla_put_failure:
2309 nla_nest_cancel(skb, n);
2310 return -EMSGSIZE;
2311 }
2312
taprio_put_stat(struct sk_buff * skb,u64 val,u16 attrtype)2313 static int taprio_put_stat(struct sk_buff *skb, u64 val, u16 attrtype)
2314 {
2315 if (val == TAPRIO_STAT_NOT_SET)
2316 return 0;
2317 if (nla_put_u64_64bit(skb, attrtype, val, TCA_TAPRIO_OFFLOAD_STATS_PAD))
2318 return -EMSGSIZE;
2319 return 0;
2320 }
2321
taprio_dump_xstats(struct Qdisc * sch,struct gnet_dump * d,struct tc_taprio_qopt_offload * offload,struct tc_taprio_qopt_stats * stats)2322 static int taprio_dump_xstats(struct Qdisc *sch, struct gnet_dump *d,
2323 struct tc_taprio_qopt_offload *offload,
2324 struct tc_taprio_qopt_stats *stats)
2325 {
2326 struct net_device *dev = qdisc_dev(sch);
2327 const struct net_device_ops *ops;
2328 struct sk_buff *skb = d->skb;
2329 struct nlattr *xstats;
2330 int err;
2331
2332 ops = qdisc_dev(sch)->netdev_ops;
2333
2334 /* FIXME I could use qdisc_offload_dump_helper(), but that messes
2335 * with sch->flags depending on whether the device reports taprio
2336 * stats, and I'm not sure whether that's a good idea, considering
2337 * that stats are optional to the offload itself
2338 */
2339 if (!ops->ndo_setup_tc)
2340 return 0;
2341
2342 memset(stats, 0xff, sizeof(*stats));
2343
2344 err = ops->ndo_setup_tc(dev, TC_SETUP_QDISC_TAPRIO, offload);
2345 if (err == -EOPNOTSUPP)
2346 return 0;
2347 if (err)
2348 return err;
2349
2350 xstats = nla_nest_start(skb, TCA_STATS_APP);
2351 if (!xstats)
2352 goto err;
2353
2354 if (taprio_put_stat(skb, stats->window_drops,
2355 TCA_TAPRIO_OFFLOAD_STATS_WINDOW_DROPS) ||
2356 taprio_put_stat(skb, stats->tx_overruns,
2357 TCA_TAPRIO_OFFLOAD_STATS_TX_OVERRUNS))
2358 goto err_cancel;
2359
2360 nla_nest_end(skb, xstats);
2361
2362 return 0;
2363
2364 err_cancel:
2365 nla_nest_cancel(skb, xstats);
2366 err:
2367 return -EMSGSIZE;
2368 }
2369
taprio_dump_stats(struct Qdisc * sch,struct gnet_dump * d)2370 static int taprio_dump_stats(struct Qdisc *sch, struct gnet_dump *d)
2371 {
2372 struct tc_taprio_qopt_offload offload = {
2373 .cmd = TAPRIO_CMD_STATS,
2374 };
2375
2376 return taprio_dump_xstats(sch, d, &offload, &offload.stats);
2377 }
2378
taprio_dump(struct Qdisc * sch,struct sk_buff * skb)2379 static int taprio_dump(struct Qdisc *sch, struct sk_buff *skb)
2380 {
2381 struct taprio_sched *q = qdisc_priv(sch);
2382 struct net_device *dev = qdisc_dev(sch);
2383 struct sched_gate_list *oper, *admin;
2384 struct tc_mqprio_qopt opt = { 0 };
2385 struct nlattr *nest, *sched_nest;
2386
2387 mqprio_qopt_reconstruct(dev, &opt);
2388
2389 nest = nla_nest_start_noflag(skb, TCA_OPTIONS);
2390 if (!nest)
2391 goto start_error;
2392
2393 if (nla_put(skb, TCA_TAPRIO_ATTR_PRIOMAP, sizeof(opt), &opt))
2394 goto options_error;
2395
2396 if (!FULL_OFFLOAD_IS_ENABLED(q->flags) &&
2397 nla_put_s32(skb, TCA_TAPRIO_ATTR_SCHED_CLOCKID, q->clockid))
2398 goto options_error;
2399
2400 if (q->flags && nla_put_u32(skb, TCA_TAPRIO_ATTR_FLAGS, q->flags))
2401 goto options_error;
2402
2403 if (q->txtime_delay &&
2404 nla_put_u32(skb, TCA_TAPRIO_ATTR_TXTIME_DELAY, q->txtime_delay))
2405 goto options_error;
2406
2407 rcu_read_lock();
2408
2409 oper = rtnl_dereference(q->oper_sched);
2410 admin = rtnl_dereference(q->admin_sched);
2411
2412 if (oper && taprio_dump_tc_entries(skb, q, oper))
2413 goto options_error_rcu;
2414
2415 if (oper && dump_schedule(skb, oper))
2416 goto options_error_rcu;
2417
2418 if (!admin)
2419 goto done;
2420
2421 sched_nest = nla_nest_start_noflag(skb, TCA_TAPRIO_ATTR_ADMIN_SCHED);
2422 if (!sched_nest)
2423 goto options_error_rcu;
2424
2425 if (dump_schedule(skb, admin))
2426 goto admin_error;
2427
2428 nla_nest_end(skb, sched_nest);
2429
2430 done:
2431 rcu_read_unlock();
2432 return nla_nest_end(skb, nest);
2433
2434 admin_error:
2435 nla_nest_cancel(skb, sched_nest);
2436
2437 options_error_rcu:
2438 rcu_read_unlock();
2439
2440 options_error:
2441 nla_nest_cancel(skb, nest);
2442
2443 start_error:
2444 return -ENOSPC;
2445 }
2446
taprio_leaf(struct Qdisc * sch,unsigned long cl)2447 static struct Qdisc *taprio_leaf(struct Qdisc *sch, unsigned long cl)
2448 {
2449 struct taprio_sched *q = qdisc_priv(sch);
2450 struct net_device *dev = qdisc_dev(sch);
2451 unsigned int ntx = cl - 1;
2452
2453 if (ntx >= dev->num_tx_queues)
2454 return NULL;
2455
2456 return q->qdiscs[ntx];
2457 }
2458
taprio_find(struct Qdisc * sch,u32 classid)2459 static unsigned long taprio_find(struct Qdisc *sch, u32 classid)
2460 {
2461 unsigned int ntx = TC_H_MIN(classid);
2462
2463 if (!taprio_queue_get(sch, ntx))
2464 return 0;
2465 return ntx;
2466 }
2467
taprio_dump_class(struct Qdisc * sch,unsigned long cl,struct sk_buff * skb,struct tcmsg * tcm)2468 static int taprio_dump_class(struct Qdisc *sch, unsigned long cl,
2469 struct sk_buff *skb, struct tcmsg *tcm)
2470 {
2471 struct Qdisc *child = taprio_leaf(sch, cl);
2472
2473 tcm->tcm_parent = TC_H_ROOT;
2474 tcm->tcm_handle |= TC_H_MIN(cl);
2475 tcm->tcm_info = child->handle;
2476
2477 return 0;
2478 }
2479
taprio_dump_class_stats(struct Qdisc * sch,unsigned long cl,struct gnet_dump * d)2480 static int taprio_dump_class_stats(struct Qdisc *sch, unsigned long cl,
2481 struct gnet_dump *d)
2482 __releases(d->lock)
2483 __acquires(d->lock)
2484 {
2485 struct Qdisc *child = taprio_leaf(sch, cl);
2486 struct tc_taprio_qopt_offload offload = {
2487 .cmd = TAPRIO_CMD_QUEUE_STATS,
2488 .queue_stats = {
2489 .queue = cl - 1,
2490 },
2491 };
2492
2493 if (gnet_stats_copy_basic(d, NULL, &child->bstats, true) < 0 ||
2494 qdisc_qstats_copy(d, child) < 0)
2495 return -1;
2496
2497 return taprio_dump_xstats(sch, d, &offload, &offload.queue_stats.stats);
2498 }
2499
taprio_walk(struct Qdisc * sch,struct qdisc_walker * arg)2500 static void taprio_walk(struct Qdisc *sch, struct qdisc_walker *arg)
2501 {
2502 struct net_device *dev = qdisc_dev(sch);
2503 unsigned long ntx;
2504
2505 if (arg->stop)
2506 return;
2507
2508 arg->count = arg->skip;
2509 for (ntx = arg->skip; ntx < dev->num_tx_queues; ntx++) {
2510 if (!tc_qdisc_stats_dump(sch, ntx + 1, arg))
2511 break;
2512 }
2513 }
2514
taprio_select_queue(struct Qdisc * sch,struct tcmsg * tcm)2515 static struct netdev_queue *taprio_select_queue(struct Qdisc *sch,
2516 struct tcmsg *tcm)
2517 {
2518 return taprio_queue_get(sch, TC_H_MIN(tcm->tcm_parent));
2519 }
2520
2521 static const struct Qdisc_class_ops taprio_class_ops = {
2522 .graft = taprio_graft,
2523 .leaf = taprio_leaf,
2524 .find = taprio_find,
2525 .walk = taprio_walk,
2526 .dump = taprio_dump_class,
2527 .dump_stats = taprio_dump_class_stats,
2528 .select_queue = taprio_select_queue,
2529 };
2530
2531 static struct Qdisc_ops taprio_qdisc_ops __read_mostly = {
2532 .cl_ops = &taprio_class_ops,
2533 .id = "taprio",
2534 .priv_size = sizeof(struct taprio_sched),
2535 .init = taprio_init,
2536 .change = taprio_change,
2537 .destroy = taprio_destroy,
2538 .reset = taprio_reset,
2539 .attach = taprio_attach,
2540 .peek = taprio_peek,
2541 .dequeue = taprio_dequeue,
2542 .enqueue = taprio_enqueue,
2543 .dump = taprio_dump,
2544 .dump_stats = taprio_dump_stats,
2545 .owner = THIS_MODULE,
2546 };
2547 MODULE_ALIAS_NET_SCH("taprio");
2548
2549 static struct notifier_block taprio_device_notifier = {
2550 .notifier_call = taprio_dev_notifier,
2551 };
2552
taprio_module_init(void)2553 static int __init taprio_module_init(void)
2554 {
2555 int err = register_netdevice_notifier(&taprio_device_notifier);
2556
2557 if (err)
2558 return err;
2559
2560 return register_qdisc(&taprio_qdisc_ops);
2561 }
2562
taprio_module_exit(void)2563 static void __exit taprio_module_exit(void)
2564 {
2565 unregister_qdisc(&taprio_qdisc_ops);
2566 unregister_netdevice_notifier(&taprio_device_notifier);
2567 }
2568
2569 module_init(taprio_module_init);
2570 module_exit(taprio_module_exit);
2571 MODULE_LICENSE("GPL");
2572 MODULE_DESCRIPTION("Time Aware Priority qdisc");
2573