Update local copy of ust-abi.h to reflect addition of ns contexts
[lttng-tools.git] / src / common / dynamic-array.c
CommitLineData
2c5ff4e4
JG
1/*
2 * Copyright (C) 2019 - Jérémie Galarneau <jeremie.galarneau@efficios.com>
3 *
4 * This program is free software; you can redistribute it and/or modify it
5 * under the terms of the GNU Lesser General Public License, version 2.1 only,
6 * as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful, but WITHOUT
9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License
11 * for more details.
12 *
13 * You should have received a copy of the GNU Lesser General Public License
14 * along with this program; if not, write to the Free Software Foundation,
15 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
16 */
17
18#include <common/dynamic-array.h>
19
20LTTNG_HIDDEN
21void lttng_dynamic_array_init(struct lttng_dynamic_array *array,
93bed9fe
JG
22 size_t element_size,
23 lttng_dynamic_array_element_destructor destructor)
2c5ff4e4
JG
24{
25 lttng_dynamic_buffer_init(&array->buffer);
26 array->element_size = element_size;
93bed9fe
JG
27 array->size = 0;
28 array->destructor = destructor;
2c5ff4e4
JG
29}
30
31LTTNG_HIDDEN
32int lttng_dynamic_array_add_element(struct lttng_dynamic_array *array,
33 const void *element)
34{
35 int ret;
36
37 if (!array || !element) {
38 ret = -1;
39 goto end;
40 }
41
42 ret = lttng_dynamic_buffer_append(&array->buffer, element,
43 array->element_size);
44 if (ret) {
45 goto end;
46 }
47 array->size++;
48end:
49 return ret;
50}
51
52LTTNG_HIDDEN
93bed9fe
JG
53int lttng_dynamic_array_remove_element(struct lttng_dynamic_array *array,
54 size_t element_index)
2c5ff4e4 55{
93bed9fe
JG
56 void *element = lttng_dynamic_array_get_element(array,
57 element_index);
58
59 if (array->destructor) {
60 array->destructor(element);
61 }
62 if (element_index != lttng_dynamic_array_get_count(array) - 1) {
63 void *next_element = lttng_dynamic_array_get_element(array,
64 element_index + 1);
65
66 memmove(element, next_element,
67 (array->size - element_index - 1) * array->element_size);
68 }
69 array->size--;
70 return lttng_dynamic_buffer_set_size(&array->buffer,
71 array->buffer.size - array->element_size);
72}
73
74LTTNG_HIDDEN
75void lttng_dynamic_array_reset(struct lttng_dynamic_array *array)
76{
77 if (array->destructor) {
2c5ff4e4
JG
78 size_t i;
79
80 for (i = 0; i < lttng_dynamic_array_get_count(array); i++) {
93bed9fe
JG
81 array->destructor(lttng_dynamic_array_get_element(array,
82 i));
2c5ff4e4
JG
83 }
84 }
85
86 lttng_dynamic_buffer_reset(&array->buffer);
87 array->size = 0;
88}
89
90LTTNG_HIDDEN
91void lttng_dynamic_pointer_array_init(
93bed9fe
JG
92 struct lttng_dynamic_pointer_array *array,
93 lttng_dynamic_pointer_array_destructor destructor)
2c5ff4e4 94{
93bed9fe 95 lttng_dynamic_array_init(&array->array, sizeof(void *), destructor);
2c5ff4e4
JG
96}
97
98/* Release any memory used by the dynamic array. */
99LTTNG_HIDDEN
100void lttng_dynamic_pointer_array_reset(
93bed9fe 101 struct lttng_dynamic_pointer_array *array)
2c5ff4e4 102{
93bed9fe 103 if (array->array.destructor) {
2c5ff4e4
JG
104 size_t i, count = lttng_dynamic_pointer_array_get_count(array);
105
106 for (i = 0; i < count; i++) {
107 void *ptr = lttng_dynamic_pointer_array_get_pointer(
108 array, i);
93bed9fe 109 array->array.destructor(ptr);
2c5ff4e4 110 }
93bed9fe 111 array->array.destructor = NULL;
2c5ff4e4 112 }
93bed9fe 113 lttng_dynamic_array_reset(&array->array);
2c5ff4e4 114}
This page took 0.033341 seconds and 5 git commands to generate.