1*d27927f7SRuslan Bukin /*-
2*d27927f7SRuslan Bukin * Copyright (c) 2003-2008 Joseph Koshy
3*d27927f7SRuslan Bukin * All rights reserved.
4*d27927f7SRuslan Bukin *
5*d27927f7SRuslan Bukin * Redistribution and use in source and binary forms, with or without
6*d27927f7SRuslan Bukin * modification, are permitted provided that the following conditions
7*d27927f7SRuslan Bukin * are met:
8*d27927f7SRuslan Bukin * 1. Redistributions of source code must retain the above copyright
9*d27927f7SRuslan Bukin * notice, this list of conditions and the following disclaimer.
10*d27927f7SRuslan Bukin * 2. Redistributions in binary form must reproduce the above copyright
11*d27927f7SRuslan Bukin * notice, this list of conditions and the following disclaimer in the
12*d27927f7SRuslan Bukin * documentation and/or other materials provided with the distribution.
13*d27927f7SRuslan Bukin *
14*d27927f7SRuslan Bukin * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15*d27927f7SRuslan Bukin * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16*d27927f7SRuslan Bukin * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17*d27927f7SRuslan Bukin * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18*d27927f7SRuslan Bukin * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19*d27927f7SRuslan Bukin * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20*d27927f7SRuslan Bukin * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21*d27927f7SRuslan Bukin * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22*d27927f7SRuslan Bukin * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23*d27927f7SRuslan Bukin * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24*d27927f7SRuslan Bukin * SUCH DAMAGE.
25*d27927f7SRuslan Bukin */
26*d27927f7SRuslan Bukin
27*d27927f7SRuslan Bukin #include <sys/cdefs.h>
28*d27927f7SRuslan Bukin __FBSDID("$FreeBSD$");
29*d27927f7SRuslan Bukin
30*d27927f7SRuslan Bukin #include <sys/types.h>
31*d27927f7SRuslan Bukin #include <sys/cpuset.h>
32*d27927f7SRuslan Bukin #include <sys/param.h>
33*d27927f7SRuslan Bukin #include <sys/stat.h>
34*d27927f7SRuslan Bukin #include <sys/pmc.h>
35*d27927f7SRuslan Bukin
36*d27927f7SRuslan Bukin #include <assert.h>
37*d27927f7SRuslan Bukin #include <err.h>
38*d27927f7SRuslan Bukin #include <errno.h>
39*d27927f7SRuslan Bukin #include <pmc.h>
40*d27927f7SRuslan Bukin #include <pmclog.h>
41*d27927f7SRuslan Bukin #include <stdio.h>
42*d27927f7SRuslan Bukin #include <stdlib.h>
43*d27927f7SRuslan Bukin #include <string.h>
44*d27927f7SRuslan Bukin #include <sysexits.h>
45*d27927f7SRuslan Bukin
46*d27927f7SRuslan Bukin #include "libpmcstat.h"
47*d27927f7SRuslan Bukin
48*d27927f7SRuslan Bukin static LIST_HEAD(,pmcstat_string) pmcstat_string_hash[PMCSTAT_NHASH];
49*d27927f7SRuslan Bukin
50*d27927f7SRuslan Bukin /*
51*d27927f7SRuslan Bukin * Intern a copy of string 's', and return a pointer to the
52*d27927f7SRuslan Bukin * interned structure.
53*d27927f7SRuslan Bukin */
54*d27927f7SRuslan Bukin
55*d27927f7SRuslan Bukin pmcstat_interned_string
pmcstat_string_intern(const char * s)56*d27927f7SRuslan Bukin pmcstat_string_intern(const char *s)
57*d27927f7SRuslan Bukin {
58*d27927f7SRuslan Bukin struct pmcstat_string *ps;
59*d27927f7SRuslan Bukin const struct pmcstat_string *cps;
60*d27927f7SRuslan Bukin int hash, len;
61*d27927f7SRuslan Bukin
62*d27927f7SRuslan Bukin if ((cps = pmcstat_string_lookup(s)) != NULL)
63*d27927f7SRuslan Bukin return (cps);
64*d27927f7SRuslan Bukin
65*d27927f7SRuslan Bukin hash = pmcstat_string_compute_hash(s);
66*d27927f7SRuslan Bukin len = strlen(s);
67*d27927f7SRuslan Bukin
68*d27927f7SRuslan Bukin if ((ps = malloc(sizeof(*ps))) == NULL)
69*d27927f7SRuslan Bukin err(EX_OSERR, "ERROR: Could not intern string");
70*d27927f7SRuslan Bukin ps->ps_len = len;
71*d27927f7SRuslan Bukin ps->ps_hash = hash;
72*d27927f7SRuslan Bukin ps->ps_string = strdup(s);
73*d27927f7SRuslan Bukin LIST_INSERT_HEAD(&pmcstat_string_hash[hash], ps, ps_next);
74*d27927f7SRuslan Bukin return ((pmcstat_interned_string) ps);
75*d27927f7SRuslan Bukin }
76*d27927f7SRuslan Bukin
77*d27927f7SRuslan Bukin const char *
pmcstat_string_unintern(pmcstat_interned_string str)78*d27927f7SRuslan Bukin pmcstat_string_unintern(pmcstat_interned_string str)
79*d27927f7SRuslan Bukin {
80*d27927f7SRuslan Bukin const char *s;
81*d27927f7SRuslan Bukin
82*d27927f7SRuslan Bukin s = ((const struct pmcstat_string *) str)->ps_string;
83*d27927f7SRuslan Bukin return (s);
84*d27927f7SRuslan Bukin }
85*d27927f7SRuslan Bukin
86*d27927f7SRuslan Bukin /*
87*d27927f7SRuslan Bukin * Compute a 'hash' value for a string.
88*d27927f7SRuslan Bukin */
89*d27927f7SRuslan Bukin
90*d27927f7SRuslan Bukin int
pmcstat_string_compute_hash(const char * s)91*d27927f7SRuslan Bukin pmcstat_string_compute_hash(const char *s)
92*d27927f7SRuslan Bukin {
93*d27927f7SRuslan Bukin unsigned hash;
94*d27927f7SRuslan Bukin
95*d27927f7SRuslan Bukin for (hash = 2166136261; *s; s++)
96*d27927f7SRuslan Bukin hash = (hash ^ *s) * 16777619;
97*d27927f7SRuslan Bukin
98*d27927f7SRuslan Bukin return (hash & PMCSTAT_HASH_MASK);
99*d27927f7SRuslan Bukin }
100*d27927f7SRuslan Bukin
101*d27927f7SRuslan Bukin pmcstat_interned_string
pmcstat_string_lookup(const char * s)102*d27927f7SRuslan Bukin pmcstat_string_lookup(const char *s)
103*d27927f7SRuslan Bukin {
104*d27927f7SRuslan Bukin struct pmcstat_string *ps;
105*d27927f7SRuslan Bukin int hash, len;
106*d27927f7SRuslan Bukin
107*d27927f7SRuslan Bukin hash = pmcstat_string_compute_hash(s);
108*d27927f7SRuslan Bukin len = strlen(s);
109*d27927f7SRuslan Bukin
110*d27927f7SRuslan Bukin LIST_FOREACH(ps, &pmcstat_string_hash[hash], ps_next)
111*d27927f7SRuslan Bukin if (ps->ps_len == len && ps->ps_hash == hash &&
112*d27927f7SRuslan Bukin strcmp(ps->ps_string, s) == 0)
113*d27927f7SRuslan Bukin return (ps);
114*d27927f7SRuslan Bukin return (NULL);
115*d27927f7SRuslan Bukin }
116*d27927f7SRuslan Bukin
117*d27927f7SRuslan Bukin int
pmcstat_string_lookup_hash(pmcstat_interned_string s)118*d27927f7SRuslan Bukin pmcstat_string_lookup_hash(pmcstat_interned_string s)
119*d27927f7SRuslan Bukin {
120*d27927f7SRuslan Bukin const struct pmcstat_string *ps;
121*d27927f7SRuslan Bukin
122*d27927f7SRuslan Bukin ps = (const struct pmcstat_string *) s;
123*d27927f7SRuslan Bukin return (ps->ps_hash);
124*d27927f7SRuslan Bukin }
125*d27927f7SRuslan Bukin
126*d27927f7SRuslan Bukin /*
127*d27927f7SRuslan Bukin * Destroy the string table, free'ing up space.
128*d27927f7SRuslan Bukin */
129*d27927f7SRuslan Bukin
130*d27927f7SRuslan Bukin void
pmcstat_string_shutdown(void)131*d27927f7SRuslan Bukin pmcstat_string_shutdown(void)
132*d27927f7SRuslan Bukin {
133*d27927f7SRuslan Bukin int i;
134*d27927f7SRuslan Bukin struct pmcstat_string *ps, *pstmp;
135*d27927f7SRuslan Bukin
136*d27927f7SRuslan Bukin for (i = 0; i < PMCSTAT_NHASH; i++)
137*d27927f7SRuslan Bukin LIST_FOREACH_SAFE(ps, &pmcstat_string_hash[i], ps_next,
138*d27927f7SRuslan Bukin pstmp) {
139*d27927f7SRuslan Bukin LIST_REMOVE(ps, ps_next);
140*d27927f7SRuslan Bukin free(ps->ps_string);
141*d27927f7SRuslan Bukin free(ps);
142*d27927f7SRuslan Bukin }
143*d27927f7SRuslan Bukin }
144*d27927f7SRuslan Bukin
145*d27927f7SRuslan Bukin /*
146*d27927f7SRuslan Bukin * Initialize the string interning facility.
147*d27927f7SRuslan Bukin */
148*d27927f7SRuslan Bukin
149*d27927f7SRuslan Bukin void
pmcstat_string_initialize(void)150*d27927f7SRuslan Bukin pmcstat_string_initialize(void)
151*d27927f7SRuslan Bukin {
152*d27927f7SRuslan Bukin int i;
153*d27927f7SRuslan Bukin
154*d27927f7SRuslan Bukin for (i = 0; i < PMCSTAT_NHASH; i++)
155*d27927f7SRuslan Bukin LIST_INIT(&pmcstat_string_hash[i]);
156*d27927f7SRuslan Bukin }
157