Lines Matching refs:so

19 However NAND flash is not extremely reliable so some error detection
57 so the sum of all bit0, bit2, bit4 and bit6 values + cp0 itself is even.
69 (so handle two bytes, then skip 2 bytes).
72 so rp4 calculates parity over bytes 0, 1, 2, 3, 8, 9, 10, 11, 16, ...)
73 and rp5 covers the other half, so bytes 4, 5, 6, 7, 12, 13, 14, 15, 20, ..
96 Oh well, I'm graphically challenged, so suffer with me for a moment :-)
156 Fortunately the exclusive or operation is commutative, so we can combine
249 all data is 0xff, so the checksum then matches.
268 every modern microprocessor supports 32 bit operations, so why not try
437 or so. I also tried on an eeePC (Celeron, clocked at 900 Mhz). Interesting
441 Well, it was expected not to be easy so maybe instead move to a
493 Effectively so all odd digit rp assignments in the loop were removed.
667 The only marginal change was inverting the parity bits, so we can remove
692 be done, and 1% or so if no repair had to be done.