Return to btree.h CVS log

Up to [Qemu by Fabrice Bellard] / qemu / roms / openbios / fs / hfs / include

Annotation of qemu/roms/openbios/fs/hfs/include/btree.h, revision 1.1

1.1     ! root        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., 51 Franklin Street - Fifth Floor, Boston,
        !            18:  * MA 02110-1301, USA.
        !            19:  *
        !            20:  * $Id: btree.h,v 1.8 1998/11/02 22:08:55 rob Exp $
        !            21:  */
        !            22: 
        !            23: int bt_getnode(node *, btree *, unsigned long);
        !            24: int bt_putnode(node *);
        !            25: 
        !            26: int bt_readhdr(btree *);
        !            27: int bt_writehdr(btree *);
        !            28: 
        !            29: int bt_space(btree *, unsigned int);
        !            30: 
        !            31: int bt_insert(btree *, const byte *, unsigned int);
        !            32: int bt_delete(btree *, const byte *);
        !            33: 
        !            34: int bt_search(btree *, const byte *, node *);

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.