]>
Commit | Line | Data |
---|---|---|
36d16f8e BL |
1 | /* crypto/pqueue/pqueue.c */ |
2 | /* | |
3 | * DTLS implementation written by Nagendra Modadugu | |
4 | * (nagendra@cs.stanford.edu) for the OpenSSL project 2005. | |
5 | */ | |
6 | /* ==================================================================== | |
7 | * Copyright (c) 1999-2005 The OpenSSL Project. All rights reserved. | |
8 | * | |
9 | * Redistribution and use in source and binary forms, with or without | |
10 | * modification, are permitted provided that the following conditions | |
11 | * are met: | |
12 | * | |
13 | * 1. Redistributions of source code must retain the above copyright | |
14 | * notice, this list of conditions and the following disclaimer. | |
15 | * | |
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 | |
19 | * distribution. | |
20 | * | |
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/)" | |
25 | * | |
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. | |
30 | * | |
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. | |
34 | * | |
35 | * 6. Redistributions of any form whatsoever must retain the following | |
36 | * acknowledgment: | |
37 | * "This product includes software developed by the OpenSSL Project | |
38 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | |
39 | * | |
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 | * ==================================================================== | |
53 | * | |
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). | |
57 | * | |
58 | */ | |
59 | ||
60 | #include "pqueue.h" | |
61 | #include "crypto.h" | |
62 | ||
63 | typedef struct _pqueue | |
64 | { | |
65 | pitem *items; | |
66 | int count; | |
67 | } pqueue_s; | |
68 | ||
69 | pitem * | |
70 | pitem_new(unsigned long long priority, void *data) | |
71 | { | |
72 | pitem *item = (pitem *) OPENSSL_malloc(sizeof(pitem)); | |
73 | if (item == NULL) return NULL; | |
74 | ||
75 | item->priority = priority; | |
76 | item->data = data; | |
77 | item->next = NULL; | |
78 | ||
79 | return item; | |
80 | } | |
81 | ||
82 | void | |
83 | pitem_free(pitem *item) | |
84 | { | |
85 | if (item == NULL) return; | |
86 | ||
87 | OPENSSL_free(item); | |
88 | } | |
89 | ||
90 | pqueue_s * | |
91 | pqueue_new() | |
92 | { | |
93 | pqueue_s *pq = (pqueue_s *) OPENSSL_malloc(sizeof(pqueue_s)); | |
94 | if (pq == NULL) return NULL; | |
95 | ||
96 | memset(pq, 0x00, sizeof(pqueue_s)); | |
97 | return pq; | |
98 | } | |
99 | ||
100 | void | |
101 | pqueue_free(pqueue_s *pq) | |
102 | { | |
103 | if (pq == NULL) return; | |
104 | ||
105 | OPENSSL_free(pq); | |
106 | } | |
107 | ||
108 | pitem * | |
109 | pqueue_insert(pqueue_s *pq, pitem *item) | |
110 | { | |
111 | pitem *curr, *next; | |
112 | ||
113 | if (pq->items == NULL) | |
114 | { | |
115 | pq->items = item; | |
116 | return item; | |
117 | } | |
118 | ||
119 | for(curr = NULL, next = pq->items; | |
120 | next != NULL; | |
121 | curr = next, next = next->next) | |
122 | { | |
123 | if (item->priority < next->priority) | |
124 | { | |
125 | item->next = next; | |
126 | ||
127 | if (curr == NULL) | |
128 | pq->items = item; | |
129 | else | |
130 | curr->next = item; | |
131 | ||
132 | return item; | |
133 | } | |
134 | /* duplicates not allowed */ | |
135 | if (item->priority == next->priority) | |
136 | return NULL; | |
137 | } | |
138 | ||
139 | item->next = NULL; | |
140 | curr->next = item; | |
141 | ||
142 | return item; | |
143 | } | |
144 | ||
145 | pitem * | |
146 | pqueue_peek(pqueue_s *pq) | |
147 | { | |
148 | return pq->items; | |
149 | } | |
150 | ||
151 | pitem * | |
152 | pqueue_pop(pqueue_s *pq) | |
153 | { | |
154 | pitem *item = pq->items; | |
155 | ||
156 | if (pq->items != NULL) | |
157 | pq->items = pq->items->next; | |
158 | ||
159 | return item; | |
160 | } | |
161 | ||
162 | pitem * | |
163 | pqueue_find(pqueue_s *pq, unsigned long long priority) | |
164 | { | |
165 | pitem *next, *prev = NULL; | |
166 | pitem *found = NULL; | |
167 | ||
168 | if ( pq->items == NULL) | |
169 | return NULL; | |
170 | ||
171 | for ( next = pq->items; next->next != NULL; | |
172 | prev = next, next = next->next) | |
173 | { | |
174 | if ( next->priority == priority) | |
175 | { | |
176 | found = next; | |
177 | break; | |
178 | } | |
179 | } | |
180 | ||
181 | /* check the one last node */ | |
182 | if ( next->priority == priority) | |
183 | found = next; | |
184 | ||
185 | if ( ! found) | |
186 | return NULL; | |
187 | ||
188 | #if 0 /* find works in peek mode */ | |
189 | if ( prev == NULL) | |
190 | pq->items = next->next; | |
191 | else | |
192 | prev->next = next->next; | |
193 | #endif | |
194 | ||
195 | return found; | |
196 | } | |
197 | ||
198 | void | |
199 | pqueue_print(pqueue_s *pq) | |
200 | { | |
201 | pitem *item = pq->items; | |
202 | ||
203 | while(item != NULL) | |
204 | { | |
205 | printf("item\t%lld\n", item->priority); | |
206 | item = item->next; | |
207 | } | |
208 | } | |
209 | ||
210 | pitem * | |
211 | pqueue_iterator(pqueue_s *pq) | |
212 | { | |
213 | return pqueue_peek(pq); | |
214 | } | |
215 | ||
216 | pitem * | |
217 | pqueue_next(pitem **item) | |
218 | { | |
219 | pitem *ret; | |
220 | ||
221 | if ( item == NULL || *item == NULL) | |
222 | return NULL; | |
223 | ||
224 | ||
225 | /* *item != NULL */ | |
226 | ret = *item; | |
227 | *item = (*item)->next; | |
228 | ||
229 | return ret; | |
230 | } |