VirtualBox

source: vbox/trunk/include/iprt/bignum.h@ 52335

Last change on this file since 52335 was 52335, checked in by vboxsync, 10 years ago

RTBigNum: Added shift APIs, implemented a faster division algorithm, optimized multiplication on x86 & amd64.

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 6.5 KB
Line 
1/** @file
2 * IPRT - Big Integer Numbers.
3 */
4
5/*
6 * Copyright (C) 2006-2014 Oracle Corporation
7 *
8 * This file is part of VirtualBox Open Source Edition (OSE), as
9 * available from http://www.virtualbox.org. This file is free software;
10 * you can redistribute it and/or modify it under the terms of the GNU
11 * General Public License (GPL) as published by the Free Software
12 * Foundation, in version 2 as it comes in the "COPYING" file of the
13 * VirtualBox OSE distribution. VirtualBox OSE is distributed in the
14 * hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
15 *
16 * The contents of this file may alternatively be used under the terms
17 * of the Common Development and Distribution License Version 1.0
18 * (CDDL) only, as it comes in the "COPYING.CDDL" file of the
19 * VirtualBox OSE distribution, in which case the provisions of the
20 * CDDL are applicable instead of those of the GPL.
21 *
22 * You may elect to license modified versions of this file under the
23 * terms and conditions of either the GPL or the CDDL or both.
24 */
25
26
27#ifndef ___iprt_bignum_h
28#define ___iprt_bignum_h
29
30#include <iprt/types.h>
31
32RT_C_DECLS_BEGIN
33
34/** @defgroup grp_rtbignum RTBigNum - Big Integer Numbers
35 * @ingroup grp_rt
36 * @{
37 */
38
39/** The big integer number element type. */
40#if ARCH_BITS == 64
41typedef uint64_t RTBIGNUMELEMENT;
42#else
43typedef uint32_t RTBIGNUMELEMENT;
44#endif
45/** Pointer to a big integer number element. */
46typedef RTBIGNUMELEMENT *PRTBIGNUMELEMENT;
47/** Pointer to a const big integer number element. */
48typedef RTBIGNUMELEMENT const *PCRTBIGNUMELEMENT;
49
50/** The size (in bytes) of one array element. */
51#if ARCH_BITS == 64
52# define RTBIGNUM_ELEMENT_SIZE 8
53#else
54# define RTBIGNUM_ELEMENT_SIZE 4
55#endif
56/** The number of bits in one array element. */
57#define RTBIGNUM_ELEMENT_BITS (RTBIGNUM_ELEMENT_SIZE * 8)
58/** Returns the bitmask corrsponding to given bit number. */
59#if ARCH_BITS == 64
60# define RTBIGNUM_ELEMENT_BIT(iBit) RT_BIT_64(iBit)
61#else
62# define RTBIGNUM_ELEMENT_BIT(iBit) RT_BIT_32(iBit)
63#endif
64/** The maximum value one element can hold. */
65#if ARCH_BITS == 64
66# define RTBIGNUM_ELEMENT_MAX UINT64_MAX
67#else
68# define RTBIGNUM_ELEMENT_MAX UINT32_MAX
69#endif
70/** Mask including all the element bits set to 1. */
71#define RTBIGNUM_ELEMENT_MASK RTBIGNUM_ELEMENT_MAX
72
73
74/**
75 * IPRT big integer number.
76 */
77typedef struct RTBIGNUM
78{
79 /** Elements array where the magnitue of the value is stored. */
80 RTBIGNUMELEMENT *pauElements;
81 /** The current number of elements we're using in the pauElements array. */
82 uint32_t cUsed;
83 /** The current allocation size of pauElements. */
84 uint32_t cAllocated;
85 /** Reserved for future use. */
86 uint32_t uReserved;
87
88 /** Set if it's a negative number, clear if positive or zero. */
89 uint32_t fNegative : 1;
90
91 /** Whether to use a the data is sensitive (RTBIGNUMINIT_F_SENSITIVE). */
92 uint32_t fSensitive : 1;
93 /** The number is currently scrambled */
94 uint32_t fCurScrambled : 1;
95
96 /** Bits reserved for future use. */
97 uint32_t fReserved : 30;
98} RTBIGNUM;
99
100
101RTDECL(int) RTBigNumInit(PRTBIGNUM pBigNum, uint32_t fFlags, void const *pvRaw, size_t cbRaw);
102RTDECL(int) RTBigNumInitZero(PRTBIGNUM pBigNum, uint32_t fFlags);
103
104/** @name RTBIGNUMINIT_F_XXX - RTBigNumInit flags.
105 * @{ */
106/** The number is sensitive so use a safer allocator, scramble it when not
107 * in use, and apply RTMemWipeThoroughly before freeing. The RTMemSafer API
108 * takes care of these things.
109 * @note When using this flag, concurrent access is not possible! */
110#define RTBIGNUMINIT_F_SENSITIVE RT_BIT(0)
111/** Big endian number. */
112#define RTBIGNUMINIT_F_ENDIAN_BIG RT_BIT(1)
113/** Little endian number. */
114#define RTBIGNUMINIT_F_ENDIAN_LITTLE RT_BIT(2)
115/** The raw number is unsigned. */
116#define RTBIGNUMINIT_F_UNSIGNED RT_BIT(3)
117/** The raw number is signed. */
118#define RTBIGNUMINIT_F_SIGNED RT_BIT(4)
119/** @} */
120
121RTDECL(int) RTBigNumClone(PRTBIGNUM pBigNum, PCRTBIGNUM pSrc);
122
123RTDECL(int) RTBigNumDestroy(PRTBIGNUM pBigNum);
124
125
126/**
127 * The minimum number of bits require store the two's complement representation
128 * of the number.
129 *
130 * @returns Width in number of bits.
131 * @param pBigNum The big number.
132 */
133RTDECL(uint32_t) RTBigNumBitWidth(PCRTBIGNUM pBigNum);
134RTDECL(uint32_t) RTBigNumByteWidth(PCRTBIGNUM pBigNum);
135
136
137/**
138 * Converts the big number to a sign-extended big endian byte sequence.
139 *
140 * @returns IPRT status code
141 * @retval VERR_BUFFER_OVERFLOW if the specified buffer is too small.
142 * @param pBigNum The big number.
143 * @param pvBuf The output buffer (size is at least cbWanted).
144 * @param cbWanted The number of bytes wanted.
145 */
146RTDECL(int) RTBigNumToBytesBigEndian(PCRTBIGNUM pBigNum, void *pvBuf, size_t cbWanted);
147
148/**
149 * Compares two numbers.
150 *
151 * @retval -1 if pLeft < pRight.
152 * @retval 0 if pLeft == pRight.
153 * @retval 1 if pLeft > pRight.
154 *
155 * @param pLeft The left side number.
156 * @param pRight The right side number.
157 */
158RTDECL(int) RTBigNumCompare(PRTBIGNUM pLeft, PRTBIGNUM pRight);
159RTDECL(int) RTBigNumCompareWithU64(PRTBIGNUM pLeft, uint64_t uRight);
160RTDECL(int) RTBigNumCompareWithS64(PRTBIGNUM pLeft, int64_t iRight);
161
162RTDECL(int) RTBigNumAssign(PRTBIGNUM pDst, PCRTBIGNUM pSrc);
163RTDECL(int) RTBigNumNegate(PRTBIGNUM pResult, PCRTBIGNUM pBigNum);
164RTDECL(int) RTBigNumNegateThis(PRTBIGNUM pThis);
165
166RTDECL(int) RTBigNumAdd(PRTBIGNUM pResult, PCRTBIGNUM pAugend, PCRTBIGNUM pAddend);
167RTDECL(int) RTBigNumSubtract(PRTBIGNUM pResult, PCRTBIGNUM pMinuend, PCRTBIGNUM pSubtrahend);
168RTDECL(int) RTBigNumMultiply(PRTBIGNUM pResult, PCRTBIGNUM pMultiplicand, PCRTBIGNUM pMultiplier);
169RTDECL(int) RTBigNumDivide(PRTBIGNUM pQuotient, PRTBIGNUM pRemainder, PCRTBIGNUM pDividend, PCRTBIGNUM pDivisor);
170RTDECL(int) RTBigNumDivideKnuth(PRTBIGNUM pQuotient, PRTBIGNUM pRemainder, PCRTBIGNUM pDividend, PCRTBIGNUM pDivisor);
171RTDECL(int) RTBigNumDivideLong(PRTBIGNUM pQuotient, PRTBIGNUM pRemainder, PCRTBIGNUM pDividend, PCRTBIGNUM pDivisor);
172RTDECL(int) RTBigNumModulo(PRTBIGNUM pRemainder, PCRTBIGNUM pDividend, PCRTBIGNUM pDivisor);
173RTDECL(int) RTBigNumExponentiate(PRTBIGNUM pResult, PCRTBIGNUM pBase, PCRTBIGNUM pExponent);
174RTDECL(int) RTBigNumShiftLeft(PRTBIGNUM pResult, PCRTBIGNUM pValue, uint32_t cBits);
175RTDECL(int) RTBigNumShiftRight(PRTBIGNUM pResult, PCRTBIGNUM pValue, uint32_t cBits);
176
177RTDECL(int) RTBigNumModExp(PRTBIGNUM pResult, PRTBIGNUM pBase, PRTBIGNUM pExponent, PRTBIGNUM pModulus);
178
179
180/** @} */
181
182RT_C_DECLS_END
183
184#endif
185
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette