From: lkcl Date: Mon, 11 Apr 2022 14:53:31 +0000 (+0100) Subject: (no commit message) X-Git-Tag: opf_rfc_ls005_v1~2784 X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=979270529a3423cf6255ea2edbd1973471c24825;p=libreriscv.git --- diff --git a/openpower/sv/svp64/appendix.mdwn b/openpower/sv/svp64/appendix.mdwn index e9a670218..eb9fb4cb1 100644 --- a/openpower/sv/svp64/appendix.mdwn +++ b/openpower/sv/svp64/appendix.mdwn @@ -877,7 +877,9 @@ the middle of loops, that will be far too hard to explain. The second principle being violated by the above algorithm is the expectation that temporary storage is available for a modified predicate: there is no -such space. SVP64 is founded on the principle that all operations are +such space, and predicates are read-only to reduce complexity at the +micro-architectural level. +SVP64 is founded on the principle that all operations are "re-entrant" with respect to interrupts and exceptions: SVSTATE must be saved and restored alongside PC and MSR, but nothing more. It is perfectly fine to have context-switching back to the operation be somewhat slower,