Home | History | Annotate | Line # | Download | only in raidframe
rf_alloclist.c revision 1.19 
      1 /*	$NetBSD: rf_alloclist.c,v 1.19 2004/03/05 02:53:55 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 (at) 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.19 2004/03/05 02:53:55 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 
     52 #include <sys/pool.h>
     53 
     54 static struct pool rf_alloclist_pool;
     55 #define RF_AL_FREELIST_MAX 256
     56 #define RF_AL_FREELIST_MIN 64
     57 
     58 static void rf_ShutdownAllocList(void *);
     59 
     60 static void rf_ShutdownAllocList(void *ignored)
     61 {
     62 	pool_destroy(&rf_alloclist_pool);
     63 }
     64 
     65 int
     66 rf_ConfigureAllocList(RF_ShutdownList_t **listp)
     67 {
     68 
     69 	pool_init(&rf_alloclist_pool, sizeof(RF_AllocListElem_t),
     70 		  0, 0, 0, "rf_alloclist_pl", NULL);
     71 	pool_sethiwat(&rf_alloclist_pool, RF_AL_FREELIST_MAX);
     72 	pool_prime(&rf_alloclist_pool, RF_AL_FREELIST_MIN);
     73 	pool_setlowat(&rf_alloclist_pool, RF_AL_FREELIST_MIN);
     74 
     75 
     76 	rf_ShutdownCreate(listp, rf_ShutdownAllocList, NULL);
     77 
     78 	return (0);
     79 }
     80 
     81 
     82 /* we expect the lists to have at most one or two elements, so we're willing
     83  * to search for the end.  If you ever observe the lists growing longer,
     84  * increase POINTERS_PER_ALLOC_LIST_ELEMENT.
     85  */
     86 void
     87 rf_real_AddToAllocList(RF_AllocListElem_t *l, void *p, int size)
     88 {
     89 	RF_AllocListElem_t *newelem;
     90 
     91 	for (; l->next; l = l->next)
     92 		RF_ASSERT(l->numPointers == RF_POINTERS_PER_ALLOC_LIST_ELEMENT);	/* find end of list */
     93 
     94 	RF_ASSERT(l->numPointers >= 0 && l->numPointers <= RF_POINTERS_PER_ALLOC_LIST_ELEMENT);
     95 	if (l->numPointers == RF_POINTERS_PER_ALLOC_LIST_ELEMENT) {
     96 		newelem = rf_real_MakeAllocList();
     97 		l->next = newelem;
     98 		l = newelem;
     99 	}
    100 	l->pointers[l->numPointers] = p;
    101 	l->sizes[l->numPointers] = size;
    102 	l->numPointers++;
    103 
    104 }
    105 
    106 void
    107 rf_FreeAllocList(RF_AllocListElem_t *l)
    108 {
    109 	int     i;
    110 	RF_AllocListElem_t *temp, *p;
    111 
    112 	for (p = l; p; p = p->next) {
    113 		RF_ASSERT(p->numPointers >= 0 &&
    114 			  p->numPointers <= RF_POINTERS_PER_ALLOC_LIST_ELEMENT);
    115 		for (i = 0; i < p->numPointers; i++) {
    116 			RF_ASSERT(p->pointers[i]);
    117 			RF_Free(p->pointers[i], p->sizes[i]);
    118 		}
    119 	}
    120 	while (l) {
    121 		temp = l;
    122 		l = l->next;
    123 		pool_put(&rf_alloclist_pool, temp);
    124 	}
    125 }
    126 
    127 RF_AllocListElem_t *
    128 rf_real_MakeAllocList()
    129 {
    130 	RF_AllocListElem_t *p;
    131 
    132 	p = pool_get(&rf_alloclist_pool, PR_WAITOK);
    133 	memset((char *) p, 0, sizeof(RF_AllocListElem_t));
    134 	return (p);
    135 }
    136