[d27ed12] | 1 | /*
|
---|
| 2 | * Copyright (c) 2009 Josef Cejka
|
---|
| 3 | * All rights reserved.
|
---|
| 4 | *
|
---|
| 5 | * Redistribution and use in source and binary forms, with or without
|
---|
| 6 | * modification, are permitted provided that the following conditions
|
---|
| 7 | * are met:
|
---|
| 8 | *
|
---|
| 9 | * - Redistributions of source code must retain the above copyright
|
---|
| 10 | * notice, this list of conditions and the following disclaimer.
|
---|
| 11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
| 12 | * notice, this list of conditions and the following disclaimer in the
|
---|
| 13 | * documentation and/or other materials provided with the distribution.
|
---|
| 14 | * - The name of the author may not be used to endorse or promote products
|
---|
| 15 | * derived from this software without specific prior written permission.
|
---|
| 16 | *
|
---|
| 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
| 18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
| 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
| 23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
| 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
| 27 | */
|
---|
| 28 |
|
---|
| 29 | /** @addtogroup softint
|
---|
| 30 | * @{
|
---|
| 31 | */
|
---|
| 32 | /**
|
---|
| 33 | * @file
|
---|
| 34 | * SW implementation of 32 and 64 bit multiplication.
|
---|
| 35 | */
|
---|
| 36 |
|
---|
| 37 | #include <multiplication.h>
|
---|
| 38 | #include <stdint.h>
|
---|
| 39 |
|
---|
| 40 | /** Set 1 to return MAX_INT64 or MIN_INT64 on overflow */
|
---|
| 41 | #ifndef SOFTINT_CHECK_OF
|
---|
| 42 | # define SOFTINT_CHECK_OF 0
|
---|
| 43 | #endif
|
---|
| 44 |
|
---|
| 45 | /**
|
---|
| 46 | * Multiply two integers and return long long as result.
|
---|
| 47 | * This function is overflow safe.
|
---|
| 48 | * @param a
|
---|
| 49 | * @param b
|
---|
| 50 | * @result
|
---|
| 51 | */
|
---|
| 52 | static unsigned long long mul(unsigned int a, unsigned int b) {
|
---|
| 53 | unsigned int a1, a2, b1, b2;
|
---|
| 54 | unsigned long long t1, t2, t3;
|
---|
| 55 |
|
---|
| 56 | a1 = a >> 16;
|
---|
| 57 | a2 = a & MAX_UINT16;
|
---|
| 58 | b1 = b >> 16;
|
---|
| 59 | b2 = b & MAX_UINT16;
|
---|
| 60 |
|
---|
| 61 | t1 = a1 * b1;
|
---|
| 62 | t2 = a1*b2;
|
---|
| 63 | t2 += a2*b1;
|
---|
| 64 | t3 = a2*b2;
|
---|
| 65 |
|
---|
| 66 | t3 = (((t1 << 16) + t2) << 16) + t3;
|
---|
| 67 |
|
---|
| 68 | return t3;
|
---|
| 69 | }
|
---|
| 70 |
|
---|
| 71 | /** Emulate multiplication of two 64-bit long long integers.
|
---|
| 72 | *
|
---|
| 73 | */
|
---|
| 74 | long long __muldi3 (long long a, long long b)
|
---|
| 75 | {
|
---|
| 76 | long long result;
|
---|
| 77 | unsigned long long t1,t2;
|
---|
| 78 | unsigned long long a1, a2, b1, b2;
|
---|
| 79 | char neg = 0;
|
---|
| 80 |
|
---|
| 81 | if (a < 0) {
|
---|
| 82 | neg = !neg;
|
---|
| 83 | a = -a;
|
---|
| 84 | }
|
---|
| 85 |
|
---|
| 86 | if (b < 0) {
|
---|
| 87 | neg = !neg;
|
---|
| 88 | b = -b;
|
---|
| 89 | }
|
---|
| 90 |
|
---|
| 91 | a1 = a >> 32;
|
---|
| 92 | b1 = b >> 32;
|
---|
| 93 |
|
---|
| 94 | a2 = a & (MAX_UINT32);
|
---|
| 95 | b2 = b & (MAX_UINT32);
|
---|
| 96 |
|
---|
| 97 | if (SOFTINT_CHECK_OF && (a1 != 0) && (b1 != 0)) {
|
---|
| 98 | // error, overflow
|
---|
| 99 | return (neg?MIN_INT64:MAX_INT64);
|
---|
| 100 | }
|
---|
| 101 |
|
---|
| 102 | // (if OF checked) a1 or b1 is zero => result fits in 64 bits, no need to another overflow check
|
---|
| 103 | t1 = mul(a1,b2) + mul(b1,a2);
|
---|
| 104 |
|
---|
| 105 | if (SOFTINT_CHECK_OF && t1 > MAX_UINT32) {
|
---|
| 106 | // error, overflow
|
---|
| 107 | return (neg?MIN_INT64:MAX_INT64);
|
---|
| 108 | }
|
---|
| 109 |
|
---|
| 110 | t1 = t1 << 32;
|
---|
| 111 | t2 = mul(a2,b2);
|
---|
| 112 | t2 += t1;
|
---|
| 113 |
|
---|
| 114 | /* t2 & (1ull << 63) - if this bit is set in unsigned long long,
|
---|
| 115 | * result does not fit in signed one */
|
---|
| 116 | if (SOFTINT_CHECK_OF && ((t2 < t1) || (t2 & (1ull << 63)))) {
|
---|
| 117 | // error, overflow
|
---|
| 118 | return (neg?MIN_INT64:MAX_INT64);
|
---|
| 119 | }
|
---|
| 120 |
|
---|
| 121 | result = t2;
|
---|
| 122 |
|
---|
| 123 | if (neg) {
|
---|
| 124 | result = -result;
|
---|
| 125 | }
|
---|
| 126 |
|
---|
| 127 | return result;
|
---|
| 128 | }
|
---|
| 129 |
|
---|
| 130 | /** @}
|
---|
| 131 | */
|
---|