If suitable block can't be found, new block is allocated and put into a head
of a free list, so on next iteration this new block will be found first.

...

Cc: stable@vger.kernel.org

...

--- a/mm/vmalloc.c
+++ b/mm/vmalloc.c

@@ -837,7 +837,7 @@ static struct vmap_block *new_vmap_block(gfp_t gfp_mask)
 
 	vbq = &get_cpu_var(vmap_block_queue);
 	spin_lock(&vbq->lock);
-	list_add_rcu(&vb->free_list, &vbq->free);
+	list_add_tail_rcu(&vb->free_list, &vbq->free);
 	spin_unlock(&vbq->lock);
 	put_cpu_var(vmap_block_queue);