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
|
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 3 or later of the GNU General Public License as
* published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* list.c
*
* by Gary Wong, 1996
* $Id: list.c,v 1.12 2007/12/18 21:48:07 Superfly_Jon Exp $
*/
/* No configuration used in this file
#include "config.h" */
#include "list.h"
#include <stddef.h>
#include <stdlib.h>
int ListCreate( listOLD *pl ) {
pl->plPrev = pl->plNext = pl;
pl->p = NULL;
return 0;
}
listOLD *ListInsert( listOLD *pl, void *p ) {
listOLD *plNew;
if ( (plNew = (listOLD*)malloc( sizeof( *plNew ))) == NULL )
return NULL;
plNew->p = p;
plNew->plNext = pl;
plNew->plPrev = pl->plPrev;
pl->plPrev = plNew;
plNew->plPrev->plNext = plNew;
return plNew;
}
void ListDelete( listOLD *pl ) {
pl->plPrev->plNext = pl->plNext;
pl->plNext->plPrev = pl->plPrev;
free( pl );
}
void ListDeleteAll( const listOLD *pl ) {
while( pl->plNext->p )
{
free(pl->plNext->p);
ListDelete( pl->plNext );
}
}
|
