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
|
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* *
* This file is part of HDF. The full HDF copyright notice, including *
* terms governing use, modification, and redistribution, is contained in *
* the COPYING file, which can be found at the root of the source code *
* distribution tree, or in https://support.hdfgroup.org/ftp/HDF/releases/. *
* If you do not have access to either file, you may request a copy from *
* help@hdfgroup.org. *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/*
FILE
gentest.c
Generate files for HDF testing.
REMARKS
This may be a bit of a kludge in some cases, because it's hard
to determine correct output if you don't know if the routine
you are generating the test is working yet.
DESIGN
Each test should have a separate function which creates the datafiles
necessary for testing it.
BUGS/LIMITATIONS
EXPORTED ROUTINES
none
AUTHOR
Quincey Koziol
MODIFICATION HISTORY
10/27/93 - Started coding.
1/20/94 - Added N-bit test generation.
*/
#include "hdf.h"
/* Local definitions of filenames and tag/refs of data in them. */
#define BITIO_NAME "test_files/bitio.dat"
#define BITIO_TAG1 1000
#define BITIO_REF1 1000
#define BITIO_SIZE1 4096
#define NBIT_NAME "test_files/nbit.dat"
#define NBIT_TAG1 (uint16)1000
#define NBIT_REF1 (uint16)1000
#define NBIT_SIZE1 4096
#define NBIT_BITS1 6
static int gen_bitio_test(void);
static int gen_nbit_test(void);
/*--------------------------------------------------------------------------
NAME
gen_bitio_test -- create datafiles for bitio test
USAGE
int gen_bitio_test()
RETURNS
returns SUCCEED or FAIL
DESCRIPTION
Writes out a sample dataset to the bitio datafile so that
we can test bitio reading before bitio writing.
GLOBAL VARIABLES
COMMENTS, BUGS, ASSUMPTIONS
EXAMPLES
REVISION LOG
--------------------------------------------------------------------------*/
static int
gen_bitio_test(void)
{
int32 fid; /* file ID of bitio HDF file */
uint8 *bit_data; /* pointer to the data to store in the datafile */
intn i; /* local counting variable */
if ((fid = Hopen(BITIO_NAME, DFACC_CREATE, 0)) == FAIL)
return FAIL;
if ((bit_data = (uint8 *)malloc(BITIO_SIZE1 * sizeof(uint8))) == NULL) {
Hclose(fid);
return FAIL;
} /* end if */
for (i = 0; i < BITIO_SIZE1; i++) /* fill with pseudo-random data */
bit_data[i] = (uint8)((i * 3) % 256);
if (FAIL == Hputelement(fid, BITIO_TAG1, BITIO_REF1, bit_data, BITIO_SIZE1)) {
free(bit_data);
Hclose(fid);
return FAIL;
}
free(bit_data);
if (FAIL == Hclose(fid))
return FAIL;
return SUCCEED;
} /* end gen_bitio_test() */
/*--------------------------------------------------------------------------
NAME
gen_nbit_test -- create datafiles for n-bit test
USAGE
int gen_nbit_test()
RETURNS
returns SUCCEED or FAIL
DESCRIPTION
Writes out a sample dataset to a sample datafile so that
we can test n-bit writing before n-bit reading.
GLOBAL VARIABLES
COMMENTS, BUGS, ASSUMPTIONS
EXAMPLES
REVISION LOG
--------------------------------------------------------------------------*/
static int
gen_nbit_test(void)
{
int32 fid; /* file ID of n-bit HDF file */
uint8 *nbit_data; /* pointer to the initial data */
uint8 *out_data; /* pointer to the data to store in the datafile */
uint32 store; /* temporary storage for outgoing bits */
intn store_bits; /* number of bits stored */
uintn out_num; /* number of bytes to output */
intn i; /* local counting variable */
if ((fid = Hopen(NBIT_NAME, DFACC_CREATE, 0)) == FAIL)
return FAIL;
if ((nbit_data = (uint8 *)malloc(NBIT_SIZE1 * sizeof(uint8))) == NULL) {
Hclose(fid);
return FAIL;
}
if ((out_data = (uint8 *)malloc(NBIT_SIZE1 * sizeof(uint8))) == NULL) {
free(nbit_data);
Hclose(fid);
return FAIL;
}
for (i = 0; i < NBIT_SIZE1; i++) /* fill with pseudo-random data */
nbit_data[i] = (uint8)((i * 3) % 64);
store = 0;
store_bits = 0;
out_num = 0;
for (i = 0; i < NBIT_SIZE1; i++) { /* pack the bits together */
store <<= NBIT_BITS1;
store |= (uint32)nbit_data[i] & (uint32)maskc[NBIT_BITS1];
store_bits += NBIT_BITS1;
if (store_bits >= (intn)BITNUM) { /* have at least a full byte */
out_data[out_num] = (uint8)((store >> (store_bits - (intn)BITNUM)) & (uint32)maskc[8]);
out_num++;
store_bits -= (intn)BITNUM;
store >>= BITNUM;
} /* end if */
} /* end for */
if (store_bits > 0) { /* push over any leftover bits to the left */
out_data[out_num] = (uint8)(store << ((intn)BITNUM - store_bits));
out_num++;
} /* end if */
if (FAIL == Hputelement(fid, NBIT_TAG1, NBIT_REF1, out_data, (int32)out_num)) {
free(nbit_data);
free(out_data);
Hclose(fid);
return FAIL;
} /* end if */
free(nbit_data);
free(out_data);
if (FAIL == Hclose(fid))
return FAIL;
return SUCCEED;
} /* end gen_nbit_test() */
int
main(void)
{
gen_bitio_test();
gen_nbit_test();
return EXIT_SUCCESS;
} /* end main() */
|
