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
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
|
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* 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. *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/*-------------------------------------------------------------------------
*
* Created: H5C2private.h
* 6/3/04
* John Mainzer
*
* Purpose: Constants and typedefs available to the rest of the
* library.
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
#ifndef _H5C2private_H
#define _H5C2private_H
#include "H5C2public.h" /* public prototypes */
/* Pivate headers needed by this header */
#include "H5private.h" /* Generic Functions */
#include "H5Fprivate.h" /* File access */
#define H5C2_DO_SANITY_CHECKS 1
#define H5C2_DO_EXTREME_SANITY_CHECKS 0
/* This sanity checking constant was picked out of the air. Increase
* or decrease it if appropriate. Its purposes is to detect corrupt
* object sizes, so it probably doesn't matter if it is a bit big.
*
* JRM - 5/17/04
*/
#define H5C2_MAX_ENTRY_SIZE ((size_t)(10 * 1024 * 1024))
/* H5C2_COLLECT_CACHE_STATS controls overall collection of statistics
* on cache activity. In general, this #define should be set to 0.
*/
#define H5C2_COLLECT_CACHE_STATS 1
/* H5C2_COLLECT_CACHE_ENTRY_STATS controls collection of statistics
* in individual cache entries.
*
* H5C2_COLLECT_CACHE_ENTRY_STATS should only be defined to true if
* H5C2_COLLECT_CACHE_STATS is also defined to true.
*/
#if H5C2_COLLECT_CACHE_STATS
#define H5C2_COLLECT_CACHE_ENTRY_STATS 1
#else
#define H5C2_COLLECT_CACHE_ENTRY_STATS 0
#endif /* H5C2_COLLECT_CACHE_STATS */
#ifdef H5_HAVE_PARALLEL
/* we must maintain the clean and dirty LRU lists when we are compiled
* with parallel support.
*/
#define H5C2_MAINTAIN_CLEAN_AND_DIRTY_LRU_LISTS 1
#else /* H5_HAVE_PARALLEL */
/* The clean and dirty LRU lists don't buy us anything here -- we may
* want them on for testing on occasion, but in general they should be
* off.
*/
#define H5C2_MAINTAIN_CLEAN_AND_DIRTY_LRU_LISTS 0 /* JRM */
#endif /* H5_HAVE_PARALLEL */
/* Typedef for the main structure for the cache (defined in H5C2pkg.h) */
typedef struct H5C2_t H5C2_t;
/***************************************************************************
*
* Struct H5C2_class_t
*
* Instances of H5C2_class_t are used to specify the callback functions
* used by the metadata cache for each class of metadata cache entry.
* The fields of the structure are discussed below:
*
* id: Integer field containing the unique ID of the class of metadata
* cache entries.
*
* name: Pointer to a string containing the name of the class of metadata
* cache entries.
*
* mem_type: Instance of H5FD_mem_t, that is used to supply the
* mem type passed into H5F_block_read().
*
* deserialize: Pointer to the deserialize function.
*
* This function must be able to read an on disk image of a metadata
* cache entry, allocate and load the equivalent in core representation,
* and return a pointer to that representation.
*
* The typedef for the deserialize callback is as follows:
*
* typedef void *(*H5C_deserialize_func_t)(haddr_t addr,
* size_t len,
* const void * image_ptr,
* void * udata_ptr,
* boolean * dirty_ptr);
*
* The parameters of the deserialize callback are as follows:
*
* addr: Base address in file of the image to be deserialized.
*
* This parameter is supplied mainly for sanity checking.
* Sanity checks should be performed when compiled in debug
* mode, but the parameter may be unused when compiled in
* production mode.
*
* len: Length in bytes of the in file image to be deserialized.
*
* This parameter is supplied mainly for sanity checking.
* Sanity checks should be performed when compiled in debug
* mode, but the parameter may be unused when compiled in
* production mode.
*
* image_ptr: Pointer to a buffer of length len containing the
* contents of the file starting at addr and continuing
* for len bytes.
*
* udata_ptr: Pointer to user data provided in the protect call, which
* must be passed through to the deserialize callback.
*
* dirty_ptr: Pointer to boolean which the deserialize function
* must use to mark the entry dirty if it has to modify
* the entry to clean up file corruption left over from
* an old bug in the HDF5 library.
*
* Processing in the deserialize function should proceed as follows:
*
* If the image contains valid data, and is of the correct length,
* the deserialize function must allocate space for an in core
* representation of that data, load the contents of the image into
* the space allocated for the in core representation, and return
* a pointer to the in core representation. Observe that an
* instance of H5C2_cache_entry_t must be the first item in this
* representation. It will have to be initialized appropriately
* after the callback returns.
*
* Note that the structure of the in core representation is otherwise
* up to the cache client. All that is required is that the pointer
* returned be sufficient for the clients purposes when it is returned
* on a protect call.
*
* If the deserialize function has to clean up file corruption
* left over from an old bug in the HDF5 library, it must set
* *dirty_ptr to TRUE. If it doesn't, no action is needed as
* *dirty_ptr will be set to FALSE before the deserialize call.
*
* If the operation fails for any reason (i.e. bad data in buffer, bad
* buffer length, malloc failure, etc.) the function must return NULL and
* push error information on the error stack with the error API routines.
*
* If the protect call which occasioned the call to the deserialize
* callback had the check length flag set, after the deserialize call
* returns, the cache must call the image_len callback (see below) and
* update its on disk image length accordingly.
*
*
* image_len: Pointer to the image length callback.
*
* In the best of all possible worlds, we would not have this callback.
* It exists to allow clients to reduce the size of the on disk image of
* an entry in the deserialize callback.
*
* The typedef for the image_len callback is as follows:
*
* typedef herr_t (*H5C_image_len_func_t)(void *thing,
* size_t *image_len_ptr);
*
* The parameters of the image_len callback are as follows:
*
* thing: Pointer to the in core representation of the entry.
*
* image_len_ptr: Pointer to size_t in which the callback will return
* the length of the on disk image of the cache entry.
*
* Processing in the image_len function should proceed as follows:
*
* If successful, the function will place the length of the on disk
* image associated with the in core representation provided in the
* thing parameter in *image_len_ptr, and then return SUCCEED.
*
* On failure, the function must return FAIL and push error information
* onto the error stack with the error API routines.
*
*
* serialize: Pointer to the serialize callback.
*
* The serialize callback is invoked by the metadata cache whenever
* it needs a current on disk image of the metadata entry for purposes
* either constructing a journal or flushing the entry to disk.
*
* At this point, one would think that the base address and length of
* the length of the entry's image on disk would be well known.
* However, that need not be the case as fractal heap blocks can
* change size (and therefor possible location as well) on
* serialization if compression is enabled. In the old H5C code,
* this happened on a flush, and occasioned a rename in the midst
* of the flush. To avoid this in H5C2, the serialize callback
* will return the new base address, length, and image pointer to
* the caller when necessary. The caller must then update the
* metadata cache's internal structures accordingly.
*
* The typedef for the serialize callback is as follows:
*
* typedef herr_t (*H5C_serialize_func_t)(haddr_t addr,
* size_t len,
* void * image_ptr,
* void * thing,
* unsigned * flags_ptr,
* haddr_t * new_addr_ptr,
* size_t * new_len_ptr,
* void ** new_image_ptr_ptr);
*
* The parameters of the serialize callback are as follows:
*
* addr: Base address in file of the entry to be serialized.
*
* This parameter is supplied mainly for sanity checking.
* Sanity checks should be performed when compiled in debug
* mode, but the parameter may be unused when compiled in
* production mode.
*
* len: Length in bytes of the in file image of the entry to be
* serialized. Also the size of *image_ptr (below).
*
* This parameter is supplied mainly for sanity checking.
* Sanity checks should be performed when compiled in debug
* mode, but the parameter may be unused when compiled in
* production mode.
*
* image_ptr: Pointer to a buffer of length len bytes into which a
* serialized image of the target metadata cache entry is
* to be written.
*
* Note that this buffer will not in general be initialized
* to any particular value. Thus the serialize function may
* not assume any initial value and must set each byte in
* the buffer.
*
* thing: Pointer to void containing the address of the in core
* representation of the target metadata cache entry.
* This is the same pointer returned by a protect of the
* addr and len given above.
*
* flags_ptr: Pointer to an unsigned integer used to return flags
* indicating whether the resize function resized or renamed
* the entry. If the entry was neither resized or renamed,
* the serialize function must set *flags_ptr to zero.
* H5C2__SERIALIZE_RESIZED_FLAG and H5C2__SERIALIZE_RENAMED_FLAG
* must be set to indicate a resize and a rename respectively.
*
* If the H5C2__SERIALIZE_RESIZED_FLAG is set, the new length
* and image pointer must be stored in *new_len_ptr and
* *new_image_ptr_ptr respectively.
*
* If the H5C2__SERIALIZE_RENAMED_FLAG flag is also set, the
* new image base address must be stored in *new_addr_ptr.
* Observe that the H5C2__SERIALIZE_RENAMED_FLAG must not
* appear without the H5C2__SERIALIZE_RESIZED_FLAG.
*
* Except as noted above, the locations pointed to by the
* remaining parameters are undefined, and should be ignored
* by the caller.
*
* new_addr_ptr: Pointer to haddr_t. If the entry is renamed by
* the serialize function, the new on disk base address must
* be stored in *new_addr_ptr. If the entry is not renamed
* by the serialize function, *new_addr_ptr is undefined.
*
* new_len_ptr: Pointer to size_t. If the entry is resized by the
* serialize function, the new length of the on disk image
* must be stored in *new_len_ptr. If the entry is not
* resized by the serialize function, *new_len_ptr is
* undefined.
*
* new_image_ptr_ptr: Pointer to pointer to void. If the entry is
* resized by the serialize function, the pointer to the
* new buffer containing the on disk image must be stored
* in *new_image_ptr_ptr. If the entry is not resized by
* the serialize function, *new_image_ptr_ptr is undefined.
*
* Processing in the serialize function should proceed as follows:
*
* The serialize function must examine the in core representation
* indicated by the thing parameter, and write a serialized image
* of its contents into the provided buffer.
*
* If the serialize function does not change the size or location
* of the on disk image, it must set *flags_ptr to zero.
*
* If the size of the on disk image must be changed, the serialize
* function must free the old image buffer (base address in image_ptr),
* allocate a new one, load the image into the new buffer, load the
* base address of the new buffer into *new_image_ptr_ptr, load the
* length of the new image into *new_len_ptr, and set the
* H5C2__SERIALIZE_RESIZED_FLAG in *flags_ptr.
*
* If in addition, the base address of the on disk image must
* be changed, the serialize function must also set *new_addr_ptr
* to the new base address, and set the H5C2__SERIALIZE_RENAMED_FLAG
* in *flags_ptr.
*
* If it is successful, the function must return SUCCEED.
*
* If it fails for any reason, the function must return FAIL and
* push error information on the error stack with the error API
* routines.
*
*
* free_icr: Pointer to the free ICR Callback.
*
* The free ICR callback is invoked by the metadata cache when it
* wishes to evict an entry, and needs the client to free the memory
* allocated for the in core representation.
*
* The typedef for the free ICR callback is as follows:
*
* typedef herr_t (*N5C_free_icr_func_t)(haddr_t addr,
* size_t len,
* void * thing);
*
* The parameters of the free ICR callback are as follows:
*
* addr: Base address in file of the entry being evicted.
*
* This parameter is supplied mainly for sanity checking.
* Sanity checks should be performed when compiled in debug
* mode, but the parameter may be unused when compiled in
* production mode.
*
* len: Length of the in file image of the entry being evicted
* in bytes.
*
* This parameter is supplied mainly for sanity checking.
* Sanity checks should be performed when compiled in debug
* mode, but the parameter may be unused when compiled in
* production mode.
*
* thing: Pointer to void containing the address of the in core
* representation of the target metadata cache entry. This
* is the same pointer that would be returned by a protect
* of the addr and len above.
*
* Processing in the free ICR function should proceed as follows:
*
* The free ICR function must free all memory allocated to the
* in core representation.
*
* If the function is successful, it must return SUCCEED.
*
* If it fails for any reason, the function must return FAIL and
* push error information on the error stack with the error API
* routines.
*
* At least when compiled with debug, it would be useful if the
* free ICR call would fail if the in core representation has been
* modified since the last serialize of clear callback.
*
*
* clear_dirty_bits: Pointer to the clear dirty bits callback.
*
* For sanity checking purposes, it will be useful if cache clients
* track whether an in core representation has been modified since
* the last time it was serialized. This data is used to flag an
* error if the cache attempts to free an in core representation
* that has not been serialized since the last time it was modified.
*
* If this happens, either the client forgot to tell the cache that
* an entry is dirty, or the cache forgot to flush a dirty entry
* before evicting it. In either case we want to know before we
* get file corruption complaints.
*
* However, in some cases, we want to mark an entry as clean even
* though it has not been flushed to disk -- most particularly in
* the parallel case. Thus we need some way to tell the client
* that a free of the associated ICR is OK even though it has
* been modified since the last serialization. Hence the clear
* dirty bits callback.
*
* Since the clear dirty bits callback is purely for sanity checking,
* it is called only when we compile with debug.
*
* The typedef for the clear callback is as follows:
*
* typedef herr_t (*N5C_clear_dirty_bits_func_t)(haddr_t addr,
* size_t len,
* void * thing);
*
* The parameters of the clear callback are as follows:
*
* addr: Base address in file of the entry whose dirty bits
* are being cleared
*
* len: Length in bytes of the in file image of the entry
* whose dirty bits are being cleared.
*
* thing: Pointer to void containing the address of the in
* core representation of the target metadata cache entry.
* This is the same pointer that would be returned by a
* protect of the addr and len above.
*
* Processing in the clear callback function should proceed as follows:
*
* The function must clear any dirty bits associated with the ICR.
*
* If successful, the function must return SUCCEED.
*
* If it fails for any reason, the function must return FAIL and
* push error information on the error stack with the error API
* routines.
*
***************************************************************************/
typedef void *(*H5C2_deserialize_func_t)(haddr_t addr,
size_t len,
const void * image_ptr,
const void * udata_ptr,
hbool_t * dirty_ptr);
typedef herr_t (*H5C2_image_len_func_t)(void *thing,
size_t *image_len_ptr);
#define H5C2__SERIALIZE_RESIZED_FLAG 0x1
#define H5C2__SERIALIZE_RENAMED_FLAG 0x2
typedef herr_t (*H5C2_serialize_func_t)(haddr_t addr,
size_t len,
void * image_ptr,
void * thing,
unsigned * flags_ptr,
haddr_t * new_addr_ptr,
size_t * new_len_ptr,
void ** new_image_ptr_ptr);
typedef herr_t (*H5C2_free_icr_func_t)(haddr_t addr,
size_t len,
void * thing);
typedef herr_t (*H5C2_clear_dirty_bits_func_t)(haddr_t addr,
size_t len,
void * thing);
typedef struct H5C2_class_t {
int id;
const char * name;
H5FD_mem_t mem_type;
H5C2_deserialize_func_t deserialize;
H5C2_image_len_func_t image_len;
H5C2_serialize_func_t serialize;
H5C2_free_icr_func_t free_icr;
H5C2_clear_dirty_bits_func_t clear_dirty_bits;
} H5C2_class_t;
/* Type defintions of call back functions used by the cache as a whole */
typedef herr_t (*H5C2_write_permitted_func_t)(const H5F_t *f,
hid_t dxpl_id,
hbool_t * write_permitted_ptr);
typedef herr_t (*H5C2_log_flush_func_t)(H5C2_t * cache_ptr,
haddr_t addr,
hbool_t was_dirty,
unsigned flags,
int type_id);
/* Upper and lower limits on cache size. These limits are picked
* out of a hat -- you should be able to change them as necessary.
*
* However, if you need a very big cache, you should also increase the
* size of the hash table (H5C2__HASH_TABLE_LEN in H5C2pkg.h). The current
* upper bound on cache size is rather large for the current hash table
* size.
*/
#define H5C2__MAX_MAX_CACHE_SIZE ((size_t)(128 * 1024 * 1024))
#define H5C2__MIN_MAX_CACHE_SIZE ((size_t)(1024))
/* Default max cache size and min clean size are give here to make
* them generally accessable.
*/
#define H5C2__DEFAULT_MAX_CACHE_SIZE ((size_t)(4 * 1024 * 1024))
#define H5C2__DEFAULT_MIN_CLEAN_SIZE ((size_t)(2 * 1024 * 1024))
/****************************************************************************
*
* structure H5C2_cache_entry_t
*
* Instances of the H5C2_cache_entry_t structure are used to store cache
* entries in a hash table and sometimes in a skip list.
* See H5SL.c for the particulars of the skip list.
*
* In typical application, this structure is the first field in a
* structure to be cached. For historical reasons, the external module
* is responsible for managing the is_dirty field (this is no longer
* completely true. See the comment on the is_dirty field for details).
* All other fields are managed by the cache.
*
* The fields of this structure are discussed individually below:
*
* JRM - 4/26/04
*
* magic: Unsigned 32 bit integer that must always be set to
* H5C2__H5C2_CACHE_ENTRY_T_MAGIC when the entry is valid.
* The field must be set to H5C2__H5C2_CACHE_ENTRY_T_BAD_MAGIC
* just before the entry is freed.
*
* This is necessary, as the LRU list can be changed out
* from under H5C2_make_space_in_cache() by the serialize
* callback which may change the size of an existing entry,
* and/or load a new entry while serializing the target entry.
*
* This in turn can cause a recursive call to
* H5C2_make_space_in_cache() which may either flush or evict
* the next entry that the first invocation of that function
* was about to examine.
*
* The magic field allows H5C2_make_space_in_cache() to
* detect this case, and re-start its scan from the bottom
* of the LRU when this situation occurs.
*
* addr: Base address of the cache entry on disk.
*
* size: Length of the cache entry on disk. Note that unlike normal
* caches, the entries in this cache are of variable length.
* The entries should never overlap, and when we do writebacks,
* we will want to writeback adjacent entries where possible.
*
* NB: At present, entries need not be contiguous on disk. Until
* we fix this, we can't do much with writing back adjacent
* entries.
*
* Update: This has now been changed -- all metadata cache
* entries must now be associated with a single contiguous
* block of memory on disk. The image of this block (i.e.
* the on disk image) is stored in *image_ptr (discussed below).
*
* image_ptr: Pointer to void. When not NULL, this field points to a
* dynamically allocated block of size bytes in which the
* on disk image of the metadata cache entry is stored.
*
* If the entry is dirty, the serialize callback must be used
* to update this image before it is written to disk
*
* type: Pointer to the instance of H5C2_class_t containing pointers
* to the methods for cache entries of the current type. This
* field should be NULL when the instance of H5C2_cache_entry_t
* is not in use.
*
* The name is not particularly descriptive, but is retained
* to avoid changes in existing code.
*
* is_dirty: Boolean flag indicating whether the contents of the cache
* entry has been modified since the last time it was written
* to disk.
*
* NOTE: For historical reasons, this field is not maintained
* by the cache. Instead, the module using the cache
* sets this flag when it modifies the entry, and the
* flush and clear functions supplied by that module
* reset the dirty when appropriate.
*
* This is a bit quirky, so we may want to change this
* someday. However it will require a change in the
* cache interface.
*
* Update: Management of the is_dirty field has been largely
* moved into the cache. The only remaining exceptions
* are the flush and clear functions supplied by the
* modules using the cache. These still clear the
* is_dirty field as before. -- JRM 7/5/05
*
* Update: Management of the is_dirty field is now entirely
* in the cache. -- JRM 7/5/07
*
* dirtied: Boolean flag used to indicate that the entry has been
* dirtied while protected.
*
* This field is set to FALSE in the protect call, and may
* be set to TRUE by the
* H5C2_mark_pinned_or_protected_entry_dirty()
* call at an time prior to the unprotect call.
*
* The H5C2_mark_pinned_or_protected_entry_dirty() call exists
* as a convenience function for the fractal heap code which
* may not know if an entry is protected or pinned, but knows
* that is either protected or pinned. The dirtied field was
* added as in the parallel case, it is necessary to know
* whether a protected entry was dirty prior to the protect call.
*
* is_protected: Boolean flag indicating whether this entry is protected
* (or locked, to use more conventional terms). When it is
* protected, the entry cannot be flushed or accessed until
* it is unprotected (or unlocked -- again to use more
* conventional terms).
*
* Note that protected entries are removed from the LRU lists
* and inserted on the protected list.
*
* is_read_only: Boolean flag that is only meaningful if is_protected is
* TRUE. In this circumstance, it indicates whether the
* entry has been protected read only, or read/write.
*
* If the entry has been protected read only (i.e. is_protected
* and is_read_only are both TRUE), we allow the entry to be
* protected more than once.
*
* In this case, the number of readers is maintained in the
* ro_ref_count field (see below), and unprotect calls simply
* decrement that field until it drops to zero, at which point
* the entry is actually unprotected.
*
* ro_ref_count: Integer field used to maintain a count of the number of
* outstanding read only protects on this entry. This field
* must be zero whenever either is_protected or is_read_only
* are TRUE.
*
* is_pinned: Boolean flag indicating whether the entry has been pinned
* in the cache.
*
* For very hot entries, the protect / unprotect overhead
* can become excessive. Thus the cache has been extended
* to allow an entry to be "pinned" in the cache.
*
* Pinning an entry in the cache has several implications:
*
* 1) A pinned entry cannot be evicted. Thus unprotected
* pinned entries must be stored in the pinned entry
* list, instead of being managed by the replacement
* policy code (LRU at present).
*
* 2) A pinned entry can be accessed or modified at any time.
* Therefore, the cache must check with the entry owner
* before flushing it. If permission is denied, the
* cache does not flush the entry.
*
* 3) A pinned entry can be marked as dirty (and possibly
* change size) while it is unprotected.
*
* 4) The flush-destroy code must allow pinned entries to
* be unpinned (and possibly unprotected) during the
* flush.
*
* JRM -- 3/16/06
*
* in_slist: Boolean flag indicating whether the entry is in the skip list
* As a general rule, entries are placed in the list when they
* are marked dirty. However they may remain in the list after
* being flushed.
*
* Update: Dirty entries are now removed from the skip list
* when they are flushed.
*
* flush_marker: Boolean flag indicating that the entry is to be flushed
* the next time H5C2_flush_cache() is called with the
* H5AC__FLUSH_MARKED_ENTRIES_FLAG. The flag is reset when
* the entry is flushed for whatever reason.
*
* clear_on_unprotect: Boolean flag used only in PHDF5. When H5C2 is used
* to implement the metadata cache In the parallel case, only
* the cache with mpi rank 0 is allowed to actually write to
* file -- all other caches must retain dirty entries until they
* are advised that the entry is clean.
*
* This flag is used in the case that such an advisory is
* received when the entry is protected. If it is set when an
* entry is unprotected, and the dirtied flag is not set in
* the unprotect, the entry's is_dirty flag is reset by flushing
* it with the H5C2__FLUSH_CLEAR_ONLY_FLAG.
*
* flush_in_progress: Boolean flag that is set to true iff the entry
* is in the process of being flushed. This allows the cache
* to detect when a call is the result of a flush callback.
*
* destroy_in_progress: Boolean flag that is set to true iff the entry
* is in the process of being flushed and destroyed.
*
*
* Fields supporting the hash table:
*
* Fields in the cache are indexed by a more or less conventional hash table.
* If there are multiple entries in any hash bin, they are stored in a doubly
* linked list.
*
* ht_next: Next pointer used by the hash table to store multiple
* entries in a single hash bin. This field points to the
* next entry in the doubly linked list of entries in the
* hash bin, or NULL if there is no next entry.
*
* ht_prev: Prev pointer used by the hash table to store multiple
* entries in a single hash bin. This field points to the
* previous entry in the doubly linked list of entries in
* the hash bin, or NULL if there is no previuos entry.
*
*
* Fields supporting replacement policies:
*
* The cache must have a replacement policy, and it will usually be
* necessary for this structure to contain fields supporting that policy.
*
* While there has been interest in several replacement policies for
* this cache, the initial development schedule is tight. Thus I have
* elected to support only a modified LRU policy for the first cut.
*
* When additional replacement policies are added, the fields in this
* section will be used in different ways or not at all. Thus the
* documentation of these fields is repeated for each replacement policy.
*
* Modified LRU:
*
* When operating in parallel mode, we must ensure that a read does not
* cause a write. If it does, the process will hang, as the write will
* be collective and the other processes will not know to participate.
*
* To deal with this issue, I have modified the usual LRU policy by adding
* clean and dirty LRU lists to the usual LRU list. When reading in
* parallel mode, we evict from the clean LRU list only. This implies
* that we must try to ensure that the clean LRU list is reasonably well
* stocked. See the comments on H5C2_t in H5C2pkg.h for more details.
*
* Note that even if we start with a completely clean cache, a sequence
* of protects without unprotects can empty the clean LRU list. In this
* case, the cache must grow temporarily. At the next write, we will
* attempt to evict enough entries to get the cache down to its nominal
* maximum size.
*
* The use of the replacement policy fields under the Modified LRU policy
* is discussed below:
*
* next: Next pointer in either the LRU or the protected list,
* depending on the current value of protected. If there
* is no next entry on the list, this field should be set
* to NULL.
*
* prev: Prev pointer in either the LRU or the protected list,
* depending on the current value of protected. If there
* is no previous entry on the list, this field should be
* set to NULL.
*
* aux_next: Next pointer on either the clean or dirty LRU lists.
* This entry should be NULL when protected is true. When
* protected is false, and dirty is true, it should point
* to the next item on the dirty LRU list. When protected
* is false, and dirty is false, it should point to the
* next item on the clean LRU list. In either case, when
* there is no next item, it should be NULL.
*
* aux_prev: Previous pointer on either the clean or dirty LRU lists.
* This entry should be NULL when protected is true. When
* protected is false, and dirty is true, it should point
* to the previous item on the dirty LRU list. When protected
* is false, and dirty is false, it should point to the
* previous item on the clean LRU list. In either case, when
* there is no previous item, it should be NULL.
*
*
* Cache entry stats collection fields:
*
* These fields should only be compiled in when both H5C2_COLLECT_CACHE_STATS
* and H5C2_COLLECT_CACHE_ENTRY_STATS are true. When present, they allow
* collection of statistics on individual cache entries.
*
* accesses: int32_t containing the number of times this cache entry has
* been referenced in its lifetime.
*
* clears: int32_t containing the number of times this cache entry has
* been cleared in its life time.
*
* flushes: int32_t containing the number of times this cache entry has
* been flushed to file in its life time.
*
* pins: int32_t containing the number of times this cache entry has
* been pinned in cache in its life time.
*
****************************************************************************/
#ifndef NDEBUG
#define H5C2__H5C2_CACHE_ENTRY_T_MAGIC 0x005CAC0A
#define H5C2__H5C2_CACHE_ENTRY_T_BAD_MAGIC 0xDeadBeef
#endif /* NDEBUG */
typedef struct H5C2_cache_entry_t
{
#ifndef NDEBUG
uint32_t magic;
#endif /* NDEBUG */
haddr_t addr;
size_t size;
void * image_ptr;
const H5C2_class_t * type;
hbool_t is_dirty;
hbool_t dirtied;
hbool_t is_protected;
hbool_t is_read_only;
int ro_ref_count;
hbool_t is_pinned;
hbool_t in_slist;
hbool_t flush_marker;
#ifdef H5_HAVE_PARALLEL
hbool_t clear_on_unprotect;
#endif /* H5_HAVE_PARALLEL */
hbool_t flush_in_progress;
hbool_t destroy_in_progress;
/* fields supporting the hash table: */
struct H5C2_cache_entry_t * ht_next;
struct H5C2_cache_entry_t * ht_prev;
/* fields supporting replacement policies: */
struct H5C2_cache_entry_t * next;
struct H5C2_cache_entry_t * prev;
struct H5C2_cache_entry_t * aux_next;
struct H5C2_cache_entry_t * aux_prev;
#if H5C2_COLLECT_CACHE_ENTRY_STATS
/* cache entry stats fields */
int32_t accesses;
int32_t clears;
int32_t flushes;
int32_t pins;
#endif /* H5C2_COLLECT_CACHE_ENTRY_STATS */
} H5C2_cache_entry_t;
/****************************************************************************
*
* structure H5C2_auto_size_ctl_t
*
* Instances of H5C2_auto_size_ctl_t are used to get and set the control
* fields for automatic cache re-sizing.
*
* The fields of the structure are discussed individually below:
*
* version: Integer field containing the version number of this version
* of the H5C2_auto_size_ctl_t structure. Any instance of
* H5C2_auto_size_ctl_t passed to the cache must have a known
* version number, or an error will be flagged.
*
* report_fcn: Pointer to the function that is to be called to report
* activities each time the auto cache resize code is executed. If the
* field is NULL, no call is made.
*
* If the field is not NULL, it must contain the address of a function
* of type H5C2_auto_resize_report_fcn.
*
* set_initial_size: Boolean flag indicating whether the size of the
* initial size of the cache is to be set to the value given in
* the initial_size field. If set_initial_size is FALSE, the
* initial_size field is ignored.
*
* initial_size: If enabled, this field contain the size the cache is
* to be set to upon receipt of this structure. Needless to say,
* initial_size must lie in the closed interval [min_size, max_size].
*
* min_clean_fraction: double in the range 0 to 1 indicating the fraction
* of the cache that is to be kept clean. This field is only used
* in parallel mode. Typical values are 0.1 to 0.5.
*
* max_size: Maximum size to which the cache can be adjusted. The
* supplied value must fall in the closed interval
* [MIN_MAX_CACHE_SIZE, MAX_MAX_CACHE_SIZE]. Also, max_size must
* be greater than or equal to min_size.
*
* min_size: Minimum size to which the cache can be adjusted. The
* supplied value must fall in the closed interval
* [MIN_MAX_CACHE_SIZE, MAX_MAX_CACHE_SIZE]. Also, min_size must
* be less than or equal to max_size.
*
* epoch_length: Number of accesses on the cache over which to collect
* hit rate stats before running the automatic cache resize code,
* if it is enabled.
*
* At the end of an epoch, we discard prior hit rate data and start
* collecting afresh. The epoch_length must lie in the closed
* interval [H5C2__MIN_AR_EPOCH_LENGTH, H5C2__MAX_AR_EPOCH_LENGTH].
*
*
* Cache size increase control fields:
*
* incr_mode: Instance of the H5C2_cache_incr_mode enumerated type whose
* value indicates how we determine whether the cache size should be
* increased. At present there are two possible values:
*
* H5C2_incr__off: Don't attempt to increase the size of the cache
* automatically.
*
* When this increment mode is selected, the remaining fields
* in the cache size increase section ar ignored.
*
* H5C2_incr__threshold: Attempt to increase the size of the cache
* whenever the average hit rate over the last epoch drops
* below the value supplied in the lower_hr_threshold
* field.
*
* Note that this attempt will fail if the cache is already
* at its maximum size, or if the cache is not already using
* all available space.
*
* lower_hr_threshold: Lower hit rate threshold. If the increment mode
* (incr_mode) is H5C2_incr__threshold and the hit rate drops below the
* value supplied in this field in an epoch, increment the cache size by
* size_increment. Note that cache size may not be incremented above
* max_size, and that the increment may be further restricted by the
* max_increment field if it is enabled.
*
* When enabled, this field must contain a value in the range [0.0, 1.0].
* Depending on the incr_mode selected, it may also have to be less than
* upper_hr_threshold.
*
* increment: Double containing the multiplier used to derive the new
* cache size from the old if a cache size increment is triggered.
* The increment must be greater than 1.0, and should not exceed 2.0.
*
* The new cache size is obtained by multiplying the current max cache
* size by the increment, and then clamping to max_size and to stay
* within the max_increment as necessary.
*
* apply_max_increment: Boolean flag indicating whether the max_increment
* field should be used to limit the maximum cache size increment.
*
* max_increment: If enabled by the apply_max_increment field described
* above, this field contains the maximum number of bytes by which the
* cache size can be increased in a single re-size.
*
* flash_incr_mode: Instance of the H5C_cache_flash_incr_mode enumerated
* type whose value indicates whether and by what algorithm we should
* make flash increases in the size of the cache to accomodate insertion
* of large entries and large increases in the size of a single entry.
*
* The addition of the flash increment mode was occasioned by performance
* problems that appear when a local heap is increased to a size in excess
* of the current cache size. While the existing re-size code dealt with
* this eventually, performance was very bad for the remainder of the
* epoch.
*
* At present, there are two possible values for the flash_incr_mode:
*
* H5C_flash_incr__off: Don't perform flash increases in the size of
* the cache.
*
* H5C_flash_incr__add_space: Let x be either the size of a newly
* newly inserted entry, or the number of bytes by which the
* size of an existing entry has been increased.
*
* If
* x > flash_threshold * current max cache size,
*
* increase the current maximum cache size by x * flash_multiple
* less any free space in the cache, and start a new epoch. For
* now at least, pay no attention to the maximum increment.
*
*
* With a little thought, it should be obvious that the above flash
* cache size increase algorithm is not sufficient for all
* circumstances -- for example, suppose the user round robins through
* (1/flash_threshold) +1 groups, adding one data set to each on each
* pass. Then all will increase in size at about the same time, requiring
* the max cache size to at least double to maintain acceptable
* performance, however the above flash increment algorithm will not be
* triggered.
*
* Hopefully, the add space algorithm detailed above will be sufficient
* for the performance problems encountered to date. However, we should
* expect to revisit the issue.
*
* flash_multiple: Double containing the multiple described above in the
* H5C_flash_incr__add_space section of the discussion of the
* flash_incr_mode section. This field is ignored unless flash_incr_mode
* is H5C_flash_incr__add_space.
*
* flash_threshold: Double containing the factor by which current max cache
* size is multiplied to obtain the size threshold for the add_space
* flash increment algorithm. The field is ignored unless
* flash_incr_mode is H5C2_flash_incr__add_space.
*
*
* Cache size decrease control fields:
*
* decr_mode: Instance of the H5C2_cache_decr_mode enumerated type whose
* value indicates how we determine whether the cache size should be
* decreased. At present there are four possibilities.
*
* H5C2_decr__off: Don't attempt to decrease the size of the cache
* automatically.
*
* When this increment mode is selected, the remaining fields
* in the cache size decrease section are ignored.
*
* H5C2_decr__threshold: Attempt to decrease the size of the cache
* whenever the average hit rate over the last epoch rises
* above the value supplied in the upper_hr_threshold
* field.
*
* H5C2_decr__age_out: At the end of each epoch, search the cache for
* entries that have not been accessed for at least the number
* of epochs specified in the epochs_before_eviction field, and
* evict these entries. Conceptually, the maximum cache size
* is then decreased to match the new actual cache size. However,
* this reduction may be modified by the min_size, the
* max_decrement, and/or the empty_reserve.
*
* H5C2_decr__age_out_with_threshold: Same as age_out, but we only
* attempt to reduce the cache size when the hit rate observed
* over the last epoch exceeds the value provided in the
* upper_hr_threshold field.
*
* upper_hr_threshold: Upper hit rate threshold. The use of this field
* varies according to the current decr_mode:
*
* H5C2_decr__off or H5C2_decr__age_out: The value of this field is
* ignored.
*
* H5C2_decr__threshold: If the hit rate exceeds this threshold in any
* epoch, attempt to decrement the cache size by size_decrement.
*
* Note that cache size may not be decremented below min_size.
*
* Note also that if the upper_threshold is 1.0, the cache size
* will never be reduced.
*
* H5C2_decr__age_out_with_threshold: If the hit rate exceeds this
* threshold in any epoch, attempt to reduce the cache size
* by evicting entries that have not been accessed for more
* than the specified number of epochs.
*
* decrement: This field is only used when the decr_mode is
* H5C2_decr__threshold.
*
* The field is a double containing the multiplier used to derive the
* new cache size from the old if a cache size decrement is triggered.
* The decrement must be in the range 0.0 (in which case the cache will
* try to contract to its minimum size) to 1.0 (in which case the
* cache will never shrink).
*
* apply_max_decrement: Boolean flag used to determine whether decrements
* in cache size are to be limited by the max_decrement field.
*
* max_decrement: Maximum number of bytes by which the cache size can be
* decreased in a single re-size. Note that decrements may also be
* restricted by the min_size of the cache, and (in age out modes) by
* the empty_reserve field.
*
* epochs_before_eviction: Integer field used in H5C2_decr__age_out and
* H5C2_decr__age_out_with_threshold decrement modes.
*
* This field contains the number of epochs an entry must remain
* unaccessed before it is evicted in an attempt to reduce the
* cache size. If applicable, this field must lie in the range
* [1, H5C2__MAX_EPOCH_MARKERS].
*
* apply_empty_reserve: Boolean field controlling whether the empty_reserve
* field is to be used in computing the new cache size when the
* decr_mode is H5C2_decr__age_out or H5C2_decr__age_out_with_threshold.
*
* empty_reserve: To avoid a constant racheting down of cache size by small
* amounts in the H5C2_decr__age_out and H5C2_decr__age_out_with_threshold
* modes, this field allows one to require that any cache size
* reductions leave the specified fraction of unused space in the cache.
*
* The value of this field must be in the range [0.0, 1.0]. I would
* expect typical values to be in the range of 0.01 to 0.1.
*
****************************************************************************/
#define H5C2_RESIZE_CFG__VALIDATE_GENERAL 0x1
#define H5C2_RESIZE_CFG__VALIDATE_INCREMENT 0x2
#define H5C2_RESIZE_CFG__VALIDATE_DECREMENT 0x4
#define H5C2_RESIZE_CFG__VALIDATE_INTERACTIONS 0x8
#define H5C2_RESIZE_CFG__VALIDATE_ALL \
( \
H5C2_RESIZE_CFG__VALIDATE_GENERAL | \
H5C2_RESIZE_CFG__VALIDATE_INCREMENT | \
H5C2_RESIZE_CFG__VALIDATE_DECREMENT | \
H5C2_RESIZE_CFG__VALIDATE_INTERACTIONS \
)
#define H5C2__CURR_AUTO_SIZE_CTL_VER 1
#define H5C2__CURR_AUTO_RESIZE_RPT_FCN_VER 1
#define H5C2__MAX_EPOCH_MARKERS 10
#define H5C2__DEF_AR_UPPER_THRESHHOLD 0.9999
#define H5C2__DEF_AR_LOWER_THRESHHOLD 0.9
#define H5C2__DEF_AR_MAX_SIZE ((size_t)(16 * 1024 * 1024))
#define H5C2__DEF_AR_INIT_SIZE ((size_t)( 1 * 1024 * 1024))
#define H5C2__DEF_AR_MIN_SIZE ((size_t)( 1 * 1024 * 1024))
#define H5C2__DEF_AR_MIN_CLEAN_FRAC 0.5
#define H5C2__DEF_AR_INCREMENT 2.0
#define H5C2__DEF_AR_MAX_INCREMENT ((size_t)( 2 * 1024 * 1024))
#define H5C2__DEF_AR_FLASH_MULTIPLE 1.0
#define H5C2__DEV_AR_FLASH_THRESHOLD 0.25
#define H5C2__DEF_AR_DECREMENT 0.9
#define H5C2__DEF_AR_MAX_DECREMENT ((size_t)( 1 * 1024 * 1024))
#define H5C2__DEF_AR_EPCHS_B4_EVICT 3
#define H5C2__DEF_AR_EMPTY_RESERVE 0.05
#define H5C2__MIN_AR_EPOCH_LENGTH 100
#define H5C2__DEF_AR_EPOCH_LENGTH 50000
#define H5C2__MAX_AR_EPOCH_LENGTH 1000000
enum H5C2_resize_status
{
in_spec2,
increase2,
flash_increase2,
decrease2,
at_max_size2,
at_min_size2,
increase_disabled2,
decrease_disabled2,
not_full2
}; /* enum H5C2_resize_conditions */
typedef void (*H5C2_auto_resize_rpt_fcn)(H5C2_t * cache_ptr,
int32_t version,
double hit_rate,
enum H5C2_resize_status status,
size_t old_max_cache_size,
size_t new_max_cache_size,
size_t old_min_clean_size,
size_t new_min_clean_size);
typedef struct H5C2_auto_size_ctl_t
{
/* general configuration fields: */
int32_t version;
H5C2_auto_resize_rpt_fcn rpt_fcn;
hbool_t set_initial_size;
size_t initial_size;
double min_clean_fraction;
size_t max_size;
size_t min_size;
int64_t epoch_length;
/* size increase control fields: */
enum H5C2_cache_incr_mode incr_mode;
double lower_hr_threshold;
double increment;
hbool_t apply_max_increment;
size_t max_increment;
enum H5C2_cache_flash_incr_mode flash_incr_mode;
double flash_multiple;
double flash_threshold;
/* size decrease control fields: */
enum H5C2_cache_decr_mode decr_mode;
double upper_hr_threshold;
double decrement;
hbool_t apply_max_decrement;
size_t max_decrement;
int32_t epochs_before_eviction;
hbool_t apply_empty_reserve;
double empty_reserve;
} H5C2_auto_size_ctl_t;
/*
* Library prototypes.
*/
/* #defines of flags used in the flags parameters in some of the
* following function calls. Note that not all flags are applicable
* to all function calls. Flags that don't apply to a particular
* function are ignored in that function.
*
* These flags apply to all function calls:
*
* H5C2__NO_FLAGS_SET (generic "no flags set" for all fcn calls)
*
*
* These flags apply to H5C2_insert_entry():
*
* H5C2__SET_FLUSH_MARKER_FLAG
* H5C2__PIN_ENTRY_FLAG
*
* These flags apply to H5C2_protect()
*
* H5C2__READ_ONLY_FLAG
* H5C2__CHECK_SIZE_FLAG
*
* These flags apply to H5C2_unprotect():
*
* H5C2__SET_FLUSH_MARKER_FLAG
* H5C2__DELETED_FLAG
* H5C2__DIRTIED_FLAG
* H5C2__SIZE_CHANGED_FLAG
* H5C2__PIN_ENTRY_FLAG
* H5C2__UNPIN_ENTRY_FLAG
*
*
* These flags apply to H5C2_flush_cache():
*
* H5C2__FLUSH_INVALIDATE_FLAG
* H5C2__FLUSH_CLEAR_ONLY_FLAG
* H5C2__FLUSH_MARKED_ENTRIES_FLAG
* H5C2__FLUSH_IGNORE_PROTECTED_FLAG (can't use this flag in combination
* with H5C2__FLUSH_INVALIDATE_FLAG)
*
* These flags apply to H5C2_flush_single_entry():
*
* H5C2__FLUSH_INVALIDATE_FLAG
* H5C2__FLUSH_CLEAR_ONLY_FLAG
* H5C2__FLUSH_MARKED_ENTRIES_FLAG
*/
#define H5C2__NO_FLAGS_SET 0x0000
#define H5C2__SET_FLUSH_MARKER_FLAG 0x0001
#define H5C2__DELETED_FLAG 0x0002
#define H5C2__DIRTIED_FLAG 0x0004
#define H5C2__SIZE_CHANGED_FLAG 0x0008
#define H5C2__PIN_ENTRY_FLAG 0x0010
#define H5C2__UNPIN_ENTRY_FLAG 0x0020
#define H5C2__FLUSH_INVALIDATE_FLAG 0x0040
#define H5C2__FLUSH_CLEAR_ONLY_FLAG 0x0080
#define H5C2__FLUSH_MARKED_ENTRIES_FLAG 0x0100
#define H5C2__FLUSH_IGNORE_PROTECTED_FLAG 0x0200
#define H5C2__READ_ONLY_FLAG 0x0400
#define H5C2__CHECK_SIZE_FLAG 0x0800
H5_DLL H5C2_t * H5C2_create(size_t max_cache_size,
size_t min_clean_size,
int max_type_id,
const char * (* type_name_table_ptr),
H5C2_write_permitted_func_t check_write_permitted,
hbool_t write_permitted,
H5C2_log_flush_func_t log_flush,
void * aux_ptr);
H5_DLL void H5C2_def_auto_resize_rpt_fcn(H5C2_t * cache_ptr,
int32_t version,
double hit_rate,
enum H5C2_resize_status status,
size_t old_max_cache_size,
size_t new_max_cache_size,
size_t old_min_clean_size,
size_t new_min_clean_size);
H5_DLL herr_t H5C2_dest(H5F_t * f,
hid_t dxpl_id);
H5_DLL herr_t H5C2_dest_empty(H5C2_t * cache_ptr);
H5_DLL herr_t H5C2_expunge_entry(H5F_t * f,
hid_t dxpl_id,
const H5C2_class_t * type,
haddr_t addr);
H5_DLL herr_t H5C2_flush_cache(H5F_t *f,
hid_t dxpl_id,
unsigned flags);
H5_DLL herr_t H5C2_flush_to_min_clean(H5F_t * f,
hid_t dxpl_id);
H5_DLL herr_t H5C2_get_cache_auto_resize_config(H5C2_t * cache_ptr,
H5C2_auto_size_ctl_t *config_ptr);
H5_DLL herr_t H5C2_get_cache_size(H5C2_t * cache_ptr,
size_t * max_size_ptr,
size_t * min_clean_size_ptr,
size_t * cur_size_ptr,
int32_t * cur_num_entries_ptr);
H5_DLL herr_t H5C2_get_cache_hit_rate(H5C2_t * cache_ptr,
double * hit_rate_ptr);
H5_DLL herr_t H5C2_get_entry_status(H5F_t * f,
haddr_t addr,
size_t * size_ptr,
hbool_t * in_cache_ptr,
hbool_t * is_dirty_ptr,
hbool_t * is_protected_ptr,
hbool_t * is_pinned_ptr);
H5_DLL herr_t H5C2_get_evictions_enabled(H5C2_t * cache_ptr,
hbool_t * evictions_enabled_ptr);
H5_DLL herr_t H5C2_get_trace_file_ptr(H5C2_t * cache_ptr,
FILE ** trace_file_ptr_ptr);
H5_DLL herr_t H5C2_insert_entry(H5F_t * f,
hid_t dxpl_id,
const H5C2_class_t * type,
haddr_t addr,
size_t len,
void * thing,
unsigned int flags);
H5_DLL herr_t H5C2_mark_entries_as_clean(H5F_t * f,
hid_t dxpl_id,
int32_t ce_array_len,
haddr_t * ce_array_ptr);
H5_DLL herr_t H5C2_mark_pinned_entry_dirty(H5F_t * f,
void * thing,
hbool_t size_changed,
size_t new_size);
H5_DLL herr_t H5C2_mark_pinned_or_protected_entry_dirty(H5F_t * f,
void * thing);
H5_DLL herr_t H5C2_rename_entry(H5C2_t * cache_ptr,
const H5C2_class_t * type,
haddr_t old_addr,
haddr_t new_addr);
H5_DLL herr_t H5C2_pin_protected_entry(H5F_t * f,
void * thing);
H5_DLL void * H5C2_protect(H5F_t * f,
hid_t dxpl_id,
const H5C2_class_t * type,
haddr_t addr,
size_t len,
const void * udata,
unsigned flags);
H5_DLL herr_t H5C2_reset_cache_hit_rate_stats(H5C2_t * cache_ptr);
H5_DLL herr_t H5C2_resize_pinned_entry(H5F_t * f,
void * thing,
size_t new_size);
H5_DLL herr_t H5C2_set_cache_auto_resize_config(const H5F_t * f,
H5C2_auto_size_ctl_t *config_ptr);
H5_DLL herr_t H5C2_set_evictions_enabled(const H5F_t * f,
hbool_t evictions_enabled);
H5_DLL herr_t H5C2_set_prefix(H5C2_t * cache_ptr, char * prefix);
H5_DLL herr_t H5C2_set_skip_flags(H5C2_t * cache_ptr,
hbool_t skip_file_checks,
hbool_t skip_dxpl_id_checks);
H5_DLL herr_t H5C2_set_trace_file_ptr(H5C2_t * cache_ptr,
FILE * trace_file_ptr);
H5_DLL herr_t H5C2_stats(H5C2_t * cache_ptr,
const char * cache_name,
hbool_t display_detailed_stats);
H5_DLL void H5C2_stats__reset(H5C2_t * cache_ptr);
H5_DLL herr_t H5C2_unpin_entry(H5F_t * file_ptr, void * thing);
H5_DLL herr_t H5C2_unprotect(H5F_t * f,
hid_t dxpl_id,
const H5C2_class_t * type,
haddr_t addr,
void * thing,
unsigned int flags,
size_t new_size);
H5_DLL herr_t H5C2_validate_resize_config(H5C2_auto_size_ctl_t * config_ptr,
unsigned int tests);
/**************************************************************************/
/***************** journaling function definitions proper: ****************/
/**************************************************************************/
H5_DLL herr_t H5C2__begin_transaction(H5C2_t * cache_ptr,
uint64_t * trans_num_ptr);
H5_DLL herr_t H5C2__end_transaction(H5C2_t * cache_ptr,
uint64_t trans_num);
/*****************************************************************************/
/****************** journal buffer function definitions: *********************/
/*****************************************************************************/
typedef struct H5C2_jbrb_t H5C2_jbrb_t;
H5_DLL herr_t H5C2_jb__flush_full_buffers(H5C2_jbrb_t * struct_ptr);
H5_DLL herr_t H5C2_jb__flush(H5C2_jbrb_t * struct_ptr);
H5_DLL herr_t H5C2_jb__write_to_buffer(H5C2_jbrb_t * struct_ptr,
size_t size,
const char * data,
hbool_t is_end_trans,
unsigned long trans_num);
H5_DLL herr_t H5C2_jb__init(H5C2_jbrb_t * struct_ptr,
const char * HDF5_file_name,
const char * journal_file_name,
size_t buf_size,
int num_bufs,
hbool_t use_aio,
hbool_t human_readable);
H5_DLL herr_t H5C2_jb__start_transaction(H5C2_jbrb_t * struct_ptr,
unsigned long trans_num);
H5_DLL herr_t H5C2_jb__journal_entry(H5C2_jbrb_t * struct_ptr,
unsigned long trans_num,
haddr_t base_addr,
size_t length,
const uint8_t * body);
H5_DLL herr_t H5C2_jb__end_transaction(H5C2_jbrb_t * struct_ptr,
unsigned long trans_num);
H5_DLL herr_t H5C2_jb__comment(H5C2_jbrb_t * struct_ptr,
const char * comment_ptr);
H5_DLL herr_t H5C2_jb__get_last_transaction_on_disk(H5C2_jbrb_t * struct_ptr,
unsigned long * trans_num_ptr);
H5_DLL herr_t H5C2_jb__trunc(H5C2_jbrb_t * struct_ptr);
H5_DLL herr_t H5C2_jb__takedown(H5C2_jbrb_t * struct_ptr);
H5_DLL herr_t H5C2_jb__reconfigure(H5C2_jbrb_t * struct_ptr,
size_t new_buf_size,
int new_num_bufs,
hbool_t new_use_aio);
H5_DLL herr_t H5C2_jb__bin2hex(const uint8_t * buf,
char * hexdata,
size_t * hexlength,
size_t buf_offset,
size_t buf_size);
/*****************************************************************************/
/********** journal config block management function definitions: ************/
/*****************************************************************************/
H5_DLL herr_t H5C2_create_journal_config_block(H5F_t *f,
hid_t dxpl_id,
const char * journal_file_name_ptr);
H5_DLL herr_t H5C2_discard_journal_config_block(H5F_t * f,
hid_t dxpl_id);
H5_DLL herr_t H5C2_get_journaling_in_progress(H5F_t * f,
hid_t dxpl_id);
H5_DLL herr_t H5C2_load_journal_config_block(H5F_t * f,
hid_t dxpl_id,
haddr_t block_addr,
hsize_t block_len);
H5_DLL herr_t H5C2_mark_journaling_in_progress(H5F_t * f,
hid_t dxpl_id,
const char * journal_file_name_ptr);
H5_DLL herr_t H5C2_unmark_journaling_in_progress(H5F_t * f,
hid_t dxpl_id);
#endif /* !_H5C2private_H */
|