(no commit message)
[libreriscv.git] / openpower / sv / sprs.mdwn
1 # SPRs <a name="sprs"></a>
2
3 The full list of SPRs for Simple-V is:
4
5 | SPR | Width | Description |
6 |---------------|---------|---------------------------------|
7 | **SVSTATE** | 64-bit | Zero-Overhead Loop Architectural State |
8 | **SVLR** | 64-bit | SVSTATE equivalent of LR-to-PC |
9 | **SVSHAPE0** | 32-bit | REMAP Shape 0 |
10 | **SVSHAPE1** | 32-bit | REMAP Shape 0 |
11 | **SVSHAPE2** | 32-bit | REMAP Shape 0 |
12 | **SVSHAPE3** | 32-bit | REMAP Shape 0 |
13
14 Future versions of Simple-V will have at least 7 more SVSTATE SPRs, in a small
15 "stack", as part of a full Zero-Overhead Loop Control subsystem.
16
17 ## SVSTATE SPR
18
19 The format of the SVSTATE SPR is as follows:
20
21 | Field | Name | Description |
22 | ----- | -------- | --------------------- |
23 | 0:6 | maxvl | Max Vector Length |
24 | 7:13 | vl | Vector Length |
25 | 14:20 | srcstep | for srcstep = 0..VL-1 |
26 | 21:27 | dststep | for dststep = 0..VL-1 |
27 | 28:29 | dsubstep | for substep = 0..SUBVL-1 |
28 | 30:31 | ssubstep | for substep = 0..SUBVL-1 |
29 | 32:33 | mi0 | REMAP RA/FRA/BFA SVSHAPE0-3 |
30 | 34:35 | mi1 | REMAP RB/FRB/BFB SVSHAPE0-3 |
31 | 36:37 | mi2 | REMAP RC/FRT SVSHAPE0-3 |
32 | 38:39 | mo0 | REMAP RT/FRT/BF SVSHAPE0-3 |
33 | 40:41 | mo1 | REMAP EA/RS/FRS SVSHAPE0-3 |
34 | 42:46 | SVme | REMAP enable (RA-RT) |
35 | 47:52 | rsvd | reserved |
36 | 53 | pack | PACK (srcstep reorder) |
37 | 54 | unpack | UNPACK (dststep order) |
38 | 55:61 | hphint | Horizontal Hint |
39 | 62 | RMpst | REMAP persistence |
40 | 63 | vfirst | Vertical First mode |
41
42 Notes:
43
44 * The entries are truncated to be within range. Attempts to set VL to
45 greater than MAXVL will truncate VL.
46 * Setting srcstep, dststep to 64 or greater, or VL or MVL to greater
47 than 64 is reserved and will cause an illegal instruction trap.
48
49 **SVSTATE Fields**
50
51 SVSTATE is a standard SPR that (if REMAP is not activated) contains sufficient
52 self-contaned information for a full context save/restore.
53 SVSTATE contains (and permits setting of):
54
55 * MVL (the Maximum Vector Length) - declares (statically) how
56 much of a regfile is to be reserved for Vector elements
57 * VL - Vector Length
58 * dststep - the destination element offset of the current parallel
59 instruction being executed
60 * srcstep - for twin-predication, the source element offset as well.
61 * ssubstep - the source subvector element offset of the current
62 parallel instruction being executed
63 * dsubstep - the destination subvector element offset of the current
64 parallel instruction being executed
65 * vfirst - Vertical First mode. srcstep, dststep and substep
66 **do not advance** unless explicitly requested to do so with svstep
67 * RMpst - REMAP persistence. REMAP will apply only to the following
68 instruction unless this bit is set, in which case REMAP "persists".
69 Reset (cleared) on use of the `setvl` instruction if used to
70 alter VL or MVL.
71 * Pack - if set then srcstep/ssubstep VL/SUBVL loop-ordering is inverted.
72 * UnPack - if set then dststep/dsubstep VL/SUBVL loop-ordering is inverted.
73 * hphint - Horizontal Parallelism Hint. Indicates that
74 no Hazards exist between groups of elements in sequential multiples of this number
75 (before REMAP). By definition: elements for which `FLOOR(step/hphint)` is
76 equal *before REMAP* are in the same parallelism "group", for both
77 `srcstep` and `dststep`. In Vertical First Mode
78 hardware **MUST** respect Strict Program Order but is permitted to
79 merge multiple scalar loops into parallel batches, if Reservation Station resources
80 are sufficient. Set to zero to indicate "no hint".
81 * SVme - REMAP enable bits, indicating which register is to be
82 REMAPed: RA, RB, RC, RT and EA are the canonical (typical) register names
83 associated with each bit, with RA being the LSB and EA being the MSB.
84 See table below for ordering. When `SVme` is zero (0b00000) REMAP
85 is **fully disabled and inactive** regardless of the contents of
86 `SVSTATE`, `mi0-mi2/mo0-mo1`, or the four `SVSHAPEn` SPRs
87 * mi0-mi2/mo0-mo1 - these
88 indicate the SVSHAPE (0-3) that the corresponding register (RA etc)
89 should use, as long as the register's corresponding SVme bit is set
90
91 Programmer's Note: the fact that REMAP is entirely dormant when `SVme` is zero
92 allows establishment of REMAP context well in advance, followed by utilising `svremap`
93 at a precise (or the very last) moment. Some implementations may exploit this
94 to cache (or take some time to prepare caches) in the background whilst other
95 (unrelated) instructions are being executed. This is particularly important to
96 bear in mind when using `svindex` which will require hardware to perform (and
97 cache) additional GPR reads.
98
99 Programmer's Note: when REMAP is activated it becomes necessary on any
100 context-switch (Interrupt or Function call) to detect (or know in advance)
101 that REMAP is enabled and to additionally explicitly save/restore the four SVSHAPE
102 SPRs, SVHAPE0-3. Given that this is expected to be a rare occurrence it was
103 deemed unreasonable to burden every context-switch or function call with
104 mandatory save/restore of SVSHAPEs, and consequently it is a *callee*
105 (and Trap Handler) responsibility. Callees (and Trap Handlers) **MUST**
106 avoid using all and any SVP64 instructions during the period where state
107 could be adversely affected. SVP64 purely relies on Scalar instructions,
108 so Scalar instructions (except the SVP64 Management ones and mtspr and
109 mfspr) are 100% guaranteed to have zero impact on SVP64 state.
110
111 **Max Vector Length (maxvl)** <a name="mvl" />
112
113 MAXVECTORLENGTH is a static (immediate-operand only) compile-time declaration
114 of the maximum number of elements in a Vector. MVL is limited to 7 bits
115 (in the first version of SVP64) and consequently the maximum number of
116 elements is limited to between 0 and 127.
117
118 MAXVL is normally (in other True-Scalable Vector ISAs) an Architecturally-defined
119 quantity related indirectly to the total available number of bits in the Vector
120 Register File. Cray Vectors had a Hardware-Architectural set limit of MAXVL=64.
121 RISC-V RVV has MAXVL defined in terms of a Silicon-Partner-selectable fixed number
122 of bits. MAXVL in Simple-V is set in terms of the number of *elements* and
123 may change at runtime.
124
125 Programmer's Note: Except by directly using `mtspr` on SVSTATE, which may
126 result in performance penalties on some hardware implementations, SVSTATE's `maxvl`
127 field may only be set **statically** as an immediate, by the `setvl` instruction.
128 It may **NOT** be set dynamically from a register. Compiler writers and assembly
129 programmers are expected to perform static register file analysis, subdivision,
130 and allocation and only utilise `setvl`. Direct writing to SVSTATE in order to
131 "bypass" this Note could, in less-advanced implementations, potentially cause stalling,
132 particularly if SVP64 instructions are issued directly after the `mtspr` to SVSTATE.
133
134 **Vector Length (vl)** <a name="vl" />
135
136 The actual Vector length, the number of elements in a "Vector", `SVSTATE.vl` may be set
137 entirely dynamically at runtime from a number of sources. `setvl` is the primary
138 instruction for setting Vector Length.
139 `setvl` is conceptually similar but different from the Cray, SX Aurora, and RISC-V RVV
140 equivalent. Similar to RVV, VL is set to be within
141 the range 0 <= VL <= MVL. Unlike RVV, VL is set **exactly** according to the following:
142
143 ```
144 VL = (RT|0) = MIN(vlen, MVL)
145 ```
146
147 where `0 <= MVL <= 127`, and vlen may come from an immediate, `RA`, or from the `CTR` SPR,
148 depending on options selected with the `setvl` instruction.
149
150 Programmer's Note: conceptual understanding of Cray-style Vectors is far beyond the scope
151 of the Power ISA Technical Reference. Guidance on the 50-year-old Cray Vector paradigm is
152 best sought elsewhere: good studies include Academic Courses given on the 1970s
153 Cray Supercomputers over at least the past three decades.
154
155 **Horizontal Parallelism**
156
157 A problem exists for hardware where it may not be able to detect
158 that a programmer (or compiler) knows of opportunities for parallelism
159 and lack of overlap between loops, despite these being easy for a compiler
160 to statically detect and potentially express.
161 `hphint` is such an expression, declaring that elements within a batch are
162 independent of each other (no Register *or Memory* Hazards).
163
164 Elements are considered to be in the same source batch if they have
165 the same value of `FLOOR(srcstep/hphint)`. Likewise in the same destination batch
166 for the same value `FLOOR(dststep/hphint)`.
167 Four key observations here:
168
169 1. predication is **not** involved here. the number of actual elements
170 involved is considered *before* predicate masks are applied.
171 2. twin predication can result in srcstep and dststep being in different
172 batches
173 3. batch evaluation is done *before* REMAP, making Hazard elimination easier
174 for Multi-Issue systems.
175 4. `hphint` is *not* limited to power-of-two. Hardware implementors may choose
176 a lower parallelism hint up to `hphint` and may find power-of-two more
177 convenient.
178
179 Regarding (4): if a smaller hint is chosen by hardware, actual parallelism
180 (Dependency Hazard relaxation) must **never**
181 exceed `hphint` and must still respect the batch boundaries, even if this results
182 in just one element being considered Hazard-independent. Even under these
183 circumstances Multi-Issue Register-renaming is possible, to introduce parallelism
184 by a different route.
185
186 *Hardware Architect note: each element within the same group may be treated as
187 100% independent from any other element within that group, and therefore
188 neither Register Hazards nor Memory Hazards inter-element exist,
189 but crucially inter-group definitely remains. This makes
190 implementation far easier on resources because the Hazard Dependencies are
191 effectively at a much coarser granularity than a single register.
192 With element-width overrides extending down to the byte level reducing Dependency
193 Hazard hardware complexity becomes even more important.*
194
195 `hphint` may legitimately be set greater than `MAXVL`. This indicates to Multi-Issue
196 hardware that even though MAXVL is relatively small the batches are *still independent*
197 and therefore if Multi-Issue hardware chooses to allocate several batches up to
198 `MAXVL` in size they are still independent, even if Register-renaming is deployed.
199 This helps greatly simplify Multi-Issue systems by significantly reducing Hazards.
200
201 **Considerable care** must be taken when setting `hphint`. Matrix Outer Product
202 could produce corrupted results if `hphint` is set to greater than the innermost
203 loop depth. Parallel Reduction, DCT and FFT REMAP all are similarly critically affected
204 by `hphint` in ways that if used correctly greatly increases ease of parallelism but
205 if done incorrectly will also result in data corruption. Reduction/Iteration
206 also requires care to correctly declare in `hphint` how many elements are
207 independent. In the case of most Reduction use-cases the answer is almost certainly
208 "none".
209
210 `hphint` must never be set on Atomic Memory operations, Cache-Inhibited
211 Memory operations, or Load-Reservation Store-Conditional. Also if Load-with-Update
212 Data-Dependent Fail-First is ever used for linked-list pointer-chasing, `hphint`
213 should again definitely be disabled. Failure to do so results in `UNDEFINED`
214 behaviour.
215
216 `hphint` may only be ignored by Hardware Implementors as long as full element-level
217 Register and Memory Hazards are implemented *in full* (including right down to individual
218 bytes of each register for when elwidth=8/16/32). In other words if `hphint` is to
219 be ignored then implementations must consider the situation as if `hphint=0`.
220
221 **Horizontal Parallelism in Vertical-First Mode**
222
223 Setting `hphint` with Vertical-First is perfectly legitimate. Under these circumstances
224 single-element strict Program Execution Order must be preserved at all times, but
225 should there be a small enough program loop, than Out-of-Order Hardware may
226 take the opportunity to *merge*
227 consecutive element-based instructions into the *same Reservation Stations*, for
228 multiple operations to be passed to massive-wide back-end SIMD ALUs or Vector-Chaining ALUs.
229 **Only** elements within the same `hphint` group (across multiple such looped instructions)
230 may be treated as mergeable in this fashion.
231
232 Note that if the loop of Vertical-First instructions cannot fit entirely into Reservation
233 Stations then Hardware clearly cannot exploit the above optimisation opportunity, but at
234 least there is no harm done: the loop is still correctly executed as Scalar instructions.
235 Programmers do need to be aware though that short loops on some Hardware Implementations
236 can be made considerably faster than on other Implementations.
237
238 ## SVLR
239
240 SV Link Register, exactly analogous to LR (Link Register) may
241 be used for temporary storage of SVSTATE, and, in particular,
242 Vectorised Branch-Conditional instructions may interchange
243 SVLR and SVSTATE whenever LR and NIA are.
244
245 Note that there is no equivalent Link variant of SVREMAP or
246 SVSHAPE0-3 (it would be too costly), so SVLR has limited applicability:
247 REMAP SPRs must be saved and restored explicitly.
248
249 -----------
250
251 [[!tag standards]]
252