1/*
2 * DTLS implementation written by Nagendra Modadugu
3 * (nagendra@cs.stanford.edu) for the OpenSSL project 2005.
4 */
5/* ====================================================================
6 * Copyright (c) 1999-2005 The OpenSSL Project.  All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 *
12 * 1. Redistributions of source code must retain the above copyright
13 *    notice, this list of conditions and the following disclaimer.
14 *
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
18 *    distribution.
19 *
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/)"
24 *
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.
29 *
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.
33 *
34 * 6. Redistributions of any form whatsoever must retain the following
35 *    acknowledgment:
36 *    "This product includes software developed by the OpenSSL Project
37 *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
38 *
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 * ====================================================================
52 *
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). */
56
57#include <openssl/pqueue.h>
58
59#include <openssl/mem.h>
60
61
62typedef struct _pqueue {
63  pitem *items;
64  unsigned count;
65} pqueue_s;
66
67
68pitem *pitem_new(uint8_t prio64be[8], void *data) {
69  pitem *item = (pitem *)OPENSSL_malloc(sizeof(pitem));
70  if (item == NULL) {
71    return NULL;
72  }
73
74  memcpy(item->priority, prio64be, sizeof(item->priority));
75
76  item->data = data;
77  item->next = NULL;
78
79  return item;
80}
81
82void pitem_free(pitem *item) {
83  if (item == NULL) {
84    return;
85  }
86
87  OPENSSL_free(item);
88}
89
90pqueue pqueue_new(void) {
91  pqueue_s *pq = (pqueue_s *)OPENSSL_malloc(sizeof(pqueue_s));
92  if (pq == NULL) {
93    return NULL;
94  }
95
96  memset(pq, 0, sizeof(pqueue_s));
97  return pq;
98}
99
100void pqueue_free(pqueue_s *pq) {
101  if (pq == NULL) {
102    return;
103  }
104
105  OPENSSL_free(pq);
106}
107
108pitem *pqueue_peek(pqueue_s *pq) { return pq->items; }
109
110pitem *pqueue_find(pqueue_s *pq, uint8_t *prio64be) {
111  pitem *curr;
112
113  for (curr = pq->items; curr; curr = curr->next) {
114    if (memcmp(curr->priority, prio64be, sizeof(curr->priority)) == 0) {
115      return curr;
116    }
117  }
118
119  return NULL;
120}
121
122size_t pqueue_size(pqueue_s *pq) {
123  pitem *item = pq->items;
124  size_t count = 0;
125
126  while (item != NULL) {
127    count++;
128    item = item->next;
129  }
130  return count;
131}
132
133piterator pqueue_iterator(pqueue_s *pq) { return pq->items; }
134
135pitem *pqueue_next(piterator *item) {
136  pitem *ret;
137
138  if (item == NULL || *item == NULL) {
139    return NULL;
140  }
141
142  ret = *item;
143  *item = (*item)->next;
144
145  return ret;
146}
147
148pitem *pqueue_insert(pqueue_s *pq, pitem *item) {
149  pitem *curr, *next;
150
151  if (pq->items == NULL) {
152    pq->items = item;
153    return item;
154  }
155
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));
160    if (cmp > 0) {
161      /* next > item */
162      item->next = next;
163
164      if (curr == NULL) {
165        pq->items = item;
166      } else {
167        curr->next = item;
168      }
169
170      return item;
171    } else if (cmp == 0) {
172      /* duplicates not allowed */
173      return NULL;
174    }
175  }
176
177  item->next = NULL;
178  curr->next = item;
179
180  return item;
181}
182
183
184pitem *pqueue_pop(pqueue_s *pq) {
185  pitem *item = pq->items;
186
187  if (pq->items != NULL) {
188    pq->items = pq->items->next;
189  }
190
191  return item;
192}
193