2 * Copyright (C) 2001-2004 Sistina Software, Inc. All rights reserved.
3 * Copyright (C) 2004-2007 Red Hat, Inc. All rights reserved.
5 * This file is part of the device-mapper userspace tools.
7 * This copyrighted material is made available to anyone wishing to use,
8 * modify, copy, or redistribute it subject to the terms and conditions
9 * of the GNU Lesser General Public License v.2.1.
11 * You should have received a copy of the GNU Lesser General Public License
12 * along with this program; if not, write to the Free Software Foundation,
13 * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21 struct node *l, *m, *r;
31 static struct node **_lookup_single(struct node **c, unsigned int k)
49 void *ttree_lookup(struct ttree *tt, unsigned *key)
51 struct node **c = &tt->root;
55 c = _lookup_single(c, *key++);
59 return *c ? (*c)->data : NULL;
62 static struct node *_tree_node(struct dm_pool *mem, unsigned int k)
64 struct node *n = dm_pool_zalloc(mem, sizeof(*n));
72 int ttree_insert(struct ttree *tt, unsigned int *key, void *data)
74 struct node **c = &tt->root;
80 c = _lookup_single(c, k);
83 } while (*c && count);
89 if (!(*c = _tree_node(tt->mem, k))) {
105 struct ttree *ttree_create(struct dm_pool *mem, unsigned int klen)
109 if (!(tt = dm_pool_zalloc(mem, sizeof(*tt)))) {