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.
38 #include "switch-flow.h"
41 struct sw_table_linear {
44 unsigned int max_flows;
49 static struct sw_flow *table_linear_lookup(struct sw_table *swt,
50 const struct sw_flow_key *key)
52 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
54 LIST_FOR_EACH (flow, struct sw_flow, node, &tl->flows) {
55 if (flow_matches(&flow->key, key))
61 static int table_linear_insert(struct sw_table *swt, struct sw_flow *flow)
63 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
66 /* Replace flows that match exactly. */
67 LIST_FOR_EACH (f, struct sw_flow, node, &tl->flows) {
68 if (f->key.wildcards == flow->key.wildcards
69 && flow_matches(&f->key, &flow->key)) {
70 list_replace(&flow->node, &f->node);
77 if (tl->n_flows >= tl->max_flows) {
82 /* FIXME: need to order rules from most to least specific. */
83 list_push_back(&tl->flows, &flow->node);
88 do_delete(struct sw_flow *flow)
90 list_remove(&flow->node);
94 static int table_linear_delete(struct sw_table *swt,
95 const struct sw_flow_key *key, int strict)
97 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
98 struct sw_flow *flow, *n;
99 unsigned int count = 0;
101 LIST_FOR_EACH_SAFE (flow, n, struct sw_flow, node, &tl->flows) {
102 if (flow_del_matches(&flow->key, key, strict)) {
107 tl->n_flows -= count;
111 static void table_linear_timeout(struct sw_table *swt, struct list *deleted)
113 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
114 struct sw_flow *flow, *n;
116 LIST_FOR_EACH_SAFE (flow, n, struct sw_flow, node, &tl->flows) {
117 if (flow_timeout(flow)) {
118 list_remove(&flow->node);
119 list_push_back(deleted, &flow->node);
125 static void table_linear_destroy(struct sw_table *swt)
127 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
129 while (!list_is_empty(&tl->flows)) {
130 struct sw_flow *flow = CONTAINER_OF(list_front(&tl->flows),
131 struct sw_flow, node);
132 list_remove(&flow->node);
138 /* Linear table's private data is just a pointer to the table */
140 static int table_linear_iterator(struct sw_table *swt,
141 struct swt_iterator *swt_iter)
143 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
145 swt_iter->private = tl;
148 swt_iter->flow = NULL;
150 swt_iter->flow = CONTAINER_OF(list_front(&tl->flows), struct sw_flow, node);
155 static void table_linear_next(struct swt_iterator *swt_iter)
157 struct sw_table_linear *tl;
160 if (swt_iter->flow == NULL)
163 tl = (struct sw_table_linear *) swt_iter->private;
165 next = swt_iter->flow->node.next;
166 if (next == &tl->flows)
167 swt_iter->flow = NULL;
169 swt_iter->flow = CONTAINER_OF(next, struct sw_flow, node);
172 static void table_linear_iterator_destroy(struct swt_iterator *swt_iter)
175 static void table_linear_stats(struct sw_table *swt,
176 struct sw_table_stats *stats)
178 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
179 stats->name = "linear";
180 stats->n_flows = tl->n_flows;
181 stats->max_flows = tl->max_flows;
185 struct sw_table *table_linear_create(unsigned int max_flows)
187 struct sw_table_linear *tl;
188 struct sw_table *swt;
190 tl = calloc(1, sizeof *tl);
195 swt->lookup = table_linear_lookup;
196 swt->insert = table_linear_insert;
197 swt->delete = table_linear_delete;
198 swt->timeout = table_linear_timeout;
199 swt->destroy = table_linear_destroy;
200 swt->stats = table_linear_stats;
202 swt->iterator = table_linear_iterator;
203 swt->iterator_next = table_linear_next;
204 swt->iterator_destroy = table_linear_iterator_destroy;
206 tl->max_flows = max_flows;
208 list_init(&tl->flows);