Home
last modified time | relevance | path

Searched refs:accept_q (Results 1 – 7 of 7) sorted by relevance

/linux/net/bluetooth/
H A Daf_bluetooth.c153 INIT_LIST_HEAD(&bt_sk(sk)->accept_q); in bt_sock_alloc()
229 list_add_tail(&bt_sk(sk)->accept_q, &par->accept_q); in bt_accept_enqueue()
263 list_del_init(&bt_sk(sk)->accept_q); in bt_accept_unlink()
276 /* accept_q is modified from child teardown paths too, so take a in bt_accept_get()
285 if (!list_is_last(&bt_sk(sk)->accept_q, &bt->accept_q)) { in bt_accept_get()
286 next = &list_next_entry(bt_sk(sk), accept_q)->sk; in bt_accept_get()
289 } else if (!list_empty(&bt->accept_q)) { in bt_accept_get()
290 next = &list_first_entry(&bt->accept_q, in bt_accept_get()
[all...]
/linux/include/net/iucv/
H A Daf_iucv.h121 struct list_head accept_q; member
/linux/net/iucv/
H A Daf_iucv.c463 INIT_LIST_HEAD(&iucv->accept_q); in iucv_sock_alloc()
503 list_add_tail(&iucv_sk(sk)->accept_q, &par->accept_q); in iucv_accept_enqueue()
515 list_del_init(&iucv_sk(sk)->accept_q); in iucv_accept_unlink()
528 list_for_each_entry_safe(isk, n, &iucv_sk(parent)->accept_q, accept_q) { in iucv_accept_dequeue()
1355 list_for_each_entry_safe(isk, n, &iucv_sk(parent)->accept_q, accept_q) { in iucv_accept_poll()
/linux/net/smc/
H A Dsmc.h304 struct list_head accept_q; /* sockets to be accepted */ member
H A Daf_smc.c407 INIT_LIST_HEAD(&smc->accept_q); in smc_sk_init()
1804 list_add_tail(&smc_sk(sk)->accept_q, &par->accept_q); in smc_accept_enqueue()
1815 list_del_init(&smc_sk(sk)->accept_q); in smc_accept_unlink()
1830 list_for_each_entry_safe(isk, n, &smc_sk(parent)->accept_q, accept_q) { in smc_accept_dequeue()
2877 if (!list_empty(&isk->accept_q)) in smc_accept_poll()
/linux/include/net/bluetooth/
H A Dbluetooth.h397 struct list_head accept_q;
398 spinlock_t accept_q_lock; /* protects accept_q */
400 struct list_head accept_q; global() member
/linux/net/bluetooth/rfcomm/
H A Dcore.c1998 if (list_empty(&bt_sk(sock->sk)->accept_q)) in rfcomm_accept_connection()