| ??? 12/12/02 00:50 Read: times |
#34293 - RE: Checking 1 bit in a byte Faster than Dan |
But if you're going to copy the byte anyway, why not copy it into a bit-addressable byte, so that the required bit can then be tested directly - without all that tedious messing about with masking, etc?
Spencer twice stated that he wants to detect a bit change. How does copying the byte to bit addressable memory help? I'm probably missing something, but it seems like doing it that way one would have to make two bit-check paths -- one path if the original bit is set and you'd check to see when if the new sample cleared, and another path if the original bit is clear and you'd check to see when if the new sample became set. |
| Topic | Author | Date |
| Checking one bit, in a byte Fast | 01/01/70 00:00 | |
| RE: Checking one bit, in a byte Fast | 01/01/70 00:00 | |
| RE: Checking one bit, in a byte Fast | 01/01/70 00:00 | |
| RE: Checking one bit, in a byte Fast | 01/01/70 00:00 | |
| RE: Checking one bit, in a byte Fast | 01/01/70 00:00 | |
| RE: Checking one bit, in a byte Fast | 01/01/70 00:00 | |
| RE: Checking one bit, in a byte Fast | 01/01/70 00:00 | |
| Checking 1 bit in a byte Faster than Dan | 01/01/70 00:00 | |
| RE: Checking 1 bit in a byte Faster than Dan | 01/01/70 00:00 | |
| RE: assembler faster than C | 01/01/70 00:00 | |
| RE: Checking 1 bit in a byte Faster than Dan | 01/01/70 00:00 | |
| RE: Checking 1 bit in a byte ... Erik | 01/01/70 00:00 | |
RE: Checking one bit, in a byte Fast | 01/01/70 00:00 |



