Does FSQ take the address from an FP register?
No. The address base comes from integer register rs1; FP register rs2 only supplies the data bit pattern to store.
Store a 128-bit quad-precision bit pattern from an FP register to memory.
FSQ uses the S-type STORE-FP encoding to store the 128-bit quad-precision floating-point bit pattern from floating-point register f[rs2] to the effective address x[rs1] plus a signed 12-bit byte offset. The store writes the format-width bits and performs no FP rounding, format conversion, or NaN payload canonicalization. The official Q extension guarantees FSQ access atomicity only when the effective address is naturally aligned and XLEN=128; misaligned access is constrained by the execution environment.
Shows the Q-extension FP store flow: decode the S-type encoding, form the address from an integer base plus a 12-bit offset, and transfer a 128-bit FP bit pattern.
The word is split as a S-type instruction; FP memory access is not an OP-FP arithmetic encoding.
FSQ transfers a 128-bit quad-precision bit pattern; the official Q extension guarantees access atomicity only for naturally aligned effective addresses when XLEN=128.
This animation shows only Q-extension FP load/store ISA-visible address calculation and bit-pattern transfer; it does not model caches, buses, trap handlers, FPU pipelines, or microarchitectural timing.
FSQ is the Q-extension quad-precision floating-point store. It computes the address from an integer base and a 12-bit byte offset, then writes the 128-bit quad-precision bit pattern from f[rs2] to memory; it is not an FP operation and has no rm rounding step.
Understand this scenario with real code like «fsq f0, 0(x10) # store quad to [x10+0]».
Understand this scenario with real code like «fsq f0, 0(x10) # store quad to [x10+0]».
No. The address base comes from integer register rs1; FP register rs2 only supplies the data bit pattern to store.
No. FSQ is a bit-pattern store and performs no FP arithmetic or rounding, so it does not set floating-point exception flags by ISA-visible semantics.