| // SPDX-License-Identifier: GPL-2.0-or-later | |
| /* Copyright 2020 NXP */ | |
| #include <linux/module.h> | |
| #include <linux/types.h> | |
| #include <linux/kernel.h> | |
| #include <linux/string.h> | |
| #include <linux/errno.h> | |
| #include <linux/skbuff.h> | |
| #include <linux/rtnetlink.h> | |
| #include <linux/init.h> | |
| #include <linux/slab.h> | |
| #include <net/act_api.h> | |
| #include <net/netlink.h> | |
| #include <net/pkt_cls.h> | |
| #include <net/tc_act/tc_gate.h> | |
| #include <net/tc_wrapper.h> | |
| static struct tc_action_ops act_gate_ops; | |
| static ktime_t gate_get_time(struct tcf_gate *gact) | |
| { | |
| ktime_t mono = ktime_get(); | |
| switch (gact->tk_offset) { | |
| case TK_OFFS_MAX: | |
| return mono; | |
| default: | |
| return ktime_mono_to_any(mono, gact->tk_offset); | |
| } | |
| return KTIME_MAX; | |
| } | |
| static void tcf_gate_params_free_rcu(struct rcu_head *head); | |
| static void gate_get_start_time(struct tcf_gate *gact, | |
| const struct tcf_gate_params *param, | |
| ktime_t *start) | |
| { | |
| ktime_t now, base, cycle; | |
| u64 n; | |
| base = ns_to_ktime(param->tcfg_basetime); | |
| now = gate_get_time(gact); | |
| if (ktime_after(base, now)) { | |
| *start = base; | |
| return; | |
| } | |
| cycle = param->tcfg_cycletime; | |
| n = div64_u64(ktime_sub_ns(now, base), cycle); | |
| *start = ktime_add_ns(base, (n + 1) * cycle); | |
| } | |
| static void gate_start_timer(struct tcf_gate *gact, ktime_t start) | |
| { | |
| ktime_t expires; | |
| expires = hrtimer_get_expires(&gact->hitimer); | |
| if (expires == 0) | |
| expires = KTIME_MAX; | |
| start = min_t(ktime_t, start, expires); | |
| hrtimer_start(&gact->hitimer, start, HRTIMER_MODE_ABS_SOFT); | |
| } | |
| static enum hrtimer_restart gate_timer_func(struct hrtimer *timer) | |
| { | |
| struct tcf_gate *gact = container_of(timer, struct tcf_gate, | |
| hitimer); | |
| struct tcfg_gate_entry *next; | |
| struct tcf_gate_params *p; | |
| ktime_t close_time, now; | |
| spin_lock(&gact->tcf_lock); | |
| p = rcu_dereference_protected(gact->param, | |
| lockdep_is_held(&gact->tcf_lock)); | |
| next = gact->next_entry; | |
| /* cycle start, clear pending bit, clear total octets */ | |
| gact->current_gate_status = next->gate_state ? GATE_ACT_GATE_OPEN : 0; | |
| gact->current_entry_octets = 0; | |
| gact->current_max_octets = next->maxoctets; | |
| gact->current_close_time = ktime_add_ns(gact->current_close_time, | |
| next->interval); | |
| close_time = gact->current_close_time; | |
| if (list_is_last(&next->list, &p->entries)) | |
| next = list_first_entry(&p->entries, | |
| struct tcfg_gate_entry, list); | |
| else | |
| next = list_next_entry(next, list); | |
| now = gate_get_time(gact); | |
| if (ktime_after(now, close_time)) { | |
| ktime_t cycle, base; | |
| u64 n; | |
| cycle = p->tcfg_cycletime; | |
| base = ns_to_ktime(p->tcfg_basetime); | |
| n = div64_u64(ktime_sub_ns(now, base), cycle); | |
| close_time = ktime_add_ns(base, (n + 1) * cycle); | |
| } | |
| gact->next_entry = next; | |
| hrtimer_set_expires(&gact->hitimer, close_time); | |
| spin_unlock(&gact->tcf_lock); | |
| return HRTIMER_RESTART; | |
| } | |
| TC_INDIRECT_SCOPE int tcf_gate_act(struct sk_buff *skb, | |
| const struct tc_action *a, | |
| struct tcf_result *res) | |
| { | |
| struct tcf_gate *gact = to_gate(a); | |
| int action = READ_ONCE(gact->tcf_action); | |
| tcf_lastuse_update(&gact->tcf_tm); | |
| tcf_action_update_bstats(&gact->common, skb); | |
| spin_lock(&gact->tcf_lock); | |
| if (unlikely(gact->current_gate_status & GATE_ACT_PENDING)) { | |
| spin_unlock(&gact->tcf_lock); | |
| return action; | |
| } | |
| if (!(gact->current_gate_status & GATE_ACT_GATE_OPEN)) { | |
| spin_unlock(&gact->tcf_lock); | |
| goto drop; | |
| } | |
| if (gact->current_max_octets >= 0) { | |
| gact->current_entry_octets += qdisc_pkt_len(skb); | |
| if (gact->current_entry_octets > gact->current_max_octets) { | |
| spin_unlock(&gact->tcf_lock); | |
| goto overlimit; | |
| } | |
| } | |
| spin_unlock(&gact->tcf_lock); | |
| return action; | |
| overlimit: | |
| tcf_action_inc_overlimit_qstats(&gact->common); | |
| drop: | |
| tcf_action_inc_drop_qstats(&gact->common); | |
| return TC_ACT_SHOT; | |
| } | |
| static const struct nla_policy entry_policy[TCA_GATE_ENTRY_MAX + 1] = { | |
| [TCA_GATE_ENTRY_INDEX] = { .type = NLA_U32 }, | |
| [TCA_GATE_ENTRY_GATE] = { .type = NLA_FLAG }, | |
| [TCA_GATE_ENTRY_INTERVAL] = { .type = NLA_U32 }, | |
| [TCA_GATE_ENTRY_IPV] = { .type = NLA_S32 }, | |
| [TCA_GATE_ENTRY_MAX_OCTETS] = { .type = NLA_S32 }, | |
| }; | |
| static const struct nla_policy gate_policy[TCA_GATE_MAX + 1] = { | |
| [TCA_GATE_PARMS] = | |
| NLA_POLICY_EXACT_LEN(sizeof(struct tc_gate)), | |
| [TCA_GATE_PRIORITY] = { .type = NLA_S32 }, | |
| [TCA_GATE_ENTRY_LIST] = { .type = NLA_NESTED }, | |
| [TCA_GATE_BASE_TIME] = { .type = NLA_U64 }, | |
| [TCA_GATE_CYCLE_TIME] = { .type = NLA_U64 }, | |
| [TCA_GATE_CYCLE_TIME_EXT] = { .type = NLA_U64 }, | |
| [TCA_GATE_FLAGS] = { .type = NLA_U32 }, | |
| [TCA_GATE_CLOCKID] = { .type = NLA_S32 }, | |
| }; | |
| static int fill_gate_entry(struct nlattr **tb, struct tcfg_gate_entry *entry, | |
| struct netlink_ext_ack *extack) | |
| { | |
| u32 interval = 0; | |
| entry->gate_state = nla_get_flag(tb[TCA_GATE_ENTRY_GATE]); | |
| if (tb[TCA_GATE_ENTRY_INTERVAL]) | |
| interval = nla_get_u32(tb[TCA_GATE_ENTRY_INTERVAL]); | |
| if (interval == 0) { | |
| NL_SET_ERR_MSG(extack, "Invalid interval for schedule entry"); | |
| return -EINVAL; | |
| } | |
| entry->interval = interval; | |
| entry->ipv = nla_get_s32_default(tb[TCA_GATE_ENTRY_IPV], -1); | |
| entry->maxoctets = nla_get_s32_default(tb[TCA_GATE_ENTRY_MAX_OCTETS], | |
| -1); | |
| return 0; | |
| } | |
| static int parse_gate_entry(struct nlattr *n, struct tcfg_gate_entry *entry, | |
| int index, struct netlink_ext_ack *extack) | |
| { | |
| struct nlattr *tb[TCA_GATE_ENTRY_MAX + 1] = { }; | |
| int err; | |
| err = nla_parse_nested(tb, TCA_GATE_ENTRY_MAX, n, entry_policy, extack); | |
| if (err < 0) { | |
| NL_SET_ERR_MSG(extack, "Could not parse nested entry"); | |
| return -EINVAL; | |
| } | |
| entry->index = index; | |
| return fill_gate_entry(tb, entry, extack); | |
| } | |
| static void release_entry_list(struct list_head *entries) | |
| { | |
| struct tcfg_gate_entry *entry, *e; | |
| list_for_each_entry_safe(entry, e, entries, list) { | |
| list_del(&entry->list); | |
| kfree(entry); | |
| } | |
| } | |
| static int tcf_gate_copy_entries(struct tcf_gate_params *dst, | |
| const struct tcf_gate_params *src, | |
| struct netlink_ext_ack *extack) | |
| { | |
| struct tcfg_gate_entry *entry; | |
| int i = 0; | |
| list_for_each_entry(entry, &src->entries, list) { | |
| struct tcfg_gate_entry *new; | |
| new = kzalloc_obj(*new, GFP_ATOMIC); | |
| if (!new) { | |
| NL_SET_ERR_MSG(extack, "Not enough memory for entry"); | |
| return -ENOMEM; | |
| } | |
| new->index = entry->index; | |
| new->gate_state = entry->gate_state; | |
| new->interval = entry->interval; | |
| new->ipv = entry->ipv; | |
| new->maxoctets = entry->maxoctets; | |
| list_add_tail(&new->list, &dst->entries); | |
| i++; | |
| } | |
| dst->num_entries = i; | |
| return 0; | |
| } | |
| static int parse_gate_list(struct nlattr *list_attr, | |
| struct tcf_gate_params *sched, | |
| struct netlink_ext_ack *extack) | |
| { | |
| struct tcfg_gate_entry *entry; | |
| struct nlattr *n; | |
| int err, rem; | |
| int i = 0; | |
| if (!list_attr) | |
| return -EINVAL; | |
| nla_for_each_nested(n, list_attr, rem) { | |
| if (nla_type(n) != TCA_GATE_ONE_ENTRY) { | |
| NL_SET_ERR_MSG(extack, "Attribute isn't type 'entry'"); | |
| continue; | |
| } | |
| entry = kzalloc_obj(*entry, GFP_ATOMIC); | |
| if (!entry) { | |
| NL_SET_ERR_MSG(extack, "Not enough memory for entry"); | |
| err = -ENOMEM; | |
| goto release_list; | |
| } | |
| err = parse_gate_entry(n, entry, i, extack); | |
| if (err < 0) { | |
| kfree(entry); | |
| goto release_list; | |
| } | |
| list_add_tail(&entry->list, &sched->entries); | |
| i++; | |
| } | |
| sched->num_entries = i; | |
| return i; | |
| release_list: | |
| release_entry_list(&sched->entries); | |
| return err; | |
| } | |
| static bool gate_timer_needs_cancel(u64 basetime, u64 old_basetime, | |
| enum tk_offsets tko, | |
| enum tk_offsets old_tko, | |
| s32 clockid, s32 old_clockid) | |
| { | |
| return basetime != old_basetime || | |
| clockid != old_clockid || | |
| tko != old_tko; | |
| } | |
| static int gate_clock_resolve(s32 clockid, enum tk_offsets *tko, | |
| struct netlink_ext_ack *extack) | |
| { | |
| switch (clockid) { | |
| case CLOCK_REALTIME: | |
| *tko = TK_OFFS_REAL; | |
| return 0; | |
| case CLOCK_MONOTONIC: | |
| *tko = TK_OFFS_MAX; | |
| return 0; | |
| case CLOCK_BOOTTIME: | |
| *tko = TK_OFFS_BOOT; | |
| return 0; | |
| case CLOCK_TAI: | |
| *tko = TK_OFFS_TAI; | |
| return 0; | |
| default: | |
| NL_SET_ERR_MSG(extack, "Invalid 'clockid'"); | |
| return -EINVAL; | |
| } | |
| } | |
| static void gate_setup_timer(struct tcf_gate *gact, s32 clockid, | |
| enum tk_offsets tko) | |
| { | |
| WRITE_ONCE(gact->tk_offset, tko); | |
| hrtimer_setup(&gact->hitimer, gate_timer_func, clockid, | |
| HRTIMER_MODE_ABS_SOFT); | |
| } | |
| static int tcf_gate_init(struct net *net, struct nlattr *nla, | |
| struct nlattr *est, struct tc_action **a, | |
| struct tcf_proto *tp, u32 flags, | |
| struct netlink_ext_ack *extack) | |
| { | |
| struct tc_action_net *tn = net_generic(net, act_gate_ops.net_id); | |
| u64 cycletime = 0, basetime = 0, cycletime_ext = 0; | |
| struct tcf_gate_params *p = NULL, *old_p = NULL; | |
| enum tk_offsets old_tk_offset = TK_OFFS_TAI; | |
| const struct tcf_gate_params *cur_p = NULL; | |
| bool bind = flags & TCA_ACT_FLAGS_BIND; | |
| struct nlattr *tb[TCA_GATE_MAX + 1]; | |
| enum tk_offsets tko = TK_OFFS_TAI; | |
| struct tcf_chain *goto_ch = NULL; | |
| s32 timer_clockid = CLOCK_TAI; | |
| bool use_old_entries = false; | |
| s32 old_clockid = CLOCK_TAI; | |
| bool need_cancel = false; | |
| s32 clockid = CLOCK_TAI; | |
| struct tcf_gate *gact; | |
| struct tc_gate *parm; | |
| u64 old_basetime = 0; | |
| int ret = 0, err; | |
| u32 gflags = 0; | |
| s32 prio = -1; | |
| ktime_t start; | |
| u32 index; | |
| if (!nla) | |
| return -EINVAL; | |
| err = nla_parse_nested(tb, TCA_GATE_MAX, nla, gate_policy, extack); | |
| if (err < 0) | |
| return err; | |
| if (!tb[TCA_GATE_PARMS]) | |
| return -EINVAL; | |
| if (tb[TCA_GATE_CLOCKID]) | |
| clockid = nla_get_s32(tb[TCA_GATE_CLOCKID]); | |
| parm = nla_data(tb[TCA_GATE_PARMS]); | |
| index = parm->index; | |
| err = tcf_idr_check_alloc(tn, &index, a, bind); | |
| if (err < 0) | |
| return err; | |
| if (err && bind) | |
| return ACT_P_BOUND; | |
| if (!err) { | |
| ret = tcf_idr_create_from_flags(tn, index, est, a, | |
| &act_gate_ops, bind, flags); | |
| if (ret) { | |
| tcf_idr_cleanup(tn, index); | |
| return ret; | |
| } | |
| ret = ACT_P_CREATED; | |
| } else if (!(flags & TCA_ACT_FLAGS_REPLACE)) { | |
| tcf_idr_release(*a, bind); | |
| return -EEXIST; | |
| } | |
| gact = to_gate(*a); | |
| err = tcf_action_check_ctrlact(parm->action, tp, &goto_ch, extack); | |
| if (err < 0) | |
| goto release_idr; | |
| p = kzalloc_obj(*p); | |
| if (!p) { | |
| err = -ENOMEM; | |
| goto chain_put; | |
| } | |
| INIT_LIST_HEAD(&p->entries); | |
| use_old_entries = !tb[TCA_GATE_ENTRY_LIST]; | |
| if (!use_old_entries) { | |
| err = parse_gate_list(tb[TCA_GATE_ENTRY_LIST], p, extack); | |
| if (err < 0) | |
| goto err_free; | |
| use_old_entries = !err; | |
| } | |
| if (ret == ACT_P_CREATED && use_old_entries) { | |
| NL_SET_ERR_MSG(extack, "The entry list is empty"); | |
| err = -EINVAL; | |
| goto err_free; | |
| } | |
| if (ret != ACT_P_CREATED) { | |
| rcu_read_lock(); | |
| cur_p = rcu_dereference(gact->param); | |
| old_basetime = cur_p->tcfg_basetime; | |
| old_clockid = cur_p->tcfg_clockid; | |
| old_tk_offset = READ_ONCE(gact->tk_offset); | |
| basetime = old_basetime; | |
| cycletime_ext = cur_p->tcfg_cycletime_ext; | |
| prio = cur_p->tcfg_priority; | |
| gflags = cur_p->tcfg_flags; | |
| if (!tb[TCA_GATE_CLOCKID]) | |
| clockid = old_clockid; | |
| err = 0; | |
| if (use_old_entries) { | |
| err = tcf_gate_copy_entries(p, cur_p, extack); | |
| if (!err && !tb[TCA_GATE_CYCLE_TIME]) | |
| cycletime = cur_p->tcfg_cycletime; | |
| } | |
| rcu_read_unlock(); | |
| if (err) | |
| goto err_free; | |
| } | |
| if (tb[TCA_GATE_PRIORITY]) | |
| prio = nla_get_s32(tb[TCA_GATE_PRIORITY]); | |
| if (tb[TCA_GATE_BASE_TIME]) | |
| basetime = nla_get_u64(tb[TCA_GATE_BASE_TIME]); | |
| if (tb[TCA_GATE_FLAGS]) | |
| gflags = nla_get_u32(tb[TCA_GATE_FLAGS]); | |
| if (tb[TCA_GATE_CYCLE_TIME]) | |
| cycletime = nla_get_u64(tb[TCA_GATE_CYCLE_TIME]); | |
| if (tb[TCA_GATE_CYCLE_TIME_EXT]) | |
| cycletime_ext = nla_get_u64(tb[TCA_GATE_CYCLE_TIME_EXT]); | |
| err = gate_clock_resolve(clockid, &tko, extack); | |
| if (err) | |
| goto err_free; | |
| timer_clockid = clockid; | |
| need_cancel = ret != ACT_P_CREATED && | |
| gate_timer_needs_cancel(basetime, old_basetime, | |
| tko, old_tk_offset, | |
| timer_clockid, old_clockid); | |
| if (need_cancel) | |
| hrtimer_cancel(&gact->hitimer); | |
| spin_lock_bh(&gact->tcf_lock); | |
| if (!cycletime) { | |
| struct tcfg_gate_entry *entry; | |
| ktime_t cycle = 0; | |
| list_for_each_entry(entry, &p->entries, list) | |
| cycle = ktime_add_ns(cycle, entry->interval); | |
| cycletime = cycle; | |
| } | |
| p->tcfg_cycletime = cycletime; | |
| p->tcfg_cycletime_ext = cycletime_ext; | |
| if (need_cancel || ret == ACT_P_CREATED) | |
| gate_setup_timer(gact, timer_clockid, tko); | |
| p->tcfg_priority = prio; | |
| p->tcfg_flags = gflags; | |
| p->tcfg_basetime = basetime; | |
| p->tcfg_clockid = timer_clockid; | |
| gate_get_start_time(gact, p, &start); | |
| old_p = rcu_replace_pointer(gact->param, p, | |
| lockdep_is_held(&gact->tcf_lock)); | |
| gact->current_close_time = start; | |
| gact->current_gate_status = GATE_ACT_GATE_OPEN | GATE_ACT_PENDING; | |
| gact->next_entry = list_first_entry(&p->entries, | |
| struct tcfg_gate_entry, list); | |
| goto_ch = tcf_action_set_ctrlact(*a, parm->action, goto_ch); | |
| gate_start_timer(gact, start); | |
| spin_unlock_bh(&gact->tcf_lock); | |
| if (goto_ch) | |
| tcf_chain_put_by_act(goto_ch); | |
| if (old_p) | |
| call_rcu(&old_p->rcu, tcf_gate_params_free_rcu); | |
| return ret; | |
| err_free: | |
| release_entry_list(&p->entries); | |
| kfree(p); | |
| chain_put: | |
| if (goto_ch) | |
| tcf_chain_put_by_act(goto_ch); | |
| release_idr: | |
| /* action is not inserted in any list: it's safe to init hitimer | |
| * without taking tcf_lock. | |
| */ | |
| if (ret == ACT_P_CREATED) | |
| gate_setup_timer(gact, timer_clockid, tko); | |
| tcf_idr_release(*a, bind); | |
| return err; | |
| } | |
| static void tcf_gate_params_free_rcu(struct rcu_head *head) | |
| { | |
| struct tcf_gate_params *p = container_of(head, struct tcf_gate_params, rcu); | |
| release_entry_list(&p->entries); | |
| kfree(p); | |
| } | |
| static void tcf_gate_cleanup(struct tc_action *a) | |
| { | |
| struct tcf_gate *gact = to_gate(a); | |
| struct tcf_gate_params *p; | |
| hrtimer_cancel(&gact->hitimer); | |
| p = rcu_dereference_protected(gact->param, 1); | |
| if (p) | |
| call_rcu(&p->rcu, tcf_gate_params_free_rcu); | |
| } | |
| static int dumping_entry(struct sk_buff *skb, | |
| struct tcfg_gate_entry *entry) | |
| { | |
| struct nlattr *item; | |
| item = nla_nest_start_noflag(skb, TCA_GATE_ONE_ENTRY); | |
| if (!item) | |
| return -ENOSPC; | |
| if (nla_put_u32(skb, TCA_GATE_ENTRY_INDEX, entry->index)) | |
| goto nla_put_failure; | |
| if (entry->gate_state && nla_put_flag(skb, TCA_GATE_ENTRY_GATE)) | |
| goto nla_put_failure; | |
| if (nla_put_u32(skb, TCA_GATE_ENTRY_INTERVAL, entry->interval)) | |
| goto nla_put_failure; | |
| if (nla_put_s32(skb, TCA_GATE_ENTRY_MAX_OCTETS, entry->maxoctets)) | |
| goto nla_put_failure; | |
| if (nla_put_s32(skb, TCA_GATE_ENTRY_IPV, entry->ipv)) | |
| goto nla_put_failure; | |
| return nla_nest_end(skb, item); | |
| nla_put_failure: | |
| nla_nest_cancel(skb, item); | |
| return -1; | |
| } | |
| static int tcf_gate_dump(struct sk_buff *skb, struct tc_action *a, | |
| int bind, int ref) | |
| { | |
| unsigned char *b = skb_tail_pointer(skb); | |
| struct tcf_gate *gact = to_gate(a); | |
| struct tc_gate opt = { | |
| .index = gact->tcf_index, | |
| .refcnt = refcount_read(&gact->tcf_refcnt) - ref, | |
| .bindcnt = atomic_read(&gact->tcf_bindcnt) - bind, | |
| }; | |
| struct tcfg_gate_entry *entry; | |
| struct tcf_gate_params *p; | |
| struct nlattr *entry_list; | |
| struct tcf_t t; | |
| rcu_read_lock(); | |
| opt.action = READ_ONCE(gact->tcf_action); | |
| p = rcu_dereference(gact->param); | |
| if (nla_put(skb, TCA_GATE_PARMS, sizeof(opt), &opt)) | |
| goto nla_put_failure; | |
| if (nla_put_u64_64bit(skb, TCA_GATE_BASE_TIME, | |
| p->tcfg_basetime, TCA_GATE_PAD)) | |
| goto nla_put_failure; | |
| if (nla_put_u64_64bit(skb, TCA_GATE_CYCLE_TIME, | |
| p->tcfg_cycletime, TCA_GATE_PAD)) | |
| goto nla_put_failure; | |
| if (nla_put_u64_64bit(skb, TCA_GATE_CYCLE_TIME_EXT, | |
| p->tcfg_cycletime_ext, TCA_GATE_PAD)) | |
| goto nla_put_failure; | |
| if (nla_put_s32(skb, TCA_GATE_CLOCKID, p->tcfg_clockid)) | |
| goto nla_put_failure; | |
| if (nla_put_u32(skb, TCA_GATE_FLAGS, p->tcfg_flags)) | |
| goto nla_put_failure; | |
| if (nla_put_s32(skb, TCA_GATE_PRIORITY, p->tcfg_priority)) | |
| goto nla_put_failure; | |
| entry_list = nla_nest_start_noflag(skb, TCA_GATE_ENTRY_LIST); | |
| if (!entry_list) | |
| goto nla_put_failure; | |
| list_for_each_entry(entry, &p->entries, list) { | |
| if (dumping_entry(skb, entry) < 0) | |
| goto nla_put_failure; | |
| } | |
| nla_nest_end(skb, entry_list); | |
| tcf_tm_dump(&t, &gact->tcf_tm); | |
| if (nla_put_64bit(skb, TCA_GATE_TM, sizeof(t), &t, TCA_GATE_PAD)) | |
| goto nla_put_failure; | |
| rcu_read_unlock(); | |
| return skb->len; | |
| nla_put_failure: | |
| rcu_read_unlock(); | |
| nlmsg_trim(skb, b); | |
| return -1; | |
| } | |
| static void tcf_gate_stats_update(struct tc_action *a, u64 bytes, u64 packets, | |
| u64 drops, u64 lastuse, bool hw) | |
| { | |
| struct tcf_gate *gact = to_gate(a); | |
| struct tcf_t *tm = &gact->tcf_tm; | |
| tcf_action_update_stats(a, bytes, packets, drops, hw); | |
| tm->lastuse = max_t(u64, tm->lastuse, lastuse); | |
| } | |
| static size_t tcf_gate_get_fill_size(const struct tc_action *act) | |
| { | |
| struct tcf_gate *gact = to_gate(act); | |
| const struct tcf_gate_params *p; | |
| struct tcfg_gate_entry *entry; | |
| size_t size = nla_total_size(sizeof(struct tc_gate)) /* TCA_GATE_PARMS */ | |
| + 3 * nla_total_size_64bit(sizeof(u64)) /* TCA_GATE_BASE_TIME | |
| * TCA_GATE_CYCLE_TIME | |
| * TCA_GATE_CYCLE_TIME_EXT | |
| */ | |
| + nla_total_size(sizeof(s32)) /* TCA_GATE_CLOCKID */ | |
| + nla_total_size(sizeof(u32)) /* TCA_GATE_FLAGS */ | |
| + nla_total_size(sizeof(s32)) /* TCA_GATE_PRIORITY */ | |
| + nla_total_size(0); /* TCA_GATE_ENTRY_LIST */ | |
| /* TCA_GATE_TM is budgeted by tcf_action_shared_attrs_size() */ | |
| rcu_read_lock(); | |
| p = rcu_dereference(gact->param); | |
| if (p) { | |
| list_for_each_entry_rcu(entry, &p->entries, list) | |
| /* TCA_GATE_ONE_ENTRY nest and its attributes */ | |
| size += nla_total_size(0) | |
| + nla_total_size(sizeof(u32)) /* TCA_GATE_ENTRY_INDEX */ | |
| + nla_total_size(0) /* TCA_GATE_ENTRY_GATE */ | |
| + nla_total_size(sizeof(u32)) /* TCA_GATE_ENTRY_INTERVAL */ | |
| + nla_total_size(sizeof(s32)) /* TCA_GATE_ENTRY_MAX_OCTETS */ | |
| + nla_total_size(sizeof(s32)); /* TCA_GATE_ENTRY_IPV */ | |
| } | |
| rcu_read_unlock(); | |
| return size; | |
| } | |
| static void tcf_gate_entry_destructor(void *priv) | |
| { | |
| struct action_gate_entry *oe = priv; | |
| kfree(oe); | |
| } | |
| static int tcf_gate_get_entries(struct flow_action_entry *entry, | |
| const struct tc_action *act) | |
| { | |
| entry->gate.entries = tcf_gate_get_list(act); | |
| if (!entry->gate.entries) | |
| return -EINVAL; | |
| entry->destructor = tcf_gate_entry_destructor; | |
| entry->destructor_priv = entry->gate.entries; | |
| return 0; | |
| } | |
| static int tcf_gate_offload_act_setup(struct tc_action *act, void *entry_data, | |
| u32 *index_inc, bool bind, | |
| struct netlink_ext_ack *extack) | |
| { | |
| int err; | |
| if (bind) { | |
| struct flow_action_entry *entry = entry_data; | |
| entry->id = FLOW_ACTION_GATE; | |
| entry->gate.prio = tcf_gate_prio(act); | |
| entry->gate.basetime = tcf_gate_basetime(act); | |
| entry->gate.cycletime = tcf_gate_cycletime(act); | |
| entry->gate.cycletimeext = tcf_gate_cycletimeext(act); | |
| entry->gate.num_entries = tcf_gate_num_entries(act); | |
| err = tcf_gate_get_entries(entry, act); | |
| if (err) | |
| return err; | |
| *index_inc = 1; | |
| } else { | |
| struct flow_offload_action *fl_action = entry_data; | |
| fl_action->id = FLOW_ACTION_GATE; | |
| } | |
| return 0; | |
| } | |
| static struct tc_action_ops act_gate_ops = { | |
| .kind = "gate", | |
| .id = TCA_ID_GATE, | |
| .owner = THIS_MODULE, | |
| .act = tcf_gate_act, | |
| .dump = tcf_gate_dump, | |
| .init = tcf_gate_init, | |
| .cleanup = tcf_gate_cleanup, | |
| .stats_update = tcf_gate_stats_update, | |
| .get_fill_size = tcf_gate_get_fill_size, | |
| .offload_act_setup = tcf_gate_offload_act_setup, | |
| .size = sizeof(struct tcf_gate), | |
| }; | |
| MODULE_ALIAS_NET_ACT("gate"); | |
| static __net_init int gate_init_net(struct net *net) | |
| { | |
| struct tc_action_net *tn = net_generic(net, act_gate_ops.net_id); | |
| return tc_action_net_init(net, tn, &act_gate_ops); | |
| } | |
| static void __net_exit gate_exit_net(struct list_head *net_list) | |
| { | |
| tc_action_net_exit(net_list, act_gate_ops.net_id); | |
| } | |
| static struct pernet_operations gate_net_ops = { | |
| .init = gate_init_net, | |
| .exit_batch = gate_exit_net, | |
| .id = &act_gate_ops.net_id, | |
| .size = sizeof(struct tc_action_net), | |
| }; | |
| static int __init gate_init_module(void) | |
| { | |
| return tcf_register_action(&act_gate_ops, &gate_net_ops); | |
| } | |
| static void __exit gate_cleanup_module(void) | |
| { | |
| tcf_unregister_action(&act_gate_ops, &gate_net_ops); | |
| } | |
| module_init(gate_init_module); | |
| module_exit(gate_cleanup_module); | |
| MODULE_DESCRIPTION("TC gate action"); | |
| MODULE_LICENSE("GPL v2"); |