2 * This file is part of ltrace.
3 * Copyright (C) 2011,2012,2013 Petr Machata, Red Hat Inc.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation; either version 2 of the
8 * License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
27 slot(struct vect *vec, size_t i)
29 return ((unsigned char *)vec->data) + vec->elt_size * i;
33 cslot(const struct vect *vec, size_t i)
35 return ((const unsigned char *)vec->data) + vec->elt_size * i;
39 vect_init(struct vect *vec, size_t elt_size)
41 *vec = (struct vect){ NULL, 0, 0, elt_size };
45 copy_elt(void *tgt, const void *src, void *data)
47 struct vect *target = data;
48 memcpy(tgt, src, target->elt_size);
53 vect_clone(struct vect *target, const struct vect *source,
54 int (*clone)(void *tgt, const void *src, void *data),
55 void (*dtor)(void *elt, void *data),
58 vect_init(target, source->elt_size);
59 if (vect_reserve(target, source->size) < 0)
71 for (i = 0; i < source->size; ++i)
72 if (clone(slot(target, i), cslot(source, i), data) < 0)
75 target->size = source->size;
79 /* N.B. destroy the elements in opposite order. */
82 dtor(slot(target, i), data);
83 vect_destroy(target, NULL, NULL);
88 vect_reserve(struct vect *vec, size_t count)
90 if (count > vec->allocated) {
91 size_t na = vec->allocated != 0 ? 2 * vec->allocated : 4;
94 void *n = realloc(vec->data, na * vec->elt_size);
100 assert(count <= vec->allocated);
105 vect_size(const struct vect *vec)
111 vect_empty(const struct vect *vec)
113 return vec->size == 0;
117 vect_reserve_additional(struct vect *vec, size_t count)
119 return vect_reserve(vec, vect_size(vec) + count);
123 vect_pushback(struct vect *vec, void *eltp)
125 if (vect_reserve_additional(vec, 1) < 0)
127 memcpy(slot(vec, vec->size++), eltp, vec->elt_size);
132 vect_erase(struct vect *vec, size_t start, size_t end,
133 void (*dtor)(void *emt, void *data), void *data)
135 assert(start < vect_size(vec) || start == 0);
136 assert(end <= vect_size(vec));
138 /* First, destroy the elements that are to be erased. */
141 for (i = start; i < end; ++i)
142 dtor(slot(vec, i), data);
145 /* Now move the tail forward and adjust size. */
146 memmove(slot(vec, start), slot(vec, end),
147 slot(vec, vec->size) - slot(vec, end));
148 vec->size -= end - start;
152 vect_popback(struct vect *vec,
153 void (*dtor)(void *emt, void *data), void *data)
155 assert(vect_size(vec) > 0);
156 vect_erase(vec, vect_size(vec)-1, vect_size(vec), dtor, data);
160 vect_destroy(struct vect *vec, void (*dtor)(void *emt, void *data), void *data)
165 vect_erase(vec, 0, vect_size(vec), dtor, data);
166 assert(vect_size(vec) == 0);
171 vect_each(struct vect *vec, void *start_after,
172 enum callback_status (*cb)(void *, void *), void *data)
174 size_t i = start_after == NULL ? 0
175 : ((start_after - vec->data) / vec->elt_size) + 1;
177 for (; i < vec->size; ++i) {
178 void *slt = slot(vec, i);
179 switch ((*cb)(slt, data)) {
193 vect_qsort(struct vect *vec, int (*compar)(const void *, const void *))
195 qsort(vec->data, vec->size, vec->elt_size, compar);
199 vect_each_cst(const struct vect *vec, const void *start_after,
200 enum callback_status (*cb)(const void *, void *), void *data)
202 return vect_each((struct vect *)vec, (void *)start_after,
207 vect_dtor_string(char **key, void *data)