From: Jacob Lifshay Date: Thu, 29 Sep 2022 22:46:12 +0000 (-0700) Subject: use adde, not addeo for bigint add X-Git-Tag: opf_rfc_ls005_v1~261 X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=1da76d38db9e3a1191259384c872cb6d49183310;p=libreriscv.git use adde, not addeo for bigint add --- diff --git a/openpower/sv/rfc/ls001.mdwn b/openpower/sv/rfc/ls001.mdwn index 5b3394ebb..86d46a816 100644 --- a/openpower/sv/rfc/ls001.mdwn +++ b/openpower/sv/rfc/ls001.mdwn @@ -1247,7 +1247,7 @@ could then be performed. Full Rationale at ## Big-Integer Math -Remarkably, `sv.addeo` is inherently a big-integer Vector Add, using `CA` +Remarkably, `sv.adde` is inherently a big-integer Vector Add, using `CA` chaining between **Scalar** operations. Using Vector LD/ST and recalling that the first and last `CA` may be chained in and out of an entire **Vector**, unlimited-length arithmetic is @@ -1260,7 +1260,7 @@ possible. 34 r5/r4: 0x8000_0000_0000_0000 0x0000_0000_0000_0001 = 35 r1/r0: 0x8000_0000_0000_0002 0x0000_0000_0000_0000 36 - 37 sv.addeo *0, *2, *4 + 37 sv.adde *0, *2, *4 ``` A 128/64-bit shift may be used as a Vector shift by a Scalar amount, by merging