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
|
#include "internal.h"
#include <stdlib.h>
#include <string.h>
#include <assert.h>
void _bmItemListFreeList(struct _bmItemList *list)
{
assert(list);
if (list->list)
free(list->list);
list->allocated = list->count = 0;
list->list = NULL;
}
void _bmItemListFreeItems(struct _bmItemList *list)
{
assert(list);
unsigned int i;
for (i = 0; i < list->count; ++i)
bmItemFree(list->list[i]);
_bmItemListFreeList(list);
}
bmItem** _bmItemListGetItems(const struct _bmItemList *list, unsigned int *outNmemb)
{
assert(list);
if (outNmemb)
*outNmemb = list->count;
return list->list;
}
int _bmItemListSetItemsNoCopy(struct _bmItemList *list, bmItem **items, unsigned int nmemb)
{
assert(list);
_bmItemListFreeList(list);
if (!items || nmemb == 0) {
items = NULL;
nmemb = 0;
}
list->list = items;
list->allocated = list->count = nmemb;
return 1;
}
int _bmItemListSetItems(struct _bmItemList *list, const bmItem **items, unsigned int nmemb)
{
assert(list);
if (!items || nmemb == 0) {
_bmItemListFreeItems(list);
return 1;
}
bmItem **newItems;
if (!(newItems = calloc(sizeof(bmItem*), nmemb)))
return 0;
memcpy(newItems, items, sizeof(bmItem*) * nmemb);
return _bmItemListSetItemsNoCopy(list, newItems, nmemb);
}
int _bmItemListGrow(struct _bmItemList *list, unsigned int step)
{
assert(list);
void *tmp;
unsigned int nsize = sizeof(bmItem*) * (list->allocated + step);
if (!list->list || !(tmp = realloc(list->list, nsize))) {
if (!(tmp = malloc(nsize)))
return 0;
if (list->list) {
memcpy(tmp, list->list, sizeof(bmItem*) * list->allocated);
free(list->list);
}
}
list->list = tmp;
list->allocated += step;
memset(&list->list[list->count], 0, sizeof(bmItem*) * (list->allocated - list->count));
return 1;
}
int _bmItemListAddItemAt(struct _bmItemList *list, bmItem *item, unsigned int index)
{
assert(list);
assert(item);
if ((!list->list || list->allocated <= list->count) && !_bmItemListGrow(list, 32))
return 0;
if (index + 1 != list->count) {
unsigned int i = index;
memmove(&list->list[i + 1], &list->list[i], sizeof(bmItem*) * (list->count - i));
}
list->list[index] = item;
list->count++;
return 1;
}
int _bmItemListAddItem(struct _bmItemList *list, bmItem *item)
{
assert(list);
return _bmItemListAddItemAt(list, item, list->count);
}
int _bmItemListRemoveItemAt(struct _bmItemList *list, unsigned int index)
{
assert(list);
unsigned int i = index;
if (!list->list || list->count <= i)
return 0;
memmove(&list->list[i], &list->list[i], sizeof(bmItem*) * (list->count - i));
return 1;
}
int _bmItemListRemoveItem(struct _bmItemList *list, const bmItem *item)
{
unsigned int i;
for (i = 0; i < list->count && list->list[i] != item; ++i);
return _bmItemListRemoveItemAt(list, i);
}
/* vim: set ts=8 sw=4 tw=0 :*/
|
