On Fri, 6 May 2016 17:42:42 +0800 zengzhao...@163.com wrote:
> From: Zhaoxiu Zeng
>
> The binary GCD algorithm is based on the following facts:
> 1. If a and b are all evens, then gcd(a,b) = 2 * gcd(a/2, b/2)
> 2. If a is even and b is odd, then gcd(a,b) = gcd(a/2, b)
> 3. If
On 05/02, Jose Abreu wrote:
> The ARC SDP I2S clock can be programmed using a
> specific PLL.
>
> This patch has the goal of adding a clock driver
> that programs this PLL.
>
> At this moment the rate values are hardcoded in
> a table but in the future it would be ideal to
> use a function which
Hi Linus,
Late in the cycle, but this has fixes for couple of issues: a PAE40 boot crash
and
Arnd spotting lack of barriers in BE io-accessors. The 3rd patch for enabling
highmem in low physical mem ;-) honestly is more than a "fix" but its been in
works for some time, seems to be stable in testi
From: Zhaoxiu Zeng
The binary GCD algorithm is based on the following facts:
1. If a and b are all evens, then gcd(a,b) = 2 * gcd(a/2, b/2)
2. If a is even and b is odd, then gcd(a,b) = gcd(a/2, b)
3. If a and b are all odds, then gcd(a,b) = gcd((a-b)/2, b) =
gcd((a+b)/2,
