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.
42 #include "switch-flow.h"
44 struct sw_table_hash {
48 unsigned int bucket_mask; /* Number of buckets minus 1. */
49 struct sw_flow **buckets;
52 static struct sw_flow **find_bucket(struct sw_table *swt,
53 const struct sw_flow_key *key)
55 struct sw_table_hash *th = (struct sw_table_hash *) swt;
56 unsigned int crc = crc32_calculate(&th->crc32, key,
57 offsetof(struct sw_flow_key, wildcards));
58 return &th->buckets[crc & th->bucket_mask];
61 static struct sw_flow *table_hash_lookup(struct sw_table *swt,
62 const struct sw_flow_key *key)
64 struct sw_flow *flow = *find_bucket(swt, key);
65 return flow && !flow_compare(&flow->key.flow, &key->flow) ? flow : NULL;
68 static int table_hash_insert(struct sw_table *swt, struct sw_flow *flow)
70 struct sw_table_hash *th = (struct sw_table_hash *) swt;
71 struct sw_flow **bucket;
74 if (flow->key.wildcards != 0)
77 bucket = find_bucket(swt, &flow->key);
78 if (*bucket == NULL) {
83 struct sw_flow *old_flow = *bucket;
84 if (!flow_compare(&old_flow->key.flow, &flow->key.flow)) {
85 /* Keep stats from the original flow */
86 flow->used = old_flow->used;
87 flow->created = old_flow->created;
88 flow->packet_count = old_flow->packet_count;
89 flow->byte_count = old_flow->byte_count;
101 static int table_hash_modify(struct sw_table *swt,
102 const struct sw_flow_key *key,
103 const struct ofp_action *actions, int n_actions)
105 struct sw_table_hash *th = (struct sw_table_hash *) swt;
106 unsigned int count = 0;
108 if (key->wildcards == 0) {
109 struct sw_flow **bucket = find_bucket(swt, key);
110 struct sw_flow *flow = *bucket;
111 if (flow && flow_matches_1wild(&flow->key, key)) {
112 flow_replace_acts(flow, actions, n_actions);
118 for (i = 0; i <= th->bucket_mask; i++) {
119 struct sw_flow **bucket = &th->buckets[i];
120 struct sw_flow *flow = *bucket;
121 if (flow && flow_matches_1wild(&flow->key, key)) {
122 flow_replace_acts(flow, actions, n_actions);
130 /* Caller must update n_flows. */
132 do_delete(struct sw_flow **bucket)
138 /* Returns number of deleted flows. We can igonre the priority
139 * argument, since all exact-match entries are the same (highest)
141 static int table_hash_delete(struct sw_table *swt,
142 const struct sw_flow_key *key,
143 uint16_t priority, int strict)
145 struct sw_table_hash *th = (struct sw_table_hash *) swt;
146 unsigned int count = 0;
148 if (key->wildcards == 0) {
149 struct sw_flow **bucket = find_bucket(swt, key);
150 struct sw_flow *flow = *bucket;
151 if (flow && !flow_compare(&flow->key.flow, &key->flow)) {
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_del_matches(&flow->key, key, strict)) {
167 th->n_flows -= count;
171 static void table_hash_timeout(struct sw_table *swt, struct list *deleted)
173 struct sw_table_hash *th = (struct sw_table_hash *) swt;
176 for (i = 0; i <= th->bucket_mask; i++) {
177 struct sw_flow **bucket = &th->buckets[i];
178 struct sw_flow *flow = *bucket;
179 if (flow && flow_timeout(flow)) {
180 list_push_back(deleted, &flow->node);
187 static void table_hash_destroy(struct sw_table *swt)
189 struct sw_table_hash *th = (struct sw_table_hash *) swt;
191 for (i = 0; i <= th->bucket_mask; i++) {
192 if (th->buckets[i]) {
193 flow_free(th->buckets[i]);
200 static int table_hash_iterate(struct sw_table *swt,
201 const struct sw_flow_key *key,
202 struct sw_table_position *position,
203 int (*callback)(struct sw_flow *, void *private),
206 struct sw_table_hash *th = (struct sw_table_hash *) swt;
208 if (position->private[0] > th->bucket_mask)
211 if (key->wildcards == 0) {
212 struct sw_flow *flow = table_hash_lookup(swt, key);
213 position->private[0] = -1;
214 return flow ? callback(flow, private) : 0;
218 for (i = position->private[0]; i <= th->bucket_mask; i++) {
219 struct sw_flow *flow = th->buckets[i];
220 if (flow && flow_matches_1wild(&flow->key, key)) {
221 int error = callback(flow, private);
223 position->private[0] = i + 1;
232 static void table_hash_stats(struct sw_table *swt,
233 struct sw_table_stats *stats)
235 struct sw_table_hash *th = (struct sw_table_hash *) swt;
236 stats->name = "hash";
237 stats->wildcards = 0; /* No wildcards are supported. */
238 stats->n_flows = th->n_flows;
239 stats->max_flows = th->bucket_mask + 1;
240 stats->n_matched = swt->n_matched;
243 struct sw_table *table_hash_create(unsigned int polynomial,
244 unsigned int n_buckets)
246 struct sw_table_hash *th;
247 struct sw_table *swt;
249 th = malloc(sizeof *th);
252 memset(th, '\0', sizeof *th);
254 assert(!(n_buckets & (n_buckets - 1)));
255 th->buckets = calloc(n_buckets, sizeof *th->buckets);
256 if (th->buckets == NULL) {
257 printf("failed to allocate %u buckets\n", n_buckets);
262 th->bucket_mask = n_buckets - 1;
265 swt->lookup = table_hash_lookup;
266 swt->insert = table_hash_insert;
267 swt->modify = table_hash_modify;
268 swt->delete = table_hash_delete;
269 swt->timeout = table_hash_timeout;
270 swt->destroy = table_hash_destroy;
271 swt->iterate = table_hash_iterate;
272 swt->stats = table_hash_stats;
274 crc32_init(&th->crc32, polynomial);
279 /* Double-hashing table. */
281 struct sw_table_hash2 {
283 struct sw_table *subtable[2];
286 static struct sw_flow *table_hash2_lookup(struct sw_table *swt,
287 const struct sw_flow_key *key)
289 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
292 for (i = 0; i < 2; i++) {
293 struct sw_flow *flow = *find_bucket(t2->subtable[i], key);
294 if (flow && !flow_compare(&flow->key.flow, &key->flow))
300 static int table_hash2_insert(struct sw_table *swt, struct sw_flow *flow)
302 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
304 if (table_hash_insert(t2->subtable[0], flow))
306 return table_hash_insert(t2->subtable[1], flow);
309 static int table_hash2_modify(struct sw_table *swt,
310 const struct sw_flow_key *key,
311 const struct ofp_action *actions, int n_actions)
313 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
314 return (table_hash_modify(t2->subtable[0], key, actions, n_actions)
315 + table_hash_modify(t2->subtable[1], key, actions, n_actions));
318 static int table_hash2_delete(struct sw_table *swt,
319 const struct sw_flow_key *key,
320 uint16_t priority, int strict)
322 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
323 return (table_hash_delete(t2->subtable[0], key, priority, strict)
324 + table_hash_delete(t2->subtable[1], key, priority, strict));
327 static void table_hash2_timeout(struct sw_table *swt, struct list *deleted)
329 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
330 table_hash_timeout(t2->subtable[0], deleted);
331 table_hash_timeout(t2->subtable[1], deleted);
334 static void table_hash2_destroy(struct sw_table *swt)
336 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
337 table_hash_destroy(t2->subtable[0]);
338 table_hash_destroy(t2->subtable[1]);
342 static int table_hash2_iterate(struct sw_table *swt,
343 const struct sw_flow_key *key,
344 struct sw_table_position *position,
345 int (*callback)(struct sw_flow *, void *),
348 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
351 for (i = position->private[1]; i < 2; i++) {
352 int error = table_hash_iterate(t2->subtable[i], key, position,
357 position->private[0] = 0;
358 position->private[1]++;
363 static void table_hash2_stats(struct sw_table *swt,
364 struct sw_table_stats *stats)
366 struct sw_table_hash2 *t2 = (struct sw_table_hash2 *) swt;
367 struct sw_table_stats substats[2];
370 for (i = 0; i < 2; i++)
371 table_hash_stats(t2->subtable[i], &substats[i]);
372 stats->name = "hash2";
373 stats->wildcards = 0; /* No wildcards are supported. */
374 stats->n_flows = substats[0].n_flows + substats[1].n_flows;
375 stats->max_flows = substats[0].max_flows + substats[1].max_flows;
376 stats->n_matched = swt->n_matched;
379 struct sw_table *table_hash2_create(unsigned int poly0, unsigned int buckets0,
380 unsigned int poly1, unsigned int buckets1)
383 struct sw_table_hash2 *t2;
384 struct sw_table *swt;
386 t2 = malloc(sizeof *t2);
389 memset(t2, '\0', sizeof *t2);
391 t2->subtable[0] = table_hash_create(poly0, buckets0);
392 if (t2->subtable[0] == NULL)
395 t2->subtable[1] = table_hash_create(poly1, buckets1);
396 if (t2->subtable[1] == NULL)
397 goto out_free_subtable0;
400 swt->lookup = table_hash2_lookup;
401 swt->insert = table_hash2_insert;
402 swt->modify = table_hash2_modify;
403 swt->delete = table_hash2_delete;
404 swt->timeout = table_hash2_timeout;
405 swt->destroy = table_hash2_destroy;
406 swt->iterate = table_hash2_iterate;
407 swt->stats = table_hash2_stats;
412 table_hash_destroy(t2->subtable[0]);