- Sort Score
- Result 10 results
- Languages All
Results 11 - 18 of 18 for addVW (0.04 sec)
-
src/math/big/arith_arm.s
L2: MOVW.P 4(R2), R5 MOVW.P 4(R3), R6 SBC.S R6, R5 MOVW.P R5, 4(R1) E2: TEQ R1, R4 BNE L2 MOVW $0, R0 MOVW.CC $1, R0 MOVW R0, c+36(FP) RET // func addVW(z, x []Word, y Word) (c Word) TEXT ·addVW(SB),NOSPLIT,$0 MOVW z+0(FP), R1 MOVW z_len+4(FP), R4 MOVW x+12(FP), R2 MOVW y+24(FP), R3 ADD R4<<2, R1, R4 TEQ R1, R4 BNE L3a MOVW R3, c+28(FP) RET L3a: MOVW.P 4(R2), R5
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 4K bytes - Viewed (0) -
src/math/big/arith_amd64.s
SBBQ CX, CX // save CF ADDQ $1, SI // i++ SUBQ $1, DI // n-- JG L2 // if n > 0 goto L2 E2: NEGQ CX MOVQ CX, c+72(FP) // return c RET // func addVW(z, x []Word, y Word) (c Word) TEXT ·addVW(SB),NOSPLIT,$0 MOVQ z_len+8(FP), DI CMPQ DI, $32 JG large MOVQ x+24(FP), R8 MOVQ y+48(FP), CX // c = y MOVQ z+0(FP), R10 MOVQ $0, SI // i = 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 9.1K bytes - Viewed (0) -
src/math/big/arith.go
for i := 0; i < len(z) && i < len(x); i++ { zi, cc := bits.Add(uint(x[i]), uint(c), 0) z[i] = Word(zi) c = Word(cc) } return } // addVWlarge is addVW, but intended for large z. // The only difference is that we check on every iteration // whether we are done with carries, // and if so, switch to a much faster copy instead. // This is only a good idea for large z,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 28 20:09:27 UTC 2022 - 8.3K bytes - Viewed (0) -
src/math/big/arith_ppc64x.s
MOVD 8(R8), R11 MOVD 8(R9), R16 SUBE R16, R11, R20 MOVD R20, 8(R10) final: ADDZE R4 XOR $1, R4 done: MOVD R4, c+72(FP) RET // func addVW(z, x []Word, y Word) (c Word) TEXT ·addVW(SB), NOSPLIT, $0 MOVD z+0(FP), R10 // R10 = z[] MOVD x+24(FP), R8 // R8 = x[] MOVD y+48(FP), R4 // R4 = y = c MOVD z_len+8(FP), R11 // R11 = z_len
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 18:17:17 UTC 2024 - 16.8K bytes - Viewed (0) -
src/cmd/compile/internal/test/inl_test.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 04:07:57 UTC 2024 - 10.7K bytes - Viewed (0) -
src/math/big/nat.go
// n == 0 because m >= n; result is 0 return z[:0] case n == 0: // result is x return z.set(x) } // m > 0 z = z.make(m + 1) c := addVV(z[0:n], x, y) if m > n { c = addVW(z[n:m], x[n:], c) } z[m] = c return z.norm() } func (z nat) sub(x, y nat) nat { m := len(x) n := len(y) switch { case m < n: panic("underflow") case m == 0:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 31.7K bytes - Viewed (0) -
src/math/big/arith_s390x.s
MOVD R0, R4 SUBE R4, R4 // save CF ADD $8, R10 // i++ SUB $1, R3 // n-- BGT L1 // if n > 0 goto L1 E1: NEG R4, R4 MOVD R4, c+72(FP) // return c RET TEXT ·addVW(SB), NOSPLIT, $0 MOVD z_len+8(FP), R5 // length of z MOVD x+24(FP), R6 MOVD y+48(FP), R7 // c = y MOVD z+0(FP), R8 CMPBEQ R5, $0, returnC // if len(z) == 0, we can have an early return
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 20.3K bytes - Viewed (0) -
src/math/big/float.go
// and it's Below if we truncate (Exact results require no rounding). // For a negative result (z.neg) it is exactly the opposite. z.acc = makeAcc(inc != z.neg) if inc { // add 1 to mantissa if addVW(z.mant, z.mant, lsb) != 0 { // mantissa overflow => adjust exponent if z.exp >= MaxExp { // exponent overflow z.form = inf return } z.exp++
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 15:46:54 UTC 2024 - 44.5K bytes - Viewed (0)