107be7a6cSMaksim Yevmenkin /* 207be7a6cSMaksim Yevmenkin * ssr.c 307be7a6cSMaksim Yevmenkin * 407be7a6cSMaksim Yevmenkin * Copyright (c) 2004 Maksim Yevmenkin <m_evmenkin@yahoo.com> 507be7a6cSMaksim Yevmenkin * All rights reserved. 607be7a6cSMaksim Yevmenkin * 707be7a6cSMaksim Yevmenkin * Redistribution and use in source and binary forms, with or without 807be7a6cSMaksim Yevmenkin * modification, are permitted provided that the following conditions 907be7a6cSMaksim Yevmenkin * are met: 1007be7a6cSMaksim Yevmenkin * 1. Redistributions of source code must retain the above copyright 1107be7a6cSMaksim Yevmenkin * notice, this list of conditions and the following disclaimer. 1207be7a6cSMaksim Yevmenkin * 2. Redistributions in binary form must reproduce the above copyright 1307be7a6cSMaksim Yevmenkin * notice, this list of conditions and the following disclaimer in the 1407be7a6cSMaksim Yevmenkin * documentation and/or other materials provided with the distribution. 1507be7a6cSMaksim Yevmenkin * 1607be7a6cSMaksim Yevmenkin * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 1707be7a6cSMaksim Yevmenkin * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 1807be7a6cSMaksim Yevmenkin * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 1907be7a6cSMaksim Yevmenkin * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 2007be7a6cSMaksim Yevmenkin * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2107be7a6cSMaksim Yevmenkin * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 2207be7a6cSMaksim Yevmenkin * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 2307be7a6cSMaksim Yevmenkin * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 2407be7a6cSMaksim Yevmenkin * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 2507be7a6cSMaksim Yevmenkin * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 2607be7a6cSMaksim Yevmenkin * SUCH DAMAGE. 2707be7a6cSMaksim Yevmenkin * 2807be7a6cSMaksim Yevmenkin * $Id: ssr.c,v 1.5 2004/01/13 01:54:39 max Exp $ 2907be7a6cSMaksim Yevmenkin * $FreeBSD$ 3007be7a6cSMaksim Yevmenkin */ 3107be7a6cSMaksim Yevmenkin 3207be7a6cSMaksim Yevmenkin #include <sys/queue.h> 3307be7a6cSMaksim Yevmenkin #include <sys/uio.h> 3407be7a6cSMaksim Yevmenkin #include <netinet/in.h> 3507be7a6cSMaksim Yevmenkin #include <arpa/inet.h> 3607be7a6cSMaksim Yevmenkin #include <assert.h> 3707be7a6cSMaksim Yevmenkin #include <bluetooth.h> 3807be7a6cSMaksim Yevmenkin #include <errno.h> 3907be7a6cSMaksim Yevmenkin #include <sdp.h> 4007be7a6cSMaksim Yevmenkin #include <string.h> 4107be7a6cSMaksim Yevmenkin #include "profile.h" 4207be7a6cSMaksim Yevmenkin #include "provider.h" 4307be7a6cSMaksim Yevmenkin #include "server.h" 4407be7a6cSMaksim Yevmenkin 4507be7a6cSMaksim Yevmenkin /* 4607be7a6cSMaksim Yevmenkin * Prepare SDP Service Search Response 4707be7a6cSMaksim Yevmenkin */ 4807be7a6cSMaksim Yevmenkin 4907be7a6cSMaksim Yevmenkin int32_t 5007be7a6cSMaksim Yevmenkin server_prepare_service_search_response(server_p srv, int32_t fd) 5107be7a6cSMaksim Yevmenkin { 5207be7a6cSMaksim Yevmenkin uint8_t const *req = srv->req + sizeof(sdp_pdu_t); 5307be7a6cSMaksim Yevmenkin uint8_t const *req_end = req + ((sdp_pdu_p)(srv->req))->len; 5407be7a6cSMaksim Yevmenkin uint8_t *rsp = srv->fdidx[fd].rsp; 5507be7a6cSMaksim Yevmenkin uint8_t const *rsp_end = rsp + NG_L2CAP_MTU_MAXIMUM; 5607be7a6cSMaksim Yevmenkin 5707be7a6cSMaksim Yevmenkin uint8_t *ptr = NULL; 5807be7a6cSMaksim Yevmenkin provider_t *provider = NULL; 5907be7a6cSMaksim Yevmenkin int32_t type, ssplen, rsp_limit, rcount, cslen, cs, uuid; 6007be7a6cSMaksim Yevmenkin 6107be7a6cSMaksim Yevmenkin /* 6207be7a6cSMaksim Yevmenkin * Minimal SDP Service Search Request 6307be7a6cSMaksim Yevmenkin * 6407be7a6cSMaksim Yevmenkin * seq8 len8 - 2 bytes 6507be7a6cSMaksim Yevmenkin * uuid16 value16 - 3 bytes ServiceSearchPattern 6607be7a6cSMaksim Yevmenkin * value16 - 2 bytes MaximumServiceRecordCount 6707be7a6cSMaksim Yevmenkin * value8 - 1 byte ContinuationState 6807be7a6cSMaksim Yevmenkin */ 6907be7a6cSMaksim Yevmenkin 7007be7a6cSMaksim Yevmenkin if (req_end - req < 8) 7107be7a6cSMaksim Yevmenkin return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX); 7207be7a6cSMaksim Yevmenkin 7307be7a6cSMaksim Yevmenkin /* Get size of ServiceSearchPattern */ 7407be7a6cSMaksim Yevmenkin ssplen = 0; 7507be7a6cSMaksim Yevmenkin SDP_GET8(type, req); 7607be7a6cSMaksim Yevmenkin switch (type) { 7707be7a6cSMaksim Yevmenkin case SDP_DATA_SEQ8: 7807be7a6cSMaksim Yevmenkin SDP_GET8(ssplen, req); 7907be7a6cSMaksim Yevmenkin break; 8007be7a6cSMaksim Yevmenkin 8107be7a6cSMaksim Yevmenkin case SDP_DATA_SEQ16: 8207be7a6cSMaksim Yevmenkin SDP_GET16(ssplen, req); 8307be7a6cSMaksim Yevmenkin break; 8407be7a6cSMaksim Yevmenkin 8507be7a6cSMaksim Yevmenkin case SDP_DATA_SEQ32: 8607be7a6cSMaksim Yevmenkin SDP_GET32(ssplen, req); 8707be7a6cSMaksim Yevmenkin break; 8807be7a6cSMaksim Yevmenkin } 8907be7a6cSMaksim Yevmenkin if (ssplen <= 0) 9007be7a6cSMaksim Yevmenkin return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX); 9107be7a6cSMaksim Yevmenkin 9207be7a6cSMaksim Yevmenkin ptr = (uint8_t *) req + ssplen; 9307be7a6cSMaksim Yevmenkin 9407be7a6cSMaksim Yevmenkin /* Get MaximumServiceRecordCount */ 9507be7a6cSMaksim Yevmenkin if (ptr + 2 > req_end) 9607be7a6cSMaksim Yevmenkin return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX); 9707be7a6cSMaksim Yevmenkin 9807be7a6cSMaksim Yevmenkin SDP_GET16(rsp_limit, ptr); 9907be7a6cSMaksim Yevmenkin if (rsp_limit <= 0) 10007be7a6cSMaksim Yevmenkin return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX); 10107be7a6cSMaksim Yevmenkin 10207be7a6cSMaksim Yevmenkin /* Get ContinuationState */ 10307be7a6cSMaksim Yevmenkin if (ptr + 1 > req_end) 10407be7a6cSMaksim Yevmenkin return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX); 10507be7a6cSMaksim Yevmenkin 10607be7a6cSMaksim Yevmenkin SDP_GET8(cslen, ptr); 10707be7a6cSMaksim Yevmenkin if (cslen != 0) { 10807be7a6cSMaksim Yevmenkin if (cslen != 2 || req_end - ptr != 2) 10907be7a6cSMaksim Yevmenkin return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX); 11007be7a6cSMaksim Yevmenkin 11107be7a6cSMaksim Yevmenkin SDP_GET16(cs, ptr); 11207be7a6cSMaksim Yevmenkin } else 11307be7a6cSMaksim Yevmenkin cs = 0; 11407be7a6cSMaksim Yevmenkin 11507be7a6cSMaksim Yevmenkin /* Process the request. First, check continuation state */ 11607be7a6cSMaksim Yevmenkin if (srv->fdidx[fd].rsp_cs != cs) 11707be7a6cSMaksim Yevmenkin return (SDP_ERROR_CODE_INVALID_CONTINUATION_STATE); 11807be7a6cSMaksim Yevmenkin if (srv->fdidx[fd].rsp_size > 0) 11907be7a6cSMaksim Yevmenkin return (0); 12007be7a6cSMaksim Yevmenkin 12107be7a6cSMaksim Yevmenkin /* 12207be7a6cSMaksim Yevmenkin * Service Search Response format 12307be7a6cSMaksim Yevmenkin * 12407be7a6cSMaksim Yevmenkin * value16 - 2 bytes TotalServiceRecordCount (not incl.) 12507be7a6cSMaksim Yevmenkin * value16 - 2 bytes CurrentServiceRecordCount (not incl.) 12607be7a6cSMaksim Yevmenkin * value32 - 4 bytes handle 12707be7a6cSMaksim Yevmenkin * [ value32 ] 12807be7a6cSMaksim Yevmenkin * 12907be7a6cSMaksim Yevmenkin * Calculate how many record handles we can fit 13007be7a6cSMaksim Yevmenkin * in our reply buffer and adjust rlimit. 13107be7a6cSMaksim Yevmenkin */ 13207be7a6cSMaksim Yevmenkin 13307be7a6cSMaksim Yevmenkin ptr = rsp; 13407be7a6cSMaksim Yevmenkin rcount = (rsp_end - ptr) / 4; 13507be7a6cSMaksim Yevmenkin if (rcount < rsp_limit) 13607be7a6cSMaksim Yevmenkin rsp_limit = rcount; 13707be7a6cSMaksim Yevmenkin 13807be7a6cSMaksim Yevmenkin /* Look for the record handles */ 13907be7a6cSMaksim Yevmenkin for (rcount = 0; ssplen > 0 && rcount < rsp_limit; ) { 14007be7a6cSMaksim Yevmenkin SDP_GET8(type, req); 14107be7a6cSMaksim Yevmenkin ssplen --; 14207be7a6cSMaksim Yevmenkin 14307be7a6cSMaksim Yevmenkin switch (type) { 14407be7a6cSMaksim Yevmenkin case SDP_DATA_UUID16: 14507be7a6cSMaksim Yevmenkin if (ssplen < 2) 14607be7a6cSMaksim Yevmenkin return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX); 14707be7a6cSMaksim Yevmenkin 14807be7a6cSMaksim Yevmenkin SDP_GET16(uuid, req); 14907be7a6cSMaksim Yevmenkin ssplen -= 2; 15007be7a6cSMaksim Yevmenkin break; 15107be7a6cSMaksim Yevmenkin 15207be7a6cSMaksim Yevmenkin case SDP_DATA_UUID32: /* XXX FIXME */ 15307be7a6cSMaksim Yevmenkin case SDP_DATA_UUID128: /* XXX FIXME */ 15407be7a6cSMaksim Yevmenkin default: 15507be7a6cSMaksim Yevmenkin return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX); 15607be7a6cSMaksim Yevmenkin /* NOT REACHED */ 15707be7a6cSMaksim Yevmenkin } 15807be7a6cSMaksim Yevmenkin 15907be7a6cSMaksim Yevmenkin for (provider = provider_get_first(); 16007be7a6cSMaksim Yevmenkin provider != NULL && rcount < rsp_limit; 16107be7a6cSMaksim Yevmenkin provider = provider_get_next(provider)) { 16207be7a6cSMaksim Yevmenkin if (!provider_match_bdaddr(provider, &srv->req_sa.l2cap_bdaddr)) 16307be7a6cSMaksim Yevmenkin continue; 16407be7a6cSMaksim Yevmenkin 16507be7a6cSMaksim Yevmenkin if (provider->profile->uuid == uuid || 16607be7a6cSMaksim Yevmenkin SDP_SERVICE_CLASS_PUBLIC_BROWSE_GROUP == uuid) { 16707be7a6cSMaksim Yevmenkin SDP_PUT32(provider->handle, ptr); 16807be7a6cSMaksim Yevmenkin rcount ++; 16907be7a6cSMaksim Yevmenkin } 17007be7a6cSMaksim Yevmenkin } 17107be7a6cSMaksim Yevmenkin } 17207be7a6cSMaksim Yevmenkin 17307be7a6cSMaksim Yevmenkin /* Set reply size (not counting PDU header and continuation state) */ 17407be7a6cSMaksim Yevmenkin srv->fdidx[fd].rsp_limit = srv->fdidx[fd].omtu - sizeof(sdp_pdu_t) - 4; 17507be7a6cSMaksim Yevmenkin srv->fdidx[fd].rsp_size = ptr - rsp; 17607be7a6cSMaksim Yevmenkin srv->fdidx[fd].rsp_cs = 0; 17707be7a6cSMaksim Yevmenkin 17807be7a6cSMaksim Yevmenkin return (0); 17907be7a6cSMaksim Yevmenkin } 18007be7a6cSMaksim Yevmenkin 18107be7a6cSMaksim Yevmenkin /* 18207be7a6cSMaksim Yevmenkin * Send SDP Service Search Response 18307be7a6cSMaksim Yevmenkin */ 18407be7a6cSMaksim Yevmenkin 18507be7a6cSMaksim Yevmenkin int32_t 18607be7a6cSMaksim Yevmenkin server_send_service_search_response(server_p srv, int32_t fd) 18707be7a6cSMaksim Yevmenkin { 18807be7a6cSMaksim Yevmenkin uint8_t *rsp = srv->fdidx[fd].rsp + srv->fdidx[fd].rsp_cs; 18907be7a6cSMaksim Yevmenkin uint8_t *rsp_end = srv->fdidx[fd].rsp + srv->fdidx[fd].rsp_size; 19007be7a6cSMaksim Yevmenkin 19107be7a6cSMaksim Yevmenkin struct iovec iov[4]; 19207be7a6cSMaksim Yevmenkin sdp_pdu_t pdu; 19307be7a6cSMaksim Yevmenkin uint16_t rcounts[2]; 19407be7a6cSMaksim Yevmenkin uint8_t cs[3]; 19507be7a6cSMaksim Yevmenkin int32_t size; 19607be7a6cSMaksim Yevmenkin 19707be7a6cSMaksim Yevmenkin /* First update continuation state (assume we will send all data) */ 19807be7a6cSMaksim Yevmenkin size = rsp_end - rsp; 19907be7a6cSMaksim Yevmenkin srv->fdidx[fd].rsp_cs += size; 20007be7a6cSMaksim Yevmenkin 20107be7a6cSMaksim Yevmenkin if (size + 1 > srv->fdidx[fd].rsp_limit) { 20207be7a6cSMaksim Yevmenkin /* 20307be7a6cSMaksim Yevmenkin * We need to split out response. Add 3 more bytes for the 20407be7a6cSMaksim Yevmenkin * continuation state and move rsp_end and rsp_cs backwards. 20507be7a6cSMaksim Yevmenkin */ 20607be7a6cSMaksim Yevmenkin 20707be7a6cSMaksim Yevmenkin while ((rsp_end - rsp) + 3 > srv->fdidx[fd].rsp_limit) { 20807be7a6cSMaksim Yevmenkin rsp_end -= 4; 20907be7a6cSMaksim Yevmenkin srv->fdidx[fd].rsp_cs -= 4; 21007be7a6cSMaksim Yevmenkin } 21107be7a6cSMaksim Yevmenkin 21207be7a6cSMaksim Yevmenkin cs[0] = 2; 21307be7a6cSMaksim Yevmenkin cs[1] = srv->fdidx[fd].rsp_cs >> 8; 21407be7a6cSMaksim Yevmenkin cs[2] = srv->fdidx[fd].rsp_cs & 0xff; 21507be7a6cSMaksim Yevmenkin } else 21607be7a6cSMaksim Yevmenkin cs[0] = 0; 21707be7a6cSMaksim Yevmenkin 21807be7a6cSMaksim Yevmenkin assert(rsp_end >= rsp); 21907be7a6cSMaksim Yevmenkin 22007be7a6cSMaksim Yevmenkin rcounts[0] = srv->fdidx[fd].rsp_size / 4; /* TotalServiceRecordCount */ 22107be7a6cSMaksim Yevmenkin rcounts[1] = (rsp_end - rsp) / 4; /* CurrentServiceRecordCount */ 22207be7a6cSMaksim Yevmenkin 22307be7a6cSMaksim Yevmenkin pdu.pid = SDP_PDU_SERVICE_SEARCH_RESPONSE; 22407be7a6cSMaksim Yevmenkin pdu.tid = ((sdp_pdu_p)(srv->req))->tid; 22507be7a6cSMaksim Yevmenkin pdu.len = htons(sizeof(rcounts) + rcounts[1] * 4 + 1 + cs[0]); 22607be7a6cSMaksim Yevmenkin 22707be7a6cSMaksim Yevmenkin iov[0].iov_base = &pdu; 22807be7a6cSMaksim Yevmenkin iov[0].iov_len = sizeof(pdu); 22907be7a6cSMaksim Yevmenkin 23007be7a6cSMaksim Yevmenkin iov[1].iov_base = rcounts; 23107be7a6cSMaksim Yevmenkin iov[1].iov_len = sizeof(rcounts); 23207be7a6cSMaksim Yevmenkin 23307be7a6cSMaksim Yevmenkin iov[2].iov_base = rsp; 23407be7a6cSMaksim Yevmenkin iov[2].iov_len = rsp_end - rsp; 23507be7a6cSMaksim Yevmenkin 23607be7a6cSMaksim Yevmenkin iov[3].iov_base = cs; 23707be7a6cSMaksim Yevmenkin iov[3].iov_len = 1 + cs[0]; 23807be7a6cSMaksim Yevmenkin 23907be7a6cSMaksim Yevmenkin do { 24007be7a6cSMaksim Yevmenkin size = writev(fd, (struct iovec const *) &iov, sizeof(iov)/sizeof(iov[0])); 24107be7a6cSMaksim Yevmenkin } while (size < 0 && errno == EINTR); 24207be7a6cSMaksim Yevmenkin 24307be7a6cSMaksim Yevmenkin /* Check if we have sent (or failed to sent) last response chunk */ 24407be7a6cSMaksim Yevmenkin if (srv->fdidx[fd].rsp_cs == srv->fdidx[fd].rsp_size) { 24507be7a6cSMaksim Yevmenkin srv->fdidx[fd].rsp_cs = 0; 24607be7a6cSMaksim Yevmenkin srv->fdidx[fd].rsp_size = 0; 24707be7a6cSMaksim Yevmenkin srv->fdidx[fd].rsp_limit = 0; 24807be7a6cSMaksim Yevmenkin } 24907be7a6cSMaksim Yevmenkin 25007be7a6cSMaksim Yevmenkin return ((size < 0)? errno : 0); 25107be7a6cSMaksim Yevmenkin } 25207be7a6cSMaksim Yevmenkin 253