/usr/include/debian-installer/list.h is in libdebian-installer4-dev 0.110ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 | /*
* list.h
*
* Copyright (C) 2003 Bastian Blank <waldi@debian.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef DEBIAN_INSTALLER__LIST_H
#define DEBIAN_INSTALLER__LIST_H
#include <debian-installer/mem_chunk.h>
typedef struct di_list di_list;
typedef struct di_list_node di_list_node;
/**
* @addtogroup di_list
* @{
*/
/**
* @brief Double-linked list
*/
struct di_list
{
di_list_node *head; /**< head of list */
di_list_node *bottom; /**< bottom of list */
};
/**
* @brief Node of a double-linked list
*/
struct di_list_node
{
di_list_node *next; /**< next node */
di_list_node *prev; /**< previsous node */
void *data; /**< data */
};
/**
* Allocate a double-linked list
*
* @return a di_list
*/
di_list *di_list_alloc (void);
/**
* Destroy the contents of a double-linked list
*
* @warning never use this function with a list which makes use of the chunk allocator
*
* @param list a di_list
*/
void di_list_destroy (di_list *list, di_destroy_notify destroy_func) __attribute__ ((nonnull(1)));
/**
* Free a double-linked list
*
* @param list a di_list
*/
void di_list_free (di_list *list);
/**
* Append to a double-linked list
*
* @warning don't mix with di_list_append_chunk
*
* @param list a di_list
* @param data the data
*/
void di_list_append (di_list *list, void *data) __attribute__ ((nonnull(1)));
/**
* Append to a double-linked list
*
* @warning don't mix with di_list_append_chunk
*
* @param list a di_list
* @param data the data
*/
void di_list_append_chunk (di_list *list, void *data, di_mem_chunk *mem_chunk) __attribute__ ((nonnull(1,3)));
/**
* Prepend to a double-linked list
*
* @warning don't mix with di_list_prepend_chunk
*
* @param list a di_list
* @param data the data
*/
void di_list_prepend (di_list *list, void *data) __attribute__ ((nonnull(1)));
/**
* Prepend to a double-linked list
*
* @warning don't mix with di_list_prepend
*
* @param list a di_list
* @param data the data
* @param mem_chunk a di_mem_chunk for allocation of new nodes
*
* @pre the di_mem_chunk must return chunks with at least the size of di_list_node
*/
void di_list_prepend_chunk (di_list *list, void *data, di_mem_chunk *mem_chunk) __attribute__ ((nonnull(1,3)));
/** @} */
#endif
|