127 lines
3.4 KiB
C
127 lines
3.4 KiB
C
/******************************************************************************
|
|
* Copyright (c) Huawei Technologies Co., Ltd. 2018-2019. All rights reserved.
|
|
* iSulad licensed under the Mulan PSL v1.
|
|
* You can use this software according to the terms and conditions of the Mulan PSL v1.
|
|
* You may obtain a copy of Mulan PSL v1 at:
|
|
* http://license.coscl.org.cn/MulanPSL
|
|
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY OR FIT FOR A PARTICULAR
|
|
* PURPOSE.
|
|
* See the Mulan PSL v1 for more details.
|
|
* Author: tanyifeng
|
|
* Create: 2018-11-1
|
|
* Description: provide container utils functions
|
|
*******************************************************************************/
|
|
|
|
#define _GNU_SOURCE
|
|
#include "utils_array.h"
|
|
|
|
#include "securec.h"
|
|
|
|
#include "log.h"
|
|
#include "utils.h"
|
|
|
|
size_t util_array_len(const char **array)
|
|
{
|
|
const char **pos;
|
|
size_t len = 0;
|
|
|
|
for (pos = array; pos != NULL && *pos != NULL; pos++) {
|
|
len++;
|
|
}
|
|
|
|
return len;
|
|
}
|
|
|
|
void util_free_array(char **array)
|
|
{
|
|
char **p;
|
|
|
|
for (p = array; p != NULL && *p != NULL; p++) {
|
|
UTIL_FREE_AND_SET_NULL(*p);
|
|
}
|
|
free(array);
|
|
}
|
|
|
|
int util_array_append(char ***array, const char *element)
|
|
{
|
|
size_t len;
|
|
char **new_array = NULL;
|
|
|
|
if (array == NULL || element == NULL) {
|
|
return -1;
|
|
}
|
|
|
|
// let new len to len + 2 for element and null
|
|
len = util_array_len((const char **)(*array));
|
|
|
|
if (len > SIZE_MAX / sizeof(char *) - 2) {
|
|
ERROR("Too many array elements!");
|
|
return -1;
|
|
}
|
|
new_array = util_common_calloc_s((len + 2) * sizeof(char *));
|
|
if (new_array == NULL) {
|
|
ERROR("Out of memory");
|
|
return -1;
|
|
}
|
|
if (*array != NULL) {
|
|
if (memcpy_s(new_array, (len + 2) * sizeof(char *),
|
|
*array, len * sizeof(char *)) != EOK) {
|
|
ERROR("Failed to memcpy memory");
|
|
free(new_array);
|
|
return -1;
|
|
}
|
|
UTIL_FREE_AND_SET_NULL(*array);
|
|
}
|
|
*array = new_array;
|
|
|
|
new_array[len] = util_strdup_s(element);
|
|
|
|
return 0;
|
|
}
|
|
|
|
int util_grow_array(char ***orig_array, size_t *orig_capacity, size_t size,
|
|
size_t increment)
|
|
{
|
|
size_t add_capacity;
|
|
char **add_array = NULL;
|
|
|
|
if (orig_array == NULL || orig_capacity == NULL || increment == 0) {
|
|
return -1;
|
|
}
|
|
|
|
if (((*orig_array) == NULL) || ((*orig_capacity) == 0)) {
|
|
UTIL_FREE_AND_SET_NULL(*orig_array);
|
|
*orig_capacity = 0;
|
|
}
|
|
|
|
add_capacity = *orig_capacity;
|
|
while (size + 1 > add_capacity) {
|
|
add_capacity += increment;
|
|
}
|
|
if (add_capacity != *orig_capacity) {
|
|
if (add_capacity > SIZE_MAX / sizeof(void *)) {
|
|
return -1;
|
|
}
|
|
add_array = util_common_calloc_s(add_capacity * sizeof(void *));
|
|
if (add_array == NULL) {
|
|
return -1;
|
|
}
|
|
if (*orig_array) {
|
|
if (memcpy_s(add_array, add_capacity * sizeof(void *),
|
|
*orig_array, *orig_capacity * sizeof(void *)) != EOK) {
|
|
ERROR("Failed to memcpy memory");
|
|
free(add_array);
|
|
return -1;
|
|
}
|
|
UTIL_FREE_AND_SET_NULL(*orig_array);
|
|
}
|
|
|
|
*orig_array = add_array;
|
|
*orig_capacity = add_capacity;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|