summaryrefslogtreecommitdiff
path: root/fs/btrfs/Makefile
diff options
context:
space:
mode:
authorArne Jansen <sensille@gmx.net>2011-09-13 12:29:12 +0200
committerJan Schmidt <list.btrfs@jan-o-sch.net>2011-12-22 16:22:24 +0100
commitda5c81356426c476112f2b59fe64bdb1b37f079d (patch)
tree1df740632805d7883490197aab904acaf0f7081e /fs/btrfs/Makefile
parentf4a8e6563ea5366f563cb741a27fe90c5fa7f0fc (diff)
Btrfs: generic data structure to build unique lists
ulist is a generic data structures to hold a collection of unique u64 values. The only operations it supports is adding to the list and enumerating it. It is possible to store an auxiliary value along with the key. The implementation is preliminary and can probably be sped up significantly. It is used by btrfs_find_all_roots() quota to translate recursions into iterative loops. Signed-off-by: Arne Jansen <sensille@gmx.net> Signed-off-by: Jan Schmidt <list.btrfs@jan-o-sch.net>
Diffstat (limited to 'fs/btrfs/Makefile')
-rw-r--r--fs/btrfs/Makefile2
1 files changed, 1 insertions, 1 deletions
diff --git a/fs/btrfs/Makefile b/fs/btrfs/Makefile
index c0ddfd29c5e5..70798407b9a2 100644
--- a/fs/btrfs/Makefile
+++ b/fs/btrfs/Makefile
@@ -8,6 +8,6 @@ btrfs-y += super.o ctree.o extent-tree.o print-tree.o root-tree.o dir-item.o \
extent_io.o volumes.o async-thread.o ioctl.o locking.o orphan.o \
export.o tree-log.o free-space-cache.o zlib.o lzo.o \
compression.o delayed-ref.o relocation.o delayed-inode.o scrub.o \
- reada.o backref.o
+ reada.o backref.o ulist.o
btrfs-$(CONFIG_BTRFS_FS_POSIX_ACL) += acl.o