Lines Matching defs:queue
9 /* QMGR_PEER *qmgr_peer_create(job, queue)
11 /* QMGR_QUEUE *queue;
13 /* QMGR_PEER *qmgr_peer_find(job, queue)
15 /* QMGR_QUEUE *queue;
17 /* QMGR_PEER *qmgr_peer_obtain(job, queue)
19 /* QMGR_QUEUE *queue;
30 /* It is similar to per-transport queue structure, but groups
78 QMGR_PEER *qmgr_peer_create(QMGR_JOB *job, QMGR_QUEUE *queue)
83 peer->queue = queue;
86 htable_enter(job->peer_byname, queue->name, (char *) peer);
98 QMGR_QUEUE *queue = peer->queue;
106 msg_panic("%s: entry list not empty: %s", myname, queue->name);
109 htable_delete(job->peer_byname, queue->name, (void (*) (char *)) 0);
113 /* qmgr_peer_find - lookup peer associated with given job and queue */
115 QMGR_PEER *qmgr_peer_find(QMGR_JOB *job, QMGR_QUEUE *queue)
117 return ((QMGR_PEER *) htable_find(job->peer_byname, queue->name));
120 /* qmgr_peer_obtain - find/create peer associated with given job and queue */
122 QMGR_PEER *qmgr_peer_obtain(QMGR_JOB *job, QMGR_QUEUE *queue)
126 if ((peer = qmgr_peer_find(job, queue)) == 0)
127 peer = qmgr_peer_create(job, queue);
136 QMGR_QUEUE *queue;
143 queue = peer->queue;
144 if (queue->window > queue->busy_refcount && peer->entry_list.next != 0) {
148 job->message->queue_id, queue->transport->name, queue->name,
149 queue->busy_refcount + 1, queue->window);