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.
39 #include "openflow/nicira-ext.h"
43 #include "switch-flow.h"
45 struct sw_table_hash {
49 unsigned int bucket_mask; /* Number of buckets minus 1. */
50 struct sw_flow **buckets;
53 static struct sw_flow **find_bucket(struct sw_table *swt,
54 const struct sw_flow_key *key)
56 struct sw_table_hash *th = (struct sw_table_hash *) swt;
57 unsigned int crc = crc32_calculate(&th->crc32, key,
58 offsetof(struct sw_flow_key, wildcards));
59 return &th->buckets[crc & th->bucket_mask];
62 static struct sw_flow *table_hash_lookup(struct sw_table *swt,
63 const struct sw_flow_key *key)
65 struct sw_flow *flow = *find_bucket(swt, key);
66 return flow && !flow_compare(&flow->key.flow, &key->flow) ? flow : NULL;
69 static int table_hash_insert(struct sw_table *swt, struct sw_flow *flow)
71 struct sw_table_hash *th = (struct sw_table_hash *) swt;
72 struct sw_flow **bucket;
75 if (flow->key.wildcards != 0)
78 bucket = find_bucket(swt, &flow->key);
79 if (*bucket == NULL) {
84 struct sw_flow *old_flow = *bucket;
85 if (!flow_compare(&old_flow->key.flow, &flow->key.flow)) {
96 static int table_hash_modify(struct sw_table *swt,
97 const struct sw_flow_key *key, uint16_t priority, int strict,
98 const struct ofp_action_header *actions, size_t actions_len)
100 struct sw_table_hash *th = (struct sw_table_hash *) swt;
101 unsigned int count = 0;
103 if (key->wildcards == 0) {
104 struct sw_flow **bucket = find_bucket(swt, key);
105 struct sw_flow *flow = *bucket;
106 if (flow && flow_matches_desc(&flow->key, key, strict)
107 && (!strict || (flow->priority == priority))) {
108 flow_replace_acts(flow, actions, actions_len);
114 for (i = 0; i <= th->bucket_mask; i++) {
115 struct sw_flow **bucket = &th->buckets[i];
116 struct sw_flow *flow = *bucket;
117 if (flow && flow_matches_desc(&flow->key, key, strict)
118 && (!strict || (flow->priority == priority))) {
119 flow_replace_acts(flow, actions, actions_len);
127 /* Caller must update n_flows. */
129 do_delete(struct sw_flow **bucket)
135 /* Returns number of deleted flows. We can igonre the priority
136 * argument, since all exact-match entries are the same (highest)
138 static int table_hash_delete(struct datapath *dp, struct sw_table *swt,
139 const struct sw_flow_key *key,
141 uint16_t priority, int strict)
143 struct sw_table_hash *th = (struct sw_table_hash *) swt;
144 unsigned int count = 0;
146 if (key->wildcards == 0) {
147 struct sw_flow **bucket = find_bucket(swt, key);
148 struct sw_flow *flow = *bucket;
149 if (flow && !flow_compare(&flow->key.flow, &key->flow)
150 && flow_has_out_port(flow, out_port)) {
151 dp_send_flow_end(dp, flow, NXFER_DELETE);
158 for (i = 0; i <= th->bucket_mask; i++) {
159 struct sw_flow **bucket = &th->buckets[i];
160 struct sw_flow *flow = *bucket;
161 if (flow && flow_matches_desc(&flow->key, key, strict)
162 && flow_has_out_port(flow, out_port)) {
163 dp_send_flow_end(dp, flow, NXFER_DELETE);
169 th->n_flows -= count;
173 static void table_hash_timeout(struct sw_table *swt, struct list *deleted)
175 struct sw_table_hash *th = (struct sw_table_hash *) swt;
178 for (i = 0; i <= th->bucket_mask; i++) {
179 struct sw_flow **bucket = &th->buckets[i];
180 struct sw_flow *flow = *bucket;
181 if (flow && flow_timeout(flow)) {
182 list_push_back(deleted, &flow->node);
189 static void table_hash_destroy(struct sw_table *swt)
191 struct sw_table_hash *th = (struct sw_table_hash *) swt;
193 for (i = 0; i <= th->bucket_mask; i++) {
194 if (th->buckets[i]) {
195 flow_free(th->buckets[i]);
202 static int table_hash_iterate(struct sw_table *swt,
203 const struct sw_flow_key *key, uint16_t out_port,
204 struct sw_table_position *position,
205 int (*callback)(struct sw_flow *, void *private),
208 struct sw_table_hash *th = (struct sw_table_hash *) swt;
210 if (position->private[0] > th->bucket_mask)
213 if (key->wildcards == 0) {
214 struct sw_flow *flow = table_hash_lookup(swt, key);
215 position->private[0] = -1;
216 if (!flow || !flow_has_out_port(flow, out_port)) {
219 return callback(flow, private);
223 for (i = position->private[0]; i <= th->bucket_mask; i++) {
224 struct sw_flow *flow = th->buckets[i];
225 if (flow && flow_matches_1wild(&flow->key, key)
226 && flow_has_out_port(flow, out_port)) {
227 int error = callback(flow, private);
229 position->private[0] = i + 1;
238 static void table_hash_stats(struct sw_table *swt,
239 struct sw_table_stats *stats)
241 struct sw_table_hash *th = (struct sw_table_hash *) swt;
242 stats->name = "hash";
243 stats->wildcards = 0; /* No wildcards are supported. */
244 stats->n_flows = th->n_flows;
245 stats->max_flows = th->bucket_mask + 1;
246 stats->n_lookup = swt->n_lookup;
247 stats->n_matched = swt->n_matched;
250 struct sw_table *table_hash_create(unsigned int polynomial,
251 unsigned int n_buckets)
253 struct sw_table_hash *th;
254 struct sw_table *swt;
256 th = malloc(sizeof *th);
259 memset(th, '\0', sizeof *th);
261 assert(!(n_buckets & (n_buckets - 1)));
262 th->buckets = calloc(n_buckets, sizeof *th->buckets);
263 if (th->buckets == NULL) {
264 printf("failed to allocate %u buckets\n", n_buckets);
269 th->bucket_mask = n_buckets - 1;
272 swt->lookup = table_hash_lookup;
273 swt->insert = table_hash_insert;
274 swt->modify = table_hash_modify;
275 swt->delete = table_hash_delete;
276 swt->timeout = table_hash_timeout;
277 swt->destroy = table_hash_destroy;
278 swt->iterate = table_hash_iterate;
279 swt->stats = table_hash_stats;
281 crc32_init(&th->crc32, polynomial);
286 /* Double-hashing table. */
288 struct sw_table_hash2 {
290 struct sw_table *subtable[2];
293 static struct sw_flow *table_hash2_lookup(struct sw_table *swt,
294 const struct sw_flow_key *key)
296 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
299 for (i = 0; i < 2; i++) {
300 struct sw_flow *flow = *find_bucket(t2->subtable[i], key);
301 if (flow && !flow_compare(&flow->key.flow, &key->flow))
307 static int table_hash2_insert(struct sw_table *swt, struct sw_flow *flow)
309 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
311 if (table_hash_insert(t2->subtable[0], flow))
313 return table_hash_insert(t2->subtable[1], flow);
316 static int table_hash2_modify(struct sw_table *swt,
317 const struct sw_flow_key *key, uint16_t priority, int strict,
318 const struct ofp_action_header *actions, size_t actions_len)
320 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
321 return (table_hash_modify(t2->subtable[0], key, priority, strict,
322 actions, actions_len)
323 + table_hash_modify(t2->subtable[1], key, priority, strict,
324 actions, actions_len));
327 static int table_hash2_delete(struct datapath *dp, struct sw_table *swt,
328 const struct sw_flow_key *key,
330 uint16_t priority, int strict)
332 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
333 return (table_hash_delete(dp, t2->subtable[0], key, out_port,
335 + table_hash_delete(dp, t2->subtable[1], key, out_port,
339 static void table_hash2_timeout(struct sw_table *swt, struct list *deleted)
341 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
342 table_hash_timeout(t2->subtable[0], deleted);
343 table_hash_timeout(t2->subtable[1], deleted);
346 static void table_hash2_destroy(struct sw_table *swt)
348 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
349 table_hash_destroy(t2->subtable[0]);
350 table_hash_destroy(t2->subtable[1]);
354 static int table_hash2_iterate(struct sw_table *swt,
355 const struct sw_flow_key *key,
357 struct sw_table_position *position,
358 int (*callback)(struct sw_flow *, void *),
361 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
364 for (i = position->private[1]; i < 2; i++) {
365 int error = table_hash_iterate(t2->subtable[i], key, out_port,
366 position, callback, private);
370 position->private[0] = 0;
371 position->private[1]++;
376 static void table_hash2_stats(struct sw_table *swt,
377 struct sw_table_stats *stats)
379 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
380 struct sw_table_stats substats[2];
383 for (i = 0; i < 2; i++)
384 table_hash_stats(t2->subtable[i], &substats[i]);
385 stats->name = "hash2";
386 stats->wildcards = 0; /* No wildcards are supported. */
387 stats->n_flows = substats[0].n_flows + substats[1].n_flows;
388 stats->max_flows = substats[0].max_flows + substats[1].max_flows;
389 stats->n_lookup = swt->n_lookup;
390 stats->n_matched = swt->n_matched;
393 struct sw_table *table_hash2_create(unsigned int poly0, unsigned int buckets0,
394 unsigned int poly1, unsigned int buckets1)
397 struct sw_table_hash2 *t2;
398 struct sw_table *swt;
400 t2 = malloc(sizeof *t2);
403 memset(t2, '\0', sizeof *t2);
405 t2->subtable[0] = table_hash_create(poly0, buckets0);
406 if (t2->subtable[0] == NULL)
409 t2->subtable[1] = table_hash_create(poly1, buckets1);
410 if (t2->subtable[1] == NULL)
411 goto out_free_subtable0;
414 swt->lookup = table_hash2_lookup;
415 swt->insert = table_hash2_insert;
416 swt->modify = table_hash2_modify;
417 swt->delete = table_hash2_delete;
418 swt->timeout = table_hash2_timeout;
419 swt->destroy = table_hash2_destroy;
420 swt->iterate = table_hash2_iterate;
421 swt->stats = table_hash2_stats;
426 table_hash_destroy(t2->subtable[0]);