2007-02-09 15:24:33 +01:00
|
|
|
/*
|
2005-04-17 00:20:36 +02:00
|
|
|
BlueZ - Bluetooth protocol stack for Linux
|
|
|
|
Copyright (C) 2000-2001 Qualcomm Incorporated
|
|
|
|
|
|
|
|
Written 2000,2001 by Maxim Krasnyansky <maxk@qualcomm.com>
|
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License version 2 as
|
|
|
|
published by the Free Software Foundation;
|
|
|
|
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
|
|
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS.
|
|
|
|
IN NO EVENT SHALL THE COPYRIGHT HOLDER(S) AND AUTHOR(S) BE LIABLE FOR ANY
|
2007-02-09 15:24:33 +01:00
|
|
|
CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES
|
|
|
|
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
|
|
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
2005-04-17 00:20:36 +02:00
|
|
|
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
|
|
|
2007-02-09 15:24:33 +01:00
|
|
|
ALL LIABILITY, INCLUDING LIABILITY FOR INFRINGEMENT OF ANY PATENTS,
|
|
|
|
COPYRIGHTS, TRADEMARKS OR OTHER RIGHTS, RELATING TO USE OF THIS
|
2005-04-17 00:20:36 +02:00
|
|
|
SOFTWARE IS DISCLAIMED.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Bluetooth address family and sockets. */
|
|
|
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/list.h>
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/skbuff.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/poll.h>
|
|
|
|
#include <net/sock.h>
|
2008-07-14 20:13:50 +02:00
|
|
|
#include <asm/ioctls.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
#include <linux/kmod.h>
|
|
|
|
|
|
|
|
#include <net/bluetooth/bluetooth.h>
|
|
|
|
|
2009-01-16 10:09:50 +01:00
|
|
|
#define VERSION "2.15"
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/* Bluetooth sockets */
|
|
|
|
#define BT_MAX_PROTO 8
|
2009-10-05 07:58:39 +02:00
|
|
|
static const struct net_proto_family *bt_proto[BT_MAX_PROTO];
|
2008-11-30 12:17:19 +01:00
|
|
|
static DEFINE_RWLOCK(bt_proto_lock);
|
2008-04-02 08:58:35 +02:00
|
|
|
|
|
|
|
static struct lock_class_key bt_lock_key[BT_MAX_PROTO];
|
2009-08-05 19:42:58 +02:00
|
|
|
static const char *const bt_key_strings[BT_MAX_PROTO] = {
|
2008-04-02 08:58:35 +02:00
|
|
|
"sk_lock-AF_BLUETOOTH-BTPROTO_L2CAP",
|
|
|
|
"sk_lock-AF_BLUETOOTH-BTPROTO_HCI",
|
|
|
|
"sk_lock-AF_BLUETOOTH-BTPROTO_SCO",
|
|
|
|
"sk_lock-AF_BLUETOOTH-BTPROTO_RFCOMM",
|
|
|
|
"sk_lock-AF_BLUETOOTH-BTPROTO_BNEP",
|
|
|
|
"sk_lock-AF_BLUETOOTH-BTPROTO_CMTP",
|
|
|
|
"sk_lock-AF_BLUETOOTH-BTPROTO_HIDP",
|
|
|
|
"sk_lock-AF_BLUETOOTH-BTPROTO_AVDTP",
|
|
|
|
};
|
|
|
|
|
2008-11-30 12:17:19 +01:00
|
|
|
static struct lock_class_key bt_slock_key[BT_MAX_PROTO];
|
2009-08-05 19:42:58 +02:00
|
|
|
static const char *const bt_slock_key_strings[BT_MAX_PROTO] = {
|
2008-04-02 08:58:35 +02:00
|
|
|
"slock-AF_BLUETOOTH-BTPROTO_L2CAP",
|
|
|
|
"slock-AF_BLUETOOTH-BTPROTO_HCI",
|
|
|
|
"slock-AF_BLUETOOTH-BTPROTO_SCO",
|
|
|
|
"slock-AF_BLUETOOTH-BTPROTO_RFCOMM",
|
|
|
|
"slock-AF_BLUETOOTH-BTPROTO_BNEP",
|
|
|
|
"slock-AF_BLUETOOTH-BTPROTO_CMTP",
|
|
|
|
"slock-AF_BLUETOOTH-BTPROTO_HIDP",
|
|
|
|
"slock-AF_BLUETOOTH-BTPROTO_AVDTP",
|
|
|
|
};
|
2008-11-30 12:17:19 +01:00
|
|
|
|
|
|
|
static inline void bt_sock_reclassify_lock(struct socket *sock, int proto)
|
|
|
|
{
|
|
|
|
struct sock *sk = sock->sk;
|
|
|
|
|
|
|
|
if (!sk)
|
|
|
|
return;
|
|
|
|
|
|
|
|
BUG_ON(sock_owned_by_user(sk));
|
|
|
|
|
|
|
|
sock_lock_init_class_and_name(sk,
|
|
|
|
bt_slock_key_strings[proto], &bt_slock_key[proto],
|
|
|
|
bt_key_strings[proto], &bt_lock_key[proto]);
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-10-05 07:58:39 +02:00
|
|
|
int bt_sock_register(int proto, const struct net_proto_family *ops)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2006-10-15 17:31:14 +02:00
|
|
|
int err = 0;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (proto < 0 || proto >= BT_MAX_PROTO)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2006-10-15 17:31:14 +02:00
|
|
|
write_lock(&bt_proto_lock);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (bt_proto[proto])
|
2006-10-15 17:31:14 +02:00
|
|
|
err = -EEXIST;
|
|
|
|
else
|
|
|
|
bt_proto[proto] = ops;
|
|
|
|
|
|
|
|
write_unlock(&bt_proto_lock);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2006-10-15 17:31:14 +02:00
|
|
|
return err;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(bt_sock_register);
|
|
|
|
|
|
|
|
int bt_sock_unregister(int proto)
|
|
|
|
{
|
2006-10-15 17:31:14 +02:00
|
|
|
int err = 0;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (proto < 0 || proto >= BT_MAX_PROTO)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2006-10-15 17:31:14 +02:00
|
|
|
write_lock(&bt_proto_lock);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!bt_proto[proto])
|
2006-10-15 17:31:14 +02:00
|
|
|
err = -ENOENT;
|
|
|
|
else
|
|
|
|
bt_proto[proto] = NULL;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2006-10-15 17:31:14 +02:00
|
|
|
write_unlock(&bt_proto_lock);
|
|
|
|
|
|
|
|
return err;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(bt_sock_unregister);
|
|
|
|
|
2007-10-09 08:24:22 +02:00
|
|
|
static int bt_sock_create(struct net *net, struct socket *sock, int proto)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2006-10-15 17:31:14 +02:00
|
|
|
int err;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-10-09 08:24:22 +02:00
|
|
|
if (net != &init_net)
|
|
|
|
return -EAFNOSUPPORT;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (proto < 0 || proto >= BT_MAX_PROTO)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2008-10-17 00:24:51 +02:00
|
|
|
if (!bt_proto[proto])
|
2005-04-17 00:20:36 +02:00
|
|
|
request_module("bt-proto-%d", proto);
|
2006-10-15 17:31:14 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
err = -EPROTONOSUPPORT;
|
2006-10-15 17:31:14 +02:00
|
|
|
|
|
|
|
read_lock(&bt_proto_lock);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (bt_proto[proto] && try_module_get(bt_proto[proto]->owner)) {
|
2007-10-09 08:24:22 +02:00
|
|
|
err = bt_proto[proto]->create(net, sock, proto);
|
2008-11-30 12:17:19 +01:00
|
|
|
bt_sock_reclassify_lock(sock, proto);
|
2005-04-17 00:20:36 +02:00
|
|
|
module_put(bt_proto[proto]->owner);
|
|
|
|
}
|
2006-10-15 17:31:14 +02:00
|
|
|
|
|
|
|
read_unlock(&bt_proto_lock);
|
|
|
|
|
2007-02-09 15:24:33 +01:00
|
|
|
return err;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void bt_sock_link(struct bt_sock_list *l, struct sock *sk)
|
|
|
|
{
|
|
|
|
write_lock_bh(&l->lock);
|
|
|
|
sk_add_node(sk, &l->head);
|
|
|
|
write_unlock_bh(&l->lock);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(bt_sock_link);
|
|
|
|
|
|
|
|
void bt_sock_unlink(struct bt_sock_list *l, struct sock *sk)
|
|
|
|
{
|
|
|
|
write_lock_bh(&l->lock);
|
|
|
|
sk_del_node_init(sk);
|
|
|
|
write_unlock_bh(&l->lock);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(bt_sock_unlink);
|
|
|
|
|
|
|
|
void bt_accept_enqueue(struct sock *parent, struct sock *sk)
|
|
|
|
{
|
|
|
|
BT_DBG("parent %p, sk %p", parent, sk);
|
|
|
|
|
|
|
|
sock_hold(sk);
|
|
|
|
list_add_tail(&bt_sk(sk)->accept_q, &bt_sk(parent)->accept_q);
|
|
|
|
bt_sk(sk)->parent = parent;
|
|
|
|
parent->sk_ack_backlog++;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(bt_accept_enqueue);
|
|
|
|
|
|
|
|
void bt_accept_unlink(struct sock *sk)
|
|
|
|
{
|
|
|
|
BT_DBG("sk %p state %d", sk, sk->sk_state);
|
|
|
|
|
|
|
|
list_del_init(&bt_sk(sk)->accept_q);
|
|
|
|
bt_sk(sk)->parent->sk_ack_backlog--;
|
|
|
|
bt_sk(sk)->parent = NULL;
|
|
|
|
sock_put(sk);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(bt_accept_unlink);
|
|
|
|
|
|
|
|
struct sock *bt_accept_dequeue(struct sock *parent, struct socket *newsock)
|
|
|
|
{
|
|
|
|
struct list_head *p, *n;
|
|
|
|
struct sock *sk;
|
|
|
|
|
|
|
|
BT_DBG("parent %p", parent);
|
|
|
|
|
|
|
|
list_for_each_safe(p, n, &bt_sk(parent)->accept_q) {
|
|
|
|
sk = (struct sock *) list_entry(p, struct bt_sock, accept_q);
|
|
|
|
|
|
|
|
lock_sock(sk);
|
|
|
|
|
|
|
|
/* FIXME: Is this check still needed */
|
|
|
|
if (sk->sk_state == BT_CLOSED) {
|
|
|
|
release_sock(sk);
|
|
|
|
bt_accept_unlink(sk);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2009-01-15 21:52:16 +01:00
|
|
|
if (sk->sk_state == BT_CONNECTED || !newsock ||
|
|
|
|
bt_sk(parent)->defer_setup) {
|
2005-04-17 00:20:36 +02:00
|
|
|
bt_accept_unlink(sk);
|
|
|
|
if (newsock)
|
|
|
|
sock_graft(sk, newsock);
|
|
|
|
release_sock(sk);
|
|
|
|
return sk;
|
|
|
|
}
|
|
|
|
|
|
|
|
release_sock(sk);
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(bt_accept_dequeue);
|
|
|
|
|
|
|
|
int bt_sock_recvmsg(struct kiocb *iocb, struct socket *sock,
|
2009-01-15 21:52:16 +01:00
|
|
|
struct msghdr *msg, size_t len, int flags)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int noblock = flags & MSG_DONTWAIT;
|
|
|
|
struct sock *sk = sock->sk;
|
|
|
|
struct sk_buff *skb;
|
|
|
|
size_t copied;
|
|
|
|
int err;
|
|
|
|
|
2008-11-30 12:17:28 +01:00
|
|
|
BT_DBG("sock %p sk %p len %zu", sock, sk, len);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (flags & (MSG_OOB))
|
|
|
|
return -EOPNOTSUPP;
|
|
|
|
|
|
|
|
if (!(skb = skb_recv_datagram(sk, flags, noblock, &err))) {
|
|
|
|
if (sk->sk_shutdown & RCV_SHUTDOWN)
|
|
|
|
return 0;
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
msg->msg_namelen = 0;
|
|
|
|
|
|
|
|
copied = skb->len;
|
|
|
|
if (len < copied) {
|
|
|
|
msg->msg_flags |= MSG_TRUNC;
|
|
|
|
copied = len;
|
|
|
|
}
|
|
|
|
|
2007-03-13 17:06:52 +01:00
|
|
|
skb_reset_transport_header(skb);
|
2005-04-17 00:20:36 +02:00
|
|
|
err = skb_copy_datagram_iovec(skb, 0, msg->msg_iov, copied);
|
2008-07-14 20:13:50 +02:00
|
|
|
if (err == 0)
|
net: Generalize socket rx gap / receive queue overflow cmsg
Create a new socket level option to report number of queue overflows
Recently I augmented the AF_PACKET protocol to report the number of frames lost
on the socket receive queue between any two enqueued frames. This value was
exported via a SOL_PACKET level cmsg. AFter I completed that work it was
requested that this feature be generalized so that any datagram oriented socket
could make use of this option. As such I've created this patch, It creates a
new SOL_SOCKET level option called SO_RXQ_OVFL, which when enabled exports a
SOL_SOCKET level cmsg that reports the nubmer of times the sk_receive_queue
overflowed between any two given frames. It also augments the AF_PACKET
protocol to take advantage of this new feature (as it previously did not touch
sk->sk_drops, which this patch uses to record the overflow count). Tested
successfully by me.
Notes:
1) Unlike my previous patch, this patch simply records the sk_drops value, which
is not a number of drops between packets, but rather a total number of drops.
Deltas must be computed in user space.
2) While this patch currently works with datagram oriented protocols, it will
also be accepted by non-datagram oriented protocols. I'm not sure if thats
agreeable to everyone, but my argument in favor of doing so is that, for those
protocols which aren't applicable to this option, sk_drops will always be zero,
and reporting no drops on a receive queue that isn't used for those
non-participating protocols seems reasonable to me. This also saves us having
to code in a per-protocol opt in mechanism.
3) This applies cleanly to net-next assuming that commit
977750076d98c7ff6cbda51858bb5a5894a9d9ab (my af packet cmsg patch) is reverted
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-10-12 22:26:31 +02:00
|
|
|
sock_recv_ts_and_drops(msg, sk, skb);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
skb_free_datagram(sk, skb);
|
|
|
|
|
|
|
|
return err ? : copied;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(bt_sock_recvmsg);
|
|
|
|
|
|
|
|
static inline unsigned int bt_accept_poll(struct sock *parent)
|
|
|
|
{
|
|
|
|
struct list_head *p, *n;
|
|
|
|
struct sock *sk;
|
|
|
|
|
|
|
|
list_for_each_safe(p, n, &bt_sk(parent)->accept_q) {
|
|
|
|
sk = (struct sock *) list_entry(p, struct bt_sock, accept_q);
|
2009-02-16 02:57:30 +01:00
|
|
|
if (sk->sk_state == BT_CONNECTED ||
|
|
|
|
(bt_sk(parent)->defer_setup &&
|
|
|
|
sk->sk_state == BT_CONNECT2))
|
2005-04-17 00:20:36 +02:00
|
|
|
return POLLIN | POLLRDNORM;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned int bt_sock_poll(struct file * file, struct socket *sock, poll_table *wait)
|
|
|
|
{
|
|
|
|
struct sock *sk = sock->sk;
|
|
|
|
unsigned int mask = 0;
|
|
|
|
|
|
|
|
BT_DBG("sock %p, sk %p", sock, sk);
|
|
|
|
|
|
|
|
poll_wait(file, sk->sk_sleep, wait);
|
|
|
|
|
|
|
|
if (sk->sk_state == BT_LISTEN)
|
|
|
|
return bt_accept_poll(sk);
|
|
|
|
|
|
|
|
if (sk->sk_err || !skb_queue_empty(&sk->sk_error_queue))
|
|
|
|
mask |= POLLERR;
|
|
|
|
|
2006-03-25 12:07:39 +01:00
|
|
|
if (sk->sk_shutdown & RCV_SHUTDOWN)
|
|
|
|
mask |= POLLRDHUP;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (sk->sk_shutdown == SHUTDOWN_MASK)
|
|
|
|
mask |= POLLHUP;
|
|
|
|
|
2007-02-09 15:24:33 +01:00
|
|
|
if (!skb_queue_empty(&sk->sk_receive_queue) ||
|
2005-04-17 00:20:36 +02:00
|
|
|
(sk->sk_shutdown & RCV_SHUTDOWN))
|
|
|
|
mask |= POLLIN | POLLRDNORM;
|
|
|
|
|
|
|
|
if (sk->sk_state == BT_CLOSED)
|
|
|
|
mask |= POLLHUP;
|
|
|
|
|
|
|
|
if (sk->sk_state == BT_CONNECT ||
|
|
|
|
sk->sk_state == BT_CONNECT2 ||
|
|
|
|
sk->sk_state == BT_CONFIG)
|
|
|
|
return mask;
|
|
|
|
|
|
|
|
if (sock_writeable(sk))
|
|
|
|
mask |= POLLOUT | POLLWRNORM | POLLWRBAND;
|
|
|
|
else
|
|
|
|
set_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
|
|
|
|
|
|
|
|
return mask;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(bt_sock_poll);
|
|
|
|
|
2008-07-14 20:13:50 +02:00
|
|
|
int bt_sock_ioctl(struct socket *sock, unsigned int cmd, unsigned long arg)
|
|
|
|
{
|
|
|
|
struct sock *sk = sock->sk;
|
2008-07-14 20:13:51 +02:00
|
|
|
struct sk_buff *skb;
|
|
|
|
long amount;
|
2008-07-14 20:13:50 +02:00
|
|
|
int err;
|
|
|
|
|
|
|
|
BT_DBG("sk %p cmd %x arg %lx", sk, cmd, arg);
|
|
|
|
|
|
|
|
switch (cmd) {
|
2008-07-14 20:13:51 +02:00
|
|
|
case TIOCOUTQ:
|
|
|
|
if (sk->sk_state == BT_LISTEN)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2009-06-18 04:05:41 +02:00
|
|
|
amount = sk->sk_sndbuf - sk_wmem_alloc_get(sk);
|
2008-07-14 20:13:51 +02:00
|
|
|
if (amount < 0)
|
|
|
|
amount = 0;
|
|
|
|
err = put_user(amount, (int __user *) arg);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case TIOCINQ:
|
|
|
|
if (sk->sk_state == BT_LISTEN)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
lock_sock(sk);
|
|
|
|
skb = skb_peek(&sk->sk_receive_queue);
|
|
|
|
amount = skb ? skb->len : 0;
|
|
|
|
release_sock(sk);
|
|
|
|
err = put_user(amount, (int __user *) arg);
|
|
|
|
break;
|
|
|
|
|
2008-07-14 20:13:50 +02:00
|
|
|
case SIOCGSTAMP:
|
|
|
|
err = sock_get_timestamp(sk, (struct timeval __user *) arg);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SIOCGSTAMPNS:
|
|
|
|
err = sock_get_timestampns(sk, (struct timespec __user *) arg);
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
err = -ENOIOCTLCMD;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(bt_sock_ioctl);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
int bt_sock_wait_state(struct sock *sk, int state, unsigned long timeo)
|
|
|
|
{
|
|
|
|
DECLARE_WAITQUEUE(wait, current);
|
|
|
|
int err = 0;
|
|
|
|
|
|
|
|
BT_DBG("sk %p", sk);
|
|
|
|
|
|
|
|
add_wait_queue(sk->sk_sleep, &wait);
|
|
|
|
while (sk->sk_state != state) {
|
|
|
|
set_current_state(TASK_INTERRUPTIBLE);
|
|
|
|
|
|
|
|
if (!timeo) {
|
2006-09-23 09:54:38 +02:00
|
|
|
err = -EINPROGRESS;
|
2005-04-17 00:20:36 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (signal_pending(current)) {
|
|
|
|
err = sock_intr_errno(timeo);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
release_sock(sk);
|
|
|
|
timeo = schedule_timeout(timeo);
|
|
|
|
lock_sock(sk);
|
|
|
|
|
2005-12-14 08:22:19 +01:00
|
|
|
err = sock_error(sk);
|
|
|
|
if (err)
|
2005-04-17 00:20:36 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
set_current_state(TASK_RUNNING);
|
|
|
|
remove_wait_queue(sk->sk_sleep, &wait);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(bt_sock_wait_state);
|
|
|
|
|
|
|
|
static struct net_proto_family bt_sock_family_ops = {
|
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.family = PF_BLUETOOTH,
|
|
|
|
.create = bt_sock_create,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int __init bt_init(void)
|
|
|
|
{
|
2006-07-03 10:02:37 +02:00
|
|
|
int err;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
BT_INFO("Core ver %s", VERSION);
|
|
|
|
|
2006-07-03 10:02:37 +02:00
|
|
|
err = bt_sysfs_init();
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2006-07-03 10:02:37 +02:00
|
|
|
err = sock_register(&bt_sock_family_ops);
|
|
|
|
if (err < 0) {
|
|
|
|
bt_sysfs_cleanup();
|
|
|
|
return err;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2006-07-03 10:02:37 +02:00
|
|
|
BT_INFO("HCI device and connection manager initialized");
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
hci_sock_init();
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __exit bt_exit(void)
|
|
|
|
{
|
|
|
|
hci_sock_cleanup();
|
|
|
|
|
|
|
|
sock_unregister(PF_BLUETOOTH);
|
2006-07-03 10:02:37 +02:00
|
|
|
|
|
|
|
bt_sysfs_cleanup();
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
subsys_initcall(bt_init);
|
|
|
|
module_exit(bt_exit);
|
|
|
|
|
2008-08-18 13:23:53 +02:00
|
|
|
MODULE_AUTHOR("Marcel Holtmann <marcel@holtmann.org>");
|
2005-04-17 00:20:36 +02:00
|
|
|
MODULE_DESCRIPTION("Bluetooth Core ver " VERSION);
|
|
|
|
MODULE_VERSION(VERSION);
|
|
|
|
MODULE_LICENSE("GPL");
|
|
|
|
MODULE_ALIAS_NETPROTO(PF_BLUETOOTH);
|