1/* SPDX-License-Identifier: GPL-2.0 */
 2/*
 3 * Copyright (C) 2011 STRATO AG
 4 * written by Arne Jansen <sensille@gmx.net>
 
 
 5 */
 6
 7#ifndef BTRFS_ULIST_H
 8#define BTRFS_ULIST_H
 9
10#include <linux/list.h>
11#include <linux/rbtree.h>
12
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 *
19 */
20struct ulist_iterator {
 
 
 
21	struct list_head *cur_list;  /* hint to start search */
22};
23
24/*
25 * element of the list
26 */
27struct ulist_node {
28	u64 val;		/* value to store */
29	u64 aux;		/* auxiliary value saved along with the val */
30
 
 
 
 
31	struct list_head list;  /* used to link node */
32	struct rb_node rb_node;	/* used to speed up search */
33};
34
35struct ulist {
36	/*
37	 * number of elements stored in list
38	 */
39	unsigned long nnodes;
40
41	struct list_head nodes;
42	struct rb_root root;
43};
44
45void ulist_init(struct ulist *ulist);
46void ulist_release(struct ulist *ulist);
47void ulist_reinit(struct ulist *ulist);
48struct ulist *ulist_alloc(gfp_t gfp_mask);
49void ulist_free(struct ulist *ulist);
50int ulist_add(struct ulist *ulist, u64 val, u64 aux, gfp_t gfp_mask);
51int ulist_add_merge(struct ulist *ulist, u64 val, u64 aux,
52		    u64 *old_aux, gfp_t gfp_mask);
53int ulist_del(struct ulist *ulist, u64 val, u64 aux);
54
55/* just like ulist_add_merge() but take a pointer for the aux data */
56static 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
69struct ulist_node *ulist_next(const struct ulist *ulist,
70			      struct ulist_iterator *uiter);
71
72#define ULIST_ITER_INIT(uiter) ((uiter)->cur_list = NULL)
73
74#endif

 
 1/*
 2 * Copyright (C) 2011 STRATO AG
 3 * written by Arne Jansen <sensille@gmx.net>
 4 * Distributed under the GNU GPL license version 2.
 5 *
 6 */
 7
 8#ifndef __ULIST__
 9#define __ULIST__
10
11#include <linux/list.h>
12#include <linux/rbtree.h>
13
14/*
15 * ulist is a generic data structure to hold a collection of unique u64
16 * values. The only operations it supports is adding to the list and
17 * enumerating it.
18 * It is possible to store an auxiliary value along with the key.
19 *
20 */
21struct ulist_iterator {
22#ifdef CONFIG_BTRFS_DEBUG
23	int i;
24#endif
25	struct list_head *cur_list;  /* hint to start search */
26};
27
28/*
29 * element of the list
30 */
31struct ulist_node {
32	u64 val;		/* value to store */
33	u64 aux;		/* auxiliary value saved along with the val */
34
35#ifdef CONFIG_BTRFS_DEBUG
36	int seqnum;		/* sequence number this node is added */
37#endif
38
39	struct list_head list;  /* used to link node */
40	struct rb_node rb_node;	/* used to speed up search */
41};
42
43struct ulist {
44	/*
45	 * number of elements stored in list
46	 */
47	unsigned long nnodes;
48
49	struct list_head nodes;
50	struct rb_root root;
51};
52
53void ulist_init(struct ulist *ulist);
 
54void ulist_reinit(struct ulist *ulist);
55struct ulist *ulist_alloc(gfp_t gfp_mask);
56void ulist_free(struct ulist *ulist);
57int ulist_add(struct ulist *ulist, u64 val, u64 aux, gfp_t gfp_mask);
58int ulist_add_merge(struct ulist *ulist, u64 val, u64 aux,
59		    u64 *old_aux, gfp_t gfp_mask);
60struct ulist_node *ulist_next(struct ulist *ulist,
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
61			      struct ulist_iterator *uiter);
62
63#define ULIST_ITER_INIT(uiter) ((uiter)->cur_list = NULL)
64
65#endif