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 53 /** 54 * @brief Compare two Bluetooth addresses 55 * @param a 56 * @param b 57 * @return true if equal 58 */ 59 int bd_addr_cmp(bd_addr_t a, bd_addr_t b){ 60 return memcmp(a,b, BD_ADDR_LEN); 61 } 62 63 /** 64 * @brief Copy Bluetooth address 65 * @param dest 66 * @param src 67 */ 68 void bd_addr_copy(bd_addr_t dest, bd_addr_t src){ 69 memcpy(dest,src,BD_ADDR_LEN); 70 } 71 72 uint16_t little_endian_read_16(const uint8_t * buffer, int pos){ 73 return ((uint16_t) buffer[pos]) | (((uint16_t)buffer[(pos)+1]) << 8); 74 } 75 uint32_t little_endian_read_24(const uint8_t * buffer, int pos){ 76 return ((uint32_t) buffer[pos]) | (((uint32_t)buffer[(pos)+1]) << 8) | (((uint32_t)buffer[(pos)+2]) << 16); 77 } 78 uint32_t little_endian_read_32(const uint8_t * buffer, int pos){ 79 return ((uint32_t) buffer[pos]) | (((uint32_t)buffer[(pos)+1]) << 8) | (((uint32_t)buffer[(pos)+2]) << 16) | (((uint32_t) buffer[(pos)+3]) << 24); 80 } 81 82 void little_endian_store_16(uint8_t *buffer, uint16_t pos, uint16_t value){ 83 buffer[pos++] = value; 84 buffer[pos++] = value >> 8; 85 } 86 87 void little_endian_store_32(uint8_t *buffer, uint16_t pos, uint32_t value){ 88 buffer[pos++] = value; 89 buffer[pos++] = value >> 8; 90 buffer[pos++] = value >> 16; 91 buffer[pos++] = value >> 24; 92 } 93 94 uint32_t big_endian_read_16( const uint8_t * buffer, int pos) { 95 return ((uint16_t) buffer[(pos)+1]) | (((uint16_t)buffer[ pos ]) << 8); 96 } 97 98 uint32_t big_endian_read_32( const uint8_t * buffer, int pos) { 99 return ((uint32_t) buffer[(pos)+3]) | (((uint32_t)buffer[(pos)+2]) << 8) | (((uint32_t)buffer[(pos)+1]) << 16) | (((uint32_t) buffer[pos]) << 24); 100 } 101 102 void big_endian_store_16(uint8_t *buffer, uint16_t pos, uint16_t value){ 103 buffer[pos++] = value >> 8; 104 buffer[pos++] = value; 105 } 106 107 void big_endian_store_32(uint8_t *buffer, uint16_t pos, uint32_t value){ 108 buffer[pos++] = value >> 24; 109 buffer[pos++] = value >> 16; 110 buffer[pos++] = value >> 8; 111 buffer[pos++] = value; 112 } 113 114 // general swap/endianess utils 115 void reverse_bytes(const uint8_t *src, uint8_t *dst, int len){ 116 int i; 117 for (i = 0; i < len; i++) 118 dst[len - 1 - i] = src[i]; 119 } 120 void reverse_24(const uint8_t * src, uint8_t * dst){ 121 reverse_bytes(src, dst, 3); 122 } 123 void reverse_48(const uint8_t * src, uint8_t * dst){ 124 reverse_bytes(src, dst, 6); 125 } 126 void reverse_56(const uint8_t * src, uint8_t * dst){ 127 reverse_bytes(src, dst, 7); 128 } 129 void reverse_64(const uint8_t * src, uint8_t * dst){ 130 reverse_bytes(src, dst, 8); 131 } 132 void reverse_128(const uint8_t * src, uint8_t * dst){ 133 reverse_bytes(src, dst, 16); 134 } 135 136 void reverse_bd_addr(const bd_addr_t src, bd_addr_t dest){ 137 reverse_bytes(src, dest, 6); 138 } 139 140 char char_for_nibble(int nibble){ 141 if (nibble < 10) return '0' + nibble; 142 nibble -= 10; 143 if (nibble < 6) return 'A' + nibble; 144 return '?'; 145 } 146 147 void printf_hexdump(const void *data, int size){ 148 if (size <= 0) return; 149 int i; 150 for (i=0; i<size;i++){ 151 printf("%02X ", ((uint8_t *)data)[i]); 152 } 153 printf("\n"); 154 } 155 156 // void log_info_hexdump(..){ 157 // 158 // } 159 160 void log_info_hexdump(const void *data, int size){ 161 #ifdef ENABLE_LOG_INFO 162 char buffer[6*16+1]; 163 int i, j; 164 165 uint8_t low = 0x0F; 166 uint8_t high = 0xF0; 167 j = 0; 168 for (i=0; i<size;i++){ 169 uint8_t byte = ((uint8_t *)data)[i]; 170 buffer[j++] = '0'; 171 buffer[j++] = 'x'; 172 buffer[j++] = char_for_nibble((byte & high) >> 4); 173 buffer[j++] = char_for_nibble(byte & low); 174 buffer[j++] = ','; 175 buffer[j++] = ' '; 176 if (j >= 6*16 ){ 177 buffer[j] = 0; 178 log_info("%s", buffer); 179 j = 0; 180 } 181 } 182 if (j != 0){ 183 buffer[j] = 0; 184 log_info("%s", buffer); 185 } 186 } 187 #endif 188 189 void log_info_key(const char * name, sm_key_t key){ 190 // log_info("%-6s ", name); 191 // hexdump(key, 16); 192 } 193 194 // UUIDs are stored in big endian, similar to bd_addr_t 195 196 // Bluetooth Base UUID: 00000000-0000-1000-8000- 00805F9B34FB 197 const uint8_t bluetooth_base_uuid[] = { 0x00, 0x00, 0x00, 0x00, /* - */ 0x00, 0x00, /* - */ 0x10, 0x00, /* - */ 198 0x80, 0x00, /* - */ 0x00, 0x80, 0x5F, 0x9B, 0x34, 0xFB }; 199 200 void uuid_add_bluetooth_prefix(uint8_t *uuid, uint32_t shortUUID){ 201 memcpy(uuid, bluetooth_base_uuid, 16); 202 big_endian_store_32(uuid, 0, shortUUID); 203 } 204 205 int uuid_has_bluetooth_prefix(uint8_t * uuid128){ 206 return memcmp(&uuid128[4], &bluetooth_base_uuid[4], 12) == 0; 207 } 208 209 static char uuid128_to_str_buffer[32+4+1]; 210 char * uuid128_to_str(uint8_t * uuid){ 211 sprintf(uuid128_to_str_buffer, "%02x%02x%02x%02x-%02x%02x-%02x%02x-%02x%02x-%02x%02x%02x%02x%02x%02x", 212 uuid[0], uuid[1], uuid[2], uuid[3], uuid[4], uuid[5], uuid[6], uuid[7], 213 uuid[8], uuid[9], uuid[10], uuid[11], uuid[12], uuid[13], uuid[14], uuid[15]); 214 return uuid128_to_str_buffer; 215 } 216 217 static char bd_addr_to_str_buffer[6*3]; // 12:45:78:01:34:67\0 218 char * bd_addr_to_str(bd_addr_t addr){ 219 // orig code 220 // sprintf(bd_addr_to_str_buffer, "%02x:%02x:%02x:%02x:%02x:%02x", addr[0], addr[1], addr[2], addr[3], addr[4], addr[5]); 221 // sprintf-free code 222 char * p = bd_addr_to_str_buffer; 223 int i; 224 for (i = 0; i < 6 ; i++) { 225 *p++ = char_for_nibble((addr[i] >> 4) & 0x0F); 226 *p++ = char_for_nibble((addr[i] >> 0) & 0x0F); 227 *p++ = ':'; 228 } 229 *--p = 0; 230 return (char *) bd_addr_to_str_buffer; 231 } 232 233 int sscanf_bd_addr(uint8_t * addr_string, bd_addr_t addr){ 234 unsigned int bd_addr_buffer[BD_ADDR_LEN]; //for sscanf, integer needed 235 // reset result buffer 236 memset(bd_addr_buffer, 0, sizeof(bd_addr_buffer)); 237 238 // parse 239 int result = sscanf( (char *) addr_string, "%2x:%2x:%2x:%2x:%2x:%2x", &bd_addr_buffer[0], &bd_addr_buffer[1], &bd_addr_buffer[2], 240 &bd_addr_buffer[3], &bd_addr_buffer[4], &bd_addr_buffer[5]); 241 242 if (result != BD_ADDR_LEN) return 0; 243 244 // store 245 int i; 246 for (i = 0; i < BD_ADDR_LEN; i++) { 247 addr[i] = (uint8_t) bd_addr_buffer[i]; 248 } 249 return 1; 250 } 251