2 * Copyright (c) 1997, 1998
3 * Nan Yang Computer Services Limited. All rights reserved.
5 * This software is distributed under the so-called ``Berkeley
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by Nan Yang Computer
20 * 4. Neither the name of the Company nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * This software is provided ``as is'', and any express or implied
25 * warranties, including, but not limited to, the implied warranties of
26 * merchantability and fitness for a particular purpose are disclaimed.
27 * In no event shall the company or contributors be liable for any
28 * direct, indirect, incidental, special, exemplary, or consequential
29 * damages (including, but not limited to, procurement of substitute
30 * goods or services; loss of use, data, or profits; or business
31 * interruption) however caused and on any theory of liability, whether
32 * in contract, strict liability, or tort (including negligence or
33 * otherwise) arising in any way out of the use of this software, even if
34 * advised of the possibility of such damage.
36 * $Id: vinummemory.c,v 1.28 2001/05/23 23:04:06 grog Exp grog $
40 #include <dev/vinum/vinumhdr.h>
43 #undef longjmp /* this was defined as LongJmp */
45 #include <dev/vinum/request.h>
46 extern struct rqinfo rqinfo[];
47 extern struct rqinfo *rqip;
48 int rqinfo_size = RQINFO_SIZE; /* for debugger */
50 #ifdef __i386__ /* check for validity */
52 LongJmp(jmp_buf buf, int retval)
55 * longjmp is not documented, not even jmp_buf.
56 * This is what's in i386/i386/support.s:
59 * movl (%eax),%ebx restore ebx
60 * movl 4(%eax),%esp restore esp
61 * movl 8(%eax),%ebp restore ebp
62 * movl 12(%eax),%esi restore esi
63 * movl 16(%eax),%edi restore edi
64 * movl 20(%eax),%edx get rta
65 * movl %edx,(%esp) put in return frame
66 * xorl %eax,%eax return(1);
70 * from which we deduce the structure of jmp_buf:
81 struct JmpBuf *jb = (struct JmpBuf *) buf;
83 if ((jb->jb_esp < 0xc0000000)
84 || (jb->jb_ebp < 0xc0000000)
85 || (jb->jb_eip < 0xc0000000))
86 panic("Invalid longjmp");
91 #define LongJmp longjmp /* just use the kernel function */
95 /* find the base name of a path name */
99 char *f = rindex(file, '/'); /* chop off dirname if present */
104 return ++f; /* skip the / */
108 expand_table(void **table, int oldsize, int newsize)
110 if (newsize > oldsize) {
115 temp = (int *) Malloc(newsize); /* allocate a new table */
116 CHECKALLOC(temp, "vinum: Can't expand table\n");
117 bzero((char *) temp, newsize); /* clean it all out */
118 if (*table != NULL) { /* already something there, */
119 bcopy((char *) *table, (char *) temp, oldsize); /* copy it to the old table */
127 #ifdef VINUMDEBUG /* XXX debug */
128 #define MALLOCENTRIES 16384
130 int highwater = 0; /* highest index ever allocated */
131 struct mc malloced[MALLOCENTRIES];
134 int freecount = FREECOUNT; /* for debugger */
136 struct mc freeinfo[FREECOUNT];
139 static int mallocseq = 0;
142 MMalloc(int size, char *file, int line)
148 if (malloccount >= MALLOCENTRIES) { /* too many */
149 log(LOG_ERR, "vinum: can't allocate table space to trace memory allocation");
150 return 0; /* can't continue */
152 /* Wait for malloc if we can */
153 result = malloc(size,
155 curthread->td_intr_nesting_level == 0 ? M_WAITOK : M_NOWAIT);
157 log(LOG_ERR, "vinum: can't allocate %d bytes from %s:%d\n", size, file, line);
160 for (i = 0; i < malloccount; i++) {
161 if (((result + size) > malloced[i].address)
162 && (result < malloced[i].address + malloced[i].size)) /* overlap */
163 Debugger("Malloc overlap");
166 char *f = basename(file);
169 total_malloced += size;
170 microtime(&malloced[i].time);
171 malloced[i].seq = mallocseq++;
172 malloced[i].size = size;
173 malloced[i].line = line;
174 malloced[i].address = result;
175 bcopy(f, malloced[i].file, min(strlen(f), MCFILENAMELEN - 1));
176 malloced[i].file[MCFILENAMELEN - 1] = '\0';
178 if (malloccount > highwater)
179 highwater = malloccount;
186 FFree(void *mem, char *file, int line)
192 for (i = 0; i < malloccount; i++) {
193 if ((caddr_t) mem == malloced[i].address) { /* found it */
194 bzero(mem, malloced[i].size); /* XXX */
197 total_malloced -= malloced[i].size;
198 if (debug & DEBUG_MEMFREE) { /* keep track of recent frees */
199 char *f = rindex(file, '/'); /* chop off dirname if present */
204 f++; /* skip the / */
206 microtime(&freeinfo[lastfree].time);
207 freeinfo[lastfree].seq = malloced[i].seq;
208 freeinfo[lastfree].size = malloced[i].size;
209 freeinfo[lastfree].line = line;
210 freeinfo[lastfree].address = mem;
211 bcopy(f, freeinfo[lastfree].file, min(strlen(f), MCFILENAMELEN - 1));
212 freeinfo[lastfree].file[MCFILENAMELEN - 1] = '\0';
213 if (++lastfree == FREECOUNT)
216 if (i < malloccount) /* more coming after */
217 bcopy(&malloced[i + 1], &malloced[i], (malloccount - i) * sizeof(struct mc));
224 "Freeing unallocated data at 0x%p from %s, line %d\n",
232 vinum_meminfo(caddr_t data)
234 struct meminfo *m = (struct meminfo *) data;
236 m->mallocs = malloccount;
237 m->total_malloced = total_malloced;
238 m->malloced = malloced;
239 m->highwater = highwater;
243 vinum_mallocinfo(caddr_t data)
245 struct mc *m = (struct mc *) data;
246 unsigned int ent = m->seq; /* index of entry to return */
248 if (ent >= malloccount)
250 m->address = malloced[ent].address;
251 m->size = malloced[ent].size;
252 m->line = malloced[ent].line;
253 m->seq = malloced[ent].seq;
254 bcopy(malloced[ent].file, m->file, MCFILENAMELEN);
259 * return the nth request trace buffer entry. This
260 * is indexed back from the current entry (which
264 vinum_rqinfo(caddr_t data)
266 struct rqinfo *rq = (struct rqinfo *) data;
267 int ent = *(int *) data; /* 1st word is index */
268 int lastent = rqip - rqinfo; /* entry number of current entry */
270 if (ent >= RQINFO_SIZE) /* out of the table */
272 if ((ent = lastent - ent - 1) < 0)
273 ent += RQINFO_SIZE; /* roll over backwards */
274 bcopy(&rqinfo[ent], rq, sizeof(struct rqinfo));