]>
Commit | Line | Data |
---|---|---|
9888c340 | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
da5c8135 AJ |
2 | /* |
3 | * Copyright (C) 2011 STRATO AG | |
4 | * written by Arne Jansen <[email protected]> | |
da5c8135 AJ |
5 | */ |
6 | ||
9888c340 DS |
7 | #ifndef BTRFS_ULIST_H |
8 | #define BTRFS_ULIST_H | |
da5c8135 | 9 | |
f7f82b81 WS |
10 | #include <linux/list.h> |
11 | #include <linux/rbtree.h> | |
12 | ||
da5c8135 AJ |
13 | /* |
14 | * ulist is a generic data structure to hold a collection of unique u64 | |
15 | * values. The only operations it supports is adding to the list and | |
16 | * enumerating it. | |
17 | * It is possible to store an auxiliary value along with the key. | |
18 | * | |
da5c8135 | 19 | */ |
cd1b413c | 20 | struct ulist_iterator { |
4c7a6f74 | 21 | struct list_head *cur_list; /* hint to start search */ |
cd1b413c JS |
22 | }; |
23 | ||
da5c8135 AJ |
24 | /* |
25 | * element of the list | |
26 | */ | |
27 | struct ulist_node { | |
28 | u64 val; /* value to store */ | |
34d73f54 | 29 | u64 aux; /* auxiliary value saved along with the val */ |
4c7a6f74 | 30 | |
4c7a6f74 | 31 | struct list_head list; /* used to link node */ |
f7f82b81 | 32 | struct rb_node rb_node; /* used to speed up search */ |
da5c8135 AJ |
33 | }; |
34 | ||
35 | struct ulist { | |
36 | /* | |
37 | * number of elements stored in list | |
38 | */ | |
39 | unsigned long nnodes; | |
40 | ||
4c7a6f74 | 41 | struct list_head nodes; |
f7f82b81 | 42 | struct rb_root root; |
da5c8135 AJ |
43 | }; |
44 | ||
45 | void ulist_init(struct ulist *ulist); | |
6655bc3d | 46 | void ulist_release(struct ulist *ulist); |
da5c8135 | 47 | void ulist_reinit(struct ulist *ulist); |
2eec6c81 | 48 | struct ulist *ulist_alloc(gfp_t gfp_mask); |
da5c8135 | 49 | void ulist_free(struct ulist *ulist); |
34d73f54 AB |
50 | int ulist_add(struct ulist *ulist, u64 val, u64 aux, gfp_t gfp_mask); |
51 | int ulist_add_merge(struct ulist *ulist, u64 val, u64 aux, | |
52 | u64 *old_aux, gfp_t gfp_mask); | |
d4b80404 | 53 | int ulist_del(struct ulist *ulist, u64 val, u64 aux); |
4eb1f66d TI |
54 | |
55 | /* just like ulist_add_merge() but take a pointer for the aux data */ | |
56 | static inline int ulist_add_merge_ptr(struct ulist *ulist, u64 val, void *aux, | |
57 | void **old_aux, gfp_t gfp_mask) | |
58 | { | |
59 | #if BITS_PER_LONG == 32 | |
60 | u64 old64 = (uintptr_t)*old_aux; | |
61 | int ret = ulist_add_merge(ulist, val, (uintptr_t)aux, &old64, gfp_mask); | |
62 | *old_aux = (void *)((uintptr_t)old64); | |
63 | return ret; | |
64 | #else | |
65 | return ulist_add_merge(ulist, val, (u64)aux, (u64 *)old_aux, gfp_mask); | |
66 | #endif | |
67 | } | |
68 | ||
cd1b413c JS |
69 | struct ulist_node *ulist_next(struct ulist *ulist, |
70 | struct ulist_iterator *uiter); | |
71 | ||
4c7a6f74 | 72 | #define ULIST_ITER_INIT(uiter) ((uiter)->cur_list = NULL) |
da5c8135 AJ |
73 | |
74 | #endif |