| 1 |
48 |
alirezamon |
/*
|
| 2 |
|
|
* Copyright (c) 2010-2011 The University of Texas at Austin
|
| 3 |
|
|
* All rights reserved.
|
| 4 |
|
|
*
|
| 5 |
|
|
* Redistribution and use in source and binary forms, with or without
|
| 6 |
|
|
* modification, are permitted provided that the following conditions are
|
| 7 |
|
|
* met: redistributions of source code must retain the above copyright
|
| 8 |
|
|
* notice, this list of conditions and the following disclaimer;
|
| 9 |
|
|
* redistributions in binary form must reproduce the above copyright
|
| 10 |
|
|
* notice, this list of conditions and the following disclaimer in the
|
| 11 |
|
|
* documentation and/or other materials provided with the distribution;
|
| 12 |
|
|
* neither the name of the copyright holders nor the names of its
|
| 13 |
|
|
* contributors may be used to endorse or promote products derived from
|
| 14 |
|
|
* this software without specific prior written permission.
|
| 15 |
|
|
*
|
| 16 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 17 |
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 18 |
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 19 |
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 20 |
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 21 |
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 22 |
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 23 |
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 24 |
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 25 |
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 26 |
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 27 |
|
|
*/
|
| 28 |
|
|
|
| 29 |
|
|
#ifndef QUEUE_H_
|
| 30 |
|
|
#define QUEUE_H_
|
| 31 |
|
|
|
| 32 |
|
|
#include <stdio.h>
|
| 33 |
|
|
#include <stdlib.h>
|
| 34 |
|
|
|
| 35 |
|
|
typedef struct node node_t;
|
| 36 |
|
|
typedef struct queue queue_t;
|
| 37 |
|
|
|
| 38 |
|
|
struct node {
|
| 39 |
|
|
node_t* prev;
|
| 40 |
|
|
node_t* next;
|
| 41 |
|
|
unsigned long long int prio;
|
| 42 |
|
|
void* elem;
|
| 43 |
|
|
};
|
| 44 |
|
|
|
| 45 |
|
|
struct queue {
|
| 46 |
|
|
node_t* head;
|
| 47 |
|
|
node_t* tail;
|
| 48 |
|
|
};
|
| 49 |
|
|
|
| 50 |
|
|
queue_t* queue_new( void );
|
| 51 |
|
|
void queue_delete( queue_t* );
|
| 52 |
|
|
int queue_empty( queue_t* );
|
| 53 |
|
|
void queue_push_back( queue_t*, void* );
|
| 54 |
|
|
void queue_push( queue_t*, void*, unsigned long long int );
|
| 55 |
|
|
void* queue_peek_front( queue_t* );
|
| 56 |
|
|
void* queue_pop_front( queue_t* );
|
| 57 |
|
|
void queue_remove( queue_t*, void* );
|
| 58 |
|
|
|
| 59 |
|
|
#endif /*QUEUE_H_*/
|
