f0ea713ae30a4e036fdbe0889cad67ea6185441d
[libreriscv.git] / openpower / sv / setvl.mdwn
1 [[!tag standards]]
2
3 # OpenPOWER SV setvl/setvli
4
5 See links:
6
7 * <http://lists.libre-soc.org/pipermail/libre-soc-dev/2020-November/001366.html>
8 * <https://bugs.libre-soc.org/show_bug.cgi?id=535>
9 * <https://bugs.libre-soc.org/show_bug.cgi?id=587>
10 * <https://bugs.libre-soc.org/show_bug.cgi?id=568> TODO
11 * <https://bugs.libre-soc.org/show_bug.cgi?id=862> VF Predication
12 * <https://github.com/riscv/riscv-v-spec/blob/master/v-spec.adoc#vsetvlivsetvl-instructions>
13 * [[sv/svstep]]
14 * pseudocode [[openpower/isa/simplev]]
15
16 Use of setvl results in changes to the MVL, VL and STATE SPRs. see [[sv/sprs]]
17
18 # Behaviour and Rationale
19
20 SV's Vector Engine is based on Cray-style Variable-length Vectorisation,
21 just like RVV. However unlike RVV, SV sits on top of the standard Scalar
22 regfiles: there is no separate Vector register numbering. Therefore, also
23 unlike RVV, SV does not have hard-coded "Lanes": microarchitects
24 may use *ordinary* in-order, out-of-order, or superscalar designs
25 as the basis for SV. By contrast, the relevant parameter
26 in RVV is "MAXVL" and this is architecturally hard-coded into RVV systems,
27 anywhere from 1 to tens of thousands of Lanes in supercomputers.
28
29 SV is more like how MMX used to sit on top of the x86 FP regfile.
30 Therefore when Vector operations are performed, the question has to
31 be asked, "well, how much of the regfile do you want to allocate to
32 this operation?" because if it is too small an amount performance may
33 be affected, and if too large then other registers would overlap and
34 cause data corruption, or even if allocated correctly would require
35 spill to memory.
36
37 The answer effectively needs to be parameterised. Hence: MAXVL (MVL)
38 is set from an immediate, so that the compiler may decide, statically, a
39 guaranteed resource allocation according to the needs of the application.
40
41 While RVV's MAXVL was a hw limit, SV's MVL is simply a loop
42 optimization. It does not carry side-effects for the arch, though for
43 a specific cpu it may affect hw unit usage.
44
45 Other than being able to set MVL, SV's VL (Vector Length) works just like
46 RVV's VL, with one minor twist. RVV permits the `setvl` instruction to
47 set VL to an arbitrary explicit value. Within the limit of MVL, VL
48 **MUST** be set to the requested value. Given that RVV only works on Vector Loops,
49 this is fine and part of its value and design. However, SV sits on top
50 of the standard register files. When MVL=VL=2, a Vector Add on `r3`
51 will perform two Scalar Adds: one on `r3` and one on `r4`.
52
53 Thus there is the opportunity to set VL to an explicit value (within the
54 limits of MVL) with the reasonable expectation that if two operations
55 are requested (by setting VL=2) then two operations are guaranteed.
56 This avoids the need for a loop (with not-insignificant use of the
57 regfiles for counters), simply two instructions:
58
59 setvli r0, MVL=64, VL=64
60 ld r0.v, 0(r30) # load exactly 64 registers from memory
61
62 Page Faults etc. aside this is *guaranteed* 100% without fail to perform
63 64 unit-strided LDs starting from the address pointed to by r30 and put
64 the contents into r0 through r63. Thus it becomes a "LOAD-MULTI". Twin
65 Predication could even be used to only load relevant registers from
66 the stack. This *only works if VL is set to the requested value* rather
67 than, as in RVV, allowing the hardware to set VL to an arbitrary value
68 (caveat being, limited to not exceed MVL)
69
70 Also available is the option to set VL from CTR (`VL = MIN(CTR, MVL)`.
71 In combination with SVP64 [[sv/branches]] this can save one instruction
72 inside critical inner loops. Note: to avoid having an extra bit in `setvl`,
73 to select CTR is slightly convoluted.
74
75 # Format
76
77 *(Allocation of opcode TBD pending OPF ISA WG approval)*,
78 using EXT22 temporarily and fitting into the
79 [[sv/bitmanip]] space
80
81 Form: SVL-Form (see [[isatables/fields.text]])
82
83 | 0.5|6.10|11.15|16..22| 23...25 | 26.30 |31| name |
84 | -- | -- | --- | ---- |----------- | ----- |--| ------- |
85 |OPCD| RT | RA | SVi | ms vs vf | 11011 |Rc| setvl |
86
87 Instruction format:
88
89 setvl RT,RA,SVi,vf,vs,ms
90 setvl. RT,RA,SVi,vf,vs,ms
91
92 Note that the immediate (`SVi`) spans 7 bits (16 to 22)
93
94 * `ms` - bit 23 - allows for setting of MVL
95 * `vs` - bit 24 - allows for setting of VL
96 * `vf` - bit 25 - sets "Vertical First Mode".
97
98 Note that in immediate setting mode VL and MVL start from **one**
99 i.e. that an immediate value of zero will result in VL/MVL being set to 1.
100 0b111111 results in VL/MVL being set to 64. This is because setting
101 VL/MVL to 1 results in "scalar identity" behaviour, where setting VL/MVL
102 to 0 would result in all Vector operations becoming `nop`. If this is
103 truly desired (nop behaviour) then setting VL and MVL to zero is to be
104 done via the [[SVSTATE SPR|sv/sprs]]
105
106 Note that setmvli is a pseudo-op, based on RA/RT=0, and setvli likewise
107
108 setvli VL=8 : setvl r5, r0, VL=8
109 setmvli MVL=8 : setvl r0, r0, MVL=8
110
111 Additional pseudo-op for obtaining VL without modifying it:
112
113 getvl r5 : setvl r5, r0, vf=0, vs=0, ms=0
114
115 For Vertical-First mode, a pseudo-op for explicit incrementing
116 of srcstep and dststep:
117
118 svstep. : setvl. 0, 0, vf=1, vs=0, ms=0
119
120 Note that whilst it is possible to set both MVL and VL from the same
121 immediate, it is not possible to set them to different immediates in
122 the same instruction. That would require two instructions.
123
124 **Selecting CTR to set VL**
125
126 There is considerable opcode pressure, consequently to set MVL and VL
127 from different sources is as follows:
128
129 | condition | effect |
130 | - | - |
131 | `vs=1, RA=0, RT!=0` | VL,RT set to MIN(MVL, CTR) |
132 | `vs=1, RA=0, RT=0` | VL set to MIN(MVL, SVi+1) |
133 | `vs=1, RA!=0, RT=0` | VL set to MIN(MVL, RA) |
134 | `vs=1, RA!=0, RT!=0` | VL,RT set to MIN(MVL, RA) |
135
136 The reasoning here is that the opportunity to set RT equal to the
137 immediate `SVi+1` is sacrificed in favour of setting from CTR.
138
139 # Vertical First Mode
140
141 Vertical First is effectively like an implicit single bit predicate
142 applied to every SVP64 instruction. **ONLY** one element in each
143 SVP64 Vector instruction is executed; srcstep and dststep do **not**
144 increment, and the Program Counter progresses **immediately** to
145 the next instruction just as it would for any standard scalar v3.0B
146 instruction.
147
148 An explicit mode of setvl is called which can move srcstep and
149 dststep on to the next element, still respecting predicate
150 masks.
151
152 In other words, where normal SVP64 Vectorisation acts "horizontally"
153 by looping first through 0 to VL-1 and only then moving the PC
154 to the next instruction, Vertical-First moves the PC onwards
155 (vertically) through multiple instructions **with the same
156 srcstep and dststep**, then an explict instruction used to
157 advance srcstep/dststep, and an outer loop is expected to be
158 used (branch instruction) which completes a series of
159 Vector operations.
160
161 ```svstep``` mode is enabled when vf=1, vs=0 and ms=0.
162 When Rc=1 it is possible to determine when any level of
163 loops reach an end condition, or if VL has been reached. The immediate can
164 be reinterpreted as indicating which SVSTATE (0-3)
165 should be tested and placed into CR0.
166
167 * setvl immediate = 1: only VL testing is enabled. CR0.SO is set
168 to 1 when either srcstep or dststep reach VL
169 * setvl immediate = 2: also include inner middle and outer
170 loop end conditions from SVSTATE0 into CR.EQ CR.LE CR.GT
171 * setvl immediate = 3: test SVSTATE1
172 * setvl immediate = 4: test SVSTATE2
173 * setvl immediate = 5: test SVSTATE3
174
175 Testing any end condition of any loop of any REMAP state allows branches to be used to create loops.
176
177 *Programmers should be aware that VL, srcstep and dststep are global in nature.
178 Nested looping with different schedules is perfectly possible, as is
179 calling of functions, however SVSTATE (and any associated SVSTATE) should be stored on the stack.*
180
181 **SUBVL**
182
183 Sub-vector elements are not be considered "Vertical". The vec2/3/4
184 is to be considered as if the "single element". Caveats exist for
185 [[sv/mv.swizzle]] and [[sv/mv.vec]] when Pack/Unpack is enabled.
186
187 # Pseudocode
188
189 // instruction fields:
190 rd = get_rt_field(); // bits 6..10
191 ra = get_ra_field(); // bits 11..15
192 vf = get_vf_field(); // bit 23
193 vs = get_vs_field(); // bit 24
194 ms = get_ms_field(); // bit 25
195 Rc = get_Rc_field(); // bit 31
196
197 if vf and not vs and not ms {
198 // increment src/dest step mode
199 // NOTE! this is in no way complete! predication is not included
200 // and neither is SUBVL mode
201 srcstep = SPR[SV].srcstep
202 dststep = SPR[SV].dststep
203 VL = SPR[SV].VL
204 srcstep++
205 dststep++
206 rollover = (srcstep == VL or dststep == VL)
207 if rollover:
208 // Reset srcstep, dststep, and also exit "Vertical First" mode
209 srcstep = 0
210 dststep = 0
211 MSR[6] = 0
212 SPR[SV].srcstep = srcstep
213 SPR[SV].dststep = dststep
214
215 // write CR? helps for doing Vertical loops, detects end
216 // of Vector Elements
217 if Rc = 1 {
218 // update CR to indicate that srcstep/dststep "rolled over"
219 CR0.eq = rollover
220 }
221 } else {
222 // add one. MVL/VL=1..64 not 0..63
223 vlimmed = get_immed_field()+1; // 16..22
224
225 // set VL (or not).
226 // 4 options: from SPR, from immed, from ra, from CTR
227 if vs {
228 // VL to be sourced from fields/regs
229 if ra != 0 {
230 VL = GPR[ra]
231 } else {
232 VL = vlimmed
233 }
234 } else {
235 // VL not to change (except if MVL is reduced)
236 // read from SPRs
237 VL = SPR[SV_VL]
238 }
239
240 // set MVL (or not).
241 // 2 options: from SPR, from immed
242 if ms {
243 MVL = vlimmed
244 } else {
245 // MVL not to change, read from SPRs
246 MVL = SPR[SV_MVL]
247 }
248
249 // calculate (limit) VL
250 VL = min(VL, MVL)
251
252 // store VL, MVL
253 SVSTATE.VL = VL
254 SVSTATE.MVL = MVL
255
256 // write rd
257 if rt != 0 {
258 // rt is not zero
259 regs[rt] = VL;
260 }
261 // write CR?
262 if Rc = 1 {
263 // update CR from VL (not rt)
264 CR0.eq = (VL == 0)
265 ...
266 ...
267 }
268 // write Vertical-First mode
269 SVSTATE.vf = vf
270 }
271
272 # Examples
273
274 ## Core concept loop
275
276 ```
277 loop:
278 setvl a3, a0, MVL=8 # update a3 with vl
279 # (# of elements this iteration)
280 # set MVL to 8
281 # do vector operations at up to 8 length (MVL=8)
282 # ...
283 sub a0, a0, a3 # Decrement count by vl
284 bnez a0, loop # Any more?
285 ```
286
287 ## Loop using Rc=1
288
289 my_fn:
290 li r3, 1000
291 b test
292 loop:
293 sub r3, r3, r4
294 ...
295 test:
296 setvli. r4, r3, MVL=64
297 bne cr0, loop
298 end:
299 blr
300