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 /* API_START */ 50 51 typedef struct btstack_linked_item { 52 struct btstack_linked_item *next; // <-- next element in list, or NULL 53 } btstack_linked_item_t; 54 55 typedef btstack_linked_item_t * btstack_linked_list_t; 56 57 typedef struct { 58 int advance_on_next; 59 btstack_linked_item_t * prev; // points to the item before the current one 60 btstack_linked_item_t * curr; // points to the current item (to detect item removal) 61 } btstack_linked_list_iterator_t; 62 63 64 // test if list is empty 65 int btstack_linked_list_empty(btstack_linked_list_t * list); 66 // add item to list as first element 67 void btstack_linked_list_add(btstack_linked_list_t * list, btstack_linked_item_t *item); 68 // add item to list as last element 69 void btstack_linked_list_add_tail(btstack_linked_list_t * list, btstack_linked_item_t *item); 70 // pop (get + remove) first element 71 btstack_linked_item_t * btstack_linked_list_pop(btstack_linked_list_t * list); 72 // remove item from list 73 int btstack_linked_list_remove(btstack_linked_list_t * list, btstack_linked_item_t *item); 74 // get first element 75 btstack_linked_item_t * btstack_linked_list_get_first_item(btstack_linked_list_t * list); 76 // find the last item in the list 77 btstack_linked_item_t * btstack_linked_list_get_last_item(btstack_linked_list_t * list); 78 79 /** 80 * @brief Counts number of items in list 81 * @returns number of items in list 82 */ 83 int btstack_linked_list_count(btstack_linked_list_t * list); 84 85 // 86 // iterator for linked lists. allows to remove current element. 87 // robust against removal of current element by btstack_linked_list_remove. 88 // 89 void btstack_linked_list_iterator_init(btstack_linked_list_iterator_t * it, btstack_linked_list_t * list); 90 int btstack_linked_list_iterator_has_next(btstack_linked_list_iterator_t * it); 91 btstack_linked_item_t * btstack_linked_list_iterator_next(btstack_linked_list_iterator_t * it); 92 void btstack_linked_list_iterator_remove(btstack_linked_list_iterator_t * it); 93 94 /* API_END */ 95 96 void test_linked_list(void); 97 98 99 #if defined __cplusplus 100 } 101 #endif 102 103 #endif // __BTSTACK_LINKED_LIST_H 104