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 #include <string.h> 39 #include <stdlib.h> 40 41 #include "classic/btstack_link_key_db_memory.h" 42 43 #include "btstack_debug.h" 44 #include "btstack_linked_list.h" 45 #include "btstack_memory.h" 46 #include "btstack_util.h" 47 #include "classic/core.h" 48 49 // This list should be directly accessed only by tests 50 btstack_linked_list_t db_mem_link_keys = NULL; 51 52 // Device info 53 static void db_open(void){ 54 } 55 56 static void db_close(void){ 57 } 58 59 static btstack_link_key_db_memory_entry_t * get_item(btstack_linked_list_t list, bd_addr_t bd_addr) { 60 btstack_linked_item_t *it; 61 for (it = (btstack_linked_item_t *) list; it ; it = it->next){ 62 btstack_link_key_db_memory_entry_t * item = (btstack_link_key_db_memory_entry_t *) it; 63 if (bd_addr_cmp(item->bd_addr, bd_addr) == 0) { 64 return item; 65 } 66 } 67 return NULL; 68 } 69 70 static int get_link_key(bd_addr_t bd_addr, link_key_t link_key, link_key_type_t * link_key_type) { 71 btstack_link_key_db_memory_entry_t * item = get_item(db_mem_link_keys, bd_addr); 72 73 if (!item) return 0; 74 75 memcpy(link_key, item->link_key, LINK_KEY_LEN); 76 if (link_key_type) { 77 *link_key_type = item->link_key_type; 78 } 79 btstack_linked_list_remove(&db_mem_link_keys, (btstack_linked_item_t *) item); 80 btstack_linked_list_add(&db_mem_link_keys, (btstack_linked_item_t *) item); 81 82 return 1; 83 } 84 85 static void delete_link_key(bd_addr_t bd_addr){ 86 btstack_link_key_db_memory_entry_t * item = get_item(db_mem_link_keys, bd_addr); 87 88 if (!item) return; 89 90 btstack_linked_list_remove(&db_mem_link_keys, (btstack_linked_item_t *) item); 91 btstack_memory_btstack_link_key_db_memory_entry_free((btstack_link_key_db_memory_entry_t*)item); 92 } 93 94 95 static void put_link_key(bd_addr_t bd_addr, link_key_t link_key, link_key_type_t link_key_type){ 96 97 // check for existing record and remove if found 98 btstack_link_key_db_memory_entry_t * record = get_item(db_mem_link_keys, bd_addr); 99 if (record){ 100 btstack_linked_list_remove(&db_mem_link_keys, (btstack_linked_item_t*) record); 101 } 102 103 // record not found, get new one from memory pool 104 if (!record) { 105 record = btstack_memory_btstack_link_key_db_memory_entry_get(); 106 } 107 108 // if none left, re-use last item and remove from list 109 if (!record){ 110 record = (btstack_link_key_db_memory_entry_t*) btstack_linked_list_get_last_item(&db_mem_link_keys); 111 if (record) { 112 btstack_linked_list_remove(&db_mem_link_keys, (btstack_linked_item_t*) record); 113 } 114 } 115 116 if (!record) return; 117 118 memcpy(record->bd_addr, bd_addr, sizeof(bd_addr_t)); 119 memcpy(record->link_key, link_key, LINK_KEY_LEN); 120 record->link_key_type = link_key_type; 121 btstack_linked_list_add(&db_mem_link_keys, (btstack_linked_item_t *) record); 122 } 123 124 const btstack_link_key_db_t btstack_link_key_db_memory = { 125 db_open, 126 db_close, 127 get_link_key, 128 put_link_key, 129 delete_link_key, 130 }; 131 132 const btstack_link_key_db_t * btstack_link_key_db_memory_instance(void){ 133 return &btstack_link_key_db_memory; 134 } 135 136 137