diff options
| author | Alasdair Kergon <agk@redhat.com> | 2005-10-16 23:03:59 +0000 |
|---|---|---|
| committer | Alasdair Kergon <agk@redhat.com> | 2005-10-16 23:03:59 +0000 |
| commit | 2262b32057a7a60b3de3876b26b192fa4d05205c (patch) | |
| tree | e2593b67101f9e681cf3a9a5dafedb58c23c661a /lib/datastruct/btree.c | |
| parent | a3f6b2ce798cf738c4e8bf510f86ebd45815842c (diff) | |
| download | lvm2-2262b32057a7a60b3de3876b26b192fa4d05205c.tar.gz lvm2-2262b32057a7a60b3de3876b26b192fa4d05205c.tar.xz lvm2-2262b32057a7a60b3de3876b26b192fa4d05205c.zip | |
Use hash, bitset, malloc, pool from libdevmapper.
Diffstat (limited to 'lib/datastruct/btree.c')
| -rw-r--r-- | lib/datastruct/btree.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/lib/datastruct/btree.c b/lib/datastruct/btree.c index 7a1b342d..0a0aa4ff 100644 --- a/lib/datastruct/btree.c +++ b/lib/datastruct/btree.c @@ -24,13 +24,13 @@ struct node { }; struct btree { - struct pool *mem; + struct dm_pool *mem; struct node *root; }; -struct btree *btree_create(struct pool *mem) +struct btree *btree_create(struct dm_pool *mem) { - struct btree *t = pool_alloc(mem, sizeof(*t)); + struct btree *t = dm_pool_alloc(mem, sizeof(*t)); if (t) { t->mem = mem; @@ -86,7 +86,7 @@ int btree_insert(struct btree *t, uint32_t k, void *data) struct node *p, **c = _lookup(&t->root, key, &p), *n; if (!*c) { - if (!(n = pool_alloc(t->mem, sizeof(*n)))) { + if (!(n = dm_pool_alloc(t->mem, sizeof(*n)))) { stack; return 0; } |