2 * DTLS implementation written by Nagendra Modadugu
3 * (nagendra@cs.stanford.edu) for the OpenSSL project 2005.
5 /* ====================================================================
6 * Copyright (c) 1999-2005 The OpenSSL Project. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in
17 * the documentation and/or other materials provided with the
20 * 3. All advertising materials mentioning features or use of this
21 * software must display the following acknowledgment:
22 * "This product includes software developed by the OpenSSL Project
23 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
25 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
26 * endorse or promote products derived from this software without
27 * prior written permission. For written permission, please contact
28 * openssl-core@OpenSSL.org.
30 * 5. Products derived from this software may not be called "OpenSSL"
31 * nor may "OpenSSL" appear in their names without prior written
32 * permission of the OpenSSL Project.
34 * 6. Redistributions of any form whatsoever must retain the following
36 * "This product includes software developed by the OpenSSL Project
37 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
39 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
40 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
41 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
42 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
43 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
44 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
45 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
46 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
48 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
49 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
50 * OF THE POSSIBILITY OF SUCH DAMAGE.
51 * ====================================================================
53 * This product includes cryptographic software written by Eric Young
54 * (eay@cryptsoft.com). This product includes software written by Tim
55 * Hudson (tjh@cryptsoft.com).
60 #include <openssl/bn.h>
67 pitem *pitem_new(unsigned char *prio64be, void *data)
69 pitem *item = OPENSSL_malloc(sizeof(*item));
73 memcpy(item->priority, prio64be, sizeof(item->priority));
81 void pitem_free(pitem *item)
88 pqueue *pq = OPENSSL_zalloc(sizeof(*pq));
93 void pqueue_free(pqueue *pq)
98 pitem *pqueue_insert(pqueue *pq, pitem *item)
102 if (pq->items == NULL) {
107 for (curr = NULL, next = pq->items;
108 next != NULL; curr = next, next = next->next) {
110 * we can compare 64-bit value in big-endian encoding with memcmp:-)
112 int cmp = memcmp(next->priority, item->priority, 8);
113 if (cmp > 0) { /* next > item */
124 else if (cmp == 0) /* duplicates not allowed */
134 pitem *pqueue_peek(pqueue *pq)
139 pitem *pqueue_pop(pqueue *pq)
141 pitem *item = pq->items;
143 if (pq->items != NULL)
144 pq->items = pq->items->next;
149 pitem *pqueue_find(pqueue *pq, unsigned char *prio64be)
154 if (pq->items == NULL)
157 for (next = pq->items; next->next != NULL; next = next->next) {
158 if (memcmp(next->priority, prio64be, 8) == 0) {
164 /* check the one last node */
165 if (memcmp(next->priority, prio64be, 8) == 0)
174 pitem *pqueue_iterator(pqueue *pq)
176 return pqueue_peek(pq);
179 pitem *pqueue_next(pitem **item)
183 if (item == NULL || *item == NULL)
188 *item = (*item)->next;
193 int pqueue_size(pqueue *pq)
195 pitem *item = pq->items;
198 while (item != NULL) {