638 			Queue[e->e_dfqgrp]->qg_qpaths[e->e_dfqdir].qp_name);
1368 		if (Queue[qgrp]->qg_queueintvl > 0)
1369 			qintvl = Queue[qgrp]->qg_queueintvl;
1375 		lastsched = Queue[qgrp]->qg_nextrun;
1377 		if ((runall || Queue[qgrp]->qg_nextrun <= now) && qintvl > 0)
1393 				Queue[qgrp]->qg_nextrun += qintvl;
1400 				(long) Queue[qgrp]->qg_queueintvl,
1402 				(long) Queue[qgrp]->qg_nextrun, sched);
1435 	for (qgrp = 0; qgrp < NumQueue && Queue[qgrp] != NULL; qgrp++)  in checkqueuerunner()
1439 		if (Queue[qgrp]->qg_queueintvl > 0)  in checkqueuerunner()
1440 			qintvl = Queue[qgrp]->qg_queueintvl;  in checkqueuerunner()
1445 		if (Queue[qgrp]->qg_nextrun <= now - qintvl)  in checkqueuerunner()
1453 					arpadate(ctime(&Queue[qgrp]->qg_nextrun)),  in checkqueuerunner()
2143 		    (Queue[qgrp]->qg_nextrun <= now &&
2144 		     Queue[qgrp]->qg_nextrun != (time_t) -1))
2155 	qdir = Queue[qgrp]->qg_curnum; /* round-robin init of queue position */
2166 	if (Queue[qgrp]->qg_nice > 0)
2167 		(void) nice(Queue[qgrp]->qg_nice);
2186 	for (i = 0; i < Queue[qgrp]->qg_numqueues; i++)
2191 			QSHM_ENTRIES(Queue[qgrp]->qg_qpaths[qdir].qp_idx) = h;
2198 			qdir %= Queue[qgrp]->qg_numqueues;
2207 	njobs = sortq(Queue[qgrp]->qg_maxlist);
2208 	Queue[qgrp]->qg_curnum = qdir; /* update */
2210 	if (!Verbose && bitnset(QD_FORK, Queue[qgrp]->qg_flags))
2226 		maxrunners = Queue[qgrp]->qg_maxqrun;
2353 	else if (Queue[qgrp]->qg_maxqrun > 0 || bitset(RWG_FORCE, flags))
2578 			Queue[qgrp]->qg_qpaths[qdir].qp_name,
2580 				Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
4312 				     qgrp < NumQueue && Queue[qgrp] != NULL;
4316 					     qdir < Queue[qgrp]->qg_numqueues;
4320 							   Queue[qgrp]->qg_qpaths[qdir].qp_name)
4795 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
4801 		for (j = 0; j < Queue[i]->qg_numqueues; j++)
4808 			n = QSHM_ENTRIES(Queue[i]->qg_qpaths[j].qp_idx);
4867 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)  in printqueue()
4872 		for (j = 0; j < Queue[i]->qg_numqueues; j++)  in printqueue()
4941 			Queue[qgrp]->qg_qpaths[qdir].qp_name,
4943 				Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
4946 			Queue[qgrp]->qg_qpaths[qdir].qp_name,
4948 				Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
4993 	(void) sortq(Queue[qgrp]->qg_maxlist);
5370 				if (Queue[e->e_xfqgrp]->qg_numqueues <= 1)
5375 					      Queue[e->e_xfqgrp]->qg_numqueues);
5410 			if (bitset(QP_SUBDF, Queue[qg]->qg_qpaths[qd].qp_subdirs))
5419 			if (bitset(QP_SUBQF, Queue[qg]->qg_qpaths[qd].qp_subdirs))
5424 			if (bitset(QP_SUBXF, Queue[qg]->qg_qpaths[qd].qp_subdirs))
5435 				Queue[qg]->qg_qpaths[qd].qp_name,
5832 			   Queue[e->e_qgrp]->qg_qpaths[e->e_qdir].qp_name,
5856 		return Queue[qgrp]->qg_qdir;
5858 	if (strcmp(Queue[qgrp]->qg_qpaths[qdir].qp_name, ".") == 0)
5861 		subdir = Queue[qgrp]->qg_qpaths[qdir].qp_name;
5864 			Queue[qgrp]->qg_qdir,
5868 				Queue[qgrp]->qg_qpaths[qdir].qp_subdirs)
6040 	e->e_qdir = pickqdir(Queue[e->e_qgrp], e->e_msgsize, e);
6579 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
6581 		for (j = 0; j < Queue[i]->qg_numqueues; ++j)
6583 			QPATHS *qp = &Queue[i]->qg_qpaths[j];
6969 	idx = Queue[e->e_qgrp]->qg_qpaths[e->e_qdir].qp_idx;
6982 	fidx = Queue[e->e_qgrp]->qg_qpaths[e->e_qdir].qp_fsysidx;
7369 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
7370 		Queue[i]->qg_nextrun = now;
7421 	for (i = 0; i < NumQueue && Queue[i] != NULL; i++)
7422 		qn = multiqueue_cache(basedir, len, Queue[i], qn, &hashval);
7772 	Queue[i] = s->s_quegrp = qg;
7889 	if (NumQueue == 1 && strcmp(Queue[0]->qg_name, "mqueue") == 0)  in makeworkgroups()
7905 		WorkGrp[0].wg_qgs[0] = Queue[0];  in makeworkgroups()
7907 		    Queue[0]->qg_numqueues > MaxQueueChildren)  in makeworkgroups()
7910 			WorkGrp[0].wg_runners = Queue[0]->qg_numqueues;  in makeworkgroups()
7912 		Queue[0]->qg_wgrp = 0;  in makeworkgroups()
7916 		    Queue[0]->qg_maxqrun > MaxQueueChildren)  in makeworkgroups()
7917 			Queue[0]->qg_maxqrun = MaxQueueChildren;  in makeworkgroups()
7918 		WorkGrp[0].wg_maxact = Queue[0]->qg_maxqrun;  in makeworkgroups()
7919 		WorkGrp[0].wg_lowqintvl = Queue[0]->qg_queueintvl;  in makeworkgroups()
7925 		si[i].sg_maxqrun = Queue[i]->qg_maxqrun;  in makeworkgroups()
7966 				i, j, h, Queue[h]->qg_maxqrun, IS_BOUNCE_QUEUE(h));  in makeworkgroups()
7995 		WorkGrp[j].wg_qgs[WorkGrp[j].wg_numqgrp] = Queue[h];  in makeworkgroups()
7997 		WorkGrp[j].wg_runners += Queue[h]->qg_maxqrun;  in makeworkgroups()
7998 		Queue[h]->qg_wgrp = j;  in makeworkgroups()
8004 			    Queue[h]->qg_maxqrun > MaxQueueChildren)  in makeworkgroups()
8005 				Queue[h]->qg_maxqrun = MaxQueueChildren;  in makeworkgroups()
8006 			WorkGrp[j].wg_maxact = Queue[h]->qg_maxqrun;  in makeworkgroups()
8016 		if (Queue[h]->qg_queueintvl > 0 &&  in makeworkgroups()
8017 		    WorkGrp[j].wg_lowqintvl < Queue[h]->qg_queueintvl)  in makeworkgroups()
8018 			WorkGrp[j].wg_lowqintvl = Queue[h]->qg_queueintvl;  in makeworkgroups()
8111 	ofs = Queue[old->e_dfqgrp]->qg_qpaths[old->e_dfqdir].qp_fsysidx;
8112 	nfs = Queue[new->e_dfqgrp]->qg_qpaths[new->e_dfqdir].qp_fsysidx;
8267 	fs1 = Queue[(*pe1)->e_qgrp]->qg_qpaths[(*pe1)->e_qdir].qp_fsysidx;
8268 	fs2 = Queue[(*pe2)->e_qgrp]->qg_qpaths[(*pe2)->e_qdir].qp_fsysidx;
8394 		es->e_qdir = pickqdir(Queue[es->e_qgrp], es->e_msgsize, es);
8475 	maxrcpt = Queue[e->e_qgrp]->qg_maxrcpt;
9124 	for (qgrp = 0; qgrp < NumQueue && Queue[qgrp] != NULL; qgrp++)
9131 		for (qdir = 0; qdir < Queue[qgrp]->qg_numqueues; qdir++)