1 /* $NetBSD: rf_alloclist.c,v 1.11 2002/09/23 03:53:14 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.11 2002/09/23 03:53:14 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 RF_DECLARE_STATIC_MUTEX(alist_mutex) 53 static unsigned int fl_hit_count, fl_miss_count; 54 55 static RF_AllocListElem_t *al_free_list = NULL; 56 static int al_free_list_count; 57 58 #define RF_AL_FREELIST_MAX 256 59 60 #define DO_FREE(_p,_sz) RF_Free((_p),(_sz)) 61 62 static void rf_ShutdownAllocList(void *); 63 64 static void rf_ShutdownAllocList(ignored) 65 void *ignored; 66 { 67 RF_AllocListElem_t *p, *pt; 68 69 for (p = al_free_list; p;) { 70 pt = p; 71 p = p->next; 72 DO_FREE(pt, sizeof(*pt)); 73 } 74 rf_mutex_destroy(&alist_mutex); 75 /* 76 printf("Alloclist: Free list hit count %lu (%lu %%) miss count %lu (%lu %%)\n", 77 fl_hit_count, (100*fl_hit_count)/(fl_hit_count+fl_miss_count), 78 fl_miss_count, (100*fl_miss_count)/(fl_hit_count+fl_miss_count)); 79 */ 80 } 81 82 int 83 rf_ConfigureAllocList(listp) 84 RF_ShutdownList_t **listp; 85 { 86 int rc; 87 88 rc = rf_mutex_init(&alist_mutex); 89 if (rc) { 90 rf_print_unable_to_init_mutex( __FILE__, __LINE__, rc); 91 return (rc); 92 } 93 al_free_list = NULL; 94 fl_hit_count = fl_miss_count = al_free_list_count = 0; 95 rc = rf_ShutdownCreate(listp, rf_ShutdownAllocList, NULL); 96 if (rc) { 97 rf_print_unable_to_add_shutdown( __FILE__, __LINE__, rc); 98 rf_mutex_destroy(&alist_mutex); 99 return (rc); 100 } 101 return (0); 102 } 103 104 105 /* we expect the lists to have at most one or two elements, so we're willing 106 * to search for the end. If you ever observe the lists growing longer, 107 * increase POINTERS_PER_ALLOC_LIST_ELEMENT. 108 */ 109 void 110 rf_real_AddToAllocList(l, p, size) 111 RF_AllocListElem_t *l; 112 void *p; 113 int size; 114 { 115 RF_AllocListElem_t *newelem; 116 117 for (; l->next; l = l->next) 118 RF_ASSERT(l->numPointers == RF_POINTERS_PER_ALLOC_LIST_ELEMENT); /* find end of list */ 119 120 RF_ASSERT(l->numPointers >= 0 && l->numPointers <= RF_POINTERS_PER_ALLOC_LIST_ELEMENT); 121 if (l->numPointers == RF_POINTERS_PER_ALLOC_LIST_ELEMENT) { 122 newelem = rf_real_MakeAllocList(); 123 l->next = newelem; 124 l = newelem; 125 } 126 l->pointers[l->numPointers] = p; 127 l->sizes[l->numPointers] = size; 128 l->numPointers++; 129 130 } 131 132 133 /* we use the debug_mem_mutex here because we need to lock it anyway to call free. 134 * this is probably a bug somewhere else in the code, but when I call malloc/free 135 * outside of any lock I have endless trouble with malloc appearing to return the 136 * same pointer twice. Since we have to lock it anyway, we might as well use it 137 * as the lock around the al_free_list. Note that we can't call Free with the 138 * debug_mem_mutex locked. 139 */ 140 void 141 rf_FreeAllocList(l) 142 RF_AllocListElem_t *l; 143 { 144 int i; 145 RF_AllocListElem_t *temp, *p; 146 147 for (p = l; p; p = p->next) { 148 RF_ASSERT(p->numPointers >= 0 && p->numPointers <= RF_POINTERS_PER_ALLOC_LIST_ELEMENT); 149 for (i = 0; i < p->numPointers; i++) { 150 RF_ASSERT(p->pointers[i]); 151 RF_Free(p->pointers[i], p->sizes[i]); 152 } 153 } 154 while (l) { 155 temp = l; 156 l = l->next; 157 if (al_free_list_count > RF_AL_FREELIST_MAX) { 158 DO_FREE(temp, sizeof(*temp)); 159 } else { 160 temp->next = al_free_list; 161 al_free_list = temp; 162 al_free_list_count++; 163 } 164 } 165 } 166 167 RF_AllocListElem_t * 168 rf_real_MakeAllocList() 169 { 170 RF_AllocListElem_t *p; 171 172 if (al_free_list) { 173 fl_hit_count++; 174 p = al_free_list; 175 al_free_list = p->next; 176 al_free_list_count--; 177 } else { 178 fl_miss_count++; 179 RF_Malloc(p, sizeof(RF_AllocListElem_t), (RF_AllocListElem_t *)); /* no allocation locking 180 * in kernel, so this is 181 * fine */ 182 } 183 if (p == NULL) { 184 return (NULL); 185 } 186 memset((char *) p, 0, sizeof(RF_AllocListElem_t)); 187 return (p); 188 } 189