view queue.h @ 36:a600c015562d

Handle differing c2s and s2c algorithms properly
author Matt Johnston <matt@ucc.asn.au>
date Thu, 29 Jul 2004 15:43:26 +0000
parents fe6bca95afa7
children f27058078d61
line wrap: on
line source

/*
 * Dropbear - a SSH2 server
 * 
 * Copyright (c) 2002,2003 Matt Johnston
 * All rights reserved.
 * 
 * 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 _QUEUE_H_
#define _QUEUE_H_

struct Link {

	void* item;
	struct Link* link;

};

struct Queue {

	struct Link* head;
	struct Link* tail;
	unsigned int count; /* safety value */

};

void initqueue(struct Queue* queue);
int isempty(struct Queue* queue);
void* dequeue(struct Queue* queue);
void *examine(struct Queue* queue);
void enqueue(struct Queue* queue, void* item);

#endif