/haiku-buildtools/cloog/test/ |
H A D | faber.c | 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++) { 18 for (idx6=ceild(-6*idx4+77*1+924,77);idx6<=floord(6*1+72,6);idx6++) { 22 for (idx6=ceild(6*1+73,6);idx6<=-8*(1)+24;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++) { 39 for (idx5=ceild(idx4-83,14);idx5<=-1;idx5++) { 40 for (idx6=max(ceild(12*idx5+252,30),ceild( [all...] |
H A D | equality.c | 3 for (i1=ceild(4*i0,5);i1<=floord(6*i0+20,5);i1++) {
|
H A D | otl.c | 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(10*outerProcTileScatter2+N+3,5)),outerTimeTileScatter+1),outerProcTileScatter1+outerProcTileScatter2+1);innerTimeTileScatter++) { 7 for (innerProcTileScatter1=max(max(max(max(ceild(innerTimeTileScatte [all...] |
H A D | thomasset.c | 9 if (c1 >= ceild(n-2,3)) { 32 if (c1 >= ceild(n-2,3)) { 39 for (c1=ceild(n,3);c1<=floord(2*n,3);c1++) { 42 p = max(ceild(3*c1-j,3),ceild(n-2,3));
|
H A D | otl.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro 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(1 [all...] |
H A D | pouchet.c | 4 for (c1=max(ceild(c0+1,2),c0-1);c1<=min(floord(2*c0+Ny,4),c0);c1++) { 5 if (c0 >= ceild(4*c1-Ny+1,2)) {
|
H A D | sor1d.c | 4 for (rp1=max(max(0,ceild(100*glT1-2*M-N+5,100)),ceild(100*glT1-N-193,300));rp1<=min(min(floord(glT1+1,3),floord(M,100)),glT1);rp1++) { 6 if (rp1 >= max(1,ceild(vT1-N+7,200))) { 9 for (vP1=max(max(1,ceild(vT1-N+5,2)),100*rp1);vP1<=min(min(floord(vT1+2,2),M),100*rp1+99);vP1++) {
|
H A D | thomasset.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro 27 for (p=max(0,ceild(-3*k-1,3));p<=min(floord(-3*k+1,3),0);p++) { 34 for (c1=max(0,ceild(n-4,3));c1<=0;c1++) { 38 for (p=ceild(n-2,3);p<=floord(3*c1-j-3*k+2,3);p++) { 51 for (p=ceild(n-2,3);p<=floord(3*c1-j-3*k+2,3);p++) { 60 for (c1=max(1,ceild(n-4,3));c1<=floord(n-1,3);c1++) { 63 for (p=max(ceild(n-2,3),ceild(3*c1-j-3*k,3));p<=min(floord(3*c1-j-3*k+2,3),floord(n,3));p++) { 76 for (p=max(ceild(n-2,3),ceild( [all...] |
H A D | equality.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro 18 for (i1=ceild(4*i0,5);i1<=floord(6*i0+20,5);i1++) {
|
H A D | vivien2.c | 29 p2 = ceild(-p1+2,4); 42 p2 = ceild(-p1+6,4); 53 for (p2=ceild(-p1+10,4);p2<=min(-1,floord(-p1+2*n,2));p2++) { 103 for (p2=max(1,ceild(p1-2*n-1,2));p2<=floord(p1-3,4);p2++) { 110 p2 = ceild(-p1+2,4); 123 p2 = ceild(-p1+6,4); 134 for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n,2);p2++) { 161 for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) {
|
H A D | 0D-1.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro
|
H A D | 0D-2.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro
|
H A D | 0D-3.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro
|
H A D | basic-bounds-2.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro
|
H A D | basic-bounds-6.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro
|
/haiku-buildtools/cloog/test/reservoir/ |
H A D | pingali5.c | 4 for (c4=ceild(c2+3,2);c4<=M;c4++) { 5 for (i=ceild(c2+1,2);i<=min(c2-1,c4-1);i++) { 12 for (c4=ceild(c2+3,2);c4<=M;c4++) { 13 for (i=ceild(c2+1,2);i<=min(c2-1,c4-1);i++) {
|
H A D | cholesky2.c | 16 for (c4=ceild(c2+2,3);c4<=min(M,c2-2);c4++) { 17 for (c6=ceild(c2-c4+2,2);c6<=min(c4,c2-c4);c6++) { 21 for (c4=ceild(c2+4,3);c4<=min(M,c2);c4++) {
|
H A D | lim-lam3.c | 17 for (c4=max(2,ceild(c2-M-3,4));c4<=min(floord(c2-8,3),M-1);c4++) { 18 for (c6=max(1,ceild(c2-2*c4-M-5,2));c6<=min(floord(c2-3*c4-6,2),c4-1);c6++) { 22 for (c4=max(1,ceild(c2-M-3,4));c4<=floord(c2-4,5);c4++) { 28 for (c4=max(1,ceild(c2-3*M-1,2));c4<=floord(c2-4,5);c4++) {
|
H A D | cholesky2.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro 25 for (c4=ceild(c2+4,3);c4<=min(c2,M);c4++) { 37 for (c4=ceild(c2+2,3);c4<=min(c2-2,M);c4++) { 38 for (c6=ceild(c2-c4+2,2);c6<=min(c2-c4,c4);c6++) { 43 for (c4=ceild(c2+4,3);c4<=min(M,c2);c4++) { 61 for (c4=ceild(c2+2,3);c4<=min(M,c2-2);c4++) { 62 for (c6=ceild(c2-c4+2,2);c6<=min(c2-c4,c4);c6++) {
|
H A D | lim-lam3.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro 27 for (c4=max(1,ceild(c2-M-3,4));c4<=floord(c2-4,5);c4++) { 34 for (c4=max(1,ceild(c2-3*M-1,2));c4<=floord(c2-4,5);c4++) { 42 for (c4=max(2,ceild(c2-M-3,4));c4<=min(M-1,floord(c2-8,3));c4++) { 43 for (c6=max(1,ceild(c2-2*c4-M-5,2));c6<=min(c4-1,floord(c2-3*c4-6,2));c6++) { 48 for (c4=max(ceild(c2-M-3,4),1);c4<=floord(c2-4,5);c4++) { 55 for (c4=max(ceild(c2-3*M-1,2),1);c4<=floord(c2-4,5);c4++) {
|
H A D | pingali5.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro 21 for (c4=ceild(c2+3,2);c4<=M;c4++) { 22 for (i=ceild(c2+1,2);i<=min(c4-1,c2-1);i++) { 31 for (c4=ceild(c2+3,2);c4<=M;c4++) { 32 for (i=ceild(c2+1,2);i<=min(c4-1,c2-1);i++) {
|
/haiku-buildtools/cloog/test/isl/ |
H A D | stride.c | 4 for (c2=max(ceild(2*c1-M+1,4),ceild(4*c1-M-2,4));c2<=min(0,floord(c1,2));c2++) { 7 if ((c2 <= floord(c4-1,4)) && (c2 >= ceild(c4-4,4))) {
|
H A D | stride.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro 20 for (c2=max(ceild(2*c1-M+1,4),ceild(4*c1-M-2,4));c2<=min(0,floord(c1,2));c2++) { 23 if ((c2 <= floord(c4-1,4)) && (c2 >= ceild(c4-4,4))) {
|
/haiku-buildtools/cloog/test/non_optimal/ |
H A D | nul_complex1.c | 4 for (c2=max(ceild(2*c1,3),c1-n);c2<=min(floord(2*c1+2*n,3),c1);c2++) {
|
H A D | nul_complex1.good.c | 6 #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) macro 19 for (c2=max(c1-n,ceild(2*c1,3));c2<=min(c1,floord(2*c1+2*n,3));c2++) {
|