chore: prepare release v0.36.0
Test / test (push) Successful in 32s
Release / build (amd64, freebsd) (push) Successful in 52s
Release / build (amd64, linux) (push) Successful in 13s
Release / build (arm64, freebsd) (push) Successful in 51s
Release / build (arm64, linux) (push) Successful in 29s
Release / build (loong64, linux) (push) Successful in 29s
Release / build (riscv64, linux) (push) Successful in 31s
Release / release (push) Successful in 10s

Assisted-by: GLM 5.3 Flash
This commit is contained in:
petrbalvin committed 2026-10-07 22:37:42 +02:00
1 parent e5df0a9d84
commit a77dd12d2d
13 files changed
+217 -77

No files matched your search

+6
View File
@@ -41,6 +41,12 @@ R13` is `add.d R13, R12, R11`, and the two-operand form
- Jump and branch instructions keep the GNU order: `BEQ R0, R4, label1`.
- The bitfield family is `BSTRINSW`, `BSTRINSV`, `BSTRPICKW`, `BSTRPICKV`
`$<msb>, <Rj>, $<lsb>, <Rd>`.
- **The register-pair spelling** `R4:R5` names two registers in one
operand, the way the toolchain's pair syntax does: the colon splits the
operand and the halves swap, so `MULV R4:R5, R6` encodes exactly as
`MULV R5, R4, R6`. Any instruction shape accepts the spelling, decided
afterwards by ordinary operand matching, and a malformed pair fails with
the toolchain's wording.
## Addressing