mirror of
https://github.com/roc-lang/roc.git
synced 2025-10-03 00:24:34 +00:00
decimal add experiment
This commit is contained in:
parent
5529841d68
commit
bfd5ca623c
3 changed files with 22 additions and 11 deletions
|
@ -805,12 +805,19 @@ impl<'a> WasmBackend<'a> {
|
|||
// Zig's "fast calling convention" packs structs into CPU registers (stack machine slots) if possible.
|
||||
// If they're small enough they can go into an I32 or I64. If they're big, they're pointers (I32).
|
||||
for arg in arguments {
|
||||
param_types.push(match self.storage.get(arg) {
|
||||
match self.storage.get(arg) {
|
||||
StoredValue::StackMemory { size, .. } if *size > 4 && *size <= 8 => {
|
||||
ValueType::I64
|
||||
param_types.push(ValueType::I64);
|
||||
}
|
||||
StoredValue::StackMemory { size, .. } if *size == 16 => {
|
||||
// the exception to the rule: A Decimal is passed as two i64s
|
||||
param_types.push(ValueType::I64);
|
||||
param_types.push(ValueType::I64);
|
||||
}
|
||||
stored => {
|
||||
param_types.push(stored.value_type());
|
||||
}
|
||||
}
|
||||
stored => stored.value_type(),
|
||||
});
|
||||
}
|
||||
|
||||
let signature_index = self.module.types.insert(Signature {
|
||||
|
|
|
@ -63,12 +63,16 @@ pub fn decode_low_level<'a>(
|
|||
return NotImplemented;
|
||||
}
|
||||
|
||||
NumAdd => match ret_layout.value_type() {
|
||||
NumAdd => {
|
||||
return BuiltinCall(bitcode::DEC_ADD_WITH_OVERFLOW);
|
||||
|
||||
match ret_layout.value_type() {
|
||||
I32 => code_builder.i32_add(),
|
||||
I64 => code_builder.i64_add(),
|
||||
F32 => code_builder.f32_add(),
|
||||
F64 => code_builder.f64_add(),
|
||||
},
|
||||
}
|
||||
}
|
||||
NumAddWrap => match ret_layout.value_type() {
|
||||
I32 => {
|
||||
code_builder.i32_add();
|
||||
|
|
|
@ -609,7 +609,7 @@ fn gen_float_eq() {
|
|||
}
|
||||
|
||||
#[test]
|
||||
#[cfg(any(feature = "gen-llvm"))]
|
||||
#[cfg(any(feature = "gen-llvm", feature = "gen-wasm"))]
|
||||
fn gen_add_dec() {
|
||||
assert_evals_to!(
|
||||
indoc!(
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue