1 /* $NetBSD: rf_alloclist.c,v 1.3 1999/02/05 00:06:06 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 "rf_types.h" 40 #include "rf_threadstuff.h" 41 #include "rf_alloclist.h" 42 #include "rf_debugMem.h" 43 #include "rf_etimer.h" 44 #include "rf_general.h" 45 #include "rf_shutdown.h" 46 #include "rf_sys.h" 47 48 RF_DECLARE_STATIC_MUTEX(alist_mutex) 49 static unsigned int fl_hit_count, fl_miss_count; 50 51 static RF_AllocListElem_t *al_free_list = NULL; 52 static int al_free_list_count; 53 54 #define RF_AL_FREELIST_MAX 256 55 56 #define DO_FREE(_p,_sz) RF_Free((_p),(_sz)) 57 58 static void rf_ShutdownAllocList(void *); 59 60 static void rf_ShutdownAllocList(ignored) 61 void *ignored; 62 { 63 RF_AllocListElem_t *p, *pt; 64 65 for (p = al_free_list; p;) { 66 pt = p; 67 p = p->next; 68 DO_FREE(pt, sizeof(*pt)); 69 } 70 rf_mutex_destroy(&alist_mutex); 71 /* 72 printf("Alloclist: Free list hit count %lu (%lu %%) miss count %lu (%lu %%)\n", 73 fl_hit_count, (100*fl_hit_count)/(fl_hit_count+fl_miss_count), 74 fl_miss_count, (100*fl_miss_count)/(fl_hit_count+fl_miss_count)); 75 */ 76 } 77 78 int 79 rf_ConfigureAllocList(listp) 80 RF_ShutdownList_t **listp; 81 { 82 int rc; 83 84 rc = rf_mutex_init(&alist_mutex); 85 if (rc) { 86 RF_ERRORMSG3("Unable to init mutex file %s line %d rc=%d\n", __FILE__, 87 __LINE__, rc); 88 return (rc); 89 } 90 al_free_list = NULL; 91 fl_hit_count = fl_miss_count = al_free_list_count = 0; 92 rc = rf_ShutdownCreate(listp, rf_ShutdownAllocList, NULL); 93 if (rc) { 94 RF_ERRORMSG3("Unable to add to shutdown list file %s line %d rc=%d\n", 95 __FILE__, __LINE__, rc); 96 rf_mutex_destroy(&alist_mutex); 97 return (rc); 98 } 99 return (0); 100 } 101 102 103 /* we expect the lists to have at most one or two elements, so we're willing 104 * to search for the end. If you ever observe the lists growing longer, 105 * increase POINTERS_PER_ALLOC_LIST_ELEMENT. 106 */ 107 void 108 rf_real_AddToAllocList(l, p, size, lockflag) 109 RF_AllocListElem_t *l; 110 void *p; 111 int size; 112 int lockflag; 113 { 114 RF_AllocListElem_t *newelem; 115 116 for (; l->next; l = l->next) 117 RF_ASSERT(l->numPointers == RF_POINTERS_PER_ALLOC_LIST_ELEMENT); /* find end of list */ 118 119 RF_ASSERT(l->numPointers >= 0 && l->numPointers <= RF_POINTERS_PER_ALLOC_LIST_ELEMENT); 120 if (l->numPointers == RF_POINTERS_PER_ALLOC_LIST_ELEMENT) { 121 newelem = rf_real_MakeAllocList(lockflag); 122 l->next = newelem; 123 l = newelem; 124 } 125 l->pointers[l->numPointers] = p; 126 l->sizes[l->numPointers] = size; 127 l->numPointers++; 128 129 } 130 131 132 /* we use the debug_mem_mutex here because we need to lock it anyway to call free. 133 * this is probably a bug somewhere else in the code, but when I call malloc/free 134 * outside of any lock I have endless trouble with malloc appearing to return the 135 * same pointer twice. Since we have to lock it anyway, we might as well use it 136 * as the lock around the al_free_list. Note that we can't call Free with the 137 * debug_mem_mutex locked. 138 */ 139 void 140 rf_FreeAllocList(l) 141 RF_AllocListElem_t *l; 142 { 143 int i; 144 RF_AllocListElem_t *temp, *p; 145 146 for (p = l; p; p = p->next) { 147 RF_ASSERT(p->numPointers >= 0 && p->numPointers <= RF_POINTERS_PER_ALLOC_LIST_ELEMENT); 148 for (i = 0; i < p->numPointers; i++) { 149 RF_ASSERT(p->pointers[i]); 150 RF_Free(p->pointers[i], p->sizes[i]); 151 } 152 } 153 while (l) { 154 temp = l; 155 l = l->next; 156 if (al_free_list_count > RF_AL_FREELIST_MAX) { 157 DO_FREE(temp, sizeof(*temp)); 158 } else { 159 temp->next = al_free_list; 160 al_free_list = temp; 161 al_free_list_count++; 162 } 163 } 164 } 165 166 RF_AllocListElem_t * 167 rf_real_MakeAllocList(lockflag) 168 int lockflag; 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 bzero((char *) p, sizeof(RF_AllocListElem_t)); 187 return (p); 188 } 189