??? 12/10/04 13:18 Read: times |
#82886 - very complex bit testing Responding to: ???'s previous message |
I did once a long time ago do a complex bit testing by having a 256 byte table of "action codes" that I looked up with the contents of the bit register as offset. If e.g. bit 5 was the most important, all "action codes" that had bit 5 set would "do bit 5 and reset it" then do anothet lookup.
This for complex bit testing, especially when bit combinations matter, this is a lot faster than jb, cjne etc. Erik |
Topic | Author | Date |
DPTR for internal code | 01/01/70 00:00 | |
DPTR....... | 01/01/70 00:00 | |
Look at Instructions set | 01/01/70 00:00 | |
DPTR for code memory | 01/01/70 00:00 | |
Port scanning | 01/01/70 00:00 | |
DPTR and I/O Ports | 01/01/70 00:00 | |
Outputting and Inputting Bits | 01/01/70 00:00 | |
Jump Table? | 01/01/70 00:00 | |
It can Not | 01/01/70 00:00 | |
DPTR for code memory | 01/01/70 00:00 | |
Do the independent bit tests | 01/01/70 00:00 | |
very complex bit testing![]() | 01/01/70 00:00 | |
Dptr for code memory | 01/01/70 00:00 | |
JB | 01/01/70 00:00 |