]>
git.ipfire.org Git - people/ms/dma.git/blob - spool.c
2 * Copyright (c) 2008 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
5 * by Simon 'corecode' Schubert <corecode@fs.ei.tum.de>.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
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
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.
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
51 * 'Q'id files (queue):
52 * Organized like an RFC822 header, field: value. Ignores unknown fields.
54 * Sender: envelope-from
55 * Recipient: envelope-to
60 * Each queue file needs to have a corresponding data file.
61 * One data file might be shared by linking it several times.
63 * Queue ids are unique, formed from the inode of the data file
64 * and a unique identifier.
68 newspoolf(struct queue
*queue
)
75 if (snprintf(fn
, sizeof(fn
), "%s/%s", config
->spooldir
, "tmp_XXXXXXXXXX") <= 0)
81 if (flock(fd
, LOCK_EX
) == -1)
83 queue
->tmpf
= strdup(fn
);
84 if (queue
->tmpf
== NULL
)
90 if (fstat(fd
, &st
) != 0)
92 if (asprintf(&queue
->id
, "%"PRIxMAX
, st
.st_ino
) < 0)
95 queue
->mailf
= fdopen(fd
, "r+");
96 if (queue
->mailf
== NULL
)
99 t
= malloc(sizeof(*t
));
101 t
->str
= queue
->tmpf
;
102 SLIST_INSERT_HEAD(&tmpfs
, t
, next
);
107 if (queue
->mailf
!= NULL
)
108 fclose(queue
->mailf
);
115 writequeuef(struct qitem
*it
)
120 queuefd
= open_locked(it
->queuefn
, O_CREAT
|O_EXCL
|O_RDWR
, 0600);
123 it
->queuef
= fdopen(queuefd
, "w+");
124 if (it
->queuef
== NULL
)
127 error
= fprintf(it
->queuef
,
138 if (fflush(it
->queuef
) != 0 || fsync(fileno(it
->queuef
)) != 0)
144 static struct qitem
*
145 readqueuef(struct queue
*queue
, char *queuefn
)
148 struct queue itmqueue
;
151 char *queueid
= NULL
, *sender
= NULL
, *addr
= NULL
;
152 struct qitem
*it
= NULL
;
154 bzero(&itmqueue
, sizeof(itmqueue
));
155 LIST_INIT(&itmqueue
.queue
);
157 queuef
= fopen(queuefn
, "r");
161 while (!feof(queuef
)) {
162 if (fgets(line
, sizeof(line
), queuef
) == NULL
|| line
[0] == 0)
164 line
[strlen(line
) - 1] = 0; /* chop newline */
166 s
= strchr(line
, ':');
176 if (s
== NULL
|| s
[0] == 0)
179 if (strcmp(line
, "ID") == 0) {
181 } else if (strcmp(line
, "Sender") == 0) {
183 } else if (strcmp(line
, "Recipient") == 0) {
186 syslog(LOG_DEBUG
, "ignoring unknown queue info `%s' in `%s'",
192 if (queueid
== NULL
|| sender
== NULL
|| addr
== NULL
) {
195 syslog(LOG_ERR
, "malformed queue file `%s'", queuefn
);
199 if (add_recp(&itmqueue
, addr
, 0) != 0)
202 it
= LIST_FIRST(&itmqueue
.queue
);
203 it
->sender
= sender
; sender
= NULL
;
204 it
->queueid
= queueid
; queueid
= NULL
;
205 it
->queuefn
= queuefn
; queuefn
= NULL
;
206 LIST_INSERT_HEAD(&queue
->queue
, it
, next
);
222 linkspool(struct queue
*queue
)
227 if (fflush(queue
->mailf
) != 0 || fsync(fileno(queue
->mailf
)) != 0)
230 syslog(LOG_INFO
, "new mail from user=%s uid=%d envelope_from=<%s>",
231 username
, getuid(), queue
->sender
);
233 LIST_FOREACH(it
, &queue
->queue
, next
) {
234 if (asprintf(&it
->queueid
, "%s.%"PRIxPTR
, queue
->id
, (uintptr_t)it
) <= 0)
236 if (asprintf(&it
->queuefn
, "%s/Q%s", config
->spooldir
, it
->queueid
) <= 0)
238 if (asprintf(&it
->mailfn
, "%s/M%s", config
->spooldir
, it
->queueid
) <= 0)
241 /* Neither file may not exist yet */
242 if (stat(it
->queuefn
, &st
) == 0 || stat(it
->mailfn
, &st
) == 0)
245 if (writequeuef(it
) != 0)
248 if (link(queue
->tmpf
, it
->mailfn
) != 0)
252 LIST_FOREACH(it
, &queue
->queue
, next
) {
253 syslog(LOG_INFO
, "mail to=<%s> queued as %s",
254 it
->addr
, it
->queueid
);
261 LIST_FOREACH(it
, &queue
->queue
, next
) {
269 load_queue(struct queue
*queue
)
278 bzero(queue
, sizeof(queue
));
279 LIST_INIT(&queue
->queue
);
281 spooldir
= opendir(config
->spooldir
);
282 if (spooldir
== NULL
)
283 err(1, "reading queue");
285 while ((de
= readdir(spooldir
)) != NULL
) {
289 /* ignore temp files */
290 if (strncmp(de
->d_name
, "tmp_", 4) == 0 || de
->d_type
!= DT_REG
)
292 if (de
->d_name
[0] != 'Q')
294 if (asprintf(&queuefn
, "%s/Q%s", config
->spooldir
, de
->d_name
+ 1) < 0)
296 if (asprintf(&mailfn
, "%s/M%s", config
->spooldir
, de
->d_name
+ 1) < 0)
299 if (stat(mailfn
, &sb
) != 0)
302 it
= readqueuef(queue
, queuefn
);
310 syslog(LOG_INFO
, "could not pick up queue file: `%s'/`%s': %m", queuefn
, mailfn
);
324 delqueue(struct qitem
*it
)
328 if (it
->queuef
!= NULL
)
330 if (it
->mailf
!= NULL
)
336 aquirespool(struct qitem
*it
)
340 if (it
->queuef
== NULL
) {
341 queuefd
= open_locked(it
->queuefn
, O_RDWR
|O_NONBLOCK
);
344 it
->queuef
= fdopen(queuefd
, "r+");
345 if (it
->queuef
== NULL
)
349 if (it
->mailf
== NULL
) {
350 it
->mailf
= fopen(it
->mailfn
, "r");
351 if (it
->mailf
== NULL
)
358 syslog(LOG_INFO
, "could not aquire queue file: %m");
363 dropspool(struct queue
*queue
, struct qitem
*keep
)
367 LIST_FOREACH(it
, &queue
->queue
, next
) {
371 if (it
->queuef
!= NULL
)
373 if (it
->mailf
!= NULL
)