4 * Copyright (c) 2003,2004 The DragonFly Project. All rights reserved.
6 * This code is derived from software contributed to The DragonFly Project
7 * by Matthew Dillon <dillon@backplane.com>
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in
17 * the documentation and/or other materials provided with the
19 * 3. Neither the name of The DragonFly Project nor the names of its
20 * contributors may be used to endorse or promote products derived
21 * from this software without specific, prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
26 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
27 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
28 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
29 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
30 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
31 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
32 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
33 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 #include <sys/param.h>
38 #include <sys/systm.h>
39 #include <sys/kernel.h>
40 #include <sys/slaballoc.h>
42 #include <sys/vmmeter.h>
44 #include <sys/thread.h>
45 #include <sys/globaldata.h>
46 #include <sys/mpipe.h>
48 #include <sys/thread2.h>
50 #define arysize(ary) (sizeof(ary)/sizeof((ary)[0]))
52 static MALLOC_DEFINE(M_MPIPEARY, "MPipe Array", "Auxillary MPIPE structure");
55 * Initialize a malloc pipeline for the specified malloc type and allocation
56 * size. Create an array to cache up to nom_count buffers and preallocate
60 mpipe_init(malloc_pipe_t mpipe, malloc_type_t type, int bytes,
62 int mpflags, void (*deconstruct)(struct malloc_pipe *, void *))
69 nmax = 0x7FFF0000; /* some very large number */
72 bzero(mpipe, sizeof(struct malloc_pipe));
75 mpipe->mpflags = mpflags;
76 mpipe->deconstruct = deconstruct;
77 if ((mpflags & MPF_NOZERO) == 0)
78 mpipe->mflags |= M_ZERO;
79 if (mpflags & MPF_INT)
80 mpipe->mflags |= M_USE_RESERVE | M_USE_INTERRUPT_RESERVE;
81 mpipe->ary_count = nnom;
82 mpipe->max_count = nmax;
83 mpipe->array = kmalloc(nnom * sizeof(mpipe->array[0]), M_MPIPEARY,
86 while (mpipe->free_count < nnom) {
87 n = mpipe->free_count;
88 mpipe->array[n] = kmalloc(bytes, mpipe->type, M_WAITOK | mpipe->mflags);
93 lwkt_token_init(&mpipe->token, 1, "mpipe token");
97 * Destroy a previously initialized mpipe. This routine can also safely be
98 * called on an uninitialized mpipe structure if it was zero'd or mpipe_done()
99 * was previously called on it.
102 mpipe_done(malloc_pipe_t mpipe)
107 KKASSERT(mpipe->free_count == mpipe->total_count); /* no outstanding mem */
108 for (n = mpipe->free_count - 1; n >= 0; --n) {
109 buf = mpipe->array[n];
110 mpipe->array[n] = NULL;
111 KKASSERT(buf != NULL);
112 if (mpipe->deconstruct)
113 mpipe->deconstruct(mpipe, buf);
114 kfree(buf, mpipe->type);
116 mpipe->free_count = 0;
117 mpipe->total_count = 0;
119 kfree(mpipe->array, M_MPIPEARY);
123 lwkt_token_uninit(&mpipe->token);
127 * Allocate an entry, nominally non-blocking. The allocation is guarenteed
128 * to return non-NULL up to the nominal count after which it may return NULL.
129 * Note that the implementation is defined to be allowed to block for short
130 * periods of time. Use mpipe_alloc_waitok() to guarentee the allocation.
133 mpipe_alloc_nowait(malloc_pipe_t mpipe)
138 lwkt_gettoken(&mpipe->token);
139 if ((n = mpipe->free_count) != 0) {
141 * Use a free entry if it exists.
144 buf = mpipe->array[n];
145 mpipe->array[n] = NULL; /* sanity check, not absolutely needed */
146 mpipe->free_count = n;
147 } else if (mpipe->total_count >= mpipe->max_count) {
149 * Return NULL if we have hit our limit
154 * Otherwise try to malloc() non-blocking.
156 buf = kmalloc(mpipe->bytes, mpipe->type, M_NOWAIT | mpipe->mflags);
158 ++mpipe->total_count;
160 lwkt_reltoken(&mpipe->token);
165 * Allocate an entry, block until the allocation succeeds. This may cause
166 * us to block waiting for a prior allocation to be freed.
169 mpipe_alloc_waitok(malloc_pipe_t mpipe)
175 lwkt_gettoken(&mpipe->token);
178 if ((n = mpipe->free_count) != 0) {
180 * Use a free entry if it exists.
183 buf = mpipe->array[n];
184 mpipe->array[n] = NULL;
185 mpipe->free_count = n;
188 if (mpipe->total_count >= mpipe->max_count || mfailed) {
190 * Block if we have hit our limit
193 tsleep(mpipe, 0, "mpipe1", 0);
197 * Otherwise try to malloc() non-blocking. If that fails loop to
198 * recheck, and block instead of trying to malloc() again.
200 buf = kmalloc(mpipe->bytes, mpipe->type, M_NOWAIT | mpipe->mflags);
202 ++mpipe->total_count;
207 lwkt_reltoken(&mpipe->token);
212 * Free an entry, unblock any waiters. Allow NULL.
215 mpipe_free(malloc_pipe_t mpipe, void *buf)
222 lwkt_gettoken(&mpipe->token);
223 if ((n = mpipe->free_count) < mpipe->ary_count) {
225 * Free slot available in free array (LIFO)
227 mpipe->array[n] = buf;
229 if ((mpipe->mpflags & (MPF_CACHEDATA|MPF_NOZERO)) == 0)
230 bzero(buf, mpipe->bytes);
231 lwkt_reltoken(&mpipe->token);
234 * Wakeup anyone blocked in mpipe_alloc_*().
236 if (mpipe->pending) {
242 * All the free slots are full, free the buffer directly.
244 --mpipe->total_count;
245 KKASSERT(mpipe->total_count >= mpipe->free_count);
246 if (mpipe->deconstruct)
247 mpipe->deconstruct(mpipe, buf);
248 lwkt_reltoken(&mpipe->token);
249 kfree(buf, mpipe->type);