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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
|
/*-------------------------------------------------------------------------
* Copyright (C) 1997 National Center for Supercomputing Applications.
* All rights reserved.
*
*-------------------------------------------------------------------------
*
* Created: H5G.c
* Jul 18 1997
* Robb Matzke <robb@maya.nuance.com>
*
* Purpose:
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
#include <assert.h>
#include "hdf5.h"
#define H5G_INIT_HEAP 8192
/* Packages needed by this file... */
#include "H5Bprivate.h"
#include "H5Gprivate.h"
#include "H5Hprivate.h"
#include "H5MMprivate.h"
/* PRIVATE PROTOTYPES */
/*-------------------------------------------------------------------------
* Function: H5G_new
*
* Purpose: Creates a new empty symbol table (object header, name heap,
* and B-tree). The caller can specify an initial size for the
* name heap. If no size is specified then a default heap is
* created when the first symbol is added to the table.
*
* The B-tree is created when the first symbol is added to
* the table.
*
* In order for the B-tree to operate correctly, the first
* item in the heap is the empty string, and must appear at
* heap offset zero.
*
* Return: Success: Address of new symbol table.
*
* Failure: -1
*
* Programmer: Robb Matzke
* robb@maya.nuance.com
* Aug 1 1997
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
haddr_t
H5G_new (hdf5_file_t *f, size_t init)
{
haddr_t addr; /*symtab object header */
haddr_t heap; /*private heap */
off_t name; /*offset of "" name */
/* Create symbol table private heap */
if (init>0) {
if ((heap = H5H_new (f, init))<0) return -1;
if ((name = H5H_insert (f, heap, 1, "")<0)) return -1;
assert (0==name); /*or B-tree's won't work*/
} else {
heap = 0; /*we'll create it later*/
}
/* Create symbol table object header */
addr = not_implemented_yet__create_object_header();
if (addr<0) return -1;
/* Insert the heap and B-tree addresses */
not_implemented_yet__insert_symtab_message (f, addr, heap, 0);
return addr;
}
/*-------------------------------------------------------------------------
* Function: H5G_find
*
* Purpose: Finds a symbol named NAME in the symbol table whose address
* is ADDR and returns a copy of the symbol table entry through
* the ENTRY argument.
*
* Return: Success: Address corresponding to the name.
*
* Failure: -1
*
* Programmer: Robb Matzke
* robb@maya.nuance.com
* Aug 1 1997
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
haddr_t
H5G_find (hdf5_file_t *f, haddr_t addr, const char *name, H5G_entry_t *entry)
{
H5G_node_ud1_t udata; /*data to pass through B-tree */
haddr_t btree; /*address of B-tree */
/* set up the udata */
not_implemented_yet__get_symtab_message (f, addr, &(udata.heap), &btree);
if (btree<=0 || udata.heap<=0) return -1; /*empty symbol table*/
udata.operation = H5G_OPER_FIND;
udata.name = name;
/* search the B-tree */
if (H5B_find (f, H5B_SNODE, btree, &udata)<0) return -1;
/* return the result */
if (entry) *entry = udata.entry;
return udata.entry.header;
}
/*-------------------------------------------------------------------------
* Function: H5G_modify
*
* Purpose: Modifies the entry for an existing symbol. The name of the
* symbol is NAME in the symbol table whose address is ADDR in
* file F. ENTRY is the new symbol table entry to use for the
* symbol.
*
* Return: Success: 0
*
* Failure: -1
*
* Programmer: Robb Matzke
* robb@maya.nuance.com
* Aug 1 1997
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
herr_t
H5G_modify (hdf5_file_t *f, haddr_t addr, const char *name, H5G_entry_t *entry)
{
H5G_node_ud1_t udata; /*data to pass through B-tree */
haddr_t btree; /*address of B-tree */
/* set up the udata */
not_implemented_yet__get_symtab_message (f, addr, &(udata.heap), &btree);
if (btree<=0 || udata.heap<=0) return -1; /*empty symbol table*/
udata.operation = H5G_OPER_MODIFY;
udata.name = name;
udata.entry = *entry;
/* search and modify the B-tree */
if (H5B_find (f, H5B_SNODE, btree, &udata)<0) return -1;
return 0;
}
/*-------------------------------------------------------------------------
* Function: H5G_insert
*
* Purpose: Insert a new symbol into the table whose address is ADDR in
* file F. The name of the new symbol is NAME and its symbol
* table entry is ENTRY.
*
* Return: Success: 0
*
* Failure: -1
*
* Programmer: Robb Matzke
* robb@maya.nuance.com
* Aug 1 1997
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
herr_t
H5G_insert (hdf5_file_t *f, haddr_t addr, const char *name, H5G_entry_t *entry)
{
haddr_t btree; /*file address of B-tree */
H5G_node_ud1_t udata; /*data to pass through B-tree */
off_t offset; /*offset of name within heap */
/* make sure we have a B-tree and a heap */
not_implemented_yet__get_symtab_message (f, addr, &btree, &(udata.heap));
if (btree<=0 || udata.heap<=0) {
if (btree<=0 &&
(btree = H5B_new (f, H5B_SNODE, sizeof(H5G_node_key_t)))<0) {
return -1;
}
if (udata.heap<=0) {
udata.heap = H5H_new (f, MAX(strlen(name)+1, H5G_INIT_HEAP));
if (udata.heap<0) return -1;
if (0!=(offset = H5H_insert (f, udata.heap, 1, ""))) return -1;
}
not_implemented_yet__update_symtab_message (f, addr, udata.heap, btree);
}
/* initialize data to pass through B-tree */
udata.name = name;
udata.entry = *entry;
if (H5B_insert (f, H5B_SNODE, btree, &udata)<0) return -1;
return 0;
}
/*-------------------------------------------------------------------------
* Function: H5G_list
*
* Purpose: Returns a list of all the symbols in a symbol table.
* The caller allocates an array of pointers which this
* function will fill in with malloc'd names. The caller
* also allocates an array of symbol table entries which will
* be filled in with data from the symbol table. Each of these
* arrays should have at least MAXENTRIES elements.
*
* Return: Success: The total number of symbols in the
* symbol table. This may exceed MAXENTRIES,
* but at most MAXENTRIES values are copied
* into the NAMES and ENTRIES arrays.
*
* Failure: -1, the pointers in NAMES are undefined but
* no memory is allocated. The values in
* ENTRIES are undefined.
*
* Programmer: Robb Matzke
* robb@maya.nuance.com
* Aug 1 1997
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
intn
H5G_list (hdf5_file_t *f, haddr_t addr, int maxentries,
char *names[], H5G_entry_t entries[])
{
H5G_node_list_t udata;
haddr_t btree;
intn i;
not_implemented_yet__get_symtab_message (f, addr, &btree, &(udata.heap));
if (btree<=0 || udata.heap<=0) return 0; /*empty directory*/
udata.entry = entries;
udata.name = names;
udata.maxentries = maxentries;
udata.nsyms = 0;
if (names) HDmemset (names, 0, maxentries);
if (H5B_list (f, H5B_SNODE, btree, &udata)<0) {
if (names) {
for (i=0; i<maxentries; i++) H5MM_xfree (names[i]);
}
return -1;
}
return udata.nsyms;
}
/*-------------------------------------------------------------------------
* Function: H5G_decode_vec
*
* Purpose: Same as H5G_decode() except it does it for an array of
* symbol table entries.
*
* Return: Success: 0, with *pp pointing to the first byte
* after the last symbol.
*
* Failure: -1
*
* Programmer: Robb Matzke
* robb@maya.nuance.com
* Jul 18 1997
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
herr_t
H5G_decode_vec (hdf5_file_t *f, uint8 **pp, H5G_entry_t *ent, intn n)
{
intn i;
for (i=0; i<n; i++) {
if (H5G_decode (f, pp, ent+i)<0) return -1;
}
return 0;
}
/*-------------------------------------------------------------------------
* Function: H5G_decode
*
* Purpose: Decodes a symbol table entry pointed to by `*pp'.
*
* Return: Success: 0 with *pp pointing to the first byte
* following the symbol table entry.
*
* Failure: -1
*
* Programmer: Robb Matzke
* robb@maya.nuance.com
* Jul 18 1997
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
herr_t
H5G_decode (hdf5_file_t *f, uint8 **pp, H5G_entry_t *ent)
{
uint8 *p_ret = *pp;
H5F_decode_offset (f, *pp, ent->name_off);
H5F_decode_offset (f, *pp, ent->header);
UINT32DECODE (*pp, ent->type);
switch (ent->type) {
case H5G_NOTHING_CACHED:
break;
case H5G_CACHED_SDATA:
UINT32DECODE (*pp, ent->cache.sdata.nt);
UINT32DECODE (*pp, ent->cache.sdata.ndim);
UINT32DECODE (*pp, ent->cache.sdata.dim[0]);
UINT32DECODE (*pp, ent->cache.sdata.dim[1]);
UINT32DECODE (*pp, ent->cache.sdata.dim[2]);
UINT32DECODE (*pp, ent->cache.sdata.dim[3]);
break;
case H5G_CACHED_SYMTAB:
UINT32DECODE (*pp, ent->cache.symtab.btree);
UINT32DECODE (*pp, ent->cache.symtab.heap);
break;
default:
abort();
}
*pp = p_ret + 2*H5F_SIZEOF_OFFSET(f) + 4 + 24;
return 0;
}
/*-------------------------------------------------------------------------
* Function: H5G_encode_vec
*
* Purpose: Same as H5G_encode() except it does it for an array of
* symbol table entries.
*
* Return: Success: 0, with *pp pointing to the first byte
* after the last symbol.
*
* Failure: -1
*
* Programmer: Robb Matzke
* robb@maya.nuance.com
* Jul 18 1997
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
herr_t
H5G_encode_vec (hdf5_file_t *f, uint8 **pp, H5G_entry_t *ent, intn n)
{
intn i;
for (i=0; i<n; i++) {
if (H5G_encode (f, pp, ent+i)<0) return -1;
}
return 0;
}
/*-------------------------------------------------------------------------
* Function: H5G_encode
*
* Purpose: Encodes the specified symbol table entry into the buffer
* pointed to by *pp.
*
* Return: Success: 0, with *pp pointing to the first byte
* after the symbol table entry.
*
* Failure: -1
*
* Programmer: Robb Matzke
* robb@maya.nuance.com
* Jul 18 1997
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
herr_t
H5G_encode (hdf5_file_t *f, uint8 **pp, H5G_entry_t *ent)
{
uint8 *p_ret = *pp;
H5F_encode_offset (f, *pp, ent->name_off);
H5F_encode_offset (f, *pp, ent->header);
UINT32ENCODE (*pp, ent->type);
switch (ent->type) {
case H5G_NOTHING_CACHED:
break;
case H5G_CACHED_SDATA:
UINT32ENCODE (*pp, ent->cache.sdata.nt);
UINT32ENCODE (*pp, ent->cache.sdata.ndim);
UINT32ENCODE (*pp, ent->cache.sdata.dim[0]);
UINT32ENCODE (*pp, ent->cache.sdata.dim[1]);
UINT32ENCODE (*pp, ent->cache.sdata.dim[2]);
UINT32ENCODE (*pp, ent->cache.sdata.dim[3]);
break;
case H5G_CACHED_SYMTAB:
UINT32ENCODE (*pp, ent->cache.symtab.btree);
UINT32ENCODE (*pp, ent->cache.symtab.heap);
break;
default:
abort();
}
*pp = p_ret + 2*H5F_SIZEOF_OFFSET(f) + 4 + 24;
return 0;
}
herr_t not_implemented_yet__create_object_header (void) {return FAIL;}
herr_t not_implemented_yet__insert_symtab_message (hdf5_file_t* f, haddr_t addr, haddr_t heap, haddr_t btree) {return FAIL;}
herr_t not_implemented_yet__get_symtab_message (hdf5_file_t *f, haddr_t addr, haddr_t *heap, haddr_t *btree) {return FAIL;}
herr_t not_implemented_yet__update_symtab_message (hdf5_file_t *f, haddr_t addr, haddr_t heap, haddr_t btree) {return FAIL;}
|