4 #include <linux/kernel.h>
5 #include <linux/spinlock.h>
6 #include <linux/list.h>
7 #include <linux/types.h>
8 #include <linux/rcupdate.h>
10 #include <linux/skbuff.h>
11 #include <linux/if_ether.h>
18 /* Identification data for a flow.
19 Network byte order except for the "wildcards" field.
20 In decreasing order by size, so that sw_flow_key structures can
21 be hashed or compared bytewise.
22 It might be useful to reorder members from (expected) greatest to least
23 inter-flow variability, so that failing bytewise comparisons with memcmp
24 terminate as quickly as possible on average. */
26 uint32_t nw_src; /* IP source address. */
27 uint32_t nw_dst; /* IP destination address. */
28 uint16_t in_port; /* Input switch port */
29 uint16_t dl_vlan; /* Input VLAN. */
30 uint16_t dl_type; /* Ethernet frame type. */
31 uint16_t tp_src; /* TCP/UDP source port. */
32 uint16_t tp_dst; /* TCP/UDP destination port. */
33 uint16_t wildcards; /* Wildcard fields (host byte order). */
34 uint8_t dl_src[ETH_ALEN]; /* Ethernet source address. */
35 uint8_t dl_dst[ETH_ALEN]; /* Ethernet destination address. */
36 uint8_t nw_proto; /* IP protocol. */
37 uint8_t pad[3]; /* NB: Pad to make 32-bit aligned */
40 /* We need to manually make sure that the structure is 32-bit aligned,
41 * since we don't want garbage values in compiler-generated pads from
42 * messing up hash matches.
44 static inline void check_key_align(void)
46 BUILD_BUG_ON(sizeof(struct sw_flow_key) != 36);
51 * - Readers must take rcu_read_lock and hold it the entire time that the flow
52 * must continue to exist.
54 * - Writers must hold dp_mutex.
57 struct sw_flow_key key;
59 uint16_t priority; /* Only used on entries with wildcards. */
60 uint16_t idle_timeout; /* Idle time before discarding (seconds). */
61 uint16_t hard_timeout; /* Hard expiration time (seconds) */
62 unsigned long used; /* Last used time (in jiffies). */
64 /* FIXME? Probably most flows have only a single action. */
65 unsigned int n_actions;
66 struct ofp_action *actions;
68 /* For use by table implementation. */
69 struct list_head node;
70 struct list_head iter_node;
74 spinlock_t lock; /* Lock this entry...mostly for stat updates */
75 unsigned long init_time; /* When the flow was created (in jiffies). */
76 uint64_t packet_count; /* Number of packets associated with this entry */
77 uint64_t byte_count; /* Number of bytes associated with this entry */
82 int flow_matches(const struct sw_flow_key *, const struct sw_flow_key *);
83 int flow_del_matches(const struct sw_flow_key *, const struct sw_flow_key *,
85 struct sw_flow *flow_alloc(int n_actions, gfp_t flags);
86 void flow_free(struct sw_flow *);
87 void flow_deferred_free(struct sw_flow *);
88 int flow_extract(struct sk_buff *, uint16_t in_port, struct sw_flow_key *);
89 void flow_extract_match(struct sw_flow_key* to, const struct ofp_match* from);
90 void flow_fill_match(struct ofp_match* to, const struct sw_flow_key* from);
91 int flow_timeout(struct sw_flow *);
93 void print_flow(const struct sw_flow_key *);
95 static inline void flow_used(struct sw_flow *flow, struct sk_buff *skb)
101 spin_lock_irqsave(&flow->lock, flags);
102 flow->packet_count++;
103 flow->byte_count += skb->len;
104 spin_unlock_irqrestore(&flow->lock, flags);
107 extern struct kmem_cache *flow_cache;
110 void flow_exit(void);