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_linked_list.h 40 */ 41 42 #ifndef __BTSTACK_LINKED_LIST_H 43 #define __BTSTACK_LINKED_LIST_H 44 45 #if defined __cplusplus 46 extern "C" { 47 #endif 48 49 typedef struct btstack_linked_item { 50 struct btstack_linked_item *next; // <-- next element in list, or NULL 51 void *user_data; // <-- pointer to struct base 52 } btstack_linked_item_t; 53 54 typedef btstack_linked_item_t * btstack_btstack_linked_list_t; 55 56 typedef struct { 57 int advance_on_next; 58 btstack_linked_item_t * prev; // points to the item before the current one 59 btstack_linked_item_t * curr; // points to the current item (to detect item removal) 60 } btstack_linked_list_iterator_t; 61 62 63 // set user data 64 void btstack_linked_item_set_user(btstack_linked_item_t *item, void *user_data); 65 // get user data 66 void * btstack_linked_item_get_user(btstack_linked_item_t *item); 67 // test if list is empty 68 int btstack_linked_list_empty(btstack_btstack_linked_list_t * list); 69 // add item to list as first element 70 void btstack_linked_list_add(btstack_btstack_linked_list_t * list, btstack_linked_item_t *item); 71 // add item to list as last element 72 void btstack_linked_list_add_tail(btstack_btstack_linked_list_t * list, btstack_linked_item_t *item); 73 // remove item from list 74 int btstack_linked_list_remove(btstack_btstack_linked_list_t * list, btstack_linked_item_t *item); 75 // find the last item in the list 76 btstack_linked_item_t * btstack_linked_list_get_last_item(btstack_btstack_linked_list_t * list); 77 78 /** 79 * @brief Counts number of items in list 80 * @returns number of items in list 81 */ 82 int btstack_linked_list_count(btstack_btstack_linked_list_t * list); 83 84 // 85 // iterator for linked lists. allows to remove current element. 86 // robust against removal of current element by btstack_linked_list_remove. 87 // 88 void btstack_linked_list_iterator_init(btstack_linked_list_iterator_t * it, btstack_btstack_linked_list_t * list); 89 int btstack_linked_list_iterator_has_next(btstack_linked_list_iterator_t * it); 90 btstack_linked_item_t * btstack_linked_list_iterator_next(btstack_linked_list_iterator_t * it); 91 void btstack_linked_list_iterator_remove(btstack_linked_list_iterator_t * it); 92 93 void test_linked_list(void); 94 95 #if defined __cplusplus 96 } 97 #endif 98 99 #endif // __BTSTACK_LINKED_LIST_H 100