/haiku-buildtools/isl/test_inputs/codegen/cloog/ |
H A D | basic-bounds-5.c | 1 S1(1, floord(M + 1, 2));
|
/haiku-buildtools/cloog/test/ |
H A D | basic-bounds-5.c | 2 j = floord(M+1,2) ;
|
H A D | faber.c | 4 for (idx5=-6;idx5<=floord(idx4-84,14);idx5++) { 5 for (idx6=ceild(12*idx5+252,30);idx6<=floord(6*idx5+72,6);idx6++) { 8 for (idx6=ceild(-6*idx5+90,3);idx6<=floord(3*idx5+144,3);idx6++) { 15 for (idx6=-8*(1);idx6<=floord(-6*idx4+77*1+923,77);idx6++) { 18 for (idx6=ceild(-6*idx4+77*1+924,77);idx6<=floord(6*1+72,6);idx6++) { 25 for (idx6=ceild(-3*idx4+14*1+672,14);idx6<=floord(3*1+144,3);idx6++) { 32 for (idx6=max(ceild(-6*idx4+77*idx5+924,77),-8*idx5+25);idx6<=floord(6*idx5+72,6);idx6++) { 35 for (idx6=ceild(-3*idx4+14*idx5+672,14);idx6<=floord(3*idx5+144,3);idx6++) { 40 for (idx6=max(ceild(12*idx5+252,30),ceild(-6*idx4+77*idx5+924,77));idx6<=floord(6*idx5+72,6);idx6++) { 43 for (idx6=ceild(-3*idx4+14*idx5+672,14);idx6<=floord( [all...] |
H A D | otl.c | 3 for (outerTimeTileScatter=1;outerTimeTileScatter<=floord(2*M+2*N-7,5);outerTimeTileScatter++) { 4 for (outerProcTileScatter1=max(ceild(outerTimeTileScatter,2),ceild(5*outerTimeTileScatter-M-2,5));outerProcTileScatter1<=min(min(floord(M+2*N-5,5),floord(5*outerTimeTileScatter+2*N+1,10)),outerTimeTileScatter);outerProcTileScatter1++) { 5 for (outerProcTileScatter2=max(max(max(max(ceild(outerTimeTileScatter-outerProcTileScatter1-1,2),ceild(5*outerProcTileScatter1-N-1,5)),ceild(5*outerTimeTileScatter-M-N+1,5)),ceild(5*outerTimeTileScatter-N-2,10)),outerTimeTileScatter-outerProcTileScatter1-1);outerProcTileScatter2<=min(min(min(floord(M+N-2,5),floord(5*outerTimeTileScatter-5*outerProcTileScatter1+N+4,5)),floord(5*outerTimeTileScatter+N+3,10)),outerProcTileScatter1);outerProcTileScatter2++) { 6 for (innerTimeTileScatter=max(max(max(ceild(10*outerProcTileScatter1-2*N,5),ceild(10*outerProcTileScatter2-N-2,5)),ceild(5*outerProcTileScatter1+5*outerProcTileScatter2-N-3,5)),outerTimeTileScatter);innerTimeTileScatter<=min(min(min(min(min(floord(2*M+2*N-6,5),floord(5*outerProcTileScatter1+M+3,5)),floord(5*outerProcTileScatter2+M+N,5)),floord(1 [all...] |
H A D | tiling.c | 2 for (ii=0;ii<=floord(n,10);ii++) {
|
H A D | otl.good.c | 5 #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) macro 19 for (outerTimeTileScatter=1;outerTimeTileScatter<=floord(2*M+2*N-7,5);outerTimeTileScatter++) { 20 for (outerProcTileScatter1=max(ceild(outerTimeTileScatter,2),ceild(5*outerTimeTileScatter-M-2,5));outerProcTileScatter1<=min(min(floord(M+2*N-5,5),floord(5*outerTimeTileScatter+2*N+1,10)),outerTimeTileScatter);outerProcTileScatter1++) { 21 for (outerProcTileScatter2=max(max(max(max(max(ceild(outerTimeTileScatter-outerProcTileScatter1-1,2),ceild(5*outerProcTileScatter1-N-1,5)),ceild(5*outerTimeTileScatter-M-N+1,5)),ceild(5*outerTimeTileScatter-N-2,10)),ceild(5*outerTimeTileScatter-N-3,15)),outerTimeTileScatter-outerProcTileScatter1-1);outerProcTileScatter2<=min(min(min(floord(M+N-2,5),floord(5*outerTimeTileScatter-5*outerProcTileScatter1+N+4,5)),floord(5*outerTimeTileScatter+N+3,10)),outerProcTileScatter1);outerProcTileScatter2++) { 22 for (innerTimeTileScatter=max(max(max(ceild(10*outerProcTileScatter1-2*N,5),ceild(10*outerProcTileScatter2-N-2,5)),ceild(5*outerProcTileScatter1+5*outerProcTileScatter2-N-3,5)),outerTimeTileScatter);innerTimeTileScatter<=min(min(min(min(min(floord(2*M+2*N-6,5),floord(5*outerProcTileScatter1+M+3,5)),floord( [all...] |
H A D | vivien2.c | 30 if (p2 <= min(floord(-p1+2*n,2),floord(-p1+5,4))) { 37 for (p3=1;p3<=floord(p1-2*n-2,2);p3++) { 43 if (p2 <= min(floord(-p1+2*n,2),floord(-p1+9,4))) { 53 for (p2=ceild(-p1+10,4);p2<=min(-1,floord(-p1+2*n,2));p2++) { 69 for (p3=1;p3<=floord(p1-2*n-2,2);p3++) { 103 for (p2=max(1,ceild(p1-2*n-1,2));p2<=floord(p1-3,4);p2++) { 111 if (p2 <= min(floord(-p1+2*n,2),floord( [all...] |
H A D | equality.c | 3 for (i1=ceild(4*i0,5);i1<=floord(6*i0+20,5);i1++) {
|
/haiku-buildtools/isl/test_inputs/codegen/omega/ |
H A D | floor_bound-0.c | 1 for (int c0 = 4 * floord(m - 1, 12) + 4; c0 <= floord(n, 3); c0 += 4)
|
H A D | floor_bound-3.c | 1 for (int c0 = 3 * floord(m, 3) + 4 * floord(m, 4); c0 <= n; c0 += 1)
|
H A D | floor_bound-4.c | 1 if (n >= 3 * floord(n + 1, 3)) 2 for (int c0 = m; c0 <= 5 * floord(n + 1, 3); c0 += 1)
|
H A D | floor_bound-6.c | 1 if (m >= 8 * floord(m + 1, 8)) 2 for (int c0 = 4 * floord(m + 1, 32); c0 <= n; c0 += 1)
|
H A D | floor_bound-1.c | 1 for (int c0 = floord(m, 4); c0 <= n; c0 += 1)
|
H A D | floor_bound-2.c | 1 for (int c0 = 4 * floord(m, 4); c0 <= n; c0 += 1)
|
H A D | floor_bound-5.c | 1 for (int c0 = 4 * floord(m, 32); c0 <= n; c0 += 1)
|
H A D | guard1-0.c | 1 if (n + 3 * floord(-n + m - 2, 3) + 2 == m)
|
H A D | guard1-1.c | 1 if (n + 2 * floord(-n + m - 1, 2) + 1 == m)
|
H A D | iter9-0.c | 2 if (8 * floord(7 * exprVar1 + 7, 8) + 8 >= 7 * exprVar1 + c0) { 9 if (8 * floord(7 * exprVar1 + 7, 8) + 8 >= 7 * exprVar1 + c0 || (exprVar1 + 8 * floord(-exprVar1 + c0 - 1, 8) + 1 == c0 && c0 >= exprVar1 + 1))
|
H A D | iter8-0.c | 1 for (int c0 = max(exprVar2 + 8 * floord(-exprVar2 + exprVar1 - 1, 8) + 9, exprVar2 + 1); c0 <= 16; c0 += 8)
|
/haiku-buildtools/isl/test_inputs/codegen/ |
H A D | stride5.c | 1 if (2 * floord(n, 2) == n) 2 for (int c0 = (n + 4 * floord(-n - 1, 4) + 4) / 2; c0 <= 100; c0 += 2)
|
/haiku-buildtools/cloog/test/isl/ |
H A D | jacobi-shared.c | 3 if ((16*floord(t0-1,16) >= -N+g1+t0+1) && (16*floord(N+15*g1+15*t0+15,16) >= 15*g1+15*t0+19) && (32*floord(t1-1,32) <= g2+t1-3) && (32*floord(t1-1,32) >= -N+g2+t1+1)) { 4 for (c0=max(-16*floord(t0-1,16)+t0,-16*floord(g1+t0-3,16)+t0);c0<=min(32,N-g1-1);c0+=16) { 5 c1 = 32*floord(-t1,32)+t1+32;
|
H A D | jacobi-shared.good.c | 5 #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) macro 19 if ((16*floord(g1+t0-3,16) >= -N+g1+t0+1) && (16*floord(N+15*g1+15*t0+15,16) >= 16*g1+15*t0+17) && (floord(t1-1,32) <= floord(g2+t1-3,32)) && (32*floord(t1-1,32) >= -N+g2+t1+1)) { 20 for (c0=max(-16*floord(t0-1,16)+t0,-16*floord(g1+t0-3,16)+t0);c0<=min(32,N-g1-1);c0+=16) { 21 c1 = -32*floord(t1-1,32)+t1;
|
H A D | stride.c | 3 for (c1=-1;c1<=min(2,floord(M+2,4));c1++) { 4 for (c2=max(ceild(2*c1-M+1,4),ceild(4*c1-M-2,4));c2<=min(0,floord(c1,2));c2++) { 6 for (c4=max(3*c3-4*floord(c3+M+1,2)+6,4*c2-c3-4*floord(-c3+1,4)+2);c4<=min(min(4*c2+4,-c3+10),c3-2);c4+=4) { 7 if ((c2 <= floord(c4-1,4)) && (c2 >= ceild(c4-4,4))) {
|
/haiku-buildtools/isl/test_inputs/codegen/pldi2012/ |
H A D | figure8_b.c | 6 if (n >= 4 * floord(n, 4) + 2 && n >= 0)
|
/haiku-buildtools/cloog/test/reservoir/ |
H A D | bastoul3.c | 3 for (j=max(i-6,i-2*floord(i+1,2)+2);j<=min(3,i-2);j+=2) {
|