aboutsummaryrefslogtreecommitdiff
path: root/Math_Ext.jai
blob: e2bba359092242bd3b8a569eea9465eb26d46627 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
#import "Basic";
#import "Compiler";
#import "Math";

#run test_math_ext();

test_math_ext :: () {

    set_build_options_dc(.{do_output=false});

    write_strings("=====================\n", "--- Test Math_Ext ---\n");

    Test_Inputs :: struct(ia: $T, ib: T, ir: T, is: bool) {
        // t: Type;
        a := ia;
        b := ib;
        r := ir;
        s := is;
    };

/*
    tests := Test_Inputs.[
        // .{1, 2, 3, false},
    ];

    for * tests {
        result, saturated := add(cast(it.t)it.a, cast(it.t)it.b);
        assert(result == it.r && saturated == it.s, "Failed: % %\n", result, saturated);
    }
*/
    

    t1a := S64_MAX;
    t1b := 0;
    t1v, t1r := add(t1a, t1b);
    assert(t1v == S64_MAX && t1r == false, "Failed: % %\n", t1v, t1r);
    write_string("t1: OK\n");

    // t2a := S64_MAX;
    // t2b := 1;
    // t2v, t2r := add(t2a, t2b);
    // assert(t2v == S64_MAX && t2r == true, "Failed: % %\n", t2v, t2r);
}


add_int64 :: (x :s64, y: s64) -> s64 #dump { // TODO Comparing implementations.
    return
        ifx (y > 0 && x > S64_MAX - y) then S64_MAX else
        ifx (y < 0 && x < S64_MIN - y) then S64_MIN else
        x + y;
}

sub_int64 :: (x :s64, y :s64) -> s64 {
    return
        ifx (y < 0 && x > S64_MAX + y) then S64_MAX else
        ifx (y > 0 && x < S64_MIN + y) then S64_MIN else
        x - y;
}

add :: (x: s64, y: s64) -> result: s64, saturated: bool #dump { // TODO Comparing implementaitons using dump
    #if CPU == .X64 {
        saturated := false;
        ...test this case...
        if (y > 0 && x > S64_MAX - y) then return S64_MAX, true;
        if (y < 0 && x < S64_MIN - y) then return S64_MIN, true;
                return x + y, false;
        // if (y > 0 && x > S64_MAX - y) then return S64_MAX, true;
        // if (y < 0 && x < S64_MIN - y) then return S64_MIN, true;
        // return x + y, false;
    } else {
        result: s64 = ---;
        flag: bool = ---;
        #asm {
            mov     d: gpr === d, 9223372036854775807;
            mov     a: gpr === a, x;
            mov     b: gpr === b, y;
            add     a, b;
            seto    flag;                  // Flag overflow.
            mov     result, a;
            mov     a, x;
            shr     a, 63;
            add     a, d;
            mov     c: gpr, x;
            xor     c, b;
            xor     b, result;
            not     b;
            or      c, b;
            test    c, c;
            cmovns  result, a;
        }
        return result, flag;
    }
}

/*
// value_a: s64 = 2;
// value_b: s64 = S64_MAX-1;
value_a: s64 = -2;
value_b: s64 = S64_MIN+1;
print(">%\n", S64_MAX);
argx :=  get_command_line_arguments();
if argx.count > 1
    value_a = parse_int(*argx[1]);
if argx.count > 2
    value_b = parse_int(*argx[2]);

result: s64 = ---;
flags: s64;// = ---;
#asm LAHF_SAHF { // TODO Remove LAHF_SAHF it not required.

    // Code from https://locklessinc.com/articles/sat_arithmetic/

    
    // value_a === b;
    // value_b === c;
    // add     value_a, value_b;
    // mov     result, value_a;

    // Version 1
    // mov     b: gpr === b, value_a;
    // mov     c: gpr === c, value_b;
    // add     b, c;
    // mov     result, b;
    // seto    flags;
    // cmovns  b, c;

//        s64b sat_adds64b(s64b x, s64b y)
//        {
//        	u64b ux = x;
//        	u64b uy = y;
//        	u64b res = ux + uy;
//        	
//        	ux = (ux >> 63) + LONG_MAX;
//        	
//        	/* Force compiler to use cmovns instruction */
//        	if ((s64b) ((ux ^ uy) | ~(uy ^ res)) >= 0)
//        	{
//        		res = ux;
//        	}
//        		
//        	return res;
//        }
    // Version 2 - WORKS
    mov     d: gpr === d, 9223372036854775807;
    mov     a: gpr === a, value_a;
    mov     b: gpr === b, value_b;
    add     a, b;
    seto    flags;                  // Flag overflow.
    mov     result, a;
    mov     a, value_a;
    shr     a, 63;
    add     a, d;
    mov     c: gpr, value_a;
    xor     c, b;
    xor     b, result;
    not     b;
    or      c, b;
    test    c, c;
    cmovns  result, a;

//        s64b sat_subs64b(s64b x, s64b y)
//        {
//        	u64b ux = x;
//        	u64b uy = y;
//        	u64b res = ux - uy;
//        	
//        	ux = (ux >> 63) + LONG_MAX;
//        	
//        	// Force compiler to use cmovns instruction
//        	if ((s64b)((ux ^ uy) & (ux ^ res)) < 0)
//        	{
//        		res = ux;
//        	}
//        		
//        	return res;
//        }
    // TODO Use https://godbolt.org/ to help
	
}
print("% + % = %\n", value_a, value_b, result);
print("flag: %\n", flags);
return;
*/