Knuth 4.3.1, Algorithm A.
fn lladdcarry(r: []Limb, a: []const Limb, b: []const Limb) Limb
fn lladdcarry(r: []Limb, a: []const Limb, b: []const Limb) Limb {
assert(a.len != 0 and b.len != 0);
assert(a.len >= b.len);
assert(r.len >= a.len);
assert(!slicesOverlap(r, a) or @intFromPtr(r.ptr) <= @intFromPtr(a.ptr));
assert(!slicesOverlap(r, b) or @intFromPtr(r.ptr) <= @intFromPtr(b.ptr));
var i: usize = 0;
var carry: Limb = 0;
while (i < b.len) : (i += 1) {
const ov1 = @addWithOverflow(a[i], b[i]);
r[i] = ov1[0];
const ov2 = @addWithOverflow(r[i], carry);
r[i] = ov2[0];
carry = @as(Limb, ov1[1]) + ov2[1];
}
while (i < a.len) : (i += 1) {
const ov = @addWithOverflow(a[i], carry);
r[i] = ov[0];
carry = ov[1];
}
return carry;
}