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). */
57 #include <openssl/pqueue.h>
59 #include <openssl/mem.h>
62 typedef struct _pqueue {
68 pitem *pitem_new(uint8_t prio64be[8], void *data) {
69 pitem *item = (pitem *)OPENSSL_malloc(sizeof(pitem));
74 memcpy(item->priority, prio64be, sizeof(item->priority));
82 void pitem_free(pitem *item) {
90 pqueue pqueue_new(void) {
91 pqueue_s *pq = (pqueue_s *)OPENSSL_malloc(sizeof(pqueue_s));
96 memset(pq, 0, sizeof(pqueue_s));
100 void pqueue_free(pqueue_s *pq) {
108 pitem *pqueue_peek(pqueue_s *pq) { return pq->items; }
110 pitem *pqueue_find(pqueue_s *pq, uint8_t *prio64be) {
113 for (curr = pq->items; curr; curr = curr->next) {
114 if (memcmp(curr->priority, prio64be, sizeof(curr->priority)) == 0) {
122 size_t pqueue_size(pqueue_s *pq) {
123 pitem *item = pq->items;
126 while (item != NULL) {
133 piterator pqueue_iterator(pqueue_s *pq) { return pq->items; }
135 pitem *pqueue_next(piterator *item) {
138 if (item == NULL || *item == NULL) {
143 *item = (*item)->next;
148 pitem *pqueue_insert(pqueue_s *pq, pitem *item) {
151 if (pq->items == NULL) {
156 for (curr = NULL, next = pq->items; next != NULL;
157 curr = next, next = next->next) {
158 /* we can compare 64-bit value in big-endian encoding with memcmp. */
159 int cmp = memcmp(next->priority, item->priority, sizeof(item->priority));
171 } else if (cmp == 0) {
172 /* duplicates not allowed */
184 pitem *pqueue_pop(pqueue_s *pq) {
185 pitem *item = pq->items;
187 if (pq->items != NULL) {
188 pq->items = pq->items->next;