| 1 | /*- |
| 2 | * SPDX-License-Identifier: BSD-2-Clause |
| 3 | * |
| 4 | * Copyright (c) 2004 Poul-Henning Kamp |
| 5 | * All rights reserved. |
| 6 | * |
| 7 | * Redistribution and use in source and binary forms, with or without |
| 8 | * modification, are permitted provided that the following conditions |
| 9 | * are met: |
| 10 | * 1. Redistributions of source code must retain the above copyright |
| 11 | * notice, this list of conditions and the following disclaimer. |
| 12 | * 2. Redistributions in binary form must reproduce the above copyright |
| 13 | * notice, this list of conditions and the following disclaimer in the |
| 14 | * documentation and/or other materials provided with the distribution. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
| 17 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 20 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 21 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 22 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 23 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 24 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 25 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 26 | * SUCH DAMAGE. |
| 27 | */ |
| 28 | |
| 29 | #ifndef _SYS_UNRHDR_H |
| 30 | #define _SYS_UNRHDR_H |
| 31 | |
| 32 | #include <sys/queue.h> |
| 33 | |
| 34 | struct mtx; |
| 35 | |
| 36 | /* Header element for a unr number space. */ |
| 37 | |
| 38 | struct unrhdr { |
| 39 | 	TAILQ_HEAD(unrhd,unr)	head; |
| 40 | 	u_int			low;	/* Lowest item */ |
| 41 | 	u_int			high;	/* Highest item */ |
| 42 | 	u_int			busy;	/* Count of allocated items */ |
| 43 | 	u_int			alloc;	/* Count of memory allocations */ |
| 44 | 	u_int			first;	/* items in allocated from start */ |
| 45 | 	u_int			last;	/* items free at end */ |
| 46 | 	struct mtx		*mtx; |
| 47 | 	TAILQ_HEAD(unrfr,unr)	ppfree;	/* Items to be freed after mtx |
| 48 | 					 lock dropped */ |
| 49 | }; |
| 50 | |
| 51 | #endif |