]>
Commit | Line | Data |
---|---|---|
e0d19036 NB |
1 | /* |
2 | * mdstat - parse /proc/mdstat file. Part of: | |
3 | * mdadm - manage Linux "md" devices aka RAID arrays. | |
4 | * | |
4f589ad0 | 5 | * Copyright (C) 2002-2006 Neil Brown <neilb@suse.de> |
e0d19036 NB |
6 | * |
7 | * | |
8 | * This program is free software; you can redistribute it and/or modify | |
9 | * it under the terms of the GNU General Public License as published by | |
10 | * the Free Software Foundation; either version 2 of the License, or | |
11 | * (at your option) any later version. | |
12 | * | |
13 | * This program is distributed in the hope that it will be useful, | |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | * GNU General Public License for more details. | |
17 | * | |
18 | * You should have received a copy of the GNU General Public License | |
19 | * along with this program; if not, write to the Free Software | |
20 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
21 | * | |
22 | * Author: Neil Brown | |
23 | * Email: <neilb@cse.unsw.edu.au> | |
24 | * Paper: Neil Brown | |
25 | * School of Computer Science and Engineering | |
26 | * The University of New South Wales | |
27 | * Sydney, 2052 | |
28 | * Australia | |
29 | */ | |
30 | ||
31 | /* | |
32 | * The /proc/mdstat file comes in at least 3 flavours: | |
33 | * In an unpatched 2.2 kernel (md 0.36.6): | |
34 | * Personalities : [n raidx] ... | |
35 | * read_ahead {not set|%d sectors} | |
36 | * md0 : {in}active{ raidX /dev/hda... %d blocks{ maxfault=%d}} | |
37 | * md1 : ..... | |
38 | * | |
39 | * Normally only 4 md lines, but all are listed. | |
40 | * | |
41 | * In a patched 2.2 kernel (md 0.90.0) | |
42 | * Personalities : [raidx] ... | |
43 | * read_ahead {not set|%d sectors} | |
44 | * mdN : {in}active {(readonly)} raidX dev[%d]{(F)} ... %d blocks STATUS RESYNC | |
45 | * ... Only initialised arrays listed | |
8f21823f | 46 | * unused devices: {dev dev ... | <none>} |
e0d19036 NB |
47 | * |
48 | * STATUS is personality dependant: | |
49 | * linear: %dk rounding | |
50 | * raid0: %dk chunks | |
51 | * raid1: [%d/%d] [U_U] ( raid/working. operational or not) | |
52 | * raid5: level 4/5, %dk chunk, algorithm %d [%d/%d] [U_U] | |
53 | * | |
54 | * RESYNC is empty or: | |
55 | * {resync|recovery}=%u%% finish=%u.%umin | |
56 | * or | |
57 | * resync=DELAYED | |
58 | * | |
59 | * In a 2.4 kernel (md 0.90.0/2.4) | |
60 | * Personalities : [raidX] ... | |
61 | * read_ahead {not set|%d sectors} | |
62 | * mdN : {in}active {(read-only)} raidX dev[%d]{(F)} ... | |
63 | * %d blocks STATUS | |
64 | * RESYNC | |
8f21823f | 65 | * unused devices: {dev dev .. | <none>} |
e0d19036 NB |
66 | * |
67 | * STATUS matches 0.90.0/2.2 | |
68 | * RESYNC includes [===>....], | |
69 | * adds a space after {resync|recovery} and before and after '=' | |
70 | * adds a decimal to the recovery percent. | |
71 | * adds (%d/%d) resync amount and max_blocks, before finish. | |
72 | * adds speed=%dK/sec after finish | |
73 | * | |
74 | * | |
75 | * | |
76 | * Out of this we want to extract: | |
77 | * list of devices, active or not | |
78 | * pattern of failed drives (so need number of drives) | |
79 | * percent resync complete | |
80 | * | |
81 | * As continuation is indicated by leading space, we use | |
82 | * conf_line from config.c to read logical lines | |
83 | * | |
84 | */ | |
85 | ||
86 | #include "mdadm.h" | |
87 | #include "dlink.h" | |
dd0781e5 | 88 | #include <sys/select.h> |
e0d19036 NB |
89 | |
90 | void free_mdstat(struct mdstat_ent *ms) | |
91 | { | |
92 | while (ms) { | |
93 | struct mdstat_ent *t; | |
94 | if (ms->dev) free(ms->dev); | |
95 | if (ms->level) free(ms->level); | |
96 | if (ms->pattern) free(ms->pattern); | |
97 | t = ms; | |
98 | ms = ms->next; | |
99 | free(t); | |
100 | } | |
101 | } | |
102 | ||
dd0781e5 | 103 | static int mdstat_fd = -1; |
22a88995 | 104 | struct mdstat_ent *mdstat_read(int hold, int start) |
e0d19036 NB |
105 | { |
106 | FILE *f; | |
22a88995 | 107 | struct mdstat_ent *all, *rv, **end, **insert_here; |
e0d19036 NB |
108 | char *line; |
109 | ||
dd0781e5 NB |
110 | if (hold && mdstat_fd != -1) { |
111 | lseek(mdstat_fd, 0L, 0); | |
112 | f = fdopen(dup(mdstat_fd), "r"); | |
113 | } else | |
114 | f = fopen("/proc/mdstat", "r"); | |
e0d19036 NB |
115 | if (f == NULL) |
116 | return NULL; | |
e4dc5106 DL |
117 | else |
118 | fcntl(fileno(f), F_SETFD, FD_CLOEXEC); | |
e0d19036 NB |
119 | |
120 | all = NULL; | |
121 | end = &all; | |
122 | for (; (line = conf_line(f)) ; free_line(line)) { | |
123 | struct mdstat_ent *ent; | |
124 | char *w; | |
98c6faba | 125 | int devnum; |
22a88995 | 126 | int in_devs = 0; |
98c6faba | 127 | char *ep; |
e0d19036 NB |
128 | |
129 | if (strcmp(line, "Personalities")==0) | |
130 | continue; | |
131 | if (strcmp(line, "read_ahead")==0) | |
132 | continue; | |
133 | if (strcmp(line, "unused")==0) | |
134 | continue; | |
22a88995 | 135 | insert_here = NULL; |
e0d19036 | 136 | /* Better be an md line.. */ |
98c6faba NB |
137 | if (strncmp(line, "md", 2)!= 0) |
138 | continue; | |
139 | if (strncmp(line, "md_d", 4) == 0) | |
140 | devnum = -1-strtoul(line+4, &ep, 10); | |
141 | else if (strncmp(line, "md", 2) == 0) | |
142 | devnum = strtoul(line+2, &ep, 10); | |
143 | else | |
144 | continue; | |
145 | if (ep == NULL || *ep ) { | |
146 | /* fprintf(stderr, Name ": bad /proc/mdstat line starts: %s\n", line); */ | |
e0d19036 NB |
147 | continue; |
148 | } | |
149 | ||
150 | ent = malloc(sizeof(*ent)); | |
151 | if (!ent) { | |
152 | fprintf(stderr, Name ": malloc failed reading /proc/mdstat.\n"); | |
153 | free_line(line); | |
dd0781e5 | 154 | break; |
e0d19036 NB |
155 | } |
156 | ent->dev = ent->level = ent->pattern= NULL; | |
157 | ent->next = NULL; | |
158 | ent->percent = -1; | |
159 | ent->active = -1; | |
e5329c37 | 160 | ent->resync = 0; |
e0d19036 NB |
161 | |
162 | ent->dev = strdup(line); | |
98c6faba | 163 | ent->devnum = devnum; |
aba69144 | 164 | |
e0d19036 NB |
165 | for (w=dl_next(line); w!= line ; w=dl_next(w)) { |
166 | int l = strlen(w); | |
167 | char *eq; | |
168 | if (strcmp(w, "active")==0) | |
169 | ent->active = 1; | |
170 | else if (strcmp(w, "inactive")==0) | |
171 | ent->active = 0; | |
172 | else if (ent->active >=0 && | |
173 | ent->level == NULL && | |
22a88995 | 174 | w[0] != '(' /*readonly*/) { |
e0d19036 | 175 | ent->level = strdup(w); |
22a88995 NB |
176 | in_devs = 1; |
177 | } else if (in_devs && strcmp(w, "blocks")==0) | |
178 | in_devs = 0; | |
179 | else if (in_devs && strncmp(w, "md", 2)==0) { | |
180 | /* This has an md device as a component. | |
181 | * If that device is already in the list, | |
182 | * make sure we insert before there. | |
183 | */ | |
184 | struct mdstat_ent **ih; | |
185 | int dn2; | |
186 | if (strncmp(w, "md_d", 4)==0) | |
187 | dn2 = -1-strtoul(w+4, &ep, 10); | |
188 | else | |
189 | dn2 = strtoul(w+2, &ep, 10); | |
190 | ih = &all; | |
191 | while (ih != insert_here && *ih && | |
192 | (*ih)->devnum != dn2) | |
193 | ih = & (*ih)->next; | |
194 | insert_here = ih; | |
195 | } else if (!ent->pattern && | |
e0d19036 NB |
196 | w[0] == '[' && |
197 | (w[1] == 'U' || w[1] == '_')) { | |
198 | ent->pattern = strdup(w+1); | |
199 | if (ent->pattern[l-2]==']') | |
200 | ent->pattern[l-2] = '\0'; | |
201 | } else if (ent->percent == -1 && | |
202 | strncmp(w, "re", 2)== 0 && | |
203 | w[l-1] == '%' && | |
204 | (eq=strchr(w, '=')) != NULL ) { | |
205 | ent->percent = atoi(eq+1); | |
e5329c37 NB |
206 | if (strncmp(w,"resync", 4)==0) |
207 | ent->resync = 1; | |
208 | } else if (ent->percent == -1 && | |
209 | strncmp(w, "resync", 4)==0) { | |
210 | ent->resync = 1; | |
e0d19036 | 211 | } else if (ent->percent == -1 && |
aba69144 | 212 | w[0] >= '0' && |
e0d19036 NB |
213 | w[0] <= '9' && |
214 | w[l-1] == '%') { | |
215 | ent->percent = atoi(w); | |
216 | } | |
217 | } | |
22a88995 NB |
218 | if (insert_here && (*insert_here)) { |
219 | ent->next = *insert_here; | |
220 | *insert_here = ent; | |
221 | } else { | |
222 | *end = ent; | |
223 | end = &ent->next; | |
224 | } | |
e0d19036 | 225 | } |
e4dc5106 | 226 | if (hold && mdstat_fd == -1) { |
dd0781e5 | 227 | mdstat_fd = dup(fileno(f)); |
e4dc5106 DL |
228 | fcntl(mdstat_fd, F_SETFD, FD_CLOEXEC); |
229 | } | |
e0d19036 | 230 | fclose(f); |
22a88995 NB |
231 | |
232 | /* If we might want to start array, | |
233 | * reverse the order, so that components comes before composites | |
234 | */ | |
235 | if (start) { | |
236 | rv = NULL; | |
237 | while (all) { | |
238 | struct mdstat_ent *e = all; | |
239 | all = all->next; | |
240 | e->next = rv; | |
241 | rv = e; | |
242 | } | |
243 | } else rv = all; | |
244 | return rv; | |
e0d19036 | 245 | } |
dd0781e5 NB |
246 | |
247 | void mdstat_wait(int seconds) | |
248 | { | |
249 | fd_set fds; | |
250 | struct timeval tm; | |
251 | FD_ZERO(&fds); | |
252 | if (mdstat_fd >= 0) | |
253 | FD_SET(mdstat_fd, &fds); | |
254 | tm.tv_sec = seconds; | |
255 | tm.tv_usec = 0; | |
256 | select(mdstat_fd >2 ? mdstat_fd+1:3, NULL, NULL, &fds, &tm); | |
257 | } | |
8382f19b NB |
258 | |
259 | int mddev_busy(int devnum) | |
260 | { | |
261 | struct mdstat_ent *mdstat = mdstat_read(0, 0); | |
262 | struct mdstat_ent *me; | |
263 | ||
264 | for (me = mdstat ; me ; me = me->next) | |
265 | if (me->devnum == devnum) | |
266 | break; | |
267 | free_mdstat(mdstat); | |
268 | return me != NULL; | |
269 | } |