dma: beautify queue listing output
[dragonfly.git] / libexec / dma / dma.c
CommitLineData
f67beddd
MS
1/*
2 * Copyright (c) 2008 The DragonFly Project. All rights reserved.
3 *
4 * This code is derived from software contributed to The DragonFly Project
5 * by Simon 'corecode' Schubert <corecode@fs.ei.tum.de>.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
16 * distribution.
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
f67beddd
MS
33 */
34
35#include <sys/param.h>
36#include <sys/queue.h>
37#include <sys/stat.h>
38#include <sys/types.h>
bc7baf1d 39#include <sys/wait.h>
f67beddd 40
f67beddd
MS
41#include <dirent.h>
42#include <err.h>
43#include <errno.h>
44#include <fcntl.h>
45#include <inttypes.h>
f67beddd
MS
46#include <paths.h>
47#include <pwd.h>
48#include <signal.h>
49#include <stdarg.h>
50#include <stdio.h>
51#include <stdlib.h>
52#include <string.h>
53#include <syslog.h>
54#include <unistd.h>
55
56#include "dma.h"
57
58
59
4a23bd3d 60static void deliver(struct qitem *);
f67beddd
MS
61
62struct aliases aliases = LIST_HEAD_INITIALIZER(aliases);
f4e61a9f 63struct strlist tmpfs = SLIST_HEAD_INITIALIZER(tmpfs);
f67beddd
MS
64struct virtusers virtusers = LIST_HEAD_INITIALIZER(virtusers);
65struct authusers authusers = LIST_HEAD_INITIALIZER(authusers);
f67beddd 66struct config *config;
9afa363f 67const char *username;
1da0a9f2 68const char *logident_base;
f67beddd 69
9afa363f 70static int daemonize = 1;
f8633e71 71
f67beddd 72static char *
1c9e6b7b 73set_from(struct queue *queue, const char *osender)
f67beddd
MS
74{
75 struct virtuser *v;
76 char *sender;
77
78 if ((config->features & VIRTUAL) != 0) {
79 SLIST_FOREACH(v, &virtusers, next) {
f8633e71 80 if (strcmp(v->login, username) == 0) {
f67beddd
MS
81 sender = strdup(v->address);
82 if (sender == NULL)
83 return(NULL);
84 goto out;
85 }
86 }
87 }
88
89 if (osender) {
90 sender = strdup(osender);
91 if (sender == NULL)
4a23bd3d 92 return (NULL);
f67beddd 93 } else {
f8633e71 94 if (asprintf(&sender, "%s@%s", username, hostname()) <= 0)
4a23bd3d 95 return (NULL);
f67beddd
MS
96 }
97
98 if (strchr(sender, '\n') != NULL) {
99 errno = EINVAL;
4a23bd3d 100 return (NULL);
f67beddd
MS
101 }
102
103out:
1c9e6b7b 104 queue->sender = sender;
4a23bd3d 105 return (sender);
f67beddd
MS
106}
107
108static int
109read_aliases(void)
110{
111 yyin = fopen(config->aliases, "r");
112 if (yyin == NULL)
4a23bd3d 113 return (0); /* not fatal */
f67beddd 114 if (yyparse())
4a23bd3d 115 return (-1); /* fatal error, probably malloc() */
f67beddd 116 fclose(yyin);
4a23bd3d 117 return (0);
f67beddd
MS
118}
119
f4e61a9f 120int
1c9e6b7b 121add_recp(struct queue *queue, const char *str, int expand)
f67beddd
MS
122{
123 struct qitem *it, *tit;
124 struct stritem *sit;
125 struct alias *al;
126 struct passwd *pw;
127 char *host;
128 int aliased = 0;
129
130 it = calloc(1, sizeof(*it));
131 if (it == NULL)
4a23bd3d 132 return (-1);
f67beddd
MS
133 it->addr = strdup(str);
134 if (it->addr == NULL)
4a23bd3d 135 return (-1);
f67beddd 136
1c9e6b7b 137 it->sender = queue->sender;
f67beddd
MS
138 host = strrchr(it->addr, '@');
139 if (host != NULL &&
140 (strcmp(host + 1, hostname()) == 0 ||
141 strcmp(host + 1, "localhost") == 0)) {
142 *host = 0;
143 }
144 LIST_FOREACH(tit, &queue->queue, next) {
145 /* weed out duplicate dests */
146 if (strcmp(tit->addr, it->addr) == 0) {
147 free(it->addr);
148 free(it);
4a23bd3d 149 return (0);
f67beddd
MS
150 }
151 }
152 LIST_INSERT_HEAD(&queue->queue, it, next);
153 if (strrchr(it->addr, '@') == NULL) {
4a23bd3d 154 it->remote = 0;
f67beddd
MS
155 if (expand) {
156 LIST_FOREACH(al, &aliases, next) {
157 if (strcmp(al->alias, it->addr) != 0)
158 continue;
159 SLIST_FOREACH(sit, &al->dests, next) {
1c9e6b7b 160 if (add_recp(queue, sit->str, 1) != 0)
4a23bd3d 161 return (-1);
f67beddd
MS
162 }
163 aliased = 1;
164 }
165 if (aliased) {
166 LIST_REMOVE(it, next);
167 } else {
4a23bd3d 168 /* Local destination, check */
f67beddd
MS
169 pw = getpwnam(it->addr);
170 if (pw == NULL)
171 goto out;
13e288a1 172 /* XXX read .forward */
4a23bd3d 173 endpwent();
f67beddd
MS
174 }
175 }
176 } else {
4a23bd3d 177 it->remote = 1;
f67beddd
MS
178 }
179
4a23bd3d 180 return (0);
f67beddd
MS
181
182out:
183 free(it->addr);
184 free(it);
4a23bd3d 185 return (-1);
f67beddd
MS
186}
187
4a23bd3d
MS
188static struct qitem *
189go_background(struct queue *queue)
f67beddd
MS
190{
191 struct sigaction sa;
192 struct qitem *it;
193 pid_t pid;
194
195 if (daemonize && daemon(0, 0) != 0) {
4a23bd3d 196 syslog(LOG_ERR, "can not daemonize: %m");
f67beddd
MS
197 exit(1);
198 }
199 daemonize = 0;
4a23bd3d 200
f67beddd
MS
201 bzero(&sa, sizeof(sa));
202 sa.sa_flags = SA_NOCLDWAIT;
203 sa.sa_handler = SIG_IGN;
204 sigaction(SIGCHLD, &sa, NULL);
205
4dcaa51b 206 LIST_FOREACH(it, &queue->queue, next) {
4a23bd3d 207 /* No need to fork for the last dest */
9afa363f
SS
208 if (LIST_NEXT(it, next) == NULL)
209 goto retit;
4a23bd3d 210
f67beddd
MS
211 pid = fork();
212 switch (pid) {
213 case -1:
214 syslog(LOG_ERR, "can not fork: %m");
215 exit(1);
216 break;
217
218 case 0:
219 /*
220 * Child:
221 *
222 * return and deliver mail
223 */
9afa363f
SS
224retit:
225 /*
226 * If necessary, aquire the queue and * mail files.
227 * If this fails, we probably were raced by another
228 * process.
229 */
405f48ee 230 setlogident("%s", it->queueid);
9afa363f
SS
231 if (aquirespool(it) < 0)
232 exit(1);
233 dropspool(queue, it);
4a23bd3d 234 return (it);
f67beddd
MS
235
236 default:
237 /*
238 * Parent:
239 *
240 * fork next child
241 */
242 break;
243 }
244 }
245
246 syslog(LOG_CRIT, "reached dead code");
247 exit(1);
248}
249
250static void
4a23bd3d 251deliver(struct qitem *it)
f67beddd
MS
252{
253 int error;
254 unsigned int backoff = MIN_RETRY;
5868e44c 255 const char *errmsg = "unknown bounce reason";
f67beddd
MS
256 struct timeval now;
257 struct stat st;
258
f67beddd 259retry:
405f48ee 260 syslog(LOG_INFO, "trying delivery");
f67beddd 261
4a23bd3d
MS
262 if (it->remote)
263 error = deliver_remote(it, &errmsg);
264 else
f67beddd
MS
265 error = deliver_local(it, &errmsg);
266
267 switch (error) {
268 case 0:
f4e61a9f 269 delqueue(it);
405f48ee 270 syslog(LOG_INFO, "delivery successful");
f67beddd
MS
271 exit(0);
272
273 case 1:
274 if (stat(it->queuefn, &st) != 0) {
405f48ee 275 syslog(LOG_ERR, "lost queue file `%s'", it->queuefn);
f67beddd
MS
276 exit(1);
277 }
278 if (gettimeofday(&now, NULL) == 0 &&
279 (now.tv_sec - st.st_mtimespec.tv_sec > MAX_TIMEOUT)) {
5868e44c 280 asprintf(__DECONST(void *, &errmsg),
4a23bd3d 281 "Could not deliver for the last %d seconds. Giving up.",
39f7c85a 282 MAX_TIMEOUT);
f67beddd
MS
283 goto bounce;
284 }
285 sleep(backoff);
286 backoff *= 2;
287 if (backoff > MAX_RETRY)
288 backoff = MAX_RETRY;
289 goto retry;
290
291 case -1:
292 default:
293 break;
294 }
295
296bounce:
4a23bd3d 297 bounce(it, errmsg);
f67beddd
MS
298 /* NOTREACHED */
299}
300
30833a29 301void
f67beddd
MS
302run_queue(struct queue *queue)
303{
4a23bd3d
MS
304 struct qitem *it;
305
f67beddd
MS
306 if (LIST_EMPTY(&queue->queue))
307 return;
308
4a23bd3d
MS
309 it = go_background(queue);
310 deliver(it);
f67beddd
MS
311 /* NOTREACHED */
312}
313
314static void
315show_queue(struct queue *queue)
316{
317 struct qitem *it;
9afa363f 318 int locked = 0; /* XXX */
f67beddd
MS
319
320 if (LIST_EMPTY(&queue->queue)) {
321 printf("Mail queue is empty\n");
322 return;
323 }
324
325 LIST_FOREACH(it, &queue->queue, next) {
7b5c40d5
SS
326 printf("ID\t: %s%s\n"
327 "From\t: %s\n"
71b5e57d 328 "To\t: %s\n",
7b5c40d5 329 it->queueid,
9afa363f 330 locked ? "*" : "",
7b5c40d5 331 it->sender, it->addr);
71b5e57d
SS
332
333 if (LIST_NEXT(it, next) != NULL)
334 printf("--\n");
f67beddd
MS
335 }
336}
337
338/*
339 * TODO:
340 *
341 * - alias processing
342 * - use group permissions
343 * - proper sysexit codes
344 */
345
4a23bd3d
MS
346int
347main(int argc, char **argv)
f67beddd
MS
348{
349 char *sender = NULL;
f67beddd 350 struct queue queue;
f67beddd 351 int i, ch;
a9337db7 352 int nodot = 0, doqueue = 0, showq = 0, queue_only = 0;
f67beddd
MS
353
354 atexit(deltmp);
e50076f8
SS
355
356 bzero(&queue, sizeof(queue));
f67beddd 357 LIST_INIT(&queue.queue);
f67beddd 358
eb870081
SS
359 if (strcmp(argv[0], "mailq") == 0) {
360 argv++; argc--;
361 showq = 1;
362 if (argc != 0)
363 errx(1, "invalid arguments");
364 goto skipopts;
365 }
366
ae3c3bbd 367 opterr = 0;
abbe6a2c 368 while ((ch = getopt(argc, argv, ":A:b:B:C:d:Df:F:h:iL:N:no:O:q:r:R:UV:vX:")) != -1) {
f67beddd
MS
369 switch (ch) {
370 case 'A':
371 /* -AX is being ignored, except for -A{c,m} */
372 if (optarg[0] == 'c' || optarg[0] == 'm') {
373 break;
374 }
375 /* else FALLTRHOUGH */
376 case 'b':
377 /* -bX is being ignored, except for -bp */
378 if (optarg[0] == 'p') {
379 showq = 1;
380 break;
a9337db7
SS
381 } else if (optarg[0] == 'q') {
382 queue_only = 1;
383 break;
f67beddd
MS
384 }
385 /* else FALLTRHOUGH */
386 case 'D':
387 daemonize = 0;
388 break;
389 case 'L':
405f48ee 390 logident_base = optarg;
f67beddd
MS
391 break;
392 case 'f':
393 case 'r':
394 sender = optarg;
395 break;
396
397 case 'o':
398 /* -oX is being ignored, except for -oi */
399 if (optarg[0] != 'i')
400 break;
401 /* else FALLTRHOUGH */
ae3c3bbd
MS
402 case 'O':
403 break;
f67beddd
MS
404 case 'i':
405 nodot = 1;
406 break;
407
408 case 'q':
409 doqueue = 1;
410 break;
411
98dfc119
SS
412 /* Ignored options */
413 case 'B':
414 case 'C':
415 case 'd':
416 case 'F':
417 case 'h':
418 case 'N':
419 case 'n':
420 case 'R':
421 case 'U':
422 case 'V':
423 case 'v':
424 case 'X':
425 break;
426
abbe6a2c
SS
427 case ':':
428 if (optopt == 'q') {
429 doqueue = 1;
430 break;
431 }
432 /* FALLTHROUGH */
433
f67beddd 434 default:
abbe6a2c 435 fprintf(stderr, "invalid argument: `-%c'\n", optopt);
f67beddd
MS
436 exit(1);
437 }
438 }
439 argc -= optind;
440 argv += optind;
ae3c3bbd 441 opterr = 1;
f67beddd 442
13e288a1
SS
443 if (argc != 0 && (showq || doqueue))
444 errx(1, "sending mail and queue operations are mutually exclusive");
445
446 if (showq + doqueue > 1)
447 errx(1, "conflicting queue operations");
448
eb870081 449skipopts:
405f48ee
SS
450 if (logident_base == NULL)
451 logident_base = "dma";
452 setlogident(NULL);
f8633e71 453 set_username();
f67beddd 454
569443a9
SS
455 /* XXX fork root here */
456
13e288a1 457 config = calloc(1, sizeof(*config));
f67beddd 458 if (config == NULL)
1da0a9f2 459 errlog(1, NULL);
f67beddd 460
f4e61a9f 461 if (parse_conf(CONF_PATH) < 0) {
f67beddd 462 free(config);
1da0a9f2 463 errlog(1, "can not read config file");
f67beddd
MS
464 }
465
466 if (config->features & VIRTUAL)
4a23bd3d 467 if (parse_virtuser(config->virtualpath) < 0)
1da0a9f2 468 errlog(1, "can not read virtual user file `%s'",
f67beddd
MS
469 config->virtualpath);
470
4a23bd3d 471 if (parse_authfile(config->authpath) < 0)
1da0a9f2 472 errlog(1, "can not read SMTP authentication file");
f67beddd
MS
473
474 if (showq) {
e50076f8 475 if (load_queue(&queue) < 0)
1da0a9f2 476 errlog(1, "can not load queue");
e50076f8 477 show_queue(&queue);
4a23bd3d 478 return (0);
f67beddd
MS
479 }
480
481 if (doqueue) {
e50076f8 482 if (load_queue(&queue) < 0)
1da0a9f2 483 errlog(1, "can not load queue");
e50076f8 484 run_queue(&queue);
4a23bd3d 485 return (0);
f67beddd
MS
486 }
487
4a23bd3d 488 if (read_aliases() != 0)
1da0a9f2 489 errlog(1, "can not read aliases file `%s'", config->aliases);
f67beddd 490
1c9e6b7b 491 if ((sender = set_from(&queue, sender)) == NULL)
1da0a9f2 492 errlog(1, NULL);
f67beddd
MS
493
494 for (i = 0; i < argc; i++) {
1c9e6b7b 495 if (add_recp(&queue, argv[i], 1) != 0)
1da0a9f2 496 errlogx(1, "invalid recipient `%s'", argv[i]);
f67beddd
MS
497 }
498
4a23bd3d 499 if (LIST_EMPTY(&queue.queue))
1da0a9f2 500 errlogx(1, "no recipients");
f67beddd 501
1c9e6b7b 502 if (newspoolf(&queue) != 0)
1da0a9f2 503 errlog(1, "can not create temp file");
4a23bd3d 504
405f48ee
SS
505 setlogident("%s", queue.id);
506
1c9e6b7b 507 if (readmail(&queue, nodot) != 0)
1da0a9f2 508 errlog(1, "can not read mail");
f67beddd 509
1c9e6b7b 510 if (linkspool(&queue) != 0)
1da0a9f2 511 errlog(1, "can not create spools");
f67beddd
MS
512
513 /* From here on the mail is safe. */
514
a9337db7 515 if (config->features & DEFER || queue_only)
4a23bd3d 516 return (0);
f67beddd 517
30833a29 518 run_queue(&queue);
f67beddd
MS
519
520 /* NOTREACHED */
4a23bd3d 521 return (0);
4dcaa51b 522}