2 * Copyright (c) 2007-2013 Nicira, Inc.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of version 2 of the GNU General Public
6 * License as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public License
14 * along with this program; if not, write to the Free Software
15 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
21 #include <linux/uaccess.h>
22 #include <linux/netdevice.h>
23 #include <linux/etherdevice.h>
24 #include <linux/if_ether.h>
25 #include <linux/if_vlan.h>
26 #include <net/llc_pdu.h>
27 #include <linux/kernel.h>
28 #include <linux/jhash.h>
29 #include <linux/jiffies.h>
30 #include <linux/llc.h>
31 #include <linux/module.h>
33 #include <linux/rcupdate.h>
34 #include <linux/if_arp.h>
36 #include <linux/ipv6.h>
37 #include <linux/sctp.h>
38 #include <linux/tcp.h>
39 #include <linux/udp.h>
40 #include <linux/icmp.h>
41 #include <linux/icmpv6.h>
42 #include <linux/rculist.h>
45 #include <net/ndisc.h>
49 #define TBL_MIN_BUCKETS 1024
50 #define MASK_ARRAY_SIZE_MIN 16
51 #define REHASH_INTERVAL (10 * 60 * HZ)
53 #define MC_HASH_SHIFT 8
54 #define MC_HASH_ENTRIES (1u << MC_HASH_SHIFT)
55 #define MC_HASH_SEGS ((sizeof(uint32_t) * 8) / MC_HASH_SHIFT)
57 static struct kmem_cache *flow_cache;
58 struct kmem_cache *flow_stats_cache __read_mostly;
60 static u16 range_n_bytes(const struct sw_flow_key_range *range)
62 return range->end - range->start;
65 void ovs_flow_mask_key(struct sw_flow_key *dst, const struct sw_flow_key *src,
66 const struct sw_flow_mask *mask)
68 const long *m = (const long *)((const u8 *)&mask->key +
70 const long *s = (const long *)((const u8 *)src +
72 long *d = (long *)((u8 *)dst + mask->range.start);
75 /* The memory outside of the 'mask->range' are not set since
76 * further operations on 'dst' only uses contents within
79 for (i = 0; i < range_n_bytes(&mask->range); i += sizeof(long))
83 struct sw_flow *ovs_flow_alloc(void)
86 struct flow_stats *stats;
89 flow = kmem_cache_alloc(flow_cache, GFP_KERNEL);
91 return ERR_PTR(-ENOMEM);
95 flow->id.ufid_len = 0;
96 flow->id.unmasked_key = NULL;
97 flow->stats_last_writer = NUMA_NO_NODE;
99 /* Initialize the default stat node. */
100 stats = kmem_cache_alloc_node(flow_stats_cache,
101 GFP_KERNEL | __GFP_ZERO, 0);
105 spin_lock_init(&stats->lock);
107 RCU_INIT_POINTER(flow->stats[0], stats);
111 RCU_INIT_POINTER(flow->stats[node], NULL);
115 kmem_cache_free(flow_cache, flow);
116 return ERR_PTR(-ENOMEM);
119 int ovs_flow_tbl_count(const struct flow_table *table)
124 static struct flex_array *alloc_buckets(unsigned int n_buckets)
126 struct flex_array *buckets;
129 buckets = flex_array_alloc(sizeof(struct hlist_head),
130 n_buckets, GFP_KERNEL);
134 err = flex_array_prealloc(buckets, 0, n_buckets, GFP_KERNEL);
136 flex_array_free(buckets);
140 for (i = 0; i < n_buckets; i++)
141 INIT_HLIST_HEAD((struct hlist_head *)
142 flex_array_get(buckets, i));
147 static void flow_free(struct sw_flow *flow)
151 if (ovs_identifier_is_key(&flow->id))
152 kfree(flow->id.unmasked_key);
153 kfree(rcu_dereference_raw(flow->sf_acts));
155 if (flow->stats[node])
156 kmem_cache_free(flow_stats_cache,
157 rcu_dereference_raw(flow->stats[node]));
158 kmem_cache_free(flow_cache, flow);
161 static void rcu_free_flow_callback(struct rcu_head *rcu)
163 struct sw_flow *flow = container_of(rcu, struct sw_flow, rcu);
168 static void rcu_free_sw_flow_mask_cb(struct rcu_head *rcu)
170 struct sw_flow_mask *mask = container_of(rcu, struct sw_flow_mask, rcu);
175 void ovs_flow_free(struct sw_flow *flow, bool deferred)
181 call_rcu(&flow->rcu, rcu_free_flow_callback);
186 static void free_buckets(struct flex_array *buckets)
188 flex_array_free(buckets);
192 static void __table_instance_destroy(struct table_instance *ti)
194 free_buckets(ti->buckets);
198 static struct table_instance *table_instance_alloc(int new_size)
200 struct table_instance *ti = kmalloc(sizeof(*ti), GFP_KERNEL);
205 ti->buckets = alloc_buckets(new_size);
211 ti->n_buckets = new_size;
213 ti->keep_flows = false;
214 get_random_bytes(&ti->hash_seed, sizeof(u32));
219 static void mask_array_rcu_cb(struct rcu_head *rcu)
221 struct mask_array *ma = container_of(rcu, struct mask_array, rcu);
226 static struct mask_array *tbl_mask_array_alloc(int size)
228 struct mask_array *new;
230 size = max(MASK_ARRAY_SIZE_MIN, size);
231 new = kzalloc(sizeof(struct mask_array) +
232 sizeof(struct sw_flow_mask *) * size, GFP_KERNEL);
242 static int tbl_mask_array_realloc(struct flow_table *tbl, int size)
244 struct mask_array *old;
245 struct mask_array *new;
247 new = tbl_mask_array_alloc(size);
251 old = ovsl_dereference(tbl->mask_array);
255 for (i = 0; i < old->max; i++) {
256 if (ovsl_dereference(old->masks[i]))
257 new->masks[count++] = old->masks[i];
262 rcu_assign_pointer(tbl->mask_array, new);
265 call_rcu(&old->rcu, mask_array_rcu_cb);
270 int ovs_flow_tbl_init(struct flow_table *table)
272 struct table_instance *ti, *ufid_ti;
273 struct mask_array *ma;
275 table->mask_cache = __alloc_percpu(sizeof(struct mask_cache_entry) *
276 MC_HASH_ENTRIES, __alignof__(struct mask_cache_entry));
277 if (!table->mask_cache)
280 ma = tbl_mask_array_alloc(MASK_ARRAY_SIZE_MIN);
282 goto free_mask_cache;
284 ti = table_instance_alloc(TBL_MIN_BUCKETS);
286 goto free_mask_array;
288 ufid_ti = table_instance_alloc(TBL_MIN_BUCKETS);
292 rcu_assign_pointer(table->ti, ti);
293 rcu_assign_pointer(table->ufid_ti, ufid_ti);
294 rcu_assign_pointer(table->mask_array, ma);
295 table->last_rehash = jiffies;
297 table->ufid_count = 0;
301 __table_instance_destroy(ti);
305 free_percpu(table->mask_cache);
309 static void flow_tbl_destroy_rcu_cb(struct rcu_head *rcu)
311 struct table_instance *ti = container_of(rcu, struct table_instance, rcu);
313 __table_instance_destroy(ti);
316 static void table_instance_destroy(struct table_instance *ti,
317 struct table_instance *ufid_ti,
329 for (i = 0; i < ti->n_buckets; i++) {
330 struct sw_flow *flow;
331 struct hlist_head *head = flex_array_get(ti->buckets, i);
332 struct hlist_node *n;
333 int ver = ti->node_ver;
334 int ufid_ver = ufid_ti->node_ver;
336 hlist_for_each_entry_safe(flow, n, head, flow_table.node[ver]) {
337 hlist_del_rcu(&flow->flow_table.node[ver]);
338 if (ovs_identifier_is_ufid(&flow->id))
339 hlist_del_rcu(&flow->ufid_table.node[ufid_ver]);
340 ovs_flow_free(flow, deferred);
346 call_rcu(&ti->rcu, flow_tbl_destroy_rcu_cb);
347 call_rcu(&ufid_ti->rcu, flow_tbl_destroy_rcu_cb);
349 __table_instance_destroy(ti);
350 __table_instance_destroy(ufid_ti);
354 /* No need for locking this function is called from RCU callback or
357 void ovs_flow_tbl_destroy(struct flow_table *table)
359 struct table_instance *ti = rcu_dereference_raw(table->ti);
360 struct table_instance *ufid_ti = rcu_dereference_raw(table->ufid_ti);
362 free_percpu(table->mask_cache);
363 kfree(rcu_dereference_raw(table->mask_array));
364 table_instance_destroy(ti, ufid_ti, false);
367 struct sw_flow *ovs_flow_tbl_dump_next(struct table_instance *ti,
368 u32 *bucket, u32 *last)
370 struct sw_flow *flow;
371 struct hlist_head *head;
376 while (*bucket < ti->n_buckets) {
378 head = flex_array_get(ti->buckets, *bucket);
379 hlist_for_each_entry_rcu(flow, head, flow_table.node[ver]) {
394 static struct hlist_head *find_bucket(struct table_instance *ti, u32 hash)
396 hash = jhash_1word(hash, ti->hash_seed);
397 return flex_array_get(ti->buckets,
398 (hash & (ti->n_buckets - 1)));
401 static void table_instance_insert(struct table_instance *ti,
402 struct sw_flow *flow)
404 struct hlist_head *head;
406 head = find_bucket(ti, flow->flow_table.hash);
407 hlist_add_head_rcu(&flow->flow_table.node[ti->node_ver], head);
410 static void ufid_table_instance_insert(struct table_instance *ti,
411 struct sw_flow *flow)
413 struct hlist_head *head;
415 head = find_bucket(ti, flow->ufid_table.hash);
416 hlist_add_head_rcu(&flow->ufid_table.node[ti->node_ver], head);
419 static void flow_table_copy_flows(struct table_instance *old,
420 struct table_instance *new, bool ufid)
425 old_ver = old->node_ver;
426 new->node_ver = !old_ver;
428 /* Insert in new table. */
429 for (i = 0; i < old->n_buckets; i++) {
430 struct sw_flow *flow;
431 struct hlist_head *head;
433 head = flex_array_get(old->buckets, i);
436 hlist_for_each_entry(flow, head,
437 ufid_table.node[old_ver])
438 ufid_table_instance_insert(new, flow);
440 hlist_for_each_entry(flow, head,
441 flow_table.node[old_ver])
442 table_instance_insert(new, flow);
445 old->keep_flows = true;
448 static struct table_instance *table_instance_rehash(struct table_instance *ti,
449 int n_buckets, bool ufid)
451 struct table_instance *new_ti;
453 new_ti = table_instance_alloc(n_buckets);
457 flow_table_copy_flows(ti, new_ti, ufid);
462 int ovs_flow_tbl_flush(struct flow_table *flow_table)
464 struct table_instance *old_ti, *new_ti;
465 struct table_instance *old_ufid_ti, *new_ufid_ti;
467 new_ti = table_instance_alloc(TBL_MIN_BUCKETS);
470 new_ufid_ti = table_instance_alloc(TBL_MIN_BUCKETS);
474 old_ti = ovsl_dereference(flow_table->ti);
475 old_ufid_ti = ovsl_dereference(flow_table->ufid_ti);
477 rcu_assign_pointer(flow_table->ti, new_ti);
478 rcu_assign_pointer(flow_table->ufid_ti, new_ufid_ti);
479 flow_table->last_rehash = jiffies;
480 flow_table->count = 0;
481 flow_table->ufid_count = 0;
483 table_instance_destroy(old_ti, old_ufid_ti, true);
487 __table_instance_destroy(new_ti);
491 static u32 flow_hash(const struct sw_flow_key *key,
492 const struct sw_flow_key_range *range)
494 int key_start = range->start;
495 int key_end = range->end;
496 const u32 *hash_key = (const u32 *)((const u8 *)key + key_start);
497 int hash_u32s = (key_end - key_start) >> 2;
499 /* Make sure number of hash bytes are multiple of u32. */
500 BUILD_BUG_ON(sizeof(long) % sizeof(u32));
502 return jhash2(hash_key, hash_u32s, 0);
505 static int flow_key_start(const struct sw_flow_key *key)
507 if (key->tun_key.ipv4_dst)
510 return rounddown(offsetof(struct sw_flow_key, phy),
514 static bool cmp_key(const struct sw_flow_key *key1,
515 const struct sw_flow_key *key2,
516 int key_start, int key_end)
518 const long *cp1 = (const long *)((const u8 *)key1 + key_start);
519 const long *cp2 = (const long *)((const u8 *)key2 + key_start);
523 for (i = key_start; i < key_end; i += sizeof(long))
524 diffs |= *cp1++ ^ *cp2++;
529 static bool flow_cmp_masked_key(const struct sw_flow *flow,
530 const struct sw_flow_key *key,
531 const struct sw_flow_key_range *range)
533 return cmp_key(&flow->key, key, range->start, range->end);
536 bool ovs_flow_cmp_unmasked_key(const struct sw_flow *flow,
537 const struct sw_flow_match *match)
539 struct sw_flow_key *key = match->key;
540 int key_start = flow_key_start(key);
541 int key_end = match->range.end;
543 BUG_ON(ovs_identifier_is_ufid(&flow->id));
544 return cmp_key(flow->id.unmasked_key, key, key_start, key_end);
547 static struct sw_flow *masked_flow_lookup(struct table_instance *ti,
548 const struct sw_flow_key *unmasked,
549 const struct sw_flow_mask *mask,
552 struct sw_flow *flow;
553 struct hlist_head *head;
555 struct sw_flow_key masked_key;
557 ovs_flow_mask_key(&masked_key, unmasked, mask);
558 hash = flow_hash(&masked_key, &mask->range);
559 head = find_bucket(ti, hash);
561 hlist_for_each_entry_rcu(flow, head, flow_table.node[ti->node_ver]) {
562 if (flow->mask == mask && flow->flow_table.hash == hash &&
563 flow_cmp_masked_key(flow, &masked_key, &mask->range))
569 /* Flow lookup does full lookup on flow table. It starts with
570 * mask from index passed in *index.
572 static struct sw_flow *flow_lookup(struct flow_table *tbl,
573 struct table_instance *ti,
574 const struct mask_array *ma,
575 const struct sw_flow_key *key,
579 struct sw_flow_mask *mask;
580 struct sw_flow *flow;
583 if (*index < ma->max) {
584 mask = rcu_dereference_ovsl(ma->masks[*index]);
586 flow = masked_flow_lookup(ti, key, mask, n_mask_hit);
592 for (i = 0; i < ma->max; i++) {
597 mask = rcu_dereference_ovsl(ma->masks[i]);
601 flow = masked_flow_lookup(ti, key, mask, n_mask_hit);
602 if (flow) { /* Found */
612 * mask_cache maps flow to probable mask. This cache is not tightly
613 * coupled cache, It means updates to mask list can result in inconsistent
614 * cache entry in mask cache.
615 * This is per cpu cache and is divided in MC_HASH_SEGS segments.
616 * In case of a hash collision the entry is hashed in next segment.
618 struct sw_flow *ovs_flow_tbl_lookup_stats(struct flow_table *tbl,
619 const struct sw_flow_key *key,
623 struct mask_array *ma = rcu_dereference(tbl->mask_array);
624 struct table_instance *ti = rcu_dereference(tbl->ti);
625 struct mask_cache_entry *entries, *ce;
626 struct sw_flow *flow;
631 if (unlikely(!skb_hash)) {
634 return flow_lookup(tbl, ti, ma, key, n_mask_hit, &mask_index);
637 /* Pre and post recirulation flows usually have the same skb_hash
638 * value. To avoid hash collisions, rehash the 'skb_hash' with
641 skb_hash = jhash_1word(skb_hash, key->recirc_id);
645 entries = this_cpu_ptr(tbl->mask_cache);
647 /* Find the cache entry 'ce' to operate on. */
648 for (seg = 0; seg < MC_HASH_SEGS; seg++) {
649 int index = hash & (MC_HASH_ENTRIES - 1);
650 struct mask_cache_entry *e;
653 if (e->skb_hash == skb_hash) {
654 flow = flow_lookup(tbl, ti, ma, key, n_mask_hit,
661 if (!ce || e->skb_hash < ce->skb_hash)
662 ce = e; /* A better replacement cache candidate. */
664 hash >>= MC_HASH_SHIFT;
667 /* Cache miss, do full lookup. */
668 flow = flow_lookup(tbl, ti, ma, key, n_mask_hit, &ce->mask_index);
670 ce->skb_hash = skb_hash;
675 struct sw_flow *ovs_flow_tbl_lookup(struct flow_table *tbl,
676 const struct sw_flow_key *key)
678 struct table_instance *ti = rcu_dereference_ovsl(tbl->ti);
679 struct mask_array *ma = rcu_dereference_ovsl(tbl->mask_array);
680 u32 __always_unused n_mask_hit;
683 return flow_lookup(tbl, ti, ma, key, &n_mask_hit, &index);
686 struct sw_flow *ovs_flow_tbl_lookup_exact(struct flow_table *tbl,
687 const struct sw_flow_match *match)
689 struct mask_array *ma = ovsl_dereference(tbl->mask_array);
692 /* Always called under ovs-mutex. */
693 for (i = 0; i < ma->max; i++) {
694 struct table_instance *ti = ovsl_dereference(tbl->ti);
695 u32 __always_unused n_mask_hit;
696 struct sw_flow_mask *mask;
697 struct sw_flow *flow;
699 mask = ovsl_dereference(ma->masks[i]);
702 flow = masked_flow_lookup(ti, match->key, mask, &n_mask_hit);
703 if (flow && ovs_identifier_is_key(&flow->id) &&
704 ovs_flow_cmp_unmasked_key(flow, match))
710 static u32 ufid_hash(const struct sw_flow_id *sfid)
712 return jhash(sfid->ufid, sfid->ufid_len, 0);
715 static bool ovs_flow_cmp_ufid(const struct sw_flow *flow,
716 const struct sw_flow_id *sfid)
718 if (flow->id.ufid_len != sfid->ufid_len)
721 return !memcmp(flow->id.ufid, sfid->ufid, sfid->ufid_len);
724 bool ovs_flow_cmp(const struct sw_flow *flow, const struct sw_flow_match *match)
726 if (ovs_identifier_is_ufid(&flow->id))
727 return flow_cmp_masked_key(flow, match->key, &match->range);
729 return ovs_flow_cmp_unmasked_key(flow, match);
732 struct sw_flow *ovs_flow_tbl_lookup_ufid(struct flow_table *tbl,
733 const struct sw_flow_id *ufid)
735 struct table_instance *ti = rcu_dereference_ovsl(tbl->ufid_ti);
736 struct sw_flow *flow;
737 struct hlist_head *head;
740 hash = ufid_hash(ufid);
741 head = find_bucket(ti, hash);
742 hlist_for_each_entry_rcu(flow, head, ufid_table.node[ti->node_ver]) {
743 if (flow->ufid_table.hash == hash &&
744 ovs_flow_cmp_ufid(flow, ufid))
750 int ovs_flow_tbl_num_masks(const struct flow_table *table)
752 struct mask_array *ma;
754 ma = rcu_dereference_ovsl(table->mask_array);
758 static struct table_instance *table_instance_expand(struct table_instance *ti,
761 return table_instance_rehash(ti, ti->n_buckets * 2, ufid);
764 static void tbl_mask_array_delete_mask(struct mask_array *ma,
765 struct sw_flow_mask *mask)
769 /* Remove the deleted mask pointers from the array */
770 for (i = 0; i < ma->max; i++) {
771 if (mask == ovsl_dereference(ma->masks[i])) {
772 RCU_INIT_POINTER(ma->masks[i], NULL);
774 call_rcu(&mask->rcu, rcu_free_sw_flow_mask_cb);
781 /* Remove 'mask' from the mask list, if it is not needed any more. */
782 static void flow_mask_remove(struct flow_table *tbl, struct sw_flow_mask *mask)
785 /* ovs-lock is required to protect mask-refcount and
789 BUG_ON(!mask->ref_count);
792 if (!mask->ref_count) {
793 struct mask_array *ma;
795 ma = ovsl_dereference(tbl->mask_array);
796 tbl_mask_array_delete_mask(ma, mask);
798 /* Shrink the mask array if necessary. */
799 if (ma->max >= (MASK_ARRAY_SIZE_MIN * 2) &&
800 ma->count <= (ma->max / 3))
801 tbl_mask_array_realloc(tbl, ma->max / 2);
807 /* Must be called with OVS mutex held. */
808 void ovs_flow_tbl_remove(struct flow_table *table, struct sw_flow *flow)
810 struct table_instance *ti = ovsl_dereference(table->ti);
811 struct table_instance *ufid_ti = ovsl_dereference(table->ufid_ti);
813 BUG_ON(table->count == 0);
814 hlist_del_rcu(&flow->flow_table.node[ti->node_ver]);
816 if (ovs_identifier_is_ufid(&flow->id)) {
817 hlist_del_rcu(&flow->ufid_table.node[ufid_ti->node_ver]);
821 /* RCU delete the mask. 'flow->mask' is not NULLed, as it should be
822 * accessible as long as the RCU read lock is held.
824 flow_mask_remove(table, flow->mask);
827 static struct sw_flow_mask *mask_alloc(void)
829 struct sw_flow_mask *mask;
831 mask = kmalloc(sizeof(*mask), GFP_KERNEL);
838 static bool mask_equal(const struct sw_flow_mask *a,
839 const struct sw_flow_mask *b)
841 const u8 *a_ = (const u8 *)&a->key + a->range.start;
842 const u8 *b_ = (const u8 *)&b->key + b->range.start;
844 return (a->range.end == b->range.end)
845 && (a->range.start == b->range.start)
846 && (memcmp(a_, b_, range_n_bytes(&a->range)) == 0);
849 static struct sw_flow_mask *flow_mask_find(const struct flow_table *tbl,
850 const struct sw_flow_mask *mask)
852 struct mask_array *ma;
855 ma = ovsl_dereference(tbl->mask_array);
856 for (i = 0; i < ma->max; i++) {
857 struct sw_flow_mask *t;
859 t = ovsl_dereference(ma->masks[i]);
860 if (t && mask_equal(mask, t))
867 /* Add 'mask' into the mask list, if it is not already there. */
868 static int flow_mask_insert(struct flow_table *tbl, struct sw_flow *flow,
869 const struct sw_flow_mask *new)
871 struct sw_flow_mask *mask;
873 mask = flow_mask_find(tbl, new);
875 struct mask_array *ma;
878 /* Allocate a new mask if none exsits. */
883 mask->key = new->key;
884 mask->range = new->range;
886 /* Add mask to mask-list. */
887 ma = ovsl_dereference(tbl->mask_array);
888 if (ma->count >= ma->max) {
891 err = tbl_mask_array_realloc(tbl, ma->max +
892 MASK_ARRAY_SIZE_MIN);
897 ma = ovsl_dereference(tbl->mask_array);
900 for (i = 0; i < ma->max; i++) {
901 struct sw_flow_mask *t;
903 t = ovsl_dereference(ma->masks[i]);
905 rcu_assign_pointer(ma->masks[i], mask);
912 BUG_ON(!mask->ref_count);
920 /* Must be called with OVS mutex held. */
921 static void flow_key_insert(struct flow_table *table, struct sw_flow *flow)
923 struct table_instance *new_ti = NULL;
924 struct table_instance *ti;
926 flow->flow_table.hash = flow_hash(&flow->key, &flow->mask->range);
927 ti = ovsl_dereference(table->ti);
928 table_instance_insert(ti, flow);
931 /* Expand table, if necessary, to make room. */
932 if (table->count > ti->n_buckets)
933 new_ti = table_instance_expand(ti, false);
934 else if (time_after(jiffies, table->last_rehash + REHASH_INTERVAL))
935 new_ti = table_instance_rehash(ti, ti->n_buckets, false);
938 rcu_assign_pointer(table->ti, new_ti);
939 call_rcu(&ti->rcu, flow_tbl_destroy_rcu_cb);
940 table->last_rehash = jiffies;
944 /* Must be called with OVS mutex held. */
945 static void flow_ufid_insert(struct flow_table *table, struct sw_flow *flow)
947 struct table_instance *ti;
949 flow->ufid_table.hash = ufid_hash(&flow->id);
950 ti = ovsl_dereference(table->ufid_ti);
951 ufid_table_instance_insert(ti, flow);
954 /* Expand table, if necessary, to make room. */
955 if (table->ufid_count > ti->n_buckets) {
956 struct table_instance *new_ti;
958 new_ti = table_instance_expand(ti, true);
960 rcu_assign_pointer(table->ufid_ti, new_ti);
961 call_rcu(&ti->rcu, flow_tbl_destroy_rcu_cb);
966 /* Must be called with OVS mutex held. */
967 int ovs_flow_tbl_insert(struct flow_table *table, struct sw_flow *flow,
968 const struct sw_flow_mask *mask)
972 err = flow_mask_insert(table, flow, mask);
975 flow_key_insert(table, flow);
976 if (ovs_identifier_is_ufid(&flow->id))
977 flow_ufid_insert(table, flow);
982 /* Initializes the flow module.
983 * Returns zero if successful or a negative error code.
985 int ovs_flow_init(void)
987 BUILD_BUG_ON(__alignof__(struct sw_flow_key) % __alignof__(long));
988 BUILD_BUG_ON(sizeof(struct sw_flow_key) % sizeof(long));
990 flow_cache = kmem_cache_create("sw_flow", sizeof(struct sw_flow)
991 + (num_possible_nodes()
992 * sizeof(struct flow_stats *)),
994 if (flow_cache == NULL)
998 = kmem_cache_create("sw_flow_stats", sizeof(struct flow_stats),
999 0, SLAB_HWCACHE_ALIGN, NULL);
1000 if (flow_stats_cache == NULL) {
1001 kmem_cache_destroy(flow_cache);
1009 /* Uninitializes the flow module. */
1010 void ovs_flow_exit(void)
1012 kmem_cache_destroy(flow_stats_cache);
1013 kmem_cache_destroy(flow_cache);