b6cfd1f888b8f90700213cc604ae1f449c74bff4
[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 opcode
73 bit in `setvl`,
74 to select CTR is slightly convoluted.
75
76 # Format
77
78 *(Allocation of opcode TBD pending OPF ISA WG approval)*,
79 using EXT22 temporarily and fitting into the
80 [[sv/bitmanip]] space
81
82 Form: SVL-Form (see [[isatables/fields.text]])
83
84 | 0.5|6.10|11.15|16..22| 23...25 | 26.30 |31| name |
85 | -- | -- | --- | ---- |----------- | ----- |--| ------- |
86 |OPCD| RT | RA | SVi | ms vs vf | 11011 |Rc| setvl |
87
88 Instruction format:
89
90 setvl RT,RA,SVi,vf,vs,ms
91 setvl. RT,RA,SVi,vf,vs,ms
92
93 Note that the immediate (`SVi`) spans 7 bits (16 to 22)
94
95 * `ms` - bit 23 - allows for setting of MVL
96 * `vs` - bit 24 - allows for setting of VL
97 * `vf` - bit 25 - sets "Vertical First Mode".
98
99 Note that in immediate setting mode VL and MVL start from **one**
100 i.e. that an immediate value of zero will result in VL/MVL being set to 1.
101 0b111111 results in VL/MVL being set to 64. This is because setting
102 VL/MVL to 1 results in "scalar identity" behaviour, where setting VL/MVL
103 to 0 would result in all Vector operations becoming `nop`. If this is
104 truly desired (nop behaviour) then setting VL and MVL to zero is to be
105 done via the [[SVSTATE SPR|sv/sprs]]
106
107 Note that setmvli is a pseudo-op, based on RA/RT=0, and setvli likewise
108
109 setvli VL=8 : setvl r5, r0, VL=8
110 setmvli MVL=8 : setvl r0, r0, MVL=8
111
112 Additional pseudo-op for obtaining VL without modifying it (or any state):
113
114 getvl r5 : setvl r5, r0, vf=0, vs=0, ms=0
115
116 For Vertical-First mode, a pseudo-op for explicit incrementing
117 of srcstep and dststep:
118
119 svstep. : setvl. 0, 0, vf=1, vs=0, ms=0
120
121 Note that whilst it is possible to set both MVL and VL from the same
122 immediate, it is not possible to set them to different immediates in
123 the same instruction. Doing so would require two instructions.
124
125 **Selecting sources for VL**
126
127 There is considerable opcode pressure, consequently to set MVL and VL
128 from different sources is as follows:
129
130 | condition | effect |
131 | - | - |
132 | `vs=1, RA=0, RT!=0` | VL,RT set to MIN(MVL, CTR) |
133 | `vs=1, RA=0, RT=0` | VL set to MIN(MVL, SVi+1) |
134 | `vs=1, RA!=0, RT=0` | VL set to MIN(MVL, RA) |
135 | `vs=1, RA!=0, RT!=0` | VL,RT set to MIN(MVL, RA) |
136
137 The reasoning here is that the opportunity to set RT equal to the
138 immediate `SVi+1` is sacrificed in favour of setting from CTR.
139
140 # Vertical First Mode
141
142 Vertical First is effectively like an implicit single bit predicate
143 applied to every SVP64 instruction. **ONLY** one element in each
144 SVP64 Vector instruction is executed; srcstep and dststep do **not**
145 increment, and the Program Counter progresses **immediately** to
146 the next instruction just as it would for any standard scalar v3.0B
147 instruction.
148
149 An explicit mode of setvl is called which can move srcstep and
150 dststep on to the next element, still respecting predicate
151 masks.
152
153 In other words, where normal SVP64 Vectorisation acts "horizontally"
154 by looping first through 0 to VL-1 and only then moving the PC
155 to the next instruction, Vertical-First moves the PC onwards
156 (vertically) through multiple instructions **with the same
157 srcstep and dststep**, then an explict instruction used to
158 advance srcstep/dststep. An outer loop is expected to be
159 used (branch instruction) which completes a series of
160 Vector operations.
161
162 ```svstep``` mode is enabled when vf=1, vs=0 and ms=0.
163 When Rc=1 it is possible to determine when any level of
164 loops reach an end condition, or if VL has been reached. The immediate can
165 be reinterpreted as indicating which SVSTATE (0-3)
166 should be tested and placed into CR0.
167
168 * setvl immediate = 1: only VL testing is enabled. CR0.SO is set
169 to 1 when either srcstep or dststep reach VL
170 * setvl immediate = 2: also include inner middle and outer
171 loop end conditions from SVSTATE0 into CR.EQ CR.LE CR.GT
172 * setvl immediate = 3: test SVSTATE1
173 * setvl immediate = 4: test SVSTATE2
174 * setvl immediate = 5: test SVSTATE3
175
176 Testing any end condition of any loop of any REMAP state allows branches to be used to create loops.
177
178 *Programmers should be aware that VL, srcstep and dststep are global in nature.
179 Nested looping with different schedules is perfectly possible, as is
180 calling of functions, however SVSTATE (and any associated SVSTATE) should be stored on the stack.*
181
182 **SUBVL**
183
184 Sub-vector elements are not be considered "Vertical". The vec2/3/4
185 is to be considered as if the "single element". Caveats exist for
186 [[sv/mv.swizzle]] and [[sv/mv.vec]] when Pack/Unpack is enabled.
187
188 # Pseudocode
189
190 // instruction fields:
191 rd = get_rt_field(); // bits 6..10
192 ra = get_ra_field(); // bits 11..15
193 vf = get_vf_field(); // bit 23
194 vs = get_vs_field(); // bit 24
195 ms = get_ms_field(); // bit 25
196 Rc = get_Rc_field(); // bit 31
197
198 if vf and not vs and not ms {
199 // increment src/dest step mode
200 // NOTE! this is in no way complete! predication is not included
201 // and neither is SUBVL mode
202 srcstep = SPR[SV].srcstep
203 dststep = SPR[SV].dststep
204 VL = SPR[SV].VL
205 srcstep++
206 dststep++
207 rollover = (srcstep == VL or dststep == VL)
208 if rollover:
209 // Reset srcstep, dststep, and also exit "Vertical First" mode
210 srcstep = 0
211 dststep = 0
212 MSR[6] = 0
213 SPR[SV].srcstep = srcstep
214 SPR[SV].dststep = dststep
215
216 // write CR? helps for doing Vertical loops, detects end
217 // of Vector Elements
218 if Rc = 1 {
219 // update CR to indicate that srcstep/dststep "rolled over"
220 CR0.eq = rollover
221 }
222 } else {
223 // add one. MVL/VL=1..64 not 0..63
224 vlimmed = get_immed_field()+1; // 16..22
225
226 // set VL (or not).
227 // 4 options: from SPR, from immed, from ra, from CTR
228 if vs {
229 // VL to be sourced from fields/regs
230 if ra != 0 {
231 VL = GPR[ra]
232 } else {
233 VL = vlimmed
234 }
235 } else {
236 // VL not to change (except if MVL is reduced)
237 // read from SPRs
238 VL = SPR[SV_VL]
239 }
240
241 // set MVL (or not).
242 // 2 options: from SPR, from immed
243 if ms {
244 MVL = vlimmed
245 } else {
246 // MVL not to change, read from SPRs
247 MVL = SPR[SV_MVL]
248 }
249
250 // calculate (limit) VL
251 VL = min(VL, MVL)
252
253 // store VL, MVL
254 SVSTATE.VL = VL
255 SVSTATE.MVL = MVL
256
257 // write rd
258 if rt != 0 {
259 // rt is not zero
260 regs[rt] = VL;
261 }
262 // write CR?
263 if Rc = 1 {
264 // update CR from VL (not rt)
265 CR0.eq = (VL == 0)
266 ...
267 ...
268 }
269 // write Vertical-First mode
270 SVSTATE.vf = vf
271 }
272
273 # Examples
274
275 ## Core concept loop
276
277 ```
278 loop:
279 setvl a3, a0, MVL=8 # update a3 with vl
280 # (# of elements this iteration)
281 # set MVL to 8
282 # do vector operations at up to 8 length (MVL=8)
283 # ...
284 sub a0, a0, a3 # Decrement count by vl
285 bnez a0, loop # Any more?
286 ```
287
288 ## Loop using Rc=1
289
290 my_fn:
291 li r3, 1000
292 b test
293 loop:
294 sub r3, r3, r4
295 ...
296 test:
297 setvli. r4, r3, MVL=64
298 bne cr0, loop
299 end:
300 blr
301