2005-04-17 02:20:36 +04:00
|
|
|
/*****************************************************************************
|
|
|
|
* *
|
|
|
|
* Copyright (c) David L. Mills 1993 *
|
|
|
|
* *
|
|
|
|
* Permission to use, copy, modify, and distribute this software and its *
|
|
|
|
* documentation for any purpose and without fee is hereby granted, provided *
|
|
|
|
* that the above copyright notice appears in all copies and that both the *
|
|
|
|
* copyright notice and this permission notice appear in supporting *
|
|
|
|
* documentation, and that the name University of Delaware not be used in *
|
|
|
|
* advertising or publicity pertaining to distribution of the software *
|
|
|
|
* without specific, written prior permission. The University of Delaware *
|
|
|
|
* makes no representations about the suitability this software for any *
|
|
|
|
* purpose. It is provided "as is" without express or implied warranty. *
|
|
|
|
* *
|
|
|
|
*****************************************************************************/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Modification history timex.h
|
|
|
|
*
|
|
|
|
* 29 Dec 97 Russell King
|
|
|
|
* Moved CLOCK_TICK_RATE, CLOCK_TICK_FACTOR and FINETUNE to asm/timex.h
|
|
|
|
* for ARM machines
|
|
|
|
*
|
|
|
|
* 9 Jan 97 Adrian Sun
|
|
|
|
* Shifted LATCH define to allow access to alpha machines.
|
|
|
|
*
|
|
|
|
* 26 Sep 94 David L. Mills
|
|
|
|
* Added defines for hybrid phase/frequency-lock loop.
|
|
|
|
*
|
|
|
|
* 19 Mar 94 David L. Mills
|
|
|
|
* Moved defines from kernel routines to header file and added new
|
|
|
|
* defines for PPS phase-lock loop.
|
|
|
|
*
|
|
|
|
* 20 Feb 94 David L. Mills
|
|
|
|
* Revised status codes and structures for external clock and PPS
|
|
|
|
* signal discipline.
|
|
|
|
*
|
|
|
|
* 28 Nov 93 David L. Mills
|
|
|
|
* Adjusted parameters to improve stability and increase poll
|
|
|
|
* interval.
|
|
|
|
*
|
|
|
|
* 17 Sep 93 David L. Mills
|
|
|
|
* Created file $NTP/include/sys/timex.h
|
|
|
|
* 07 Oct 93 Torsten Duwe
|
|
|
|
* Derived linux/timex.h
|
|
|
|
* 1995-08-13 Torsten Duwe
|
|
|
|
* kernel PLL updated to 1994-12-13 specs (rfc-1589)
|
|
|
|
* 1997-08-30 Ulrich Windl
|
|
|
|
* Added new constant NTP_PHASE_LIMIT
|
|
|
|
* 2004-08-12 Christoph Lameter
|
|
|
|
* Reworked time interpolation logic
|
|
|
|
*/
|
|
|
|
#ifndef _LINUX_TIMEX_H
|
|
|
|
#define _LINUX_TIMEX_H
|
|
|
|
|
2012-10-13 13:46:48 +04:00
|
|
|
#include <uapi/linux/timex.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2008-08-21 03:46:08 +04:00
|
|
|
#define ADJ_ADJTIME 0x8000 /* switch between adjtime/adjtimex modes */
|
|
|
|
#define ADJ_OFFSET_SINGLESHOT 0x0001 /* old-fashioned adjtime */
|
|
|
|
#define ADJ_OFFSET_READONLY 0x2000 /* read-only adjtime */
|
2008-12-02 01:18:11 +03:00
|
|
|
#include <linux/compiler.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/param.h>
|
|
|
|
|
timekeeping: Add raw clock fallback for random_get_entropy()
The addition of random_get_entropy_fallback() provides access to
whichever time source has the highest frequency, which is useful for
gathering entropy on platforms without available cycle counters. It's
not necessarily as good as being able to quickly access a cycle counter
that the CPU has, but it's still something, even when it falls back to
being jiffies-based.
In the event that a given arch does not define get_cycles(), falling
back to the get_cycles() default implementation that returns 0 is really
not the best we can do. Instead, at least calling
random_get_entropy_fallback() would be preferable, because that always
needs to return _something_, even falling back to jiffies eventually.
It's not as though random_get_entropy_fallback() is super high precision
or guaranteed to be entropic, but basically anything that's not zero all
the time is better than returning zero all the time.
Finally, since random_get_entropy_fallback() is used during extremely
early boot when randomizing freelists in mm_init(), it can be called
before timekeeping has been initialized. In that case there really is
nothing we can do; jiffies hasn't even started ticking yet. So just give
up and return 0.
Suggested-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Jason A. Donenfeld <Jason@zx2c4.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Cc: Arnd Bergmann <arnd@arndb.de>
Cc: Theodore Ts'o <tytso@mit.edu>
2022-04-10 17:49:50 +03:00
|
|
|
unsigned long random_get_entropy_fallback(void);
|
|
|
|
|
2006-09-13 07:36:03 +04:00
|
|
|
#include <asm/timex.h>
|
|
|
|
|
2013-09-21 21:58:22 +04:00
|
|
|
#ifndef random_get_entropy
|
|
|
|
/*
|
|
|
|
* The random_get_entropy() function is used by the /dev/random driver
|
|
|
|
* in order to extract entropy via the relative unpredictability of
|
|
|
|
* when an interrupt takes places versus a high speed, fine-grained
|
|
|
|
* timing source or cycle counter. Since it will be occurred on every
|
|
|
|
* single interrupt, it must have a very low cost/overhead.
|
|
|
|
*
|
|
|
|
* By default we use get_cycles() for this purpose, but individual
|
|
|
|
* architectures may override this in their asm/timex.h header file.
|
timekeeping: Add raw clock fallback for random_get_entropy()
The addition of random_get_entropy_fallback() provides access to
whichever time source has the highest frequency, which is useful for
gathering entropy on platforms without available cycle counters. It's
not necessarily as good as being able to quickly access a cycle counter
that the CPU has, but it's still something, even when it falls back to
being jiffies-based.
In the event that a given arch does not define get_cycles(), falling
back to the get_cycles() default implementation that returns 0 is really
not the best we can do. Instead, at least calling
random_get_entropy_fallback() would be preferable, because that always
needs to return _something_, even falling back to jiffies eventually.
It's not as though random_get_entropy_fallback() is super high precision
or guaranteed to be entropic, but basically anything that's not zero all
the time is better than returning zero all the time.
Finally, since random_get_entropy_fallback() is used during extremely
early boot when randomizing freelists in mm_init(), it can be called
before timekeeping has been initialized. In that case there really is
nothing we can do; jiffies hasn't even started ticking yet. So just give
up and return 0.
Suggested-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Jason A. Donenfeld <Jason@zx2c4.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Cc: Arnd Bergmann <arnd@arndb.de>
Cc: Theodore Ts'o <tytso@mit.edu>
2022-04-10 17:49:50 +03:00
|
|
|
* If a given arch does not have get_cycles(), then we fallback to
|
|
|
|
* using random_get_entropy_fallback().
|
2013-09-21 21:58:22 +04:00
|
|
|
*/
|
timekeeping: Add raw clock fallback for random_get_entropy()
The addition of random_get_entropy_fallback() provides access to
whichever time source has the highest frequency, which is useful for
gathering entropy on platforms without available cycle counters. It's
not necessarily as good as being able to quickly access a cycle counter
that the CPU has, but it's still something, even when it falls back to
being jiffies-based.
In the event that a given arch does not define get_cycles(), falling
back to the get_cycles() default implementation that returns 0 is really
not the best we can do. Instead, at least calling
random_get_entropy_fallback() would be preferable, because that always
needs to return _something_, even falling back to jiffies eventually.
It's not as though random_get_entropy_fallback() is super high precision
or guaranteed to be entropic, but basically anything that's not zero all
the time is better than returning zero all the time.
Finally, since random_get_entropy_fallback() is used during extremely
early boot when randomizing freelists in mm_init(), it can be called
before timekeeping has been initialized. In that case there really is
nothing we can do; jiffies hasn't even started ticking yet. So just give
up and return 0.
Suggested-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Jason A. Donenfeld <Jason@zx2c4.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Cc: Arnd Bergmann <arnd@arndb.de>
Cc: Theodore Ts'o <tytso@mit.edu>
2022-04-10 17:49:50 +03:00
|
|
|
#ifdef get_cycles
|
2022-04-08 19:14:57 +03:00
|
|
|
#define random_get_entropy() ((unsigned long)get_cycles())
|
timekeeping: Add raw clock fallback for random_get_entropy()
The addition of random_get_entropy_fallback() provides access to
whichever time source has the highest frequency, which is useful for
gathering entropy on platforms without available cycle counters. It's
not necessarily as good as being able to quickly access a cycle counter
that the CPU has, but it's still something, even when it falls back to
being jiffies-based.
In the event that a given arch does not define get_cycles(), falling
back to the get_cycles() default implementation that returns 0 is really
not the best we can do. Instead, at least calling
random_get_entropy_fallback() would be preferable, because that always
needs to return _something_, even falling back to jiffies eventually.
It's not as though random_get_entropy_fallback() is super high precision
or guaranteed to be entropic, but basically anything that's not zero all
the time is better than returning zero all the time.
Finally, since random_get_entropy_fallback() is used during extremely
early boot when randomizing freelists in mm_init(), it can be called
before timekeeping has been initialized. In that case there really is
nothing we can do; jiffies hasn't even started ticking yet. So just give
up and return 0.
Suggested-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Jason A. Donenfeld <Jason@zx2c4.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Cc: Arnd Bergmann <arnd@arndb.de>
Cc: Theodore Ts'o <tytso@mit.edu>
2022-04-10 17:49:50 +03:00
|
|
|
#else
|
|
|
|
#define random_get_entropy() random_get_entropy_fallback()
|
|
|
|
#endif
|
2013-09-21 21:58:22 +04:00
|
|
|
#endif
|
|
|
|
|
2008-12-02 01:18:11 +03:00
|
|
|
/*
|
2009-05-06 13:43:57 +04:00
|
|
|
* SHIFT_PLL is used as a dampening factor to define how much we
|
|
|
|
* adjust the frequency correction for a given offset in PLL mode.
|
|
|
|
* It also used in dampening the offset correction, to define how
|
|
|
|
* much of the current value in time_offset we correct for each
|
|
|
|
* second. Changing this value changes the stiffness of the ntp
|
|
|
|
* adjustment code. A lower value makes it more flexible, reducing
|
|
|
|
* NTP convergence time. A higher value makes it stiffer, increasing
|
|
|
|
* convergence time, but making the clock more stable.
|
2008-12-02 01:18:11 +03:00
|
|
|
*
|
2009-05-12 05:13:13 +04:00
|
|
|
* In David Mills' nanokernel reference implementation SHIFT_PLL is 4.
|
2009-05-06 13:43:57 +04:00
|
|
|
* However this seems to increase convergence time much too long.
|
|
|
|
*
|
|
|
|
* https://lists.ntp.org/pipermail/hackers/2008-January/003487.html
|
|
|
|
*
|
|
|
|
* In the above mailing list discussion, it seems the value of 4
|
|
|
|
* was appropriate for other Unix systems with HZ=100, and that
|
|
|
|
* SHIFT_PLL should be decreased as HZ increases. However, Linux's
|
|
|
|
* clock steering implementation is HZ independent.
|
|
|
|
*
|
|
|
|
* Through experimentation, a SHIFT_PLL value of 2 was found to allow
|
|
|
|
* for fast convergence (very similar to the NTPv3 code used prior to
|
|
|
|
* v2.6.19), with good clock stability.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* SHIFT_FLL is used as a dampening factor to define how much we
|
|
|
|
* adjust the frequency correction for a given offset in FLL mode.
|
2009-05-12 05:13:13 +04:00
|
|
|
* In David Mills' nanokernel reference implementation SHIFT_FLL is 2.
|
2009-05-06 13:43:57 +04:00
|
|
|
*
|
|
|
|
* MAXTC establishes the maximum time constant of the PLL.
|
2008-12-02 01:18:11 +03:00
|
|
|
*/
|
2009-05-06 13:43:57 +04:00
|
|
|
#define SHIFT_PLL 2 /* PLL frequency factor (shift) */
|
2008-12-02 01:18:11 +03:00
|
|
|
#define SHIFT_FLL 2 /* FLL frequency factor (shift) */
|
|
|
|
#define MAXTC 10 /* maximum time constant (shift) */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* SHIFT_USEC defines the scaling (shift) of the time_freq and
|
|
|
|
* time_tolerance variables, which represent the current frequency
|
|
|
|
* offset and maximum frequency tolerance.
|
|
|
|
*/
|
|
|
|
#define SHIFT_USEC 16 /* frequency offset scale (shift) */
|
2009-02-22 17:48:43 +03:00
|
|
|
#define PPM_SCALE ((s64)NSEC_PER_USEC << (NTP_SCALE_SHIFT - SHIFT_USEC))
|
2008-12-02 01:18:11 +03:00
|
|
|
#define PPM_SCALE_INV_SHIFT 19
|
2009-05-06 13:43:57 +04:00
|
|
|
#define PPM_SCALE_INV ((1LL << (PPM_SCALE_INV_SHIFT + NTP_SCALE_SHIFT)) / \
|
2008-12-02 01:18:11 +03:00
|
|
|
PPM_SCALE + 1)
|
|
|
|
|
2009-05-06 13:43:57 +04:00
|
|
|
#define MAXPHASE 500000000L /* max phase error (ns) */
|
2008-12-02 01:18:11 +03:00
|
|
|
#define MAXFREQ 500000 /* max frequency error (ns/s) */
|
|
|
|
#define MAXFREQ_SCALED ((s64)MAXFREQ << NTP_SCALE_SHIFT)
|
|
|
|
#define MINSEC 256 /* min interval between updates (s) */
|
|
|
|
#define MAXSEC 2048 /* max interval between updates (s) */
|
|
|
|
#define NTP_PHASE_LIMIT ((MAXPHASE / NSEC_PER_USEC) << 5) /* beyond max. dispersion */
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* kernel variables
|
2021-03-23 00:39:03 +03:00
|
|
|
* Note: maximum error = NTP sync distance = dispersion + delay / 2;
|
2005-04-17 02:20:36 +04:00
|
|
|
* estimated error = NTP dispersion.
|
|
|
|
*/
|
|
|
|
extern unsigned long tick_usec; /* USER_HZ period (usec) */
|
2012-07-27 22:48:10 +04:00
|
|
|
extern unsigned long tick_nsec; /* SHIFTED_HZ period (nsec) */
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2005-10-31 02:01:42 +03:00
|
|
|
/* Required to safely shift negative values */
|
|
|
|
#define shift_right(x, s) ({ \
|
|
|
|
__typeof__(x) __x = (x); \
|
|
|
|
__typeof__(s) __s = (s); \
|
|
|
|
__x < 0 ? -(-__x >> __s) : __x >> __s; \
|
|
|
|
})
|
|
|
|
|
2008-05-01 15:34:38 +04:00
|
|
|
#define NTP_SCALE_SHIFT 32
|
2006-06-26 11:25:18 +04:00
|
|
|
|
2007-02-16 12:27:26 +03:00
|
|
|
#define NTP_INTERVAL_FREQ (HZ)
|
time: remove obsolete CLOCK_TICK_ADJUST
The first version of the ntp_interval/tick_length inconsistent usage patch was
recently merged as bbe4d18ac2e058c56adb0cd71f49d9ed3216a405
http://git.kernel.org/gitweb.cgi?p=linux/kernel/git/torvalds/linux-2.6.git;a=commit;h=bbe4d18ac2e058c56adb0cd71f49d9ed3216a405
While the fix did greatly improve the situation, it was correctly pointed out
by Roman that it does have a small bug: If the users change clocksources after
the system has been running and NTP has made corrections, the correctoins made
against the old clocksource will be applied against the new clocksource,
causing error.
The second attempt, which corrects the issue in the NTP_INTERVAL_LENGTH
definition has also made it up-stream as commit
e13a2e61dd5152f5499d2003470acf9c838eab84
http://git.kernel.org/gitweb.cgi?p=linux/kernel/git/torvalds/linux-2.6.git;a=commit;h=e13a2e61dd5152f5499d2003470acf9c838eab84
Roman has correctly pointed out that CLOCK_TICK_ADJUST is calculated
based on the PIT's frequency, and isn't really relevant to non-PIT
driven clocksources (that is, clocksources other then jiffies and pit).
This patch reverts both of those changes, and simply removes
CLOCK_TICK_ADJUST.
This does remove the granularity error correction for users of PIT and Jiffies
clocksource users, but the granularity error but for the majority of users, it
should be within the 500ppm range NTP can accommodate for.
For systems that have granularity errors greater then 500ppm, the
"ntp_tick_adj=" boot option can be used to compensate.
[johnstul@us.ibm.com: provided changelog]
[mattilinnanvuori@yahoo.com: maek ntp_tick_adj static]
Signed-off-by: Roman Zippel <zippel@linux-m68k.org>
Acked-by: john stultz <johnstul@us.ibm.com>
Signed-off-by: Matti Linnanvuori <mattilinnanvuori@yahoo.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Cc: mingo@elte.hu
Signed-off-by: Thomas Gleixner <tglx@linutronix.de>
2008-03-05 02:14:26 +03:00
|
|
|
#define NTP_INTERVAL_LENGTH (NSEC_PER_SEC/NTP_INTERVAL_FREQ)
|
2007-02-16 12:27:26 +03:00
|
|
|
|
2018-07-03 08:44:21 +03:00
|
|
|
extern int do_adjtimex(struct __kernel_timex *);
|
|
|
|
extern int do_clock_adjtime(const clockid_t which_clock, struct __kernel_timex * ktx);
|
2019-01-03 23:12:39 +03:00
|
|
|
|
2015-09-28 23:21:28 +03:00
|
|
|
extern void hardpps(const struct timespec64 *, const struct timespec64 *);
|
2006-03-26 13:37:29 +04:00
|
|
|
|
2008-02-06 12:36:42 +03:00
|
|
|
int read_current_timer(unsigned long *timer_val);
|
|
|
|
|
2009-06-17 02:31:12 +04:00
|
|
|
/* The clock frequency of the i8253/i8254 PIT */
|
|
|
|
#define PIT_TICK_RATE 1193182ul
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
#endif /* LINUX_TIMEX_H */
|