]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * mdmon - monitor external metadata arrays | |
3 | * | |
4 | * Copyright (C) 2007-2009 Neil Brown <neilb@suse.de> | |
5 | * Copyright (C) 2007-2009 Intel Corporation | |
6 | * | |
7 | * This program is free software; you can redistribute it and/or modify it | |
8 | * under the terms and conditions of the GNU General Public License, | |
9 | * version 2, as published by the Free Software Foundation. | |
10 | * | |
11 | * This program is distributed in the hope it will be useful, but WITHOUT | |
12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for | |
14 | * more details. | |
15 | * | |
16 | * You should have received a copy of the GNU General Public License along with | |
17 | * this program; if not, write to the Free Software Foundation, Inc., | |
18 | * 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA. | |
19 | */ | |
20 | ||
21 | /* | |
22 | * The management thread for monitoring active md arrays. | |
23 | * This thread does things which might block such as memory | |
24 | * allocation. | |
25 | * In particular: | |
26 | * | |
27 | * - Find out about new arrays in this container. | |
28 | * Allocate the data structures and open the files. | |
29 | * | |
30 | * For this we watch /proc/mdstat and find new arrays with | |
31 | * metadata type that confirms sharing. e.g. "md4" | |
32 | * When we find a new array we slip it into the list of | |
33 | * arrays and signal 'monitor' by writing to a pipe. | |
34 | * | |
35 | * - Respond to reshape requests by allocating new data structures | |
36 | * and opening new files. | |
37 | * | |
38 | * These come as a change to raid_disks. We allocate a new | |
39 | * version of the data structures and slip it into the list. | |
40 | * 'monitor' will notice and release the old version. | |
41 | * Changes to level, chunksize, layout.. do not need re-allocation. | |
42 | * Reductions in raid_disks don't really either, but we handle | |
43 | * them the same way for consistency. | |
44 | * | |
45 | * - When a device is added to the container, we add it to the metadata | |
46 | * as a spare. | |
47 | * | |
48 | * - Deal with degraded array | |
49 | * We only do this when first noticing the array is degraded. | |
50 | * This can be when we first see the array, when sync completes or | |
51 | * when recovery completes. | |
52 | * | |
53 | * Check if number of failed devices suggests recovery is needed, and | |
54 | * skip if not. | |
55 | * Ask metadata to allocate a spare device | |
56 | * Add device as not in_sync and give a role | |
57 | * Update metadata. | |
58 | * Open sysfs files and pass to monitor. | |
59 | * Make sure that monitor Starts recovery.... | |
60 | * | |
61 | * - Pass on metadata updates from external programs such as | |
62 | * mdadm creating a new array. | |
63 | * | |
64 | * This is most-messy. | |
65 | * It might involve adding a new array or changing the status of | |
66 | * a spare, or any reconfig that the kernel doesn't get involved in. | |
67 | * | |
68 | * The required updates are received via a named pipe. There will | |
69 | * be one named pipe for each container. Each message contains a | |
70 | * sync marker: 0x5a5aa5a5, A byte count, and the message. This is | |
71 | * passed to the metadata handler which will interpret and process it. | |
72 | * For 'DDF' messages are internal data blocks with the leading | |
73 | * 'magic number' signifying what sort of data it is. | |
74 | * | |
75 | */ | |
76 | ||
77 | /* | |
78 | * We select on /proc/mdstat and the named pipe. | |
79 | * We create new arrays or updated version of arrays and slip | |
80 | * them into the head of the list, then signal 'monitor' via a pipe write. | |
81 | * 'monitor' will notice and place the old array on a return list. | |
82 | * Metadata updates are placed on a queue just like they arrive | |
83 | * from the named pipe. | |
84 | * | |
85 | * When new arrays are found based on correct metadata string, we | |
86 | * need to identify them with an entry in the metadata. Maybe we require | |
87 | * the metadata to be mdX/NN when NN is the index into an appropriate table. | |
88 | * | |
89 | */ | |
90 | ||
91 | /* | |
92 | * List of tasks: | |
93 | * - Watch for spares to be added to the container, and write updated | |
94 | * metadata to them. | |
95 | * - Watch for new arrays using this container, confirm they match metadata | |
96 | * and if so, start monitoring them | |
97 | * - Watch for spares being added to monitored arrays. This shouldn't | |
98 | * happen, as we should do all the adding. Just remove them. | |
99 | * - Watch for change in raid-disks, chunk-size, etc. Update metadata and | |
100 | * start a reshape. | |
101 | */ | |
102 | #ifndef _GNU_SOURCE | |
103 | #define _GNU_SOURCE | |
104 | #endif | |
105 | #include "mdadm.h" | |
106 | #include "mdmon.h" | |
107 | #include <sys/syscall.h> | |
108 | #include <sys/socket.h> | |
109 | #include <signal.h> | |
110 | ||
111 | static void close_aa(struct active_array *aa) | |
112 | { | |
113 | struct mdinfo *d; | |
114 | ||
115 | for (d = aa->info.devs; d; d = d->next) { | |
116 | close(d->recovery_fd); | |
117 | close(d->state_fd); | |
118 | } | |
119 | ||
120 | close(aa->action_fd); | |
121 | close(aa->info.state_fd); | |
122 | close(aa->resync_start_fd); | |
123 | } | |
124 | ||
125 | static void free_aa(struct active_array *aa) | |
126 | { | |
127 | /* Note that this doesn't close fds if they are being used | |
128 | * by a clone. ->container will be set for a clone | |
129 | */ | |
130 | dprintf("%s: devnum: %d\n", __func__, aa->devnum); | |
131 | if (!aa->container) | |
132 | close_aa(aa); | |
133 | while (aa->info.devs) { | |
134 | struct mdinfo *d = aa->info.devs; | |
135 | aa->info.devs = d->next; | |
136 | free(d); | |
137 | } | |
138 | free(aa); | |
139 | } | |
140 | ||
141 | static struct active_array *duplicate_aa(struct active_array *aa) | |
142 | { | |
143 | struct active_array *newa = malloc(sizeof(*newa)); | |
144 | struct mdinfo **dp1, **dp2; | |
145 | ||
146 | *newa = *aa; | |
147 | newa->next = NULL; | |
148 | newa->replaces = NULL; | |
149 | newa->info.next = NULL; | |
150 | ||
151 | dp2 = &newa->info.devs; | |
152 | ||
153 | for (dp1 = &aa->info.devs; *dp1; dp1 = &(*dp1)->next) { | |
154 | struct mdinfo *d; | |
155 | if ((*dp1)->state_fd < 0) | |
156 | continue; | |
157 | ||
158 | d = malloc(sizeof(*d)); | |
159 | *d = **dp1; | |
160 | *dp2 = d; | |
161 | dp2 = & d->next; | |
162 | } | |
163 | *dp2 = NULL; | |
164 | ||
165 | return newa; | |
166 | } | |
167 | ||
168 | static void wakeup_monitor(void) | |
169 | { | |
170 | /* tgkill(getpid(), mon_tid, SIGUSR1); */ | |
171 | int pid = getpid(); | |
172 | syscall(SYS_tgkill, pid, mon_tid, SIGUSR1); | |
173 | } | |
174 | ||
175 | static void remove_old(void) | |
176 | { | |
177 | if (discard_this) { | |
178 | discard_this->next = NULL; | |
179 | free_aa(discard_this); | |
180 | if (pending_discard == discard_this) | |
181 | pending_discard = NULL; | |
182 | discard_this = NULL; | |
183 | wakeup_monitor(); | |
184 | } | |
185 | } | |
186 | ||
187 | static void replace_array(struct supertype *container, | |
188 | struct active_array *old, | |
189 | struct active_array *new) | |
190 | { | |
191 | /* To replace an array, we add it to the top of the list | |
192 | * marked with ->replaces to point to the original. | |
193 | * 'monitor' will take the original out of the list | |
194 | * and put it on 'discard_this'. We take it from there | |
195 | * and discard it. | |
196 | */ | |
197 | remove_old(); | |
198 | while (pending_discard) { | |
199 | while (discard_this == NULL) | |
200 | sleep(1); | |
201 | remove_old(); | |
202 | } | |
203 | pending_discard = old; | |
204 | new->replaces = old; | |
205 | new->next = container->arrays; | |
206 | container->arrays = new; | |
207 | wakeup_monitor(); | |
208 | } | |
209 | ||
210 | struct metadata_update *update_queue = NULL; | |
211 | struct metadata_update *update_queue_handled = NULL; | |
212 | struct metadata_update *update_queue_pending = NULL; | |
213 | ||
214 | static void free_updates(struct metadata_update **update) | |
215 | { | |
216 | while (*update) { | |
217 | struct metadata_update *this = *update; | |
218 | ||
219 | *update = this->next; | |
220 | free(this->buf); | |
221 | free(this->space); | |
222 | free(this); | |
223 | } | |
224 | } | |
225 | ||
226 | void check_update_queue(struct supertype *container) | |
227 | { | |
228 | free_updates(&update_queue_handled); | |
229 | ||
230 | if (update_queue == NULL && | |
231 | update_queue_pending) { | |
232 | update_queue = update_queue_pending; | |
233 | update_queue_pending = NULL; | |
234 | wakeup_monitor(); | |
235 | } | |
236 | } | |
237 | ||
238 | static void queue_metadata_update(struct metadata_update *mu) | |
239 | { | |
240 | struct metadata_update **qp; | |
241 | ||
242 | qp = &update_queue_pending; | |
243 | while (*qp) | |
244 | qp = & ((*qp)->next); | |
245 | *qp = mu; | |
246 | } | |
247 | ||
248 | static void add_disk_to_container(struct supertype *st, struct mdinfo *sd) | |
249 | { | |
250 | int dfd; | |
251 | char nm[20]; | |
252 | struct supertype *st2; | |
253 | struct metadata_update *update = NULL; | |
254 | struct mdinfo info; | |
255 | mdu_disk_info_t dk = { | |
256 | .number = -1, | |
257 | .major = sd->disk.major, | |
258 | .minor = sd->disk.minor, | |
259 | .raid_disk = -1, | |
260 | .state = 0, | |
261 | }; | |
262 | ||
263 | dprintf("%s: add %d:%d to container\n", | |
264 | __func__, sd->disk.major, sd->disk.minor); | |
265 | ||
266 | sd->next = st->devs; | |
267 | st->devs = sd; | |
268 | ||
269 | sprintf(nm, "%d:%d", sd->disk.major, sd->disk.minor); | |
270 | dfd = dev_open(nm, O_RDWR); | |
271 | if (dfd < 0) | |
272 | return; | |
273 | ||
274 | /* Check the metadata and see if it is already part of this | |
275 | * array | |
276 | */ | |
277 | st2 = dup_super(st); | |
278 | if (st2->ss->load_super(st2, dfd, NULL) == 0) { | |
279 | st2->ss->getinfo_super(st, &info); | |
280 | if (st->ss->compare_super(st, st2) == 0 && | |
281 | info.disk.raid_disk >= 0) { | |
282 | /* Looks like a good member of array. | |
283 | * Just accept it. | |
284 | * mdadm will incorporate any parts into | |
285 | * active arrays. | |
286 | */ | |
287 | st2->ss->free_super(st2); | |
288 | return; | |
289 | } | |
290 | } | |
291 | st2->ss->free_super(st2); | |
292 | ||
293 | st->update_tail = &update; | |
294 | st->ss->add_to_super(st, &dk, dfd, NULL); | |
295 | st->ss->write_init_super(st); | |
296 | queue_metadata_update(update); | |
297 | st->update_tail = NULL; | |
298 | } | |
299 | ||
300 | static void manage_container(struct mdstat_ent *mdstat, | |
301 | struct supertype *container) | |
302 | { | |
303 | /* The only thing of interest here is if a new device | |
304 | * has been added to the container. We add it to the | |
305 | * array ignoring any metadata on it. | |
306 | * FIXME should we look for compatible metadata and take hints | |
307 | * about spare assignment.... probably not. | |
308 | */ | |
309 | if (mdstat->devcnt != container->devcnt) { | |
310 | struct mdinfo **cdp, *cd, *di, *mdi; | |
311 | int found; | |
312 | ||
313 | /* read /sys/block/NAME/md/dev-??/block/dev to find out | |
314 | * what is there, and compare with container->info.devs | |
315 | * To see what is removed and what is added. | |
316 | * These need to be remove from, or added to, the array | |
317 | */ | |
318 | mdi = sysfs_read(-1, mdstat->devnum, GET_DEVS); | |
319 | if (!mdi) { | |
320 | /* invalidate the current count so we can try again */ | |
321 | container->devcnt = -1; | |
322 | return; | |
323 | } | |
324 | ||
325 | /* check for removals */ | |
326 | for (cdp = &container->devs; *cdp; ) { | |
327 | found = 0; | |
328 | for (di = mdi->devs; di; di = di->next) | |
329 | if (di->disk.major == (*cdp)->disk.major && | |
330 | di->disk.minor == (*cdp)->disk.minor) { | |
331 | found = 1; | |
332 | break; | |
333 | } | |
334 | if (!found) { | |
335 | cd = *cdp; | |
336 | *cdp = (*cdp)->next; | |
337 | free(cd); | |
338 | } else | |
339 | cdp = &(*cdp)->next; | |
340 | } | |
341 | ||
342 | /* check for additions */ | |
343 | for (di = mdi->devs; di; di = di->next) { | |
344 | for (cd = container->devs; cd; cd = cd->next) | |
345 | if (di->disk.major == cd->disk.major && | |
346 | di->disk.minor == cd->disk.minor) | |
347 | break; | |
348 | if (!cd) { | |
349 | struct mdinfo *newd = malloc(sizeof(*newd)); | |
350 | ||
351 | if (!newd) { | |
352 | container->devcnt = -1; | |
353 | continue; | |
354 | } | |
355 | *newd = *di; | |
356 | add_disk_to_container(container, newd); | |
357 | } | |
358 | } | |
359 | sysfs_free(mdi); | |
360 | container->devcnt = mdstat->devcnt; | |
361 | } | |
362 | } | |
363 | ||
364 | static int disk_init_and_add(struct mdinfo *disk, struct mdinfo *clone, | |
365 | struct active_array *aa) | |
366 | { | |
367 | if (!disk || !clone) | |
368 | return -1; | |
369 | ||
370 | *disk = *clone; | |
371 | disk->recovery_fd = sysfs_open(aa->devnum, disk->sys_name, "recovery_start"); | |
372 | disk->state_fd = sysfs_open(aa->devnum, disk->sys_name, "state"); | |
373 | disk->prev_state = read_dev_state(disk->state_fd); | |
374 | disk->curr_state = disk->prev_state; | |
375 | disk->next = aa->info.devs; | |
376 | aa->info.devs = disk; | |
377 | ||
378 | return 0; | |
379 | } | |
380 | ||
381 | static void manage_member(struct mdstat_ent *mdstat, | |
382 | struct active_array *a) | |
383 | { | |
384 | /* Compare mdstat info with known state of member array. | |
385 | * We do not need to look for device state changes here, that | |
386 | * is dealt with by the monitor. | |
387 | * | |
388 | * We just look for changes which suggest that a reshape is | |
389 | * being requested. | |
390 | * Unfortunately decreases in raid_disks don't show up in | |
391 | * mdstat until the reshape completes FIXME. | |
392 | * | |
393 | * Actually, we also want to handle degraded arrays here by | |
394 | * trying to find and assign a spare. | |
395 | * We do that whenever the monitor tells us too. | |
396 | */ | |
397 | // FIXME | |
398 | a->info.array.raid_disks = mdstat->raid_disks; | |
399 | a->info.array.chunk_size = mdstat->chunk_size; | |
400 | // MORE | |
401 | ||
402 | if (a->check_degraded) { | |
403 | struct metadata_update *updates = NULL; | |
404 | struct mdinfo *newdev = NULL; | |
405 | struct active_array *newa; | |
406 | struct mdinfo *d; | |
407 | ||
408 | a->check_degraded = 0; | |
409 | ||
410 | /* The array may not be degraded, this is just a good time | |
411 | * to check. | |
412 | */ | |
413 | newdev = a->container->ss->activate_spare(a, &updates); | |
414 | if (!newdev) | |
415 | return; | |
416 | ||
417 | newa = duplicate_aa(a); | |
418 | if (!newa) | |
419 | goto out; | |
420 | /* Cool, we can add a device or several. */ | |
421 | ||
422 | /* Add device to array and set offset/size/slot. | |
423 | * and open files for each newdev */ | |
424 | for (d = newdev; d ; d = d->next) { | |
425 | struct mdinfo *newd; | |
426 | ||
427 | newd = malloc(sizeof(*newd)); | |
428 | if (!newd) | |
429 | continue; | |
430 | if (sysfs_add_disk(&newa->info, d, 0) < 0) { | |
431 | free(newd); | |
432 | continue; | |
433 | } | |
434 | disk_init_and_add(newd, d, newa); | |
435 | } | |
436 | queue_metadata_update(updates); | |
437 | updates = NULL; | |
438 | replace_array(a->container, a, newa); | |
439 | sysfs_set_str(&a->info, NULL, "sync_action", "recover"); | |
440 | out: | |
441 | while (newdev) { | |
442 | d = newdev->next; | |
443 | free(newdev); | |
444 | newdev = d; | |
445 | } | |
446 | free_updates(&updates); | |
447 | } | |
448 | } | |
449 | ||
450 | static int aa_ready(struct active_array *aa) | |
451 | { | |
452 | struct mdinfo *d; | |
453 | int level = aa->info.array.level; | |
454 | ||
455 | for (d = aa->info.devs; d; d = d->next) | |
456 | if (d->state_fd < 0) | |
457 | return 0; | |
458 | ||
459 | if (aa->info.state_fd < 0) | |
460 | return 0; | |
461 | ||
462 | if (level > 0 && (aa->action_fd < 0 || aa->resync_start_fd < 0)) | |
463 | return 0; | |
464 | ||
465 | if (!aa->container) | |
466 | return 0; | |
467 | ||
468 | return 1; | |
469 | } | |
470 | ||
471 | static void manage_new(struct mdstat_ent *mdstat, | |
472 | struct supertype *container, | |
473 | struct active_array *victim) | |
474 | { | |
475 | /* A new array has appeared in this container. | |
476 | * Hopefully it is already recorded in the metadata. | |
477 | * Check, then create the new array to report it to | |
478 | * the monitor. | |
479 | */ | |
480 | ||
481 | struct active_array *new; | |
482 | struct mdinfo *mdi, *di; | |
483 | char *inst; | |
484 | int i; | |
485 | int failed = 0; | |
486 | ||
487 | /* check if array is ready to be monitored */ | |
488 | if (!mdstat->active) | |
489 | return; | |
490 | ||
491 | mdi = sysfs_read(-1, mdstat->devnum, | |
492 | GET_LEVEL|GET_CHUNK|GET_DISKS|GET_COMPONENT| | |
493 | GET_DEGRADED|GET_DEVS|GET_OFFSET|GET_SIZE|GET_STATE); | |
494 | ||
495 | new = malloc(sizeof(*new)); | |
496 | ||
497 | if (!new || !mdi) { | |
498 | if (mdi) | |
499 | sysfs_free(mdi); | |
500 | if (new) | |
501 | free(new); | |
502 | return; | |
503 | } | |
504 | memset(new, 0, sizeof(*new)); | |
505 | ||
506 | new->devnum = mdstat->devnum; | |
507 | strcpy(new->info.sys_name, devnum2devname(new->devnum)); | |
508 | ||
509 | new->prev_state = new->curr_state = new->next_state = inactive; | |
510 | new->prev_action= new->curr_action= new->next_action= idle; | |
511 | ||
512 | new->container = container; | |
513 | ||
514 | inst = &mdstat->metadata_version[10+strlen(container->devname)+1]; | |
515 | ||
516 | new->info.array = mdi->array; | |
517 | new->info.component_size = mdi->component_size; | |
518 | ||
519 | for (i = 0; i < new->info.array.raid_disks; i++) { | |
520 | struct mdinfo *newd = malloc(sizeof(*newd)); | |
521 | ||
522 | for (di = mdi->devs; di; di = di->next) | |
523 | if (i == di->disk.raid_disk) | |
524 | break; | |
525 | ||
526 | if (disk_init_and_add(newd, di, new) != 0) { | |
527 | if (newd) | |
528 | free(newd); | |
529 | ||
530 | failed++; | |
531 | if (failed > new->info.array.failed_disks) { | |
532 | /* we cannot properly monitor without all working disks */ | |
533 | new->container = NULL; | |
534 | break; | |
535 | } | |
536 | } | |
537 | } | |
538 | ||
539 | new->action_fd = sysfs_open(new->devnum, NULL, "sync_action"); | |
540 | new->info.state_fd = sysfs_open(new->devnum, NULL, "array_state"); | |
541 | new->resync_start_fd = sysfs_open(new->devnum, NULL, "resync_start"); | |
542 | new->metadata_fd = sysfs_open(new->devnum, NULL, "metadata_version"); | |
543 | new->sync_completed_fd = sysfs_open(new->devnum, NULL, "sync_completed"); | |
544 | dprintf("%s: inst: %d action: %d state: %d\n", __func__, atoi(inst), | |
545 | new->action_fd, new->info.state_fd); | |
546 | ||
547 | sysfs_free(mdi); | |
548 | ||
549 | /* if everything checks out tell the metadata handler we want to | |
550 | * manage this instance | |
551 | */ | |
552 | if (!aa_ready(new) || container->ss->open_new(container, new, inst) < 0) { | |
553 | fprintf(stderr, "mdmon: failed to monitor %s\n", | |
554 | mdstat->metadata_version); | |
555 | new->container = NULL; | |
556 | free_aa(new); | |
557 | } else { | |
558 | replace_array(container, victim, new); | |
559 | if (failed) { | |
560 | new->check_degraded = 1; | |
561 | manage_member(mdstat, new); | |
562 | } | |
563 | } | |
564 | } | |
565 | ||
566 | void manage(struct mdstat_ent *mdstat, struct supertype *container) | |
567 | { | |
568 | /* We have just read mdstat and need to compare it with | |
569 | * the known active arrays. | |
570 | * Arrays with the wrong metadata are ignored. | |
571 | */ | |
572 | ||
573 | for ( ; mdstat ; mdstat = mdstat->next) { | |
574 | struct active_array *a; | |
575 | if (mdstat->devnum == container->devnum) { | |
576 | manage_container(mdstat, container); | |
577 | continue; | |
578 | } | |
579 | if (!is_container_member(mdstat, container->devname)) | |
580 | /* Not for this array */ | |
581 | continue; | |
582 | /* Looks like a member of this container */ | |
583 | for (a = container->arrays; a; a = a->next) { | |
584 | if (mdstat->devnum == a->devnum) { | |
585 | if (a->container) | |
586 | manage_member(mdstat, a); | |
587 | break; | |
588 | } | |
589 | } | |
590 | if (a == NULL || !a->container) | |
591 | manage_new(mdstat, container, a); | |
592 | } | |
593 | } | |
594 | ||
595 | static void handle_message(struct supertype *container, struct metadata_update *msg) | |
596 | { | |
597 | /* queue this metadata update through to the monitor */ | |
598 | ||
599 | struct metadata_update *mu; | |
600 | ||
601 | if (msg->len <= 0) | |
602 | while (update_queue_pending || update_queue) { | |
603 | check_update_queue(container); | |
604 | usleep(15*1000); | |
605 | } | |
606 | ||
607 | if (msg->len == 0) { /* ping_monitor */ | |
608 | int cnt; | |
609 | ||
610 | cnt = monitor_loop_cnt; | |
611 | if (cnt & 1) | |
612 | cnt += 2; /* wait until next pselect */ | |
613 | else | |
614 | cnt += 3; /* wait for 2 pselects */ | |
615 | wakeup_monitor(); | |
616 | ||
617 | while (monitor_loop_cnt - cnt < 0) | |
618 | usleep(10 * 1000); | |
619 | } else if (msg->len == -1) { /* ping_manager */ | |
620 | struct mdstat_ent *mdstat = mdstat_read(1, 0); | |
621 | ||
622 | manage(mdstat, container); | |
623 | free_mdstat(mdstat); | |
624 | } else if (!sigterm) { | |
625 | mu = malloc(sizeof(*mu)); | |
626 | mu->len = msg->len; | |
627 | mu->buf = msg->buf; | |
628 | msg->buf = NULL; | |
629 | mu->space = NULL; | |
630 | mu->next = NULL; | |
631 | if (container->ss->prepare_update) | |
632 | container->ss->prepare_update(container, mu); | |
633 | queue_metadata_update(mu); | |
634 | } | |
635 | } | |
636 | ||
637 | void read_sock(struct supertype *container) | |
638 | { | |
639 | int fd; | |
640 | struct metadata_update msg; | |
641 | int terminate = 0; | |
642 | long fl; | |
643 | int tmo = 3; /* 3 second timeout before hanging up the socket */ | |
644 | ||
645 | fd = accept(container->sock, NULL, NULL); | |
646 | if (fd < 0) | |
647 | return; | |
648 | ||
649 | fl = fcntl(fd, F_GETFL, 0); | |
650 | fl |= O_NONBLOCK; | |
651 | fcntl(fd, F_SETFL, fl); | |
652 | ||
653 | do { | |
654 | msg.buf = NULL; | |
655 | ||
656 | /* read and validate the message */ | |
657 | if (receive_message(fd, &msg, tmo) == 0) { | |
658 | handle_message(container, &msg); | |
659 | if (ack(fd, tmo) < 0) | |
660 | terminate = 1; | |
661 | } else | |
662 | terminate = 1; | |
663 | ||
664 | } while (!terminate); | |
665 | ||
666 | close(fd); | |
667 | } | |
668 | ||
669 | int exit_now = 0; | |
670 | int manager_ready = 0; | |
671 | void do_manager(struct supertype *container) | |
672 | { | |
673 | struct mdstat_ent *mdstat; | |
674 | sigset_t set; | |
675 | ||
676 | sigprocmask(SIG_UNBLOCK, NULL, &set); | |
677 | sigdelset(&set, SIGUSR1); | |
678 | sigdelset(&set, SIGTERM); | |
679 | ||
680 | do { | |
681 | ||
682 | if (exit_now) | |
683 | exit(0); | |
684 | ||
685 | /* Can only 'manage' things if 'monitor' is not making | |
686 | * structural changes to metadata, so need to check | |
687 | * update_queue | |
688 | */ | |
689 | if (update_queue == NULL) { | |
690 | mdstat = mdstat_read(1, 0); | |
691 | ||
692 | manage(mdstat, container); | |
693 | ||
694 | read_sock(container); | |
695 | ||
696 | free_mdstat(mdstat); | |
697 | } | |
698 | remove_old(); | |
699 | ||
700 | check_update_queue(container); | |
701 | ||
702 | manager_ready = 1; | |
703 | ||
704 | if (sigterm) | |
705 | wakeup_monitor(); | |
706 | ||
707 | if (update_queue == NULL) | |
708 | mdstat_wait_fd(container->sock, &set); | |
709 | else | |
710 | /* If an update is happening, just wait for signal */ | |
711 | pselect(0, NULL, NULL, NULL, NULL, &set); | |
712 | } while(1); | |
713 | } |