/usr/include/fcitx-utils/utarray.h is in fcitx-libs-dev 1:4.2.9.1-1ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 | /*
Copyright (c) 2008-2010, Troy D. Hanson http://uthash.sourceforge.net
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/* a dynamic array implementation using macros
* see http://uthash.sourceforge.net/utarray
*/
#ifndef UTARRAY_H
#define UTARRAY_H
#define UTARRAY_VERSION 1.9
#ifdef __GNUC__
#define _UNUSED_ __attribute__ ((__unused__))
#else
#define _UNUSED_
#endif
#include <stddef.h> /* size_t */
#include <string.h> /* memset, etc */
#include <stdlib.h> /* exit */
#define oom() exit(-1)
typedef void (ctor_f)(void *dst, const void *src);
typedef void (dtor_f)(void *elt);
typedef void (init_f)(void *elt);
typedef struct {
size_t sz;
init_f *init;
ctor_f *copy;
dtor_f *dtor;
} UT_icd;
typedef struct {
unsigned i, n; /* i: index of next available slot, n: num slots */
const UT_icd *icd; /* initializer, copy and destructor functions */
char *d; /* n slots of size icd->sz*/
} UT_array;
#define utarray_init(a, _icd) do { \
memset(a, 0, sizeof(UT_array)); \
(a)->icd = _icd; \
} while(0)
#define utarray_done(a) do { \
if ((a)->n) { \
if ((a)->icd->dtor) { \
size_t _ut_i; \
for(_ut_i = 0;_ut_i < (a)->i;_ut_i++) { \
(a)->icd->dtor(utarray_eltptr(a, _ut_i)); \
} \
} \
free((a)->d); \
} \
(a)->n = 0; \
} while(0)
#define utarray_steal(a, p) do { \
if (!(a)->n) { \
p = NULL; \
break; \
} \
p = (a)->d; \
(a)->d = NULL; \
(a)->n = (a)->i = 0; \
} while(0)
#define utarray_new(a, _icd) do { \
a = (UT_array*)malloc(sizeof(UT_array)); \
utarray_init(a, _icd); \
} while(0)
#define utarray_free(a) do { \
utarray_done(a); \
free(a); \
} while(0)
#define utarray_reserve(a, by) do { \
if (((a)->i + by) > ((a)->n)) { \
while(((a)->i + by) > ((a)->n)) { \
(a)->n = ((a)->n ? (2 * (a)->n) : 8); \
} \
if (!((a)->d = (char*)realloc((a)->d, (a)->n * (a)->icd->sz))) { \
oom(); \
} \
} \
} while(0)
#define utarray_push_back(a, p) do { \
utarray_reserve(a, 1); \
if ((a)->icd->copy) { \
(a)->icd->copy(_utarray_eltptr(a, (a)->i++), p); \
} else { \
memcpy(_utarray_eltptr(a, (a)->i++), p, (a)->icd->sz); \
}; \
} while(0)
#define utarray_pop_back(a) do { \
if ((a)->icd->dtor) { \
(a)->icd->dtor(_utarray_eltptr(a, --((a)->i))); \
} else { \
(a)->i--; \
} \
} while(0)
#define utarray_extend_back(a) do { \
utarray_reserve(a, 1); \
if ((a)->icd->init) { \
(a)->icd->init(_utarray_eltptr(a, (a)->i)); \
} else { \
memset(_utarray_eltptr(a, (a)->i), 0, (a)->icd->sz); \
} \
(a)->i++; \
} while(0)
#define utarray_len(a) ((a)->i)
#define utarray_eltptr(a, j) (((j) < (a)->i) ? _utarray_eltptr(a, j) : NULL)
#define _utarray_eltptr(a, j) ((char*)((a)->d + ((a)->icd->sz * (j))))
#define utarray_push_front(a, p) do { \
utarray_reserve(a, 1); \
if (0 < (a)->i) { \
memmove(_utarray_eltptr(a, 1), _utarray_eltptr(a, 0), \
((a)->i) * ((a)->icd->sz)); \
} \
if ((a)->icd->copy) { \
(a)->icd->copy(_utarray_eltptr(a, 0), p); \
} else { \
memcpy(_utarray_eltptr(a, 0), p, (a)->icd->sz); \
}; \
(a)->i++; \
} while(0)
#define utarray_insert(a, p, j) do { \
utarray_reserve(a, 1); \
if (j > (a)->i) \
break; \
if ((j) < (a)->i) { \
memmove(_utarray_eltptr(a, (j) + 1), _utarray_eltptr(a, j), \
((a)->i - (j)) * ((a)->icd->sz)); \
} \
if ((a)->icd->copy) { \
(a)->icd->copy(_utarray_eltptr(a, j), p); \
} else { \
memcpy(_utarray_eltptr(a, j), p, (a)->icd->sz); \
}; \
(a)->i++; \
} while(0)
#define utarray_move(a, f, t) do { \
if (f >= (a)->i) \
break; \
if (t >= (a)->i) \
break; \
if (f == t) \
break; \
void *_temp = malloc((a)->icd->sz); \
if (f > t) { \
memcpy(_temp, _utarray_eltptr(a, f), (a)->icd->sz); \
memmove(_utarray_eltptr(a, t + 1), _utarray_eltptr(a, t), \
(a)->icd->sz * (f - (t))); \
memcpy(_utarray_eltptr(a, t), _temp, (a)->icd->sz); \
} else { \
memcpy(_temp, _utarray_eltptr(a, f), (a)->icd->sz); \
memmove(_utarray_eltptr(a, f), _utarray_eltptr(a, f + 1), \
(a)->icd->sz * (t - (f))); \
memcpy(_utarray_eltptr(a, t), _temp, (a)->icd->sz); \
} \
free(_temp); \
} while(0)
#define utarray_inserta(a, w, j) do { \
if (utarray_len(w) == 0) \
break; \
if (j > (a)->i) \
break; \
utarray_reserve(a, utarray_len(w)); \
if ((j) < (a)->i) { \
memmove(_utarray_eltptr(a, (j) + utarray_len(w)), \
_utarray_eltptr(a, j), \
((a)->i - (j)) * ((a)->icd->sz)); \
} \
if ((a)->icd->copy) { \
size_t _ut_i; \
for(_ut_i = 0;_ut_i < (w)->i;_ut_i++) { \
(a)->icd->copy(_utarray_eltptr(a, j + _ut_i), \
_utarray_eltptr(w, _ut_i)); \
} \
} else { \
memcpy(_utarray_eltptr(a, j), _utarray_eltptr(w, 0), \
utarray_len(w) * ((a)->icd->sz)); \
} \
(a)->i += utarray_len(w); \
} while(0)
#define utarray_resize(dst, num) do { \
size_t _ut_i; \
if ((dst)->i > (size_t)(num)) { \
if ((dst)->icd->dtor) { \
for (_ut_i = num;_ut_i < (dst)->i;_ut_i++) { \
(dst)->icd->dtor(utarray_eltptr(dst, _ut_i)); \
} \
} \
} else if ((dst)->i < (size_t)(num)) { \
utarray_reserve(dst, num - (dst)->i); \
if ((dst)->icd->init) { \
for (_ut_i = (dst)->i;_ut_i < num;_ut_i++) { \
(dst)->icd->init(utarray_eltptr(dst, _ut_i)); \
} \
} else { \
memset(_utarray_eltptr(dst, (dst)->i), 0, \
(dst)->icd->sz * (num - (dst)->i)); \
} \
} \
(dst)->i = num; \
} while(0)
#define utarray_concat(dst, src) do { \
utarray_inserta(dst, src, utarray_len(dst)); \
} while(0)
#define utarray_erase(a, pos, len) do { \
if ((a)->icd->dtor) { \
size_t _ut_i; \
for(_ut_i = 0;_ut_i < len;_ut_i++) { \
(a)->icd->dtor(utarray_eltptr(a, pos + _ut_i)); \
} \
} \
if ((a)->i > (pos + len)) { \
memmove(_utarray_eltptr(a, pos), _utarray_eltptr(a, pos + len), \
(((a)->i) - (pos + len)) * ((a)->icd->sz)); \
} \
(a)->i -= (len); \
} while(0)
/**
* this actually steal the content away, doesn't destroy the content
* so the name doesn't actually accurate, use it carefully.
*/
#define utarray_remove_quick(a, pos) do { \
if ((a)->i - 1 != (pos)) \
memcpy(_utarray_eltptr(a, pos), _utarray_eltptr(a, (a)->i - 1), \
(a)->icd->sz); \
(a)->i--; \
} while(0)
/**
* this is the "real" remove_quick with destroy,
*/
#define utarray_remove_quick_full(a, pos) do { \
if ((a)->icd->dtor) { \
(a)->icd->dtor(utarray_eltptr(a, pos)); \
} \
if ((a)->i - 1 != (pos)) \
memcpy(_utarray_eltptr(a, pos), _utarray_eltptr(a, (a)->i - 1), \
(a)->icd->sz); \
(a)->i--; \
} while(0)
#define utarray_clear(a) do { \
if ((a)->i > 0) { \
if ((a)->icd->dtor) { \
size_t _ut_i; \
for(_ut_i = 0;_ut_i < (a)->i;_ut_i++) { \
(a)->icd->dtor(utarray_eltptr(a, _ut_i)); \
} \
} \
(a)->i = 0; \
} \
} while(0)
#define utarray_sort(a, cmp) do { \
qsort((a)->d, (a)->i, (a)->icd->sz, cmp); \
} while(0)
#define utarray_sort_range(a, cmp, from, to) do { \
if ((from) >= (to) || (from) >= (a)->i || (to) > (a)->i) \
break; \
qsort(_utarray_eltptr(a, from), (to) - (from), (a)->icd->sz, cmp); \
} while(0)
void fcitx_qsort_r(void *base_, size_t nmemb, size_t size,
int (*compar)(const void *, const void *, void *),
void *thunk);
void fcitx_msort_r(void *base_, size_t nmemb, size_t size,
int (*compar)(const void *, const void *, void *),
void *thunk);
#define utarray_sort_r(a, cmp, arg) do { \
fcitx_qsort_r((a)->d, (a)->i, (a)->icd->sz, cmp, arg); \
} while(0)
#define utarray_msort_r(a, cmp, arg) do { \
fcitx_msort_r((a)->d, (a)->i, (a)->icd->sz, cmp, arg); \
} while(0)
#define utarray_eltidx(a, e) (((char*)(e) >= (char*)((a)->d)) ? \
(((char*)(e) - (char*)((a)->d)) / (a)->icd->sz) : \
-1)
#define utarray_front(a) (((a)->i) ? (_utarray_eltptr(a, 0)) : NULL)
#define utarray_back(a) (((a)->i) ? (_utarray_eltptr(a, (a)->i - 1)) : NULL)
#define utarray_next(a, e) (((e) == NULL) ? utarray_front(a) : \
((((a)->i) > (utarray_eltidx(a, e) + 1)) ? \
_utarray_eltptr(a, utarray_eltidx(a, e) + 1) : \
NULL))
static inline void*
utarray_prev(UT_array *a, void *e)
{
if (!e)
return utarray_back(a);
int idx = utarray_eltidx(a, e) - 1;
if (idx < 0)
return NULL;
return _utarray_eltptr(a, idx);
}
/* last we pre-define a few icd for common utarrays of ints and strings */
static void utarray_str_cpy(void *dst, const void *src)
{
char **_src = (char**)src, **_dst = (char**)dst;
*_dst = (*_src == NULL) ? NULL : strdup(*_src);
}
static void utarray_str_dtor(void *elt)
{
char **eltc = (char**)elt;
if (*eltc)
free(*eltc);
}
static const UT_icd ut_str_icd _UNUSED_ = {
sizeof(char*), NULL, utarray_str_cpy, utarray_str_dtor
};
static const UT_icd ut_int_icd _UNUSED_ = {
sizeof(int), NULL, NULL, NULL
};
#define utarray_custom_bsearch(key, a, acc, cmp) \
fcitx_utils_custom_bsearch(key, (a)->d, (a)->i, (a)->icd->sz, acc, cmp)
#define utarray_foreach(key, array, type) \
type *key; \
for (key = (type*)utarray_front(array);key; \
key = (type*)utarray_next((array), key))
static inline UT_array*
utarray_clone(const UT_array *from)
{
UT_array *to;
utarray_new(to, from->icd);
if (utarray_len(from) == 0)
return to;
utarray_reserve(to, utarray_len(from));
if (to->icd->copy) {
size_t i;
for(i = 0;i < from->i;i++) {
to->icd->copy(_utarray_eltptr(to, i), _utarray_eltptr(from, i));
}
} else {
memcpy(_utarray_eltptr(to, 0), _utarray_eltptr(from, 0),
utarray_len(from) * (to->icd->sz));
}
to->i = utarray_len(from);
return to;
}
#endif /* UTARRAY_H */
// kate: indent-mode cstyle; space-indent on; indent-width 0;
|