xref: /freebsd/usr.sbin/bluetooth/sdpd/srr.c (revision 59c8e88e72633afbc47a4ace0d2170d00d51f7dc)
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  */
32 
33 #include <sys/queue.h>
34 #include <sys/uio.h>
35 #include <netinet/in.h>
36 #include <arpa/inet.h>
37 #include <assert.h>
38 #define L2CAP_SOCKET_CHECKED
39 #include <bluetooth.h>
40 #include <errno.h>
41 #include <sdp.h>
42 #include <string.h>
43 #include "profile.h"
44 #include "provider.h"
45 #include "server.h"
46 
47 /*
48  * Prepare Service Register response
49  */
50 
51 int32_t
52 server_prepare_service_register_response(server_p srv, int32_t fd)
53 {
54 	uint8_t const	*req = srv->req + sizeof(sdp_pdu_t);
55 	uint8_t const	*req_end = req + ((sdp_pdu_p)(srv->req))->len;
56 	uint8_t		*rsp = srv->fdidx[fd].rsp;
57 
58 	profile_t	*profile = NULL;
59 	provider_t	*provider = NULL;
60 	bdaddr_t	*bdaddr = NULL;
61 	int32_t		 uuid;
62 
63 	/*
64 	 * Minimal Service Register Request
65 	 *
66 	 * value16	- uuid 2 bytes
67 	 * bdaddr	- BD_ADDR 6 bytes
68 	 */
69 
70 	if (!srv->fdidx[fd].control ||
71 	    !srv->fdidx[fd].priv || req_end - req < 8)
72 		return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX);
73 
74 	/* Get ServiceClass UUID */
75 	SDP_GET16(uuid, req);
76 
77 	/* Get BD_ADDR */
78 	bdaddr = (bdaddr_p) req;
79 	req += sizeof(*bdaddr);
80 
81 	/* Lookup profile descriptror */
82 	profile = profile_get_descriptor(uuid);
83 	if (profile == NULL)
84 		return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX);
85 
86 	/* Validate user data */
87 	if (req_end - req < profile->dsize ||
88 	    profile->valid == NULL ||
89 	    (profile->valid)(req, req_end - req) == 0)
90 		return (SDP_ERROR_CODE_INVALID_REQUEST_SYNTAX);
91 
92 	/* Register provider */
93 	provider = provider_register(profile, bdaddr, fd, req, req_end - req);
94 	if (provider == NULL)
95 		return (SDP_ERROR_CODE_INSUFFICIENT_RESOURCES);
96 
97 	SDP_PUT16(0, rsp);
98 	SDP_PUT32(provider->handle, rsp);
99 
100 	/* Set reply size */
101 	srv->fdidx[fd].rsp_limit = srv->fdidx[fd].omtu - sizeof(sdp_pdu_t);
102 	srv->fdidx[fd].rsp_size = rsp - srv->fdidx[fd].rsp;
103 	srv->fdidx[fd].rsp_cs = 0;
104 
105 	return (0);
106 }
107 
108 /*
109  * Send Service Register Response
110  */
111 
112 int32_t
113 server_send_service_register_response(server_p srv, int32_t fd)
114 {
115 	struct iovec	iov[2];
116 	sdp_pdu_t	pdu;
117 	int32_t		size;
118 
119 	assert(srv->fdidx[fd].rsp_size < srv->fdidx[fd].rsp_limit);
120 
121 	pdu.pid = SDP_PDU_ERROR_RESPONSE;
122 	pdu.tid = ((sdp_pdu_p)(srv->req))->tid;
123 	pdu.len = htons(srv->fdidx[fd].rsp_size);
124 
125 	iov[0].iov_base = &pdu;
126 	iov[0].iov_len = sizeof(pdu);
127 
128 	iov[1].iov_base = srv->fdidx[fd].rsp;
129 	iov[1].iov_len = srv->fdidx[fd].rsp_size;
130 
131 	do {
132 		size = writev(fd, (struct iovec const *) &iov, sizeof(iov)/sizeof(iov[0]));
133 	} while (size < 0 && errno == EINTR);
134 
135 	srv->fdidx[fd].rsp_cs = 0;
136 	srv->fdidx[fd].rsp_size = 0;
137 	srv->fdidx[fd].rsp_limit = 0;
138 
139 	return ((size < 0)? errno : 0);
140 }
141 
142