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
|
/*
* Copyright 2003-2024 Gentoo Foundation
* Distributed under the terms of the GNU General Public License v2
*
* Copyright 2003-2012 Ned Ludd - <solar@gentoo.org>
* Copyright 2004-2024 Mike Frysinger - <vapier@gentoo.org>
*/
#ifndef __XFUNCS_H__
#define __XFUNCS_H__
char *xstrdup(const char *s);
void *xmalloc(size_t size);
void *xzalloc(size_t size);
void *xrealloc(void *ptr, size_t size);
void xstrncat(char **dst, const char *src, size_t *curr_len, size_t n);
#define xstrcat(dst,src,curr_len) xstrncat(dst,src,curr_len,0)
void xchrcat(char **dst, const char append, size_t *curr_len);
void *xmemdup(const void *src, size_t n);
typedef struct {
void **eles;
size_t num;
} array_t;
void xarraypush(array_t *array, const void *ele, size_t ele_len);
#define xarraypush_str(arr, ele) xarraypush(arr, ele, strlen(ele) + 1 /*NUL*/)
void xarrayfree(array_t *array);
#define xrealloc_array(ptr, size, ele_size) xrealloc(ptr, (size) * (ele_size))
/* The assignment after the check is unfortunate as we do a non-NULL check (we
* already do not permit pushing of NULL pointers), but we can't put it in the
* increment phase as that will cause a load beyond the bounds of valid memory.
*/
#define array_for_each(arr, n, ele) \
for (n = 0, ele = array_cnt(arr) ? arr->eles[n] : NULL; \
n < array_cnt(arr) && (ele = arr->eles[n]); \
++n)
#define array_init_decl { .eles = NULL, .num = 0, }
#define array_cnt(arr) (arr)->num
char *array_flatten_str(array_t *array);
#endif
|
GitWeb
