int e l Table B-1. Instruction Set Summary (Cont'd.) - 203 - Mnemonic Operation Cycles Binary Code Flags P OV AC C Function DEC data addr (data address) 1 0 0 0 1 0 1 0 1 m m m m m m m m Decrement contents of data address. DIV AB (AB) 4 1 0 0 0 0 1 0 0 P OV C Divide A by B (multiplication register). DJNZ Rr,code addr (PC) 0 THEN (PC) 2 1 1 0 1 1 r r r o o o o o o o o Decrement register, if not zero (0), then jump to code address. DJNZ data addr,code addr (PC), 0 THEN (PC) 2 1 1 0 1 0 1 0 1 m m m m m m m m o o o o o o o o Decrement data address, if zero (0), then jump to code address. INC @Rr ((Rr)) 1 0 0 0 0 0 1 1 r Increment contents of indirect address.
INC A (A) 1 0 0 0 0 0 1 0 0 P Increment A. INC DPTR (DPTR) 1 1 0 1 0 0 0 1 1 Increment 16-bit data pointer. INC Rr ((R) 1 0 0 0 0 1 r r r Increment register. INC data addr (data address) 2 0 0 0 0 0 1 0 1 m m m m m m m m Increment contents of data address. JB bit addr,code addr (PC) 2 0 0 1 0 0 0 0 0 b b b b b b b b o o o o o o o o If bit is one, n jump to code address. JBC bit addr,code addr (PC) 2 0 0 0 1 0 0 0 0 b b b b b b b b o o o o o o o o If bit is one, n clear bit and jump to code address. JC code addr (PC) (PC) + 2 IF(C) = 1 THEN (PC) 2 0 1 0 0 0 0 0 0 o o o o o o o o If C is one, then jump to code address.
JMP @A + DPTR (PC) 2 0 1 1 1 0 0 1 1 Add A to data pointer and jump to that code address. JNB bit addr,code addr (PC) 2 0 0 1 1 0 0 0 0 b b b b b b b b o o o o o o o o If bit is zero, n jump to code address.