00001 /* 00002 * Copyright (c) 2011 Jiri Svoboda 00003 * All rights reserved. 00004 * 00005 * Redistribution and use in source and binary forms, with or without 00006 * modification, are permitted provided that the following conditions 00007 * are met: 00008 * 00009 * - Redistributions of source code must retain the above copyright 00010 * notice, this list of conditions and the following disclaimer. 00011 * - Redistributions in binary form must reproduce the above copyright 00012 * notice, this list of conditions and the following disclaimer in the 00013 * documentation and/or other materials provided with the distribution. 00014 * - The name of the author may not be used to endorse or promote products 00015 * derived from this software without specific prior written permission. 00016 * 00017 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 00018 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 00019 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 00020 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 00021 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 00022 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 00023 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 00024 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 00025 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 00026 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00027 */ 00028 00029 #ifndef LIST_H_ 00030 #define LIST_H_ 00031 00032 #include "mytypes.h" 00033 #include "compat.h" 00034 00035 void list_init(list_t *list); 00036 void list_fini(list_t *list); 00037 void list_append(list_t *list, void *data); 00038 void list_prepend(list_t *list, void *data); 00039 void list_remove(list_t *list, list_node_t *node); 00040 00041 list_node_t *list_first(list_t *list); 00042 list_node_t *list_last(list_t *list); 00043 list_node_t *list_next(list_t *list, list_node_t *node); 00044 list_node_t *list_prev(list_t *list, list_node_t *node); 00045 bool_t list_is_empty(list_t *list); 00046 00047 void list_node_setdata(list_node_t *node, void *data); 00048 00049 #define list_node_data(node, dtype) ((dtype)(node->data)) 00050 00051 #endif