uvm_stat.h revision 1.3 1 1.3 chs /* $NetBSD: uvm_stat.h,v 1.3 1998/02/07 02:16:52 chs Exp $ */
2 1.1 mrg
3 1.1 mrg /*
4 1.1 mrg * XXXCDC: "ROUGH DRAFT" QUALITY UVM PRE-RELEASE FILE!
5 1.1 mrg * >>>USE AT YOUR OWN RISK, WORK IS NOT FINISHED<<<
6 1.1 mrg */
7 1.1 mrg /*
8 1.1 mrg *
9 1.1 mrg * Copyright (c) 1997 Charles D. Cranor and Washington University.
10 1.1 mrg * All rights reserved.
11 1.1 mrg *
12 1.1 mrg * Redistribution and use in source and binary forms, with or without
13 1.1 mrg * modification, are permitted provided that the following conditions
14 1.1 mrg * are met:
15 1.1 mrg * 1. Redistributions of source code must retain the above copyright
16 1.1 mrg * notice, this list of conditions and the following disclaimer.
17 1.1 mrg * 2. Redistributions in binary form must reproduce the above copyright
18 1.1 mrg * notice, this list of conditions and the following disclaimer in the
19 1.1 mrg * documentation and/or other materials provided with the distribution.
20 1.1 mrg * 3. All advertising materials mentioning features or use of this software
21 1.1 mrg * must display the following acknowledgement:
22 1.1 mrg * This product includes software developed by Charles D. Cranor and
23 1.1 mrg * Washington University.
24 1.1 mrg * 4. The name of the author may not be used to endorse or promote products
25 1.1 mrg * derived from this software without specific prior written permission.
26 1.1 mrg *
27 1.1 mrg * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
28 1.1 mrg * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
29 1.1 mrg * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
30 1.1 mrg * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
31 1.1 mrg * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
32 1.1 mrg * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
33 1.1 mrg * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
34 1.1 mrg * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
35 1.1 mrg * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
36 1.1 mrg * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 1.1 mrg */
38 1.1 mrg /*
39 1.1 mrg * uvm_stat: monitor what is going on with uvm (or whatever)
40 1.1 mrg */
41 1.1 mrg
42 1.1 mrg /*
43 1.1 mrg * counters [XXX: maybe replace event counters with this]
44 1.1 mrg */
45 1.1 mrg
46 1.1 mrg #define UVMCNT_MASK 0xf /* rest are private */
47 1.1 mrg #define UVMCNT_CNT 0 /* normal counter */
48 1.1 mrg #define UVMCNT_DEV 1 /* device event counter */
49 1.1 mrg
50 1.1 mrg struct uvm_cnt {
51 1.1 mrg int c; /* the value */
52 1.1 mrg int t; /* type */
53 1.1 mrg struct uvm_cnt *next; /* global list of cnts */
54 1.1 mrg char *name; /* counter name */
55 1.1 mrg void *p; /* private data */
56 1.1 mrg };
57 1.1 mrg
58 1.1 mrg extern struct uvm_cnt *uvm_cnt_head;
59 1.1 mrg
60 1.1 mrg /*
61 1.3 chs * counter operations. assume spl is set ok.
62 1.1 mrg */
63 1.1 mrg
64 1.1 mrg #define UVMCNT_INIT(CNT,TYP,VAL,NAM,PRIV) { \
65 1.1 mrg CNT.c = VAL; \
66 1.1 mrg CNT.t = TYP; \
67 1.1 mrg CNT.next = uvm_cnt_head; \
68 1.1 mrg uvm_cnt_head = &CNT; \
69 1.1 mrg CNT.name = NAM; \
70 1.1 mrg CNT.p = PRIV; \
71 1.1 mrg }
72 1.1 mrg
73 1.1 mrg #define UVMCNT_SET(C,V) { \
74 1.1 mrg (C).c = (V); \
75 1.1 mrg }
76 1.1 mrg
77 1.1 mrg #define UVMCNT_ADD(C,V) { \
78 1.1 mrg (C).c += (V); \
79 1.1 mrg }
80 1.1 mrg
81 1.1 mrg #define UVMCNT_INCR(C) UVMCNT_ADD(C,1)
82 1.1 mrg #define UVMCNT_DECR(C) UVMCNT_ADD(C,-1)
83 1.1 mrg
84 1.1 mrg
85 1.1 mrg /*
86 1.1 mrg * history/tracing
87 1.1 mrg */
88 1.1 mrg
89 1.1 mrg #if !defined(UVM_NOHIST)
90 1.1 mrg #define UVMHIST
91 1.1 mrg #endif
92 1.1 mrg
93 1.1 mrg struct uvm_history_ent {
94 1.1 mrg struct timeval tv; /* time stamp */
95 1.1 mrg char *fmt; /* printf format */
96 1.1 mrg char *fn; /* function name */
97 1.1 mrg u_long call; /* function call number */
98 1.1 mrg u_long v[4]; /* values */
99 1.1 mrg };
100 1.1 mrg
101 1.1 mrg struct uvm_history {
102 1.1 mrg int n; /* number of entries */
103 1.1 mrg int f; /* next free one */
104 1.1 mrg #if NCPU > 1
105 1.1 mrg simple_lock_data_t l; /* lock on this history */
106 1.1 mrg #endif /* NCPU */
107 1.1 mrg struct uvm_history_ent *e; /* the malloc'd entries */
108 1.1 mrg };
109 1.1 mrg
110 1.1 mrg #ifndef UVMHIST
111 1.1 mrg #define UVMHIST_DECL(NAME)
112 1.1 mrg #define UVMHIST_INIT(NAME,N)
113 1.1 mrg #define UVMHIST_INIT_STATIC(NAME,BUF)
114 1.1 mrg #define UVMHIST_LOG(NAME,FMT,A,B,C,D)
115 1.1 mrg #define UVMHIST_CALLED(NAME)
116 1.1 mrg #define UVMHIST_FUNC(FNAME)
117 1.1 mrg #define uvmhist_dump(NAME)
118 1.1 mrg #else
119 1.1 mrg #define UVMHIST_DECL(NAME) struct uvm_history NAME
120 1.1 mrg
121 1.1 mrg #define UVMHIST_INIT(NAME,N) { \
122 1.1 mrg (NAME).n = (N); \
123 1.1 mrg (NAME).f = 0; \
124 1.1 mrg simple_lock_init(&(NAME).l); \
125 1.1 mrg (NAME).e = (struct uvm_history_ent *) \
126 1.1 mrg malloc(sizeof(struct uvm_history_ent) * (N), M_TEMP, \
127 1.1 mrg M_WAITOK); \
128 1.1 mrg bzero((NAME).e, sizeof(struct uvm_history_ent) * (N)); \
129 1.1 mrg }
130 1.1 mrg
131 1.1 mrg #define UVMHIST_INIT_STATIC(NAME,BUF) { \
132 1.1 mrg (NAME).n = sizeof(BUF) / sizeof(struct uvm_history_ent); \
133 1.1 mrg (NAME).f = 0; \
134 1.1 mrg simple_lock_init(&(NAME).l); \
135 1.1 mrg (NAME).e = (struct uvm_history_ent *) (BUF); \
136 1.1 mrg bzero((NAME).e, sizeof(struct uvm_history_ent) * (NAME).n); \
137 1.1 mrg }
138 1.1 mrg
139 1.1 mrg extern int cold;
140 1.1 mrg
141 1.1 mrg #if defined(UVMHIST_PRINT)
142 1.1 mrg #define UVMHIST_PRINTNOW(E) uvmhist_print(E); DELAY(100000);
143 1.1 mrg #else
144 1.1 mrg #define UVMHIST_PRINTNOW(E) /* nothing */
145 1.1 mrg #endif
146 1.1 mrg
147 1.1 mrg #define UVMHIST_LOG(NAME,FMT,A,B,C,D) { \
148 1.1 mrg register int i, s = splhigh(); \
149 1.1 mrg simple_lock(&(NAME).l); \
150 1.1 mrg i = (NAME).f; \
151 1.1 mrg (NAME).f = (i + 1) % (NAME).n; \
152 1.1 mrg simple_unlock(&(NAME).l); \
153 1.1 mrg splx(s); \
154 1.1 mrg if (!cold) microtime(&(NAME).e[i].tv); \
155 1.1 mrg (NAME).e[i].fmt = (FMT); \
156 1.1 mrg (NAME).e[i].fn = _uvmhist_name; \
157 1.1 mrg (NAME).e[i].call = _uvmhist_call; \
158 1.1 mrg (NAME).e[i].v[0] = (u_long)(A); \
159 1.1 mrg (NAME).e[i].v[1] = (u_long)(B); \
160 1.1 mrg (NAME).e[i].v[2] = (u_long)(C); \
161 1.1 mrg (NAME).e[i].v[3] = (u_long)(D); \
162 1.1 mrg UVMHIST_PRINTNOW(&((NAME).e[i])); \
163 1.1 mrg }
164 1.1 mrg
165 1.1 mrg #define UVMHIST_CALLED(NAME) \
166 1.1 mrg { int s = splhigh(); simple_lock(&(NAME).l); \
167 1.1 mrg _uvmhist_call = _uvmhist_cnt++; \
168 1.1 mrg simple_unlock(&(NAME).l); splx(s); } \
169 1.1 mrg UVMHIST_LOG(NAME,"called!", 0, 0, 0, 0);
170 1.1 mrg
171 1.1 mrg #define UVMHIST_FUNC(FNAME) \
172 1.1 mrg static int _uvmhist_cnt = 0; \
173 1.1 mrg static char *_uvmhist_name = FNAME; \
174 1.1 mrg int _uvmhist_call;
175 1.1 mrg
176 1.1 mrg static __inline void uvmhist_print __P((struct uvm_history_ent *));
177 1.1 mrg /* shut up GCC */
178 1.1 mrg
179 1.1 mrg static __inline void uvmhist_print(e)
180 1.1 mrg
181 1.1 mrg struct uvm_history_ent *e;
182 1.1 mrg {
183 1.1 mrg printf("%06ld.%06ld ", e->tv.tv_sec, e->tv.tv_usec);
184 1.1 mrg printf("%s#%ld: ", e->fn, e->call);
185 1.1 mrg printf(e->fmt, e->v[0], e->v[1], e->v[2], e->v[3]);
186 1.1 mrg printf("\n");
187 1.1 mrg }
188 1.1 mrg
189 1.1 mrg #endif /* UVMHIST */
190