You copied the Doc URL to your clipboard.

## WHILELE

While incrementing signed scalar less than or equal to scalar.

Generate a predicate that starting from the lowest numbered element is true while the incrementing value of the first, signed scalar operand is less than or equal to the second scalar operand and false thereafter up to the highest numbered element.

If the second scalar operand is equal to the maximum signed integer value then a condition which includes an equality test can never fail and the result will be an all-true predicate.

The full width of the scalar operands is significant for the purposes of comparison, and the full width first operand is incremented by one for each destination predicate element, irrespective of the predicate result element size. The first general-purpose source register is not itself updated.

The predicate result is placed in the predicate destination register. Sets the First (N), None (Z), !Last (C) condition flags based on the predicate result, and the V flag to zero.

 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 1 0 0 1 0 1 size 1 Rm 0 0 0 sf 0 1 Rn 1 Pd

#### SVE

WHILELE <Pd>.<T>, <R><n>, <R><m>

```if !HaveSVE() then UNDEFINED;
integer esize = 8 << UInt(size);
integer rsize = 32 << UInt(sf);
integer n = UInt(Rn);
integer m = UInt(Rm);
integer d = UInt(Pd);
boolean unsigned = FALSE;
SVECmp op = Cmp_LE;```

### Assembler Symbols

 Is the name of the destination scalable predicate register, encoded in the "Pd" field.
<T> Is the size specifier, encoded in size:
size <T>
00 B
01 H
10 S
11 D
<R> Is a width specifier, encoded in sf:
sf <R>
0 W
1 X
 Is the number [0-30] of the source general-purpose register or the name ZR (31), encoded in the "Rn" field.
 Is the number [0-30] of the source general-purpose register or the name ZR (31), encoded in the "Rm" field.

### Operation

```CheckSVEEnabled();
integer elements = VL DIV esize;
bits(rsize) operand1 = X[n];
bits(rsize) operand2 = X[m];
bits(PL) result;
boolean last = TRUE;

for e = 0 to elements-1
boolean cond;
case op of
when Cmp_LT cond = (Int(operand1, unsigned) <  Int(operand2, unsigned));
when Cmp_LE cond = (Int(operand1, unsigned) <= Int(operand2, unsigned));

last = last && cond;
ElemP[result, e, esize] = if last then '1' else '0';
operand1 = operand1 + 1;