File: id-30.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A12.2.rel1-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 959,712 kB
  • sloc: cpp: 3,275,382; ansic: 2,061,766; ada: 840,956; f90: 208,513; makefile: 76,132; asm: 73,433; xml: 50,448; exp: 34,146; sh: 32,436; objc: 15,637; fortran: 14,012; python: 11,991; pascal: 6,787; awk: 4,779; perl: 3,054; yacc: 338; ml: 285; lex: 201; haskell: 122
file content (16 lines) | stat: -rw-r--r-- 677 bytes parent folder | download | duplicates (4) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
 
/* The modulo constraints we generate for the niter expression
     (unsinged long)ubound - (unsigned long)lbound
   end up with a modulo that we cannot represent in the expression
   type we are using (int64_t), so we run into the codegen error
   where ISL generates a modulo/divide by sth that doesn't fit the
   type we code-generate with.  Verify we properly elide those.  */

void foo (double *a, long int lbound0, long int ubound0,
	  long int lbound1, long int ubound1, long int stride1)
{
  if (lbound0 < ubound0)
    for (long int i = lbound0; i <= ubound0; ++i)
      if (lbound1 < ubound1)
	for (long int j = lbound1; j <= ubound1; ++j)
	  a[i*stride1 + j] = 0.;
}