/* * Copyright (C) 2014 BlueKitchen GmbH * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of the copyright holders nor the names of * contributors may be used to endorse or promote products derived * from this software without specific prior written permission. * 4. Any redistribution, use, or modification is done solely for * personal benefit and not for any commercial purpose or for * monetary gain. * * THIS SOFTWARE IS PROVIDED BY BLUEKITCHEN GMBH AND CONTRIBUTORS * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL BLUEKITCHEN * GMBH OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF * THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * Please inquire about commercial licensing options at * contact@bluekitchen-gmbh.com * *//* ... */#defineBTSTACK_FILE__"btstack_linked_list.c"/* * linked_list.c * * Created by Matthias Ringwald on 7/13/09. *//* ... */#include"btstack_linked_list.h"#include"btstack_debug.h"#include<stddef.h>/** * tests if list is empty *//* ... */boolbtstack_linked_list_empty(btstack_linked_list_t*list){return*list==(void*)0;}{ ... }/** * btstack_linked_list_get_last_item *//* ... */btstack_linked_item_t*btstack_linked_list_get_last_item(btstack_linked_list_t*list){// <-- find the last item in the listbtstack_linked_item_t*lastItem=NULL;btstack_linked_item_t*it;for(it=*list;it!=NULL;it=it->next){if(it!=NULL){lastItem=it;}if (it != NULL) { ... }}for (it = *list; it != NULL; it = it->next) { ... }returnlastItem;}{ ... }/** * btstack_linked_list_add *//* ... */boolbtstack_linked_list_add(btstack_linked_list_t*list,btstack_linked_item_t*item){// <-- add item to list// check if already in listbtstack_linked_item_t*it;for(it=*list;it!=NULL;it=it->next){if(it==item){returnfalse;}if (it == item) { ... }}for (it = *list; it != NULL; it = it->next) { ... }// add firstitem->next=*list;*list=item;returntrue;}{ ... }boolbtstack_linked_list_add_tail(btstack_linked_list_t*list,btstack_linked_item_t*item){// <-- add item to list as last element// check if already in listbtstack_linked_item_t*it;for(it=(btstack_linked_item_t*)list;it->next!=NULL;it=it->next){if(it->next==item){returnfalse;}if (it->next == item) { ... }}for (it = (btstack_linked_item_t *) list; it->next != NULL ; it = it->next) { ... }item->next=(btstack_linked_item_t*)0;it->next=item;returntrue;}{ ... }boolbtstack_linked_list_remove(btstack_linked_list_t*list,btstack_linked_item_t*item){// <-- remove item from listif(!item)returnfalse;btstack_linked_item_t*it;for(it=(btstack_linked_item_t*)list;it!=NULL;it=it->next){if(it->next==item){it->next=item->next;returntrue;}if (it->next == item) { ... }}for (it = (btstack_linked_item_t *) list; it != NULL; it = it->next) { ... }returnfalse;}{ ... }/** * @return number of items in list *//* ... */intbtstack_linked_list_count(btstack_linked_list_t*list){btstack_linked_item_t*it;intcounter=0;for(it=(btstack_linked_item_t*)list;it->next!=NULL;it=it->next){counter++;}for (it = (btstack_linked_item_t *) list; it->next != NULL; it = it->next) { ... }returncounter;}{ ... }// get first elementbtstack_linked_item_t*btstack_linked_list_get_first_item(btstack_linked_list_t*list){return*list;}{ ... }// pop (get + remove) first elementbtstack_linked_item_t*btstack_linked_list_pop(btstack_linked_list_t*list){btstack_linked_item_t*item=*list;if(!item)returnNULL;*list=item->next;returnitem;}{ ... }//// Linked List Iterator implementation//voidbtstack_linked_list_iterator_init(btstack_linked_list_iterator_t*it,btstack_linked_list_t*list){it->advance_on_next=0;it->prev=(btstack_linked_item_t*)list;it->curr=*list;}{ ... }boolbtstack_linked_list_iterator_has_next(btstack_linked_list_iterator_t*it){// log_info("btstack_linked_list_iterator_has_next: advance on next %u, it->prev %p, it->curr %p", it->advance_on_next, it->prev, it->curr);if(!it->advance_on_next){returnit->curr!=NULL;}if (!it->advance_on_next) { ... }if(it->prev->next!=it->curr){// current item has been removedreturnit->prev->next!=NULL;}if (it->prev->next != it->curr) { ... }// current items has not been removedreturnit->curr->next!=NULL;}{ ... }btstack_linked_item_t*btstack_linked_list_iterator_next(btstack_linked_list_iterator_t*it){if(it->advance_on_next){if(it->prev->next==it->curr){it->prev=it->curr;it->curr=it->curr->next;}if (it->prev->next == it->curr) { ... }else{// curr was removed from the list, set it again but don't advance previt->curr=it->prev->next;}else { ... }}if (it->advance_on_next) { ... }else{it->advance_on_next=1;}else { ... }returnit->curr;}{ ... }voidbtstack_linked_list_iterator_remove(btstack_linked_list_iterator_t*it){btstack_assert(it->prev->next==it->curr);it->curr=it->curr->next;it->prev->next=it->curr;it->advance_on_next=0;}{ ... }
Details
Show: from
Types: Columns:
All items filtered out
All items filtered out
This file uses the notable symbols shown below. Click anywhere in the file to view more details.