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
|
/* Inline functions.
Copyright (C) 2020 Free Software Foundation, Inc.
This file is part of libctf.
libctf is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at your option) any later
version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; see the file COPYING. If not see
<http://www.gnu.org/licenses/>. */
#ifndef _CTF_INLINES_H
#define _CTF_INLINES_H
#ifdef __cplusplus
extern "C"
{
#endif
#include "config.h"
#ifndef _libctf_malloc_
#error "ctf-inlines.h" should not be included directly: include "ctf-impl.h".
#endif
static inline ssize_t
ctf_get_ctt_size (const ctf_file_t *fp,
const ctf_type_t *tp,
ssize_t *sizep,
ssize_t *incrementp)
{
return (fp->ctf_fileops->ctfo_get_ctt_size (fp, tp, sizep, incrementp));
}
static inline int
ctf_forwardable_kind (int kind)
{
return (kind == CTF_K_STRUCT || kind == CTF_K_UNION || kind == CTF_K_ENUM);
}
static inline int
ctf_dynhash_cnext_sorted (ctf_dynhash_t *h, ctf_next_t **i, const void **key,
const void **value, ctf_hash_sort_f sort_fun,
void *sort_arg)
{
return ctf_dynhash_next_sorted (h, i, (void **) key, (void **) value,
sort_fun, sort_arg);
}
static inline int
ctf_dynhash_cnext (ctf_dynhash_t *h, ctf_next_t **it,
const void **key, const void **value)
{
return ctf_dynhash_next (h, it, (void **) key, (void **) value);
}
static inline int
ctf_dynhash_cinsert (ctf_dynhash_t *h, const void *k, const void *v)
{
return ctf_dynhash_insert (h, (void *) k, (void *) v);
}
static inline int
ctf_dynset_cnext (ctf_dynset_t *h, ctf_next_t **it, const void **key)
{
return ctf_dynset_next (h, it, (void **) key);
}
static inline int
ctf_dynset_cinsert (ctf_dynset_t *h, const void *k)
{
return ctf_dynset_insert (h, (void *) k);
}
static inline int
ctf_assert_internal (ctf_file_t *fp, const char *file, size_t line,
const char *exprstr, int expr)
{
if (_libctf_unlikely_ (!expr))
ctf_assert_fail_internal (fp, file, line, exprstr);
return expr;
}
#ifdef __cplusplus
}
#endif
#endif /* _CTF_INLINES_H */
|
