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
|
/*
* Copyright (C) 1998 NCSA
* All rights reserved.
*
* Programmer: Quincey Koziol <koziol@ncsa.uiuc.edu>
* Tuesday, June 16, 1998
*
* Purpose: "All" selection data space I/O functions.
*/
#include <H5private.h>
#include <H5Eprivate.h>
#include <H5Iprivate.h>
#include <H5Sprivate.h>
#include <H5Vprivate.h>
#include <H5Dprivate.h>
/* Interface initialization */
#define PABLO_MASK H5Sall_mask
#define INTERFACE_INIT NULL
static intn interface_initialize_g = 0;
static herr_t H5S_all_init (const struct H5O_layout_t *layout,
const H5S_t *space, H5S_sel_iter_t *iter, size_t *min_elem_out);
static size_t H5S_all_favail (const H5S_t *space, const H5S_sel_iter_t *iter,
size_t max);
static size_t H5S_all_fgath (H5F_t *f, const struct H5O_layout_t *layout,
const struct H5O_pline_t *pline,
const struct H5O_fill_t *fill,
const struct H5O_efl_t *efl, size_t elmt_size,
const H5S_t *file_space,
H5S_sel_iter_t *file_iter, size_t nelmts,
const H5F_xfer_t *xfer_parms, void *buf/*out*/);
static herr_t H5S_all_fscat (H5F_t *f, const struct H5O_layout_t *layout,
const struct H5O_pline_t *pline,
const struct H5O_fill_t *fill,
const struct H5O_efl_t *efl, size_t elmt_size,
const H5S_t *file_space,
H5S_sel_iter_t *file_iter, size_t nelmts,
const H5F_xfer_t *xfer_parms, const void *buf);
static size_t H5S_all_mgath (const void *_buf, size_t elmt_size,
const H5S_t *mem_space, H5S_sel_iter_t *mem_iter,
size_t nelmts, void *_tconv_buf/*out*/);
static herr_t H5S_all_mscat (const void *_tconv_buf, size_t elmt_size,
const H5S_t *mem_space, H5S_sel_iter_t *mem_iter,
size_t nelmts, void *_buf/*out*/);
const H5S_fconv_t H5S_ALL_FCONV[1] = {{
"all", /*name */
H5S_SEL_ALL, /*selection type */
H5S_all_init, /*initialize */
H5S_all_favail, /*available */
H5S_all_fgath, /*gather */
H5S_all_fscat, /*scatter */
}};
const H5S_mconv_t H5S_ALL_MCONV[1] = {{
"all", /*name */
H5S_SEL_ALL, /*selection type */
H5S_all_init, /*initialize */
H5S_all_mgath, /*gather */
H5S_all_mscat, /*scatter */
}};
/*-------------------------------------------------------------------------
* Function: H5S_all_init
*
* Purpose: Initializes iteration information for all selection.
*
* Return: non-negative on success, negative on failure.
*
* Programmer: Quincey Koziol
* Tuesday, June 16, 1998
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
static herr_t
H5S_all_init (const struct H5O_layout_t UNUSED *layout,
const H5S_t *space, H5S_sel_iter_t *sel_iter, size_t *min_elem_out)
{
hsize_t hsize[H5O_LAYOUT_NDIMS]; /*size of hyperslab */
intn space_ndims; /*dimensionality of space*/
hsize_t acc; /*accumulator */
intn i; /*counters */
FUNC_ENTER (H5S_all_init, FAIL);
/* Check args */
assert (layout);
assert (space && H5S_SEL_ALL==space->select.type);
assert (sel_iter);
/* Initialize the number of elements to iterate over */
sel_iter->all.elmt_left=H5S_get_simple_extent_npoints(space);
/* Start at the upper left location */
sel_iter->all.offset=0;
/* Get the dimensions of the space, to set the min. # of elements */
if ((space_ndims=H5S_get_simple_extent_dims (space, hsize, NULL))<0) {
HRETURN_ERROR (H5E_DATASPACE, H5E_CANTINIT, FAIL,
"unable to retrieve hyperslab parameters");
}
/* Adjust the slowest varying dimension to account for strip mining */
for (i=1, acc=1; i<space_ndims; i++)
acc *= hsize[i];
/* Set the minimum # of elements to output */
*min_elem_out=acc;
FUNC_LEAVE (SUCCEED);
}
/*-------------------------------------------------------------------------
* Function: H5S_all_favail
*
* Purpose: Figure out the optimal number of elements to transfer to/from
* the file.
*
* Return: non-negative number of elements on success, negative on
* failure.
*
* Programmer: Quincey Koziol
* Tuesday, June 16, 1998
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
static size_t
H5S_all_favail (const H5S_t *space, const H5S_sel_iter_t *sel_iter, size_t max)
{
hsize_t nelmts;
int m_ndims; /* file dimensionality */
hsize_t size[H5O_LAYOUT_NDIMS]; /*size of selected hyperslab */
hsize_t acc;
int i;
FUNC_ENTER (H5S_all_favail, FAIL);
/* Check args */
assert (space && H5S_SEL_ALL==space->select.type);
assert (sel_iter);
/*
* The stripmine size is such that only the slowest varying dimension can
* be split up. We choose the largest possible strip mine size which is
* not larger than the desired size.
*/
m_ndims = H5S_get_simple_extent_dims (space, size, NULL);
for (i=m_ndims-1, acc=1; i>0; --i)
acc *= size[i];
nelmts = (max/acc) * acc;
if (nelmts<=0) {
HRETURN_ERROR (H5E_IO, H5E_UNSUPPORTED, FAIL,
"strip mine buffer is too small");
}
FUNC_LEAVE (MIN(sel_iter->all.elmt_left,nelmts));
} /* H5S_all_favail() */
/*-------------------------------------------------------------------------
* Function: H5S_all_fgath
*
* Purpose: Gathers data points from file F and accumulates them in the
* type conversion buffer BUF. The LAYOUT argument describes
* how the data is stored on disk and EFL describes how the data
* is organized in external files. ELMT_SIZE is the size in
* bytes of a datum which this function treats as opaque.
* FILE_SPACE describes the data space of the dataset on disk
* and the elements that have been selected for reading (via
* hyperslab, etc). This function will copy at most NELMTS
* elements.
*
* Return: Success: Number of elements copied.
*
* Failure: 0
*
* Programmer: Quincey Koziol
* Tuesday, June 16, 1998
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
static size_t
H5S_all_fgath (H5F_t *f, const struct H5O_layout_t *layout,
const struct H5O_pline_t *pline,
const struct H5O_fill_t *fill, const struct H5O_efl_t *efl,
size_t elmt_size, const H5S_t *file_space,
H5S_sel_iter_t *file_iter, size_t nelmts,
const H5F_xfer_t *xfer_parms, void *_buf/*out*/)
{
hssize_t file_offset[H5O_LAYOUT_NDIMS]; /*offset of slab in file*/
hsize_t hsize[H5O_LAYOUT_NDIMS]; /*size of hyperslab */
hssize_t zero[H5O_LAYOUT_NDIMS]; /*zero */
uint8_t *buf=(uint8_t*)_buf; /*for pointer arithmetic*/
hsize_t acc; /*accumulator */
intn space_ndims; /*dimensionality of space*/
intn i; /*counters */
FUNC_ENTER (H5S_all_fgath, 0);
/* Check args */
assert (f);
assert (layout);
assert (elmt_size>0);
assert (file_space);
assert (file_iter);
assert (nelmts>0);
assert (buf);
/*
* Get hyperslab information to determine what elements are being
* selected (there might eventually be other selection methods too).
* We only support hyperslabs with unit sample because there's no way to
* currently pass sample information into H5F_arr_read() much less
* H5F_istore_read().
*/
if ((space_ndims=H5S_get_simple_extent_dims (file_space, hsize, NULL))<0) {
HRETURN_ERROR (H5E_DATASPACE, H5E_CANTINIT, 0,
"unable to retrieve hyperslab parameters");
}
if(space_ndims>0) {
HDmemset(file_offset,0,sizeof(hssize_t)*space_ndims);
/* Adjust the slowest varying dimension to take care of strip mining */
for (i=1, acc=1; i<space_ndims; i++)
acc *= hsize[i];
assert (0==file_iter->all.offset % acc);
assert (0==nelmts % acc);
file_offset[0] += file_iter->all.offset / acc;
hsize[0] = nelmts / acc;
} /* end if */
/* The fastest varying dimension is for the data point itself */
file_offset[space_ndims] = 0;
hsize[space_ndims] = elmt_size;
HDmemset (zero, 0, (space_ndims+1)*sizeof(*zero));
/*
* Gather from file.
*/
if (H5F_arr_read (f, xfer_parms, layout, pline, fill, efl, hsize, hsize,
zero, file_offset, buf/*out*/)<0) {
HRETURN_ERROR (H5E_DATASPACE, H5E_READERROR, 0, "read error");
}
/* Advance iterator */
file_iter->all.elmt_left--;
file_iter->all.offset+=nelmts;
FUNC_LEAVE (nelmts);
} /* H5S_all_fgath() */
/*-------------------------------------------------------------------------
* Function: H5S_all_fscat
*
* Purpose: Scatters dataset elements from the type conversion buffer BUF
* to the file F where the data points are arranged according to
* the file data space FILE_SPACE and stored according to
* LAYOUT and EFL. Each element is ELMT_SIZE bytes.
* The caller is requesting that NELMTS elements are copied.
*
* Return: Non-negative on success/Negative on failure
*
* Programmer: Quincey Koziol
* Tuesday, June 16, 1998
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
static herr_t
H5S_all_fscat (H5F_t *f, const struct H5O_layout_t *layout,
const struct H5O_pline_t *pline, const struct H5O_fill_t *fill,
const struct H5O_efl_t *efl, size_t elmt_size,
const H5S_t *file_space, H5S_sel_iter_t *file_iter,
size_t nelmts, const H5F_xfer_t *xfer_parms, const void *_buf)
{
hssize_t file_offset[H5O_LAYOUT_NDIMS]; /*offset of hyperslab */
hsize_t hsize[H5O_LAYOUT_NDIMS]; /*size of hyperslab */
hssize_t zero[H5O_LAYOUT_NDIMS]; /*zero vector */
const uint8_t *buf=(const uint8_t*)_buf; /*for pointer arithmetic*/
hsize_t acc; /*accumulator */
intn space_ndims; /*space dimensionality */
intn i; /*counters */
FUNC_ENTER (H5S_all_fscat, FAIL);
/* Check args */
assert (f);
assert (layout);
assert (elmt_size>0);
assert (file_space);
assert (file_iter);
assert (nelmts>0);
assert (buf);
/*
* Get information to determine what elements are being selected.
*/
if ((space_ndims=H5S_get_simple_extent_dims (file_space, hsize, NULL))<0) {
HRETURN_ERROR (H5E_DATASPACE, H5E_CANTINIT, FAIL,
"unable to retrieve hyperslab parameters");
}
if(space_ndims>0) {
HDmemset(file_offset,0,sizeof(hssize_t)*space_ndims);
/* Adjust the slowest varying dimension to account for strip mining */
for (i=1, acc=1; i<space_ndims; i++)
acc *= hsize[i];
assert (0==file_iter->all.offset % acc);
assert (0==nelmts % acc);
file_offset[0] += file_iter->all.offset / acc;
hsize[0] = nelmts / acc;
} /* end if */
/* The fastest varying dimension is for the data point itself */
file_offset[space_ndims] = 0;
hsize[space_ndims] = elmt_size;
HDmemset (zero, 0, (space_ndims+1)*sizeof(*zero));
/*
* Scatter to file.
*/
if (H5F_arr_write (f, xfer_parms, layout, pline, fill, efl, hsize, hsize,
zero, file_offset, buf)<0) {
HRETURN_ERROR (H5E_DATASPACE, H5E_WRITEERROR, FAIL, "write error");
}
/* Advance iterator */
file_iter->all.elmt_left--;
file_iter->all.offset+=nelmts;
FUNC_LEAVE (SUCCEED);
} /* H5S_all_fscat() */
/*-------------------------------------------------------------------------
* Function: H5S_all_mgath
*
* Purpose: Gathers dataset elements from application memory BUF and
* copies them into the data type conversion buffer TCONV_BUF.
* Each element is ELMT_SIZE bytes and arranged in application
* memory according to MEM_SPACE.
* The caller is requesting that at most NELMTS be gathered.
*
* Return: Success: Number of elements copied.
*
* Failure: 0
*
* Programmer: Quincey Koziol
* Tuesday, June 16, 1998
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
static size_t
H5S_all_mgath (const void *_buf, size_t elmt_size,
const H5S_t *mem_space, H5S_sel_iter_t *mem_iter,
size_t nelmts, void *_tconv_buf/*out*/)
{
hssize_t mem_offset[H5O_LAYOUT_NDIMS]; /*slab offset in app buf*/
hsize_t mem_size[H5O_LAYOUT_NDIMS]; /*total size of app buf */
hsize_t hsize[H5O_LAYOUT_NDIMS]; /*size of hyperslab */
hssize_t zero[H5O_LAYOUT_NDIMS]; /*zero */
const uint8_t *buf=(const uint8_t*)_buf; /* Get local copies for address arithmetic */
uint8_t *tconv_buf=(uint8_t*)_tconv_buf;
hsize_t acc; /*accumulator */
intn space_ndims; /*dimensionality of space*/
intn i; /*counters */
FUNC_ENTER (H5S_all_mgath, 0);
/* Check args */
assert (buf);
assert (elmt_size>0);
assert (mem_space && H5S_SEL_ALL==mem_space->select.type);
assert (mem_iter);
assert (nelmts>0);
assert (tconv_buf);
/*
* Retrieve information to determine what elements are being selected.
*/
if ((space_ndims=H5S_get_simple_extent_dims (mem_space, hsize, NULL))<0) {
HRETURN_ERROR (H5E_DATASPACE, H5E_CANTINIT, 0,
"unable to retrieve hyperslab parameters");
}
if(space_ndims>0) {
HDmemset(mem_offset,0,sizeof(hssize_t)*space_ndims);
if (H5S_get_simple_extent_dims (mem_space, mem_size, NULL)<0) {
HRETURN_ERROR (H5E_DATASPACE, H5E_CANTINIT, 0,
"unable to retrieve data space dimensions");
}
/* Adjust the slowest varying dimension to account for strip mining */
for (i=1, acc=1; i<space_ndims; i++)
acc *= hsize[i];
assert (0==mem_iter->all.offset % acc);
assert (0==nelmts % acc);
mem_offset[0] += mem_iter->all.offset / acc;
hsize[0] = nelmts / acc;
} /* end if */
/* The fastest varying dimension is for the data point itself */
mem_offset[space_ndims] = 0;
mem_size[space_ndims] = elmt_size;
hsize[space_ndims] = elmt_size;
HDmemset (zero, 0, (space_ndims+1)*sizeof(*zero));
/*
* Scatter from conversion buffer to application memory.
*/
if (H5V_hyper_copy (space_ndims+1, hsize, hsize, zero, tconv_buf,
mem_size, mem_offset, buf)<0) {
HRETURN_ERROR (H5E_DATASPACE, H5E_CANTINIT, 0,
"unable to scatter data to memory");
}
/* Advance iterator */
mem_iter->all.elmt_left--;
mem_iter->all.offset+=nelmts;
FUNC_LEAVE (nelmts);
} /* H5S_all_mgath() */
/*-------------------------------------------------------------------------
* Function: H5S_all_mscat
*
* Purpose: Scatters NELMTS data points from the type conversion buffer
* TCONV_BUF to the application buffer BUF. Each element is
* ELMT_SIZE bytes and they are organized in application memory
* according to MEM_SPACE.
*
* Return: Non-negative on success/Negative on failure
*
* Programmer: Quincey Koziol
* Wednesday, June 17, 1998
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
static herr_t
H5S_all_mscat (const void *_tconv_buf, size_t elmt_size,
const H5S_t *mem_space, H5S_sel_iter_t *mem_iter,
size_t nelmts, void *_buf/*out*/)
{
hssize_t mem_offset[H5O_LAYOUT_NDIMS]; /*slab offset in app buf*/
hsize_t mem_size[H5O_LAYOUT_NDIMS]; /*total size of app buf */
hsize_t hsize[H5O_LAYOUT_NDIMS]; /*size of hyperslab */
hssize_t zero[H5O_LAYOUT_NDIMS]; /*zero */
uint8_t *buf=(uint8_t*)_buf; /* Get local copies for address arithmetic */
const uint8_t *tconv_buf=(const uint8_t *)_tconv_buf;
hsize_t acc; /*accumulator */
intn space_ndims; /*dimensionality of space*/
intn i; /*counters */
FUNC_ENTER (H5S_all_mscat, FAIL);
/* Check args */
assert (tconv_buf);
assert (elmt_size>0);
assert (mem_space && H5S_SEL_ALL==mem_space->select.type);
assert (mem_iter);
assert (nelmts>0);
assert (buf);
/*
* Retrieve information to determine what elements are being selected.
*/
if ((space_ndims=H5S_get_simple_extent_dims (mem_space, hsize, NULL))<0) {
HRETURN_ERROR (H5E_DATASPACE, H5E_CANTINIT, FAIL,
"unable to retrieve hyperslab parameters");
}
if(space_ndims>0) {
HDmemset(mem_offset,0,sizeof(hssize_t)*space_ndims);
if (H5S_get_simple_extent_dims (mem_space, mem_size, NULL)<0) {
HRETURN_ERROR (H5E_DATASPACE, H5E_CANTINIT, FAIL,
"unable to retrieve data space dimensions");
}
/* Adjust the slowest varying dimension to take care of strip mining */
for (i=1, acc=1; i<space_ndims; i++) {
acc *= hsize[i];
}
assert (0==mem_iter->all.offset % acc);
assert (0==nelmts % acc);
mem_offset[0] += mem_iter->all.offset / acc;
hsize[0] = nelmts / acc;
} /* end if */
/* The fastest varying dimension is for the data point itself */
mem_offset[space_ndims] = 0;
mem_size[space_ndims] = elmt_size;
hsize[space_ndims] = elmt_size;
HDmemset (zero, 0, (space_ndims+1)*sizeof(*zero));
/*
* Scatter from conversion buffer to application memory.
*/
if (H5V_hyper_copy (space_ndims+1, hsize, mem_size, mem_offset, buf,
hsize, zero, tconv_buf)<0) {
HRETURN_ERROR (H5E_DATASPACE, H5E_CANTINIT, FAIL,
"unable to scatter data to memory");
}
/* Advance iterator */
mem_iter->all.elmt_left--;
mem_iter->all.offset+=nelmts;
FUNC_LEAVE (SUCCEED);
}
/*-------------------------------------------------------------------------
* Function: H5S_all_read
*
* Purpose: Reads directly from file into application memory if possible.
*
* Return: Success: Non-negative. If data was read directly then
* MUST_CONVERT is set to zero, otherwise
* MUST_CONVERT is set to non-zero.
*
* Failure: Negative. Return value of MUST_CONVERT is
* undefined.
*
* Programmer: Robb Matzke
* Thursday, April 22, 1999
*
* Modifications:
* Modified to allow contiguous hyperslabs to be written out - QAK - 5/25/99
*
*-------------------------------------------------------------------------
*/
herr_t
H5S_all_read(H5F_t *f, const H5O_layout_t *layout, const H5O_pline_t *pline,
const H5O_efl_t *efl, size_t elmt_size, const H5S_t *file_space,
const H5S_t *mem_space, const H5F_xfer_t *xfer_parms,
void *buf/*out*/, hbool_t *must_convert/*out*/)
{
H5S_hyper_node_t *file_node,*mem_node; /* Hyperslab node */
hsize_t mem_size,file_size;
hssize_t file_off,mem_off;
hsize_t size[H5S_MAX_RANK];
hssize_t file_offset[H5S_MAX_RANK];
hssize_t mem_offset[H5S_MAX_RANK];
int i;
FUNC_ENTER(H5S_all_read, FAIL);
*must_convert = TRUE;
/* Check whether we can handle this */
if (H5S_SIMPLE!=mem_space->extent.type) goto fall_through;
if (H5S_SIMPLE!=file_space->extent.type) goto fall_through;
if (mem_space->extent.u.simple.rank!=
file_space->extent.u.simple.rank) goto fall_through;
if (mem_space->select.type==H5S_SEL_HYPERSLABS) {
if(mem_space->select.sel_info.hslab.hyper_lst->count>1) goto fall_through;
mem_node=mem_space->select.sel_info.hslab.hyper_lst->head;
} /* end if */
else
if(mem_space->select.type!=H5S_SEL_ALL) goto fall_through;
if (file_space->select.type==H5S_SEL_HYPERSLABS) {
if(file_space->select.sel_info.hslab.hyper_lst->count>1) goto fall_through;
file_node=file_space->select.sel_info.hslab.hyper_lst->head;
} /* end if */
else
if(file_space->select.type!=H5S_SEL_ALL) goto fall_through;
/* Get information about memory and file */
for (i=0; i<mem_space->extent.u.simple.rank; i++) {
if (mem_space->extent.u.simple.max &&
mem_space->extent.u.simple.size[i]!=
mem_space->extent.u.simple.max[i]) goto fall_through;
if (file_space->extent.u.simple.max &&
file_space->extent.u.simple.size[i]!=
file_space->extent.u.simple.max[i]) goto fall_through;
if(mem_space->select.type==H5S_SEL_HYPERSLABS) {
mem_size=(mem_node->end[i]-mem_node->start[i])+1;
mem_off=mem_node->start[i];
} /* end if */
else {
mem_size=mem_space->extent.u.simple.size[i];
mem_off=0;
} /* end else */
if(file_space->select.type==H5S_SEL_HYPERSLABS) {
file_size=(file_node->end[i]-file_node->start[i])+1;
file_off=file_node->start[i];
} /* end if */
else {
file_size=file_space->extent.u.simple.size[i];
file_off=0;
} /* end else */
if (mem_size!=file_size) goto fall_through;
size[i] = file_size;
file_offset[i] = file_off;
mem_offset[i] = mem_off;
}
size[i] = elmt_size;
file_offset[i] = 0;
mem_offset[i] = 0;
/* Read data from the file */
if (H5F_arr_read(f, xfer_parms, layout, pline, NULL, efl, size,
size, mem_offset, file_offset, buf/*out*/)<0) {
HRETURN_ERROR(H5E_IO, H5E_READERROR, FAIL,
"unable to read data from the file");
}
*must_convert = FALSE;
fall_through:
FUNC_LEAVE(SUCCEED);
}
/*-------------------------------------------------------------------------
* Function: H5S_all_write
*
* Purpose: Writes data directly to the file if possible.
*
* Return: Success: Non-negative. If data was written directly
* then MUST_CONVERT is set to zero, otherwise
* MUST_CONVERT is set to non-zero.
*
* Failure: Negative. Return value of MUST_CONVERT is
* undefined.
*
* Programmer: Robb Matzke
* Wednesday, April 21, 1999
*
* Modifications:
* Modified to allow contiguous hyperslabs to be written out - QAK - 5/25/99
*
*-------------------------------------------------------------------------
*/
herr_t
H5S_all_write(H5F_t *f, const struct H5O_layout_t *layout,
const H5O_pline_t *pline, const H5O_efl_t *efl,
size_t elmt_size, const H5S_t *file_space,
const H5S_t *mem_space, const H5F_xfer_t *xfer_parms,
const void *buf, hbool_t *must_convert/*out*/)
{
H5S_hyper_node_t *file_node,*mem_node; /* Hyperslab node */
hsize_t mem_size,file_size;
hssize_t file_off,mem_off;
hsize_t size[H5S_MAX_RANK];
hssize_t file_offset[H5S_MAX_RANK];
hssize_t mem_offset[H5S_MAX_RANK];
int i;
FUNC_ENTER(H5S_all_write, FAIL);
*must_convert = TRUE;
/* Check whether we can handle this */
if (H5S_SIMPLE!=mem_space->extent.type) goto fall_through;
if (H5S_SIMPLE!=file_space->extent.type) goto fall_through;
if (mem_space->extent.u.simple.rank!=
file_space->extent.u.simple.rank) goto fall_through;
if (mem_space->select.type==H5S_SEL_HYPERSLABS) {
if(mem_space->select.sel_info.hslab.hyper_lst->count>1) goto fall_through;
mem_node=mem_space->select.sel_info.hslab.hyper_lst->head;
} /* end if */
else
if(mem_space->select.type!=H5S_SEL_ALL) goto fall_through;
if (file_space->select.type==H5S_SEL_HYPERSLABS) {
if(file_space->select.sel_info.hslab.hyper_lst->count>1) goto fall_through;
file_node=file_space->select.sel_info.hslab.hyper_lst->head;
} /* end if */
else
if(file_space->select.type!=H5S_SEL_ALL) goto fall_through;
/* Get information about memory and file */
for (i=0; i<mem_space->extent.u.simple.rank; i++) {
if (mem_space->extent.u.simple.max &&
mem_space->extent.u.simple.size[i]!=
mem_space->extent.u.simple.max[i]) goto fall_through;
if (file_space->extent.u.simple.max &&
file_space->extent.u.simple.size[i]!=
file_space->extent.u.simple.max[i]) goto fall_through;
if(mem_space->select.type==H5S_SEL_HYPERSLABS) {
mem_size=(mem_node->end[i]-mem_node->start[i])+1;
mem_off=mem_node->start[i];
} /* end if */
else {
mem_size=mem_space->extent.u.simple.size[i];
mem_off=0;
} /* end else */
if(file_space->select.type==H5S_SEL_HYPERSLABS) {
file_size=(file_node->end[i]-file_node->start[i])+1;
file_off=file_node->start[i];
} /* end if */
else {
file_size=file_space->extent.u.simple.size[i];
file_off=0;
} /* end else */
if (mem_size!=file_size) goto fall_through;
size[i] = file_size;
file_offset[i] = file_off;
mem_offset[i] = mem_off;
}
size[i] = elmt_size;
file_offset[i] = 0;
mem_offset[i] = 0;
/* Write data to the file */
if (H5F_arr_write(f, xfer_parms, layout, pline, NULL, efl, size,
size, mem_offset, file_offset, buf)<0) {
HRETURN_ERROR(H5E_IO, H5E_WRITEERROR, FAIL,
"unable to write data to the file");
}
*must_convert = FALSE;
fall_through:
FUNC_LEAVE(SUCCEED);
}
/*--------------------------------------------------------------------------
NAME
H5S_all_release
PURPOSE
Release all selection information for a dataspace
USAGE
herr_t H5S_all_release(space)
H5S_t *space; IN: Pointer to dataspace
RETURNS
Non-negative on success/Negative on failure
DESCRIPTION
Releases "all" selection information for a dataspace
GLOBAL VARIABLES
COMMENTS, BUGS, ASSUMPTIONS
EXAMPLES
REVISION LOG
--------------------------------------------------------------------------*/
herr_t
H5S_all_release (H5S_t UNUSED *space)
{
FUNC_ENTER (H5S_all_release, FAIL);
/* Check args */
assert (space);
FUNC_LEAVE (SUCCEED);
} /* H5S_all_release() */
/*--------------------------------------------------------------------------
NAME
H5S_all_npoints
PURPOSE
Compute number of elements in current selection
USAGE
hsize_t H5S_all_npoints(space)
H5S_t *space; IN: Pointer to dataspace
RETURNS
The number of elements in selection on success, 0 on failure
DESCRIPTION
Compute number of elements in current selection. For "all" selections,
this is the same as the number of points in the extent.
GLOBAL VARIABLES
COMMENTS, BUGS, ASSUMPTIONS
EXAMPLES
REVISION LOG
--------------------------------------------------------------------------*/
hsize_t
H5S_all_npoints (const H5S_t *space)
{
intn i; /* Counters */
hsize_t ret_value;
FUNC_ENTER (H5S_all_npoints, 0);
/* Check args */
assert (space);
for(i=0, ret_value=1; i<space->extent.u.simple.rank; i++)
ret_value*=space->extent.u.simple.size[i];
FUNC_LEAVE (ret_value);
} /* H5S_all_npoints() */
/*--------------------------------------------------------------------------
NAME
H5S_all_select_serialize
PURPOSE
Serialize the current selection into a user-provided buffer.
USAGE
herr_t H5S_all_select_serialize(space, buf)
H5S_t *space; IN: Dataspace pointer of selection to serialize
uint8 *buf; OUT: Buffer to put serialized selection into
RETURNS
Non-negative on success/Negative on failure
DESCRIPTION
Serializes the current element selection into a buffer. (Primarily for
storing on disk).
GLOBAL VARIABLES
COMMENTS, BUGS, ASSUMPTIONS
EXAMPLES
REVISION LOG
--------------------------------------------------------------------------*/
herr_t
H5S_all_select_serialize (const H5S_t *space, uint8_t *buf)
{
herr_t ret_value=FAIL; /* return value */
FUNC_ENTER (H5S_all_select_serialize, FAIL);
assert(space);
/* Store the preamble information */
UINT32ENCODE(buf, (uint32_t)space->select.type); /* Store the type of selection */
UINT32ENCODE(buf, (uint32_t)1); /* Store the version number */
UINT32ENCODE(buf, (uint32_t)0); /* Store the un-used padding */
UINT32ENCODE(buf, (uint32_t)0); /* Store the additional information length */
/* Set success */
ret_value=SUCCEED;
FUNC_LEAVE (ret_value);
} /* H5S_all_select_serialize() */
/*--------------------------------------------------------------------------
NAME
H5S_all_select_deserialize
PURPOSE
Deserialize the current selection from a user-provided buffer.
USAGE
herr_t H5S_all_select_deserialize(space, buf)
H5S_t *space; IN/OUT: Dataspace pointer to place selection into
uint8 *buf; IN: Buffer to retrieve serialized selection from
RETURNS
Non-negative on success/Negative on failure
DESCRIPTION
Deserializes the current selection into a buffer. (Primarily for retrieving
from disk).
GLOBAL VARIABLES
COMMENTS, BUGS, ASSUMPTIONS
EXAMPLES
REVISION LOG
--------------------------------------------------------------------------*/
herr_t
H5S_all_select_deserialize (H5S_t *space, const uint8_t UNUSED *buf)
{
herr_t ret_value=FAIL; /* return value */
FUNC_ENTER (H5S_all_select_deserialize, FAIL);
assert(space);
/* Change to "all" selection */
if((ret_value=H5S_select_all(space))<0) {
HGOTO_ERROR(H5E_DATASPACE, H5E_CANTDELETE, FAIL, "can't change selection");
} /* end if */
done:
FUNC_LEAVE (ret_value);
} /* H5S_all_select_deserialize() */
/*--------------------------------------------------------------------------
NAME
H5S_all_bounds
PURPOSE
Gets the bounding box containing the selection.
USAGE
herr_t H5S_all_bounds(space, hsize_t *start, hsize_t *end)
H5S_t *space; IN: Dataspace pointer of selection to query
hsize_t *start; OUT: Starting coordinate of bounding box
hsize_t *end; OUT: Opposite coordinate of bounding box
RETURNS
Non-negative on success, negative on failure
DESCRIPTION
Retrieves the bounding box containing the current selection and places
it into the user's buffers. The start and end buffers must be large
enough to hold the dataspace rank number of coordinates. The bounding box
exactly contains the selection, ie. if a 2-D element selection is currently
defined with the following points: (4,5), (6,8) (10,7), the bounding box
with be (4, 5), (10, 8). Calling this function on a "none" selection
returns fail.
GLOBAL VARIABLES
COMMENTS, BUGS, ASSUMPTIONS
EXAMPLES
REVISION LOG
--------------------------------------------------------------------------*/
herr_t
H5S_all_bounds(H5S_t *space, hsize_t *start, hsize_t *end)
{
intn rank; /* Dataspace rank */
intn i; /* index variable */
herr_t ret_value=SUCCEED; /* return value */
FUNC_ENTER (H5S_all_bounds, FAIL);
assert(space);
assert(start);
assert(end);
/* Get the dataspace extent rank */
rank=space->extent.u.simple.rank;
/* Just copy over the complete extent */
for(i=0; i<rank; i++) {
start[i]=0;
end[i]=space->extent.u.simple.size[i]-1;
} /* end for */
FUNC_LEAVE (ret_value);
} /* H5Sget_all_bounds() */
/*--------------------------------------------------------------------------
NAME
H5S_all_select_iterate
PURPOSE
Iterate over a "all" selection, calling a user's function for each
element.
USAGE
herr_t H5S_all_select_iterate(buf, type_id, space, operator, operator_data)
void *buf; IN/OUT: Buffer containing elements to iterate over
hid_t type_id; IN: Datatype ID of BUF array.
H5S_t *space; IN: Dataspace object containing selection to iterate over
H5D_operator_t operator; IN: Function pointer to the routine to be
called for each element in BUF iterated over.
void *operator_data; IN/OUT: Pointer to any user-defined data
associated with the operation.
RETURNS
Returns the return value of the last operator if it was non-zero, or zero
if all elements were processed. Otherwise returns a negative value.
DESCRIPTION
Iterates over the selected elements in a memory buffer, calling the user's
callback function for each element. The selection in the dataspace is
modified so that any elements already iterated over are removed from the
selection if the iteration is interrupted (by the H5D_operator_t function
returning non-zero) in the "middle" of the iteration and may be re-started
by the user where it left off.
NOTE: Until "subtracting" elements from a selection is implemented,
the selection is not modified.
GLOBAL VARIABLES
COMMENTS, BUGS, ASSUMPTIONS
EXAMPLES
REVISION LOG
--------------------------------------------------------------------------*/
herr_t
H5S_all_select_iterate(void *buf, hid_t type_id, H5S_t *space, H5D_operator_t operator,
void *operator_data)
{
hsize_t mem_size[H5O_LAYOUT_NDIMS]; /* Dataspace size */
hsize_t mem_offset[H5O_LAYOUT_NDIMS]; /* current coordinates */
hsize_t offset; /* offset of region in buffer */
hsize_t nelemts; /* Number of elements to iterate through */
void *tmp_buf; /* temporary location of the element in the buffer */
intn rank; /* Dataspace rank */
intn index; /* Index to increment */
herr_t ret_value=0; /* return value */
FUNC_ENTER (H5S_all_select_iterate, 0);
assert(buf);
assert(space);
assert(operator);
assert(H5I_DATATYPE == H5I_get_type(type_id));
/* Get the dataspace extent rank */
rank=space->extent.u.simple.rank;
/* Set up the size of the memory space */
HDmemcpy(mem_size, space->extent.u.simple.size, rank*sizeof(hsize_t));
mem_size[rank]=H5Tget_size(type_id);
/* Set the coordinates to zero */
HDmemset(mem_offset, 0, (rank+1)*sizeof(hsize_t));
/* Get the number of elements to iterate through */
nelemts=H5S_get_simple_extent_npoints(space);
/* Iterate through the entire dataset */
while(nelemts>0 && ret_value==0) {
/* Get the offset in the memory buffer */
offset=H5V_array_offset(rank+1,mem_size,mem_offset);
tmp_buf=((char *)buf+offset);
ret_value=(*operator)(tmp_buf,type_id,rank,mem_offset,operator_data);
/* Advance the coordinate (currently in C memory order) */
index=rank-1; /* Leave the byte offset in the element alone */
while(++mem_offset[index]==mem_size[index] && index>=0) {
mem_offset[index]=0;
index--;
} /* end while */
/* Decrement the number of elements to iterate through */
nelemts--;
} /* end while */
FUNC_LEAVE (ret_value);
} /* H5S_all_select_iterate() */
|