/usr/include/hfsplus/btree.h is in libhfsp-dev 1.0.4-12.1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 | /*
* libhfs - library for reading and writing Macintosh HFS volumes.
*
* The fucntions are used to handle the various forms of btrees
* found on HFS+ volumes.
*
* Copyright (C) 2000 Klaus Halfmann <klaus.halfmann@feri.de>
* Original 1996-1998 Robert Leslie <rob@mars.org>
* Additional work by Brad Boyer (flar@pants.nu)
*
* 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.
*
* $Id: btree.h,v 1.1.1.1 2002/03/05 19:50:28 klaus Exp $
*/
/* Read the node from the given buffer and swap the bytes.
*
* return pointer after reading the structure
*/
void* btree_readnode(btree_node_desc* node, void *p);
/* read a btree header from the given buffer and swap the bytes.
*
* return pointer after reading the structure
*/
void* btree_readhead(btree_head* head, void *p);
/** Intialize catalog btree, so that btree_close can safely be called. */
extern void btree_reset(btree* bt);
/** Intialize catalog btree */
extern int btree_init_cat(btree* bt, volume* vol, hfsp_fork_raw* fork);
/** Intialize extents btree */
extern int btree_init_extent(btree* bt, volume* vol, hfsp_fork_raw* fork);
/** close the btree and free any resources */
extern int btree_close(btree* bt);
/* Read node at given index.
*
* Make node with given flag, usually NODE_CLEAN/NODE_DIRTY
*/
extern node_buf* btree_node_by_index(btree* bt, UInt16 index, int flags);
/* returns pointer to key given by index in current node */
extern void* btree_key_by_index(btree* bt, node_buf* buf, UInt16 index);
/* remove the key and record from the btree.
* Warning, you must WRITELOCK the btree before calling this */
extern int btree_remove_record(btree* bt, UInt16 node_index, UInt16 recind);
/* insert a key and an (eventual) record into the btree.
* Warning, you must WRITELOCK the btree before calling this */
extern int btree_insert_record(btree* bt, UInt16 node_index, UInt16 keyind,
void* key, int len);
// --------------- Cache Handling ------------
/* Priority of the depth of the node compared to LRU value.
* Should be the average number of keys per node but these vary. */
#define DEPTH_FACTOR 1000
/* Cache size is height of tree + this value
* Really big numbers wont help in case of ls -R
* Must be enough to cache all nodes (+ Map nodes !)
* used during tree reorganizations to avoid
* inconsistent states before flush
*/
#define EXTRA_CACHESIZE 3
/* Intialize cache with default cache Size,
* must call node_cache_close to deallocate memory */
extern int node_cache_init(node_cache* cache, btree* tree, int size);
/** return allocation status of node given by index in btree */
extern int btree_check_nodealloc(btree* bt, UInt16 node);
|