Rev. 2.0, 11/00, page 886 of 1037
A.4
Number of Execution States
This section explains execution state and how to calculate the number of execution states for
each instruction of the H8S/2194 CPU.
Table A.5 indicates number of cycles of instruction fetch and data read/write during instruction
execution, and table A.4 indicates number of states required for each instruction size.
The number of execution states can be obtained from the equation below.
Number of execution states = I
⋅
S
I
+ J
⋅
S
J
+ K
⋅
S
K
+ L
⋅
S
L
+ M
⋅
S
M
+ N
⋅
S
N
(1) Examples of execution state number calculation
The conditions are as follows: In advanced mode, program and stack areas are set in the on-chip
memory, a wait is inserted every 2 states in the on-chip supporting module access with 8-bit bus
width.
1. BSET #0, @FFFFC7:8
From Table A.5,
I = L = 2, J = K = M = N = 0
From Table A.4,
S
I
= 1, S
L
= 2
Number of execution states = 2
×
1 + 2
×
2 = 6
2. JSR @@30
From Table A.5,
I = J = K = 2, L = M = N = 0
From Table A.4,
S
I
= S
J
= S
K
= 1
Number of execution states = 2
×
1 + 2
×
1 + 2
×
1 = 6
Summary of Contents for Hitachi H8S/2191
Page 123: ...Rev 2 0 11 00 page 96 of 1037...
Page 149: ...Rev 2 0 11 00 page 122 of 1037...
Page 197: ...Rev 2 0 11 00 page 170 of 1037...
Page 247: ...Rev 2 0 11 00 page 220 of 1037...
Page 249: ...Rev 2 0 11 00 page 222 of 1037...
Page 347: ...Rev 2 0 11 00 page 320 of 1037...
Page 357: ...Rev 2 0 11 00 page 330 of 1037...
Page 417: ...Rev 2 0 11 00 page 390 of 1037...
Page 431: ...Rev 2 0 11 00 page 404 of 1037...
Page 439: ...Rev 2 0 11 00 page 412 of 1037...
Page 457: ...Rev 2 0 11 00 page 430 of 1037...
Page 525: ...Rev 2 0 11 00 page 498 of 1037...
Page 543: ...Rev 2 0 11 00 page 516 of 1037...
Page 845: ...Rev 2 0 11 00 page 818 of 1037...