summaryrefslogtreecommitdiff
path: root/net/l2tp/l2tp_core.c
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@linux-foundation.org>2014-03-31 15:07:43 -0700
committerLinus Torvalds <torvalds@linux-foundation.org>2014-03-31 15:07:43 -0700
commitcf6fafcf0588093fadf0c8cd69bebe3b5df136c7 (patch)
tree1aefe138b60f9b74ed64a80c2ce4e22a0749a8ca /net/l2tp/l2tp_core.c
parent1ce235faa8fefa4eb7199cad890944c1d2ba1b3e (diff)
parent21ddfd38ee9aac804d22beaceed4c7b903cca234 (diff)
Merge branch 'for-3.15' of git://git.kernel.org/pub/scm/linux/kernel/git/tj/percpu
Pull percpu changes from Tejun Heo: "The percpu allocation is now popular enough for the extremely naive range allocator to cause scalability issues. The existing allocator linearly scanned the allocation map on both alloc and free without making use of hint or anything. Al reimplemented the range allocator so that it can use binary search instead of linear scan during free and alloc path uses simple hinting to avoid scanning in common cases. Combined, the new allocator resolves the scalability issue percpu allocator was showing during container benchmark workload" * 'for-3.15' of git://git.kernel.org/pub/scm/linux/kernel/git/tj/percpu: percpu: renew the max_contig if we merge the head and previous block percpu: allocation size should be even percpu: speed alloc_pcpu_area() up percpu: store offsets instead of lengths in ->map[] perpcu: fold pcpu_split_block() into the only caller
Diffstat (limited to 'net/l2tp/l2tp_core.c')
0 files changed, 0 insertions, 0 deletions