X-Git-Url: http://git.onelab.eu/?a=blobdiff_plain;f=datapath%2Fdatapath.h;h=d28250a128006f259272285ffa0ebd7bf3f71104;hb=eb395f2ebf46888353e5966dd7969a1c49402334;hp=102b27f31f1af633d65bddd0333356297fe59425;hpb=064af42167bf4fc9aaea2702d80ce08074b889c0;p=sliver-openvswitch.git diff --git a/datapath/datapath.h b/datapath/datapath.h index 102b27f31..d28250a12 100644 --- a/datapath/datapath.h +++ b/datapath/datapath.h @@ -1,3 +1,11 @@ +/* + * Copyright (c) 2009 Nicira Networks. + * Distributed under the terms of the GNU GPL version 2. + * + * Significant portions of this file may be copied from parts of the Linux + * kernel, by Linus Torvalds and others. + */ + /* Interface exported by openvswitch_mod. */ #ifndef DATAPATH_H @@ -6,38 +14,70 @@ #include #include #include -#include #include #include #include +#include #include "flow.h" -#include "brc_sysfs.h" - -struct sk_buff; +#include "dp_sysfs.h" /* Mask for the priority bits in a vlan header. If we ever merge upstream * then this should go into include/linux/if_vlan.h. */ #define VLAN_PCP_MASK 0xe000 -#define DP_MAX_PORTS 256 +#define DP_MAX_PORTS 1024 #define DP_MAX_GROUPS 16 -#define DP_L2_BITS (PAGE_SHIFT - ilog2(sizeof(struct sw_flow*))) +#define DP_L2_BITS (PAGE_SHIFT - ilog2(sizeof(struct dp_bucket*))) #define DP_L2_SIZE (1 << DP_L2_BITS) #define DP_L2_SHIFT 0 -#define DP_L1_BITS (PAGE_SHIFT - ilog2(sizeof(struct sw_flow**))) +#define DP_L1_BITS (PAGE_SHIFT - ilog2(sizeof(struct dp_bucket**))) #define DP_L1_SIZE (1 << DP_L1_BITS) #define DP_L1_SHIFT DP_L2_BITS +/* For 4 kB pages, this is 1,048,576 on 32-bit or 262,144 on 64-bit. */ #define DP_MAX_BUCKETS (DP_L1_SIZE * DP_L2_SIZE) +/** + * struct dp_table - flow table + * @n_buckets: number of buckets (a power of 2 between %DP_L1_SIZE and + * %DP_MAX_BUCKETS) + * @buckets: pointer to @n_buckets/%DP_L1_SIZE pointers to %DP_L1_SIZE pointers + * to buckets + * @hash_seed: random number used for flow hashing, to make the hash + * distribution harder to predict + * @rcu: RCU callback structure + * + * The @buckets array is logically an array of pointers to buckets. It is + * broken into two levels to avoid the need to kmalloc() any object larger than + * a single page or to use vmalloc(). @buckets is always nonnull, as is each + * @buckets[i], but each @buckets[i][j] is nonnull only if the specified hash + * bucket is nonempty (for 0 <= i < @n_buckets/%DP_L1_SIZE, 0 <= j < + * %DP_L1_SIZE). + */ struct dp_table { unsigned int n_buckets; - struct sw_flow ***flows[2]; + struct dp_bucket ***buckets; + unsigned int hash_seed; struct rcu_head rcu; }; +/** + * struct dp_bucket - single bucket within datapath flow table + * @rcu: RCU callback structure + * @n_flows: number of flows in @flows[] array + * @flows: array of @n_flows pointers to flows + * + * The expected number of flows per bucket is 1, but this allows for an + * arbitrary number of collisions. + */ +struct dp_bucket { + struct rcu_head rcu; + unsigned int n_flows; + struct sw_flow *flows[]; +}; + #define DP_N_QUEUES 2 #define DP_MAX_QUEUE_LEN 100 @@ -58,9 +98,7 @@ struct datapath { struct mutex mutex; int dp_idx; -#ifdef SUPPORT_SYSFS struct kobject ifobj; -#endif int drop_frags; @@ -88,24 +126,19 @@ struct net_bridge_port { u16 port_no; struct datapath *dp; struct net_device *dev; -#ifdef SUPPORT_SYSFS struct kobject kobj; -#endif + char linkname[IFNAMSIZ]; struct list_head node; /* Element in datapath.ports. */ }; extern struct notifier_block dp_device_notifier; extern int (*dp_ioctl_hook)(struct net_device *dev, struct ifreq *rq, int cmd); -extern int (*dp_add_dp_hook)(struct datapath *dp); -extern int (*dp_del_dp_hook)(struct datapath *dp); -extern int (*dp_add_if_hook)(struct net_bridge_port *p); -extern int (*dp_del_if_hook)(struct net_bridge_port *p); /* Flow table. */ struct dp_table *dp_table_create(unsigned int n_buckets); void dp_table_destroy(struct dp_table *, int free_flows); struct sw_flow *dp_table_lookup(struct dp_table *, const struct odp_flow_key *); -struct sw_flow **dp_table_lookup_for_insert(struct dp_table *, const struct odp_flow_key *); +int dp_table_insert(struct dp_table *, struct sw_flow *); int dp_table_delete(struct dp_table *, struct sw_flow *); int dp_table_expand(struct datapath *); int dp_table_flush(struct datapath *); @@ -114,11 +147,9 @@ int dp_table_foreach(struct dp_table *table, void *aux); void dp_process_received_packet(struct sk_buff *, struct net_bridge_port *); -int dp_del_port(struct net_bridge_port *, struct list_head *); -int dp_output_port(struct datapath *, struct sk_buff *, int out_port, - int ignore_no_fwd); +int dp_del_port(struct net_bridge_port *); int dp_output_control(struct datapath *, struct sk_buff *, int, u32 arg); -void dp_set_origin(struct datapath *, u16, struct sk_buff *); +int dp_min_mtu(const struct datapath *dp); struct datapath *get_dp(int dp_idx); @@ -136,4 +167,6 @@ static inline int skb_checksum_setup(struct sk_buff *skb) } #endif +int vswitch_skb_checksum_setup(struct sk_buff *skb); + #endif /* datapath.h */