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/netlink.h>
18 #include <linux/netdevice.h>
19 #include <linux/workqueue.h>
20 #include <linux/skbuff.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
27 #define VLAN_PCP_SHIFT 13
29 #define DP_MAX_PORTS 1024
30 #define DP_MAX_GROUPS 16
32 #define DP_L2_BITS (PAGE_SHIFT - ilog2(sizeof(struct dp_bucket*)))
33 #define DP_L2_SIZE (1 << DP_L2_BITS)
36 #define DP_L1_BITS (PAGE_SHIFT - ilog2(sizeof(struct dp_bucket**)))
37 #define DP_L1_SIZE (1 << DP_L1_BITS)
38 #define DP_L1_SHIFT DP_L2_BITS
40 /* For 4 kB pages, this is 1,048,576 on 32-bit or 262,144 on 64-bit. */
41 #define DP_MAX_BUCKETS (DP_L1_SIZE * DP_L2_SIZE)
44 * struct dp_table - flow table
45 * @n_buckets: number of buckets (a power of 2 between %DP_L1_SIZE and
47 * @buckets: pointer to @n_buckets/%DP_L1_SIZE pointers to %DP_L1_SIZE pointers
49 * @hash_seed: random number used for flow hashing, to make the hash
50 * distribution harder to predict
51 * @rcu: RCU callback structure
53 * The @buckets array is logically an array of pointers to buckets. It is
54 * broken into two levels to avoid the need to kmalloc() any object larger than
55 * a single page or to use vmalloc(). @buckets is always nonnull, as is each
56 * @buckets[i], but each @buckets[i][j] is nonnull only if the specified hash
57 * bucket is nonempty (for 0 <= i < @n_buckets/%DP_L1_SIZE, 0 <= j <
61 unsigned int n_buckets;
62 struct dp_bucket ***buckets;
63 unsigned int hash_seed;
68 * struct dp_bucket - single bucket within datapath flow table
69 * @rcu: RCU callback structure
70 * @n_flows: number of flows in @flows[] array
71 * @flows: array of @n_flows pointers to flows
73 * The expected number of flows per bucket is 1, but this allows for an
74 * arbitrary number of collisions.
79 struct sw_flow *flows[];
83 #define DP_MAX_QUEUE_LEN 100
85 struct dp_stats_percpu {
92 struct dp_port_group {
102 struct kobject ifobj;
107 struct sk_buff_head queues[DP_N_QUEUES];
108 wait_queue_head_t waitqueue;
111 unsigned int n_flows;
112 struct dp_table *table;
115 struct dp_port_group *groups[DP_MAX_GROUPS];
118 unsigned int n_ports;
119 struct net_bridge_port *ports[DP_MAX_PORTS];
120 struct list_head port_list; /* All ports, including local_port. */
123 struct dp_stats_percpu *stats_percpu;
126 struct net_bridge_port {
129 struct net_device *dev;
131 char linkname[IFNAMSIZ];
132 struct list_head node; /* Element in datapath.ports. */
135 extern struct notifier_block dp_device_notifier;
136 extern int (*dp_ioctl_hook)(struct net_device *dev, struct ifreq *rq, int cmd);
139 struct dp_table *dp_table_create(unsigned int n_buckets);
140 void dp_table_destroy(struct dp_table *, int free_flows);
141 struct sw_flow *dp_table_lookup(struct dp_table *, const struct odp_flow_key *);
142 int dp_table_insert(struct dp_table *, struct sw_flow *);
143 int dp_table_delete(struct dp_table *, struct sw_flow *);
144 int dp_table_expand(struct datapath *);
145 int dp_table_flush(struct datapath *);
146 int dp_table_foreach(struct dp_table *table,
147 int (*callback)(struct sw_flow *flow, void *aux),
150 void dp_process_received_packet(struct sk_buff *, struct net_bridge_port *);
151 int dp_del_port(struct net_bridge_port *);
152 int dp_output_control(struct datapath *, struct sk_buff *, int, u32 arg);
153 int dp_min_mtu(const struct datapath *dp);
155 struct datapath *get_dp(int dp_idx);
157 static inline const char *dp_name(const struct datapath *dp)
159 return dp->ports[ODPP_LOCAL]->dev->name;
163 int skb_checksum_setup(struct sk_buff *skb);
165 static inline int skb_checksum_setup(struct sk_buff *skb)
171 #endif /* datapath.h */