Prev: Make kernel-doc ignore __init_or_module
Next: Regression: my systems can no longer boot from an ide hard drive
From: tip-bot for John Stultz on 23 Mar 2010 11:50 Commit-ID: 830ec0458c390f29c6c99e1ff7feab9e36368d12 Gitweb: http://git.kernel.org/tip/830ec0458c390f29c6c99e1ff7feab9e36368d12 Author: John Stultz <johnstul(a)us.ibm.com> AuthorDate: Thu, 18 Mar 2010 14:47:30 -0700 Committer: Thomas Gleixner <tglx(a)linutronix.de> CommitDate: Tue, 23 Mar 2010 16:41:01 +0100 time: Fix accumulation bug triggered by long delay. The logarithmic accumulation done in the timekeeping has some overflow protection that limits the max shift value. That means it will take more then shift loops to accumulate all of the cycles. This causes the shift decrement to underflow, which causes the loop to never exit. The simplest fix would be simply to do a: if (shift) shift--; However that is not optimal, as we know the cycle offset is larger then the interval << shift, the above would make shift drop to zero, then we would be spinning for quite awhile accumulating at interval chunks at a time. Instead, this patch only decreases shift if the offset is smaller then cycle_interval << shift. This makes sure we accumulate using the largest chunks possible without overflowing tick_length, and limits the number of iterations through the loop. This issue was found and reported by Sonic Zhang, who also tested the fix. Many thanks your explanation and testing! Reported-by: Sonic Zhang <sonic.adi(a)gmail.com> Signed-off-by: John Stultz <johnstul(a)us.ibm.com> Tested-by: Sonic Zhang <sonic.adi(a)gmail.com> LKML-Reference: <1268948850-5225-1-git-send-email-johnstul(a)us.ibm.com> Signed-off-by: Thomas Gleixner <tglx(a)linutronix.de> --- kernel/time/timekeeping.c | 3 ++- 1 files changed, 2 insertions(+), 1 deletions(-) diff --git a/kernel/time/timekeeping.c b/kernel/time/timekeeping.c index 1673637..39f6177 100644 --- a/kernel/time/timekeeping.c +++ b/kernel/time/timekeeping.c @@ -818,7 +818,8 @@ void update_wall_time(void) shift = min(shift, maxshift); while (offset >= timekeeper.cycle_interval) { offset = logarithmic_accumulation(offset, shift); - shift--; + if(offset < timekeeper.cycle_interval<<shift) + shift--; } /* correct the clock when NTP error is too big */ -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo(a)vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/ |