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
|
/*
* Copyright (c) International Business Machines Corp., 2006
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
* the GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
* Author: Artem B. Bityutskiy
*
* Test test checks basic volume creation and deletion capabilities.
*/
#include <stdio.h>
#include <errno.h>
#include <string.h>
#include "libubi.h"
#define PROGRAM_NAME "mkvol_basic"
#include "common.h"
#include "helpers.h"
static libubi_t libubi;
static struct ubi_dev_info dev_info;
const char *node;
/**
* mkvol_alignment - create volumes with different alignments.
*
* Thus function returns %0 in case of success and %-1 in case of failure.
*/
static int mkvol_alignment(void)
{
struct ubi_mkvol_request req;
int i, vol_id, ebsz;
const char *name = PROGRAM_NAME ":mkvol_alignment()";
int alignments[] = ALIGNMENTS(dev_info.leb_size);
for (i = 0; i < sizeof(alignments)/sizeof(int); i++) {
req.vol_id = UBI_VOL_NUM_AUTO;
/* Alignment should actually be multiple of min. I/O size */
req.alignment = alignments[i];
req.alignment -= req.alignment % dev_info.min_io_size;
if (req.alignment == 0)
req.alignment = dev_info.min_io_size;
/* Bear in mind alignment reduces EB size */
ebsz = dev_info.leb_size - dev_info.leb_size % req.alignment;
req.bytes = dev_info.avail_lebs * ebsz;
req.vol_type = UBI_DYNAMIC_VOLUME;
req.name = name;
if (ubi_mkvol(libubi, node, &req)) {
failed("ubi_mkvol");
errorm("alignment %d", req.alignment);
return -1;
}
vol_id = req.vol_id;
if (check_volume(vol_id, &req))
goto remove;
if (ubi_rmvol(libubi, node, vol_id)) {
failed("ubi_rmvol");
return -1;
}
}
return 0;
remove:
ubi_rmvol(libubi, node, vol_id);
return -1;
}
/**
* mkvol_basic - simple test that checks basic volume creation capability.
*
* Thus function returns %0 in case of success and %-1 in case of failure.
*/
static int mkvol_basic(void)
{
struct ubi_mkvol_request req;
struct ubi_vol_info vol_info;
int vol_id, ret;
const char *name = PROGRAM_NAME ":mkvol_basic()";
/* Create dynamic volume of maximum size */
req.vol_id = UBI_VOL_NUM_AUTO;
req.alignment = 1;
req.bytes = dev_info.avail_bytes;
req.vol_type = UBI_DYNAMIC_VOLUME;
req.name = name;
if (ubi_mkvol(libubi, node, &req)) {
failed("ubi_mkvol");
return -1;
}
vol_id = req.vol_id;
if (check_volume(vol_id, &req))
goto remove;
if (ubi_rmvol(libubi, node, vol_id)) {
failed("ubi_rmvol");
return -1;
}
/* Create static volume of maximum size */
req.vol_id = UBI_VOL_NUM_AUTO;
req.alignment = 1;
req.bytes = dev_info.avail_bytes;
req.vol_type = UBI_STATIC_VOLUME;
req.name = name;
if (ubi_mkvol(libubi, node, &req)) {
failed("ubi_mkvol");
return -1;
}
vol_id = req.vol_id;
if (check_volume(vol_id, &req))
goto remove;
if (ubi_rmvol(libubi, node, vol_id)) {
failed("ubi_rmvol");
return -1;
}
/* Make sure volume does not exist */
ret = ubi_get_vol_info1(libubi, dev_info.dev_num, vol_id, &vol_info);
if (ret == 0) {
errorm("removed volume %d exists", vol_id);
goto remove;
}
return 0;
remove:
ubi_rmvol(libubi, node, vol_id);
return -1;
}
/**
* mkvol_multiple - test multiple volumes creation
*
* Thus function returns %0 if the test passed and %-1 if not.
*/
static int mkvol_multiple(void)
{
struct ubi_mkvol_request req;
int i, ret, max = dev_info.max_vol_count;
const char *name = PROGRAM_NAME ":mkvol_multiple()";
/* Create maximum number of volumes */
for (i = 0; i < max; i++) {
char nm[strlen(name) + 50];
req.vol_id = UBI_VOL_NUM_AUTO;
req.alignment = 1;
req.bytes = 1;
req.vol_type = UBI_STATIC_VOLUME;
sprintf(nm, "%s:%d", name, i);
req.name = nm;
if (ubi_mkvol(libubi, node, &req)) {
if (errno == ENFILE) {
max = i;
break;
}
failed("ubi_mkvol");
errorm("vol_id %d", i);
goto remove;
}
if (check_volume(req.vol_id, &req)) {
errorm("vol_id %d", i);
goto remove;
}
}
for (i = 0; i < max; i++) {
struct ubi_vol_info vol_info;
if (ubi_rmvol(libubi, node, i)) {
failed("ubi_rmvol");
return -1;
}
/* Make sure volume does not exist */
ret = ubi_get_vol_info1(libubi, dev_info.dev_num, i, &vol_info);
if (ret == 0) {
errorm("removed volume %d exists", i);
goto remove;
}
}
return 0;
remove:
for (i = 0; i < dev_info.max_vol_count + 1; i++)
ubi_rmvol(libubi, node, i);
return -1;
}
int main(int argc, char * const argv[])
{
if (initial_check(argc, argv))
return 1;
node = argv[1];
libubi = libubi_open();
if (libubi == NULL) {
failed("libubi_open");
return 1;
}
if (ubi_get_dev_info(libubi, node, &dev_info)) {
failed("ubi_get_dev_info");
goto close;
}
if (mkvol_basic())
goto close;
if (mkvol_alignment())
goto close;
if (mkvol_multiple())
goto close;
libubi_close(libubi);
return 0;
close:
libubi_close(libubi);
return 1;
}
|
