17ec681f3Smrg/**************************************************************************
27ec681f3Smrg *
37ec681f3Smrg * Copyright © 2009 Jakob Bornecrantz
47ec681f3Smrg *
57ec681f3Smrg * Permission is hereby granted, free of charge, to any person obtaining a
67ec681f3Smrg * copy of this software and associated documentation files (the "Software"),
77ec681f3Smrg * to deal in the Software without restriction, including without limitation
87ec681f3Smrg * the rights to use, copy, modify, merge, publish, distribute, sublicense,
97ec681f3Smrg * and/or sell copies of the Software, and to permit persons to whom the
107ec681f3Smrg * Software is furnished to do so, subject to the following conditions:
117ec681f3Smrg *
127ec681f3Smrg * The above copyright notice and this permission notice (including the next
137ec681f3Smrg * paragraph) shall be included in all copies or substantial portions of the
147ec681f3Smrg * Software.
157ec681f3Smrg *
167ec681f3Smrg * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
177ec681f3Smrg * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
187ec681f3Smrg * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
197ec681f3Smrg * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
207ec681f3Smrg * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
217ec681f3Smrg * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
227ec681f3Smrg * DEALINGS IN THE SOFTWARE.
237ec681f3Smrg *
247ec681f3Smrg **************************************************************************/
257ec681f3Smrg
267ec681f3Smrg#ifndef U_FIFO_H
277ec681f3Smrg#define U_FIFO_H
287ec681f3Smrg
297ec681f3Smrg#include "util/u_memory.h"
307ec681f3Smrg
317ec681f3Smrgstruct util_fifo
327ec681f3Smrg{
337ec681f3Smrg   size_t head;
347ec681f3Smrg   size_t tail;
357ec681f3Smrg   size_t num;
367ec681f3Smrg   size_t size;
377ec681f3Smrg};
387ec681f3Smrg
397ec681f3Smrgstatic inline struct util_fifo *
407ec681f3Smrgu_fifo_create(size_t size)
417ec681f3Smrg{
427ec681f3Smrg   struct util_fifo *fifo;
437ec681f3Smrg   fifo = MALLOC(sizeof(*fifo) + size * sizeof(void*));
447ec681f3Smrg
457ec681f3Smrg   fifo->head = 0;
467ec681f3Smrg   fifo->tail = 0;
477ec681f3Smrg   fifo->num = 0;
487ec681f3Smrg   fifo->size = size;
497ec681f3Smrg
507ec681f3Smrg   return fifo;
517ec681f3Smrg}
527ec681f3Smrg
537ec681f3Smrgstatic inline boolean
547ec681f3Smrgu_fifo_add(struct util_fifo *fifo, void *ptr)
557ec681f3Smrg{
567ec681f3Smrg   void **array = (void**)&fifo[1];
577ec681f3Smrg   if (fifo->num >= fifo->size)
587ec681f3Smrg      return FALSE;
597ec681f3Smrg
607ec681f3Smrg   if (++fifo->head >= fifo->size)
617ec681f3Smrg      fifo->head = 0;
627ec681f3Smrg
637ec681f3Smrg   array[fifo->head] = ptr;
647ec681f3Smrg
657ec681f3Smrg   ++fifo->num;
667ec681f3Smrg
677ec681f3Smrg   return TRUE;
687ec681f3Smrg}
697ec681f3Smrg
707ec681f3Smrgstatic inline boolean
717ec681f3Smrgu_fifo_pop(struct util_fifo *fifo, void **ptr)
727ec681f3Smrg{
737ec681f3Smrg   void **array = (void**)&fifo[1];
747ec681f3Smrg
757ec681f3Smrg   if (!fifo->num)
767ec681f3Smrg      return FALSE;
777ec681f3Smrg
787ec681f3Smrg   if (++fifo->tail >= fifo->size)
797ec681f3Smrg      fifo->tail = 0;
807ec681f3Smrg
817ec681f3Smrg   *ptr = array[fifo->tail];
827ec681f3Smrg
837ec681f3Smrg   --fifo->num;
847ec681f3Smrg
857ec681f3Smrg   return TRUE;
867ec681f3Smrg}
877ec681f3Smrg
887ec681f3Smrgstatic inline void
897ec681f3Smrgu_fifo_destroy(struct util_fifo *fifo)
907ec681f3Smrg{
917ec681f3Smrg   FREE(fifo);
927ec681f3Smrg}
937ec681f3Smrg
947ec681f3Smrg#endif
95