Lines Matching defs:queue
625 * beginning of the wait-queue. As such, it's ok to "drop"
627 * having to remove and re-insert us on the wait queue.
660 struct request_sock_queue *queue = &icsk->icsk_accept_queue;
675 if (reqsk_queue_empty(queue)) {
687 req = reqsk_queue_remove(queue, sk);
692 spin_lock_bh(&queue->fastopenq.lock);
703 spin_unlock_bh(&queue->fastopenq.lock);
933 static void reqsk_queue_migrated(struct request_sock_queue *queue,
937 atomic_inc(&queue->young);
938 atomic_inc(&queue->qlen);
996 struct request_sock_queue *queue;
1033 * When server is a bit loaded, queue is populated with old
1034 * open requests, reducing effective size of queue.
1035 * When server is well loaded, queue size reduces to zero
1045 queue = &icsk->icsk_accept_queue;
1046 qlen = reqsk_queue_len(queue);
1048 int young = reqsk_queue_len_young(queue) << 1;
1057 syn_ack_recalc(req, max_syn_ack_retries, READ_ONCE(queue->rskq_defer_accept),
1065 atomic_dec(&queue->young);
1094 reqsk_queue_removed(queue, nreq);
1303 struct request_sock_queue *queue = &inet_csk(sk)->icsk_accept_queue;
1305 spin_lock(&queue->rskq_lock);
1312 if (queue->rskq_accept_head == NULL)
1313 WRITE_ONCE(queue->rskq_accept_head, req);
1315 queue->rskq_accept_tail->dl_next = req;
1316 queue->rskq_accept_tail = req;
1319 spin_unlock(&queue->rskq_lock);
1377 struct request_sock_queue *queue = &icsk->icsk_accept_queue;
1388 while ((req = reqsk_queue_remove(queue, sk)) != NULL) {
1430 if (queue->fastopenq.rskq_rst_head) {
1432 spin_lock_bh(&queue->fastopenq.lock);
1433 req = queue->fastopenq.rskq_rst_head;
1434 queue->fastopenq.rskq_rst_head = NULL;
1435 spin_unlock_bh(&queue->fastopenq.lock);