File: unroll11.in

package info (click to toggle)
llvm-toolchain-20 1%3A20.1.8-1
  • links: PTS, VCS
  • area: main
  • in suites: experimental
  • size: 2,111,696 kB
  • sloc: cpp: 7,438,781; ansic: 1,393,871; asm: 1,012,926; python: 241,771; f90: 86,635; objc: 75,411; lisp: 42,144; pascal: 17,286; sh: 8,596; ml: 5,082; perl: 4,730; makefile: 3,591; awk: 3,523; javascript: 2,251; xml: 892; fortran: 672
file content (10 lines) | stat: -rw-r--r-- 308 bytes parent folder | download | duplicates (41) 
1
2
3
4
5
6
7
8
9
10
 
# Check that the most appropriate lower bound is selected
[t1,t2]->{ S[i,j] -> [i,j] : exists (alpha, beta :
    0 <= i <= 1 &&
    t1 = j+128alpha &&
    0 <= j+2beta < 128 &&
    510 <= t2+2beta <= 514 &&
    0 <= 2beta - t2 <= 5
)}
[t1,t2] -> {: 125 <= t1 <= 127 and 254 <= t2 < 257}
{[i,j] -> unroll[x]}