2 /* crypto/pqueue/pqueue_compat.h */
4 * DTLS implementation written by Nagendra Modadugu
5 * (nagendra@cs.stanford.edu) for the OpenSSL project 2005.
7 /* ====================================================================
8 * Copyright (c) 1999-2005 The OpenSSL Project. All rights reserved.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in
19 * the documentation and/or other materials provided with the
22 * 3. All advertising materials mentioning features or use of this
23 * software must display the following acknowledgment:
24 * "This product includes software developed by the OpenSSL Project
25 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
27 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
28 * endorse or promote products derived from this software without
29 * prior written permission. For written permission, please contact
30 * openssl-core@OpenSSL.org.
32 * 5. Products derived from this software may not be called "OpenSSL"
33 * nor may "OpenSSL" appear in their names without prior written
34 * permission of the OpenSSL Project.
36 * 6. Redistributions of any form whatsoever must retain the following
38 * "This product includes software developed by the OpenSSL Project
39 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
41 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
42 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
44 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
45 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
46 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
47 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
48 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
49 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
50 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
51 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
52 * OF THE POSSIBILITY OF SUCH DAMAGE.
53 * ====================================================================
55 * This product includes cryptographic software written by Eric Young
56 * (eay@cryptsoft.com). This product includes software written by Tim
57 * Hudson (tjh@cryptsoft.com).
61 #include "opensslconf.h"
62 #include <openssl/bn.h>
65 * The purpose of this header file is for supporting 64-bit integer
66 * manipulation on 32-bit (and lower) machines. Currently the only
67 * such environment is VMS, Utrix and those with smaller default integer
68 * sizes than 32 bits. For all such environment, we fall back to using
69 * BIGNUM. We may need to fine tune the conditions for systems that
70 * are incorrectly configured.
72 * The only clients of this code are (1) pqueue for priority, and
73 * (2) DTLS, for sequence number manipulation.
76 #if (defined(THIRTY_TWO_BIT) && !defined(BN_LLONG)) || defined(SIXTEEN_BIT) || defined(EIGHT_BIT)
78 #define PQ_64BIT_IS_INTEGER 0
79 #define PQ_64BIT_IS_BIGNUM 1
81 #define PQ_64BIT BIGNUM
82 #define PQ_64BIT_CTX BN_CTX
84 #define pq_64bit_init(x) BN_init(x)
85 #define pq_64bit_free(x) BN_free(x)
87 #define pq_64bit_ctx_new(ctx) BN_CTX_new()
88 #define pq_64bit_ctx_free(x) BN_CTX_free(x)
90 #define pq_64bit_assign(x, y) BN_copy(x, y)
91 #define pq_64bit_assign_word(x, y) BN_set_word(x, y)
92 #define pq_64bit_gt(x, y) BN_ucmp(x, y) >= 1 ? 1 : 0
93 #define pq_64bit_eq(x, y) BN_ucmp(x, y) == 0 ? 1 : 0
94 #define pq_64bit_add_word(x, w) BN_add_word(x, w)
95 #define pq_64bit_sub(r, x, y) BN_sub(r, x, y)
96 #define pq_64bit_sub_word(x, w) BN_sub_word(x, w)
97 #define pq_64bit_mod(r, x, n, ctx) BN_mod(r, x, n, ctx)
99 #define pq_64bit_bin2num(bn, bytes, len) BN_bin2bn(bytes, len, bn)
100 #define pq_64bit_num2bin(bn, bytes) BN_bn2bin(bn, bytes)
101 #define pq_64bit_get_word(x) BN_get_word(x)
102 #define pq_64bit_is_bit_set(x, offset) BN_is_bit_set(x, offset)
103 #define pq_64bit_lshift(r, x, shift) BN_lshift(r, x, shift)
104 #define pq_64bit_set_bit(x, num) BN_set_bit(x, num)
105 #define pq_64bit_get_length(x) BN_num_bits((x))
109 #define PQ_64BIT_IS_INTEGER 1
110 #define PQ_64BIT_IS_BIGNUM 0
112 #if defined(SIXTY_FOUR_BIT)
113 #define PQ_64BIT BN_ULONG
114 #define PQ_64BIT_PRINT "%lld"
115 #elif defined(SIXTY_FOUR_BIT_LONG)
116 #define PQ_64BIT BN_ULONG
117 #define PQ_64BIT_PRINT "%ld"
118 #elif defined(THIRTY_TWO_BIT)
119 #define PQ_64BIT BN_ULLONG
120 #define PQ_64BIT_PRINT "%lld"
123 #define PQ_64BIT_CTX void
125 #define pq_64bit_init(x)
126 #define pq_64bit_free(x)
127 #define pq_64bit_ctx_new(ctx) (ctx)
128 #define pq_64bit_ctx_free(x)
130 #define pq_64bit_assign(x, y) (*(x) = *(y))
131 #define pq_64bit_assign_word(x, y) (*(x) = y)
132 #define pq_64bit_gt(x, y) (*(x) > *(y))
133 #define pq_64bit_eq(x, y) (*(x) == *(y))
134 #define pq_64bit_add_word(x, w) (*(x) = (*(x) + (w)))
135 #define pq_64bit_sub(r, x, y) (*(r) = (*(x) - *(y)))
136 #define pq_64bit_sub_word(x, w) (*(x) = (*(x) - (w)))
137 #define pq_64bit_mod(r, x, n, ctx)
139 #define pq_64bit_bin2num(num, bytes, len) bytes_to_long_long(bytes, num)
140 #define pq_64bit_num2bin(num, bytes) long_long_to_bytes(num, bytes)
141 #define pq_64bit_get_word(x) *(x)
142 #define pq_64bit_lshift(r, x, shift) (*(r) = (*(x) << (shift)))
143 #define pq_64bit_set_bit(x, num) do { \
145 mask = mask << (num); \
148 #endif /* OPENSSL_SYS_VMS */