mirror of
https://github.com/libretro/RetroArch
synced 2025-04-07 13:23:32 +00:00
68 lines
2.6 KiB
C
68 lines
2.6 KiB
C
/*
|
|
* Copyright (C) 2009 by Matthias Ringwald
|
|
*
|
|
* 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.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY MATTHIAS RINGWALD 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 MATTHIAS
|
|
* RINGWALD 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.
|
|
*
|
|
*/
|
|
|
|
#ifndef _BTSTACK_LINKED_LIST_H
|
|
#define _BTSTACK_LINKED_LIST_H
|
|
|
|
#if defined __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
typedef struct linked_item
|
|
{
|
|
struct linked_item *next; /* <-- next element in list, or NULL */
|
|
void *user_data; /* <-- pointer to struct base */
|
|
} linked_item_t;
|
|
|
|
typedef linked_item_t *linked_list_t;
|
|
|
|
void linked_item_set_user(linked_item_t *item, void *user_data); /* <-- set user data */
|
|
|
|
void * linked_item_get_user(linked_item_t *item); /* <-- get user data */
|
|
|
|
int linked_list_empty(linked_list_t * list);
|
|
|
|
void linked_list_add(linked_list_t * list, linked_item_t *item); /* <-- add item to list as first element */
|
|
|
|
void linked_list_add_tail(linked_list_t * list, linked_item_t *item); /* <-- add item to list as last element */
|
|
|
|
int linked_list_remove(linked_list_t * list, linked_item_t *item); /* <-- remove item from list */
|
|
|
|
linked_item_t * linked_list_get_last_item(linked_list_t * list); /* <-- find the last item in the list */
|
|
|
|
void test_linked_list(void);
|
|
|
|
#if defined __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif
|