You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
86 lines
2.4 KiB
86 lines
2.4 KiB
4 years ago
|
/*
|
||
|
* nghttp2 - HTTP/2 C Library
|
||
|
*
|
||
|
* Copyright (c) 2012 Tatsuhiro Tsujikawa
|
||
|
*
|
||
|
* Permission is hereby granted, free of charge, to any person obtaining
|
||
|
* a copy of this software and associated documentation files (the
|
||
|
* "Software"), to deal in the Software without restriction, including
|
||
|
* without limitation the rights to use, copy, modify, merge, publish,
|
||
|
* distribute, sublicense, and/or sell copies of the Software, and to
|
||
|
* permit persons to whom the Software is furnished to do so, subject to
|
||
|
* the following conditions:
|
||
|
*
|
||
|
* The above copyright notice and this permission notice shall be
|
||
|
* included in all copies or substantial portions of the Software.
|
||
|
*
|
||
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
||
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
||
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
||
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||
|
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||
|
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
||
|
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||
|
*/
|
||
|
#include "nghttp2_queue.h"
|
||
|
|
||
|
#include <string.h>
|
||
|
#include <assert.h>
|
||
|
|
||
|
void nghttp2_queue_init(nghttp2_queue *queue) {
|
||
|
queue->front = queue->back = NULL;
|
||
|
}
|
||
|
|
||
|
void nghttp2_queue_free(nghttp2_queue *queue) {
|
||
|
if (!queue) {
|
||
|
return;
|
||
|
} else {
|
||
|
nghttp2_queue_cell *p = queue->front;
|
||
|
while (p) {
|
||
|
nghttp2_queue_cell *next = p->next;
|
||
|
free(p);
|
||
|
p = next;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
int nghttp2_queue_push(nghttp2_queue *queue, void *data) {
|
||
|
nghttp2_queue_cell *new_cell =
|
||
|
(nghttp2_queue_cell *)malloc(sizeof(nghttp2_queue_cell));
|
||
|
if (!new_cell) {
|
||
|
return NGHTTP2_ERR_NOMEM;
|
||
|
}
|
||
|
new_cell->data = data;
|
||
|
new_cell->next = NULL;
|
||
|
if (queue->back) {
|
||
|
queue->back->next = new_cell;
|
||
|
queue->back = new_cell;
|
||
|
|
||
|
} else {
|
||
|
queue->front = queue->back = new_cell;
|
||
|
}
|
||
|
return 0;
|
||
|
}
|
||
|
|
||
|
void nghttp2_queue_pop(nghttp2_queue *queue) {
|
||
|
nghttp2_queue_cell *front = queue->front;
|
||
|
assert(front);
|
||
|
queue->front = front->next;
|
||
|
if (front == queue->back) {
|
||
|
queue->back = NULL;
|
||
|
}
|
||
|
free(front);
|
||
|
}
|
||
|
|
||
|
void *nghttp2_queue_front(nghttp2_queue *queue) {
|
||
|
assert(queue->front);
|
||
|
return queue->front->data;
|
||
|
}
|
||
|
|
||
|
void *nghttp2_queue_back(nghttp2_queue *queue) {
|
||
|
assert(queue->back);
|
||
|
return queue->back->data;
|
||
|
}
|
||
|
|
||
|
int nghttp2_queue_empty(nghttp2_queue *queue) { return queue->front == NULL; }
|