1 /* Copyright (C) 2008 Board of Trustees, Leland Stanford Jr. University.
3 * Permission is hereby granted, free of charge, to any person obtaining a copy
4 * of this software and associated documentation files (the "Software"), to
5 * deal in the Software without restriction, including without limitation the
6 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
7 * sell copies of the Software, and to permit persons to whom the Software is
8 * furnished to do so, subject to the following conditions:
10 * The above copyright notice and this permission notice shall be included in
11 * all copies or substantial portions of the Software.
13 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
14 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
15 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
16 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
17 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
18 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
29 #define TABLE_LINEAR_MAX_FLOWS 100
30 #define TABLE_HASH_MAX_FLOWS 65536
31 #define TABLE_MAC_MAX_FLOWS 1024
32 #define TABLE_MAC_NUM_BUCKETS 1024
34 /* Set of tables chained together in sequence from cheap to expensive. */
35 #define CHAIN_MAX_TABLES 4
38 struct sw_table *tables[CHAIN_MAX_TABLES];
41 struct sw_chain *chain_create(void);
42 struct sw_flow *chain_lookup(struct sw_chain *, const struct sw_flow_key *);
43 int chain_insert(struct sw_chain *, struct sw_flow *);
44 int chain_delete(struct sw_chain *, const struct sw_flow_key *, int);
45 int chain_timeout(struct sw_chain *, struct datapath *);
46 void chain_destroy(struct sw_chain *);
47 void chain_print_stats(struct sw_chain *);