return table->count;
 }
 
-static struct flex_array *alloc_buckets(unsigned int n_buckets)
-{
-       struct flex_array *buckets;
-       int i, err;
-
-       buckets = flex_array_alloc(sizeof(struct hlist_head),
-                                  n_buckets, GFP_KERNEL);
-       if (!buckets)
-               return NULL;
-
-       err = flex_array_prealloc(buckets, 0, n_buckets, GFP_KERNEL);
-       if (err) {
-               flex_array_free(buckets);
-               return NULL;
-       }
-
-       for (i = 0; i < n_buckets; i++)
-               INIT_HLIST_HEAD((struct hlist_head *)
-                                       flex_array_get(buckets, i));
-
-       return buckets;
-}
-
 static void flow_free(struct sw_flow *flow)
 {
        int cpu;
                flow_free(flow);
 }
 
-static void free_buckets(struct flex_array *buckets)
-{
-       flex_array_free(buckets);
-}
-
-
 static void __table_instance_destroy(struct table_instance *ti)
 {
-       free_buckets(ti->buckets);
+       kvfree(ti->buckets);
        kfree(ti);
 }
 
 static struct table_instance *table_instance_alloc(int new_size)
 {
        struct table_instance *ti = kmalloc(sizeof(*ti), GFP_KERNEL);
+       int i;
 
        if (!ti)
                return NULL;
 
-       ti->buckets = alloc_buckets(new_size);
-
+       ti->buckets = kvmalloc_array(new_size, sizeof(struct hlist_head),
+                                    GFP_KERNEL);
        if (!ti->buckets) {
                kfree(ti);
                return NULL;
        }
+
+       for (i = 0; i < new_size; i++)
+               INIT_HLIST_HEAD(&ti->buckets[i]);
+
        ti->n_buckets = new_size;
        ti->node_ver = 0;
        ti->keep_flows = false;
 
        for (i = 0; i < ti->n_buckets; i++) {
                struct sw_flow *flow;
-               struct hlist_head *head = flex_array_get(ti->buckets, i);
+               struct hlist_head *head = &ti->buckets[i];
                struct hlist_node *n;
                int ver = ti->node_ver;
                int ufid_ver = ufid_ti->node_ver;
        ver = ti->node_ver;
        while (*bucket < ti->n_buckets) {
                i = 0;
-               head = flex_array_get(ti->buckets, *bucket);
+               head = &ti->buckets[*bucket];
                hlist_for_each_entry_rcu(flow, head, flow_table.node[ver]) {
                        if (i < *last) {
                                i++;
 static struct hlist_head *find_bucket(struct table_instance *ti, u32 hash)
 {
        hash = jhash_1word(hash, ti->hash_seed);
-       return flex_array_get(ti->buckets,
-                               (hash & (ti->n_buckets - 1)));
+       return &ti->buckets[hash & (ti->n_buckets - 1)];
 }
 
 static void table_instance_insert(struct table_instance *ti,
        /* Insert in new table. */
        for (i = 0; i < old->n_buckets; i++) {
                struct sw_flow *flow;
-               struct hlist_head *head;
-
-               head = flex_array_get(old->buckets, i);
+               struct hlist_head *head = &old->buckets[i];
 
                if (ufid)
                        hlist_for_each_entry(flow, head,