17.05.2015 Views

~ National ~ Semiconductor - Al Kossow's Bitsavers

~ National ~ Semiconductor - Al Kossow's Bitsavers

~ National ~ Semiconductor - Al Kossow's Bitsavers

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

8.0 Remote Interface and Arbitration System (Continued)<br />

The last possible Memory Selection is Instruction Memory, state machine (RASM) loops in state RSA. If [LOR) is set<br />

[MS1-0) = 01. The two possible next states for an IMEM high, RASM will loop in RSA indefinitely. If the BCP CPU<br />

access depend on if RASM is expecting the low byte or high needs to access Data Memory at this time (and LOCK is<br />

byte. Instruction words are accessed low byte then high high), it can still do so. A local access is requested by the<br />

byte and RASM powers up expecting the low Instruction Timing Control Unit asserting the Local Bus Request<br />

byte. The internal flag that keeps track of the next expected (LCL-BREQ) signal. A local bus grant will be given by RASM<br />

Instruction byte is called the High Instruction Byte flag (HI B). if the buses are not being used (as is the case in RSA).<br />

If HIB is low, the next state is RS05 and the low instruction XACK is taken low as soon as RAE*REM-RD is true, rebyte<br />

is MUXed to the AD bus. If HIB is "1 ", the high instruc- gardless of an ongoing local access. RASM will move into<br />

tion byte is MUXed to AD and RS06 is entered if HIB = 1. RSs on the next clock after RAE*REM-RD is asserted and<br />

An IMEM access, like a DMEM access, is subject to wait there is no local bus request. No further local bus requests<br />

states and these states will be looped on until all pro- will be granted until the BCP enters the Termination Phase.<br />

grammed instruction memory wait states have been insert- If the BCP CPU initiates a Data Memory Access after RSA,<br />

ed.<br />

the Timing Control Unit will be waited and the BCP CPU will<br />

<strong>Al</strong>l the RSo states eventually move to their corresponding remain in state T Wr until the Remote Access reaches the<br />

RSE states on the clock after the wait state conditions, if Termination Phase.<br />

any, are met. The RSE states are looped upon until On the next clock, RASM enters RSc and LCL is asserted<br />

RAE*REM-RD is deasserted and WAIT is high. LCL is still along with XACK. The wait state counters, ilW and iow, are<br />

high in this state and A remains in TRI-STATE. AD will also loaded in this state lrom [lW1-0) and [DW2-0), respectivestay<br />

in TRI-STATE il the access was to DMEM. XACK is Iy, in (OCR). The A bus (and AD il the access is to Data<br />

taken back high to indicate that data is now valid on the Memory) now goes into TRI-STATE and the Access Phase<br />

read. II XACK is connected to a Remote Processor wait pin, begins.<br />

it is no longer waited and can now terminate its read cycle. The state machine can move into one 01 several states de-<br />

This state begins the Termination Phase. The action speci- pending CMD and [MS1-0) on the next clock. XACK and<br />

lied in the conditional box is only executed while RAE*REM- LCL are still asserted in all the possible next states. II CMD<br />

RD is asserted-a clock edge is not necessary.<br />

is high, the access is to (RIC) and the next state will be<br />

On the CPU-CLK after RAE*REM-RD is deasserted, RASM RS01. Since the delault state 01 AD is (RIC), it will not<br />

enters RSF, where LCL is high and the TRI-STATE condi- transition in this state. The live other next states all have<br />

tion in RSE remains in effect. The next clock brings the state CMD low and depend on the Memory Select bits.<br />

machine back to RSA state where it will loop until another II [MS1-0) is 10 or 11 the state machine will enter either<br />

Remote Access is initiated. If the access was to IMEM, then RS02 or RS03 and the low or high bytes of the Program<br />

the last action 01 the remote access belore returning to RSA Counter, respectively, will be read.<br />

is to switch HIB and increment the PC il the high byte was [MS1-0) = 00 designates a Data Memory access and<br />

read.<br />

moves RASM into RS04' READ will be asserted in this state<br />

The example in Figure 26 shows the BCP executing the first and A and AD continue to be at TRI-STATE. This allows the<br />

01 two consecutive Data Memory reads when REM-RD goes Remote Processor to drive the Data Memory address for<br />

low. In response, XACK goes low waiting the remote proc- the read. Since DMEM is subject to wait states, RS04 is<br />

essor. At the end of the first instruction, although the BCP looped upon until all the wait states have been inserted.<br />

begins its second read by taking ALE high, the RASM now The last possible Memory Selection is Instruction Memory,<br />

takes control of the bus and takes LCL high at the end of [MS1-0) = 01. The two possible next states lor the IMEM<br />

T1· A one T-state delay is built into this transfer to ensure access depend on if RASM is expecting the low byte or high<br />

that READ has been deasserted belore the data bus is byte. Instruction words are accessed low byte then high<br />

switched. The Timing Control Unit is now waited, inserting byte and RASM powers up expecting the low Instruction<br />

remote access wait states, T Wr, as RASM takes over.<br />

byte. The internal Ilag that keeps track of the next expected<br />

The remote address is permitted one T-state to settle on the Instruction byte is called the High Instruction Byte flag (HIB).<br />

BCP address bus before READ goes low, XACK then re- If HIB is low, the next state is RS05 and the low instruction<br />

turns high one T-state plus the programmed Data Memory byte is MUXed to the AD bus. If HIB is "1" , the high instrucwait<br />

state, TWd later, having satislied the memory access tion byte is MUXed to AD and RS06 is entered if HIB = 1.<br />

time. The Remote Processor will respond by removing An IMEM access, like a DMEM access, is subject to wait<br />

REM-RD to which the BCP in turn responds by removing states and these states will be looped on until all pro-<br />

READ. Following the removal 01 READ, the BCP waits till grammed instruction memory wait states have been insertthe<br />

end 01 the next T-state before taking LCL low, again ed.<br />

ensuring that the read cycle has concluded before the bus<br />

is switched. Control is then returned to the Timing Control<br />

Unit and the local memory read continues.<br />

Latched Read<br />

This mode differs from the Buffered Read mode in the way<br />

the access is terminated. A latched Read cycle ends after<br />

the data being read is valid and the termination doesn't wait<br />

for the trailing edge of REM-RD. Therefore the Arbitration<br />

and Access Phases of the Latched Read mode are the<br />

same as for the Buffered Read mode. The complete flow<br />

chart for the Latched Read mode is shown in Figure 27.<br />

Until a Remote Read is initiated (RAE*REM-RD true), the<br />

2-154<br />

<strong>Al</strong>l the RSo states move to their corresponding RSE states<br />

on the CPU-CLK after wait state conditions are met and<br />

WAIT is high. LCL is asserted in all RSE states and A remains<br />

in TRI-STATE (and AD if the access is to Data Memory).<br />

XACK returns high in this state, indicating that data is<br />

valid so that it can be externally latched. The action specific<br />

to each RSo state remains in effect during the first half of<br />

the RSE cycle (Le. READ is asserted in the first half of<br />

RSE4). This hall T-state of hold time is provided to guarantee<br />

data is latched when XACK goes high. This state begins<br />

the Termination Phase.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!