fs/hfs/btree.h

/*
 * libhfs - library for reading and writing Macintosh HFS volumes
 * Copyright (C) 1996-1998 Robert Leslie
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program 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 General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 */

int bt_getnode(node *, btree *, unsigned long);
int bt_putnode(node *);

int bt_readhdr(btree *);
int bt_writehdr(btree *);

int bt_space(btree *, unsigned int);

int bt_insert(btree *, const byte *, unsigned int);
int bt_delete(btree *, const byte *);

int bt_search(btree *, const byte *, node *);
1	/*
2	* libhfs - library for reading and writing Macintosh HFS volumes
3	* Copyright (C) 1996-1998 Robert Leslie
4	*
5	* This program is free software; you can redistribute it and/or modify
6	* it under the terms of the GNU General Public License as published by
7	* the Free Software Foundation; either version 2 of the License, or
8	* (at your option) any later version.
9	*
10	* This program is distributed in the hope that it will be useful,
11	* but WITHOUT ANY WARRANTY; without even the implied warranty of
12	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13	* GNU General Public License for more details.
14	*
15	* You should have received a copy of the GNU General Public License
16	* along with this program; if not, write to the Free Software
17	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
18	*
19	*/
20
21	int bt_getnode(node , btree , unsigned long);
22	int bt_putnode(node *);
23
24	int bt_readhdr(btree *);
25	int bt_writehdr(btree *);
26
27	int bt_space(btree *, unsigned int);
28
29	int bt_insert(btree , const byte , unsigned int);
30	int bt_delete(btree , const byte );
31
32	int bt_search(btree , const byte , node *);