[people/ms/dma.git] / spool.c

/*
 * Copyright (c) 2008 The DragonFly Project.  All rights reserved.
 *
 * This code is derived from software contributed to The DragonFly Project
 * by Simon 'corecode' Schubert <corecode@fs.ei.tum.de>.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 * 3. Neither the name of The DragonFly Project nor the names of its
 *    contributors may be used to endorse or promote products derived
 *    from this software without specific, prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#include <sys/stat.h>

#include <ctype.h>
#include <dirent.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <inttypes.h>
#include <unistd.h>
#include <syslog.h>

#include "dma.h"

/*
 * Spool file format:
 *
 * 'Q'id files (queue):
 *   Organized like an RFC822 header, field: value.  Ignores unknown fields.
 *   ID: id
 *   Sender: envelope-from
 *   Recipient: envelope-to
 *
 * 'M'id files (data):
 *   mail data
 *
 * Each queue file needs to have a corresponding data file.
 * One data file might be shared by linking it several times.
 *
 * Queue ids are unique, formed from the inode of the data file
 * and a unique identifier.
 */

int
newspoolf(struct queue *queue)
{
	char fn[PATH_MAX+1];
	struct stat st;
	struct stritem *t;
	int fd;

	if (snprintf(fn, sizeof(fn), "%s/%s", config->spooldir, "tmp_XXXXXXXXXX") <= 0)
		return (-1);

	fd = mkstemp(fn);
	if (fd < 0)
		return (-1);
	if (flock(fd, LOCK_EX) == -1)
		goto fail;
	queue->tmpf = strdup(fn);
	if (queue->tmpf == NULL)
		goto fail;

	/*
	 * Assign queue id
	 */
	if (fstat(fd, &st) != 0)
		goto fail;
	if (asprintf(&queue->id, "%"PRIxMAX, st.st_ino) < 0)
		goto fail;

	queue->mailf = fdopen(fd, "r+");
	if (queue->mailf == NULL)
		goto fail;

	t = malloc(sizeof(*t));
	if (t != NULL) {
		t->str = queue->tmpf;
		SLIST_INSERT_HEAD(&tmpfs, t, next);
	}
	return (0);

fail:
	if (queue->mailf != NULL)
		fclose(queue->mailf);
	close(fd);
	unlink(fn);
	return (-1);
}

static int
writequeuef(struct qitem *it)
{
	int error;
	int queuefd;

	queuefd = open_locked(it->queuefn, O_CREAT|O_EXCL|O_RDWR, 0600);
	if (queuefd == -1)
		return (-1);
	it->queuef = fdopen(queuefd, "w+");
	if (it->queuef == NULL)
		return (-1);

	error = fprintf(it->queuef,
			"ID: %s\n"
			"Sender: %s\n"
			"Recipient: %s\n",
			 it->queueid,
			 it->sender,
			 it->addr);

	if (error <= 0)
		return (-1);

	if (fflush(it->queuef) != 0 || fsync(fileno(it->queuef)) != 0)
		return (-1);

	return (0);
}

static struct qitem *
readqueuef(struct queue *queue, char *queuefn)
{
	char line[1000];
	struct queue itmqueue;
	FILE *queuef = NULL;
	char *s;
	char *queueid = NULL, *sender = NULL, *addr = NULL;
	struct qitem *it = NULL;

	bzero(&itmqueue, sizeof(itmqueue));
	LIST_INIT(&itmqueue.queue);

	queuef = fopen(queuefn, "r");
	if (queuef == NULL)
		goto out;

	while (!feof(queuef)) {
		if (fgets(line, sizeof(line), queuef) == NULL || line[0] == 0)
			break;
		line[strlen(line) - 1] = 0;	/* chop newline */

		s = strchr(line, ':');
		if (s == NULL)
			goto malformed;
		*s = 0;

		s++;
		while (isspace(*s))
			s++;

		s = strdup(s);
		if (s == NULL || s[0] == 0)
			goto malformed;

		if (strcmp(line, "ID") == 0) {
			queueid = s;
		} else if (strcmp(line, "Sender") == 0) {
			sender = s;
		} else if (strcmp(line, "Recipient") == 0) {
			addr = s;
		} else {
			syslog(LOG_DEBUG, "ignoring unknown queue info `%s' in `%s'",
			       line, queuefn);
			free(s);
		}
	}

	if (queueid == NULL || sender == NULL || addr == NULL) {
malformed:
		errno = EINVAL;
		syslog(LOG_ERR, "malformed queue file `%s'", queuefn);
		goto out;
	}

	if (add_recp(&itmqueue, addr, 0) != 0)
		goto out;

	it = LIST_FIRST(&itmqueue.queue);
	it->sender = sender; sender = NULL;
	it->queueid = queueid; queueid = NULL;
	it->queuefn = queuefn; queuefn = NULL;
	LIST_INSERT_HEAD(&queue->queue, it, next);

out:
	if (sender != NULL)
		free(sender);
	if (queueid != NULL)
		free(queueid);
	if (addr != NULL)
		free(addr);
	if (queuef != NULL)
		fclose(queuef);

	return (it);
}

int
linkspool(struct queue *queue)
{
	struct stat st;
	struct qitem *it;

	if (fflush(queue->mailf) != 0 || fsync(fileno(queue->mailf)) != 0)
		goto delfiles;

	syslog(LOG_INFO, "new mail from user=%s uid=%d envelope_from=<%s>",
	       username, getuid(), queue->sender);

	LIST_FOREACH(it, &queue->queue, next) {
		if (asprintf(&it->queueid, "%s.%"PRIxPTR, queue->id, (uintptr_t)it) <= 0)
			goto delfiles;
		if (asprintf(&it->queuefn, "%s/Q%s", config->spooldir, it->queueid) <= 0)
			goto delfiles;
		if (asprintf(&it->mailfn, "%s/M%s", config->spooldir, it->queueid) <= 0)
			goto delfiles;

		/* Neither file may not exist yet */
		if (stat(it->queuefn, &st) == 0 || stat(it->mailfn, &st) == 0)
			goto delfiles;

		if (writequeuef(it) != 0)
			goto delfiles;

		if (link(queue->tmpf, it->mailfn) != 0)
			goto delfiles;
	}

	LIST_FOREACH(it, &queue->queue, next) {
		syslog(LOG_INFO, "mail to=<%s> queued as %s",
		       it->addr, it->queueid);
	}

	unlink(queue->tmpf);
	return (0);

delfiles:
	LIST_FOREACH(it, &queue->queue, next) {
		unlink(it->mailfn);
		unlink(it->queuefn);
	}
	return (-1);
}

int
load_queue(struct queue *queue)
{
	struct stat sb;
	struct qitem *it;
	DIR *spooldir;
	struct dirent *de;
	char *queuefn;
	char *mailfn;

	bzero(queue, sizeof(queue));
	LIST_INIT(&queue->queue);

	spooldir = opendir(config->spooldir);
	if (spooldir == NULL)
		err(1, "reading queue");

	while ((de = readdir(spooldir)) != NULL) {
		queuefn = NULL;
		mailfn = NULL;

		/* ignore temp files */
		if (strncmp(de->d_name, "tmp_", 4) == 0 || de->d_type != DT_REG)
			continue;
		if (de->d_name[0] != 'Q')
			continue;
		if (asprintf(&queuefn, "%s/Q%s", config->spooldir, de->d_name + 1) < 0)
			goto fail;
		if (asprintf(&mailfn, "%s/M%s", config->spooldir, de->d_name + 1) < 0)
			goto fail;

		if (stat(mailfn, &sb) != 0)
			goto skip_item;

		it = readqueuef(queue, queuefn);
		if (it == NULL)
			goto skip_item;

		it->mailfn = mailfn;
		continue;

skip_item:
		syslog(LOG_INFO, "could not pick up queue file: `%s'/`%s': %m", queuefn, mailfn);
		if (queuefn != NULL)
			free(queuefn);
		if (mailfn != NULL)
			free(queuefn);
	}
	closedir(spooldir);
	return (0);

fail:
	return (-1);
}

void
delqueue(struct qitem *it)
{
	unlink(it->mailfn);
	unlink(it->queuefn);
	if (it->queuef != NULL)
		fclose(it->queuef);
	if (it->mailf != NULL)
		fclose(it->mailf);
	free(it);
}

int
aquirespool(struct qitem *it)
{
	int queuefd;

	if (it->queuef == NULL) {
		queuefd = open_locked(it->queuefn, O_RDWR|O_NONBLOCK);
		if (queuefd < 0)
			goto fail;
		it->queuef = fdopen(queuefd, "r+");
		if (it->queuef == NULL)
			goto fail;
	}

	if (it->mailf == NULL) {
		it->mailf = fopen(it->mailfn, "r");
		if (it->mailf == NULL)
			goto fail;
	}

	return (0);

fail:
	syslog(LOG_INFO, "could not aquire queue file: %m");
	return (-1);
}

void
dropspool(struct queue *queue, struct qitem *keep)
{
	struct qitem *it;

	LIST_FOREACH(it, &queue->queue, next) {
		if (it == keep)
			continue;

		if (it->queuef != NULL)
			fclose(it->queuef);
		if (it->mailf != NULL)
			fclose(it->mailf);
	}
}
Commit	Line	Data
fd1de51a SS	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.
fd1de51a SS	33	*/
	34
	35	#include <sys/stat.h>
	36
6ddd63e1	37	#include <ctype.h>
fd1de51a SS	38	#include <dirent.h>
	39	#include <err.h>
	40	#include <errno.h>
	41	#include <fcntl.h>
	42	#include <inttypes.h>
	43	#include <unistd.h>
4d5af2b0	44	#include <syslog.h>
fd1de51a SS	45
	46	#include "dma.h"
	47
	48	/*
	49	* Spool file format:
	50	*
	51	* 'Q'id files (queue):
6ddd63e1 SS	52	* Organized like an RFC822 header, field: value. Ignores unknown fields.
	53	* ID: id
	54	* Sender: envelope-from
	55	* Recipient: envelope-to
fd1de51a SS	56	*
fd1de51a SS	57	* 'M'id files (data):
fd1de51a SS	58	* mail data
	59	*
	60	* Each queue file needs to have a corresponding data file.
	61	* One data file might be shared by linking it several times.
	62	*
24a87a55	63	* Queue ids are unique, formed from the inode of the data file
fd1de51a SS	64	* and a unique identifier.
	65	*/
	66
	67	int
057afad5	68	newspoolf(struct queue *queue)
fd1de51a	69	{
fd1de51a	70	char fn[PATH_MAX+1];
4d5af2b0	71	struct stat st;
fd1de51a	72	struct stritem *t;
87bdbc01	73	int fd;
fd1de51a SS	74
	75	if (snprintf(fn, sizeof(fn), "%s/%s", config->spooldir, "tmp_XXXXXXXXXX") <= 0)
	76	return (-1);
	77
87bdbc01 SS	78	fd = mkstemp(fn);
87bdbc01 SS	79	if (fd < 0)
fd1de51a	80	return (-1);
87bdbc01 SS	81	if (flock(fd, LOCK_EX) == -1)
87bdbc01 SS	82	goto fail;
fd1de51a SS	83	queue->tmpf = strdup(fn);
	84	if (queue->tmpf == NULL)
	85	goto fail;
	86
87bdbc01 SS	87	/*
	88	* Assign queue id
	89	*/
	90	if (fstat(fd, &st) != 0)
fd1de51a	91	goto fail;
87bdbc01	92	if (asprintf(&queue->id, "%"PRIxMAX, st.st_ino) < 0)
fd1de51a SS	93	goto fail;
fd1de51a SS	94
87bdbc01 SS	95	queue->mailf = fdopen(fd, "r+");
	96	if (queue->mailf == NULL)
	97	goto fail;
fd1de51a	98
fd1de51a SS	99	t = malloc(sizeof(*t));
	100	if (t != NULL) {
	101	t->str = queue->tmpf;
	102	SLIST_INSERT_HEAD(&tmpfs, t, next);
	103	}
	104	return (0);
	105
	106	fail:
87bdbc01 SS	107	if (queue->mailf != NULL)
	108	fclose(queue->mailf);
	109	close(fd);
fd1de51a SS	110	unlink(fn);
	111	return (-1);
	112	}
	113
6ddd63e1 SS	114	static int
	115	writequeuef(struct qitem *it)
	116	{
	117	int error;
	118	int queuefd;
	119
	120	queuefd = open_locked(it->queuefn, O_CREAT\|O_EXCL\|O_RDWR, 0600);
	121	if (queuefd == -1)
	122	return (-1);
	123	it->queuef = fdopen(queuefd, "w+");
	124	if (it->queuef == NULL)
	125	return (-1);
	126
	127	error = fprintf(it->queuef,
	128	"ID: %s\n"
	129	"Sender: %s\n"
	130	"Recipient: %s\n",
	131	it->queueid,
	132	it->sender,
	133	it->addr);
	134
	135	if (error <= 0)
	136	return (-1);
	137
	138	if (fflush(it->queuef) != 0 \|\| fsync(fileno(it->queuef)) != 0)
	139	return (-1);
	140
	141	return (0);
	142	}
	143
	144	static struct qitem *
	145	readqueuef(struct queue queue, char queuefn)
	146	{
	147	char line[1000];
	148	struct queue itmqueue;
	149	FILE *queuef = NULL;
	150	char *s;
	151	char queueid = NULL, sender = NULL, *addr = NULL;
	152	struct qitem *it = NULL;
	153
	154	bzero(&itmqueue, sizeof(itmqueue));
	155	LIST_INIT(&itmqueue.queue);
	156
	157	queuef = fopen(queuefn, "r");
	158	if (queuef == NULL)
	159	goto out;
	160
	161	while (!feof(queuef)) {
	162	if (fgets(line, sizeof(line), queuef) == NULL \|\| line[0] == 0)
	163	break;
	164	line[strlen(line) - 1] = 0; /* chop newline */
	165
	166	s = strchr(line, ':');
	167	if (s == NULL)
	168	goto malformed;
	169	*s = 0;
	170
	171	s++;
	172	while (isspace(*s))
	173	s++;
	174
	175	s = strdup(s);
	176	if (s == NULL \|\| s[0] == 0)
	177	goto malformed;
178
179	if (strcmp(line, "ID") == 0) {
180	queueid = s;
181	} else if (strcmp(line, "Sender") == 0) {
182	sender = s;
183	} else if (strcmp(line, "Recipient") == 0) {
184	addr = s;
185	} else {
186	syslog(LOG_DEBUG, "ignoring unknown queue info `%s' in `%s'",
187	line, queuefn);
188	free(s);
189	}
190	}
191
192	if (queueid == NULL \|\| sender == NULL \|\| addr == NULL) {
193	malformed:
194	errno = EINVAL;
195	syslog(LOG_ERR, "malformed queue file `%s'", queuefn);
196	goto out;
197	}
198
199	if (add_recp(&itmqueue, addr, 0) != 0)
200	goto out;
201
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);
207
208	out:
209	if (sender != NULL)
210	free(sender);
211	if (queueid != NULL)
212	free(queueid);
213	if (addr != NULL)
214	free(addr);
215	if (queuef != NULL)
216	fclose(queuef);
217
218	return (it);
219	}
220
fd1de51a	221	int
057afad5	222	linkspool(struct queue *queue)
fd1de51a	223	{
fd1de51a	224	struct stat st;
fd1de51a SS	225	struct qitem *it;
fd1de51a SS	226
87bdbc01 SS	227	if (fflush(queue->mailf) != 0 \|\| fsync(fileno(queue->mailf)) != 0)
	228	goto delfiles;
	229
	230	syslog(LOG_INFO, "new mail from user=%s uid=%d envelope_from=<%s>",
057afad5	231	username, getuid(), queue->sender);
87bdbc01	232
fd1de51a	233	LIST_FOREACH(it, &queue->queue, next) {
4d5af2b0	234	if (asprintf(&it->queueid, "%s.%"PRIxPTR, queue->id, (uintptr_t)it) <= 0)
fd1de51a SS	235	goto delfiles;
	236	if (asprintf(&it->queuefn, "%s/Q%s", config->spooldir, it->queueid) <= 0)
	237	goto delfiles;
	238	if (asprintf(&it->mailfn, "%s/M%s", config->spooldir, it->queueid) <= 0)
	239	goto delfiles;
	240
	241	/* Neither file may not exist yet */
	242	if (stat(it->queuefn, &st) == 0 \|\| stat(it->mailfn, &st) == 0)
	243	goto delfiles;
	244
6ddd63e1	245	if (writequeuef(it) != 0)
fd1de51a	246	goto delfiles;
fd1de51a SS	247
	248	if (link(queue->tmpf, it->mailfn) != 0)
	249	goto delfiles;
	250	}
	251
4d5af2b0 SS	252	LIST_FOREACH(it, &queue->queue, next) {
	253	syslog(LOG_INFO, "mail to=<%s> queued as %s",
	254	it->addr, it->queueid);
	255	}
fd1de51a SS	256
	257	unlink(queue->tmpf);
	258	return (0);
	259
	260	delfiles:
	261	LIST_FOREACH(it, &queue->queue, next) {
fd1de51a	262	unlink(it->mailfn);
de13a881	263	unlink(it->queuefn);
fd1de51a SS	264	}
	265	return (-1);
	266	}
	267
de13a881	268	int
87bdbc01	269	load_queue(struct queue *queue)
fd1de51a	270	{
6ddd63e1	271	struct stat sb;
fd1de51a	272	struct qitem *it;
fd1de51a SS	273	DIR *spooldir;
fd1de51a SS	274	struct dirent *de;
fd1de51a SS	275	char *queuefn;
fd1de51a SS	276	char *mailfn;
fd1de51a	277
6f5efe4f	278	bzero(queue, sizeof(queue));
fd1de51a SS	279	LIST_INIT(&queue->queue);
	280
	281	spooldir = opendir(config->spooldir);
	282	if (spooldir == NULL)
	283	err(1, "reading queue");
	284
	285	while ((de = readdir(spooldir)) != NULL) {
fd1de51a	286	queuefn = NULL;
6ddd63e1	287	mailfn = NULL;
fd1de51a SS	288
	289	/* ignore temp files */
	290	if (strncmp(de->d_name, "tmp_", 4) == 0 \|\| de->d_type != DT_REG)
	291	continue;
	292	if (de->d_name[0] != 'Q')
	293	continue;
	294	if (asprintf(&queuefn, "%s/Q%s", config->spooldir, de->d_name + 1) < 0)
	295	goto fail;
	296	if (asprintf(&mailfn, "%s/M%s", config->spooldir, de->d_name + 1) < 0)
	297	goto fail;
	298
6ddd63e1	299	if (stat(mailfn, &sb) != 0)
fd1de51a SS	300	goto skip_item;
fd1de51a SS	301
6ddd63e1 SS	302	it = readqueuef(queue, queuefn);
6ddd63e1 SS	303	if (it == NULL)
fd1de51a	304	goto skip_item;
fd1de51a	305
fd1de51a	306	it->mailfn = mailfn;
fd1de51a SS	307	continue;
	308
	309	skip_item:
de13a881	310	syslog(LOG_INFO, "could not pick up queue file: `%s'/`%s': %m", queuefn, mailfn);
fd1de51a SS	311	if (queuefn != NULL)
	312	free(queuefn);
	313	if (mailfn != NULL)
	314	free(queuefn);
fd1de51a SS	315	}
fd1de51a SS	316	closedir(spooldir);
de13a881	317	return (0);
fd1de51a SS	318
fd1de51a SS	319	fail:
de13a881	320	return (-1);
fd1de51a SS	321	}
	322
	323	void
	324	delqueue(struct qitem *it)
	325	{
fd1de51a	326	unlink(it->mailfn);
de13a881	327	unlink(it->queuefn);
87bdbc01 SS	328	if (it->queuef != NULL)
	329	fclose(it->queuef);
	330	if (it->mailf != NULL)
	331	fclose(it->mailf);
fd1de51a SS	332	free(it);
fd1de51a SS	333	}
87bdbc01 SS	334
	335	int
	336	aquirespool(struct qitem *it)
	337	{
	338	int queuefd;
	339
	340	if (it->queuef == NULL) {
8e4fa698	341	queuefd = open_locked(it->queuefn, O_RDWR\|O_NONBLOCK);
87bdbc01	342	if (queuefd < 0)
de13a881	343	goto fail;
87bdbc01 SS	344	it->queuef = fdopen(queuefd, "r+");
87bdbc01 SS	345	if (it->queuef == NULL)
de13a881	346	goto fail;
87bdbc01 SS	347	}
	348
	349	if (it->mailf == NULL) {
	350	it->mailf = fopen(it->mailfn, "r");
	351	if (it->mailf == NULL)
de13a881	352	goto fail;
87bdbc01 SS	353	}
	354
	355	return (0);
de13a881 SS	356
	357	fail:
	358	syslog(LOG_INFO, "could not aquire queue file: %m");
	359	return (-1);
87bdbc01 SS	360	}
	361
	362	void
	363	dropspool(struct queue queue, struct qitem keep)
	364	{
	365	struct qitem *it;
	366
	367	LIST_FOREACH(it, &queue->queue, next) {
	368	if (it == keep)
	369	continue;
	370
	371	if (it->queuef != NULL)
	372	fclose(it->queuef);
	373	if (it->mailf != NULL)
	374	fclose(it->mailf);
	375	}
	376	}