Count matching elements in vector segments
This instruction compares each 8-bit byte element of the first source vector with all of the elements in the corresponding 128-bit segment of the second source vector and places the count of matching elements in the corresponding element of the destination vector. This instruction is unpredicated.
This instruction is illegal when executed in Streaming SVE mode, unless FEAT_SME_FA64 is implemented and enabled.
| 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 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | size | 1 | Zm | 1 | 0 | 1 | 0 | 0 | 0 | Zn | Zd | |||||||||||||
if !IsFeatureImplemented(FEAT_SVE2) then UNDEFINED; if size != '00' then UNDEFINED; constant integer esize = 8; constant integer d = UInt(Zd); constant integer n = UInt(Zn); constant integer m = UInt(Zm);
| <Zd> |
Is the name of the destination scalable vector register, encoded in the "Zd" field. |
| <Zn> |
Is the name of the first source scalable vector register, encoded in the "Zn" field. |
| <Zm> |
Is the name of the second source scalable vector register, encoded in the "Zm" field. |
CheckNonStreamingSVEEnabled(); constant integer VL = CurrentVL; constant integer segments = VL DIV 128; constant integer eltspersegment = 128 DIV esize; constant bits(VL) operand1 = Z[n, VL]; constant bits(VL) operand2 = Z[m, VL]; bits(VL) result; for b = 0 to segments-1 for s = 0 to eltspersegment-1 integer count = 0; constant integer e = eltspersegment * b + s; constant bits(esize) element1 = Elem[operand1, e, esize]; for i = 0 to eltspersegment-1 constant integer e2 = eltspersegment * b + i; constant bits(esize) element2 = Elem[operand2, e2, esize]; if element1 == element2 then count = count + 1; Elem[result, e, esize] = count<esize-1:0>; Z[d, VL] = result;
Internal version only: aarchmrs v2024-03_relA, pseudocode v2024-03_rel, sve v2024-03_rel ; Build timestamp: 2024-03-26T09:45
Copyright © 2010-2024 Arm Limited or its affiliates. All rights reserved. This document is Non-Confidential.