17816513. APPARATUS EMPLOYING WRAP TRACKING FOR ADDRESSING DATA OVERFLOW simplified abstract (QUALCOMM Incorporated)
APPARATUS EMPLOYING WRAP TRACKING FOR ADDRESSING DATA OVERFLOW
Organization Name
Inventor(s)
Aniket Bhivasen Bhor of San Jose CA (US)
Huzefa Sanjeliwala of Austin TX (US)
Ajay Kumar Rathee of San Jose CA (US)
APPARATUS EMPLOYING WRAP TRACKING FOR ADDRESSING DATA OVERFLOW - A simplified explanation of the abstract
This abstract first appeared for US patent application 17816513 titled 'APPARATUS EMPLOYING WRAP TRACKING FOR ADDRESSING DATA OVERFLOW
Simplified Explanation
The abstract describes an apparatus that includes a circular buffer with a fixed number of entries. The buffer allows data overflow while maintaining the most recently stored entries in order. The buffer can be used as a return address stack for subroutine calls in a processor. Additional circuitry dynamically links entries to maintain a last-in first-out stack. A system return pointer tracks the next entry to be returned when an entry is to be read. When data is pushed to an entry in the circular buffer, that entry stores a pointer to the entry for the previous system return pointer. By tracking the previous system return pointer in the pushed entry, the dynamically linked entries can skip intervening entries that have been previously popped and track the order of most recently written non-popped entries without separately maintaining free and used lists.
- The apparatus includes a circular buffer with a fixed number of entries.
- Data overflow can occur in the buffer while maintaining the order of the most recently stored entries.
- The buffer can be used as a return address stack for subroutine calls in a processor.
- Additional circuitry dynamically links entries to maintain a last-in first-out stack.
- A system return pointer tracks the next entry to be returned when an entry is to be read.
- Each entry stores a pointer to the entry for the previous system return pointer.
- Dynamically linked entries can skip previously popped entries and track the order of most recently written non-popped entries.
- Free and used lists do not need to be separately maintained.
Potential Applications
- Processor subroutine calls
- Data storage and retrieval systems
- Task scheduling algorithms
Problems Solved
- Efficient management of return addresses in a processor
- Handling data overflow while maintaining order
- Simplifying the tracking of most recently written non-popped entries
Benefits
- Improved efficiency in managing return addresses
- Simplified data storage and retrieval
- Streamlined task scheduling algorithms
Original Abstract Submitted
An apparatus includes a circular buffer which includes a fixed number of entries and allows data overflow to occur while maintaining the most recently stored entries in order. The circular buffer could be used as a return address stack used to push and pop return addresses for subroutine calls in a processor. Additional circuitry dynamically links entries to maintain a last-in first-out stack. A system return pointer tracks the next entry to be returned when an entry is to be read. When data is pushed to an entry in the circular buffer, that entry stores a pointer to the entry for the previous system return pointer. By tracking the previous system return pointer in the pushed entry, the dynamically linked entries may skip intervening entries that have been previously popped and, thus, track the order of most recently written non-popped entries without having to separately maintain free and used lists.
