summaryrefslogtreecommitdiff
path: root/lib/ntdb/traverse.c
blob: 45478755bd2a7c3bae609600bfa214a4bad0c936 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
 /*
   Trivial Database 2: traverse function.
   Copyright (C) Rusty Russell 2010

   This library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Lesser General Public
   License as published by the Free Software Foundation; either
   version 3 of the License, or (at your option) any later version.

   This library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public
   License along with this library; if not, see <http://www.gnu.org/licenses/>.
*/
#include "private.h"
#include <ccan/likely/likely.h>

_PUBLIC_ int64_t ntdb_traverse_(struct ntdb_context *ntdb,
		      int (*fn)(struct ntdb_context *,
				NTDB_DATA, NTDB_DATA, void *),
		      void *p)
{
	enum NTDB_ERROR ecode;
	struct traverse_info tinfo;
	NTDB_DATA k, d;
	int64_t count = 0;

	k.dptr = NULL;
	for (ecode = first_in_hash(ntdb, &tinfo, &k, &d.dsize);
	     ecode == NTDB_SUCCESS;
	     ecode = next_in_hash(ntdb, &tinfo, &k, &d.dsize)) {
		d.dptr = k.dptr + k.dsize;

		count++;
		if (fn && fn(ntdb, k, d, p)) {
			free(k.dptr);
			return count;
		}
		free(k.dptr);
	}

	if (ecode != NTDB_ERR_NOEXIST) {
		return NTDB_ERR_TO_OFF(ecode);
	}
	return count;
}

_PUBLIC_ enum NTDB_ERROR ntdb_firstkey(struct ntdb_context *ntdb, NTDB_DATA *key)
{
	struct traverse_info tinfo;

	return first_in_hash(ntdb, &tinfo, key, NULL);
}

/* We lock twice, not very efficient.  We could keep last key & tinfo cached. */
_PUBLIC_ enum NTDB_ERROR ntdb_nextkey(struct ntdb_context *ntdb, NTDB_DATA *key)
{
	struct traverse_info tinfo;
	struct hash_info h;
	struct ntdb_used_record rec;

	tinfo.prev = find_and_lock(ntdb, *key, F_RDLCK, &h, &rec, &tinfo);
	free(key->dptr);
	if (NTDB_OFF_IS_ERR(tinfo.prev)) {
		return NTDB_OFF_TO_ERR(tinfo.prev);
	}
	ntdb_unlock_hashes(ntdb, h.hlock_start, h.hlock_range, F_RDLCK);

	return next_in_hash(ntdb, &tinfo, key, NULL);
}

static int wipe_one(struct ntdb_context *ntdb,
		    NTDB_DATA key, NTDB_DATA data, enum NTDB_ERROR *ecode)
{
	*ecode = ntdb_delete(ntdb, key);
	return (*ecode != NTDB_SUCCESS);
}

_PUBLIC_ enum NTDB_ERROR ntdb_wipe_all(struct ntdb_context *ntdb)
{
	enum NTDB_ERROR ecode;
	int64_t count;

	ecode = ntdb_allrecord_lock(ntdb, F_WRLCK, NTDB_LOCK_WAIT, false);
	if (ecode != NTDB_SUCCESS)
		return ecode;

	/* FIXME: Be smarter. */
	count = ntdb_traverse(ntdb, wipe_one, &ecode);
	if (count < 0)
		ecode = NTDB_OFF_TO_ERR(count);
	ntdb_allrecord_unlock(ntdb, F_WRLCK);
	return ecode;
}