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
|
/*
* Copyright (C) 2007, 2008 Nokia Corporation
*
* 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.
*/
/*
* This file contains various common stuff.
*
* Authors: Artem Bityutskiy
* Adrian Hunter
*/
#define PROGRAM_NAME "mtd-utils"
#include <sys/time.h>
#include <sys/types.h>
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <stdlib.h>
#include <unistd.h>
#include "common.h"
#include "libmtd.h"
#define MTD_DEV_PATT "/dev/mtd%d"
/**
* get_multiplier - convert size specifier to an integer multiplier.
* @str: the size specifier string
*
* This function parses the @str size specifier, which may be one of
* 'KiB', 'MiB', or 'GiB' into an integer multiplier. Returns positive
* size multiplier in case of success and %-1 in case of failure.
*/
static int get_multiplier(const char *str)
{
if (!str)
return 1;
/* Remove spaces before the specifier */
while (*str == ' ' || *str == '\t')
str += 1;
if (!strcmp(str, "KiB"))
return 1024;
if (!strcmp(str, "MiB"))
return 1024 * 1024;
if (!strcmp(str, "GiB"))
return 1024 * 1024 * 1024;
return -1;
}
/**
* util_get_bytes - convert a string containing amount of bytes into an
* integer
* @str: string to convert
*
* This function parses @str which may have one of 'KiB', 'MiB', or 'GiB'
* size specifiers. Returns positive amount of bytes in case of success and %-1
* in case of failure.
*/
long long util_get_bytes(const char *str)
{
char *endp;
long long bytes = strtoull(str, &endp, 0);
if (endp == str || bytes < 0) {
fprintf(stderr, "incorrect amount of bytes: \"%s\"\n", str);
return -1;
}
if (*endp != '\0') {
int mult = get_multiplier(endp);
if (mult == -1) {
fprintf(stderr, "bad size specifier: \"%s\" - "
"should be 'KiB', 'MiB' or 'GiB'\n", endp);
return -1;
}
bytes *= mult;
}
return bytes;
}
/**
* util_print_bytes - print bytes.
* @bytes: variable to print
* @bracket: whether brackets have to be put or not
*
* This is a helper function which prints amount of bytes in a human-readable
* form, i.e., it prints the exact amount of bytes following by the approximate
* amount of Kilobytes, Megabytes, or Gigabytes, depending on how big @bytes
* is.
*/
void util_print_bytes(long long bytes, int bracket)
{
const char *p;
int GiB = 1024 * 1024 * 1024;
int MiB = 1024 * 1024;
int KiB = 1024;
if (bracket)
p = " (";
else
p = ", ";
printf("%lld bytes", bytes);
if (bytes > GiB)
printf("%s%lld.%lld GiB", p,
bytes / GiB, bytes % GiB / (GiB / 10));
else if (bytes > MiB)
printf("%s%lld.%lld MiB", p,
bytes / MiB, bytes % MiB / (MiB / 10));
else if (bytes > KiB && bytes != 0)
printf("%s%lld.%lld KiB", p,
bytes / KiB, bytes % KiB / (KiB / 10));
else
return;
if (bracket)
printf(")");
}
/**
* util_srand - randomly seed the standard pseudo-random generator.
*
* This helper function seeds the standard libc pseudo-random generator with a
* more or less random value to make sure the 'rand()' call does not return the
* same sequence every time UBI utilities run. Returns zero in case of success
* and a %-1 in case of error.
*/
int util_srand(void)
{
struct timeval tv;
struct timezone tz;
unsigned int seed;
/*
* Just assume that a combination of the PID + current time is a
* reasonably random number.
*/
if (gettimeofday(&tv, &tz))
return -1;
seed = (unsigned int)tv.tv_sec;
seed += (unsigned int)tv.tv_usec;
seed *= getpid();
seed %= RAND_MAX;
srand(seed);
return 0;
}
/**
* mtd_find_dev_node - Find the device node for an MTD
* @id: Identifier for the MTD. this can be the device node itself, or
* "mtd:<name>" to look up MTD by name
*
* This is a helper function to convert MTD device identifiers into their
* device node.
*
* Returns a pointer to a string containing the device node that must be
* free'd, or NULL on failure.
*/
char *mtd_find_dev_node(const char *id)
{
struct mtd_dev_info info;
struct libmtd_t *lib_mtd;
char *node;
int ret;
if (strncmp(id, "mtd:", 4)) {
/* Assume @id is the device node */
return strdup(id);
}
/* Search for MTD matching name */
id += 4;
lib_mtd = libmtd_open();
if (!lib_mtd)
return NULL;
ret = mtd_get_dev_info2(lib_mtd, id, &info);
libmtd_close(lib_mtd);
if (ret < 0)
return NULL;
node = malloc(strlen(MTD_DEV_PATT) + 20);
if (!node)
return NULL;
sprintf(node, MTD_DEV_PATT, info.mtd_num);
return node;
}
|
