commit | b0c1154ffda8604e211ce4e8d029b1cbb5d893ac | [log] [tgz] |
---|---|---|
author | David Hendricks <dhendrix@chromium.org> | Wed Mar 09 23:26:06 2011 |
committer | David Hendricks <dhendrix@chromium.org> | Wed Mar 09 23:26:06 2011 |
tree | 724eade2608f1d7b503f019ec020fa9e7fe157a0 | |
parent | 6d62d75b8b58a1a75a7d98d4aa22022eee546bbe [diff] |
dynamically generate strides in fmap_find() to cover all of ROM This changes the hard coded array of strides to cover with an algorithm that will result in every bit of the ROM being checked. Now the algorithm starts at 1/2 the ROM's total size and divides its stride by 2 on each iteration. BUG= TEST=Tested on Alex with an FMAP structure at various alignments (2M, 1M, 64K, 4K, 16, 5, 1). Review URL: http://codereview.chromium.org/6612048