diff options
Diffstat (limited to 'src/lib/libcrypto/pqueue')
| -rw-r--r-- | src/lib/libcrypto/pqueue/pqueue.c | 237 | ||||
| -rw-r--r-- | src/lib/libcrypto/pqueue/pqueue.h | 93 |
2 files changed, 0 insertions, 330 deletions
diff --git a/src/lib/libcrypto/pqueue/pqueue.c b/src/lib/libcrypto/pqueue/pqueue.c deleted file mode 100644 index fc68ae19c3..0000000000 --- a/src/lib/libcrypto/pqueue/pqueue.c +++ /dev/null | |||
| @@ -1,237 +0,0 @@ | |||
| 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 "cryptlib.h" | ||
| 61 | #include <openssl/bn.h> | ||
| 62 | #include "pqueue.h" | ||
| 63 | |||
| 64 | typedef struct _pqueue { | ||
| 65 | pitem *items; | ||
| 66 | int count; | ||
| 67 | } pqueue_s; | ||
| 68 | |||
| 69 | pitem * | ||
| 70 | pitem_new(unsigned char *prio64be, void *data) | ||
| 71 | { | ||
| 72 | pitem *item = (pitem *)malloc(sizeof(pitem)); | ||
| 73 | |||
| 74 | if (item == NULL) | ||
| 75 | return NULL; | ||
| 76 | |||
| 77 | memcpy(item->priority, prio64be, sizeof(item->priority)); | ||
| 78 | |||
| 79 | item->data = data; | ||
| 80 | item->next = NULL; | ||
| 81 | |||
| 82 | return item; | ||
| 83 | } | ||
| 84 | |||
| 85 | void | ||
| 86 | pitem_free(pitem *item) | ||
| 87 | { | ||
| 88 | if (item == NULL) | ||
| 89 | return; | ||
| 90 | |||
| 91 | free(item); | ||
| 92 | } | ||
| 93 | |||
| 94 | pqueue_s * | ||
| 95 | pqueue_new(void) | ||
| 96 | { | ||
| 97 | pqueue_s *pq = (pqueue_s *)malloc(sizeof(pqueue_s)); | ||
| 98 | |||
| 99 | if (pq == NULL) | ||
| 100 | return NULL; | ||
| 101 | |||
| 102 | memset(pq, 0x00, sizeof(pqueue_s)); | ||
| 103 | return pq; | ||
| 104 | } | ||
| 105 | |||
| 106 | void | ||
| 107 | pqueue_free(pqueue_s *pq) | ||
| 108 | { | ||
| 109 | if (pq == NULL) | ||
| 110 | return; | ||
| 111 | |||
| 112 | free(pq); | ||
| 113 | } | ||
| 114 | |||
| 115 | pitem * | ||
| 116 | pqueue_insert(pqueue_s *pq, pitem *item) | ||
| 117 | { | ||
| 118 | pitem *curr, *next; | ||
| 119 | |||
| 120 | if (pq->items == NULL) { | ||
| 121 | pq->items = item; | ||
| 122 | return item; | ||
| 123 | } | ||
| 124 | |||
| 125 | for (curr = NULL, next = pq->items; next != NULL; | ||
| 126 | curr = next, next = next->next) { | ||
| 127 | /* we can compare 64-bit value in big-endian encoding | ||
| 128 | * with memcmp:-) */ | ||
| 129 | int cmp = memcmp(next->priority, item->priority, | ||
| 130 | sizeof(item->priority)); | ||
| 131 | if (cmp > 0) /* next > item */ | ||
| 132 | { | ||
| 133 | item->next = next; | ||
| 134 | |||
| 135 | if (curr == NULL) | ||
| 136 | pq->items = item; | ||
| 137 | else | ||
| 138 | curr->next = item; | ||
| 139 | |||
| 140 | return item; | ||
| 141 | } else if (cmp == 0) /* duplicates not allowed */ | ||
| 142 | return NULL; | ||
| 143 | } | ||
| 144 | |||
| 145 | item->next = NULL; | ||
| 146 | curr->next = item; | ||
| 147 | |||
| 148 | return item; | ||
| 149 | } | ||
| 150 | |||
| 151 | pitem * | ||
| 152 | pqueue_peek(pqueue_s *pq) | ||
| 153 | { | ||
| 154 | return pq->items; | ||
| 155 | } | ||
| 156 | |||
| 157 | pitem * | ||
| 158 | pqueue_pop(pqueue_s *pq) | ||
| 159 | { | ||
| 160 | pitem *item = pq->items; | ||
| 161 | |||
| 162 | if (pq->items != NULL) | ||
| 163 | pq->items = pq->items->next; | ||
| 164 | |||
| 165 | return item; | ||
| 166 | } | ||
| 167 | |||
| 168 | pitem * | ||
| 169 | pqueue_find(pqueue_s *pq, unsigned char *prio64be) | ||
| 170 | { | ||
| 171 | pitem *next; | ||
| 172 | pitem *found = NULL; | ||
| 173 | |||
| 174 | if (pq->items == NULL) | ||
| 175 | return NULL; | ||
| 176 | |||
| 177 | for (next = pq->items; next != NULL; next = next->next) { | ||
| 178 | if (memcmp(next->priority, prio64be, 8) == 0) { | ||
| 179 | found = next; | ||
| 180 | break; | ||
| 181 | } | ||
| 182 | } | ||
| 183 | |||
| 184 | if (!found) | ||
| 185 | return NULL; | ||
| 186 | |||
| 187 | return found; | ||
| 188 | } | ||
| 189 | |||
| 190 | void | ||
| 191 | pqueue_print(pqueue_s *pq) | ||
| 192 | { | ||
| 193 | pitem *item = pq->items; | ||
| 194 | |||
| 195 | while (item != NULL) { | ||
| 196 | printf("item\t%02x%02x%02x%02x%02x%02x%02x%02x\n", | ||
| 197 | item->priority[0], item->priority[1], | ||
| 198 | item->priority[2], item->priority[3], | ||
| 199 | item->priority[4], item->priority[5], | ||
| 200 | item->priority[6], item->priority[7]); | ||
| 201 | item = item->next; | ||
| 202 | } | ||
| 203 | } | ||
| 204 | |||
| 205 | pitem * | ||
| 206 | pqueue_iterator(pqueue_s *pq) | ||
| 207 | { | ||
| 208 | return pqueue_peek(pq); | ||
| 209 | } | ||
| 210 | |||
| 211 | pitem * | ||
| 212 | pqueue_next(pitem **item) | ||
| 213 | { | ||
| 214 | pitem *ret; | ||
| 215 | |||
| 216 | if (item == NULL || *item == NULL) | ||
| 217 | return NULL; | ||
| 218 | |||
| 219 | /* *item != NULL */ | ||
| 220 | ret = *item; | ||
| 221 | *item = (*item)->next; | ||
| 222 | |||
| 223 | return ret; | ||
| 224 | } | ||
| 225 | |||
| 226 | int | ||
| 227 | pqueue_size(pqueue_s *pq) | ||
| 228 | { | ||
| 229 | pitem *item = pq->items; | ||
| 230 | int count = 0; | ||
| 231 | |||
| 232 | while (item != NULL) { | ||
| 233 | count++; | ||
| 234 | item = item->next; | ||
| 235 | } | ||
| 236 | return count; | ||
| 237 | } | ||
diff --git a/src/lib/libcrypto/pqueue/pqueue.h b/src/lib/libcrypto/pqueue/pqueue.h deleted file mode 100644 index 729e9abaf2..0000000000 --- a/src/lib/libcrypto/pqueue/pqueue.h +++ /dev/null | |||
| @@ -1,93 +0,0 @@ | |||
| 1 | /* crypto/pqueue/pqueue.h */ | ||
| 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 | #ifndef HEADER_PQUEUE_H | ||
| 61 | #define HEADER_PQUEUE_H | ||
| 62 | |||
| 63 | #include <stdio.h> | ||
| 64 | #include <stdlib.h> | ||
| 65 | #include <string.h> | ||
| 66 | |||
| 67 | typedef struct _pqueue *pqueue; | ||
| 68 | |||
| 69 | typedef struct _pitem { | ||
| 70 | unsigned char priority[8]; /* 64-bit value in big-endian encoding */ | ||
| 71 | void *data; | ||
| 72 | struct _pitem *next; | ||
| 73 | } pitem; | ||
| 74 | |||
| 75 | typedef struct _pitem *piterator; | ||
| 76 | |||
| 77 | pitem *pitem_new(unsigned char *prio64be, void *data); | ||
| 78 | void pitem_free(pitem *item); | ||
| 79 | |||
| 80 | pqueue pqueue_new(void); | ||
| 81 | void pqueue_free(pqueue pq); | ||
| 82 | |||
| 83 | pitem *pqueue_insert(pqueue pq, pitem *item); | ||
| 84 | pitem *pqueue_peek(pqueue pq); | ||
| 85 | pitem *pqueue_pop(pqueue pq); | ||
| 86 | pitem *pqueue_find(pqueue pq, unsigned char *prio64be); | ||
| 87 | pitem *pqueue_iterator(pqueue pq); | ||
| 88 | pitem *pqueue_next(piterator *iter); | ||
| 89 | |||
| 90 | void pqueue_print(pqueue pq); | ||
| 91 | int pqueue_size(pqueue pq); | ||
| 92 | |||
| 93 | #endif /* ! HEADER_PQUEUE_H */ | ||
