mirror of
https://github.com/Ed94/Odin.git
synced 2026-08-05 15:18:49 +00:00
Merge pull request #1357 from Kelimion/big_math_fix
[math/big] Fix int_set and int_get.
This commit is contained in:
@@ -158,13 +158,14 @@ Error :: enum int {
|
|||||||
Invalid_Pointer = 2,
|
Invalid_Pointer = 2,
|
||||||
Invalid_Argument = 3,
|
Invalid_Argument = 3,
|
||||||
|
|
||||||
Assignment_To_Immutable = 4,
|
Assignment_To_Immutable = 10,
|
||||||
Max_Iterations_Reached = 5,
|
Max_Iterations_Reached = 11,
|
||||||
Buffer_Overflow = 6,
|
Buffer_Overflow = 12,
|
||||||
Integer_Overflow = 7,
|
Integer_Overflow = 13,
|
||||||
|
Integer_Underflow = 14,
|
||||||
|
|
||||||
Division_by_Zero = 8,
|
Division_by_Zero = 30,
|
||||||
Math_Domain_Error = 9,
|
Math_Domain_Error = 31,
|
||||||
|
|
||||||
Cannot_Open_File = 50,
|
Cannot_Open_File = 50,
|
||||||
Cannot_Read_File = 51,
|
Cannot_Read_File = 51,
|
||||||
|
|||||||
+43
-24
@@ -34,6 +34,10 @@ package math_big
|
|||||||
import "core:mem"
|
import "core:mem"
|
||||||
import "core:intrinsics"
|
import "core:intrinsics"
|
||||||
import rnd "core:math/rand"
|
import rnd "core:math/rand"
|
||||||
|
import "core:builtin"
|
||||||
|
|
||||||
|
import "core:fmt"
|
||||||
|
__ :: fmt
|
||||||
|
|
||||||
/*
|
/*
|
||||||
Low-level addition, unsigned. Handbook of Applied Cryptography, algorithm 14.7.
|
Low-level addition, unsigned. Handbook of Applied Cryptography, algorithm 14.7.
|
||||||
@@ -1880,8 +1884,6 @@ internal_int_set_from_integer :: proc(dest: ^Int, src: $T, minimize := false, al
|
|||||||
where intrinsics.type_is_integer(T) {
|
where intrinsics.type_is_integer(T) {
|
||||||
context.allocator = allocator
|
context.allocator = allocator
|
||||||
|
|
||||||
src := src
|
|
||||||
|
|
||||||
internal_error_if_immutable(dest) or_return
|
internal_error_if_immutable(dest) or_return
|
||||||
/*
|
/*
|
||||||
Most internal procs asssume an Int to have already been initialize,
|
Most internal procs asssume an Int to have already been initialize,
|
||||||
@@ -1892,13 +1894,27 @@ internal_int_set_from_integer :: proc(dest: ^Int, src: $T, minimize := false, al
|
|||||||
dest.flags = {} // We're not -Inf, Inf, NaN or Immutable.
|
dest.flags = {} // We're not -Inf, Inf, NaN or Immutable.
|
||||||
|
|
||||||
dest.used = 0
|
dest.used = 0
|
||||||
dest.sign = .Zero_or_Positive if src >= 0 else .Negative
|
dest.sign = .Negative if src < 0 else .Zero_or_Positive
|
||||||
src = internal_abs(src)
|
|
||||||
|
|
||||||
#no_bounds_check for src != 0 {
|
temp := src
|
||||||
dest.digit[dest.used] = DIGIT(src) & _MASK
|
|
||||||
|
is_maximally_negative := src == min(T)
|
||||||
|
if is_maximally_negative {
|
||||||
|
/*
|
||||||
|
Prevent overflow on abs()
|
||||||
|
*/
|
||||||
|
temp += 1
|
||||||
|
}
|
||||||
|
temp = -temp if temp < 0 else temp
|
||||||
|
|
||||||
|
#no_bounds_check for temp != 0 {
|
||||||
|
dest.digit[dest.used] = DIGIT(temp) & _MASK
|
||||||
dest.used += 1
|
dest.used += 1
|
||||||
src >>= _DIGIT_BITS
|
temp >>= _DIGIT_BITS
|
||||||
|
}
|
||||||
|
|
||||||
|
if is_maximally_negative {
|
||||||
|
return internal_sub(dest, dest, 1)
|
||||||
}
|
}
|
||||||
internal_zero_unused(dest)
|
internal_zero_unused(dest)
|
||||||
return nil
|
return nil
|
||||||
@@ -2307,28 +2323,31 @@ internal_int_get_i32 :: proc(a: ^Int) -> (res: i32, err: Error) {
|
|||||||
}
|
}
|
||||||
internal_get_i32 :: proc { internal_int_get_i32, }
|
internal_get_i32 :: proc { internal_int_get_i32, }
|
||||||
|
|
||||||
/*
|
|
||||||
TODO: Think about using `count_bits` to check if the value could be returned completely,
|
|
||||||
and maybe return max(T), .Integer_Overflow if not?
|
|
||||||
*/
|
|
||||||
internal_int_get :: proc(a: ^Int, $T: typeid) -> (res: T, err: Error) where intrinsics.type_is_integer(T) {
|
internal_int_get :: proc(a: ^Int, $T: typeid) -> (res: T, err: Error) where intrinsics.type_is_integer(T) {
|
||||||
size_in_bits := int(size_of(T) * 8)
|
/*
|
||||||
i := int((size_in_bits + _DIGIT_BITS - 1) / _DIGIT_BITS)
|
Calculate target bit size.
|
||||||
i = min(int(a.used), i)
|
*/
|
||||||
|
target_bit_size := int(size_of(T) * 8)
|
||||||
#no_bounds_check for ; i >= 0; i -= 1 {
|
when !intrinsics.type_is_unsigned(T) {
|
||||||
res <<= uint(0) if size_in_bits <= _DIGIT_BITS else _DIGIT_BITS
|
if a.sign == .Zero_or_Positive {
|
||||||
res |= T(a.digit[i])
|
target_bit_size -= 1
|
||||||
if size_in_bits <= _DIGIT_BITS {
|
|
||||||
break
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
bits_used := internal_count_bits(a)
|
||||||
|
|
||||||
|
if bits_used > target_bit_size {
|
||||||
|
if a.sign == .Negative {
|
||||||
|
return min(T), .Integer_Underflow
|
||||||
|
}
|
||||||
|
return max(T), .Integer_Overflow
|
||||||
|
}
|
||||||
|
|
||||||
|
for i := a.used; i > 0; i -= 1 {
|
||||||
|
res <<= _DIGIT_BITS
|
||||||
|
res |= T(a.digit[i - 1])
|
||||||
|
}
|
||||||
|
|
||||||
when !intrinsics.type_is_unsigned(T) {
|
when !intrinsics.type_is_unsigned(T) {
|
||||||
/*
|
|
||||||
Mask off sign bit.
|
|
||||||
*/
|
|
||||||
res ~= 1 << uint(size_in_bits - 1)
|
|
||||||
/*
|
/*
|
||||||
Set the sign.
|
Set the sign.
|
||||||
*/
|
*/
|
||||||
|
|||||||
+16
-11
@@ -127,17 +127,22 @@ def we_iterate():
|
|||||||
# Error enum values
|
# Error enum values
|
||||||
#
|
#
|
||||||
class Error(Enum):
|
class Error(Enum):
|
||||||
Okay = 0
|
Okay = 0
|
||||||
Out_Of_Memory = 1
|
Out_Of_Memory = 1
|
||||||
Invalid_Pointer = 2
|
Invalid_Pointer = 2
|
||||||
Invalid_Argument = 3
|
Invalid_Argument = 3
|
||||||
Unknown_Error = 4
|
Unknown_Error = 4
|
||||||
Max_Iterations_Reached = 5
|
Assignment_To_Immutable = 10
|
||||||
Buffer_Overflow = 6
|
Max_Iterations_Reached = 11
|
||||||
Integer_Overflow = 7
|
Buffer_Overflow = 12
|
||||||
Division_by_Zero = 8
|
Integer_Overflow = 13
|
||||||
Math_Domain_Error = 9
|
Integer_Underflow = 14
|
||||||
Unimplemented = 127
|
Division_by_Zero = 30
|
||||||
|
Math_Domain_Error = 31
|
||||||
|
Cannot_Open_File = 50
|
||||||
|
Cannot_Read_File = 51
|
||||||
|
Cannot_Write_File = 52
|
||||||
|
Unimplemented = 127
|
||||||
|
|
||||||
#
|
#
|
||||||
# Disable garbage collection
|
# Disable garbage collection
|
||||||
|
|||||||
Reference in New Issue
Block a user