(no commit message)
[libreriscv.git] / openpower / sv / svp64.mdwn
1 # SVP64 for OpenPOWER ISA v3.0B
2
3 This document describes [[SV|sv]] augmentation of the [[OpenPOWER|openpower]] v3.0B [[ISA|openpower/isa/]]. Permission to create commercial v3.1B implementations has not yet been granted through the issuance of a v3.1B EULA by the [[!wikipedia OpenPOWER_Foundation]] (only v3.0B)
4
5 Links:
6
7 * <http://lists.libre-soc.org/pipermail/libre-soc-dev/2020-December/001498.html>>
8 * [[svp64/discussion]]
9 * [[svp64/appendix]]
10 * <http://lists.libre-soc.org/pipermail/libre-soc-dev/2020-December/001650.html>
11 * <https://bugs.libre-soc.org/show_bug.cgi?id=550>
12 * <https://bugs.libre-soc.org/show_bug.cgi?id=573> TODO elwidth "infinite" discussion
13 * <https://bugs.libre-soc.org/show_bug.cgi?id=574> Saturating description.
14
15 Table of contents
16
17 [[!toc]]
18
19 # Introduction
20
21 This document focuses on the encoding of [[SV|sv]], and assumes familiarity with the same. It is best read in conjunction with the [[sv/overview]] which explains the background.
22
23 The plan is to create an encoding for SVP64, then to create an encoding
24 for SVP48, then to reorganize them both to improve field overlap,
25 reducing the amount of decoder hardware necessary.
26
27 All bit numbers are in MSB0 form (the bits are numbered from 0 at the MSB
28 and counting up as you move to the LSB end). All bit ranges are inclusive
29 (so `4:6` means bits 4, 5, and 6).
30
31 64-bit instructions are split into two 32-bit words, the prefix and the
32 suffix. The prefix always comes before the suffix in PC order.
33
34 | 0:5 | 6:31 | 0:31 |
35 |--------|--------------|--------------|
36 | EXT01 | v3.1B Prefix | v3.1B Suffix |
37
38 svp64 fits into the "reserved" portions of the v3.1B prefix, making it possible for svp64, v3.0B (or v3.1B including 64 bit prefixed) instructions to co-exist in the same binary without conflict.
39
40 ## SVP64 encoding features
41
42 A number of features need to be compacted into a very small space of only 24 bits:
43
44 * Independent per-register Scalar/Vector tagging and range extension on every register
45 * Element width overrides on both source and destination
46 * Predication on both source and destination
47 * Two different *types* of predication: INT and CR
48 * SV Modes including saturation (for A/V DSP), mapreduce, fail-first and
49 predicate-result mode.
50
51 This document focusses specifically on how that fits into available space. The [[svp64/appendix]] explains more of the details, whilst the [[sv/overview]] gives the basics.
52
53 # Definition of Reserved in this spec.
54
55 For the new fields added in SVP64, instructions that have any of their
56 fields set to a reserved value must cause an illegal instruction trap,
57 to allow emulation of future instruction sets. Unless otherwise stated, reserved values are always all zeros.
58
59 This is unlike OpenPower ISA v3.1, which in many instances does not require a trap if reserved fields are nonzero.
60
61 # Identity Behaviour
62
63 SVP64 is designed so that when the prefix is all zeros, and
64 VL=1, no effect or
65 influence occurs (no augmentation) such that all standard OpenPOWER
66 v3.0/1B instructions covered by the prefix are "unaltered". This is termed `scalar identity behaviour` (based on the mathematical definition for "identity", as in, "identity matrix" or better "identity transformation").
67
68 Note that this is completely different from when VL=0. VL=0 turns all operations under its influence into `nops` (regardless of the prefix)
69 whereas when VL=1 and the SV prefix is all zeros, the operation simply acts as if SV had not been applied at all to the instruction (an "identity operation").
70
71 The significance of identity behaviour is that instructions added under svp64 to the 32 bit suffix are not only accessible to svp64: as long as implementors conform to identity behaviour (set the prefix to all zeros) they may use the instructions without needing to actually implement SV itself.
72
73 # Register Naming and size
74
75 SV Registers are simply the INT, FP and CR register files extended
76 linearly to larger sizes; SV Vectorisation iterates sequentially through these registers.
77
78 Where the integer regfile in standard scalar
79 OpenPOWER v3.0B/v3.1B is r0 to r31, SV extends this as r0 to r127.
80 Likewise FP registers are extended to 128 (fp0 to fp127), and CRs are
81 extended to 64 entries, CR0 thru CR63.
82
83 The names of the registers therefore reflects a simple linear extension
84 of the OpenPOWER v3.0B / v3.1B register naming, and in hardware this
85 would be reflected by a linear increase in the size of the underlying
86 SRAM used for the regfiles.
87
88 Note: when an EXTRA field (defined below) is zero, SV is deliberately designed
89 so that the register fields are identical to as if SV was not in effect
90 i.e. under these circumstances (EXTRA=0) the register field names RA,
91 RB etc. are interpreted and treated as v3.0B / v3.1B scalar registers. This is part of
92 `scalar identity behaviour` described above.
93
94 ## Future expansion.
95
96 With the way that EXTRA fields are defined and applied to register fields,
97 future versions of SV may involve 256 or greater registers. To accommodate 256 registers, numbering of Vectors will simply shift up by one bit, without
98 requiring additional prefix bits. Backwards binary compatibility may be achieved with a PCR bit (Program Compatibility Register). Beyond this, further discussion is out of scope for this version of svp64.
99
100 # Remapped Encoding (`RM[0:23]`)
101
102 To allow relatively easy remapping of which portions of the Prefix Opcode
103 Map are used for SVP64 without needing to rewrite a large portion of the
104 SVP64 spec, a mapping is defined from the OpenPower v3.1 prefix bits to
105 a new 24-bit Remapped Encoding denoted `RM[0]` at the MSB to `RM[23]`
106 at the LSB.
107
108 The mapping from the OpenPower v3.1 prefix bits to the Remapped Encoding
109 is defined in the Prefix Fields section.
110
111 ## Prefix Opcode Map (64-bit instruction encoding)
112
113 In the original table in the v3.1B OpenPOWER ISA Spec on p1350, Table 12, prefix bits 6:11 are shown, with their allocations to different v3.1B pregix "modes".
114
115 The table below hows both PowerISA v3.1 instructions as well as new SVP instructions fit;
116 empty spaces are yet-to-be-allocated Illegal Instructions.
117
118 | 6:11 | ---000 | ---001 | ---010 | ---011 | ---100 | ---101 | ---110 | ---111 |
119 |------|--------|--------|--------|--------|--------|--------|--------|--------|
120 |000---| 8LS | 8LS | 8LS | 8LS | 8LS | 8LS | 8LS | 8LS |
121 |001---| | | | | | | | |
122 |010---| 8RR | | | | `SVP64`| `SVP64`| `SVP64`| `SVP64`|
123 |011---| | | | | `SVP64`| `SVP64`| `SVP64`| `SVP64`|
124 |100---| MLS | MLS | MLS | MLS | MLS | MLS | MLS | MLS |
125 |101---| | | | | | | | |
126 |110---| MRR | | | | `SVP64`| `SVP64`| `SVP64`| `SVP64`|
127 |111---| | MMIRR | | | `SVP64`| `SVP64`| `SVP64`| `SVP64`|
128
129 Note that by taking up a block of 16, where in every case bits 7 and 9 are set, this allows svp64 to utilise four bits of the v3.1B Prefix space and "allocate" them to svp64's Remapped Encoding field, instead.
130
131 ## Prefix Fields
132
133 To "activate" svp64 (in a way that does not conflict with v3.1B 64 bit Prefix mode), fields within the v3.1B Prefix Opcode Map are set
134 (see Prefix Opcode Map, above), leaving 24 bits "free" for use by SV.
135 This is achieved by setting bits 7 and 9 to 1:
136
137 | Name | Bits | Value | Description |
138 |------------|---------|-------|--------------------------------|
139 | EXT01 | `0:5` | `1` | Indicates Prefixed 64-bit |
140 | `RM[0]` | `6` | | Bit 0 of Remapped Encoding |
141 | SVP64_7 | `7` | `1` | Indicates this is SVP64 |
142 | `RM[1]` | `8` | | Bit 1 of Remapped Encoding |
143 | SVP64_9 | `9` | `1` | Indicates this is SVP64 |
144 | `RM[2:23]` | `10:31` | | Bits 2-23 of Remapped Encoding |
145
146 Laid out bitwise, this is as follows, showing how the 32-bits of the prefix
147 are constructed:
148
149 | 0:5 | 6 | 7 | 8 | 9 | 10:31 |
150 |--------|-------|---|-------|---|----------|
151 | EXT01 | RM | 1 | RM | 1 | RM |
152 | 000001 | RM[0] | 1 | RM[1] | 1 | RM[2:23] |
153
154 Following the prefix will be the suffix: this is simply a 32-bit v3.0B / v3.1B
155 instruction. That instruction becomes "prefixed" with the SVP context: the
156 Remapped Encoding field (RM).
157
158 # Common RM fields
159
160 The following fields are common to all Remapped Encodings:
161
162 | Field Name | Field bits | Description |
163 |------------|------------|----------------------------------------|
164 | MASKMODE | `0` | Execution (predication) Mask Kind |
165 | MASK | `1:3` | Execution Mask |
166 | ELWIDTH | `4:5` | Element Width |
167 | ELWIDTH_SRC | `6:7` | Element Width for Source |
168 | SUBVL | `8:9` | Sub-vector length |
169 | MODE | `19:23` | changes Vector behaviour |
170
171 * MODE changes the behaviour of the SV operation (result saturation, mapreduce)
172 * SUBVL groups elements together into vec2, vec3, vec4 for use in 3D and Audio/Video DSP work
173 * ELWIDTH and ELWIDTH_SRC overrides the instruction's destination and source operand width
174 * MASK (and MASK_SRC) and MASKMODE provide predication (two types of sources: scalar INT and Vector CR).
175
176 Bits 10 to 18 are further decoded depending on RM category for the instruction.
177 Similar to OpenPOWER `X-Form` etc. these are given designations, such as `RM-1P-3S1D` which indicates for this example that the operation is to be single-predicated and that there are 3 source operand EXTRA tags and one destination operand tag.
178
179 Note that if ELWIDTH != ELWIDTH_SRC this may result in reduced performance or increased latency in some implementations due to lane-crossing.
180
181 # Mode
182
183 Mode is an augmentation of SV behaviour. Some of these alterations are element-based (saturation), others involve post-analysis (predicate result) and others are Vector-based (mapreduce, fail-on-first).
184
185 These are the modes:
186
187 * **normal** mode is straight vectorisation. no augmentations: the vector comprises an array of independently created results.
188 * **ffirst** or data-dependent fail-on-first: see separate section. the vector may be truncated depending on certain criteria.
189 *VL is altered as a result*.
190 * **sat mode** or saturation: clamps each elemrnt result to a min/max rather than overflows / wraps. allows signed and unsigned clamping.
191 * **reduce mode**. a mapreduce is performed. the result is a scalar. a result vector however is required, as the upper elements may be used to store intermediary computations. the result of the mapreduce is in the first element with a nonzero predicate bit. see [[appendix]]
192 note that there are comprehensive caveats when using this mode.
193 * **pred-result** will test the result (CR testing selects a bit of CR and inverts it, just like branch testing) and if the test fails it is as if the predicate bit was zero. When Rc=1 the CR element however is still stored in the CR regfile, even if the test failed. This scheme does not apply to crops (crand, cror). See appendix for details.
194
195 Note that ffirst and reduce modes are not anticipated to be high-performance in some implementations. ffirst due to interactions with VL, and reduce due to it requiring additional operations to produce a result. normal, saturate and pred-result are however inter-element independent and may easily be parallelised to give high performance, regardless of the value of VL.
196
197 The Mode table is laid out as follows:
198
199 | 0-1 | 2 | 3 4 | description |
200 | --- | --- |---------|-------------------------- |
201 | 00 | 0 | sz dz | normal mode |
202 | 00 | 1 | sz CRM | reduce mode (mapreduce), SUBVL=1 |
203 | 00 | 1 | SVM CRM | subvector reduce mode, SUBVL>1 |
204 | 01 | inv | CR-bit | Rc=1: ffirst CR sel |
205 | 01 | inv | sz RC1 | Rc=0: ffirst z/nonz |
206 | 10 | N | sz dz | sat mode: N=0/1 u/s |
207 | 11 | inv | CR-bit | Rc=1: pred-result CR sel |
208 | 11 | inv | sz RC1 | Rc=0: pred-result z/nonz |
209
210 Fields:
211
212 * **sz / dz** if predication is enabled will put zeros into the dest (or as src in the case of twin pred) when the predicate bit is zero. otherwise the element is ignored or skipped, depending on context.
213 * **inv CR bit** just as in branches (BO) these bits allow testing of a CR bit and whether it is set (inv=0) or unset (inv=1)
214 * **CRM** affects the CR on reduce mode when Rc=1
215 * **SVM** sets "subvector" reduce mode
216 * **N** sets signed/unsigned saturation.
217 **RC1** as if Rc=1, stores CRs *but not the result*
218
219 ## LD/ST ffirst
220
221 ffirst LD/ST to multiple pages via a Vectorised base is considered a security risk due to the abuse of probing multiple pages in rapid succession and getting feedback on which pages would fail. Therefore in these special circumstances requesting ffirst eith a vector base is instead interpreted as element-strided LD/ST. See <https://bugs.libre-soc.org/show_bug.cgi?id=561>
222
223 # ELWIDTH Encoding
224
225 Default behaviour is set to 0b00 so that zeros follow the convention of
226 `scalar identity behaviour`. In this case it means that elwidth overrides
227 are not applicable. Thus if a 32 bit instruction operates on 32 bit,
228 `elwidth=0b00` specifies that this behaviour is unmodified. Likewise
229 when a processor is switched from 64 bit to 32 bit mode, `elwidth=0b00`
230 states that, again, the behaviour is not to be modified.
231
232 Only when elwidth is nonzero is the element width overridden to the
233 explicitly required value.
234
235 ## Elwidth for Integers:
236
237 | Value | Mnemonic | Description |
238 |-------|----------------|------------------------------------|
239 | 00 | DEFAULT | default behaviour for operation |
240 | 01 | `ELWIDTH=w` | Word: 32-bit integer |
241 | 10 | `ELWIDTH=h` | Halfword: 16-bit integer |
242 | 11 | `ELWIDTH=b` | Byte: 8-bit integer |
243
244 This encoding is chosen such that the byte width may be computed as `(3-ew)<<8`
245
246 ## Elwidth for FP Registers:
247
248 | Value | Mnemonic | Description |
249 |-------|----------------|------------------------------------|
250 | 00 | DEFAULT | default behaviour for FP operation |
251 | 01 | `ELWIDTH=f32` | 32-bit IEEE 754 Single floating-point |
252 | 10 | `ELWIDTH=f16` | 16-bit IEEE 754 Half floating-point |
253 | 11 | `ELWIDTH=bf16` | Reserved for `bf16` |
254
255 Note:
256 [`bf16`](https://en.wikipedia.org/wiki/Bfloat16_floating-point_format)
257 is reserved for a future implementation of SV
258
259 ## Elwidth for CRs:
260
261 TODO, important, particularly for crops, mfcr and mtcr, what elwidth
262 even means. instead it may be possible to use the bits as extra indices
263 (add to EXTRA2/3) to access the full 64 CRs at the bit level. TBD, several ideas
264
265 The actual width of the CRs cannot be altered: they are 4 bit. Also,
266 for Rc=1 operations that produce a result (in RT or FRT) and corresponding CR, it is
267 the INT/FP result to which the elwidth override applies, *not* the CR.
268 This therefore inherently places Rc=1 operations firmly out of scope as far as a "meaning" for elwidth on CRs is concerned.
269
270 As mentioned TBD, this leaves crops etc. to have a meaning defined for
271 elwidth, because these ops are pure explicit CR based.
272
273 Examples: mfxm may take the extra bits and use them as extra mask bits.
274
275 Example: hypothetically, operations could be modified to be considered 2-bit or 1-bit per CR. This would need a very comprehensive review.
276
277 # SUBVL Encoding
278
279 the default for SUBVL is 1 and its encoding is 0b00 to indicate that
280 SUBVL is effectively disabled (a SUBVL for-loop of only one element). this
281 lines up in combination with all other "default is all zeros" behaviour.
282
283 | Value | Mnemonic | Subvec | Description |
284 |-------|-----------|---------|------------------------|
285 | 00 | `SUBVL=1` | single | Sub-vector length of 1 |
286 | 01 | `SUBVL=2` | vec2 | Sub-vector length of 2 |
287 | 10 | `SUBVL=3` | vec3 | Sub-vector length of 3 |
288 | 11 | `SUBVL=4` | vec4 | Sub-vector length of 4 |
289
290 The SUBVL encoding value may be thought of as an inclusive range of a
291 sub-vector. SUBVL=2 represents a vec2, its encoding is 0b01, therefore
292 this may be considered to be elements 0b00 to 0b01 inclusive.
293
294 # MASK/MASK_SRC & MASKMODE Encoding
295
296 TODO: rename MASK_KIND to MASKMODE
297
298 One bit (`MASKMODE`) indicates the mode: CR or Int predication. The two
299 types may not be mixed.
300
301 Special note: to disable predication this field must
302 be set to zero in combination with Integer Predication also being set
303 to 0b000. this has the effect of enabling "all 1s" in the predicate
304 mask, which is equivalent to "not having any predication at all"
305 and consequently, in combination with all other default zeros, fully
306 disables SV (`scalar identity behaviour`).
307
308 `MASKMODE` may be set to one of 2 values:
309
310 | Value | Description |
311 |-----------|------------------------------------------------------|
312 | 0 | MASK/MASK_SRC are encoded using Integer Predication |
313 | 1 | MASK/MASK_SRC are encoded using CR-based Predication |
314
315 Integer Twin predication has a second set of 3 bits that uses the same
316 encoding thus allowing either the same register (r3 or r10) to be used
317 for both src and dest, or different regs (one for src, one for dest).
318
319 Likewise CR based twin predication has a second set of 3 bits, allowing
320 a different test to be applied.
321
322 ## Integer Predication (MASKMODE=0)
323
324 When the predicate mode bit is zero the 3 bits are interpreted as below.
325 Twin predication has an identical 3 bit field similarly encoded.
326
327 `MASK` and `MASK_SRC` may be set to one of 8 values, to provide the following meaning:
328
329 | Value | Mnemonic | Element `i` enabled if: |
330 |-------|----------|------------------------------|
331 | 000 | ALWAYS | predicate effectively all 1s |
332 | 001 | 1 << R3 | `i == R3` |
333 | 010 | R3 | `R3 & (1 << i)` is non-zero |
334 | 011 | ~R3 | `R3 & (1 << i)` is zero |
335 | 100 | R10 | `R10 & (1 << i)` is non-zero |
336 | 101 | ~R10 | `R10 & (1 << i)` is zero |
337 | 110 | R30 | `R30 & (1 << i)` is non-zero |
338 | 111 | ~R30 | `R30 & (1 << i)` is zero |
339
340 r10 and r30 are at the high end of temporary and unused registers, so as not to interfere with register allocation from ABIs.
341
342 ## CR-based Predication (MASKMODE=1)
343
344 When the predicate mode bit is one the 3 bits are interpreted as below.
345 Twin predication has an identical 3 bit field similarly encoded.
346
347 `MASK` and `MASK_SRC` may be set to one of 8 values, to provide the following meaning:
348
349 | Value | Mnemonic | Element `i` is enabled if |
350 |-------|----------|--------------------------|
351 | 000 | lt | `CR[offs+i].LT` is set |
352 | 001 | nl/ge | `CR[offs+i].LT` is clear |
353 | 010 | gt | `CR[offs+i].GT` is set |
354 | 011 | ng/le | `CR[offs+i].GT` is clear |
355 | 100 | eq | `CR[offs+i].EQ` is set |
356 | 101 | ne | `CR[offs+i].EQ` is clear |
357 | 110 | so/un | `CR[offs+i].FU` is set |
358 | 111 | ns/nu | `CR[offs+i].FU` is clear |
359
360 CR based predication. TODO: select alternate CR for twin predication? see
361 [[discussion]] Overlap of the two CR based predicates must be taken
362 into account, so the starting point for one of them must be suitably
363 high, or accept that for twin predication VL must not exceed the range
364 where overlap will occur, *or* that they use the same starting point
365 but select different *bits* of the same CRs
366
367 `offs` is defined as CR32 (4x8) so as to mesh cleanly with Vectorised Rc=1 operations (see below). Rc=1 operations start from CR8 (TBD).
368
369 Notes from Jacob: CR6-7 allows Scalar ops to refer to these without having to do a transfer (v3.0B). Another idea: the DepMatrices treat scalar CRs as one "thing" and treat the Vectors as a completely separate "thing".
370
371 # Extra Remapped Encoding
372
373 Shows all instruction-specific fields in the Remapped Encoding `RM[8:18]` for all instruction variants. Note that due to the very tight space, the encoding mode is *not* included in the prefix itself. The mode is "applied", similar to OpenPOWER "Forms" (X-Form, D-Form) on a per-instruction basis, and, like "Forms" are given a designation (below) of the form `RM-nP-nSnD`. The full list of which instructions use which remaps is here [[opcode_regs_deduped]]. (*Machine-readable CSV files have been provided which will make the task of creating SV-aware ISA decoders easier*).
374
375 There are two categories: Single and Twin Predication.
376 Due to space considerations further subdivision of Single Predication
377 is based on whether the number of src operands is 2 or 3.
378
379 * `RM-1P-3S1D` Single Predication dest/src1/2/3, applies to 4-operand instructions (fmadd, isel, madd).
380 * `RM-1P-2S1D` Single Predication dest/src1/2 applies to 3-operand instructions (src1 src2 dest)
381 * `RM-2P-1S1D` Twin Predication (src=1, dest=1)
382 * `RM-2P-2S1D` Twin Predication (src=2, dest=1) primarily for LDST (Indexed)
383 * `RM-2P-1S2D` Twin Predication (src=1, dest=2) primarily for LDST Update
384
385 ## RM-1P-3S1D
386
387 | Field Name | Field bits | Description |
388 |------------|------------|----------------------------------------|
389 | Rdest\_EXTRA2 | `10:11` | extends Rdest (R\*\_EXTRA2 Encoding) |
390 | Rsrc1\_EXTRA2 | `12:13` | extends Rsrc1 (R\*\_EXTRA2 Encoding) |
391 | Rsrc2\_EXTRA2 | `14:15` | extends Rsrc2 (R\*\_EXTRA2 Encoding) |
392 | Rsrc3\_EXTRA2 | `16:17` | extends Rsrc3 (R\*\_EXTRA2 Encoding) |
393 | reserved | `18` | reserved |
394
395 ## RM-1P-2S1D
396
397 | Field Name | Field bits | Description |
398 |------------|------------|-------------------------------------------|
399 | Rdest\_EXTRA3 | `10:12` | extends Rdest |
400 | Rsrc1\_EXTRA3 | `13:15` | extends Rsrc1 |
401 | Rsrc2\_EXTRA3 | `16:18` | extends Rsrc3 |
402
403 These are for 2 operand 1 dest instructions, such as `add RT, RA,
404 RB`. However also included are unusual instructions with an implicit dest
405 that is identical to its src reg, such as `rlwinmi`.
406
407 Normally, with instructions such as `rlwinmi`, the scalar v3.0B ISA would not have sufficient bit fields to allow
408 an alternative destination. With SV however this becomes possible.
409 Therefore, the fact that the dest is implicitly also a src should not
410 mislead: due to the *prefix* they are different SV regs.
411
412 * `rlwimi RA, RS, ...`
413 * Rsrc1_EXTRA3 applies to RS as the first src
414 * Rsrc2_EXTRA3 applies to RA as the secomd src
415 * Rdest_EXTRA3 applies to RA to create an **independent** dest.
416
417 With the addition of the EXTRA bits, the three registers
418 each may be *independently* made vector or scalar, and be independently
419 augmented to 7 bits in length.
420
421 ## RM-2P-1S1D/2S
422
423 | Field Name | Field bits | Description |
424 |------------|------------|----------------------------|
425 | Rdest_EXTRA3 | `10:12` | extends Rdest |
426 | Rsrc1_EXTRA3 | `13:15` | extends Rsrc1 |
427 | MASK_SRC | `16:18` | Execution Mask for Source |
428
429 `RM-2P-2S` is for `stw` etc. and is Rsrc1 Rsrc2.
430
431 ## RM-2P-2S1D/1S2D/3S
432
433 The primary purpose for this encoding is for Twin Predication on LOAD
434 and STORE operations. see [[sv/ldst]] for detailed anslysis.
435
436 RM-2P-2S1D:
437
438 | Field Name | Field bits | Description |
439 |------------|------------|----------------------------|
440 | Rdest_EXTRA2 | `10:11` | extends Rdest (R\*\_EXTRA2 Encoding) |
441 | Rsrc1_EXTRA2 | `12:13` | extends Rsrc1 (R\*\_EXTRA2 Encoding) |
442 | Rsrc2_EXTRA2 | `14:15` | extends Rsrc2 (R\*\_EXTRA2 Encoding) |
443 | MASK_SRC | `16:18` | Execution Mask for Source |
444
445 Note that for 1S2P the EXTRA2 dest and src names are switched (Rsrc_EXTRA2
446 is in bits 10:11, Rdest1_EXTRA2 in 12:13)
447
448 Also that for 3S (to cover `stdx` etc.) the names are switched to 3 src: Rsrc1_EXTRA2, Rsrc2_EXTRA2, Rsrc3_EXTRA2.
449
450 Note also that LD with update indexed, which takes 2 src and 2 dest
451 (e.g. `lhaux RT,RA,RB`), does not have room for 4 registers and also
452 Twin Predication. therefore these are treated as RM-2P-2S1D and the
453 src spec for RA is also used for the same RA as a dest.
454
455 Note that if ELWIDTH != ELWIDTH_SRC this may result in reduced performance or increased latency in some implementations due to lane-crossing.
456
457 # R\*\_EXTRA2/3
458
459 EXTRA is the means by which two things are achieved:
460
461 1. Registers are marked as either Vector *or Scalar*
462 2. Register field numbers (limited typically to 5 bit)
463 are extended in range, both for Scalar and Vector.
464
465 In the following tables register numbers are constructed from the
466 standard v3.0B / v3.1B 32 bit register field (RA, FRA) and the EXTRA2
467 or EXTRA3 field from the SV Prefix. The prefixing is arranged so that
468 interoperability between prefixing and nonprefixing of scalar registers
469 is direct and convenient (when the EXTRA field is all zeros).
470
471 A pseudocode algorithm explains the relationship, for INT/FP (see [[svp64/appendix]] for CRs)
472
473 if extra3_mode:
474 spec = EXTRA3
475 else:
476 spec = EXTRA2 << 1 # same as EXTRA3, shifted
477 if spec[2]: # vector
478 return (RA << 2) | spec[0:1]
479 else: # scalar
480 return (spec[0:1] << 5) | RA
481
482 ## INT/FP EXTRA3
483
484 alternative which is understandable and, if EXTRA3 is zero, maps to
485 "no effect" (scalar OpenPOWER ISA field naming). also, these are the
486 encodings used in the original SV Prefix scheme. the reason why they
487 were chosen is so that scalar registers in v3.0B and prefixed scalar
488 registers have access to the same 32 registers.
489
490 | R\*\_EXTRA3 | Mode | Range | MSB downto LSB |
491 |-----------|-------|---------------|---------------------|
492 | 000 | Scalar | `r0-r31` | `0b00 RA` |
493 | 001 | Scalar | `r32-r63` | `0b01 RA` |
494 | 010 | Scalar | `r64-r95` | `0b10 RA` |
495 | 011 | Scalar | `r96-r127` | `0b11 RA` |
496 | 100 | Vector | `r0-r124` | `RA 0b00` |
497 | 101 | Vector | `r1-r125` | `RA 0b01` |
498 | 110 | Vector | `r2-r126` | `RA 0b10` |
499 | 111 | Vector | `r3-r127` | `RA 0b11` |
500
501 ## INT/FP EXTRA2
502
503 alternative which is understandable and, if EXTRA2 is zero will map to
504 "no effect" i.e Scalar OpenPOWER register naming:
505
506 | R\*\_EXTRA2 | Mode | Range | MSB down to LSB |
507 |-----------|-------|---------------|---------------------|
508 | 00 | Scalar | `r0-r31` | `0b00 RA` |
509 | 01 | Scalar | `r32-r63` | `0b01 RA` |
510 | 10 | Vector | `r0-r124` | `RA 0b00` |
511 | 11 | Vector | `r2-r126` | `RA 0b10` |
512
513 ## CR EXTRA3
514
515 CR encoding is essentially the same but made more complex due to CRs being bit-based. See separate section for explanation and pseudocode.
516
517 Encoding shown MSB down to LSB
518
519 | R\*\_EXTRA3 | Mode | 7..5 | 4..2 | 1..0 |
520 |-------------|------|---------| --------|---------|
521 | 000 | Scalar | 0b000 | BA[4:2] | BA[1:0] |
522 | 001 | Scalar | 0b001 | BA[4:2] | BA[1:0] |
523 | 010 | Scalar | 0b010 | BA[4:2] | BA[1:0] |
524 | 011 | Scalar | 0b011 | BA[4:2] | BA[1:0] |
525 | 100 | Vector | BA[4:2] | 0b000 | BA[1:0] |
526 | 101 | Vector | BA[4:2] | 0b010 | BA[1:0] |
527 | 110 | Vector | BA[4:2] | 0b100 | BA[1:0] |
528 | 111 | Vector | BA[4:2] | 0b110 | BA[1:0] |
529
530 ## CR EXTRA2
531
532 CR encoding is essentially the same but made more complex due to CRs being bit-based. See separate section for explanation and pseudocode.
533
534 Encoding shown MSB down to LSB
535
536 | R\*\_EXTRA2 | Mode | 7..5 | 4..2 | 1..0 |
537 |-------------|--------|---------|---------|---------|
538 | 00 | Scalar | 0b000 | BA[4:2] | BA[1:0] |
539 | 01 | Scalar | 0b001 | BA[4:2] | BA[1:0] |
540 | 10 | Vector | BA[4:2] | 0b000 | BA[1:0] |
541 | 11 | Vector | BA[4:2] | 0b100 | BA[1:0] |
542
543 # Appendix
544
545 Now at its own page: [[svp64/appendix]]
546