Qdatasheet_Logo
Integrated circuits, Transistor, Semiconductors Search and Datasheet PDF Download Site

PIC18F010T View Datasheet(PDF) - Microchip Technology

Part Name
Description
MFG CO.
PIC18F010T
Microchip
Microchip Technology Microchip
'PIC18F010T' PDF : 176 Pages View PDF
PIC18F010/020
BNOV
Branch if Not Overflow
Syntax:
[ label ] BNOV n
Operands:
-128 n 127
Operation:
if overflow bit is 0
(PC) + 2 + 2n PC
Status Affected: None
Encoding:
1110 0101 nnnn nnnn
Description:
If the Overflow bit is 0, then the
program will branch.
The 2s complement number 2nis
added to the PC. Since the PC will
have incremented to fetch the next
instruction, the new address will be
PC+2+2n. This instruction is then
a two-cycle instruction.
Words:
1
Cycles:
1(2)
Q Cycle Activity:
If Jump:
Q1
Q2
Decode
Read literal
n
No
operation
No
operation
If No Jump:
Q1
Q2
Decode
Read literal
n
Q3
Process
Data
No
operation
Q3
Process
Data
Q4
Write to PC
No
operation
Q4
No
operation
Example:
HERE
Before Instruction
PC
=
After Instruction
If Overflow =
PC
=
If Overflow =
PC
=
BNOV Jump
address (HERE)
0;
address (Jump)
1;
address (HERE+2)
BNZ
Branch if Not Zero
Syntax:
[ label ] BNZ n
Operands:
-128 n 127
Operation:
if zero bit is 0
(PC) + 2 + 2n PC
Status Affected: None
Encoding:
1110 0001 nnnn nnnn
Description:
If the Zero bit is 0, then the pro-
gram will branch.
The 2s complement number 2nis
added to the PC. Since the PC will
have incremented to fetch the next
instruction, the new address will be
PC+2+2n. This instruction is then
a two-cycle instruction.
Words:
1
Cycles:
1(2)
Q Cycle Activity:
If Jump:
Q1
Q2
Decode
Read literal
n
No
operation
No
operation
If No Jump:
Q1
Q2
Decode
Read literal
n
Q3
Process
Data
No
operation
Q3
Process
Data
Q4
Write to PC
No
operation
Q4
No
operation
Example:
HERE
Before Instruction
PC
=
After Instruction
If Zero
=
PC
=
If Zero
=
PC
=
BNZ Jump
address (HERE)
0;
address (Jump)
1;
address (HERE+2)
DS41142A-page 106
Preliminary
2001 Microchip Technology Inc.
Share Link: GO URL

All Rights Reserved © qdatasheet.com  [ Privacy Policy ] [ Contact Us ]