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
|
/*
* 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 basic UBI volume I/O capabilities.
*/
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include "libubi.h"
#define PROGRAM_NAME "io_basic"
#include "common.h"
#include "helpers.h"
static libubi_t libubi;
static struct ubi_dev_info dev_info;
const char *node;
/**
* test_basic - check basic volume read and update capabilities.
*
* @type volume type (%UBI_DYNAMIC_VOLUME or %UBI_STATIC_VOLUME)
*
* Thus function returns %0 in case of success and %-1 in case of failure.
*/
static int test_basic(int type)
{
struct ubi_mkvol_request req;
const char *name = PROGRAM_NAME ":test_basic()";
char vol_node[strlen(UBI_VOLUME_PATTERN) + 100];
req.vol_id = UBI_VOL_NUM_AUTO;
req.alignment = 1;
req.bytes = dev_info.avail_bytes;
req.vol_type = type;
req.name = name;
if (ubi_mkvol(libubi, node, &req)) {
failed("ubi_mkvol");
return -1;
}
sprintf(vol_node, UBI_VOLUME_PATTERN, dev_info.dev_num, req.vol_id);
/* Make sure newly created volume contains only 0xFF bytes */
if (check_vol_patt(vol_node, 0xFF))
goto remove;
/* Write 0xA5 bytes to the volume */
if (update_vol_patt(vol_node, dev_info.avail_bytes, 0xA5))
goto remove;
if (check_vol_patt(vol_node, 0xA5))
goto remove;
if (ubi_rmvol(libubi, node, req.vol_id)) {
failed("ubi_rmvol");
return -1;
}
return 0;
remove:
ubi_rmvol(libubi, node, req.vol_id);
return -1;
}
/**
* test_aligned - test volume alignment feature.
*
* @type volume type (%UBI_DYNAMIC_VOLUME or %UBI_STATIC_VOLUME)
*
* Thus function returns %0 in case of success and %-1 in case of failure.
*/
static int test_aligned(int type)
{
unsigned int i, ebsz;
struct ubi_mkvol_request req;
const char *name = PROGRAM_NAME ":test_aligned()";
char vol_node[strlen(UBI_VOLUME_PATTERN) + 100];
int alignments[] = ALIGNMENTS(dev_info.leb_size);
req.vol_type = type;
req.name = name;
for (i = 0; i < sizeof(alignments)/sizeof(int); i++) {
req.vol_id = UBI_VOL_NUM_AUTO;
req.alignment = alignments[i];
req.alignment -= req.alignment % dev_info.min_io_size;
if (req.alignment == 0)
req.alignment = dev_info.min_io_size;
ebsz = dev_info.leb_size - dev_info.leb_size % req.alignment;
req.bytes = MIN_AVAIL_EBS * ebsz;
if (ubi_mkvol(libubi, node, &req)) {
failed("ubi_mkvol");
return -1;
}
sprintf(vol_node, UBI_VOLUME_PATTERN, dev_info.dev_num, req.vol_id);
/* Make sure newly created volume contains only 0xFF bytes */
if (check_vol_patt(vol_node, 0xFF))
goto remove;
/* Write 0xA5 bytes to the volume */
if (update_vol_patt(vol_node, req.bytes, 0xA5))
goto remove;
if (check_vol_patt(vol_node, 0xA5))
goto remove;
if (ubi_rmvol(libubi, node, req.vol_id)) {
failed("ubi_rmvol");
return -1;
}
}
return 0;
remove:
ubi_rmvol(libubi, node, req.vol_id);
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 (test_basic(UBI_DYNAMIC_VOLUME))
goto close;
if (test_basic(UBI_STATIC_VOLUME))
goto close;
if (test_aligned(UBI_DYNAMIC_VOLUME))
goto close;
if (test_aligned(UBI_STATIC_VOLUME))
goto close;
libubi_close(libubi);
return 0;
close:
libubi_close(libubi);
return 1;
}
|
