[gcc r15-2866] testsuite: Fix up sse3-addsubps.c

[Jakub Jelinek via Gcc-cvs]

https://gcc.gnu.org/g:9d5c500c4fac9b65c95176d98203ec83b207d39d

commit r15-2866-g9d5c500c4fac9b65c95176d98203ec83b207d39d
Author: Jakub Jelinek <ja...@redhat.com>
Date:   Sat Aug 10 10:49:29 2024 +0200

    testsuite: Fix up sse3-addsubps.c
    
    The testcase uses sizeof (vals) / sizeof (vals) as the number of vals to
    handle (though, handles 8 vals at a time).  That is an obvious typo,
    all similar testcases use sizeof (vals) / sizeof (vals[0]) properly.
    
    2024-08-10  Jakub Jelinek  <ja...@redhat.com>
    
            * gcc.target/powerpc/sse3-addsubps.c (TEST): Divide by
            sizeof (vals[0]) rather than sizeof (vals).

Diff:
---
 gcc/testsuite/gcc.target/powerpc/sse3-addsubps.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/gcc/testsuite/gcc.target/powerpc/sse3-addsubps.c 
b/gcc/testsuite/gcc.target/powerpc/sse3-addsubps.c
index b341ba8e74b5..ab20448436a9 100644
--- a/gcc/testsuite/gcc.target/powerpc/sse3-addsubps.c
+++ b/gcc/testsuite/gcc.target/powerpc/sse3-addsubps.c
@@ -77,7 +77,7 @@ TEST (void)
   int i;
   int fail = 0;
 
-  for (i = 0; i < sizeof (vals) / sizeof (vals); i += 8)
+  for (i = 0; i < sizeof (vals) / sizeof (vals[0]); i += 8)
     {
       p1[0] = vals[i+0];
       p1[1] = vals[i+1];