1*56a34939Shaad /* $NetBSD: btree.h,v 1.1.1.1 2008/12/22 00:17:54 haad Exp $ */ 2*56a34939Shaad 3*56a34939Shaad /* 4*56a34939Shaad * Copyright (C) 2001-2004 Sistina Software, Inc. All rights reserved. 5*56a34939Shaad * Copyright (C) 2004-2005 Red Hat, Inc. All rights reserved. 6*56a34939Shaad * 7*56a34939Shaad * This file is part of LVM2. 8*56a34939Shaad * 9*56a34939Shaad * This copyrighted material is made available to anyone wishing to use, 10*56a34939Shaad * modify, copy, or redistribute it subject to the terms and conditions 11*56a34939Shaad * of the GNU Lesser General Public License v.2.1. 12*56a34939Shaad * 13*56a34939Shaad * You should have received a copy of the GNU Lesser General Public License 14*56a34939Shaad * along with this program; if not, write to the Free Software Foundation, 15*56a34939Shaad * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 16*56a34939Shaad */ 17*56a34939Shaad 18*56a34939Shaad #ifndef _LVM_BTREE_H 19*56a34939Shaad #define _LVM_BTREE_H 20*56a34939Shaad 21*56a34939Shaad struct btree; 22*56a34939Shaad 23*56a34939Shaad struct btree *btree_create(struct dm_pool *mem); 24*56a34939Shaad 25*56a34939Shaad void *btree_lookup(const struct btree *t, uint32_t k); 26*56a34939Shaad int btree_insert(struct btree *t, uint32_t k, void *data); 27*56a34939Shaad 28*56a34939Shaad struct btree_iter; 29*56a34939Shaad void *btree_get_data(const struct btree_iter *it); 30*56a34939Shaad 31*56a34939Shaad struct btree_iter *btree_first(const struct btree *t); 32*56a34939Shaad struct btree_iter *btree_next(const struct btree_iter *it); 33*56a34939Shaad 34*56a34939Shaad #endif 35