Routines
| Prev: 9DC6 | Up: Map | Next: 9DFF |
9DD8: Lestrade asks whether you can prove a waiting statement yet
|
||||||||||||||
| 9DD8 | CALL $9CF2 | Call 9CF2 (inside "Say good morning to C, if just met") - Greeting countdown allows it (9CF2)? Set the flag to 1 | ||||||||||||
| 9DDB | LD (HL),$01 | Store $01 at the address HL points to | ||||||||||||
| 9DDD | CALL $BC46 | Re-check the waiting statements (BC46) | ||||||||||||
| 9DE0 | CALL $BC9C | Find the first one that cannot be proven yet (BC9C) | ||||||||||||
| 9DE3 | LD A,B | Copy B into A - B non-zero: 9DF5 | ||||||||||||
| 9DE4 | AND A | Test A for zero (this leaves A as it was and clears carry) | ||||||||||||
| 9DE5 | JR NZ,$9DF5 | If A is not zero, skip ahead to 9DF5 | ||||||||||||
| 9DE7 | CALL $BC74 | Call the routine "Count the waiting statements that can now be proven" (BC74) - None: count those that can be proven (BC74); none: finish | ||||||||||||
| 9DEA | AND A | Clear the carry flag for the caller (A is unchanged) | ||||||||||||
| 9DEB | RET Z | If A is zero, return | ||||||||||||
| 9DEC | PUSH IX | Print 722D 'WELL CAN YOU PROVE THAT ... YET, HOLMES ?' | ||||||||||||
| 9DEE | LD HL,$722D | Point HL at the message "YOU SAY" WELL CAN YOU PROVE THAT YOU AND YOU... (722D) | ||||||||||||
| 9DF1 | CALL $A59F | Call the routine "Print the message at HL" (A59F) | ||||||||||||
| 9DF4 | RET | Return to the caller | ||||||||||||
| 9DF5 | BIT 4,(IX+$03) | Test bit 4 of byte +3 of the record at IX | ||||||||||||
| 9DF9 | RET NZ | If bit 4 of byte +3 of the record at IX is set, return | ||||||||||||
| 9DFA | LD A,$01 | Load A with $01 | ||||||||||||
| 9DFC | JP $BBE5 | Jump on to BBE5 | ||||||||||||
| Prev: 9DC6 | Up: Map | Next: 9DFF |