mirror of
https://github.com/AuxXxilium/kmod.git
synced 2024-12-27 13:55:35 +07:00
116 lines
2.9 KiB
C
116 lines
2.9 KiB
C
/*
|
|
* libkmod - interface to kernel module operations
|
|
*
|
|
* Copyright (C) 2011 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;
|
|
}
|