diff options
Diffstat (limited to 'src/lib/libcrypto/pqueue')
-rw-r--r-- | src/lib/libcrypto/pqueue/Makefile | 83 | ||||
-rw-r--r-- | src/lib/libcrypto/pqueue/pq_compat.h | 152 | ||||
-rw-r--r-- | src/lib/libcrypto/pqueue/pq_test.c | 95 | ||||
-rw-r--r-- | src/lib/libcrypto/pqueue/pqueue.c | 252 | ||||
-rw-r--r-- | src/lib/libcrypto/pqueue/pqueue.h | 94 |
5 files changed, 524 insertions, 152 deletions
diff --git a/src/lib/libcrypto/pqueue/Makefile b/src/lib/libcrypto/pqueue/Makefile new file mode 100644 index 0000000000..fb36a0c876 --- /dev/null +++ b/src/lib/libcrypto/pqueue/Makefile | |||
@@ -0,0 +1,83 @@ | |||
1 | # | ||
2 | # OpenSSL/crypto/pqueue/Makefile | ||
3 | # | ||
4 | |||
5 | DIR= pqueue | ||
6 | TOP= ../.. | ||
7 | CC= cc | ||
8 | INCLUDES= | ||
9 | CFLAG=-g | ||
10 | MAKEFILE= Makefile | ||
11 | AR= ar r | ||
12 | |||
13 | CFLAGS= $(INCLUDES) $(CFLAG) | ||
14 | |||
15 | GENERAL=Makefile | ||
16 | TEST= | ||
17 | APPS= | ||
18 | |||
19 | LIB=$(TOP)/libcrypto.a | ||
20 | LIBSRC=pqueue.c | ||
21 | LIBOBJ=pqueue.o | ||
22 | |||
23 | SRC= $(LIBSRC) | ||
24 | |||
25 | EXHEADER= pqueue.h | ||
26 | HEADER= $(EXHEADER) | ||
27 | |||
28 | ALL= $(GENERAL) $(SRC) $(HEADER) | ||
29 | |||
30 | top: | ||
31 | (cd ../..; $(MAKE) DIRS=crypto SDIRS=$(DIR) sub_all) | ||
32 | |||
33 | all: lib | ||
34 | |||
35 | lib: $(LIBOBJ) | ||
36 | $(AR) $(LIB) $(LIBOBJ) | ||
37 | $(RANLIB) $(LIB) || echo Never mind. | ||
38 | @touch lib | ||
39 | |||
40 | files: | ||
41 | $(PERL) $(TOP)/util/files.pl Makefile >> $(TOP)/MINFO | ||
42 | |||
43 | links: | ||
44 | @$(PERL) $(TOP)/util/mklink.pl ../../include/openssl $(EXHEADER) | ||
45 | @$(PERL) $(TOP)/util/mklink.pl ../../test $(TEST) | ||
46 | @$(PERL) $(TOP)/util/mklink.pl ../../apps $(APPS) | ||
47 | |||
48 | install: | ||
49 | @[ -n "$(INSTALLTOP)" ] # should be set by top Makefile... | ||
50 | @headerlist="$(EXHEADER)"; for i in $$headerlist ; \ | ||
51 | do \ | ||
52 | (cp $$i $(INSTALL_PREFIX)$(INSTALLTOP)/include/openssl/$$i; \ | ||
53 | chmod 644 $(INSTALL_PREFIX)$(INSTALLTOP)/include/openssl/$$i ); \ | ||
54 | done; | ||
55 | |||
56 | tags: | ||
57 | ctags $(SRC) | ||
58 | |||
59 | tests: | ||
60 | |||
61 | lint: | ||
62 | lint -DLINT $(INCLUDES) $(SRC)>fluff | ||
63 | |||
64 | depend: | ||
65 | @[ -n "$(MAKEDEPEND)" ] # should be set by upper Makefile... | ||
66 | $(MAKEDEPEND) -- $(CFLAG) $(INCLUDES) $(DEPFLAG) -- $(PROGS) $(LIBSRC) | ||
67 | |||
68 | dclean: | ||
69 | $(PERL) -pe 'if (/^# DO NOT DELETE THIS LINE/) {print; exit(0);}' $(MAKEFILE) >Makefile.new | ||
70 | mv -f Makefile.new $(MAKEFILE) | ||
71 | |||
72 | clean: | ||
73 | rm -f *.o *.obj lib tags core .pure .nfs* *.old *.bak fluff | ||
74 | |||
75 | # DO NOT DELETE THIS LINE -- make depend depends on it. | ||
76 | |||
77 | pqueue.o: ../../e_os.h ../../include/openssl/bio.h ../../include/openssl/bn.h | ||
78 | pqueue.o: ../../include/openssl/buffer.h ../../include/openssl/crypto.h | ||
79 | pqueue.o: ../../include/openssl/e_os2.h ../../include/openssl/err.h | ||
80 | pqueue.o: ../../include/openssl/lhash.h ../../include/openssl/opensslconf.h | ||
81 | pqueue.o: ../../include/openssl/opensslv.h ../../include/openssl/ossl_typ.h | ||
82 | pqueue.o: ../../include/openssl/safestack.h ../../include/openssl/stack.h | ||
83 | pqueue.o: ../../include/openssl/symhacks.h ../cryptlib.h pqueue.c pqueue.h | ||
diff --git a/src/lib/libcrypto/pqueue/pq_compat.h b/src/lib/libcrypto/pqueue/pq_compat.h deleted file mode 100644 index 7b2c32725c..0000000000 --- a/src/lib/libcrypto/pqueue/pq_compat.h +++ /dev/null | |||
@@ -1,152 +0,0 @@ | |||
1 | /* crypto/pqueue/pqueue_compat.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_PQ_COMPAT_H | ||
61 | #define HEADER_PQ_COMPAT_H | ||
62 | |||
63 | #include <openssl/opensslconf.h> | ||
64 | #include <openssl/bn.h> | ||
65 | |||
66 | /* | ||
67 | * The purpose of this header file is for supporting 64-bit integer | ||
68 | * manipulation on 32-bit (and lower) machines. Currently the only | ||
69 | * such environment is VMS, Utrix and those with smaller default integer | ||
70 | * sizes than 32 bits. For all such environment, we fall back to using | ||
71 | * BIGNUM. We may need to fine tune the conditions for systems that | ||
72 | * are incorrectly configured. | ||
73 | * | ||
74 | * The only clients of this code are (1) pqueue for priority, and | ||
75 | * (2) DTLS, for sequence number manipulation. | ||
76 | */ | ||
77 | |||
78 | #if (defined(THIRTY_TWO_BIT) && !defined(BN_LLONG)) || defined(SIXTEEN_BIT) || defined(EIGHT_BIT) | ||
79 | |||
80 | #define PQ_64BIT_IS_INTEGER 0 | ||
81 | #define PQ_64BIT_IS_BIGNUM 1 | ||
82 | |||
83 | #define PQ_64BIT BIGNUM | ||
84 | #define PQ_64BIT_CTX BN_CTX | ||
85 | |||
86 | #define pq_64bit_init(x) BN_init(x) | ||
87 | #define pq_64bit_free(x) BN_free(x) | ||
88 | |||
89 | #define pq_64bit_ctx_new(ctx) BN_CTX_new() | ||
90 | #define pq_64bit_ctx_free(x) BN_CTX_free(x) | ||
91 | |||
92 | #define pq_64bit_assign(x, y) BN_copy(x, y) | ||
93 | #define pq_64bit_assign_word(x, y) BN_set_word(x, y) | ||
94 | #define pq_64bit_gt(x, y) BN_ucmp(x, y) >= 1 ? 1 : 0 | ||
95 | #define pq_64bit_eq(x, y) BN_ucmp(x, y) == 0 ? 1 : 0 | ||
96 | #define pq_64bit_add_word(x, w) BN_add_word(x, w) | ||
97 | #define pq_64bit_sub(r, x, y) BN_sub(r, x, y) | ||
98 | #define pq_64bit_sub_word(x, w) BN_sub_word(x, w) | ||
99 | #define pq_64bit_mod(r, x, n, ctx) BN_mod(r, x, n, ctx) | ||
100 | |||
101 | #define pq_64bit_bin2num(bn, bytes, len) BN_bin2bn(bytes, len, bn) | ||
102 | #define pq_64bit_num2bin(bn, bytes) BN_bn2bin(bn, bytes) | ||
103 | #define pq_64bit_get_word(x) BN_get_word(x) | ||
104 | #define pq_64bit_is_bit_set(x, offset) BN_is_bit_set(x, offset) | ||
105 | #define pq_64bit_lshift(r, x, shift) BN_lshift(r, x, shift) | ||
106 | #define pq_64bit_set_bit(x, num) BN_set_bit(x, num) | ||
107 | #define pq_64bit_get_length(x) BN_num_bits((x)) | ||
108 | |||
109 | #else | ||
110 | |||
111 | #define PQ_64BIT_IS_INTEGER 1 | ||
112 | #define PQ_64BIT_IS_BIGNUM 0 | ||
113 | |||
114 | #if defined(SIXTY_FOUR_BIT) | ||
115 | #define PQ_64BIT BN_ULONG | ||
116 | #define PQ_64BIT_PRINT "%lld" | ||
117 | #elif defined(SIXTY_FOUR_BIT_LONG) | ||
118 | #define PQ_64BIT BN_ULONG | ||
119 | #define PQ_64BIT_PRINT "%ld" | ||
120 | #elif defined(THIRTY_TWO_BIT) | ||
121 | #define PQ_64BIT BN_ULLONG | ||
122 | #define PQ_64BIT_PRINT "%lld" | ||
123 | #endif | ||
124 | |||
125 | #define PQ_64BIT_CTX void | ||
126 | |||
127 | #define pq_64bit_init(x) | ||
128 | #define pq_64bit_free(x) | ||
129 | #define pq_64bit_ctx_new(ctx) (ctx) | ||
130 | #define pq_64bit_ctx_free(x) | ||
131 | |||
132 | #define pq_64bit_assign(x, y) (*(x) = *(y)) | ||
133 | #define pq_64bit_assign_word(x, y) (*(x) = y) | ||
134 | #define pq_64bit_gt(x, y) (*(x) > *(y)) | ||
135 | #define pq_64bit_eq(x, y) (*(x) == *(y)) | ||
136 | #define pq_64bit_add_word(x, w) (*(x) = (*(x) + (w))) | ||
137 | #define pq_64bit_sub(r, x, y) (*(r) = (*(x) - *(y))) | ||
138 | #define pq_64bit_sub_word(x, w) (*(x) = (*(x) - (w))) | ||
139 | #define pq_64bit_mod(r, x, n, ctx) | ||
140 | |||
141 | #define pq_64bit_bin2num(num, bytes, len) bytes_to_long_long(bytes, num) | ||
142 | #define pq_64bit_num2bin(num, bytes) long_long_to_bytes(num, bytes) | ||
143 | #define pq_64bit_get_word(x) *(x) | ||
144 | #define pq_64bit_lshift(r, x, shift) (*(r) = (*(x) << (shift))) | ||
145 | #define pq_64bit_set_bit(x, num) do { \ | ||
146 | PQ_64BIT mask = 1; \ | ||
147 | mask = mask << (num); \ | ||
148 | *(x) |= mask; \ | ||
149 | } while(0) | ||
150 | #endif /* OPENSSL_SYS_VMS */ | ||
151 | |||
152 | #endif | ||
diff --git a/src/lib/libcrypto/pqueue/pq_test.c b/src/lib/libcrypto/pqueue/pq_test.c new file mode 100644 index 0000000000..8d496dfc65 --- /dev/null +++ b/src/lib/libcrypto/pqueue/pq_test.c | |||
@@ -0,0 +1,95 @@ | |||
1 | /* crypto/pqueue/pq_test.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 | |||
62 | int | ||
63 | main(void) | ||
64 | { | ||
65 | pitem *item; | ||
66 | pqueue pq; | ||
67 | |||
68 | pq = pqueue_new(); | ||
69 | |||
70 | item = pitem_new(3, NULL); | ||
71 | pqueue_insert(pq, item); | ||
72 | |||
73 | item = pitem_new(1, NULL); | ||
74 | pqueue_insert(pq, item); | ||
75 | |||
76 | item = pitem_new(2, NULL); | ||
77 | pqueue_insert(pq, item); | ||
78 | |||
79 | item = pqueue_find(pq, 1); | ||
80 | fprintf(stderr, "found %ld\n", item->priority); | ||
81 | |||
82 | item = pqueue_find(pq, 2); | ||
83 | fprintf(stderr, "found %ld\n", item->priority); | ||
84 | |||
85 | item = pqueue_find(pq, 3); | ||
86 | fprintf(stderr, "found %ld\n", item ? item->priority: 0); | ||
87 | |||
88 | pqueue_print(pq); | ||
89 | |||
90 | for(item = pqueue_pop(pq); item != NULL; item = pqueue_pop(pq)) | ||
91 | pitem_free(item); | ||
92 | |||
93 | pqueue_free(pq); | ||
94 | return 0; | ||
95 | } | ||
diff --git a/src/lib/libcrypto/pqueue/pqueue.c b/src/lib/libcrypto/pqueue/pqueue.c new file mode 100644 index 0000000000..eab13a1250 --- /dev/null +++ b/src/lib/libcrypto/pqueue/pqueue.c | |||
@@ -0,0 +1,252 @@ | |||
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 | { | ||
66 | pitem *items; | ||
67 | int count; | ||
68 | } pqueue_s; | ||
69 | |||
70 | pitem * | ||
71 | pitem_new(unsigned char *prio64be, void *data) | ||
72 | { | ||
73 | pitem *item = (pitem *) OPENSSL_malloc(sizeof(pitem)); | ||
74 | if (item == NULL) return NULL; | ||
75 | |||
76 | memcpy(item->priority,prio64be,sizeof(item->priority)); | ||
77 | |||
78 | item->data = data; | ||
79 | item->next = NULL; | ||
80 | |||
81 | return item; | ||
82 | } | ||
83 | |||
84 | void | ||
85 | pitem_free(pitem *item) | ||
86 | { | ||
87 | if (item == NULL) return; | ||
88 | |||
89 | OPENSSL_free(item); | ||
90 | } | ||
91 | |||
92 | pqueue_s * | ||
93 | pqueue_new() | ||
94 | { | ||
95 | pqueue_s *pq = (pqueue_s *) OPENSSL_malloc(sizeof(pqueue_s)); | ||
96 | if (pq == NULL) return NULL; | ||
97 | |||
98 | memset(pq, 0x00, sizeof(pqueue_s)); | ||
99 | return pq; | ||
100 | } | ||
101 | |||
102 | void | ||
103 | pqueue_free(pqueue_s *pq) | ||
104 | { | ||
105 | if (pq == NULL) return; | ||
106 | |||
107 | OPENSSL_free(pq); | ||
108 | } | ||
109 | |||
110 | pitem * | ||
111 | pqueue_insert(pqueue_s *pq, pitem *item) | ||
112 | { | ||
113 | pitem *curr, *next; | ||
114 | |||
115 | if (pq->items == NULL) | ||
116 | { | ||
117 | pq->items = item; | ||
118 | return item; | ||
119 | } | ||
120 | |||
121 | for(curr = NULL, next = pq->items; | ||
122 | next != NULL; | ||
123 | curr = next, next = next->next) | ||
124 | { | ||
125 | /* we can compare 64-bit value in big-endian encoding | ||
126 | * with memcmp:-) */ | ||
127 | int cmp = memcmp(next->priority, item->priority,8); | ||
128 | if (cmp > 0) /* next > item */ | ||
129 | { | ||
130 | item->next = next; | ||
131 | |||
132 | if (curr == NULL) | ||
133 | pq->items = item; | ||
134 | else | ||
135 | curr->next = item; | ||
136 | |||
137 | return item; | ||
138 | } | ||
139 | |||
140 | else if (cmp == 0) /* duplicates not allowed */ | ||
141 | return NULL; | ||
142 | } | ||
143 | |||
144 | item->next = NULL; | ||
145 | curr->next = item; | ||
146 | |||
147 | return item; | ||
148 | } | ||
149 | |||
150 | pitem * | ||
151 | pqueue_peek(pqueue_s *pq) | ||
152 | { | ||
153 | return pq->items; | ||
154 | } | ||
155 | |||
156 | pitem * | ||
157 | pqueue_pop(pqueue_s *pq) | ||
158 | { | ||
159 | pitem *item = pq->items; | ||
160 | |||
161 | if (pq->items != NULL) | ||
162 | pq->items = pq->items->next; | ||
163 | |||
164 | return item; | ||
165 | } | ||
166 | |||
167 | pitem * | ||
168 | pqueue_find(pqueue_s *pq, unsigned char *prio64be) | ||
169 | { | ||
170 | pitem *next; | ||
171 | pitem *found = NULL; | ||
172 | |||
173 | if ( pq->items == NULL) | ||
174 | return NULL; | ||
175 | |||
176 | for ( next = pq->items; next->next != NULL; next = next->next) | ||
177 | { | ||
178 | if ( memcmp(next->priority, prio64be,8) == 0) | ||
179 | { | ||
180 | found = next; | ||
181 | break; | ||
182 | } | ||
183 | } | ||
184 | |||
185 | /* check the one last node */ | ||
186 | if ( memcmp(next->priority, prio64be,8) ==0) | ||
187 | found = next; | ||
188 | |||
189 | if ( ! found) | ||
190 | return NULL; | ||
191 | |||
192 | #if 0 /* find works in peek mode */ | ||
193 | if ( prev == NULL) | ||
194 | pq->items = next->next; | ||
195 | else | ||
196 | prev->next = next->next; | ||
197 | #endif | ||
198 | |||
199 | return found; | ||
200 | } | ||
201 | |||
202 | void | ||
203 | pqueue_print(pqueue_s *pq) | ||
204 | { | ||
205 | pitem *item = pq->items; | ||
206 | |||
207 | while(item != NULL) | ||
208 | { | ||
209 | printf("item\t%02x%02x%02x%02x%02x%02x%02x%02x\n", | ||
210 | item->priority[0],item->priority[1], | ||
211 | item->priority[2],item->priority[3], | ||
212 | item->priority[4],item->priority[5], | ||
213 | item->priority[6],item->priority[7]); | ||
214 | item = item->next; | ||
215 | } | ||
216 | } | ||
217 | |||
218 | pitem * | ||
219 | pqueue_iterator(pqueue_s *pq) | ||
220 | { | ||
221 | return pqueue_peek(pq); | ||
222 | } | ||
223 | |||
224 | pitem * | ||
225 | pqueue_next(pitem **item) | ||
226 | { | ||
227 | pitem *ret; | ||
228 | |||
229 | if ( item == NULL || *item == NULL) | ||
230 | return NULL; | ||
231 | |||
232 | |||
233 | /* *item != NULL */ | ||
234 | ret = *item; | ||
235 | *item = (*item)->next; | ||
236 | |||
237 | return ret; | ||
238 | } | ||
239 | |||
240 | int | ||
241 | pqueue_size(pqueue_s *pq) | ||
242 | { | ||
243 | pitem *item = pq->items; | ||
244 | int count = 0; | ||
245 | |||
246 | while(item != NULL) | ||
247 | { | ||
248 | count++; | ||
249 | item = item->next; | ||
250 | } | ||
251 | return count; | ||
252 | } | ||
diff --git a/src/lib/libcrypto/pqueue/pqueue.h b/src/lib/libcrypto/pqueue/pqueue.h new file mode 100644 index 0000000000..87fc9037c8 --- /dev/null +++ b/src/lib/libcrypto/pqueue/pqueue.h | |||
@@ -0,0 +1,94 @@ | |||
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 | { | ||
71 | unsigned char priority[8]; /* 64-bit value in big-endian encoding */ | ||
72 | void *data; | ||
73 | struct _pitem *next; | ||
74 | } pitem; | ||
75 | |||
76 | typedef struct _pitem *piterator; | ||
77 | |||
78 | pitem *pitem_new(unsigned char *prio64be, void *data); | ||
79 | void pitem_free(pitem *item); | ||
80 | |||
81 | pqueue pqueue_new(void); | ||
82 | void pqueue_free(pqueue pq); | ||
83 | |||
84 | pitem *pqueue_insert(pqueue pq, pitem *item); | ||
85 | pitem *pqueue_peek(pqueue pq); | ||
86 | pitem *pqueue_pop(pqueue pq); | ||
87 | pitem *pqueue_find(pqueue pq, unsigned char *prio64be); | ||
88 | pitem *pqueue_iterator(pqueue pq); | ||
89 | pitem *pqueue_next(piterator *iter); | ||
90 | |||
91 | void pqueue_print(pqueue pq); | ||
92 | int pqueue_size(pqueue pq); | ||
93 | |||
94 | #endif /* ! HEADER_PQUEUE_H */ | ||