Lines Matching refs:we

156 Fortunately the exclusive or operation is commutative, so we can combine
163 Similarly we can first xor the bytes for the various rows.
266 In step 1 we moved from bit-wise calculation to byte-wise calculation.
267 However in C we can also use the unsigned long data type and virtually
269 to write our code in such a way that we process data in 32 bit chunks.
273 for the column parity we use the par variable. When extending to 32 bits
274 we can in the end easily calculate p0 and p1 from it.
325        we need to adapt the code generation for the fact that rp vars are now
327        we'll bring rp4 to 15 back to single byte entities by shifting and
388 The code (of course) works, and hurray: we are a little bit faster than
391 If we look at e.g. rp14 and rp15 we see that we either xor our data with
392 rp14 or with rp15. However we also have par which goes over all data.
395 (or if desired we can avoid calculating rp15 and calculate it from
398 Effectively this means we can eliminate the else clause from the if
399 statements. Also we can optimise the calculation in the end a little bit
400 by going from long to byte first. Actually we can even avoid the table
484 So in effect par = rp4 ^ rp5. But as xor is commutative we can also say
495 Of course after the loop we need to correct things by adding code like:
505 compared with attempt 4 with 4 times unrolled, and we only require 1/3rd
570 loop; This eliminates 3 statements per loop. Of course after the loop we
647 But if rp4 = rp5 we do not need rp5 etc. We can just write the even bits
667 The only marginal change was inverting the parity bits, so we can remove
688 are 1 we have one correctable bit error. If there is 1 bit 1, we have an