BadVPN – Blame information for rev 1
?pathlinks?
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 1 | office | 1 | /** |
| 2 | * @file SLinkedList_header.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 | // Preprocessor inputs: |
||
| 31 | // SLINKEDLIST_PARAM_NAME - name of this data structure |
||
| 32 | // SLINKEDLIST_PARAM_FEATURE_LAST - whether to keep track of the last entry in the list (0/1) |
||
| 33 | // SLINKEDLIST_PARAM_TYPE_ENTRY - type of entry |
||
| 34 | // SLINKEDLIST_PARAM_MEMBER_NODE - name of the node member in entry |
||
| 35 | |||
| 36 | // types |
||
| 37 | #define SLinkedList SLINKEDLIST_PARAM_NAME |
||
| 38 | #define SLinkedListEntry SLINKEDLIST_PARAM_TYPE_ENTRY |
||
| 39 | #define SLinkedListNode MERGE(SLinkedList, Node) |
||
| 40 | |||
| 41 | // non-object public functions |
||
| 42 | #define SLinkedListMarkRemoved MERGE(SLinkedList, MarkRemoved) |
||
| 43 | #define SLinkedListIsRemoved MERGE(SLinkedList, IsRemoved) |
||
| 44 | |||
| 45 | // public functions |
||
| 46 | #define SLinkedList_Init MERGE(SLinkedList, _Init) |
||
| 47 | #define SLinkedList_Next MERGE(SLinkedList, _Next) |
||
| 48 | #define SLinkedList_Prev MERGE(SLinkedList, _Prev) |
||
| 49 | #define SLinkedList_Prepend MERGE(SLinkedList, _Prepend) |
||
| 50 | #define SLinkedList_Append MERGE(SLinkedList, _Append) |
||
| 51 | #define SLinkedList_InsertBefore MERGE(SLinkedList, _InsertBefore) |
||
| 52 | #define SLinkedList_InsertAfter MERGE(SLinkedList, _InsertAfter) |
||
| 53 | #define SLinkedList_Remove MERGE(SLinkedList, _Remove) |
||
| 54 | #define SLinkedList_RemoveFirst MERGE(SLinkedList, _RemoveFirst) |
||
| 55 | #define SLinkedList_RemoveLast MERGE(SLinkedList, _RemoveLast) |
||
| 56 | #define SLinkedList_First MERGE(SLinkedList, _First) |
||
| 57 | #define SLinkedList_Last MERGE(SLinkedList, _Last) |
||
| 58 | #define SLinkedList_IsEmpty MERGE(SLinkedList, _IsEmpty) |
||
| 59 | |||
| 60 | // private things |
||
| 61 | #define SLinkedList_prev(entry) ((entry)->SLINKEDLIST_PARAM_MEMBER_NODE . prev) |
||
| 62 | #define SLinkedList_next(entry) ((entry)->SLINKEDLIST_PARAM_MEMBER_NODE . next) |