Lines Matching full:tail
45 unsigned int head, tail, call_head, call_tail; in rxrpc_service_prealloc_one() local
69 tail = READ_ONCE(b->peer_backlog_tail); in rxrpc_service_prealloc_one()
70 if (CIRC_CNT(head, tail, size) < max) { in rxrpc_service_prealloc_one()
82 tail = READ_ONCE(b->conn_backlog_tail); in rxrpc_service_prealloc_one()
83 if (CIRC_CNT(head, tail, size) < max) { in rxrpc_service_prealloc_one()
183 unsigned int size = RXRPC_BACKLOG_MAX, head, tail; in rxrpc_discard_prealloc() local
196 tail = b->peer_backlog_tail; in rxrpc_discard_prealloc()
197 while (CIRC_CNT(head, tail, size) > 0) { in rxrpc_discard_prealloc()
198 struct rxrpc_peer *peer = b->peer_backlog[tail]; in rxrpc_discard_prealloc()
201 tail = (tail + 1) & (size - 1); in rxrpc_discard_prealloc()
205 tail = b->conn_backlog_tail; in rxrpc_discard_prealloc()
206 while (CIRC_CNT(head, tail, size) > 0) { in rxrpc_discard_prealloc()
207 struct rxrpc_connection *conn = b->conn_backlog[tail]; in rxrpc_discard_prealloc()
215 tail = (tail + 1) & (size - 1); in rxrpc_discard_prealloc()
219 tail = b->call_backlog_tail; in rxrpc_discard_prealloc()
220 while (CIRC_CNT(head, tail, size) > 0) { in rxrpc_discard_prealloc()
221 struct rxrpc_call *call = b->call_backlog[tail]; in rxrpc_discard_prealloc()
235 tail = (tail + 1) & (size - 1); in rxrpc_discard_prealloc()