Texas Instruments TMS320C3x - Manual (Page 184)

System and User Stack Management
6-31 Addressing Modes
Figure 6–11.Implementations of Low-to-High Memory Stacks
Top of stack
Low memory
High memory
(Free)
Bottom of stack
AR n Top of stack
Low memory
High memory
(Free)
Bottom of stack
Case 3 Case 4
AR n
.
.
.
.
.
.
→
→
6.10.3 Queues
A queue is like a FIFO. The implementation of queues is based on the manipu-
lation of auxiliary registers. Two auxiliary registers are used: one to mark the
front of the queue from which data is popped (or dequeued) and the other to
mark the rear of the queue where data is pushed. With proper management
of the auxiliary registers, the queue can also be circular. (A queue is circular
when the rear pointer is allowed to point to the beginning of the queue memory
after it has pointed to the end of the queue memory.)