subr_pool.c revision 1.2 1 1.2 pk /* $NetBSD: subr_pool.c,v 1.2 1998/02/19 23:52:14 pk Exp $ */
2 1.1 pk
3 1.1 pk /*-
4 1.1 pk * Copyright (c) 1997 The NetBSD Foundation, Inc.
5 1.1 pk * All rights reserved.
6 1.1 pk *
7 1.1 pk * This code is derived from software contributed to The NetBSD Foundation
8 1.1 pk * by Paul Kranenburg.
9 1.1 pk *
10 1.1 pk * Redistribution and use in source and binary forms, with or without
11 1.1 pk * modification, are permitted provided that the following conditions
12 1.1 pk * are met:
13 1.1 pk * 1. Redistributions of source code must retain the above copyright
14 1.1 pk * notice, this list of conditions and the following disclaimer.
15 1.1 pk * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 pk * notice, this list of conditions and the following disclaimer in the
17 1.1 pk * documentation and/or other materials provided with the distribution.
18 1.1 pk * 3. All advertising materials mentioning features or use of this software
19 1.1 pk * must display the following acknowledgement:
20 1.1 pk * This product includes software developed by the NetBSD
21 1.1 pk * Foundation, Inc. and its contributors.
22 1.1 pk * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.1 pk * contributors may be used to endorse or promote products derived
24 1.1 pk * from this software without specific prior written permission.
25 1.1 pk *
26 1.1 pk * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.1 pk * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.1 pk * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.1 pk * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.1 pk * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.1 pk * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.1 pk * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.1 pk * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.1 pk * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.1 pk * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.1 pk * POSSIBILITY OF SUCH DAMAGE.
37 1.1 pk */
38 1.1 pk
39 1.1 pk #include <sys/param.h>
40 1.1 pk #include <sys/systm.h>
41 1.1 pk #include <sys/proc.h>
42 1.1 pk #include <sys/errno.h>
43 1.1 pk #include <sys/kernel.h>
44 1.1 pk #include <sys/malloc.h>
45 1.1 pk #include <sys/lock.h>
46 1.1 pk #include <sys/pool.h>
47 1.1 pk
48 1.1 pk /*
49 1.1 pk * Pool resource management utility.
50 1.1 pk */
51 1.1 pk
52 1.1 pk struct pool_item {
53 1.1 pk struct pool_item *pi_next;
54 1.1 pk };
55 1.1 pk
56 1.1 pk
57 1.1 pk struct pool *
58 1.2 pk pool_create(size, nitems, wchan, mtype, storage)
59 1.1 pk size_t size;
60 1.1 pk int nitems;
61 1.1 pk char *wchan;
62 1.1 pk int mtype;
63 1.2 pk caddr_t storage;
64 1.1 pk {
65 1.1 pk struct pool *pp;
66 1.2 pk caddr_t cp;
67 1.1 pk
68 1.1 pk if (size < sizeof(struct pool_item)) {
69 1.1 pk printf("pool_create: size %lu too small\n", (u_long)size);
70 1.1 pk return (NULL);
71 1.1 pk }
72 1.1 pk
73 1.2 pk if (storage) {
74 1.2 pk pp = (struct pool *)storage;
75 1.2 pk cp = (caddr_t)ALIGN(pp + 1);
76 1.2 pk } else {
77 1.2 pk pp = (struct pool *)malloc(sizeof(*pp), mtype, M_NOWAIT);
78 1.2 pk if (pp == NULL)
79 1.2 pk return (NULL);
80 1.2 pk cp = NULL;
81 1.2 pk }
82 1.1 pk
83 1.1 pk pp->pr_freelist = NULL;
84 1.1 pk pp->pr_freecount = 0;
85 1.1 pk pp->pr_hiwat = 0;
86 1.2 pk pp->pr_flags = (storage ? PR_STATIC : 0);
87 1.1 pk pp->pr_size = size;
88 1.1 pk pp->pr_wchan = wchan;
89 1.1 pk pp->pr_mtype = mtype;
90 1.1 pk simple_lock_init(&pp->pr_lock);
91 1.1 pk
92 1.1 pk if (nitems != 0) {
93 1.2 pk if (pool_prime(pp, nitems, cp) != 0) {
94 1.1 pk pool_destroy(pp);
95 1.2 pk return (NULL);
96 1.2 pk }
97 1.1 pk }
98 1.1 pk
99 1.1 pk return (pp);
100 1.1 pk }
101 1.1 pk
102 1.1 pk /*
103 1.1 pk * De-commision a pool resource.
104 1.1 pk */
105 1.1 pk void
106 1.1 pk pool_destroy(pp)
107 1.1 pk struct pool *pp;
108 1.1 pk {
109 1.1 pk struct pool_item *pi;
110 1.1 pk
111 1.2 pk if (pp->pr_flags & PR_STATIC)
112 1.2 pk return;
113 1.2 pk
114 1.1 pk while ((pi = pp->pr_freelist) != NULL) {
115 1.1 pk pp->pr_freelist = pi->pi_next;
116 1.1 pk free(pi, pp->pr_mtype);
117 1.1 pk }
118 1.1 pk free(pp, pp->pr_mtype);
119 1.1 pk }
120 1.1 pk
121 1.1 pk
122 1.1 pk /*
123 1.1 pk * Grab an item from the pool; must be called at splbio
124 1.1 pk */
125 1.1 pk void *
126 1.1 pk pool_get(pp, flags)
127 1.1 pk struct pool *pp;
128 1.1 pk int flags;
129 1.1 pk {
130 1.1 pk void *v;
131 1.1 pk struct pool_item *pi;
132 1.1 pk
133 1.2 pk #ifdef DIAGNOSTIC
134 1.2 pk if ((pp->pr_flags & PR_STATIC) && (flags & PR_MALLOCOK))
135 1.2 pk panic("pool_get: static");
136 1.2 pk #endif
137 1.2 pk
138 1.1 pk again:
139 1.1 pk simple_lock(&pp->pr_lock);
140 1.1 pk if ((v = pp->pr_freelist) == NULL) {
141 1.1 pk if (flags & PR_MALLOCOK)
142 1.1 pk v = (void *)malloc(pp->pr_size, pp->pr_mtype, M_NOWAIT);
143 1.1 pk
144 1.1 pk if (v == NULL) {
145 1.1 pk if ((flags & PR_WAITOK) == 0)
146 1.1 pk return (NULL);
147 1.1 pk pp->pr_flags |= PR_WANTED;
148 1.1 pk simple_unlock(&pp->pr_lock);
149 1.1 pk tsleep((caddr_t)pp, PSWP, pp->pr_wchan, 0);
150 1.1 pk goto again;
151 1.1 pk }
152 1.1 pk } else {
153 1.1 pk pi = v;
154 1.1 pk pp->pr_freelist = pi->pi_next;
155 1.1 pk pp->pr_freecount--;
156 1.1 pk }
157 1.1 pk simple_unlock(&pp->pr_lock);
158 1.1 pk return (v);
159 1.1 pk }
160 1.1 pk
161 1.1 pk /*
162 1.1 pk * Return resource to the pool; must be called at splbio
163 1.1 pk */
164 1.1 pk void
165 1.1 pk pool_put(pp, v)
166 1.1 pk struct pool *pp;
167 1.1 pk void *v;
168 1.1 pk {
169 1.1 pk struct pool_item *pi = v;
170 1.1 pk
171 1.1 pk simple_lock(&pp->pr_lock);
172 1.1 pk if ((pp->pr_flags & PR_WANTED) || pp->pr_freecount < pp->pr_hiwat) {
173 1.1 pk /* Return to pool */
174 1.1 pk pi->pi_next = pp->pr_freelist;
175 1.1 pk pp->pr_freelist = pi;
176 1.1 pk pp->pr_freecount++;
177 1.1 pk if (pp->pr_flags & PR_WANTED) {
178 1.1 pk pp->pr_flags &= ~PR_WANTED;
179 1.1 pk wakeup((caddr_t)pp);
180 1.1 pk }
181 1.1 pk } else {
182 1.2 pk #ifdef DIAGNOSTIC
183 1.2 pk if (pp->pr_flags & PR_STATIC) {
184 1.2 pk /* can't happen because hiwat > freecount */
185 1.2 pk panic("pool_put: static");
186 1.2 pk }
187 1.2 pk #endif
188 1.1 pk /* Return to system */
189 1.1 pk free(v, M_DEVBUF);
190 1.1 pk
191 1.1 pk /*
192 1.1 pk * Return any excess items allocated during periods of
193 1.1 pk * contention.
194 1.1 pk */
195 1.1 pk while (pp->pr_freecount > pp->pr_hiwat) {
196 1.1 pk pi = pp->pr_freelist;
197 1.1 pk pp->pr_freelist = pi->pi_next;
198 1.1 pk pp->pr_freecount--;
199 1.1 pk free(pi, M_DEVBUF);
200 1.1 pk }
201 1.1 pk }
202 1.1 pk simple_unlock(&pp->pr_lock);
203 1.1 pk }
204 1.1 pk
205 1.1 pk /*
206 1.1 pk * Add N items to the pool
207 1.1 pk */
208 1.1 pk int
209 1.2 pk pool_prime(pp, n, storage)
210 1.1 pk struct pool *pp;
211 1.1 pk int n;
212 1.2 pk caddr_t storage;
213 1.1 pk {
214 1.1 pk struct pool_item *pi;
215 1.2 pk caddr_t cp = storage;
216 1.2 pk
217 1.2 pk #ifdef DIAGNOSTIC
218 1.2 pk if (storage && !(pp->pr_flags & PR_STATIC))
219 1.2 pk panic("pool_prime: static");
220 1.2 pk /* !storage && static caught below */
221 1.2 pk #endif
222 1.1 pk
223 1.1 pk simple_lock(&pp->pr_lock);
224 1.1 pk pp->pr_hiwat += n;
225 1.1 pk while (n--) {
226 1.2 pk if (pp->pr_flags & PR_STATIC) {
227 1.2 pk pi = (struct pool_item *)cp;
228 1.2 pk cp = (caddr_t)ALIGN(cp + pp->pr_size);
229 1.2 pk } else
230 1.2 pk pi = malloc(pp->pr_size, pp->pr_mtype, M_NOWAIT);
231 1.2 pk
232 1.1 pk if (pi == NULL) {
233 1.1 pk simple_unlock(&pp->pr_lock);
234 1.1 pk return (ENOMEM);
235 1.1 pk }
236 1.1 pk
237 1.1 pk pi->pi_next = pp->pr_freelist;
238 1.1 pk pp->pr_freelist = pi;
239 1.1 pk pp->pr_freecount++;
240 1.1 pk }
241 1.1 pk simple_unlock(&pp->pr_lock);
242 1.1 pk return (0);
243 1.1 pk }
244