2 * Copyright (c) 2009 Nicira Networks.
3 * Distributed under the terms of the GNU GPL version 2.
5 * Significant portions of this file may be copied from parts of the Linux
6 * kernel, by Linus Torvalds and others.
9 /* Interface exported by openvswitch_mod. */
15 #include <linux/kernel.h>
16 #include <linux/mutex.h>
17 #include <linux/netdevice.h>
18 #include <linux/workqueue.h>
19 #include <linux/skbuff.h>
20 #include <linux/version.h>
24 /* Mask for the priority bits in a vlan header. If we ever merge upstream
25 * then this should go into include/linux/if_vlan.h. */
26 #define VLAN_PCP_MASK 0xe000
28 #define DP_MAX_PORTS 1024
29 #define DP_MAX_GROUPS 16
31 #define DP_L2_BITS (PAGE_SHIFT - ilog2(sizeof(struct dp_bucket*)))
32 #define DP_L2_SIZE (1 << DP_L2_BITS)
35 #define DP_L1_BITS (PAGE_SHIFT - ilog2(sizeof(struct dp_bucket**)))
36 #define DP_L1_SIZE (1 << DP_L1_BITS)
37 #define DP_L1_SHIFT DP_L2_BITS
39 /* For 4 kB pages, this is 1,048,576 on 32-bit or 262,144 on 64-bit. */
40 #define DP_MAX_BUCKETS (DP_L1_SIZE * DP_L2_SIZE)
43 * struct dp_table - flow table
44 * @n_buckets: number of buckets (a power of 2 between %DP_L1_SIZE and
46 * @buckets: pointer to @n_buckets/%DP_L1_SIZE pointers to %DP_L1_SIZE pointers
48 * @hash_seed: random number used for flow hashing, to make the hash
49 * distribution harder to predict
50 * @rcu: RCU callback structure
52 * The @buckets array is logically an array of pointers to buckets. It is
53 * broken into two levels to avoid the need to kmalloc() any object larger than
54 * a single page or to use vmalloc(). @buckets is always nonnull, as is each
55 * @buckets[i], but each @buckets[i][j] is nonnull only if the specified hash
56 * bucket is nonempty (for 0 <= i < @n_buckets/%DP_L1_SIZE, 0 <= j <
60 unsigned int n_buckets;
61 struct dp_bucket ***buckets;
62 unsigned int hash_seed;
67 * struct dp_bucket - single bucket within datapath flow table
68 * @rcu: RCU callback structure
69 * @n_flows: number of flows in @flows[] array
70 * @flows: array of @n_flows pointers to flows
72 * The expected number of flows per bucket is 1, but this allows for an
73 * arbitrary number of collisions.
78 struct sw_flow *flows[];
82 #define DP_MAX_QUEUE_LEN 100
84 struct dp_stats_percpu {
91 struct dp_port_group {
101 struct kobject ifobj;
106 struct sk_buff_head queues[DP_N_QUEUES];
107 wait_queue_head_t waitqueue;
110 unsigned int n_flows;
111 struct dp_table *table;
114 struct dp_port_group *groups[DP_MAX_GROUPS];
117 unsigned int n_ports;
118 struct net_bridge_port *ports[DP_MAX_PORTS];
119 struct list_head port_list; /* All ports, including local_port. */
122 struct dp_stats_percpu *stats_percpu;
125 struct net_bridge_port {
128 struct net_device *dev;
130 char linkname[IFNAMSIZ];
131 struct list_head node; /* Element in datapath.ports. */
134 extern struct notifier_block dp_device_notifier;
135 extern int (*dp_ioctl_hook)(struct net_device *dev, struct ifreq *rq, int cmd);
138 struct dp_table *dp_table_create(unsigned int n_buckets);
139 void dp_table_destroy(struct dp_table *, int free_flows);
140 struct sw_flow *dp_table_lookup(struct dp_table *, const struct odp_flow_key *);
141 int dp_table_insert(struct dp_table *, struct sw_flow *);
142 int dp_table_delete(struct dp_table *, struct sw_flow *);
143 int dp_table_expand(struct datapath *);
144 int dp_table_flush(struct datapath *);
145 int dp_table_foreach(struct dp_table *table,
146 int (*callback)(struct sw_flow *flow, void *aux),
149 void dp_process_received_packet(struct sk_buff *, struct net_bridge_port *);
150 int dp_del_port(struct net_bridge_port *);
151 int dp_output_control(struct datapath *, struct sk_buff *, int, u32 arg);
152 int dp_min_mtu(const struct datapath *dp);
154 struct datapath *get_dp(int dp_idx);
156 static inline const char *dp_name(const struct datapath *dp)
158 return dp->ports[ODPP_LOCAL]->dev->name;
162 int skb_checksum_setup(struct sk_buff *skb);
164 static inline int skb_checksum_setup(struct sk_buff *skb)
170 int vswitch_skb_checksum_setup(struct sk_buff *skb);
172 #endif /* datapath.h */