iPXE
list.c
Go to the documentation of this file.
1 /*
2  * Copyright (C) 2012 Michael Brown <mbrown@fensystems.co.uk>.
3  *
4  * This program is free software; you can redistribute it and/or
5  * modify it under the terms of the GNU General Public License as
6  * published by the Free Software Foundation; either version 2 of the
7  * License, or (at your option) any later version.
8  *
9  * This program is distributed in the hope that it will be useful, but
10  * WITHOUT ANY WARRANTY; without even the implied warranty of
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12  * General Public License for more details.
13  *
14  * You should have received a copy of the GNU General Public License
15  * along with this program; if not, write to the Free Software
16  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
17  * 02110-1301, USA.
18  *
19  * You can also choose to distribute this program under the terms of
20  * the Unmodified Binary Distribution Licence (as given in the file
21  * COPYING.UBDL), provided that you have satisfied its requirements.
22  */
23 
24 FILE_LICENCE ( GPL2_OR_LATER_OR_UBDL );
25 
26 /** @file
27  *
28  * Linked lists
29  *
30  */
31 
32 #include <ipxe/list.h>
33 
34 void extern_list_add ( struct list_head *new, struct list_head *head ) {
35  inline_list_add ( new, head );
36 }
37 
38 void extern_list_add_tail ( struct list_head *new, struct list_head *head ) {
39  inline_list_add_tail ( new, head );
40 }
41 
42 void extern_list_del ( struct list_head *list ) {
43  inline_list_del ( list );
44 }
45 
46 int extern_list_empty ( const struct list_head *list ) {
47  return inline_list_empty ( list );
48 }
49 
50 int extern_list_is_singular ( const struct list_head *list ) {
51  return inline_list_is_singular ( list );
52 }
53 
54 int extern_list_is_last ( const struct list_head *list,
55  const struct list_head *head ) {
56  return inline_list_is_last ( list, head );
57 }
58 
60  struct list_head *list,
61  struct list_head *entry ) {
62  inline_list_cut_position ( new, list, entry );
63 }
64 
65 void extern_list_splice ( const struct list_head *list,
66  struct list_head *entry ) {
67  inline_list_splice ( list, entry );
68 }
69 
70 void extern_list_splice_tail ( const struct list_head *list,
71  struct list_head *entry ) {
73 }
74 
75 void extern_list_splice_init ( struct list_head *list,
76  struct list_head *entry ) {
78 }
79 
81  struct list_head *entry ) {
83 }
84 
86  struct list_head *head ) {
87  return inline_list_contains ( entry, head );
88 }
static int inline_list_empty(const struct list_head *list)
Definition: list.h:139
static void inline_list_splice_init(struct list_head *list, struct list_head *entry)
Definition: list.h:283
static void inline_list_add(struct list_head *new, struct list_head *head)
Definition: list.h:75
static void inline_list_splice(const struct list_head *list, struct list_head *entry)
Definition: list.h:225
static void inline_list_splice_tail(const struct list_head *list, struct list_head *entry)
Definition: list.h:255
void extern_list_splice_init(struct list_head *list, struct list_head *entry)
Definition: list.c:75
uint8_t head
Head number.
Definition: int13.h:34
A doubly-linked list entry (or list head)
Definition: list.h:18
void extern_list_splice_tail(const struct list_head *list, struct list_head *entry)
Definition: list.c:70
int extern_list_empty(const struct list_head *list)
Definition: list.c:46
int extern_list_contains(struct list_head *entry, struct list_head *head)
Definition: list.c:85
static int inline_list_contains(struct list_head *entry, struct list_head *head)
Definition: list.h:492
static void inline_list_cut_position(struct list_head *new, struct list_head *list, struct list_head *entry)
Definition: list.h:192
static void inline_list_del(struct list_head *list)
Definition: list.h:123
void extern_list_add(struct list_head *new, struct list_head *head)
Definition: list.c:34
Linked lists.
void extern_list_splice_tail_init(struct list_head *list, struct list_head *entry)
Definition: list.c:80
union aes_table_entry entry[256]
Table entries, indexed by S(N)
Definition: aes.c:26
void extern_list_cut_position(struct list_head *new, struct list_head *list, struct list_head *entry)
Definition: list.c:59
FILE_LICENCE(GPL2_OR_LATER_OR_UBDL)
void extern_list_add_tail(struct list_head *new, struct list_head *head)
Definition: list.c:38
int extern_list_is_last(const struct list_head *list, const struct list_head *head)
Definition: list.c:54
void extern_list_splice(const struct list_head *list, struct list_head *entry)
Definition: list.c:65
static int inline_list_is_singular(const struct list_head *list)
Definition: list.h:152
int extern_list_is_singular(const struct list_head *list)
Definition: list.c:50
static void inline_list_splice_tail_init(struct list_head *list, struct list_head *entry)
Definition: list.h:305
void extern_list_del(struct list_head *list)
Definition: list.c:42
static int inline_list_is_last(const struct list_head *list, const struct list_head *head)
Definition: list.h:167
static void inline_list_add_tail(struct list_head *new, struct list_head *head)
Definition: list.h:99