| 1 | /* | 
|---|
| 2 | * Legal Notice | 
|---|
| 3 | * | 
|---|
| 4 | * This document and associated source code (the "Work") is a part of a | 
|---|
| 5 | * benchmark specification maintained by the TPC. | 
|---|
| 6 | * | 
|---|
| 7 | * The TPC reserves all right, title, and interest to the Work as provided | 
|---|
| 8 | * under U.S. and international laws, including without limitation all patent | 
|---|
| 9 | * and trademark rights therein. | 
|---|
| 10 | * | 
|---|
| 11 | * No Warranty | 
|---|
| 12 | * | 
|---|
| 13 | * 1.1 TO THE MAXIMUM EXTENT PERMITTED BY APPLICABLE LAW, THE INFORMATION | 
|---|
| 14 | *     CONTAINED HEREIN IS PROVIDED "AS IS" AND WITH ALL FAULTS, AND THE | 
|---|
| 15 | *     AUTHORS AND DEVELOPERS OF THE WORK HEREBY DISCLAIM ALL OTHER | 
|---|
| 16 | *     WARRANTIES AND CONDITIONS, EITHER EXPRESS, IMPLIED OR STATUTORY, | 
|---|
| 17 | *     INCLUDING, BUT NOT LIMITED TO, ANY (IF ANY) IMPLIED WARRANTIES, | 
|---|
| 18 | *     DUTIES OR CONDITIONS OF MERCHANTABILITY, OF FITNESS FOR A PARTICULAR | 
|---|
| 19 | *     PURPOSE, OF ACCURACY OR COMPLETENESS OF RESPONSES, OF RESULTS, OF | 
|---|
| 20 | *     WORKMANLIKE EFFORT, OF LACK OF VIRUSES, AND OF LACK OF NEGLIGENCE. | 
|---|
| 21 | *     ALSO, THERE IS NO WARRANTY OR CONDITION OF TITLE, QUIET ENJOYMENT, | 
|---|
| 22 | *     QUIET POSSESSION, CORRESPONDENCE TO DESCRIPTION OR NON-INFRINGEMENT | 
|---|
| 23 | *     WITH REGARD TO THE WORK. | 
|---|
| 24 | * 1.2 IN NO EVENT WILL ANY AUTHOR OR DEVELOPER OF THE WORK BE LIABLE TO | 
|---|
| 25 | *     ANY OTHER PARTY FOR ANY DAMAGES, INCLUDING BUT NOT LIMITED TO THE | 
|---|
| 26 | *     COST OF PROCURING SUBSTITUTE GOODS OR SERVICES, LOST PROFITS, LOSS | 
|---|
| 27 | *     OF USE, LOSS OF DATA, OR ANY INCIDENTAL, CONSEQUENTIAL, DIRECT, | 
|---|
| 28 | *     INDIRECT, OR SPECIAL DAMAGES WHETHER UNDER CONTRACT, TORT, WARRANTY, | 
|---|
| 29 | *     OR OTHERWISE, ARISING IN ANY WAY OUT OF THIS OR ANY OTHER AGREEMENT | 
|---|
| 30 | *     RELATING TO THE WORK, WHETHER OR NOT SUCH AUTHOR OR DEVELOPER HAD | 
|---|
| 31 | *     ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. | 
|---|
| 32 | * | 
|---|
| 33 | * Contributors | 
|---|
| 34 | * - Cecil Reames, Matt Emmerton | 
|---|
| 35 | */ | 
|---|
| 36 |  | 
|---|
| 37 | #ifndef BIGMATH_H | 
|---|
| 38 | #define BIGMATH_H | 
|---|
| 39 |  | 
|---|
| 40 | #include "EGenStandardTypes.h" | 
|---|
| 41 |  | 
|---|
| 42 | namespace TPCE { | 
|---|
| 43 |  | 
|---|
| 44 | // For 128-bit integer multiplication | 
|---|
| 45 | #define BIT63 UINT64_CONST(0x8000000000000000) | 
|---|
| 46 | #define CARRY32 UINT64_CONST(0x100000000) | 
|---|
| 47 | #define MASK32 UINT64_CONST(0xFFFFFFFF) | 
|---|
| 48 | #define UPPER32 32 | 
|---|
| 49 |  | 
|---|
| 50 | // Multiply 64-bit and 32-bit factors, followed by a right-shift of 64 bits | 
|---|
| 51 | // (retaining upper 64-bit quantity) This is implemented as two 64-bit | 
|---|
| 52 | // multiplications with summation of partial products. | 
|---|
| 53 | inline UINT Mul6432WithShiftRight64(UINT64 seed, UINT range) { | 
|---|
| 54 | UINT64 SL = (seed & MASK32), // lower 32 bits of seed | 
|---|
| 55 | SU = (seed >> UPPER32),  // upper 32 bits of seed | 
|---|
| 56 | RL = range;              // range | 
|---|
| 57 |  | 
|---|
| 58 | UINT64 p0 = (SL * RL), // partial products | 
|---|
| 59 | p1 = (SU * RL), s; | 
|---|
| 60 |  | 
|---|
| 61 | s = p0; | 
|---|
| 62 | s >>= UPPER32; | 
|---|
| 63 | s += p1; | 
|---|
| 64 | s >>= UPPER32; | 
|---|
| 65 |  | 
|---|
| 66 | return (UINT)s; | 
|---|
| 67 | } | 
|---|
| 68 |  | 
|---|
| 69 | // Multiply two 64-bit factors, followed by a right-shift of 64 bits (retaining | 
|---|
| 70 | // upper 64-bit quantity) This is implemented as four 64-bit multiplications | 
|---|
| 71 | // with summation of partial products and carry. | 
|---|
| 72 | inline UINT64 Mul6464WithShiftRight64(UINT64 seed, UINT64 range) { | 
|---|
| 73 | UINT64 SL = (seed & MASK32), // lower 32 bits of seed | 
|---|
| 74 | SU = (seed >> UPPER32),  // upper 32 bits of seed | 
|---|
| 75 | RL = (range & MASK32),   // lower 32 bits of range | 
|---|
| 76 | RU = (range >> UPPER32); // upper 32 bits of range | 
|---|
| 77 |  | 
|---|
| 78 | UINT64 p0 = (SL * RL), // partial products | 
|---|
| 79 | p1 = (SU * RL), p2 = (SL * RU), p3 = (SU * RU), p12_carry = 0, s; | 
|---|
| 80 |  | 
|---|
| 81 | s = p0; | 
|---|
| 82 | s >>= UPPER32; | 
|---|
| 83 | s += p1; | 
|---|
| 84 | p12_carry = ((((p1 & BIT63) || (s & BIT63)) && (p2 & BIT63)) ? CARRY32 : 0); | 
|---|
| 85 | s += p2; | 
|---|
| 86 | s >>= UPPER32; | 
|---|
| 87 | s += p12_carry; | 
|---|
| 88 | s += p3; | 
|---|
| 89 |  | 
|---|
| 90 | return s; | 
|---|
| 91 | } | 
|---|
| 92 |  | 
|---|
| 93 | } // namespace TPCE | 
|---|
| 94 |  | 
|---|
| 95 | #endif // BIGMATH_H | 
|---|
| 96 |  | 
|---|