4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License (the "License").
6 * You may not use this file except in compliance with the License.
8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 * or http://www.opensolaris.org/os/licensing.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
23 * Copyright 2006 Sun Microsystems, Inc. All rights reserved.
24 * Use is subject to license terms.
27 #pragma ident "%Z%%M% %I% %E% SMI"
29 #include <sys/types.h>
30 #include <sys/sysmacros.h>
35 #include <dt_strtab.h>
39 dt_strtab_grow(dt_strtab_t *sp)
43 if ((ptr = malloc(sp->str_bufsz)) == NULL)
46 bufs = realloc(sp->str_bufs, (sp->str_nbufs + 1) * sizeof (char *));
56 sp->str_bufs[sp->str_nbufs - 1] = sp->str_ptr;
62 dt_strtab_create(size_t bufsz)
64 dt_strtab_t *sp = malloc(sizeof (dt_strtab_t));
65 uint_t nbuckets = _dtrace_strbuckets;
72 bzero(sp, sizeof (dt_strtab_t));
73 sp->str_hash = malloc(nbuckets * sizeof (dt_strhash_t *));
75 if (sp->str_hash == NULL)
78 bzero(sp->str_hash, nbuckets * sizeof (dt_strhash_t *));
79 sp->str_hashsz = nbuckets;
83 sp->str_bufsz = bufsz;
87 if (dt_strtab_grow(sp) == -1)
90 *sp->str_ptr++ = '\0';
94 dt_strtab_destroy(sp);
99 dt_strtab_destroy(dt_strtab_t *sp)
101 dt_strhash_t *hp, *hq;
104 for (i = 0; i < sp->str_hashsz; i++) {
105 for (hp = sp->str_hash[i]; hp != NULL; hp = hq) {
111 for (i = 0; i < sp->str_nbufs; i++)
112 free(sp->str_bufs[i]);
114 if (sp->str_hash != NULL)
116 if (sp->str_bufs != NULL)
123 dt_strtab_hash(const char *key, size_t *len)
129 for (p = key; *p != '\0'; p++, n++) {
132 if ((g = (h & 0xf0000000)) != 0) {
145 dt_strtab_compare(dt_strtab_t *sp, dt_strhash_t *hp,
146 const char *str, size_t len)
148 ulong_t b = hp->str_buf;
149 const char *buf = hp->str_data;
154 if (buf == sp->str_bufs[b] + sp->str_bufsz)
155 buf = sp->str_bufs[++b];
157 resid = sp->str_bufs[b] + sp->str_bufsz - buf;
160 if ((rv = strncmp(buf, str, n)) != 0)
172 dt_strtab_copyin(dt_strtab_t *sp, const char *str, size_t len)
174 char *old_p = sp->str_ptr;
175 ulong_t old_n = sp->str_nbufs;
177 ulong_t b = sp->str_nbufs - 1;
181 if (sp->str_ptr == sp->str_bufs[b] + sp->str_bufsz) {
182 if (dt_strtab_grow(sp) == -1)
187 resid = sp->str_bufs[b] + sp->str_bufsz - sp->str_ptr;
189 bcopy(str, sp->str_ptr, n);
199 while (sp->str_nbufs != old_n)
200 free(sp->str_bufs[--sp->str_nbufs]);
207 dt_strtab_index(dt_strtab_t *sp, const char *str)
213 if (str == NULL || str[0] == '\0')
214 return (0); /* we keep a \0 at offset 0 to simplify things */
216 h = dt_strtab_hash(str, &len) % sp->str_hashsz;
218 for (hp = sp->str_hash[h]; hp != NULL; hp = hp->str_next) {
219 if (dt_strtab_compare(sp, hp, str, len + 1) == 0)
220 return (hp->str_off);
227 dt_strtab_insert(dt_strtab_t *sp, const char *str)
234 if ((off = dt_strtab_index(sp, str)) != -1)
237 h = dt_strtab_hash(str, &len) % sp->str_hashsz;
240 * Create a new hash bucket, initialize it, and insert it at the front
241 * of the hash chain for the appropriate bucket.
243 if ((hp = malloc(sizeof (dt_strhash_t))) == NULL)
246 hp->str_data = sp->str_ptr;
247 hp->str_buf = sp->str_nbufs - 1;
248 hp->str_off = sp->str_size;
250 hp->str_next = sp->str_hash[h];
253 * Now copy the string data into our buffer list, and then update
254 * the global counts of strings and bytes. Return str's byte offset.
256 if (dt_strtab_copyin(sp, str, len + 1) == -1)
260 sp->str_size += len + 1;
261 sp->str_hash[h] = hp;
263 return (hp->str_off);
267 dt_strtab_size(const dt_strtab_t *sp)
269 return (sp->str_size);
273 dt_strtab_write(const dt_strtab_t *sp, dt_strtab_write_f *func, void *private)
275 ssize_t res, total = 0;
279 for (i = 0; i < sp->str_nbufs; i++, total += res) {
280 if (i == sp->str_nbufs - 1)
281 n = sp->str_ptr - sp->str_bufs[i];
285 if ((res = func(sp->str_bufs[i], n, total, private)) <= 0)
289 if (total == 0 && sp->str_size != 0)