SUB-QUEUE INSERTION SCHEMES EXECUTABLE BY QUEUE MANAGERS AND RELATED SYSTEMS AND OPERATIONS
Introduced here are insertion schemes in which queues can be branched into one or more sub-queues for more effective management of queuing elements. Often, a computing device will have a primary buffer into which queuing elements are populated for execution by a processor. However, the amount of contiguous memory space allocated for the primary buffer may be fixed. To address this, a queue manager may insert indicators that link to secondary buffers into the primary buffer in order to expand the number of effective entries in the primary buffer.
1 . A method for managing a primary buffer into which queuing elements are populated for execution by a processor, the method comprising:
determining a new queuing element is to be executed before an existing queuing element that was previously populated in an entry of the primary buffer;
saving the existing queuing element to a storage space;
inserting a special queuing element in the entry that, when executed, routes the processor to a secondary buffer; and
populating the new queuing element and the existing queuing element into the secondary buffer in such a manner that the processor will execute the new queuing element before executing the existing queuing element.
2 . The method of claim 1 , wherein the existing queuing element is populated into a last entry of the secondary buffer so that execution occurs immediately before redirection of the processor from the secondary buffer to the primary buffer.
3 . The method of claim 1 , wherein the new queuing element is populated into a first entry of the secondary buffer so that execution occurs immediately after redirection of the processor from the primary buffer to the secondary buffer.
4 . The method of claim 1 , wherein the primary buffer is a circular buffer having a fixed size.
5 . The method of claim 1 , further comprising:
increasing a size of the secondary buffer by one entry to account for inclusion of the existing queuing element.
6 . The method of claim 1 , wherein the special queuing element further routes the processor to information regarding the secondary buffer.
7 . The method of claim 1 , further comprising:
updating, in response to said populating, information regarding the primary buffer that is maintained in a register to account for nesting of the secondary buffer within the primary buffer.
8 . A method comprising:
monitoring available capacity of a primary buffer into which queuing elements are populated for execution by a processor;
determining that the available capacity of the primary buffer has fallen beneath a predetermined threshold; and
inserting a special queuing element into the primary buffer that, when executed, routes the processor to a secondary buffer in which queuing elements can be populated.
9 . The method of claim 8 , wherein said inserting is performed responsive to determining that all entries in the primary buffer have been populated with queuing elements.
10 . The method of claim 9 , further comprising:
identifying a queuing element that was most recently populated into an entry in the primary buffer;
saving the queuing element to a storage space; and
populating the queuing element in the secondary buffer.
11 . The method of claim 10 , wherein the queuing element is populated into a first entry of the secondary buffer.
12 . The method of claim 10 , wherein the special queuing element is inserted into the entry in the primary buffer in place of the queuing element copied into the secondary buffer.
13 . The method of claim 8 , wherein said monitoring comprises continually examining an overflow (OF) indicator associated with the primary buffer.
14 . The method of claim 8 , wherein the special queuing element further routes the processor to information regarding the secondary buffer that comprises a return pointer that defines where to return following execution of all queuing elements in the secondary buffer.
15 . The method of claim 8 , further comprising:
monitoring available capacity of the secondary buffer; and
releasing memory space that was allocated for the secondary buffer responsive to determining that all entries in the secondary buffer have been executed by the processor.
16 . The method of claim 15 , wherein said monitoring comprises continually examining either an underflow (UF) indicator or a not empty (NE) indicator associated with the secondary buffer.
17 . The method of claim 8 , further comprising:
allocating, responsive to said determining, memory space for the secondary buffer.
18 . A system comprising:
a processor configured to execute a queue manager that manages a primary buffer into which queuing elements are populated for execution by the processor; and
a memory having instructions stored thereon that, when executed, cause the queue manager to:
monitor available capacity of the primary buffer on a continual basis,
allocate memory space for a secondary buffer responsive to determining that all entries in the primary buffer have been populated with queuing elements,
identify a queuing element that was most recently populated into the primary buffer, save the queuing element to a storage space,
insert a first special queuing element into the primary buffer in place of the saved queuing element,
wherein when executed, the first special queuing element routes the processor to the secondary buffer, and
populate the saved queuing element into the secondary buffer.
19 . The system of claim 18 , wherein the secondary buffer is accompanied by information that specifies where to return following execution of all queuing elements in the secondary buffer.
20 . The system of claim 18 , wherein the secondary buffer comprises a second special queuing element that, when executed, routes the processor to a tertiary buffer.