File: unroll11.in

package info (click to toggle)
llvm-toolchain-6.0 1%3A6.0.1-10
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 598,080 kB
  • sloc: cpp: 3,046,253; ansic: 595,057; asm: 271,965; python: 128,926; objc: 106,554; sh: 21,906; lisp: 10,191; pascal: 6,094; ml: 5,544; perl: 5,265; makefile: 2,227; cs: 2,027; xml: 686; php: 212; csh: 117
file content (10 lines) | stat: -rw-r--r-- 308 bytes parent folder | download | duplicates (39) 
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]}