1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
|
/* $OpenBSD: subr_evcount.c,v 1.2 2004/06/28 01:59:57 deraadt Exp $ */
/*
* Copyright (c) 2004 Artur Grabowski <art@openbsd.org>
* Copyright (c) 2004 Aaron Campbell <aaron@openbsd.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
* THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <sys/param.h>
#include <sys/evcount.h>
#include <sys/timeout.h>
#include <sys/kernel.h>
#include <sys/systm.h>
#include <sys/sysctl.h>
#ifdef __HAVE_EVCOUNT
static TAILQ_HEAD(,evcount) evcount_list;
static struct evcount *evcount_next_sync;
/*
* Standard evcount parents.
*/
struct evcount evcount_intr;
void evcount_timeout(void *);
void evcount_init(void);
void evcount_sync(struct evcount *);
void
evcount_init(void)
{
#ifndef __LP64__
static struct timeout ec_to;
timeout_set(&ec_to, evcount_timeout, &ec_to);
timeout_add(&ec_to, hz);
#endif
TAILQ_INIT(&evcount_list);
evcount_attach(&evcount_intr, "intr", NULL, NULL);
}
void
evcount_attach(ec, name, data, parent)
struct evcount *ec;
const char *name;
void *data;
struct evcount *parent;
{
static int nextid = 0;
if (nextid == 0) {
nextid++; /* start with 1 */
evcount_init();
}
memset(ec, 0, sizeof(*ec));
ec->ec_name = name;
ec->ec_parent = parent;
ec->ec_id = nextid++;
ec->ec_data = data;
TAILQ_INSERT_TAIL(&evcount_list, ec, next);
}
void
evcount_detach(ec)
struct evcount *ec;
{
if (evcount_next_sync == ec)
evcount_next_sync = TAILQ_NEXT(ec, next);
TAILQ_REMOVE(&evcount_list, ec, next);
}
int
evcount_sysctl(name, namelen, oldp, oldlenp, newp, newlen)
int *name;
u_int namelen;
void *oldp;
size_t *oldlenp;
void *newp;
size_t newlen;
{
int error = 0, s, nintr, i;
struct evcount *ec;
u_int64_t count;
if (newp != NULL)
return (EPERM);
if (name[0] != KERN_INTRCNT_NUM) {
if (namelen != 2)
return (ENOTDIR);
if (name[1] < 0)
return (EINVAL);
i = name[1];
} else
i = -1;
nintr = 0;
TAILQ_FOREACH(ec, &evcount_list, next) {
if (ec->ec_parent != &evcount_intr)
continue;
if (nintr++ == i)
break;
}
switch (name[0]) {
case KERN_INTRCNT_NUM:
error = sysctl_rdint(oldp, oldlenp, NULL, nintr);
break;
case KERN_INTRCNT_CNT:
if (ec == NULL)
return (ENOENT);
/* XXX - bogus cast to int, but we can't do better. */
s = splhigh();
count = ec->ec_count;
splx(s);
error = sysctl_rdint(oldp, oldlenp, NULL, (int)count);
break;
case KERN_INTRCNT_NAME:
if (ec == NULL)
return (ENOENT);
error = sysctl_rdstring(oldp, oldlenp, NULL, ec->ec_name);
break;
case KERN_INTRCNT_VECTOR:
if (ec == NULL || ec->ec_data == NULL)
return (ENOENT);
error = sysctl_rdint(oldp, oldlenp, NULL,
*((int *)ec->ec_data));
break;
default:
error = EOPNOTSUPP;
break;
}
return (error);
}
#ifndef __LP64__
/*
* This timeout has to run once in a while for every event counter to
* sync the real 64 bit counter with the 32 bit temporary counter, because
* we cannot atomically increment the 64 bit counter on 32 bit systems.
*/
void
evcount_timeout(void *v)
{
struct timeout *to = v;
int s;
s = splhigh();
if (evcount_next_sync == NULL)
evcount_next_sync = TAILQ_FIRST(&evcount_list);
evcount_sync(evcount_next_sync);
evcount_next_sync = TAILQ_NEXT(evcount_next_sync, next);
splx(s);
timeout_add(to, hz);
}
#endif
void
evcount_sync(struct evcount *ec)
{
#ifndef __LP64__
/* XXX race */
ec->ec_count += ec->ec_count32;
ec->ec_count32 = 0;
#endif
}
#endif /* __HAVE_EVCOUNT */
|
