1 /* crypto/pqueue/pqueue.c */
3 * DTLS implementation written by Nagendra Modadugu
4 * (nagendra@cs.stanford.edu) for the OpenSSL project 2005.
6 /* ====================================================================
7 * Copyright (c) 1999-2005 The OpenSSL Project. All rights reserved.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in
18 * the documentation and/or other materials provided with the
21 * 3. All advertising materials mentioning features or use of this
22 * software must display the following acknowledgment:
23 * "This product includes software developed by the OpenSSL Project
24 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
26 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
27 * endorse or promote products derived from this software without
28 * prior written permission. For written permission, please contact
29 * openssl-core@OpenSSL.org.
31 * 5. Products derived from this software may not be called "OpenSSL"
32 * nor may "OpenSSL" appear in their names without prior written
33 * permission of the OpenSSL Project.
35 * 6. Redistributions of any form whatsoever must retain the following
37 * "This product includes software developed by the OpenSSL Project
38 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
40 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
41 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
43 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
44 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
45 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
46 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
47 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
49 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
50 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
51 * OF THE POSSIBILITY OF SUCH DAMAGE.
52 * ====================================================================
54 * This product includes cryptographic software written by Eric Young
55 * (eay@cryptsoft.com). This product includes software written by Tim
56 * Hudson (tjh@cryptsoft.com).
61 #include <openssl/bn.h>
64 typedef struct _pqueue {
69 pitem *pitem_new(unsigned char *prio64be, void *data)
71 pitem *item = (pitem *)OPENSSL_malloc(sizeof(pitem));
75 memcpy(item->priority, prio64be, sizeof(item->priority));
83 void pitem_free(pitem *item)
91 pqueue_s *pqueue_new()
93 pqueue_s *pq = (pqueue_s *)OPENSSL_malloc(sizeof(pqueue_s));
97 memset(pq, 0x00, sizeof(pqueue_s));
101 void pqueue_free(pqueue_s *pq)
109 pitem *pqueue_insert(pqueue_s *pq, pitem *item)
113 if (pq->items == NULL) {
118 for (curr = NULL, next = pq->items;
119 next != NULL; curr = next, next = next->next) {
121 * we can compare 64-bit value in big-endian encoding with memcmp:-)
123 int cmp = memcmp(next->priority, item->priority, 8);
124 if (cmp > 0) { /* next > item */
135 else if (cmp == 0) /* duplicates not allowed */
145 pitem *pqueue_peek(pqueue_s *pq)
150 pitem *pqueue_pop(pqueue_s *pq)
152 pitem *item = pq->items;
154 if (pq->items != NULL)
155 pq->items = pq->items->next;
160 pitem *pqueue_find(pqueue_s *pq, unsigned char *prio64be)
165 if (pq->items == NULL)
168 for (next = pq->items; next->next != NULL; next = next->next) {
169 if (memcmp(next->priority, prio64be, 8) == 0) {
175 /* check the one last node */
176 if (memcmp(next->priority, prio64be, 8) == 0)
182 #if 0 /* find works in peek mode */
184 pq->items = next->next;
186 prev->next = next->next;
192 void pqueue_print(pqueue_s *pq)
194 pitem *item = pq->items;
196 while (item != NULL) {
197 printf("item\t%02x%02x%02x%02x%02x%02x%02x%02x\n",
198 item->priority[0], item->priority[1],
199 item->priority[2], item->priority[3],
200 item->priority[4], item->priority[5],
201 item->priority[6], item->priority[7]);
206 pitem *pqueue_iterator(pqueue_s *pq)
208 return pqueue_peek(pq);
211 pitem *pqueue_next(pitem **item)
215 if (item == NULL || *item == NULL)
220 *item = (*item)->next;
225 int pqueue_size(pqueue_s *pq)
227 pitem *item = pq->items;
230 while (item != NULL) {