GCOV - Varnish Cache


/*-
 * Copyright (c) 2011 Varnish Software AS
 * All rights reserved.
 *
 * Author: Poul-Henning Kamp <phk@phk.freebsd.dk>
 *
 * SPDX-License-Identifier: BSD-2-Clause
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 * Generic memory pool
 */

#include "config.h"

#include "cache_int.h"

#include <stdio.h>
#include <stdlib.h>

#include "vtim.h"

#include "VSC_mempool.h"

struct memitem {
        unsigned                        magic;
#define MEMITEM_MAGIC                   0x42e55401
        unsigned                        size;
        VTAILQ_ENTRY(memitem)           list;
        vtim_real                       touched;        // XXX -> mono?
};

VTAILQ_HEAD(memhead_s, memitem);

struct mempool {
        unsigned                        magic;
#define MEMPOOL_MAGIC                   0x37a75a8d
        char                            name[12];
        struct memhead_s                list;
        struct memhead_s                surplus;
        struct lock                     mtx;
        volatile struct poolparam       *param;
        volatile unsigned               *cur_size;
        uint64_t                        live;
        struct vsc_seg                  *vsc_seg;
        struct VSC_mempool              *vsc;
        unsigned                        n_pool;
        pthread_t                       thread;
        vtim_real                       t_now;  // XXX -> mono?
        int                             self_destruct;
};

/*---------------------------------------------------------------------
 */

static struct memitem *
mpl_alloc(const struct mempool *mpl)
{
        unsigned tsz;
        struct memitem *mi;

        CHECK_OBJ_NOTNULL(mpl, MEMPOOL_MAGIC);
        tsz = *mpl->cur_size;
        mi = calloc(1, tsz);
        AN(mi);
        mi->magic = MEMITEM_MAGIC;
        mi->size = tsz;
        mpl->vsc->sz_wanted = tsz;
        mpl->vsc->sz_actual = tsz - sizeof *mi;
        return (mi);
}

/*---------------------------------------------------------------------
 * Pool-guard
 *   Attempt to keep number of free items in pool inside bounds with
 *   minimum locking activity, and keep an eye on items at the tail
 *   of the list not getting too old.
 */

static void *
mpl_guard(void *priv)
{
        struct mempool *mpl;
        struct memitem *mi = NULL;
        vtim_dur v_statevariable_(mpl_slp);
        vtim_real last = 0;

        CAST_OBJ_NOTNULL(mpl, priv, MEMPOOL_MAGIC);
        THR_SetName(mpl->name);
        THR_Init();
        mpl_slp = 0.15; // random
        while (1) {
                VTIM_sleep(mpl_slp);
                mpl_slp = 0.814;        // random
                mpl->t_now = VTIM_real();

                if (mi != NULL && (mpl->n_pool > mpl->param->max_pool ||
                    mi->size < *mpl->cur_size)) {
                        CHECK_OBJ(mi, MEMITEM_MAGIC);
                        FREE_OBJ(mi);
                }

                if (mi == NULL && mpl->n_pool < mpl->param->min_pool)
                        mi = mpl_alloc(mpl);

                if (mpl->n_pool < mpl->param->min_pool && mi != NULL) {
                        /* can do */
                } else if (mpl->n_pool > mpl->param->max_pool && mi == NULL) {
                        /* can do */
                } else if (!VTAILQ_EMPTY(&mpl->surplus)) {
                        /* can do */
                } else if (last + .1 * mpl->param->max_age < mpl->t_now) {
                        /* should do */
                } else if (mpl->self_destruct) {
                        /* can do */
                } else {
                        continue;       /* nothing to do */
                }

                mpl_slp = 0.314;        // random

                if (Lck_Trylock(&mpl->mtx))
                        continue;

                if (mpl->self_destruct) {
                        AZ(mpl->live);
                        while (1) {
                                if (mi == NULL) {
                                        mi = VTAILQ_FIRST(&mpl->list);
                                        if (mi != NULL) {
                                                mpl->vsc->pool = --mpl->n_pool;
                                                VTAILQ_REMOVE(&mpl->list,
                                                    mi, list);
                                        }
                                }
                                if (mi == NULL) {
                                        mi = VTAILQ_FIRST(&mpl->surplus);
                                        if (mi != NULL)
                                                VTAILQ_REMOVE(&mpl->surplus,
                                                    mi, list);
                                }
                                if (mi == NULL)
                                        break;
                                CHECK_OBJ(mi, MEMITEM_MAGIC);
                                FREE_OBJ(mi);
                        }
                        VSC_mempool_Destroy(&mpl->vsc_seg);
                        Lck_Unlock(&mpl->mtx);
                        Lck_Delete(&mpl->mtx);
                        FREE_OBJ(mpl);
                        break;
                }

                if (mpl->n_pool < mpl->param->min_pool &&
                    mi != NULL && mi->size >= *mpl->cur_size) {
                        CHECK_OBJ(mi, MEMITEM_MAGIC);
                        mpl->vsc->pool = ++mpl->n_pool;
                        mi->touched = mpl->t_now;
                        VTAILQ_INSERT_HEAD(&mpl->list, mi, list);
                        mi = NULL;
                        mpl_slp = .01;  // random

                }
                if (mpl->n_pool > mpl->param->max_pool && mi == NULL) {
                        mi = VTAILQ_FIRST(&mpl->list);
                        CHECK_OBJ_NOTNULL(mi, MEMITEM_MAGIC);
                        mpl->vsc->pool = --mpl->n_pool;
                        mpl->vsc->surplus++;
                        VTAILQ_REMOVE(&mpl->list, mi, list);
                        mpl_slp = .01;  // random
                }
                if (mi == NULL) {
                        mi = VTAILQ_FIRST(&mpl->surplus);
                        if (mi != NULL) {
                                CHECK_OBJ(mi, MEMITEM_MAGIC);
                                VTAILQ_REMOVE(&mpl->surplus, mi, list);
                                mpl_slp = .01;  // random
                        }
                }
                if (mi == NULL && mpl->n_pool > mpl->param->min_pool) {
                        mi = VTAILQ_LAST(&mpl->list, memhead_s);
                        CHECK_OBJ_NOTNULL(mi, MEMITEM_MAGIC);
                        if (mi->touched + mpl->param->max_age < mpl->t_now) {
                                mpl->vsc->pool = --mpl->n_pool;
                                mpl->vsc->timeout++;
                                VTAILQ_REMOVE(&mpl->list, mi, list);
                                mpl_slp = .01;  // random
                        } else {
                                mi = NULL;
                                last = mpl->t_now;
                        }
                } else if (mpl->n_pool <= mpl->param->min_pool) {
                        last = mpl->t_now;
                }

                Lck_Unlock(&mpl->mtx);

                if (mi != NULL) {
                        CHECK_OBJ(mi, MEMITEM_MAGIC);
                        FREE_OBJ(mi);
                }
        }
        return (NULL);
}

/*---------------------------------------------------------------------
 * Create a new memory pool, and start the guard thread for it.
 */

struct mempool *
MPL_New(const char *name,
    volatile struct poolparam *pp, volatile unsigned *cur_size)
{
        struct mempool *mpl;

        ALLOC_OBJ(mpl, MEMPOOL_MAGIC);
        AN(mpl);
        bprintf(mpl->name, "MPL_%s", name);
        mpl->param = pp;
        mpl->cur_size = cur_size;
        VTAILQ_INIT(&mpl->list);
        VTAILQ_INIT(&mpl->surplus);
        Lck_New(&mpl->mtx, lck_mempool);
        /* XXX: prealloc min_pool */
        mpl->vsc = VSC_mempool_New(NULL, &mpl->vsc_seg, mpl->name + 4);
        AN(mpl->vsc);
        PTOK(pthread_create(&mpl->thread, NULL, mpl_guard, mpl));
        PTOK(pthread_detach(mpl->thread));
        return (mpl);
}

/*---------------------------------------------------------------------
 * Destroy a memory pool.  There must be no live items, and we cheat
 * and leave all the hard work to the guard thread.
 */

void
MPL_Destroy(struct mempool **mpp)
{
        struct mempool *mpl;

        TAKE_OBJ_NOTNULL(mpl, mpp, MEMPOOL_MAGIC);
        Lck_Lock(&mpl->mtx);
        AZ(mpl->live);
        mpl->self_destruct = 1;
        Lck_Unlock(&mpl->mtx);
}

/*---------------------------------------------------------------------
 */

void *
MPL_Get(struct mempool *mpl, unsigned *size)
{
        struct memitem *mi;

        CHECK_OBJ_NOTNULL(mpl, MEMPOOL_MAGIC);
        AN(size);

        Lck_Lock(&mpl->mtx);

        mpl->vsc->allocs++;
        mpl->vsc->live = ++mpl->live;

        do {
                mi = VTAILQ_FIRST(&mpl->list);
                if (mi == NULL) {
                        mpl->vsc->randry++;
                        break;
                }
                mpl->vsc->pool = --mpl->n_pool;
                CHECK_OBJ(mi, MEMITEM_MAGIC);
                VTAILQ_REMOVE(&mpl->list, mi, list);
                if (mi->size < *mpl->cur_size) {
                        mpl->vsc->toosmall++;
                        VTAILQ_INSERT_HEAD(&mpl->surplus, mi, list);
                        mi = NULL;
                } else {
                        mpl->vsc->recycle++;
                }
        } while (mi == NULL);

        Lck_Unlock(&mpl->mtx);

        if (mi == NULL)
                mi = mpl_alloc(mpl);
        *size = mi->size - sizeof *mi;

        CHECK_OBJ(mi, MEMITEM_MAGIC);
        /* Throw away sizeof info for FlexeLint: */
        return ((void *)(uintptr_t)(mi + 1));
}

void
MPL_Free(struct mempool *mpl, void *item)
{
        struct memitem *mi;

        CHECK_OBJ_NOTNULL(mpl, MEMPOOL_MAGIC);
        AN(item);

        mi = (void*)((uintptr_t)item - sizeof(*mi));
        CHECK_OBJ_NOTNULL(mi, MEMITEM_MAGIC);
        memset(item, 0, mi->size - sizeof *mi);

        Lck_Lock(&mpl->mtx);

        mpl->vsc->frees++;
        mpl->vsc->live = --mpl->live;

        if (mi->size < *mpl->cur_size) {
                mpl->vsc->toosmall++;
                VTAILQ_INSERT_HEAD(&mpl->surplus, mi, list);
        } else {
                mpl->vsc->pool = ++mpl->n_pool;
                mi->touched = mpl->t_now;
                VTAILQ_INSERT_HEAD(&mpl->list, mi, list);
        }

        Lck_Unlock(&mpl->mtx);
}

void
MPL_AssertSane(const void *item)
{
        struct memitem *mi;
        mi = (void*)((uintptr_t)item - sizeof(*mi));
        CHECK_OBJ_NOTNULL(mi, MEMITEM_MAGIC);
}

		vinyl-cache/bin/vinyld/cache/cache_mempool.c
0		/*-
1		* Copyright (c) 2011 Varnish Software AS
2		* All rights reserved.
3		*
4		* Author: Poul-Henning Kamp <phk@phk.freebsd.dk>
5		*
6		* SPDX-License-Identifier: BSD-2-Clause
7		*
8		* Redistribution and use in source and binary forms, with or without
9		* modification, are permitted provided that the following conditions
10		* are met:
11		* 1. Redistributions of source code must retain the above copyright
12		* notice, this list of conditions and the following disclaimer.
13		* 2. Redistributions in binary form must reproduce the above copyright
14		* notice, this list of conditions and the following disclaimer in the
15		* documentation and/or other materials provided with the distribution.
16		*
17		* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18		* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19		* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20		* ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
21		* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22		* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23		* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24		* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25		* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26		* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27		* SUCH DAMAGE.
28		*
29		* Generic memory pool
30		*/
31
32		#include "config.h"
33
34		#include "cache_int.h"
35
36		#include <stdio.h>
37		#include <stdlib.h>
38
39		#include "vtim.h"
40
41		#include "VSC_mempool.h"
42
43		struct memitem {
44		unsigned magic;
45		#define MEMITEM_MAGIC 0x42e55401
46		unsigned size;
47		VTAILQ_ENTRY(memitem) list;
48		vtim_real touched; // XXX -> mono?
49		};
50
51		VTAILQ_HEAD(memhead_s, memitem);
52
53		struct mempool {
54		unsigned magic;
55		#define MEMPOOL_MAGIC 0x37a75a8d
56		char name[12];
57		struct memhead_s list;
58		struct memhead_s surplus;
59		struct lock mtx;
60		volatile struct poolparam *param;
61		volatile unsigned *cur_size;
62		uint64_t live;
63		struct vsc_seg *vsc_seg;
64		struct VSC_mempool *vsc;
65		unsigned n_pool;
66		pthread_t thread;
67		vtim_real t_now; // XXX -> mono?
68		int self_destruct;
69		};
70
71		/*---------------------------------------------------------------------
72		*/
73
74		static struct memitem *
75	195632	mpl_alloc(const struct mempool *mpl)
76		{
77		unsigned tsz;
78		struct memitem *mi;
79
80	195632	CHECK_OBJ_NOTNULL(mpl, MEMPOOL_MAGIC);
81	195632	tsz = *mpl->cur_size;
82	195632	mi = calloc(1, tsz);
83	195632	AN(mi);
84	195632	mi->magic = MEMITEM_MAGIC;
85	195632	mi->size = tsz;
86	195632	mpl->vsc->sz_wanted = tsz;
87	195632	mpl->vsc->sz_actual = tsz - sizeof *mi;
88	195632	return (mi);
89		}
90
91		/*---------------------------------------------------------------------
92		* Pool-guard
93		* Attempt to keep number of free items in pool inside bounds with
94		* minimum locking activity, and keep an eye on items at the tail
95		* of the list not getting too old.
96		*/
97
98		static void *
99	16	mpl_guard(void *priv)
100		{
101		struct mempool *mpl;
102	16	struct memitem *mi = NULL;
103		vtim_dur v_statevariable_(mpl_slp);
104	16	vtim_real last = 0;
105
106	16	CAST_OBJ_NOTNULL(mpl, priv, MEMPOOL_MAGIC);
107	16	THR_SetName(mpl->name);
108	16	THR_Init();
109	16	mpl_slp = 0.15; // random
110	209404	while (1) {
111	258044	VTIM_sleep(mpl_slp);
112	258044	mpl_slp = 0.814; // random
113	258044	mpl->t_now = VTIM_real();
114
115	258044	if (mi != NULL && (mpl->n_pool > mpl->param->max_pool \|\|
116	3	mi->size < *mpl->cur_size)) {
117	0	CHECK_OBJ(mi, MEMITEM_MAGIC);
118	0	FREE_OBJ(mi);
119	0	}
120
121	258036	if (mi == NULL && mpl->n_pool < mpl->param->min_pool)
122	195126	mi = mpl_alloc(mpl);
123
124	258036	if (mpl->n_pool < mpl->param->min_pool && mi != NULL) {
125		/* can do */
126	258036	} else if (mpl->n_pool > mpl->param->max_pool && mi == NULL) {
127		/* can do */
128	62418	} else if (!VTAILQ_EMPTY(&mpl->surplus)) {
129		/* can do */
130	62324	} else if (last + .1 * mpl->param->max_age < mpl->t_now) {
131		/* should do */
132	62320	} else if (mpl->self_destruct) {
133		/* can do */
134	0	} else {
135	48616	continue; /* nothing to do */
136		}
137
138	209420	mpl_slp = 0.314; // random
139
140	209420	if (Lck_Trylock(&mpl->mtx))
141	24	continue;
142
143	209404	if (mpl->self_destruct) {
144	16	AZ(mpl->live);
145	184	while (1) {
146	184	if (mi == NULL) {
147	183	mi = VTAILQ_FIRST(&mpl->list);
148	183	if (mi != NULL) {
149	167	mpl->vsc->pool = --mpl->n_pool;
150	167	VTAILQ_REMOVE(&mpl->list,
151		mi, list);
152	167	}
153	183	}
154	184	if (mi == NULL) {
155	16	mi = VTAILQ_FIRST(&mpl->surplus);
156	16	if (mi != NULL)
157	0	VTAILQ_REMOVE(&mpl->surplus,
158		mi, list);
159	16	}
160	184	if (mi == NULL)
161	16	break;
162	168	CHECK_OBJ(mi, MEMITEM_MAGIC);
163	168	FREE_OBJ(mi);
164		}
165	16	VSC_mempool_Destroy(&mpl->vsc_seg);
166	16	Lck_Unlock(&mpl->mtx);
167	16	Lck_Delete(&mpl->mtx);
168	16	FREE_OBJ(mpl);
169	16	break;
170		}
171
172	404977	if (mpl->n_pool < mpl->param->min_pool &&
173	195590	mi != NULL && mi->size >= *mpl->cur_size) {
174	195588	CHECK_OBJ(mi, MEMITEM_MAGIC);
175	195588	mpl->vsc->pool = ++mpl->n_pool;
176	195588	mi->touched = mpl->t_now;
177	195588	VTAILQ_INSERT_HEAD(&mpl->list, mi, list);
178	195588	mi = NULL;
179	195588	mpl_slp = .01; // random
180
181	195588	}
182	209388	if (mpl->n_pool > mpl->param->max_pool && mi == NULL) {
183	93	mi = VTAILQ_FIRST(&mpl->list);
184	93	CHECK_OBJ_NOTNULL(mi, MEMITEM_MAGIC);
185	93	mpl->vsc->pool = --mpl->n_pool;
186	93	mpl->vsc->surplus++;
187	93	VTAILQ_REMOVE(&mpl->list, mi, list);
188	93	mpl_slp = .01; // random
189	93	}
190	209388	if (mi == NULL) {
191	209303	mi = VTAILQ_FIRST(&mpl->surplus);
192	209303	if (mi != NULL) {
193	4	CHECK_OBJ(mi, MEMITEM_MAGIC);
194	4	VTAILQ_REMOVE(&mpl->surplus, mi, list);
195	4	mpl_slp = .01; // random
196	4	}
197	209303	}
198	209388	if (mi == NULL && mpl->n_pool > mpl->param->min_pool) {
199	2246	mi = VTAILQ_LAST(&mpl->list, memhead_s);
200	2246	CHECK_OBJ_NOTNULL(mi, MEMITEM_MAGIC);
201	2246	if (mi->touched + mpl->param->max_age < mpl->t_now) {
202	657	mpl->vsc->pool = --mpl->n_pool;
203	657	mpl->vsc->timeout++;
204	657	VTAILQ_REMOVE(&mpl->list, mi, list);
205	657	mpl_slp = .01; // random
206	657	} else {
207	1589	mi = NULL;
208	1589	last = mpl->t_now;
209		}
210	209388	} else if (mpl->n_pool <= mpl->param->min_pool) {
211	207070	last = mpl->t_now;
212	207070	}
213
214	209388	Lck_Unlock(&mpl->mtx);
215
216	209388	if (mi != NULL) {
217	755	CHECK_OBJ(mi, MEMITEM_MAGIC);
218	755	FREE_OBJ(mi);
219	755	}
220		}
221	16	return (NULL);
222		}
223
224		/*---------------------------------------------------------------------
225		* Create a new memory pool, and start the guard thread for it.
226		*/
227
228		struct mempool *
229	19284	MPL_New(const char *name,
230		volatile struct poolparam pp, volatile unsigned cur_size)
231		{
232		struct mempool *mpl;
233
234	19284	ALLOC_OBJ(mpl, MEMPOOL_MAGIC);
235	19284	AN(mpl);
236	19284	bprintf(mpl->name, "MPL_%s", name);
237	19284	mpl->param = pp;
238	19284	mpl->cur_size = cur_size;
239	19284	VTAILQ_INIT(&mpl->list);
240	19284	VTAILQ_INIT(&mpl->surplus);
241	19284	Lck_New(&mpl->mtx, lck_mempool);
242		/* XXX: prealloc min_pool */
243	19284	mpl->vsc = VSC_mempool_New(NULL, &mpl->vsc_seg, mpl->name + 4);
244	19284	AN(mpl->vsc);
245	19284	PTOK(pthread_create(&mpl->thread, NULL, mpl_guard, mpl));
246	19284	PTOK(pthread_detach(mpl->thread));
247	19284	return (mpl);
248		}
249
250		/*---------------------------------------------------------------------
251		* Destroy a memory pool. There must be no live items, and we cheat
252		* and leave all the hard work to the guard thread.
253		*/
254
255		void
256	16	MPL_Destroy(struct mempool **mpp)
257		{
258		struct mempool *mpl;
259
260	16	TAKE_OBJ_NOTNULL(mpl, mpp, MEMPOOL_MAGIC);
261	16	Lck_Lock(&mpl->mtx);
262	16	AZ(mpl->live);
263	16	mpl->self_destruct = 1;
264	16	Lck_Unlock(&mpl->mtx);
265	16	}
266
267		/*---------------------------------------------------------------------
268		*/
269
270		void *
271	31259	MPL_Get(struct mempool mpl, unsigned size)
272		{
273		struct memitem *mi;
274
275	31259	CHECK_OBJ_NOTNULL(mpl, MEMPOOL_MAGIC);
276	31259	AN(size);
277
278	31259	Lck_Lock(&mpl->mtx);
279
280	31259	mpl->vsc->allocs++;
281	31259	mpl->vsc->live = ++mpl->live;
282
283	31259	do {
284	31264	mi = VTAILQ_FIRST(&mpl->list);
285	31264	if (mi == NULL) {
286	42	mpl->vsc->randry++;
287	42	break;
288		}
289	31222	mpl->vsc->pool = --mpl->n_pool;
290	31222	CHECK_OBJ(mi, MEMITEM_MAGIC);
291	31222	VTAILQ_REMOVE(&mpl->list, mi, list);
292	31222	if (mi->size < *mpl->cur_size) {
293	4	mpl->vsc->toosmall++;
294	4	VTAILQ_INSERT_HEAD(&mpl->surplus, mi, list);
295	4	mi = NULL;
296	4	} else {
297	31218	mpl->vsc->recycle++;
298		}
299	31222	} while (mi == NULL);
300
301	31259	Lck_Unlock(&mpl->mtx);
302
303	31259	if (mi == NULL)
304	42	mi = mpl_alloc(mpl);
305	31259	size = mi->size - sizeof mi;
306
307	31259	CHECK_OBJ(mi, MEMITEM_MAGIC);
308		/* Throw away sizeof info for FlexeLint: */
309	31259	return ((void *)(uintptr_t)(mi + 1));
310		}
311
312		void
313	31166	MPL_Free(struct mempool mpl, void item)
314		{
315		struct memitem *mi;
316
317	31166	CHECK_OBJ_NOTNULL(mpl, MEMPOOL_MAGIC);
318	31166	AN(item);
319
320	31166	mi = (void)((uintptr_t)item - sizeof(mi));
321	31166	CHECK_OBJ_NOTNULL(mi, MEMITEM_MAGIC);
322	31166	memset(item, 0, mi->size - sizeof *mi);
323
324	31166	Lck_Lock(&mpl->mtx);
325
326	31166	mpl->vsc->frees++;
327	31166	mpl->vsc->live = --mpl->live;
328
329	31166	if (mi->size < *mpl->cur_size) {
330	0	mpl->vsc->toosmall++;
331	0	VTAILQ_INSERT_HEAD(&mpl->surplus, mi, list);
332	0	} else {
333	31166	mpl->vsc->pool = ++mpl->n_pool;
334	31166	mi->touched = mpl->t_now;
335	31166	VTAILQ_INSERT_HEAD(&mpl->list, mi, list);
336		}
337
338	31166	Lck_Unlock(&mpl->mtx);
339	31166	}
340
341		void
342	12542	MPL_AssertSane(const void *item)
343		{
344		struct memitem *mi;
345	12542	mi = (void)((uintptr_t)item - sizeof(mi));
346	12542	CHECK_OBJ_NOTNULL(mi, MEMITEM_MAGIC);
347	12542	}