nghttp2/lib/spdylay_pq.h

100 lines
2.8 KiB
C
Raw Normal View History

2012-01-17 18:10:22 +01:00
/*
* Spdylay - SPDY 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.
*/
#ifndef SPDYLAY_PQ_H
#define SPDYLAY_PQ_H
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif /* HAVE_CONFIG_H */
#include <spdylay/spdylay.h>
#include "spdylay_int.h"
2012-01-17 18:10:22 +01:00
/* Implementation of priority queue */
typedef struct {
2012-02-21 15:24:16 +01:00
/* The pointer to the pointer to the item stored */
2012-01-17 18:10:22 +01:00
void **q;
2012-02-21 15:24:16 +01:00
/* The number of items sotred */
2012-01-17 18:10:22 +01:00
size_t length;
2012-02-21 15:24:16 +01:00
/* The maximum number of items this pq can store. This is
automatically extended when length is reached to this value. */
2012-01-17 18:10:22 +01:00
size_t capacity;
2012-02-21 15:24:16 +01:00
/* The compare function between items */
spdylay_compar compar;
2012-01-17 18:10:22 +01:00
} spdylay_pq;
2012-02-21 15:24:16 +01:00
/*
* Initializes priority queue |pq| with compare function |cmp|.
*
* This function returns 0 if it succeeds, or one of the following
* negative error codes:
*
* SPDYLAY_ERR_NOMEM
* Out of memory.
*/
int spdylay_pq_init(spdylay_pq *pq, spdylay_compar cmp);
2012-01-17 18:10:22 +01:00
2012-02-21 15:24:16 +01:00
/*
* Deallocates any resources allocated for |pq|. The stored items are
* not freed by this function.
*/
2012-01-17 18:10:22 +01:00
void spdylay_pq_free(spdylay_pq *pq);
2012-02-21 15:24:16 +01:00
/*
* Adds |item| to the priority queue |pq|.
*
* This function returns 0 if it succeds, or one of the following
* negative error codes:
*
* SPDYLAY_ERR_NOMEM
* Out of memory.
*/
2012-01-17 18:10:22 +01:00
int spdylay_pq_push(spdylay_pq *pq, void *item);
2012-02-21 15:24:16 +01:00
/*
* Returns item at the top of the queue |pq|. If the queue is empty,
* this function returns NULL.
*/
2012-01-17 18:10:22 +01:00
void* spdylay_pq_top(spdylay_pq *pq);
2012-02-21 15:24:16 +01:00
/*
* Pops item at the top of the queue |pq|. The popped item is not
* freed by this function.
*/
2012-01-17 18:10:22 +01:00
void spdylay_pq_pop(spdylay_pq *pq);
2012-02-21 15:24:16 +01:00
/*
* Returns nonzero if the queue |pq| is empty.
*/
int spdylay_pq_empty(spdylay_pq *pq);
2012-01-17 18:10:22 +01:00
/*
* Returns the number of items in the queue |pq|.
*/
size_t spdylay_pq_size(spdylay_pq *pq);
2012-01-17 18:10:22 +01:00
#endif /* SPDYLAY_PQ_H */