1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
#include "lst.h"
int lstInsert( HLST hLst, void *pData )
{
HLSTITEM hItem;
if ( !hLst )
return LST_ERROR;
if ( !hLst->hCurrent )
return lstAppend( hLst, pData );
/**********************
* CREATE AN ITEM
**********************/
hItem = malloc( sizeof(LSTITEM) );
if ( !hItem )
return LST_ERROR;
hItem->bDelete = false;
hItem->bHide = false;
hItem->hLst = hLst;
hItem->nRefs = 0;
hItem->pData = NULL;
hItem->pNext = NULL;
hItem->pPrev = NULL;
if ( hLst->hLstBase )
{
/**********************
* WE ARE A CURSOR LIST SO...
* 1. ADD TO BASE LIST
* 2. inc BASE LIST ITEM REF COUNT
* 3. ADD TO THIS LIST (ref to base list)
**********************/
lstInsert( hLst->hLstBase, pData ); /* !!! INSERT POS IN BASE LIST IS UNPREDICTABLE !!! */
/* BECAUSE hCurrent MAY HAVE CHANGED AND WE */
/* ARE NOT TRYING TO PUT IT BACK */
hItem->pData = hLst->hLstBase->hCurrent;
hLst->hLstBase->hCurrent->nRefs++;
_lstInsert( hLst, hItem );
}
else
{
/**********************
* WE ARE THE ROOT SO...
* 1. ADD TO THIS LIST
**********************/
hItem->pData = pData;
_lstInsert( hLst, hItem );
}
return LST_SUCCESS;
}
/*************************
* SIMPLY CONNECTS THE LINKS/POINTERS AND SETS CURRENT
*************************/
int _lstInsert( HLST hLst, HLSTITEM hItem )
{
if ( !hLst->hCurrent )
return _lstAppend( hLst, hItem );
hItem->pPrev = hLst->hCurrent->pPrev;
hItem->pNext = hLst->hCurrent;
if ( hLst->hCurrent->pPrev )
hLst->hCurrent->pPrev->pNext = hItem;
hLst->hCurrent->pPrev = hItem;
if ( hLst->hCurrent == hLst->hFirst )
hLst->hFirst = hItem;
hLst->hCurrent = hItem;
hLst->nItems++;
return LST_SUCCESS;
}
|
