What format does VMSLT.VX produce?
One mask bit per active element: true writes 1, false writes 0. The result is not a SEW-wide integer vector.
VMSLT.VX performs element-wise signed less-than scalar comparison and writes active-element Boolean results to the destination mask.
VMSLT.VX is a RISC-V V-extension vector-scalar integer predicate-generation instruction. For each active body element (vstart <= i < vl), it compares vs2[i] with x[rs1]; vm=1 processes all body elements, while vm=0 processes only elements selected by v0.t. The result is written to vd in mask-register layout, one bit per element index.
Starts from OP-V encoding, then shows how signed integer less than with scalar comparison reads active elements and produces a one-bit-per-element predicate mask.
Fixed legal teaching context: VLEN=4096 bits, LMUL=m1, and vstart=0; every selectable VL is within VLMAX=128 for the current SEW.
Require valid vtype, enabled VS, and supported SEW. The destination may be v0 and, with LMUL=m1, may equal a data source. Equal data sources require equal elements; under v0.t, v0 cannot also be read as SEW data. Result tails are always agnostic; masked-off values follow vma. VL=0 updates nothing, including tails.
Destination overlap with a SEW data source forces ma/ta; x0/zero is always 0. Switching XLEN keeps low bits and zero-pads a valid raw pattern to the new width. Steps are teaching stages, not processor cycles.
This animation shows only the ISA-visible comparison, execution-mask, and destination-mask writeback relationship with vstart fixed at 0; inactive and tail elements are not simulated as fixed data values. For .vx, the selectable SEW values (8/16/32) do not exceed XLEN, so the model first takes the low SEW bits of x[rs1] and then applies this instruction's signed or unsigned relation.
VMSLT.VX does not write an ordinary integer vector; it writes each active element's signed less-than scalar comparison result as one bit of the destination mask. The animation starts from OP-V encoding fields, decodes the vector-scalar operands, then shows per-lane comparison and vd.mask writeback.
Syntax: vmslt.vx vd, vs2, rs1[, v0.t]; omit v0.t for vm=1, include it for vm=0. vd is one mask register: bit i corresponds to element i, independent of SEW/LMUL.
32-bit OP-V: opcode=1010111, funct6=011011, funct3=100 (OPIVX).
Active elements compare vs2[i] < scalar in two’s-complement signed order: true writes 1, false 0. XLEN>SEW uses low SEW scalar bits; XLEN<SEW sign-extends; x0 is always 0.
vd may be v0. Different-EEW destination/source overlap must start at the source group’s lowest register and forces ma/ta. With vm=0, v0 cannot also supply SEW data.
Require RV32/RV64 V 1.0, enabled VS, valid vtype and supported SEW; body is vstart≤i<vl and prestart is unchanged. Inactive follows vma; mask tails are always agnostic. vl=0 or vstart≥vl updates no destination bits, including tails. The animation fixes m1, VLEN=4096, vstart=0 and shows body elements only; steps are not processor cycles.
Assume RV32/RV64 V 1.0, enabled VS, valid e32,m1, VLEN≥128, vl=4, vstart=0, and initialized sources; the example is unmasked. v2=[-1,2,7,9], x11=7 → v1.mask[0..3]=[1,1,0,0]. Only mask bits are written; tails are always agnostic without assumed zeroing.
Assume RV32/RV64 V 1.0, enabled VS, valid e32,m1, VLEN≥128, vl=4, vstart=0, and initialized sources; the example is unmasked. v2=[-1,2,7,9], x11=7 → v1.mask[0..3]=[1,1,0,0]. Only mask bits are written; tails are always agnostic without assumed zeroing.
One mask bit per active element: true writes 1, false writes 0. The result is not a SEW-wide integer vector.
Each active element compares vs2[i] with the same scalar in signed order. Convert x[rs1] to SEW first: low bits if XLEN>SEW, sign-extension if XLEN<SEW; x0 is 0.
No. vm selects active body elements; it does not change the comparison relation.