Routines
| Prev: BC74 | Up: Map | Next: BCC9 |
BC9C: Find the first waiting statement that cannot be proven yet
|
IX ($BA1E) = that statement; B = how many there are.
|
||||||||||
| BC9C | LD IX,$9965 | Point IX at "The case: statements about the crime, and the..." (9965) - As BC74, but for the statements that cannot yet be proved | ||||||||
| BCA0 | LD B,$00 | Load B with $00 | ||||||||
| BCA2 | LD A,(IX+$00) | Read the first byte of the record at IX into A | ||||||||
| BCA5 | CP $FF | Compare A with $FF | ||||||||
| BCA7 | JR Z,$BCC4 | If A equals $FF, skip ahead to BCC4 | ||||||||
| BCA9 | BIT 0,(IX+$03) | Test bit 0 of byte +3 of the record at IX | ||||||||
| BCAD | JR Z,$BCBD | If bit 0 of byte +3 of the record at IX is clear, skip ahead to BCBD | ||||||||
| BCAF | CALL $BCC9 | Call the routine "Try to prove statement IX" (BCC9) - Told but not provable... | ||||||||
| BCB2 | JR NZ,$BCBD | If the zero flag is clear, skip ahead to BCBD | ||||||||
| BCB4 | LD A,B | Copy B into A - ...the first one is remembered ($BA1E) | ||||||||
| BCB5 | INC B | Add one to B | ||||||||
| BCB6 | AND A | Test A for zero (this leaves A as it was and clears carry) | ||||||||
| BCB7 | JR NZ,$BCBD | If A is not zero, skip ahead to BCBD | ||||||||
| BCB9 | LD ($BA1E),IX | Store IX in $BA1E in "Variables used by the code at BA20-BF58" | ||||||||
| BCBD | PUSH BC | Save BC on the stack | ||||||||
| BCBE | CALL $BE72 | Call the routine "Step IX over a whole group of case records" (BE72) - Next group of records (BE72) | ||||||||
| BCC1 | POP BC | Restore BC from the stack | ||||||||
| BCC2 | JR $BCA2 | Go back to BCA2 | ||||||||
| BCC4 | LD IX,($BA1E) | Read $BA1E in "Variables used by the code at BA20-BF58" into IX - IX = the first unprovable statement | ||||||||
| BCC8 | RET | Return to the caller | ||||||||
| Prev: BC74 | Up: Map | Next: BCC9 |