summaryrefslogtreecommitdiff
path: root/libpager/queue.h
blob: d3cf738ecf2d2449a41d8f9a0517334573b22095 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/* A FIFO queue with constant-time enqueue and dequeue operations.

   Copyright (C) 2014 Free Software Foundation, Inc.

   Written by Justus Winter <4winter@informatik.uni-hamburg.de>

   This file is part of the GNU Hurd.

   The GNU Hurd is free software; you can redistribute it and/or
   modify it under the terms of the GNU General Public License as
   published by the Free Software Foundation; either version 2, or (at
   your option) any later version.

   The GNU Hurd is distributed in the hope that it will be useful, but
   WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with the GNU Hurd.  If not, see <http://www.gnu.org/licenses/>.  */

/* A FIFO queue with constant-time enqueue and dequeue operations.  */
struct item {
  struct item *next;
};

struct queue {
  struct item *head;
  struct item **tail;
};

static inline void
queue_init (struct queue *q)
{
  q->head = NULL;
  q->tail = &q->head;
}

static inline void
queue_enqueue (struct queue *q, struct item *r)
{
  *q->tail = r;
  q->tail = &r->next;
  r->next = NULL;
}

static inline void *
queue_dequeue (struct queue *q)
{
  struct item *r = q->head;
  if (r == NULL)
    return NULL;

  /* Pop the first item off.  */
  if ((q->head = q->head->next) == NULL)
    /* The queue is empty, fix tail pointer.  */
    q->tail = &q->head;

  r->next = NULL;
  return r;
}