File: id-30.c

package info (click to toggle)
gcc-riscv64-unknown-elf 8.3.0.2019.08%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 680,956 kB
  • sloc: ansic: 3,237,715; cpp: 896,882; ada: 772,854; f90: 144,254; asm: 68,788; makefile: 67,456; sh: 29,743; exp: 28,045; objc: 15,273; fortran: 11,885; python: 7,369; pascal: 5,375; awk: 3,725; perl: 2,872; yacc: 316; xml: 311; ml: 285; lex: 198; 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.;
}