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
|
#include "lst.h"
/*********************
* lstClose
*
* Call for Cursor or root list.
*********************/
int lstClose( HLST hLst )
{
HLSTITEM hItem;
if ( !hLst )
return LST_ERROR;
hLst->nRefs--;
/*********************
* We will not really remove the list if we have
* refs to it... we will just decrement ref.
* We will be deleted when the last ref is being removed.
*********************/
if ( hLst->nRefs > 0 )
return LST_SUCCESS;
/************************
* DELETE ITEMS (and their refs)
* - do not use standard nav funcs because they will skip items where bDelete
************************/
hItem = hLst->hFirst;
while ( hItem )
{
_lstFreeItem( hItem );
hItem = hLst->hFirst;
}
/************************
* RECURSE AS REQUIRED. RECURSION WILL STOP AS SOON AS WE GET TO A LIST WHICH
* DOES NOT NEED TO BE DELETED YET (refs >= 0).
************************/
if ( hLst->hLstBase ) /* we are a cursor */
lstClose( hLst->hLstBase ); /* dec ref count and close if < 0 */
/************************
* FREE LIST HANDLE
************************/
free( hLst );
return LST_SUCCESS;
}
|
