-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Imported from svn tag fireworkz__2022_11_06__2_32_01
- Loading branch information
Showing
23 changed files
with
309 additions
and
36 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,237 @@ | ||
| /* muldiv86.c */ | ||
|
|
||
| /* This Source Code Form is subject to the terms of the Mozilla Public | ||
| * License, v. 2.0. If a copy of the MPL was not distributed with this | ||
| * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ | ||
|
|
||
| /* Copyright (C) 1993-1998 Colton Software Limited | ||
| * Copyright (C) 1998-2015 R W Colton */ | ||
|
|
||
| #include "common/gflags.h" | ||
|
|
||
| #if defined(_WINDOWS) | ||
|
|
||
| #pragma warning(push) | ||
| #pragma warning(disable: 4255) /* '__getcallerseflags' : no function prototype given: converting '()' to '(void)' */ | ||
| #pragma warning(disable: 4668) /* '_M_IA64' is not defined as a preprocessor macro */ | ||
| #include <intrin.h> | ||
| #pragma warning(pop) | ||
|
|
||
| #pragma intrinsic(__emul) | ||
|
|
||
| static | ||
| struct MULDIV64_STATICS | ||
| { | ||
| int32_t remainder; | ||
| int32_t overflow; | ||
| } | ||
| muldiv64_statics; | ||
|
|
||
| _Check_return_ | ||
| extern int32_t | ||
| muldiv64_overflow(void) | ||
| { | ||
| return(muldiv64_statics.overflow); | ||
| } | ||
|
|
||
| _Check_return_ | ||
| extern int32_t | ||
| muldiv64_remainder(void) | ||
| { | ||
| return(muldiv64_statics.remainder); | ||
| } | ||
|
|
||
| /* | ||
| * result = (dividend * multiplier) / divisor with 64-bit intermediate calculation | ||
| * | ||
| * notes: | ||
| * 1 Will give INT 0 trap if divisor == 0 | ||
| * 2 divisor must be +ve | ||
| * | ||
| */ | ||
|
|
||
| /* rounds towards -inf, remainder always +ve */ | ||
|
|
||
| _Check_return_ | ||
| extern int32_t | ||
| muldiv64( | ||
| _InVal_ int32_t dividend, | ||
| _InVal_ int32_t multiplier, | ||
| _InVal_ int32_t divisor) | ||
| { | ||
| int64_t product_s64; | ||
| int64_t quotient_s64; | ||
| int32_t quotient_int32_t; | ||
|
|
||
| muldiv64_statics.remainder = 0; | ||
| muldiv64_statics.overflow = 0; | ||
|
|
||
| #if 1 | ||
| product_s64 = __emul(dividend, multiplier); /* __int64 mul of two 32-bit values wasteful */ | ||
| #else | ||
| product_s64 = (S64) dividend * multiplier; | ||
| #endif | ||
|
|
||
| /* like idiv_floor */ | ||
| if(product_s64 >= 0) | ||
| quotient_s64 = product_s64 / divisor; | ||
| else | ||
| quotient_s64 = (product_s64 - (divisor - 1)) / divisor; | ||
|
|
||
| if(quotient_s64 < INT32_MIN) | ||
| { | ||
| quotient_int32_t = INT32_MIN; | ||
| muldiv64_statics.overflow = -1; | ||
| } | ||
| else if(quotient_s64 > INT32_MAX) | ||
| { | ||
| quotient_int32_t = INT32_MAX; | ||
| muldiv64_statics.overflow = 1; | ||
| } | ||
| else | ||
| { | ||
| quotient_int32_t = (int32_t) quotient_s64; | ||
| #if 1 | ||
| muldiv64_statics.remainder = (int32_t) (product_s64 - __emul(quotient_int32_t, divisor)); /* always +ve */ | ||
| #else | ||
| muldiv64_statics.remainder = (int32_t) (product_s64 - ((S64) quotient_int32_t * divisor)); /* always +ve */ | ||
| #endif | ||
| assert(muldiv64_statics.remainder >= 0); | ||
| } | ||
|
|
||
| return(quotient_int32_t); | ||
| } | ||
|
|
||
| /* | ||
| round result towards +inf as ceil() | ||
| result = | ||
| (sgn(a*b*divisor) -ve) | ||
| ? (a*b) / divisor | ||
| : ((a*b) + (divisor-1)) / divisor | ||
| */ | ||
|
|
||
| _Check_return_ | ||
| extern int32_t | ||
| muldiv64_ceil( | ||
| _InVal_ int32_t dividend, | ||
| _InVal_ int32_t multiplier, | ||
| _InVal_ int32_t divisor) | ||
| { | ||
| int32_t res = muldiv64(dividend, multiplier, divisor); | ||
|
|
||
| if(muldiv64_statics.remainder != 0) | ||
| { | ||
| const U32 sign_bit = (dividend ^ multiplier ^ divisor) & 0x80000000U; | ||
| assert(0 == muldiv64_statics.overflow); | ||
| assert(muldiv64_statics.remainder > 0); | ||
| muldiv64_statics.remainder = 0; | ||
| if(sign_bit) | ||
| { /*EMPTY*/ | ||
| } | ||
| else | ||
| { | ||
| assert(res != INT32_MAX); | ||
| res += 1; | ||
| } | ||
| } | ||
|
|
||
| return(res); | ||
| } | ||
|
|
||
| /* | ||
| round result towards -inf as floor() | ||
| result = | ||
| (sgn(a*b*divisor) +ve) | ||
| ? (a*b) / divisor | ||
| : ((a*b) - (divisor-1)) / divisor | ||
| */ | ||
|
|
||
| _Check_return_ | ||
| extern int32_t | ||
| muldiv64_floor( | ||
| _InVal_ int32_t dividend, | ||
| _InVal_ int32_t multiplier, | ||
| _InVal_ int32_t divisor) | ||
| { | ||
| int32_t res = muldiv64(dividend, multiplier, divisor); | ||
|
|
||
| if(muldiv64_statics.remainder != 0) | ||
| { | ||
| const U32 sign_bit = (dividend ^ multiplier ^ divisor) & 0x80000000U; | ||
| assert(0 == muldiv64_statics.overflow); | ||
| assert(muldiv64_statics.remainder > 0); | ||
| muldiv64_statics.remainder = 0; | ||
| if(sign_bit) | ||
| { | ||
| assert(res != INT32_MIN); | ||
| res -= 1; | ||
| } | ||
| else | ||
| { /*EMPTY*/ | ||
| } | ||
| } | ||
|
|
||
| return(res); | ||
| } | ||
|
|
||
| /* | ||
| round result towards -inf | ||
| result = | ||
| (sgn(a*b*divisor) +ve) | ||
| ? ((a*b) + divisor/2) / divisor | ||
| : ((a*b) - divisor/2) / divisor | ||
| */ | ||
|
|
||
| _Check_return_ | ||
| extern int32_t | ||
| muldiv64_round_floor( | ||
| _InVal_ int32_t dividend, | ||
| _InVal_ int32_t multiplier, | ||
| _InVal_ int32_t divisor) | ||
| { | ||
| int32_t res = muldiv64(dividend, multiplier, divisor); | ||
|
|
||
| if(muldiv64_statics.remainder != 0) | ||
| { | ||
| const U32 sign_bit = (dividend ^ multiplier ^ divisor) & 0x80000000U; | ||
| const int32_t threshold = divisor / 2; | ||
| assert(0 == muldiv64_statics.overflow); | ||
| assert(muldiv64_statics.remainder > 0); | ||
| if(muldiv64_statics.remainder >= threshold) | ||
| { | ||
| if(sign_bit) | ||
| { | ||
| assert(res != INT32_MIN); | ||
| res -= 1; | ||
| } | ||
| else | ||
| { | ||
| assert(res != INT32_MAX); | ||
| res += 1; | ||
| } | ||
| } | ||
| muldiv64_statics.remainder = 0; | ||
| } | ||
|
|
||
| return(res); | ||
| } | ||
|
|
||
| #else | ||
|
|
||
| /* keep compilers happy */ | ||
|
|
||
| extern void | ||
| muldiv86(void); | ||
|
|
||
| extern void | ||
| muldiv86(void) | ||
| { | ||
| return; | ||
| } | ||
|
|
||
| #endif /*WINDOWS*/ | ||
|
|
||
| /* end of muldiv86.c */ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.