1 /*-
2 * Copyright (c) 2010 Pawel Jakub Dawidek <pjd@FreeBSD.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHORS AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 */
26
27 #include <sys/cdefs.h>
28 __FBSDID("$FreeBSD$");
29
30 #include <sys/param.h>
31 #include <sys/jail.h>
32 #include <sys/kernel.h>
33 #include <sys/libkern.h>
34 #include <sys/limits.h>
35 #include <sys/misc.h>
36 #include <sys/sunddi.h>
37 #include <sys/sysctl.h>
38
39 int
ddi_strtol(const char * str,char ** nptr,int base,long * result)40 ddi_strtol(const char *str, char **nptr, int base, long *result)
41 {
42
43 *result = strtol(str, nptr, base);
44 if (*result == 0)
45 return (EINVAL);
46 else if (*result == LONG_MIN || *result == LONG_MAX)
47 return (ERANGE);
48 return (0);
49 }
50
51 int
ddi_strtoul(const char * str,char ** nptr,int base,unsigned long * result)52 ddi_strtoul(const char *str, char **nptr, int base, unsigned long *result)
53 {
54
55 if (str == hw_serial) {
56 *result = prison0.pr_hostid;
57 return (0);
58 }
59
60 *result = strtoul(str, nptr, base);
61 if (*result == 0)
62 return (EINVAL);
63 else if (*result == ULONG_MAX)
64 return (ERANGE);
65 return (0);
66 }
67
68 int
ddi_strtoull(const char * str,char ** nptr,int base,unsigned long long * result)69 ddi_strtoull(const char *str, char **nptr, int base, unsigned long long *result)
70 {
71
72 *result = (unsigned long long)strtouq(str, nptr, base);
73 if (*result == 0)
74 return (EINVAL);
75 else if (*result == ULLONG_MAX)
76 return (ERANGE);
77 return (0);
78 }
79
80 struct ddi_soft_state_item {
81 int ssi_item;
82 void *ssi_data;
83 LIST_ENTRY(ddi_soft_state_item) ssi_next;
84 };
85
86 struct ddi_soft_state {
87 size_t ss_size;
88 kmutex_t ss_lock;
89 LIST_HEAD(, ddi_soft_state_item) ss_list;
90 };
91
92 static void *
ddi_get_soft_state_locked(struct ddi_soft_state * ss,int item)93 ddi_get_soft_state_locked(struct ddi_soft_state *ss, int item)
94 {
95 struct ddi_soft_state_item *itemp;
96
97 ASSERT(MUTEX_HELD(&ss->ss_lock));
98
99 LIST_FOREACH(itemp, &ss->ss_list, ssi_next) {
100 if (itemp->ssi_item == item)
101 return (itemp->ssi_data);
102 }
103 return (NULL);
104 }
105
106 void *
ddi_get_soft_state(void * state,int item)107 ddi_get_soft_state(void *state, int item)
108 {
109 struct ddi_soft_state *ss = state;
110 void *data;
111
112 mutex_enter(&ss->ss_lock);
113 data = ddi_get_soft_state_locked(ss, item);
114 mutex_exit(&ss->ss_lock);
115 return (data);
116 }
117
118 int
ddi_soft_state_zalloc(void * state,int item)119 ddi_soft_state_zalloc(void *state, int item)
120 {
121 struct ddi_soft_state *ss = state;
122 struct ddi_soft_state_item *itemp;
123
124 itemp = kmem_alloc(sizeof(*itemp), KM_SLEEP);
125 itemp->ssi_item = item;
126 itemp->ssi_data = kmem_zalloc(ss->ss_size, KM_SLEEP);
127
128 mutex_enter(&ss->ss_lock);
129 if (ddi_get_soft_state_locked(ss, item) != NULL) {
130 mutex_exit(&ss->ss_lock);
131 kmem_free(itemp->ssi_data, ss->ss_size);
132 kmem_free(itemp, sizeof(*itemp));
133 return (DDI_FAILURE);
134 }
135 LIST_INSERT_HEAD(&ss->ss_list, itemp, ssi_next);
136 mutex_exit(&ss->ss_lock);
137 return (DDI_SUCCESS);
138 }
139
140 static void
ddi_soft_state_free_locked(struct ddi_soft_state * ss,int item)141 ddi_soft_state_free_locked(struct ddi_soft_state *ss, int item)
142 {
143 struct ddi_soft_state_item *itemp;
144
145 ASSERT(MUTEX_HELD(&ss->ss_lock));
146
147 LIST_FOREACH(itemp, &ss->ss_list, ssi_next) {
148 if (itemp->ssi_item == item)
149 break;
150 }
151 if (itemp != NULL) {
152 LIST_REMOVE(itemp, ssi_next);
153 kmem_free(itemp->ssi_data, ss->ss_size);
154 kmem_free(itemp, sizeof(*itemp));
155 }
156 }
157
158 void
ddi_soft_state_free(void * state,int item)159 ddi_soft_state_free(void *state, int item)
160 {
161 struct ddi_soft_state *ss = state;
162
163 mutex_enter(&ss->ss_lock);
164 ddi_soft_state_free_locked(ss, item);
165 mutex_exit(&ss->ss_lock);
166 }
167
168 int
ddi_soft_state_init(void ** statep,size_t size,size_t nitems __unused)169 ddi_soft_state_init(void **statep, size_t size, size_t nitems __unused)
170 {
171 struct ddi_soft_state *ss;
172
173 ss = kmem_alloc(sizeof(*ss), KM_SLEEP);
174 mutex_init(&ss->ss_lock, NULL, MUTEX_DEFAULT, NULL);
175 ss->ss_size = size;
176 LIST_INIT(&ss->ss_list);
177 *statep = ss;
178 return (0);
179 }
180
181 void
ddi_soft_state_fini(void ** statep)182 ddi_soft_state_fini(void **statep)
183 {
184 struct ddi_soft_state *ss = *statep;
185 struct ddi_soft_state_item *itemp;
186 int item;
187
188 mutex_enter(&ss->ss_lock);
189 while ((itemp = LIST_FIRST(&ss->ss_list)) != NULL) {
190 item = itemp->ssi_item;
191 ddi_soft_state_free_locked(ss, item);
192 }
193 mutex_exit(&ss->ss_lock);
194 mutex_destroy(&ss->ss_lock);
195 kmem_free(ss, sizeof(*ss));
196
197 *statep = NULL;
198 }
199