How does DIVW handle the upper 32 bits?
Source upper halves are ignored; quotient bit 31 is sign-extended through the destination upper half.
Divide lower 32 bits of rs1 by lower 32 bits of rs2 (signed), sign-extend 32-bit quotient to 64 bits
DIVW is an RV64-only signed division instruction that divides the lower 32 bits of rs1 by the lower 32 bits of rs2 (both signed), rounds toward zero, and sign-extends the 32-bit quotient to 64 bits. Division by zero and overflow behavior mirrors DIV (at 32-bit width).
Starts with machine-code field decoding, then shows operand reads, instruction-specific execution, and ISA-visible state update.
This example uses fixed initial register values and PC=0x2000; instruction fetch succeeds, with no asynchronous interrupt or extra extension checks. Exception branches stop ordinary commit; post-trap PC and handler state are EEI-dependent.
This selector chooses specification-defined division-result branches. Division presets set the displayed t1/t2 initial values; editing a source register restores normal mode. It is not a trap or performance model.
The machine code is split by the current instruction format; the animation starts from encoding/decode.
This animation shows ISA-visible decode and state changes, not any specific CPU pipeline, cache, prediction, or timing implementation.
DIVW divides the low 32 bits of both sources as signed integers, then sign-extends the 32-bit quotient to 64 bits. Source upper halves do not participate.
Understand this scenario with real code like «divw x10, x11, x12 # quotient uses signed low 32-bit sources; sign-extend to 64 bits».
Source upper halves are ignored; quotient bit 31 is sign-extended through the destination upper half.