1 /* Copyright (c) 2008 The Board of Trustees of The Leland Stanford
4 * We are making the OpenFlow specification and associated documentation
5 * (Software) available for public use and benefit with the expectation
6 * that others will use, modify and enhance the Software and contribute
7 * those enhancements back to the community. However, since we would
8 * like to make the Software available for broadest use, with as few
9 * restrictions as possible permission is hereby granted, free of
10 * charge, to any person obtaining a copy of this Software to deal in
11 * the Software under the copyrights without restriction, including
12 * without limitation the rights to use, copy, modify, merge, publish,
13 * distribute, sublicense, and/or sell copies of the Software, and to
14 * permit persons to whom the Software is furnished to do so, subject to
15 * the following conditions:
17 * The above copyright notice and this permission notice shall be
18 * included in all copies or substantial portions of the Software.
20 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
21 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
22 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
23 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
24 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
25 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
26 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
29 * The name and trademarks of copyright holder(s) may NOT be used in
30 * advertising or publicity pertaining to the Software or any
31 * derivatives without specific, written prior permission.
34 #include <linux/module.h>
35 #include <linux/rcupdate.h>
36 #include <linux/slab.h>
37 #include <linux/list.h>
38 #include <linux/rculist.h>
39 #include <linux/delay.h>
40 #include <linux/if_arp.h>
48 /* Max number of flow entries supported by the hardware */
49 #define DUMMY_MAX_FLOW 8192
52 /* sw_flow private data for dummy table entries. */
53 struct sw_flow_dummy {
54 struct list_head node;
56 /* xxx If per-entry data is needed, define it here. */
59 struct sw_table_dummy {
62 unsigned int max_flows;
64 struct list_head flows;
65 struct list_head iter_flows;
66 unsigned long int next_serial;
70 static struct sw_flow *table_dummy_lookup(struct sw_table *swt,
71 const struct sw_flow_key *key)
73 struct sw_table_dummy *td = (struct sw_table_dummy *) swt;
75 list_for_each_entry (flow, &td->flows, node) {
76 if (flow_matches_1wild(key, &flow->key)) {
83 static int table_dummy_insert(struct sw_table *swt, struct sw_flow *flow)
85 /* xxx Use a data cache? */
86 flow->private = kzalloc(sizeof(struct sw_flow_dummy), GFP_ATOMIC);
87 if (flow->private == NULL)
90 /* xxx Do whatever needs to be done to insert an entry in hardware.
91 * xxx If the entry can't be inserted, return 0. This stub code
92 * xxx doesn't do anything yet, so we're going to return 0...you
93 * xxx shouldn't (and you should update n_flows in struct
94 * xxx sw_table_dummy, too).
100 static int table_dummy_modify(struct sw_table *swt,
101 const struct sw_flow_key *key,
102 const struct ofp_action *actions, int n_actions)
104 struct sw_table_dummy *td = (struct sw_table_dummy *) swt;
105 struct sw_flow *flow;
106 unsigned int count = 0;
108 list_for_each_entry (flow, &td->flows, node) {
109 if (flow_matches_1wild(&flow->key, key)) {
110 flow_replace_acts(flow, actions, n_actions);
111 /* xxx Do whatever is necessary to modify the entry in hardware */
119 static int do_delete(struct sw_table *swt, struct sw_flow *flow)
121 /* xxx Remove the entry from hardware. If you need to do any other
122 * xxx clean-up associated with the entry, do it here.
124 list_del_rcu(&flow->node);
125 list_del_rcu(&flow->iter_node);
126 flow_deferred_free(flow);
130 static int table_dummy_delete(struct sw_table *swt,
131 const struct sw_flow_key *key, uint16_t priority, int strict)
133 struct sw_table_dummy *td = (struct sw_table_dummy *) swt;
134 struct sw_flow *flow;
135 unsigned int count = 0;
137 list_for_each_entry (flow, &td->flows, node) {
138 if (flow_del_matches(&flow->key, key, strict)
139 && (!strict || (flow->priority == priority)))
140 count += do_delete(swt, flow);
142 td->n_flows -= count;
147 static int table_dummy_timeout(struct datapath *dp, struct sw_table *swt)
149 struct sw_table_dummy *td = (struct sw_table_dummy *) swt;
150 struct sw_flow *flow;
152 uint64_t packet_count = 0;
153 uint64_t byte_count = 0;
156 mutex_lock(&dp_mutex);
157 list_for_each_entry (flow, &td->flows, node) {
158 /* xxx Retrieve the packet and byte counts associated with this
159 * entry xxx and store them in "packet_count" and "byte_count".
162 if (packet_count != flow->packet_count) {
163 flow->packet_count = packet_count;
164 flow->byte_count = byte_count;
165 flow->used = jiffies;
168 reason = flow_timeout(flow);
170 if (dp->flags & OFPC_SEND_FLOW_EXP) {
171 /* xxx Get byte count */
172 flow->byte_count = 0;
173 dp_send_flow_expired(dp, flow, reason);
175 del_count += do_delete(swt, flow);
178 mutex_unlock(&dp_mutex);
180 td->n_flows -= del_count;
185 static void table_dummy_destroy(struct sw_table *swt)
187 struct sw_table_dummy *td = (struct sw_table_dummy *)swt;
190 /* xxx This table is being destroyed, so free any data that you
191 * xxx don't want to leak.
196 while (!list_empty(&td->flows)) {
197 struct sw_flow *flow = list_entry(td->flows.next,
198 struct sw_flow, node);
199 list_del(&flow->node);
206 static int table_dummy_iterate(struct sw_table *swt,
207 const struct sw_flow_key *key,
208 struct sw_table_position *position,
209 int (*callback)(struct sw_flow *, void *),
212 struct sw_table_dummy *td = (struct sw_table_dummy *) swt;
213 struct sw_flow *flow;
216 start = ~position->private[0];
217 list_for_each_entry (flow, &td->iter_flows, iter_node) {
218 if (flow->serial <= start && flow_matches_2wild(key,
220 int error = callback(flow, private);
222 position->private[0] = ~flow->serial;
230 static void table_dummy_stats(struct sw_table *swt,
231 struct sw_table_stats *stats)
233 struct sw_table_dummy *td = (struct sw_table_dummy *) swt;
234 stats->name = "dummy";
235 stats->wildcards = OFPFW_ALL; /* xxx Set this appropriately */
236 stats->n_flows = td->n_flows;
237 stats->max_flows = td->max_flows;
238 stats->n_matched = swt->n_matched;
242 static struct sw_table *table_dummy_create(void)
244 struct sw_table_dummy *td;
245 struct sw_table *swt;
247 td = kzalloc(sizeof *td, GFP_KERNEL);
252 swt->lookup = table_dummy_lookup;
253 swt->insert = table_dummy_insert;
254 swt->modify = table_dummy_modify;
255 swt->delete = table_dummy_delete;
256 swt->timeout = table_dummy_timeout;
257 swt->destroy = table_dummy_destroy;
258 swt->iterate = table_dummy_iterate;
259 swt->stats = table_dummy_stats;
261 td->max_flows = DUMMY_MAX_FLOW;
263 INIT_LIST_HEAD(&td->flows);
264 INIT_LIST_HEAD(&td->iter_flows);
270 static int __init dummy_init(void)
272 return chain_set_hw_hook(table_dummy_create, THIS_MODULE);
274 module_init(dummy_init);
276 static void dummy_cleanup(void)
278 chain_clear_hw_hook();
280 module_exit(dummy_cleanup);
282 MODULE_DESCRIPTION("Dummy hardware table driver");
283 MODULE_AUTHOR("Copyright (c) 2008 The Board of Trustees of The Leland Stanford Junior University");
284 MODULE_LICENSE("Stanford License");