71  * When considering the ZA storage as an array of elements of
321  * Clear elements in a tile slice comprising len bytes.
367  * Copy elements from an array into a tile slice comprising len bytes.
547     /* Find the active elements.  */  in DO_LD()
557     /* Handle watchpoints for all active elements. */  in DO_LD()
562      * Handle mte checks for all active elements.  in DO_LD()
749     /* Find the active elements.  */  in DO_LD()
758     /* Handle watchpoints for all active elements. */  in DO_LD()
763      * Handle mte checks for all active elements.  in DO_LD()
1379     intptr_t elements = oprsz / sizeof(float32);  in HELPER()  local
1380     intptr_t eltspersegment = MIN(4, elements);  in HELPER()
1391     for (i = 0; i < elements; i += eltspersegment) {  in HELPER()
1404     intptr_t elements = oprsz / sizeof(float32);  in HELPER()  local
1405     intptr_t eltspersegment = MIN(4, elements);  in HELPER()
1419     for (i = 0; i < elements; i += eltspersegment) {  in HELPER()
1568     /* Apply P to N as a mask, making the inactive elements 0. */           \
1581     /* Apply P to N as a mask, making the inactive elements 0. */           \
1633     /* Apply P to N as a mask, making the inactive elements 0. */           \  in DEF_IMOPH()
1650     intptr_t elements = svl / sizeof(TYPED);                              \
1660         for (intptr_t seg = 0; seg < elements; seg += eltperseg) {        \
1691     intptr_t elements = simd_oprsz(desc) / sizeof(TYPEW);       \
1694     for (intptr_t i = 0; i < elements; ++i) {                   \
1718     intptr_t elements = simd_oprsz(desc) / sizeof(TYPEW);       \
1723     for (intptr_t i = 0; i < elements; i += eltspersegment) {   \
2289     size_t elements = simd_oprsz(desc) / sizeof(TYPE);          \
2292     for (size_t e = 0; e < elements; e++) {                     \
2322     size_t elements = simd_oprsz(desc) / sizeof(TYPE);          \
2325     for (size_t e = 0; e < elements; e++) {                     \
2346     int elements = vl / sizeof(uint8_t);  local
2355                 int split = p.count - r * elements;
2359                 } else if (elements <= split) {
2365                     for (int e = split; e < elements; e++) {
2375                 int split = p.count - r * elements;
2379                 } else if (elements <= split) {
2385                     for (int e = split; e < elements; e++) {
2398                 int split = p.count - r * elements;
2401                 for (; e < MIN(split, elements); e++) {
2404                 for (; e < elements; e += estride) {
2416                 int split = p.count - r * elements;
2419                 for (; e < MIN(split, elements); e += estride) {
2425                 for (; e < elements; e++) {
2438     int elements = vl / sizeof(uint16_t);  in HELPER()  local
2447                 int split = p.count - r * elements;  in HELPER()
2451                 } else if (elements <= split) {  in HELPER()
2457                     for (int e = split; e < elements; e++) {  in HELPER()
2467                 int split = p.count - r * elements;  in HELPER()
2471                 } else if (elements <= split) {  in HELPER()
2477                     for (int e = split; e < elements; e++) {  in HELPER()
2490                 int split = p.count - r * elements;  in HELPER()
2493                 for (; e < MIN(split, elements); e++) {  in HELPER()
2496                 for (; e < elements; e += estride) {  in HELPER()
2508                 int split = p.count - r * elements;  in HELPER()
2511                 for (; e < MIN(split, elements); e += estride) {  in HELPER()
2517                 for (; e < elements; e++) {  in HELPER()
2530     int elements = vl / sizeof(uint32_t);  in HELPER()  local
2539                 int split = p.count - r * elements;  in HELPER()
2543                 } else if (elements <= split) {  in HELPER()
2549                     for (int e = split; e < elements; e++) {  in HELPER()
2559                 int split = p.count - r * elements;  in HELPER()
2563                 } else if (elements <= split) {  in HELPER()
2569                     for (int e = split; e < elements; e++) {  in HELPER()
2582                 int split = p.count - r * elements;  in HELPER()
2585                 for (; e < MIN(split, elements); e++) {  in HELPER()
2588                 for (; e < elements; e += 2) {  in HELPER()
2598                 int split = p.count - r * elements;  in HELPER()
2601                 for (; e < MIN(split, elements); e += 2) {  in HELPER()
2605                 for (; e < elements; e++) {  in HELPER()
2618     int elements = vl / sizeof(uint64_t);  in HELPER()  local
2626             int split = p.count - r * elements;  in HELPER()
2630             } else if (elements <= split) {  in HELPER()
2635                        (elements - split) * sizeof(uint64_t));  in HELPER()
2643             int split = p.count - r * elements;  in HELPER()
2647             } else if (elements <= split) {  in HELPER()
2652                        (elements - split) * sizeof(uint64_t));  in HELPER()