sendmail/src/queue.c

212 **  Queue data in shared memory
632 			Queue[e->e_dfqgrp]->qg_qpaths[e->e_dfqdir].qp_name);
765 	**	Expand macros completely here.  Queue run will deal with
1313 		if (Queue[qgrp]->qg_queueintvl > 0)
1314 			qintvl = Queue[qgrp]->qg_queueintvl;
1320 		lastsched = Queue[qgrp]->qg_nextrun;
1322 		if ((runall || Queue[qgrp]->qg_nextrun <= now) && qintvl > 0)
1338 				Queue[qgrp]->qg_nextrun += qintvl;
1344 				wgrp, cgrp, qgrp, Queue[qgrp]->qg_queueintvl,
1346 				Queue[qgrp]->qg_nextrun, sched);
1379 	for (qgrp = 0; qgrp < NumQueue && Queue[qgrp] != NULL; qgrp++)
1383 		if (Queue[qgrp]->qg_queueintvl > 0)
1384 			qintvl = Queue[qgrp]->qg_queueintvl;
1389 		if (Queue[qgrp]->qg_nextrun <= now - qintvl)
1397 					arpadate(ctime(&Queue[qgrp]->qg_nextrun)),
1724 		**  In the case of the BYHOST Queue Sort Order, the 'item'
1967 			proc_list_add(pid, "Queue runner", PROC_QUEUE,
1996 		proc_list_add(CurrentPid, "Queue runner child process",
2076 		    (Queue[qgrp]->qg_nextrun <= now &&
2077 		     Queue[qgrp]->qg_nextrun != (time_t) -1))
2088 	qdir = Queue[qgrp]->qg_curnum; /* round-robin init of queue position */
2099 	if (Queue[qgrp]->qg_nice > 0)
2100 		(void) nice(Queue[qgrp]->qg_nice);
2120 	for (i = 0; i < Queue[qgrp]->qg_numqueues; i++)
2125 			QSHM_ENTRIES(Queue[qgrp]->qg_qpaths[qdir].qp_idx) = h;
2132 			qdir %= Queue[qgrp]->qg_numqueues;
2141 	njobs = sortq(Queue[qgrp]->qg_maxlist);
2142 	Queue[qgrp]->qg_curnum = qdir; /* update */
2145 	if (!Verbose && bitnset(QD_FORK, Queue[qgrp]->qg_flags))
2161 		maxrunners = Queue[qgrp]->qg_maxqrun;
2208 				proc_list_add(pid, "Queue child runner process",
2289 	else if (Queue[qgrp]->qg_maxqrun > 0 || bitset(RWG_FORCE, flags))
2513 			Queue[qgrp]->qg_qpaths[qdir].qp_name,
2515 				Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
4226 				     qgrp < NumQueue && Queue[qgrp] != NULL;
4230 					     qdir < Queue[qgrp]->qg_numqueues;
4234 							   Queue[qgrp]->qg_qpaths[qdir].qp_name)
4697 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
4702 		for (j = 0; j < Queue[i]->qg_numqueues; j++)
4709 			n = QSHM_ENTRIES(Queue[i]->qg_qpaths[j].qp_idx);
4768 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
4773 		for (j = 0; j < Queue[i]->qg_numqueues; j++)
4820 			Queue[qgrp]->qg_qpaths[qdir].qp_name,
4822 				Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
4825 			Queue[qgrp]->qg_qpaths[qdir].qp_name,
4827 				Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
4872 	(void) sortq(Queue[qgrp]->qg_maxlist);
5245 				if (Queue[e->e_xfqgrp]->qg_numqueues <= 1)
5250 					      Queue[e->e_xfqgrp]->qg_numqueues);
5285 			if (bitset(QP_SUBDF, Queue[qg]->qg_qpaths[qd].qp_subdirs))
5294 			if (bitset(QP_SUBQF, Queue[qg]->qg_qpaths[qd].qp_subdirs))
5299 			if (bitset(QP_SUBXF, Queue[qg]->qg_qpaths[qd].qp_subdirs))
5310 				Queue[qg]->qg_qpaths[qd].qp_name,
5710 			   Queue[e->e_qgrp]->qg_qpaths[e->e_qdir].qp_name,
5734 		return Queue[qgrp]->qg_qdir;
5736 	if (strcmp(Queue[qgrp]->qg_qpaths[qdir].qp_name, ".") == 0)
5739 		subdir = Queue[qgrp]->qg_qpaths[qdir].qp_name;
5742 			Queue[qgrp]->qg_qdir,
5746 				Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
5918 	e->e_qdir = pickqdir(Queue[e->e_qgrp], e->e_msgsize, e);
6458 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
6460 		for (j = 0; j < Queue[i]->qg_numqueues; ++j)
6462 			QPATHS *qp = &Queue[i]->qg_qpaths[j];
6728 	idx = Queue[e->e_qgrp]->qg_qpaths[e->e_qdir].qp_idx;
6746 	fidx = Queue[e->e_qgrp]->qg_qpaths[e->e_qdir].qp_fsysidx;
7128 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
7129 		Queue[i]->qg_nextrun = now;
7181 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
7182 		qn = multiqueue_cache(basedir, len, Queue[i], qn, &hashval);
7533 	Queue[i] = s->s_quegrp = qg;
7595 **  A structure for sorting Queue according to maxqrun without
7596 **	screwing up Queue itself.
7650 	if (NumQueue == 1 && strcmp(Queue[0]->qg_name, "mqueue") == 0)
7666 		WorkGrp[0].wg_qgs[0] = Queue[0];
7668 		    Queue[0]->qg_numqueues > MaxQueueChildren)
7671 			WorkGrp[0].wg_runners = Queue[0]->qg_numqueues;
7673 		Queue[0]->qg_wgrp = 0;
7677 		    Queue[0]->qg_maxqrun > MaxQueueChildren)
7678 			Queue[0]->qg_maxqrun = MaxQueueChildren;
7679 		WorkGrp[0].wg_maxact = Queue[0]->qg_maxqrun;
7680 		WorkGrp[0].wg_lowqintvl = Queue[0]->qg_queueintvl;
7686 		si[i].sg_maxqrun = Queue[i]->qg_maxqrun;
7708 	**  into. The queue groups in 'Queue' are sorted from highest
7746 		WorkGrp[j].wg_qgs[WorkGrp[j].wg_numqgrp] = Queue[h];
7748 		WorkGrp[j].wg_runners += Queue[h]->qg_maxqrun;
7749 		Queue[h]->qg_wgrp = j;
7755 			    Queue[h]->qg_maxqrun > MaxQueueChildren)
7756 				Queue[h]->qg_maxqrun = MaxQueueChildren;
7757 			WorkGrp[j].wg_maxact = Queue[h]->qg_maxqrun;
7767 		if (Queue[h]->qg_queueintvl > 0 &&
7768 		    WorkGrp[j].wg_lowqintvl < Queue[h]->qg_queueintvl)
7769 			WorkGrp[j].wg_lowqintvl = Queue[h]->qg_queueintvl;
7859 	ofs = Queue[old->e_dfqgrp]->qg_qpaths[old->e_dfqdir].qp_fsysidx;
7860 	nfs = Queue[new->e_dfqgrp]->qg_qpaths[new->e_dfqdir].qp_fsysidx;
8015 	fs1 = Queue[(*pe1)->e_qgrp]->qg_qpaths[(*pe1)->e_qdir].qp_fsysidx;
8016 	fs2 = Queue[(*pe2)->e_qgrp]->qg_qpaths[(*pe2)->e_qdir].qp_fsysidx;
8142 		es->e_qdir = pickqdir(Queue[es->e_qgrp], es->e_msgsize, es);
8223 	maxrcpt = Queue[e->e_qgrp]->qg_maxrcpt;
8873 	for (qgrp = 0; qgrp < NumQueue && Queue[qgrp] != NULL; qgrp++)
8880 		for (qdir = 0; qdir < Queue[qgrp]->qg_numqueues; qdir++)