return 0;
 
        while ((skb = sk->sk_send_head) && (!l2cap_tx_window_full(sk)) &&
-              !(pi->conn_state & L2CAP_CONN_REMOTE_BUSY)) {
+                       !(pi->conn_state & L2CAP_CONN_REMOTE_BUSY)) {
 
                if (pi->remote_max_tx &&
                                bt_cb(skb)->retries == pi->remote_max_tx) {
        struct sk_buff **frag;
        int err, sent = 0;
 
-       if (memcpy_fromiovec(skb_put(skb, count), msg->msg_iov, count)) {
+       if (memcpy_fromiovec(skb_put(skb, count), msg->msg_iov, count))
                return -EFAULT;
-       }
 
        sent += count;
        len  -= count;
                if (skb_queue_is_last(SREJ_QUEUE(sk), next_skb))
                        break;
 
-       } while((next_skb = skb_queue_next(SREJ_QUEUE(sk), next_skb)));
+       } while ((next_skb = skb_queue_next(SREJ_QUEUE(sk), next_skb)));
 
        __skb_queue_tail(SREJ_QUEUE(sk), skb);
 }
        struct sk_buff *skb;
        u16 control;
 
-       while((skb = skb_peek(SREJ_QUEUE(sk)))) {
+       while ((skb = skb_peek(SREJ_QUEUE(sk)))) {
                if (bt_cb(skb)->tx_seq != tx_seq)
                        break;
 
        struct srej_list *l, *tmp;
        u16 control;
 
-       list_for_each_entry_safe(l,tmp, SREJ_LIST(sk), list) {
+       list_for_each_entry_safe(l, tmp, SREJ_LIST(sk), list) {
                if (l->tx_seq == tx_seq) {
                        list_del(&l->list);
                        kfree(l);