BadVPN – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | office | 1 | /** |
2 | * @file SLinkedList_decl.h |
||
3 | * @author Ambroz Bizjak <ambrop7@gmail.com> |
||
4 | * |
||
5 | * @section LICENSE |
||
6 | * |
||
7 | * Redistribution and use in source and binary forms, with or without |
||
8 | * modification, are permitted provided that the following conditions are met: |
||
9 | * 1. Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * 2. Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * 3. Neither the name of the author nor the |
||
15 | * names of its contributors may be used to endorse or promote products |
||
16 | * derived from this software without specific prior written permission. |
||
17 | * |
||
18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
||
19 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
||
20 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
||
21 | * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY |
||
22 | * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
||
23 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
||
24 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
||
25 | * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
||
27 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
28 | */ |
||
29 | |||
30 | #include "SLinkedList_header.h" |
||
31 | |||
32 | typedef struct { |
||
33 | SLinkedListEntry *first; |
||
34 | #if SLINKEDLIST_PARAM_FEATURE_LAST |
||
35 | SLinkedListEntry *last; |
||
36 | #endif |
||
37 | } SLinkedList; |
||
38 | |||
39 | typedef struct { |
||
40 | SLinkedListEntry *prev; |
||
41 | SLinkedListEntry *next; |
||
42 | } SLinkedListNode; |
||
43 | |||
44 | static void SLinkedListMarkRemoved (SLinkedListEntry *entry); |
||
45 | static int SLinkedListIsRemoved (SLinkedListEntry *entry); |
||
46 | |||
47 | static void SLinkedList_Init (SLinkedList *o); |
||
48 | static SLinkedListEntry * SLinkedList_Next (SLinkedList *o, SLinkedListEntry *entry); |
||
49 | static SLinkedListEntry * SLinkedList_Prev (SLinkedList *o, SLinkedListEntry *entry); |
||
50 | static void SLinkedList_Prepend (SLinkedList *o, SLinkedListEntry *entry); |
||
51 | #if SLINKEDLIST_PARAM_FEATURE_LAST |
||
52 | static void SLinkedList_Append (SLinkedList *o, SLinkedListEntry *entry); |
||
53 | #endif |
||
54 | static void SLinkedList_InsertBefore (SLinkedList *o, SLinkedListEntry *entry, SLinkedListEntry *before_entry); |
||
55 | static void SLinkedList_InsertAfter (SLinkedList *o, SLinkedListEntry *entry, SLinkedListEntry *after_entry); |
||
56 | static void SLinkedList_Remove (SLinkedList *o, SLinkedListEntry *entry); |
||
57 | static void SLinkedList_RemoveFirst (SLinkedList *o); |
||
58 | #if SLINKEDLIST_PARAM_FEATURE_LAST |
||
59 | static void SLinkedList_RemoveLast (SLinkedList *o); |
||
60 | #endif |
||
61 | static SLinkedListEntry * SLinkedList_First (const SLinkedList *o); |
||
62 | #if SLINKEDLIST_PARAM_FEATURE_LAST |
||
63 | static SLinkedListEntry * SLinkedList_Last (const SLinkedList *o); |
||
64 | #endif |
||
65 | static int SLinkedList_IsEmpty (const SLinkedList *o); |
||
66 | |||
67 | #include "SLinkedList_footer.h" |