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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
/*
* Copyright (C) 1998 NCSA
* All rights reserved.
*
* Programmer: Robb Matzke <matzke@llnl.gov>
* Friday, March 27, 1998
*/
#ifndef _H5HGprivate_H
#define _H5HGprivate_H
#include <H5HGpublic.h>
#include <H5Fprivate.h>
/*
* 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
/*
* 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))
/*
* 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
/*
* The size of the collection header.
*/
#define H5HG_SIZEOF_HDR(f) (4 + /*magic number */ \
1 + /*version number */ \
3 + /*reserved */ \
H5F_SIZEOF_SIZE(f)) /*collection size */
/*
* The overhead associated with each object in the heap.
*/
#define H5HG_SIZEOF_OBJHDR(f) (2 + /*object id number */ \
2 + /*reference count */ \
4 + /*reserved */ \
H5F_SIZEOF_SIZE(f)) /*object data size */
/*
* 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
* some overhead and each message has some overhead. The `+2' accounts for
* rounding and for the free space object.
*/
#define H5HG_NOBJS(f,z) (int)((((z)-H5HG_SIZEOF_HDR(f))/ \
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 */
intn idx; /*object ID within collection */
} H5HG_t;
typedef struct H5HG_heap_t H5HG_heap_t;
__DLL__ H5HG_heap_t *H5HG_create (H5F_t *f, size_t size);
__DLL__ herr_t H5HG_insert (H5F_t *f, size_t size, void *obj,
H5HG_t *hobj/*out*/);
__DLL__ void *H5HG_peek (H5F_t *f, H5HG_t *hobj);
__DLL__ void *H5HG_read (H5F_t *f, H5HG_t *hobj, void *object);
__DLL__ intn H5HG_link (H5F_t *f, H5HG_t *hobj, intn adjust);
__DLL__ herr_t H5HG_remove (H5F_t *f, H5HG_t *hobj);
__DLL__ herr_t H5HG_debug(H5F_t *f, const haddr_t *addr, FILE *stream,
intn indent, intn fwidth);
#endif
|
