Wed, 31 Dec 2014 06:09:35 +0100
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
michael@0 | 1 | /* This Source Code Form is subject to the terms of the Mozilla Public |
michael@0 | 2 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
michael@0 | 3 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ |
michael@0 | 4 | /* |
michael@0 | 5 | * pkix_list.h |
michael@0 | 6 | * |
michael@0 | 7 | * List Object Type Definition |
michael@0 | 8 | * |
michael@0 | 9 | */ |
michael@0 | 10 | |
michael@0 | 11 | #ifndef _PKIX_LIST_H |
michael@0 | 12 | #define _PKIX_LIST_H |
michael@0 | 13 | |
michael@0 | 14 | #include "pkix_tools.h" |
michael@0 | 15 | |
michael@0 | 16 | #ifdef __cplusplus |
michael@0 | 17 | extern "C" { |
michael@0 | 18 | #endif |
michael@0 | 19 | |
michael@0 | 20 | typedef PKIX_Error * |
michael@0 | 21 | (*PKIX_List_SortComparatorCallback)( |
michael@0 | 22 | PKIX_PL_Object *obj1, |
michael@0 | 23 | PKIX_PL_Object *obj2, |
michael@0 | 24 | PKIX_Int32 *pResult, |
michael@0 | 25 | void *plContext); |
michael@0 | 26 | |
michael@0 | 27 | struct PKIX_ListStruct { |
michael@0 | 28 | PKIX_PL_Object *item; |
michael@0 | 29 | PKIX_List *next; |
michael@0 | 30 | PKIX_Boolean immutable; |
michael@0 | 31 | PKIX_UInt32 length; |
michael@0 | 32 | PKIX_Boolean isHeader; |
michael@0 | 33 | }; |
michael@0 | 34 | |
michael@0 | 35 | /* see source file for function documentation */ |
michael@0 | 36 | |
michael@0 | 37 | PKIX_Error *pkix_List_RegisterSelf(void *plContext); |
michael@0 | 38 | |
michael@0 | 39 | PKIX_Error * |
michael@0 | 40 | pkix_List_Contains( |
michael@0 | 41 | PKIX_List *list, |
michael@0 | 42 | PKIX_PL_Object *object, |
michael@0 | 43 | PKIX_Boolean *pFound, |
michael@0 | 44 | void *plContext); |
michael@0 | 45 | |
michael@0 | 46 | PKIX_Error * |
michael@0 | 47 | pkix_List_Remove( |
michael@0 | 48 | PKIX_List *list, |
michael@0 | 49 | PKIX_PL_Object *target, |
michael@0 | 50 | void *plContext); |
michael@0 | 51 | |
michael@0 | 52 | PKIX_Error * |
michael@0 | 53 | pkix_List_MergeLists( |
michael@0 | 54 | PKIX_List *firstList, |
michael@0 | 55 | PKIX_List *secondList, |
michael@0 | 56 | PKIX_List **pMergedList, |
michael@0 | 57 | void *plContext); |
michael@0 | 58 | |
michael@0 | 59 | PKIX_Error * |
michael@0 | 60 | pkix_List_AppendList( |
michael@0 | 61 | PKIX_List *toList, |
michael@0 | 62 | PKIX_List *fromList, |
michael@0 | 63 | void *plContext); |
michael@0 | 64 | |
michael@0 | 65 | PKIX_Error * |
michael@0 | 66 | pkix_List_AppendUnique( |
michael@0 | 67 | PKIX_List *toList, |
michael@0 | 68 | PKIX_List *fromList, |
michael@0 | 69 | void *plContext); |
michael@0 | 70 | |
michael@0 | 71 | PKIX_Error * |
michael@0 | 72 | pkix_List_RemoveItems( |
michael@0 | 73 | PKIX_List *list, |
michael@0 | 74 | PKIX_List *deleteList, |
michael@0 | 75 | void *plContext); |
michael@0 | 76 | |
michael@0 | 77 | PKIX_Error * |
michael@0 | 78 | pkix_List_QuickSort( |
michael@0 | 79 | PKIX_List *fromList, |
michael@0 | 80 | PKIX_List_SortComparatorCallback comparator, |
michael@0 | 81 | PKIX_List **pSortedList, |
michael@0 | 82 | void *plContext); |
michael@0 | 83 | |
michael@0 | 84 | PKIX_Error * |
michael@0 | 85 | pkix_List_BubbleSort( |
michael@0 | 86 | PKIX_List *fromList, |
michael@0 | 87 | PKIX_List_SortComparatorCallback comparator, |
michael@0 | 88 | PKIX_List **pSortedList, |
michael@0 | 89 | void *plContext); |
michael@0 | 90 | |
michael@0 | 91 | #ifdef __cplusplus |
michael@0 | 92 | } |
michael@0 | 93 | #endif |
michael@0 | 94 | |
michael@0 | 95 | #endif /* _PKIX_LIST_H */ |