KloudKoder

@tlively I'm pleased to hear that. I don't know why most languages don't seem to provide this. And I think add-with-carry is another must as well, now that you mention...

@wbl I second that. The high should be the true high including complete carry propagation, as opposed to an approximation.

@wbl Addition with carry (and subtract with borrow) could be implemented efficiently on nonIntel CPUs by introducing a virtual carry bit and a set of add and subtract instructions which...

I think this still matters. I would also like to point out one corner case to consider, which already has relevance with existing remainder computation in WASM: having zero as...

I have proposed a discussion of this issue at the May 11, 2021 community group meeting: https://github.com/WebAssembly/meetings/compare/master...KloudKoder:patch-2 Probably we should have: 1. Divide to produce quotient and remainder (perhaps with...

@penzn Thanks for pointing that out. PR submitted. "Also, what would those 6 instructions be for?" * Divide and multiply from int(X) to or from int(2X) are used all the...

Here's my design for today's CG meeting. No doubt it will be debated and revised. ADD-WITH-CARRY (ADC) & SUBTRACT-WITH-BORROW (SBB): Having read thread from @lars-t-hansen (thanks), and based on my...

For the record, the presentation of this issue to the community group is being rescheduled, tentatively for June 8. This is due to cascading technical failures on my part which...

@lars-t-hansen I guess the main use case for carry propagation is large int libraries (and sometimes encryption or hashing), which due to this very issue, tend to require manual coding...

On second thought, with expansion, you have to pay the cost of expansion and recompression, which is probably higher than just burning a whole register for a carry. So in...