1/* $NetBSD: rf_alloclist.c,v 1.29 2021/07/23 00:54:45 oster Exp $ */ 2/* 3 * Copyright (c) 1995 Carnegie-Mellon University. 4 * All rights reserved. 5 * 6 * Author: Mark Holland 7 * 8 * Permission to use, copy, modify and distribute this software and 9 * its documentation is hereby granted, provided that both the copyright 10 * notice and this permission notice appear in all copies of the 11 * software, derivative works or modified versions, and any portions 12 * thereof, and that both notices appear in supporting documentation. 13 * 14 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" 15 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND 16 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. 17 * 18 * Carnegie Mellon requests users of this software to return to 19 * 20 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU 21 * School of Computer Science 22 * Carnegie Mellon University 23 * Pittsburgh PA 15213-3890 24 * 25 * any improvements or extensions that they make and grant Carnegie the 26 * rights to redistribute these changes. 27 */ 28 29/**************************************************************************** 30 * 31 * Alloclist.c -- code to manipulate allocation lists 32 * 33 * an allocation list is just a list of AllocListElem structures. Each 34 * such structure contains a fixed-size array of pointers. Calling 35 * FreeAList() causes each pointer to be freed. 36 * 37 ***************************************************************************/ 38 39#include <sys/cdefs.h> 40__KERNEL_RCSID(0, "$NetBSD: rf_alloclist.c,v 1.29 2021/07/23 00:54:45 oster Exp $"); 41 42#include <dev/raidframe/raidframevar.h> 43 44#include "rf_options.h" 45#include "rf_threadstuff.h" 46#include "rf_alloclist.h" 47#include "rf_debugMem.h" 48#include "rf_etimer.h" 49#include "rf_general.h" 50#include "rf_shutdown.h" 51#include "rf_netbsd.h" 52 53#include <sys/pool.h> 54 55#define RF_AL_FREELIST_MAX 256 56#define RF_AL_FREELIST_MIN 64 57 58static void rf_ShutdownAllocList(void *); 59 60static void rf_ShutdownAllocList(void *ignored) 61{ 62 pool_destroy(&rf_alloclist_pool); 63} 64 65int 66rf_ConfigureAllocList(RF_ShutdownList_t **listp) 67{ 68 69 pool_init(&rf_alloclist_pool, sizeof(RF_AllocListElem_t), 0, 0, 0, "rf_alloclist_pl", NULL, IPL_BIO); 70 pool_sethiwat(&rf_alloclist_pool, RF_AL_FREELIST_MAX); 71 pool_prime(&rf_alloclist_pool, RF_AL_FREELIST_MIN); 72 73 rf_ShutdownCreate(listp, rf_ShutdownAllocList, NULL); 74 75 return (0); 76} 77 78 79/* we expect the lists to have at most one or two elements, so we're willing 80 * to search for the end. If you ever observe the lists growing longer, 81 * increase POINTERS_PER_ALLOC_LIST_ELEMENT. 82 */ 83void 84rf_real_AddToAllocList(RF_AllocListElem_t *l, void *p, int size) 85{ 86 RF_AllocListElem_t *newelem; 87 88 for (; l->next; l = l->next) 89 RF_ASSERT(l->numPointers == RF_POINTERS_PER_ALLOC_LIST_ELEMENT); /* find end of list */ 90 91 RF_ASSERT(l->numPointers >= 0 && l->numPointers <= RF_POINTERS_PER_ALLOC_LIST_ELEMENT); 92 if (l->numPointers == RF_POINTERS_PER_ALLOC_LIST_ELEMENT) { 93 newelem = rf_real_MakeAllocList(); 94 l->next = newelem; 95 l = newelem; 96 } 97 l->pointers[l->numPointers] = p; 98 l->sizes[l->numPointers] = size; 99 l->numPointers++; 100 101} 102 103void 104rf_FreeAllocList(RF_AllocListElem_t *l) 105{ 106 int i; 107 RF_AllocListElem_t *temp, *p; 108 109 for (p = l; p; p = p->next) { 110 RF_ASSERT(p->numPointers >= 0 && 111 p->numPointers <= RF_POINTERS_PER_ALLOC_LIST_ELEMENT); 112 for (i = 0; i < p->numPointers; i++) { 113 RF_ASSERT(p->pointers[i]); 114 RF_Free(p->pointers[i], p->sizes[i]); 115 } 116 } 117 while (l) { 118 temp = l; 119 l = l->next; 120 pool_put(&rf_alloclist_pool, temp); 121 } 122} 123 124RF_AllocListElem_t * 125rf_real_MakeAllocList(void) 126{ 127 return pool_get(&rf_alloclist_pool, PR_WAITOK | PR_ZERO); 128} 129