File: unroll11.in

package info (click to toggle)
llvm-toolchain-15 1%3A15.0.6-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,554,644 kB
  • sloc: cpp: 5,922,452; ansic: 1,012,136; asm: 674,362; python: 191,568; objc: 73,855; f90: 42,327; lisp: 31,913; pascal: 11,973; javascript: 10,144; sh: 9,421; perl: 7,447; ml: 5,527; awk: 3,523; makefile: 2,520; xml: 885; cs: 573; fortran: 567
file content (10 lines) | stat: -rw-r--r-- 308 bytes parent folder | download | duplicates (50) 
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]}