On Mon, Aug 25, 2014 at 03:40:08PM +0200, Javier Martinez Canillas wrote:
From: Todd Broch tbr...@chromium.org
Previous algorithm was a bit conservative and complicating with
respect to identifying key ghosting. This CL uses the bitops hamming
weight function (hweight8) to count the number
From: Todd Broch tbr...@chromium.org
Previous algorithm was a bit conservative and complicating with
respect to identifying key ghosting. This CL uses the bitops hamming
weight function (hweight8) to count the number of matching rows for
colM colN. If that number is 1 ghosting is present.
