Home Verkennen Help
Registreren Inloggen
phyus
/
uboot-vybrid_public
8
0
Vork 0
Bestanden Issues 0 Pull-aanvragen 0 Wiki
Boom: 72f56adc0b
Aftakkingen Labels
uboot-vybrid_pu...
/
include
/
lists.h

lists.h 4.0 KB
Geschiedenis Ruwe

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677 
  1. #ifndef _LISTS_H_
    2. 

  2. #define _LISTS_H_
    3. 

  3. 

  4. #define LIST_START    	-1      /* Handy Constants that substitute for item positions */
    5. 

  5. #define LIST_END      	0       /* END_OF_LIST means one past current length of list when */
    6. 

  6. 				/* inserting. Otherwise it refers the last item in the list. */
    7. 

  7. 

  8. typedef struct
    9. 

  9.     {
    10. 

  10.     void            *ptr;
    11. 

  11.     unsigned int    size;
    12. 

  12.     } HandleRecord;
    13. 

  13. 

  14. typedef void **Handle;
    15. 

  15. 

  16. typedef int (*CompareFunction)(void *data1, void *data2) ;
    17. 

  17. 

  18. typedef struct ListStructTag
    19. 

  19.     {
    20. 

  20.     int signature;              /* debugging aid */
    21. 

  21.     int percentIncrease;        /* %of current size to increase by when list is out of space */
    22. 

  22.     int minNumItemsIncrease;    /* fixed number of items to increase by when list is out of space */
    23. 

  23.     int listSize;               /* number of items than can fit in the currently allocated memory */
    24. 

  24.     int itemSize;               /* the size of each item in the list (same for every item) */
    25. 

  25.     int numItems;               /* number of items currently in the list */
    26. 

  26.     unsigned char itemList[1];  /* resizable array of list elements */
    27. 

  27.     } ListStruct;
    28. 

  28. 

  29. typedef struct ListStructTag **list_t;        /* The list abstract data type */
    30. 

  30. typedef int ( * ListApplicationFunc)(int index, void *ptrToItem, void *callbackData);
    31. 

  31. 

  32. /* Basic List Operations */
    33. 

  33. list_t	ListCreate(int elementSize);
    34. 

  34. int     ListNumItems(list_t list);
    35. 

  35. int     ListInsertItem(list_t list, void *ptrToItem, int itemPosition);
    36. 

  36. int     ListInsertItems(list_t list, void *ptrToItems, int firstItemPosition, int numItemsToInsert);
    37. 

  37. void    ListDispose(list_t list);
    38. 

  38. void    *ListGetPtrToItem(list_t list, int itemPosition);
    39. 

  39. void    ListRemoveItem(list_t list, void *itemDestination, int itemPosition);
    40. 

  40. void    ListRemoveItems(list_t list, void *itemsDestination, int firstItemPosition, int numItemsToRemove);
    41. 

  41. 

  42. #if 0	/* rarely ever used; kept here for reference just in case ... */
    43. 

  43. void    ListDisposePtrList(list_t list);
    44. 

  44. void    ListGetItem(list_t list, void *itemDestination, int itemPosition);
    45. 

  45. void    ListReplaceItem(list_t list, void *ptrToItem, int itemPosition);
    46. 

  46. void    ListRemoveItem(list_t list, void *itemDestination, int itemPosition);
    47. 

  47. void    ListGetItems(list_t list, void *itemsDestination, int firstItemPosition, int numItemsToGet);
    48. 

  48. void    ListReplaceItems(list_t list, void *ptrToItems, int firstItemPosition, int numItemsToReplace);
    49. 

  49. void    ListRemoveItems(list_t list, void *itemsDestination, int firstItemPosition, int numItemsToRemove);
    50. 

  50. list_t  ListCopy(list_t originalList);
    51. 

  51. int     ListAppend(list_t list1, list_t list2);
    52. 

  52. void    ListClear(list_t list);
    53. 

  53. int     ListEqual(list_t list1, list_t list2);
    54. 

  54. int     ListInsertInOrder(list_t list, void *ptrToItem, CompareFunction compareFunction);
    55. 

  55. void    *ListGetDataPtr(list_t list);
    56. 

  56. int     ListApplyToEach(list_t list, int ascending, ListApplicationFunc funcToApply, void *callbackData);
    57. 

  57. 

  58. /* List Searching and Sorting */
    59. 

  59. int     ListFindItem(list_t list, void *ptrToItem, int startingPosition, CompareFunction compareFunction);
    60. 

  60. void    ListRemoveDuplicates(list_t list, CompareFunction compareFunction);
    61. 

  61. int     ListBinSearch(list_t list, void *itemPtr, CompareFunction compareFunction);
    62. 

  62. void    ListQuickSort(list_t list, CompareFunction compareFunction);
    63. 

  63. void    ListHeapSort(list_t list, CompareFunction compareFunction);
    64. 

  64. void    ListInsertionSort(list_t list, CompareFunction compareFunction);
    65. 

  65. int     ListIsSorted(list_t list, CompareFunction compareFunction);
    66. 

  66. 

  67. /*  Advanced List Functions */
    68. 

  68. void	ListSetAllocationPolicy(list_t list, int minItemsPerAlloc, int percentIncreasePerAlloc);
    69. 

  69. void    ListCompact(list_t list);
    70. 

  70. int     ListPreAllocate(list_t list, int numItems);
    71. 

  71. int     ListGetItemSize(list_t list);
    72. 

  72. int     GetIntListFromParmInfo(va_list parmInfo, int numIntegers, list_t *integerList);
    73. 

  73. int     ListInsertAfterItem(list_t list, void *ptrToItem, void *ptrToItemToInsertAfter, CompareFunction compareFunction);
    74. 

  74. int     ListInsertBeforeItem(list_t list, void *ptrToItem, void *ptrToItemToInsertBefore, CompareFunction compareFunction);
    75. 

  75. #endif /* 0 */
    76. 

  76. 

  77. #endif	/* _LISTS_H_ */
    78.