| ... | ... | @@ -38,33 +38,33 @@ pub fn _Qp_sub(c: *f128, a: *f128, b: *f128) callconv(.C) void { |
| 38 | 38 | |
| 39 | 39 | // Comparison |
| 40 | 40 | |
| 41 | | pub fn _Qp_cmp(a: f128, b: f128) callconv(.C) i32 { |
| 42 | | return @enumToInt(@import("compareXf2.zig").cmp(f128, FCMP, a, b)); |
| 41 | pub fn _Qp_cmp(a: *f128, b: *f128) callconv(.C) i32 { |
| 42 | return @enumToInt(@import("compareXf2.zig").cmp(f128, FCMP, a.*, b.*)); |
| 43 | 43 | } |
| 44 | 44 | |
| 45 | 45 | pub fn _Qp_feq(a: *f128, b: *f128) callconv(.C) bool { |
| 46 | | return _Qp_cmp(a.*, b.*) == @enumToInt(FCMP.Equal); |
| 46 | return _Qp_cmp(a, b) == @enumToInt(FCMP.Equal); |
| 47 | 47 | } |
| 48 | 48 | |
| 49 | 49 | pub fn _Qp_fne(a: *f128, b: *f128) callconv(.C) bool { |
| 50 | | return _Qp_cmp(a.*, b.*) != @enumToInt(FCMP.Equal); |
| 50 | return _Qp_cmp(a, b) != @enumToInt(FCMP.Equal); |
| 51 | 51 | } |
| 52 | 52 | |
| 53 | 53 | pub fn _Qp_flt(a: *f128, b: *f128) callconv(.C) bool { |
| 54 | | return _Qp_cmp(a.*, b.*) == @enumToInt(FCMP.Less); |
| 54 | return _Qp_cmp(a, b) == @enumToInt(FCMP.Less); |
| 55 | 55 | } |
| 56 | 56 | |
| 57 | 57 | pub fn _Qp_fle(a: *f128, b: *f128) callconv(.C) bool { |
| 58 | | const cmp = _Qp_cmp(a.*, b.*); |
| 58 | const cmp = _Qp_cmp(a, b); |
| 59 | 59 | return cmp == @enumToInt(FCMP.Less) or cmp == @enumToInt(FCMP.Equal); |
| 60 | 60 | } |
| 61 | 61 | |
| 62 | 62 | pub fn _Qp_fgt(a: *f128, b: *f128) callconv(.C) bool { |
| 63 | | return _Qp_cmp(a.*, b.*) == @enumToInt(FCMP.Greater); |
| 63 | return _Qp_cmp(a, b) == @enumToInt(FCMP.Greater); |
| 64 | 64 | } |
| 65 | 65 | |
| 66 | 66 | pub fn _Qp_fge(a: *f128, b: *f128) callconv(.C) bool { |
| 67 | | const cmp = _Qp_cmp(a.*, b.*); |
| 67 | const cmp = _Qp_cmp(a, b); |
| 68 | 68 | return cmp == @enumToInt(FCMP.Greater) or cmp == @enumToInt(FCMP.Equal); |
| 69 | 69 | } |
| 70 | 70 | |