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;
47 struct list iter_flows;
48 unsigned long int next_serial;
51 static struct sw_flow *table_linear_lookup(struct sw_table *swt,
52 const struct sw_flow_key *key)
54 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
56 LIST_FOR_EACH (flow, struct sw_flow, node, &tl->flows) {
57 if (flow_matches(&flow->key, key))
63 static int table_linear_insert(struct sw_table *swt, struct sw_flow *flow)
65 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
68 /* Loop through the existing list of entries. New entries will
69 * always be placed behind those with equal priority. Just replace
70 * any flows that match exactly.
72 LIST_FOR_EACH (f, struct sw_flow, node, &tl->flows) {
73 if (f->priority == flow->priority
74 && f->key.wildcards == flow->key.wildcards
75 && flow_matches(&f->key, &flow->key)) {
76 flow->serial = f->serial;
77 list_replace(&flow->node, &f->node);
78 list_replace(&flow->iter_node, &f->iter_node);
83 if (f->priority < flow->priority)
87 /* Make sure there's room in the table. */
88 if (tl->n_flows >= tl->max_flows) {
93 /* Insert the entry immediately in front of where we're pointing. */
94 list_insert(&f->node, &flow->node);
95 list_push_front(&tl->iter_flows, &flow->iter_node);
101 do_delete(struct sw_flow *flow)
103 list_remove(&flow->node);
104 list_remove(&flow->iter_node);
108 static int table_linear_delete(struct sw_table *swt,
109 const struct sw_flow_key *key,
110 uint16_t priority, int strict)
112 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
113 struct sw_flow *flow, *n;
114 unsigned int count = 0;
116 LIST_FOR_EACH_SAFE (flow, n, struct sw_flow, node, &tl->flows) {
117 if (flow_del_matches(&flow->key, key, strict)
118 && (!strict || (flow->priority == priority))) {
123 tl->n_flows -= count;
127 static void table_linear_timeout(struct sw_table *swt, struct list *deleted)
129 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
130 struct sw_flow *flow, *n;
132 LIST_FOR_EACH_SAFE (flow, n, struct sw_flow, node, &tl->flows) {
133 if (flow_timeout(flow)) {
134 list_remove(&flow->node);
135 list_remove(&flow->iter_node);
136 list_push_back(deleted, &flow->node);
142 static void table_linear_destroy(struct sw_table *swt)
144 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
146 while (!list_is_empty(&tl->flows)) {
147 struct sw_flow *flow = CONTAINER_OF(list_front(&tl->flows),
148 struct sw_flow, node);
149 list_remove(&flow->node);
155 static int table_linear_iterate(struct sw_table *swt,
156 const struct sw_flow_key *key,
157 struct sw_table_position *position,
158 int (*callback)(struct sw_flow *, void *),
161 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
162 struct sw_flow *flow;
165 start = ~position->private[0];
166 LIST_FOR_EACH (flow, struct sw_flow, iter_node, &tl->iter_flows) {
167 if (flow->serial <= start && flow_matches(key, &flow->key)) {
168 int error = callback(flow, private);
170 position->private[0] = ~(flow->serial - 1);
178 static void table_linear_stats(struct sw_table *swt,
179 struct sw_table_stats *stats)
181 struct sw_table_linear *tl = (struct sw_table_linear *) swt;
182 stats->name = "linear";
183 stats->n_flows = tl->n_flows;
184 stats->max_flows = tl->max_flows;
188 struct sw_table *table_linear_create(unsigned int max_flows)
190 struct sw_table_linear *tl;
191 struct sw_table *swt;
193 tl = calloc(1, sizeof *tl);
198 swt->lookup = table_linear_lookup;
199 swt->insert = table_linear_insert;
200 swt->delete = table_linear_delete;
201 swt->timeout = table_linear_timeout;
202 swt->destroy = table_linear_destroy;
203 swt->iterate = table_linear_iterate;
204 swt->stats = table_linear_stats;
206 tl->max_flows = max_flows;
208 list_init(&tl->flows);
209 list_init(&tl->iter_flows);