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
|
/*
* This file and its contents are supplied under the terms of the
* Common Development and Distribution License ("CDDL"), version 1.0.
* You may only use this file in accordance with the terms of version
* 1.0 of the CDDL.
*
* A full copy of the text of the CDDL should have accompanied this
* source. A copy of the CDDL is also available via the Internet at
* http://www.illumos.org/license/CDDL.
*/
/*
* Copyright 2009 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/*
* Copyright 2021 Oxide Computer Company
*/
#ifndef _KERNEL
#include <stdlib.h>
#include <strings.h>
#include <stddef.h>
#else
#include <sys/types.h>
#include <sys/kmem.h>
#include <sys/ddi.h>
#include <sys/sunddi.h>
#include <sys/stddef.h>
#endif /* _KERNEL */
#include <core_shstrtab.h>
const char *shstrtab_data[STR_NUM] = {
"",
".SUNW_ctf",
".symtab",
".dynsym",
".strtab",
".dynstr",
".shstrtab"
};
static void *
shstrtab_alloc(void)
{
#ifdef _KERNEL
return (kmem_zalloc(sizeof (shstrtab_ent_t), KM_NOSLEEP_LAZY));
#else
return (calloc(1, sizeof (shstrtab_ent_t)));
#endif
}
static void
shstrtab_free(shstrtab_ent_t *ent)
{
#ifdef _KERNEL
if (ent->sste_name != NULL) {
strfree(ent->sste_name);
}
kmem_free(ent, sizeof (*ent));
#else
free(ent->sste_name);
free(ent);
#endif
}
boolean_t
shstrtab_ndx(shstrtab_t *s, const char *name, Elf32_Word *offp)
{
shstrtab_ent_t *ent;
for (ent = list_head(&s->sst_names); ent != NULL;
ent = list_next(&s->sst_names, ent)) {
if (strcmp(name, ent->sste_name) == 0) {
if (offp != NULL)
*offp = ent->sste_offset;
return (B_TRUE);
}
}
ent = shstrtab_alloc();
if (ent == NULL) {
return (B_FALSE);
}
ent->sste_name = strdup(name);
if (ent->sste_name == NULL) {
shstrtab_free(ent);
return (B_FALSE);
}
ent->sste_len = strlen(name) + 1;
ent->sste_offset = s->sst_len;
s->sst_len += ent->sste_len;
list_insert_tail(&s->sst_names, ent);
if (offp != NULL)
*offp = ent->sste_offset;
return (B_TRUE);
}
boolean_t
shstrtab_init(shstrtab_t *s)
{
bzero(s, sizeof (*s));
list_create(&s->sst_names, sizeof (shstrtab_ent_t),
offsetof(shstrtab_ent_t, sste_link));
return (shstrtab_ndx(s, shstrtab_data[STR_NONE], NULL));
}
void
shstrtab_fini(shstrtab_t *s)
{
shstrtab_ent_t *ent;
if (s->sst_len == 0)
return;
while ((ent = list_remove_head(&s->sst_names)) != NULL) {
shstrtab_free(ent);
}
}
size_t
shstrtab_size(const shstrtab_t *s)
{
return (s->sst_len);
}
void
shstrtab_dump(shstrtab_t *s, void *buf)
{
size_t off = 0;
for (shstrtab_ent_t *ent = list_head(&s->sst_names); ent != NULL;
ent = list_next(&s->sst_names, ent)) {
bcopy(ent->sste_name, buf + off, ent->sste_len);
off += ent->sste_len;
}
}
|
