2003-04-01 02:30:57 +08:00
|
|
|
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
* Copyright by the Board of Trustees of the University of Illinois. *
|
|
|
|
* All rights reserved. *
|
|
|
|
* *
|
|
|
|
* This file is part of HDF5. The full HDF5 copyright notice, including *
|
|
|
|
* terms governing use, modification, and redistribution, is contained in *
|
|
|
|
* the files COPYING and Copyright.html. COPYING can be found at the root *
|
|
|
|
* of the source code distribution tree; Copyright.html can be found at the *
|
|
|
|
* root level of an installed copy of the electronic HDF5 document set and *
|
|
|
|
* is linked from the top-level documents page. It can also be found at *
|
|
|
|
* http://hdf.ncsa.uiuc.edu/HDF5/doc/Copyright.html. If you do not have *
|
|
|
|
* access to either file, you may request a copy from hdfhelp@ncsa.uiuc.edu. *
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
|
|
|
|
|
1998-03-31 03:24:08 +08:00
|
|
|
/*
|
|
|
|
* Programmer: Robb Matzke <matzke@llnl.gov>
|
|
|
|
* Friday, March 27, 1998
|
|
|
|
*/
|
|
|
|
#ifndef _H5HGprivate_H
|
|
|
|
#define _H5HGprivate_H
|
|
|
|
|
2001-04-06 01:29:14 +08:00
|
|
|
#include "H5HGpublic.h"
|
|
|
|
#include "H5Fprivate.h"
|
1998-04-03 11:29:38 +08:00
|
|
|
|
1998-03-31 03:24:08 +08:00
|
|
|
/*
|
|
|
|
* Each collection has a magic number for some redundancy.
|
|
|
|
*/
|
|
|
|
#define H5HG_MAGIC "GCOL"
|
|
|
|
#define H5HG_SIZEOF_MAGIC 4
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Global heap collection version.
|
|
|
|
*/
|
|
|
|
#define H5HG_VERSION 1
|
|
|
|
|
1998-07-20 21:45:25 +08:00
|
|
|
/*
|
|
|
|
* Pad all global heap messages to a multiple of eight bytes so we can load
|
|
|
|
* the entire collection into memory and operate on it there. Eight should
|
|
|
|
* be sufficient for machines that have alignment constraints because our
|
|
|
|
* largest data type is eight bytes.
|
|
|
|
*/
|
|
|
|
#define H5HG_ALIGNMENT 8
|
|
|
|
#define H5HG_ALIGN(X) (H5HG_ALIGNMENT*(((X)+H5HG_ALIGNMENT-1)/ \
|
|
|
|
H5HG_ALIGNMENT))
|
1999-02-16 01:38:04 +08:00
|
|
|
#define H5HG_ISALIGNED(X) ((X)==H5HG_ALIGN(X))
|
1998-07-20 21:45:25 +08:00
|
|
|
|
1998-03-31 03:24:08 +08:00
|
|
|
/*
|
|
|
|
* All global heap collections are at least this big. This allows us to read
|
|
|
|
* most collections with a single read() since we don't have to read a few
|
|
|
|
* bytes of header to figure out the size. If the heap is larger than this
|
|
|
|
* then a second read gets the rest after we've decoded the header.
|
|
|
|
*/
|
|
|
|
#define H5HG_MINSIZE 4096
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Maximum length of the CWFS list, the list of remembered collections that
|
|
|
|
* have free space.
|
|
|
|
*/
|
|
|
|
#define H5HG_NCWFS 16
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The maximum number of links allowed to a global heap object.
|
|
|
|
*/
|
|
|
|
#define H5HG_MAXLINK 65535
|
|
|
|
|
|
|
|
/*
|
1999-02-16 01:38:04 +08:00
|
|
|
* The size of the collection header, always a multiple of the alignment so
|
|
|
|
* that the stuff that follows the header is aligned.
|
1998-03-31 03:24:08 +08:00
|
|
|
*/
|
1999-02-16 01:38:04 +08:00
|
|
|
#define H5HG_SIZEOF_HDR(f) \
|
|
|
|
H5HG_ALIGN(4 + /*magic number */ \
|
|
|
|
1 + /*version number */ \
|
|
|
|
3 + /*reserved */ \
|
|
|
|
H5F_SIZEOF_SIZE(f)) /*collection size */
|
1998-03-31 03:24:08 +08:00
|
|
|
|
|
|
|
/*
|
1999-02-16 01:38:04 +08:00
|
|
|
* The overhead associated with each object in the heap, always a multiple of
|
|
|
|
* the alignment so that the stuff that follows the header is aligned.
|
1998-03-31 03:24:08 +08:00
|
|
|
*/
|
1999-02-16 01:38:04 +08:00
|
|
|
#define H5HG_SIZEOF_OBJHDR(f) \
|
|
|
|
H5HG_ALIGN(2 + /*object id number */ \
|
|
|
|
2 + /*reference count */ \
|
|
|
|
4 + /*reserved */ \
|
|
|
|
H5F_SIZEOF_SIZE(f)) /*object data size */
|
1998-03-31 03:24:08 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* The initial guess for the number of messages in a collection. We assume
|
|
|
|
* that all objects in that collection are zero length, giving the maximum
|
|
|
|
* possible number of objects in the collection. The collection itself has
|
1998-04-03 11:29:38 +08:00
|
|
|
* some overhead and each message has some overhead. The `+2' accounts for
|
|
|
|
* rounding and for the free space object.
|
1998-03-31 03:24:08 +08:00
|
|
|
*/
|
|
|
|
#define H5HG_NOBJS(f,z) (int)((((z)-H5HG_SIZEOF_HDR(f))/ \
|
1998-04-03 11:29:38 +08:00
|
|
|
H5HG_SIZEOF_OBJHDR(f)+2))
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Makes a global heap object pointer undefined, or checks whether one is
|
|
|
|
* defined.
|
|
|
|
*/
|
|
|
|
#define H5HG_undef(HGP) ((HGP)->idx=0)
|
|
|
|
#define H5HG_defined(HGP) ((HGP)->idx!=0)
|
|
|
|
|
|
|
|
typedef struct H5HG_t {
|
|
|
|
haddr_t addr; /*address of collection */
|
2001-08-15 06:09:56 +08:00
|
|
|
unsigned idx; /*object ID within collection */
|
1998-04-03 11:29:38 +08:00
|
|
|
} H5HG_t;
|
1998-03-31 03:24:08 +08:00
|
|
|
|
1998-04-03 11:29:38 +08:00
|
|
|
typedef struct H5HG_heap_t H5HG_heap_t;
|
1998-03-31 03:24:08 +08:00
|
|
|
|
2003-02-11 01:26:09 +08:00
|
|
|
H5_DLL H5HG_heap_t *H5HG_create(H5F_t *f, hid_t dxpl_id, size_t size);
|
|
|
|
H5_DLL herr_t H5HG_insert(H5F_t *f, hid_t dxpl_id, size_t size, void *obj,
|
1999-02-19 00:21:34 +08:00
|
|
|
H5HG_t *hobj/*out*/);
|
2003-02-11 01:26:09 +08:00
|
|
|
H5_DLL void *H5HG_peek(H5F_t *f, hid_t dxpl_id, H5HG_t *hobj);
|
|
|
|
H5_DLL void *H5HG_read(H5F_t *f, hid_t dxpl_id, H5HG_t *hobj, void *object);
|
|
|
|
H5_DLL int H5HG_link(H5F_t *f, hid_t dxpl_id, H5HG_t *hobj, int adjust);
|
|
|
|
H5_DLL herr_t H5HG_remove(H5F_t *f, hid_t dxpl_id, H5HG_t *hobj);
|
|
|
|
H5_DLL herr_t H5HG_debug(H5F_t *f, hid_t dxpl_id, haddr_t addr, FILE *stream, int indent,
|
2001-08-15 06:09:56 +08:00
|
|
|
int fwidth);
|
1998-03-31 03:24:08 +08:00
|
|
|
|
|
|
|
#endif
|