[Bug tree-optimization/120647] [X86] Sub optimal code generated for counting the number matches between two array elements

[vekumar at gcc dot gnu.org via Gcc-bugs]

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=120647

--- Comment #2 from vekumar at gcc dot gnu.org ---
Another case:

#define RANK2 9

int count_nonzero_row(const int A[RANK2][RANK2], int row)
{
        int c = 0;
        for (int k = 0; k < RANK2; k++)
                c += (A[row][k] != 0);
        return c;
}

ICX is able to optimize it using popcntl

https://godbolt.org/z/jaosaqvcj