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
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
|
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* 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://hdfgroup.org/HDF5/doc/Copyright.html. If you do not have *
* access to either file, you may request a copy from help@hdfgroup.org. *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/* Programmer: Quincey Koziol <koziol@hdfgroup.org>
* Tuesday, January 27, 2009
*
* Purpose: Extensible array indexed (chunked) I/O functions. The chunks
* are given a single-dimensional index which is used as the
* offset in an extensible array that maps a chunk coordinate to
* a disk address.
*
*/
/****************/
/* Module Setup */
/****************/
#define H5D_PACKAGE /*suppress error about including H5Dpkg */
/***********/
/* Headers */
/***********/
#include "H5private.h" /* Generic Functions */
#include "H5Dpkg.h" /* Datasets */
#include "H5Eprivate.h" /* Error handling */
#include "H5EAprivate.h" /* Extensible arrays */
#include "H5FLprivate.h" /* Free Lists */
#include "H5MFprivate.h" /* File space management */
#include "H5Vprivate.h" /* Vector functions */
/****************/
/* Local Macros */
/****************/
/* Value to fill unset array elements with */
#define H5D_EARRAY_FILL HADDR_UNDEF
#define H5D_EARRAY_FILT_FILL {HADDR_UNDEF, 0, 0}
/* Extensible array creation values */
#define H5D_EARRAY_MAX_NELMTS_BITS 32 /* i.e. 4 giga-elements */
#define H5D_EARRAY_IDX_BLK_ELMTS 4
#define H5D_EARRAY_SUP_BLK_MIN_DATA_PTRS 4
#define H5D_EARRAY_DATA_BLK_MIN_ELMTS 16
#define H5D_EARRAY_MAX_DBLOCK_PAGE_NELMTS_BITS 10 /* i.e. 1024 elements per data block page */
/******************/
/* Local Typedefs */
/******************/
/* Extensible array callback context */
typedef struct H5D_earray_ctx_t {
size_t file_addr_len; /* Size of addresses in the file */
} H5D_earray_ctx_t;
/* User data for chunk callbacks */
typedef struct H5D_earray_ud_t {
H5F_t *f; /* File pointer for operation */
hid_t dxpl_id; /* DXPL ID for operation */
} H5D_earray_ud_t;
/* Native extensible array element for chunks w/filters */
typedef struct H5D_earray_filt_elmt_t {
haddr_t addr; /* Address of chunk */
uint32_t nbytes; /* Size of chunk (in file) */
uint32_t filter_mask; /* Excluded filters for chunk */
} H5D_earray_filt_elmt_t;
/********************/
/* Local Prototypes */
/********************/
/* Extensible array class callbacks for chunks w/o filters */
static void *H5D_earray_crt_context(void *udata);
static herr_t H5D_earray_dst_context(void *ctx);
static herr_t H5D_earray_fill(void *nat_blk, size_t nelmts);
static herr_t H5D_earray_encode(void *raw, const void *elmt, size_t nelmts,
void *ctx);
static herr_t H5D_earray_decode(const void *raw, void *elmt, size_t nelmts,
void *ctx);
static herr_t H5D_earray_debug(FILE *stream, int indent, int fwidth,
hsize_t idx, const void *elmt);
/* Extensible array class callbacks for chunks w/filters */
/* (some shared with callbacks for chunks w/o filters) */
static herr_t H5D_earray_filt_fill(void *nat_blk, size_t nelmts);
static herr_t H5D_earray_filt_encode(void *raw, const void *elmt, size_t nelmts,
void *ctx);
static herr_t H5D_earray_filt_decode(const void *raw, void *elmt, size_t nelmts,
void *ctx);
static herr_t H5D_earray_filt_debug(FILE *stream, int indent, int fwidth,
hsize_t idx, const void *elmt);
/* Chunked layout indexing callbacks */
static herr_t H5D_earray_idx_create(const H5D_chk_idx_info_t *idx_info);
static hbool_t H5D_earray_idx_is_space_alloc(const H5O_layout_t *layout);
static herr_t H5D_earray_idx_insert(const H5D_chk_idx_info_t *idx_info,
H5D_chunk_ud_t *udata);
static herr_t H5D_earray_idx_get_addr(const H5D_chk_idx_info_t *idx_info,
H5D_chunk_ud_t *udata);
static int H5D_earray_idx_iterate(const H5D_chk_idx_info_t *idx_info,
H5D_chunk_cb_func_t chunk_cb, void *chunk_udata);
static herr_t H5D_earray_idx_remove(const H5D_chk_idx_info_t *idx_info,
H5D_chunk_common_ud_t *udata);
static herr_t H5D_earray_idx_delete(const H5D_chk_idx_info_t *idx_info);
static herr_t H5D_earray_idx_copy_setup(const H5D_chk_idx_info_t *idx_info_src,
const H5D_chk_idx_info_t *idx_info_dst);
static herr_t H5D_earray_idx_copy_shutdown(H5O_layout_t *layout_src,
H5O_layout_t *layout_dst, hid_t dxpl_id);
static herr_t H5D_earray_idx_size(const H5D_chk_idx_info_t *idx_info,
hsize_t *size);
static herr_t H5D_earray_idx_reset(H5O_layout_t *layout);
static herr_t H5D_earray_idx_dump(const H5D_chk_idx_info_t *idx_info,
FILE *stream);
static herr_t H5D_earray_idx_dest(const H5D_chk_idx_info_t *idx_info);
/*********************/
/* Package Variables */
/*********************/
/* Extensible array indexed chunk I/O ops */
const H5D_chunk_ops_t H5D_COPS_EARRAY[1] = {{
NULL,
H5D_earray_idx_create,
H5D_earray_idx_is_space_alloc,
H5D_earray_idx_insert,
H5D_earray_idx_get_addr,
H5D_earray_idx_iterate,
H5D_earray_idx_remove,
H5D_earray_idx_delete,
H5D_earray_idx_copy_setup,
H5D_earray_idx_copy_shutdown,
H5D_earray_idx_size,
H5D_earray_idx_reset,
H5D_earray_idx_dump,
H5D_earray_idx_dest
}};
/*****************************/
/* Library Private Variables */
/*****************************/
/*******************/
/* Local Variables */
/*******************/
/* Extensible array class callbacks for dataset chunks w/o filters */
const H5EA_class_t H5EA_CLS_CHUNK[1]={{
H5EA_CLS_CHUNK_ID, /* Type of extensible array */
sizeof(haddr_t), /* Size of native element */
H5D_earray_crt_context, /* Create context */
H5D_earray_dst_context, /* Destroy context */
H5D_earray_fill, /* Fill block of missing elements callback */
H5D_earray_encode, /* Element encoding callback */
H5D_earray_decode, /* Element decoding callback */
H5D_earray_debug /* Element debugging callback */
}};
/* Extensible array class callbacks for dataset chunks w/filters */
const H5EA_class_t H5EA_CLS_FILT_CHUNK[1]={{
H5EA_CLS_FILT_CHUNK_ID, /* Type of extensible array */
sizeof(H5D_earray_filt_elmt_t), /* Size of native element */
H5D_earray_crt_context, /* Create context */
H5D_earray_dst_context, /* Destroy context */
H5D_earray_filt_fill, /* Fill block of missing elements callback */
H5D_earray_filt_encode, /* Element encoding callback */
H5D_earray_filt_decode, /* Element decoding callback */
H5D_earray_filt_debug /* Element debugging callback */
}};
/* Declare a free list to manage the H5D_earray_ctx_t struct */
H5FL_DEFINE_STATIC(H5D_earray_ctx_t);
/*-------------------------------------------------------------------------
* Function: H5D_earray_crt_context
*
* Purpose: Create context for callbacks
*
* Return: Success: non-NULL
* Failure: NULL
*
* Programmer: Quincey Koziol
* Thursday, January 29, 2009
*
*-------------------------------------------------------------------------
*/
static void *
H5D_earray_crt_context(void *_udata)
{
H5D_earray_ctx_t *ctx; /* Extensible array callback context */
H5F_t *f = (H5F_t *)_udata; /* User data for extensible array context */
void *ret_value; /* Return value */
FUNC_ENTER_NOAPI_NOINIT(H5D_earray_crt_context)
/* Sanity checks */
HDassert(f);
/* Allocate new context structure */
if(NULL == (ctx = H5FL_MALLOC(H5D_earray_ctx_t)))
HGOTO_ERROR(H5E_DATASET, H5E_CANTALLOC, NULL, "can't allocate extensible array client callback context")
/* Initialize the context */
ctx->file_addr_len = H5F_SIZEOF_ADDR(f);
/* Set return value */
ret_value = ctx;
done:
FUNC_LEAVE_NOAPI(ret_value)
} /* end H5D_earray_crt_context() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_dst_context
*
* Purpose: Destroy context for callbacks
*
* Return: Success: non-NULL
* Failure: NULL
*
* Programmer: Quincey Koziol
* Thursday, January 29, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_dst_context(void *_ctx)
{
H5D_earray_ctx_t *ctx = (H5D_earray_ctx_t *)_ctx; /* Extensible array callback context */
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5D_earray_dst_context)
/* Sanity checks */
HDassert(ctx);
/* Release context structure */
ctx = H5FL_FREE(H5D_earray_ctx_t, ctx);
FUNC_LEAVE_NOAPI(SUCCEED)
} /* end H5D_earray_dst_context() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_fill
*
* Purpose: Fill "missing elements" in block of elements
*
* Return: Success: non-negative
* Failure: negative
*
* Programmer: Quincey Koziol
* Tuesday, January 27, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_fill(void *nat_blk, size_t nelmts)
{
haddr_t fill_val = H5D_EARRAY_FILL; /* Value to fill elements with */
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5D_earray_fill)
/* Sanity checks */
HDassert(nat_blk);
HDassert(nelmts);
H5V_array_fill(nat_blk, &fill_val, H5EA_CLS_CHUNK->nat_elmt_size, nelmts);
FUNC_LEAVE_NOAPI(SUCCEED)
} /* end H5D_earray_fill() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_encode
*
* Purpose: Encode an element from "native" to "raw" form
*
* Return: Success: non-negative
* Failure: negative
*
* Programmer: Quincey Koziol
* Tuesday, January 27, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_encode(void *raw, const void *_elmt, size_t nelmts, void *_ctx)
{
H5D_earray_ctx_t *ctx = (H5D_earray_ctx_t *)_ctx; /* Extensible array callback context */
const haddr_t *elmt = (const haddr_t *)_elmt; /* Convenience pointer to native elements */
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5D_earray_encode)
/* Sanity checks */
HDassert(raw);
HDassert(elmt);
HDassert(nelmts);
HDassert(ctx);
/* Encode native elements into raw elements */
while(nelmts) {
/* Encode element */
/* (advances 'raw' pointer */
H5F_addr_encode_len(ctx->file_addr_len, (uint8_t **)&raw, *elmt);
/* Advance native element pointer */
elmt++;
/* Decrement # of elements to encode */
nelmts--;
} /* end while */
FUNC_LEAVE_NOAPI(SUCCEED)
} /* end H5D_earray_encode() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_decode
*
* Purpose: Decode an element from "raw" to "native" form
*
* Return: Success: non-negative
* Failure: negative
*
* Programmer: Quincey Koziol
* Thursday, January 29, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_decode(const void *_raw, void *_elmt, size_t nelmts, void *_ctx)
{
H5D_earray_ctx_t *ctx = (H5D_earray_ctx_t *)_ctx; /* Extensible array callback context */
haddr_t *elmt = (haddr_t *)_elmt; /* Convenience pointer to native elements */
const uint8_t *raw = (const uint8_t *)_raw; /* Convenience pointer to raw elements */
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5D_earray_decode)
/* Sanity checks */
HDassert(raw);
HDassert(elmt);
HDassert(nelmts);
/* Decode raw elements into native elements */
while(nelmts) {
/* Decode element */
/* (advances 'raw' pointer */
H5F_addr_decode_len(ctx->file_addr_len, &raw, elmt);
/* Advance native element pointer */
elmt++;
/* Decrement # of elements to decode */
nelmts--;
} /* end while */
FUNC_LEAVE_NOAPI(SUCCEED)
} /* end H5D_earray_decode() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_debug
*
* Purpose: Display an element for debugging
*
* Return: Success: non-negative
* Failure: negative
*
* Programmer: Quincey Koziol
* Thursday, January 29, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_debug(FILE *stream, int indent, int fwidth, hsize_t idx,
const void *elmt)
{
char temp_str[128]; /* Temporary string, for formatting */
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5D_earray_debug)
/* Sanity checks */
HDassert(stream);
HDassert(elmt);
/* Print element */
sprintf(temp_str, "Element #%llu:", (unsigned long long)idx);
HDfprintf(stream, "%*s%-*s %a\n", indent, "", fwidth, temp_str,
*(const haddr_t *)elmt);
FUNC_LEAVE_NOAPI(SUCCEED)
} /* end H5D_earray_debug() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_filt_fill
*
* Purpose: Fill "missing elements" in block of elements
*
* Return: Success: non-negative
* Failure: negative
*
* Programmer: Quincey Koziol
* Saturday, January 31, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_filt_fill(void *nat_blk, size_t nelmts)
{
H5D_earray_filt_elmt_t fill_val = H5D_EARRAY_FILT_FILL; /* Value to fill elements with */
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5D_earray_filt_fill)
/* Sanity checks */
HDassert(nat_blk);
HDassert(nelmts);
HDassert(sizeof(fill_val) == H5EA_CLS_FILT_CHUNK->nat_elmt_size);
H5V_array_fill(nat_blk, &fill_val, H5EA_CLS_FILT_CHUNK->nat_elmt_size, nelmts);
FUNC_LEAVE_NOAPI(SUCCEED)
} /* end H5D_earray_filt_fill() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_filt_encode
*
* Purpose: Encode an element from "native" to "raw" form
*
* Return: Success: non-negative
* Failure: negative
*
* Programmer: Quincey Koziol
* Saturday, January 31, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_filt_encode(void *_raw, const void *_elmt, size_t nelmts, void *_ctx)
{
H5D_earray_ctx_t *ctx = (H5D_earray_ctx_t *)_ctx; /* Extensible array callback context */
uint8_t *raw = (uint8_t *)_raw; /* Convenience pointer to raw elements */
const H5D_earray_filt_elmt_t *elmt = (const H5D_earray_filt_elmt_t *)_elmt; /* Convenience pointer to native elements */
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5D_earray_filt_encode)
/* Sanity checks */
HDassert(raw);
HDassert(elmt);
HDassert(nelmts);
HDassert(ctx);
/* Encode native elements into raw elements */
while(nelmts) {
/* Encode element */
/* (advances 'raw' pointer */
H5F_addr_encode_len(ctx->file_addr_len, &raw, elmt->addr);
UINT32ENCODE(raw, elmt->nbytes);
UINT32ENCODE(raw, elmt->filter_mask);
/* Advance native element pointer */
elmt++;
/* Decrement # of elements to encode */
nelmts--;
} /* end while */
FUNC_LEAVE_NOAPI(SUCCEED)
} /* end H5D_earray_filt_encode() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_filt_decode
*
* Purpose: Decode an element from "raw" to "native" form
*
* Return: Success: non-negative
* Failure: negative
*
* Programmer: Quincey Koziol
* Saturday, January 31, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_filt_decode(const void *_raw, void *_elmt, size_t nelmts, void *_ctx)
{
H5D_earray_ctx_t *ctx = (H5D_earray_ctx_t *)_ctx; /* Extensible array callback context */
H5D_earray_filt_elmt_t *elmt = (H5D_earray_filt_elmt_t *)_elmt; /* Convenience pointer to native elements */
const uint8_t *raw = (const uint8_t *)_raw; /* Convenience pointer to raw elements */
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5D_earray_filt_decode)
/* Sanity checks */
HDassert(raw);
HDassert(elmt);
HDassert(nelmts);
/* Decode raw elements into native elements */
while(nelmts) {
/* Decode element */
/* (advances 'raw' pointer */
H5F_addr_decode_len(ctx->file_addr_len, &raw, &elmt->addr);
UINT32DECODE(raw, elmt->nbytes);
UINT32DECODE(raw, elmt->filter_mask);
/* Advance native element pointer */
elmt++;
/* Decrement # of elements to decode */
nelmts--;
} /* end while */
FUNC_LEAVE_NOAPI(SUCCEED)
} /* end H5D_earray_filt_decode() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_filt_debug
*
* Purpose: Display an element for debugging
*
* Return: Success: non-negative
* Failure: negative
*
* Programmer: Quincey Koziol
* Saturday, January 31, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_filt_debug(FILE *stream, int indent, int fwidth, hsize_t idx,
const void *_elmt)
{
const H5D_earray_filt_elmt_t *elmt = (const H5D_earray_filt_elmt_t *)_elmt; /* Convenience pointer to native elements */
char temp_str[128]; /* Temporary string, for formatting */
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5D_earray_filt_debug)
/* Sanity checks */
HDassert(stream);
HDassert(elmt);
/* Print element */
sprintf(temp_str, "Element #%llu:", (unsigned long long)idx);
HDfprintf(stream, "%*s%-*s {%a, %u, %0x}\n", indent, "", fwidth, temp_str,
elmt->addr, elmt->nbytes, elmt->filter_mask);
FUNC_LEAVE_NOAPI(SUCCEED)
} /* end H5D_earray_filt_debug() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_open
*
* Purpose: Opens an existing extensible array and initializes
* the layout struct with information about the storage.
*
* Return: Success: non-negative
* Failure: negative
*
* Programmer: Quincey Koziol
* Thursday, January 29, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_idx_open(const H5D_chk_idx_info_t *idx_info)
{
const H5EA_class_t *cls; /* Extensible array class to use */
herr_t ret_value = SUCCEED; /* Return value */
FUNC_ENTER_NOAPI_NOINIT(H5D_earray_idx_open)
/* Check args */
HDassert(idx_info);
HDassert(idx_info->f);
HDassert(idx_info->pline);
HDassert(idx_info->layout);
HDassert(H5D_CHUNK_EARRAY == idx_info->layout->u.chunk.idx_type);
HDassert(H5F_addr_defined(idx_info->layout->u.chunk.u.earray.addr));
HDassert(NULL == idx_info->layout->u.chunk.u.earray.ea);
/* Open the extensible array for the chunk index */
cls = (idx_info->pline->nused > 0) ? H5EA_CLS_FILT_CHUNK : H5EA_CLS_CHUNK;
if(NULL == (idx_info->layout->u.chunk.u.earray.ea = H5EA_open(idx_info->f, idx_info->dxpl_id, idx_info->layout->u.chunk.u.earray.addr, cls, idx_info->f)))
HGOTO_ERROR(H5E_DATASET, H5E_CANTINIT, FAIL, "can't open extensible array")
done:
FUNC_LEAVE_NOAPI(ret_value)
} /* end H5D_earray_idx_open() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_create
*
* Purpose: Creates a new indexed-storage extensible array and initializes
* the layout struct with information about the storage. The
* struct should be immediately written to the object header.
*
* This function must be called before passing LAYOUT to any of
* the other indexed storage functions!
*
* Return: Non-negative on success (with the LAYOUT argument initialized
* and ready to write to an object header). Negative on failure.
*
* Programmer: Quincey Koziol
* Tuesday, January 27, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_idx_create(const H5D_chk_idx_info_t *idx_info)
{
H5EA_create_t cparam; /* Extensible array creation parameters */
herr_t ret_value = SUCCEED; /* Return value */
FUNC_ENTER_NOAPI_NOINIT(H5D_earray_idx_create)
/* Check args */
HDassert(idx_info);
HDassert(idx_info->f);
HDassert(idx_info->pline);
HDassert(idx_info->layout);
HDassert(!H5F_addr_defined(idx_info->layout->u.chunk.u.earray.addr));
HDassert(NULL == idx_info->layout->u.chunk.u.earray.ea);
/* General parameters */
if(idx_info->pline->nused > 0) {
cparam.cls = H5EA_CLS_FILT_CHUNK;
cparam.raw_elmt_size = (uint8_t)(H5F_SIZEOF_ADDR(idx_info->f) + 4 + 4);
} /* end if */
else {
cparam.cls = H5EA_CLS_CHUNK;
cparam.raw_elmt_size = (uint8_t)H5F_SIZEOF_ADDR(idx_info->f);
} /* end else */
cparam.max_nelmts_bits = H5D_EARRAY_MAX_NELMTS_BITS;
cparam.idx_blk_elmts = H5D_EARRAY_IDX_BLK_ELMTS;
cparam.sup_blk_min_data_ptrs = H5D_EARRAY_SUP_BLK_MIN_DATA_PTRS;
cparam.data_blk_min_elmts = H5D_EARRAY_DATA_BLK_MIN_ELMTS;
cparam.max_dblk_page_nelmts_bits = H5D_EARRAY_MAX_DBLOCK_PAGE_NELMTS_BITS;
/* Create the extensible array for the chunk index */
if(NULL == (idx_info->layout->u.chunk.u.earray.ea = H5EA_create(idx_info->f, idx_info->dxpl_id, &cparam, idx_info->f)))
HGOTO_ERROR(H5E_DATASET, H5E_CANTINIT, FAIL, "can't create extensible array")
/* Get the address of the extensible array in file */
if(H5EA_get_addr(idx_info->layout->u.chunk.u.earray.ea, &(idx_info->layout->u.chunk.u.earray.addr)) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTGET, FAIL, "can't query extensible array address")
done:
FUNC_LEAVE_NOAPI(ret_value)
} /* end H5D_earray_idx_create() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_is_space_alloc
*
* Purpose: Query if space is allocated for index method
*
* Return: Non-negative on success/Negative on failure
*
* Programmer: Quincey Koziol
* Thursday, January 29, 2009
*
*-------------------------------------------------------------------------
*/
static hbool_t
H5D_earray_idx_is_space_alloc(const H5O_layout_t *layout)
{
hbool_t ret_value; /* Return value */
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5D_earray_idx_is_space_alloc)
/* Check args */
HDassert(layout);
/* Set return value */
ret_value = (hbool_t)H5F_addr_defined(layout->u.chunk.u.earray.addr);
FUNC_LEAVE_NOAPI(ret_value)
} /* end H5D_earray_idx_is_space_alloc() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_insert
*
* Purpose: Create the chunk it if it doesn't exist, or reallocate the
* chunk if its size changed.
*
* Return: Non-negative on success/Negative on failure
*
* Programmer: Quincey Koziol
* Thursday, January 29, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_idx_insert(const H5D_chk_idx_info_t *idx_info, H5D_chunk_ud_t *udata)
{
H5EA_t *ea; /* Pointer to extensible array structure */
hsize_t idx; /* Array index of chunk */
herr_t ret_value = SUCCEED; /* Return value */
FUNC_ENTER_NOAPI_NOINIT(H5D_earray_idx_insert)
HDassert(idx_info);
HDassert(idx_info->f);
HDassert(idx_info->pline);
HDassert(idx_info->layout);
HDassert(idx_info->layout->u.chunk.ndims == 2); /* (for now) */
HDassert(H5F_addr_defined(idx_info->layout->u.chunk.u.earray.addr));
HDassert(udata);
/* Check if the extensible array is open yet */
if(NULL == idx_info->layout->u.chunk.u.earray.ea) {
/* Open the extensible array in file */
if(H5D_earray_idx_open(idx_info) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTOPENOBJ, FAIL, "can't open extensible array")
} /* end if */
/* Set convenience pointer to extensible array structure */
ea = idx_info->layout->u.chunk.u.earray.ea;
/* Compute array index for chunk offset */
idx = udata->common.offset[0] / idx_info->layout->u.chunk.dim[0];
/* Check for filters on chunks */
if(idx_info->pline->nused > 0) {
H5D_earray_filt_elmt_t elmt; /* Extensible array element */
hbool_t alloc_chunk = FALSE; /* Whether to allocate chunk */
/* Get the information for the chunk */
if(H5EA_get(ea, idx_info->dxpl_id, idx, &elmt) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTGET, FAIL, "can't get chunk info")
/* Check for previous chunk */
if(H5F_addr_defined(elmt.addr)) {
/* Sanity check */
HDassert(!H5F_addr_defined(udata->addr) || H5F_addr_eq(udata->addr, elmt.addr));
/* Check for chunk being same size */
if(udata->nbytes != elmt.nbytes) {
/* Release previous chunk */
H5_CHECK_OVERFLOW(elmt.nbytes, uint32_t, hsize_t);
if(H5MF_xfree(idx_info->f, H5FD_MEM_DRAW, idx_info->dxpl_id, elmt.addr, (hsize_t)elmt.nbytes) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTFREE, FAIL, "unable to free chunk")
elmt.addr = HADDR_UNDEF;
alloc_chunk = TRUE;
} /* end if */
else {
/* Don't need to reallocate chunk, but send its address back up */
if(!H5F_addr_defined(udata->addr))
udata->addr = elmt.addr;
} /* end else */
} /* end if */
else
alloc_chunk = TRUE;
/* Check if we need to allocate the chunk */
if(alloc_chunk) {
H5_CHECK_OVERFLOW(udata->nbytes, uint32_t, hsize_t);
udata->addr = H5MF_alloc(idx_info->f, H5FD_MEM_DRAW, idx_info->dxpl_id, (hsize_t)udata->nbytes);
if(!H5F_addr_defined(udata->addr))
HGOTO_ERROR(H5E_DATASET, H5E_CANTALLOC, FAIL, "unable to allocate chunk")
/* Update the element information */
elmt.addr = udata->addr;
elmt.nbytes = udata->nbytes;
elmt.filter_mask = udata->filter_mask;
/* Set the info for the chunk */
if(H5EA_set(ea, idx_info->dxpl_id, idx, &elmt) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTSET, FAIL, "can't set chunk info")
} /* end if */
} /* end if */
else {
HDassert(!H5F_addr_defined(udata->addr));
HDassert(udata->nbytes == idx_info->layout->u.chunk.size);
#ifndef NDEBUG
{
haddr_t addr = HADDR_UNDEF; /* Address of chunk in file */
/* Get the address for the chunk */
if(H5EA_get(ea, idx_info->dxpl_id, idx, &addr) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTGET, FAIL, "can't get chunk address")
HDassert(!H5F_addr_defined(addr));
}
#endif /* NDEBUG */
/*
* Allocate storage for the new chunk
*/
H5_CHECK_OVERFLOW(udata->nbytes, /*From: */uint32_t, /*To: */hsize_t);
udata->addr = H5MF_alloc(idx_info->f, H5FD_MEM_DRAW, idx_info->dxpl_id, (hsize_t)udata->nbytes);
if(!H5F_addr_defined(udata->addr))
HGOTO_ERROR(H5E_DATASET, H5E_CANTALLOC, FAIL, "file allocation failed")
/* Set the address for the chunk */
if(H5EA_set(ea, idx_info->dxpl_id, idx, &udata->addr) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTSET, FAIL, "can't set chunk address")
} /* end else */
HDassert(H5F_addr_defined(udata->addr));
done:
FUNC_LEAVE_NOAPI(ret_value)
} /* H5D_earray_idx_insert() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_get_addr
*
* Purpose: Get the file address of a chunk if file space has been
* assigned. Save the retrieved information in the udata
* supplied.
*
* Return: Non-negative on success/Negative on failure
*
* Programmer: Quincey Koziol
* Thursday, January 29, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_idx_get_addr(const H5D_chk_idx_info_t *idx_info, H5D_chunk_ud_t *udata)
{
H5EA_t *ea; /* Pointer to extensible array structure */
hsize_t idx; /* Array index of chunk */
herr_t ret_value = SUCCEED; /* Return value */
FUNC_ENTER_NOAPI_NOINIT(H5D_earray_idx_get_addr)
HDassert(idx_info);
HDassert(idx_info->f);
HDassert(idx_info->pline);
HDassert(idx_info->layout);
HDassert(idx_info->layout->u.chunk.ndims == 2); /* (for now) */
HDassert(H5F_addr_defined(idx_info->layout->u.chunk.u.earray.addr));
HDassert(udata);
/* Check if the extensible array is open yet */
if(NULL == idx_info->layout->u.chunk.u.earray.ea) {
/* Open the extensible array in file */
if(H5D_earray_idx_open(idx_info) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTOPENOBJ, FAIL, "can't open extensible array")
} /* end if */
/* Set convenience pointer to extensible array structure */
ea = idx_info->layout->u.chunk.u.earray.ea;
/* Compute array index for chunk offset */
idx = udata->common.offset[0] / idx_info->layout->u.chunk.dim[0];
/* Check for filters on chunks */
if(idx_info->pline->nused > 0) {
H5D_earray_filt_elmt_t elmt; /* Extensible array element */
/* Get the information for the chunk */
if(H5EA_get(ea, idx_info->dxpl_id, idx, &elmt) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTGET, FAIL, "can't get chunk info")
/* Set the info for the chunk */
udata->addr = elmt.addr;
udata->nbytes = elmt.nbytes;
udata->filter_mask = elmt.filter_mask;
} /* end if */
else {
/* Get the address for the chunk */
if(H5EA_get(ea, idx_info->dxpl_id, idx, &udata->addr) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTGET, FAIL, "can't get chunk address")
/* Update the other (constant) information for the chunk */
udata->nbytes = idx_info->layout->u.chunk.size;
udata->filter_mask = 0;
} /* end else */
done:
FUNC_LEAVE_NOAPI(ret_value)
} /* H5D_earray_idx_get_addr() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_iterate
*
* Purpose: Iterate over the chunks in an index, making a callback
* for each one.
*
* Note: This implementation is slow, particularly for sparse
* extensible arrays, replace it with call to H5EA_iterate()
* when that's available.
*
* Return: Non-negative on success/Negative on failure
*
* Programmer: Quincey Koziol
* Thursday, January 29, 2009
*
*-------------------------------------------------------------------------
*/
static int
H5D_earray_idx_iterate(const H5D_chk_idx_info_t *idx_info,
H5D_chunk_cb_func_t chunk_cb, void *chunk_udata)
{
H5EA_t *ea; /* Pointer to extensible array structure */
H5EA_stat_t ea_stat; /* Extensible array statistics */
int ret_value = H5_ITER_CONT; /* Return value */
FUNC_ENTER_NOAPI_NOINIT(H5D_earray_idx_iterate)
HDassert(idx_info);
HDassert(idx_info->f);
HDassert(idx_info->pline);
HDassert(idx_info->layout);
HDassert(H5F_addr_defined(idx_info->layout->u.chunk.u.earray.addr));
HDassert(chunk_cb);
HDassert(chunk_udata);
/* Check if the extensible array is open yet */
if(NULL == idx_info->layout->u.chunk.u.earray.ea) {
/* Open the extensible array in file */
if(H5D_earray_idx_open(idx_info) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTOPENOBJ, FAIL, "can't open extensible array")
} /* end if */
/* Set convenience pointer to extensible array structure */
ea = idx_info->layout->u.chunk.u.earray.ea;
/* Get the extensible array statistics */
if(H5EA_get_stats(ea, &ea_stat) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTGET, FAIL, "can't query extensible array statistics")
/* Check if there are any array elements */
if(ea_stat.stored.max_idx_set > 0) {
H5D_chunk_rec_t chunk_rec; /* Generic chunk record for callback */
hsize_t u; /* Local index variable */
/* Check for filters on chunks */
if(idx_info->pline->nused > 0) {
/* Prepare common fields of chunk record for callback */
HDmemset(&chunk_rec, 0, sizeof(chunk_rec));
/* Loop over array elements */
/* (Note: this may be too simple for datasets with >1 dimension) */
for(u = 0; u < ea_stat.stored.max_idx_set; u++, chunk_rec.offset[0] += idx_info->layout->u.chunk.dim[0]) {
H5D_earray_filt_elmt_t elmt; /* Extensible array element */
/* Get the info about the chunk for the index */
if(H5EA_get(ea, idx_info->dxpl_id, u, &elmt) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTGET, FAIL, "can't get chunk info")
/* Check if chunk exists */
if(H5F_addr_defined(elmt.addr)) {
/* Set chunk info for callback record */
chunk_rec.chunk_addr = elmt.addr;
chunk_rec.nbytes = elmt.nbytes;
chunk_rec.filter_mask = elmt.filter_mask;
/* Make chunk callback */
if((ret_value = (*chunk_cb)(&chunk_rec, chunk_udata)) < 0)
HERROR(H5E_DATASET, H5E_CALLBACK, "failure in generic chunk iterator callback");
} /* end if */
} /* end for */
} /* end if */
else {
/* Prepare common fields of chunk record for callback */
HDmemset(&chunk_rec, 0, sizeof(chunk_rec));
chunk_rec.nbytes = idx_info->layout->u.chunk.size;
chunk_rec.filter_mask = 0;
/* Loop over array elements */
/* (Note: this may be too simple for datasets with >1 dimension) */
for(u = 0; u < ea_stat.stored.max_idx_set; u++, chunk_rec.offset[0] += idx_info->layout->u.chunk.dim[0]) {
haddr_t addr; /* Chunk address */
/* Get the address of the chunk for the index */
if(H5EA_get(ea, idx_info->dxpl_id, u, &addr) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTGET, FAIL, "can't get chunk address")
/* Check if chunk exists */
if(H5F_addr_defined(addr)) {
/* Set chunk address for callback record */
chunk_rec.chunk_addr = addr;
/* Make chunk callback */
if((ret_value = (*chunk_cb)(&chunk_rec, chunk_udata)) < 0)
HERROR(H5E_DATASET, H5E_CALLBACK, "failure in generic chunk iterator callback");
} /* end if */
} /* end for */
} /* end else */
} /* end if */
done:
FUNC_LEAVE_NOAPI(ret_value)
} /* end H5D_earray_idx_iterate() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_remove
*
* Purpose: Remove chunk from index.
*
* Return: Non-negative on success/Negative on failure
*
* Programmer: Quincey Koziol
* Thursday, January 29, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_idx_remove(const H5D_chk_idx_info_t *idx_info, H5D_chunk_common_ud_t *udata)
{
H5EA_t *ea; /* Pointer to extensible array structure */
hsize_t idx; /* Array index of chunk */
herr_t ret_value = SUCCEED; /* Return value */
FUNC_ENTER_NOAPI_NOINIT(H5D_earray_idx_remove)
HDassert(idx_info);
HDassert(idx_info->f);
HDassert(idx_info->pline);
HDassert(idx_info->layout);
HDassert(H5F_addr_defined(idx_info->layout->u.chunk.u.earray.addr));
HDassert(udata);
/* Check if the extensible array is open yet */
if(NULL == idx_info->layout->u.chunk.u.earray.ea) {
/* Open the extensible array in file */
if(H5D_earray_idx_open(idx_info) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTOPENOBJ, FAIL, "can't open extensible array")
} /* end if */
/* Set convenience pointer to extensible array structure */
ea = idx_info->layout->u.chunk.u.earray.ea;
/* Compute array index for chunk offset */
idx = udata->offset[0] / idx_info->layout->u.chunk.dim[0];
/* Check for filters on chunks */
if(idx_info->pline->nused > 0) {
H5D_earray_filt_elmt_t elmt; /* Extensible array element */
/* Get the info about the chunk for the index */
if(H5EA_get(ea, idx_info->dxpl_id, idx, &elmt) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTGET, FAIL, "can't get chunk info")
/* Remove raw data chunk from file */
HDassert(H5F_addr_defined(elmt.addr));
H5_CHECK_OVERFLOW(elmt.nbytes, /*From: */uint32_t, /*To: */hsize_t);
if(H5MF_xfree(idx_info->f, H5FD_MEM_DRAW, idx_info->dxpl_id, elmt.addr, (hsize_t)elmt.nbytes) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTFREE, FAIL, "unable to free chunk")
/* Reset the info about the chunk for the index */
elmt.addr = HADDR_UNDEF;
elmt.nbytes = 0;
elmt.filter_mask = 0;
if(H5EA_set(ea, idx_info->dxpl_id, idx, &elmt) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTSET, FAIL, "unable to reset chunk info")
} /* end if */
else {
haddr_t addr = HADDR_UNDEF; /* Chunk address */
/* Get the address of the chunk for the index */
if(H5EA_get(ea, idx_info->dxpl_id, idx, &addr) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTGET, FAIL, "can't get chunk address")
/* Remove raw data chunk from file */
HDassert(H5F_addr_defined(addr));
H5_CHECK_OVERFLOW(idx_info->layout->u.chunk.size, /*From: */uint32_t, /*To: */hsize_t);
if(H5MF_xfree(idx_info->f, H5FD_MEM_DRAW, idx_info->dxpl_id, addr, (hsize_t)idx_info->layout->u.chunk.size) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTFREE, FAIL, "unable to free chunk")
/* Reset the address of the chunk for the index */
addr = HADDR_UNDEF;
if(H5EA_set(ea, idx_info->dxpl_id, idx, &addr) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTSET, FAIL, "unable to reset chunk address")
} /* end else */
done:
FUNC_LEAVE_NOAPI(ret_value)
} /* H5D_earray_idx_remove() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_delete_cb
*
* Purpose: Delete space for chunk in file
*
* Return: Success: Non-negative
* Failure: negative
*
* Programmer: Quincey Koziol
* Saturday, January 31, 2009
*
*-------------------------------------------------------------------------
*/
static int
H5D_earray_idx_delete_cb(const H5D_chunk_rec_t *chunk_rec, void *_udata)
{
H5D_earray_ud_t *udata = (H5D_earray_ud_t *)_udata; /* User data for callback */
int ret_value = H5_ITER_CONT; /* Return value */
FUNC_ENTER_NOAPI_NOINIT(H5D_earray_idx_delete_cb)
/* Sanity checks */
HDassert(chunk_rec);
HDassert(H5F_addr_defined(chunk_rec->chunk_addr));
HDassert(chunk_rec->nbytes > 0);
HDassert(udata);
HDassert(udata->f);
/* Remove raw data chunk from file */
H5_CHECK_OVERFLOW(chunk_rec->nbytes, /*From: */uint32_t, /*To: */hsize_t);
if(H5MF_xfree(udata->f, H5FD_MEM_DRAW, udata->dxpl_id, chunk_rec->chunk_addr, (hsize_t)chunk_rec->nbytes) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTFREE, H5_ITER_ERROR, "unable to free chunk")
done:
FUNC_LEAVE_NOAPI(ret_value)
} /* end H5D_earray_idx_delete_cb() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_delete
*
* Purpose: Delete index and raw data storage for entire dataset
* (i.e. all chunks)
*
* Note: This implementation is slow, particularly for sparse
* extensible arrays, replace it with call to H5EA_iterate()
* when that's available.
*
* Return: Success: Non-negative
* Failure: negative
*
* Programmer: Quincey Koziol
* Thursday, January 29, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_idx_delete(const H5D_chk_idx_info_t *idx_info)
{
herr_t ret_value = SUCCEED; /* Return value */
FUNC_ENTER_NOAPI_NOINIT(H5D_earray_idx_delete)
/* Sanity checks */
HDassert(idx_info);
HDassert(idx_info->f);
HDassert(idx_info->pline);
HDassert(idx_info->layout);
/* Check if the index data structure has been allocated */
if(H5F_addr_defined(idx_info->layout->u.chunk.u.earray.addr)) {
H5D_earray_ud_t udata; /* User data for callback */
/* Initialize user data for callback */
udata.f = idx_info->f;
udata.dxpl_id = idx_info->dxpl_id;
/* Iterate over the chunk addresses in the extensible array, deleting each chunk */
if(H5D_earray_idx_iterate(idx_info, H5D_earray_idx_delete_cb, &udata) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_BADITER, FAIL, "unable to iterate over chunk addresses")
/* Close extensible array */
if(H5EA_close(idx_info->layout->u.chunk.u.earray.ea, idx_info->dxpl_id) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTCLOSEOBJ, FAIL, "unable to close extensible array")
idx_info->layout->u.chunk.u.earray.ea = NULL;
/* Delete extensible array */
if(H5EA_delete(idx_info->f, idx_info->dxpl_id, idx_info->layout->u.chunk.u.earray.addr) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTDELETE, FAIL, "unable to delete chunk extensible array")
idx_info->layout->u.chunk.u.earray.addr = HADDR_UNDEF;
} /* end if */
else
HDassert(NULL == idx_info->layout->u.chunk.u.earray.ea);
done:
FUNC_LEAVE_NOAPI(ret_value)
} /* end H5D_earray_idx_delete() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_copy_setup
*
* Purpose: Set up any necessary information for copying chunks
*
* Return: Non-negative on success/Negative on failure
*
* Programmer: Quincey Koziol
* Saturday, January 31, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_idx_copy_setup(const H5D_chk_idx_info_t *idx_info_src,
const H5D_chk_idx_info_t *idx_info_dst)
{
H5EA_t *ea_src; /* Pointer to extensible array structure */
herr_t ret_value = SUCCEED; /* Return value */
FUNC_ENTER_NOAPI_NOINIT(H5D_earray_idx_copy_setup)
HDassert(idx_info_src);
HDassert(idx_info_src->f);
HDassert(idx_info_src->pline);
HDassert(idx_info_src->layout);
HDassert(idx_info_dst);
HDassert(idx_info_dst->f);
HDassert(idx_info_dst->pline);
HDassert(idx_info_dst->layout);
HDassert(!H5F_addr_defined(idx_info_dst->layout->u.chunk.u.earray.addr));
/* Check if the source extensible array is open yet */
if(NULL == idx_info_src->layout->u.chunk.u.earray.ea) {
/* Open the extensible array in file */
if(H5D_earray_idx_open(idx_info_src) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTOPENOBJ, FAIL, "can't open extensible array")
} /* end if */
/* Set convenience pointer to extensible array structure */
ea_src = idx_info_src->layout->u.chunk.u.earray.ea;
/* Create the extensible array that describes chunked storage in the dest. file */
if(H5D_earray_idx_create(idx_info_dst) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTINIT, FAIL, "unable to initialize chunked storage")
HDassert(H5F_addr_defined(idx_info_dst->layout->u.chunk.u.earray.addr));
done:
FUNC_LEAVE_NOAPI(ret_value)
} /* end H5D_earray_idx_copy_setup() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_copy_shutdown
*
* Purpose: Shutdown any information from copying chunks
*
* Return: Non-negative on success/Negative on failure
*
* Programmer: Quincey Koziol
* Saturday, January 31, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_idx_copy_shutdown(H5O_layout_t *layout_src, H5O_layout_t *layout_dst,
hid_t dxpl_id)
{
herr_t ret_value = SUCCEED; /* Return value */
FUNC_ENTER_NOAPI_NOINIT(H5D_earray_idx_copy_shutdown)
HDassert(layout_src);
HDassert(layout_src->u.chunk.u.earray.ea);
HDassert(layout_dst);
HDassert(layout_dst->u.chunk.u.earray.ea);
/* Close extensible arrays */
if(H5EA_close(layout_src->u.chunk.u.earray.ea, dxpl_id) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTCLOSEOBJ, FAIL, "unable to close extensible array")
layout_src->u.chunk.u.earray.ea = NULL;
if(H5EA_close(layout_dst->u.chunk.u.earray.ea, dxpl_id) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTCLOSEOBJ, FAIL, "unable to close extensible array")
layout_dst->u.chunk.u.earray.ea = NULL;
done:
FUNC_LEAVE_NOAPI(ret_value)
} /* end H5D_earray_idx_copy_shutdown() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_size
*
* Purpose: Retrieve the amount of index storage for chunked dataset
*
* Return: Success: Non-negative
* Failure: negative
*
* Programmer: Quincey Koziol
* Saturday, January 31, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_idx_size(const H5D_chk_idx_info_t *idx_info, hsize_t *index_size)
{
H5EA_t *ea; /* Pointer to extensible array structure */
H5EA_stat_t ea_stat; /* Extensible array statistics */
herr_t ret_value = SUCCEED; /* Return value */
FUNC_ENTER_NOAPI(H5D_earray_idx_size, FAIL)
/* Check args */
HDassert(idx_info);
HDassert(idx_info->f);
HDassert(idx_info->pline);
HDassert(idx_info->layout);
HDassert(H5F_addr_defined(idx_info->layout->u.chunk.u.earray.addr));
HDassert(index_size);
/* Open the extensible array in file */
if(H5D_earray_idx_open(idx_info) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTOPENOBJ, FAIL, "can't open extensible array")
/* Set convenience pointer to extensible array structure */
ea = idx_info->layout->u.chunk.u.earray.ea;
/* Get the extensible array statistics */
if(H5EA_get_stats(ea, &ea_stat) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTGET, FAIL, "can't query extensible array statistics")
/* Set the size of the extensible array */
*index_size = ea_stat.computed.hdr_size + ea_stat.computed.index_blk_size
+ ea_stat.stored.super_blk_size + ea_stat.stored.data_blk_size;
done:
if(idx_info->layout->u.chunk.u.earray.ea) {
if(H5EA_close(idx_info->layout->u.chunk.u.earray.ea, idx_info->dxpl_id) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTCLOSEOBJ, FAIL, "unable to close extensible array")
idx_info->layout->u.chunk.u.earray.ea = NULL;
} /* end if */
FUNC_LEAVE_NOAPI(ret_value)
} /* end H5D_earray_idx_size() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_reset
*
* Purpose: Reset indexing information.
*
* Return: Non-negative on success/Negative on failure
*
* Programmer: Quincey Koziol
* Saturday, January 31, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_idx_reset(H5O_layout_t *layout)
{
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5D_earray_idx_reset)
HDassert(layout);
/* Reset index info */
layout->u.chunk.u.earray.addr = HADDR_UNDEF;
layout->u.chunk.u.earray.ea = NULL;
FUNC_LEAVE_NOAPI(SUCCEED)
} /* end H5D_earray_idx_reset() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_dump
*
* Purpose: Dump indexing information to a stream.
*
* Return: Non-negative on success/Negative on failure
*
* Programmer: Quincey Koziol
* Saturday, January 31, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_idx_dump(const H5D_chk_idx_info_t *idx_info, FILE *stream)
{
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5D_earray_idx_dump)
HDassert(idx_info);
HDassert(idx_info->f);
HDassert(idx_info->layout);
HDassert(stream);
HDfprintf(stream, " Address: %a\n", idx_info->layout->u.chunk.u.earray.addr);
FUNC_LEAVE_NOAPI(SUCCEED)
} /* end H5D_earray_idx_dump() */
/*-------------------------------------------------------------------------
* Function: H5D_earray_idx_dest
*
* Purpose: Release indexing information in memory.
*
* Return: Non-negative on success/Negative on failure
*
* Programmer: Quincey Koziol
* Saturday, January 31, 2009
*
*-------------------------------------------------------------------------
*/
static herr_t
H5D_earray_idx_dest(const H5D_chk_idx_info_t *idx_info)
{
herr_t ret_value = SUCCEED; /* Return value */
FUNC_ENTER_NOAPI_NOINIT(H5D_earray_idx_dest)
HDassert(idx_info);
HDassert(idx_info->f);
HDassert(idx_info->layout);
/* Check if the extensible array is open */
if(idx_info->layout->u.chunk.u.earray.ea) {
if(H5EA_close(idx_info->layout->u.chunk.u.earray.ea, idx_info->dxpl_id) < 0)
HGOTO_ERROR(H5E_DATASET, H5E_CANTCLOSEOBJ, FAIL, "unable to close extensible array")
idx_info->layout->u.chunk.u.earray.ea = NULL;
} /* end if */
done:
FUNC_LEAVE_NOAPI(ret_value)
} /* end H5D_earray_idx_dest() */
|