sendmail/src/queue.c

208 **  Queue data in shared memory
633 			Queue[e->e_dfqgrp]->qg_qpaths[e->e_dfqdir].qp_name);
785 	**	Expand macros completely here.  Queue run will deal with
1333 		if (Queue[qgrp]->qg_queueintvl > 0)
1334 			qintvl = Queue[qgrp]->qg_queueintvl;
1340 		lastsched = Queue[qgrp]->qg_nextrun;
1342 		if ((runall || Queue[qgrp]->qg_nextrun <= now) && qintvl > 0)
1358 				Queue[qgrp]->qg_nextrun += qintvl;
1365 				(long) Queue[qgrp]->qg_queueintvl,
1367 				(long) Queue[qgrp]->qg_nextrun, sched);
1400 	for (qgrp = 0; qgrp < NumQueue && Queue[qgrp] != NULL; qgrp++)
1404 		if (Queue[qgrp]->qg_queueintvl > 0)
1405 			qintvl = Queue[qgrp]->qg_queueintvl;
1410 		if (Queue[qgrp]->qg_nextrun <= now - qintvl)
1418 					arpadate(ctime(&Queue[qgrp]->qg_nextrun)),
1745 		**  In the case of the BYHOST Queue Sort Order, the 'item'
1998 			proc_list_add(pid, "Queue runner", PROC_QUEUE,
2027 		proc_list_add(CurrentPid, "Queue runner child process",
2105 		    (Queue[qgrp]->qg_nextrun <= now &&
2106 		     Queue[qgrp]->qg_nextrun != (time_t) -1))
2117 	qdir = Queue[qgrp]->qg_curnum; /* round-robin init of queue position */
2128 	if (Queue[qgrp]->qg_nice > 0)
2129 		(void) nice(Queue[qgrp]->qg_nice);
2149 	for (i = 0; i < Queue[qgrp]->qg_numqueues; i++)
2154 			QSHM_ENTRIES(Queue[qgrp]->qg_qpaths[qdir].qp_idx) = h;
2161 			qdir %= Queue[qgrp]->qg_numqueues;
2170 	njobs = sortq(Queue[qgrp]->qg_maxlist);
2171 	Queue[qgrp]->qg_curnum = qdir; /* update */
2174 	if (!Verbose && bitnset(QD_FORK, Queue[qgrp]->qg_flags))
2190 		maxrunners = Queue[qgrp]->qg_maxqrun;
2237 				proc_list_add(pid, "Queue child runner process",
2318 	else if (Queue[qgrp]->qg_maxqrun > 0 || bitset(RWG_FORCE, flags))
2542 			Queue[qgrp]->qg_qpaths[qdir].qp_name,
2544 				Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
4254 				     qgrp < NumQueue && Queue[qgrp] != NULL;
4258 					     qdir < Queue[qgrp]->qg_numqueues;
4262 							   Queue[qgrp]->qg_qpaths[qdir].qp_name)
4752 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
4758 		for (j = 0; j < Queue[i]->qg_numqueues; j++)
4765 			n = QSHM_ENTRIES(Queue[i]->qg_qpaths[j].qp_idx);
4824 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
4829 		for (j = 0; j < Queue[i]->qg_numqueues; j++)
4876 			Queue[qgrp]->qg_qpaths[qdir].qp_name,
4878 				Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
4881 			Queue[qgrp]->qg_qpaths[qdir].qp_name,
4883 				Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
4928 	(void) sortq(Queue[qgrp]->qg_maxlist);
5301 				if (Queue[e->e_xfqgrp]->qg_numqueues <= 1)
5306 					      Queue[e->e_xfqgrp]->qg_numqueues);
5341 			if (bitset(QP_SUBDF, Queue[qg]->qg_qpaths[qd].qp_subdirs))
5350 			if (bitset(QP_SUBQF, Queue[qg]->qg_qpaths[qd].qp_subdirs))
5355 			if (bitset(QP_SUBXF, Queue[qg]->qg_qpaths[qd].qp_subdirs))
5366 				Queue[qg]->qg_qpaths[qd].qp_name,
5766 			   Queue[e->e_qgrp]->qg_qpaths[e->e_qdir].qp_name,
5790 		return Queue[qgrp]->qg_qdir;
5792 	if (strcmp(Queue[qgrp]->qg_qpaths[qdir].qp_name, ".") == 0)
5795 		subdir = Queue[qgrp]->qg_qpaths[qdir].qp_name;
5798 			Queue[qgrp]->qg_qdir,
5802 				Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
5974 	e->e_qdir = pickqdir(Queue[e->e_qgrp], e->e_msgsize, e);
6514 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
6516 		for (j = 0; j < Queue[i]->qg_numqueues; ++j)
6518 			QPATHS *qp = &Queue[i]->qg_qpaths[j];
6904 	idx = Queue[e->e_qgrp]->qg_qpaths[e->e_qdir].qp_idx;
6917 	fidx = Queue[e->e_qgrp]->qg_qpaths[e->e_qdir].qp_fsysidx;
7305 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
7306 		Queue[i]->qg_nextrun = now;
7358 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
7359 		qn = multiqueue_cache(basedir, len, Queue[i], qn, &hashval);
7709 	Queue[i] = s->s_quegrp = qg;
7771 **  A structure for sorting Queue according to maxqrun without
7772 **	screwing up Queue itself.
7826 	if (NumQueue == 1 && strcmp(Queue[0]->qg_name, "mqueue") == 0)
7842 		WorkGrp[0].wg_qgs[0] = Queue[0];
7844 		    Queue[0]->qg_numqueues > MaxQueueChildren)
7847 			WorkGrp[0].wg_runners = Queue[0]->qg_numqueues;
7849 		Queue[0]->qg_wgrp = 0;
7853 		    Queue[0]->qg_maxqrun > MaxQueueChildren)
7854 			Queue[0]->qg_maxqrun = MaxQueueChildren;
7855 		WorkGrp[0].wg_maxact = Queue[0]->qg_maxqrun;
7856 		WorkGrp[0].wg_lowqintvl = Queue[0]->qg_queueintvl;
7862 		si[i].sg_maxqrun = Queue[i]->qg_maxqrun;
7889 	**  into. The queue groups in 'Queue' are sorted from highest
7932 		WorkGrp[j].wg_qgs[WorkGrp[j].wg_numqgrp] = Queue[h];
7934 		WorkGrp[j].wg_runners += Queue[h]->qg_maxqrun;
7935 		Queue[h]->qg_wgrp = j;
7941 			    Queue[h]->qg_maxqrun > MaxQueueChildren)
7942 				Queue[h]->qg_maxqrun = MaxQueueChildren;
7943 			WorkGrp[j].wg_maxact = Queue[h]->qg_maxqrun;
7953 		if (Queue[h]->qg_queueintvl > 0 &&
7954 		    WorkGrp[j].wg_lowqintvl < Queue[h]->qg_queueintvl)
7955 			WorkGrp[j].wg_lowqintvl = Queue[h]->qg_queueintvl;
8048 	ofs = Queue[old->e_dfqgrp]->qg_qpaths[old->e_dfqdir].qp_fsysidx;
8049 	nfs = Queue[new->e_dfqgrp]->qg_qpaths[new->e_dfqdir].qp_fsysidx;
8204 	fs1 = Queue[(*pe1)->e_qgrp]->qg_qpaths[(*pe1)->e_qdir].qp_fsysidx;
8205 	fs2 = Queue[(*pe2)->e_qgrp]->qg_qpaths[(*pe2)->e_qdir].qp_fsysidx;
8331 		es->e_qdir = pickqdir(Queue[es->e_qgrp], es->e_msgsize, es);
8412 	maxrcpt = Queue[e->e_qgrp]->qg_maxrcpt;
9062 	for (qgrp = 0; qgrp < NumQueue && Queue[qgrp] != NULL; qgrp++)
9069 		for (qdir = 0; qdir < Queue[qgrp]->qg_numqueues; qdir++)