[gcc r14-1652] testsuite: fix the condition bug in tsvc s176

[gcc r14-1652] testsuite: fix the condition bug in tsvc s176

[Jeff Law]

https://gcc.gnu.org/g:45b7da5f4951c3e9e5187487d611d16ff8cf148f

commit r14-1652-g45b7da5f4951c3e9e5187487d611d16ff8cf148f
Author: Lehua Ding <lehua.ding@rivai.ai>
Date:   Fri Jun 9 07:27:01 2023 -0600

    testsuite: fix the condition bug in tsvc s176
    
    This patch fixes the problem that the loop in the tsvc s176 function is
    optimized and removed because `iterations/LEN_1D` is 0 (where iterations
    is set to 10000, LEN_1D is set to 32000 in tsvc.h).
    
    This testcase passed on x86 and AArch64 system.
    
    Best,
    Lehua
    
    gcc/testsuite/ChangeLog:
    
            * gcc.dg/vect/tsvc/vect-tsvc-s176.c: Adjust iterations.
            * gcc.dg/vect/tsvc/tsvc.h: Adjust expected rsult for s176.

Diff:
---
 gcc/testsuite/gcc.dg/vect/tsvc/tsvc.h           | 2 +-
 gcc/testsuite/gcc.dg/vect/tsvc/vect-tsvc-s176.c | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/gcc/testsuite/gcc.dg/vect/tsvc/tsvc.h b/gcc/testsuite/gcc.dg/vect/tsvc/tsvc.h
index cd39c041903..d910c384fc8 100644
--- a/gcc/testsuite/gcc.dg/vect/tsvc/tsvc.h
+++ b/gcc/testsuite/gcc.dg/vect/tsvc/tsvc.h
@@ -1164,7 +1164,7 @@ real_t get_expected_result(const char * name)
     } else if (!strcmp(name, "s175")) {
 	return 32009.023438f;
     } else if (!strcmp(name, "s176")) {
-	return 32000.f;
+	return 32063.902344f;
     } else if (!strcmp(name, "s211")) {
 	return 63983.308594f;
     } else if (!strcmp(name, "s212")) {
diff --git a/gcc/testsuite/gcc.dg/vect/tsvc/vect-tsvc-s176.c b/gcc/testsuite/gcc.dg/vect/tsvc/vect-tsvc-s176.c
index 79faf7fdb9e..365e5205982 100644
--- a/gcc/testsuite/gcc.dg/vect/tsvc/vect-tsvc-s176.c
+++ b/gcc/testsuite/gcc.dg/vect/tsvc/vect-tsvc-s176.c
@@ -14,7 +14,7 @@ real_t s176(struct args_t * func_args)
     initialise_arrays(__func__);
 
     int m = LEN_1D/2;
-    for (int nl = 0; nl < 4*(iterations/LEN_1D); nl++) {
+    for (int nl = 0; nl < 4*(10*iterations/LEN_1D); nl++) {
         for (int j = 0; j < (LEN_1D/2); j++) {
             for (int i = 0; i < m; i++) {
                 a[i] += b[i+m-j-1] * c[j];
@@ -39,4 +39,4 @@ int main (int argc, char **argv)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump "vectorized 1 loops" "vect" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump "vectorized 1 loops" "vect" } } */