linux-kernel - Re: [PATCH 3/4] calibrate: retry with wider bounds when converge seems to fail

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Date:	Fri, 11 Mar 2011 15:27:44 -0800
From:	Andrew Morton <akpm@...ux-foundation.org>
To:	Phil Carmody <ext-phil.2.carmody@...ia.com>
Cc:	gregkh@...e.de, linux-kernel@...r.kernel.org, sboyd@...eaurora.org
Subject: Re: [PATCH 3/4] calibrate: retry with wider bounds when converge
 seems to fail

On Thu, 10 Mar 2011 16:48:06 +0200
Phil Carmody <ext-phil.2.carmody@...ia.com> wrote:

> Systems with unmaskable interrupts such as SMIs may massively underestimate
> loops_per_jiffy, and fail to converge anywhere near the real value. A case
> seen on x86_64 was an initial estimate of 256<<12, which converged to 511<<12
> where the real value should have been over 630<<12. This admitedly requires
> bypassing the TSC calibration (lpj_fine), and a failure to settle in the
> direct calibration too, but is physically possible. This failure does not
> depend on my previous calibration optimisation, but by luck is easy to fix
> with the optimisation in place with a trivial retry loop.
> 
> In the context of the optimised converging method, as we can no longer trust
> the starting estimate, enlarge the search bounds exponentially so that the
> number of retries is logarithmically bounded.
> 
> ...
>
> @@ -165,6 +169,16 @@ static unsigned long __cpuinit calibrate_delay_converge(void)
>  			lpj -= loopadd;
>  		loopadd >>= 1;
>  	}
> +	/*
> +	 * If we incremented every single time possible, presume we've
> +	 * massively underestimated initially, and retry with a higher
> +	 * start, and larger range. (Only seen on x86_64.)
> +	 */
> +	if (lpj + loopadd * 2 == lpj_base + loopadd_base * 2) {
> +		lpj_base = lpj;
> +		loopadd_base <<= 2;
> +		goto recalibrate;
> +	}

This is more informative, no?

--- a/init/calibrate.c~calibrate-retry-with-wider-bounds-when-converge-seems-to-fail-fix
+++ a/init/calibrate.c
@@ -172,7 +172,7 @@ recalibrate:
 	/*
 	 * If we incremented every single time possible, presume we've
 	 * massively underestimated initially, and retry with a higher
-	 * start, and larger range. (Only seen on x86_64.)
+	 * start, and larger range. (Only seen on x86_64, due to SMIs)
 	 */
 	if (lpj + loopadd * 2 == lpj_base + loopadd_base * 2) {
 		lpj_base = lpj;
_

--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/