1 | /*
|
---|
2 | * CDDL HEADER START
|
---|
3 | *
|
---|
4 | * The contents of this file are subject to the terms of the
|
---|
5 | * Common Development and Distribution License, Version 1.0 only
|
---|
6 | * (the "License"). You may not use this file except in compliance
|
---|
7 | * with the License.
|
---|
8 | *
|
---|
9 | * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
|
---|
10 | * or http://www.opensolaris.org/os/licensing.
|
---|
11 | * See the License for the specific language governing permissions
|
---|
12 | * and limitations under the License.
|
---|
13 | *
|
---|
14 | * When distributing Covered Code, include this CDDL HEADER in each
|
---|
15 | * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
|
---|
16 | * If applicable, add the following below this CDDL HEADER, with the
|
---|
17 | * fields enclosed by brackets "[]" replaced with your own identifying
|
---|
18 | * information: Portions Copyright [yyyy] [name of copyright owner]
|
---|
19 | *
|
---|
20 | * CDDL HEADER END
|
---|
21 | */
|
---|
22 | /*
|
---|
23 | * Copyright 2005 Sun Microsystems, Inc. All rights reserved.
|
---|
24 | * Use is subject to license terms.
|
---|
25 | */
|
---|
26 |
|
---|
27 | #ifndef VBOX
|
---|
28 | #pragma ident "%Z%%M% %I% %E% SMI"
|
---|
29 | #endif
|
---|
30 |
|
---|
31 | #include <ctf_impl.h>
|
---|
32 |
|
---|
33 | /*
|
---|
34 | * Simple doubly-linked list append routine. This implementation assumes that
|
---|
35 | * each list element contains an embedded ctf_list_t as the first member.
|
---|
36 | * An additional ctf_list_t is used to store the head (l_next) and tail
|
---|
37 | * (l_prev) pointers. The current head and tail list elements have their
|
---|
38 | * previous and next pointers set to NULL, respectively.
|
---|
39 | */
|
---|
40 | void
|
---|
41 | ctf_list_append(ctf_list_t *lp, void *new)
|
---|
42 | {
|
---|
43 | ctf_list_t *p = lp->l_prev; /* p = tail list element */
|
---|
44 | ctf_list_t *q = new; /* q = new list element */
|
---|
45 |
|
---|
46 | lp->l_prev = q;
|
---|
47 | q->l_prev = p;
|
---|
48 | q->l_next = NULL;
|
---|
49 |
|
---|
50 | if (p != NULL)
|
---|
51 | p->l_next = q;
|
---|
52 | else
|
---|
53 | lp->l_next = q;
|
---|
54 | }
|
---|
55 |
|
---|
56 | /*
|
---|
57 | * Prepend the specified existing element to the given ctf_list_t. The
|
---|
58 | * existing pointer should be pointing at a struct with embedded ctf_list_t.
|
---|
59 | */
|
---|
60 | void
|
---|
61 | ctf_list_prepend(ctf_list_t *lp, void *new)
|
---|
62 | {
|
---|
63 | ctf_list_t *p = new; /* p = new list element */
|
---|
64 | ctf_list_t *q = lp->l_next; /* q = head list element */
|
---|
65 |
|
---|
66 | lp->l_next = p;
|
---|
67 | p->l_prev = NULL;
|
---|
68 | p->l_next = q;
|
---|
69 |
|
---|
70 | if (q != NULL)
|
---|
71 | q->l_prev = p;
|
---|
72 | else
|
---|
73 | lp->l_prev = p;
|
---|
74 | }
|
---|
75 |
|
---|
76 | /*
|
---|
77 | * Delete the specified existing element from the given ctf_list_t. The
|
---|
78 | * existing pointer should be pointing at a struct with embedded ctf_list_t.
|
---|
79 | */
|
---|
80 | void
|
---|
81 | ctf_list_delete(ctf_list_t *lp, void *existing)
|
---|
82 | {
|
---|
83 | ctf_list_t *p = existing;
|
---|
84 |
|
---|
85 | if (p->l_prev != NULL)
|
---|
86 | p->l_prev->l_next = p->l_next;
|
---|
87 | else
|
---|
88 | lp->l_next = p->l_next;
|
---|
89 |
|
---|
90 | if (p->l_next != NULL)
|
---|
91 | p->l_next->l_prev = p->l_prev;
|
---|
92 | else
|
---|
93 | lp->l_prev = p->l_prev;
|
---|
94 | }
|
---|
95 |
|
---|
96 | /*
|
---|
97 | * Convert an encoded CTF string name into a pointer to a C string by looking
|
---|
98 | * up the appropriate string table buffer and then adding the offset.
|
---|
99 | */
|
---|
100 | const char *
|
---|
101 | ctf_strraw(ctf_file_t *fp, uint_t name)
|
---|
102 | {
|
---|
103 | ctf_strs_t *ctsp = &fp->ctf_str[CTF_NAME_STID(name)];
|
---|
104 |
|
---|
105 | if (ctsp->cts_strs != NULL && CTF_NAME_OFFSET(name) < ctsp->cts_len)
|
---|
106 | return (ctsp->cts_strs + CTF_NAME_OFFSET(name));
|
---|
107 |
|
---|
108 | /* string table not loaded or corrupt offset */
|
---|
109 | return (NULL);
|
---|
110 | }
|
---|
111 |
|
---|
112 | const char *
|
---|
113 | ctf_strptr(ctf_file_t *fp, uint_t name)
|
---|
114 | {
|
---|
115 | const char *s = ctf_strraw(fp, name);
|
---|
116 | return (s != NULL ? s : "(?)");
|
---|
117 | }
|
---|
118 |
|
---|
119 | /*
|
---|
120 | * Same strdup(3C), but use ctf_alloc() to do the memory allocation.
|
---|
121 | */
|
---|
122 | char *
|
---|
123 | ctf_strdup(const char *s1)
|
---|
124 | {
|
---|
125 | char *s2 = ctf_alloc(strlen(s1) + 1);
|
---|
126 |
|
---|
127 | if (s2 != NULL)
|
---|
128 | (void) strcpy(s2, s1);
|
---|
129 |
|
---|
130 | return (s2);
|
---|
131 | }
|
---|
132 |
|
---|
133 | /*
|
---|
134 | * Store the specified error code into errp if it is non-NULL, and then
|
---|
135 | * return NULL for the benefit of the caller.
|
---|
136 | */
|
---|
137 | ctf_file_t *
|
---|
138 | ctf_set_open_errno(int *errp, int error)
|
---|
139 | {
|
---|
140 | if (errp != NULL)
|
---|
141 | *errp = error;
|
---|
142 | return (NULL);
|
---|
143 | }
|
---|
144 |
|
---|
145 | /*
|
---|
146 | * Store the specified error code into the CTF container, and then return
|
---|
147 | * CTF_ERR for the benefit of the caller.
|
---|
148 | */
|
---|
149 | long
|
---|
150 | ctf_set_errno(ctf_file_t *fp, int err)
|
---|
151 | {
|
---|
152 | fp->ctf_errno = err;
|
---|
153 | return (CTF_ERR);
|
---|
154 | }
|
---|