X-Git-Url: https://git.libre-soc.org/?a=blobdiff_plain;f=simple_v_extension%2Fspecification.mdwn;h=2b1160f8c58e6b3042a7b505a916321f26e6320f;hb=HEAD;hp=638ce711a7440d9cbec69bd0566c669ce9355111;hpb=5a4ebac86b089d4edd6595c63adce925f502f7aa;p=libreriscv.git diff --git a/simple_v_extension/specification.mdwn b/simple_v_extension/specification.mdwn index 638ce711a..2b1160f8c 100644 --- a/simple_v_extension/specification.mdwn +++ b/simple_v_extension/specification.mdwn @@ -1,12 +1,18 @@ + # Simple-V (Parallelism Extension Proposal) Specification * Copyright (C) 2017, 2018, 2019 Luke Kenneth Casson Leighton -* Status: DRAFTv0.6 -* Last edited: 21 jun 2019 -* Ancillary resource: [[opcodes]] [[sv_prefix_proposal]] +* Status: DRAFTv0.6.1 +* Last edited: 10 sep 2019 +* Ancillary resource: [[opcodes]] +* Ancillary resource: [[sv_prefix_proposal]] +* Ancillary resource: [[abridged_spec]] +* Ancillary resource: [[vblock_format]] +* Ancillary resource: [[appendix]] -With thanks to: +Authors/Contributors: +* Luke Kenneth Casson Leighton * Allen Baum * Bruce Hoult * comp.arch @@ -62,7 +68,7 @@ To emphasise that clearly: Simple-V (SV) is *not*: * A SIMT system * A Vectorisation Microarchitecture * A microarchitecture of any specific kind -* A mandary parallel processor microarchitecture of any kind +* A mandatory parallel processor microarchitecture of any kind * A supercomputer extension SV does **not** tell implementors how or even if they should implement @@ -106,45 +112,47 @@ on hidden context that augments *scalar* RISCV instructions. There are five additional CSRs, available in any privilege level: * MVL (the Maximum Vector Length) -* VL (which has different characteristics from standard CSRs) +* VL (sets which scalar register is to be the Vector Length) * SUBVL (effectively a kind of SIMD) * STATE (containing copies of MVL, VL and SUBVL as well as context information) -* PCVLIW (the current operation being executed within a VLIW Group) +* SVPSTATE (state information for SVPrefix) +* PCVBLK (the current operation being executed within a VBLOCK Group) For User Mode there are the following CSRs: -* uePCVLIW (a copy of the sub-execution Program Counter, that is relative - to the start of the current VLIW Group, set on a trap). +* uePCVBLK (a copy of the sub-execution Program Counter, that is relative + to the start of the current VBLOCK Group, set on a trap). * ueSTATE (useful for saving and restoring during context switch, and for providing fast transitions) +* ueSVPSTATE when SVPrefix is implemented + Note: ueSVPSTATE is mirrored in the top 32 bits of ueSTATE. -There are also two additional CSRs for Supervisor-Mode: +There are also three additional CSRs for Supervisor-Mode: -* sePCVLIW -* seSTATE +* sePCVBLK +* seSTATE (which contains seSVPSTATE) +* seSVPSTATE And likewise for M-Mode: -* mePCVLIW -* meSTATE +* mePCVBLK +* meSTATE (which contains meSVPSTATE) +* meSVPSTATE The u/m/s CSRs are treated and handled exactly like their (x)epc -equivalents. On entry to a privilege level, the contents of its (x)eSTATE -and (x)ePCVLIW CSRs are copied into STATE and PCVLIW respectively, and -on exit from a priv level the STATE and PCVLIW CSRs are copied to the -exited priv level's corresponding CSRs. +equivalents. On entry to or exit from a privilege level, the contents +of its (x)eSTATE are swapped with STATE. Thus for example, a User Mode trap will end up swapping STATE and ueSTATE (on both entry and exit), allowing User Mode traps to have their own Vectorisation Context set up, separated from and unaffected by normal -user applications. +user applications. If an M Mode trap occurs in the middle of the U Mode +trap, STATE is swapped with meSTATE, and restored on exit: the U Mode +trap continues unaware that the M Mode trap even occurred. Likewise, Supervisor Mode may perform context-switches, safe in the knowledge that its Vectorisation State is unaffected by User Mode. -For this to work, the (x)eSTATE CSR must be saved onto the stack by the -trap, just like (x)epc, before modifying the trap atomicity flag (x)ie. - The access pattern for these groups of CSRs in each mode follows the same pattern for other CSRs that have M-Mode and S-Mode "mirrors": @@ -156,28 +164,16 @@ same pattern for other CSRs that have M-Mode and S-Mode "mirrors": * In U-Mode, accessing and changing of the S-Mode and U-Mode CSRs is prohibited. -In M-Mode, only the M-Mode CSRs are in effect, i.e. it is only the -M-Mode MVL, the M-Mode STATE and so on that influences the processor -behaviour. Likewise for S-Mode, and likewise for U-Mode. - -This has the interesting benefit of allowing M-Mode (or S-Mode) to be set -up, for context-switching to take place, and, on return back to the higher -privileged mode, the CSRs of that mode will be exactly as they were. -Thus, it becomes possible for example to set up CSRs suited best to aiding -and assisting low-latency fast context-switching *once and only once* -(for example at boot time), without the need for re-initialising the -CSRs needed to do so. - -Another interesting side effect of separate S Mode CSRs is that -Vectorised saving of the entire register file to the stack is a single -instruction (accidental provision of LOAD-MULTI semantics). If the -SVPrefix P64-LD-type format is used, LOAD-MULTI may even be done with a -single standalone 64 bit opcode (P64 may set up both VL and MVL from an -immediate field). It can even be predicated, which opens up some very -interesting possibilities. - -The (x)EPCVLIW CSRs must be treated exactly like their corresponding (x)epc -equivalents. See VLIW section for details. +An interesting side effect of SV STATE being separate and distinct in S +Mode is that Vectorised saving of an entire register file to the stack +is a single instruction (through accidental provision of LOAD-MULTI +semantics). If the SVPrefix P64-LD-type format is used, LOAD-MULTI may +even be done with a single standalone 64 bit opcode (P64 may set up SVPSTATE.SUBVL, +SVPSTATE.VL and SVPSTATE.MVL from an immediate field, to cover the full regfile). It can +even be predicated, which opens up some very interesting possibilities. + +(x)EPCVBLK CSRs must be treated exactly like their corresponding (x)epc +equivalents. See VBLOCK section for details. ## MAXVECTORLENGTH (MVL) @@ -199,88 +195,32 @@ section, where there are subtle differences between CSRRW and CSRRWI. ## Vector Length (VL) -VSETVL is slightly different from RVV. Similar to RVV, VL is set to be within -the range 1 <= VL <= MVL (where MVL in turn is limited to 1 <= MVL <= XLEN) - - VL = rd = MIN(vlen, MVL) - -where 1 <= MVL <= XLEN - -However just like MVL it is important to note that the range for VL has -subtle design implications, covered in the "CSR pseudocode" section - -The fixed (specific) setting of VL allows vector LOAD/STORE to be used -to switch the entire bank of registers using a single instruction (see -Appendix, "Context Switch Example"). The reason for limiting VL to XLEN -is down to the fact that predication bits fit into a single register of -length XLEN bits. - -The second and most important change is that, within the limits set by -MVL, the value passed in **must** be set in VL (and in the -destination register). - -This has implication for the microarchitecture, as VL is required to be -set (limits from MVL notwithstanding) to the actual value -requested. RVV has the option to set VL to an arbitrary value that suits -the conditions and the micro-architecture: SV does *not* permit this. - -The reason is so that if SV is to be used for a context-switch or as a -substitute for LOAD/STORE-Multiple, the operation can be done with only -2-3 instructions (setup of the CSRs, VSETVL x0, x0, #{regfilelen-1}, -single LD/ST operation). If VL does *not* get set to the register file -length when VSETVL is called, then a software-loop would be needed. -To avoid this need, VL *must* be set to exactly what is requested -(limits notwithstanding). - -Therefore, in turn, unlike RVV, implementors *must* provide -pseudo-parallelism (using sequential loops in hardware) if actual -hardware-parallelism in the ALUs is not deployed. A hybrid is also -permitted (as used in Broadcom's VideoCore-IV) however this must be -*entirely* transparent to the ISA. - -The third change is that VSETVL is implemented as a CSR, where the -behaviour of CSRRW (and CSRRWI) must be changed to specifically store -the *new* value in the destination register, **not** the old value. -Where context-load/save is to be implemented in the usual fashion -by using a single CSRRW instruction to obtain the old value, the -*secondary* CSR must be used (STATE). This CSR by contrast behaves -exactly as standard CSRs, and contains more than just VL. - -One interesting side-effect of using CSRRWI to set VL is that this -may be done with a single instruction, useful particularly for a -context-load/save. There are however limitations: CSRWI's immediate -is limited to 0-31 (representing VL=1-32). - -Note that when VL is set to 1, vector operations cease (but not subvector -operations: that requires setting SUBVL=1) the hardware loop is reduced -to a single element: scalar operations. This is in effect the default, -normal operating mode. However it is important to appreciate that this -does **not** result in the Register table or SUBVL being disabled. Only -when the Register table is empty (P48/64 prefix fields notwithstanding) -would SV have no effect. +VL is very different from RVV's VL. It contains the scalar register *number* that is to be treated as the Vector Length. It is a sub-field of STATE. When set to zero (x0) VL (vectorisation) is disabled. + +Implementations realistically should keep a cached copy of the register pointed to by VL in the instruction issue and decode phases. Out of Order Engines must then, if it is not x0, add this register to Vectorised instruction Dependency Checking as an additional read/write hazard as appropriate. + +Setting VL via this CSR is very unusual. It should not normally be needed except when [[specification/sv.setvl]] is not implemented. Note that unlike in sv.setvl, setting VL does not change the contents of the scalar register that it points to, although if the scalar register's contents are not within the range of MVL at the time that VL is set, an illegal instruction exception must be raised. ## SUBVL - Sub Vector Length -This is a "group by quantity" that effectivrly asks each iteration +This is a "group by quantity" that effectively asks each iteration of the hardware loop to load SUBVL elements of width elwidth at a time. Effectively, SUBVL is like a SIMD multiplier: instead of just 1 operation issued, SUBVL operations are issued. Another way to view SUBVL is that each element in the VL length vector is now SUBVL times elwidth bits in length and now comprises SUBVL discrete -sub operations. An inner SUBVL for-loop within a VL for-loop in effect, +sub operations. This can be viewed as an inner SUBVL hardware for-loop within a VL hardware for-loop in effect, with the sub-element increased every time in the innermost loop. This -is best illustrated in the (simplified) pseudocode example, later. +is best illustrated in the (simplified) pseudocode example, in the +[[appendix]]. The primary use case for SUBVL is for 3D FP Vectors. A Vector of 3D -coordinates X,Y,Z for example may be loaded and multiplied the stored, per +coordinates X,Y,Z for example may be loaded and multiplied then stored, per VL element iteration, rather than having to set VL to three times larger. -Legal values are 1, 2, 3 and 4 (and the STATE CSR must hold the 2 bit -values 0b00 thru 0b11 to represent them). - Setting this CSR to 0 must raise an exception. Setting it to a value -greater than 4 likewise. +greater than 4 likewise. To see the relationship with STATE, see below. The main effect of SUBVL is that predication bits are applied per **group**, rather than by individual element. @@ -289,10 +229,12 @@ This saves a not insignificant number of instructions when handling 3D vectors, as otherwise a much longer predicate mask would have to be set up with regularly-repeated bit patterns. -See SUBVL Pseudocode illustration for details. +See SUBVL Pseudocode illustration in the [[appendix]], for details. ## STATE +out of date, see + This is a standard CSR that contains sufficient information for a full context save/restore. It contains (and permits setting of): @@ -304,8 +246,6 @@ full context save/restore. It contains (and permits setting of): * SUBVL * svdestoffs - the subvector destination element offset of the current parallel instruction being executed -* svsrcoffs - for twin-predication, the subvector source element offset - as well. Interestingly STATE may hypothetically also be modified to make the immediately-following instruction to skip a certain number of elements, @@ -322,25 +262,46 @@ and seSTATE). The format of the STATE CSR is as follows: -| (29..28 | (27..26) | (25..24) | (23..18) | (17..12) | (11..6) | (5...0) | -| ------- | -------- | -------- | -------- | -------- | ------- | ------- | -| dsvoffs | ssvoffs | subvl | destoffs | srcoffs | vl | maxvl | +| (31..28) | (27..26) | (25..24) | (23..18) | (17..12) | (11..6) | (5...0) | +| -------- | -------- | -------- | -------- | -------- | ------- | ------- | +| rsvd | dsvoffs | subvl | destoffs | srcoffs | vl | maxvl | + +Legal values of vl are between 0 and 31. + +The relationship between SUBVL and the subvl field is: + +| SUBVL | (25..24) | +| ----- | -------- | +| 1 | 0b00 | +| 2 | 0b01 | +| 3 | 0b10 | +| 4 | 0b11 | When setting this CSR, the following characteristics will be enforced: * **MAXVL** will be truncated (after offset) to be within the range 1 to XLEN -* **VL** will be truncated (after offset) to be within the range 1 to MAXVL -* **SUBVL** which sets a SIMD-like quantity, has only 4 values there +* **VL** must be set to a scalar register between 0 and 31. +* **SUBVL** which sets a SIMD-like quantity, has only 4 values so there are no changes needed * **srcoffs** will be truncated to be within the range 0 to VL-1 * **destoffs** will be truncated to be within the range 0 to VL-1 -* **ssvoffs** will be truncated to be within the range 0 to SUBVL-1 * **dsvoffs** will be truncated to be within the range 0 to SUBVL-1 NOTE: if the following instruction is not a twin predicated instruction, and destoffs or dsvoffs has been set to non-zero, subsequent execution behaviour is undefined. **USE WITH CARE**. +NOTE: sub-vector looping does not require a twin-predicate corresponding +index, because sub-vectors use the *main* (VL) loop predicate bit. + +When SVPrefix is implemented, it can have its own VL, MVL and SUBVL, as well as element offsets. SVSTATE.VL acts slightly differently in that it is no longer a pointer to a scalar register but is an actual value just like RVV's VL. + +The format of SVSTATE, which fits into *both* the top bits of STATE and also into a separate CSR, is as follows: + +| (31..28) | (27..26) | (25..24) | (23..18) | (17..12) | (11..6) | (5...0) | +| -------- | -------- | -------- | -------- | -------- | ------- | ------- | +| rsvd | dsvoffs | subvl | destoffs | srcoffs | vl | maxvl | + ### Hardware rules for when to increment STATE offsets The offsets inside STATE are like the indices in a loop, except @@ -374,19 +335,16 @@ The pseudo-code for get and set of VL and MVL use the following internal functions as follows: set_mvl_csr(value, rd): - regs[rd] = STATE.MVL STATE.MVL = MIN(value, STATE.MVL) get_mvl_csr(rd): regs[rd] = STATE.VL set_vl_csr(value, rd): - STATE.VL = MIN(value, STATE.MVL) - regs[rd] = STATE.VL # yes returning the new value NOT the old CSR + STATE.VL = rd return STATE.VL get_vl_csr(rd): - regs[rd] = STATE.VL return STATE.VL Note that where setting MVL behaves as a normal CSR (returns the old @@ -483,7 +441,7 @@ Note: CSRRC and other bitsetting may still be used, they are however not particu ## Register key-value (CAM) table *NOTE: in prior versions of SV, this table used to be writable and -accessible via CSRs. It is now stored in the VLIW instruction format. Note +accessible via CSRs. It is now stored in the VBLOCK instruction format. Note that this table does *not* get applied to the SVPrefix P48/64 format, only to scalar opcodes* @@ -510,28 +468,14 @@ anywhere to the *full* 128 register range. Thus, RVC becomes far more powerful and has many more opportunities to reduce code size that in Standard RV32/RV64 executables. -16 bit format: - -| RegCAM | | 15 | (14..8) | 7 | (6..5) | (4..0) | -| ------ | | - | - | - | ------ | ------- | -| 0 | | isvec0 | regidx0 | i/f | vew0 | regkey | -| 1 | | isvec1 | regidx1 | i/f | vew1 | regkey | -| .. | | isvec.. | regidx.. | i/f | vew.. | regkey | -| 15 | | isvec15 | regidx15 | i/f | vew15 | regkey | - -8 bit format: - -| RegCAM | | 7 | (6..5) | (4..0) | -| ------ | | - | ------ | ------- | -| 0 | | i/f | vew0 | regnum | +[[!inline raw="yes" pages="simple_v_extension/reg_table_format" ]] i/f is set to "1" to indicate that the redirection/tag entry is to be applied to integer registers; 0 indicates that it is relevant to -floating-point -registers. +floating-point registers. The 8 bit format is used for a much more compact expression. "isvec" -is implicit and, similar to [[sv-prefix-proposal]], the target vector +is implicit and, similar to [[sv_prefix_proposal]], the target vector is "regnum<<2", implicitly. Contrast this with the 16-bit format where the target vector is *explicitly* named in bits 8 to 14, and bit 15 may optionally set "scalar" mode. @@ -554,19 +498,12 @@ operand size is "over-ridden" in a polymorphic fashion: As the above table is a CAM (key-value store) it may be appropriate (faster, implementation-wise) to expand it as follows: - struct vectorised fp_vec[32], int_vec[32]; - - for (i = 0; i < len; i++) // from VLIW Format - tb = int_vec if CSRvec[i].type == 0 else fp_vec - idx = CSRvec[i].regkey // INT/FP src/dst reg in opcode - tb[idx].elwidth = CSRvec[i].elwidth - tb[idx].regidx = CSRvec[i].regidx // indirection - tb[idx].isvector = CSRvec[i].isvector // 0=scalar +[[!inline raw="yes" pages="simple_v_extension/reg_table" ]] ## Predication Table *NOTE: in prior versions of SV, this table used to be writable and -accessible via CSRs. It is now stored in the VLIW instruction format. +accessible via CSRs. It is now stored in the VBLOCK instruction format. The table does **not** apply to SVPrefix opcodes* The Predication Table is a key-value store indicating whether, if a @@ -586,7 +523,7 @@ in the instruction, due to the redirection through the lookup table. predication mask. * inv indicates that the predication mask bits are to be inverted prior to use *without* actually modifying the contents of the - registerfrom which those bits originated. + register from which those bits originated. * zeroing is either 1 or 0, and if set to 1, the operation must place zeros in any element position where the predication mask is set to zero. If zeroing is set to 0, unpredicated elements *must* @@ -601,50 +538,22 @@ in the instruction, due to the redirection through the lookup table. The handling of each (trap or conditional test) is slightly different: see Instruction sections for further details -16 bit format: - -| PrCSR | (15..11) | 10 | 9 | 8 | (7..1) | 0 | -| ----- | - | - | - | - | ------- | ------- | -| 0 | predkey | zero0 | inv0 | i/f | regidx | ffirst0 | -| 1 | predkey | zero1 | inv1 | i/f | regidx | ffirst1 | -| 2 | predkey | zero2 | inv2 | i/f | regidx | ffirst2 | -| 3 | predkey | zero3 | inv3 | i/f | regidx | ffirst3 | - -8 bit format: - -| PrCSR | 7 | 6 | 5 | (4..0) | -| ----- | - | - | - | ------- | -| 0 | zero0 | inv0 | i/f | regnum | +[[!inline raw="yes" pages="simple_v_extension/pred_table_format" ]] The 8 bit format is a compact and less expressive variant of the full -16 bit format. Using the 8 bit formatis very different: the predicate +16 bit format. Using the 8 bit format is very different: the predicate register to use is implicit, and numbering begins inplicitly from x9. The regnum is still used to "activate" predication, in the same fashion as described above. The 16 bit Predication CSR Table is a key-value store, so implementation-wise it will be faster to turn the table around (maintain -topologically equivalent state): - - struct pred { - bool zero; - bool inv; - bool ffirst; - bool enabled; - int predidx; // redirection: actual int register to use - } - - struct pred fp_pred_reg[32]; // 64 in future (bank=1) - struct pred int_pred_reg[32]; // 64 in future (bank=1) - - for (i = 0; i < 16; i++) - tb = int_pred_reg if CSRpred[i].type == 0 else fp_pred_reg; - idx = CSRpred[i].regidx - tb[idx].zero = CSRpred[i].zero - tb[idx].inv = CSRpred[i].inv - tb[idx].ffirst = CSRpred[i].ffirst - tb[idx].predidx = CSRpred[i].predidx - tb[idx].enabled = true +topologically equivalent state). Opportunities then exist to access +registers in unary form instead of binary, saving gates and power by +only activating "redirection" with a single AND gate, instead of +multiple multi-bit XORs (a CAM): + +[[!inline raw="yes" pages="simple_v_extension/pred_table" ]] So when an operation is to be predicated, it is the internal state that is used. In Section 6.4.2 of Hwacha's Manual (EECS-2015-262) the following @@ -669,9 +578,12 @@ as follows. for (int i=0; i - -(Note: both the REMAP and SHAPE sections are best read after the - rest of the document has been read) - -There is one 32-bit CSR which may be used to indicate which registers, -if used in any operation, must be "reshaped" (re-mapped) from a linear -form to a 2D or 3D transposed form, or "offset" to permit arbitrary -access to elements within a register. - -The 32-bit REMAP CSR may reshape up to 3 registers: - -| 29..28 | 27..26 | 25..24 | 23 | 22..16 | 15 | 14..8 | 7 | 6..0 | -| ------ | ------ | ------ | -- | ------- | -- | ------- | -- | ------- | -| shape2 | shape1 | shape0 | 0 | regidx2 | 0 | regidx1 | 0 | regidx0 | - -regidx0-2 refer not to the Register CSR CAM entry but to the underlying -*real* register (see regidx, the value) and consequently is 7-bits wide. -When set to zero (referring to x0), clearly reshaping x0 is pointless, -so is used to indicate "disabled". -shape0-2 refers to one of three SHAPE CSRs. A value of 0x3 is reserved. -Bits 7, 15, 23, 30 and 31 are also reserved, and must be set to zero. - -It is anticipated that these specialist CSRs not be very often used. -Unlike the CSR Register and Predication tables, the REMAP CSRs use -the full 7-bit regidx so that they can be set once and left alone, -whilst the CSR Register entries pointing to them are disabled, instead. - -## SHAPE 1D/2D/3D vector-matrix remapping CSRs - -(Note: both the REMAP and SHAPE sections are best read after the - rest of the document has been read) - -There are three "shape" CSRs, SHAPE0, SHAPE1, SHAPE2, 32-bits in each, -which have the same format. When each SHAPE CSR is set entirely to zeros, -remapping is disabled: the register's elements are a linear (1D) vector. - -| 26..24 | 23 | 22..16 | 15 | 14..8 | 7 | 6..0 | -| ------- | -- | ------- | -- | ------- | -- | ------- | -| permute | offs[2] | zdimsz | offs[1] | ydimsz | offs[0] | xdimsz | - -offs is a 3-bit field, spread out across bits 7, 15 and 23, which -is added to the element index during the loop calculation. - -xdimsz, ydimsz and zdimsz are offset by 1, such that a value of 0 indicates -that the array dimensionality for that dimension is 1. A value of xdimsz=2 -would indicate that in the first dimension there are 3 elements in the -array. The format of the array is therefore as follows: - - array[xdim+1][ydim+1][zdim+1] - -However whilst illustrative of the dimensionality, that does not take the -"permute" setting into account. "permute" may be any one of six values -(0-5, with values of 6 and 7 being reserved, and not legal). The table -below shows how the permutation dimensionality order works: - -| permute | order | array format | -| ------- | ----- | ------------------------ | -| 000 | 0,1,2 | (xdim+1)(ydim+1)(zdim+1) | -| 001 | 0,2,1 | (xdim+1)(zdim+1)(ydim+1) | -| 010 | 1,0,2 | (ydim+1)(xdim+1)(zdim+1) | -| 011 | 1,2,0 | (ydim+1)(zdim+1)(xdim+1) | -| 100 | 2,0,1 | (zdim+1)(xdim+1)(ydim+1) | -| 101 | 2,1,0 | (zdim+1)(ydim+1)(xdim+1) | - -In other words, the "permute" option changes the order in which -nested for-loops over the array would be done. The algorithm below -shows this more clearly, and may be executed as a python program: - - # mapidx = REMAP.shape2 - xdim = 3 # SHAPE[mapidx].xdim_sz+1 - ydim = 4 # SHAPE[mapidx].ydim_sz+1 - zdim = 5 # SHAPE[mapidx].zdim_sz+1 - - lims = [xdim, ydim, zdim] - idxs = [0,0,0] # starting indices - order = [1,0,2] # experiment with different permutations, here - offs = 0 # experiment with different offsets, here - - for idx in range(xdim * ydim * zdim): - new_idx = offs + idxs[0] + idxs[1] * xdim + idxs[2] * xdim * ydim - print new_idx, - for i in range(3): - idxs[order[i]] = idxs[order[i]] + 1 - if (idxs[order[i]] != lims[order[i]]): - break - print - idxs[order[i]] = 0 - -Here, it is assumed that this algorithm be run within all pseudo-code -throughout this document where a (parallelism) for-loop would normally -run from 0 to VL-1 to refer to contiguous register -elements; instead, where REMAP indicates to do so, the element index -is run through the above algorithm to work out the **actual** element -index, instead. Given that there are three possible SHAPE entries, up to -three separate registers in any given operation may be simultaneously -remapped: - - function op_add(rd, rs1, rs2) # add not VADD! - ... - ... -  for (i = 0; i < VL; i++) - xSTATE.srcoffs = i # save context - if (predval & 1< + +ffirst is a special data-dependent predicate mode. There are two +variants: one is for faults: typically for LOAD/STORE operations, +which may encounter end of page faults during a series of operations. +The other variant is comparisons such as FEQ (or the augmented behaviour +of Branch), and any operation that returns a result of zero (whether +integer or floating-point). In the FP case, this includes negative-zero. + +ffirst interacts with zero- and non-zero predication. In non-zeroing +mode, masked-out operations are simply excluded from testing (can never +fail). However for fail-comparisons (not faults) in zeroing mode, the +result will be zero: this *always* "fails", thus on the very first +masked-out element ffirst will always terminate. + +Note that ffirst mode works because the execution order must "appear" to be +(in "program order"). An in-order architecture must execute the element +operations in sequence, whilst an out-of-order architecture must *commit* +the element operations in sequence and cancel speculatively-executed +ones (giving the appearance of in-order execution). + +Note also, that if ffirst mode is needed without predication, a special +"always-on" Predicate Table Entry may be constructed by setting +inverse-on and using x0 as the predicate register. This +will have the effect of creating a mask of all ones, allowing ffirst +to be set. + +See [[appendix]] for more details on fail-on-first modes, as well as +pseudo-code, below. + +## REMAP and SHAPE CSRs + +See optional [[remap]] section. # Instruction Execution Order @@ -905,1393 +675,41 @@ to the **one** instruction. # Instructions -Despite being a 98% complete and accurate topological remap of RVV -concepts and functionality, no new instructions are needed. -Compared to RVV: *All* RVV instructions can be re-mapped, however xBitManip -becomes a critical dependency for efficient manipulation of predication -masks (as a bit-field). Despite the removal of all operations, -with the exception of CLIP and VSELECT.X -*all instructions from RVV Base are topologically re-mapped and retain their -complete functionality, intact*. Note that if RV64G ever had -a MV.X added as well as FCLIP, the full functionality of RVV-Base would -be obtained in SV. - -Three instructions, VSELECT, VCLIP and VCLIPI, do not have RV Standard -equivalents, so are left out of Simple-V. VSELECT could be included if -there existed a MV.X instruction in RV (MV.X is a hypothetical -non-immediate variant of MV that would allow another register to -specify which register was to be copied). Note that if any of these three -instructions are added to any given RV extension, their functionality -will be inherently parallelised. - -With some exceptions, where it does not make sense or is simply too -challenging, all RV-Base instructions are parallelised: - -* CSR instructions, whilst a case could be made for fast-polling of - a CSR into multiple registers, or for being able to copy multiple - contiguously addressed CSRs into contiguous registers, and so on, - are the fundamental core basis of SV. If parallelised, extreme - care would need to be taken. Additionally, CSR reads are done - using x0, and it is *really* inadviseable to tag x0. -* LUI, C.J, C.JR, WFI, AUIPC are not suitable for parallelising so are - left as scalar. -* LR/SC could hypothetically be parallelised however their purpose is - single (complex) atomic memory operations where the LR must be followed - up by a matching SC. A sequence of parallel LR instructions followed - by a sequence of parallel SC instructions therefore is guaranteed to - not be useful. Not least: the guarantees of a Multi-LR/SC - would be impossible to provide if emulated in a trap. -* EBREAK, NOP, FENCE and others do not use registers so are not inherently - paralleliseable anyway. - -All other operations using registers are automatically parallelised. -This includes AMOMAX, AMOSWAP and so on, where particular care and -attention must be paid. - -Example pseudo-code for an integer ADD operation (including scalar operations). -Floating-point uses fp csrs. - - function op_add(rd, rs1, rs2) # add not VADD! -  int i, id=0, irs1=0, irs2=0; -  predval = get_pred_val(FALSE, rd); -  rd = int_vec[rd ].isvector ? int_vec[rd ].regidx : rd; -  rs1 = int_vec[rs1].isvector ? int_vec[rs1].regidx : rs1; -  rs2 = int_vec[rs2].isvector ? int_vec[rs2].regidx : rs2; -  for (i = 0; i < VL; i++) - xSTATE.srcoffs = i # save context - if (predval & 1< - -Adding in support for SUBVL is a matter of adding in an extra inner -for-loop, where register src and dest are still incremented inside the -inner part. Not that the predication is still taken from the VL index. - -So whilst elements are indexed by "(i * SUBVL + s)", predicate bits are -indexed by "(i)" - - function op_add(rd, rs1, rs2) # add not VADD! -  int i, id=0, irs1=0, irs2=0; -  predval = get_pred_val(FALSE, rd); -  rd = int_vec[rd ].isvector ? int_vec[rd ].regidx : rd; -  rs1 = int_vec[rs1].isvector ? int_vec[rs1].regidx : rs1; -  rs2 = int_vec[rs2].isvector ? int_vec[rs2].regidx : rs2; -  for (i = 0; i < VL; i++) - xSTATE.srcoffs = i # save context - for (s = 0; s < SUBVL; s++) - xSTATE.ssvoffs = s # save context - if (predval & 1< - -Branch operations use standard RV opcodes that are reinterpreted to -be "predicate variants" in the instance where either of the two src -registers are marked as vectors (active=1, vector=1). - -Note that the predication register to use (if one is enabled) is taken from -the *first* src register, and that this is used, just as with predicated -arithmetic operations, to mask whether the comparison operations take -place or not. The target (destination) predication register -to use (if one is enabled) is taken from the *second* src register. - -If either of src1 or src2 are scalars (whether by there being no -CSR register entry or whether by the CSR entry specifically marking -the register as "scalar") the comparison goes ahead as vector-scalar -or scalar-vector. - -In instances where no vectorisation is detected on either src registers -the operation is treated as an absolutely standard scalar branch operation. -Where vectorisation is present on either or both src registers, the -branch may stil go ahead if any only if *all* tests succeed (i.e. excluding -those tests that are predicated out). - -Note that when zero-predication is enabled (from source rs1), -a cleared bit in the predicate indicates that the result -of the compare is set to "false", i.e. that the corresponding -destination bit (or result)) be set to zero. Contrast this with -when zeroing is not set: bits in the destination predicate are -only *set*; they are **not** cleared. This is important to appreciate, -as there may be an expectation that, going into the hardware-loop, -the destination predicate is always expected to be set to zero: -this is **not** the case. The destination predicate is only set -to zero if **zeroing** is enabled. - -Note that just as with the standard (scalar, non-predicated) branch -operations, BLE, BGT, BLEU and BTGU may be synthesised by inverting -src1 and src2. - -In Hwacha EECS-2015-262 Section 6.7.2 the following pseudocode is given -for predicated compare operations of function "cmp": +See [[appendix]] for specific cases where instruction behaviour is +augmented. A greatly simplified example is below. Note that this +is the ADD implementation, not a separate VADD instruction: - for (int i=0; i - -There is no MV instruction in RV however there is a C.MV instruction. -It is used for copying integer-to-integer registers (vectorised FMV -is used for copying floating-point). - -If either the source or the destination register are marked as vectors -C.MV is reinterpreted to be a vectorised (multi-register) predicated -move operation. The actual instruction's format does not change: - -[[!table data=""" -15 12 | 11 7 | 6 2 | 1 0 | -funct4 | rd | rs | op | -4 | 5 | 5 | 2 | -C.MV | dest | src | C0 | -"""]] - -A simplified version of the pseudocode for this operation is as follows: - - function op_mv(rd, rs) # MV not VMV! -  rd = int_csr[rd].active ? int_csr[rd].regidx : rd; -  rs = int_csr[rs].active ? int_csr[rs].regidx : rs; -  ps = get_pred_val(FALSE, rs); # predication on src -  pd = get_pred_val(FALSE, rd); # ... AND on dest -  for (int i = 0, int j = 0; i < VL && j < VL;): - if (int_csr[rs].isvec) while (!(ps & 1< - -An earlier draft of SV modified the behaviour of LOAD/STORE (modified -the interpretation of the instruction fields). This -actually undermined the fundamental principle of SV, namely that there -be no modifications to the scalar behaviour (except where absolutely -necessary), in order to simplify an implementor's task if considering -converting a pre-existing scalar design to support parallelism. - -So the original RISC-V scalar LOAD/STORE and LOAD-FP/STORE-FP functionality -do not change in SV, however just as with C.MV it is important to note -that dual-predication is possible. - -In vectorised architectures there are usually at least two different modes -for LOAD/STORE: - -* Read (or write for STORE) from sequential locations, where one - register specifies the address, and the one address is incremented - by a fixed amount. This is usually known as "Unit Stride" mode. -* Read (or write) from multiple indirected addresses, where the - vector elements each specify separate and distinct addresses. - -To support these different addressing modes, the CSR Register "isvector" -bit is used. So, for a LOAD, when the src register is set to -scalar, the LOADs are sequentially incremented by the src register -element width, and when the src register is set to "vector", the -elements are treated as indirection addresses. Simplified -pseudo-code would look like this: - - function op_ld(rd, rs) # LD not VLD! -  rdv = int_csr[rd].active ? int_csr[rd].regidx : rd; -  rsv = int_csr[rs].active ? int_csr[rs].regidx : rs; -  ps = get_pred_val(FALSE, rs); # predication on src -  pd = get_pred_val(FALSE, rd); # ... AND on dest -  for (int i = 0, int j = 0; i < VL && j < VL;): - if (int_csr[rs].isvec) while (!(ps & 1< - -C.LWSP / C.SWSP and floating-point etc. are also source-dest twin-predicated, -where it is implicit in C.LWSP/FLWSP etc. that x2 is the source register. -It is therefore possible to use predicated C.LWSP to efficiently -pop registers off the stack (by predicating x2 as the source), cherry-picking -which registers to store to (by predicating the destination). Likewise -for C.SWSP. In this way, LOAD/STORE-Multiple is efficiently achieved. - -The two modes ("unit stride" and multi-indirection) are still supported, -as with standard LD/ST. Essentially, the only difference is that the -use of x2 is hard-coded into the instruction. - -**Note**: it is still possible to redirect x2 to an alternative target -register. With care, this allows C.LWSP / C.SWSP (and C.FLWSP) to be used as -general-purpose LOAD/STORE operations. - -## Compressed LOAD / STORE Instructions - -Compressed LOAD and STORE are again exactly the same as scalar LOAD/STORE, -where the same rules apply and the same pseudo-code apply as for -non-compressed LOAD/STORE. Again: setting scalar or vector mode -on the src for LOAD and dest for STORE switches mode from "Unit Stride" -to "Multi-indirection", respectively. - -# Element bitwidth polymorphism - -Element bitwidth is best covered as its own special section, as it -is quite involved and applies uniformly across-the-board. SV restricts -bitwidth polymorphism to default, 8-bit, 16-bit and 32-bit. - -The effect of setting an element bitwidth is to re-cast each entry -in the register table, and for all memory operations involving -load/stores of certain specific sizes, to a completely different width. -Thus In c-style terms, on an RV64 architecture, effectively each register -now looks like this: - - typedef union { - uint8_t b[8]; - uint16_t s[4]; - uint32_t i[2]; - uint64_t l[1]; - } reg_t; - - // integer table: assume maximum SV 7-bit regfile size - reg_t int_regfile[128]; - -where the CSR Register table entry (not the instruction alone) determines -which of those union entries is to be used on each operation, and the -VL element offset in the hardware-loop specifies the index into each array. - -However a naive interpretation of the data structure above masks the -fact that setting VL greater than 8, for example, when the bitwidth is 8, -accessing one specific register "spills over" to the following parts of -the register file in a sequential fashion. So a much more accurate way -to reflect this would be: - - typedef union { - uint8_t actual_bytes[8]; // 8 for RV64, 4 for RV32, 16 for RV128 - uint8_t b[0]; // array of type uint8_t - uint16_t s[0]; - uint32_t i[0]; - uint64_t l[0]; - uint128_t d[0]; - } reg_t; - - reg_t int_regfile[128]; - -where when accessing any individual regfile[n].b entry it is permitted -(in c) to arbitrarily over-run the *declared* length of the array (zero), -and thus "overspill" to consecutive register file entries in a fashion -that is completely transparent to a greatly-simplified software / pseudo-code -representation. -It is however critical to note that it is clearly the responsibility of -the implementor to ensure that, towards the end of the register file, -an exception is thrown if attempts to access beyond the "real" register -bytes is ever attempted. - -Now we may modify pseudo-code an operation where all element bitwidths have -been set to the same size, where this pseudo-code is otherwise identical -to its "non" polymorphic versions (above): - - function op_add(rd, rs1, rs2) # add not VADD! - ... - ... -  for (i = 0; i < VL; i++) - ... - ... - // TODO, calculate if over-run occurs, for each elwidth - if (elwidth == 8) { -    int_regfile[rd].b[id] <= int_regfile[rs1].i[irs1] + -     int_regfile[rs2].i[irs2]; - } else if elwidth == 16 { -    int_regfile[rd].s[id] <= int_regfile[rs1].s[irs1] + -     int_regfile[rs2].s[irs2]; - } else if elwidth == 32 { -    int_regfile[rd].i[id] <= int_regfile[rs1].i[irs1] + -     int_regfile[rs2].i[irs2]; - } else { // elwidth == 64 -    int_regfile[rd].l[id] <= int_regfile[rs1].l[irs1] + -     int_regfile[rs2].l[irs2]; - } - ... - ... - -So here we can see clearly: for 8-bit entries rd, rs1 and rs2 (and registers -following sequentially on respectively from the same) are "type-cast" -to 8-bit; for 16-bit entries likewise and so on. - -However that only covers the case where the element widths are the same. -Where the element widths are different, the following algorithm applies: - -* Analyse the bitwidth of all source operands and work out the - maximum. Record this as "maxsrcbitwidth" -* If any given source operand requires sign-extension or zero-extension - (ldb, div, rem, mul, sll, srl, sra etc.), instead of mandatory 32-bit - sign-extension / zero-extension or whatever is specified in the standard - RV specification, **change** that to sign-extending from the respective - individual source operand's bitwidth from the CSR table out to - "maxsrcbitwidth" (previously calculated), instead. -* Following separate and distinct (optional) sign/zero-extension of all - source operands as specifically required for that operation, carry out the - operation at "maxsrcbitwidth". (Note that in the case of LOAD/STORE or MV - this may be a "null" (copy) operation, and that with FCVT, the changes - to the source and destination bitwidths may also turn FVCT effectively - into a copy). -* If the destination operand requires sign-extension or zero-extension, - instead of a mandatory fixed size (typically 32-bit for arithmetic, - for subw for example, and otherwise various: 8-bit for sb, 16-bit for sw - etc.), overload the RV specification with the bitwidth from the - destination register's elwidth entry. -* Finally, store the (optionally) sign/zero-extended value into its - destination: memory for sb/sw etc., or an offset section of the register - file for an arithmetic operation. - -In this way, polymorphic bitwidths are achieved without requiring a -massive 64-way permutation of calculations **per opcode**, for example -(4 possible rs1 bitwidths times 4 possible rs2 bitwidths times 4 possible -rd bitwidths). The pseudo-code is therefore as follows: - - typedef union { - uint8_t b; - uint16_t s; - uint32_t i; - uint64_t l; - } el_reg_t; - - bw(elwidth): - if elwidth == 0: - return xlen - if elwidth == 1: - return xlen / 2 - if elwidth == 2: - return xlen * 2 - // elwidth == 3: - return 8 - - get_max_elwidth(rs1, rs2): - return max(bw(int_csr[rs1].elwidth), # default (XLEN) if not set - bw(int_csr[rs2].elwidth)) # again XLEN if no entry - - get_polymorphed_reg(reg, bitwidth, offset): - el_reg_t res; - res.l = 0; // TODO: going to need sign-extending / zero-extending - if bitwidth == 8: - reg.b = int_regfile[reg].b[offset] - elif bitwidth == 16: - reg.s = int_regfile[reg].s[offset] - elif bitwidth == 32: - reg.i = int_regfile[reg].i[offset] - elif bitwidth == 64: - reg.l = int_regfile[reg].l[offset] - return res - - set_polymorphed_reg(reg, bitwidth, offset, val): - if (!int_csr[reg].isvec): - # sign/zero-extend depending on opcode requirements, from - # the reg's bitwidth out to the full bitwidth of the regfile - val = sign_or_zero_extend(val, bitwidth, xlen) - int_regfile[reg].l[0] = val - elif bitwidth == 8: - int_regfile[reg].b[offset] = val - elif bitwidth == 16: - int_regfile[reg].s[offset] = val - elif bitwidth == 32: - int_regfile[reg].i[offset] = val - elif bitwidth == 64: - int_regfile[reg].l[offset] = val - - maxsrcwid = get_max_elwidth(rs1, rs2) # source element width(s) - destwid = int_csr[rs1].elwidth # destination element width -  for (i = 0; i < VL; i++) - if (predval & 1< - -Polymorphic element widths in vectorised form means that the data -being loaded (or stored) across multiple registers needs to be treated -(reinterpreted) as a contiguous stream of elwidth-wide items, where -the source register's element width is **independent** from the destination's. - -This makes for a slightly more complex algorithm when using indirection -on the "addressed" register (source for LOAD and destination for STORE), -particularly given that the LOAD/STORE instruction provides important -information about the width of the data to be reinterpreted. - -Let's illustrate the "load" part, where the pseudo-code for elwidth=default -was as follows, and i is the loop from 0 to VL-1: - - srcbase = ireg[rs+i]; - return mem[srcbase + imm]; // returns XLEN bits - -Instead, when elwidth != default, for a LW (32-bit LOAD), elwidth-wide -chunks are taken from the source memory location addressed by the current -indexed source address register, and only when a full 32-bits-worth -are taken will the index be moved on to the next contiguous source -address register: - - bitwidth = bw(elwidth); // source elwidth from CSR reg entry - elsperblock = 32 / bitwidth // 1 if bw=32, 2 if bw=16, 4 if bw=8 - srcbase = ireg[rs+i/(elsperblock)]; // integer divide - offs = i % elsperblock; // modulo - return &mem[srcbase + imm + offs]; // re-cast to uint8_t*, uint16_t* etc. - -Note that the constant "32" above is replaced by 8 for LB, 16 for LH, 64 for LD -and 128 for LQ. - -The principle is basically exactly the same as if the srcbase were pointing -at the memory of the *register* file: memory is re-interpreted as containing -groups of elwidth-wide discrete elements. - -When storing the result from a load, it's important to respect the fact -that the destination register has its *own separate element width*. Thus, -when each element is loaded (at the source element width), any sign-extension -or zero-extension (or truncation) needs to be done to the *destination* -bitwidth. Also, the storing has the exact same analogous algorithm as -above, where in fact it is just the set\_polymorphed\_reg pseudocode -(completely unchanged) used above. - -One issue remains: when the source element width is **greater** than -the width of the operation, it is obvious that a single LB for example -cannot possibly obtain 16-bit-wide data. This condition may be detected -where, when using integer divide, elsperblock (the width of the LOAD -divided by the bitwidth of the element) is zero. - -The issue is "fixed" by ensuring that elsperblock is a minimum of 1: - - elsperblock = min(1, LD_OP_BITWIDTH / element_bitwidth) - -The elements, if the element bitwidth is larger than the LD operation's -size, will then be sign/zero-extended to the full LD operation size, as -specified by the LOAD (LDU instead of LD, LBU instead of LB), before -being passed on to the second phase. - -As LOAD/STORE may be twin-predicated, it is important to note that -the rules on twin predication still apply, except where in previous -pseudo-code (elwidth=default for both source and target) it was -the *registers* that the predication was applied to, it is now the -**elements** that the predication is applied to. - -Thus the full pseudocode for all LD operations may be written out -as follows: - - function LBU(rd, rs): - load_elwidthed(rd, rs, 8, true) - function LB(rd, rs): - load_elwidthed(rd, rs, 8, false) - function LH(rd, rs): - load_elwidthed(rd, rs, 16, false) - ... - ... - function LQ(rd, rs): - load_elwidthed(rd, rs, 128, false) - - # returns 1 byte of data when opwidth=8, 2 bytes when opwidth=16.. - function load_memory(rs, imm, i, opwidth): - elwidth = int_csr[rs].elwidth - bitwidth = bw(elwidth); - elsperblock = min(1, opwidth / bitwidth) - srcbase = ireg[rs+i/(elsperblock)]; - offs = i % elsperblock; - return mem[srcbase + imm + offs]; # 1/2/4/8/16 bytes - - function load_elwidthed(rd, rs, opwidth, unsigned): - destwid = int_csr[rd].elwidth # destination element width -  rd = int_csr[rd].active ? int_csr[rd].regidx : rd; -  rs = int_csr[rs].active ? int_csr[rs].regidx : rs; -  ps = get_pred_val(FALSE, rs); # predication on src -  pd = get_pred_val(FALSE, rd); # ... AND on dest -  for (int i = 0, int j = 0; i < VL && j < VL;): - if (int_csr[rs].isvec) while (!(ps & 1<