summaryrefslogtreecommitdiff
path: root/include/linux/serio.h
diff options
context:
space:
mode:
authorHugh Dickins <hughd@google.com>2011-08-03 23:21:23 (GMT)
committerLinus Torvalds <torvalds@linux-foundation.org>2011-08-04 00:25:23 (GMT)
commit46f65ec15c6878a2b4a49f6e01b20b201b46a9e4 (patch)
tree3b72804ee87b4a5c7ec86b5059e20ddea82d3c2c /include/linux/serio.h
parent7a5d0fbb29936fad7f17b1cb001b0c33a5f13328 (diff)
downloadlinux-fsl-qoriq-46f65ec15c6878a2b4a49f6e01b20b201b46a9e4.tar.xz
tmpfs: convert shmem_unuse_inode to radix-swap
Convert shmem_unuse_inode() to use a lockless gang lookup of the radix tree, searching for matching swap. This is somewhat slower than the old method: because of repeated radix tree descents, because of copying entries up, but probably most because the old method noted and skipped once a vector page was cleared of swap. Perhaps we can devise a use of radix tree tagging to achieve that later. shmem_add_to_page_cache() uses shmem_radix_tree_replace() to compensate for the lockless lookup by checking that the expected entry is in place, under lock. It is not very satisfactory to be copying this much from add_to_page_cache_locked(), but I think easier to sell than insisting that every caller of add_to_page_cache*() go through the extras. Signed-off-by: Hugh Dickins <hughd@google.com> Acked-by: Rik van Riel <riel@redhat.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'include/linux/serio.h')
0 files changed, 0 insertions, 0 deletions