blob: 05616cf11a9c24b4651a263da26890aaa2599016 (
plain)
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
|
/** BEGIN COPYRIGHT BLOCK
* Copyright 2001 Sun Microsystems, Inc.
* Portions copyright 1999, 2001-2003 Netscape Communications Corporation.
* All rights reserved.
* END COPYRIGHT BLOCK **/
#include "repl_helper.h"
ReplGenericList *
ReplGenericListNew(void)
{
ReplGenericList *list=NULL;
if(NULL == (list = (ReplGenericList *)
slapi_ch_calloc(1,sizeof(ReplGenericList)))) {
return(NULL);
}
list->object = NULL;
list->next = NULL;
list->prev = NULL;
return(list);
}
void
ReplGenericListAddObject(ReplGenericList *list,
void *newObject)
{
if(list) {
ReplGenericList *new_struct = (ReplGenericList *)
slapi_ch_calloc(1, sizeof(ReplGenericList));
if (!new_struct)
return;
/* set back pointer of old first element */
if(list->next) {
list->next->prev = new_struct;
}
/* we might have a next but since we are the first we WONT have
a previous */
new_struct->object = newObject;
new_struct->next = list->next;
new_struct->prev = NULL;
/* the new element is the first one */
list->next = new_struct;
/* if this is the only element it is the end too */
if(NULL == list->prev)
list->prev = new_struct;
}
return;
}
ReplGenericList *
ReplGenericListFindObject(ReplGenericList *list,
void *object)
{
if(!list)
return(NULL);
list = list->next; /* the first list item never has data */
while (list) {
if(list->object == object)
return(list);
list = list->next;
}
return(NULL);
}
void
ReplGenericListDestroy(ReplGenericList *list,
ReplGenericListObjectDestroyFn destroyFn)
{
ReplGenericList *list_ptr;
while (list) {
list_ptr = list;
list = list->next;
if(destroyFn && list_ptr->object) {
(destroyFn)(list_ptr->object);
}
slapi_ch_free((void **)(&list_ptr));
}
return;
}
|
