forked from libretro/RetroArch
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmylist.c
168 lines (136 loc) · 3.2 KB
/
mylist.c
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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
#include <stdlib.h>
#include <string.h>
#include "mylist.h"
#include "mem_util.h"
void mylist_resize(MyList *list, int new_size, bool run_constructor)
{
int new_capacity;
int old_size;
int i;
void *element = NULL;
if (new_size < 0)
new_size = 0;
if (!list)
return;
new_capacity = new_size;
old_size = list->size;
if (new_size == old_size)
return;
if (new_size > list->capacity)
{
if (new_capacity < list->capacity * 2)
new_capacity = list->capacity * 2;
/* try to realloc */
list->data = (void**)realloc(
(void*)list->data, new_capacity * sizeof(void*));
for (i = list->capacity; i < new_capacity; i++)
list->data[i] = NULL;
list->capacity = new_capacity;
}
if (new_size <= list->size)
{
for (i = new_size; i < list->size; i++)
{
element = list->data[i];
if (element)
{
list->destructor(element);
list->data[i] = NULL;
}
}
}
else
{
for (i = list->size; i < new_size; i++)
{
if (run_constructor)
list->data[i] = list->constructor();
else
list->data[i] = NULL;
}
}
list->size = new_size;
}
void *mylist_add_element(MyList *list)
{
int old_size;
if (!list)
return NULL;
old_size = list->size;
mylist_resize(list, old_size + 1, true);
return list->data[old_size];
}
void mylist_create(MyList **list_p, int initial_capacity,
constructor_t constructor, destructor_t destructor)
{
MyList *list = NULL;
if (!list_p)
return;
if (initial_capacity < 0)
initial_capacity = 0;
list = *list_p;
if (list)
mylist_destroy(list_p);
list = (MyList*)malloc(sizeof(MyList));
*list_p = list;
list->size = 0;
list->constructor = constructor;
list->destructor = destructor;
if (initial_capacity > 0)
{
list->data = (void**)calloc(initial_capacity, sizeof(void*));
list->capacity = initial_capacity;
}
else
{
list->data = NULL;
list->capacity = 0;
}
}
void mylist_destroy(MyList **list_p)
{
MyList *list = NULL;
if (!list_p)
return;
list = *list_p;
if (list)
{
mylist_resize(list, 0, false);
free(list->data);
free(list);
*list_p = NULL;
}
}
void mylist_assign(MyList *list, int index, void *value)
{
void *old_element = NULL;
if (index < 0 || index >= list->size)
return;
old_element = list->data[index];
list->destructor(old_element);
list->data[index] = value;
}
void mylist_remove_at(MyList *list, int index)
{
int i;
if (index < 0 || index >= list->size)
return;
mylist_assign(list, index, NULL);
for (i = index + 1; i < list->size; i++)
list->data[i - 1] = list->data[i];
list->size--;
list->data[list->size] = NULL;
}
void mylist_pop_front(MyList *list)
{
mylist_remove_at(list, 0);
}
void mylist_push_back(MyList *list, void *value)
{
int old_size;
if (!list)
return;
old_size = list->size;
mylist_resize(list, old_size + 1, false);
list->data[old_size] = value;
}