sl@0: /* crypto/pqueue/pqueue.c */
sl@0: /* 
sl@0:  * DTLS implementation written by Nagendra Modadugu
sl@0:  * (nagendra@cs.stanford.edu) for the OpenSSL project 2005.  
sl@0:  */
sl@0: /* ====================================================================
sl@0:  * Copyright (c) 1999-2005 The OpenSSL Project.  All rights reserved.
sl@0:  *
sl@0:  * Redistribution and use in source and binary forms, with or without
sl@0:  * modification, are permitted provided that the following conditions
sl@0:  * are met:
sl@0:  *
sl@0:  * 1. Redistributions of source code must retain the above copyright
sl@0:  *    notice, this list of conditions and the following disclaimer. 
sl@0:  *
sl@0:  * 2. Redistributions in binary form must reproduce the above copyright
sl@0:  *    notice, this list of conditions and the following disclaimer in
sl@0:  *    the documentation and/or other materials provided with the
sl@0:  *    distribution.
sl@0:  *
sl@0:  * 3. All advertising materials mentioning features or use of this
sl@0:  *    software must display the following acknowledgment:
sl@0:  *    "This product includes software developed by the OpenSSL Project
sl@0:  *    for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
sl@0:  *
sl@0:  * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
sl@0:  *    endorse or promote products derived from this software without
sl@0:  *    prior written permission. For written permission, please contact
sl@0:  *    openssl-core@OpenSSL.org.
sl@0:  *
sl@0:  * 5. Products derived from this software may not be called "OpenSSL"
sl@0:  *    nor may "OpenSSL" appear in their names without prior written
sl@0:  *    permission of the OpenSSL Project.
sl@0:  *
sl@0:  * 6. Redistributions of any form whatsoever must retain the following
sl@0:  *    acknowledgment:
sl@0:  *    "This product includes software developed by the OpenSSL Project
sl@0:  *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
sl@0:  *
sl@0:  * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
sl@0:  * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
sl@0:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
sl@0:  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
sl@0:  * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
sl@0:  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
sl@0:  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
sl@0:  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
sl@0:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
sl@0:  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
sl@0:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
sl@0:  * OF THE POSSIBILITY OF SUCH DAMAGE.
sl@0:  * ====================================================================
sl@0:  *
sl@0:  * This product includes cryptographic software written by Eric Young
sl@0:  * (eay@cryptsoft.com).  This product includes software written by Tim
sl@0:  * Hudson (tjh@cryptsoft.com).
sl@0:  *
sl@0:  */
sl@0: 
sl@0: #include "cryptlib.h"
sl@0: #include <openssl/bn.h>
sl@0: #include <pqueue.h> 
sl@0: 
sl@0: typedef struct _pqueue
sl@0: 	{
sl@0: 	pitem *items;
sl@0: 	int count;
sl@0: 	} pqueue_s;
sl@0: 
sl@0: EXPORT_C pitem *
sl@0: pitem_new(PQ_64BIT priority, void *data)
sl@0: 	{
sl@0: 	pitem *item = (pitem *) OPENSSL_malloc(sizeof(pitem));
sl@0: 	if (item == NULL) return NULL;
sl@0: 
sl@0: 	pq_64bit_init(&(item->priority));
sl@0: 	pq_64bit_assign(&item->priority, &priority);
sl@0: 
sl@0: 	item->data = data;
sl@0: 	item->next = NULL;
sl@0: 
sl@0: 	return item;
sl@0: 	}
sl@0: 
sl@0: EXPORT_C void
sl@0: pitem_free(pitem *item)
sl@0: 	{
sl@0: 	if (item == NULL) return;
sl@0: 
sl@0: 	pq_64bit_free(&(item->priority));
sl@0: 	OPENSSL_free(item);
sl@0: 	}
sl@0: 
sl@0: EXPORT_C pqueue_s *
sl@0: pqueue_new()
sl@0: 	{
sl@0: 	pqueue_s *pq = (pqueue_s *) OPENSSL_malloc(sizeof(pqueue_s));
sl@0: 	if (pq == NULL) return NULL;
sl@0: 
sl@0: 	memset(pq, 0x00, sizeof(pqueue_s));
sl@0: 	return pq;
sl@0: 	}
sl@0: 
sl@0: EXPORT_C void
sl@0: pqueue_free(pqueue_s *pq)
sl@0: 	{
sl@0: 	if (pq == NULL) return;
sl@0: 
sl@0: 	OPENSSL_free(pq);
sl@0: 	}
sl@0: 
sl@0: EXPORT_C pitem *
sl@0: pqueue_insert(pqueue_s *pq, pitem *item)
sl@0: 	{
sl@0: 	pitem *curr, *next;
sl@0: 
sl@0: 	if (pq->items == NULL)
sl@0: 		{
sl@0: 		pq->items = item;
sl@0: 		return item;
sl@0: 		}
sl@0: 
sl@0: 	for(curr = NULL, next = pq->items; 
sl@0: 		next != NULL;
sl@0: 		curr = next, next = next->next)
sl@0: 		{
sl@0: 		if (pq_64bit_gt(&(next->priority), &(item->priority)))
sl@0: 			{
sl@0: 			item->next = next;
sl@0: 
sl@0: 			if (curr == NULL) 
sl@0: 				pq->items = item;
sl@0: 			else  
sl@0: 				curr->next = item;
sl@0: 
sl@0: 			return item;
sl@0: 			}
sl@0: 		/* duplicates not allowed */
sl@0: 		if (pq_64bit_eq(&(item->priority), &(next->priority)))
sl@0: 			return NULL;
sl@0: 		}
sl@0: 
sl@0: 	item->next = NULL;
sl@0: 	curr->next = item;
sl@0: 
sl@0: 	return item;
sl@0: 	}
sl@0: 
sl@0: EXPORT_C pitem *
sl@0: pqueue_peek(pqueue_s *pq)
sl@0: 	{
sl@0: 	return pq->items;
sl@0: 	}
sl@0: 
sl@0: EXPORT_C pitem *
sl@0: pqueue_pop(pqueue_s *pq)
sl@0: 	{
sl@0: 	pitem *item = pq->items;
sl@0: 
sl@0: 	if (pq->items != NULL)
sl@0: 		pq->items = pq->items->next;
sl@0: 
sl@0: 	return item;
sl@0: 	}
sl@0: 
sl@0: EXPORT_C pitem *
sl@0: pqueue_find(pqueue_s *pq, PQ_64BIT priority)
sl@0: 	{
sl@0: 	pitem *next, *prev = NULL;
sl@0: 	pitem *found = NULL;
sl@0: 
sl@0: 	if ( pq->items == NULL)
sl@0: 		return NULL;
sl@0: 
sl@0: 	for ( next = pq->items; next->next != NULL; 
sl@0: 		  prev = next, next = next->next)
sl@0: 		{
sl@0: 		if ( pq_64bit_eq(&(next->priority), &priority))
sl@0: 			{
sl@0: 			found = next;
sl@0: 			break;
sl@0: 			}
sl@0: 		}
sl@0: 	
sl@0: 	/* check the one last node */
sl@0: 	if ( pq_64bit_eq(&(next->priority), &priority))
sl@0: 		found = next;
sl@0: 
sl@0: 	if ( ! found)
sl@0: 		return NULL;
sl@0: 
sl@0: #if 0 /* find works in peek mode */
sl@0: 	if ( prev == NULL)
sl@0: 		pq->items = next->next;
sl@0: 	else
sl@0: 		prev->next = next->next;
sl@0: #endif
sl@0: 
sl@0: 	return found;
sl@0: 	}
sl@0: 
sl@0: #if PQ_64BIT_IS_INTEGER
sl@0: EXPORT_C void
sl@0: pqueue_print(pqueue_s *pq)
sl@0: 	{
sl@0: 	pitem *item = pq->items;
sl@0: 
sl@0: 	while(item != NULL)
sl@0: 		{
sl@0: 		printf("item\t" PQ_64BIT_PRINT "\n", item->priority);
sl@0: 		item = item->next;
sl@0: 		}
sl@0: 	}
sl@0: #endif
sl@0: 
sl@0: EXPORT_C pitem *
sl@0: pqueue_iterator(pqueue_s *pq)
sl@0: 	{
sl@0: 	return pqueue_peek(pq);
sl@0: 	}
sl@0: 
sl@0: EXPORT_C pitem *
sl@0: pqueue_next(pitem **item)
sl@0: 	{
sl@0: 	pitem *ret;
sl@0: 
sl@0: 	if ( item == NULL || *item == NULL)
sl@0: 		return NULL;
sl@0: 
sl@0: 
sl@0: 	/* *item != NULL */
sl@0: 	ret = *item;
sl@0: 	*item = (*item)->next;
sl@0: 
sl@0: 	return ret;
sl@0: 	}