1/*
2 * Legal Notice
3 *
4 * This document and associated source code (the "Work") is a part of a
5 * benchmark specification maintained by the TPC.
6 *
7 * The TPC reserves all right, title, and interest to the Work as provided
8 * under U.S. and international laws, including without limitation all patent
9 * and trademark rights therein.
10 *
11 * No Warranty
12 *
13 * 1.1 TO THE MAXIMUM EXTENT PERMITTED BY APPLICABLE LAW, THE INFORMATION
14 * CONTAINED HEREIN IS PROVIDED "AS IS" AND WITH ALL FAULTS, AND THE
15 * AUTHORS AND DEVELOPERS OF THE WORK HEREBY DISCLAIM ALL OTHER
16 * WARRANTIES AND CONDITIONS, EITHER EXPRESS, IMPLIED OR STATUTORY,
17 * INCLUDING, BUT NOT LIMITED TO, ANY (IF ANY) IMPLIED WARRANTIES,
18 * DUTIES OR CONDITIONS OF MERCHANTABILITY, OF FITNESS FOR A PARTICULAR
19 * PURPOSE, OF ACCURACY OR COMPLETENESS OF RESPONSES, OF RESULTS, OF
20 * WORKMANLIKE EFFORT, OF LACK OF VIRUSES, AND OF LACK OF NEGLIGENCE.
21 * ALSO, THERE IS NO WARRANTY OR CONDITION OF TITLE, QUIET ENJOYMENT,
22 * QUIET POSSESSION, CORRESPONDENCE TO DESCRIPTION OR NON-INFRINGEMENT
23 * WITH REGARD TO THE WORK.
24 * 1.2 IN NO EVENT WILL ANY AUTHOR OR DEVELOPER OF THE WORK BE LIABLE TO
25 * ANY OTHER PARTY FOR ANY DAMAGES, INCLUDING BUT NOT LIMITED TO THE
26 * COST OF PROCURING SUBSTITUTE GOODS OR SERVICES, LOST PROFITS, LOSS
27 * OF USE, LOSS OF DATA, OR ANY INCIDENTAL, CONSEQUENTIAL, DIRECT,
28 * INDIRECT, OR SPECIAL DAMAGES WHETHER UNDER CONTRACT, TORT, WARRANTY,
29 * OR OTHERWISE, ARISING IN ANY WAY OUT OF THIS OR ANY OTHER AGREEMENT
30 * RELATING TO THE WORK, WHETHER OR NOT SUCH AUTHOR OR DEVELOPER HAD
31 * ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES.
32 *
33 * Contributors:
34 * Gradient Systems
35 */
36#ifndef LIST_H
37#define LIST_H
38typedef struct LIST_NODE_T {
39 struct LIST_NODE_T *pNext;
40 struct LIST_NODE_T *pPrev;
41 void *pData;
42} node_t;
43
44typedef struct LIST_T {
45 struct LIST_NODE_T *head;
46 struct LIST_NODE_T *tail;
47 struct LIST_NODE_T *pCurrent;
48 int (*pSortFunc)(const void *pD1, const void *pD2);
49 int nMembers;
50 int nFlags;
51} list_t;
52
53/* list_t flags */
54#define L_FL_HEAD 0x01 /* add at head */
55#define L_FL_TAIL 0x02 /* add at tail */
56#define L_FL_SORT 0x04 /* create sorted list */
57
58#define length(list) list->nMembers
59
60list_t *makeList(int nFlags, int (*pSortFunc)(const void *pD1, const void *pD2));
61list_t *addList(list_t *pList, void *pData);
62void *findList(list_t *pList, void *pData);
63void *removeItem(list_t *pList, int bFromHead);
64void *getHead(list_t *pList);
65void *getTail(list_t *pList);
66void *getNext(list_t *pList);
67void *getItem(list_t *pList, int nIndex);
68#endif
69