| 0..5 |6..10|11..15|16.20|21.....25|26.....30|31| name |
|------|-----|------|-----|---------|---------|--|---------|
| 19 | RT | RA | | XO[0:4] | XO[5:9] |Rc| XL-Form |
-| 19 | RT | RA |imm | imm | NNNNN |im| mv.swiz |
+| 19 | RT | RA |imm | imm | iNNNN |im| mv.swiz |
also f.mv
-this gives an 11 bit immediate across bits 16 to 25 and bit 31. a permutation based encoding should allow the 12 bits to be covered
+this gives an 11 bit immediate across bits 16 to 26 and bit 31. a permutation based encoding should allow the 12 bits to be covered
* 3 bits X
* 3 bits Y
* 0b010 to indicate "constant 1" (or 1.0)
* 0b011 is not needed.
-this "not needed" means the encoding is actually a lot less. the sequences involve expressing how many 0s and 1s are embedded in amongst the XYZWs which gets really interesting.