2 * Distributed under the terms of the GNU GPL version 2.
3 * Copyright (c) 2007, 2008 The Board of Trustees of The Leland
4 * Stanford Junior University
11 #include <linux/rcupdate.h>
12 #include <linux/slab.h>
13 #include <linux/rculist.h>
15 struct sw_table_linear {
18 unsigned int max_flows;
20 struct list_head flows;
21 struct list_head iter_flows;
22 unsigned long int next_serial;
25 static struct sw_flow *table_linear_lookup(struct sw_table *swt,
26 const struct sw_flow_key *key)
28 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
30 list_for_each_entry_rcu (flow, &tl->flows, node) {
31 if (flow_matches_1wild(key, &flow->key))
37 static int table_linear_insert(struct sw_table *swt, struct sw_flow *flow)
39 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
43 /* Loop through the existing list of entries. New entries will
44 * always be placed behind those with equal priority. Just replace
45 * any flows that match exactly.
47 list_for_each_entry (f, &tl->flows, node) {
48 if (f->priority == flow->priority
49 && f->key.wildcards == flow->key.wildcards
50 && flow_matches_2wild(&f->key, &flow->key)) {
51 /* Keep stats from the original flow */
52 flow->init_time = f->init_time;
53 flow->packet_count = f->packet_count;
54 flow->byte_count = f->byte_count;
56 flow->serial = f->serial;
57 list_replace_rcu(&f->node, &flow->node);
58 list_replace_rcu(&f->iter_node, &flow->iter_node);
59 flow_deferred_free(f);
63 if (f->priority < flow->priority)
67 /* Make sure there's room in the table. */
68 if (tl->n_flows >= tl->max_flows) {
73 /* Insert the entry immediately in front of where we're pointing. */
74 flow->serial = tl->next_serial++;
75 list_add_tail_rcu(&flow->node, &f->node);
76 list_add_rcu(&flow->iter_node, &tl->iter_flows);
80 static int do_delete(struct sw_table *swt, struct sw_flow *flow)
82 list_del_rcu(&flow->node);
83 list_del_rcu(&flow->iter_node);
84 flow_deferred_free(flow);
88 static int table_linear_delete(struct sw_table *swt,
89 const struct sw_flow_key *key, uint16_t priority, int strict)
91 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
93 unsigned int count = 0;
95 list_for_each_entry (flow, &tl->flows, node) {
96 if (flow_del_matches(&flow->key, key, strict)
97 && (!strict || (flow->priority == priority)))
98 count += do_delete(swt, flow);
100 tl->n_flows -= count;
104 static int table_linear_timeout(struct datapath *dp, struct sw_table *swt)
106 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
107 struct sw_flow *flow;
110 mutex_lock(&dp_mutex);
111 list_for_each_entry (flow, &tl->flows, node) {
112 int reason = flow_timeout(flow);
114 count += do_delete(swt, flow);
115 dp_send_flow_expired(dp, flow, reason);
118 tl->n_flows -= count;
119 mutex_unlock(&dp_mutex);
123 static void table_linear_destroy(struct sw_table *swt)
125 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
127 while (!list_empty(&tl->flows)) {
128 struct sw_flow *flow = list_entry(tl->flows.next,
129 struct sw_flow, node);
130 list_del(&flow->node);
136 static int table_linear_iterate(struct sw_table *swt,
137 const struct sw_flow_key *key,
138 struct sw_table_position *position,
139 int (*callback)(struct sw_flow *, void *),
142 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
143 struct sw_flow *flow;
146 start = position->private[0];
147 list_for_each_entry (flow, &tl->iter_flows, iter_node) {
148 if (flow->serial >= start
149 && flow_matches_2wild(key, &flow->key)) {
150 int error = callback(flow, private);
152 position->private[0] = flow->serial;
160 static void table_linear_stats(struct sw_table *swt,
161 struct sw_table_stats *stats)
163 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
164 stats->name = "linear";
165 stats->wildcards = OFPFW_ALL;
166 stats->n_flows = tl->n_flows;
167 stats->max_flows = tl->max_flows;
168 stats->n_matched = swt->n_matched;
172 struct sw_table *table_linear_create(unsigned int max_flows)
174 struct sw_table_linear *tl;
175 struct sw_table *swt;
177 tl = kzalloc(sizeof *tl, GFP_KERNEL);
182 swt->lookup = table_linear_lookup;
183 swt->insert = table_linear_insert;
184 swt->delete = table_linear_delete;
185 swt->timeout = table_linear_timeout;
186 swt->destroy = table_linear_destroy;
187 swt->iterate = table_linear_iterate;
188 swt->stats = table_linear_stats;
190 tl->max_flows = max_flows;
192 INIT_LIST_HEAD(&tl->flows);
193 INIT_LIST_HEAD(&tl->iter_flows);