summaryrefslogtreecommitdiffstats
path: root/src/H5Bprivate.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/H5Bprivate.h')
-rw-r--r--src/H5Bprivate.h85
1 files changed, 85 insertions, 0 deletions
diff --git a/src/H5Bprivate.h b/src/H5Bprivate.h
new file mode 100644
index 0000000..d6ecc7c
--- /dev/null
+++ b/src/H5Bprivate.h
@@ -0,0 +1,85 @@
+/*-------------------------------------------------------------------------
+ * Copyright (C) 1997 National Center for Supercomputing Applications.
+ * All rights reserved.
+ *
+ *-------------------------------------------------------------------------
+ *
+ * Created: H5Bprivate.h
+ * Jul 10 1997
+ * Robb Matzke <matzke@llnl.gov>
+ *
+ * Purpose: Private non-prototype header.
+ *
+ * Modifications:
+ *
+ *-------------------------------------------------------------------------
+ */
+#ifndef _H5Bprivate_H
+#define _H5Bprivate_H
+
+#include "H5Bproto.h" /*API prototypes */
+
+
+
+#define H5B_MAGIC "TREE" /* tree node magic number */
+#define H5B_HDR_SIZE(F) (8+2*SIZEOF_OFFSET(F))
+
+#define H5B_ANCHOR_LT 0 /* left node is anchored, right is new */
+#define H5B_ANCHOR_RT 1 /* right node is anchored, left is new */
+
+
+/*
+ * Each class of object that can be pointed to by a B-link tree has a
+ * variable of this type that contains class variables and methods.
+ */
+typedef struct H5B_class_t {
+ intn id; /*id as found in file */
+ intn k; /* max children is 2k */
+ size_t sizeof_nkey; /*size of native (memory) key */
+ size_t (*get_sizeof_rkey)(hdf5_file_t*);
+ off_t (*new)(hdf5_file_t*,void*,void*,void*);
+ intn (*cmp)(hdf5_file_t*,void*,void*,void*);
+ herr_t (*found)(hdf5_file_t*,off_t,void*,void*,void*);
+ off_t (*insert)(hdf5_file_t*,off_t,int*,void*,int*,void*,void*,
+ void*,int*);
+ herr_t (*list)(hdf5_file_t*,off_t,void*);
+ void (*decode)(hdf5_file_t*,uint8*,void*);
+ void (*encode)(hdf5_file_t*,uint8*,void*);
+} H5B_class_t;
+
+/*
+ * The B-tree node as stored in memory...
+ */
+typedef struct H5B_key_t {
+ intn dirty; /*native key is more recent than raw key*/
+ uint8 *rkey; /*ptr into node->page for raw key */
+ void *nkey; /*null or ptr into node->native for key */
+} H5B_key_t;
+
+typedef struct H5B_t {
+ const H5B_class_t *type; /*type of tree */
+ size_t sizeof_rkey; /*size of raw (disk) key */
+ intn dirty; /*something in the tree is dirty */
+ intn ndirty; /*num child ptrs to emit */
+ intn level; /*node level */
+ off_t left; /*address of left sibling */
+ off_t right; /*address of right sibling */
+ intn nchildren; /*number of child pointers */
+ uint8 *page; /*disk page */
+ uint8 *native; /*array of keys in native format */
+ H5B_key_t *key; /*2k+1 key entries */
+ off_t *child; /*2k child pointers */
+} H5B_t;
+
+
+/*
+ * Library prototypes.
+ */
+herr_t H5B_debug (hdf5_file_t *f, off_t addr, const H5B_class_t *type);
+off_t H5B_new (hdf5_file_t *f, const H5B_class_t *type, size_t sizeof_rkey);
+herr_t H5B_find (hdf5_file_t *f, const H5B_class_t *type, off_t addr, void *udata);
+off_t H5B_insert (hdf5_file_t *f, const H5B_class_t *type, off_t addr, void *udata);
+herr_t H5B_list (hdf5_file_t *f, const H5B_class_t *type, off_t addr, void *udata);
+
+
+#endif /* !_H5Bprivate_H */