xref: /btstack/src/btstack_util.c (revision 1b0524c477c406eec3f69fd42a01dc396a9df63c)
1 /*
2  * Copyright (C) 2014 BlueKitchen GmbH
3  *
4  * Redistribution and use in source and binary forms, with or without
5  * modification, are permitted provided that the following conditions
6  * are met:
7  *
8  * 1. Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer.
10  * 2. Redistributions in binary form must reproduce the above copyright
11  *    notice, this list of conditions and the following disclaimer in the
12  *    documentation and/or other materials provided with the distribution.
13  * 3. Neither the name of the copyright holders nor the names of
14  *    contributors may be used to endorse or promote products derived
15  *    from this software without specific prior written permission.
16  * 4. Any redistribution, use, or modification is done solely for
17  *    personal benefit and not for any commercial purpose or for
18  *    monetary gain.
19  *
20  * THIS SOFTWARE IS PROVIDED BY BLUEKITCHEN GMBH AND CONTRIBUTORS
21  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
23  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL MATTHIAS
24  * RINGWALD OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
25  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
26  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
27  * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
28  * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
29  * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
30  * THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31  * SUCH DAMAGE.
32  *
33  * Please inquire about commercial licensing options at
34  * [email protected]
35  *
36  */
37 
38 /*
39  *  btstack_util.c
40  *
41  *  General utility functions
42  *
43  *  Created by Matthias Ringwald on 7/23/09.
44  */
45 
46 #include "btstack_config.h"
47 #include "btstack_util.h"
48 #include <stdio.h>
49 #include <string.h>
50 #include "btstack_debug.h"
51 
52 void little_endian_store_16(uint8_t *buffer, uint16_t pos, uint16_t value){
53     buffer[pos++] = value;
54     buffer[pos++] = value >> 8;
55 }
56 
57 void little_endian_store_32(uint8_t *buffer, uint16_t pos, uint32_t value){
58     buffer[pos++] = value;
59     buffer[pos++] = value >> 8;
60     buffer[pos++] = value >> 16;
61     buffer[pos++] = value >> 24;
62 }
63 
64 void big_endian_store_16(uint8_t *buffer, uint16_t pos, uint16_t value){
65     buffer[pos++] = value >> 8;
66     buffer[pos++] = value;
67 }
68 
69 void big_endian_store_32(uint8_t *buffer, uint16_t pos, uint32_t value){
70     buffer[pos++] = value >> 24;
71     buffer[pos++] = value >> 16;
72     buffer[pos++] = value >> 8;
73     buffer[pos++] = value;
74 }
75 
76 void bt_flip_addr(bd_addr_t dest, bd_addr_t src){
77     dest[0] = src[5];
78     dest[1] = src[4];
79     dest[2] = src[3];
80     dest[3] = src[2];
81     dest[4] = src[1];
82     dest[5] = src[0];
83 }
84 
85 // general swap/endianess utils
86 void swapX(const uint8_t *src, uint8_t *dst, int len){
87     int i;
88     for (i = 0; i < len; i++)
89         dst[len - 1 - i] = src[i];
90 }
91 void swap24(const uint8_t * src, uint8_t * dst){
92     swapX(src, dst, 3);
93 }
94 void swap48(const uint8_t * src, uint8_t * dst){
95     swapX(src, dst, 6);
96 }
97 void swap56(const uint8_t * src, uint8_t * dst){
98     swapX(src, dst, 7);
99 }
100 void swap64(const uint8_t * src, uint8_t * dst){
101     swapX(src, dst, 8);
102 }
103 void swap128(const uint8_t * src, uint8_t * dst){
104     swapX(src, dst, 16);
105 }
106 
107 char char_for_nibble(int nibble){
108     if (nibble < 10) return '0' + nibble;
109     nibble -= 10;
110     if (nibble < 6) return 'A' + nibble;
111     return '?';
112 }
113 
114 void printf_hexdump(const void *data, int size){
115     if (size <= 0) return;
116     int i;
117     for (i=0; i<size;i++){
118         printf("%02X ", ((uint8_t *)data)[i]);
119     }
120     printf("\n");
121 }
122 
123 void hexdumpf(const void *data, int size){
124     char buffer[6*16+1];
125     int i, j;
126 
127     uint8_t low = 0x0F;
128     uint8_t high = 0xF0;
129     j = 0;
130     for (i=0; i<size;i++){
131         uint8_t byte = ((uint8_t *)data)[i];
132         buffer[j++] = '0';
133         buffer[j++] = 'x';
134         buffer[j++] = char_for_nibble((byte & high) >> 4);
135         buffer[j++] = char_for_nibble(byte & low);
136         buffer[j++] = ',';
137         buffer[j++] = ' ';
138         if (j >= 6*16 ){
139             buffer[j] = 0;
140             printf("%s\n", buffer);
141             j = 0;
142         }
143     }
144     if (j != 0){
145         buffer[j] = 0;
146         printf("%s\n", buffer);
147     }
148 }
149 
150 //  void log_info_hexdump(..){
151 //
152 //  }
153 
154 void hexdump(const void *data, int size){
155 #ifdef ENABLE_LOG_INFO
156     char buffer[6*16+1];
157     int i, j;
158 
159     uint8_t low = 0x0F;
160     uint8_t high = 0xF0;
161     j = 0;
162     for (i=0; i<size;i++){
163         uint8_t byte = ((uint8_t *)data)[i];
164         buffer[j++] = '0';
165         buffer[j++] = 'x';
166         buffer[j++] = char_for_nibble((byte & high) >> 4);
167         buffer[j++] = char_for_nibble(byte & low);
168         buffer[j++] = ',';
169         buffer[j++] = ' ';
170         if (j >= 6*16 ){
171             buffer[j] = 0;
172             log_info("%s", buffer);
173             j = 0;
174         }
175     }
176     if (j != 0){
177         buffer[j] = 0;
178         log_info("%s", buffer);
179     }
180 #endif
181 }
182 
183 void log_key(const char * name, sm_key_t key){
184     log_info("%-6s ", name);
185     hexdump(key, 16);
186 }
187 
188 // Bluetooth Base UUID: 00000000-0000-1000-8000- 00805F9B34FB
189 const uint8_t sdp_bluetooth_base_uuid[] = { 0x00, 0x00, 0x00, 0x00, /* - */ 0x00, 0x00, /* - */ 0x10, 0x00, /* - */
190     0x80, 0x00, /* - */ 0x00, 0x80, 0x5F, 0x9B, 0x34, 0xFB };
191 
192 void sdp_normalize_uuid(uint8_t *uuid, uint32_t shortUUID){
193     memcpy(uuid, sdp_bluetooth_base_uuid, 16);
194     big_endian_store_32(uuid, 0, shortUUID);
195 }
196 
197 int sdp_has_blueooth_base_uuid(uint8_t * uuid128){
198     return memcmp(&uuid128[4], &sdp_bluetooth_base_uuid[4], 12) == 0;
199 }
200 
201 static char uuid128_to_str_buffer[32+4+1];
202 char * uuid128_to_str(uint8_t * uuid){
203     sprintf(uuid128_to_str_buffer, "%02x%02x%02x%02x-%02x%02x-%02x%02x-%02x%02x-%02x%02x%02x%02x%02x%02x",
204            uuid[0], uuid[1], uuid[2], uuid[3], uuid[4], uuid[5], uuid[6], uuid[7],
205            uuid[8], uuid[9], uuid[10], uuid[11], uuid[12], uuid[13], uuid[14], uuid[15]);
206     return uuid128_to_str_buffer;
207 }
208 
209 static char bd_addr_to_str_buffer[6*3];  // 12:45:78:01:34:67\0
210 char * bd_addr_to_str(bd_addr_t addr){
211     // orig code
212     // sprintf(bd_addr_to_str_buffer, "%02x:%02x:%02x:%02x:%02x:%02x", addr[0], addr[1], addr[2], addr[3], addr[4], addr[5]);
213     // sprintf-free code
214     char * p = bd_addr_to_str_buffer;
215     int i;
216     for (i = 0; i < 6 ; i++) {
217         *p++ = char_for_nibble((addr[i] >> 4) & 0x0F);
218         *p++ = char_for_nibble((addr[i] >> 0) & 0x0F);
219         *p++ = ':';
220     }
221     *--p = 0;
222     return (char *) bd_addr_to_str_buffer;
223 }
224 
225 int sscan_bd_addr(uint8_t * addr_string, bd_addr_t addr){
226 	unsigned int bd_addr_buffer[BD_ADDR_LEN];  //for sscanf, integer needed
227 	// reset result buffer
228     memset(bd_addr_buffer, 0, sizeof(bd_addr_buffer));
229 
230 	// parse
231     int result = sscanf( (char *) addr_string, "%2x:%2x:%2x:%2x:%2x:%2x", &bd_addr_buffer[0], &bd_addr_buffer[1], &bd_addr_buffer[2],
232 						&bd_addr_buffer[3], &bd_addr_buffer[4], &bd_addr_buffer[5]);
233 
234     if (result != BD_ADDR_LEN) return 0;
235 
236 	// store
237     int i;
238 	for (i = 0; i < BD_ADDR_LEN; i++) {
239 		addr[i] = (uint8_t) bd_addr_buffer[i];
240 	}
241 	return 1;
242 }
243