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
|
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* 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. *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "hrepack_opttable.h"
/*-------------------------------------------------------------------------
* Function: options_table_init
*
* Purpose: init options table
*
* Return: void
*
*-------------------------------------------------------------------------
*/
void
options_table_init(options_table_t **tbl)
{
int i;
options_table_t *op_tbl = (options_table_t *)malloc(sizeof(options_table_t));
op_tbl->size = 3;
op_tbl->nelems = 0;
op_tbl->objs = (pack_info_t *)malloc(op_tbl->size * sizeof(pack_info_t));
for (i = 0; i < op_tbl->size; i++) {
strcpy(op_tbl->objs[i].objpath, "\0");
op_tbl->objs[i].comp.info = -1;
op_tbl->objs[i].comp.type = COMP_CODE_NONE;
op_tbl->objs[i].chunk.rank = -1;
}
*tbl = op_tbl;
}
/*-------------------------------------------------------------------------
* Function: options_table_free
*
* Purpose: free table memory
*
* Return: void
*
*-------------------------------------------------------------------------
*/
void
options_table_free(options_table_t *op_tbl)
{
free(op_tbl->objs);
free(op_tbl);
}
/*-------------------------------------------------------------------------
* Function: options_add_chunk
*
* Purpose: add a chunking -c option to the option list
*
* Return: SUCCEED, FAIL
*
*-------------------------------------------------------------------------
*/
int
options_add_chunk(obj_list_t *obj_list, int n_objs, int32 *chunk_lengths, int chunk_rank,
options_table_t *op_tbl)
{
int i, j, k, I, added = 0, found = 0;
if (op_tbl->nelems + n_objs >= op_tbl->size) {
op_tbl->size += n_objs;
op_tbl->objs = (pack_info_t *)realloc(op_tbl->objs, op_tbl->size * sizeof(pack_info_t));
for (i = op_tbl->nelems; i < op_tbl->size; i++) {
strcpy(op_tbl->objs[i].objpath, "\0");
op_tbl->objs[i].comp.info = -1;
op_tbl->objs[i].comp.type = COMP_CODE_NONE;
op_tbl->objs[i].chunk.rank = -1;
}
}
/* search if this object is already in the table; "path" is the key */
if (op_tbl->nelems > 0) {
/* go tru the supplied list of names */
for (j = 0; j < n_objs; j++) {
/* linear table search */
for (i = 0; i < op_tbl->nelems; i++) {
/*already on the table */
if (strcmp(obj_list[j].obj, op_tbl->objs[i].objpath) == 0) {
/* already chunk info inserted for this one; exit */
if (op_tbl->objs[i].chunk.rank > 0) {
printf("Input Error: chunk information already inserted for <%s>\n", obj_list[j].obj);
return FAIL;
}
/* insert the chunk info */
else {
op_tbl->objs[i].chunk.rank = chunk_rank;
for (k = 0; k < chunk_rank; k++)
op_tbl->objs[i].chunk.chunk_lengths[k] = chunk_lengths[k];
found = 1;
break;
}
} /* if */
} /* i */
if (found == 0) {
/* keep the grow in a temp var */
I = op_tbl->nelems + added;
added++;
strcpy(op_tbl->objs[I].objpath, obj_list[j].obj);
op_tbl->objs[I].chunk.rank = chunk_rank;
for (k = 0; k < chunk_rank; k++)
op_tbl->objs[I].chunk.chunk_lengths[k] = chunk_lengths[k];
}
} /* j */
}
/* first time insertion */
else {
/* go tru the supplied list of names */
for (j = 0; j < n_objs; j++) {
I = op_tbl->nelems + added;
added++;
strcpy(op_tbl->objs[I].objpath, obj_list[j].obj);
op_tbl->objs[I].chunk.rank = chunk_rank;
for (k = 0; k < chunk_rank; k++)
op_tbl->objs[I].chunk.chunk_lengths[k] = chunk_lengths[k];
}
}
op_tbl->nelems += added;
return SUCCEED;
}
/*-------------------------------------------------------------------------
* Function: options_add_comp
*
* Purpose: add a compression -t option to the option list
*
* Return: SUCCEED, FAIL
*
*-------------------------------------------------------------------------
*/
int
options_add_comp(obj_list_t *obj_list, int n_objs, comp_info_t comp, options_table_t *op_tbl)
{
int i, j, I, added = 0, found = 0;
if (op_tbl->nelems + n_objs >= op_tbl->size) {
op_tbl->size += n_objs;
op_tbl->objs = (pack_info_t *)realloc(op_tbl->objs, op_tbl->size * sizeof(pack_info_t));
for (i = op_tbl->nelems; i < op_tbl->size; i++) {
strcpy(op_tbl->objs[i].objpath, "\0");
op_tbl->objs[i].comp.info = -1;
op_tbl->objs[i].comp.type = COMP_CODE_NONE;
op_tbl->objs[i].chunk.rank = -1;
}
}
/* search if this object is already in the table; "path" is the key */
if (op_tbl->nelems > 0) {
/* go tru the supplied list of names */
for (j = 0; j < n_objs; j++) {
/* linear table search */
for (i = 0; i < op_tbl->nelems; i++) {
/*already on the table */
if (strcmp(obj_list[j].obj, op_tbl->objs[i].objpath) == 0) {
/* already COMP info inserted for this one; exit */
if (op_tbl->objs[i].comp.type > 0) {
printf("Input Error: compression information already inserted for <%s>\n",
obj_list[j].obj);
return FAIL;
}
/* insert the comp info */
else {
op_tbl->objs[i].comp = comp;
found = 1;
break;
}
} /* if */
} /* i */
if (found == 0) {
/* keep the grow in a temp var */
I = op_tbl->nelems + added;
added++;
strcpy(op_tbl->objs[I].objpath, obj_list[j].obj);
op_tbl->objs[I].comp = comp;
}
} /* j */
}
/* first time insertion */
else {
/* go tru the supplied list of names */
for (j = 0; j < n_objs; j++) {
I = op_tbl->nelems + added;
added++;
strcpy(op_tbl->objs[I].objpath, obj_list[j].obj);
op_tbl->objs[I].comp = comp;
}
}
op_tbl->nelems += added;
return 0;
}
/*-------------------------------------------------------------------------
* Function: options_get_object
*
* Purpose: get object from table; "path" is the key
*
* Return: information for one object, contains PATH, CHUNK info and COMP info
*
*-------------------------------------------------------------------------
*/
pack_info_t *
options_get_object(char *path, options_table_t *op_tbl)
{
int i;
for (i = 0; i < op_tbl->nelems; i++) {
/* found it */
if (strcmp(op_tbl->objs[i].objpath, path) == 0) {
return (&op_tbl->objs[i]);
}
}
return NULL;
}
|
