1 /* Copyright (C) 2008 Board of Trustees, Leland Stanford Jr. University.
3 * Permission is hereby granted, free of charge, to any person obtaining a copy
4 * of this software and associated documentation files (the "Software"), to
5 * deal in the Software without restriction, including without limitation the
6 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
7 * sell copies of the Software, and to permit persons to whom the Software is
8 * furnished to do so, subject to the following conditions:
10 * The above copyright notice and this permission notice shall be included in
11 * all copies or substantial portions of the Software.
13 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
14 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
15 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
16 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
17 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
18 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
26 static void check_queue(struct queue *q);
29 queue_init(struct queue *q)
37 queue_destroy(struct queue *q)
39 struct buffer *cur, *next;
40 for (cur = q->head; cur != NULL; cur = next) {
47 queue_clear(struct queue *q)
54 queue_advance_head(struct queue *q, struct buffer *next)
59 if (q->head == NULL) {
66 queue_push_tail(struct queue *q, struct buffer *b)
82 check_queue(struct queue *q)
89 ? q->head == NULL && q->tail == NULL
90 : q->head != NULL && q->tail != NULL);
93 for (iter = q->head; iter != NULL; iter = iter->next) {
95 assert((iter->next != NULL) == (iter != q->tail));