You copied the Doc URL to your clipboard.
REV (predicate)
Reverse all elements in a predicate.
Reverse the order of all elements in the source predicate and place in the destination predicate. This instruction is unpredicated.
31 | 30 | 29 | 28 | 27 | 26 | 25 | 24 | 23 | 22 | 21 | 20 | 19 | 18 | 17 | 16 | 15 | 14 | 13 | 12 | 11 | 10 | 9 | 8 | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | size | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | Pn | 0 | Pd |
if !HaveSVE() then UNDEFINED; integer esize = 8 << UInt(size); integer n = UInt(Pn); integer d = UInt(Pd);
Assembler Symbols
<Pd> |
Is the name of the destination scalable predicate register, encoded in the "Pd" field. |
<T> |
Is the size specifier,
encoded in
size:
|
<Pn> |
Is the name of the source scalable predicate register, encoded in the "Pn" field. |
Operation
CheckSVEEnabled(); bits(PL) operand = P[n]; bits(PL) result = Reverse(operand, esize DIV 8); P[d] = result;
Operational information
If PSTATE.DIT is 1:
- The execution time of this instruction is independent of:
- The values of the data supplied in any of its registers.
- The values of the NZCV flags.
- The response of this instruction to asynchronous exceptions does not vary based on:
- The values of the data supplied in any of its registers.
- The values of the NZCV flags.