### System Verilog Queues which can shrink and grow !

System Verilog has new data type called ‘queue’ which can grow and shrink. With SV queue, we can easily add and remove elements anywhere that is the reason we say it can shrink and grow as we need. Queues can be used as LIFO (Last In First Out) Buffer or FIFO (First In First Out) type of buffers.

Each element in the queue is identified by an ordinal number that represents its position within the queue, with 0 representing the first element and \$ represents the last element.

The size of the queue is variable similar to dynamic array but queue may be empty with zero element and still its a valid data structure.

Lets take a few examples to understand queue operation with different methods we have in system verilog.

###############################################
int a;
Q[\$] = {0,1,2,3};  // Initial queue

initial begin
//Insert and delete
Q.insert (1, 1); // This means insert 1 at first element in the queue which becomes {0,1,1,2,3}
Q.delete(2); // This means delete 2nd element from the queue. {0,1,2,3}

//Push_front
Q.push_front (6);  //Insert ‘6’ at front of the queue. {6,0,1,2,3}

//Pop_back
a = Q.pop_back; // Poping the last element and stored it to local variable ‘a’,  a = 3 in this case. Resultant Queue = {6,0,1,2}

//push_back
Q.push_back(7) // Pushing the element ‘7’ from the back. {6,0,1,2,7}

//Pop_front:
a =Q.pop_front; Poping the first element and stored it to local variable called ‘a’, a=6 in this case. Resultant Queue = {0,1,2,7}

end
#####################################################

When you create a queue System Verilog actually allocates extra space and because this we can add and remove the element based on need in our test bench. This is very useful feature in test bench implementation. System Verilog automatically allocates the additional space so we don't need to worry about the limits and queue will not run out of space.

Queue is very useful data type in System Verilog for developing a test benches. It can be used in development of various entity in the test bench like scoreboard, monitor, transaction class, drivers etc.

Hope this helps in basic understanding of queue and its methods.

Note : Same blog article is also available on EDA Cafe website.

Hash said...

Good one Ankit

-Regards
Subhash

Ankit Gopani said...