rf_alloclist.c revision 1.8 1 /* $NetBSD: rf_alloclist.c,v 1.8 2001/11/13 07:11:12 lukem 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.8 2001/11/13 07:11:12 lukem 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_ERRORMSG3("Unable to init mutex file %s line %d rc=%d\n", __FILE__,
91 __LINE__, rc);
92 return (rc);
93 }
94 al_free_list = NULL;
95 fl_hit_count = fl_miss_count = al_free_list_count = 0;
96 rc = rf_ShutdownCreate(listp, rf_ShutdownAllocList, NULL);
97 if (rc) {
98 RF_ERRORMSG3("Unable to add to shutdown list file %s line %d rc=%d\n",
99 __FILE__, __LINE__, rc);
100 rf_mutex_destroy(&alist_mutex);
101 return (rc);
102 }
103 return (0);
104 }
105
106
107 /* we expect the lists to have at most one or two elements, so we're willing
108 * to search for the end. If you ever observe the lists growing longer,
109 * increase POINTERS_PER_ALLOC_LIST_ELEMENT.
110 */
111 void
112 rf_real_AddToAllocList(l, p, size, lockflag)
113 RF_AllocListElem_t *l;
114 void *p;
115 int size;
116 int lockflag;
117 {
118 RF_AllocListElem_t *newelem;
119
120 for (; l->next; l = l->next)
121 RF_ASSERT(l->numPointers == RF_POINTERS_PER_ALLOC_LIST_ELEMENT); /* find end of list */
122
123 RF_ASSERT(l->numPointers >= 0 && l->numPointers <= RF_POINTERS_PER_ALLOC_LIST_ELEMENT);
124 if (l->numPointers == RF_POINTERS_PER_ALLOC_LIST_ELEMENT) {
125 newelem = rf_real_MakeAllocList(lockflag);
126 l->next = newelem;
127 l = newelem;
128 }
129 l->pointers[l->numPointers] = p;
130 l->sizes[l->numPointers] = size;
131 l->numPointers++;
132
133 }
134
135
136 /* we use the debug_mem_mutex here because we need to lock it anyway to call free.
137 * this is probably a bug somewhere else in the code, but when I call malloc/free
138 * outside of any lock I have endless trouble with malloc appearing to return the
139 * same pointer twice. Since we have to lock it anyway, we might as well use it
140 * as the lock around the al_free_list. Note that we can't call Free with the
141 * debug_mem_mutex locked.
142 */
143 void
144 rf_FreeAllocList(l)
145 RF_AllocListElem_t *l;
146 {
147 int i;
148 RF_AllocListElem_t *temp, *p;
149
150 for (p = l; p; p = p->next) {
151 RF_ASSERT(p->numPointers >= 0 && p->numPointers <= RF_POINTERS_PER_ALLOC_LIST_ELEMENT);
152 for (i = 0; i < p->numPointers; i++) {
153 RF_ASSERT(p->pointers[i]);
154 RF_Free(p->pointers[i], p->sizes[i]);
155 }
156 }
157 while (l) {
158 temp = l;
159 l = l->next;
160 if (al_free_list_count > RF_AL_FREELIST_MAX) {
161 DO_FREE(temp, sizeof(*temp));
162 } else {
163 temp->next = al_free_list;
164 al_free_list = temp;
165 al_free_list_count++;
166 }
167 }
168 }
169
170 RF_AllocListElem_t *
171 rf_real_MakeAllocList(lockflag)
172 int lockflag;
173 {
174 RF_AllocListElem_t *p;
175
176 if (al_free_list) {
177 fl_hit_count++;
178 p = al_free_list;
179 al_free_list = p->next;
180 al_free_list_count--;
181 } else {
182 fl_miss_count++;
183 RF_Malloc(p, sizeof(RF_AllocListElem_t), (RF_AllocListElem_t *)); /* no allocation locking
184 * in kernel, so this is
185 * fine */
186 }
187 if (p == NULL) {
188 return (NULL);
189 }
190 memset((char *) p, 0, sizeof(RF_AllocListElem_t));
191 return (p);
192 }
193