]> git.ipfire.org Git - thirdparty/mdadm.git/blob - Build.c
tests: add test for names
[thirdparty/mdadm.git] / Build.c
1 /*
2 * mdadm - manage Linux "md" devices aka RAID arrays.
3 *
4 * Copyright (C) 2001-2009 Neil Brown <neilb@suse.de>
5 *
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 *
21 * Author: Neil Brown
22 * Email: <neilb@suse.de>
23 */
24
25 #include "mdadm.h"
26
27 int Build(char *mddev, struct mddev_dev *devlist,
28 struct shape *s, struct context *c)
29 {
30 /* Build a linear or raid0 arrays without superblocks
31 * We cannot really do any checks, we just do it.
32 * For md_version < 0.90.0, we call REGISTER_DEV
33 * with the device numbers, and then
34 * START_MD giving the "geometry"
35 * geometry is 0xpp00cc
36 * where pp is personality: 1==linear, 2=raid0
37 * cc = chunk size factor: 0==4k, 1==8k etc.
38 */
39 int i;
40 dev_t rdev;
41 int subdevs = 0, missing_disks = 0;
42 struct mddev_dev *dv;
43 int bitmap_fd;
44 unsigned long long bitmapsize;
45 int mdfd;
46 char chosen_name[1024];
47 int uuid[4] = {0,0,0,0};
48 struct map_ent *map = NULL;
49 mdu_array_info_t array;
50 mdu_param_t param; /* not used by syscall */
51
52 if (s->level == UnSet) {
53 pr_err("a RAID level is needed to Build an array.\n");
54 return 1;
55 }
56 /* scan all devices, make sure they really are block devices */
57 for (dv = devlist; dv; dv=dv->next) {
58 subdevs++;
59 if (strcmp("missing", dv->devname) == 0) {
60 missing_disks++;
61 continue;
62 }
63 if (!stat_is_blkdev(dv->devname, NULL))
64 return 1;
65 }
66
67 if (s->raiddisks != subdevs) {
68 pr_err("requested %d devices in array but listed %d\n",
69 s->raiddisks, subdevs);
70 return 1;
71 }
72
73 if (s->layout == UnSet)
74 s->layout = default_layout(NULL, s->level, c->verbose);
75
76 /* We need to create the device. It can have no name. */
77 map_lock(&map);
78 mdfd = create_mddev(mddev, NULL, c->autof, LOCAL,
79 chosen_name, 0);
80 if (mdfd < 0) {
81 map_unlock(&map);
82 return 1;
83 }
84 mddev = chosen_name;
85
86 map_update(&map, fd2devnm(mdfd), "none", uuid, chosen_name);
87 map_unlock(&map);
88
89 array.level = s->level;
90 if (s->size == MAX_SIZE)
91 s->size = 0;
92 array.size = s->size;
93 array.nr_disks = s->raiddisks;
94 array.raid_disks = s->raiddisks;
95 array.md_minor = 0;
96 if (fstat_is_blkdev(mdfd, mddev, &rdev))
97 array.md_minor = minor(rdev);
98 array.not_persistent = 1;
99 array.state = 0; /* not clean, but no errors */
100 if (s->assume_clean)
101 array.state |= 1;
102 array.active_disks = s->raiddisks - missing_disks;
103 array.working_disks = s->raiddisks - missing_disks;
104 array.spare_disks = 0;
105 array.failed_disks = missing_disks;
106 if (s->chunk == 0 && (s->level==0 || s->level==LEVEL_LINEAR))
107 s->chunk = 64;
108 array.chunk_size = s->chunk*1024;
109 array.layout = s->layout;
110 if (md_set_array_info(mdfd, &array)) {
111 pr_err("md_set_array_info() failed for %s: %s\n",
112 mddev, strerror(errno));
113 goto abort;
114 }
115
116 if (s->bitmap_file && strcmp(s->bitmap_file, "none") == 0)
117 s->bitmap_file = NULL;
118 if (s->bitmap_file && s->level <= 0) {
119 pr_err("bitmaps not meaningful with level %s\n",
120 map_num(pers, s->level)?:"given");
121 goto abort;
122 }
123 /* now add the devices */
124 for ((i=0), (dv = devlist) ; dv ; i++, dv=dv->next) {
125 mdu_disk_info_t disk;
126 unsigned long long dsize;
127 int fd;
128
129 if (strcmp("missing", dv->devname) == 0)
130 continue;
131 if (!stat_is_blkdev(dv->devname, &rdev))
132 goto abort;
133 fd = open(dv->devname, O_RDONLY|O_EXCL);
134 if (fd < 0) {
135 pr_err("Cannot open %s: %s\n",
136 dv->devname, strerror(errno));
137 goto abort;
138 }
139 if (get_dev_size(fd, NULL, &dsize) &&
140 (s->size == 0 || s->size == MAX_SIZE || dsize < s->size))
141 s->size = dsize;
142 close(fd);
143 disk.number = i;
144 disk.raid_disk = i;
145 disk.state = (1<<MD_DISK_SYNC) | (1<<MD_DISK_ACTIVE);
146 if (dv->writemostly == FlagSet)
147 disk.state |= 1<<MD_DISK_WRITEMOSTLY;
148 disk.major = major(rdev);
149 disk.minor = minor(rdev);
150 if (ioctl(mdfd, ADD_NEW_DISK, &disk)) {
151 pr_err("ADD_NEW_DISK failed for %s: %s\n",
152 dv->devname, strerror(errno));
153 goto abort;
154 }
155 }
156 /* now to start it */
157 if (s->bitmap_file) {
158 bitmap_fd = open(s->bitmap_file, O_RDWR);
159 if (bitmap_fd < 0) {
160 int major = BITMAP_MAJOR_HI;
161 #if 0
162 if (s->bitmap_chunk == UnSet) {
163 pr_err("%s cannot be opened.\n", s->bitmap_file);
164 goto abort;
165 }
166 #endif
167 bitmapsize = s->size >> 9; /* FIXME wrong for RAID10 */
168 if (CreateBitmap(s->bitmap_file, 1, NULL,
169 s->bitmap_chunk, c->delay,
170 s->write_behind, bitmapsize, major)) {
171 goto abort;
172 }
173 bitmap_fd = open(s->bitmap_file, O_RDWR);
174 if (bitmap_fd < 0) {
175 pr_err("%s cannot be opened.\n", s->bitmap_file);
176 goto abort;
177 }
178 }
179 if (bitmap_fd >= 0) {
180 if (ioctl(mdfd, SET_BITMAP_FILE, bitmap_fd) < 0) {
181 pr_err("Cannot set bitmap file for %s: %s\n",
182 mddev, strerror(errno));
183 goto abort;
184 }
185 }
186 }
187 if (ioctl(mdfd, RUN_ARRAY, &param)) {
188 pr_err("RUN_ARRAY failed: %s\n", strerror(errno));
189 if (s->chunk & (s->chunk - 1)) {
190 cont_err("Problem may be that chunk size is not a power of 2\n");
191 }
192 goto abort;
193 }
194
195 if (c->verbose >= 0)
196 pr_err("array %s built and started.\n",
197 mddev);
198 wait_for(mddev, mdfd);
199 close(mdfd);
200 return 0;
201
202 abort:
203 ioctl(mdfd, STOP_ARRAY, 0);
204 close(mdfd);
205 return 1;
206 }