forked from Minki/linux
2760105516
The current implementation of time64_to_tm() contains unnecessary loops, branches and look-up tables. The new one uses an arithmetic-based algorithm appeared in [1] and is approximately 3x faster (YMMV). The drawback is that the new code isn't intuitive and contains many 'magic numbers' (not unusual for this type of algorithm). However, [1] justifies all those numbers and, given this function's history, the code is unlikely to need much maintenance, if any at all. Add a KUnit test for it which checks every day in a 160,000 years interval centered at 1970-01-01 against the expected result. [1] Neri, Schneider, "Euclidean Affine Functions and Applications to Calendar Algorithms". https://arxiv.org/abs/2102.06959 Signed-off-by: Cassio Neri <cassio.neri@gmail.com> Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Link: https://lore.kernel.org/r/20210622213616.313046-1-cassio.neri@gmail.com
26 lines
986 B
Makefile
26 lines
986 B
Makefile
# SPDX-License-Identifier: GPL-2.0
|
|
obj-y += time.o timer.o hrtimer.o
|
|
obj-y += timekeeping.o ntp.o clocksource.o jiffies.o timer_list.o
|
|
obj-y += timeconv.o timecounter.o alarmtimer.o
|
|
|
|
ifeq ($(CONFIG_POSIX_TIMERS),y)
|
|
obj-y += posix-timers.o posix-cpu-timers.o posix-clock.o itimer.o
|
|
else
|
|
obj-y += posix-stubs.o
|
|
endif
|
|
|
|
obj-$(CONFIG_GENERIC_CLOCKEVENTS) += clockevents.o tick-common.o
|
|
ifeq ($(CONFIG_GENERIC_CLOCKEVENTS_BROADCAST),y)
|
|
obj-y += tick-broadcast.o
|
|
obj-$(CONFIG_TICK_ONESHOT) += tick-broadcast-hrtimer.o
|
|
endif
|
|
obj-$(CONFIG_GENERIC_SCHED_CLOCK) += sched_clock.o
|
|
obj-$(CONFIG_TICK_ONESHOT) += tick-oneshot.o tick-sched.o
|
|
obj-$(CONFIG_LEGACY_TIMER_TICK) += tick-legacy.o
|
|
obj-$(CONFIG_HAVE_GENERIC_VDSO) += vsyscall.o
|
|
obj-$(CONFIG_DEBUG_FS) += timekeeping_debug.o
|
|
obj-$(CONFIG_TEST_UDELAY) += test_udelay.o
|
|
obj-$(CONFIG_TIME_NS) += namespace.o
|
|
obj-$(CONFIG_TEST_CLOCKSOURCE_WATCHDOG) += clocksource-wdtest.o
|
|
obj-$(CONFIG_TIME_KUNIT_TEST) += time_test.o
|