[dragonfly.git] / libexec / dma / 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.
 *
 * $DragonFly$
 */

#include <sys/stat.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):
 *   id envelope-to
 *
 * 'M'id files (data):
 *   envelope-from
 *   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, const char *sender)
{
	char line[1000];	/* by RFC2822 */
	char fn[PATH_MAX+1];
	struct stat st;
	struct stritem *t;
	struct qitem *it;
	FILE *mailf;
	off_t hdrlen;
	int error;

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

	queue->mailfd = mkstemp(fn);
	if (queue->mailfd < 0)
		return (-1);
	if (flock(queue->mailfd, LOCK_EX) == -1)
		return (-1);

	queue->tmpf = strdup(fn);
	if (queue->tmpf == NULL)
		goto fail;

	error = snprintf(line, sizeof(line), "%s\n", sender);
	if (error < 0 || (size_t)error >= sizeof(line)) {
		errno = E2BIG;
		goto fail;
	}
	if (write(queue->mailfd, line, error) != error)
		goto fail;

	hdrlen = lseek(queue->mailfd, 0, SEEK_CUR);

	mailf = fdopen(queue->mailfd, "r+");
	if (mailf == NULL)
		goto fail;
	LIST_FOREACH(it, &queue->queue, next) {
		it->mailf = mailf;
		it->hdrlen = hdrlen;
	}

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

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

fail:
	close(queue->mailfd);
	unlink(fn);
	return (-1);
}

int
linkspool(struct queue *queue)
{
	char line[1000];	/* by RFC2822 */
	struct stat st;
	int error;
	int queuefd;
	struct qitem *it;

	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;

		error = snprintf(line, sizeof(line), "%s %s\n", it->queueid, it->addr);
		if (error < 0 || (size_t)error >= sizeof(line))
			goto delfiles;
		queuefd = open_locked(it->queuefn, O_CREAT|O_EXCL|O_RDWR, 0600);
		if (queuefd == -1)
			goto delfiles;
		if (write(queuefd, line, error) != error) {
			close(queuefd);
			goto delfiles;
		}
		it->queuefd = queuefd;

		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->queuefn);
		unlink(it->mailfn);
	}
	return (-1);
}

void
load_queue(struct queue *queue, int ignorelock)
{
	struct qitem *it;
	//struct queue queue, itmqueue;
	struct queue itmqueue;
	DIR *spooldir;
	struct dirent *de;
	char line[1000];
	FILE *queuef;
	FILE *mailf;
	char *sender;
	char *addr;
	char *queueid;
	char *queuefn;
	char *mailfn;
	off_t hdrlen;
	int fd;
	int locked;

	LIST_INIT(&queue->queue);

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

	while ((de = readdir(spooldir)) != NULL) {
		fd = -1;
		sender = NULL;
		queuef = NULL;
		mailf = NULL;
		queueid = NULL;
		queuefn = NULL;
		locked = 1;
		LIST_INIT(&itmqueue.queue);

		/* 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;

		fd = open_locked(queuefn, O_RDONLY|O_NONBLOCK);
		if (ignorelock && fd < 0) {
			fd = open(queuefn, O_RDONLY);
			locked = 0;
		}
		if (fd < 0) {
			/* Ignore locked files */
			if (errno == EWOULDBLOCK)
				continue;
			goto skip_item;
		}

		mailf = fopen(mailfn, "r");
		if (mailf == NULL)
			goto skip_item;
		if (fgets(line, sizeof(line), mailf) == NULL || line[0] == 0)
			goto skip_item;
		line[strlen(line) - 1] = 0;	/* chop newline */
		sender = strdup(line);
		if (sender == NULL)
			goto skip_item;

		hdrlen = ftell(mailf);

		queuef = fdopen(fd, "r");
		if (queuef == NULL)
			goto skip_item;

		if (fgets(line, sizeof(line), queuef) == NULL || line[0] == 0)
			goto skip_item;
		line[strlen(line) - 1] = 0;
		queueid = strdup(line);
		if (queueid == NULL)
			goto skip_item;
		addr = strchr(queueid, ' ');
		if (addr == NULL)
			goto skip_item;
		*addr++ = 0;

		if (add_recp(&itmqueue, addr, sender, 0) != 0)
			goto skip_item;
		it = LIST_FIRST(&itmqueue.queue);
		it->queuefd = fd;
		it->mailf = mailf;
		it->queueid = queueid;
		it->queuefn = queuefn;
		it->mailfn = mailfn;
		it->hdrlen = hdrlen;
		it->locked = locked;
		LIST_INSERT_HEAD(&queue->queue, it, next);

		continue;

skip_item:
		warn("reading queue: `%s'", queuefn);
		if (sender != NULL)
			free(sender);
		if (queuefn != NULL)
			free(queuefn);
		if (mailfn != NULL)
			free(queuefn);
		if (queueid != NULL)
			free(queueid);
		if (queuef != NULL)
			fclose(queuef);
		if (mailf != NULL)
			fclose(mailf);
		close(fd);
	}
	closedir(spooldir);
	return;

fail:
	err(1, "reading queue");
}

void
delqueue(struct qitem *it)
{
	unlink(it->queuefn);
	close(it->queuefd);
	unlink(it->mailfn);
	fclose(it->mailf);
	free(it);
}
Commit	Line	Data
f4e61a9f 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.
	33	*
	34	* $DragonFly$
	35	*/
	36
	37	#include <sys/stat.h>
	38
	39	#include <dirent.h>
	40	#include <err.h>
	41	#include <errno.h>
	42	#include <fcntl.h>
	43	#include <inttypes.h>
	44	#include <unistd.h>
405f48ee	45	#include <syslog.h>
f4e61a9f SS	46
	47	#include "dma.h"
	48
	49	/*
	50	* Spool file format:
	51	*
	52	* 'Q'id files (queue):
	53	* id envelope-to
	54	*
	55	* 'M'id files (data):
	56	* envelope-from
	57	* mail data
	58	*
	59	* Each queue file needs to have a corresponding data file.
	60	* One data file might be shared by linking it several times.
	61	*
76ad9740	62	* Queue ids are unique, formed from the inode of the data file
f4e61a9f SS	63	* and a unique identifier.
	64	*/
	65
	66	int
	67	newspoolf(struct queue queue, const char sender)
	68	{
	69	char line[1000]; /* by RFC2822 */
	70	char fn[PATH_MAX+1];
405f48ee	71	struct stat st;
f4e61a9f SS	72	struct stritem *t;
	73	struct qitem *it;
	74	FILE *mailf;
	75	off_t hdrlen;
	76	int error;
	77
	78	if (snprintf(fn, sizeof(fn), "%s/%s", config->spooldir, "tmp_XXXXXXXXXX") <= 0)
	79	return (-1);
	80
	81	queue->mailfd = mkstemp(fn);
	82	if (queue->mailfd < 0)
	83	return (-1);
	84	if (flock(queue->mailfd, LOCK_EX) == -1)
	85	return (-1);
	86
	87	queue->tmpf = strdup(fn);
	88	if (queue->tmpf == NULL)
	89	goto fail;
	90
	91	error = snprintf(line, sizeof(line), "%s\n", sender);
	92	if (error < 0 \|\| (size_t)error >= sizeof(line)) {
	93	errno = E2BIG;
	94	goto fail;
	95	}
	96	if (write(queue->mailfd, line, error) != error)
	97	goto fail;
	98
	99	hdrlen = lseek(queue->mailfd, 0, SEEK_CUR);
	100
	101	mailf = fdopen(queue->mailfd, "r+");
	102	if (mailf == NULL)
	103	goto fail;
	104	LIST_FOREACH(it, &queue->queue, next) {
	105	it->mailf = mailf;
	106	it->hdrlen = hdrlen;
	107	}
	108
405f48ee SS	109	/*
	110	* Assign queue id
	111	*/
	112	if (fstat(queue->mailfd, &st) != 0)
	113	return (-1);
	114	if (asprintf(&queue->id, "%"PRIxMAX, st.st_ino) < 0)
	115	return (-1);
	116
f4e61a9f SS	117	t = malloc(sizeof(*t));
	118	if (t != NULL) {
	119	t->str = queue->tmpf;
	120	SLIST_INSERT_HEAD(&tmpfs, t, next);
	121	}
	122	return (0);
	123
	124	fail:
	125	close(queue->mailfd);
	126	unlink(fn);
	127	return (-1);
	128	}
	129
	130	int
	131	linkspool(struct queue *queue)
	132	{
	133	char line[1000]; /* by RFC2822 */
	134	struct stat st;
	135	int error;
	136	int queuefd;
	137	struct qitem *it;
	138
f4e61a9f	139	LIST_FOREACH(it, &queue->queue, next) {
405f48ee	140	if (asprintf(&it->queueid, "%s.%"PRIxPTR, queue->id, (uintptr_t)it) <= 0)
f4e61a9f SS	141	goto delfiles;
	142	if (asprintf(&it->queuefn, "%s/Q%s", config->spooldir, it->queueid) <= 0)
	143	goto delfiles;
	144	if (asprintf(&it->mailfn, "%s/M%s", config->spooldir, it->queueid) <= 0)
	145	goto delfiles;
	146
	147	/* Neither file may not exist yet */
	148	if (stat(it->queuefn, &st) == 0 \|\| stat(it->mailfn, &st) == 0)
	149	goto delfiles;
	150
	151	error = snprintf(line, sizeof(line), "%s %s\n", it->queueid, it->addr);
	152	if (error < 0 \|\| (size_t)error >= sizeof(line))
	153	goto delfiles;
	154	queuefd = open_locked(it->queuefn, O_CREAT\|O_EXCL\|O_RDWR, 0600);
	155	if (queuefd == -1)
	156	goto delfiles;
	157	if (write(queuefd, line, error) != error) {
	158	close(queuefd);
	159	goto delfiles;
	160	}
	161	it->queuefd = queuefd;
	162
	163	if (link(queue->tmpf, it->mailfn) != 0)
	164	goto delfiles;
	165	}
	166
405f48ee SS	167	LIST_FOREACH(it, &queue->queue, next) {
	168	syslog(LOG_INFO, "mail to=<%s> queued as %s",
	169	it->addr, it->queueid);
	170	}
f4e61a9f SS	171
	172	unlink(queue->tmpf);
	173	return (0);
	174
	175	delfiles:
	176	LIST_FOREACH(it, &queue->queue, next) {
	177	unlink(it->queuefn);
	178	unlink(it->mailfn);
	179	}
	180	return (-1);
	181	}
	182
	183	void
	184	load_queue(struct queue *queue, int ignorelock)
	185	{
	186	struct qitem *it;
	187	//struct queue queue, itmqueue;
	188	struct queue itmqueue;
	189	DIR *spooldir;
	190	struct dirent *de;
	191	char line[1000];
	192	FILE *queuef;
	193	FILE *mailf;
	194	char *sender;
	195	char *addr;
	196	char *queueid;
	197	char *queuefn;
	198	char *mailfn;
	199	off_t hdrlen;
	200	int fd;
	201	int locked;
	202
	203	LIST_INIT(&queue->queue);
	204
	205	spooldir = opendir(config->spooldir);
	206	if (spooldir == NULL)
	207	err(1, "reading queue");
	208
	209	while ((de = readdir(spooldir)) != NULL) {
	210	fd = -1;
	211	sender = NULL;
	212	queuef = NULL;
	213	mailf = NULL;
	214	queueid = NULL;
	215	queuefn = NULL;
	216	locked = 1;
	217	LIST_INIT(&itmqueue.queue);
	218
	219	/* ignore temp files */
	220	if (strncmp(de->d_name, "tmp_", 4) == 0 \|\| de->d_type != DT_REG)
	221	continue;
	222	if (de->d_name[0] != 'Q')
	223	continue;
	224	if (asprintf(&queuefn, "%s/Q%s", config->spooldir, de->d_name + 1) < 0)
	225	goto fail;
	226	if (asprintf(&mailfn, "%s/M%s", config->spooldir, de->d_name + 1) < 0)
	227	goto fail;
	228
	229	fd = open_locked(queuefn, O_RDONLY\|O_NONBLOCK);
	230	if (ignorelock && fd < 0) {
	231	fd = open(queuefn, O_RDONLY);
	232	locked = 0;
	233	}
	234	if (fd < 0) {
235	/* Ignore locked files */
236	if (errno == EWOULDBLOCK)
237	continue;
238	goto skip_item;
239	}
240
241	mailf = fopen(mailfn, "r");
242	if (mailf == NULL)
243	goto skip_item;
244	if (fgets(line, sizeof(line), mailf) == NULL \|\| line[0] == 0)
245	goto skip_item;
246	line[strlen(line) - 1] = 0; /* chop newline */
247	sender = strdup(line);
248	if (sender == NULL)
249	goto skip_item;
250
251	hdrlen = ftell(mailf);
252
253	queuef = fdopen(fd, "r");
254	if (queuef == NULL)
255	goto skip_item;
256
257	if (fgets(line, sizeof(line), queuef) == NULL \|\| line[0] == 0)
258	goto skip_item;
259	line[strlen(line) - 1] = 0;
260	queueid = strdup(line);
261	if (queueid == NULL)
262	goto skip_item;
263	addr = strchr(queueid, ' ');
264	if (addr == NULL)
265	goto skip_item;
266	*addr++ = 0;
267
268	if (add_recp(&itmqueue, addr, sender, 0) != 0)
269	goto skip_item;
270	it = LIST_FIRST(&itmqueue.queue);
271	it->queuefd = fd;
272	it->mailf = mailf;
273	it->queueid = queueid;
274	it->queuefn = queuefn;
275	it->mailfn = mailfn;
276	it->hdrlen = hdrlen;
277	it->locked = locked;
278	LIST_INSERT_HEAD(&queue->queue, it, next);
279
280	continue;
281
282	skip_item:
283	warn("reading queue: `%s'", queuefn);
284	if (sender != NULL)
285	free(sender);
286	if (queuefn != NULL)
287	free(queuefn);
288	if (mailfn != NULL)
289	free(queuefn);
290	if (queueid != NULL)
291	free(queueid);
292	if (queuef != NULL)
293	fclose(queuef);
294	if (mailf != NULL)
295	fclose(mailf);
296	close(fd);
297	}
298	closedir(spooldir);
299	return;
300
301	fail:
302	err(1, "reading queue");
303	}
304
305	void
306	delqueue(struct qitem *it)
307	{
308	unlink(it->queuefn);
309	close(it->queuefd);
310	unlink(it->mailfn);
311	fclose(it->mailf);
312	free(it);
313	}