Does VMFEQ.VF write ordinary vector elements?
Each active lane writes one Boolean bit to mask destination vd, not an ordinary vector element.
Perform lane-wise FP equality comparison and write Boolean results to mask destination vd.
VMFEQ.VF is a RISC-V V-extension vector floating-point compare instruction. For active elements within vl, it evaluates vs2[i] == scalar FP register f[rs1] and writes each Boolean result to the corresponding bit of mask destination vd. vm=0 uses v0.t as the execution mask and vm=1 is unmasked; NaN handling, invalid exception flags, and tail-agnostic result rules follow the official RVV FP compare semantics.
Decode the OP-V encoding and execute lane-wise FP compare: each active lane evaluates vs2[i] == f[rs1] and writes the Boolean result to the destination mask bit.
lane 0: 1 == 1.5 -> mask=0
This lane follows the current-step highlight; the remaining lane results appear below.
V-extension FP instructions use the OP-V major opcode, with funct6, source registers, vm, funct3, vd, and opcode fields.
The teaching context fixes VLEN=4096, LMUL=m1, vstart=0, valid vtype, enabled VS/FS, FLEN=64, and valid frm. The selected binary32/64 is supported; SEW=32 scalars assume valid NaN-boxing. vd is a single mask register and may overlap v0 or start at vs2; masked vs2 cannot be v0 (different EEWs). Different-EEW overlap of vd with vs2 also forces mask-agnostic, regardless of vma. Inactive bits have no definite displayed value; mask tails are always agnostic. VL=0 updates no destination bits. The NV indicator shows what this execution raises without clearing old fflags. Rounding selection does not affect equality, but invalid frm use remains reserved. Steps are not processor cycles.
SEW=32 / binary32 demo accepts finite values or full IEEE hexadecimal bit patterns, so qNaN/sNaN can be checked. Active lanes write 0/1 destination mask bits and show this execution's fflags.NV when required. Officially, VMFEQ/VMFNE raise invalid only for signaling NaN inputs; VMFLT/VMFLE/VMFGT/VMFGE raise invalid for signaling or quiet NaN inputs; VMFNE writes 1 when either operand is NaN, while the other compares write 0.VMFEQ.VF compares active vs2[i] with scalar f[rs1] for equality, writing one Boolean bit to mask destination vd.
vd is a single mask destination, one bit per element; rs1 selects an f register, not an integer register. Active elements write vs2[i]==f[rs1]; +0 equals -0, NaNs produce 0, and only active sNaN inputs raise NV.
32-bit OP-V: opcode=1010111, funct6=011000, funct3=101. Omit v0.t for vm=1 or include it for vm=0.
The mask destination may overlap v0. Reading the same register as mask and data with different EEWs is reserved. With LMUL=m1, vd may start at vs2.
Require valid vtype, enabled VS/FS, supported FP formats, and valid frm. With FLEN>SEW an invalid NaN box supplies canonical NaN; FLEN<SEW is reserved. Equality does not round by frm, but invalid frm use remains reserved.
Body is vstart≤i<vl; prestart is unchanged, inactive bits follow vma and mask tails are always agnostic. VL=0 or vstart≥vl updates no destination, including tails. The animation fixes LMUL=m1, VLEN=4096, vstart=0; steps are not processor cycles.
Assume enabled V/VS, supported e32,m1, VLEN≥128, vl=4, vstart=0, ta/ma, and initialized sources; FS enabled, frm=RNE, FLEN=64, f0 validly NaN-boxed, unmasked. v2=[1.5,-0,2,1.5], f0=1.5 → v1.mask[0..3]=[1,0,0,1], NV unchanged. Tails are not guaranteed zero; mask destinations are always tail-agnostic.
Assume enabled V/VS, supported e32,m1, VLEN≥128, vl=4, vstart=0, ta/ma, and initialized sources; FS enabled, frm=RNE, FLEN=64, f0 validly NaN-boxed, unmasked. v2=[1.5,-0,2,1.5], f0=1.5 → v1.mask[0..3]=[1,0,0,1], NV unchanged. Tails are not guaranteed zero; mask destinations are always tail-agnostic.
Assume enabled V/VS, supported e32,m1, VLEN≥128, vl=4, vstart=0, ta/ma, and initialized sources; FS enabled, frm=RNE, FLEN=64, f0 validly NaN-boxed, unmasked. v2=[1.5,-0,2,1.5], f0=1.5 → v1.mask[0..3]=[1,0,0,1], NV unchanged. Tails are not guaranteed zero; mask destinations are always tail-agnostic.
Assume enabled V/VS, supported e32,m1, VLEN≥128, vl=4, vstart=0, ta/ma, and initialized sources; FS enabled, frm=RNE, FLEN=64, f0 validly NaN-boxed, unmasked. v2=[1.5,-0,2,1.5], f0=1.5 → v1.mask[0..3]=[1,0,0,1], NV unchanged. Tails are not guaranteed zero; mask destinations are always tail-agnostic.
Each active lane writes one Boolean bit to mask destination vd, not an ordinary vector element.
Yes. Mask-producing compares may overlap vd and source mask v0; ordinary masked vector instructions may not.
NaN comparisons write 0; only signaling NaNs raise invalid.