OpenGrok

30  * A dynamically growable, circular buffer.  Elements are added at head and
31  * removed from tail. head and tail are free-running uint32_t indices and we
33  * number of bytes in the queue is always head - tail, even in case of
48    vector->head = 0;
63    if (vector->head - vector->tail == vector->size) {
82          assert(vector->tail <= split && split < vector->head);
86                 vector->head - split);
93    assert(vector->head - vector->tail < vector->size);
95    offset = vector->head & (vector->size - 1);
96    vector->head += vector->element_size;
106    if (vector->head == vector->tail)
109    assert(vector->head - vector->tail <= vector->size);

Indexes created Sun Jun 28 00:24:58 UTC 2026