2 * Copyright (c) 1998-2006 Sendmail, Inc. and its suppliers.
4 * Copyright (c) 1983, 1995-1997 Eric P. Allman. All rights reserved.
5 * Copyright (c) 1988, 1993
6 * The Regents of the University of California. All rights reserved.
8 * By using this file, you agree to the terms and conditions set
9 * forth in the LICENSE file which can be found at the top level of
10 * the sendmail distribution.
17 SM_RCSID("@(#)$Id: queue.c,v 8.954 2006/04/22 01:07:00 ca Exp $")
21 # define RELEASE_QUEUE (void) 0
22 # define ST_INODE(st) (st).st_ino
24 # define sm_file_exists(errno) ((errno) == EEXIST)
26 # if HASFLOCK && defined(O_EXLOCK)
27 # define SM_OPEN_EXLOCK 1
28 # define TF_OPEN_FLAGS (O_CREAT|O_WRONLY|O_EXCL|O_EXLOCK)
29 # else /* HASFLOCK && defined(O_EXLOCK) */
30 # define TF_OPEN_FLAGS (O_CREAT|O_WRONLY|O_EXCL)
31 # endif /* HASFLOCK && defined(O_EXLOCK) */
33 #ifndef SM_OPEN_EXLOCK
34 # define SM_OPEN_EXLOCK 0
35 #endif /* ! SM_OPEN_EXLOCK */
39 ** QF_VERSION == 4 was sendmail 8.10/8.11 without _FFR_QUEUEDELAY
40 ** QF_VERSION == 5 was sendmail 8.10/8.11 with _FFR_QUEUEDELAY
41 ** QF_VERSION == 6 was sendmail 8.12 without _FFR_QUEUEDELAY
42 ** QF_VERSION == 7 was sendmail 8.12 with _FFR_QUEUEDELAY
43 ** QF_VERSION == 8 is sendmail 8.13
46 #define QF_VERSION 8 /* version number of this queue format */
48 static char queue_letter __P((ENVELOPE *, int));
49 static bool quarantine_queue_item __P((int, int, ENVELOPE *, char *));
51 /* Naming convention: qgrp: index of queue group, qg: QUEUEGROUP */
59 char *w_name; /* name of control file */
60 char *w_host; /* name of recipient host */
61 bool w_lock; /* is message locked? */
62 bool w_tooyoung; /* is it too young to run? */
63 long w_pri; /* priority of message, see below */
64 time_t w_ctime; /* creation time */
65 time_t w_mtime; /* modification time */
66 int w_qgrp; /* queue group located in */
67 int w_qdir; /* queue directory located in */
68 struct work *w_next; /* next in queue */
71 typedef struct work WORK;
73 static WORK *WorkQ; /* queue of things to be done */
74 static int NumWorkGroups; /* number of work groups */
75 static time_t Current_LA_time = 0;
77 /* Get new load average every 30 seconds. */
78 #define GET_NEW_LA_TIME 30
80 #define SM_GET_LA(now) \
84 if (Current_LA_time < now - GET_NEW_LA_TIME) \
87 Current_LA_time = now; \
92 ** DoQueueRun indicates that a queue run is needed.
93 ** Notice: DoQueueRun is modified in a signal handler!
96 static bool volatile DoQueueRun; /* non-interrupt time queue run needed */
99 ** Work group definition structure.
100 ** Each work group contains one or more queue groups. This is done
101 ** to manage the number of queue group runners active at the same time
102 ** to be within the constraints of MaxQueueChildren (if it is set).
103 ** The number of queue groups that can be run on the next work run
104 ** is kept track of. The queue groups are run in a round robin.
109 int wg_numqgrp; /* number of queue groups in work grp */
110 int wg_runners; /* total runners */
111 int wg_curqgrp; /* current queue group */
112 QUEUEGRP **wg_qgs; /* array of queue groups */
113 int wg_maxact; /* max # of active runners */
114 time_t wg_lowqintvl; /* lowest queue interval */
115 int wg_restart; /* needs restarting? */
116 int wg_restartcnt; /* count of times restarted */
119 typedef struct workgrp WORKGRP;
121 static WORKGRP volatile WorkGrp[MAXWORKGROUPS + 1]; /* work groups */
124 static SM_DEBUG_T DebugLeakQ = SM_DEBUG_INITIALIZER("leak_q",
125 "@(#)$Debug: leak_q - trace memory leaks during queue processing $");
126 #endif /* SM_HEAP_CHECK */
129 ** We use EmptyString instead of "" to avoid
130 ** 'zero-length format string' warnings from gcc
133 static const char EmptyString[] = "";
135 static void grow_wlist __P((int, int));
136 static int multiqueue_cache __P((char *, int, QUEUEGRP *, int, unsigned int *));
137 static int gatherq __P((int, int, bool, bool *, bool *));
138 static int sortq __P((int));
139 static void printctladdr __P((ADDRESS *, SM_FILE_T *));
140 static bool readqf __P((ENVELOPE *, bool));
141 static void restart_work_group __P((int));
142 static void runner_work __P((ENVELOPE *, int, bool, int, int));
143 static void schedule_queue_runs __P((bool, int, bool));
144 static char *strrev __P((char *));
145 static ADDRESS *setctluser __P((char *, int, ENVELOPE *));
147 static int sm_strshufflecmp __P((char *, char *));
148 static void init_shuffle_alphabet __P(());
149 #endif /* _FFR_RHS */
150 static int workcmpf0();
151 static int workcmpf1();
152 static int workcmpf2();
153 static int workcmpf3();
154 static int workcmpf4();
155 static int randi = 3; /* index for workcmpf5() */
156 static int workcmpf5();
157 static int workcmpf6();
159 static int workcmpf7();
160 #endif /* _FFR_RHS */
163 # define get_rand_mod(m) ((get_random() >> RANDOMSHIFT) % (m))
164 #else /* RANDOMSHIFT */
165 # define get_rand_mod(m) (get_random() % (m))
166 #endif /* RANDOMSHIFT */
169 ** File system definition.
170 ** Used to keep track of how much free space is available
171 ** on a file system in which one or more queue directories reside.
174 typedef struct filesys_shared FILESYS;
176 struct filesys_shared
178 dev_t fs_dev; /* unique device id */
179 long fs_avail; /* number of free blocks available */
180 long fs_blksize; /* block size, in bytes */
183 /* probably kept in shared memory */
184 static FILESYS FileSys[MAXFILESYS]; /* queue file systems */
185 static char *FSPath[MAXFILESYS]; /* pathnames for file systems */
190 ** Shared memory data
193 ** size -- size of shared memory segment
194 ** pid -- pid of owner, should be a unique id to avoid misinterpretations
195 ** by other processes.
196 ** tag -- should be a unique id to avoid misinterpretations by others.
197 ** idea: hash over configuration data that will be stored here.
198 ** NumFileSys -- number of file systems.
199 ** FileSys -- (arrary of) structure for used file systems.
200 ** RSATmpCnt -- counter for number of uses of ephemeral RSA key.
201 ** QShm -- (array of) structure for information about queue directories.
205 ** Queue data in shared memory
208 typedef struct queue_shared QUEUE_SHM_T;
212 int qs_entries; /* number of entries */
213 /* XXX more to follow? */
216 static void *Pshm; /* pointer to shared memory */
217 static FILESYS *PtrFileSys; /* pointer to queue file system array */
218 int ShmId = SM_SHM_NO_ID; /* shared memory id */
219 static QUEUE_SHM_T *QShm; /* pointer to shared queue data */
222 # define SHM_OFF_PID(p) (((char *) (p)) + sizeof(int))
223 # define SHM_OFF_TAG(p) (((char *) (p)) + sizeof(pid_t) + sizeof(int))
224 # define SHM_OFF_HEAD (sizeof(pid_t) + sizeof(int) * 2)
226 /* how to access FileSys */
227 # define FILE_SYS(i) (PtrFileSys[i])
229 /* first entry is a tag, for now just the size */
230 # define OFF_FILE_SYS(p) (((char *) (p)) + SHM_OFF_HEAD)
232 /* offset for PNumFileSys */
233 # define OFF_NUM_FILE_SYS(p) (((char *) (p)) + SHM_OFF_HEAD + sizeof(FileSys))
235 /* offset for PRSATmpCnt */
236 # define OFF_RSA_TMP_CNT(p) (((char *) (p)) + SHM_OFF_HEAD + sizeof(FileSys) + sizeof(int))
239 /* offset for queue_shm */
240 # define OFF_QUEUE_SHM(p) (((char *) (p)) + SHM_OFF_HEAD + sizeof(FileSys) + sizeof(int) * 2)
242 # define QSHM_ENTRIES(i) QShm[i].qs_entries
244 /* basic size of shared memory segment */
245 # define SM_T_SIZE (SHM_OFF_HEAD + sizeof(FileSys) + sizeof(int) * 2)
247 static unsigned int hash_q __P((char *, unsigned int));
250 ** HASH_Q -- simple hash function
253 ** p -- string to hash.
254 ** h -- hash start value (from previous run).
272 h += (c<<11) ^ (c>>1);
273 h ^= (d<<14) + (d<<7) + (d<<4) + d;
279 #else /* SM_CONF_SHM */
280 # define FILE_SYS(i) FileSys[i]
281 #endif /* SM_CONF_SHM */
283 /* access to the various components of file system data */
284 #define FILE_SYS_NAME(i) FSPath[i]
285 #define FILE_SYS_AVAIL(i) FILE_SYS(i).fs_avail
286 #define FILE_SYS_BLKSIZE(i) FILE_SYS(i).fs_blksize
287 #define FILE_SYS_DEV(i) FILE_SYS(i).fs_dev
291 ** Current qf file field assignments:
295 ** C controlling user
297 ** d data file directory name (added in 8.12)
300 ** G free (was: queue delay algorithm if _FFR_QUEUEDELAY)
302 ** I data file's inode number
303 ** K time of last delivery attempt
304 ** L Solaris Content-Length: header (obsolete)
306 ** N number of delivery attempts
307 ** P message priority
308 ** q quarantine reason
309 ** Q original recipient (ORCPT=)
310 ** r final recipient (Final-Recipient: DSN field)
314 ** V queue file version
315 ** X free (was: character set if _FFR_SAVE_CHARSET)
316 ** Y free (was: current delay if _FFR_QUEUEDELAY)
317 ** Z original envelope id from ESMTP
318 ** ! deliver by (added in 8.12)
324 ** QUEUEUP -- queue a message up for future transmission.
327 ** e -- the envelope to queue up.
328 ** announce -- if true, tell when you are queueing up.
329 ** msync -- if true, then fsync() if SuperSafe interactive mode.
335 ** The current request is saved in a control file.
336 ** The queue file is left locked.
340 queueup(e, announce, msync)
341 register ENVELOPE *e;
345 register SM_FILE_T *tfp;
360 ** Create control file.
365 MODE_T oldumask = 0; \
367 if (bitset(S_IWGRP, QueueFileMode)) \
368 oldumask = umask(002); \
369 tfd = open(tf, TF_OPEN_FLAGS, QueueFileMode); \
370 if (bitset(S_IWGRP, QueueFileMode)) \
371 (void) umask(oldumask); \
375 newid = (e->e_id == NULL) || !bitset(EF_INQUEUE, e->e_flags);
376 (void) sm_strlcpy(tf, queuename(e, NEWQFL_LETTER), sizeof tf);
378 if (tfp == NULL && newid)
381 ** open qf file directly: this will give an error if the file
382 ** already exists and hence prevent problems if a queue-id
383 ** is reused (e.g., because the clock is set back).
386 (void) sm_strlcpy(tf, queuename(e, ANYQFL_LETTER), sizeof tf);
390 !lockfile(tfd, tf, NULL, LOCK_EX|LOCK_NB) ||
391 #endif /* !SM_OPEN_EXLOCK */
392 (tfp = sm_io_open(SmFtStdiofd, SM_TIME_DEFAULT,
393 (void *) &tfd, SM_IO_WRONLY,
396 int save_errno = errno;
400 syserr("!queueup: cannot create queue file %s, euid=%d, fd=%d, fp=%p",
401 tf, (int) geteuid(), tfd, tfp);
405 upd_qs(e, 1, 0, "queueup");
408 /* if newid, write the queue file directly (instead of temp file) */
411 /* get a locked tf file */
412 for (i = 0; i < 128; i++)
421 if (LogLevel > 0 && (i % 32) == 0)
422 sm_syslog(LOG_ALERT, e->e_id,
423 "queueup: cannot create %s, uid=%d: %s",
425 sm_errstring(errno));
430 #endif /* SM_OPEN_EXLOCK */
435 /* file is locked by open() */
437 #else /* SM_OPEN_EXLOCK */
438 if (lockfile(tfd, tf, NULL, LOCK_EX|LOCK_NB))
441 #endif /* SM_OPEN_EXLOCK */
442 if (LogLevel > 0 && (i % 32) == 0)
443 sm_syslog(LOG_ALERT, e->e_id,
444 "queueup: cannot lock %s: %s",
445 tf, sm_errstring(errno));
455 /* save the old temp file away */
456 (void) rename(tf, queuename(e, TEMPQF_LETTER));
459 (void) sleep(i % 32);
461 if (tfd < 0 || (tfp = sm_io_open(SmFtStdiofd, SM_TIME_DEFAULT,
462 (void *) &tfd, SM_IO_WRONLY_B,
465 int save_errno = errno;
469 syserr("!queueup: cannot create queue temp file %s, uid=%d",
470 tf, (int) geteuid());
475 sm_dprintf("\n>>>>> queueing %s/%s%s >>>>>\n",
476 qid_printqueue(e->e_qgrp, e->e_qdir),
477 queuename(e, ANYQFL_LETTER),
478 newid ? " (new id)" : "");
481 sm_dprintf(" e_flags=");
486 sm_dprintf(" sendq=");
487 printaddr(sm_debug_file(), e->e_sendqueue, true);
492 dumpfd(sm_io_getinfo(tfp, SM_IO_WHAT_FD, NULL), true, false);
493 sm_dprintf(" lockfp=");
494 if (e->e_lockfp == NULL)
495 sm_dprintf("NULL\n");
497 dumpfd(sm_io_getinfo(e->e_lockfp, SM_IO_WHAT_FD, NULL),
502 ** If there is no data file yet, create one.
505 (void) sm_strlcpy(df, queuename(e, DATAFL_LETTER), sizeof df);
506 if (bitset(EF_HAS_DF, e->e_flags))
508 if (e->e_dfp != NULL &&
509 SuperSafe != SAFE_REALLY &&
510 SuperSafe != SAFE_REALLY_POSTMILTER &&
511 sm_io_setinfo(e->e_dfp, SM_BF_COMMIT, NULL) < 0 &&
514 syserr("!queueup: cannot commit data file %s, uid=%d",
515 queuename(e, DATAFL_LETTER), (int) geteuid());
517 if (e->e_dfp != NULL &&
518 SuperSafe == SAFE_INTERACTIVE && msync)
521 sm_syslog(LOG_INFO, e->e_id,
522 "queueup: fsync(e->e_dfp)");
524 if (fsync(sm_io_getinfo(e->e_dfp, SM_IO_WHAT_FD,
528 syserr("!552 Error writing data file %s",
531 syserr("!452 Error writing data file %s",
540 register SM_FILE_T *dfp = NULL;
543 if (e->e_dfp != NULL &&
544 sm_io_getinfo(e->e_dfp, SM_IO_WHAT_ISTYPE, BF_FILE_TYPE))
545 syserr("committing over bf file");
547 if (bitset(S_IWGRP, QueueFileMode))
548 oldumask = umask(002);
549 dfd = open(df, O_WRONLY|O_CREAT|O_TRUNC|QF_O_EXTRA,
551 if (bitset(S_IWGRP, QueueFileMode))
552 (void) umask(oldumask);
553 if (dfd < 0 || (dfp = sm_io_open(SmFtStdiofd, SM_TIME_DEFAULT,
554 (void *) &dfd, SM_IO_WRONLY_B,
556 syserr("!queueup: cannot create data temp file %s, uid=%d",
557 df, (int) geteuid());
558 if (fstat(dfd, &stbuf) < 0)
562 e->e_dfdev = stbuf.st_dev;
563 e->e_dfino = ST_INODE(stbuf);
565 e->e_flags |= EF_HAS_DF;
566 memset(&mcibuf, '\0', sizeof mcibuf);
567 mcibuf.mci_out = dfp;
568 mcibuf.mci_mailer = FileMailer;
569 (*e->e_putbody)(&mcibuf, e, NULL);
571 if (SuperSafe == SAFE_REALLY ||
572 SuperSafe == SAFE_REALLY_POSTMILTER ||
573 (SuperSafe == SAFE_INTERACTIVE && msync))
576 sm_syslog(LOG_INFO, e->e_id,
577 "queueup: fsync(dfp)");
579 if (fsync(sm_io_getinfo(dfp, SM_IO_WHAT_FD, NULL)) < 0)
582 syserr("!552 Error writing data file %s",
585 syserr("!452 Error writing data file %s",
590 if (sm_io_close(dfp, SM_TIME_DEFAULT) < 0)
591 syserr("!queueup: cannot save data temp file %s, uid=%d",
592 df, (int) geteuid());
593 e->e_putbody = putbody;
597 ** Output future work requests.
598 ** Priority and creation time should be first, since
599 ** they are required by gatherq.
602 /* output queue version number (must be first!) */
603 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "V%d\n", QF_VERSION);
605 /* output creation time */
606 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "T%ld\n", (long) e->e_ctime);
608 /* output last delivery time */
609 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "K%ld\n", (long) e->e_dtime);
611 /* output number of delivery attempts */
612 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "N%d\n", e->e_ntries);
614 /* output message priority */
615 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "P%ld\n", e->e_msgpriority);
618 ** If data file is in a different directory than the queue file,
619 ** output a "d" record naming the directory of the data file.
622 if (e->e_dfqgrp != e->e_qgrp)
624 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "d%s\n",
625 Queue[e->e_dfqgrp]->qg_qpaths[e->e_dfqdir].qp_name);
628 /* output inode number of data file */
629 /* XXX should probably include device major/minor too */
630 if (e->e_dfino != -1)
632 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "I%ld/%ld/%llu\n",
633 (long) major(e->e_dfdev),
634 (long) minor(e->e_dfdev),
635 (ULONGLONG_T) e->e_dfino);
638 /* output body type */
639 if (e->e_bodytype != NULL)
640 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "B%s\n",
641 denlstring(e->e_bodytype, true, false));
643 /* quarantine reason */
644 if (e->e_quarmsg != NULL)
645 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "q%s\n",
646 denlstring(e->e_quarmsg, true, false));
648 /* message from envelope, if it exists */
649 if (e->e_message != NULL)
650 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "M%s\n",
651 denlstring(e->e_message, true, false));
653 /* send various flag bits through */
655 if (bitset(EF_WARNING, e->e_flags))
657 if (bitset(EF_RESPONSE, e->e_flags))
659 if (bitset(EF_HAS8BIT, e->e_flags))
661 if (bitset(EF_DELETE_BCC, e->e_flags))
663 if (bitset(EF_RET_PARAM, e->e_flags))
665 if (bitset(EF_NO_BODY_RETN, e->e_flags))
667 if (bitset(EF_SPLIT, e->e_flags))
671 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "F%s\n", buf);
673 /* save $={persistentMacros} macro values */
674 queueup_macros(macid("{persistentMacros}"), tfp, e);
676 /* output name of sender */
677 if (bitnset(M_UDBENVELOPE, e->e_from.q_mailer->m_flags))
680 p = e->e_from.q_paddr;
681 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "S%s\n",
682 denlstring(p, true, false));
684 /* output ESMTP-supplied "original" information */
685 if (e->e_envid != NULL)
686 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "Z%s\n",
687 denlstring(e->e_envid, true, false));
689 /* output AUTH= parameter */
690 if (e->e_auth_param != NULL)
691 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "A%s\n",
692 denlstring(e->e_auth_param, true, false));
693 if (e->e_dlvr_flag != 0)
694 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "!%c %ld\n",
695 (char) e->e_dlvr_flag, e->e_deliver_by);
697 /* output list of recipient addresses */
698 printctladdr(NULL, NULL);
699 for (q = e->e_sendqueue; q != NULL; q = q->q_next)
701 if (!QS_IS_UNDELIVERED(q->q_state))
704 /* message for this recipient, if it exists */
705 if (q->q_message != NULL)
706 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "M%s\n",
707 denlstring(q->q_message, true,
710 printctladdr(q, tfp);
711 if (q->q_orcpt != NULL)
712 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "Q%s\n",
713 denlstring(q->q_orcpt, true,
715 if (q->q_finalrcpt != NULL)
716 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "r%s\n",
717 denlstring(q->q_finalrcpt, true,
719 (void) sm_io_putc(tfp, SM_TIME_DEFAULT, 'R');
720 if (bitset(QPRIMARY, q->q_flags))
721 (void) sm_io_putc(tfp, SM_TIME_DEFAULT, 'P');
722 if (bitset(QHASNOTIFY, q->q_flags))
723 (void) sm_io_putc(tfp, SM_TIME_DEFAULT, 'N');
724 if (bitset(QPINGONSUCCESS, q->q_flags))
725 (void) sm_io_putc(tfp, SM_TIME_DEFAULT, 'S');
726 if (bitset(QPINGONFAILURE, q->q_flags))
727 (void) sm_io_putc(tfp, SM_TIME_DEFAULT, 'F');
728 if (bitset(QPINGONDELAY, q->q_flags))
729 (void) sm_io_putc(tfp, SM_TIME_DEFAULT, 'D');
730 if (q->q_alias != NULL &&
731 bitset(QALIAS, q->q_alias->q_flags))
732 (void) sm_io_putc(tfp, SM_TIME_DEFAULT, 'A');
733 (void) sm_io_putc(tfp, SM_TIME_DEFAULT, ':');
734 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "%s\n",
735 denlstring(q->q_paddr, true, false));
738 char *tag = "queued";
740 if (e->e_quarmsg != NULL)
743 e->e_to = q->q_paddr;
746 logdelivery(q->q_mailer, NULL, q->q_status,
747 tag, NULL, (time_t) 0, e);
752 sm_dprintf("queueing ");
753 printaddr(sm_debug_file(), q, false);
758 ** Output headers for this message.
759 ** Expand macros completely here. Queue run will deal with
760 ** everything as absolute headers.
761 ** All headers that must be relative to the recipient
762 ** can be cracked later.
763 ** We set up a "null mailer" -- i.e., a mailer that will have
764 ** no effect on the addresses as they are output.
767 memset((char *) &nullmailer, '\0', sizeof nullmailer);
768 nullmailer.m_re_rwset = nullmailer.m_rh_rwset =
769 nullmailer.m_se_rwset = nullmailer.m_sh_rwset = -1;
770 nullmailer.m_eol = "\n";
771 memset(&mcibuf, '\0', sizeof mcibuf);
772 mcibuf.mci_mailer = &nullmailer;
773 mcibuf.mci_out = tfp;
775 macdefine(&e->e_macro, A_PERM, 'g', "\201f");
776 for (h = e->e_header; h != NULL; h = h->h_link)
778 if (h->h_value == NULL)
781 /* don't output resent headers on non-resent messages */
782 if (bitset(H_RESENT, h->h_flags) &&
783 !bitset(EF_RESENT, e->e_flags))
786 /* expand macros; if null, don't output header at all */
787 if (bitset(H_DEFAULT, h->h_flags))
789 (void) expand(h->h_value, buf, sizeof buf, e);
794 /* output this header */
795 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "H?");
797 /* output conditional macro if present */
798 if (h->h_macro != '\0')
800 if (bitset(0200, h->h_macro))
801 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT,
803 macname(bitidx(h->h_macro)));
805 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT,
808 else if (!bitzerop(h->h_mflags) &&
809 bitset(H_CHECK|H_ACHECK, h->h_flags))
813 /* if conditional, output the set of conditions */
814 for (j = '\0'; j <= '\177'; j++)
815 if (bitnset(j, h->h_mflags))
816 (void) sm_io_putc(tfp, SM_TIME_DEFAULT,
819 (void) sm_io_putc(tfp, SM_TIME_DEFAULT, '?');
821 /* output the header: expand macros, convert addresses */
822 if (bitset(H_DEFAULT, h->h_flags) &&
823 !bitset(H_BINDLATE, h->h_flags))
825 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "%s: %s\n",
827 denlstring(buf, false, true));
829 else if (bitset(H_FROM|H_RCPT, h->h_flags) &&
830 !bitset(H_BINDLATE, h->h_flags))
832 bool oldstyle = bitset(EF_OLDSTYLE, e->e_flags);
833 SM_FILE_T *savetrace = TrafficLogFile;
835 TrafficLogFile = NULL;
837 if (bitset(H_FROM, h->h_flags))
840 commaize(h, h->h_value, oldstyle, &mcibuf, e);
842 TrafficLogFile = savetrace;
846 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "%s: %s\n",
848 denlstring(h->h_value, false,
856 ** Write a terminator record -- this is to prevent
857 ** scurrilous crackers from appending any data.
860 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, ".\n");
862 if (sm_io_flush(tfp, SM_TIME_DEFAULT) != 0 ||
863 ((SuperSafe == SAFE_REALLY ||
864 SuperSafe == SAFE_REALLY_POSTMILTER ||
865 (SuperSafe == SAFE_INTERACTIVE && msync)) &&
866 fsync(sm_io_getinfo(tfp, SM_IO_WHAT_FD, NULL)) < 0) ||
870 syserr("!552 Error writing control file %s", tf);
872 syserr("!452 Error writing control file %s", tf);
877 char new = queue_letter(e, ANYQFL_LETTER);
879 /* rename (locked) tf to be (locked) [qh]f */
880 (void) sm_strlcpy(qf, queuename(e, ANYQFL_LETTER),
882 if (rename(tf, qf) < 0)
883 syserr("cannot rename(%s, %s), uid=%d",
884 tf, qf, (int) geteuid());
888 ** Check if type has changed and only
889 ** remove the old item if the rename above
893 if (e->e_qfletter != '\0' &&
894 e->e_qfletter != new)
898 sm_dprintf("type changed from %c to %c\n",
902 if (unlink(queuename(e, e->e_qfletter)) < 0)
904 /* XXX: something more drastic? */
906 sm_syslog(LOG_ERR, e->e_id,
907 "queueup: unlink(%s) failed: %s",
908 queuename(e, e->e_qfletter),
909 sm_errstring(errno));
916 ** fsync() after renaming to make sure metadata is
917 ** written to disk on filesystems in which renames are
921 if (SuperSafe != SAFE_NO)
923 /* for softupdates */
924 if (tfd >= 0 && fsync(tfd) < 0)
926 syserr("!queueup: cannot fsync queue temp file %s",
932 /* close and unlock old (locked) queue file */
933 if (e->e_lockfp != NULL)
934 (void) sm_io_close(e->e_lockfp, SM_TIME_DEFAULT);
939 sm_syslog(LOG_DEBUG, e->e_id, "queueup %s", qf);
945 sm_syslog(LOG_DEBUG, e->e_id, "queueup %s", tf);
947 e->e_qfletter = queue_letter(e, ANYQFL_LETTER);
951 e->e_flags |= EF_INQUEUE;
954 sm_dprintf("<<<<< done queueing %s <<<<<\n\n", e->e_id);
959 ** PRINTCTLADDR -- print control address to file.
963 ** tfp -- file pointer.
969 ** The control address (if changed) is printed to the file.
970 ** The last control address and uid are saved.
982 static ADDRESS *lastctladdr = NULL;
983 static uid_t lastuid;
986 if (a == NULL || a->q_alias == NULL || tfp == NULL)
988 if (lastctladdr != NULL && tfp != NULL)
989 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "C\n");
995 /* find the active uid */
1005 user = q->q_ruser != NULL ? q->q_ruser : q->q_user;
1011 /* check to see if this is the same as last time */
1012 if (lastctladdr != NULL && uid == lastuid &&
1013 strcmp(lastctladdr->q_paddr, a->q_paddr) == 0)
1018 if (uid == 0 || user == NULL || user[0] == '\0')
1019 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "C");
1021 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, "C%s:%ld:%ld",
1022 denlstring(user, true, false), (long) uid,
1024 (void) sm_io_fprintf(tfp, SM_TIME_DEFAULT, ":%s\n",
1025 denlstring(a->q_paddr, true, false));
1029 ** RUNNERS_SIGTERM -- propagate a SIGTERM to queue runner process
1031 ** This propagates the signal to the child processes that are queue
1032 ** runners. This is for a queue runner "cleanup". After all of the
1033 ** child queue runner processes are signaled (it should be SIGTERM
1034 ** being the sig) then the old signal handler (Oldsh) is called
1035 ** to handle any cleanup set for this process (provided it is not
1036 ** SIG_DFL or SIG_IGN). The signal may not be handled immediately
1037 ** if the BlockOldsh flag is set. If the current process doesn't
1038 ** have a parent then handle the signal immediately, regardless of
1042 ** sig -- the signal number being sent
1048 ** Sets the NoMoreRunners boolean to true to stop more runners
1049 ** from being started in runqueue().
1051 ** NOTE: THIS CAN BE CALLED FROM A SIGNAL HANDLER. DO NOT ADD
1052 ** ANYTHING TO THIS ROUTINE UNLESS YOU KNOW WHAT YOU ARE
1056 static bool volatile NoMoreRunners = false;
1057 static sigfunc_t Oldsh_term = SIG_DFL;
1058 static sigfunc_t Oldsh_hup = SIG_DFL;
1059 static sigfunc_t volatile Oldsh = SIG_DFL;
1060 static bool BlockOldsh = false;
1061 static int volatile Oldsig = 0;
1062 static SIGFUNC_DECL runners_sigterm __P((int));
1063 static SIGFUNC_DECL runners_sighup __P((int));
1066 runners_sigterm(sig)
1069 int save_errno = errno;
1071 FIX_SYSV_SIGNAL(sig, runners_sigterm);
1073 CHECK_CRITICAL(sig);
1074 NoMoreRunners = true;
1077 proc_list_signal(PROC_QUEUE, sig);
1079 if (!BlockOldsh || getppid() <= 1)
1081 /* Check that a valid 'old signal handler' is callable */
1082 if (Oldsh_term != SIG_DFL && Oldsh_term != SIG_IGN &&
1083 Oldsh_term != runners_sigterm)
1087 return SIGFUNC_RETURN;
1090 ** RUNNERS_SIGHUP -- propagate a SIGHUP to queue runner process
1092 ** This propagates the signal to the child processes that are queue
1093 ** runners. This is for a queue runner "cleanup". After all of the
1094 ** child queue runner processes are signaled (it should be SIGHUP
1095 ** being the sig) then the old signal handler (Oldsh) is called to
1096 ** handle any cleanup set for this process (provided it is not SIG_DFL
1097 ** or SIG_IGN). The signal may not be handled immediately if the
1098 ** BlockOldsh flag is set. If the current process doesn't have
1099 ** a parent then handle the signal immediately, regardless of
1103 ** sig -- the signal number being sent
1109 ** Sets the NoMoreRunners boolean to true to stop more runners
1110 ** from being started in runqueue().
1112 ** NOTE: THIS CAN BE CALLED FROM A SIGNAL HANDLER. DO NOT ADD
1113 ** ANYTHING TO THIS ROUTINE UNLESS YOU KNOW WHAT YOU ARE
1121 int save_errno = errno;
1123 FIX_SYSV_SIGNAL(sig, runners_sighup);
1125 CHECK_CRITICAL(sig);
1126 NoMoreRunners = true;
1129 proc_list_signal(PROC_QUEUE, sig);
1131 if (!BlockOldsh || getppid() <= 1)
1133 /* Check that a valid 'old signal handler' is callable */
1134 if (Oldsh_hup != SIG_DFL && Oldsh_hup != SIG_IGN &&
1135 Oldsh_hup != runners_sighup)
1139 return SIGFUNC_RETURN;
1142 ** MARK_WORK_GROUP_RESTART -- mark a work group as needing a restart
1144 ** Sets a workgroup for restarting.
1147 ** wgrp -- the work group id to restart.
1148 ** reason -- why (signal?), -1 to turn off restart
1154 ** May set global RestartWorkGroup to true.
1156 ** NOTE: THIS CAN BE CALLED FROM A SIGNAL HANDLER. DO NOT ADD
1157 ** ANYTHING TO THIS ROUTINE UNLESS YOU KNOW WHAT YOU ARE
1162 mark_work_group_restart(wgrp, reason)
1166 if (wgrp < 0 || wgrp > NumWorkGroups)
1169 WorkGrp[wgrp].wg_restart = reason;
1171 RestartWorkGroup = true;
1174 ** RESTART_MARKED_WORK_GROUPS -- restart work groups marked as needing restart
1176 ** Restart any workgroup marked as needing a restart provided more
1177 ** runners are allowed.
1186 ** Sets global RestartWorkGroup to false.
1190 restart_marked_work_groups()
1198 /* Block SIGCHLD so reapchild() doesn't mess with us */
1199 wasblocked = sm_blocksignal(SIGCHLD);
1201 for (i = 0; i < NumWorkGroups; i++)
1203 if (WorkGrp[i].wg_restart >= 0)
1206 sm_syslog(LOG_ERR, NOQID,
1207 "restart queue runner=%d due to signal 0x%x",
1208 i, WorkGrp[i].wg_restart);
1209 restart_work_group(i);
1212 RestartWorkGroup = false;
1214 if (wasblocked == 0)
1215 (void) sm_releasesignal(SIGCHLD);
1218 ** RESTART_WORK_GROUP -- restart a specific work group
1220 ** Restart a specific workgroup provided more runners are allowed.
1221 ** If the requested work group has been restarted too many times log
1222 ** this and refuse to restart.
1225 ** wgrp -- the work group id to restart
1231 ** starts another process doing the work of wgrp
1234 #define MAX_PERSIST_RESTART 10 /* max allowed number of restarts */
1237 restart_work_group(wgrp)
1240 if (NoMoreRunners ||
1241 wgrp < 0 || wgrp > NumWorkGroups)
1244 WorkGrp[wgrp].wg_restart = -1;
1245 if (WorkGrp[wgrp].wg_restartcnt < MAX_PERSIST_RESTART)
1247 /* avoid overflow; increment here */
1248 WorkGrp[wgrp].wg_restartcnt++;
1249 (void) run_work_group(wgrp, RWG_FORK|RWG_PERSISTENT|RWG_RUNALL);
1253 sm_syslog(LOG_ERR, NOQID,
1254 "ERROR: persistent queue runner=%d restarted too many times, queue runner lost",
1259 ** SCHEDULE_QUEUE_RUNS -- schedule the next queue run for a work group.
1262 ** runall -- schedule even if individual bit is not set.
1263 ** wgrp -- the work group id to schedule.
1264 ** didit -- the queue run was performed for this work group.
1270 #define INCR_MOD(v, m) if (++v >= m) \
1275 schedule_queue_runs(runall, wgrp, didit)
1280 int qgrp, cgrp, endgrp;
1281 #if _FFR_QUEUE_SCHED_DBG
1284 #endif /* _FFR_QUEUE_SCHED_DBG */
1289 ** This is a bit ugly since we have to duplicate the
1290 ** code that "walks" through a work queue group.
1295 cgrp = endgrp = WorkGrp[wgrp].wg_curqgrp;
1300 #if _FFR_QUEUE_SCHED_DBG
1303 #endif /* _FFR_QUEUE_SCHED_DBG */
1304 qgrp = WorkGrp[wgrp].wg_qgs[cgrp]->qg_index;
1305 if (Queue[qgrp]->qg_queueintvl > 0)
1306 qintvl = Queue[qgrp]->qg_queueintvl;
1307 else if (QueueIntvl > 0)
1308 qintvl = QueueIntvl;
1310 qintvl = (time_t) 0;
1311 #if _FFR_QUEUE_SCHED_DBG
1312 lastsched = Queue[qgrp]->qg_nextrun;
1313 #endif /* _FFR_QUEUE_SCHED_DBG */
1314 if ((runall || Queue[qgrp]->qg_nextrun <= now) && qintvl > 0)
1316 #if _FFR_QUEUE_SCHED_DBG
1318 #endif /* _FFR_QUEUE_SCHED_DBG */
1319 if (minqintvl == 0 || qintvl < minqintvl)
1323 ** Only set a new time if a queue run was performed
1324 ** for this queue group. If the queue was not run,
1325 ** we could starve it by setting a new time on each
1330 Queue[qgrp]->qg_nextrun += qintvl;
1332 #if _FFR_QUEUE_SCHED_DBG
1334 sm_syslog(LOG_INFO, NOQID,
1335 "sqr: wgrp=%d, cgrp=%d, qgrp=%d, intvl=%ld, QI=%ld, runall=%d, lastrun=%ld, nextrun=%ld, sched=%d",
1336 wgrp, cgrp, qgrp, Queue[qgrp]->qg_queueintvl,
1337 QueueIntvl, runall, lastsched,
1338 Queue[qgrp]->qg_nextrun, sched);
1339 #endif /* _FFR_QUEUE_SCHED_DBG */
1340 INCR_MOD(cgrp, WorkGrp[wgrp].wg_numqgrp);
1341 } while (endgrp != cgrp);
1343 (void) sm_setevent(minqintvl, runqueueevent, 0);
1346 #if _FFR_QUEUE_RUN_PARANOIA
1348 ** CHECKQUEUERUNNER -- check whether a queue group hasn't been run.
1350 ** Use this if events may get lost and hence queue runners may not
1351 ** be started and mail will pile up in a queue.
1357 ** true if a queue run is necessary.
1360 ** may schedule a queue run.
1367 time_t now, minqintvl;
1371 for (qgrp = 0; qgrp < NumQueue && Queue[qgrp] != NULL; qgrp++)
1375 if (Queue[qgrp]->qg_queueintvl > 0)
1376 qintvl = Queue[qgrp]->qg_queueintvl;
1377 else if (QueueIntvl > 0)
1378 qintvl = QueueIntvl;
1380 qintvl = (time_t) 0;
1381 if (Queue[qgrp]->qg_nextrun <= now - qintvl)
1383 if (minqintvl == 0 || qintvl < minqintvl)
1386 sm_syslog(LOG_WARNING, NOQID,
1387 "checkqueuerunner: queue %d should have been run at %s, queue interval %ld",
1389 arpadate(ctime(&Queue[qgrp]->qg_nextrun)),
1395 (void) sm_setevent(minqintvl, runqueueevent, 0);
1400 #endif /* _FFR_QUEUE_RUN_PARANOIA */
1403 ** RUNQUEUE -- run the jobs in the queue.
1405 ** Gets the stuff out of the queue in some presumably logical
1406 ** order and processes them.
1409 ** forkflag -- true if the queue scanning should be done in
1410 ** a child process. We double-fork so it is not our
1411 ** child and we don't have to clean up after it.
1412 ** false can be ignored if we have multiple queues.
1413 ** verbose -- if true, print out status information.
1414 ** persistent -- persistent queue runner?
1415 ** runall -- run all groups or only a subset (DoQueueRun)?
1418 ** true if the queue run successfully began.
1421 ** runs things in the mail queue using run_work_group().
1422 ** maybe schedules next queue run.
1425 static ENVELOPE QueueEnvelope; /* the queue run envelope */
1426 static time_t LastQueueTime = 0; /* last time a queue ID assigned */
1427 static pid_t LastQueuePid = -1; /* last PID which had a queue ID */
1429 /* values for qp_supdirs */
1430 #define QP_NOSUB 0x0000 /* No subdirectories */
1431 #define QP_SUBDF 0x0001 /* "df" subdirectory */
1432 #define QP_SUBQF 0x0002 /* "qf" subdirectory */
1433 #define QP_SUBXF 0x0004 /* "xf" subdirectory */
1436 runqueue(forkflag, verbose, persistent, runall)
1444 static int curnum = 0;
1447 SM_NONVOLATILE int oldgroup = 0;
1449 if (sm_debug_active(&DebugLeakQ, 1))
1451 oldgroup = sm_heap_group();
1453 sm_dprintf("runqueue() heap group #%d\n", sm_heap_group());
1455 #endif /* SM_HEAP_CHECK */
1457 /* queue run has been started, don't do any more this time */
1460 /* more than one queue or more than one directory per queue */
1461 if (!forkflag && !verbose &&
1462 (WorkGrp[0].wg_qgs[0]->qg_numqueues > 1 || NumWorkGroups > 1 ||
1463 WorkGrp[0].wg_numqgrp > 1))
1467 ** For controlling queue runners via signals sent to this process.
1468 ** Oldsh* will get called too by runners_sig* (if it is not SIG_IGN
1469 ** or SIG_DFL) to preserve cleanup behavior. Now that this process
1470 ** will have children (and perhaps grandchildren) this handler will
1471 ** be left in place. This is because this process, once it has
1472 ** finished spinning off queue runners, may go back to doing something
1473 ** else (like being a daemon). And we still want on a SIG{TERM,HUP} to
1474 ** clean up the child queue runners. Only install 'runners_sig*' once
1475 ** else we'll get stuck looping forever.
1478 cursh = sm_signal(SIGTERM, runners_sigterm);
1479 if (cursh != runners_sigterm)
1481 cursh = sm_signal(SIGHUP, runners_sighup);
1482 if (cursh != runners_sighup)
1485 for (i = 0; i < NumWorkGroups && !NoMoreRunners; i++)
1487 int rwgflags = RWG_NONE;
1490 ** If MaxQueueChildren active then test whether the start
1491 ** of the next queue group's additional queue runners (maximum)
1492 ** will result in MaxQueueChildren being exceeded.
1494 ** Note: do not use continue; even though another workgroup
1495 ** may have fewer queue runners, this would be "unfair",
1496 ** i.e., this work group might "starve" then.
1499 #if _FFR_QUEUE_SCHED_DBG
1501 sm_syslog(LOG_INFO, NOQID,
1502 "rq: curnum=%d, MaxQueueChildren=%d, CurRunners=%d, WorkGrp[curnum].wg_maxact=%d",
1503 curnum, MaxQueueChildren, CurRunners,
1504 WorkGrp[curnum].wg_maxact);
1505 #endif /* _FFR_QUEUE_SCHED_DBG */
1506 if (MaxQueueChildren > 0 &&
1507 CurRunners + WorkGrp[curnum].wg_maxact > MaxQueueChildren)
1511 ** Pick up where we left off (curnum), in case we
1512 ** used up all the children last time without finishing.
1513 ** This give a round-robin fairness to queue runs.
1515 ** Increment CurRunners before calling run_work_group()
1516 ** to avoid a "race condition" with proc_list_drop() which
1517 ** decrements CurRunners if the queue runners terminate.
1518 ** Notice: CurRunners is an upper limit, in some cases
1519 ** (too few jobs in the queue) this value is larger than
1520 ** the actual number of queue runners. The discrepancy can
1521 ** increase if some queue runners "hang" for a long time.
1524 CurRunners += WorkGrp[curnum].wg_maxact;
1526 rwgflags |= RWG_FORK;
1528 rwgflags |= RWG_VERBOSE;
1530 rwgflags |= RWG_PERSISTENT;
1532 rwgflags |= RWG_RUNALL;
1533 ret = run_work_group(curnum, rwgflags);
1536 ** Failure means a message was printed for ETRN
1537 ** and subsequent queues are likely to fail as well.
1538 ** Decrement CurRunners in that case because
1539 ** none have been started.
1544 CurRunners -= WorkGrp[curnum].wg_maxact;
1549 schedule_queue_runs(runall, curnum, true);
1550 INCR_MOD(curnum, NumWorkGroups);
1553 /* schedule left over queue runs */
1554 if (i < NumWorkGroups && !NoMoreRunners && !persistent)
1558 for (h = curnum; i < NumWorkGroups; i++)
1560 schedule_queue_runs(runall, h, false);
1561 INCR_MOD(h, NumWorkGroups);
1567 if (sm_debug_active(&DebugLeakQ, 1))
1568 sm_heap_setgroup(oldgroup);
1569 #endif /* SM_HEAP_CHECK */
1573 #if _FFR_SKIP_DOMAINS
1575 ** SKIP_DOMAINS -- Skip 'skip' number of domains in the WorkQ.
1577 ** Added by Stephen Frost <sfrost@snowman.net> to support
1578 ** having each runner process every N'th domain instead of
1579 ** every N'th message.
1582 ** skip -- number of domains in WorkQ to skip.
1585 ** total number of messages skipped.
1597 for (n = 0, seqjump = 0; n < skip && WorkQ != NULL; seqjump++)
1599 if (WorkQ->w_next != NULL)
1601 if (WorkQ->w_host != NULL &&
1602 WorkQ->w_next->w_host != NULL)
1604 if (sm_strcasecmp(WorkQ->w_host,
1605 WorkQ->w_next->w_host) != 0)
1610 if ((WorkQ->w_host != NULL &&
1611 WorkQ->w_next->w_host == NULL) ||
1612 (WorkQ->w_host == NULL &&
1613 WorkQ->w_next->w_host != NULL))
1617 WorkQ = WorkQ->w_next;
1621 #endif /* _FFR_SKIP_DOMAINS */
1624 ** RUNNER_WORK -- have a queue runner do its work
1626 ** Have a queue runner do its work a list of entries.
1627 ** When work isn't directly being done then this process can take a signal
1628 ** and terminate immediately (in a clean fashion of course).
1629 ** When work is directly being done, it's not to be interrupted
1630 ** immediately: the work should be allowed to finish at a clean point
1631 ** before termination (in a clean fashion of course).
1635 ** sequenceno -- 'th process to run WorkQ.
1636 ** didfork -- did the calling process fork()?
1637 ** skip -- process only each skip'th item.
1638 ** njobs -- number of jobs in WorkQ.
1644 ** runs things in the mail queue.
1648 runner_work(e, sequenceno, didfork, skip, njobs)
1649 register ENVELOPE *e;
1662 ** Here we temporarily block the second calling of the handlers.
1663 ** This allows us to handle the signal without terminating in the
1664 ** middle of direct work. If a signal does come, the test for
1665 ** NoMoreRunners will find it.
1671 /* process them once at a time */
1672 while (WorkQ != NULL)
1675 SM_NONVOLATILE int oldgroup = 0;
1677 if (sm_debug_active(&DebugLeakQ, 1))
1679 oldgroup = sm_heap_group();
1681 sm_dprintf("run_queue_group() heap group #%d\n",
1684 #endif /* SM_HEAP_CHECK */
1686 /* do no more work */
1689 /* Check that a valid signal handler is callable */
1690 if (Oldsh != SIG_DFL && Oldsh != SIG_IGN &&
1691 Oldsh != runners_sighup &&
1692 Oldsh != runners_sigterm)
1697 w = WorkQ; /* assign current work item */
1700 ** Set the head of the WorkQ to the next work item.
1701 ** It is set 'skip' ahead (the number of parallel queue
1702 ** runners working on WorkQ together) since each runner
1703 ** works on every 'skip'th (N-th) item.
1704 #if _FFR_SKIP_DOMAINS
1705 ** In the case of the BYHOST Queue Sort Order, the 'item'
1706 ** is a domain, so we work on every 'skip'th (N-th) domain.
1707 #endif * _FFR_SKIP_DOMAINS *
1710 #if _FFR_SKIP_DOMAINS
1711 if (QueueSortOrder == QSO_BYHOST)
1714 if (WorkQ->w_next != NULL)
1716 if (WorkQ->w_host != NULL &&
1717 WorkQ->w_next->w_host != NULL)
1719 if (sm_strcasecmp(WorkQ->w_host,
1720 WorkQ->w_next->w_host)
1722 seqjump = skip_domains(skip);
1724 WorkQ = WorkQ->w_next;
1728 if ((WorkQ->w_host != NULL &&
1729 WorkQ->w_next->w_host == NULL) ||
1730 (WorkQ->w_host == NULL &&
1731 WorkQ->w_next->w_host != NULL))
1732 seqjump = skip_domains(skip);
1734 WorkQ = WorkQ->w_next;
1738 WorkQ = WorkQ->w_next;
1741 #endif /* _FFR_SKIP_DOMAINS */
1743 for (n = 0; n < skip && WorkQ != NULL; n++)
1744 WorkQ = WorkQ->w_next;
1750 ** Ignore jobs that are too expensive for the moment.
1752 ** Get new load average every GET_NEW_LA_TIME seconds.
1756 if (shouldqueue(WkRecipFact, Current_LA_time))
1758 char *msg = "Aborting queue run: load average too high";
1763 sm_syslog(LOG_INFO, NOQID, "runqueue: %s", msg);
1766 if (shouldqueue(w->w_pri, w->w_ctime))
1769 message(EmptyString);
1770 if (QueueSortOrder == QSO_BYPRIORITY)
1773 message("Skipping %s/%s (sequence %d of %d) and flushing rest of queue",
1774 qid_printqueue(w->w_qgrp,
1776 w->w_name + 2, sequenceno,
1779 sm_syslog(LOG_INFO, NOQID,
1780 "runqueue: Flushing queue from %s/%s (pri %ld, LA %d, %d of %d)",
1781 qid_printqueue(w->w_qgrp,
1783 w->w_name + 2, w->w_pri,
1784 CurrentLA, sequenceno,
1789 message("Skipping %s/%s (sequence %d of %d)",
1790 qid_printqueue(w->w_qgrp, w->w_qdir),
1791 w->w_name + 2, sequenceno, njobs);
1797 message(EmptyString);
1798 message("Running %s/%s (sequence %d of %d)",
1799 qid_printqueue(w->w_qgrp, w->w_qdir),
1800 w->w_name + 2, sequenceno, njobs);
1802 if (didfork && MaxQueueChildren > 0)
1804 sm_blocksignal(SIGCHLD);
1805 (void) sm_signal(SIGCHLD, reapchild);
1808 sm_syslog(LOG_DEBUG, NOQID,
1809 "runqueue %s dowork(%s)",
1810 qid_printqueue(w->w_qgrp, w->w_qdir),
1813 (void) dowork(w->w_qgrp, w->w_qdir, w->w_name + 2,
1814 ForkQueueRuns, false, e);
1817 sm_free(w->w_name); /* XXX */
1818 if (w->w_host != NULL)
1819 sm_free(w->w_host); /* XXX */
1820 sm_free((char *) w); /* XXX */
1821 sequenceno += seqjump; /* next sequence number */
1823 if (sm_debug_active(&DebugLeakQ, 1))
1824 sm_heap_setgroup(oldgroup);
1825 #endif /* SM_HEAP_CHECK */
1830 /* check the signals didn't happen during the revert */
1833 /* Check that a valid signal handler is callable */
1834 if (Oldsh != SIG_DFL && Oldsh != SIG_IGN &&
1835 Oldsh != runners_sighup && Oldsh != runners_sigterm)
1839 Oldsh = SIG_DFL; /* after the NoMoreRunners check */
1842 ** RUN_WORK_GROUP -- run the jobs in a queue group from a work group.
1844 ** Gets the stuff out of the queue in some presumably logical
1845 ** order and processes them.
1848 ** wgrp -- work group to process.
1849 ** flags -- RWG_* flags
1852 ** true if the queue run successfully began.
1855 ** runs things in the mail queue.
1858 /* Minimum sleep time for persistent queue runners */
1859 #define MIN_SLEEP_TIME 5
1862 run_work_group(wgrp, flags)
1866 register ENVELOPE *e;
1869 int qgrp, endgrp, h, i;
1873 extern void rmexpstab __P((void));
1874 extern ENVELOPE BlankEnvelope;
1875 extern SIGFUNC_DECL reapchild __P((int));
1881 ** If no work will ever be selected, don't even bother reading
1887 if (!bitset(RWG_PERSISTENT, flags) &&
1888 shouldqueue(WkRecipFact, Current_LA_time))
1890 char *msg = "Skipping queue run -- load average too high";
1892 if (bitset(RWG_VERBOSE, flags))
1893 message("458 %s\n", msg);
1895 sm_syslog(LOG_INFO, NOQID, "runqueue: %s", msg);
1900 ** See if we already have too many children.
1903 if (bitset(RWG_FORK, flags) &&
1904 WorkGrp[wgrp].wg_lowqintvl > 0 &&
1905 !bitset(RWG_PERSISTENT, flags) &&
1906 MaxChildren > 0 && CurChildren >= MaxChildren)
1908 char *msg = "Skipping queue run -- too many children";
1910 if (bitset(RWG_VERBOSE, flags))
1911 message("458 %s (%d)\n", msg, CurChildren);
1913 sm_syslog(LOG_INFO, NOQID, "runqueue: %s (%d)",
1919 ** See if we want to go off and do other useful work.
1922 if (bitset(RWG_FORK, flags))
1926 (void) sm_blocksignal(SIGCHLD);
1927 (void) sm_signal(SIGCHLD, reapchild);
1932 const char *msg = "Skipping queue run -- fork() failed";
1933 const char *err = sm_errstring(errno);
1935 if (bitset(RWG_VERBOSE, flags))
1936 message("458 %s: %s\n", msg, err);
1938 sm_syslog(LOG_INFO, NOQID, "runqueue: %s: %s",
1940 (void) sm_releasesignal(SIGCHLD);
1945 /* parent -- pick up intermediate zombie */
1946 (void) sm_blocksignal(SIGALRM);
1948 /* wgrp only used when queue runners are persistent */
1949 proc_list_add(pid, "Queue runner", PROC_QUEUE,
1950 WorkGrp[wgrp].wg_maxact,
1951 bitset(RWG_PERSISTENT, flags) ? wgrp : -1,
1953 (void) sm_releasesignal(SIGALRM);
1954 (void) sm_releasesignal(SIGCHLD);
1958 /* child -- clean up signals */
1960 /* Reset global flags */
1961 RestartRequest = NULL;
1962 RestartWorkGroup = false;
1963 ShutdownRequest = NULL;
1965 CurrentPid = getpid();
1966 close_sendmail_pid();
1969 ** Initialize exception stack and default exception
1970 ** handler for child process.
1973 sm_exc_newthread(fatal_error);
1977 /* Add parent process as first child item */
1978 proc_list_add(CurrentPid, "Queue runner child process",
1979 PROC_QUEUE_CHILD, 0, -1, NULL);
1980 (void) sm_releasesignal(SIGCHLD);
1981 (void) sm_signal(SIGCHLD, SIG_DFL);
1982 (void) sm_signal(SIGHUP, SIG_DFL);
1983 (void) sm_signal(SIGTERM, intsig);
1987 ** Release any resources used by the daemon code.
1992 /* force it to run expensive jobs */
1995 /* drop privileges */
1996 if (geteuid() == (uid_t) 0)
1997 (void) drop_privileges(false);
2000 ** Create ourselves an envelope
2003 CurEnv = &QueueEnvelope;
2004 rpool = sm_rpool_new_x(NULL);
2005 e = newenvelope(&QueueEnvelope, CurEnv, rpool);
2006 e->e_flags = BlankEnvelope.e_flags;
2009 /* make sure we have disconnected from parent */
2010 if (bitset(RWG_FORK, flags))
2017 ** If we are running part of the queue, always ignore stored
2021 if (QueueLimitId != NULL || QueueLimitSender != NULL ||
2022 QueueLimitQuarantine != NULL ||
2023 QueueLimitRecipient != NULL)
2025 IgnoreHostStatus = true;
2030 ** Here is where we choose the queue group from the work group.
2031 ** The caller of the "domorework" label must setup a new envelope.
2034 endgrp = WorkGrp[wgrp].wg_curqgrp; /* to not spin endlessly */
2039 ** Run a queue group if:
2040 ** RWG_RUNALL bit is set or the bit for this group is set.
2047 ** Find the next queue group within the work group that
2048 ** has been marked as needing a run.
2051 qgrp = WorkGrp[wgrp].wg_qgs[WorkGrp[wgrp].wg_curqgrp]->qg_index;
2052 WorkGrp[wgrp].wg_curqgrp++; /* advance */
2053 WorkGrp[wgrp].wg_curqgrp %= WorkGrp[wgrp].wg_numqgrp; /* wrap */
2054 if (bitset(RWG_RUNALL, flags) ||
2055 (Queue[qgrp]->qg_nextrun <= now &&
2056 Queue[qgrp]->qg_nextrun != (time_t) -1))
2058 if (endgrp == WorkGrp[wgrp].wg_curqgrp)
2061 if (bitset(RWG_FORK, flags))
2062 finis(true, true, ExitStat);
2063 return true; /* we're done */
2067 qdir = Queue[qgrp]->qg_curnum; /* round-robin init of queue position */
2068 #if _FFR_QUEUE_SCHED_DBG
2070 sm_syslog(LOG_INFO, NOQID,
2071 "rwg: wgrp=%d, qgrp=%d, qdir=%d, name=%s, curqgrp=%d, numgrps=%d",
2072 wgrp, qgrp, qdir, qid_printqueue(qgrp, qdir),
2073 WorkGrp[wgrp].wg_curqgrp, WorkGrp[wgrp].wg_numqgrp);
2074 #endif /* _FFR_QUEUE_SCHED_DBG */
2077 /* tweak niceness of queue runs */
2078 if (Queue[qgrp]->qg_nice > 0)
2079 (void) nice(Queue[qgrp]->qg_nice);
2080 #endif /* HASNICE */
2082 /* XXX running queue group... */
2083 sm_setproctitle(true, CurEnv, "running queue: %s",
2084 qid_printqueue(qgrp, qdir));
2086 if (LogLevel > 69 || tTd(63, 99))
2087 sm_syslog(LOG_DEBUG, NOQID,
2088 "runqueue %s, pid=%d, forkflag=%d",
2089 qid_printqueue(qgrp, qdir), (int) CurrentPid,
2090 bitset(RWG_FORK, flags));
2093 ** Start making passes through the queue.
2094 ** First, read and sort the entire queue.
2095 ** Then, process the work in that order.
2096 ** But if you take too long, start over.
2099 for (i = 0; i < Queue[qgrp]->qg_numqueues; i++)
2101 h = gatherq(qgrp, qdir, false, &full, &more);
2103 if (ShmId != SM_SHM_NO_ID)
2104 QSHM_ENTRIES(Queue[qgrp]->qg_qpaths[qdir].qp_idx) = h;
2105 #endif /* SM_CONF_SHM */
2106 /* If there are no more items in this queue advance */
2109 /* A round-robin advance */
2111 qdir %= Queue[qgrp]->qg_numqueues;
2114 /* Has the WorkList reached the limit? */
2116 break; /* don't try to gather more */
2119 /* order the existing work requests */
2120 njobs = sortq(Queue[qgrp]->qg_maxlist);
2121 Queue[qgrp]->qg_curnum = qdir; /* update */
2124 if (!Verbose && bitnset(QD_FORK, Queue[qgrp]->qg_flags))
2126 int loop, maxrunners;
2130 ** For this WorkQ we want to fork off N children (maxrunners)
2131 ** at this point. Each child has a copy of WorkQ. Each child
2132 ** will process every N-th item. The parent will wait for all
2133 ** of the children to finish before moving on to the next
2134 ** queue group within the work group. This saves us forking
2135 ** a new runner-child for each work item.
2136 ** It's valid for qg_maxqrun == 0 since this may be an
2137 ** explicit "don't run this queue" setting.
2140 maxrunners = Queue[qgrp]->qg_maxqrun;
2142 /* No need to have more runners then there are jobs */
2143 if (maxrunners > njobs)
2145 for (loop = 0; loop < maxrunners; loop++)
2148 ** Since the delivery may happen in a child and the
2149 ** parent does not wait, the parent may close the
2150 ** maps thereby removing any shared memory used by
2151 ** the map. Therefore, close the maps now so the
2152 ** child will dynamically open them if necessary.
2160 syserr("run_work_group: cannot fork");
2165 /* parent -- clean out connection cache */
2166 mci_flush(false, NULL);
2167 #if _FFR_SKIP_DOMAINS
2168 if (QueueSortOrder == QSO_BYHOST)
2170 sequenceno += skip_domains(1);
2173 #endif /* _FFR_SKIP_DOMAINS */
2176 WorkQ = WorkQ->w_next;
2179 proc_list_add(pid, "Queue child runner process",
2180 PROC_QUEUE_CHILD, 0, -1, NULL);
2182 /* No additional work, no additional runners */
2188 /* child -- Reset global flags */
2189 RestartRequest = NULL;
2190 RestartWorkGroup = false;
2191 ShutdownRequest = NULL;
2193 CurrentPid = getpid();
2194 close_sendmail_pid();
2197 ** Initialize exception stack and default
2198 ** exception handler for child process.
2199 ** When fork()'d the child now has a private
2200 ** copy of WorkQ at its current position.
2203 sm_exc_newthread(fatal_error);
2206 ** SMTP processes (whether -bd or -bs) set
2207 ** SIGCHLD to reapchild to collect
2208 ** children status. However, at delivery
2209 ** time, that status must be collected
2210 ** by sm_wait() to be dealt with properly
2211 ** (check success of delivery based
2212 ** on status code, etc). Therefore, if we
2213 ** are an SMTP process, reset SIGCHLD
2214 ** back to the default so reapchild
2215 ** doesn't collect status before
2219 if (OpMode == MD_SMTP ||
2220 OpMode == MD_DAEMON ||
2221 MaxQueueChildren > 0)
2224 sm_releasesignal(SIGCHLD);
2225 (void) sm_signal(SIGCHLD, SIG_DFL);
2228 /* child -- error messages to the transcript */
2229 QuickAbort = OnlyOneError = false;
2230 runner_work(e, sequenceno, true,
2233 /* This child is done */
2234 finis(true, true, ExitStat);
2239 sm_releasesignal(SIGCHLD);
2242 ** Wait until all of the runners have completed before
2243 ** seeing if there is another queue group in the
2244 ** work group to process.
2245 ** XXX Future enhancement: don't wait() for all children
2246 ** here, just go ahead and make sure that overall the number
2247 ** of children is not exceeded.
2250 while (CurChildren > 0)
2255 while ((ret = sm_wait(&status)) <= 0)
2257 proc_list_drop(ret, status, NULL);
2260 else if (Queue[qgrp]->qg_maxqrun > 0 || bitset(RWG_FORCE, flags))
2263 ** When current process will not fork children to do the work,
2264 ** it will do the work itself. The 'skip' will be 1 since
2265 ** there are no child runners to divide the work across.
2268 runner_work(e, sequenceno, false, 1, njobs);
2271 /* free memory allocated by newenvelope() above */
2272 sm_rpool_free(rpool);
2273 QueueEnvelope.e_rpool = NULL;
2275 /* Are there still more queues in the work group to process? */
2276 if (endgrp != WorkGrp[wgrp].wg_curqgrp)
2278 rpool = sm_rpool_new_x(NULL);
2279 e = newenvelope(&QueueEnvelope, CurEnv, rpool);
2280 e->e_flags = BlankEnvelope.e_flags;
2284 /* No more queues in work group to process. Now check persistent. */
2285 if (bitset(RWG_PERSISTENT, flags))
2288 sm_setproctitle(true, CurEnv, "running queue: %s",
2289 qid_printqueue(qgrp, qdir));
2292 ** close bogus maps, i.e., maps which caused a tempfail,
2293 ** so we get fresh map connections on the next lookup.
2294 ** closemaps() is also called when children are started.
2299 /* Close any cached connections. */
2300 mci_flush(true, NULL);
2302 /* Clean out expired related entries. */
2306 /* Update MX records for FallbackMX. */
2307 if (FallbackMX != NULL)
2308 (void) getfallbackmxrr(FallbackMX);
2309 #endif /* NAMED_BIND */
2312 /* close UserDatabase */
2317 if (sm_debug_active(&SmHeapCheck, 2)
2318 && access("memdump", F_OK) == 0
2324 out = sm_io_open(SmFtStdio, SM_TIME_DEFAULT,
2325 "memdump.out", SM_IO_APPEND, NULL);
2328 (void) sm_io_fprintf(out, SM_TIME_DEFAULT, "----------------------\n");
2330 sm_debug_level(&SmHeapCheck) - 1);
2331 (void) sm_io_close(out, SM_TIME_DEFAULT);
2334 #endif /* SM_HEAP_CHECK */
2336 /* let me rest for a second to catch my breath */
2337 if (njobs == 0 && WorkGrp[wgrp].wg_lowqintvl < MIN_SLEEP_TIME)
2338 sleep(MIN_SLEEP_TIME);
2339 else if (WorkGrp[wgrp].wg_lowqintvl <= 0)
2340 sleep(QueueIntvl > 0 ? QueueIntvl : MIN_SLEEP_TIME);
2342 sleep(WorkGrp[wgrp].wg_lowqintvl);
2345 ** Get the LA outside the WorkQ loop if necessary.
2346 ** In a persistent queue runner the code is repeated over
2347 ** and over but gatherq() may ignore entries due to
2348 ** shouldqueue() (do we really have to do this twice?).
2349 ** Hence the queue runners would just idle around when once
2350 ** CurrentLA caused all entries in a queue to be ignored.
2355 rpool = sm_rpool_new_x(NULL);
2356 e = newenvelope(&QueueEnvelope, CurEnv, rpool);
2357 e->e_flags = BlankEnvelope.e_flags;
2361 /* exit without the usual cleanup */
2363 if (bitset(RWG_FORK, flags))
2364 finis(true, true, ExitStat);
2370 ** DOQUEUERUN -- do a queue run?
2380 ** RUNQUEUEEVENT -- Sets a flag to indicate that a queue run should be done.
2389 ** The invocation of this function via an alarm may interrupt
2390 ** a set of actions. Thus errno may be set in that context.
2391 ** We need to restore errno at the end of this function to ensure
2392 ** that any work done here that sets errno doesn't return a
2393 ** misleading/false errno value. Errno may be EINTR upon entry to
2394 ** this function because of non-restartable/continuable system
2395 ** API was active. Iff this is true we will override errno as
2396 ** a timeout (as a more accurate error message).
2398 ** NOTE: THIS CAN BE CALLED FROM A SIGNAL HANDLER. DO NOT ADD
2399 ** ANYTHING TO THIS ROUTINE UNLESS YOU KNOW WHAT YOU ARE
2404 runqueueevent(ignore)
2407 int save_errno = errno;
2410 ** Set the general bit that we want a queue run,
2411 ** tested in doqueuerun()
2415 #if _FFR_QUEUE_SCHED_DBG
2417 sm_syslog(LOG_INFO, NOQID, "rqe: done");
2418 #endif /* _FFR_QUEUE_SCHED_DBG */
2425 ** GATHERQ -- gather messages from the message queue(s) the work queue.
2428 ** qgrp -- the index of the queue group.
2429 ** qdir -- the index of the queue directory.
2430 ** doall -- if set, include everything in the queue (even
2431 ** the jobs that cannot be run because the load
2432 ** average is too high, or MaxQueueRun is reached).
2433 ** Otherwise, exclude those jobs.
2434 ** full -- (optional) to be set 'true' if WorkList is full
2435 ** more -- (optional) to be set 'true' if there are still more
2436 ** messages in this queue not added to WorkList
2439 ** The number of request in the queue (not necessarily
2440 ** the number of requests in WorkList however).
2443 ** prepares available work into WorkList
2446 #define NEED_P 0001 /* 'P': priority */
2447 #define NEED_T 0002 /* 'T': time */
2448 #define NEED_R 0004 /* 'R': recipient */
2449 #define NEED_S 0010 /* 'S': sender */
2450 #define NEED_H 0020 /* host */
2451 #define HAS_QUARANTINE 0040 /* has an unexpected 'q' line */
2452 #define NEED_QUARANTINE 0100 /* 'q': reason */
2454 static WORK *WorkList = NULL; /* list of unsort work */
2455 static int WorkListSize = 0; /* current max size of WorkList */
2456 static int WorkListCount = 0; /* # of work items in WorkList */
2459 gatherq(qgrp, qdir, doall, full, more)
2466 register struct dirent *d;
2473 char qd[MAXPATHLEN];
2474 char qf[MAXPATHLEN];
2476 wn = WorkListCount - 1;
2479 (void) sm_strlcpy(qd, ".", sizeof qd);
2481 (void) sm_strlcpyn(qd, sizeof qd, 2,
2482 Queue[qgrp]->qg_qpaths[qdir].qp_name,
2484 Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
2489 sm_dprintf("gatherq:\n");
2491 check = QueueLimitId;
2492 while (check != NULL)
2494 sm_dprintf("\tQueueLimitId = %s%s\n",
2495 check->queue_negate ? "!" : "",
2496 check->queue_match);
2497 check = check->queue_next;
2500 check = QueueLimitSender;
2501 while (check != NULL)
2503 sm_dprintf("\tQueueLimitSender = %s%s\n",
2504 check->queue_negate ? "!" : "",
2505 check->queue_match);
2506 check = check->queue_next;
2509 check = QueueLimitRecipient;
2510 while (check != NULL)
2512 sm_dprintf("\tQueueLimitRecipient = %s%s\n",
2513 check->queue_negate ? "!" : "",
2514 check->queue_match);
2515 check = check->queue_next;
2518 if (QueueMode == QM_QUARANTINE)
2520 check = QueueLimitQuarantine;
2521 while (check != NULL)
2523 sm_dprintf("\tQueueLimitQuarantine = %s%s\n",
2524 check->queue_negate ? "!" : "",
2525 check->queue_match);
2526 check = check->queue_next;
2531 /* open the queue directory */
2535 syserr("gatherq: cannot open \"%s\"",
2536 qid_printqueue(qgrp, qdir));
2538 *full = WorkListCount >= MaxQueueRun && MaxQueueRun > 0;
2545 ** Read the work directory.
2548 while ((d = readdir(f)) != NULL)
2552 char lbuf[MAXNAME + 1];
2556 sm_dprintf("gatherq: checking %s..", d->d_name);
2558 /* is this an interesting entry? */
2559 if (!(((QueueMode == QM_NORMAL &&
2560 d->d_name[0] == NORMQF_LETTER) ||
2561 (QueueMode == QM_QUARANTINE &&
2562 d->d_name[0] == QUARQF_LETTER) ||
2563 (QueueMode == QM_LOST &&
2564 d->d_name[0] == LOSEQF_LETTER)) &&
2565 d->d_name[1] == 'f'))
2568 sm_dprintf(" skipping\n");
2574 if (strlen(d->d_name) >= MAXQFNAME)
2577 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
2578 "gatherq: %s too long, %d max characters\n",
2579 d->d_name, MAXQFNAME);
2581 sm_syslog(LOG_ALERT, NOQID,
2582 "gatherq: %s too long, %d max characters",
2583 d->d_name, MAXQFNAME);
2587 check = QueueLimitId;
2588 while (check != NULL)
2590 if (strcontainedin(false, check->queue_match,
2591 d->d_name) != check->queue_negate)
2594 check = check->queue_next;
2596 if (QueueLimitId != NULL && check == NULL)
2599 /* grow work list if necessary */
2600 if (++wn >= MaxQueueRun && MaxQueueRun > 0)
2602 if (wn == MaxQueueRun && LogLevel > 0)
2603 sm_syslog(LOG_WARNING, NOQID,
2604 "WorkList for %s maxed out at %d",
2605 qid_printqueue(qgrp, qdir),
2608 continue; /* just count entries */
2611 if (wn >= WorkListSize)
2613 grow_wlist(qgrp, qdir);
2614 if (wn >= WorkListSize)
2620 (void) sm_strlcpyn(qf, sizeof qf, 3, qd, "/", d->d_name);
2621 if (stat(qf, &sbuf) < 0)
2623 if (errno != ENOENT)
2624 sm_syslog(LOG_INFO, NOQID,
2625 "gatherq: can't stat %s/%s",
2626 qid_printqueue(qgrp, qdir),
2631 if (!bitset(S_IFREG, sbuf.st_mode))
2633 /* Yikes! Skip it or we will hang on open! */
2634 if (!((d->d_name[0] == DATAFL_LETTER ||
2635 d->d_name[0] == NORMQF_LETTER ||
2636 d->d_name[0] == QUARQF_LETTER ||
2637 d->d_name[0] == LOSEQF_LETTER ||
2638 d->d_name[0] == XSCRPT_LETTER) &&
2639 d->d_name[1] == 'f' && d->d_name[2] == '\0'))
2640 syserr("gatherq: %s/%s is not a regular file",
2641 qid_printqueue(qgrp, qdir), d->d_name);
2646 /* avoid work if possible */
2647 if ((QueueSortOrder == QSO_BYFILENAME ||
2648 QueueSortOrder == QSO_BYMODTIME ||
2649 QueueSortOrder == QSO_RANDOM) &&
2650 QueueLimitQuarantine == NULL &&
2651 QueueLimitSender == NULL &&
2652 QueueLimitRecipient == NULL)
2656 w->w_name = newstr(d->d_name);
2658 w->w_lock = w->w_tooyoung = false;
2661 w->w_mtime = sbuf.st_mtime;
2666 /* open control file */
2667 cf = sm_io_open(SmFtStdio, SM_TIME_DEFAULT, qf, SM_IO_RDONLY_B,
2669 if (cf == NULL && OpMode != MD_PRINT)
2671 /* this may be some random person sending hir msgs */
2673 sm_dprintf("gatherq: cannot open %s: %s\n",
2674 d->d_name, sm_errstring(errno));
2681 w->w_name = newstr(d->d_name);
2685 w->w_lock = !lockfile(sm_io_getinfo(cf, SM_IO_WHAT_FD,
2690 w->w_tooyoung = false;
2692 /* make sure jobs in creation don't clog queue */
2693 w->w_pri = 0x7fffffff;
2695 w->w_mtime = sbuf.st_mtime;
2697 /* extract useful information */
2699 if (QueueSortOrder == QSO_BYHOST
2701 || QueueSortOrder == QSO_BYSHUFFLE
2702 #endif /* _FFR_RHS */
2705 /* need w_host set for host sort order */
2708 if (QueueLimitSender != NULL)
2710 if (QueueLimitRecipient != NULL)
2712 if (QueueLimitQuarantine != NULL)
2713 i |= NEED_QUARANTINE;
2714 while (cf != NULL && i != 0 &&
2715 sm_io_fgets(cf, SM_TIME_DEFAULT, lbuf,
2716 sizeof lbuf) != NULL)
2721 p = strchr(lbuf, '\n');
2726 /* flush rest of overly long line */
2727 while ((c = sm_io_getc(cf, SM_TIME_DEFAULT))
2728 != SM_IO_EOF && c != '\n')
2735 qfver = atoi(&lbuf[1]);
2739 w->w_pri = atol(&lbuf[1]);
2744 w->w_ctime = atol(&lbuf[1]);
2749 if (QueueMode != QM_QUARANTINE &&
2750 QueueMode != QM_LOST)
2753 sm_dprintf("%s not marked as quarantined but has a 'q' line\n",
2755 i |= HAS_QUARANTINE;
2757 else if (QueueMode == QM_QUARANTINE)
2759 if (QueueLimitQuarantine == NULL)
2761 i &= ~NEED_QUARANTINE;
2765 check = QueueLimitQuarantine;
2766 while (check != NULL)
2768 if (strcontainedin(false,
2771 check->queue_negate)
2774 check = check->queue_next;
2777 i &= ~NEED_QUARANTINE;
2782 if (w->w_host == NULL &&
2783 (p = strrchr(&lbuf[1], '@')) != NULL)
2786 if (QueueSortOrder == QSO_BYSHUFFLE)
2787 w->w_host = newstr(&p[1]);
2789 #endif /* _FFR_RHS */
2790 w->w_host = strrev(&p[1]);
2791 makelower(w->w_host);
2794 if (QueueLimitRecipient == NULL)
2801 p = strchr(&lbuf[1], ':');
2805 ++p; /* skip over ':' */
2809 check = QueueLimitRecipient;
2810 while (check != NULL)
2812 if (strcontainedin(true,
2815 check->queue_negate)
2818 check = check->queue_next;
2825 check = QueueLimitSender;
2826 while (check != NULL)
2828 if (strcontainedin(true,
2831 check->queue_negate)
2834 check = check->queue_next;
2841 age = curtime() - (time_t) atol(&lbuf[1]);
2842 if (age >= 0 && MinQueueAge > 0 &&
2844 w->w_tooyoung = true;
2848 if (atol(&lbuf[1]) == 0)
2849 w->w_tooyoung = false;
2854 (void) sm_io_close(cf, SM_TIME_DEFAULT);
2856 if ((!doall && (shouldqueue(w->w_pri, w->w_ctime) ||
2858 bitset(HAS_QUARANTINE, i) ||
2859 bitset(NEED_QUARANTINE, i) ||
2860 bitset(NEED_R|NEED_S, i))
2862 /* don't even bother sorting this job in */
2864 sm_dprintf("skipping %s (%x)\n", w->w_name, i);
2865 sm_free(w->w_name); /* XXX */
2866 if (w->w_host != NULL)
2867 sm_free(w->w_host); /* XXX */
2876 i = wn - WorkListCount;
2877 WorkListCount += SM_MIN(num_ent, WorkListSize);
2880 *more = WorkListCount < wn;
2883 *full = (wn >= MaxQueueRun && MaxQueueRun > 0) ||
2884 (WorkList == NULL && wn > 0);
2889 ** SORTQ -- sort the work list
2891 ** First the old WorkQ is cleared away. Then the WorkList is sorted
2892 ** for all items so that important (higher sorting value) items are not
2893 ** trunctated off. Then the most important items are moved from
2894 ** WorkList to WorkQ. The lower count of 'max' or MaxListCount items
2898 ** max -- maximum number of items to be placed in WorkQ
2901 ** the number of items in WorkQ
2904 ** WorkQ gets released and filled with new work. WorkList
2905 ** gets released. Work items get sorted in order.
2912 register int i; /* local counter */
2913 register WORK *w; /* tmp item pointer */
2914 int wc = WorkListCount; /* trim size for WorkQ */
2920 /* Clear out old WorkQ. */
2921 for (w = WorkQ; w != NULL; w = nw)
2924 sm_free(w->w_name); /* XXX */
2925 if (w->w_host != NULL)
2926 sm_free(w->w_host); /* XXX */
2927 sm_free((char *) w); /* XXX */
2932 if (WorkList == NULL || wc <= 0)
2936 ** The sort now takes place using all of the items in WorkList.
2937 ** The list gets trimmed to the most important items after the sort.
2938 ** If the trim were to happen before the sort then one or more
2939 ** important items might get truncated off -- not what we want.
2942 if (QueueSortOrder == QSO_BYHOST)
2945 ** Sort the work directory for the first time,
2946 ** based on host name, lock status, and priority.
2949 qsort((char *) WorkList, wc, sizeof *WorkList, workcmpf1);
2952 ** If one message to host is locked, "lock" all messages
2959 if (!WorkList[i].w_lock)
2967 if (WorkList[i].w_host == NULL &&
2969 WorkList[i].w_lock = true;
2970 else if (WorkList[i].w_host != NULL &&
2971 w->w_host != NULL &&
2972 sm_strcasecmp(WorkList[i].w_host,
2974 WorkList[i].w_lock = true;
2981 ** Sort the work directory for the second time,
2982 ** based on lock status, host name, and priority.
2985 qsort((char *) WorkList, wc, sizeof *WorkList, workcmpf2);
2987 else if (QueueSortOrder == QSO_BYTIME)
2990 ** Simple sort based on submission time only.
2993 qsort((char *) WorkList, wc, sizeof *WorkList, workcmpf3);
2995 else if (QueueSortOrder == QSO_BYFILENAME)
2998 ** Sort based on queue filename.
3001 qsort((char *) WorkList, wc, sizeof *WorkList, workcmpf4);
3003 else if (QueueSortOrder == QSO_RANDOM)
3006 ** Sort randomly. To avoid problems with an instable sort,
3007 ** use a random index into the queue file name to start
3011 randi = get_rand_mod(MAXQFNAME);
3014 qsort((char *) WorkList, wc, sizeof *WorkList, workcmpf5);
3016 else if (QueueSortOrder == QSO_BYMODTIME)
3019 ** Simple sort based on modification time of queue file.
3020 ** This puts the oldest items first.
3023 qsort((char *) WorkList, wc, sizeof *WorkList, workcmpf6);
3026 else if (QueueSortOrder == QSO_BYSHUFFLE)
3029 ** Simple sort based on shuffled host name.
3032 init_shuffle_alphabet();
3033 qsort((char *) WorkList, wc, sizeof *WorkList, workcmpf7);
3035 #endif /* _FFR_RHS */
3036 else if (QueueSortOrder == QSO_BYPRIORITY)
3039 ** Simple sort based on queue priority only.
3042 qsort((char *) WorkList, wc, sizeof *WorkList, workcmpf0);
3044 /* else don't sort at all */
3046 /* Check if the per queue group item limit will be exceeded */
3047 if (wc > max && max > 0)
3051 ** Convert the work list into canonical form.
3052 ** Should be turning it into a list of envelopes here perhaps.
3053 ** Only take the most important items up to the per queue group
3057 for (i = wc; --i >= 0; )
3059 w = (WORK *) xalloc(sizeof *w);
3060 w->w_qgrp = WorkList[i].w_qgrp;
3061 w->w_qdir = WorkList[i].w_qdir;
3062 w->w_name = WorkList[i].w_name;
3063 w->w_host = WorkList[i].w_host;
3064 w->w_lock = WorkList[i].w_lock;
3065 w->w_tooyoung = WorkList[i].w_tooyoung;
3066 w->w_pri = WorkList[i].w_pri;
3067 w->w_ctime = WorkList[i].w_ctime;
3068 w->w_mtime = WorkList[i].w_mtime;
3073 /* free the rest of the list */
3074 for (i = WorkListCount; --i >= wc; )
3076 sm_free(WorkList[i].w_name);
3077 if (WorkList[i].w_host != NULL)
3078 sm_free(WorkList[i].w_host);
3081 if (WorkList != NULL)
3082 sm_free(WorkList); /* XXX */
3089 for (w = WorkQ; w != NULL; w = w->w_next)
3091 if (w->w_host != NULL)
3092 sm_dprintf("%22s: pri=%ld %s\n",
3093 w->w_name, w->w_pri, w->w_host);
3095 sm_dprintf("%32s: pri=%ld\n",
3096 w->w_name, w->w_pri);
3100 return wc; /* return number of WorkQ items */
3103 ** GROW_WLIST -- make the work list larger
3106 ** qgrp -- the index for the queue group.
3107 ** qdir -- the index for the queue directory.
3113 ** Adds another QUEUESEGSIZE entries to WorkList if possible.
3114 ** It can fail if there isn't enough memory, so WorkListSize
3115 ** should be checked again upon return.
3119 grow_wlist(qgrp, qdir)
3124 sm_dprintf("grow_wlist: WorkListSize=%d\n", WorkListSize);
3125 if (WorkList == NULL)
3127 WorkList = (WORK *) xalloc((sizeof *WorkList) *
3128 (QUEUESEGSIZE + 1));
3129 WorkListSize = QUEUESEGSIZE;
3133 int newsize = WorkListSize + QUEUESEGSIZE;
3134 WORK *newlist = (WORK *) sm_realloc((char *) WorkList,
3135 (unsigned) sizeof(WORK) * (newsize + 1));
3137 if (newlist != NULL)
3139 WorkListSize = newsize;
3143 sm_syslog(LOG_INFO, NOQID,
3144 "grew WorkList for %s to %d",
3145 qid_printqueue(qgrp, qdir),
3149 else if (LogLevel > 0)
3151 sm_syslog(LOG_ALERT, NOQID,
3152 "FAILED to grow WorkList for %s to %d",
3153 qid_printqueue(qgrp, qdir), newsize);
3157 sm_dprintf("grow_wlist: WorkListSize now %d\n", WorkListSize);
3160 ** WORKCMPF0 -- simple priority-only compare function.
3163 ** a -- the first argument.
3164 ** b -- the second argument.
3189 ** WORKCMPF1 -- first compare function for ordering work based on host name.
3191 ** Sorts on host name, lock status, and priority in that order.
3194 ** a -- the first argument.
3195 ** b -- the second argument.
3212 if (a->w_host != NULL && b->w_host == NULL)
3214 else if (a->w_host == NULL && b->w_host != NULL)
3216 if (a->w_host != NULL && b->w_host != NULL &&
3217 (i = sm_strcasecmp(a->w_host, b->w_host)) != 0)
3221 if (a->w_lock != b->w_lock)
3222 return b->w_lock - a->w_lock;
3225 return workcmpf0(a, b);
3228 ** WORKCMPF2 -- second compare function for ordering work based on host name.
3230 ** Sorts on lock status, host name, and priority in that order.
3233 ** a -- the first argument.
3234 ** b -- the second argument.
3251 if (a->w_lock != b->w_lock)
3252 return a->w_lock - b->w_lock;
3255 if (a->w_host != NULL && b->w_host == NULL)
3257 else if (a->w_host == NULL && b->w_host != NULL)
3259 if (a->w_host != NULL && b->w_host != NULL &&
3260 (i = sm_strcasecmp(a->w_host, b->w_host)) != 0)
3264 return workcmpf0(a, b);
3267 ** WORKCMPF3 -- simple submission-time-only compare function.
3270 ** a -- the first argument.
3271 ** b -- the second argument.
3285 if (a->w_ctime > b->w_ctime)
3287 else if (a->w_ctime < b->w_ctime)
3293 ** WORKCMPF4 -- compare based on file name
3296 ** a -- the first argument.
3297 ** b -- the second argument.
3311 return strcmp(a->w_name, b->w_name);
3314 ** WORKCMPF5 -- compare based on assigned random number
3317 ** a -- the first argument (ignored).
3318 ** b -- the second argument (ignored).
3330 if (strlen(a->w_name) < randi || strlen(b->w_name) < randi)
3332 return a->w_name[randi] - b->w_name[randi];
3335 ** WORKCMPF6 -- simple modification-time-only compare function.
3338 ** a -- the first argument.
3339 ** b -- the second argument.
3353 if (a->w_mtime > b->w_mtime)
3355 else if (a->w_mtime < b->w_mtime)
3362 ** WORKCMPF7 -- compare function for ordering work based on shuffled host name.
3364 ** Sorts on lock status, host name, and priority in that order.
3367 ** a -- the first argument.
3368 ** b -- the second argument.
3385 if (a->w_lock != b->w_lock)
3386 return a->w_lock - b->w_lock;
3389 if (a->w_host != NULL && b->w_host == NULL)
3391 else if (a->w_host == NULL && b->w_host != NULL)
3393 if (a->w_host != NULL && b->w_host != NULL &&
3394 (i = sm_strshufflecmp(a->w_host, b->w_host)) != 0)
3398 return workcmpf0(a, b);
3400 #endif /* _FFR_RHS */
3402 ** STRREV -- reverse string
3404 ** Returns a pointer to a new string that is the reverse of
3405 ** the string pointed to by fwd. The space for the new
3406 ** string is obtained using xalloc().
3409 ** fwd -- the string to reverse.
3412 ** the reversed string.
3423 rev = xalloc(len + 1);
3424 for (cnt = 0; cnt < len; ++cnt)
3425 rev[cnt] = fwd[len - cnt - 1];
3435 static unsigned char ShuffledAlphabet[NCHAR];
3438 init_shuffle_alphabet()
3440 static bool init = false;
3446 /* fill the ShuffledAlphabet */
3447 for (i = 0; i < NASCII; i++)
3448 ShuffledAlphabet[i] = i;
3451 for (i = 1; i < NASCII; i++)
3453 register int j = get_random() % NASCII;
3456 tmp = ShuffledAlphabet[j];
3457 ShuffledAlphabet[j] = ShuffledAlphabet[i];
3458 ShuffledAlphabet[i] = tmp;
3461 /* make it case insensitive */
3462 for (i = 'A'; i <= 'Z'; i++)
3463 ShuffledAlphabet[i] = ShuffledAlphabet[i + 'a' - 'A'];
3465 /* fill the upper part */
3466 for (i = 0; i < NASCII; i++)
3467 ShuffledAlphabet[i + NASCII] = ShuffledAlphabet[i];
3472 sm_strshufflecmp(a, b)
3476 const unsigned char *us1 = (const unsigned char *) a;
3477 const unsigned char *us2 = (const unsigned char *) b;
3479 while (ShuffledAlphabet[*us1] == ShuffledAlphabet[*us2++])
3484 return (ShuffledAlphabet[*us1] - ShuffledAlphabet[*--us2]);
3486 #endif /* _FFR_RHS */
3489 ** DOWORK -- do a work request.
3492 ** qgrp -- the index of the queue group for the job.
3493 ** qdir -- the index of the queue directory for the job.
3494 ** id -- the ID of the job to run.
3495 ** forkflag -- if set, run this in background.
3496 ** requeueflag -- if set, reinstantiate the queue quickly.
3497 ** This is used when expanding aliases in the queue.
3498 ** If forkflag is also set, it doesn't wait for the
3500 ** e - the envelope in which to run it.
3503 ** process id of process that is running the queue job.
3506 ** The work request is satisfied if possible.
3510 dowork(qgrp, qdir, id, forkflag, requeueflag, e)
3516 register ENVELOPE *e;
3522 sm_dprintf("dowork(%s/%s)\n", qid_printqueue(qgrp, qdir), id);
3531 ** Since the delivery may happen in a child and the
3532 ** parent does not wait, the parent may close the
3533 ** maps thereby removing any shared memory used by
3534 ** the map. Therefore, close the maps now so the
3535 ** child will dynamically open them if necessary.
3543 syserr("dowork: cannot fork");
3548 /* parent -- clean out connection cache */
3549 mci_flush(false, NULL);
3554 ** Initialize exception stack and default exception
3555 ** handler for child process.
3558 /* Reset global flags */
3559 RestartRequest = NULL;
3560 RestartWorkGroup = false;
3561 ShutdownRequest = NULL;
3563 CurrentPid = getpid();
3564 sm_exc_newthread(fatal_error);
3567 ** See note above about SMTP processes and SIGCHLD.
3570 if (OpMode == MD_SMTP ||
3571 OpMode == MD_DAEMON ||
3572 MaxQueueChildren > 0)
3575 sm_releasesignal(SIGCHLD);
3576 (void) sm_signal(SIGCHLD, SIG_DFL);
3579 /* child -- error messages to the transcript */
3580 QuickAbort = OnlyOneError = false;
3592 ** Lock the control file to avoid duplicate deliveries.
3593 ** Then run the file as though we had just read it.
3594 ** We save an idea of the temporary name so we
3595 ** can recover on interrupt.
3600 /* Reset global flags */
3601 RestartRequest = NULL;
3602 RestartWorkGroup = false;
3603 ShutdownRequest = NULL;
3607 /* set basic modes, etc. */
3610 rpool = sm_rpool_new_x(NULL);
3611 clearenvelope(e, false, rpool);
3612 e->e_flags |= EF_QUEUERUN|EF_GLOBALERRS;
3613 set_delivery_mode(SM_DELIVER, e);
3614 e->e_errormode = EM_MAIL;
3618 GrabTo = UseErrorsTo = false;
3623 set_op_mode(MD_QUEUERUN);
3625 sm_setproctitle(true, e, "%s from queue", qid_printname(e));
3627 sm_syslog(LOG_DEBUG, e->e_id, "dowork, pid=%d",
3630 /* don't use the headers from sendmail.cf... */
3633 /* read the queue control file -- return if locked */
3634 if (!readqf(e, false))
3636 if (tTd(40, 4) && e->e_id != NULL)
3637 sm_dprintf("readqf(%s) failed\n",
3641 finis(false, true, EX_OK);
3644 /* adding this frees 8 bytes */
3645 clearenvelope(e, false, rpool);
3647 /* adding this frees 12 bytes */
3648 sm_rpool_free(rpool);
3654 e->e_flags |= EF_INQUEUE;
3655 eatheader(e, requeueflag, true);
3658 queueup(e, false, false);
3660 /* do the delivery */
3661 sendall(e, SM_DELIVER);
3663 /* finish up and exit */
3665 finis(true, true, ExitStat);
3668 dropenvelope(e, true, false);
3669 sm_rpool_free(rpool);
3678 ** DOWORKLIST -- process a list of envelopes as work requests
3680 ** Similar to dowork(), except that after forking, it processes an
3681 ** envelope and its siblings, treating each envelope as a work request.
3684 ** el -- envelope to be processed including its siblings.
3685 ** forkflag -- if set, run this in background.
3686 ** requeueflag -- if set, reinstantiate the queue quickly.
3687 ** This is used when expanding aliases in the queue.
3688 ** If forkflag is also set, it doesn't wait for the
3692 ** process id of process that is running the queue job.
3695 ** The work request is satisfied if possible.
3699 doworklist(el, forkflag, requeueflag)
3708 sm_dprintf("doworklist()\n");
3717 ** Since the delivery may happen in a child and the
3718 ** parent does not wait, the parent may close the
3719 ** maps thereby removing any shared memory used by
3720 ** the map. Therefore, close the maps now so the
3721 ** child will dynamically open them if necessary.
3729 syserr("doworklist: cannot fork");
3734 /* parent -- clean out connection cache */
3735 mci_flush(false, NULL);
3740 ** Initialize exception stack and default exception
3741 ** handler for child process.
3744 /* Reset global flags */
3745 RestartRequest = NULL;
3746 RestartWorkGroup = false;
3747 ShutdownRequest = NULL;
3749 CurrentPid = getpid();
3750 sm_exc_newthread(fatal_error);
3753 ** See note above about SMTP processes and SIGCHLD.
3756 if (OpMode == MD_SMTP ||
3757 OpMode == MD_DAEMON ||
3758 MaxQueueChildren > 0)
3761 sm_releasesignal(SIGCHLD);
3762 (void) sm_signal(SIGCHLD, SIG_DFL);
3765 /* child -- error messages to the transcript */
3766 QuickAbort = OnlyOneError = false;
3779 ** Lock the control file to avoid duplicate deliveries.
3780 ** Then run the file as though we had just read it.
3781 ** We save an idea of the temporary name so we
3782 ** can recover on interrupt.
3787 /* Reset global flags */
3788 RestartRequest = NULL;
3789 RestartWorkGroup = false;
3790 ShutdownRequest = NULL;
3794 /* set basic modes, etc. */
3797 GrabTo = UseErrorsTo = false;
3802 set_op_mode(MD_QUEUERUN);
3805 sm_syslog(LOG_DEBUG, el->e_id, "doworklist, pid=%d",
3808 for (ei = el; ei != NULL; ei = ei->e_sibling)
3813 if (WILL_BE_QUEUED(ei->e_sendmode))
3815 else if (QueueMode != QM_QUARANTINE &&
3816 ei->e_quarmsg != NULL)
3819 rpool = sm_rpool_new_x(NULL);
3820 clearenvelope(&e, true, rpool);
3821 e.e_flags |= EF_QUEUERUN|EF_GLOBALERRS;
3822 set_delivery_mode(SM_DELIVER, &e);
3823 e.e_errormode = EM_MAIL;
3825 e.e_qgrp = ei->e_qgrp;
3826 e.e_qdir = ei->e_qdir;
3828 sm_setproctitle(true, &e, "%s from queue", qid_printname(&e));
3830 /* don't use the headers from sendmail.cf... */
3834 /* read the queue control file -- return if locked */
3835 if (readqf(&e, false))
3837 e.e_flags |= EF_INQUEUE;
3838 eatheader(&e, requeueflag, true);
3841 queueup(&e, false, false);
3843 /* do the delivery */
3844 sendall(&e, SM_DELIVER);
3845 dropenvelope(&e, true, false);
3849 if (tTd(40, 4) && e.e_id != NULL)
3850 sm_dprintf("readqf(%s) failed\n",
3853 sm_rpool_free(rpool);
3857 /* restore CurEnv */
3860 /* finish up and exit */
3862 finis(true, true, ExitStat);
3866 ** READQF -- read queue file and set up environment.
3869 ** e -- the envelope of the job to run.
3870 ** openonly -- only open the qf (returned as e_lockfp)
3873 ** true if it successfully read the queue file.
3877 ** The queue file is returned locked.
3882 register ENVELOPE *e;
3885 register SM_FILE_T *qfp;
3887 struct stat st, stf;
3894 bool nomore = false;
3898 char qf[MAXPATHLEN];
3902 ** Read and process the file.
3906 (void) sm_strlcpy(qf, queuename(e, ANYQFL_LETTER), sizeof qf);
3907 qfp = sm_io_open(SmFtStdio, SM_TIME_DEFAULT, qf, SM_IO_RDWR_B, NULL);
3910 int save_errno = errno;
3913 sm_dprintf("readqf(%s): sm_io_open failure (%s)\n",
3914 qf, sm_errstring(errno));
3918 syserr("readqf: no control file %s", qf);
3923 if (!lockfile(sm_io_getinfo(qfp, SM_IO_WHAT_FD, NULL), qf, NULL,
3926 /* being processed by another queuer */
3928 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
3929 "%s: locked\n", e->e_id);
3931 sm_dprintf("%s: locked\n", e->e_id);
3933 sm_syslog(LOG_DEBUG, e->e_id, "locked");
3934 (void) sm_io_close(qfp, SM_TIME_DEFAULT);
3942 ** Prevent locking race condition.
3944 ** Process A: readqf(): qfp = fopen(qffile)
3945 ** Process B: queueup(): rename(tf, qf)
3946 ** Process B: unlocks(tf)
3947 ** Process A: lockfile(qf);
3949 ** Process A (us) has the old qf file (before the rename deleted
3950 ** the directory entry) and will be delivering based on old data.
3951 ** This can lead to multiple deliveries of the same recipients.
3953 ** Catch this by checking if the underlying qf file has changed
3954 ** *after* acquiring our lock and if so, act as though the file
3955 ** was still locked (i.e., just return like the lockfile() case
3959 if (stat(qf, &stf) < 0 ||
3960 fstat(sm_io_getinfo(qfp, SM_IO_WHAT_FD, NULL), &st) < 0)
3962 /* must have been being processed by someone else */
3964 sm_dprintf("readqf(%s): [f]stat failure (%s)\n",
3965 qf, sm_errstring(errno));
3966 (void) sm_io_close(qfp, SM_TIME_DEFAULT);
3970 if (st.st_nlink != stf.st_nlink ||
3971 st.st_dev != stf.st_dev ||
3972 ST_INODE(st) != ST_INODE(stf) ||
3973 #if HAS_ST_GEN && 0 /* AFS returns garbage in st_gen */
3974 st.st_gen != stf.st_gen ||
3975 #endif /* HAS_ST_GEN && 0 */
3976 st.st_uid != stf.st_uid ||
3977 st.st_gid != stf.st_gid ||
3978 st.st_size != stf.st_size)
3980 /* changed after opened */
3982 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
3983 "%s: changed\n", e->e_id);
3985 sm_dprintf("%s: changed\n", e->e_id);
3987 sm_syslog(LOG_DEBUG, e->e_id, "changed");
3988 (void) sm_io_close(qfp, SM_TIME_DEFAULT);
3993 ** Check the queue file for plausibility to avoid attacks.
3996 qsafe = S_IWOTH|S_IWGRP;
3997 if (bitset(S_IWGRP, QueueFileMode))
4000 bogus = st.st_uid != geteuid() &&
4001 st.st_uid != TrustedUid &&
4002 geteuid() != RealUid;
4005 ** If this qf file results from a set-group-ID binary, then
4006 ** we check whether the directory is group-writable,
4007 ** the queue file mode contains the group-writable bit, and
4008 ** the groups are the same.
4009 ** Notice: this requires that the set-group-ID binary is used to
4013 if (bogus && st.st_gid == getegid() && UseMSP)
4018 bp = SM_LAST_DIR_DELIM(qf);
4026 if (stat(delim == '\0' ? "." : qf, &dst) < 0)
4027 syserr("readqf: cannot stat directory %s",
4028 delim == '\0' ? "." : qf);
4031 bogus = !(bitset(S_IWGRP, QueueFileMode) &&
4032 bitset(S_IWGRP, dst.st_mode) &&
4033 dst.st_gid == st.st_gid);
4040 bogus = bitset(qsafe, st.st_mode);
4045 sm_syslog(LOG_ALERT, e->e_id,
4046 "bogus queue file, uid=%d, gid=%d, mode=%o",
4047 st.st_uid, st.st_gid, st.st_mode);
4050 sm_dprintf("readqf(%s): bogus file\n", qf);
4051 e->e_flags |= EF_INQUEUE;
4053 loseqfile(e, "bogus file uid/gid in mqueue");
4054 (void) sm_io_close(qfp, SM_TIME_DEFAULT);
4058 if (st.st_size == 0)
4060 /* must be a bogus file -- if also old, just remove it */
4061 if (!openonly && st.st_ctime + 10 * 60 < curtime())
4063 (void) xunlink(queuename(e, DATAFL_LETTER));
4064 (void) xunlink(queuename(e, ANYQFL_LETTER));
4066 (void) sm_io_close(qfp, SM_TIME_DEFAULT);
4070 if (st.st_nlink == 0)
4073 ** Race condition -- we got a file just as it was being
4074 ** unlinked. Just assume it is zero length.
4077 (void) sm_io_close(qfp, SM_TIME_DEFAULT);
4083 ** If we don't own the file mark it as unsafe.
4084 ** However, allow TrustedUser to own it as well
4085 ** in case TrustedUser manipulates the queue.
4088 if (st.st_uid != geteuid() && st.st_uid != TrustedUid)
4089 e->e_flags |= EF_UNSAFE;
4090 #else /* _FFR_TRUSTED_QF */
4091 /* If we don't own the file mark it as unsafe */
4092 if (st.st_uid != geteuid())
4093 e->e_flags |= EF_UNSAFE;
4094 #endif /* _FFR_TRUSTED_QF */
4096 /* good file -- save this lock */
4099 /* Just wanted the open file */
4103 /* do basic system initialization */
4105 macdefine(&e->e_macro, A_PERM, 'i', e->e_id);
4108 e->e_flags |= EF_GLOBALERRS;
4109 set_op_mode(MD_QUEUERUN);
4111 e->e_qfletter = queue_letter(e, ANYQFL_LETTER);
4112 e->e_dfqgrp = e->e_qgrp;
4113 e->e_dfqdir = e->e_qdir;
4114 #if _FFR_QUEUE_MACRO
4115 macdefine(&e->e_macro, A_TEMP, macid("{queue}"),
4116 qid_printqueue(e->e_qgrp, e->e_qdir));
4117 #endif /* _FFR_QUEUE_MACRO */
4120 while ((bp = fgetfolded(buf, sizeof buf, qfp)) != NULL)
4122 unsigned long qflags;
4129 sm_dprintf("+++++ %s\n", bp);
4134 syserr("SECURITY ALERT: extra or bogus data in queue file: %s",
4136 err = "bogus queue line";
4141 case 'A': /* AUTH= parameter */
4142 if (!xtextok(&bp[1]))
4144 e->e_auth_param = sm_rpool_strdup_x(e->e_rpool, &bp[1]);
4147 case 'B': /* body type */
4148 r = check_bodytype(&bp[1]);
4149 if (!BODYTYPE_VALID(r))
4151 e->e_bodytype = sm_rpool_strdup_x(e->e_rpool, &bp[1]);
4154 case 'C': /* specify controlling user */
4155 ctladdr = setctluser(&bp[1], qfver, e);
4158 case 'D': /* data file name */
4159 /* obsolete -- ignore */
4162 case 'd': /* data file directory name */
4166 #if _FFR_MSP_PARANOIA
4167 /* forbid queue groups in MSP? */
4170 #endif /* _FFR_MSP_PARANOIA */
4172 qgrp < NumQueue && Queue[qgrp] != NULL;
4176 qdir < Queue[qgrp]->qg_numqueues;
4180 Queue[qgrp]->qg_qpaths[qdir].qp_name)
4189 err = "bogus queue file directory";
4195 case 'E': /* specify error recipient */
4196 /* no longer used */
4199 case 'F': /* flag bits */
4200 if (strncmp(bp, "From ", 5) == 0)
4202 /* we are being spoofed! */
4203 syserr("SECURITY ALERT: bogus qf line %s", bp);
4204 err = "bogus queue line";
4207 for (p = &bp[1]; *p != '\0'; p++)
4211 case '8': /* has 8 bit data */
4212 e->e_flags |= EF_HAS8BIT;
4215 case 'b': /* delete Bcc: header */
4216 e->e_flags |= EF_DELETE_BCC;
4219 case 'd': /* envelope has DSN RET= */
4220 e->e_flags |= EF_RET_PARAM;
4223 case 'n': /* don't return body */
4224 e->e_flags |= EF_NO_BODY_RETN;
4227 case 'r': /* response */
4228 e->e_flags |= EF_RESPONSE;
4231 case 's': /* split */
4232 e->e_flags |= EF_SPLIT;
4235 case 'w': /* warning sent */
4236 e->e_flags |= EF_WARNING;
4242 case 'q': /* quarantine reason */
4243 e->e_quarmsg = sm_rpool_strdup_x(e->e_rpool, &bp[1]);
4244 macdefine(&e->e_macro, A_PERM,
4245 macid("{quarantine}"), e->e_quarmsg);
4248 case 'H': /* header */
4251 ** count size before chompheader() destroys the line.
4252 ** this isn't accurate due to macro expansion, but
4253 ** better than before. "-3" to skip H?? at least.
4256 hdrsize += strlen(bp) - 3;
4257 (void) chompheader(&bp[1], CHHDR_QUEUE, NULL, e);
4260 case 'I': /* data file's inode number */
4261 /* regenerated below */
4264 case 'K': /* time of last delivery attempt */
4265 e->e_dtime = atol(&buf[1]);
4268 case 'L': /* Solaris Content-Length: */
4269 case 'M': /* message */
4270 /* ignore this; we want a new message next time */
4273 case 'N': /* number of delivery attempts */
4274 e->e_ntries = atoi(&buf[1]);
4276 /* if this has been tried recently, let it be */
4278 if (e->e_ntries > 0 && e->e_dtime <= now &&
4279 now < e->e_dtime + MinQueueAge)
4283 howlong = pintvl(now - e->e_dtime, true);
4285 (void) sm_io_fprintf(smioout,
4287 "%s: too young (%s)\n",
4290 sm_dprintf("%s: too young (%s)\n",
4293 sm_syslog(LOG_DEBUG, e->e_id,
4300 macdefine(&e->e_macro, A_TEMP,
4301 macid("{ntries}"), &buf[1]);
4304 /* adjust BIND parameters immediately */
4305 if (e->e_ntries == 0)
4307 _res.retry = TimeOuts.res_retry[RES_TO_FIRST];
4308 _res.retrans = TimeOuts.res_retrans[RES_TO_FIRST];
4312 _res.retry = TimeOuts.res_retry[RES_TO_NORMAL];
4313 _res.retrans = TimeOuts.res_retrans[RES_TO_NORMAL];
4315 #endif /* NAMED_BIND */
4318 case 'P': /* message priority */
4319 e->e_msgpriority = atol(&bp[1]) + WkTimeFact;
4322 case 'Q': /* original recipient */
4323 orcpt = sm_rpool_strdup_x(e->e_rpool, &bp[1]);
4326 case 'r': /* final recipient */
4327 frcpt = sm_rpool_strdup_x(e->e_rpool, &bp[1]);
4330 case 'R': /* specify recipient */
4336 while (*++p != '\0' && *p != ':')
4341 qflags |= QHASNOTIFY;
4345 qflags |= QPINGONSUCCESS;
4349 qflags |= QPINGONFAILURE;
4353 qflags |= QPINGONDELAY;
4361 if (ctladdr != NULL)
4362 ctladdr->q_flags |= QALIAS;
4365 default: /* ignore or complain? */
4372 macdefine(&e->e_macro, A_PERM, macid("{addr_type}"),
4375 q = parseaddr(++p, NULLADDR, RF_COPYALL, '\0',
4381 /* make sure we keep the current qgrp */
4382 if (ISVALIDQGRP(e->e_qgrp))
4383 q->q_qgrp = e->e_qgrp;
4384 q->q_alias = ctladdr;
4386 q->q_flags &= ~Q_PINGFLAGS;
4387 q->q_flags |= qflags;
4388 q->q_finalrcpt = frcpt;
4390 (void) recipient(q, &e->e_sendqueue, 0, e);
4394 macdefine(&e->e_macro, A_PERM, macid("{addr_type}"),
4398 case 'S': /* sender */
4399 setsender(sm_rpool_strdup_x(e->e_rpool, &bp[1]),
4400 e, NULL, '\0', true);
4403 case 'T': /* init time */
4404 e->e_ctime = atol(&bp[1]);
4407 case 'V': /* queue file version number */
4408 qfver = atoi(&bp[1]);
4409 if (qfver <= QF_VERSION)
4411 syserr("Version number in queue file (%d) greater than max (%d)",
4413 err = "unsupported queue file version";
4418 case 'Z': /* original envelope id from ESMTP */
4419 e->e_envid = sm_rpool_strdup_x(e->e_rpool, &bp[1]);
4420 macdefine(&e->e_macro, A_PERM,
4421 macid("{dsn_envid}"), e->e_envid);
4424 case '!': /* deliver by */
4426 /* format: flag (1 char) space long-integer */
4427 e->e_dlvr_flag = buf[1];
4428 e->e_deliver_by = strtol(&buf[3], NULL, 10);
4430 case '$': /* define macro */
4434 /* XXX elimate p? */
4435 r = macid_parse(&bp[1], &ep);
4438 p = sm_rpool_strdup_x(e->e_rpool, ep);
4439 macdefine(&e->e_macro, A_PERM, r, p);
4443 case '.': /* terminate file */
4452 ** Maintain backward compatibility for
4453 ** users who defined _FFR_QUEUEDELAY in
4454 ** previous releases. Remove this
4455 ** code in 8.14 or 8.15.
4458 if (qfver == 5 || qfver == 7)
4461 /* If not qfver 5 or 7, then 'G' or 'Y' is invalid */
4463 #endif /* _FFR_QUEUEDELAY */
4466 syserr("readqf: %s: line %d: bad line \"%s\"",
4467 qf, LineNumber, shortenstring(bp, MAXSHORTSTR));
4468 err = "unrecognized line";
4474 sm_free(bp); /* XXX */
4480 ** If we haven't read any lines, this queue file is empty.
4481 ** Arrange to remove it without referencing any null pointers.
4484 if (LineNumber == 0)
4487 e->e_flags |= EF_CLRQUEUE|EF_FATALERRS|EF_RESPONSE;
4491 /* Check to make sure we have a complete queue file read */
4494 syserr("readqf: %s: incomplete queue file read", qf);
4495 (void) sm_io_close(qfp, SM_TIME_DEFAULT);
4499 /* possibly set ${dsn_ret} macro */
4500 if (bitset(EF_RET_PARAM, e->e_flags))
4502 if (bitset(EF_NO_BODY_RETN, e->e_flags))
4503 macdefine(&e->e_macro, A_PERM,
4504 macid("{dsn_ret}"), "hdrs");
4506 macdefine(&e->e_macro, A_PERM,
4507 macid("{dsn_ret}"), "full");
4511 ** Arrange to read the data file.
4514 p = queuename(e, DATAFL_LETTER);
4515 e->e_dfp = sm_io_open(SmFtStdio, SM_TIME_DEFAULT, p, SM_IO_RDONLY_B,
4517 if (e->e_dfp == NULL)
4519 syserr("readqf: cannot open %s", p);
4523 e->e_flags |= EF_HAS_DF;
4524 if (fstat(sm_io_getinfo(e->e_dfp, SM_IO_WHAT_FD, NULL), &st)
4527 e->e_msgsize = st.st_size + hdrsize;
4528 e->e_dfdev = st.st_dev;
4529 e->e_dfino = ST_INODE(st);
4530 (void) sm_snprintf(buf, sizeof buf, "%ld",
4532 macdefine(&e->e_macro, A_TEMP, macid("{msg_size}"),
4541 ** There was some error reading the qf file (reason is in err var.)
4543 ** close file; clear e_lockfp since it is the same as qfp,
4544 ** hence it is invalid (as file) after qfp is closed;
4545 ** the qf file is on disk, so set the flag to avoid calling
4546 ** queueup() with bogus data.
4549 if (bp != NULL && bp != buf)
4551 sm_free(bp); /* XXX */
4555 (void) sm_io_close(qfp, SM_TIME_DEFAULT);
4557 e->e_flags |= EF_INQUEUE;
4562 ** PRTSTR -- print a string, "unprintable" characters are shown as \oct
4565 ** s -- string to print
4566 ** ml -- maximum length of output
4569 ** number of entries
4572 ** Prints a string on stdout.
4584 while (ml-- > 0 && ((c = *s++) != '\0'))
4590 (void) sm_io_putc(smioout, SM_TIME_DEFAULT, c);
4591 (void) sm_io_putc(smioout, SM_TIME_DEFAULT, c);
4594 else if (isascii(c) && isprint(c))
4595 (void) sm_io_putc(smioout, SM_TIME_DEFAULT, c);
4599 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
4600 "\\%03o", c & 0xFF);
4605 ** PRINTNQE -- print out number of entries in the mail queue
4608 ** out -- output file pointer.
4609 ** prefix -- string to output in front of each line.
4616 printnqe(out, prefix)
4621 int i, k = 0, nrequests = 0;
4622 bool unknown = false;
4624 if (ShmId == SM_SHM_NO_ID)
4627 (void) sm_io_fprintf(out, SM_TIME_DEFAULT,
4628 "Data unavailable: shared memory not updated\n");
4630 (void) sm_io_fprintf(out, SM_TIME_DEFAULT,
4631 "%sNOTCONFIGURED:-1\r\n", prefix);
4634 for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
4639 for (j = 0; j < Queue[i]->qg_numqueues; j++)
4646 n = QSHM_ENTRIES(Queue[i]->qg_qpaths[j].qp_idx);
4648 (void) sm_io_fprintf(out, SM_TIME_DEFAULT,
4650 prefix, qid_printqueue(i, j), n);
4653 (void) sm_io_fprintf(out, SM_TIME_DEFAULT,
4654 "%s: unknown number of entries\n",
4655 qid_printqueue(i, j));
4660 (void) sm_io_fprintf(out, SM_TIME_DEFAULT,
4662 qid_printqueue(i, j));
4666 (void) sm_io_fprintf(out, SM_TIME_DEFAULT,
4668 qid_printqueue(i, j), n);
4674 if (prefix == NULL && k > 1)
4675 (void) sm_io_fprintf(out, SM_TIME_DEFAULT,
4676 "\t\tTotal requests: %d%s\n",
4677 nrequests, unknown ? " (about)" : "");
4678 #else /* SM_CONF_SHM */
4680 (void) sm_io_fprintf(out, SM_TIME_DEFAULT,
4681 "Data unavailable without shared memory support\n");
4683 (void) sm_io_fprintf(out, SM_TIME_DEFAULT,
4684 "%sNOTAVAILABLE:-1\r\n", prefix);
4685 #endif /* SM_CONF_SHM */
4688 ** PRINTQUEUE -- print out a representation of the mail queue
4697 ** Prints a listing of the mail queue on the standard output.
4703 int i, k = 0, nrequests = 0;
4705 for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
4710 for (j = 0; j < Queue[i]->qg_numqueues; j++)
4714 nrequests += print_single_queue(i, j);
4719 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
4720 "\t\tTotal requests: %d\n",
4724 ** PRINT_SINGLE_QUEUE -- print out a representation of a single mail queue
4727 ** qgrp -- the index of the queue group.
4728 ** qdir -- the queue directory.
4731 ** number of requests in mail queue.
4734 ** Prints a listing of the mail queue on the standard output.
4738 print_single_queue(qgrp, qdir)
4745 char qd[MAXPATHLEN];
4746 char qddf[MAXPATHLEN];
4751 (void) sm_strlcpy(qd, ".", sizeof qd);
4752 (void) sm_strlcpy(qddf, ".", sizeof qddf);
4756 (void) sm_strlcpyn(qd, sizeof qd, 2,
4757 Queue[qgrp]->qg_qpaths[qdir].qp_name,
4759 Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
4761 (void) sm_strlcpyn(qddf, sizeof qddf, 2,
4762 Queue[qgrp]->qg_qpaths[qdir].qp_name,
4764 Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
4769 ** Check for permission to print the queue
4772 if (bitset(PRIV_RESTRICTMAILQ, PrivacyFlags) && RealUid != 0)
4777 extern GIDSET_T InitialGidSet[NGROUPS_MAX];
4778 #endif /* NGROUPS_MAX */
4780 if (stat(qd, &st) < 0)
4782 syserr("Cannot stat %s",
4783 qid_printqueue(qgrp, qdir));
4790 if (InitialGidSet[n] == st.st_gid)
4793 if (n < 0 && RealGid != st.st_gid)
4794 #else /* NGROUPS_MAX */
4795 if (RealGid != st.st_gid)
4796 #endif /* NGROUPS_MAX */
4798 usrerr("510 You are not permitted to see the queue");
4805 ** Read and order the queue.
4808 nrequests = gatherq(qgrp, qdir, true, NULL, NULL);
4809 (void) sortq(Queue[qgrp]->qg_maxlist);
4812 ** Print the work list that we have read.
4815 /* first see if there is anything */
4818 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT, "%s is empty\n",
4819 qid_printqueue(qgrp, qdir));
4823 sm_getla(); /* get load average */
4825 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT, "\t\t%s (%d request%s",
4826 qid_printqueue(qgrp, qdir),
4827 nrequests, nrequests == 1 ? "" : "s");
4828 if (MaxQueueRun > 0 && nrequests > MaxQueueRun)
4829 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
4830 ", only %d printed", MaxQueueRun);
4832 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
4833 ")\n-----Q-ID----- --Size-- -Priority- ---Q-Time--- --------Sender/Recipient--------\n");
4835 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
4836 ")\n-----Q-ID----- --Size-- -----Q-Time----- ------------Sender/Recipient-----------\n");
4837 for (w = WorkQ; w != NULL; w = w->w_next)
4840 auto time_t submittime = 0;
4844 char quarmsg[MAXLINE];
4845 char statmsg[MAXLINE];
4846 char bodytype[MAXNAME + 1];
4847 char qf[MAXPATHLEN];
4852 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT, "%13s",
4854 (void) sm_strlcpyn(qf, sizeof qf, 3, qd, "/", w->w_name);
4855 f = sm_io_open(SmFtStdio, SM_TIME_DEFAULT, qf, SM_IO_RDONLY_B,
4860 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
4861 " (permission denied)\n");
4862 else if (errno == ENOENT)
4863 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
4864 " (job completed)\n");
4866 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
4868 sm_errstring(errno));
4872 w->w_name[0] = DATAFL_LETTER;
4873 (void) sm_strlcpyn(qf, sizeof qf, 3, qddf, "/", w->w_name);
4874 if (stat(qf, &st) >= 0)
4875 dfsize = st.st_size;
4881 ** Maybe the df file can't be statted because
4882 ** it is in a different directory than the qf file.
4883 ** In order to find out, we must read the qf file.
4886 newenvelope(&e, &BlankEnvelope, sm_rpool_new_x(NULL));
4887 e.e_id = w->w_name + 2;
4891 if (readqf(&e, false))
4893 char *df = queuename(&e, DATAFL_LETTER);
4894 if (stat(df, &st) >= 0)
4895 dfsize = st.st_size;
4897 if (e.e_lockfp != NULL)
4899 (void) sm_io_close(e.e_lockfp, SM_TIME_DEFAULT);
4902 clearenvelope(&e, false, e.e_rpool);
4903 sm_rpool_free(e.e_rpool);
4906 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT, "*");
4907 else if (QueueMode == QM_LOST)
4908 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT, "?");
4909 else if (w->w_tooyoung)
4910 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT, "-");
4911 else if (shouldqueue(w->w_pri, w->w_ctime))
4912 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT, "X");
4914 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT, " ");
4919 statmsg[0] = bodytype[0] = '\0';
4921 while (sm_io_fgets(f, SM_TIME_DEFAULT, buf, sizeof buf) != NULL)
4932 case 'V': /* queue file version */
4933 qfver = atoi(&buf[1]);
4936 case 'M': /* error message */
4937 if ((i = strlen(&buf[1])) >= sizeof statmsg)
4938 i = sizeof statmsg - 1;
4939 memmove(statmsg, &buf[1], i);
4943 case 'q': /* quarantine reason */
4944 if ((i = strlen(&buf[1])) >= sizeof quarmsg)
4945 i = sizeof quarmsg - 1;
4946 memmove(quarmsg, &buf[1], i);
4950 case 'B': /* body type */
4951 if ((i = strlen(&buf[1])) >= sizeof bodytype)
4952 i = sizeof bodytype - 1;
4953 memmove(bodytype, &buf[1], i);
4957 case 'S': /* sender name */
4960 (void) sm_io_fprintf(smioout,
4962 "%8ld %10ld%c%.12s ",
4965 bitset(EF_WARNING, flags)
4967 ctime(&submittime) + 4);
4968 prtstr(&buf[1], 78);
4972 (void) sm_io_fprintf(smioout,
4976 ctime(&submittime));
4977 prtstr(&buf[1], 39);
4980 if (quarmsg[0] != '\0')
4982 (void) sm_io_fprintf(smioout,
4984 "\n QUARANTINE: %.*s",
4990 if (statmsg[0] != '\0' || bodytype[0] != '\0')
4992 (void) sm_io_fprintf(smioout,
4996 if (statmsg[0] != '\0')
4997 (void) sm_io_fprintf(smioout,
5006 case 'C': /* controlling user */
5008 (void) sm_io_fprintf(smioout,
5010 "\n\t\t\t\t\t\t(---%.64s---)",
5014 case 'R': /* recipient name */
5025 (void) sm_io_fprintf(smioout,
5032 (void) sm_io_fprintf(smioout,
5037 if (Verbose && statmsg[0] != '\0')
5039 (void) sm_io_fprintf(smioout,
5047 case 'T': /* creation time */
5048 submittime = atol(&buf[1]);
5051 case 'F': /* flag bits */
5052 for (p = &buf[1]; *p != '\0'; p++)
5057 flags |= EF_WARNING;
5063 if (submittime == (time_t) 0)
5064 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
5065 " (no control file)");
5066 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT, "\n");
5067 (void) sm_io_close(f, SM_TIME_DEFAULT);
5073 ** QUEUE_LETTER -- get the proper queue letter for the current QueueMode.
5076 ** e -- envelope to build it in/from.
5077 ** type -- the file type, used as the first character
5078 ** of the file name.
5081 ** the letter to use
5085 queue_letter(e, type)
5089 /* Change type according to QueueMode */
5090 if (type == ANYQFL_LETTER)
5092 if (e->e_quarmsg != NULL)
5093 type = QUARQF_LETTER;
5099 type = NORMQF_LETTER;
5103 type = QUARQF_LETTER;
5107 type = LOSEQF_LETTER;
5111 /* should never happen */
5121 ** QUEUENAME -- build a file name in the queue directory for this envelope.
5124 ** e -- envelope to build it in/from.
5125 ** type -- the file type, used as the first character
5126 ** of the file name.
5129 ** a pointer to the queue name (in a static buffer).
5132 ** If no id code is already assigned, queuename() will
5133 ** assign an id code with assign_queueid(). If no queue
5134 ** directory is assigned, one will be set with setnewqueue().
5139 register ENVELOPE *e;
5145 static char buf[MAXPATHLEN];
5147 /* Assign an ID if needed */
5148 if (e->e_id == NULL)
5150 type = queue_letter(e, type);
5152 /* begin of filename */
5153 pref[0] = (char) type;
5157 /* Assign a queue group/directory if needed */
5158 if (type == XSCRPT_LETTER)
5161 ** We don't want to call setnewqueue() if we are fetching
5162 ** the pathname of the transcript file, because setnewqueue
5163 ** chooses a queue, and sometimes we need to write to the
5164 ** transcript file before we have gathered enough information
5165 ** to choose a queue.
5168 if (e->e_xfqgrp == NOQGRP || e->e_xfqdir == NOQDIR)
5170 if (e->e_qgrp != NOQGRP && e->e_qdir != NOQDIR)
5172 e->e_xfqgrp = e->e_qgrp;
5173 e->e_xfqdir = e->e_qdir;
5178 if (Queue[e->e_xfqgrp]->qg_numqueues <= 1)
5182 e->e_xfqdir = get_rand_mod(
5183 Queue[e->e_xfqgrp]->qg_numqueues);
5192 if (e->e_qgrp == NOQGRP || e->e_qdir == NOQDIR)
5193 (void) setnewqueue(e);
5194 if (type == DATAFL_LETTER)
5206 /* xf files always have a valid qd and qg picked above */
5207 if ((qd == NOQDIR || qg == NOQGRP) && type != XSCRPT_LETTER)
5208 (void) sm_strlcpyn(buf, sizeof buf, 2, pref, e->e_id);
5214 if (bitset(QP_SUBDF, Queue[qg]->qg_qpaths[qd].qp_subdirs))
5223 if (bitset(QP_SUBQF, Queue[qg]->qg_qpaths[qd].qp_subdirs))
5228 if (bitset(QP_SUBXF, Queue[qg]->qg_qpaths[qd].qp_subdirs))
5233 sm_abort("queuename: bad queue file type %d", type);
5236 (void) sm_strlcpyn(buf, sizeof buf, 4,
5237 Queue[qg]->qg_qpaths[qd].qp_name,
5238 sub, pref, e->e_id);
5242 sm_dprintf("queuename: %s\n", buf);
5247 ** INIT_QID_ALG -- Initialize the (static) parameters that are used to
5248 ** generate a queue ID.
5250 ** This function is called by the daemon to reset
5251 ** LastQueueTime and LastQueuePid which are used by assign_queueid().
5252 ** Otherwise the algorithm may cause problems because
5253 ** LastQueueTime and LastQueuePid are set indirectly by main()
5254 ** before the daemon process is started, hence LastQueuePid is not
5255 ** the pid of the daemon and therefore a child of the daemon can
5256 ** actually have the same pid as LastQueuePid which means the section
5257 ** in assign_queueid():
5258 ** * see if we need to get a new base time/pid *
5259 ** is NOT triggered which will cause the same queue id to be generated.
5276 ** ASSIGN_QUEUEID -- assign a queue ID for this envelope.
5278 ** Assigns an id code if one does not already exist.
5279 ** This code assumes that nothing will remain in the queue for
5280 ** longer than 60 years. It is critical that files with the given
5281 ** name do not already exist in the queue.
5282 ** [No longer initializes e_qdir to NOQDIR.]
5285 ** e -- envelope to set it in.
5291 static const char QueueIdChars[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
5293 # define QIC_LEN_R 62
5296 ** Note: the length is "officially" 60 because minutes and seconds are
5297 ** usually only 0-59. However (Linux):
5298 ** tm_sec The number of seconds after the minute, normally in
5299 ** the range 0 to 59, but can be up to 61 to allow for
5301 ** Hence the real length of the string is 62 to take this into account.
5302 ** Alternatively % QIC_LEN can (should) be used for access everywhere.
5305 # define queuenextid() CurrentPid
5310 register ENVELOPE *e;
5312 pid_t pid = queuenextid();
5314 static long random_offset;
5316 char idbuf[MAXQFNAME - 2];
5319 if (e->e_id != NULL)
5322 /* see if we need to get a new base time/pid */
5323 if (cX >= QIC_LEN * QIC_LEN || LastQueueTime == 0 ||
5324 LastQueuePid != pid)
5326 time_t then = LastQueueTime;
5328 /* if the first time through, pick a random offset */
5329 if (LastQueueTime == 0)
5330 random_offset = get_random();
5332 while ((LastQueueTime = curtime()) == then &&
5333 LastQueuePid == pid)
5337 LastQueuePid = queuenextid();
5342 ** Generate a new sequence number between 0 and QIC_LEN*QIC_LEN-1.
5343 ** This lets us generate up to QIC_LEN*QIC_LEN unique queue ids
5344 ** per second, per process. With envelope splitting,
5345 ** a single message can consume many queue ids.
5348 seq = (int)((cX + random_offset) % (QIC_LEN * QIC_LEN));
5351 sm_dprintf("assign_queueid: random_offset = %ld (%d)\n",
5352 random_offset, seq);
5354 tm = gmtime(&LastQueueTime);
5355 idbuf[0] = QueueIdChars[tm->tm_year % QIC_LEN];
5356 idbuf[1] = QueueIdChars[tm->tm_mon];
5357 idbuf[2] = QueueIdChars[tm->tm_mday];
5358 idbuf[3] = QueueIdChars[tm->tm_hour];
5359 idbuf[4] = QueueIdChars[tm->tm_min % QIC_LEN_R];
5360 idbuf[5] = QueueIdChars[tm->tm_sec % QIC_LEN_R];
5361 idbuf[6] = QueueIdChars[seq / QIC_LEN];
5362 idbuf[7] = QueueIdChars[seq % QIC_LEN];
5363 (void) sm_snprintf(&idbuf[8], sizeof idbuf - 8, "%06d",
5364 (int) LastQueuePid);
5365 e->e_id = sm_rpool_strdup_x(e->e_rpool, idbuf);
5366 macdefine(&e->e_macro, A_PERM, 'i', e->e_id);
5368 /* XXX: inherited from MainEnvelope */
5369 e->e_qgrp = NOQGRP; /* too early to do anything else */
5371 e->e_xfqgrp = NOQGRP;
5374 /* New ID means it's not on disk yet */
5375 e->e_qfletter = '\0';
5378 sm_dprintf("assign_queueid: assigned id %s, e=%p\n",
5381 sm_syslog(LOG_DEBUG, e->e_id, "assigned id");
5384 ** SYNC_QUEUE_TIME -- Assure exclusive PID in any given second
5386 ** Make sure one PID can't be used by two processes in any one second.
5388 ** If the system rotates PIDs fast enough, may get the
5389 ** same pid in the same second for two distinct processes.
5390 ** This will interfere with the queue file naming system.
5402 #if FAST_PID_RECYCLE
5403 if (OpMode != MD_TEST &&
5404 OpMode != MD_VERIFY &&
5405 LastQueueTime > 0 &&
5406 LastQueuePid == CurrentPid &&
5407 curtime() == LastQueueTime)
5409 #endif /* FAST_PID_RECYCLE */
5412 ** UNLOCKQUEUE -- unlock the queue entry for a specified envelope
5415 ** e -- the envelope to unlock.
5421 ** unlocks the queue for `e'.
5429 sm_dprintf("unlockqueue(%s)\n",
5430 e->e_id == NULL ? "NOQUEUE" : e->e_id);
5433 /* if there is a lock file in the envelope, close it */
5434 if (e->e_lockfp != NULL)
5435 (void) sm_io_close(e->e_lockfp, SM_TIME_DEFAULT);
5438 /* don't create a queue id if we don't already have one */
5439 if (e->e_id == NULL)
5442 /* remove the transcript */
5444 sm_syslog(LOG_DEBUG, e->e_id, "unlock");
5446 (void) xunlink(queuename(e, XSCRPT_LETTER));
5449 ** SETCTLUSER -- create a controlling address
5451 ** Create a fake "address" given only a local login name; this is
5452 ** used as a "controlling user" for future recipient addresses.
5455 ** user -- the user name of the controlling user.
5456 ** qfver -- the version stamp of this queue file.
5460 ** An address descriptor for the controlling user,
5461 ** using storage allocated from e->e_rpool.
5466 setctluser(user, qfver, e)
5471 register ADDRESS *a;
5476 ** See if this clears our concept of controlling user.
5479 if (user == NULL || *user == '\0')
5483 ** Set up addr fields for controlling user.
5486 a = (ADDRESS *) sm_rpool_malloc_x(e->e_rpool, sizeof *a);
5487 memset((char *) a, '\0', sizeof *a);
5492 a->q_user = sm_rpool_strdup_x(e->e_rpool, p);
5496 p = strtok(user, ":");
5497 a->q_user = sm_rpool_strdup_x(e->e_rpool, user);
5500 if ((p = strtok(NULL, ":")) != NULL)
5502 if ((p = strtok(NULL, ":")) != NULL)
5504 if ((p = strtok(NULL, ":")) != NULL)
5508 a->q_flags |= QGOODUID;
5510 /* if there is another ':': restore it */
5511 if ((o = strtok(NULL, ":")) != NULL && o > p)
5515 else if ((pw = sm_getpwnam(user)) != NULL)
5517 if (*pw->pw_dir == '\0')
5519 else if (strcmp(pw->pw_dir, "/") == 0)
5522 a->q_home = sm_rpool_strdup_x(e->e_rpool, pw->pw_dir);
5523 a->q_uid = pw->pw_uid;
5524 a->q_gid = pw->pw_gid;
5525 a->q_flags |= QGOODUID;
5529 a->q_flags |= QPRIMARY; /* flag as a "ctladdr" */
5530 a->q_mailer = LocalMailer;
5532 a->q_paddr = sm_rpool_strdup_x(e->e_rpool, a->q_user);
5534 a->q_paddr = sm_rpool_strdup_x(e->e_rpool, p);
5538 ** LOSEQFILE -- rename queue file with LOSEQF_LETTER & try to let someone know
5541 ** e -- the envelope (e->e_id will be used).
5542 ** why -- reported to whomever can hear.
5550 register ENVELOPE *e;
5555 char buf[MAXPATHLEN];
5557 if (e == NULL || e->e_id == NULL)
5559 p = queuename(e, ANYQFL_LETTER);
5560 if (sm_strlcpy(buf, p, sizeof buf) >= sizeof buf)
5562 if (!bitset(EF_INQUEUE, e->e_flags))
5563 queueup(e, false, true);
5564 else if (QueueMode == QM_LOST)
5567 /* if already lost, no need to re-lose */
5570 p = queuename(e, LOSEQF_LETTER);
5571 if (rename(buf, p) < 0)
5572 syserr("cannot rename(%s, %s), uid=%d",
5573 buf, p, (int) geteuid());
5574 else if (LogLevel > 0)
5575 sm_syslog(LOG_ALERT, e->e_id,
5576 "Losing %s: %s", buf, why);
5578 if (e->e_dfp != NULL)
5580 (void) sm_io_close(e->e_dfp, SM_TIME_DEFAULT);
5583 e->e_flags &= ~EF_HAS_DF;
5586 ** NAME2QID -- translate a queue group name to a queue group id
5589 ** queuename -- name of queue group.
5592 ** queue group id if found.
5593 ** NOQGRP otherwise.
5602 s = stab(queuename, ST_QUEUE, ST_FIND);
5605 return s->s_quegrp->qg_index;
5608 ** QID_PRINTNAME -- create externally printable version of queue id
5611 ** e -- the envelope.
5614 ** a printable version
5622 static char idbuf[MAXQFNAME + 34];
5627 if (e->e_id == NULL)
5632 if (e->e_qdir == NOQDIR)
5635 (void) sm_snprintf(idbuf, sizeof idbuf, "%.32s/%s",
5636 Queue[e->e_qgrp]->qg_qpaths[e->e_qdir].qp_name,
5641 ** QID_PRINTQUEUE -- create full version of queue directory for data files
5644 ** qgrp -- index in queue group.
5645 ** qdir -- the short version of the queue directory
5648 ** the full pathname to the queue (might point to a static var)
5652 qid_printqueue(qgrp, qdir)
5657 static char dir[MAXPATHLEN];
5660 return Queue[qgrp]->qg_qdir;
5662 if (strcmp(Queue[qgrp]->qg_qpaths[qdir].qp_name, ".") == 0)
5665 subdir = Queue[qgrp]->qg_qpaths[qdir].qp_name;
5667 (void) sm_strlcpyn(dir, sizeof dir, 4,
5668 Queue[qgrp]->qg_qdir,
5669 subdir == NULL ? "" : "/",
5670 subdir == NULL ? "" : subdir,
5672 Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
5678 ** PICKQDIR -- Pick a queue directory from a queue group
5681 ** qg -- queue group
5682 ** fsize -- file size in bytes
5683 ** e -- envelope, or NULL
5686 ** NOQDIR if no queue directory in qg has enough free space to
5687 ** hold a file of size 'fsize', otherwise the index of
5688 ** a randomly selected queue directory which resides on a
5689 ** file system with enough disk space.
5690 ** XXX This could be extended to select a queuedir with
5691 ** a few (the fewest?) number of entries. That data
5692 ** is available if shared memory is used.
5695 ** If the request fails and e != NULL then sm_syslog is called.
5699 pickqdir(qg, fsize, e)
5708 /* Pick a random directory, as a starting point. */
5709 if (qg->qg_numqueues <= 1)
5712 qdir = get_rand_mod(qg->qg_numqueues);
5714 if (MinBlocksFree <= 0 && fsize <= 0)
5718 ** Now iterate over the queue directories,
5719 ** looking for a directory with enough space for this message.
5725 QPATHS *qp = &qg->qg_qpaths[i];
5730 needed += fsize / FILE_SYS_BLKSIZE(qp->qp_fsysidx)
5731 + ((fsize % FILE_SYS_BLKSIZE(qp->qp_fsysidx)
5733 if (MinBlocksFree > 0)
5734 needed += MinBlocksFree;
5735 fsavail = FILE_SYS_AVAIL(qp->qp_fsysidx);
5742 ** might be not correctly updated,
5743 ** let's try to get the info directly.
5746 fsavail = freediskspace(FILE_SYS_NAME(qp->qp_fsysidx),
5751 #endif /* SM_CONF_SHM */
5752 if (needed <= fsavail)
5754 if (avail < fsavail)
5757 if (qg->qg_numqueues > 0)
5758 i = (i + 1) % qg->qg_numqueues;
5759 } while (i != qdir);
5761 if (e != NULL && LogLevel > 0)
5762 sm_syslog(LOG_ALERT, e->e_id,
5763 "low on space (%s needs %ld bytes + %ld blocks in %s), max avail: %ld",
5764 CurHostName == NULL ? "SMTP-DAEMON" : CurHostName,
5765 fsize, MinBlocksFree,
5766 qg->qg_qdir, avail);
5770 ** SETNEWQUEUE -- Sets a new queue group and directory
5772 ** Assign a queue group and directory to an envelope and store the
5773 ** directory in e->e_qdir.
5776 ** e -- envelope to assign a queue for.
5779 ** true if successful
5783 ** On success, e->e_qgrp and e->e_qdir are non-negative.
5784 ** On failure (not enough disk space),
5785 ** e->qgrp = NOQGRP, e->e_qdir = NOQDIR
5786 ** and usrerr() is invoked (which could raise an exception).
5794 sm_dprintf("setnewqueue: called\n");
5796 /* not set somewhere else */
5797 if (e->e_qgrp == NOQGRP)
5802 ** Use the queue group of the "first" recipient, as set by
5803 ** the "queuegroup" rule set. If that is not defined, then
5804 ** use the queue group of the mailer of the first recipient.
5805 ** If that is not defined either, then use the default
5807 ** Notice: "first" depends on the sorting of sendqueue
5809 ** To avoid problems with "bad" recipients look
5810 ** for a valid address first.
5815 (QS_IS_BADADDR(q->q_state) || QS_IS_DEAD(q->q_state)))
5821 else if (q->q_qgrp >= 0)
5822 e->e_qgrp = q->q_qgrp;
5823 else if (q->q_mailer != NULL &&
5824 ISVALIDQGRP(q->q_mailer->m_qgrp))
5825 e->e_qgrp = q->q_mailer->m_qgrp;
5828 e->e_dfqgrp = e->e_qgrp;
5831 if (ISVALIDQDIR(e->e_qdir) && ISVALIDQDIR(e->e_dfqdir))
5834 sm_dprintf("setnewqueue: e_qdir already assigned (%s)\n",
5835 qid_printqueue(e->e_qgrp, e->e_qdir));
5840 e->e_qdir = pickqdir(Queue[e->e_qgrp], e->e_msgsize, e);
5841 if (e->e_qdir == NOQDIR)
5844 if (!bitset(EF_FATALERRS, e->e_flags))
5845 usrerr("452 4.4.5 Insufficient disk space; try again later");
5846 e->e_flags |= EF_FATALERRS;
5851 sm_dprintf("setnewqueue: Assigned queue directory %s\n",
5852 qid_printqueue(e->e_qgrp, e->e_qdir));
5854 if (e->e_xfqgrp == NOQGRP || e->e_xfqdir == NOQDIR)
5856 e->e_xfqgrp = e->e_qgrp;
5857 e->e_xfqdir = e->e_qdir;
5859 e->e_dfqdir = e->e_qdir;
5863 ** CHKQDIR -- check a queue directory
5866 ** name -- name of queue directory
5867 ** sff -- flags for safefile()
5870 ** is it a queue directory?
5881 /* skip over . and .. directories */
5882 if (name[0] == '.' &&
5883 (name[1] == '\0' || (name[1] == '.' && name[2] == '\0')))
5886 if (lstat(name, &statb) < 0)
5887 #else /* HASLSTAT */
5888 if (stat(name, &statb) < 0)
5889 #endif /* HASLSTAT */
5892 sm_dprintf("chkqdir: stat(\"%s\"): %s\n",
5893 name, sm_errstring(errno));
5897 if (S_ISLNK(statb.st_mode))
5900 ** For a symlink we need to make sure the
5901 ** target is a directory
5904 if (stat(name, &statb) < 0)
5907 sm_dprintf("chkqdir: stat(\"%s\"): %s\n",
5908 name, sm_errstring(errno));
5912 #endif /* HASLSTAT */
5914 if (!S_ISDIR(statb.st_mode))
5917 sm_dprintf("chkqdir: \"%s\": Not a directory\n",
5922 /* Print a warning if unsafe (but still use it) */
5923 /* XXX do this only if we want the warning? */
5924 i = safedirpath(name, RunAsUid, RunAsGid, NULL, sff, 0, 0);
5928 sm_dprintf("chkqdir: \"%s\": Not safe: %s\n",
5929 name, sm_errstring(i));
5932 sm_syslog(LOG_WARNING, NOQID,
5933 "queue directory \"%s\": Not safe: %s",
5934 name, sm_errstring(i));
5935 #endif /* _FFR_CHK_QUEUE */
5940 ** MULTIQUEUE_CACHE -- cache a list of paths to queues.
5942 ** Each potential queue is checked as the cache is built.
5943 ** Thereafter, each is blindly trusted.
5944 ** Note that we can be called again after a timeout to rebuild
5945 ** (although code for that is not ready yet).
5948 ** basedir -- base of all queue directories.
5949 ** blen -- strlen(basedir).
5950 ** qg -- queue group.
5951 ** qn -- number of queue directories already cached.
5952 ** phash -- pointer to hash value over queue dirs.
5954 ** only used if shared memory is active.
5955 #endif * SM_CONF_SHM *
5958 ** new number of queue directories.
5961 #define INITIAL_SLOTS 20
5962 #define ADD_SLOTS 10
5965 multiqueue_cache(basedir, blen, qg, qn, phash)
5970 unsigned int *phash;
5975 long sff = SFF_ANYFILE;
5976 char qpath[MAXPATHLEN];
5977 char subdir[MAXPATHLEN];
5978 char prefix[MAXPATHLEN]; /* dir relative to basedir */
5981 sm_dprintf("multiqueue_cache: called\n");
5983 /* Initialize to current directory */
5986 if (qg->qg_numqueues != 0 && qg->qg_qpaths != NULL)
5988 for (i = 0; i < qg->qg_numqueues; i++)
5990 if (qg->qg_qpaths[i].qp_name != NULL)
5991 (void) sm_free(qg->qg_qpaths[i].qp_name); /* XXX */
5993 (void) sm_free((char *) qg->qg_qpaths); /* XXX */
5994 qg->qg_qpaths = NULL;
5995 qg->qg_numqueues = 0;
5998 /* If running as root, allow safedirpath() checks to use privs */
6002 sff |= SFF_SAFEDIRPATH|SFF_NOWWFILES;
6004 sff |= SFF_NOGWFILES;
6005 #endif /* _FFR_CHK_QUEUE */
6007 if (!SM_IS_DIR_START(qg->qg_qdir))
6010 ** XXX we could add basedir, but then we have to realloc()
6011 ** the string... Maybe another time.
6014 syserr("QueuePath %s not absolute", qg->qg_qdir);
6015 ExitStat = EX_CONFIG;
6019 /* qpath: directory of current workgroup */
6020 len = sm_strlcpy(qpath, qg->qg_qdir, sizeof qpath);
6021 if (len >= sizeof qpath)
6023 syserr("QueuePath %.256s too long (%d max)",
6024 qg->qg_qdir, (int) sizeof qpath);
6025 ExitStat = EX_CONFIG;
6029 /* begin of qpath must be same as basedir */
6030 if (strncmp(basedir, qpath, blen) != 0 &&
6031 (strncmp(basedir, qpath, blen - 1) != 0 || len != blen - 1))
6033 syserr("QueuePath %s not subpath of QueueDirectory %s",
6035 ExitStat = EX_CONFIG;
6039 /* Do we have a nested subdirectory? */
6040 if (blen < len && SM_FIRST_DIR_DELIM(qg->qg_qdir + blen) != NULL)
6043 /* Copy subdirectory into prefix for later use */
6044 if (sm_strlcpy(prefix, qg->qg_qdir + blen, sizeof prefix) >=
6047 syserr("QueuePath %.256s too long (%d max)",
6048 qg->qg_qdir, (int) sizeof qpath);
6049 ExitStat = EX_CONFIG;
6052 cp = SM_LAST_DIR_DELIM(prefix);
6053 SM_ASSERT(cp != NULL);
6054 *cp = '\0'; /* cut off trailing / */
6057 /* This is guaranteed by the basedir check above */
6058 SM_ASSERT(len >= blen - 1);
6059 cp = &qpath[len - 1];
6063 register struct dirent *d;
6066 char relpath[MAXPATHLEN];
6068 *cp = '\0'; /* Overwrite wildcard */
6069 if ((cp = SM_LAST_DIR_DELIM(qpath)) == NULL)
6071 syserr("QueueDirectory: can not wildcard relative path");
6073 sm_dprintf("multiqueue_cache: \"%s*\": Can not wildcard relative path.\n",
6075 ExitStat = EX_CONFIG;
6081 ** Special case of top level wildcard, like /foo*
6085 (void) sm_strlcpy(qpath + 1, qpath, sizeof qpath - 1);
6089 *(cp++) = '\0'; /* Replace / with \0 */
6090 len = strlen(cp); /* Last component of queue directory */
6093 ** Path relative to basedir, with trailing /
6094 ** It will be modified below to specify the subdirectories
6095 ** so they can be opened without chdir().
6098 off = sm_strlcpyn(relpath, sizeof relpath, 2, prefix, "/");
6099 SM_ASSERT(off < sizeof relpath);
6102 sm_dprintf("multiqueue_cache: prefix=\"%s%s\"\n",
6105 /* It is always basedir: we don't need to store it per group */
6106 /* XXX: optimize this! -> one more global? */
6107 qg->qg_qdir = newstr(basedir);
6108 qg->qg_qdir[blen - 1] = '\0'; /* cut off trailing / */
6111 ** XXX Should probably wrap this whole loop in a timeout
6112 ** in case some wag decides to NFS mount the queues.
6115 /* Test path to get warning messages. */
6118 /* XXX qg_runasuid and qg_runasgid for specials? */
6119 i = safedirpath(basedir, RunAsUid, RunAsGid, NULL,
6121 if (i != 0 && tTd(41, 2))
6122 sm_dprintf("multiqueue_cache: \"%s\": Not safe: %s\n",
6123 basedir, sm_errstring(i));
6126 if ((dp = opendir(prefix)) == NULL)
6128 syserr("can not opendir(%s/%s)", qg->qg_qdir, prefix);
6130 sm_dprintf("multiqueue_cache: opendir(\"%s/%s\"): %s\n",
6131 qg->qg_qdir, prefix,
6132 sm_errstring(errno));
6133 ExitStat = EX_CONFIG;
6136 while ((d = readdir(dp)) != NULL)
6138 i = strlen(d->d_name);
6139 if (i < len || strncmp(d->d_name, cp, len) != 0)
6142 sm_dprintf("multiqueue_cache: \"%s\", skipped\n",
6147 /* Create relative pathname: prefix + local directory */
6148 i = sizeof(relpath) - off;
6149 if (sm_strlcpy(relpath + off, d->d_name, i) >= i)
6150 continue; /* way too long */
6152 if (!chkqdir(relpath, sff))
6155 if (qg->qg_qpaths == NULL)
6157 slotsleft = INITIAL_SLOTS;
6158 qg->qg_qpaths = (QPATHS *)xalloc((sizeof *qg->qg_qpaths) *
6160 qg->qg_numqueues = 0;
6162 else if (slotsleft < 1)
6164 qg->qg_qpaths = (QPATHS *)sm_realloc((char *)qg->qg_qpaths,
6165 (sizeof *qg->qg_qpaths) *
6168 if (qg->qg_qpaths == NULL)
6170 (void) closedir(dp);
6173 slotsleft += ADD_SLOTS;
6177 qg->qg_qpaths[qg->qg_numqueues].qp_subdirs = QP_NOSUB;
6179 #define CHKRSUBDIR(name, flag) \
6180 (void) sm_strlcpyn(subdir, sizeof subdir, 3, relpath, "/", name); \
6181 if (chkqdir(subdir, sff)) \
6182 qg->qg_qpaths[qg->qg_numqueues].qp_subdirs |= flag; \
6186 CHKRSUBDIR("qf", QP_SUBQF);
6187 CHKRSUBDIR("df", QP_SUBDF);
6188 CHKRSUBDIR("xf", QP_SUBXF);
6190 /* assert(strlen(d->d_name) < MAXPATHLEN - 14) */
6191 /* maybe even - 17 (subdirs) */
6193 if (prefix[0] != '.')
6194 qg->qg_qpaths[qg->qg_numqueues].qp_name =
6197 qg->qg_qpaths[qg->qg_numqueues].qp_name =
6201 sm_dprintf("multiqueue_cache: %d: \"%s\" cached (%x).\n",
6202 qg->qg_numqueues, relpath,
6203 qg->qg_qpaths[qg->qg_numqueues].qp_subdirs);
6205 qg->qg_qpaths[qg->qg_numqueues].qp_idx = qn;
6206 *phash = hash_q(relpath, *phash);
6207 #endif /* SM_CONF_SHM */
6212 (void) closedir(dp);
6217 if (qg->qg_numqueues == 0)
6219 qg->qg_qpaths = (QPATHS *) xalloc(sizeof *qg->qg_qpaths);
6221 /* test path to get warning messages */
6222 i = safedirpath(qpath, RunAsUid, RunAsGid, NULL, sff, 0, 0);
6225 syserr("can not opendir(%s)", qpath);
6227 sm_dprintf("multiqueue_cache: opendir(\"%s\"): %s\n",
6228 qpath, sm_errstring(i));
6229 ExitStat = EX_CONFIG;
6233 qg->qg_qpaths[0].qp_subdirs = QP_NOSUB;
6234 qg->qg_numqueues = 1;
6237 #define CHKSUBDIR(name, flag) \
6238 (void) sm_strlcpyn(subdir, sizeof subdir, 3, qg->qg_qdir, "/", name); \
6239 if (chkqdir(subdir, sff)) \
6240 qg->qg_qpaths[0].qp_subdirs |= flag; \
6243 CHKSUBDIR("qf", QP_SUBQF);
6244 CHKSUBDIR("df", QP_SUBDF);
6245 CHKSUBDIR("xf", QP_SUBXF);
6247 if (qg->qg_qdir[blen - 1] != '\0' &&
6248 qg->qg_qdir[blen] != '\0')
6251 ** Copy the last component into qpaths and
6255 qg->qg_qpaths[0].qp_name = newstr(qg->qg_qdir + blen);
6256 qg->qg_qdir[blen - 1] = '\0';
6259 qg->qg_qpaths[0].qp_name = newstr(".");
6262 qg->qg_qpaths[0].qp_idx = qn;
6263 *phash = hash_q(qg->qg_qpaths[0].qp_name, *phash);
6264 #endif /* SM_CONF_SHM */
6271 ** FILESYS_FIND -- find entry in FileSys table, or add new one
6273 ** Given the pathname of a directory, determine the file system
6274 ** in which that directory resides, and return a pointer to the
6275 ** entry in the FileSys table that describes the file system.
6276 ** A new entry is added if necessary (and requested).
6277 ** If the directory does not exist, -1 is returned.
6280 ** name -- name of directory (must be persistent!)
6281 ** path -- pathname of directory (name plus maybe "/df")
6282 ** add -- add to structure if not found.
6285 ** >=0: found: index in file system table
6286 ** <0: some error, i.e.,
6287 ** FSF_TOO_MANY: too many filesystems (-> syserr())
6288 ** FSF_STAT_FAIL: can't stat() filesystem (-> syserr())
6289 ** FSF_NOT_FOUND: not in list
6292 static short filesys_find __P((char *, char *, bool));
6294 #define FSF_NOT_FOUND (-1)
6295 #define FSF_STAT_FAIL (-2)
6296 #define FSF_TOO_MANY (-3)
6299 filesys_find(name, path, add)
6307 if (stat(path, &st) < 0)
6309 syserr("cannot stat queue directory %s", path);
6310 return FSF_STAT_FAIL;
6312 for (i = 0; i < NumFileSys; ++i)
6314 if (FILE_SYS_DEV(i) == st.st_dev)
6317 if (i >= MAXFILESYS)
6319 syserr("too many queue file systems (%d max)", MAXFILESYS);
6320 return FSF_TOO_MANY;
6323 return FSF_NOT_FOUND;
6326 FILE_SYS_NAME(i) = name;
6327 FILE_SYS_DEV(i) = st.st_dev;
6328 FILE_SYS_AVAIL(i) = 0;
6329 FILE_SYS_BLKSIZE(i) = 1024; /* avoid divide by zero */
6334 ** FILESYS_SETUP -- set up mapping from queue directories to file systems
6336 ** This data structure is used to efficiently check the amount of
6337 ** free space available in a set of queue directories.
6340 ** add -- initialize structure if necessary.
6344 ** <0: some error, i.e.,
6345 ** FSF_NOT_FOUND: not in list
6346 ** FSF_STAT_FAIL: can't stat() filesystem (-> syserr())
6347 ** FSF_TOO_MANY: too many filesystems (-> syserr())
6350 static int filesys_setup __P((bool));
6361 for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
6363 for (j = 0; j < Queue[i]->qg_numqueues; ++j)
6365 QPATHS *qp = &Queue[i]->qg_qpaths[j];
6366 char qddf[MAXPATHLEN];
6368 (void) sm_strlcpyn(qddf, sizeof qddf, 2, qp->qp_name,
6369 (bitset(QP_SUBDF, qp->qp_subdirs)
6371 fs = filesys_find(qp->qp_name, qddf, add);
6373 qp->qp_fsysidx = fs;
6384 ** FILESYS_UPDATE -- update amount of free space on all file systems
6386 ** The FileSys table is used to cache the amount of free space
6387 ** available on all queue directory file systems.
6388 ** This function updates the cached information if it has expired.
6397 ** Updates FileSys table.
6404 long avail, blksize;
6406 static time_t nextupdate = 0;
6409 /* only the daemon updates this structure */
6410 if (ShmId == SM_SHM_NO_ID || DaemonPid != CurrentPid)
6412 #endif /* SM_CONF_SHM */
6414 if (now < nextupdate)
6416 nextupdate = now + FILESYS_UPDATE_INTERVAL;
6417 for (i = 0; i < NumFileSys; ++i)
6419 FILESYS *fs = &FILE_SYS(i);
6421 avail = freediskspace(FILE_SYS_NAME(i), &blksize);
6422 if (avail < 0 || blksize <= 0)
6425 sm_syslog(LOG_ERR, NOQID,
6426 "filesys_update failed: %s, fs=%s, avail=%ld, blocksize=%ld",
6427 sm_errstring(errno),
6428 FILE_SYS_NAME(i), avail, blksize);
6430 fs->fs_blksize = 1024; /* avoid divide by zero */
6431 nextupdate = now + 2; /* let's do this soon again */
6435 fs->fs_avail = avail;
6436 fs->fs_blksize = blksize;
6441 #if _FFR_ANY_FREE_FS
6443 ** FILESYS_FREE -- check whether there is at least one fs with enough space.
6446 ** fsize -- file size in bytes
6449 ** true iff there is one fs with more than fsize bytes free.
6460 for (i = 0; i < NumFileSys; ++i)
6464 if (FILE_SYS_AVAIL(i) < 0 || FILE_SYS_BLKSIZE(i) <= 0)
6466 needed += fsize / FILE_SYS_BLKSIZE(i)
6467 + ((fsize % FILE_SYS_BLKSIZE(i)
6470 if (needed <= FILE_SYS_AVAIL(i))
6475 #endif /* _FFR_ANY_FREE_FS */
6477 #if _FFR_CONTROL_MSTAT
6479 ** DISK_STATUS -- show amount of free space in queue directories
6482 ** out -- output file pointer.
6483 ** prefix -- string to output in front of each line.
6490 disk_status(out, prefix)
6495 long avail, blksize;
6498 for (i = 0; i < NumFileSys; ++i)
6500 avail = freediskspace(FILE_SYS_NAME(i), &blksize);
6501 if (avail >= 0 && blksize > 0)
6503 free = (long)((double) avail *
6504 ((double) blksize / 1024));
6508 (void) sm_io_fprintf(out, SM_TIME_DEFAULT,
6515 #endif /* _FFR_CONTROL_MSTAT */
6520 ** INIT_SEM -- initialize semaphore system
6523 ** owner -- is this the owner of semaphores?
6529 #if _FFR_USE_SEM_LOCKING
6531 static int SemId = -1; /* Semaphore Id */
6532 int SemKey = SM_SEM_KEY;
6533 #endif /* SM_CONF_SEM */
6534 #endif /* _FFR_USE_SEM_LOCKING */
6536 static void init_sem __P((bool));
6542 #if _FFR_USE_SEM_LOCKING
6544 SemId = sm_sem_start(SemKey, 1, 0, owner);
6547 sm_syslog(LOG_ERR, NOQID,
6548 "func=init_sem, sem_key=%ld, sm_sem_start=%d",
6549 (long) SemKey, SemId);
6552 #endif /* SM_CONF_SEM */
6553 #endif /* _FFR_USE_SEM_LOCKING */
6558 ** STOP_SEM -- stop semaphore system
6561 ** owner -- is this the owner of semaphores?
6567 static void stop_sem __P((bool));
6573 #if _FFR_USE_SEM_LOCKING
6575 if (owner && SemId >= 0)
6577 #endif /* SM_CONF_SEM */
6578 #endif /* _FFR_USE_SEM_LOCKING */
6583 ** UPD_QS -- update information about queue when adding/deleting an entry
6587 ** count -- add/remove entry (+1/0/-1: add/no change/remove)
6588 ** space -- update the space available as well.
6589 ** (>0/0/<0: add/no change/remove)
6590 ** where -- caller (for logging)
6596 ** Modifies available space in filesystem.
6597 ** Changes number of entries in queue directory.
6601 upd_qs(e, count, space, where)
6609 # if _FFR_USE_SEM_LOCKING
6611 # endif /* _FFR_USE_SEM_LOCKING */
6614 if (ShmId == SM_SHM_NO_ID || e == NULL)
6616 if (e->e_qgrp == NOQGRP || e->e_qdir == NOQDIR)
6618 idx = Queue[e->e_qgrp]->qg_qpaths[e->e_qdir].qp_idx;
6620 sm_dprintf("func=upd_qs, count=%d, space=%d, where=%s, idx=%d, entries=%d\n",
6621 count, space, where, idx, QSHM_ENTRIES(idx));
6623 /* XXX in theory this needs to be protected with a mutex */
6624 if (QSHM_ENTRIES(idx) >= 0 && count != 0)
6626 # if _FFR_USE_SEM_LOCKING
6627 r = sm_sem_acq(SemId, 0, 1);
6628 # endif /* _FFR_USE_SEM_LOCKING */
6629 QSHM_ENTRIES(idx) += count;
6630 # if _FFR_USE_SEM_LOCKING
6632 r = sm_sem_rel(SemId, 0, 1);
6633 # endif /* _FFR_USE_SEM_LOCKING */
6636 fidx = Queue[e->e_qgrp]->qg_qpaths[e->e_qdir].qp_fsysidx;
6640 /* update available space also? (might be loseqfile) */
6644 /* convert size to blocks; this causes rounding errors */
6645 s = e->e_msgsize / FILE_SYS_BLKSIZE(fidx);
6649 /* XXX in theory this needs to be protected with a mutex */
6651 FILE_SYS_AVAIL(fidx) += s;
6653 FILE_SYS_AVAIL(fidx) -= s;
6659 static bool write_key_file __P((char *, long));
6660 static long read_key_file __P((char *, long));
6663 ** WRITE_KEY_FILE -- record some key into a file.
6666 ** keypath -- file name.
6667 ** key -- key to write.
6670 ** true iff file could be written.
6677 write_key_file(keypath, key)
6686 if (keypath == NULL || *keypath == '\0')
6688 sff = SFF_NOLINK|SFF_ROOTOK|SFF_REGONLY|SFF_CREAT;
6689 if (TrustedUid != 0 && RealUid == TrustedUid)
6690 sff |= SFF_OPENASROOT;
6691 keyf = safefopen(keypath, O_WRONLY|O_TRUNC, FileMode, sff);
6694 sm_syslog(LOG_ERR, NOQID, "unable to write %s: %s",
6695 keypath, sm_errstring(errno));
6699 if (geteuid() == 0 && RunAsUid != 0)
6705 if (fd >= 0 && fchown(fd, RunAsUid, -1) < 0)
6709 sm_syslog(LOG_ALERT, NOQID,
6710 "ownership change on %s to %d failed: %s",
6711 keypath, RunAsUid, sm_errstring(err));
6713 # endif /* HASFCHOWN */
6715 ok = sm_io_fprintf(keyf, SM_TIME_DEFAULT, "%ld\n", key) !=
6717 ok = (sm_io_close(keyf, SM_TIME_DEFAULT) != SM_IO_EOF) && ok;
6723 ** READ_KEY_FILE -- read a key from a file.
6726 ** keypath -- file name.
6727 ** key -- default key.
6734 read_key_file(keypath, key)
6742 if (keypath == NULL || *keypath == '\0')
6744 sff = SFF_NOLINK|SFF_ROOTOK|SFF_REGONLY;
6745 if (RealUid == 0 || (TrustedUid != 0 && RealUid == TrustedUid))
6746 sff |= SFF_OPENASROOT;
6747 keyf = safefopen(keypath, O_RDONLY, FileMode, sff);
6750 sm_syslog(LOG_ERR, NOQID, "unable to read %s: %s",
6751 keypath, sm_errstring(errno));
6755 r = sm_io_fscanf(keyf, SM_TIME_DEFAULT, "%ld", &n);
6758 (void) sm_io_close(keyf, SM_TIME_DEFAULT);
6762 #endif /* _FFR_SELECT_SHM */
6765 ** INIT_SHM -- initialize shared memory structure
6767 ** Initialize or attach to shared memory segment.
6768 ** Currently it is not a fatal error if this doesn't work.
6769 ** However, it causes us to have a "fallback" storage location
6770 ** for everything that is supposed to be in the shared memory,
6771 ** which makes the code slightly ugly.
6774 ** qn -- number of queue directories.
6775 ** owner -- owner of shared memory.
6776 ** hash -- identifies data that is stored in shared memory.
6782 static void init_shm __P((int, bool, unsigned int));
6785 init_shm(qn, owner, hash)
6795 #endif /* _FFR_SELECT_SHM */
6797 PtrFileSys = &FileSys[0];
6798 PNumFileSys = &Numfilesys;
6800 /* if this "key" is specified: select one yourself */
6801 # define SEL_SHM_KEY ((key_t) -1)
6802 # define FIRST_SHM_KEY 25
6803 #endif /* _FFR_SELECT_SHM */
6805 /* This allows us to disable shared memory at runtime. */
6810 shms = SM_T_SIZE + qn * sizeof(QUEUE_SHM_T);
6812 keyselect = ShmKey == SEL_SHM_KEY;
6816 ShmKey = FIRST_SHM_KEY;
6819 ShmKey = read_key_file(ShmKeyFile, ShmKey);
6821 if (ShmKey == SEL_SHM_KEY)
6825 #endif /* _FFR_SELECT_SHM */
6828 /* allow read/write access for group? */
6829 Pshm = sm_shmstart(ShmKey, shms,
6830 SHM_R|SHM_W|(SHM_R>>3)|(SHM_W>>3),
6833 if (Pshm != NULL || !sm_file_exists(save_errno))
6842 /* back where we started? */
6843 if (ShmKey == SEL_SHM_KEY)
6847 #endif /* _FFR_SELECT_SHM */
6851 /* only sleep if we are at the first key */
6852 if (!keyselect || ShmKey == SEL_SHM_KEY)
6853 #endif /* _FFR_SELECT_SHM */
6862 (void) write_key_file(ShmKeyFile, (long) ShmKey);
6863 #endif /* _FFR_SELECT_SHM */
6864 if (owner && RunAsUid != 0)
6866 i = sm_shmsetowner(ShmId, RunAsUid, RunAsGid, 0660);
6868 sm_syslog(LOG_ERR, NOQID,
6869 "key=%ld, sm_shmsetowner=%d, RunAsUid=%d, RunAsGid=%d",
6870 (long) ShmKey, i, RunAsUid, RunAsGid);
6876 *((pid_t *) SHM_OFF_PID(Pshm)) = CurrentPid;
6877 p = (int *) SHM_OFF_TAG(Pshm);
6882 if (*p != (int) shms)
6884 save_errno = EINVAL;
6888 p = (int *) SHM_OFF_TAG(Pshm);
6889 if (*p != (int) hash)
6891 save_errno = EINVAL;
6897 ** XXX how to check the pid?
6898 ** Read it from the pid-file? That does
6899 ** not need to exist.
6900 ** We could disable shm if we can't confirm
6901 ** that it is the right one.
6905 PtrFileSys = (FILESYS *) OFF_FILE_SYS(Pshm);
6906 PNumFileSys = (int *) OFF_NUM_FILE_SYS(Pshm);
6907 QShm = (QUEUE_SHM_T *) OFF_QUEUE_SHM(Pshm);
6908 PRSATmpCnt = (int *) OFF_RSA_TMP_CNT(Pshm);
6912 /* initialize values in shared memory */
6914 for (i = 0; i < qn; i++)
6915 QShm[i].qs_entries = -1;
6921 if (LogLevel > (owner ? 8 : 11))
6923 sm_syslog(owner ? LOG_ERR : LOG_NOTICE, NOQID,
6924 "can't %s shared memory, key=%ld: %s",
6925 owner ? "initialize" : "attach to",
6926 (long) ShmKey, sm_errstring(save_errno));
6929 #endif /* SM_CONF_SHM */
6933 ** SETUP_QUEUES -- setup all queue groups
6936 ** owner -- owner of shared memory.
6943 ** attaches shared memory.
6944 #endif * SM_CONF_SHM *
6952 unsigned int hashval;
6954 char basedir[MAXPATHLEN];
6958 ** Determine basedir for all queue directories.
6959 ** All queue directories must be (first level) subdirectories
6960 ** of the basedir. The basedir is the QueueDir
6961 ** without wildcards, but with trailing /
6966 len = sm_strlcpy(basedir, QueueDir, sizeof basedir);
6968 /* Provide space for trailing '/' */
6969 if (len >= sizeof basedir - 1)
6971 syserr("QueueDirectory: path too long: %d, max %d",
6972 len, (int) sizeof basedir - 1);
6973 ExitStat = EX_CONFIG;
6977 if (basedir[len - 1] == '*')
6981 cp = SM_LAST_DIR_DELIM(basedir);
6984 syserr("QueueDirectory: can not wildcard relative path \"%s\"",
6987 sm_dprintf("setup_queues: \"%s\": Can not wildcard relative path.\n",
6989 ExitStat = EX_CONFIG;
6993 /* cut off wildcard pattern */
6997 else if (!SM_IS_DIR_DELIM(basedir[len - 1]))
6999 /* append trailing slash since it is a directory */
7001 basedir[++len] = '\0';
7004 /* len counts up to the last directory delimiter */
7005 SM_ASSERT(basedir[len - 1] == '/');
7007 if (chdir(basedir) < 0)
7009 int save_errno = errno;
7011 syserr("can not chdir(%s)", basedir);
7012 if (save_errno == EACCES)
7013 (void) sm_io_fprintf(smioerr, SM_TIME_DEFAULT,
7014 "Program mode requires special privileges, e.g., root or TrustedUser.\n");
7016 sm_dprintf("setup_queues: \"%s\": %s\n",
7017 basedir, sm_errstring(errno));
7018 ExitStat = EX_CONFIG;
7022 hashval = hash_q(basedir, hashval);
7023 #endif /* SM_CONF_SHM */
7025 /* initialize for queue runs */
7028 for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
7029 Queue[i]->qg_nextrun = now;
7032 if (UseMSP && OpMode != MD_TEST)
7034 long sff = SFF_CREAT;
7036 if (stat(".", &st) < 0)
7038 syserr("can not stat(%s)", basedir);
7040 sm_dprintf("setup_queues: \"%s\": %s\n",
7041 basedir, sm_errstring(errno));
7042 ExitStat = EX_CONFIG;
7049 ** Check queue directory permissions.
7050 ** Can we write to a group writable queue directory?
7053 if (bitset(S_IWGRP, QueueFileMode) &&
7054 bitset(S_IWGRP, st.st_mode) &&
7055 safefile(" ", RunAsUid, RunAsGid, RunAsUserName, sff,
7056 QueueFileMode, NULL) != 0)
7058 syserr("can not write to queue directory %s (RunAsGid=%d, required=%d)",
7059 basedir, (int) RunAsGid, (int) st.st_gid);
7061 if (bitset(S_IWOTH|S_IXOTH, st.st_mode))
7063 #if _FFR_MSP_PARANOIA
7064 syserr("dangerous permissions=%o on queue directory %s",
7065 (int) st.st_mode, basedir);
7066 #else /* _FFR_MSP_PARANOIA */
7068 sm_syslog(LOG_ERR, NOQID,
7069 "dangerous permissions=%o on queue directory %s",
7070 (int) st.st_mode, basedir);
7071 #endif /* _FFR_MSP_PARANOIA */
7073 #if _FFR_MSP_PARANOIA
7075 syserr("can not use multiple queues for MSP");
7076 #endif /* _FFR_MSP_PARANOIA */
7079 /* initial number of queue directories */
7081 for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
7082 qn = multiqueue_cache(basedir, len, Queue[i], qn, &hashval);
7085 init_shm(qn, owner, hashval);
7086 i = filesys_setup(owner || ShmId == SM_SHM_NO_ID);
7087 if (i == FSF_NOT_FOUND)
7090 ** We didn't get the right filesystem data
7091 ** This may happen if we don't have the right shared memory.
7092 ** So let's do this without shared memory.
7096 cleanup_shm(false); /* release shared memory */
7097 i = filesys_setup(false);
7099 syserr("filesys_setup failed twice, result=%d", i);
7100 else if (LogLevel > 8)
7101 sm_syslog(LOG_WARNING, NOQID,
7102 "shared memory does not contain expected data, ignored");
7104 #else /* SM_CONF_SHM */
7105 i = filesys_setup(true);
7106 #endif /* SM_CONF_SHM */
7108 ExitStat = EX_CONFIG;
7113 ** CLEANUP_SHM -- do some cleanup work for shared memory etc
7116 ** owner -- owner of shared memory?
7122 ** detaches shared memory.
7129 if (ShmId != SM_SHM_NO_ID)
7131 if (sm_shmstop(Pshm, ShmId, owner) < 0 && LogLevel > 8)
7132 sm_syslog(LOG_INFO, NOQID, "sm_shmstop failed=%s",
7133 sm_errstring(errno));
7135 ShmId = SM_SHM_NO_ID;
7139 #endif /* SM_CONF_SHM */
7142 ** CLEANUP_QUEUES -- do some cleanup work for queues
7158 ** SET_DEF_QUEUEVAL -- set default values for a queue group.
7161 ** qg -- queue group
7162 ** all -- set all values (true for default group)?
7168 ** sets default values for the queue group.
7172 set_def_queueval(qg, all)
7176 if (bitnset(QD_DEFINED, qg->qg_flags))
7179 qg->qg_qdir = QueueDir;
7180 #if _FFR_QUEUE_GROUP_SORTORDER
7181 qg->qg_sortorder = QueueSortOrder;
7182 #endif /* _FFR_QUEUE_GROUP_SORTORDER */
7183 qg->qg_maxqrun = all ? MaxRunnersPerQueue : -1;
7184 qg->qg_nice = NiceQueueRun;
7187 ** MAKEQUEUE -- define a new queue.
7190 ** line -- description of queue. This is in labeled fields.
7192 ** F -- the flags associated with the queue
7193 ** I -- the interval between running the queue
7194 ** J -- the maximum # of jobs in work list
7195 ** [M -- the maximum # of jobs in a queue run]
7196 ** N -- the niceness at which to run
7197 ** P -- the path to the queue
7198 ** S -- the queue sorting order
7199 ** R -- number of parallel queue runners
7200 ** r -- max recipients per envelope
7201 ** The first word is the canonical name of the queue.
7202 ** qdef -- this is a 'Q' definition from .cf
7208 ** enters the queue into the queue table.
7212 makequeue(line, qdef)
7217 register QUEUEGRP *qg;
7222 /* allocate a queue and set up defaults */
7223 qg = (QUEUEGRP *) xalloc(sizeof *qg);
7224 memset((char *) qg, '\0', sizeof *qg);
7226 if (line[0] == '\0')
7228 syserr("name required for queue");
7232 /* collect the queue name */
7234 *p != '\0' && *p != ',' && !(isascii(*p) && isspace(*p));
7239 qg->qg_name = newstr(line);
7241 /* set default values, can be overridden below */
7242 set_def_queueval(qg, false);
7244 /* now scan through and assign info from the fields */
7247 auto char *delimptr;
7249 while (*p != '\0' &&
7250 (*p == ',' || (isascii(*p) && isspace(*p))))
7253 /* p now points to field code */
7255 while (*p != '\0' && *p != '=' && *p != ',')
7259 syserr("queue %s: `=' expected", qg->qg_name);
7262 while (isascii(*p) && isspace(*p))
7265 /* p now points to the field body */
7266 p = munchstring(p, &delimptr, ',');
7268 /* install the field into the queue struct */
7271 case 'P': /* pathname */
7273 syserr("queue %s: empty path name",
7276 qg->qg_qdir = newstr(p);
7279 case 'F': /* flags */
7280 for (; *p != '\0'; p++)
7281 if (!(isascii(*p) && isspace(*p)))
7282 setbitn(*p, qg->qg_flags);
7286 ** Do we need two intervals here:
7287 ** One for persistent queue runners,
7288 ** one for "normal" queue runs?
7291 case 'I': /* interval between running the queue */
7292 qg->qg_queueintvl = convtime(p, 'm');
7295 case 'N': /* run niceness */
7296 qg->qg_nice = atoi(p);
7299 case 'R': /* maximum # of runners for the group */
7302 /* can't have more runners than allowed total */
7303 if (MaxQueueChildren > 0 && i > MaxQueueChildren)
7305 qg->qg_maxqrun = MaxQueueChildren;
7306 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
7307 "Q=%s: R=%d exceeds MaxQueueChildren=%d, set to MaxQueueChildren\n",
7315 case 'J': /* maximum # of jobs in work list */
7316 qg->qg_maxlist = atoi(p);
7319 case 'r': /* max recipients per envelope */
7320 qg->qg_maxrcpt = atoi(p);
7323 #if _FFR_QUEUE_GROUP_SORTORDER
7324 case 'S': /* queue sorting order */
7327 case 'h': /* Host first */
7329 qg->qg_sortorder = QSO_BYHOST;
7332 case 'p': /* Priority order */
7334 qg->qg_sortorder = QSO_BYPRIORITY;
7337 case 't': /* Submission time */
7339 qg->qg_sortorder = QSO_BYTIME;
7342 case 'f': /* File name */
7344 qg->qg_sortorder = QSO_BYFILENAME;
7347 case 'm': /* Modification time */
7349 qg->qg_sortorder = QSO_BYMODTIME;
7352 case 'r': /* Random */
7354 qg->qg_sortorder = QSO_RANDOM;
7358 case 's': /* Shuffled host name */
7360 qg->qg_sortorder = QSO_BYSHUFFLE;
7362 # endif /* _FFR_RHS */
7364 case 'n': /* none */
7366 qg->qg_sortorder = QSO_NONE;
7370 syserr("Invalid queue sort order \"%s\"", p);
7373 #endif /* _FFR_QUEUE_GROUP_SORTORDER */
7376 syserr("Q%s: unknown queue equate %c=",
7377 qg->qg_name, fcode);
7385 if (qg->qg_nice != NiceQueueRun)
7387 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
7388 "Q%s: Warning: N= set on system that doesn't support nice()\n",
7391 #endif /* !HASNICE */
7393 /* do some rationality checking */
7394 if (NumQueue >= MAXQUEUEGROUPS)
7396 syserr("too many queue groups defined (%d max)",
7401 if (qg->qg_qdir == NULL)
7403 if (QueueDir == NULL || *QueueDir == '\0')
7405 syserr("QueueDir must be defined before queue groups");
7408 qg->qg_qdir = newstr(QueueDir);
7411 if (qg->qg_maxqrun > 1 && !bitnset(QD_FORK, qg->qg_flags))
7413 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
7414 "Warning: Q=%s: R=%d: multiple queue runners specified\n\tbut flag '%c' is not set\n",
7415 qg->qg_name, qg->qg_maxqrun, QD_FORK);
7418 /* enter the queue into the symbol table */
7420 sm_syslog(LOG_INFO, NOQID,
7421 "Adding %s to stab, path: %s", qg->qg_name,
7423 s = stab(qg->qg_name, ST_QUEUE, ST_ENTER);
7424 if (s->s_quegrp != NULL)
7426 i = s->s_quegrp->qg_index;
7428 /* XXX what about the pointers inside this struct? */
7429 sm_free(s->s_quegrp); /* XXX */
7433 Queue[i] = s->s_quegrp = qg;
7436 /* set default value for max queue runners */
7437 if (qg->qg_maxqrun < 0)
7439 if (MaxRunnersPerQueue > 0)
7440 qg->qg_maxqrun = MaxRunnersPerQueue;
7445 setbitn(QD_DEFINED, qg->qg_flags);
7449 ** HASHFQN -- calculate a hash value for a fully qualified host name
7452 ** fqn -- an all lower-case host.domain string
7453 ** buckets -- the number of buckets (queue directories)
7456 ** a bucket number (signed integer)
7459 ** Contributed by Exactis.com, Inc.
7463 hashfqn(fqn, buckets)
7468 register int h = 0, hash, cnt;
7474 ** A variation on the gdb hash
7475 ** This is the best as of Feb 19, 1996 --bcx
7479 h = 0x238F13AF * strlen(p);
7480 for (cnt = 0; *p != 0; ++p, cnt++)
7482 h = (h + (*p << (cnt * 5 % 24))) & 0x7FFFFFFF;
7484 h = (1103515243 * h + 12345) & 0x7FFFFFFF;
7488 hash = (h % buckets);
7495 ** A structure for sorting Queue according to maxqrun without
7496 ** screwing up Queue itself.
7501 int sg_idx; /* original index */
7502 int sg_maxqrun; /* max queue runners */
7504 typedef struct sortqgrp SORTQGRP_T;
7505 static int cmpidx __P((const void *, const void *));
7512 /* The sort is highest to lowest, so the comparison is reversed */
7513 if (((SORTQGRP_T *)a)->sg_maxqrun < ((SORTQGRP_T *)b)->sg_maxqrun)
7515 else if (((SORTQGRP_T *)a)->sg_maxqrun > ((SORTQGRP_T *)b)->sg_maxqrun)
7522 ** MAKEWORKGROUP -- balance queue groups into work groups per MaxQueueChildren
7524 ** Take the now defined queue groups and assign them to work groups.
7525 ** This is done to balance out the number of concurrently active
7526 ** queue runners such that MaxQueueChildren is not exceeded. This may
7527 ** result in more than one queue group per work group. In such a case
7528 ** the number of running queue groups in that work group will have no
7529 ** more than the work group maximum number of runners (a "fair" portion
7530 ** of MaxQueueRunners). All queue groups within a work group will get a
7531 ** chance at running.
7540 ** Sets up WorkGrp structure.
7546 int i, j, total_runners, dir, h;
7547 SORTQGRP_T si[MAXQUEUEGROUPS + 1];
7550 if (NumQueue == 1 && strcmp(Queue[0]->qg_name, "mqueue") == 0)
7553 ** There is only the "mqueue" queue group (a default)
7554 ** containing all of the queues. We want to provide to
7555 ** this queue group the maximum allowable queue runners.
7556 ** To match older behavior (8.10/8.11) we'll try for
7557 ** 1 runner per queue capping it at MaxQueueChildren.
7558 ** So if there are N queues, then there will be N runners
7559 ** for the "mqueue" queue group (where N is kept less than
7560 ** MaxQueueChildren).
7564 WorkGrp[0].wg_numqgrp = 1;
7565 WorkGrp[0].wg_qgs = (QUEUEGRP **) xalloc(sizeof(QUEUEGRP *));
7566 WorkGrp[0].wg_qgs[0] = Queue[0];
7567 if (MaxQueueChildren > 0 &&
7568 Queue[0]->qg_numqueues > MaxQueueChildren)
7569 WorkGrp[0].wg_runners = MaxQueueChildren;
7571 WorkGrp[0].wg_runners = Queue[0]->qg_numqueues;
7573 Queue[0]->qg_wgrp = 0;
7575 /* can't have more runners than allowed total */
7576 if (MaxQueueChildren > 0 &&
7577 Queue[0]->qg_maxqrun > MaxQueueChildren)
7578 Queue[0]->qg_maxqrun = MaxQueueChildren;
7579 WorkGrp[0].wg_maxact = Queue[0]->qg_maxqrun;
7580 WorkGrp[0].wg_lowqintvl = Queue[0]->qg_queueintvl;
7584 for (i = 0; i < NumQueue; i++)
7586 si[i].sg_maxqrun = Queue[i]->qg_maxqrun;
7589 qsort(si, NumQueue, sizeof(si[0]), cmpidx);
7592 for (i = 0; i < NumQueue; i++)
7594 total_runners += si[i].sg_maxqrun;
7595 if (MaxQueueChildren <= 0 || total_runners <= MaxQueueChildren)
7601 if (NumWorkGroups < 1)
7602 NumWorkGroups = 1; /* gotta have one at least */
7603 else if (NumWorkGroups > MAXWORKGROUPS)
7604 NumWorkGroups = MAXWORKGROUPS; /* the limit */
7607 ** We now know the number of work groups to pack the queue groups
7608 ** into. The queue groups in 'Queue' are sorted from highest
7609 ** to lowest for the number of runners per queue group.
7610 ** We put the queue groups with the largest number of runners
7611 ** into work groups first. Then the smaller ones are fitted in
7612 ** where it looks best.
7617 for (i = 0; i < NumQueue; i++)
7619 /* a to-and-fro packing scheme, continue from last position */
7620 if (j >= NumWorkGroups)
7623 j = NumWorkGroups - 1;
7631 if (WorkGrp[j].wg_qgs == NULL)
7632 WorkGrp[j].wg_qgs = (QUEUEGRP **)sm_malloc(sizeof(QUEUEGRP *) *
7633 (WorkGrp[j].wg_numqgrp + 1));
7635 WorkGrp[j].wg_qgs = (QUEUEGRP **)sm_realloc(WorkGrp[j].wg_qgs,
7636 sizeof(QUEUEGRP *) *
7637 (WorkGrp[j].wg_numqgrp + 1));
7638 if (WorkGrp[j].wg_qgs == NULL)
7640 syserr("!cannot allocate memory for work queues, need %d bytes",
7641 (int) (sizeof(QUEUEGRP *) *
7642 (WorkGrp[j].wg_numqgrp + 1)));
7646 WorkGrp[j].wg_qgs[WorkGrp[j].wg_numqgrp] = Queue[h];
7647 WorkGrp[j].wg_numqgrp++;
7648 WorkGrp[j].wg_runners += Queue[h]->qg_maxqrun;
7649 Queue[h]->qg_wgrp = j;
7651 if (WorkGrp[j].wg_maxact == 0)
7653 /* can't have more runners than allowed total */
7654 if (MaxQueueChildren > 0 &&
7655 Queue[h]->qg_maxqrun > MaxQueueChildren)
7656 Queue[h]->qg_maxqrun = MaxQueueChildren;
7657 WorkGrp[j].wg_maxact = Queue[h]->qg_maxqrun;
7661 ** XXX: must wg_lowqintvl be the GCD?
7662 ** qg1: 2m, qg2: 3m, minimum: 2m, when do queue runs for
7666 /* keep track of the lowest interval for a persistent runner */
7667 if (Queue[h]->qg_queueintvl > 0 &&
7668 WorkGrp[j].wg_lowqintvl < Queue[h]->qg_queueintvl)
7669 WorkGrp[j].wg_lowqintvl = Queue[h]->qg_queueintvl;
7674 for (i = 0; i < NumWorkGroups; i++)
7676 sm_dprintf("Workgroup[%d]=", i);
7677 for (j = 0; j < WorkGrp[i].wg_numqgrp; j++)
7680 WorkGrp[i].wg_qgs[j]->qg_name);
7688 ** DUP_DF -- duplicate envelope data file
7690 ** Copy the data file from the 'old' envelope to the 'new' envelope
7691 ** in the most efficient way possible.
7693 ** Create a hard link from the 'old' data file to the 'new' data file.
7694 ** If the old and new queue directories are on different file systems,
7695 ** then the new data file link is created in the old queue directory,
7696 ** and the new queue file will contain a 'd' record pointing to the
7697 ** directory containing the new data file.
7700 ** old -- old envelope.
7701 ** new -- new envelope.
7704 ** Returns true on success, false on failure.
7707 ** On success, the new data file is created.
7708 ** On fatal failure, EF_FATALERRS is set in old->e_flags.
7711 static bool dup_df __P((ENVELOPE *, ENVELOPE *));
7719 char opath[MAXPATHLEN];
7720 char npath[MAXPATHLEN];
7722 if (!bitset(EF_HAS_DF, old->e_flags))
7725 ** this can happen if: SuperSafe != True
7726 ** and a bounce mail is sent that is split.
7729 queueup(old, false, true);
7731 SM_REQUIRE(ISVALIDQGRP(old->e_qgrp) && ISVALIDQDIR(old->e_qdir));
7732 SM_REQUIRE(ISVALIDQGRP(new->e_qgrp) && ISVALIDQDIR(new->e_qdir));
7734 (void) sm_strlcpy(opath, queuename(old, DATAFL_LETTER), sizeof opath);
7735 (void) sm_strlcpy(npath, queuename(new, DATAFL_LETTER), sizeof npath);
7737 if (old->e_dfp != NULL)
7739 r = sm_io_setinfo(old->e_dfp, SM_BF_COMMIT, NULL);
7740 if (r < 0 && errno != EINVAL)
7742 syserr("@can't commit %s", opath);
7743 old->e_flags |= EF_FATALERRS;
7749 ** Attempt to create a hard link, if we think both old and new
7750 ** are on the same file system, otherwise copy the file.
7752 ** Don't waste time attempting a hard link unless old and new
7753 ** are on the same file system.
7756 SM_REQUIRE(ISVALIDQGRP(old->e_dfqgrp) && ISVALIDQDIR(old->e_dfqdir));
7757 SM_REQUIRE(ISVALIDQGRP(new->e_dfqgrp) && ISVALIDQDIR(new->e_dfqdir));
7759 ofs = Queue[old->e_dfqgrp]->qg_qpaths[old->e_dfqdir].qp_fsysidx;
7760 nfs = Queue[new->e_dfqgrp]->qg_qpaths[new->e_dfqdir].qp_fsysidx;
7761 if (FILE_SYS_DEV(ofs) == FILE_SYS_DEV(nfs))
7763 if (link(opath, npath) == 0)
7765 new->e_flags |= EF_HAS_DF;
7766 SYNC_DIR(npath, true);
7773 ** Can't link across queue directories, so try to create a hard
7774 ** link in the same queue directory as the old df file.
7775 ** The qf file will refer to the new df file using a 'd' record.
7778 new->e_dfqgrp = old->e_dfqgrp;
7779 new->e_dfqdir = old->e_dfqdir;
7780 (void) sm_strlcpy(npath, queuename(new, DATAFL_LETTER), sizeof npath);
7781 if (link(opath, npath) == 0)
7783 new->e_flags |= EF_HAS_DF;
7784 SYNC_DIR(npath, true);
7790 sm_syslog(LOG_ERR, old->e_id,
7791 "dup_df: can't link %s to %s, error=%s, envelope splitting failed",
7792 opath, npath, sm_errstring(errno));
7797 ** SPLIT_ENV -- Allocate a new envelope based on a given envelope.
7801 ** sendqueue -- sendqueue for new envelope.
7802 ** qgrp -- index of queue group.
7803 ** qdir -- queue directory.
7810 static ENVELOPE *split_env __P((ENVELOPE *, ADDRESS *, int, int));
7813 split_env(e, sendqueue, qgrp, qdir)
7821 ee = (ENVELOPE *) sm_rpool_malloc_x(e->e_rpool, sizeof *ee);
7822 STRUCTCOPY(*e, *ee);
7823 ee->e_message = NULL; /* XXX use original message? */
7826 ee->e_sendqueue = sendqueue;
7827 ee->e_flags &= ~(EF_INQUEUE|EF_CLRQUEUE|EF_FATALERRS
7828 |EF_SENDRECEIPT|EF_RET_PARAM|EF_HAS_DF);
7829 ee->e_flags |= EF_NORECEIPT; /* XXX really? */
7830 ee->e_from.q_state = QS_SENDER;
7832 ee->e_lockfp = NULL;
7833 if (e->e_xfp != NULL)
7834 ee->e_xfp = sm_io_dup(e->e_xfp);
7836 /* failed to dup e->e_xfp, start a new transcript */
7837 if (ee->e_xfp == NULL)
7840 ee->e_qgrp = ee->e_dfqgrp = qgrp;
7841 ee->e_qdir = ee->e_dfqdir = qdir;
7842 ee->e_errormode = EM_MAIL;
7843 ee->e_statmsg = NULL;
7844 if (e->e_quarmsg != NULL)
7845 ee->e_quarmsg = sm_rpool_strdup_x(ee->e_rpool,
7849 ** XXX Not sure if this copying is necessary.
7850 ** sendall() does this copying, but I (dm) don't know if that is
7851 ** because of the storage management discipline we were using
7852 ** before rpools were introduced, or if it is because these lists
7853 ** can be modified later.
7856 ee->e_header = copyheader(e->e_header, ee->e_rpool);
7857 ee->e_errorqueue = copyqueue(e->e_errorqueue, ee->e_rpool);
7862 /* return values from split functions, check also below! */
7863 #define SM_SPLIT_FAIL (0)
7864 #define SM_SPLIT_NONE (1)
7865 #define SM_SPLIT_NEW(n) (1 + (n))
7868 ** SPLIT_ACROSS_QUEUE_GROUPS
7870 ** This function splits an envelope across multiple queue groups
7871 ** based on the queue group of each recipient.
7877 ** SM_SPLIT_FAIL on failure
7878 ** SM_SPLIT_NONE if no splitting occurred,
7879 ** or 1 + the number of additional envelopes created.
7882 ** On success, e->e_sibling points to a list of zero or more
7883 ** additional envelopes, and the associated data files exist
7884 ** on disk. But the queue files are not created.
7886 ** On failure, e->e_sibling is not changed.
7887 ** The order of recipients in e->e_sendqueue is permuted.
7888 ** Abandoned data files for additional envelopes that failed
7889 ** to be created may exist on disk.
7892 static int q_qgrp_compare __P((const void *, const void *));
7893 static int e_filesys_compare __P((const void *, const void *));
7896 q_qgrp_compare(p1, p2)
7900 ADDRESS **pq1 = (ADDRESS **) p1;
7901 ADDRESS **pq2 = (ADDRESS **) p2;
7903 return (*pq1)->q_qgrp - (*pq2)->q_qgrp;
7907 e_filesys_compare(p1, p2)
7911 ENVELOPE **pe1 = (ENVELOPE **) p1;
7912 ENVELOPE **pe2 = (ENVELOPE **) p2;
7915 fs1 = Queue[(*pe1)->e_qgrp]->qg_qpaths[(*pe1)->e_qdir].qp_fsysidx;
7916 fs2 = Queue[(*pe2)->e_qgrp]->qg_qpaths[(*pe2)->e_qdir].qp_fsysidx;
7917 if (FILE_SYS_DEV(fs1) < FILE_SYS_DEV(fs2))
7919 if (FILE_SYS_DEV(fs1) > FILE_SYS_DEV(fs2))
7925 split_across_queue_groups(e)
7928 int naddrs, nsplits, i;
7931 ADDRESS *q, **addrs;
7933 ENVELOPE *splits[MAXQUEUEGROUPS];
7934 char pvpbuf[PSBUFSIZE];
7936 SM_REQUIRE(ISVALIDQGRP(e->e_qgrp));
7938 /* Count addresses and assign queue groups. */
7941 for (q = e->e_sendqueue; q != NULL; q = q->q_next)
7943 if (QS_IS_DEAD(q->q_state))
7947 /* bad addresses and those already sent stay put */
7948 if (QS_IS_BADADDR(q->q_state) ||
7949 QS_IS_SENT(q->q_state))
7950 q->q_qgrp = e->e_qgrp;
7951 else if (!ISVALIDQGRP(q->q_qgrp))
7953 /* call ruleset which should return a queue group */
7954 i = rscap(RS_QUEUEGROUP, q->q_user, NULL, e, &pvp,
7955 pvpbuf, sizeof(pvpbuf));
7957 pvp != NULL && pvp[0] != NULL &&
7958 (pvp[0][0] & 0377) == CANONNET &&
7959 pvp[1] != NULL && pvp[1][0] != '\0')
7961 i = name2qid(pvp[1]);
7967 sm_syslog(LOG_INFO, NOQID,
7968 "queue group name %s -> %d",
7972 else if (LogLevel > 10)
7973 sm_syslog(LOG_INFO, NOQID,
7974 "can't find queue group name %s, selection ignored",
7977 if (q->q_mailer != NULL &&
7978 ISVALIDQGRP(q->q_mailer->m_qgrp))
7981 q->q_qgrp = q->q_mailer->m_qgrp;
7983 else if (ISVALIDQGRP(e->e_qgrp))
7984 q->q_qgrp = e->e_qgrp;
7990 /* only one address? nothing to split. */
7991 if (naddrs <= 1 && !changed)
7992 return SM_SPLIT_NONE;
7994 /* sort the addresses by queue group */
7995 addrs = sm_rpool_malloc_x(e->e_rpool, naddrs * sizeof(ADDRESS *));
7996 for (i = 0, q = e->e_sendqueue; q != NULL; q = q->q_next)
7998 if (QS_IS_DEAD(q->q_state))
8002 qsort(addrs, naddrs, sizeof(ADDRESS *), q_qgrp_compare);
8004 /* split into multiple envelopes, by queue group */
8007 e->e_sendqueue = NULL;
8008 for (i = 0; i < naddrs; ++i)
8010 if (i == naddrs - 1 || addrs[i]->q_qgrp != addrs[i + 1]->q_qgrp)
8011 addrs[i]->q_next = NULL;
8013 addrs[i]->q_next = addrs[i + 1];
8015 /* same queue group as original envelope? */
8016 if (addrs[i]->q_qgrp == e->e_qgrp)
8018 if (e->e_sendqueue == NULL)
8019 e->e_sendqueue = addrs[i];
8023 /* different queue group than original envelope */
8024 if (es == NULL || addrs[i]->q_qgrp != es->e_qgrp)
8026 ee = split_env(e, addrs[i], addrs[i]->q_qgrp, NOQDIR);
8028 splits[nsplits++] = ee;
8032 /* no splits? return right now. */
8034 return SM_SPLIT_NONE;
8036 /* assign a queue directory to each additional envelope */
8037 for (i = 0; i < nsplits; ++i)
8041 es->e_qdir = pickqdir(Queue[es->e_qgrp], es->e_msgsize, es);
8043 if (!setnewqueue(es))
8047 /* sort the additional envelopes by queue file system */
8048 qsort(splits, nsplits, sizeof(ENVELOPE *), e_filesys_compare);
8050 /* create data files for each additional envelope */
8051 if (!dup_df(e, splits[0]))
8056 for (i = 1; i < nsplits; ++i)
8058 /* copy or link to the previous data file */
8059 if (!dup_df(splits[i - 1], splits[i]))
8063 /* success: prepend the new envelopes to the e->e_sibling list */
8064 for (i = 0; i < nsplits; ++i)
8067 es->e_sibling = e->e_sibling;
8070 return SM_SPLIT_NEW(nsplits);
8072 /* failure: clean up */
8078 for (j = 0; j < i; j++)
8079 (void) unlink(queuename(splits[j], DATAFL_LETTER));
8081 e->e_sendqueue = addrs[0];
8082 for (i = 0; i < naddrs - 1; ++i)
8083 addrs[i]->q_next = addrs[i + 1];
8084 addrs[naddrs - 1]->q_next = NULL;
8085 return SM_SPLIT_FAIL;
8089 ** SPLIT_WITHIN_QUEUE
8091 ** Split an envelope with multiple recipients into several
8092 ** envelopes within the same queue directory, if the number of
8093 ** recipients exceeds the limit for the queue group.
8099 ** SM_SPLIT_FAIL on failure
8100 ** SM_SPLIT_NONE if no splitting occurred,
8101 ** or 1 + the number of additional envelopes created.
8104 #define SPLIT_LOG_LEVEL 8
8106 static int split_within_queue __P((ENVELOPE *));
8109 split_within_queue(e)
8112 int maxrcpt, nrcpt, ndead, nsplit, i;
8115 ADDRESS *q, **addrs;
8116 ENVELOPE *ee, *firstsibling;
8118 if (!ISVALIDQGRP(e->e_qgrp) || bitset(EF_SPLIT, e->e_flags))
8119 return SM_SPLIT_NONE;
8121 /* don't bother if there is no recipient limit */
8122 maxrcpt = Queue[e->e_qgrp]->qg_maxrcpt;
8124 return SM_SPLIT_NONE;
8126 /* count recipients */
8128 for (q = e->e_sendqueue; q != NULL; q = q->q_next)
8130 if (QS_IS_DEAD(q->q_state))
8134 if (nrcpt <= maxrcpt)
8135 return SM_SPLIT_NONE;
8138 ** Preserve the recipient list
8139 ** so that we can restore it in case of error.
8140 ** (But we discard dead addresses.)
8143 addrs = sm_rpool_malloc_x(e->e_rpool, nrcpt * sizeof(ADDRESS *));
8144 for (i = 0, q = e->e_sendqueue; q != NULL; q = q->q_next)
8146 if (QS_IS_DEAD(q->q_state))
8152 ** Partition the recipient list so that bad and sent addresses
8153 ** come first. These will go with the original envelope, and
8154 ** do not count towards the maxrcpt limit.
8155 ** addrs[] does not contain QS_IS_DEAD() addresses.
8159 for (i = 0; i < nrcpt; ++i)
8161 if (QS_IS_BADADDR(addrs[i]->q_state) ||
8162 QS_IS_SENT(addrs[i]->q_state) ||
8163 QS_IS_DEAD(addrs[i]->q_state)) /* for paranoia's sake */
8167 ADDRESS *tmp = addrs[i];
8169 addrs[i] = addrs[ndead];
8176 /* Check if no splitting required. */
8177 if (nrcpt - ndead <= maxrcpt)
8178 return SM_SPLIT_NONE;
8181 for (i = 0; i < nrcpt - 1; ++i)
8182 addrs[i]->q_next = addrs[i + 1];
8183 addrs[nrcpt - 1]->q_next = NULL;
8184 e->e_sendqueue = addrs[0];
8186 /* prepare buffer for logging */
8187 if (LogLevel > SPLIT_LOG_LEVEL)
8190 lsplits = sm_malloc(l);
8191 if (lsplits != NULL)
8197 /* get rid of stupid compiler warnings */
8202 /* split the envelope */
8203 firstsibling = e->e_sibling;
8204 i = maxrcpt + ndead;
8208 addrs[i - 1]->q_next = NULL;
8209 ee = split_env(e, addrs[i], e->e_qgrp, e->e_qdir);
8216 (void) unlink(queuename(ee, DATAFL_LETTER));
8220 /* Error. Restore e's sibling & recipient lists. */
8221 e->e_sibling = firstsibling;
8222 for (i = 0; i < nrcpt - 1; ++i)
8223 addrs[i]->q_next = addrs[i + 1];
8224 if (lsplits != NULL)
8226 return SM_SPLIT_FAIL;
8229 /* prepend the new envelope to e->e_sibling */
8230 ee->e_sibling = e->e_sibling;
8233 if (LogLevel > SPLIT_LOG_LEVEL && lsplits != NULL)
8235 if (j >= l - strlen(ee->e_id) - 3)
8240 p = sm_realloc(lsplits, l);
8243 /* let's try to get this done */
8250 if (lsplits != NULL)
8253 j += sm_strlcat(lsplits + j,
8257 j += sm_strlcat2(lsplits + j,
8264 if (nrcpt - i <= maxrcpt)
8268 if (LogLevel > SPLIT_LOG_LEVEL && lsplits != NULL)
8272 sm_syslog(LOG_NOTICE, e->e_id,
8273 "split: maxrcpts=%d, rcpts=%d, count=%d, id%s=%s",
8274 maxrcpt, nrcpt - ndead, nsplit,
8275 nsplit > 1 ? "s" : "", lsplits);
8279 return SM_SPLIT_NEW(nsplit);
8282 ** SPLIT_BY_RECIPIENT
8284 ** Split an envelope with multiple recipients into multiple
8285 ** envelopes as required by the sendmail configuration.
8291 ** Returns true on success, false on failure.
8294 ** see split_across_queue_groups(), split_within_queue(e)
8298 split_by_recipient(e)
8301 int split, n, i, j, l;
8303 ENVELOPE *ee, *next, *firstsibling;
8305 if (OpMode == SM_VERIFY || !ISVALIDQGRP(e->e_qgrp) ||
8306 bitset(EF_SPLIT, e->e_flags))
8308 n = split_across_queue_groups(e);
8309 if (n == SM_SPLIT_FAIL)
8311 firstsibling = ee = e->e_sibling;
8312 if (n > 1 && LogLevel > SPLIT_LOG_LEVEL)
8315 lsplits = sm_malloc(l);
8316 if (lsplits != NULL)
8322 /* get rid of stupid compiler warnings */
8326 for (i = 1; i < n; ++i)
8328 next = ee->e_sibling;
8329 if (split_within_queue(ee) == SM_SPLIT_FAIL)
8331 e->e_sibling = firstsibling;
8334 ee->e_flags |= EF_SPLIT;
8335 if (LogLevel > SPLIT_LOG_LEVEL && lsplits != NULL)
8337 if (j >= l - strlen(ee->e_id) - 3)
8342 p = sm_realloc(lsplits, l);
8345 /* let's try to get this done */
8352 if (lsplits != NULL)
8355 j += sm_strlcat(lsplits + j,
8358 j += sm_strlcat2(lsplits + j, "; ",
8365 if (LogLevel > SPLIT_LOG_LEVEL && lsplits != NULL && n > 1)
8367 sm_syslog(LOG_NOTICE, e->e_id, "split: count=%d, id%s=%s",
8368 n - 1, n > 2 ? "s" : "", lsplits);
8371 split = split_within_queue(e) != SM_SPLIT_FAIL;
8373 e->e_flags |= EF_SPLIT;
8378 ** QUARANTINE_QUEUE_ITEM -- {un,}quarantine a single envelope
8380 ** Add/remove quarantine reason and requeue appropriately.
8383 ** qgrp -- queue group for the item
8384 ** qdir -- queue directory in the given queue group
8385 ** e -- envelope information for the item
8386 ** reason -- quarantine reason, NULL means unquarantine.
8389 ** true if item changed, false otherwise
8392 ** Changes quarantine tag in queue file and renames it.
8396 quarantine_queue_item(qgrp, qdir, e, reason)
8403 bool failing = false;
8404 bool foundq = false;
8405 bool finished = false;
8411 MODE_T oldumask = 0;
8412 SM_FILE_T *oldqfp, *tempqfp;
8414 char oldqf[MAXPATHLEN];
8415 char tempqf[MAXPATHLEN];
8416 char newqf[MAXPATHLEN];
8419 oldtype = queue_letter(e, ANYQFL_LETTER);
8420 (void) sm_strlcpy(oldqf, queuename(e, ANYQFL_LETTER), sizeof oldqf);
8421 (void) sm_strlcpy(tempqf, queuename(e, NEWQFL_LETTER), sizeof tempqf);
8424 ** Instead of duplicating all the open
8425 ** and lock code here, tell readqf() to
8426 ** do that work and return the open
8427 ** file pointer in e_lockfp. Note that
8428 ** we must release the locks properly when
8432 if (!readqf(e, true))
8434 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8435 "Skipping %s\n", qid_printname(e));
8438 oldqfp = e->e_lockfp;
8440 /* open the new queue file */
8441 flags = O_CREAT|O_WRONLY|O_EXCL;
8442 if (bitset(S_IWGRP, QueueFileMode))
8443 oldumask = umask(002);
8444 fd = open(tempqf, flags, QueueFileMode);
8445 if (bitset(S_IWGRP, QueueFileMode))
8446 (void) umask(oldumask);
8452 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8453 "Skipping %s: Could not open %s: %s\n",
8454 qid_printname(e), tempqf,
8455 sm_errstring(save_errno));
8456 (void) sm_io_close(oldqfp, SM_TIME_DEFAULT);
8459 if (!lockfile(fd, tempqf, NULL, LOCK_EX|LOCK_NB))
8461 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8462 "Skipping %s: Could not lock %s\n",
8463 qid_printname(e), tempqf);
8465 (void) sm_io_close(oldqfp, SM_TIME_DEFAULT);
8469 tempqfp = sm_io_open(SmFtStdiofd, SM_TIME_DEFAULT, (void *) &fd,
8470 SM_IO_WRONLY_B, NULL);
8471 if (tempqfp == NULL)
8473 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8474 "Skipping %s: Could not lock %s\n",
8475 qid_printname(e), tempqf);
8477 (void) sm_io_close(oldqfp, SM_TIME_DEFAULT);
8481 /* Copy the data over, changing the quarantine reason */
8482 while ((bp = fgetfolded(buf, sizeof buf, oldqfp)) != NULL)
8485 sm_dprintf("+++++ %s\n", bp);
8488 case 'q': /* quarantine reason */
8494 (void) sm_io_fprintf(smioout,
8496 "%s: Removed quarantine of \"%s\"\n",
8499 sm_syslog(LOG_INFO, e->e_id, "unquarantine");
8503 else if (strcmp(reason, &bp[1]) == 0)
8507 (void) sm_io_fprintf(smioout,
8509 "%s: Already quarantined with \"%s\"\n",
8512 (void) sm_io_fprintf(tempqfp, SM_TIME_DEFAULT,
8519 (void) sm_io_fprintf(smioout,
8521 "%s: Quarantine changed from \"%s\" to \"%s\"\n",
8525 (void) sm_io_fprintf(tempqfp, SM_TIME_DEFAULT,
8527 sm_syslog(LOG_INFO, e->e_id, "quarantine=%s",
8535 ** If we are quarantining an unquarantined item,
8536 ** need to put in a new 'q' line before it's
8540 if (!foundq && reason != NULL)
8544 (void) sm_io_fprintf(smioout,
8546 "%s: Quarantined with \"%s\"\n",
8549 (void) sm_io_fprintf(tempqfp, SM_TIME_DEFAULT,
8551 sm_syslog(LOG_INFO, e->e_id, "quarantine=%s",
8557 /* Copy the line to the new file */
8558 (void) sm_io_fprintf(tempqfp, SM_TIME_DEFAULT,
8567 /* Copy the line to the new file */
8568 (void) sm_io_fprintf(tempqfp, SM_TIME_DEFAULT,
8574 /* Make sure we read the whole old file */
8575 errno = sm_io_error(tempqfp);
8576 if (errno != 0 && errno != SM_IO_EOF)
8579 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8580 "Skipping %s: Error reading %s: %s\n",
8581 qid_printname(e), oldqf,
8582 sm_errstring(save_errno));
8586 if (!failing && !finished)
8588 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8589 "Skipping %s: Incomplete file: %s\n",
8590 qid_printname(e), oldqf);
8594 /* Check if we actually changed anything or we can just bail now */
8597 /* pretend we failed, even though we technically didn't */
8601 /* Make sure we wrote things out safely */
8603 (sm_io_flush(tempqfp, SM_TIME_DEFAULT) != 0 ||
8604 ((SuperSafe == SAFE_REALLY ||
8605 SuperSafe == SAFE_REALLY_POSTMILTER ||
8606 SuperSafe == SAFE_INTERACTIVE) &&
8607 fsync(sm_io_getinfo(tempqfp, SM_IO_WHAT_FD, NULL)) < 0) ||
8608 ((errno = sm_io_error(tempqfp)) != 0)))
8611 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8612 "Skipping %s: Error writing %s: %s\n",
8613 qid_printname(e), tempqf,
8614 sm_errstring(save_errno));
8619 /* Figure out the new filename */
8620 newtype = (reason == NULL ? NORMQF_LETTER : QUARQF_LETTER);
8621 if (oldtype == newtype)
8623 /* going to rename tempqf to oldqf */
8624 (void) sm_strlcpy(newqf, oldqf, sizeof newqf);
8628 /* going to rename tempqf to new name based on newtype */
8629 (void) sm_strlcpy(newqf, queuename(e, newtype), sizeof newqf);
8634 /* rename tempqf to newqf */
8636 rename(tempqf, newqf) < 0)
8637 save_errno = (errno == 0) ? EINVAL : errno;
8639 /* Check rename() success */
8640 if (!failing && save_errno != 0)
8642 sm_syslog(LOG_DEBUG, e->e_id,
8643 "quarantine_queue_item: rename(%s, %s): %s",
8644 tempqf, newqf, sm_errstring(save_errno));
8646 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8647 "Error renaming %s to %s: %s\n",
8649 sm_errstring(save_errno));
8650 if (oldtype == newtype)
8653 ** Bail here since we don't know the state of
8654 ** the filesystem and may need to keep tempqf
8655 ** for the user to rescue us.
8660 syserr("!452 Error renaming control file %s", tempqf);
8665 /* remove new file (if rename() half completed) */
8666 if (xunlink(newqf) < 0)
8669 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8670 "Error removing %s: %s\n",
8672 sm_errstring(save_errno));
8675 /* tempqf removed below */
8681 /* If changing file types, need to remove old type */
8682 if (!failing && oldtype != newtype)
8684 if (xunlink(oldqf) < 0)
8687 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8688 "Error removing %s: %s\n",
8689 oldqf, sm_errstring(save_errno));
8693 /* see if anything above failed */
8696 /* Something failed: remove new file, old file still there */
8697 (void) xunlink(tempqf);
8701 ** fsync() after file operations to make sure metadata is
8702 ** written to disk on filesystems in which renames are
8703 ** not guaranteed. It's ok if they fail, mail won't be lost.
8706 if (SuperSafe != SAFE_NO)
8708 /* for soft-updates */
8709 (void) fsync(sm_io_getinfo(tempqfp,
8710 SM_IO_WHAT_FD, NULL));
8714 /* for soft-updates */
8715 (void) fsync(sm_io_getinfo(oldqfp,
8716 SM_IO_WHAT_FD, NULL));
8719 /* for other odd filesystems */
8720 SYNC_DIR(tempqf, false);
8725 if (tempqfp != NULL)
8726 (void) sm_io_close(tempqfp, SM_TIME_DEFAULT);
8728 (void) sm_io_close(oldqfp, SM_TIME_DEFAULT);
8735 ** QUARANTINE_QUEUE -- {un,}quarantine matching items in the queue
8737 ** Read all matching queue items, add/remove quarantine
8738 ** reason, and requeue appropriately.
8741 ** reason -- quarantine reason, "." means unquarantine.
8742 ** qgrplimit -- limit to single queue group unless NOQGRP
8748 ** Lots of changes to the queue.
8752 quarantine_queue(reason, qgrplimit)
8759 /* Convert internal representation of unquarantine */
8760 if (reason != NULL && reason[0] == '.' && reason[1] == '\0')
8766 reason = newstr(denlstring(reason, true, true));
8769 for (qgrp = 0; qgrp < NumQueue && Queue[qgrp] != NULL; qgrp++)
8773 if (qgrplimit != NOQGRP && qgrplimit != qgrp)
8776 for (qdir = 0; qdir < Queue[qgrp]->qg_numqueues; qdir++)
8784 nrequests = gatherq(qgrp, qdir, true, NULL, NULL);
8786 /* first see if there is anything */
8791 (void) sm_io_fprintf(smioout,
8792 SM_TIME_DEFAULT, "%s: no matches\n",
8793 qid_printqueue(qgrp, qdir));
8800 (void) sm_io_fprintf(smioout,
8801 SM_TIME_DEFAULT, "Processing %s:\n",
8802 qid_printqueue(qgrp, qdir));
8805 for (i = 0; i < WorkListCount; i++)
8812 /* setup envelope */
8813 clearenvelope(&e, true, sm_rpool_new_x(NULL));
8814 e.e_id = WorkList[i].w_name + 2;
8820 sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8821 "Would do %s\n", e.e_id);
8824 else if (quarantine_queue_item(qgrp, qdir,
8829 sm_rpool_free(e.e_rpool);
8832 if (WorkList != NULL)
8833 sm_free(WorkList); /* XXX */
8842 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8845 (void) sm_io_fprintf(smioout, SM_TIME_DEFAULT,
8848 changed == 1 ? "" : "s");