1 /* Miscellaneous utilities.
2 Copyright (C) 2019-2020 Free Software Foundation, Inc.
4 This file is part of libctf.
6 libctf is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 This program is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
14 See the GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; see the file COPYING. If not see
18 <http://www.gnu.org/licenses/>. */
23 /* Simple doubly-linked list append routine. This implementation assumes that
24 each list element contains an embedded ctf_list_t as the first member.
25 An additional ctf_list_t is used to store the head (l_next) and tail
26 (l_prev) pointers. The current head and tail list elements have their
27 previous and next pointers set to NULL, respectively. */
30 ctf_list_append (ctf_list_t
*lp
, void *newp
)
32 ctf_list_t
*p
= lp
->l_prev
; /* p = tail list element. */
33 ctf_list_t
*q
= newp
; /* q = new list element. */
45 /* Prepend the specified existing element to the given ctf_list_t. The
46 existing pointer should be pointing at a struct with embedded ctf_list_t. */
49 ctf_list_prepend (ctf_list_t
* lp
, void *newp
)
51 ctf_list_t
*p
= newp
; /* p = new list element. */
52 ctf_list_t
*q
= lp
->l_next
; /* q = head list element. */
64 /* Delete the specified existing element from the given ctf_list_t. The
65 existing pointer should be pointing at a struct with embedded ctf_list_t. */
68 ctf_list_delete (ctf_list_t
*lp
, void *existing
)
70 ctf_list_t
*p
= existing
;
72 if (p
->l_prev
!= NULL
)
73 p
->l_prev
->l_next
= p
->l_next
;
75 lp
->l_next
= p
->l_next
;
77 if (p
->l_next
!= NULL
)
78 p
->l_next
->l_prev
= p
->l_prev
;
80 lp
->l_prev
= p
->l_prev
;
83 /* Return 1 if the list is empty. */
86 ctf_list_empty_p (ctf_list_t
*lp
)
88 return (lp
->l_next
== NULL
&& lp
->l_prev
== NULL
);
91 /* Convert a 32-bit ELF symbol into Elf64 and return a pointer to it. */
94 ctf_sym_to_elf64 (const Elf32_Sym
*src
, Elf64_Sym
*dst
)
96 dst
->st_name
= src
->st_name
;
97 dst
->st_value
= src
->st_value
;
98 dst
->st_size
= src
->st_size
;
99 dst
->st_info
= src
->st_info
;
100 dst
->st_other
= src
->st_other
;
101 dst
->st_shndx
= src
->st_shndx
;
106 /* A string appender working on dynamic strings. Returns NULL on OOM. */
109 ctf_str_append (char *s
, const char *append
)
119 size_t append_len
= strlen (append
);
121 if ((s
= realloc (s
, s_len
+ append_len
+ 1)) == NULL
)
124 memcpy (s
+ s_len
, append
, append_len
);
125 s
[s_len
+ append_len
] = '\0';
130 /* A version of ctf_str_append that returns the old string on OOM. */
133 ctf_str_append_noerr (char *s
, const char *append
)
137 new_s
= ctf_str_append (s
, append
);
143 /* A realloc() that fails noisily if called with any ctf_str_num_users. */
145 ctf_realloc (ctf_file_t
*fp
, void *ptr
, size_t size
)
147 if (fp
->ctf_str_num_refs
> 0)
149 ctf_dprintf ("%p: attempt to realloc() string table with %lu active refs\n",
150 (void *) fp
, (unsigned long) fp
->ctf_str_num_refs
);
153 return realloc (ptr
, size
);
156 /* Store the specified error code into errp if it is non-NULL, and then
157 return NULL for the benefit of the caller. */
160 ctf_set_open_errno (int *errp
, int error
)
167 /* Store the specified error code into the CTF container, and then return
168 CTF_ERR / -1 for the benefit of the caller. */
171 ctf_set_errno (ctf_file_t
* fp
, int err
)
This page took 0.034111 seconds and 4 git commands to generate.