23.05.2014 Views

Excerpts for 116B (224KB)

Excerpts for 116B (224KB)

Excerpts for 116B (224KB)

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Addressing Capabilities<br />

After a put operation, the put address register points to the last item placed in the queue; the<br />

unchanged get address register points to the last item removed from the queue. After a get<br />

operation, the get address register points to the last item placed in the queue.<br />

.<br />

PUT – (An)<br />

LOW MEMORY<br />

(FREE)<br />

LAST PUT<br />

GET – (Am)<br />

NEXT GET<br />

LAST GET (FREE)<br />

HIGH MEMORY<br />

To implement the queue as a circular buffer, the get or put operation should be per<strong>for</strong>med<br />

first. Then the relevant address register should be checked and adjusted, if necessary.<br />

Adding the buffer length (in bytes) to the address register contents adjusts the address<br />

register.<br />

2-30 M68000 FAMILY PROGRAMMER’S REFERENCE MANUAL MOTOROLA

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

Saved successfully!

Ooh no, something went wrong!