/****************************************************************************/
/*	Copyright (c) 2009, Bendor Research Pty. Ltd. All rights reserved.		*/
/*	This software is released under the GNU General Public License, version	*/
/*	3, with the exemptions that 1) the header files installed by this 	 	*/
/*	package can be included in closed-source code and 2) the libraries		*/
/*	built by this package can be statically linked into a closed-source 	*/
/*	binary. See the file LICENSE for the details.							*/
/*	This software is provided "AS IS", without any warranty or guarantee.	*/
/*	By using this software you acknowledge that neither Bendor Research nor	*/
/*	any of its personnel or affiliates can be held liable for any damages,	*/
/*	including, but not limited to, loss of business, loss of money, loss of */
/*	life, loss of reputation, arising out of this software being faulty or	*/
/*	not performing as advertised, even if Bendor Research was aware of such	*/
/*	faults in the software. You use this software at your own risk, any and */
/*	all liabilities that arise out of your using this software are strictly	*/
/*	yours.																	*/
/****************************************************************************/

#include "kernel.h"

/*
*	Insertion onto the priority waiting queue, non mutating object
*	~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/

void	_bx_PoliInsertPrio( BX_WAIT *wait, BX_PROC *proc )
{
BX_PROC		*this;
unsigned	epri;

	epri = proc->epri;

	// Now find the insertion place. If identical priority
	// processes are present, the new one will be the last.

	for ( this = wait->head ; this && this->epri >= epri ; this = this->next );

	// Insert the process just before the one we found
	// Note that 'this' can be NULL in two cases: 1) the queue was empty,
	// or 2) our priority is lower than that of any process on the queue.
	// In both cases adding to the tail is correct.

	if ( this )

		_bx_ProcInsBefore( wait, proc, this );
	else
		_bx_ProcAddTail( wait, proc );
}

