1 /*- 2 * srr.c 3 * 4 * SPDX-License-Identifier: BSD-2-Clause 5 * 6 * Copyright (c) 2004 Maksim Yevmenkin <m_evmenkin@yahoo.com> 7 * All rights reserved. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28 * SUCH DAMAGE. 29 * 30 * $Id: srr.c,v 1.1 2004/01/13 01:54:39 max Exp $ 31 * $FreeBSD$ 32 */ 33 34 #include <sys/queue.h> 35 #include <sys/uio.h> 36 #include <netinet/in.h> 37 #include <arpa/inet.h> 38 #include <assert.h> 39 #define L2CAP_SOCKET_CHECKED 40 #include <bluetooth.h> 41 #include <errno.h> 42 #include <sdp.h> 43 #include <string.h> 44 #include "profile.h" 45 #include "provider.h" 46 #include "server.h" 47 48 /* 49 * Prepare Service Register response 50 */ 51 52 int32_t 53 server_prepare_service_register_response(server_p srv, int32_t fd) 54 { 55 uint8_t const *req = srv->req + sizeof(sdp_pdu_t); 56 uint8_t const *req_end = req + ((sdp_pdu_p)(srv->req))->len; 57 uint8_t *rsp = srv->fdidx[fd].rsp; 58 59 profile_t *profile = NULL; 60 provider_t *provider = NULL; 61 bdaddr_t *bdaddr = NULL; 62 int32_t uuid; 63 64 /* 65 * Minimal Service Register Request 66 * 67 * value16 - uuid 2 bytes 68 * bdaddr - BD_ADDR 6 bytes 69 */ 70 71 if (!srv->fdidx[fd].control || 72 !srv->fdidx[fd].priv || req_end - req < 8) 73 return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX); 74 75 /* Get ServiceClass UUID */ 76 SDP_GET16(uuid, req); 77 78 /* Get BD_ADDR */ 79 bdaddr = (bdaddr_p) req; 80 req += sizeof(*bdaddr); 81 82 /* Lookup profile descriptror */ 83 profile = profile_get_descriptor(uuid); 84 if (profile == NULL) 85 return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX); 86 87 /* Validate user data */ 88 if (req_end - req < profile->dsize || 89 profile->valid == NULL || 90 (profile->valid)(req, req_end - req) == 0) 91 return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX); 92 93 /* Register provider */ 94 provider = provider_register(profile, bdaddr, fd, req, req_end - req); 95 if (provider == NULL) 96 return (SDP_ERROR_CODE_INSUFFICIENT_RESOURCES); 97 98 SDP_PUT16(0, rsp); 99 SDP_PUT32(provider->handle, rsp); 100 101 /* Set reply size */ 102 srv->fdidx[fd].rsp_limit = srv->fdidx[fd].omtu - sizeof(sdp_pdu_t); 103 srv->fdidx[fd].rsp_size = rsp - srv->fdidx[fd].rsp; 104 srv->fdidx[fd].rsp_cs = 0; 105 106 return (0); 107 } 108 109 /* 110 * Send Service Register Response 111 */ 112 113 int32_t 114 server_send_service_register_response(server_p srv, int32_t fd) 115 { 116 struct iovec iov[2]; 117 sdp_pdu_t pdu; 118 int32_t size; 119 120 assert(srv->fdidx[fd].rsp_size < srv->fdidx[fd].rsp_limit); 121 122 pdu.pid = SDP_PDU_ERROR_RESPONSE; 123 pdu.tid = ((sdp_pdu_p)(srv->req))->tid; 124 pdu.len = htons(srv->fdidx[fd].rsp_size); 125 126 iov[0].iov_base = &pdu; 127 iov[0].iov_len = sizeof(pdu); 128 129 iov[1].iov_base = srv->fdidx[fd].rsp; 130 iov[1].iov_len = srv->fdidx[fd].rsp_size; 131 132 do { 133 size = writev(fd, (struct iovec const *) &iov, sizeof(iov)/sizeof(iov[0])); 134 } while (size < 0 && errno == EINTR); 135 136 srv->fdidx[fd].rsp_cs = 0; 137 srv->fdidx[fd].rsp_size = 0; 138 srv->fdidx[fd].rsp_limit = 0; 139 140 return ((size < 0)? errno : 0); 141 } 142 143