File: carry_bounded_coefficients.sc

package info (click to toggle)
llvm-toolchain-14 1%3A14.0.6-12
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,496,180 kB
  • sloc: cpp: 5,593,972; ansic: 986,872; asm: 585,869; python: 184,223; objc: 72,530; lisp: 31,119; f90: 27,793; javascript: 9,780; pascal: 9,762; sh: 9,482; perl: 7,468; ml: 5,432; awk: 3,523; makefile: 2,538; xml: 953; cs: 573; fortran: 567
file content (19 lines) | stat: -rw-r--r-- 1,034 bytes parent folder | download | duplicates (37) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
# Check that the dependence carrying step is not confused by
# a bound on the coefficient size.
# In particular, force the scheduler to move to a dependence carrying
# step by demanding outer coincidence and bound the size of
# the coefficients.  Earlier versions of isl would take this
# bound into account while carrying dependences, breaking
# fundamental assumptions.
# On the other hand, the dependence carrying step now tries
# to prevent loop coalescing by default, so check that indeed
# no loop coalescing occurs by comparing the computed schedule
# to the expected non-coalescing schedule.
# OPTIONS: --schedule-outer-coincidence --schedule-max-coefficient=20
domain: { C[i0, i1] : 2 <= i0 <= 3999 and 0 <= i1 <= -1 + i0 }
validity: { C[i0, i1] -> C[i0, 1 + i1] : i0 <= 3999 and i1 >= 0 and
						i1 <= -2 + i0;
		C[i0, -1 + i0] -> C[1 + i0, 0] : i0 <= 3998 and i0 >= 1 }
coincidence: { C[i0, i1] -> C[i0, 1 + i1] : i0 <= 3999 and i1 >= 0 and
						i1 <= -2 + i0;
		C[i0, -1 + i0] -> C[1 + i0, 0] : i0 <= 3998 and i0 >= 1 }