Hide contents of sw_chain.

diff --git a/switch/chain.c b/switch/chain.c
index 05f74b41e45c3d69ba2f24b0be6b5fb50bf80098..ce8fe9d8c6c24505c2e41dfdcd5e76a887352490 100644 (file)
--- a/switch/chain.c
+++ b/switch/chain.c
@@ -41,6 +41,13 @@
 #define THIS_MODULE VLM_chain
 #include "vlog.h"
 
+/* Set of tables chained together in sequence from cheap to expensive. */
+#define CHAIN_MAX_TABLES 4
+struct sw_chain {
+    int n_tables;
+    struct sw_table *tables[CHAIN_MAX_TABLES];
+};
+
 /* Attempts to append 'table' to the set of tables in 'chain'.  Returns 0 or
  * negative error.  If 'table' is null it is assumed that table creation failed
  * due to out-of-memory. */

diff --git a/switch/chain.h b/switch/chain.h
index 5cda0fccdbbcf5a60da1bf83ec596726d7803313..cd3f205bb0983d14ff0e8ab8d282c0efeda8c17e 100644 (file)
--- a/switch/chain.h
+++ b/switch/chain.h
@@ -43,13 +43,6 @@ struct datapath;
 #define TABLE_MAC_MAX_FLOWS      1024
 #define TABLE_MAC_NUM_BUCKETS   1024
 
-/* Set of tables chained together in sequence from cheap to expensive. */
-#define CHAIN_MAX_TABLES 4
-struct sw_chain {
-    int n_tables;
-    struct sw_table *tables[CHAIN_MAX_TABLES];
-};
-
 struct sw_chain *chain_create(void);
 struct sw_flow *chain_lookup(struct sw_chain *, const struct sw_flow_key *);
 int chain_insert(struct sw_chain *, struct sw_flow *);