/* ==== priority.h ==========================================================
 * Copyright (c) 1994 by Chris Provenzano, proven@mit.edu
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *  This product includes software developed by Chris Provenzano.
 * 4. The name of Chris Provenzano may not be used to endorse or promote 
 *	  products derived from this software without specific prior written
 *	  permission.
 *
 * THIS SOFTWARE IS PROVIDED BY CHRIS PROVENZANO ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL CHRIS PROVENZANO BE LIABLE FOR ANY 
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 
 * SUCH DAMAGE.
 *
 * $Id: prio_queue.h,v 1.3.4.1 1996/11/11 05:56:41 proven Exp $
 *
 * Description : Priority functions.
 *
 *  1.00 94/09/19 proven
 *      -Started coding this file.
 */

#ifndef _PTHREAD_PRIO_QUEUE_H_
#define _PTHREAD_PRIO_QUEUE_H_

/*
 * Static queue initialization values.
 */
#define PTHREAD_DEFAULT_PRIORITY 64
#define PTHREAD_MAX_PRIORITY 	126
#define PTHREAD_MIN_PRIORITY 	  0

/*
 * New prio_queue structures
 */
struct pthread_prio_level {
	struct pthread			  * first;
	struct pthread			  * last;
};

struct pthread_prio_queue {
	void 					  *	data;
	struct pthread  		  *	next;
	struct pthread_prio_level 	level[PTHREAD_MAX_PRIORITY + 1];
};
	
/*
 * New functions
 */

__BEGIN_DECLS

void    pthread_prio_queue_init __P((struct pthread_prio_queue *));
void    pthread_prio_queue_enq	__P((struct pthread_prio_queue *, 
									struct pthread *));
struct pthread *pthread_prio_queue_deq    
								__P((struct pthread_prio_queue *));

__END_DECLS

#endif
