| @@ -1,1328 +1,1344 @@ | | | @@ -1,1328 +1,1344 @@ |
1 | /* $NetBSD: kern_tc.c,v 1.46 2013/09/14 20:52:43 martin Exp $ */ | | 1 | /* $NetBSD: kern_tc.c,v 1.47 2017/06/09 01:16:33 chs Exp $ */ |
2 | | | 2 | |
3 | /*- | | 3 | /*- |
4 | * Copyright (c) 2008, 2009 The NetBSD Foundation, Inc. | | 4 | * Copyright (c) 2008, 2009 The NetBSD Foundation, Inc. |
5 | * All rights reserved. | | 5 | * All rights reserved. |
6 | * | | 6 | * |
7 | * This code is derived from software contributed to The NetBSD Foundation | | 7 | * This code is derived from software contributed to The NetBSD Foundation |
8 | * by Andrew Doran. | | 8 | * by Andrew Doran. |
9 | * | | 9 | * |
10 | * Redistribution and use in source and binary forms, with or without | | 10 | * Redistribution and use in source and binary forms, with or without |
11 | * modification, are permitted provided that the following conditions | | 11 | * modification, are permitted provided that the following conditions |
12 | * are met: | | 12 | * are met: |
13 | * 1. Redistributions of source code must retain the above copyright | | 13 | * 1. Redistributions of source code must retain the above copyright |
14 | * notice, this list of conditions and the following disclaimer. | | 14 | * notice, this list of conditions and the following disclaimer. |
15 | * 2. Redistributions in binary form must reproduce the above copyright | | 15 | * 2. Redistributions in binary form must reproduce the above copyright |
16 | * notice, this list of conditions and the following disclaimer in the | | 16 | * notice, this list of conditions and the following disclaimer in the |
17 | * documentation and/or other materials provided with the distribution. | | 17 | * documentation and/or other materials provided with the distribution. |
18 | * | | 18 | * |
19 | * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS | | 19 | * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS |
20 | * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED | | 20 | * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED |
21 | * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | | 21 | * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
22 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS | | 22 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS |
23 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | | 23 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
24 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | | 24 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
25 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | | 25 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
26 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | | 26 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
27 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | | 27 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
28 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | | 28 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
29 | * POSSIBILITY OF SUCH DAMAGE. | | 29 | * POSSIBILITY OF SUCH DAMAGE. |
30 | */ | | 30 | */ |
31 | | | 31 | |
32 | /*- | | 32 | /*- |
33 | * ---------------------------------------------------------------------------- | | 33 | * ---------------------------------------------------------------------------- |
34 | * "THE BEER-WARE LICENSE" (Revision 42): | | 34 | * "THE BEER-WARE LICENSE" (Revision 42): |
35 | * <phk@FreeBSD.ORG> wrote this file. As long as you retain this notice you | | 35 | * <phk@FreeBSD.ORG> wrote this file. As long as you retain this notice you |
36 | * can do whatever you want with this stuff. If we meet some day, and you think | | 36 | * can do whatever you want with this stuff. If we meet some day, and you think |
37 | * this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp | | 37 | * this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp |
38 | * --------------------------------------------------------------------------- | | 38 | * --------------------------------------------------------------------------- |
39 | */ | | 39 | */ |
40 | | | 40 | |
41 | #include <sys/cdefs.h> | | 41 | #include <sys/cdefs.h> |
42 | /* __FBSDID("$FreeBSD: src/sys/kern/kern_tc.c,v 1.166 2005/09/19 22:16:31 andre Exp $"); */ | | 42 | /* __FBSDID("$FreeBSD: src/sys/kern/kern_tc.c,v 1.166 2005/09/19 22:16:31 andre Exp $"); */ |
43 | __KERNEL_RCSID(0, "$NetBSD: kern_tc.c,v 1.46 2013/09/14 20:52:43 martin Exp $"); | | 43 | __KERNEL_RCSID(0, "$NetBSD: kern_tc.c,v 1.47 2017/06/09 01:16:33 chs Exp $"); |
44 | | | 44 | |
45 | #ifdef _KERNEL_OPT | | 45 | #ifdef _KERNEL_OPT |
46 | #include "opt_ntp.h" | | 46 | #include "opt_ntp.h" |
47 | #endif | | 47 | #endif |
48 | | | 48 | |
49 | #include <sys/param.h> | | 49 | #include <sys/param.h> |
50 | #include <sys/kernel.h> | | 50 | #include <sys/kernel.h> |
51 | #include <sys/reboot.h> /* XXX just to get AB_VERBOSE */ | | 51 | #include <sys/reboot.h> /* XXX just to get AB_VERBOSE */ |
52 | #include <sys/sysctl.h> | | 52 | #include <sys/sysctl.h> |
53 | #include <sys/syslog.h> | | 53 | #include <sys/syslog.h> |
54 | #include <sys/systm.h> | | 54 | #include <sys/systm.h> |
55 | #include <sys/timepps.h> | | 55 | #include <sys/timepps.h> |
56 | #include <sys/timetc.h> | | 56 | #include <sys/timetc.h> |
57 | #include <sys/timex.h> | | 57 | #include <sys/timex.h> |
58 | #include <sys/evcnt.h> | | 58 | #include <sys/evcnt.h> |
59 | #include <sys/kauth.h> | | 59 | #include <sys/kauth.h> |
60 | #include <sys/mutex.h> | | 60 | #include <sys/mutex.h> |
61 | #include <sys/atomic.h> | | 61 | #include <sys/atomic.h> |
62 | #include <sys/xcall.h> | | 62 | #include <sys/xcall.h> |
63 | | | 63 | |
64 | /* | | 64 | /* |
65 | * A large step happens on boot. This constant detects such steps. | | 65 | * A large step happens on boot. This constant detects such steps. |
66 | * It is relatively small so that ntp_update_second gets called enough | | 66 | * It is relatively small so that ntp_update_second gets called enough |
67 | * in the typical 'missed a couple of seconds' case, but doesn't loop | | 67 | * in the typical 'missed a couple of seconds' case, but doesn't loop |
68 | * forever when the time step is large. | | 68 | * forever when the time step is large. |
69 | */ | | 69 | */ |
70 | #define LARGE_STEP 200 | | 70 | #define LARGE_STEP 200 |
71 | | | 71 | |
72 | /* | | 72 | /* |
73 | * Implement a dummy timecounter which we can use until we get a real one | | 73 | * Implement a dummy timecounter which we can use until we get a real one |
74 | * in the air. This allows the console and other early stuff to use | | 74 | * in the air. This allows the console and other early stuff to use |
75 | * time services. | | 75 | * time services. |
76 | */ | | 76 | */ |
77 | | | 77 | |
78 | static u_int | | 78 | static u_int |
79 | dummy_get_timecount(struct timecounter *tc) | | 79 | dummy_get_timecount(struct timecounter *tc) |
80 | { | | 80 | { |
81 | static u_int now; | | 81 | static u_int now; |
82 | | | 82 | |
83 | return (++now); | | 83 | return (++now); |
84 | } | | 84 | } |
85 | | | 85 | |
86 | static struct timecounter dummy_timecounter = { | | 86 | static struct timecounter dummy_timecounter = { |
87 | dummy_get_timecount, 0, ~0u, 1000000, "dummy", -1000000, NULL, NULL, | | 87 | dummy_get_timecount, 0, ~0u, 1000000, "dummy", -1000000, NULL, NULL, |
88 | }; | | 88 | }; |
89 | | | 89 | |
90 | struct timehands { | | 90 | struct timehands { |
91 | /* These fields must be initialized by the driver. */ | | 91 | /* These fields must be initialized by the driver. */ |
92 | struct timecounter *th_counter; /* active timecounter */ | | 92 | struct timecounter *th_counter; /* active timecounter */ |
93 | int64_t th_adjustment; /* frequency adjustment */ | | 93 | int64_t th_adjustment; /* frequency adjustment */ |
94 | /* (NTP/adjtime) */ | | 94 | /* (NTP/adjtime) */ |
95 | u_int64_t th_scale; /* scale factor (counter */ | | 95 | u_int64_t th_scale; /* scale factor (counter */ |
96 | /* tick->time) */ | | 96 | /* tick->time) */ |
97 | u_int64_t th_offset_count; /* offset at last time */ | | 97 | u_int64_t th_offset_count; /* offset at last time */ |
98 | /* update (tc_windup()) */ | | 98 | /* update (tc_windup()) */ |
99 | struct bintime th_offset; /* bin (up)time at windup */ | | 99 | struct bintime th_offset; /* bin (up)time at windup */ |
100 | struct timeval th_microtime; /* cached microtime */ | | 100 | struct timeval th_microtime; /* cached microtime */ |
101 | struct timespec th_nanotime; /* cached nanotime */ | | 101 | struct timespec th_nanotime; /* cached nanotime */ |
102 | /* Fields not to be copied in tc_windup start with th_generation. */ | | 102 | /* Fields not to be copied in tc_windup start with th_generation. */ |
103 | volatile u_int th_generation; /* current genration */ | | 103 | volatile u_int th_generation; /* current genration */ |
104 | struct timehands *th_next; /* next timehand */ | | 104 | struct timehands *th_next; /* next timehand */ |
105 | }; | | 105 | }; |
106 | | | 106 | |
107 | static struct timehands th0; | | 107 | static struct timehands th0; |
108 | static struct timehands th9 = { .th_next = &th0, }; | | 108 | static struct timehands th9 = { .th_next = &th0, }; |
109 | static struct timehands th8 = { .th_next = &th9, }; | | 109 | static struct timehands th8 = { .th_next = &th9, }; |
110 | static struct timehands th7 = { .th_next = &th8, }; | | 110 | static struct timehands th7 = { .th_next = &th8, }; |
111 | static struct timehands th6 = { .th_next = &th7, }; | | 111 | static struct timehands th6 = { .th_next = &th7, }; |
112 | static struct timehands th5 = { .th_next = &th6, }; | | 112 | static struct timehands th5 = { .th_next = &th6, }; |
113 | static struct timehands th4 = { .th_next = &th5, }; | | 113 | static struct timehands th4 = { .th_next = &th5, }; |
114 | static struct timehands th3 = { .th_next = &th4, }; | | 114 | static struct timehands th3 = { .th_next = &th4, }; |
115 | static struct timehands th2 = { .th_next = &th3, }; | | 115 | static struct timehands th2 = { .th_next = &th3, }; |
116 | static struct timehands th1 = { .th_next = &th2, }; | | 116 | static struct timehands th1 = { .th_next = &th2, }; |
117 | static struct timehands th0 = { | | 117 | static struct timehands th0 = { |
118 | .th_counter = &dummy_timecounter, | | 118 | .th_counter = &dummy_timecounter, |
119 | .th_scale = (uint64_t)-1 / 1000000, | | 119 | .th_scale = (uint64_t)-1 / 1000000, |
120 | .th_offset = { .sec = 1, .frac = 0 }, | | 120 | .th_offset = { .sec = 1, .frac = 0 }, |
121 | .th_generation = 1, | | 121 | .th_generation = 1, |
122 | .th_next = &th1, | | 122 | .th_next = &th1, |
123 | }; | | 123 | }; |
124 | | | 124 | |
125 | static struct timehands *volatile timehands = &th0; | | 125 | static struct timehands *volatile timehands = &th0; |
126 | struct timecounter *timecounter = &dummy_timecounter; | | 126 | struct timecounter *timecounter = &dummy_timecounter; |
127 | static struct timecounter *timecounters = &dummy_timecounter; | | 127 | static struct timecounter *timecounters = &dummy_timecounter; |
128 | | | 128 | |
129 | volatile time_t time_second = 1; | | 129 | volatile time_t time_second = 1; |
130 | volatile time_t time_uptime = 1; | | 130 | volatile time_t time_uptime = 1; |
131 | | | 131 | |
132 | static struct bintime timebasebin; | | 132 | static struct bintime timebasebin; |
133 | | | 133 | |
134 | static int timestepwarnings; | | 134 | static int timestepwarnings; |
135 | | | 135 | |
136 | kmutex_t timecounter_lock; | | 136 | kmutex_t timecounter_lock; |
137 | static u_int timecounter_mods; | | 137 | static u_int timecounter_mods; |
138 | static volatile int timecounter_removals = 1; | | 138 | static volatile int timecounter_removals = 1; |
139 | static u_int timecounter_bad; | | 139 | static u_int timecounter_bad; |
140 | | | 140 | |
141 | #ifdef __FreeBSD__ | | 141 | #ifdef __FreeBSD__ |
142 | SYSCTL_INT(_kern_timecounter, OID_AUTO, stepwarnings, CTLFLAG_RW, | | 142 | SYSCTL_INT(_kern_timecounter, OID_AUTO, stepwarnings, CTLFLAG_RW, |
143 | ×tepwarnings, 0, ""); | | 143 | ×tepwarnings, 0, ""); |
144 | #endif /* __FreeBSD__ */ | | 144 | #endif /* __FreeBSD__ */ |
145 | | | 145 | |
146 | /* | | 146 | /* |
147 | * sysctl helper routine for kern.timercounter.hardware | | 147 | * sysctl helper routine for kern.timercounter.hardware |
148 | */ | | 148 | */ |
149 | static int | | 149 | static int |
150 | sysctl_kern_timecounter_hardware(SYSCTLFN_ARGS) | | 150 | sysctl_kern_timecounter_hardware(SYSCTLFN_ARGS) |
151 | { | | 151 | { |
152 | struct sysctlnode node; | | 152 | struct sysctlnode node; |
153 | int error; | | 153 | int error; |
154 | char newname[MAX_TCNAMELEN]; | | 154 | char newname[MAX_TCNAMELEN]; |
155 | struct timecounter *newtc, *tc; | | 155 | struct timecounter *newtc, *tc; |
156 | | | 156 | |
157 | tc = timecounter; | | 157 | tc = timecounter; |
158 | | | 158 | |
159 | strlcpy(newname, tc->tc_name, sizeof(newname)); | | 159 | strlcpy(newname, tc->tc_name, sizeof(newname)); |
160 | | | 160 | |
161 | node = *rnode; | | 161 | node = *rnode; |
162 | node.sysctl_data = newname; | | 162 | node.sysctl_data = newname; |
163 | node.sysctl_size = sizeof(newname); | | 163 | node.sysctl_size = sizeof(newname); |
164 | | | 164 | |
165 | error = sysctl_lookup(SYSCTLFN_CALL(&node)); | | 165 | error = sysctl_lookup(SYSCTLFN_CALL(&node)); |
166 | | | 166 | |
167 | if (error || | | 167 | if (error || |
168 | newp == NULL || | | 168 | newp == NULL || |
169 | strncmp(newname, tc->tc_name, sizeof(newname)) == 0) | | 169 | strncmp(newname, tc->tc_name, sizeof(newname)) == 0) |
170 | return error; | | 170 | return error; |
171 | | | 171 | |
172 | if (l != NULL && (error = kauth_authorize_system(l->l_cred, | | 172 | if (l != NULL && (error = kauth_authorize_system(l->l_cred, |
173 | KAUTH_SYSTEM_TIME, KAUTH_REQ_SYSTEM_TIME_TIMECOUNTERS, newname, | | 173 | KAUTH_SYSTEM_TIME, KAUTH_REQ_SYSTEM_TIME_TIMECOUNTERS, newname, |
174 | NULL, NULL)) != 0) | | 174 | NULL, NULL)) != 0) |
175 | return (error); | | 175 | return (error); |
176 | | | 176 | |
177 | if (!cold) | | 177 | if (!cold) |
178 | mutex_spin_enter(&timecounter_lock); | | 178 | mutex_spin_enter(&timecounter_lock); |
179 | error = EINVAL; | | 179 | error = EINVAL; |
180 | for (newtc = timecounters; newtc != NULL; newtc = newtc->tc_next) { | | 180 | for (newtc = timecounters; newtc != NULL; newtc = newtc->tc_next) { |
181 | if (strcmp(newname, newtc->tc_name) != 0) | | 181 | if (strcmp(newname, newtc->tc_name) != 0) |
182 | continue; | | 182 | continue; |
183 | /* Warm up new timecounter. */ | | 183 | /* Warm up new timecounter. */ |
184 | (void)newtc->tc_get_timecount(newtc); | | 184 | (void)newtc->tc_get_timecount(newtc); |
185 | (void)newtc->tc_get_timecount(newtc); | | 185 | (void)newtc->tc_get_timecount(newtc); |
186 | timecounter = newtc; | | 186 | timecounter = newtc; |
187 | error = 0; | | 187 | error = 0; |
188 | break; | | 188 | break; |
189 | } | | 189 | } |
190 | if (!cold) | | 190 | if (!cold) |
191 | mutex_spin_exit(&timecounter_lock); | | 191 | mutex_spin_exit(&timecounter_lock); |
192 | return error; | | 192 | return error; |
193 | } | | 193 | } |
194 | | | 194 | |
195 | static int | | 195 | static int |
196 | sysctl_kern_timecounter_choice(SYSCTLFN_ARGS) | | 196 | sysctl_kern_timecounter_choice(SYSCTLFN_ARGS) |
197 | { | | 197 | { |
198 | char buf[MAX_TCNAMELEN+48]; | | 198 | char buf[MAX_TCNAMELEN+48]; |
199 | char *where; | | 199 | char *where; |
200 | const char *spc; | | 200 | const char *spc; |
201 | struct timecounter *tc; | | 201 | struct timecounter *tc; |
202 | size_t needed, left, slen; | | 202 | size_t needed, left, slen; |
203 | int error, mods; | | 203 | int error, mods; |
204 | | | 204 | |
205 | if (newp != NULL) | | 205 | if (newp != NULL) |
206 | return (EPERM); | | 206 | return (EPERM); |
207 | if (namelen != 0) | | 207 | if (namelen != 0) |
208 | return (EINVAL); | | 208 | return (EINVAL); |
209 | | | 209 | |
210 | mutex_spin_enter(&timecounter_lock); | | 210 | mutex_spin_enter(&timecounter_lock); |
211 | retry: | | 211 | retry: |
212 | spc = ""; | | 212 | spc = ""; |
213 | error = 0; | | 213 | error = 0; |
214 | needed = 0; | | 214 | needed = 0; |
215 | left = *oldlenp; | | 215 | left = *oldlenp; |
216 | where = oldp; | | 216 | where = oldp; |
217 | for (tc = timecounters; error == 0 && tc != NULL; tc = tc->tc_next) { | | 217 | for (tc = timecounters; error == 0 && tc != NULL; tc = tc->tc_next) { |
218 | if (where == NULL) { | | 218 | if (where == NULL) { |
219 | needed += sizeof(buf); /* be conservative */ | | 219 | needed += sizeof(buf); /* be conservative */ |
220 | } else { | | 220 | } else { |
221 | slen = snprintf(buf, sizeof(buf), "%s%s(q=%d, f=%" PRId64 | | 221 | slen = snprintf(buf, sizeof(buf), "%s%s(q=%d, f=%" PRId64 |
222 | " Hz)", spc, tc->tc_name, tc->tc_quality, | | 222 | " Hz)", spc, tc->tc_name, tc->tc_quality, |
223 | tc->tc_frequency); | | 223 | tc->tc_frequency); |
224 | if (left < slen + 1) | | 224 | if (left < slen + 1) |
225 | break; | | 225 | break; |
226 | mods = timecounter_mods; | | 226 | mods = timecounter_mods; |
227 | mutex_spin_exit(&timecounter_lock); | | 227 | mutex_spin_exit(&timecounter_lock); |
228 | error = copyout(buf, where, slen + 1); | | 228 | error = copyout(buf, where, slen + 1); |
229 | mutex_spin_enter(&timecounter_lock); | | 229 | mutex_spin_enter(&timecounter_lock); |
230 | if (mods != timecounter_mods) { | | 230 | if (mods != timecounter_mods) { |
231 | goto retry; | | 231 | goto retry; |
232 | } | | 232 | } |
233 | spc = " "; | | 233 | spc = " "; |
234 | where += slen; | | 234 | where += slen; |
235 | needed += slen; | | 235 | needed += slen; |
236 | left -= slen; | | 236 | left -= slen; |
237 | } | | 237 | } |
238 | } | | 238 | } |
239 | mutex_spin_exit(&timecounter_lock); | | 239 | mutex_spin_exit(&timecounter_lock); |
240 | | | 240 | |
241 | *oldlenp = needed; | | 241 | *oldlenp = needed; |
242 | return (error); | | 242 | return (error); |
243 | } | | 243 | } |
244 | | | 244 | |
245 | SYSCTL_SETUP(sysctl_timecounter_setup, "sysctl timecounter setup") | | 245 | SYSCTL_SETUP(sysctl_timecounter_setup, "sysctl timecounter setup") |
246 | { | | 246 | { |
247 | const struct sysctlnode *node; | | 247 | const struct sysctlnode *node; |
248 | | | 248 | |
249 | sysctl_createv(clog, 0, NULL, &node, | | 249 | sysctl_createv(clog, 0, NULL, &node, |
250 | CTLFLAG_PERMANENT, | | 250 | CTLFLAG_PERMANENT, |
251 | CTLTYPE_NODE, "timecounter", | | 251 | CTLTYPE_NODE, "timecounter", |
252 | SYSCTL_DESCR("time counter information"), | | 252 | SYSCTL_DESCR("time counter information"), |
253 | NULL, 0, NULL, 0, | | 253 | NULL, 0, NULL, 0, |
254 | CTL_KERN, CTL_CREATE, CTL_EOL); | | 254 | CTL_KERN, CTL_CREATE, CTL_EOL); |
255 | | | 255 | |
256 | if (node != NULL) { | | 256 | if (node != NULL) { |
257 | sysctl_createv(clog, 0, NULL, NULL, | | 257 | sysctl_createv(clog, 0, NULL, NULL, |
258 | CTLFLAG_PERMANENT, | | 258 | CTLFLAG_PERMANENT, |
259 | CTLTYPE_STRING, "choice", | | 259 | CTLTYPE_STRING, "choice", |
260 | SYSCTL_DESCR("available counters"), | | 260 | SYSCTL_DESCR("available counters"), |
261 | sysctl_kern_timecounter_choice, 0, NULL, 0, | | 261 | sysctl_kern_timecounter_choice, 0, NULL, 0, |
262 | CTL_KERN, node->sysctl_num, CTL_CREATE, CTL_EOL); | | 262 | CTL_KERN, node->sysctl_num, CTL_CREATE, CTL_EOL); |
263 | | | 263 | |
264 | sysctl_createv(clog, 0, NULL, NULL, | | 264 | sysctl_createv(clog, 0, NULL, NULL, |
265 | CTLFLAG_PERMANENT|CTLFLAG_READWRITE, | | 265 | CTLFLAG_PERMANENT|CTLFLAG_READWRITE, |
266 | CTLTYPE_STRING, "hardware", | | 266 | CTLTYPE_STRING, "hardware", |
267 | SYSCTL_DESCR("currently active time counter"), | | 267 | SYSCTL_DESCR("currently active time counter"), |
268 | sysctl_kern_timecounter_hardware, 0, NULL, MAX_TCNAMELEN, | | 268 | sysctl_kern_timecounter_hardware, 0, NULL, MAX_TCNAMELEN, |
269 | CTL_KERN, node->sysctl_num, CTL_CREATE, CTL_EOL); | | 269 | CTL_KERN, node->sysctl_num, CTL_CREATE, CTL_EOL); |
270 | | | 270 | |
271 | sysctl_createv(clog, 0, NULL, NULL, | | 271 | sysctl_createv(clog, 0, NULL, NULL, |
272 | CTLFLAG_PERMANENT|CTLFLAG_READWRITE, | | 272 | CTLFLAG_PERMANENT|CTLFLAG_READWRITE, |
273 | CTLTYPE_INT, "timestepwarnings", | | 273 | CTLTYPE_INT, "timestepwarnings", |
274 | SYSCTL_DESCR("log time steps"), | | 274 | SYSCTL_DESCR("log time steps"), |
275 | NULL, 0, ×tepwarnings, 0, | | 275 | NULL, 0, ×tepwarnings, 0, |
276 | CTL_KERN, node->sysctl_num, CTL_CREATE, CTL_EOL); | | 276 | CTL_KERN, node->sysctl_num, CTL_CREATE, CTL_EOL); |
277 | } | | 277 | } |
278 | } | | 278 | } |
279 | | | 279 | |
280 | #ifdef TC_COUNTERS | | 280 | #ifdef TC_COUNTERS |
281 | #define TC_STATS(name) \ | | 281 | #define TC_STATS(name) \ |
282 | static struct evcnt n##name = \ | | 282 | static struct evcnt n##name = \ |
283 | EVCNT_INITIALIZER(EVCNT_TYPE_MISC, NULL, "timecounter", #name); \ | | 283 | EVCNT_INITIALIZER(EVCNT_TYPE_MISC, NULL, "timecounter", #name); \ |
284 | EVCNT_ATTACH_STATIC(n##name) | | 284 | EVCNT_ATTACH_STATIC(n##name) |
285 | TC_STATS(binuptime); TC_STATS(nanouptime); TC_STATS(microuptime); | | 285 | TC_STATS(binuptime); TC_STATS(nanouptime); TC_STATS(microuptime); |
286 | TC_STATS(bintime); TC_STATS(nanotime); TC_STATS(microtime); | | 286 | TC_STATS(bintime); TC_STATS(nanotime); TC_STATS(microtime); |
287 | TC_STATS(getbinuptime); TC_STATS(getnanouptime); TC_STATS(getmicrouptime); | | 287 | TC_STATS(getbinuptime); TC_STATS(getnanouptime); TC_STATS(getmicrouptime); |
288 | TC_STATS(getbintime); TC_STATS(getnanotime); TC_STATS(getmicrotime); | | 288 | TC_STATS(getbintime); TC_STATS(getnanotime); TC_STATS(getmicrotime); |
289 | TC_STATS(setclock); | | 289 | TC_STATS(setclock); |
290 | #define TC_COUNT(var) var.ev_count++ | | 290 | #define TC_COUNT(var) var.ev_count++ |
291 | #undef TC_STATS | | 291 | #undef TC_STATS |
292 | #else | | 292 | #else |
293 | #define TC_COUNT(var) /* nothing */ | | 293 | #define TC_COUNT(var) /* nothing */ |
294 | #endif /* TC_COUNTERS */ | | 294 | #endif /* TC_COUNTERS */ |
295 | | | 295 | |
296 | static void tc_windup(void); | | 296 | static void tc_windup(void); |
297 | | | 297 | |
298 | /* | | 298 | /* |
299 | * Return the difference between the timehands' counter value now and what | | 299 | * Return the difference between the timehands' counter value now and what |
300 | * was when we copied it to the timehands' offset_count. | | 300 | * was when we copied it to the timehands' offset_count. |
301 | */ | | 301 | */ |
302 | static inline u_int | | 302 | static inline u_int |
303 | tc_delta(struct timehands *th) | | 303 | tc_delta(struct timehands *th) |
304 | { | | 304 | { |
305 | struct timecounter *tc; | | 305 | struct timecounter *tc; |
306 | | | 306 | |
307 | tc = th->th_counter; | | 307 | tc = th->th_counter; |
308 | return ((tc->tc_get_timecount(tc) - | | 308 | return ((tc->tc_get_timecount(tc) - |
309 | th->th_offset_count) & tc->tc_counter_mask); | | 309 | th->th_offset_count) & tc->tc_counter_mask); |
310 | } | | 310 | } |
311 | | | 311 | |
312 | /* | | 312 | /* |
313 | * Functions for reading the time. We have to loop until we are sure that | | 313 | * Functions for reading the time. We have to loop until we are sure that |
314 | * the timehands that we operated on was not updated under our feet. See | | 314 | * the timehands that we operated on was not updated under our feet. See |
315 | * the comment in <sys/timevar.h> for a description of these 12 functions. | | 315 | * the comment in <sys/timevar.h> for a description of these 12 functions. |
316 | */ | | 316 | */ |
317 | | | 317 | |
318 | void | | 318 | void |
319 | binuptime(struct bintime *bt) | | 319 | binuptime(struct bintime *bt) |
320 | { | | 320 | { |
321 | struct timehands *th; | | 321 | struct timehands *th; |
322 | lwp_t *l; | | 322 | lwp_t *l; |
323 | u_int lgen, gen; | | 323 | u_int lgen, gen; |
324 | | | 324 | |
325 | TC_COUNT(nbinuptime); | | 325 | TC_COUNT(nbinuptime); |
326 | | | 326 | |
327 | /* | | 327 | /* |
328 | * Provide exclusion against tc_detach(). | | 328 | * Provide exclusion against tc_detach(). |
329 | * | | 329 | * |
330 | * We record the number of timecounter removals before accessing | | 330 | * We record the number of timecounter removals before accessing |
331 | * timecounter state. Note that the LWP can be using multiple | | 331 | * timecounter state. Note that the LWP can be using multiple |
332 | * "generations" at once, due to interrupts (interrupted while in | | 332 | * "generations" at once, due to interrupts (interrupted while in |
333 | * this function). Hardware interrupts will borrow the interrupted | | 333 | * this function). Hardware interrupts will borrow the interrupted |
334 | * LWP's l_tcgen value for this purpose, and can themselves be | | 334 | * LWP's l_tcgen value for this purpose, and can themselves be |
335 | * interrupted by higher priority interrupts. In this case we need | | 335 | * interrupted by higher priority interrupts. In this case we need |
336 | * to ensure that the oldest generation in use is recorded. | | 336 | * to ensure that the oldest generation in use is recorded. |
337 | * | | 337 | * |
338 | * splsched() is too expensive to use, so we take care to structure | | 338 | * splsched() is too expensive to use, so we take care to structure |
339 | * this code in such a way that it is not required. Likewise, we | | 339 | * this code in such a way that it is not required. Likewise, we |
340 | * do not disable preemption. | | 340 | * do not disable preemption. |
341 | * | | 341 | * |
342 | * Memory barriers are also too expensive to use for such a | | 342 | * Memory barriers are also too expensive to use for such a |
343 | * performance critical function. The good news is that we do not | | 343 | * performance critical function. The good news is that we do not |
344 | * need memory barriers for this type of exclusion, as the thread | | 344 | * need memory barriers for this type of exclusion, as the thread |
345 | * updating timecounter_removals will issue a broadcast cross call | | 345 | * updating timecounter_removals will issue a broadcast cross call |
346 | * before inspecting our l_tcgen value (this elides memory ordering | | 346 | * before inspecting our l_tcgen value (this elides memory ordering |
347 | * issues). | | 347 | * issues). |
348 | */ | | 348 | */ |
349 | l = curlwp; | | 349 | l = curlwp; |
350 | lgen = l->l_tcgen; | | 350 | lgen = l->l_tcgen; |
351 | if (__predict_true(lgen == 0)) { | | 351 | if (__predict_true(lgen == 0)) { |
352 | l->l_tcgen = timecounter_removals; | | 352 | l->l_tcgen = timecounter_removals; |
353 | } | | 353 | } |
354 | __insn_barrier(); | | 354 | __insn_barrier(); |
355 | | | 355 | |
356 | do { | | 356 | do { |
357 | th = timehands; | | 357 | th = timehands; |
358 | gen = th->th_generation; | | 358 | gen = th->th_generation; |
359 | *bt = th->th_offset; | | 359 | *bt = th->th_offset; |
360 | bintime_addx(bt, th->th_scale * tc_delta(th)); | | 360 | bintime_addx(bt, th->th_scale * tc_delta(th)); |
361 | } while (gen == 0 || gen != th->th_generation); | | 361 | } while (gen == 0 || gen != th->th_generation); |
362 | | | 362 | |
363 | __insn_barrier(); | | 363 | __insn_barrier(); |
364 | l->l_tcgen = lgen; | | 364 | l->l_tcgen = lgen; |
365 | } | | 365 | } |
366 | | | 366 | |
367 | void | | 367 | void |
368 | nanouptime(struct timespec *tsp) | | 368 | nanouptime(struct timespec *tsp) |
369 | { | | 369 | { |
370 | struct bintime bt; | | 370 | struct bintime bt; |
371 | | | 371 | |
372 | TC_COUNT(nnanouptime); | | 372 | TC_COUNT(nnanouptime); |
373 | binuptime(&bt); | | 373 | binuptime(&bt); |
374 | bintime2timespec(&bt, tsp); | | 374 | bintime2timespec(&bt, tsp); |
375 | } | | 375 | } |
376 | | | 376 | |
377 | void | | 377 | void |
378 | microuptime(struct timeval *tvp) | | 378 | microuptime(struct timeval *tvp) |
379 | { | | 379 | { |
380 | struct bintime bt; | | 380 | struct bintime bt; |
381 | | | 381 | |
382 | TC_COUNT(nmicrouptime); | | 382 | TC_COUNT(nmicrouptime); |
383 | binuptime(&bt); | | 383 | binuptime(&bt); |
384 | bintime2timeval(&bt, tvp); | | 384 | bintime2timeval(&bt, tvp); |
385 | } | | 385 | } |
386 | | | 386 | |
387 | void | | 387 | void |
388 | bintime(struct bintime *bt) | | 388 | bintime(struct bintime *bt) |
389 | { | | 389 | { |
390 | | | 390 | |
391 | TC_COUNT(nbintime); | | 391 | TC_COUNT(nbintime); |
392 | binuptime(bt); | | 392 | binuptime(bt); |
393 | bintime_add(bt, &timebasebin); | | 393 | bintime_add(bt, &timebasebin); |
394 | } | | 394 | } |
395 | | | 395 | |
396 | void | | 396 | void |
397 | nanotime(struct timespec *tsp) | | 397 | nanotime(struct timespec *tsp) |
398 | { | | 398 | { |
399 | struct bintime bt; | | 399 | struct bintime bt; |
400 | | | 400 | |
401 | TC_COUNT(nnanotime); | | 401 | TC_COUNT(nnanotime); |
402 | bintime(&bt); | | 402 | bintime(&bt); |
403 | bintime2timespec(&bt, tsp); | | 403 | bintime2timespec(&bt, tsp); |
404 | } | | 404 | } |
405 | | | 405 | |
406 | void | | 406 | void |
407 | microtime(struct timeval *tvp) | | 407 | microtime(struct timeval *tvp) |
408 | { | | 408 | { |
409 | struct bintime bt; | | 409 | struct bintime bt; |
410 | | | 410 | |
411 | TC_COUNT(nmicrotime); | | 411 | TC_COUNT(nmicrotime); |
412 | bintime(&bt); | | 412 | bintime(&bt); |
413 | bintime2timeval(&bt, tvp); | | 413 | bintime2timeval(&bt, tvp); |
414 | } | | 414 | } |
415 | | | 415 | |
416 | void | | 416 | void |
417 | getbinuptime(struct bintime *bt) | | 417 | getbinuptime(struct bintime *bt) |
418 | { | | 418 | { |
419 | struct timehands *th; | | 419 | struct timehands *th; |
420 | u_int gen; | | 420 | u_int gen; |
421 | | | 421 | |
422 | TC_COUNT(ngetbinuptime); | | 422 | TC_COUNT(ngetbinuptime); |
423 | do { | | 423 | do { |
424 | th = timehands; | | 424 | th = timehands; |
425 | gen = th->th_generation; | | 425 | gen = th->th_generation; |
426 | *bt = th->th_offset; | | 426 | *bt = th->th_offset; |
427 | } while (gen == 0 || gen != th->th_generation); | | 427 | } while (gen == 0 || gen != th->th_generation); |
428 | } | | 428 | } |
429 | | | 429 | |
430 | void | | 430 | void |
431 | getnanouptime(struct timespec *tsp) | | 431 | getnanouptime(struct timespec *tsp) |
432 | { | | 432 | { |
433 | struct timehands *th; | | 433 | struct timehands *th; |
434 | u_int gen; | | 434 | u_int gen; |
435 | | | 435 | |
436 | TC_COUNT(ngetnanouptime); | | 436 | TC_COUNT(ngetnanouptime); |
437 | do { | | 437 | do { |
438 | th = timehands; | | 438 | th = timehands; |
439 | gen = th->th_generation; | | 439 | gen = th->th_generation; |
440 | bintime2timespec(&th->th_offset, tsp); | | 440 | bintime2timespec(&th->th_offset, tsp); |
441 | } while (gen == 0 || gen != th->th_generation); | | 441 | } while (gen == 0 || gen != th->th_generation); |
442 | } | | 442 | } |
443 | | | 443 | |
444 | void | | 444 | void |
445 | getmicrouptime(struct timeval *tvp) | | 445 | getmicrouptime(struct timeval *tvp) |
446 | { | | 446 | { |
447 | struct timehands *th; | | 447 | struct timehands *th; |
448 | u_int gen; | | 448 | u_int gen; |
449 | | | 449 | |
450 | TC_COUNT(ngetmicrouptime); | | 450 | TC_COUNT(ngetmicrouptime); |
451 | do { | | 451 | do { |
452 | th = timehands; | | 452 | th = timehands; |
453 | gen = th->th_generation; | | 453 | gen = th->th_generation; |
454 | bintime2timeval(&th->th_offset, tvp); | | 454 | bintime2timeval(&th->th_offset, tvp); |
455 | } while (gen == 0 || gen != th->th_generation); | | 455 | } while (gen == 0 || gen != th->th_generation); |
456 | } | | 456 | } |
457 | | | 457 | |
458 | void | | 458 | void |
459 | getbintime(struct bintime *bt) | | 459 | getbintime(struct bintime *bt) |
460 | { | | 460 | { |
461 | struct timehands *th; | | 461 | struct timehands *th; |
462 | u_int gen; | | 462 | u_int gen; |
463 | | | 463 | |
464 | TC_COUNT(ngetbintime); | | 464 | TC_COUNT(ngetbintime); |
465 | do { | | 465 | do { |
466 | th = timehands; | | 466 | th = timehands; |
467 | gen = th->th_generation; | | 467 | gen = th->th_generation; |
468 | *bt = th->th_offset; | | 468 | *bt = th->th_offset; |
469 | } while (gen == 0 || gen != th->th_generation); | | 469 | } while (gen == 0 || gen != th->th_generation); |
470 | bintime_add(bt, &timebasebin); | | 470 | bintime_add(bt, &timebasebin); |
471 | } | | 471 | } |
472 | | | 472 | |
473 | void | | 473 | static inline void |
474 | getnanotime(struct timespec *tsp) | | 474 | dogetnanotime(struct timespec *tsp) |
475 | { | | 475 | { |
476 | struct timehands *th; | | 476 | struct timehands *th; |
477 | u_int gen; | | 477 | u_int gen; |
478 | | | 478 | |
479 | TC_COUNT(ngetnanotime); | | 479 | TC_COUNT(ngetnanotime); |
480 | do { | | 480 | do { |
481 | th = timehands; | | 481 | th = timehands; |
482 | gen = th->th_generation; | | 482 | gen = th->th_generation; |
483 | *tsp = th->th_nanotime; | | 483 | *tsp = th->th_nanotime; |
484 | } while (gen == 0 || gen != th->th_generation); | | 484 | } while (gen == 0 || gen != th->th_generation); |
485 | } | | 485 | } |
486 | | | 486 | |
487 | void | | 487 | void |
| | | 488 | getnanotime(struct timespec *tsp) |
| | | 489 | { |
| | | 490 | |
| | | 491 | dogetnanotime(tsp); |
| | | 492 | } |
| | | 493 | |
| | | 494 | void dtrace_getnanotime(struct timespec *tsp); |
| | | 495 | |
| | | 496 | void |
| | | 497 | dtrace_getnanotime(struct timespec *tsp) |
| | | 498 | { |
| | | 499 | |
| | | 500 | dogetnanotime(tsp); |
| | | 501 | } |
| | | 502 | |
| | | 503 | void |
488 | getmicrotime(struct timeval *tvp) | | 504 | getmicrotime(struct timeval *tvp) |
489 | { | | 505 | { |
490 | struct timehands *th; | | 506 | struct timehands *th; |
491 | u_int gen; | | 507 | u_int gen; |
492 | | | 508 | |
493 | TC_COUNT(ngetmicrotime); | | 509 | TC_COUNT(ngetmicrotime); |
494 | do { | | 510 | do { |
495 | th = timehands; | | 511 | th = timehands; |
496 | gen = th->th_generation; | | 512 | gen = th->th_generation; |
497 | *tvp = th->th_microtime; | | 513 | *tvp = th->th_microtime; |
498 | } while (gen == 0 || gen != th->th_generation); | | 514 | } while (gen == 0 || gen != th->th_generation); |
499 | } | | 515 | } |
500 | | | 516 | |
501 | /* | | 517 | /* |
502 | * Initialize a new timecounter and possibly use it. | | 518 | * Initialize a new timecounter and possibly use it. |
503 | */ | | 519 | */ |
504 | void | | 520 | void |
505 | tc_init(struct timecounter *tc) | | 521 | tc_init(struct timecounter *tc) |
506 | { | | 522 | { |
507 | u_int u; | | 523 | u_int u; |
508 | | | 524 | |
509 | u = tc->tc_frequency / tc->tc_counter_mask; | | 525 | u = tc->tc_frequency / tc->tc_counter_mask; |
510 | /* XXX: We need some margin here, 10% is a guess */ | | 526 | /* XXX: We need some margin here, 10% is a guess */ |
511 | u *= 11; | | 527 | u *= 11; |
512 | u /= 10; | | 528 | u /= 10; |
513 | if (u > hz && tc->tc_quality >= 0) { | | 529 | if (u > hz && tc->tc_quality >= 0) { |
514 | tc->tc_quality = -2000; | | 530 | tc->tc_quality = -2000; |
515 | aprint_verbose( | | 531 | aprint_verbose( |
516 | "timecounter: Timecounter \"%s\" frequency %ju Hz", | | 532 | "timecounter: Timecounter \"%s\" frequency %ju Hz", |
517 | tc->tc_name, (uintmax_t)tc->tc_frequency); | | 533 | tc->tc_name, (uintmax_t)tc->tc_frequency); |
518 | aprint_verbose(" -- Insufficient hz, needs at least %u\n", u); | | 534 | aprint_verbose(" -- Insufficient hz, needs at least %u\n", u); |
519 | } else if (tc->tc_quality >= 0 || bootverbose) { | | 535 | } else if (tc->tc_quality >= 0 || bootverbose) { |
520 | aprint_verbose( | | 536 | aprint_verbose( |
521 | "timecounter: Timecounter \"%s\" frequency %ju Hz " | | 537 | "timecounter: Timecounter \"%s\" frequency %ju Hz " |
522 | "quality %d\n", tc->tc_name, (uintmax_t)tc->tc_frequency, | | 538 | "quality %d\n", tc->tc_name, (uintmax_t)tc->tc_frequency, |
523 | tc->tc_quality); | | 539 | tc->tc_quality); |
524 | } | | 540 | } |
525 | | | 541 | |
526 | mutex_spin_enter(&timecounter_lock); | | 542 | mutex_spin_enter(&timecounter_lock); |
527 | tc->tc_next = timecounters; | | 543 | tc->tc_next = timecounters; |
528 | timecounters = tc; | | 544 | timecounters = tc; |
529 | timecounter_mods++; | | 545 | timecounter_mods++; |
530 | /* | | 546 | /* |
531 | * Never automatically use a timecounter with negative quality. | | 547 | * Never automatically use a timecounter with negative quality. |
532 | * Even though we run on the dummy counter, switching here may be | | 548 | * Even though we run on the dummy counter, switching here may be |
533 | * worse since this timecounter may not be monotonous. | | 549 | * worse since this timecounter may not be monotonous. |
534 | */ | | 550 | */ |
535 | if (tc->tc_quality >= 0 && (tc->tc_quality > timecounter->tc_quality || | | 551 | if (tc->tc_quality >= 0 && (tc->tc_quality > timecounter->tc_quality || |
536 | (tc->tc_quality == timecounter->tc_quality && | | 552 | (tc->tc_quality == timecounter->tc_quality && |
537 | tc->tc_frequency > timecounter->tc_frequency))) { | | 553 | tc->tc_frequency > timecounter->tc_frequency))) { |
538 | (void)tc->tc_get_timecount(tc); | | 554 | (void)tc->tc_get_timecount(tc); |
539 | (void)tc->tc_get_timecount(tc); | | 555 | (void)tc->tc_get_timecount(tc); |
540 | timecounter = tc; | | 556 | timecounter = tc; |
541 | tc_windup(); | | 557 | tc_windup(); |
542 | } | | 558 | } |
543 | mutex_spin_exit(&timecounter_lock); | | 559 | mutex_spin_exit(&timecounter_lock); |
544 | } | | 560 | } |
545 | | | 561 | |
546 | /* | | 562 | /* |
547 | * Pick a new timecounter due to the existing counter going bad. | | 563 | * Pick a new timecounter due to the existing counter going bad. |
548 | */ | | 564 | */ |
549 | static void | | 565 | static void |
550 | tc_pick(void) | | 566 | tc_pick(void) |
551 | { | | 567 | { |
552 | struct timecounter *best, *tc; | | 568 | struct timecounter *best, *tc; |
553 | | | 569 | |
554 | KASSERT(mutex_owned(&timecounter_lock)); | | 570 | KASSERT(mutex_owned(&timecounter_lock)); |
555 | | | 571 | |
556 | for (best = tc = timecounters; tc != NULL; tc = tc->tc_next) { | | 572 | for (best = tc = timecounters; tc != NULL; tc = tc->tc_next) { |
557 | if (tc->tc_quality > best->tc_quality) | | 573 | if (tc->tc_quality > best->tc_quality) |
558 | best = tc; | | 574 | best = tc; |
559 | else if (tc->tc_quality < best->tc_quality) | | 575 | else if (tc->tc_quality < best->tc_quality) |
560 | continue; | | 576 | continue; |
561 | else if (tc->tc_frequency > best->tc_frequency) | | 577 | else if (tc->tc_frequency > best->tc_frequency) |
562 | best = tc; | | 578 | best = tc; |
563 | } | | 579 | } |
564 | (void)best->tc_get_timecount(best); | | 580 | (void)best->tc_get_timecount(best); |
565 | (void)best->tc_get_timecount(best); | | 581 | (void)best->tc_get_timecount(best); |
566 | timecounter = best; | | 582 | timecounter = best; |
567 | } | | 583 | } |
568 | | | 584 | |
569 | /* | | 585 | /* |
570 | * A timecounter has gone bad, arrange to pick a new one at the next | | 586 | * A timecounter has gone bad, arrange to pick a new one at the next |
571 | * clock tick. | | 587 | * clock tick. |
572 | */ | | 588 | */ |
573 | void | | 589 | void |
574 | tc_gonebad(struct timecounter *tc) | | 590 | tc_gonebad(struct timecounter *tc) |
575 | { | | 591 | { |
576 | | | 592 | |
577 | tc->tc_quality = -100; | | 593 | tc->tc_quality = -100; |
578 | membar_producer(); | | 594 | membar_producer(); |
579 | atomic_inc_uint(&timecounter_bad); | | 595 | atomic_inc_uint(&timecounter_bad); |
580 | } | | 596 | } |
581 | | | 597 | |
582 | /* | | 598 | /* |
583 | * Stop using a timecounter and remove it from the timecounters list. | | 599 | * Stop using a timecounter and remove it from the timecounters list. |
584 | */ | | 600 | */ |
585 | int | | 601 | int |
586 | tc_detach(struct timecounter *target) | | 602 | tc_detach(struct timecounter *target) |
587 | { | | 603 | { |
588 | struct timecounter *tc; | | 604 | struct timecounter *tc; |
589 | struct timecounter **tcp = NULL; | | 605 | struct timecounter **tcp = NULL; |
590 | int removals; | | 606 | int removals; |
591 | uint64_t where; | | 607 | uint64_t where; |
592 | lwp_t *l; | | 608 | lwp_t *l; |
593 | | | 609 | |
594 | /* First, find the timecounter. */ | | 610 | /* First, find the timecounter. */ |
595 | mutex_spin_enter(&timecounter_lock); | | 611 | mutex_spin_enter(&timecounter_lock); |
596 | for (tcp = &timecounters, tc = timecounters; | | 612 | for (tcp = &timecounters, tc = timecounters; |
597 | tc != NULL; | | 613 | tc != NULL; |
598 | tcp = &tc->tc_next, tc = tc->tc_next) { | | 614 | tcp = &tc->tc_next, tc = tc->tc_next) { |
599 | if (tc == target) | | 615 | if (tc == target) |
600 | break; | | 616 | break; |
601 | } | | 617 | } |
602 | if (tc == NULL) { | | 618 | if (tc == NULL) { |
603 | mutex_spin_exit(&timecounter_lock); | | 619 | mutex_spin_exit(&timecounter_lock); |
604 | return ESRCH; | | 620 | return ESRCH; |
605 | } | | 621 | } |
606 | | | 622 | |
607 | /* And now, remove it. */ | | 623 | /* And now, remove it. */ |
608 | *tcp = tc->tc_next; | | 624 | *tcp = tc->tc_next; |
609 | if (timecounter == target) { | | 625 | if (timecounter == target) { |
610 | tc_pick(); | | 626 | tc_pick(); |
611 | tc_windup(); | | 627 | tc_windup(); |
612 | } | | 628 | } |
613 | timecounter_mods++; | | 629 | timecounter_mods++; |
614 | removals = timecounter_removals++; | | 630 | removals = timecounter_removals++; |
615 | mutex_spin_exit(&timecounter_lock); | | 631 | mutex_spin_exit(&timecounter_lock); |
616 | | | 632 | |
617 | /* | | 633 | /* |
618 | * We now have to determine if any threads in the system are still | | 634 | * We now have to determine if any threads in the system are still |
619 | * making use of this timecounter. | | 635 | * making use of this timecounter. |
620 | * | | 636 | * |
621 | * We issue a broadcast cross call to elide memory ordering issues, | | 637 | * We issue a broadcast cross call to elide memory ordering issues, |
622 | * then scan all LWPs in the system looking at each's timecounter | | 638 | * then scan all LWPs in the system looking at each's timecounter |
623 | * generation number. We need to see a value of zero (not actively | | 639 | * generation number. We need to see a value of zero (not actively |
624 | * using a timecounter) or a value greater than our removal value. | | 640 | * using a timecounter) or a value greater than our removal value. |
625 | * | | 641 | * |
626 | * We may race with threads that read `timecounter_removals' and | | 642 | * We may race with threads that read `timecounter_removals' and |
627 | * and then get preempted before updating `l_tcgen'. This is not | | 643 | * and then get preempted before updating `l_tcgen'. This is not |
628 | * a problem, since it means that these threads have not yet started | | 644 | * a problem, since it means that these threads have not yet started |
629 | * accessing timecounter state. All we do need is one clean | | 645 | * accessing timecounter state. All we do need is one clean |
630 | * snapshot of the system where every thread appears not to be using | | 646 | * snapshot of the system where every thread appears not to be using |
631 | * old timecounter state. | | 647 | * old timecounter state. |
632 | */ | | 648 | */ |
633 | for (;;) { | | 649 | for (;;) { |
634 | where = xc_broadcast(0, (xcfunc_t)nullop, NULL, NULL); | | 650 | where = xc_broadcast(0, (xcfunc_t)nullop, NULL, NULL); |
635 | xc_wait(where); | | 651 | xc_wait(where); |
636 | | | 652 | |
637 | mutex_enter(proc_lock); | | 653 | mutex_enter(proc_lock); |
638 | LIST_FOREACH(l, &alllwp, l_list) { | | 654 | LIST_FOREACH(l, &alllwp, l_list) { |
639 | if (l->l_tcgen == 0 || l->l_tcgen > removals) { | | 655 | if (l->l_tcgen == 0 || l->l_tcgen > removals) { |
640 | /* | | 656 | /* |
641 | * Not using timecounter or old timecounter | | 657 | * Not using timecounter or old timecounter |
642 | * state at time of our xcall or later. | | 658 | * state at time of our xcall or later. |
643 | */ | | 659 | */ |
644 | continue; | | 660 | continue; |
645 | } | | 661 | } |
646 | break; | | 662 | break; |
647 | } | | 663 | } |
648 | mutex_exit(proc_lock); | | 664 | mutex_exit(proc_lock); |
649 | | | 665 | |
650 | /* | | 666 | /* |
651 | * If the timecounter is still in use, wait at least 10ms | | 667 | * If the timecounter is still in use, wait at least 10ms |
652 | * before retrying. | | 668 | * before retrying. |
653 | */ | | 669 | */ |
654 | if (l == NULL) { | | 670 | if (l == NULL) { |
655 | return 0; | | 671 | return 0; |
656 | } | | 672 | } |
657 | (void)kpause("tcdetach", false, mstohz(10), NULL); | | 673 | (void)kpause("tcdetach", false, mstohz(10), NULL); |
658 | } | | 674 | } |
659 | } | | 675 | } |
660 | | | 676 | |
661 | /* Report the frequency of the current timecounter. */ | | 677 | /* Report the frequency of the current timecounter. */ |
662 | u_int64_t | | 678 | u_int64_t |
663 | tc_getfrequency(void) | | 679 | tc_getfrequency(void) |
664 | { | | 680 | { |
665 | | | 681 | |
666 | return (timehands->th_counter->tc_frequency); | | 682 | return (timehands->th_counter->tc_frequency); |
667 | } | | 683 | } |
668 | | | 684 | |
669 | /* | | 685 | /* |
670 | * Step our concept of UTC. This is done by modifying our estimate of | | 686 | * Step our concept of UTC. This is done by modifying our estimate of |
671 | * when we booted. | | 687 | * when we booted. |
672 | */ | | 688 | */ |
673 | void | | 689 | void |
674 | tc_setclock(const struct timespec *ts) | | 690 | tc_setclock(const struct timespec *ts) |
675 | { | | 691 | { |
676 | struct timespec ts2; | | 692 | struct timespec ts2; |
677 | struct bintime bt, bt2; | | 693 | struct bintime bt, bt2; |
678 | | | 694 | |
679 | mutex_spin_enter(&timecounter_lock); | | 695 | mutex_spin_enter(&timecounter_lock); |
680 | TC_COUNT(nsetclock); | | 696 | TC_COUNT(nsetclock); |
681 | binuptime(&bt2); | | 697 | binuptime(&bt2); |
682 | timespec2bintime(ts, &bt); | | 698 | timespec2bintime(ts, &bt); |
683 | bintime_sub(&bt, &bt2); | | 699 | bintime_sub(&bt, &bt2); |
684 | bintime_add(&bt2, &timebasebin); | | 700 | bintime_add(&bt2, &timebasebin); |
685 | timebasebin = bt; | | 701 | timebasebin = bt; |
686 | tc_windup(); | | 702 | tc_windup(); |
687 | mutex_spin_exit(&timecounter_lock); | | 703 | mutex_spin_exit(&timecounter_lock); |
688 | | | 704 | |
689 | if (timestepwarnings) { | | 705 | if (timestepwarnings) { |
690 | bintime2timespec(&bt2, &ts2); | | 706 | bintime2timespec(&bt2, &ts2); |
691 | log(LOG_INFO, | | 707 | log(LOG_INFO, |
692 | "Time stepped from %lld.%09ld to %lld.%09ld\n", | | 708 | "Time stepped from %lld.%09ld to %lld.%09ld\n", |
693 | (long long)ts2.tv_sec, ts2.tv_nsec, | | 709 | (long long)ts2.tv_sec, ts2.tv_nsec, |
694 | (long long)ts->tv_sec, ts->tv_nsec); | | 710 | (long long)ts->tv_sec, ts->tv_nsec); |
695 | } | | 711 | } |
696 | } | | 712 | } |
697 | | | 713 | |
698 | /* | | 714 | /* |
699 | * Initialize the next struct timehands in the ring and make | | 715 | * Initialize the next struct timehands in the ring and make |
700 | * it the active timehands. Along the way we might switch to a different | | 716 | * it the active timehands. Along the way we might switch to a different |
701 | * timecounter and/or do seconds processing in NTP. Slightly magic. | | 717 | * timecounter and/or do seconds processing in NTP. Slightly magic. |
702 | */ | | 718 | */ |
703 | static void | | 719 | static void |
704 | tc_windup(void) | | 720 | tc_windup(void) |
705 | { | | 721 | { |
706 | struct bintime bt; | | 722 | struct bintime bt; |
707 | struct timehands *th, *tho; | | 723 | struct timehands *th, *tho; |
708 | u_int64_t scale; | | 724 | u_int64_t scale; |
709 | u_int delta, ncount, ogen; | | 725 | u_int delta, ncount, ogen; |
710 | int i, s_update; | | 726 | int i, s_update; |
711 | time_t t; | | 727 | time_t t; |
712 | | | 728 | |
713 | KASSERT(mutex_owned(&timecounter_lock)); | | 729 | KASSERT(mutex_owned(&timecounter_lock)); |
714 | | | 730 | |
715 | s_update = 0; | | 731 | s_update = 0; |
716 | | | 732 | |
717 | /* | | 733 | /* |
718 | * Make the next timehands a copy of the current one, but do not | | 734 | * Make the next timehands a copy of the current one, but do not |
719 | * overwrite the generation or next pointer. While we update | | 735 | * overwrite the generation or next pointer. While we update |
720 | * the contents, the generation must be zero. Ensure global | | 736 | * the contents, the generation must be zero. Ensure global |
721 | * visibility of the generation before proceeding. | | 737 | * visibility of the generation before proceeding. |
722 | */ | | 738 | */ |
723 | tho = timehands; | | 739 | tho = timehands; |
724 | th = tho->th_next; | | 740 | th = tho->th_next; |
725 | ogen = th->th_generation; | | 741 | ogen = th->th_generation; |
726 | th->th_generation = 0; | | 742 | th->th_generation = 0; |
727 | membar_producer(); | | 743 | membar_producer(); |
728 | bcopy(tho, th, offsetof(struct timehands, th_generation)); | | 744 | bcopy(tho, th, offsetof(struct timehands, th_generation)); |
729 | | | 745 | |
730 | /* | | 746 | /* |
731 | * Capture a timecounter delta on the current timecounter and if | | 747 | * Capture a timecounter delta on the current timecounter and if |
732 | * changing timecounters, a counter value from the new timecounter. | | 748 | * changing timecounters, a counter value from the new timecounter. |
733 | * Update the offset fields accordingly. | | 749 | * Update the offset fields accordingly. |
734 | */ | | 750 | */ |
735 | delta = tc_delta(th); | | 751 | delta = tc_delta(th); |
736 | if (th->th_counter != timecounter) | | 752 | if (th->th_counter != timecounter) |
737 | ncount = timecounter->tc_get_timecount(timecounter); | | 753 | ncount = timecounter->tc_get_timecount(timecounter); |
738 | else | | 754 | else |
739 | ncount = 0; | | 755 | ncount = 0; |
740 | th->th_offset_count += delta; | | 756 | th->th_offset_count += delta; |
741 | bintime_addx(&th->th_offset, th->th_scale * delta); | | 757 | bintime_addx(&th->th_offset, th->th_scale * delta); |
742 | | | 758 | |
743 | /* | | 759 | /* |
744 | * Hardware latching timecounters may not generate interrupts on | | 760 | * Hardware latching timecounters may not generate interrupts on |
745 | * PPS events, so instead we poll them. There is a finite risk that | | 761 | * PPS events, so instead we poll them. There is a finite risk that |
746 | * the hardware might capture a count which is later than the one we | | 762 | * the hardware might capture a count which is later than the one we |
747 | * got above, and therefore possibly in the next NTP second which might | | 763 | * got above, and therefore possibly in the next NTP second which might |
748 | * have a different rate than the current NTP second. It doesn't | | 764 | * have a different rate than the current NTP second. It doesn't |
749 | * matter in practice. | | 765 | * matter in practice. |
750 | */ | | 766 | */ |
751 | if (tho->th_counter->tc_poll_pps) | | 767 | if (tho->th_counter->tc_poll_pps) |
752 | tho->th_counter->tc_poll_pps(tho->th_counter); | | 768 | tho->th_counter->tc_poll_pps(tho->th_counter); |
753 | | | 769 | |
754 | /* | | 770 | /* |
755 | * Deal with NTP second processing. The for loop normally | | 771 | * Deal with NTP second processing. The for loop normally |
756 | * iterates at most once, but in extreme situations it might | | 772 | * iterates at most once, but in extreme situations it might |
757 | * keep NTP sane if timeouts are not run for several seconds. | | 773 | * keep NTP sane if timeouts are not run for several seconds. |
758 | * At boot, the time step can be large when the TOD hardware | | 774 | * At boot, the time step can be large when the TOD hardware |
759 | * has been read, so on really large steps, we call | | 775 | * has been read, so on really large steps, we call |
760 | * ntp_update_second only twice. We need to call it twice in | | 776 | * ntp_update_second only twice. We need to call it twice in |
761 | * case we missed a leap second. | | 777 | * case we missed a leap second. |
762 | * If NTP is not compiled in ntp_update_second still calculates | | 778 | * If NTP is not compiled in ntp_update_second still calculates |
763 | * the adjustment resulting from adjtime() calls. | | 779 | * the adjustment resulting from adjtime() calls. |
764 | */ | | 780 | */ |
765 | bt = th->th_offset; | | 781 | bt = th->th_offset; |
766 | bintime_add(&bt, &timebasebin); | | 782 | bintime_add(&bt, &timebasebin); |
767 | i = bt.sec - tho->th_microtime.tv_sec; | | 783 | i = bt.sec - tho->th_microtime.tv_sec; |
768 | if (i > LARGE_STEP) | | 784 | if (i > LARGE_STEP) |
769 | i = 2; | | 785 | i = 2; |
770 | for (; i > 0; i--) { | | 786 | for (; i > 0; i--) { |
771 | t = bt.sec; | | 787 | t = bt.sec; |
772 | ntp_update_second(&th->th_adjustment, &bt.sec); | | 788 | ntp_update_second(&th->th_adjustment, &bt.sec); |
773 | s_update = 1; | | 789 | s_update = 1; |
774 | if (bt.sec != t) | | 790 | if (bt.sec != t) |
775 | timebasebin.sec += bt.sec - t; | | 791 | timebasebin.sec += bt.sec - t; |
776 | } | | 792 | } |
777 | | | 793 | |
778 | /* Update the UTC timestamps used by the get*() functions. */ | | 794 | /* Update the UTC timestamps used by the get*() functions. */ |
779 | /* XXX shouldn't do this here. Should force non-`get' versions. */ | | 795 | /* XXX shouldn't do this here. Should force non-`get' versions. */ |
780 | bintime2timeval(&bt, &th->th_microtime); | | 796 | bintime2timeval(&bt, &th->th_microtime); |
781 | bintime2timespec(&bt, &th->th_nanotime); | | 797 | bintime2timespec(&bt, &th->th_nanotime); |
782 | /* Now is a good time to change timecounters. */ | | 798 | /* Now is a good time to change timecounters. */ |
783 | if (th->th_counter != timecounter) { | | 799 | if (th->th_counter != timecounter) { |
784 | th->th_counter = timecounter; | | 800 | th->th_counter = timecounter; |
785 | th->th_offset_count = ncount; | | 801 | th->th_offset_count = ncount; |
786 | s_update = 1; | | 802 | s_update = 1; |
787 | } | | 803 | } |
788 | | | 804 | |
789 | /*- | | 805 | /*- |
790 | * Recalculate the scaling factor. We want the number of 1/2^64 | | 806 | * Recalculate the scaling factor. We want the number of 1/2^64 |
791 | * fractions of a second per period of the hardware counter, taking | | 807 | * fractions of a second per period of the hardware counter, taking |
792 | * into account the th_adjustment factor which the NTP PLL/adjtime(2) | | 808 | * into account the th_adjustment factor which the NTP PLL/adjtime(2) |
793 | * processing provides us with. | | 809 | * processing provides us with. |
794 | * | | 810 | * |
795 | * The th_adjustment is nanoseconds per second with 32 bit binary | | 811 | * The th_adjustment is nanoseconds per second with 32 bit binary |
796 | * fraction and we want 64 bit binary fraction of second: | | 812 | * fraction and we want 64 bit binary fraction of second: |
797 | * | | 813 | * |
798 | * x = a * 2^32 / 10^9 = a * 4.294967296 | | 814 | * x = a * 2^32 / 10^9 = a * 4.294967296 |
799 | * | | 815 | * |
800 | * The range of th_adjustment is +/- 5000PPM so inside a 64bit int | | 816 | * The range of th_adjustment is +/- 5000PPM so inside a 64bit int |
801 | * we can only multiply by about 850 without overflowing, but that | | 817 | * we can only multiply by about 850 without overflowing, but that |
802 | * leaves suitably precise fractions for multiply before divide. | | 818 | * leaves suitably precise fractions for multiply before divide. |
803 | * | | 819 | * |
804 | * Divide before multiply with a fraction of 2199/512 results in a | | 820 | * Divide before multiply with a fraction of 2199/512 results in a |
805 | * systematic undercompensation of 10PPM of th_adjustment. On a | | 821 | * systematic undercompensation of 10PPM of th_adjustment. On a |
806 | * 5000PPM adjustment this is a 0.05PPM error. This is acceptable. | | 822 | * 5000PPM adjustment this is a 0.05PPM error. This is acceptable. |
807 | * | | 823 | * |
808 | * We happily sacrifice the lowest of the 64 bits of our result | | 824 | * We happily sacrifice the lowest of the 64 bits of our result |
809 | * to the goddess of code clarity. | | 825 | * to the goddess of code clarity. |
810 | * | | 826 | * |
811 | */ | | 827 | */ |
812 | if (s_update) { | | 828 | if (s_update) { |
813 | scale = (u_int64_t)1 << 63; | | 829 | scale = (u_int64_t)1 << 63; |
814 | scale += (th->th_adjustment / 1024) * 2199; | | 830 | scale += (th->th_adjustment / 1024) * 2199; |
815 | scale /= th->th_counter->tc_frequency; | | 831 | scale /= th->th_counter->tc_frequency; |
816 | th->th_scale = scale * 2; | | 832 | th->th_scale = scale * 2; |
817 | } | | 833 | } |
818 | /* | | 834 | /* |
819 | * Now that the struct timehands is again consistent, set the new | | 835 | * Now that the struct timehands is again consistent, set the new |
820 | * generation number, making sure to not make it zero. Ensure | | 836 | * generation number, making sure to not make it zero. Ensure |
821 | * changes are globally visible before changing. | | 837 | * changes are globally visible before changing. |
822 | */ | | 838 | */ |
823 | if (++ogen == 0) | | 839 | if (++ogen == 0) |
824 | ogen = 1; | | 840 | ogen = 1; |
825 | membar_producer(); | | 841 | membar_producer(); |
826 | th->th_generation = ogen; | | 842 | th->th_generation = ogen; |
827 | | | 843 | |
828 | /* | | 844 | /* |
829 | * Go live with the new struct timehands. Ensure changes are | | 845 | * Go live with the new struct timehands. Ensure changes are |
830 | * globally visible before changing. | | 846 | * globally visible before changing. |
831 | */ | | 847 | */ |
832 | time_second = th->th_microtime.tv_sec; | | 848 | time_second = th->th_microtime.tv_sec; |
833 | time_uptime = th->th_offset.sec; | | 849 | time_uptime = th->th_offset.sec; |
834 | membar_producer(); | | 850 | membar_producer(); |
835 | timehands = th; | | 851 | timehands = th; |
836 | | | 852 | |
837 | /* | | 853 | /* |
838 | * Force users of the old timehand to move on. This is | | 854 | * Force users of the old timehand to move on. This is |
839 | * necessary for MP systems; we need to ensure that the | | 855 | * necessary for MP systems; we need to ensure that the |
840 | * consumers will move away from the old timehand before | | 856 | * consumers will move away from the old timehand before |
841 | * we begin updating it again when we eventually wrap | | 857 | * we begin updating it again when we eventually wrap |
842 | * around. | | 858 | * around. |
843 | */ | | 859 | */ |
844 | if (++tho->th_generation == 0) | | 860 | if (++tho->th_generation == 0) |
845 | tho->th_generation = 1; | | 861 | tho->th_generation = 1; |
846 | } | | 862 | } |
847 | | | 863 | |
848 | /* | | 864 | /* |
849 | * RFC 2783 PPS-API implementation. | | 865 | * RFC 2783 PPS-API implementation. |
850 | */ | | 866 | */ |
851 | | | 867 | |
852 | int | | 868 | int |
853 | pps_ioctl(u_long cmd, void *data, struct pps_state *pps) | | 869 | pps_ioctl(u_long cmd, void *data, struct pps_state *pps) |
854 | { | | 870 | { |
855 | pps_params_t *app; | | 871 | pps_params_t *app; |
856 | pps_info_t *pipi; | | 872 | pps_info_t *pipi; |
857 | #ifdef PPS_SYNC | | 873 | #ifdef PPS_SYNC |
858 | int *epi; | | 874 | int *epi; |
859 | #endif | | 875 | #endif |
860 | | | 876 | |
861 | KASSERT(mutex_owned(&timecounter_lock)); | | 877 | KASSERT(mutex_owned(&timecounter_lock)); |
862 | | | 878 | |
863 | KASSERT(pps != NULL); | | 879 | KASSERT(pps != NULL); |
864 | | | 880 | |
865 | switch (cmd) { | | 881 | switch (cmd) { |
866 | case PPS_IOC_CREATE: | | 882 | case PPS_IOC_CREATE: |
867 | return (0); | | 883 | return (0); |
868 | case PPS_IOC_DESTROY: | | 884 | case PPS_IOC_DESTROY: |
869 | return (0); | | 885 | return (0); |
870 | case PPS_IOC_SETPARAMS: | | 886 | case PPS_IOC_SETPARAMS: |
871 | app = (pps_params_t *)data; | | 887 | app = (pps_params_t *)data; |
872 | if (app->mode & ~pps->ppscap) | | 888 | if (app->mode & ~pps->ppscap) |
873 | return (EINVAL); | | 889 | return (EINVAL); |
874 | pps->ppsparam = *app; | | 890 | pps->ppsparam = *app; |
875 | return (0); | | 891 | return (0); |
876 | case PPS_IOC_GETPARAMS: | | 892 | case PPS_IOC_GETPARAMS: |
877 | app = (pps_params_t *)data; | | 893 | app = (pps_params_t *)data; |
878 | *app = pps->ppsparam; | | 894 | *app = pps->ppsparam; |
879 | app->api_version = PPS_API_VERS_1; | | 895 | app->api_version = PPS_API_VERS_1; |
880 | return (0); | | 896 | return (0); |
881 | case PPS_IOC_GETCAP: | | 897 | case PPS_IOC_GETCAP: |
882 | *(int*)data = pps->ppscap; | | 898 | *(int*)data = pps->ppscap; |
883 | return (0); | | 899 | return (0); |
884 | case PPS_IOC_FETCH: | | 900 | case PPS_IOC_FETCH: |
885 | pipi = (pps_info_t *)data; | | 901 | pipi = (pps_info_t *)data; |
886 | pps->ppsinfo.current_mode = pps->ppsparam.mode; | | 902 | pps->ppsinfo.current_mode = pps->ppsparam.mode; |
887 | *pipi = pps->ppsinfo; | | 903 | *pipi = pps->ppsinfo; |
888 | return (0); | | 904 | return (0); |
889 | case PPS_IOC_KCBIND: | | 905 | case PPS_IOC_KCBIND: |
890 | #ifdef PPS_SYNC | | 906 | #ifdef PPS_SYNC |
891 | epi = (int *)data; | | 907 | epi = (int *)data; |
892 | /* XXX Only root should be able to do this */ | | 908 | /* XXX Only root should be able to do this */ |
893 | if (*epi & ~pps->ppscap) | | 909 | if (*epi & ~pps->ppscap) |
894 | return (EINVAL); | | 910 | return (EINVAL); |
895 | pps->kcmode = *epi; | | 911 | pps->kcmode = *epi; |
896 | return (0); | | 912 | return (0); |
897 | #else | | 913 | #else |
898 | return (EOPNOTSUPP); | | 914 | return (EOPNOTSUPP); |
899 | #endif | | 915 | #endif |
900 | default: | | 916 | default: |
901 | return (EPASSTHROUGH); | | 917 | return (EPASSTHROUGH); |
902 | } | | 918 | } |
903 | } | | 919 | } |
904 | | | 920 | |
905 | void | | 921 | void |
906 | pps_init(struct pps_state *pps) | | 922 | pps_init(struct pps_state *pps) |
907 | { | | 923 | { |
908 | | | 924 | |
909 | KASSERT(mutex_owned(&timecounter_lock)); | | 925 | KASSERT(mutex_owned(&timecounter_lock)); |
910 | | | 926 | |
911 | pps->ppscap |= PPS_TSFMT_TSPEC; | | 927 | pps->ppscap |= PPS_TSFMT_TSPEC; |
912 | if (pps->ppscap & PPS_CAPTUREASSERT) | | 928 | if (pps->ppscap & PPS_CAPTUREASSERT) |
913 | pps->ppscap |= PPS_OFFSETASSERT; | | 929 | pps->ppscap |= PPS_OFFSETASSERT; |
914 | if (pps->ppscap & PPS_CAPTURECLEAR) | | 930 | if (pps->ppscap & PPS_CAPTURECLEAR) |
915 | pps->ppscap |= PPS_OFFSETCLEAR; | | 931 | pps->ppscap |= PPS_OFFSETCLEAR; |
916 | } | | 932 | } |
917 | | | 933 | |
918 | /* | | 934 | /* |
919 | * capture a timetamp in the pps structure | | 935 | * capture a timetamp in the pps structure |
920 | */ | | 936 | */ |
921 | void | | 937 | void |
922 | pps_capture(struct pps_state *pps) | | 938 | pps_capture(struct pps_state *pps) |
923 | { | | 939 | { |
924 | struct timehands *th; | | 940 | struct timehands *th; |
925 | | | 941 | |
926 | KASSERT(mutex_owned(&timecounter_lock)); | | 942 | KASSERT(mutex_owned(&timecounter_lock)); |
927 | KASSERT(pps != NULL); | | 943 | KASSERT(pps != NULL); |
928 | | | 944 | |
929 | th = timehands; | | 945 | th = timehands; |
930 | pps->capgen = th->th_generation; | | 946 | pps->capgen = th->th_generation; |
931 | pps->capth = th; | | 947 | pps->capth = th; |
932 | pps->capcount = (u_int64_t)tc_delta(th) + th->th_offset_count; | | 948 | pps->capcount = (u_int64_t)tc_delta(th) + th->th_offset_count; |
933 | if (pps->capgen != th->th_generation) | | 949 | if (pps->capgen != th->th_generation) |
934 | pps->capgen = 0; | | 950 | pps->capgen = 0; |
935 | } | | 951 | } |
936 | | | 952 | |
937 | #ifdef PPS_DEBUG | | 953 | #ifdef PPS_DEBUG |
938 | int ppsdebug = 0; | | 954 | int ppsdebug = 0; |
939 | #endif | | 955 | #endif |
940 | | | 956 | |
941 | /* | | 957 | /* |
942 | * process a pps_capture()ed event | | 958 | * process a pps_capture()ed event |
943 | */ | | 959 | */ |
944 | void | | 960 | void |
945 | pps_event(struct pps_state *pps, int event) | | 961 | pps_event(struct pps_state *pps, int event) |
946 | { | | 962 | { |
947 | pps_ref_event(pps, event, NULL, PPS_REFEVNT_PPS|PPS_REFEVNT_CAPTURE); | | 963 | pps_ref_event(pps, event, NULL, PPS_REFEVNT_PPS|PPS_REFEVNT_CAPTURE); |
948 | } | | 964 | } |
949 | | | 965 | |
950 | /* | | 966 | /* |
951 | * extended pps api / kernel pll/fll entry point | | 967 | * extended pps api / kernel pll/fll entry point |
952 | * | | 968 | * |
953 | * feed reference time stamps to PPS engine | | 969 | * feed reference time stamps to PPS engine |
954 | * | | 970 | * |
955 | * will simulate a PPS event and feed | | 971 | * will simulate a PPS event and feed |
956 | * the NTP PLL/FLL if requested. | | 972 | * the NTP PLL/FLL if requested. |
957 | * | | 973 | * |
958 | * the ref time stamps should be roughly once | | 974 | * the ref time stamps should be roughly once |
959 | * a second but do not need to be exactly in phase | | 975 | * a second but do not need to be exactly in phase |
960 | * with the UTC second but should be close to it. | | 976 | * with the UTC second but should be close to it. |
961 | * this relaxation of requirements allows callout | | 977 | * this relaxation of requirements allows callout |
962 | * driven timestamping mechanisms to feed to pps | | 978 | * driven timestamping mechanisms to feed to pps |
963 | * capture/kernel pll logic. | | 979 | * capture/kernel pll logic. |
964 | * | | 980 | * |
965 | * calling pattern is: | | 981 | * calling pattern is: |
966 | * pps_capture() (for PPS_REFEVNT_{CAPTURE|CAPCUR}) | | 982 | * pps_capture() (for PPS_REFEVNT_{CAPTURE|CAPCUR}) |
967 | * read timestamp from reference source | | 983 | * read timestamp from reference source |
968 | * pps_ref_event() | | 984 | * pps_ref_event() |
969 | * | | 985 | * |
970 | * supported refmodes: | | 986 | * supported refmodes: |
971 | * PPS_REFEVNT_CAPTURE | | 987 | * PPS_REFEVNT_CAPTURE |
972 | * use system timestamp of pps_capture() | | 988 | * use system timestamp of pps_capture() |
973 | * PPS_REFEVNT_CURRENT | | 989 | * PPS_REFEVNT_CURRENT |
974 | * use system timestamp of this call | | 990 | * use system timestamp of this call |
975 | * PPS_REFEVNT_CAPCUR | | 991 | * PPS_REFEVNT_CAPCUR |
976 | * use average of read capture and current system time stamp | | 992 | * use average of read capture and current system time stamp |
977 | * PPS_REFEVNT_PPS | | 993 | * PPS_REFEVNT_PPS |
978 | * assume timestamp on second mark - ref_ts is ignored | | 994 | * assume timestamp on second mark - ref_ts is ignored |
979 | * | | 995 | * |
980 | */ | | 996 | */ |
981 | | | 997 | |
982 | void | | 998 | void |
983 | pps_ref_event(struct pps_state *pps, | | 999 | pps_ref_event(struct pps_state *pps, |
984 | int event, | | 1000 | int event, |
985 | struct bintime *ref_ts, | | 1001 | struct bintime *ref_ts, |
986 | int refmode | | 1002 | int refmode |
987 | ) | | 1003 | ) |
988 | { | | 1004 | { |
989 | struct bintime bt; /* current time */ | | 1005 | struct bintime bt; /* current time */ |
990 | struct bintime btd; /* time difference */ | | 1006 | struct bintime btd; /* time difference */ |
991 | struct bintime bt_ref; /* reference time */ | | 1007 | struct bintime bt_ref; /* reference time */ |
992 | struct timespec ts, *tsp, *osp; | | 1008 | struct timespec ts, *tsp, *osp; |
993 | struct timehands *th; | | 1009 | struct timehands *th; |
994 | u_int64_t tcount, acount, dcount, *pcount; | | 1010 | u_int64_t tcount, acount, dcount, *pcount; |
995 | int foff, gen; | | 1011 | int foff, gen; |
996 | #ifdef PPS_SYNC | | 1012 | #ifdef PPS_SYNC |
997 | int fhard; | | 1013 | int fhard; |
998 | #endif | | 1014 | #endif |
999 | pps_seq_t *pseq; | | 1015 | pps_seq_t *pseq; |
1000 | | | 1016 | |
1001 | KASSERT(mutex_owned(&timecounter_lock)); | | 1017 | KASSERT(mutex_owned(&timecounter_lock)); |
1002 | | | 1018 | |
1003 | KASSERT(pps != NULL); | | 1019 | KASSERT(pps != NULL); |
1004 | | | 1020 | |
1005 | /* pick up current time stamp if needed */ | | 1021 | /* pick up current time stamp if needed */ |
1006 | if (refmode & (PPS_REFEVNT_CURRENT|PPS_REFEVNT_CAPCUR)) { | | 1022 | if (refmode & (PPS_REFEVNT_CURRENT|PPS_REFEVNT_CAPCUR)) { |
1007 | /* pick up current time stamp */ | | 1023 | /* pick up current time stamp */ |
1008 | th = timehands; | | 1024 | th = timehands; |
1009 | gen = th->th_generation; | | 1025 | gen = th->th_generation; |
1010 | tcount = (u_int64_t)tc_delta(th) + th->th_offset_count; | | 1026 | tcount = (u_int64_t)tc_delta(th) + th->th_offset_count; |
1011 | if (gen != th->th_generation) | | 1027 | if (gen != th->th_generation) |
1012 | gen = 0; | | 1028 | gen = 0; |
1013 | | | 1029 | |
1014 | /* If the timecounter was wound up underneath us, bail out. */ | | 1030 | /* If the timecounter was wound up underneath us, bail out. */ |
1015 | if (pps->capgen == 0 || | | 1031 | if (pps->capgen == 0 || |
1016 | pps->capgen != pps->capth->th_generation || | | 1032 | pps->capgen != pps->capth->th_generation || |
1017 | gen == 0 || | | 1033 | gen == 0 || |
1018 | gen != pps->capgen) { | | 1034 | gen != pps->capgen) { |
1019 | #ifdef PPS_DEBUG | | 1035 | #ifdef PPS_DEBUG |
1020 | if (ppsdebug & 0x1) { | | 1036 | if (ppsdebug & 0x1) { |
1021 | log(LOG_DEBUG, | | 1037 | log(LOG_DEBUG, |
1022 | "pps_ref_event(pps=%p, event=%d, ...): DROP (wind-up)\n", | | 1038 | "pps_ref_event(pps=%p, event=%d, ...): DROP (wind-up)\n", |
1023 | pps, event); | | 1039 | pps, event); |
1024 | } | | 1040 | } |
1025 | #endif | | 1041 | #endif |
1026 | return; | | 1042 | return; |
1027 | } | | 1043 | } |
1028 | } else { | | 1044 | } else { |
1029 | tcount = 0; /* keep GCC happy */ | | 1045 | tcount = 0; /* keep GCC happy */ |
1030 | } | | 1046 | } |
1031 | | | 1047 | |
1032 | #ifdef PPS_DEBUG | | 1048 | #ifdef PPS_DEBUG |
1033 | if (ppsdebug & 0x1) { | | 1049 | if (ppsdebug & 0x1) { |
1034 | struct timespec tmsp; | | 1050 | struct timespec tmsp; |
1035 | | | 1051 | |
1036 | if (ref_ts == NULL) { | | 1052 | if (ref_ts == NULL) { |
1037 | tmsp.tv_sec = 0; | | 1053 | tmsp.tv_sec = 0; |
1038 | tmsp.tv_nsec = 0; | | 1054 | tmsp.tv_nsec = 0; |
1039 | } else { | | 1055 | } else { |
1040 | bintime2timespec(ref_ts, &tmsp); | | 1056 | bintime2timespec(ref_ts, &tmsp); |
1041 | } | | 1057 | } |
1042 | | | 1058 | |
1043 | log(LOG_DEBUG, | | 1059 | log(LOG_DEBUG, |
1044 | "pps_ref_event(pps=%p, event=%d, ref_ts=%"PRIi64 | | 1060 | "pps_ref_event(pps=%p, event=%d, ref_ts=%"PRIi64 |
1045 | ".%09"PRIi32", refmode=0x%1x)\n", | | 1061 | ".%09"PRIi32", refmode=0x%1x)\n", |
1046 | pps, event, tmsp.tv_sec, (int32_t)tmsp.tv_nsec, refmode); | | 1062 | pps, event, tmsp.tv_sec, (int32_t)tmsp.tv_nsec, refmode); |
1047 | } | | 1063 | } |
1048 | #endif | | 1064 | #endif |
1049 | | | 1065 | |
1050 | /* setup correct event references */ | | 1066 | /* setup correct event references */ |
1051 | if (event == PPS_CAPTUREASSERT) { | | 1067 | if (event == PPS_CAPTUREASSERT) { |
1052 | tsp = &pps->ppsinfo.assert_timestamp; | | 1068 | tsp = &pps->ppsinfo.assert_timestamp; |
1053 | osp = &pps->ppsparam.assert_offset; | | 1069 | osp = &pps->ppsparam.assert_offset; |
1054 | foff = pps->ppsparam.mode & PPS_OFFSETASSERT; | | 1070 | foff = pps->ppsparam.mode & PPS_OFFSETASSERT; |
1055 | #ifdef PPS_SYNC | | 1071 | #ifdef PPS_SYNC |
1056 | fhard = pps->kcmode & PPS_CAPTUREASSERT; | | 1072 | fhard = pps->kcmode & PPS_CAPTUREASSERT; |
1057 | #endif | | 1073 | #endif |
1058 | pcount = &pps->ppscount[0]; | | 1074 | pcount = &pps->ppscount[0]; |
1059 | pseq = &pps->ppsinfo.assert_sequence; | | 1075 | pseq = &pps->ppsinfo.assert_sequence; |
1060 | } else { | | 1076 | } else { |
1061 | tsp = &pps->ppsinfo.clear_timestamp; | | 1077 | tsp = &pps->ppsinfo.clear_timestamp; |
1062 | osp = &pps->ppsparam.clear_offset; | | 1078 | osp = &pps->ppsparam.clear_offset; |
1063 | foff = pps->ppsparam.mode & PPS_OFFSETCLEAR; | | 1079 | foff = pps->ppsparam.mode & PPS_OFFSETCLEAR; |
1064 | #ifdef PPS_SYNC | | 1080 | #ifdef PPS_SYNC |
1065 | fhard = pps->kcmode & PPS_CAPTURECLEAR; | | 1081 | fhard = pps->kcmode & PPS_CAPTURECLEAR; |
1066 | #endif | | 1082 | #endif |
1067 | pcount = &pps->ppscount[1]; | | 1083 | pcount = &pps->ppscount[1]; |
1068 | pseq = &pps->ppsinfo.clear_sequence; | | 1084 | pseq = &pps->ppsinfo.clear_sequence; |
1069 | } | | 1085 | } |
1070 | | | 1086 | |
1071 | /* determine system time stamp according to refmode */ | | 1087 | /* determine system time stamp according to refmode */ |
1072 | dcount = 0; /* keep GCC happy */ | | 1088 | dcount = 0; /* keep GCC happy */ |
1073 | switch (refmode & PPS_REFEVNT_RMASK) { | | 1089 | switch (refmode & PPS_REFEVNT_RMASK) { |
1074 | case PPS_REFEVNT_CAPTURE: | | 1090 | case PPS_REFEVNT_CAPTURE: |
1075 | acount = pps->capcount; /* use capture timestamp */ | | 1091 | acount = pps->capcount; /* use capture timestamp */ |
1076 | break; | | 1092 | break; |
1077 | | | 1093 | |
1078 | case PPS_REFEVNT_CURRENT: | | 1094 | case PPS_REFEVNT_CURRENT: |
1079 | acount = tcount; /* use current timestamp */ | | 1095 | acount = tcount; /* use current timestamp */ |
1080 | break; | | 1096 | break; |
1081 | | | 1097 | |
1082 | case PPS_REFEVNT_CAPCUR: | | 1098 | case PPS_REFEVNT_CAPCUR: |
1083 | /* | | 1099 | /* |
1084 | * calculate counter value between pps_capture() and | | 1100 | * calculate counter value between pps_capture() and |
1085 | * pps_ref_event() | | 1101 | * pps_ref_event() |
1086 | */ | | 1102 | */ |
1087 | dcount = tcount - pps->capcount; | | 1103 | dcount = tcount - pps->capcount; |
1088 | acount = (dcount / 2) + pps->capcount; | | 1104 | acount = (dcount / 2) + pps->capcount; |
1089 | break; | | 1105 | break; |
1090 | | | 1106 | |
1091 | default: /* ignore call error silently */ | | 1107 | default: /* ignore call error silently */ |
1092 | return; | | 1108 | return; |
1093 | } | | 1109 | } |
1094 | | | 1110 | |
1095 | /* | | 1111 | /* |
1096 | * If the timecounter changed, we cannot compare the count values, so | | 1112 | * If the timecounter changed, we cannot compare the count values, so |
1097 | * we have to drop the rest of the PPS-stuff until the next event. | | 1113 | * we have to drop the rest of the PPS-stuff until the next event. |
1098 | */ | | 1114 | */ |
1099 | if (pps->ppstc != pps->capth->th_counter) { | | 1115 | if (pps->ppstc != pps->capth->th_counter) { |
1100 | pps->ppstc = pps->capth->th_counter; | | 1116 | pps->ppstc = pps->capth->th_counter; |
1101 | pps->capcount = acount; | | 1117 | pps->capcount = acount; |
1102 | *pcount = acount; | | 1118 | *pcount = acount; |
1103 | pps->ppscount[2] = acount; | | 1119 | pps->ppscount[2] = acount; |
1104 | #ifdef PPS_DEBUG | | 1120 | #ifdef PPS_DEBUG |
1105 | if (ppsdebug & 0x1) { | | 1121 | if (ppsdebug & 0x1) { |
1106 | log(LOG_DEBUG, | | 1122 | log(LOG_DEBUG, |
1107 | "pps_ref_event(pps=%p, event=%d, ...): DROP (time-counter change)\n", | | 1123 | "pps_ref_event(pps=%p, event=%d, ...): DROP (time-counter change)\n", |
1108 | pps, event); | | 1124 | pps, event); |
1109 | } | | 1125 | } |
1110 | #endif | | 1126 | #endif |
1111 | return; | | 1127 | return; |
1112 | } | | 1128 | } |
1113 | | | 1129 | |
1114 | pps->capcount = acount; | | 1130 | pps->capcount = acount; |
1115 | | | 1131 | |
1116 | /* Convert the count to a bintime. */ | | 1132 | /* Convert the count to a bintime. */ |
1117 | bt = pps->capth->th_offset; | | 1133 | bt = pps->capth->th_offset; |
1118 | bintime_addx(&bt, pps->capth->th_scale * (acount - pps->capth->th_offset_count)); | | 1134 | bintime_addx(&bt, pps->capth->th_scale * (acount - pps->capth->th_offset_count)); |
1119 | bintime_add(&bt, &timebasebin); | | 1135 | bintime_add(&bt, &timebasebin); |
1120 | | | 1136 | |
1121 | if ((refmode & PPS_REFEVNT_PPS) == 0) { | | 1137 | if ((refmode & PPS_REFEVNT_PPS) == 0) { |
1122 | /* determine difference to reference time stamp */ | | 1138 | /* determine difference to reference time stamp */ |
1123 | bt_ref = *ref_ts; | | 1139 | bt_ref = *ref_ts; |
1124 | | | 1140 | |
1125 | btd = bt; | | 1141 | btd = bt; |
1126 | bintime_sub(&btd, &bt_ref); | | 1142 | bintime_sub(&btd, &bt_ref); |
1127 | | | 1143 | |
1128 | /* | | 1144 | /* |
1129 | * simulate a PPS timestamp by dropping the fraction | | 1145 | * simulate a PPS timestamp by dropping the fraction |
1130 | * and applying the offset | | 1146 | * and applying the offset |
1131 | */ | | 1147 | */ |
1132 | if (bt.frac >= (uint64_t)1<<63) /* skip to nearest second */ | | 1148 | if (bt.frac >= (uint64_t)1<<63) /* skip to nearest second */ |
1133 | bt.sec++; | | 1149 | bt.sec++; |
1134 | bt.frac = 0; | | 1150 | bt.frac = 0; |
1135 | bintime_add(&bt, &btd); | | 1151 | bintime_add(&bt, &btd); |
1136 | } else { | | 1152 | } else { |
1137 | /* | | 1153 | /* |
1138 | * create ref_ts from current time - | | 1154 | * create ref_ts from current time - |
1139 | * we are supposed to be called on | | 1155 | * we are supposed to be called on |
1140 | * the second mark | | 1156 | * the second mark |
1141 | */ | | 1157 | */ |
1142 | bt_ref = bt; | | 1158 | bt_ref = bt; |
1143 | if (bt_ref.frac >= (uint64_t)1<<63) /* skip to nearest second */ | | 1159 | if (bt_ref.frac >= (uint64_t)1<<63) /* skip to nearest second */ |
1144 | bt_ref.sec++; | | 1160 | bt_ref.sec++; |
1145 | bt_ref.frac = 0; | | 1161 | bt_ref.frac = 0; |
1146 | } | | 1162 | } |
1147 | | | 1163 | |
1148 | /* convert bintime to timestamp */ | | 1164 | /* convert bintime to timestamp */ |
1149 | bintime2timespec(&bt, &ts); | | 1165 | bintime2timespec(&bt, &ts); |
1150 | | | 1166 | |
1151 | /* If the timecounter was wound up underneath us, bail out. */ | | 1167 | /* If the timecounter was wound up underneath us, bail out. */ |
1152 | if (pps->capgen != pps->capth->th_generation) | | 1168 | if (pps->capgen != pps->capth->th_generation) |
1153 | return; | | 1169 | return; |
1154 | | | 1170 | |
1155 | /* store time stamp */ | | 1171 | /* store time stamp */ |
1156 | *pcount = pps->capcount; | | 1172 | *pcount = pps->capcount; |
1157 | (*pseq)++; | | 1173 | (*pseq)++; |
1158 | *tsp = ts; | | 1174 | *tsp = ts; |
1159 | | | 1175 | |
1160 | /* add offset correction */ | | 1176 | /* add offset correction */ |
1161 | if (foff) { | | 1177 | if (foff) { |
1162 | timespecadd(tsp, osp, tsp); | | 1178 | timespecadd(tsp, osp, tsp); |
1163 | if (tsp->tv_nsec < 0) { | | 1179 | if (tsp->tv_nsec < 0) { |
1164 | tsp->tv_nsec += 1000000000; | | 1180 | tsp->tv_nsec += 1000000000; |
1165 | tsp->tv_sec -= 1; | | 1181 | tsp->tv_sec -= 1; |
1166 | } | | 1182 | } |
1167 | } | | 1183 | } |
1168 | | | 1184 | |
1169 | #ifdef PPS_DEBUG | | 1185 | #ifdef PPS_DEBUG |
1170 | if (ppsdebug & 0x2) { | | 1186 | if (ppsdebug & 0x2) { |
1171 | struct timespec ts2; | | 1187 | struct timespec ts2; |
1172 | struct timespec ts3; | | 1188 | struct timespec ts3; |
1173 | | | 1189 | |
1174 | bintime2timespec(&bt_ref, &ts2); | | 1190 | bintime2timespec(&bt_ref, &ts2); |
1175 | | | 1191 | |
1176 | bt.sec = 0; | | 1192 | bt.sec = 0; |
1177 | bt.frac = 0; | | 1193 | bt.frac = 0; |
1178 | | | 1194 | |
1179 | if (refmode & PPS_REFEVNT_CAPCUR) { | | 1195 | if (refmode & PPS_REFEVNT_CAPCUR) { |
1180 | bintime_addx(&bt, pps->capth->th_scale * dcount); | | 1196 | bintime_addx(&bt, pps->capth->th_scale * dcount); |
1181 | } | | 1197 | } |
1182 | bintime2timespec(&bt, &ts3); | | 1198 | bintime2timespec(&bt, &ts3); |
1183 | | | 1199 | |
1184 | log(LOG_DEBUG, "ref_ts=%"PRIi64".%09"PRIi32 | | 1200 | log(LOG_DEBUG, "ref_ts=%"PRIi64".%09"PRIi32 |
1185 | ", ts=%"PRIi64".%09"PRIi32", read latency=%"PRIi64" ns\n", | | 1201 | ", ts=%"PRIi64".%09"PRIi32", read latency=%"PRIi64" ns\n", |
1186 | ts2.tv_sec, (int32_t)ts2.tv_nsec, | | 1202 | ts2.tv_sec, (int32_t)ts2.tv_nsec, |
1187 | tsp->tv_sec, (int32_t)tsp->tv_nsec, | | 1203 | tsp->tv_sec, (int32_t)tsp->tv_nsec, |
1188 | timespec2ns(&ts3)); | | 1204 | timespec2ns(&ts3)); |
1189 | } | | 1205 | } |
1190 | #endif | | 1206 | #endif |
1191 | | | 1207 | |
1192 | #ifdef PPS_SYNC | | 1208 | #ifdef PPS_SYNC |
1193 | if (fhard) { | | 1209 | if (fhard) { |
1194 | uint64_t scale; | | 1210 | uint64_t scale; |
1195 | uint64_t div; | | 1211 | uint64_t div; |
1196 | | | 1212 | |
1197 | /* | | 1213 | /* |
1198 | * Feed the NTP PLL/FLL. | | 1214 | * Feed the NTP PLL/FLL. |
1199 | * The FLL wants to know how many (hardware) nanoseconds | | 1215 | * The FLL wants to know how many (hardware) nanoseconds |
1200 | * elapsed since the previous event (mod 1 second) thus | | 1216 | * elapsed since the previous event (mod 1 second) thus |
1201 | * we are actually looking at the frequency difference scaled | | 1217 | * we are actually looking at the frequency difference scaled |
1202 | * in nsec. | | 1218 | * in nsec. |
1203 | * As the counter time stamps are not truly at 1Hz | | 1219 | * As the counter time stamps are not truly at 1Hz |
1204 | * we need to scale the count by the elapsed | | 1220 | * we need to scale the count by the elapsed |
1205 | * reference time. | | 1221 | * reference time. |
1206 | * valid sampling interval: [0.5..2[ sec | | 1222 | * valid sampling interval: [0.5..2[ sec |
1207 | */ | | 1223 | */ |
1208 | | | 1224 | |
1209 | /* calculate elapsed raw count */ | | 1225 | /* calculate elapsed raw count */ |
1210 | tcount = pps->capcount - pps->ppscount[2]; | | 1226 | tcount = pps->capcount - pps->ppscount[2]; |
1211 | pps->ppscount[2] = pps->capcount; | | 1227 | pps->ppscount[2] = pps->capcount; |
1212 | tcount &= pps->capth->th_counter->tc_counter_mask; | | 1228 | tcount &= pps->capth->th_counter->tc_counter_mask; |
1213 | | | 1229 | |
1214 | /* calculate elapsed ref time */ | | 1230 | /* calculate elapsed ref time */ |
1215 | btd = bt_ref; | | 1231 | btd = bt_ref; |
1216 | bintime_sub(&btd, &pps->ref_time); | | 1232 | bintime_sub(&btd, &pps->ref_time); |
1217 | pps->ref_time = bt_ref; | | 1233 | pps->ref_time = bt_ref; |
1218 | | | 1234 | |
1219 | /* check that we stay below 2 sec */ | | 1235 | /* check that we stay below 2 sec */ |
1220 | if (btd.sec < 0 || btd.sec > 1) | | 1236 | if (btd.sec < 0 || btd.sec > 1) |
1221 | return; | | 1237 | return; |
1222 | | | 1238 | |
1223 | /* we want at least 0.5 sec between samples */ | | 1239 | /* we want at least 0.5 sec between samples */ |
1224 | if (btd.sec == 0 && btd.frac < (uint64_t)1<<63) | | 1240 | if (btd.sec == 0 && btd.frac < (uint64_t)1<<63) |
1225 | return; | | 1241 | return; |
1226 | | | 1242 | |
1227 | /* | | 1243 | /* |
1228 | * calculate cycles per period by multiplying | | 1244 | * calculate cycles per period by multiplying |
1229 | * the frequency with the elapsed period | | 1245 | * the frequency with the elapsed period |
1230 | * we pick a fraction of 30 bits | | 1246 | * we pick a fraction of 30 bits |
1231 | * ~1ns resolution for elapsed time | | 1247 | * ~1ns resolution for elapsed time |
1232 | */ | | 1248 | */ |
1233 | div = (uint64_t)btd.sec << 30; | | 1249 | div = (uint64_t)btd.sec << 30; |
1234 | div |= (btd.frac >> 34) & (((uint64_t)1 << 30) - 1); | | 1250 | div |= (btd.frac >> 34) & (((uint64_t)1 << 30) - 1); |
1235 | div *= pps->capth->th_counter->tc_frequency; | | 1251 | div *= pps->capth->th_counter->tc_frequency; |
1236 | div >>= 30; | | 1252 | div >>= 30; |
1237 | | | 1253 | |
1238 | if (div == 0) /* safeguard */ | | 1254 | if (div == 0) /* safeguard */ |
1239 | return; | | 1255 | return; |
1240 | | | 1256 | |
1241 | scale = (uint64_t)1 << 63; | | 1257 | scale = (uint64_t)1 << 63; |
1242 | scale /= div; | | 1258 | scale /= div; |
1243 | scale *= 2; | | 1259 | scale *= 2; |
1244 | | | 1260 | |
1245 | bt.sec = 0; | | 1261 | bt.sec = 0; |
1246 | bt.frac = 0; | | 1262 | bt.frac = 0; |
1247 | bintime_addx(&bt, scale * tcount); | | 1263 | bintime_addx(&bt, scale * tcount); |
1248 | bintime2timespec(&bt, &ts); | | 1264 | bintime2timespec(&bt, &ts); |
1249 | | | 1265 | |
1250 | #ifdef PPS_DEBUG | | 1266 | #ifdef PPS_DEBUG |
1251 | if (ppsdebug & 0x4) { | | 1267 | if (ppsdebug & 0x4) { |
1252 | struct timespec ts2; | | 1268 | struct timespec ts2; |
1253 | int64_t df; | | 1269 | int64_t df; |
1254 | | | 1270 | |
1255 | bintime2timespec(&bt_ref, &ts2); | | 1271 | bintime2timespec(&bt_ref, &ts2); |
1256 | df = timespec2ns(&ts); | | 1272 | df = timespec2ns(&ts); |
1257 | if (df > 500000000) | | 1273 | if (df > 500000000) |
1258 | df -= 1000000000; | | 1274 | df -= 1000000000; |
1259 | log(LOG_DEBUG, "hardpps: ref_ts=%"PRIi64 | | 1275 | log(LOG_DEBUG, "hardpps: ref_ts=%"PRIi64 |
1260 | ".%09"PRIi32", ts=%"PRIi64".%09"PRIi32 | | 1276 | ".%09"PRIi32", ts=%"PRIi64".%09"PRIi32 |
1261 | ", freqdiff=%"PRIi64" ns/s\n", | | 1277 | ", freqdiff=%"PRIi64" ns/s\n", |
1262 | ts2.tv_sec, (int32_t)ts2.tv_nsec, | | 1278 | ts2.tv_sec, (int32_t)ts2.tv_nsec, |
1263 | tsp->tv_sec, (int32_t)tsp->tv_nsec, | | 1279 | tsp->tv_sec, (int32_t)tsp->tv_nsec, |
1264 | df); | | 1280 | df); |
1265 | } | | 1281 | } |
1266 | #endif | | 1282 | #endif |
1267 | | | 1283 | |
1268 | hardpps(tsp, timespec2ns(&ts)); | | 1284 | hardpps(tsp, timespec2ns(&ts)); |
1269 | } | | 1285 | } |
1270 | #endif | | 1286 | #endif |
1271 | } | | 1287 | } |
1272 | | | 1288 | |
1273 | /* | | 1289 | /* |
1274 | * Timecounters need to be updated every so often to prevent the hardware | | 1290 | * Timecounters need to be updated every so often to prevent the hardware |
1275 | * counter from overflowing. Updating also recalculates the cached values | | 1291 | * counter from overflowing. Updating also recalculates the cached values |
1276 | * used by the get*() family of functions, so their precision depends on | | 1292 | * used by the get*() family of functions, so their precision depends on |
1277 | * the update frequency. | | 1293 | * the update frequency. |
1278 | */ | | 1294 | */ |
1279 | | | 1295 | |
1280 | static int tc_tick; | | 1296 | static int tc_tick; |
1281 | | | 1297 | |
1282 | void | | 1298 | void |
1283 | tc_ticktock(void) | | 1299 | tc_ticktock(void) |
1284 | { | | 1300 | { |
1285 | static int count; | | 1301 | static int count; |
1286 | | | 1302 | |
1287 | if (++count < tc_tick) | | 1303 | if (++count < tc_tick) |
1288 | return; | | 1304 | return; |
1289 | count = 0; | | 1305 | count = 0; |
1290 | mutex_spin_enter(&timecounter_lock); | | 1306 | mutex_spin_enter(&timecounter_lock); |
1291 | if (timecounter_bad != 0) { | | 1307 | if (timecounter_bad != 0) { |
1292 | /* An existing timecounter has gone bad, pick a new one. */ | | 1308 | /* An existing timecounter has gone bad, pick a new one. */ |
1293 | (void)atomic_swap_uint(&timecounter_bad, 0); | | 1309 | (void)atomic_swap_uint(&timecounter_bad, 0); |
1294 | if (timecounter->tc_quality < 0) { | | 1310 | if (timecounter->tc_quality < 0) { |
1295 | tc_pick(); | | 1311 | tc_pick(); |
1296 | } | | 1312 | } |
1297 | } | | 1313 | } |
1298 | tc_windup(); | | 1314 | tc_windup(); |
1299 | mutex_spin_exit(&timecounter_lock); | | 1315 | mutex_spin_exit(&timecounter_lock); |
1300 | } | | 1316 | } |
1301 | | | 1317 | |
1302 | void | | 1318 | void |
1303 | inittimecounter(void) | | 1319 | inittimecounter(void) |
1304 | { | | 1320 | { |
1305 | u_int p; | | 1321 | u_int p; |
1306 | | | 1322 | |
1307 | mutex_init(&timecounter_lock, MUTEX_DEFAULT, IPL_HIGH); | | 1323 | mutex_init(&timecounter_lock, MUTEX_DEFAULT, IPL_HIGH); |
1308 | | | 1324 | |
1309 | /* | | 1325 | /* |
1310 | * Set the initial timeout to | | 1326 | * Set the initial timeout to |
1311 | * max(1, <approx. number of hardclock ticks in a millisecond>). | | 1327 | * max(1, <approx. number of hardclock ticks in a millisecond>). |
1312 | * People should probably not use the sysctl to set the timeout | | 1328 | * People should probably not use the sysctl to set the timeout |
1313 | * to smaller than its inital value, since that value is the | | 1329 | * to smaller than its inital value, since that value is the |
1314 | * smallest reasonable one. If they want better timestamps they | | 1330 | * smallest reasonable one. If they want better timestamps they |
1315 | * should use the non-"get"* functions. | | 1331 | * should use the non-"get"* functions. |
1316 | */ | | 1332 | */ |
1317 | if (hz > 1000) | | 1333 | if (hz > 1000) |
1318 | tc_tick = (hz + 500) / 1000; | | 1334 | tc_tick = (hz + 500) / 1000; |
1319 | else | | 1335 | else |
1320 | tc_tick = 1; | | 1336 | tc_tick = 1; |
1321 | p = (tc_tick * 1000000) / hz; | | 1337 | p = (tc_tick * 1000000) / hz; |
1322 | aprint_verbose("timecounter: Timecounters tick every %d.%03u msec\n", | | 1338 | aprint_verbose("timecounter: Timecounters tick every %d.%03u msec\n", |
1323 | p / 1000, p % 1000); | | 1339 | p / 1000, p % 1000); |
1324 | | | 1340 | |
1325 | /* warm up new timecounter (again) and get rolling. */ | | 1341 | /* warm up new timecounter (again) and get rolling. */ |
1326 | (void)timecounter->tc_get_timecount(timecounter); | | 1342 | (void)timecounter->tc_get_timecount(timecounter); |
1327 | (void)timecounter->tc_get_timecount(timecounter); | | 1343 | (void)timecounter->tc_get_timecount(timecounter); |
1328 | } | | 1344 | } |