-
Notifications
You must be signed in to change notification settings - Fork 167
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Refactor floating point vector instructions and utilities into separa…
…te files In addition to good software engineering practices, this also allows importing only the required files when floating point operations are not supported (for example, the file is commented out in https://github.com/microsoft/cheriot-sail/blob/main/Makefile#L49).
- Loading branch information
Showing
7 changed files
with
940 additions
and
902 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,127 @@ | ||
| /*=======================================================================================*/ | ||
| /* This Sail RISC-V architecture model, comprising all files and */ | ||
| /* directories except where otherwise noted is subject the BSD */ | ||
| /* two-clause license in the LICENSE file. */ | ||
| /* */ | ||
| /* SPDX-License-Identifier: BSD-2-Clause */ | ||
| /*=======================================================================================*/ | ||
|
|
||
| /* ******************************************************************************* */ | ||
| /* This file implements part of the vector extension. */ | ||
| /* Chapter 14: Vector Reduction Instructions */ | ||
| /* ******************************************************************************* */ | ||
|
|
||
| /* ********************** OPFVV (Floating-Point Reduction) *********************** */ | ||
| union clause ast = RFVVTYPE : (rfvvfunct6, bits(1), regidx, regidx, regidx) | ||
|
|
||
| mapping encdec_rfvvfunct6 : rfvvfunct6 <-> bits(6) = { | ||
| FVV_VFREDOSUM <-> 0b000011, | ||
| FVV_VFREDUSUM <-> 0b000001, | ||
| FVV_VFREDMAX <-> 0b000111, | ||
| FVV_VFREDMIN <-> 0b000101, | ||
| FVV_VFWREDOSUM <-> 0b110011, | ||
| FVV_VFWREDUSUM <-> 0b110001 | ||
| } | ||
|
|
||
| mapping clause encdec = RFVVTYPE(funct6, vm, vs2, vs1, vd) if haveVExt() | ||
| <-> encdec_rfvvfunct6(funct6) @ vm @ vs2 @ vs1 @ 0b001 @ vd @ 0b1010111 if haveVExt() | ||
|
|
||
| val process_rfvv_single: forall 'n 'm 'p, 'n >= 0 & 'm in {8, 16, 32, 64}. (rfvvfunct6, bits(1), regidx, regidx, regidx, int('n), int('m), int('p)) -> Retired | ||
| function process_rfvv_single(funct6, vm, vs2, vs1, vd, num_elem_vs, SEW, LMUL_pow) = { | ||
| let rm_3b = fcsr[FRM]; | ||
| let num_elem_vd = get_num_elem(0, SEW); /* vd regardless of LMUL setting */ | ||
|
|
||
| if illegal_fp_reduction(SEW, rm_3b) then { handle_illegal(); return RETIRE_FAIL }; | ||
| assert(SEW != 8); | ||
|
|
||
| if unsigned(vl) == 0 then return RETIRE_SUCCESS; /* if vl=0, no operation is performed */ | ||
|
|
||
| let 'n = num_elem_vs; | ||
| let 'd = num_elem_vd; | ||
| let 'm = SEW; | ||
|
|
||
| let vm_val : vector('n, dec, bool) = read_vmask(num_elem_vs, vm, 0b00000); | ||
| let vd_val : vector('d, dec, bits('m)) = read_vreg(num_elem_vd, SEW, 0, vd); | ||
| let vs2_val : vector('n, dec, bits('m)) = read_vreg(num_elem_vs, SEW, LMUL_pow, vs2); | ||
| let mask : vector('n, dec, bool) = init_masked_source(num_elem_vs, LMUL_pow, vm_val); | ||
|
|
||
| sum : bits('m) = read_single_element(SEW, 0, vs1); /* vs1 regardless of LMUL setting */ | ||
| foreach (i from 0 to (num_elem_vs - 1)) { | ||
| if mask[i] then { | ||
| sum = match funct6 { | ||
| /* currently ordered/unordered sum reductions do the same operations */ | ||
| FVV_VFREDOSUM => fp_add(rm_3b, sum, vs2_val[i]), | ||
| FVV_VFREDUSUM => fp_add(rm_3b, sum, vs2_val[i]), | ||
| FVV_VFREDMAX => fp_max(sum, vs2_val[i]), | ||
| FVV_VFREDMIN => fp_min(sum, vs2_val[i]), | ||
| _ => internal_error(__FILE__, __LINE__, "Widening op unexpected") | ||
| } | ||
| } | ||
| }; | ||
|
|
||
| write_single_element(SEW, 0, vd, sum); | ||
| /* other elements in vd are treated as tail elements, currently remain unchanged */ | ||
| /* TODO: configuration support for agnostic behavior */ | ||
| vstart = zeros(); | ||
| RETIRE_SUCCESS | ||
| } | ||
|
|
||
| val process_rfvv_widen: forall 'n 'm 'p, 'n >= 0 & 'm in {8, 16, 32, 64}. (rfvvfunct6, bits(1), regidx, regidx, regidx, int('n), int('m), int('p)) -> Retired | ||
| function process_rfvv_widen(funct6, vm, vs2, vs1, vd, num_elem_vs, SEW, LMUL_pow) = { | ||
| let rm_3b = fcsr[FRM]; | ||
| let SEW_widen = SEW * 2; | ||
| let LMUL_pow_widen = LMUL_pow + 1; | ||
| let num_elem_vd = get_num_elem(0, SEW_widen); /* vd regardless of LMUL setting */ | ||
|
|
||
| if illegal_fp_reduction_widen(SEW, rm_3b, SEW_widen, LMUL_pow_widen) then { handle_illegal(); return RETIRE_FAIL }; | ||
| assert(SEW >= 16 & SEW_widen <= 64); | ||
|
|
||
| if unsigned(vl) == 0 then return RETIRE_SUCCESS; /* if vl=0, no operation is performed */ | ||
|
|
||
| let 'n = num_elem_vs; | ||
| let 'd = num_elem_vd; | ||
| let 'm = SEW; | ||
| let 'o = SEW_widen; | ||
|
|
||
| let vm_val : vector('n, dec, bool) = read_vmask(num_elem_vs, vm, 0b00000); | ||
| let vd_val : vector('d, dec, bits('o)) = read_vreg(num_elem_vd, SEW_widen, 0, vd); | ||
| let vs2_val : vector('n, dec, bits('m)) = read_vreg(num_elem_vs, SEW, LMUL_pow, vs2); | ||
| let mask : vector('n, dec, bool) = init_masked_source(num_elem_vs, LMUL_pow, vm_val); | ||
|
|
||
| sum : bits('o) = read_single_element(SEW_widen, 0, vs1); /* vs1 regardless of LMUL setting */ | ||
| foreach (i from 0 to (num_elem_vs - 1)) { | ||
| if mask[i] then { | ||
| /* currently ordered/unordered sum reductions do the same operations */ | ||
| sum = fp_add(rm_3b, sum, fp_widen(vs2_val[i])) | ||
| } | ||
| }; | ||
|
|
||
| write_single_element(SEW_widen, 0, vd, sum); | ||
| /* other elements in vd are treated as tail elements, currently remain unchanged */ | ||
| /* TODO: configuration support for agnostic behavior */ | ||
| vstart = zeros(); | ||
| RETIRE_SUCCESS | ||
| } | ||
|
|
||
| function clause execute(RFVVTYPE(funct6, vm, vs2, vs1, vd)) = { | ||
| let SEW = get_sew(); | ||
| let LMUL_pow = get_lmul_pow(); | ||
| let num_elem_vs = get_num_elem(LMUL_pow, SEW); | ||
|
|
||
| if funct6 == FVV_VFWREDOSUM | funct6 == FVV_VFWREDUSUM then | ||
| process_rfvv_widen(funct6, vm, vs2, vs1, vd, num_elem_vs, SEW, LMUL_pow) | ||
| else | ||
| process_rfvv_single(funct6, vm, vs2, vs1, vd, num_elem_vs, SEW, LMUL_pow) | ||
| } | ||
|
|
||
| mapping rfvvtype_mnemonic : rfvvfunct6 <-> string = { | ||
| FVV_VFREDOSUM <-> "vfredosum.vs", | ||
| FVV_VFREDUSUM <-> "vfredusum.vs", | ||
| FVV_VFREDMAX <-> "vfredmax.vs", | ||
| FVV_VFREDMIN <-> "vfredmin.vs", | ||
| FVV_VFWREDOSUM <-> "vfwredosum.vs", | ||
| FVV_VFWREDUSUM <-> "vfwredusum.vs" | ||
| } | ||
|
|
||
| mapping clause assembly = RFVVTYPE(funct6, vm, vs2, vs1, vd) | ||
| <-> rfvvtype_mnemonic(funct6) ^ spc() ^ vreg_name(vd) ^ sep() ^ vreg_name(vs2) ^ sep() ^ vreg_name(vs1) ^ maybe_vmask(vm) |
Oops, something went wrong.