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
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
|
/*
* volume_id - reads volume label and uuid
*
* Copyright (C) 2005-2007 Kay Sievers <kay.sievers@vrfy.org>
*
* 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 version 2 of the License.
*/
#ifndef _GNU_SOURCE
#define _GNU_SOURCE 1
#endif
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <errno.h>
#include <ctype.h>
#include <fcntl.h>
#include <sys/stat.h>
#include "libvolume_id.h"
#include "libvolume_id-private.h"
#include "util.h"
#define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
struct prober {
volume_id_probe_fn_t prober;
const char *name[4];
};
static const struct prober prober_raid[] = {
{ volume_id_probe_linux_raid, { "linux_raid", } },
{ volume_id_probe_ddf_raid, { "ddf_raid", } },
{ volume_id_probe_intel_software_raid, { "isw_raid", } },
{ volume_id_probe_lsi_mega_raid, { "lsi_mega_raid", } },
{ volume_id_probe_via_raid, { "via_raid", } },
{ volume_id_probe_silicon_medley_raid, { "silicon_medley_raid", } },
{ volume_id_probe_nvidia_raid, { "nvidia_raid", } },
{ volume_id_probe_promise_fasttrack_raid, { "promise_fasttrack_raid", } },
{ volume_id_probe_highpoint_45x_raid, { "highpoint_raid", } },
{ volume_id_probe_adaptec_raid, { "adaptec_raid", } },
{ volume_id_probe_jmicron_raid, { "jmicron_raid", } },
{ volume_id_probe_lvm1, { "lvm1", } },
{ volume_id_probe_lvm2, { "lvm2", } },
{ volume_id_probe_highpoint_37x_raid, { "highpoint_raid", } },
};
static const struct prober prober_filesystem[] = {
{ volume_id_probe_vfat, { "vfat", } },
{ volume_id_probe_linux_swap, { "swap", } },
{ volume_id_probe_luks, { "luks", } },
{ volume_id_probe_xfs, { "xfs", } },
{ volume_id_probe_ext, { "ext2", "ext3", "jbd", } },
{ volume_id_probe_reiserfs, { "reiserfs", "reiser4", } },
{ volume_id_probe_jfs, { "jfs", } },
{ volume_id_probe_udf, { "udf", } },
{ volume_id_probe_iso9660, { "iso9660", } },
{ volume_id_probe_hfs_hfsplus, { "hfs", "hfsplus", } },
{ volume_id_probe_ufs, { "ufs", } },
{ volume_id_probe_ntfs, { "ntfs", } },
{ volume_id_probe_cramfs, { "cramfs", } },
{ volume_id_probe_romfs, { "romfs", } },
{ volume_id_probe_hpfs, { "hpfs", } },
{ volume_id_probe_sysv, { "sysv", "xenix", } },
{ volume_id_probe_minix, { "minix", } },
{ volume_id_probe_gfs, { "gfs", } },
{ volume_id_probe_gfs2, { "gfs2", } },
{ volume_id_probe_ocfs1, { "ocfs1", } },
{ volume_id_probe_ocfs2, { "ocfs2", } },
{ volume_id_probe_vxfs, { "vxfs", } },
{ volume_id_probe_squashfs, { "squashfs", } },
{ volume_id_probe_netware, { "netware", } },
{ volume_id_probe_oracleasm, { "oracleasm", } },
};
/* the user can overwrite this log function */
static void default_log(int priority, const char *file, int line, const char *format, ...)
{
return;
}
volume_id_log_fn_t volume_id_log_fn = default_log;
/**
* volume_id_get_prober_by_type:
* @type: Type string.
*
* Lookup the probing function for a specific type.
*
* Returns: The probing function for the given type, #NULL otherwise.
**/
const volume_id_probe_fn_t *volume_id_get_prober_by_type(const char *type)
{
unsigned int p, n;
if (type == NULL)
return NULL;
for (p = 0; p < ARRAY_SIZE(prober_raid); p++)
for (n = 0; prober_raid[p].name[n] != NULL; n++)
if (strcmp(type, prober_raid[p].name[n]) == 0)
return &prober_raid[p].prober;
for (p = 0; p < ARRAY_SIZE(prober_filesystem); p++)
for (n = 0; prober_filesystem[p].name[n] != NULL; n++)
if (strcmp(type, prober_filesystem[p].name[n]) == 0)
return &prober_filesystem[p].prober;
return NULL;
}
/**
* volume_id_get_label:
* @id: Probing context.
* @label: Label string. Must not be freed by the caller.
*
* Get the label string after a successful probe. Unicode
* is translated to UTF-8.
*
* Returns: 1 if the value was set, 0 otherwise.
**/
int volume_id_get_label(struct volume_id *id, const char **label)
{
if (id == NULL)
return 0;
if (label == NULL)
return 0;
if (id->usage_id == VOLUME_ID_UNUSED)
return 0;
*label = id->label;
return 1;
}
/**
* volume_id_get_label_raw:
* @id: Probing context.
* @label: Label byte array. Must not be freed by the caller.
* @len: Length of raw label byte array.
*
* Get the raw label byte array after a successful probe. It may
* contain undecoded multibyte character streams.
*
* Returns: 1 if the value was set, 0 otherwise.
**/
int volume_id_get_label_raw(struct volume_id *id, const uint8_t **label, size_t *len)
{
if (id == NULL)
return 0;
if (label == NULL)
return 0;
if (len == NULL)
return 0;
if (id->usage_id == VOLUME_ID_UNUSED)
return 0;
*label = id->label_raw;
*len = id->label_raw_len;
return 1;
}
/**
* volume_id_get_uuid:
* @id: Probing context.
* @uuid: UUID string. Must not be freed by the caller.
*
* Get the raw UUID string after a successful probe.
*
* Returns: 1 if the value was set, 0 otherwise.
**/
int volume_id_get_uuid(struct volume_id *id, const char **uuid)
{
if (id == NULL)
return 0;
if (uuid == NULL)
return 0;
if (id->usage_id == VOLUME_ID_UNUSED)
return 0;
*uuid = id->uuid;
return 1;
}
/**
* volume_id_get_uuid_raw:
* @id: Probing context.
* @uuid: UUID byte array. Must not be freed by the caller.
* @len: Length of raw UUID byte array.
*
* Get the raw UUID byte array after a successful probe. It may
* contain unconverted endianes values.
*
* Returns: 1 if the value was set, 0 otherwise.
**/
int volume_id_get_uuid_raw(struct volume_id *id, const uint8_t **uuid, size_t *len)
{
if (id == NULL)
return 0;
if (uuid == NULL)
return 0;
if (len == NULL)
return 0;
if (id->usage_id == VOLUME_ID_UNUSED)
return 0;
*uuid = id->uuid_raw;
*len = id->uuid_raw_len;
return 1;
}
/**
* volume_id_get_usage:
* @id: Probing context.
* @usage: Usage string. Must not be freed by the caller.
*
* Get the usage string after a successful probe.
*
* Returns: 1 if the value was set, 0 otherwise.
**/
int volume_id_get_usage(struct volume_id *id, const char **usage)
{
if (id == NULL)
return 0;
if (usage == NULL)
return 0;
if (id->usage_id == VOLUME_ID_UNUSED)
return 0;
*usage = id->usage;
return 1;
}
/**
* volume_id_get_type:
* @id: Probing context
* @type: Type string. Must not be freed by the caller.
*
* Get the type string after a successful probe.
*
* Returns: 1 if the value was set, 0 otherwise.
**/
int volume_id_get_type(struct volume_id *id, const char **type)
{
if (id == NULL)
return 0;
if (type == NULL)
return 0;
if (id->usage_id == VOLUME_ID_UNUSED)
return 0;
*type = id->type;
return 1;
}
/**
* volume_id_get_type_version:
* @id: Probing context.
* @type_version: Type version string. Must not be freed by the caller.
*
* Get the Type version string after a successful probe.
*
* Returns: 1 if the value was set, 0 otherwise.
**/
int volume_id_get_type_version(struct volume_id *id, const char **type_version)
{
if (id == NULL)
return 0;
if (type_version == NULL)
return 0;
if (id->usage_id == VOLUME_ID_UNUSED)
return 0;
*type_version = id->type_version;
return 1;
}
static int needs_encoding(const char c)
{
if ((c >= '0' && c <= '9') ||
(c >= 'A' && c <= 'Z') ||
(c >= 'a' && c <= 'z') ||
strchr(ALLOWED_CHARS, c))
return 0;
return 1;
}
/**
* volume_id_encode_string:
* @str: Input string to be encoded.
* @str_enc: Target string to store the encoded input.
* @len: Location to store the encoded string. The target string,
* which may be four times as long as the input string.
*
* Encode all potentially unsafe characters of a string to the
* corresponding hex value prefixed by '\x'.
*
* Returns: 1 if the entire string was copied, 0 otherwise.
**/
int volume_id_encode_string(const char *str, char *str_enc, size_t len)
{
size_t i, j;
if (str == NULL || str_enc == NULL || len == 0)
return 0;
str_enc[0] = '\0';
for (i = 0, j = 0; str[i] != '\0'; i++) {
int seqlen;
seqlen = volume_id_utf8_encoded_valid_unichar(&str[i]);
if (seqlen > 1) {
memcpy(&str_enc[j], &str[i], seqlen);
j += seqlen;
i += (seqlen-1);
} else if (str[i] == '\\' || needs_encoding(str[i])) {
sprintf(&str_enc[j], "\\x%02x", (unsigned char) str[i]);
j += 4;
} else {
str_enc[j] = str[i];
j++;
}
if (j+3 >= len)
goto err;
}
str_enc[j] = '\0';
return 1;
err:
return 0;
}
/* run only once into a timeout for unreadable devices */
static int device_is_readable(struct volume_id *id, uint64_t off)
{
if (volume_id_get_buffer(id, off, 0x200) != NULL)
return 1;
return 0;
}
/**
* volume_id_probe_raid:
* @id: Probing context.
* @off: Probing offset relative to the start of the device.
* @size: Total size of the device.
*
* Probe device for all known raid signatures.
*
* Returns: 0 on successful probe, otherwise negative value.
**/
int volume_id_probe_raid(struct volume_id *id, uint64_t off, uint64_t size)
{
unsigned int i;
if (id == NULL)
return -EINVAL;
if (!device_is_readable(id, off))
return -1;
info("probing at offset 0x%llx, size 0x%llx\n",
(unsigned long long) off, (unsigned long long) size);
for (i = 0; i < ARRAY_SIZE(prober_raid); i++)
if (prober_raid[i].prober(id, off, size) == 0)
goto found;
return -1;
found:
/* If recognized, we free the allocated buffers */
volume_id_free_buffer(id);
return 0;
}
/**
* volume_id_probe_filesystem:
* @id: Probing context.
* @off: Probing offset relative to the start of the device.
* @size: Total size of the device.
*
* Probe device for all known filesystem signatures.
*
* Returns: 0 on successful probe, otherwise negative value.
**/
int volume_id_probe_filesystem(struct volume_id *id, uint64_t off, uint64_t size)
{
unsigned int i;
if (id == NULL)
return -EINVAL;
if (!device_is_readable(id, off))
return -1;
info("probing at offset 0x%llx, size 0x%llx\n",
(unsigned long long) off, (unsigned long long) size);
for (i = 0; i < ARRAY_SIZE(prober_filesystem); i++)
if (prober_filesystem[i].prober(id, off, size) == 0)
goto found;
return -1;
found:
/* If recognized, we free the allocated buffers */
volume_id_free_buffer(id);
return 0;
}
/**
* volume_id_probe_all:
* @id: Probing context.
* @off: Probing offset relative to the start of the device.
* @size: Total size of the device.
*
* Probe device for all known raid and filesystem signatures.
*
* Returns: 0 on successful probe, otherwise negative value.
**/
int volume_id_probe_all(struct volume_id *id, uint64_t off, uint64_t size)
{
if (id == NULL)
return -EINVAL;
if (!device_is_readable(id, off))
return -1;
/* probe for raid first, because fs probes may be successful on raid members */
if (volume_id_probe_raid(id, off, size) == 0)
return 0;
if (volume_id_probe_filesystem(id, off, size) == 0)
return 0;
return -1;
}
/**
* volume_id_probe_raid:
* @all_probers_fn: prober function to called for all known probing routines.
* @id: Context passed to prober function.
* @off: Offset value passed to prober function.
* @size: Size value passed to prober function.
* @data: Arbitrary data passed to the prober function.
*
* Run a custom function for all known probing routines.
**/
void volume_id_all_probers(all_probers_fn_t all_probers_fn,
struct volume_id *id, uint64_t off, uint64_t size,
void *data)
{
unsigned int i;
if (all_probers_fn == NULL)
return;
for (i = 0; i < ARRAY_SIZE(prober_raid); i++)
if (all_probers_fn(prober_raid[i].prober, id, off, size, data) != 0)
goto out;
for (i = 0; i < ARRAY_SIZE(prober_filesystem); i++)
if (all_probers_fn(prober_filesystem[i].prober, id, off, size, data) != 0)
goto out;
out:
return;
}
/**
* volume_id_open_fd:
* @id: Probing context.
* @fd: Open file descriptor of device to read from.
*
* Create the context for probing.
*
* Returns: Probing context, or #NULL on failure.
**/
struct volume_id *volume_id_open_fd(int fd)
{
struct volume_id *id;
id = malloc(sizeof(struct volume_id));
if (id == NULL)
return NULL;
memset(id, 0x00, sizeof(struct volume_id));
id->fd = fd;
return id;
}
/**
* volume_id_close:
* @id: Probing context.
*
* Release probing context and free all associated data.
*/
void volume_id_close(struct volume_id *id)
{
if (id == NULL)
return;
volume_id_free_buffer(id);
free(id);
}
|