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
|
/*
* libkmod - interface to kernel module operations
*
* Copyright (C) 2011-2013 ProFUSION embedded systems
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "libkmod.h"
#include "libkmod-array.h"
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
/* basic pointer array growing in steps */
void array_init(struct array *array, size_t step)
{
assert(step > 0);
array->array = NULL;
array->count = 0;
array->total = 0;
array->step = step;
}
int array_append(struct array *array, const void *element)
{
size_t idx;
if (array->count + 1 >= array->total) {
size_t new_total = array->total + array->step;
void *tmp = realloc(array->array, sizeof(void *) * new_total);
assert(array->step > 0);
if (tmp == NULL)
return -ENOMEM;
array->array = tmp;
array->total = new_total;
}
idx = array->count;
array->array[idx] = (void *)element;
array->count++;
return idx;
}
int array_append_unique(struct array *array, const void *element)
{
void **itr = array->array;
void **itr_end = itr + array->count;
for (; itr < itr_end; itr++)
if (*itr == element)
return -EEXIST;
return array_append(array, element);
}
void array_pop(struct array *array) {
array->count--;
if (array->count + array->step < array->total) {
size_t new_total = array->total - array->step;
void *tmp = realloc(array->array, sizeof(void *) * new_total);
assert(array->step > 0);
if (tmp == NULL)
return;
array->array = tmp;
array->total = new_total;
}
}
void array_free_array(struct array *array) {
free(array->array);
array->count = 0;
array->total = 0;
}
void array_sort(struct array *array, int (*cmp)(const void *a, const void *b))
{
qsort(array->array, array->count, sizeof(void *), cmp);
}
int array_remove_at(struct array *array, unsigned int pos)
{
if (array->count <= pos)
return -ENOENT;
array->count--;
if (pos < array->count)
memmove(array->array + pos, array->array + pos + 1,
sizeof(void *) * (array->count - pos));
if (array->count + array->step < array->total) {
size_t new_total = array->total - array->step;
void *tmp = realloc(array->array, sizeof(void *) * new_total);
assert(array->step > 0);
if (tmp == NULL)
return 0;
array->array = tmp;
array->total = new_total;
}
return 0;
}
|
