forked from md-raid-utilities/mdadm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
util.c
2586 lines (2270 loc) · 57.1 KB
/
util.c
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
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* mdadm - manage Linux "md" devices aka RAID arrays.
*
* Copyright (C) 2001-2013 Neil Brown <[email protected]>
*
*
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Author: Neil Brown
* Email: <[email protected]>
*/
#include "mdadm.h"
#include "md_p.h"
#include <sys/socket.h>
#include <sys/utsname.h>
#include <sys/wait.h>
#include <sys/un.h>
#include <sys/resource.h>
#include <sys/vfs.h>
#include <sys/mman.h>
#include <linux/magic.h>
#include <poll.h>
#include <ctype.h>
#include <dirent.h>
#include <dlfcn.h>
#include <limits.h>
/*
* following taken from linux/blkpg.h because they aren't
* anywhere else and it isn't safe to #include linux/ * stuff.
*/
#define BLKPG _IO(0x12,105)
/* The argument structure */
struct blkpg_ioctl_arg {
int op;
int flags;
int datalen;
void *data;
};
/* The subfunctions (for the op field) */
#define BLKPG_ADD_PARTITION 1
#define BLKPG_DEL_PARTITION 2
/* Sizes of name fields. Unused at present. */
#define BLKPG_DEVNAMELTH 64
#define BLKPG_VOLNAMELTH 64
/* The data structure for ADD_PARTITION and DEL_PARTITION */
struct blkpg_partition {
long long start; /* starting offset in bytes */
long long length; /* length in bytes */
int pno; /* partition number */
char devname[BLKPG_DEVNAMELTH]; /* partition name, like sda5 or c0d1p2,
to be used in kernel messages */
char volname[BLKPG_VOLNAMELTH]; /* volume label */
};
#include "part.h"
/* Force a compilation error if condition is true */
#define BUILD_BUG_ON(condition) ((void)BUILD_BUG_ON_ZERO(condition))
/* Force a compilation error if condition is true, but also produce a
result (of value 0 and type size_t), so the expression can be used
e.g. in a structure initializer (or where-ever else comma expressions
aren't permitted). */
#define BUILD_BUG_ON_ZERO(e) (sizeof(struct { int:-!!(e); }))
static int is_dlm_hooks_ready = 0;
int dlm_funs_ready(void)
{
return is_dlm_hooks_ready ? 1 : 0;
}
static struct dlm_hooks *dlm_hooks = NULL;
struct dlm_lock_resource *dlm_lock_res = NULL;
static int ast_called = 0;
struct dlm_lock_resource {
dlm_lshandle_t *ls;
struct dlm_lksb lksb;
};
/* Using poll(2) to wait for and dispatch ASTs */
static int poll_for_ast(dlm_lshandle_t ls)
{
struct pollfd pfd;
pfd.fd = dlm_hooks->ls_get_fd(ls);
pfd.events = POLLIN;
while (!ast_called)
{
if (poll(&pfd, 1, 0) < 0)
{
perror("poll");
return -1;
}
dlm_hooks->dispatch(dlm_hooks->ls_get_fd(ls));
}
ast_called = 0;
return 0;
}
static void dlm_ast(void *arg)
{
ast_called = 1;
}
static char *cluster_name = NULL;
/* Create the lockspace, take bitmapXXX locks on all the bitmaps. */
int cluster_get_dlmlock(void)
{
int ret = -1;
char str[64];
int flags = LKF_NOQUEUE;
int retry_count = 0;
if (!dlm_funs_ready()) {
pr_err("Something wrong with dlm library\n");
return -1;
}
ret = get_cluster_name(&cluster_name);
if (ret) {
pr_err("The md can't get cluster name\n");
return -1;
}
dlm_lock_res = xmalloc(sizeof(struct dlm_lock_resource));
dlm_lock_res->ls = dlm_hooks->open_lockspace(cluster_name);
if (!dlm_lock_res->ls) {
dlm_lock_res->ls = dlm_hooks->create_lockspace(cluster_name, O_RDWR);
if (!dlm_lock_res->ls) {
pr_err("%s failed to create lockspace\n", cluster_name);
return -ENOMEM;
}
} else {
pr_err("open existed %s lockspace\n", cluster_name);
}
snprintf(str, 64, "bitmap%s", cluster_name);
retry:
ret = dlm_hooks->ls_lock(dlm_lock_res->ls, LKM_PWMODE,
&dlm_lock_res->lksb, flags, str, strlen(str),
0, dlm_ast, dlm_lock_res, NULL, NULL);
if (ret) {
pr_err("error %d when get PW mode on lock %s\n", errno, str);
/* let's try several times if EAGAIN happened */
if (dlm_lock_res->lksb.sb_status == EAGAIN && retry_count < 10) {
sleep_for(10, 0, true);
retry_count++;
goto retry;
}
dlm_hooks->release_lockspace(cluster_name, dlm_lock_res->ls, 1);
return ret;
}
/* Wait for it to complete */
poll_for_ast(dlm_lock_res->ls);
if (dlm_lock_res->lksb.sb_status) {
pr_err("failed to lock cluster\n");
return -1;
}
return 1;
}
int cluster_release_dlmlock(void)
{
int ret = -1;
if (!cluster_name)
goto out;
if (!dlm_lock_res->lksb.sb_lkid)
goto out;
ret = dlm_hooks->ls_unlock_wait(dlm_lock_res->ls,
dlm_lock_res->lksb.sb_lkid, 0,
&dlm_lock_res->lksb);
if (ret) {
pr_err("error %d happened when unlock\n", errno);
/* XXX make sure the lock is unlocked eventually */
goto out;
}
/* Wait for it to complete */
poll_for_ast(dlm_lock_res->ls);
errno = dlm_lock_res->lksb.sb_status;
if (errno != EUNLOCK) {
pr_err("error %d happened in ast when unlock lockspace\n",
errno);
/* XXX make sure the lockspace is unlocked eventually */
goto out;
}
ret = dlm_hooks->release_lockspace(cluster_name, dlm_lock_res->ls, 1);
if (ret) {
pr_err("error %d happened when release lockspace\n", errno);
/* XXX make sure the lockspace is released eventually */
goto out;
}
free(dlm_lock_res);
out:
return ret;
}
int md_array_valid(int fd)
{
struct mdinfo *sra;
int ret;
sra = sysfs_read(fd, NULL, GET_ARRAY_STATE);
if (sra) {
if (sra->array_state != ARRAY_UNKNOWN_STATE)
ret = 0;
else
ret = -ENODEV;
free(sra);
} else {
/*
* GET_ARRAY_INFO doesn't provide access to the proper state
* information, so fallback to a basic check for raid_disks != 0
*/
ret = ioctl(fd, RAID_VERSION);
}
return !ret;
}
int md_array_active(int fd)
{
struct mdinfo *sra;
struct mdu_array_info_s array;
int ret = 0;
sra = sysfs_read(fd, NULL, GET_ARRAY_STATE);
if (sra) {
if (!md_array_is_active(sra))
ret = -ENODEV;
free(sra);
} else {
/*
* GET_ARRAY_INFO doesn't provide access to the proper state
* information, so fallback to a basic check for raid_disks != 0
*/
ret = md_get_array_info(fd, &array);
}
return !ret;
}
int md_array_is_active(struct mdinfo *info)
{
return (info->array_state != ARRAY_CLEAR &&
info->array_state != ARRAY_INACTIVE &&
info->array_state != ARRAY_UNKNOWN_STATE);
}
/*
* Get array info from the kernel. Longer term we want to deprecate the
* ioctl and get it from sysfs.
*/
int md_get_array_info(int fd, struct mdu_array_info_s *array)
{
return ioctl(fd, GET_ARRAY_INFO, array);
}
/*
* Set array info
*/
int md_set_array_info(int fd, struct mdu_array_info_s *array)
{
return ioctl(fd, SET_ARRAY_INFO, array);
}
/*
* Get disk info from the kernel.
*/
int md_get_disk_info(int fd, struct mdu_disk_info_s *disk)
{
return ioctl(fd, GET_DISK_INFO, disk);
}
int get_linux_version()
{
struct utsname name;
char *cp;
int a = 0, b = 0,c = 0;
if (uname(&name) <0)
return -1;
cp = name.release;
a = strtoul(cp, &cp, 10);
if (*cp == '.')
b = strtoul(cp+1, &cp, 10);
if (*cp == '.')
c = strtoul(cp+1, &cp, 10);
return (a*1000000)+(b*1000)+c;
}
int mdadm_version(char *version)
{
int a, b, c;
char *cp;
if (!version)
version = Version;
cp = strchr(version, '-');
if (!cp || *(cp+1) != ' ' || *(cp+2) != 'v')
return -1;
cp += 3;
a = strtoul(cp, &cp, 10);
if (*cp != '.')
return -1;
b = strtoul(cp+1, &cp, 10);
if (*cp == '.')
c = strtoul(cp+1, &cp, 10);
else
c = 0;
if (*cp != ' ' && *cp != '-')
return -1;
return (a*1000000)+(b*1000)+c;
}
unsigned long long parse_size(char *size)
{
/* parse 'size' which should be a number optionally
* followed by 'K', 'M'. 'G' or 'T'.
* Without a suffix, K is assumed.
* Number returned is in sectors (half-K)
* INVALID_SECTORS returned on error.
*/
char *c;
long long s = strtoll(size, &c, 10);
if (s > 0) {
switch (*c) {
case 'K':
c++;
default:
s *= 2;
break;
case 'M':
c++;
s *= 1024 * 2;
break;
case 'G':
c++;
s *= 1024 * 1024 * 2;
break;
case 'T':
c++;
s *= 1024 * 1024 * 1024 * 2LL;
break;
case 's': /* sectors */
c++;
break;
}
} else
s = INVALID_SECTORS;
if (*c)
s = INVALID_SECTORS;
return s;
}
int is_near_layout_10(int layout)
{
int fc, fo;
fc = (layout >> 8) & 255;
fo = layout & (1 << 16);
if (fc > 1 || fo > 0)
return 0;
return 1;
}
int parse_layout_10(char *layout)
{
int copies, rv;
char *cp;
/* Parse the layout string for raid10 */
/* 'f', 'o' or 'n' followed by a number <= raid_disks */
if ((layout[0] != 'n' && layout[0] != 'f' && layout[0] != 'o') ||
(copies = strtoul(layout+1, &cp, 10)) < 1 ||
copies > 200 ||
*cp)
return -1;
if (layout[0] == 'n')
rv = 256 + copies;
else if (layout[0] == 'o')
rv = 0x10000 + (copies<<8) + 1;
else
rv = 1 + (copies<<8);
return rv;
}
int parse_layout_faulty(char *layout)
{
int ln, mode;
char *m;
if (!layout)
return -1;
/* Parse the layout string for 'faulty' */
ln = strcspn(layout, "0123456789");
m = xstrdup(layout);
m[ln] = 0;
mode = map_name(faultylayout, m);
free(m);
if (mode == UnSet)
return -1;
return mode | (atoi(layout+ln)<< ModeShift);
}
int parse_cluster_confirm_arg(char *input, char **devname, int *slot)
{
char *dev;
*slot = strtoul(input, &dev, 10);
if (dev == input || dev[0] != ':')
return -1;
*devname = dev+1;
return 0;
}
void remove_partitions(int fd)
{
/* remove partitions from this block devices.
* This is used for components added to an array
*/
#ifdef BLKPG_DEL_PARTITION
struct blkpg_ioctl_arg a;
struct blkpg_partition p;
a.op = BLKPG_DEL_PARTITION;
a.data = (void*)&p;
a.datalen = sizeof(p);
a.flags = 0;
memset(a.data, 0, a.datalen);
for (p.pno = 0; p.pno < 16; p.pno++)
ioctl(fd, BLKPG, &a);
#endif
}
int test_partition(int fd)
{
/* Check if fd is a whole-disk or a partition.
* BLKPG will return EINVAL on a partition, and BLKPG_DEL_PARTITION
* will return ENXIO on an invalid partition number.
*/
struct blkpg_ioctl_arg a;
struct blkpg_partition p;
a.op = BLKPG_DEL_PARTITION;
a.data = (void*)&p;
a.datalen = sizeof(p);
a.flags = 0;
memset(a.data, 0, a.datalen);
p.pno = 1<<30;
if (ioctl(fd, BLKPG, &a) == 0)
/* Very unlikely, but not a partition */
return 0;
if (errno == ENXIO || errno == ENOTTY)
/* not a partition */
return 0;
return 1;
}
int test_partition_from_id(dev_t id)
{
char buf[20];
int fd, rv;
sprintf(buf, "%d:%d", major(id), minor(id));
fd = dev_open(buf, O_RDONLY);
if (fd < 0)
return -1;
rv = test_partition(fd);
close(fd);
return rv;
}
int enough(int level, int raid_disks, int layout, int clean, char *avail)
{
int copies, first;
int i;
int avail_disks = 0;
for (i = 0; i < raid_disks; i++)
avail_disks += !!avail[i];
switch (level) {
case 10:
/* This is the tricky one - we need to check
* which actual disks are present.
*/
copies = (layout&255)* ((layout>>8) & 255);
first = 0;
do {
/* there must be one of the 'copies' form 'first' */
int n = copies;
int cnt = 0;
int this = first;
while (n--) {
if (avail[this])
cnt++;
this = (this+1) % raid_disks;
}
if (cnt == 0)
return 0;
first = (first+(layout&255)) % raid_disks;
} while (first != 0);
return 1;
case LEVEL_MULTIPATH:
return avail_disks>= 1;
case LEVEL_LINEAR:
case 0:
return avail_disks == raid_disks;
case 1:
return avail_disks >= 1;
case 4:
if (avail_disks == raid_disks - 1 &&
!avail[raid_disks - 1])
/* If just the parity device is missing, then we
* have enough, even if not clean
*/
return 1;
/* FALL THROUGH */
case 5:
if (clean)
return avail_disks >= raid_disks-1;
else
return avail_disks >= raid_disks;
case 6:
if (clean)
return avail_disks >= raid_disks-2;
else
return avail_disks >= raid_disks;
default:
return 0;
}
}
char *__fname_from_uuid(int id[4], int swap, char *buf, char sep)
{
int i, j;
char uuid[16];
char *c = buf;
strcpy(c, "UUID-");
c += strlen(c);
copy_uuid(uuid, id, swap);
for (i = 0; i < 4; i++) {
if (i)
*c++ = sep;
for (j = 3; j >= 0; j--) {
sprintf(c,"%02x", (unsigned char) uuid[j+4*i]);
c+= 2;
}
}
return buf;
}
/**
* fname_from_uuid() - generate uuid string. Should not be used with super1.
* @info: info with uuid
* @buf: buf to fill.
*
* This routine should not be used with super1. See detail_fname_from_uuid() for details. It does
* not use superswitch swapuuid as it should be 0 but it has to do UUID conversion if host is big
* endian- left for backward compatibility.
*/
char *fname_from_uuid(struct mdinfo *info, char *buf)
{
#if __BYTE_ORDER == BIG_ENDIAN
return __fname_from_uuid(info->uuid, true, buf, ':');
#else
return __fname_from_uuid(info->uuid, false, buf, ':');
#endif
}
int check_ext2(int fd, char *name)
{
/*
* Check for an ext2fs file system.
* Superblock is always 1K at 1K offset
*
* s_magic is le16 at 56 == 0xEF53
* report mtime - le32 at 44
* blocks - le32 at 4
* logblksize - le32 at 24
*/
unsigned char sb[1024];
time_t mtime;
unsigned long long size;
int bsize;
if (lseek(fd, 1024,0)!= 1024)
return 0;
if (read(fd, sb, 1024)!= 1024)
return 0;
if (sb[56] != 0x53 || sb[57] != 0xef)
return 0;
mtime = sb[44]|(sb[45]|(sb[46]|sb[47]<<8)<<8)<<8;
bsize = sb[24]|(sb[25]|(sb[26]|sb[27]<<8)<<8)<<8;
size = sb[4]|(sb[5]|(sb[6]|sb[7]<<8)<<8)<<8;
size <<= bsize;
pr_info("%s appears to contain an ext2fs file system\n",
name);
pr_info("size=%lluK mtime=%s", size, ctime(&mtime));
return 1;
}
int check_reiser(int fd, char *name)
{
/*
* superblock is at 64K
* size is 1024;
* Magic string "ReIsErFs" or "ReIsEr2Fs" at 52
*
*/
unsigned char sb[1024];
unsigned long long size;
if (lseek(fd, 64*1024, 0) != 64*1024)
return 0;
if (read(fd, sb, 1024) != 1024)
return 0;
if (strncmp((char*)sb+52, "ReIsErFs",8) != 0 &&
strncmp((char*)sb+52, "ReIsEr2Fs",9) != 0)
return 0;
pr_err("%s appears to contain a reiserfs file system\n",name);
size = sb[0]|(sb[1]|(sb[2]|sb[3]<<8)<<8)<<8;
cont_err("size = %lluK\n", size*4);
return 1;
}
int check_raid(int fd, char *name)
{
struct mdinfo info;
time_t crtime;
char *level;
struct supertype *st = guess_super(fd);
if (!st)
return 0;
if (st->ss->add_to_super != NULL) {
st->ss->load_super(st, fd, name);
/* Looks like a raid array .. */
pr_err("%s appears to be part of a raid array:\n", name);
st->ss->getinfo_super(st, &info, NULL);
st->ss->free_super(st);
crtime = info.array.ctime;
level = map_num(pers, info.array.level);
if (!level)
level = "-unknown-";
cont_err("level=%s devices=%d ctime=%s",
level, info.array.raid_disks, ctime(&crtime));
} else {
/* Looks like GPT or MBR */
pr_err("partition table exists on %s\n", name);
}
return 1;
}
int fstat_is_blkdev(int fd, char *devname, dev_t *rdev)
{
struct stat stb;
if (fstat(fd, &stb) != 0) {
pr_err("fstat failed for %s: %s\n", devname, strerror(errno));
return 0;
}
if ((S_IFMT & stb.st_mode) != S_IFBLK) {
pr_err("%s is not a block device.\n", devname);
return 0;
}
if (rdev)
*rdev = stb.st_rdev;
return 1;
}
int stat_is_blkdev(char *devname, dev_t *rdev)
{
struct stat stb;
if (stat(devname, &stb) != 0) {
pr_err("stat failed for %s: %s\n", devname, strerror(errno));
return 0;
}
if ((S_IFMT & stb.st_mode) != S_IFBLK) {
pr_err("%s is not a block device.\n", devname);
return 0;
}
if (rdev)
*rdev = stb.st_rdev;
return 1;
}
/**
* ask() - prompt user for "yes/no" dialog.
* @mesg: message to be printed, without '?' sign.
* Returns: 1 if 'Y/y', 0 otherwise.
*
* The default value is 'N/n', thus the caps on "N" on prompt.
*/
int ask(char *mesg)
{
char buf[3] = {0};
fprintf(stderr, "%s [y/N]? ", mesg);
fflush(stderr);
if (fgets(buf, 3, stdin) == NULL)
return 0;
if (strlen(buf) == 1) {
pr_err("assuming no.\n");
return 0;
}
if (buf[1] != '\n')
goto bad_option;
if (toupper(buf[0]) == 'Y')
return 1;
if (toupper(buf[0]) == 'N')
return 0;
bad_option:
pr_err("bad option.\n");
return 0;
}
int is_standard(char *dev, int *nump)
{
/* tests if dev is a "standard" md dev name.
* i.e if the last component is "/dNN" or "/mdNN",
* where NN is a string of digits
* Returns 1 if a partitionable standard,
* -1 if non-partitonable,
* 0 if not a standard name.
*/
char *d = strrchr(dev, '/');
int type = 0;
int num;
if (!d)
return 0;
if (strncmp(d, "/d",2) == 0)
d += 2, type = 1; /* /dev/md/dN{pM} */
else if (strncmp(d, "/md_d", 5) == 0)
d += 5, type = 1; /* /dev/md_dN{pM} */
else if (strncmp(d, "/md", 3) == 0)
d += 3, type = -1; /* /dev/mdN */
else if (d-dev > 3 && strncmp(d-2, "md/", 3) == 0)
d += 1, type = -1; /* /dev/md/N */
else
return 0;
if (!*d)
return 0;
num = atoi(d);
while (isdigit(*d))
d++;
if (*d)
return 0;
if (nump) *nump = num;
return type;
}
unsigned long calc_csum(void *super, int bytes)
{
unsigned long long newcsum = 0;
int i;
unsigned int csum;
unsigned int *superc = (unsigned int*) super;
for(i = 0; i < bytes/4; i++)
newcsum += superc[i];
csum = (newcsum& 0xffffffff) + (newcsum>>32);
#ifdef __alpha__
/* The in-kernel checksum calculation is always 16bit on
* the alpha, though it is 32 bit on i386...
* I wonder what it is elsewhere... (it uses an API in
* a way that it shouldn't).
*/
csum = (csum & 0xffff) + (csum >> 16);
csum = (csum & 0xffff) + (csum >> 16);
#endif
return csum;
}
char *human_size(long long bytes)
{
static char buf[47];
/* We convert bytes to either centi-M{ega,ibi}bytes,
* centi-G{igi,ibi}bytes or centi-T{era,ebi}bytes
* with appropriate rounding, and then print
* 1/100th of those as a decimal.
* We allow upto 2048Megabytes before converting to
* gigabytes and 2048Gigabytes before converting to
* terabytes, as that shows more precision and isn't
* too large a number.
*/
if (bytes < 5000*1024)
buf[0] = 0;
else if (bytes < 2*1024LL*1024LL*1024LL) {
long cMiB = (bytes * 200LL / (1LL<<20) + 1) / 2;
long cMB = (bytes / ( 1000000LL / 200LL ) +1) /2;
snprintf(buf, sizeof(buf), " (%ld.%02ld MiB %ld.%02ld MB)",
cMiB/100, cMiB % 100, cMB/100, cMB % 100);
} else if (bytes < 2*1024LL*1024LL*1024LL*1024LL) {
long cGiB = (bytes * 200LL / (1LL<<30) +1) / 2;
long cGB = (bytes / (1000000000LL/200LL ) +1) /2;
snprintf(buf, sizeof(buf), " (%ld.%02ld GiB %ld.%02ld GB)",
cGiB/100, cGiB % 100, cGB/100, cGB % 100);
} else {
long cTiB = (bytes * 200LL / (1LL<<40) + 1) / 2;
long cTB = (bytes / (1000000000000LL / 200LL) + 1) / 2;
snprintf(buf, sizeof(buf), " (%ld.%02ld TiB %ld.%02ld TB)",
cTiB/100, cTiB % 100, cTB/100, cTB % 100);
}
return buf;
}
char *human_size_brief(long long bytes, int prefix)
{
static char buf[30];
/* We convert bytes to either centi-M{ega,ibi}bytes,
* centi-G{igi,ibi}bytes or centi-T{era,ebi}bytes
* with appropriate rounding, and then print
* 1/100th of those as a decimal.
* We allow upto 2048Megabytes before converting to
* gigabytes and 2048Gigabytes before converting to
* terabytes, as that shows more precision and isn't
* too large a number.
*
* If prefix == IEC, we mean prefixes like kibi,mebi,gibi etc.
* If prefix == JEDEC, we mean prefixes like kilo,mega,giga etc.
*/
if (bytes < 5000*1024)
buf[0] = 0;
else if (prefix == IEC) {
if (bytes < 2*1024LL*1024LL*1024LL) {
long cMiB = (bytes * 200LL / (1LL<<20) +1) /2;
snprintf(buf, sizeof(buf), "%ld.%02ldMiB",
cMiB/100, cMiB % 100);
} else if (bytes < 2*1024LL*1024LL*1024LL*1024LL) {
long cGiB = (bytes * 200LL / (1LL<<30) +1) /2;
snprintf(buf, sizeof(buf), "%ld.%02ldGiB",
cGiB/100, cGiB % 100);
} else {
long cTiB = (bytes * 200LL / (1LL<<40) + 1) / 2;
snprintf(buf, sizeof(buf), "%ld.%02ldTiB",
cTiB/100, cTiB % 100);
}
}
else if (prefix == JEDEC) {
if (bytes < 2*1024LL*1024LL*1024LL) {
long cMB = (bytes / ( 1000000LL / 200LL ) +1) /2;
snprintf(buf, sizeof(buf), "%ld.%02ldMB",
cMB/100, cMB % 100);
} else if (bytes < 2*1024LL*1024LL*1024LL*1024LL) {
long cGB = (bytes / (1000000000LL/200LL ) +1) /2;
snprintf(buf, sizeof(buf), "%ld.%02ldGB",
cGB/100, cGB % 100);
} else {
long cTB = (bytes / (1000000000000LL / 200LL) + 1) / 2;
snprintf(buf, sizeof(buf), "%ld.%02ldTB",
cTB/100, cTB % 100);
}
}
else
buf[0] = 0;
return buf;
}
void print_r10_layout(int layout)
{
int near = layout & 255;
int far = (layout >> 8) & 255;
int offset = (layout&0x10000);
char *sep = "";
if (near != 1) {
printf("%s near=%d", sep, near);
sep = ",";
}
if (far != 1)
printf("%s %s=%d", sep, offset?"offset":"far", far);
if (near*far == 1)
printf("NO REDUNDANCY");
}
unsigned long long calc_array_size(int level, int raid_disks, int layout,
int chunksize, unsigned long long devsize)
{
if (level == 1)
return devsize;
devsize &= ~(unsigned long long)((chunksize>>9)-1);
return get_data_disks(level, layout, raid_disks) * devsize;
}
int get_data_disks(int level, int layout, int raid_disks)
{
int data_disks = 0;
switch (level) {
case 0: data_disks = raid_disks;
break;
case 1: data_disks = 1;
break;
case 4:
case 5: data_disks = raid_disks - 1;
break;
case 6: data_disks = raid_disks - 2;
break;
case 10: data_disks = raid_disks / (layout & 255) / ((layout>>8)&255);
break;
}
return data_disks;
}
dev_t devnm2devid(char *devnm)
{
/* First look in /sys/block/$DEVNM/dev for %d:%d
* If that fails, try parsing out a number
*/
char path[PATH_MAX];
char *ep;
int fd;
int mjr,mnr;
snprintf(path, sizeof(path), "/sys/block/%s/dev", devnm);
fd = open(path, O_RDONLY);
if (fd >= 0) {
char buf[20];
int n = read(fd, buf, sizeof(buf));
close(fd);
if (n > 0)
buf[n] = 0;
if (n > 0 && sscanf(buf, "%d:%d\n", &mjr, &mnr) == 2)
return makedev(mjr, mnr);
}
if (strncmp(devnm, "md_d", 4) == 0 &&
isdigit(devnm[4]) &&
(mnr = strtoul(devnm+4, &ep, 10)) >= 0 &&
ep > devnm && *ep == 0)
return makedev(get_mdp_major(), mnr << MdpMinorShift);
if (strncmp(devnm, "md", 2) == 0 &&
isdigit(devnm[2]) &&
(mnr = strtoul(devnm+2, &ep, 10)) >= 0 &&
ep > devnm && *ep == 0)
return makedev(MD_MAJOR, mnr);
return 0;
}
/**
* is_devname_numbered() - helper for numbered devname verification.
* @devname: path or name to check.
* @pref: expected devname prefix.
* @pref_len: prefix len.
*/
static bool is_devname_numbered(const char *devname, const char *pref, const int pref_len)
{
int val;
assert(devname && pref);
if (strncmp(devname, pref, pref_len) != 0)